( function webpackUniversalModuleDefinition ( root , factory ) {
if ( typeof exports === 'object' && typeof module === 'object' )
module . exports = factory ( ) ;
else if ( typeof define === 'function' && define . amd )
define ( [ ] , factory ) ;
else if ( typeof exports === 'object' )
exports [ "SentenTree" ] = factory ( ) ;
else
root [ "SentenTree" ] = factory ( ) ;
} ) ( this , function ( ) {
return /******/ ( 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 ;
/******/ // identity function for calling harmony imports with the correct context
/******/
_ _webpack _require _ _ . i = function ( value ) { return value ; } ;
/******/ // define getter function for harmony exports
/******/
_ _webpack _require _ _ . d = function ( exports , name , getter ) {
/******/
if ( ! _ _webpack _require _ _ . o ( exports , name ) ) {
/******/
Object . defineProperty ( exports , name , {
/******/
configurable : false ,
/******/
enumerable : true ,
/******/
get : getter
/******/
} ) ;
/******/
}
/******/
} ;
/******/ // 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 = 140 ) ;
/******/
} )
/************************************************************************/
/******/
( [
/* 0 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _select _ _ = _ _webpack _require _ _ ( 105 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _selectAll _ _ = _ _webpack _require _ _ ( 106 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _filter _ _ = _ _webpack _require _ _ ( 94 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _data _ _ = _ _webpack _require _ _ ( 88 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _enter _ _ = _ _webpack _require _ _ ( 38 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _exit _ _ = _ _webpack _require _ _ ( 93 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _merge _ _ = _ _webpack _require _ _ ( 98 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _order _ _ = _ _webpack _require _ _ ( 101 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _8 _ _sort _ _ = _ _webpack _require _ _ ( 108 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _9 _ _call _ _ = _ _webpack _require _ _ ( 86 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _10 _ _nodes _ _ = _ _webpack _require _ _ ( 100 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _11 _ _node _ _ = _ _webpack _require _ _ ( 99 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _12 _ _size _ _ = _ _webpack _require _ _ ( 107 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _13 _ _empty _ _ = _ _webpack _require _ _ ( 92 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _14 _ _each _ _ = _ _webpack _require _ _ ( 91 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _15 _ _attr _ _ = _ _webpack _require _ _ ( 85 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _16 _ _style _ _ = _ _webpack _require _ _ ( 109 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _17 _ _property _ _ = _ _webpack _require _ _ ( 102 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _18 _ _classed _ _ = _ _webpack _require _ _ ( 87 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _19 _ _text _ _ = _ _webpack _require _ _ ( 110 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _20 _ _html _ _ = _ _webpack _require _ _ ( 95 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _21 _ _raise _ _ = _ _webpack _require _ _ ( 103 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _22 _ _lower _ _ = _ _webpack _require _ _ ( 97 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _23 _ _append _ _ = _ _webpack _require _ _ ( 84 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _24 _ _insert _ _ = _ _webpack _require _ _ ( 96 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _25 _ _remove _ _ = _ _webpack _require _ _ ( 104 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _26 _ _datum _ _ = _ _webpack _require _ _ ( 89 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _27 _ _on _ _ = _ _webpack _require _ _ ( 18 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _28 _ _dispatch _ _ = _ _webpack _require _ _ ( 90 ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "c" , function ( ) { return root ; } ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = Selection ;
var root = [ null ] ;
function Selection ( groups , parents ) {
this . _groups = groups ;
this . _parents = parents ;
}
function selection ( ) {
return new Selection ( [
[ document . documentElement ]
] , root ) ;
}
Selection . prototype = selection . prototype = {
constructor : Selection ,
select : _ _WEBPACK _IMPORTED _MODULE _0 _ _select _ _ [ "a" /* default */ ] ,
selectAll : _ _WEBPACK _IMPORTED _MODULE _1 _ _selectAll _ _ [ "a" /* default */ ] ,
filter : _ _WEBPACK _IMPORTED _MODULE _2 _ _filter _ _ [ "a" /* default */ ] ,
data : _ _WEBPACK _IMPORTED _MODULE _3 _ _data _ _ [ "a" /* default */ ] ,
enter : _ _WEBPACK _IMPORTED _MODULE _4 _ _enter _ _ [ "a" /* default */ ] ,
exit : _ _WEBPACK _IMPORTED _MODULE _5 _ _exit _ _ [ "a" /* default */ ] ,
merge : _ _WEBPACK _IMPORTED _MODULE _6 _ _merge _ _ [ "a" /* default */ ] ,
order : _ _WEBPACK _IMPORTED _MODULE _7 _ _order _ _ [ "a" /* default */ ] ,
sort : _ _WEBPACK _IMPORTED _MODULE _8 _ _sort _ _ [ "a" /* default */ ] ,
call : _ _WEBPACK _IMPORTED _MODULE _9 _ _call _ _ [ "a" /* default */ ] ,
nodes : _ _WEBPACK _IMPORTED _MODULE _10 _ _nodes _ _ [ "a" /* default */ ] ,
node : _ _WEBPACK _IMPORTED _MODULE _11 _ _node _ _ [ "a" /* default */ ] ,
size : _ _WEBPACK _IMPORTED _MODULE _12 _ _size _ _ [ "a" /* default */ ] ,
empty : _ _WEBPACK _IMPORTED _MODULE _13 _ _empty _ _ [ "a" /* default */ ] ,
each : _ _WEBPACK _IMPORTED _MODULE _14 _ _each _ _ [ "a" /* default */ ] ,
attr : _ _WEBPACK _IMPORTED _MODULE _15 _ _attr _ _ [ "a" /* default */ ] ,
style : _ _WEBPACK _IMPORTED _MODULE _16 _ _style _ _ [ "a" /* default */ ] ,
property : _ _WEBPACK _IMPORTED _MODULE _17 _ _property _ _ [ "a" /* default */ ] ,
classed : _ _WEBPACK _IMPORTED _MODULE _18 _ _classed _ _ [ "a" /* default */ ] ,
text : _ _WEBPACK _IMPORTED _MODULE _19 _ _text _ _ [ "a" /* default */ ] ,
html : _ _WEBPACK _IMPORTED _MODULE _20 _ _html _ _ [ "a" /* default */ ] ,
raise : _ _WEBPACK _IMPORTED _MODULE _21 _ _raise _ _ [ "a" /* default */ ] ,
lower : _ _WEBPACK _IMPORTED _MODULE _22 _ _lower _ _ [ "a" /* default */ ] ,
append : _ _WEBPACK _IMPORTED _MODULE _23 _ _append _ _ [ "a" /* default */ ] ,
insert : _ _WEBPACK _IMPORTED _MODULE _24 _ _insert _ _ [ "a" /* default */ ] ,
remove : _ _WEBPACK _IMPORTED _MODULE _25 _ _remove _ _ [ "a" /* default */ ] ,
datum : _ _WEBPACK _IMPORTED _MODULE _26 _ _datum _ _ [ "a" /* default */ ] ,
on : _ _WEBPACK _IMPORTED _MODULE _27 _ _on _ _ [ "c" /* default */ ] ,
dispatch : _ _WEBPACK _IMPORTED _MODULE _28 _ _dispatch _ _ [ "a" /* default */ ]
} ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = selection ;
/***/
} ) ,
/* 1 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _dispatch _ _ = _ _webpack _require _ _ ( 29 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _d3 _timer _ _ = _ _webpack _require _ _ ( 41 ) ;
/* unused harmony export CREATED */
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "d" , function ( ) { return SCHEDULED ; } ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return STARTING ; } ) ;
/* unused harmony export STARTED */
/* unused harmony export RUNNING */
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return ENDING ; } ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "c" , function ( ) { return ENDED ; } ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "g" ] = init ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "e" ] = set ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "f" ] = get ;
var emptyOn = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _dispatch _ _ [ "dispatch" ] ) ( "start" , "end" , "interrupt" ) ;
var emptyTween = [ ] ;
var CREATED = 0 ;
var SCHEDULED = 1 ;
var STARTING = 2 ;
var STARTED = 3 ;
var RUNNING = 4 ;
var ENDING = 5 ;
var ENDED = 6 ;
/* harmony default export */
_ _webpack _exports _ _ [ "h" ] = function ( node , name , id , index , group , timing ) {
var schedules = node . _ _transition ;
if ( ! schedules ) node . _ _transition = { } ;
else if ( id in schedules ) return ;
create ( node , id , {
name : name ,
index : index , // For context during callback.
group : group , // For context during callback.
on : emptyOn ,
tween : emptyTween ,
time : timing . time ,
delay : timing . delay ,
duration : timing . duration ,
ease : timing . ease ,
timer : null ,
state : CREATED
} ) ;
} ;
function init ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) || schedule . state > CREATED ) throw new Error ( "too late" ) ;
return schedule ;
}
function set ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) || schedule . state > STARTING ) throw new Error ( "too late" ) ;
return schedule ;
}
function get ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) ) throw new Error ( "too late" ) ;
return schedule ;
}
function create ( node , id , self ) {
var schedules = node . _ _transition ,
tween ;
// Initialize the self timer when the transition is created.
// Note the actual delay is not known until the first callback!
schedules [ id ] = self ;
self . timer = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _timer _ _ [ "a" /* timer */ ] ) ( schedule , 0 , self . time ) ;
function schedule ( elapsed ) {
self . state = SCHEDULED ;
self . timer . restart ( start , self . delay , self . time ) ;
// If the elapsed delay is less than our first sleep, start immediately.
if ( self . delay <= elapsed ) start ( elapsed - self . delay ) ;
}
function start ( elapsed ) {
var i , j , n , o ;
// If the state is not SCHEDULED, then we previously errored on start.
if ( self . state !== SCHEDULED ) return stop ( ) ;
for ( i in schedules ) {
o = schedules [ i ] ;
if ( o . name !== self . name ) continue ;
// While this element already has a starting transition during this frame,
// defer starting an interrupting transition until that transition has a
// chance to tick (and possibly end); see d3/d3-transition#54!
if ( o . state === STARTED ) return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _timer _ _ [ "b" /* timeout */ ] ) ( start ) ;
// Interrupt the active transition, if any.
// Dispatch the interrupt event.
if ( o . state === RUNNING ) {
o . state = ENDED ;
o . timer . stop ( ) ;
o . on . call ( "interrupt" , node , node . _ _data _ _ , o . index , o . group ) ;
delete schedules [ i ] ;
}
// Cancel any pre-empted transitions. No interrupt event is dispatched
// because the cancelled transitions never started. Note that this also
// removes this transition from the pending list!
else if ( + i < id ) {
o . state = ENDED ;
o . timer . stop ( ) ;
delete schedules [ i ] ;
}
}
// Defer the first tick to end of the current frame; see d3/d3#1576.
// Note the transition may be canceled after start and before the first tick!
// Note this must be scheduled before the start event; see d3/d3-transition#16!
// Assuming this is successful, subsequent callbacks go straight to tick.
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _timer _ _ [ "b" /* timeout */ ] ) ( function ( ) {
if ( self . state === STARTED ) {
self . state = RUNNING ;
self . timer . restart ( tick , self . delay , self . time ) ;
tick ( elapsed ) ;
}
} ) ;
// Dispatch the start event.
// Note this must be done before the tween are initialized.
self . state = STARTING ;
self . on . call ( "start" , node , node . _ _data _ _ , self . index , self . group ) ;
if ( self . state !== STARTING ) return ; // interrupted
self . state = STARTED ;
// Initialize the tween, deleting null tween.
tween = new Array ( n = self . tween . length ) ;
for ( i = 0 , j = - 1 ; i < n ; ++ i ) {
if ( o = self . tween [ i ] . value . call ( node , node . _ _data _ _ , self . index , self . group ) ) {
tween [ ++ j ] = o ;
}
}
tween . length = j + 1 ;
}
function tick ( elapsed ) {
var t = elapsed < self . duration ? self . ease . call ( null , elapsed / self . duration ) : ( self . timer . restart ( stop ) , self . state = ENDING , 1 ) ,
i = - 1 ,
n = tween . length ;
while ( ++ i < n ) {
tween [ i ] . call ( null , t ) ;
}
// Dispatch the end event.
if ( self . state === ENDING ) {
self . on . call ( "end" , node , node . _ _data _ _ , self . index , self . group ) ;
stop ( ) ;
}
}
function stop ( ) {
self . state = ENDED ;
self . timer . stop ( ) ;
delete schedules [ id ] ;
for ( var i in schedules ) return ; // eslint-disable-line no-unused-vars
delete node . _ _transition ;
}
}
/***/
} ) ,
/* 2 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( _ _webpack _exports _ _ , "__esModule" , { value : true } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _creator _ _ = _ _webpack _require _ _ ( 14 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "creator" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _creator _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _local _ _ = _ _webpack _require _ _ ( 80 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "local" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _1 _ _src _local _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _matcher _ _ = _ _webpack _require _ _ ( 37 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "matcher" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _2 _ _src _matcher _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _src _mouse _ _ = _ _webpack _require _ _ ( 81 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "mouse" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _3 _ _src _mouse _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _src _namespace _ _ = _ _webpack _require _ _ ( 15 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "namespace" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _4 _ _src _namespace _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _src _namespaces _ _ = _ _webpack _require _ _ ( 16 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "namespaces" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _5 _ _src _namespaces _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _src _select _ _ = _ _webpack _require _ _ ( 82 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "select" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _6 _ _src _select _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _src _selectAll _ _ = _ _webpack _require _ _ ( 83 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "selectAll" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _7 _ _src _selectAll _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _8 _ _src _selection _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "selection" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _8 _ _src _selection _index _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _9 _ _src _selector _ _ = _ _webpack _require _ _ ( 19 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "selector" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _9 _ _src _selector _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _10 _ _src _selectorAll _ _ = _ _webpack _require _ _ ( 40 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "selectorAll" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _10 _ _src _selectorAll _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _11 _ _src _touch _ _ = _ _webpack _require _ _ ( 111 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "touch" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _11 _ _src _touch _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _12 _ _src _touches _ _ = _ _webpack _require _ _ ( 112 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "touches" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _12 _ _src _touches _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _13 _ _src _window _ _ = _ _webpack _require _ _ ( 21 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "window" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _13 _ _src _window _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _14 _ _src _selection _on _ _ = _ _webpack _require _ _ ( 18 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "event" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _14 _ _src _selection _on _ _ [ "a" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "customEvent" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _14 _ _src _selection _on _ _ [ "b" ] ; } ) ;
/***/
} ) ,
/* 3 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _attr _ _ = _ _webpack _require _ _ ( 120 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _attrTween _ _ = _ _webpack _require _ _ ( 121 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _delay _ _ = _ _webpack _require _ _ ( 122 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _duration _ _ = _ _webpack _require _ _ ( 123 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _ease _ _ = _ _webpack _require _ _ ( 124 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _filter _ _ = _ _webpack _require _ _ ( 125 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _merge _ _ = _ _webpack _require _ _ ( 126 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _8 _ _on _ _ = _ _webpack _require _ _ ( 127 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _9 _ _remove _ _ = _ _webpack _require _ _ ( 128 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _10 _ _select _ _ = _ _webpack _require _ _ ( 129 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _11 _ _selectAll _ _ = _ _webpack _require _ _ ( 130 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _12 _ _selection _ _ = _ _webpack _require _ _ ( 131 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _13 _ _style _ _ = _ _webpack _require _ _ ( 132 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _14 _ _styleTween _ _ = _ _webpack _require _ _ ( 133 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _15 _ _text _ _ = _ _webpack _require _ _ ( 134 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _16 _ _transition _ _ = _ _webpack _require _ _ ( 135 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _17 _ _tween _ _ = _ _webpack _require _ _ ( 8 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = Transition ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = transition ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "c" ] = newId ;
var id = 0 ;
function Transition ( groups , parents , name , id ) {
this . _groups = groups ;
this . _parents = parents ;
this . _name = name ;
this . _id = id ;
}
function transition ( name ) {
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selection" ] ) ( ) . transition ( name ) ;
}
function newId ( ) {
return ++ id ;
}
var selection _prototype = _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selection" ] . prototype ;
Transition . prototype = transition . prototype = {
constructor : Transition ,
select : _ _WEBPACK _IMPORTED _MODULE _10 _ _select _ _ [ "a" /* default */ ] ,
selectAll : _ _WEBPACK _IMPORTED _MODULE _11 _ _selectAll _ _ [ "a" /* default */ ] ,
filter : _ _WEBPACK _IMPORTED _MODULE _6 _ _filter _ _ [ "a" /* default */ ] ,
merge : _ _WEBPACK _IMPORTED _MODULE _7 _ _merge _ _ [ "a" /* default */ ] ,
selection : _ _WEBPACK _IMPORTED _MODULE _12 _ _selection _ _ [ "a" /* default */ ] ,
transition : _ _WEBPACK _IMPORTED _MODULE _16 _ _transition _ _ [ "a" /* default */ ] ,
call : selection _prototype . call ,
nodes : selection _prototype . nodes ,
node : selection _prototype . node ,
size : selection _prototype . size ,
empty : selection _prototype . empty ,
each : selection _prototype . each ,
on : _ _WEBPACK _IMPORTED _MODULE _8 _ _on _ _ [ "a" /* default */ ] ,
attr : _ _WEBPACK _IMPORTED _MODULE _1 _ _attr _ _ [ "a" /* default */ ] ,
attrTween : _ _WEBPACK _IMPORTED _MODULE _2 _ _attrTween _ _ [ "a" /* default */ ] ,
style : _ _WEBPACK _IMPORTED _MODULE _13 _ _style _ _ [ "a" /* default */ ] ,
styleTween : _ _WEBPACK _IMPORTED _MODULE _14 _ _styleTween _ _ [ "a" /* default */ ] ,
text : _ _WEBPACK _IMPORTED _MODULE _15 _ _text _ _ [ "a" /* default */ ] ,
remove : _ _WEBPACK _IMPORTED _MODULE _9 _ _remove _ _ [ "a" /* default */ ] ,
tween : _ _WEBPACK _IMPORTED _MODULE _17 _ _tween _ _ [ "a" /* default */ ] ,
delay : _ _WEBPACK _IMPORTED _MODULE _3 _ _delay _ _ [ "a" /* default */ ] ,
duration : _ _WEBPACK _IMPORTED _MODULE _4 _ _duration _ _ [ "a" /* default */ ] ,
ease : _ _WEBPACK _IMPORTED _MODULE _5 _ _ease _ _ [ "a" /* default */ ]
} ;
/***/
} ) ,
/* 4 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _color _ _ = _ _webpack _require _ _ ( 9 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _color _ _ [ "a" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "f" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _color _ _ [ "h" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "e" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _color _ _ [ "g" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _lab _ _ = _ _webpack _require _ _ ( 56 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "d" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _1 _ _src _lab _ _ [ "b" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "c" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _1 _ _src _lab _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _cubehelix _ _ = _ _webpack _require _ _ ( 55 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _2 _ _src _cubehelix _ _ [ "a" ] ; } ) ;
/***/
} ) ,
/* 5 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
/* WEBPACK VAR INJECTION */
( function ( global , module ) {
var _ _WEBPACK _AMD _DEFINE _RESULT _ _ ;
/ * *
* @ license
* Lodash < https : //lodash.com/>
* Copyright JS Foundation and other contributors < https : //js.foundation/>
* Released under MIT license < https : //lodash.com/license>
* Based on Underscore . js 1.8 . 3 < http : //underscorejs.org/LICENSE>
* Copyright Jeremy Ashkenas , DocumentCloud and Investigative Reporters & Editors
* /
;
( function ( ) {
/** Used as a safe reference for `undefined` in pre-ES5 environments. */
var undefined ;
/** Used as the semantic version number. */
var VERSION = '4.17.4' ;
/** Used as the size to enable large array optimizations. */
var LARGE _ARRAY _SIZE = 200 ;
/** Error message constants. */
var CORE _ERROR _TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.' ,
FUNC _ERROR _TEXT = 'Expected a function' ;
/** Used to stand-in for `undefined` hash values. */
var HASH _UNDEFINED = '__lodash_hash_undefined__' ;
/** Used as the maximum memoize cache size. */
var MAX _MEMOIZE _SIZE = 500 ;
/** Used as the internal argument placeholder. */
var PLACEHOLDER = '__lodash_placeholder__' ;
/** Used to compose bitmasks for cloning. */
var CLONE _DEEP _FLAG = 1 ,
CLONE _FLAT _FLAG = 2 ,
CLONE _SYMBOLS _FLAG = 4 ;
/** Used to compose bitmasks for value comparisons. */
var COMPARE _PARTIAL _FLAG = 1 ,
COMPARE _UNORDERED _FLAG = 2 ;
/** Used to compose bitmasks for function metadata. */
var WRAP _BIND _FLAG = 1 ,
WRAP _BIND _KEY _FLAG = 2 ,
WRAP _CURRY _BOUND _FLAG = 4 ,
WRAP _CURRY _FLAG = 8 ,
WRAP _CURRY _RIGHT _FLAG = 16 ,
WRAP _PARTIAL _FLAG = 32 ,
WRAP _PARTIAL _RIGHT _FLAG = 64 ,
WRAP _ARY _FLAG = 128 ,
WRAP _REARG _FLAG = 256 ,
WRAP _FLIP _FLAG = 512 ;
/** Used as default options for `_.truncate`. */
var DEFAULT _TRUNC _LENGTH = 30 ,
DEFAULT _TRUNC _OMISSION = '...' ;
/** Used to detect hot functions by number of calls within a span of milliseconds. */
var HOT _COUNT = 800 ,
HOT _SPAN = 16 ;
/** Used to indicate the type of lazy iteratees. */
var LAZY _FILTER _FLAG = 1 ,
LAZY _MAP _FLAG = 2 ,
LAZY _WHILE _FLAG = 3 ;
/** Used as references for various `Number` constants. */
var INFINITY = 1 / 0 ,
MAX _SAFE _INTEGER = 9007199254740991 ,
MAX _INTEGER = 1.7976931348623157 e + 308 ,
NAN = 0 / 0 ;
/** Used as references for the maximum length and index of an array. */
var MAX _ARRAY _LENGTH = 4294967295 ,
MAX _ARRAY _INDEX = MAX _ARRAY _LENGTH - 1 ,
HALF _MAX _ARRAY _LENGTH = MAX _ARRAY _LENGTH >>> 1 ;
/** Used to associate wrap methods with their bit flags. */
var wrapFlags = [
[ 'ary' , WRAP _ARY _FLAG ] ,
[ 'bind' , WRAP _BIND _FLAG ] ,
[ 'bindKey' , WRAP _BIND _KEY _FLAG ] ,
[ 'curry' , WRAP _CURRY _FLAG ] ,
[ 'curryRight' , WRAP _CURRY _RIGHT _FLAG ] ,
[ 'flip' , WRAP _FLIP _FLAG ] ,
[ 'partial' , WRAP _PARTIAL _FLAG ] ,
[ 'partialRight' , WRAP _PARTIAL _RIGHT _FLAG ] ,
[ 'rearg' , WRAP _REARG _FLAG ]
] ;
/** `Object#toString` result references. */
var argsTag = '[object Arguments]' ,
arrayTag = '[object Array]' ,
asyncTag = '[object AsyncFunction]' ,
boolTag = '[object Boolean]' ,
dateTag = '[object Date]' ,
domExcTag = '[object DOMException]' ,
errorTag = '[object Error]' ,
funcTag = '[object Function]' ,
genTag = '[object GeneratorFunction]' ,
mapTag = '[object Map]' ,
numberTag = '[object Number]' ,
nullTag = '[object Null]' ,
objectTag = '[object Object]' ,
promiseTag = '[object Promise]' ,
proxyTag = '[object Proxy]' ,
regexpTag = '[object RegExp]' ,
setTag = '[object Set]' ,
stringTag = '[object String]' ,
symbolTag = '[object Symbol]' ,
undefinedTag = '[object Undefined]' ,
weakMapTag = '[object WeakMap]' ,
weakSetTag = '[object WeakSet]' ;
var arrayBufferTag = '[object ArrayBuffer]' ,
dataViewTag = '[object DataView]' ,
float32Tag = '[object Float32Array]' ,
float64Tag = '[object Float64Array]' ,
int8Tag = '[object Int8Array]' ,
int16Tag = '[object Int16Array]' ,
int32Tag = '[object Int32Array]' ,
uint8Tag = '[object Uint8Array]' ,
uint8ClampedTag = '[object Uint8ClampedArray]' ,
uint16Tag = '[object Uint16Array]' ,
uint32Tag = '[object Uint32Array]' ;
/** Used to match empty string literals in compiled template source. */
var reEmptyStringLeading = /\b__p \+= '';/g ,
reEmptyStringMiddle = /\b(__p \+=) '' \+/g ,
reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g ;
/** Used to match HTML entities and HTML characters. */
var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g ,
reUnescapedHtml = /[&<>"']/g ,
reHasEscapedHtml = RegExp ( reEscapedHtml . source ) ,
reHasUnescapedHtml = RegExp ( reUnescapedHtml . source ) ;
/** Used to match template delimiters. */
var reEscape = /<%-([\s\S]+?)%>/g ,
reEvaluate = /<%([\s\S]+?)%>/g ,
reInterpolate = /<%=([\s\S]+?)%>/g ;
/** Used to match property names within property paths. */
var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/ ,
reIsPlainProp = /^\w*$/ ,
reLeadingDot = /^\./ ,
rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g ;
/ * *
* Used to match ` RegExp `
* [ syntax characters ] ( http : //ecma-international.org/ecma-262/7.0/#sec-patterns).
* /
var reRegExpChar = /[\\^$.*+?()[\]{}|]/g ,
reHasRegExpChar = RegExp ( reRegExpChar . source ) ;
/** Used to match leading and trailing whitespace. */
var reTrim = /^\s+|\s+$/g ,
reTrimStart = /^\s+/ ,
reTrimEnd = /\s+$/ ;
/** Used to match wrap detail comments. */
var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/ ,
reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/ ,
reSplitDetails = /,? & / ;
/** Used to match words composed of alphanumeric characters. */
var reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g ;
/** Used to match backslashes in property paths. */
var reEscapeChar = /\\(\\)?/g ;
/ * *
* Used to match
* [ ES template delimiters ] ( http : //ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).
* /
var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g ;
/** Used to match `RegExp` flags from their coerced string values. */
var reFlags = /\w*$/ ;
/** Used to detect bad signed hexadecimal string values. */
var reIsBadHex = /^[-+]0x[0-9a-f]+$/i ;
/** Used to detect binary string values. */
var reIsBinary = /^0b[01]+$/i ;
/** Used to detect host constructors (Safari). */
var reIsHostCtor = /^\[object .+?Constructor\]$/ ;
/** Used to detect octal string values. */
var reIsOctal = /^0o[0-7]+$/i ;
/** Used to detect unsigned integer values. */
var reIsUint = /^(?:0|[1-9]\d*)$/ ;
/** Used to match Latin Unicode letters (excluding mathematical operators). */
var reLatin = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g ;
/** Used to ensure capturing order of template delimiters. */
var reNoMatch = /($^)/ ;
/** Used to match unescaped characters in compiled string literals. */
var reUnescapedString = /['\n\r\u2028\u2029\\]/g ;
/** Used to compose unicode character classes. */
var rsAstralRange = '\\ud800-\\udfff' ,
rsComboMarksRange = '\\u0300-\\u036f' ,
reComboHalfMarksRange = '\\ufe20-\\ufe2f' ,
rsComboSymbolsRange = '\\u20d0-\\u20ff' ,
rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange ,
rsDingbatRange = '\\u2700-\\u27bf' ,
rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff' ,
rsMathOpRange = '\\xac\\xb1\\xd7\\xf7' ,
rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf' ,
rsPunctuationRange = '\\u2000-\\u206f' ,
rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000' ,
rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde' ,
rsVarRange = '\\ufe0e\\ufe0f' ,
rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange ;
/** Used to compose unicode capture groups. */
var rsApos = "['\u2019]" ,
rsAstral = '[' + rsAstralRange + ']' ,
rsBreak = '[' + rsBreakRange + ']' ,
rsCombo = '[' + rsComboRange + ']' ,
rsDigits = '\\d+' ,
rsDingbat = '[' + rsDingbatRange + ']' ,
rsLower = '[' + rsLowerRange + ']' ,
rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']' ,
rsFitz = '\\ud83c[\\udffb-\\udfff]' ,
rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')' ,
rsNonAstral = '[^' + rsAstralRange + ']' ,
rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}' ,
rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]' ,
rsUpper = '[' + rsUpperRange + ']' ,
rsZWJ = '\\u200d' ;
/** Used to compose unicode regexes. */
var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')' ,
rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')' ,
rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?' ,
rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?' ,
reOptMod = rsModifier + '?' ,
rsOptVar = '[' + rsVarRange + ']?' ,
rsOptJoin = '(?:' + rsZWJ + '(?:' + [ rsNonAstral , rsRegional , rsSurrPair ] . join ( '|' ) + ')' + rsOptVar + reOptMod + ')*' ,
rsOrdLower = '\\d*(?:(?:1st|2nd|3rd|(?![123])\\dth)\\b)' ,
rsOrdUpper = '\\d*(?:(?:1ST|2ND|3RD|(?![123])\\dTH)\\b)' ,
rsSeq = rsOptVar + reOptMod + rsOptJoin ,
rsEmoji = '(?:' + [ rsDingbat , rsRegional , rsSurrPair ] . join ( '|' ) + ')' + rsSeq ,
rsSymbol = '(?:' + [ rsNonAstral + rsCombo + '?' , rsCombo , rsRegional , rsSurrPair , rsAstral ] . join ( '|' ) + ')' ;
/** Used to match apostrophes. */
var reApos = RegExp ( rsApos , 'g' ) ;
/ * *
* Used to match [ combining diacritical marks ] ( https : //en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
* [ combining diacritical marks for symbols ] ( https : //en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
* /
var reComboMark = RegExp ( rsCombo , 'g' ) ;
/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
var reUnicode = RegExp ( rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq , 'g' ) ;
/** Used to match complex or compound words. */
var reUnicodeWord = RegExp ( [
rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [ rsBreak , rsUpper , '$' ] . join ( '|' ) + ')' ,
rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [ rsBreak , rsUpper + rsMiscLower , '$' ] . join ( '|' ) + ')' ,
rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower ,
rsUpper + '+' + rsOptContrUpper ,
rsOrdUpper ,
rsOrdLower ,
rsDigits ,
rsEmoji
] . join ( '|' ) , 'g' ) ;
/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
var reHasUnicode = RegExp ( '[' + rsZWJ + rsAstralRange + rsComboRange + rsVarRange + ']' ) ;
/** Used to detect strings that need a more robust regexp to match words. */
var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/ ;
/** Used to assign default `context` object properties. */
var contextProps = [
'Array' , 'Buffer' , 'DataView' , 'Date' , 'Error' , 'Float32Array' , 'Float64Array' ,
'Function' , 'Int8Array' , 'Int16Array' , 'Int32Array' , 'Map' , 'Math' , 'Object' ,
'Promise' , 'RegExp' , 'Set' , 'String' , 'Symbol' , 'TypeError' , 'Uint8Array' ,
'Uint8ClampedArray' , 'Uint16Array' , 'Uint32Array' , 'WeakMap' ,
'_' , 'clearTimeout' , 'isFinite' , 'parseInt' , 'setTimeout'
] ;
/** Used to make template sourceURLs easier to identify. */
var templateCounter = - 1 ;
/** Used to identify `toStringTag` values of typed arrays. */
var typedArrayTags = { } ;
typedArrayTags [ float32Tag ] = typedArrayTags [ float64Tag ] =
typedArrayTags [ int8Tag ] = typedArrayTags [ int16Tag ] =
typedArrayTags [ int32Tag ] = typedArrayTags [ uint8Tag ] =
typedArrayTags [ uint8ClampedTag ] = typedArrayTags [ uint16Tag ] =
typedArrayTags [ uint32Tag ] = true ;
typedArrayTags [ argsTag ] = typedArrayTags [ arrayTag ] =
typedArrayTags [ arrayBufferTag ] = typedArrayTags [ boolTag ] =
typedArrayTags [ dataViewTag ] = typedArrayTags [ dateTag ] =
typedArrayTags [ errorTag ] = typedArrayTags [ funcTag ] =
typedArrayTags [ mapTag ] = typedArrayTags [ numberTag ] =
typedArrayTags [ objectTag ] = typedArrayTags [ regexpTag ] =
typedArrayTags [ setTag ] = typedArrayTags [ stringTag ] =
typedArrayTags [ weakMapTag ] = false ;
/** Used to identify `toStringTag` values supported by `_.clone`. */
var cloneableTags = { } ;
cloneableTags [ argsTag ] = cloneableTags [ arrayTag ] =
cloneableTags [ arrayBufferTag ] = cloneableTags [ dataViewTag ] =
cloneableTags [ boolTag ] = cloneableTags [ dateTag ] =
cloneableTags [ float32Tag ] = cloneableTags [ float64Tag ] =
cloneableTags [ int8Tag ] = cloneableTags [ int16Tag ] =
cloneableTags [ int32Tag ] = cloneableTags [ mapTag ] =
cloneableTags [ numberTag ] = cloneableTags [ objectTag ] =
cloneableTags [ regexpTag ] = cloneableTags [ setTag ] =
cloneableTags [ stringTag ] = cloneableTags [ symbolTag ] =
cloneableTags [ uint8Tag ] = cloneableTags [ uint8ClampedTag ] =
cloneableTags [ uint16Tag ] = cloneableTags [ uint32Tag ] = true ;
cloneableTags [ errorTag ] = cloneableTags [ funcTag ] =
cloneableTags [ weakMapTag ] = false ;
/** Used to map Latin Unicode letters to basic Latin letters. */
var deburredLetters = {
// Latin-1 Supplement block.
'\xc0' : 'A' ,
'\xc1' : 'A' ,
'\xc2' : 'A' ,
'\xc3' : 'A' ,
'\xc4' : 'A' ,
'\xc5' : 'A' ,
'\xe0' : 'a' ,
'\xe1' : 'a' ,
'\xe2' : 'a' ,
'\xe3' : 'a' ,
'\xe4' : 'a' ,
'\xe5' : 'a' ,
'\xc7' : 'C' ,
'\xe7' : 'c' ,
'\xd0' : 'D' ,
'\xf0' : 'd' ,
'\xc8' : 'E' ,
'\xc9' : 'E' ,
'\xca' : 'E' ,
'\xcb' : 'E' ,
'\xe8' : 'e' ,
'\xe9' : 'e' ,
'\xea' : 'e' ,
'\xeb' : 'e' ,
'\xcc' : 'I' ,
'\xcd' : 'I' ,
'\xce' : 'I' ,
'\xcf' : 'I' ,
'\xec' : 'i' ,
'\xed' : 'i' ,
'\xee' : 'i' ,
'\xef' : 'i' ,
'\xd1' : 'N' ,
'\xf1' : 'n' ,
'\xd2' : 'O' ,
'\xd3' : 'O' ,
'\xd4' : 'O' ,
'\xd5' : 'O' ,
'\xd6' : 'O' ,
'\xd8' : 'O' ,
'\xf2' : 'o' ,
'\xf3' : 'o' ,
'\xf4' : 'o' ,
'\xf5' : 'o' ,
'\xf6' : 'o' ,
'\xf8' : 'o' ,
'\xd9' : 'U' ,
'\xda' : 'U' ,
'\xdb' : 'U' ,
'\xdc' : 'U' ,
'\xf9' : 'u' ,
'\xfa' : 'u' ,
'\xfb' : 'u' ,
'\xfc' : 'u' ,
'\xdd' : 'Y' ,
'\xfd' : 'y' ,
'\xff' : 'y' ,
'\xc6' : 'Ae' ,
'\xe6' : 'ae' ,
'\xde' : 'Th' ,
'\xfe' : 'th' ,
'\xdf' : 'ss' ,
// Latin Extended-A block.
'\u0100' : 'A' ,
'\u0102' : 'A' ,
'\u0104' : 'A' ,
'\u0101' : 'a' ,
'\u0103' : 'a' ,
'\u0105' : 'a' ,
'\u0106' : 'C' ,
'\u0108' : 'C' ,
'\u010a' : 'C' ,
'\u010c' : 'C' ,
'\u0107' : 'c' ,
'\u0109' : 'c' ,
'\u010b' : 'c' ,
'\u010d' : 'c' ,
'\u010e' : 'D' ,
'\u0110' : 'D' ,
'\u010f' : 'd' ,
'\u0111' : 'd' ,
'\u0112' : 'E' ,
'\u0114' : 'E' ,
'\u0116' : 'E' ,
'\u0118' : 'E' ,
'\u011a' : 'E' ,
'\u0113' : 'e' ,
'\u0115' : 'e' ,
'\u0117' : 'e' ,
'\u0119' : 'e' ,
'\u011b' : 'e' ,
'\u011c' : 'G' ,
'\u011e' : 'G' ,
'\u0120' : 'G' ,
'\u0122' : 'G' ,
'\u011d' : 'g' ,
'\u011f' : 'g' ,
'\u0121' : 'g' ,
'\u0123' : 'g' ,
'\u0124' : 'H' ,
'\u0126' : 'H' ,
'\u0125' : 'h' ,
'\u0127' : 'h' ,
'\u0128' : 'I' ,
'\u012a' : 'I' ,
'\u012c' : 'I' ,
'\u012e' : 'I' ,
'\u0130' : 'I' ,
'\u0129' : 'i' ,
'\u012b' : 'i' ,
'\u012d' : 'i' ,
'\u012f' : 'i' ,
'\u0131' : 'i' ,
'\u0134' : 'J' ,
'\u0135' : 'j' ,
'\u0136' : 'K' ,
'\u0137' : 'k' ,
'\u0138' : 'k' ,
'\u0139' : 'L' ,
'\u013b' : 'L' ,
'\u013d' : 'L' ,
'\u013f' : 'L' ,
'\u0141' : 'L' ,
'\u013a' : 'l' ,
'\u013c' : 'l' ,
'\u013e' : 'l' ,
'\u0140' : 'l' ,
'\u0142' : 'l' ,
'\u0143' : 'N' ,
'\u0145' : 'N' ,
'\u0147' : 'N' ,
'\u014a' : 'N' ,
'\u0144' : 'n' ,
'\u0146' : 'n' ,
'\u0148' : 'n' ,
'\u014b' : 'n' ,
'\u014c' : 'O' ,
'\u014e' : 'O' ,
'\u0150' : 'O' ,
'\u014d' : 'o' ,
'\u014f' : 'o' ,
'\u0151' : 'o' ,
'\u0154' : 'R' ,
'\u0156' : 'R' ,
'\u0158' : 'R' ,
'\u0155' : 'r' ,
'\u0157' : 'r' ,
'\u0159' : 'r' ,
'\u015a' : 'S' ,
'\u015c' : 'S' ,
'\u015e' : 'S' ,
'\u0160' : 'S' ,
'\u015b' : 's' ,
'\u015d' : 's' ,
'\u015f' : 's' ,
'\u0161' : 's' ,
'\u0162' : 'T' ,
'\u0164' : 'T' ,
'\u0166' : 'T' ,
'\u0163' : 't' ,
'\u0165' : 't' ,
'\u0167' : 't' ,
'\u0168' : 'U' ,
'\u016a' : 'U' ,
'\u016c' : 'U' ,
'\u016e' : 'U' ,
'\u0170' : 'U' ,
'\u0172' : 'U' ,
'\u0169' : 'u' ,
'\u016b' : 'u' ,
'\u016d' : 'u' ,
'\u016f' : 'u' ,
'\u0171' : 'u' ,
'\u0173' : 'u' ,
'\u0174' : 'W' ,
'\u0175' : 'w' ,
'\u0176' : 'Y' ,
'\u0177' : 'y' ,
'\u0178' : 'Y' ,
'\u0179' : 'Z' ,
'\u017b' : 'Z' ,
'\u017d' : 'Z' ,
'\u017a' : 'z' ,
'\u017c' : 'z' ,
'\u017e' : 'z' ,
'\u0132' : 'IJ' ,
'\u0133' : 'ij' ,
'\u0152' : 'Oe' ,
'\u0153' : 'oe' ,
'\u0149' : "'n" ,
'\u017f' : 's'
} ;
/** Used to map characters to HTML entities. */
var htmlEscapes = {
'&' : '&' ,
'<' : '<' ,
'>' : '>' ,
'"' : '"' ,
"'" : '''
} ;
/** Used to map HTML entities to characters. */
var htmlUnescapes = {
'&' : '&' ,
'<' : '<' ,
'>' : '>' ,
'"' : '"' ,
''' : "'"
} ;
/** Used to escape characters for inclusion in compiled string literals. */
var stringEscapes = {
'\\' : '\\' ,
"'" : "'" ,
'\n' : 'n' ,
'\r' : 'r' ,
'\u2028' : 'u2028' ,
'\u2029' : 'u2029'
} ;
/** Built-in method references without a dependency on `root`. */
var freeParseFloat = parseFloat ,
freeParseInt = parseInt ;
/** Detect free variable `global` from Node.js. */
var freeGlobal = typeof global == 'object' && global && global . Object === Object && global ;
/** Detect free variable `self`. */
var freeSelf = typeof self == 'object' && self && self . Object === Object && self ;
/** Used as a reference to the global object. */
var root = freeGlobal || freeSelf || Function ( 'return this' ) ( ) ;
/** Detect free variable `exports`. */
var freeExports = typeof exports == 'object' && exports && ! exports . nodeType && exports ;
/** Detect free variable `module`. */
var freeModule = freeExports && typeof module == 'object' && module && ! module . nodeType && module ;
/** Detect the popular CommonJS extension `module.exports`. */
var moduleExports = freeModule && freeModule . exports === freeExports ;
/** Detect free variable `process` from Node.js. */
var freeProcess = moduleExports && freeGlobal . process ;
/** Used to access faster Node.js helpers. */
var nodeUtil = ( function ( ) {
try {
return freeProcess && freeProcess . binding && freeProcess . binding ( 'util' ) ;
} catch ( e ) { }
} ( ) ) ;
/* Node.js helper references. */
var nodeIsArrayBuffer = nodeUtil && nodeUtil . isArrayBuffer ,
nodeIsDate = nodeUtil && nodeUtil . isDate ,
nodeIsMap = nodeUtil && nodeUtil . isMap ,
nodeIsRegExp = nodeUtil && nodeUtil . isRegExp ,
nodeIsSet = nodeUtil && nodeUtil . isSet ,
nodeIsTypedArray = nodeUtil && nodeUtil . isTypedArray ;
/*--------------------------------------------------------------------------*/
/ * *
* Adds the key - value ` pair ` to ` map ` .
*
* @ private
* @ param { Object } map The map to modify .
* @ param { Array } pair The key - value pair to add .
* @ returns { Object } Returns ` map ` .
* /
function addMapEntry ( map , pair ) {
// Don't return `map.set` because it's not chainable in IE 11.
map . set ( pair [ 0 ] , pair [ 1 ] ) ;
return map ;
}
/ * *
* Adds ` value ` to ` set ` .
*
* @ private
* @ param { Object } set The set to modify .
* @ param { * } value The value to add .
* @ returns { Object } Returns ` set ` .
* /
function addSetEntry ( set , value ) {
// Don't return `set.add` because it's not chainable in IE 11.
set . add ( value ) ;
return set ;
}
/ * *
* A faster alternative to ` Function#apply ` , this function invokes ` func `
* with the ` this ` binding of ` thisArg ` and the arguments of ` args ` .
*
* @ private
* @ param { Function } func The function to invoke .
* @ param { * } thisArg The ` this ` binding of ` func ` .
* @ param { Array } args The arguments to invoke ` func ` with .
* @ returns { * } Returns the result of ` func ` .
* /
function apply ( func , thisArg , args ) {
switch ( args . length ) {
case 0 :
return func . call ( thisArg ) ;
case 1 :
return func . call ( thisArg , args [ 0 ] ) ;
case 2 :
return func . call ( thisArg , args [ 0 ] , args [ 1 ] ) ;
case 3 :
return func . call ( thisArg , args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
}
return func . apply ( thisArg , args ) ;
}
/ * *
* A specialized version of ` baseAggregator ` for arrays .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } setter The function to set ` accumulator ` values .
* @ param { Function } iteratee The iteratee to transform keys .
* @ param { Object } accumulator The initial aggregated object .
* @ returns { Function } Returns ` accumulator ` .
* /
function arrayAggregator ( array , setter , iteratee , accumulator ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
while ( ++ index < length ) {
var value = array [ index ] ;
setter ( accumulator , value , iteratee ( value ) , array ) ;
}
return accumulator ;
}
/ * *
* A specialized version of ` _.forEach ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array } Returns ` array ` .
* /
function arrayEach ( array , iteratee ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
while ( ++ index < length ) {
if ( iteratee ( array [ index ] , index , array ) === false ) {
break ;
}
}
return array ;
}
/ * *
* A specialized version of ` _.forEachRight ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array } Returns ` array ` .
* /
function arrayEachRight ( array , iteratee ) {
var length = array == null ? 0 : array . length ;
while ( length -- ) {
if ( iteratee ( array [ length ] , length , array ) === false ) {
break ;
}
}
return array ;
}
/ * *
* A specialized version of ` _.every ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { boolean } Returns ` true ` if all elements pass the predicate check ,
* else ` false ` .
* /
function arrayEvery ( array , predicate ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
while ( ++ index < length ) {
if ( ! predicate ( array [ index ] , index , array ) ) {
return false ;
}
}
return true ;
}
/ * *
* A specialized version of ` _.filter ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { Array } Returns the new filtered array .
* /
function arrayFilter ( array , predicate ) {
var index = - 1 ,
length = array == null ? 0 : array . length ,
resIndex = 0 ,
result = [ ] ;
while ( ++ index < length ) {
var value = array [ index ] ;
if ( predicate ( value , index , array ) ) {
result [ resIndex ++ ] = value ;
}
}
return result ;
}
/ * *
* A specialized version of ` _.includes ` for arrays without support for
* specifying an index to search from .
*
* @ private
* @ param { Array } [ array ] The array to inspect .
* @ param { * } target The value to search for .
* @ returns { boolean } Returns ` true ` if ` target ` is found , else ` false ` .
* /
function arrayIncludes ( array , value ) {
var length = array == null ? 0 : array . length ;
return ! ! length && baseIndexOf ( array , value , 0 ) > - 1 ;
}
/ * *
* This function is like ` arrayIncludes ` except that it accepts a comparator .
*
* @ private
* @ param { Array } [ array ] The array to inspect .
* @ param { * } target The value to search for .
* @ param { Function } comparator The comparator invoked per element .
* @ returns { boolean } Returns ` true ` if ` target ` is found , else ` false ` .
* /
function arrayIncludesWith ( array , value , comparator ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
while ( ++ index < length ) {
if ( comparator ( value , array [ index ] ) ) {
return true ;
}
}
return false ;
}
/ * *
* A specialized version of ` _.map ` for arrays without support for iteratee
* shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array } Returns the new mapped array .
* /
function arrayMap ( array , iteratee ) {
var index = - 1 ,
length = array == null ? 0 : array . length ,
result = Array ( length ) ;
while ( ++ index < length ) {
result [ index ] = iteratee ( array [ index ] , index , array ) ;
}
return result ;
}
/ * *
* Appends the elements of ` values ` to ` array ` .
*
* @ private
* @ param { Array } array The array to modify .
* @ param { Array } values The values to append .
* @ returns { Array } Returns ` array ` .
* /
function arrayPush ( array , values ) {
var index = - 1 ,
length = values . length ,
offset = array . length ;
while ( ++ index < length ) {
array [ offset + index ] = values [ index ] ;
}
return array ;
}
/ * *
* A specialized version of ` _.reduce ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ param { * } [ accumulator ] The initial value .
* @ param { boolean } [ initAccum ] Specify using the first element of ` array ` as
* the initial value .
* @ returns { * } Returns the accumulated value .
* /
function arrayReduce ( array , iteratee , accumulator , initAccum ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
if ( initAccum && length ) {
accumulator = array [ ++ index ] ;
}
while ( ++ index < length ) {
accumulator = iteratee ( accumulator , array [ index ] , index , array ) ;
}
return accumulator ;
}
/ * *
* A specialized version of ` _.reduceRight ` for arrays without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ param { * } [ accumulator ] The initial value .
* @ param { boolean } [ initAccum ] Specify using the last element of ` array ` as
* the initial value .
* @ returns { * } Returns the accumulated value .
* /
function arrayReduceRight ( array , iteratee , accumulator , initAccum ) {
var length = array == null ? 0 : array . length ;
if ( initAccum && length ) {
accumulator = array [ -- length ] ;
}
while ( length -- ) {
accumulator = iteratee ( accumulator , array [ length ] , length , array ) ;
}
return accumulator ;
}
/ * *
* A specialized version of ` _.some ` for arrays without support for iteratee
* shorthands .
*
* @ private
* @ param { Array } [ array ] The array to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { boolean } Returns ` true ` if any element passes the predicate check ,
* else ` false ` .
* /
function arraySome ( array , predicate ) {
var index = - 1 ,
length = array == null ? 0 : array . length ;
while ( ++ index < length ) {
if ( predicate ( array [ index ] , index , array ) ) {
return true ;
}
}
return false ;
}
/ * *
* Gets the size of an ASCII ` string ` .
*
* @ private
* @ param { string } string The string inspect .
* @ returns { number } Returns the string size .
* /
var asciiSize = baseProperty ( 'length' ) ;
/ * *
* Converts an ASCII ` string ` to an array .
*
* @ private
* @ param { string } string The string to convert .
* @ returns { Array } Returns the converted array .
* /
function asciiToArray ( string ) {
return string . split ( '' ) ;
}
/ * *
* Splits an ASCII ` string ` into an array of its words .
*
* @ private
* @ param { string } The string to inspect .
* @ returns { Array } Returns the words of ` string ` .
* /
function asciiWords ( string ) {
return string . match ( reAsciiWord ) || [ ] ;
}
/ * *
* The base implementation of methods like ` _.findKey ` and ` _.findLastKey ` ,
* without support for iteratee shorthands , which iterates over ` collection `
* using ` eachFunc ` .
*
* @ private
* @ param { Array | Object } collection The collection to inspect .
* @ param { Function } predicate The function invoked per iteration .
* @ param { Function } eachFunc The function to iterate over ` collection ` .
* @ returns { * } Returns the found element or its key , else ` undefined ` .
* /
function baseFindKey ( collection , predicate , eachFunc ) {
var result ;
eachFunc ( collection , function ( value , key , collection ) {
if ( predicate ( value , key , collection ) ) {
result = key ;
return false ;
}
} ) ;
return result ;
}
/ * *
* The base implementation of ` _.findIndex ` and ` _.findLastIndex ` without
* support for iteratee shorthands .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { Function } predicate The function invoked per iteration .
* @ param { number } fromIndex The index to search from .
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function baseFindIndex ( array , predicate , fromIndex , fromRight ) {
var length = array . length ,
index = fromIndex + ( fromRight ? 1 : - 1 ) ;
while ( ( fromRight ? index -- : ++ index < length ) ) {
if ( predicate ( array [ index ] , index , array ) ) {
return index ;
}
}
return - 1 ;
}
/ * *
* The base implementation of ` _.indexOf ` without ` fromIndex ` bounds checks .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } fromIndex The index to search from .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function baseIndexOf ( array , value , fromIndex ) {
return value === value ?
strictIndexOf ( array , value , fromIndex ) :
baseFindIndex ( array , baseIsNaN , fromIndex ) ;
}
/ * *
* This function is like ` baseIndexOf ` except that it accepts a comparator .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } fromIndex The index to search from .
* @ param { Function } comparator The comparator invoked per element .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function baseIndexOfWith ( array , value , fromIndex , comparator ) {
var index = fromIndex - 1 ,
length = array . length ;
while ( ++ index < length ) {
if ( comparator ( array [ index ] , value ) ) {
return index ;
}
}
return - 1 ;
}
/ * *
* The base implementation of ` _.isNaN ` without support for number objects .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is ` NaN ` , else ` false ` .
* /
function baseIsNaN ( value ) {
return value !== value ;
}
/ * *
* The base implementation of ` _.mean ` and ` _.meanBy ` without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } array The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { number } Returns the mean .
* /
function baseMean ( array , iteratee ) {
var length = array == null ? 0 : array . length ;
return length ? ( baseSum ( array , iteratee ) / length ) : NAN ;
}
/ * *
* The base implementation of ` _.property ` without support for deep paths .
*
* @ private
* @ param { string } key The key of the property to get .
* @ returns { Function } Returns the new accessor function .
* /
function baseProperty ( key ) {
return function ( object ) {
return object == null ? undefined : object [ key ] ;
} ;
}
/ * *
* The base implementation of ` _.propertyOf ` without support for deep paths .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Function } Returns the new accessor function .
* /
function basePropertyOf ( object ) {
return function ( key ) {
return object == null ? undefined : object [ key ] ;
} ;
}
/ * *
* The base implementation of ` _.reduce ` and ` _.reduceRight ` , without support
* for iteratee shorthands , which iterates over ` collection ` using ` eachFunc ` .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ param { * } accumulator The initial value .
* @ param { boolean } initAccum Specify using the first or last element of
* ` collection ` as the initial value .
* @ param { Function } eachFunc The function to iterate over ` collection ` .
* @ returns { * } Returns the accumulated value .
* /
function baseReduce ( collection , iteratee , accumulator , initAccum , eachFunc ) {
eachFunc ( collection , function ( value , index , collection ) {
accumulator = initAccum ?
( initAccum = false , value ) :
iteratee ( accumulator , value , index , collection ) ;
} ) ;
return accumulator ;
}
/ * *
* The base implementation of ` _.sortBy ` which uses ` comparer ` to define the
* sort order of ` array ` and replaces criteria objects with their corresponding
* values .
*
* @ private
* @ param { Array } array The array to sort .
* @ param { Function } comparer The function to define sort order .
* @ returns { Array } Returns ` array ` .
* /
function baseSortBy ( array , comparer ) {
var length = array . length ;
array . sort ( comparer ) ;
while ( length -- ) {
array [ length ] = array [ length ] . value ;
}
return array ;
}
/ * *
* The base implementation of ` _.sum ` and ` _.sumBy ` without support for
* iteratee shorthands .
*
* @ private
* @ param { Array } array The array to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { number } Returns the sum .
* /
function baseSum ( array , iteratee ) {
var result ,
index = - 1 ,
length = array . length ;
while ( ++ index < length ) {
var current = iteratee ( array [ index ] ) ;
if ( current !== undefined ) {
result = result === undefined ? current : ( result + current ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.times ` without support for iteratee shorthands
* or max array length checks .
*
* @ private
* @ param { number } n The number of times to invoke ` iteratee ` .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array } Returns the array of results .
* /
function baseTimes ( n , iteratee ) {
var index = - 1 ,
result = Array ( n ) ;
while ( ++ index < n ) {
result [ index ] = iteratee ( index ) ;
}
return result ;
}
/ * *
* The base implementation of ` _.toPairs ` and ` _.toPairsIn ` which creates an array
* of key - value pairs for ` object ` corresponding to the property names of ` props ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array } props The property names to get values for .
* @ returns { Object } Returns the key - value pairs .
* /
function baseToPairs ( object , props ) {
return arrayMap ( props , function ( key ) {
return [ key , object [ key ] ] ;
} ) ;
}
/ * *
* The base implementation of ` _.unary ` without support for storing metadata .
*
* @ private
* @ param { Function } func The function to cap arguments for .
* @ returns { Function } Returns the new capped function .
* /
function baseUnary ( func ) {
return function ( value ) {
return func ( value ) ;
} ;
}
/ * *
* The base implementation of ` _.values ` and ` _.valuesIn ` which creates an
* array of ` object ` property values corresponding to the property names
* of ` props ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array } props The property names to get values for .
* @ returns { Object } Returns the array of property values .
* /
function baseValues ( object , props ) {
return arrayMap ( props , function ( key ) {
return object [ key ] ;
} ) ;
}
/ * *
* Checks if a ` cache ` value for ` key ` exists .
*
* @ private
* @ param { Object } cache The cache to query .
* @ param { string } key The key of the entry to check .
* @ returns { boolean } Returns ` true ` if an entry for ` key ` exists , else ` false ` .
* /
function cacheHas ( cache , key ) {
return cache . has ( key ) ;
}
/ * *
* Used by ` _.trim ` and ` _.trimStart ` to get the index of the first string symbol
* that is not found in the character symbols .
*
* @ private
* @ param { Array } strSymbols The string symbols to inspect .
* @ param { Array } chrSymbols The character symbols to find .
* @ returns { number } Returns the index of the first unmatched string symbol .
* /
function charsStartIndex ( strSymbols , chrSymbols ) {
var index = - 1 ,
length = strSymbols . length ;
while ( ++ index < length && baseIndexOf ( chrSymbols , strSymbols [ index ] , 0 ) > - 1 ) { }
return index ;
}
/ * *
* Used by ` _.trim ` and ` _.trimEnd ` to get the index of the last string symbol
* that is not found in the character symbols .
*
* @ private
* @ param { Array } strSymbols The string symbols to inspect .
* @ param { Array } chrSymbols The character symbols to find .
* @ returns { number } Returns the index of the last unmatched string symbol .
* /
function charsEndIndex ( strSymbols , chrSymbols ) {
var index = strSymbols . length ;
while ( index -- && baseIndexOf ( chrSymbols , strSymbols [ index ] , 0 ) > - 1 ) { }
return index ;
}
/ * *
* Gets the number of ` placeholder ` occurrences in ` array ` .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } placeholder The placeholder to search for .
* @ returns { number } Returns the placeholder count .
* /
function countHolders ( array , placeholder ) {
var length = array . length ,
result = 0 ;
while ( length -- ) {
if ( array [ length ] === placeholder ) {
++ result ;
}
}
return result ;
}
/ * *
* Used by ` _.deburr ` to convert Latin - 1 Supplement and Latin Extended - A
* letters to basic Latin letters .
*
* @ private
* @ param { string } letter The matched letter to deburr .
* @ returns { string } Returns the deburred letter .
* /
var deburrLetter = basePropertyOf ( deburredLetters ) ;
/ * *
* Used by ` _.escape ` to convert characters to HTML entities .
*
* @ private
* @ param { string } chr The matched character to escape .
* @ returns { string } Returns the escaped character .
* /
var escapeHtmlChar = basePropertyOf ( htmlEscapes ) ;
/ * *
* Used by ` _.template ` to escape characters for inclusion in compiled string literals .
*
* @ private
* @ param { string } chr The matched character to escape .
* @ returns { string } Returns the escaped character .
* /
function escapeStringChar ( chr ) {
return '\\' + stringEscapes [ chr ] ;
}
/ * *
* Gets the value at ` key ` of ` object ` .
*
* @ private
* @ param { Object } [ object ] The object to query .
* @ param { string } key The key of the property to get .
* @ returns { * } Returns the property value .
* /
function getValue ( object , key ) {
return object == null ? undefined : object [ key ] ;
}
/ * *
* Checks if ` string ` contains Unicode symbols .
*
* @ private
* @ param { string } string The string to inspect .
* @ returns { boolean } Returns ` true ` if a symbol is found , else ` false ` .
* /
function hasUnicode ( string ) {
return reHasUnicode . test ( string ) ;
}
/ * *
* Checks if ` string ` contains a word composed of Unicode symbols .
*
* @ private
* @ param { string } string The string to inspect .
* @ returns { boolean } Returns ` true ` if a word is found , else ` false ` .
* /
function hasUnicodeWord ( string ) {
return reHasUnicodeWord . test ( string ) ;
}
/ * *
* Converts ` iterator ` to an array .
*
* @ private
* @ param { Object } iterator The iterator to convert .
* @ returns { Array } Returns the converted array .
* /
function iteratorToArray ( iterator ) {
var data ,
result = [ ] ;
while ( ! ( data = iterator . next ( ) ) . done ) {
result . push ( data . value ) ;
}
return result ;
}
/ * *
* Converts ` map ` to its key - value pairs .
*
* @ private
* @ param { Object } map The map to convert .
* @ returns { Array } Returns the key - value pairs .
* /
function mapToArray ( map ) {
var index = - 1 ,
result = Array ( map . size ) ;
map . forEach ( function ( value , key ) {
result [ ++ index ] = [ key , value ] ;
} ) ;
return result ;
}
/ * *
* Creates a unary function that invokes ` func ` with its argument transformed .
*
* @ private
* @ param { Function } func The function to wrap .
* @ param { Function } transform The argument transform .
* @ returns { Function } Returns the new function .
* /
function overArg ( func , transform ) {
return function ( arg ) {
return func ( transform ( arg ) ) ;
} ;
}
/ * *
* Replaces all ` placeholder ` elements in ` array ` with an internal placeholder
* and returns an array of their indexes .
*
* @ private
* @ param { Array } array The array to modify .
* @ param { * } placeholder The placeholder to replace .
* @ returns { Array } Returns the new array of placeholder indexes .
* /
function replaceHolders ( array , placeholder ) {
var index = - 1 ,
length = array . length ,
resIndex = 0 ,
result = [ ] ;
while ( ++ index < length ) {
var value = array [ index ] ;
if ( value === placeholder || value === PLACEHOLDER ) {
array [ index ] = PLACEHOLDER ;
result [ resIndex ++ ] = index ;
}
}
return result ;
}
/ * *
* Converts ` set ` to an array of its values .
*
* @ private
* @ param { Object } set The set to convert .
* @ returns { Array } Returns the values .
* /
function setToArray ( set ) {
var index = - 1 ,
result = Array ( set . size ) ;
set . forEach ( function ( value ) {
result [ ++ index ] = value ;
} ) ;
return result ;
}
/ * *
* Converts ` set ` to its value - value pairs .
*
* @ private
* @ param { Object } set The set to convert .
* @ returns { Array } Returns the value - value pairs .
* /
function setToPairs ( set ) {
var index = - 1 ,
result = Array ( set . size ) ;
set . forEach ( function ( value ) {
result [ ++ index ] = [ value , value ] ;
} ) ;
return result ;
}
/ * *
* A specialized version of ` _.indexOf ` which performs strict equality
* comparisons of values , i . e . ` === ` .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } fromIndex The index to search from .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function strictIndexOf ( array , value , fromIndex ) {
var index = fromIndex - 1 ,
length = array . length ;
while ( ++ index < length ) {
if ( array [ index ] === value ) {
return index ;
}
}
return - 1 ;
}
/ * *
* A specialized version of ` _.lastIndexOf ` which performs strict equality
* comparisons of values , i . e . ` === ` .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } fromIndex The index to search from .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function strictLastIndexOf ( array , value , fromIndex ) {
var index = fromIndex + 1 ;
while ( index -- ) {
if ( array [ index ] === value ) {
return index ;
}
}
return index ;
}
/ * *
* Gets the number of symbols in ` string ` .
*
* @ private
* @ param { string } string The string to inspect .
* @ returns { number } Returns the string size .
* /
function stringSize ( string ) {
return hasUnicode ( string ) ?
unicodeSize ( string ) :
asciiSize ( string ) ;
}
/ * *
* Converts ` string ` to an array .
*
* @ private
* @ param { string } string The string to convert .
* @ returns { Array } Returns the converted array .
* /
function stringToArray ( string ) {
return hasUnicode ( string ) ?
unicodeToArray ( string ) :
asciiToArray ( string ) ;
}
/ * *
* Used by ` _.unescape ` to convert HTML entities to characters .
*
* @ private
* @ param { string } chr The matched character to unescape .
* @ returns { string } Returns the unescaped character .
* /
var unescapeHtmlChar = basePropertyOf ( htmlUnescapes ) ;
/ * *
* Gets the size of a Unicode ` string ` .
*
* @ private
* @ param { string } string The string inspect .
* @ returns { number } Returns the string size .
* /
function unicodeSize ( string ) {
var result = reUnicode . lastIndex = 0 ;
while ( reUnicode . test ( string ) ) {
++ result ;
}
return result ;
}
/ * *
* Converts a Unicode ` string ` to an array .
*
* @ private
* @ param { string } string The string to convert .
* @ returns { Array } Returns the converted array .
* /
function unicodeToArray ( string ) {
return string . match ( reUnicode ) || [ ] ;
}
/ * *
* Splits a Unicode ` string ` into an array of its words .
*
* @ private
* @ param { string } The string to inspect .
* @ returns { Array } Returns the words of ` string ` .
* /
function unicodeWords ( string ) {
return string . match ( reUnicodeWord ) || [ ] ;
}
/*--------------------------------------------------------------------------*/
/ * *
* Create a new pristine ` lodash ` function using the ` context ` object .
*
* @ static
* @ memberOf _
* @ since 1.1 . 0
* @ category Util
* @ param { Object } [ context = root ] The context object .
* @ returns { Function } Returns a new ` lodash ` function .
* @ example
*
* _ . mixin ( { 'foo' : _ . constant ( 'foo' ) } ) ;
*
* var lodash = _ . runInContext ( ) ;
* lodash . mixin ( { 'bar' : lodash . constant ( 'bar' ) } ) ;
*
* _ . isFunction ( _ . foo ) ;
* // => true
* _ . isFunction ( _ . bar ) ;
* // => false
*
* lodash . isFunction ( lodash . foo ) ;
* // => false
* lodash . isFunction ( lodash . bar ) ;
* // => true
*
* // Create a suped-up `defer` in Node.js.
* var defer = _ . runInContext ( { 'setTimeout' : setImmediate } ) . defer ;
* /
var runInContext = ( function runInContext ( context ) {
context = context == null ? root : _ . defaults ( root . Object ( ) , context , _ . pick ( root , contextProps ) ) ;
/** Built-in constructor references. */
var Array = context . Array ,
Date = context . Date ,
Error = context . Error ,
Function = context . Function ,
Math = context . Math ,
Object = context . Object ,
RegExp = context . RegExp ,
String = context . String ,
TypeError = context . TypeError ;
/** Used for built-in method references. */
var arrayProto = Array . prototype ,
funcProto = Function . prototype ,
objectProto = Object . prototype ;
/** Used to detect overreaching core-js shims. */
var coreJsData = context [ '__core-js_shared__' ] ;
/** Used to resolve the decompiled source of functions. */
var funcToString = funcProto . toString ;
/** Used to check objects for own properties. */
var hasOwnProperty = objectProto . hasOwnProperty ;
/** Used to generate unique IDs. */
var idCounter = 0 ;
/** Used to detect methods masquerading as native. */
var maskSrcKey = ( function ( ) {
var uid = /[^.]+$/ . exec ( coreJsData && coreJsData . keys && coreJsData . keys . IE _PROTO || '' ) ;
return uid ? ( 'Symbol(src)_1.' + uid ) : '' ;
} ( ) ) ;
/ * *
* Used to resolve the
* [ ` toStringTag ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
* of values .
* /
var nativeObjectToString = objectProto . toString ;
/** Used to infer the `Object` constructor. */
var objectCtorString = funcToString . call ( Object ) ;
/** Used to restore the original `_` reference in `_.noConflict`. */
var oldDash = root . _ ;
/** Used to detect if a method is native. */
var reIsNative = RegExp ( '^' +
funcToString . call ( hasOwnProperty ) . replace ( reRegExpChar , '\\$&' )
. replace ( /hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g , '$1.*?' ) + '$'
) ;
/** Built-in value references. */
var Buffer = moduleExports ? context . Buffer : undefined ,
Symbol = context . Symbol ,
Uint8Array = context . Uint8Array ,
allocUnsafe = Buffer ? Buffer . allocUnsafe : undefined ,
getPrototype = overArg ( Object . getPrototypeOf , Object ) ,
objectCreate = Object . create ,
propertyIsEnumerable = objectProto . propertyIsEnumerable ,
splice = arrayProto . splice ,
spreadableSymbol = Symbol ? Symbol . isConcatSpreadable : undefined ,
symIterator = Symbol ? Symbol . iterator : undefined ,
symToStringTag = Symbol ? Symbol . toStringTag : undefined ;
var defineProperty = ( function ( ) {
try {
var func = getNative ( Object , 'defineProperty' ) ;
func ( { } , '' , { } ) ;
return func ;
} catch ( e ) { }
} ( ) ) ;
/** Mocked built-ins. */
var ctxClearTimeout = context . clearTimeout !== root . clearTimeout && context . clearTimeout ,
ctxNow = Date && Date . now !== root . Date . now && Date . now ,
ctxSetTimeout = context . setTimeout !== root . setTimeout && context . setTimeout ;
/* Built-in method references for those with the same name as other `lodash` methods. */
var nativeCeil = Math . ceil ,
nativeFloor = Math . floor ,
nativeGetSymbols = Object . getOwnPropertySymbols ,
nativeIsBuffer = Buffer ? Buffer . isBuffer : undefined ,
nativeIsFinite = context . isFinite ,
nativeJoin = arrayProto . join ,
nativeKeys = overArg ( Object . keys , Object ) ,
nativeMax = Math . max ,
nativeMin = Math . min ,
nativeNow = Date . now ,
nativeParseInt = context . parseInt ,
nativeRandom = Math . random ,
nativeReverse = arrayProto . reverse ;
/* Built-in method references that are verified to be native. */
var DataView = getNative ( context , 'DataView' ) ,
Map = getNative ( context , 'Map' ) ,
Promise = getNative ( context , 'Promise' ) ,
Set = getNative ( context , 'Set' ) ,
WeakMap = getNative ( context , 'WeakMap' ) ,
nativeCreate = getNative ( Object , 'create' ) ;
/** Used to store function metadata. */
var metaMap = WeakMap && new WeakMap ;
/** Used to lookup unminified function names. */
var realNames = { } ;
/** Used to detect maps, sets, and weakmaps. */
var dataViewCtorString = toSource ( DataView ) ,
mapCtorString = toSource ( Map ) ,
promiseCtorString = toSource ( Promise ) ,
setCtorString = toSource ( Set ) ,
weakMapCtorString = toSource ( WeakMap ) ;
/** Used to convert symbols to primitives and strings. */
var symbolProto = Symbol ? Symbol . prototype : undefined ,
symbolValueOf = symbolProto ? symbolProto . valueOf : undefined ,
symbolToString = symbolProto ? symbolProto . toString : undefined ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a ` lodash ` object which wraps ` value ` to enable implicit method
* chain sequences . Methods that operate on and return arrays , collections ,
* and functions can be chained together . Methods that retrieve a single value
* or may return a primitive value will automatically end the chain sequence
* and return the unwrapped value . Otherwise , the value must be unwrapped
* with ` _#value ` .
*
* Explicit chain sequences , which must be unwrapped with ` _#value ` , may be
* enabled using ` _.chain ` .
*
* The execution of chained methods is lazy , that is , it ' s deferred until
* ` _#value ` is implicitly or explicitly called .
*
* Lazy evaluation allows several methods to support shortcut fusion .
* Shortcut fusion is an optimization to merge iteratee calls ; this avoids
* the creation of intermediate arrays and can greatly reduce the number of
* iteratee executions . Sections of a chain sequence qualify for shortcut
* fusion if the section is applied to an array and iteratees accept only
* one argument . The heuristic for whether a section qualifies for shortcut
* fusion is subject to change .
*
* Chaining is supported in custom builds as long as the ` _#value ` method is
* directly or indirectly included in the build .
*
* In addition to lodash methods , wrappers have ` Array ` and ` String ` methods .
*
* The wrapper ` Array ` methods are :
* ` concat ` , ` join ` , ` pop ` , ` push ` , ` shift ` , ` sort ` , ` splice ` , and ` unshift `
*
* The wrapper ` String ` methods are :
* ` replace ` and ` split `
*
* The wrapper methods that support shortcut fusion are :
* ` at ` , ` compact ` , ` drop ` , ` dropRight ` , ` dropWhile ` , ` filter ` , ` find ` ,
* ` findLast ` , ` head ` , ` initial ` , ` last ` , ` map ` , ` reject ` , ` reverse ` , ` slice ` ,
* ` tail ` , ` take ` , ` takeRight ` , ` takeRightWhile ` , ` takeWhile ` , and ` toArray `
*
* The chainable wrapper methods are :
* ` after ` , ` ary ` , ` assign ` , ` assignIn ` , ` assignInWith ` , ` assignWith ` , ` at ` ,
* ` before ` , ` bind ` , ` bindAll ` , ` bindKey ` , ` castArray ` , ` chain ` , ` chunk ` ,
* ` commit ` , ` compact ` , ` concat ` , ` conforms ` , ` constant ` , ` countBy ` , ` create ` ,
* ` curry ` , ` debounce ` , ` defaults ` , ` defaultsDeep ` , ` defer ` , ` delay ` ,
* ` difference ` , ` differenceBy ` , ` differenceWith ` , ` drop ` , ` dropRight ` ,
* ` dropRightWhile ` , ` dropWhile ` , ` extend ` , ` extendWith ` , ` fill ` , ` filter ` ,
* ` flatMap ` , ` flatMapDeep ` , ` flatMapDepth ` , ` flatten ` , ` flattenDeep ` ,
* ` flattenDepth ` , ` flip ` , ` flow ` , ` flowRight ` , ` fromPairs ` , ` functions ` ,
* ` functionsIn ` , ` groupBy ` , ` initial ` , ` intersection ` , ` intersectionBy ` ,
* ` intersectionWith ` , ` invert ` , ` invertBy ` , ` invokeMap ` , ` iteratee ` , ` keyBy ` ,
* ` keys ` , ` keysIn ` , ` map ` , ` mapKeys ` , ` mapValues ` , ` matches ` , ` matchesProperty ` ,
* ` memoize ` , ` merge ` , ` mergeWith ` , ` method ` , ` methodOf ` , ` mixin ` , ` negate ` ,
* ` nthArg ` , ` omit ` , ` omitBy ` , ` once ` , ` orderBy ` , ` over ` , ` overArgs ` ,
* ` overEvery ` , ` overSome ` , ` partial ` , ` partialRight ` , ` partition ` , ` pick ` ,
* ` pickBy ` , ` plant ` , ` property ` , ` propertyOf ` , ` pull ` , ` pullAll ` , ` pullAllBy ` ,
* ` pullAllWith ` , ` pullAt ` , ` push ` , ` range ` , ` rangeRight ` , ` rearg ` , ` reject ` ,
* ` remove ` , ` rest ` , ` reverse ` , ` sampleSize ` , ` set ` , ` setWith ` , ` shuffle ` ,
* ` slice ` , ` sort ` , ` sortBy ` , ` splice ` , ` spread ` , ` tail ` , ` take ` , ` takeRight ` ,
* ` takeRightWhile ` , ` takeWhile ` , ` tap ` , ` throttle ` , ` thru ` , ` toArray ` ,
* ` toPairs ` , ` toPairsIn ` , ` toPath ` , ` toPlainObject ` , ` transform ` , ` unary ` ,
* ` union ` , ` unionBy ` , ` unionWith ` , ` uniq ` , ` uniqBy ` , ` uniqWith ` , ` unset ` ,
* ` unshift ` , ` unzip ` , ` unzipWith ` , ` update ` , ` updateWith ` , ` values ` ,
* ` valuesIn ` , ` without ` , ` wrap ` , ` xor ` , ` xorBy ` , ` xorWith ` , ` zip ` ,
* ` zipObject ` , ` zipObjectDeep ` , and ` zipWith `
*
* The wrapper methods that are * * not * * chainable by default are :
* ` add ` , ` attempt ` , ` camelCase ` , ` capitalize ` , ` ceil ` , ` clamp ` , ` clone ` ,
* ` cloneDeep ` , ` cloneDeepWith ` , ` cloneWith ` , ` conformsTo ` , ` deburr ` ,
* ` defaultTo ` , ` divide ` , ` each ` , ` eachRight ` , ` endsWith ` , ` eq ` , ` escape ` ,
* ` escapeRegExp ` , ` every ` , ` find ` , ` findIndex ` , ` findKey ` , ` findLast ` ,
* ` findLastIndex ` , ` findLastKey ` , ` first ` , ` floor ` , ` forEach ` , ` forEachRight ` ,
* ` forIn ` , ` forInRight ` , ` forOwn ` , ` forOwnRight ` , ` get ` , ` gt ` , ` gte ` , ` has ` ,
* ` hasIn ` , ` head ` , ` identity ` , ` includes ` , ` indexOf ` , ` inRange ` , ` invoke ` ,
* ` isArguments ` , ` isArray ` , ` isArrayBuffer ` , ` isArrayLike ` , ` isArrayLikeObject ` ,
* ` isBoolean ` , ` isBuffer ` , ` isDate ` , ` isElement ` , ` isEmpty ` , ` isEqual ` ,
* ` isEqualWith ` , ` isError ` , ` isFinite ` , ` isFunction ` , ` isInteger ` , ` isLength ` ,
* ` isMap ` , ` isMatch ` , ` isMatchWith ` , ` isNaN ` , ` isNative ` , ` isNil ` , ` isNull ` ,
* ` isNumber ` , ` isObject ` , ` isObjectLike ` , ` isPlainObject ` , ` isRegExp ` ,
* ` isSafeInteger ` , ` isSet ` , ` isString ` , ` isUndefined ` , ` isTypedArray ` ,
* ` isWeakMap ` , ` isWeakSet ` , ` join ` , ` kebabCase ` , ` last ` , ` lastIndexOf ` ,
* ` lowerCase ` , ` lowerFirst ` , ` lt ` , ` lte ` , ` max ` , ` maxBy ` , ` mean ` , ` meanBy ` ,
* ` min ` , ` minBy ` , ` multiply ` , ` noConflict ` , ` noop ` , ` now ` , ` nth ` , ` pad ` ,
* ` padEnd ` , ` padStart ` , ` parseInt ` , ` pop ` , ` random ` , ` reduce ` , ` reduceRight ` ,
* ` repeat ` , ` result ` , ` round ` , ` runInContext ` , ` sample ` , ` shift ` , ` size ` ,
* ` snakeCase ` , ` some ` , ` sortedIndex ` , ` sortedIndexBy ` , ` sortedLastIndex ` ,
* ` sortedLastIndexBy ` , ` startCase ` , ` startsWith ` , ` stubArray ` , ` stubFalse ` ,
* ` stubObject ` , ` stubString ` , ` stubTrue ` , ` subtract ` , ` sum ` , ` sumBy ` ,
* ` template ` , ` times ` , ` toFinite ` , ` toInteger ` , ` toJSON ` , ` toLength ` ,
* ` toLower ` , ` toNumber ` , ` toSafeInteger ` , ` toString ` , ` toUpper ` , ` trim ` ,
* ` trimEnd ` , ` trimStart ` , ` truncate ` , ` unescape ` , ` uniqueId ` , ` upperCase ` ,
* ` upperFirst ` , ` value ` , and ` words `
*
* @ name _
* @ constructor
* @ category Seq
* @ param { * } value The value to wrap in a ` lodash ` instance .
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* function square ( n ) {
* return n * n ;
* }
*
* var wrapped = _ ( [ 1 , 2 , 3 ] ) ;
*
* // Returns an unwrapped value.
* wrapped . reduce ( _ . add ) ;
* // => 6
*
* // Returns a wrapped value.
* var squares = wrapped . map ( square ) ;
*
* _ . isArray ( squares ) ;
* // => false
*
* _ . isArray ( squares . value ( ) ) ;
* // => true
* /
function lodash ( value ) {
if ( isObjectLike ( value ) && ! isArray ( value ) && ! ( value instanceof LazyWrapper ) ) {
if ( value instanceof LodashWrapper ) {
return value ;
}
if ( hasOwnProperty . call ( value , '__wrapped__' ) ) {
return wrapperClone ( value ) ;
}
}
return new LodashWrapper ( value ) ;
}
/ * *
* The base implementation of ` _.create ` without support for assigning
* properties to the created object .
*
* @ private
* @ param { Object } proto The object to inherit from .
* @ returns { Object } Returns the new object .
* /
var baseCreate = ( function ( ) {
function object ( ) { }
return function ( proto ) {
if ( ! isObject ( proto ) ) {
return { } ;
}
if ( objectCreate ) {
return objectCreate ( proto ) ;
}
object . prototype = proto ;
var result = new object ;
object . prototype = undefined ;
return result ;
} ;
} ( ) ) ;
/ * *
* The function whose prototype chain sequence wrappers inherit from .
*
* @ private
* /
function baseLodash ( ) {
// No operation performed.
}
/ * *
* The base constructor for creating ` lodash ` wrapper objects .
*
* @ private
* @ param { * } value The value to wrap .
* @ param { boolean } [ chainAll ] Enable explicit method chain sequences .
* /
function LodashWrapper ( value , chainAll ) {
this . _ _wrapped _ _ = value ;
this . _ _actions _ _ = [ ] ;
this . _ _chain _ _ = ! ! chainAll ;
this . _ _index _ _ = 0 ;
this . _ _values _ _ = undefined ;
}
/ * *
* By default , the template delimiters used by lodash are like those in
* embedded Ruby ( ERB ) as well as ES2015 template strings . Change the
* following template settings to use alternative delimiters .
*
* @ static
* @ memberOf _
* @ type { Object }
* /
lodash . templateSettings = {
/ * *
* Used to detect ` data ` property values to be HTML - escaped .
*
* @ memberOf _ . templateSettings
* @ type { RegExp }
* /
'escape' : reEscape ,
/ * *
* Used to detect code to be evaluated .
*
* @ memberOf _ . templateSettings
* @ type { RegExp }
* /
'evaluate' : reEvaluate ,
/ * *
* Used to detect ` data ` property values to inject .
*
* @ memberOf _ . templateSettings
* @ type { RegExp }
* /
'interpolate' : reInterpolate ,
/ * *
* Used to reference the data object in the template text .
*
* @ memberOf _ . templateSettings
* @ type { string }
* /
'variable' : '' ,
/ * *
* Used to import variables into the compiled template .
*
* @ memberOf _ . templateSettings
* @ type { Object }
* /
'imports' : {
/ * *
* A reference to the ` lodash ` function .
*
* @ memberOf _ . templateSettings . imports
* @ type { Function }
* /
'_' : lodash
}
} ;
// Ensure wrappers are instances of `baseLodash`.
lodash . prototype = baseLodash . prototype ;
lodash . prototype . constructor = lodash ;
LodashWrapper . prototype = baseCreate ( baseLodash . prototype ) ;
LodashWrapper . prototype . constructor = LodashWrapper ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a lazy wrapper object which wraps ` value ` to enable lazy evaluation .
*
* @ private
* @ constructor
* @ param { * } value The value to wrap .
* /
function LazyWrapper ( value ) {
this . _ _wrapped _ _ = value ;
this . _ _actions _ _ = [ ] ;
this . _ _dir _ _ = 1 ;
this . _ _filtered _ _ = false ;
this . _ _iteratees _ _ = [ ] ;
this . _ _takeCount _ _ = MAX _ARRAY _LENGTH ;
this . _ _views _ _ = [ ] ;
}
/ * *
* Creates a clone of the lazy wrapper object .
*
* @ private
* @ name clone
* @ memberOf LazyWrapper
* @ returns { Object } Returns the cloned ` LazyWrapper ` object .
* /
function lazyClone ( ) {
var result = new LazyWrapper ( this . _ _wrapped _ _ ) ;
result . _ _actions _ _ = copyArray ( this . _ _actions _ _ ) ;
result . _ _dir _ _ = this . _ _dir _ _ ;
result . _ _filtered _ _ = this . _ _filtered _ _ ;
result . _ _iteratees _ _ = copyArray ( this . _ _iteratees _ _ ) ;
result . _ _takeCount _ _ = this . _ _takeCount _ _ ;
result . _ _views _ _ = copyArray ( this . _ _views _ _ ) ;
return result ;
}
/ * *
* Reverses the direction of lazy iteration .
*
* @ private
* @ name reverse
* @ memberOf LazyWrapper
* @ returns { Object } Returns the new reversed ` LazyWrapper ` object .
* /
function lazyReverse ( ) {
if ( this . _ _filtered _ _ ) {
var result = new LazyWrapper ( this ) ;
result . _ _dir _ _ = - 1 ;
result . _ _filtered _ _ = true ;
} else {
result = this . clone ( ) ;
result . _ _dir _ _ *= - 1 ;
}
return result ;
}
/ * *
* Extracts the unwrapped value from its lazy wrapper .
*
* @ private
* @ name value
* @ memberOf LazyWrapper
* @ returns { * } Returns the unwrapped value .
* /
function lazyValue ( ) {
var array = this . _ _wrapped _ _ . value ( ) ,
dir = this . _ _dir _ _ ,
isArr = isArray ( array ) ,
isRight = dir < 0 ,
arrLength = isArr ? array . length : 0 ,
view = getView ( 0 , arrLength , this . _ _views _ _ ) ,
start = view . start ,
end = view . end ,
length = end - start ,
index = isRight ? end : ( start - 1 ) ,
iteratees = this . _ _iteratees _ _ ,
iterLength = iteratees . length ,
resIndex = 0 ,
takeCount = nativeMin ( length , this . _ _takeCount _ _ ) ;
if ( ! isArr || ( ! isRight && arrLength == length && takeCount == length ) ) {
return baseWrapperValue ( array , this . _ _actions _ _ ) ;
}
var result = [ ] ;
outer :
while ( length -- && resIndex < takeCount ) {
index += dir ;
var iterIndex = - 1 ,
value = array [ index ] ;
while ( ++ iterIndex < iterLength ) {
var data = iteratees [ iterIndex ] ,
iteratee = data . iteratee ,
type = data . type ,
computed = iteratee ( value ) ;
if ( type == LAZY _MAP _FLAG ) {
value = computed ;
} else if ( ! computed ) {
if ( type == LAZY _FILTER _FLAG ) {
continue outer ;
} else {
break outer ;
}
}
}
result [ resIndex ++ ] = value ;
}
return result ;
}
// Ensure `LazyWrapper` is an instance of `baseLodash`.
LazyWrapper . prototype = baseCreate ( baseLodash . prototype ) ;
LazyWrapper . prototype . constructor = LazyWrapper ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a hash object .
*
* @ private
* @ constructor
* @ param { Array } [ entries ] The key - value pairs to cache .
* /
function Hash ( entries ) {
var index = - 1 ,
length = entries == null ? 0 : entries . length ;
this . clear ( ) ;
while ( ++ index < length ) {
var entry = entries [ index ] ;
this . set ( entry [ 0 ] , entry [ 1 ] ) ;
}
}
/ * *
* Removes all key - value entries from the hash .
*
* @ private
* @ name clear
* @ memberOf Hash
* /
function hashClear ( ) {
this . _ _data _ _ = nativeCreate ? nativeCreate ( null ) : { } ;
this . size = 0 ;
}
/ * *
* Removes ` key ` and its value from the hash .
*
* @ private
* @ name delete
* @ memberOf Hash
* @ param { Object } hash The hash to modify .
* @ param { string } key The key of the value to remove .
* @ returns { boolean } Returns ` true ` if the entry was removed , else ` false ` .
* /
function hashDelete ( key ) {
var result = this . has ( key ) && delete this . _ _data _ _ [ key ] ;
this . size -= result ? 1 : 0 ;
return result ;
}
/ * *
* Gets the hash value for ` key ` .
*
* @ private
* @ name get
* @ memberOf Hash
* @ param { string } key The key of the value to get .
* @ returns { * } Returns the entry value .
* /
function hashGet ( key ) {
var data = this . _ _data _ _ ;
if ( nativeCreate ) {
var result = data [ key ] ;
return result === HASH _UNDEFINED ? undefined : result ;
}
return hasOwnProperty . call ( data , key ) ? data [ key ] : undefined ;
}
/ * *
* Checks if a hash value for ` key ` exists .
*
* @ private
* @ name has
* @ memberOf Hash
* @ param { string } key The key of the entry to check .
* @ returns { boolean } Returns ` true ` if an entry for ` key ` exists , else ` false ` .
* /
function hashHas ( key ) {
var data = this . _ _data _ _ ;
return nativeCreate ? ( data [ key ] !== undefined ) : hasOwnProperty . call ( data , key ) ;
}
/ * *
* Sets the hash ` key ` to ` value ` .
*
* @ private
* @ name set
* @ memberOf Hash
* @ param { string } key The key of the value to set .
* @ param { * } value The value to set .
* @ returns { Object } Returns the hash instance .
* /
function hashSet ( key , value ) {
var data = this . _ _data _ _ ;
this . size += this . has ( key ) ? 0 : 1 ;
data [ key ] = ( nativeCreate && value === undefined ) ? HASH _UNDEFINED : value ;
return this ;
}
// Add methods to `Hash`.
Hash . prototype . clear = hashClear ;
Hash . prototype [ 'delete' ] = hashDelete ;
Hash . prototype . get = hashGet ;
Hash . prototype . has = hashHas ;
Hash . prototype . set = hashSet ;
/*------------------------------------------------------------------------*/
/ * *
* Creates an list cache object .
*
* @ private
* @ constructor
* @ param { Array } [ entries ] The key - value pairs to cache .
* /
function ListCache ( entries ) {
var index = - 1 ,
length = entries == null ? 0 : entries . length ;
this . clear ( ) ;
while ( ++ index < length ) {
var entry = entries [ index ] ;
this . set ( entry [ 0 ] , entry [ 1 ] ) ;
}
}
/ * *
* Removes all key - value entries from the list cache .
*
* @ private
* @ name clear
* @ memberOf ListCache
* /
function listCacheClear ( ) {
this . _ _data _ _ = [ ] ;
this . size = 0 ;
}
/ * *
* Removes ` key ` and its value from the list cache .
*
* @ private
* @ name delete
* @ memberOf ListCache
* @ param { string } key The key of the value to remove .
* @ returns { boolean } Returns ` true ` if the entry was removed , else ` false ` .
* /
function listCacheDelete ( key ) {
var data = this . _ _data _ _ ,
index = assocIndexOf ( data , key ) ;
if ( index < 0 ) {
return false ;
}
var lastIndex = data . length - 1 ;
if ( index == lastIndex ) {
data . pop ( ) ;
} else {
splice . call ( data , index , 1 ) ;
}
-- this . size ;
return true ;
}
/ * *
* Gets the list cache value for ` key ` .
*
* @ private
* @ name get
* @ memberOf ListCache
* @ param { string } key The key of the value to get .
* @ returns { * } Returns the entry value .
* /
function listCacheGet ( key ) {
var data = this . _ _data _ _ ,
index = assocIndexOf ( data , key ) ;
return index < 0 ? undefined : data [ index ] [ 1 ] ;
}
/ * *
* Checks if a list cache value for ` key ` exists .
*
* @ private
* @ name has
* @ memberOf ListCache
* @ param { string } key The key of the entry to check .
* @ returns { boolean } Returns ` true ` if an entry for ` key ` exists , else ` false ` .
* /
function listCacheHas ( key ) {
return assocIndexOf ( this . _ _data _ _ , key ) > - 1 ;
}
/ * *
* Sets the list cache ` key ` to ` value ` .
*
* @ private
* @ name set
* @ memberOf ListCache
* @ param { string } key The key of the value to set .
* @ param { * } value The value to set .
* @ returns { Object } Returns the list cache instance .
* /
function listCacheSet ( key , value ) {
var data = this . _ _data _ _ ,
index = assocIndexOf ( data , key ) ;
if ( index < 0 ) {
++ this . size ;
data . push ( [ key , value ] ) ;
} else {
data [ index ] [ 1 ] = value ;
}
return this ;
}
// Add methods to `ListCache`.
ListCache . prototype . clear = listCacheClear ;
ListCache . prototype [ 'delete' ] = listCacheDelete ;
ListCache . prototype . get = listCacheGet ;
ListCache . prototype . has = listCacheHas ;
ListCache . prototype . set = listCacheSet ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a map cache object to store key - value pairs .
*
* @ private
* @ constructor
* @ param { Array } [ entries ] The key - value pairs to cache .
* /
function MapCache ( entries ) {
var index = - 1 ,
length = entries == null ? 0 : entries . length ;
this . clear ( ) ;
while ( ++ index < length ) {
var entry = entries [ index ] ;
this . set ( entry [ 0 ] , entry [ 1 ] ) ;
}
}
/ * *
* Removes all key - value entries from the map .
*
* @ private
* @ name clear
* @ memberOf MapCache
* /
function mapCacheClear ( ) {
this . size = 0 ;
this . _ _data _ _ = {
'hash' : new Hash ,
'map' : new ( Map || ListCache ) ,
'string' : new Hash
} ;
}
/ * *
* Removes ` key ` and its value from the map .
*
* @ private
* @ name delete
* @ memberOf MapCache
* @ param { string } key The key of the value to remove .
* @ returns { boolean } Returns ` true ` if the entry was removed , else ` false ` .
* /
function mapCacheDelete ( key ) {
var result = getMapData ( this , key ) [ 'delete' ] ( key ) ;
this . size -= result ? 1 : 0 ;
return result ;
}
/ * *
* Gets the map value for ` key ` .
*
* @ private
* @ name get
* @ memberOf MapCache
* @ param { string } key The key of the value to get .
* @ returns { * } Returns the entry value .
* /
function mapCacheGet ( key ) {
return getMapData ( this , key ) . get ( key ) ;
}
/ * *
* Checks if a map value for ` key ` exists .
*
* @ private
* @ name has
* @ memberOf MapCache
* @ param { string } key The key of the entry to check .
* @ returns { boolean } Returns ` true ` if an entry for ` key ` exists , else ` false ` .
* /
function mapCacheHas ( key ) {
return getMapData ( this , key ) . has ( key ) ;
}
/ * *
* Sets the map ` key ` to ` value ` .
*
* @ private
* @ name set
* @ memberOf MapCache
* @ param { string } key The key of the value to set .
* @ param { * } value The value to set .
* @ returns { Object } Returns the map cache instance .
* /
function mapCacheSet ( key , value ) {
var data = getMapData ( this , key ) ,
size = data . size ;
data . set ( key , value ) ;
this . size += data . size == size ? 0 : 1 ;
return this ;
}
// Add methods to `MapCache`.
MapCache . prototype . clear = mapCacheClear ;
MapCache . prototype [ 'delete' ] = mapCacheDelete ;
MapCache . prototype . get = mapCacheGet ;
MapCache . prototype . has = mapCacheHas ;
MapCache . prototype . set = mapCacheSet ;
/*------------------------------------------------------------------------*/
/ * *
*
* Creates an array cache object to store unique values .
*
* @ private
* @ constructor
* @ param { Array } [ values ] The values to cache .
* /
function SetCache ( values ) {
var index = - 1 ,
length = values == null ? 0 : values . length ;
this . _ _data _ _ = new MapCache ;
while ( ++ index < length ) {
this . add ( values [ index ] ) ;
}
}
/ * *
* Adds ` value ` to the array cache .
*
* @ private
* @ name add
* @ memberOf SetCache
* @ alias push
* @ param { * } value The value to cache .
* @ returns { Object } Returns the cache instance .
* /
function setCacheAdd ( value ) {
this . _ _data _ _ . set ( value , HASH _UNDEFINED ) ;
return this ;
}
/ * *
* Checks if ` value ` is in the array cache .
*
* @ private
* @ name has
* @ memberOf SetCache
* @ param { * } value The value to search for .
* @ returns { number } Returns ` true ` if ` value ` is found , else ` false ` .
* /
function setCacheHas ( value ) {
return this . _ _data _ _ . has ( value ) ;
}
// Add methods to `SetCache`.
SetCache . prototype . add = SetCache . prototype . push = setCacheAdd ;
SetCache . prototype . has = setCacheHas ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a stack cache object to store key - value pairs .
*
* @ private
* @ constructor
* @ param { Array } [ entries ] The key - value pairs to cache .
* /
function Stack ( entries ) {
var data = this . _ _data _ _ = new ListCache ( entries ) ;
this . size = data . size ;
}
/ * *
* Removes all key - value entries from the stack .
*
* @ private
* @ name clear
* @ memberOf Stack
* /
function stackClear ( ) {
this . _ _data _ _ = new ListCache ;
this . size = 0 ;
}
/ * *
* Removes ` key ` and its value from the stack .
*
* @ private
* @ name delete
* @ memberOf Stack
* @ param { string } key The key of the value to remove .
* @ returns { boolean } Returns ` true ` if the entry was removed , else ` false ` .
* /
function stackDelete ( key ) {
var data = this . _ _data _ _ ,
result = data [ 'delete' ] ( key ) ;
this . size = data . size ;
return result ;
}
/ * *
* Gets the stack value for ` key ` .
*
* @ private
* @ name get
* @ memberOf Stack
* @ param { string } key The key of the value to get .
* @ returns { * } Returns the entry value .
* /
function stackGet ( key ) {
return this . _ _data _ _ . get ( key ) ;
}
/ * *
* Checks if a stack value for ` key ` exists .
*
* @ private
* @ name has
* @ memberOf Stack
* @ param { string } key The key of the entry to check .
* @ returns { boolean } Returns ` true ` if an entry for ` key ` exists , else ` false ` .
* /
function stackHas ( key ) {
return this . _ _data _ _ . has ( key ) ;
}
/ * *
* Sets the stack ` key ` to ` value ` .
*
* @ private
* @ name set
* @ memberOf Stack
* @ param { string } key The key of the value to set .
* @ param { * } value The value to set .
* @ returns { Object } Returns the stack cache instance .
* /
function stackSet ( key , value ) {
var data = this . _ _data _ _ ;
if ( data instanceof ListCache ) {
var pairs = data . _ _data _ _ ;
if ( ! Map || ( pairs . length < LARGE _ARRAY _SIZE - 1 ) ) {
pairs . push ( [ key , value ] ) ;
this . size = ++ data . size ;
return this ;
}
data = this . _ _data _ _ = new MapCache ( pairs ) ;
}
data . set ( key , value ) ;
this . size = data . size ;
return this ;
}
// Add methods to `Stack`.
Stack . prototype . clear = stackClear ;
Stack . prototype [ 'delete' ] = stackDelete ;
Stack . prototype . get = stackGet ;
Stack . prototype . has = stackHas ;
Stack . prototype . set = stackSet ;
/*------------------------------------------------------------------------*/
/ * *
* Creates an array of the enumerable property names of the array - like ` value ` .
*
* @ private
* @ param { * } value The value to query .
* @ param { boolean } inherited Specify returning inherited property names .
* @ returns { Array } Returns the array of property names .
* /
function arrayLikeKeys ( value , inherited ) {
var isArr = isArray ( value ) ,
isArg = ! isArr && isArguments ( value ) ,
isBuff = ! isArr && ! isArg && isBuffer ( value ) ,
isType = ! isArr && ! isArg && ! isBuff && isTypedArray ( value ) ,
skipIndexes = isArr || isArg || isBuff || isType ,
result = skipIndexes ? baseTimes ( value . length , String ) : [ ] ,
length = result . length ;
for ( var key in value ) {
if ( ( inherited || hasOwnProperty . call ( value , key ) ) &&
! ( skipIndexes && (
// Safari 9 has enumerable `arguments.length` in strict mode.
key == 'length' ||
// Node.js 0.10 has enumerable non-index properties on buffers.
( isBuff && ( key == 'offset' || key == 'parent' ) ) ||
// PhantomJS 2 has enumerable non-index properties on typed arrays.
( isType && ( key == 'buffer' || key == 'byteLength' || key == 'byteOffset' ) ) ||
// Skip index properties.
isIndex ( key , length )
) ) ) {
result . push ( key ) ;
}
}
return result ;
}
/ * *
* A specialized version of ` _.sample ` for arrays .
*
* @ private
* @ param { Array } array The array to sample .
* @ returns { * } Returns the random element .
* /
function arraySample ( array ) {
var length = array . length ;
return length ? array [ baseRandom ( 0 , length - 1 ) ] : undefined ;
}
/ * *
* A specialized version of ` _.sampleSize ` for arrays .
*
* @ private
* @ param { Array } array The array to sample .
* @ param { number } n The number of elements to sample .
* @ returns { Array } Returns the random elements .
* /
function arraySampleSize ( array , n ) {
return shuffleSelf ( copyArray ( array ) , baseClamp ( n , 0 , array . length ) ) ;
}
/ * *
* A specialized version of ` _.shuffle ` for arrays .
*
* @ private
* @ param { Array } array The array to shuffle .
* @ returns { Array } Returns the new shuffled array .
* /
function arrayShuffle ( array ) {
return shuffleSelf ( copyArray ( array ) ) ;
}
/ * *
* This function is like ` assignValue ` except that it doesn ' t assign
* ` undefined ` values .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { string } key The key of the property to assign .
* @ param { * } value The value to assign .
* /
function assignMergeValue ( object , key , value ) {
if ( ( value !== undefined && ! eq ( object [ key ] , value ) ) ||
( value === undefined && ! ( key in object ) ) ) {
baseAssignValue ( object , key , value ) ;
}
}
/ * *
* Assigns ` value ` to ` key ` of ` object ` if the existing value is not equivalent
* using [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { string } key The key of the property to assign .
* @ param { * } value The value to assign .
* /
function assignValue ( object , key , value ) {
var objValue = object [ key ] ;
if ( ! ( hasOwnProperty . call ( object , key ) && eq ( objValue , value ) ) ||
( value === undefined && ! ( key in object ) ) ) {
baseAssignValue ( object , key , value ) ;
}
}
/ * *
* Gets the index at which the ` key ` is found in ` array ` of key - value pairs .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { * } key The key to search for .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* /
function assocIndexOf ( array , key ) {
var length = array . length ;
while ( length -- ) {
if ( eq ( array [ length ] [ 0 ] , key ) ) {
return length ;
}
}
return - 1 ;
}
/ * *
* Aggregates elements of ` collection ` on ` accumulator ` with keys transformed
* by ` iteratee ` and values set by ` setter ` .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } setter The function to set ` accumulator ` values .
* @ param { Function } iteratee The iteratee to transform keys .
* @ param { Object } accumulator The initial aggregated object .
* @ returns { Function } Returns ` accumulator ` .
* /
function baseAggregator ( collection , setter , iteratee , accumulator ) {
baseEach ( collection , function ( value , key , collection ) {
setter ( accumulator , value , iteratee ( value ) , collection ) ;
} ) ;
return accumulator ;
}
/ * *
* The base implementation of ` _.assign ` without support for multiple sources
* or ` customizer ` functions .
*
* @ private
* @ param { Object } object The destination object .
* @ param { Object } source The source object .
* @ returns { Object } Returns ` object ` .
* /
function baseAssign ( object , source ) {
return object && copyObject ( source , keys ( source ) , object ) ;
}
/ * *
* The base implementation of ` _.assignIn ` without support for multiple sources
* or ` customizer ` functions .
*
* @ private
* @ param { Object } object The destination object .
* @ param { Object } source The source object .
* @ returns { Object } Returns ` object ` .
* /
function baseAssignIn ( object , source ) {
return object && copyObject ( source , keysIn ( source ) , object ) ;
}
/ * *
* The base implementation of ` assignValue ` and ` assignMergeValue ` without
* value checks .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { string } key The key of the property to assign .
* @ param { * } value The value to assign .
* /
function baseAssignValue ( object , key , value ) {
if ( key == '__proto__' && defineProperty ) {
defineProperty ( object , key , {
'configurable' : true ,
'enumerable' : true ,
'value' : value ,
'writable' : true
} ) ;
} else {
object [ key ] = value ;
}
}
/ * *
* The base implementation of ` _.at ` without support for individual paths .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { string [ ] } paths The property paths to pick .
* @ returns { Array } Returns the picked elements .
* /
function baseAt ( object , paths ) {
var index = - 1 ,
length = paths . length ,
result = Array ( length ) ,
skip = object == null ;
while ( ++ index < length ) {
result [ index ] = skip ? undefined : get ( object , paths [ index ] ) ;
}
return result ;
}
/ * *
* The base implementation of ` _.clamp ` which doesn ' t coerce arguments .
*
* @ private
* @ param { number } number The number to clamp .
* @ param { number } [ lower ] The lower bound .
* @ param { number } upper The upper bound .
* @ returns { number } Returns the clamped number .
* /
function baseClamp ( number , lower , upper ) {
if ( number === number ) {
if ( upper !== undefined ) {
number = number <= upper ? number : upper ;
}
if ( lower !== undefined ) {
number = number >= lower ? number : lower ;
}
}
return number ;
}
/ * *
* The base implementation of ` _.clone ` and ` _.cloneDeep ` which tracks
* traversed objects .
*
* @ private
* @ param { * } value The value to clone .
* @ param { boolean } bitmask The bitmask flags .
* 1 - Deep clone
* 2 - Flatten inherited properties
* 4 - Clone symbols
* @ param { Function } [ customizer ] The function to customize cloning .
* @ param { string } [ key ] The key of ` value ` .
* @ param { Object } [ object ] The parent object of ` value ` .
* @ param { Object } [ stack ] Tracks traversed objects and their clone counterparts .
* @ returns { * } Returns the cloned value .
* /
function baseClone ( value , bitmask , customizer , key , object , stack ) {
var result ,
isDeep = bitmask & CLONE _DEEP _FLAG ,
isFlat = bitmask & CLONE _FLAT _FLAG ,
isFull = bitmask & CLONE _SYMBOLS _FLAG ;
if ( customizer ) {
result = object ? customizer ( value , key , object , stack ) : customizer ( value ) ;
}
if ( result !== undefined ) {
return result ;
}
if ( ! isObject ( value ) ) {
return value ;
}
var isArr = isArray ( value ) ;
if ( isArr ) {
result = initCloneArray ( value ) ;
if ( ! isDeep ) {
return copyArray ( value , result ) ;
}
} else {
var tag = getTag ( value ) ,
isFunc = tag == funcTag || tag == genTag ;
if ( isBuffer ( value ) ) {
return cloneBuffer ( value , isDeep ) ;
}
if ( tag == objectTag || tag == argsTag || ( isFunc && ! object ) ) {
result = ( isFlat || isFunc ) ? { } : initCloneObject ( value ) ;
if ( ! isDeep ) {
return isFlat ?
copySymbolsIn ( value , baseAssignIn ( result , value ) ) :
copySymbols ( value , baseAssign ( result , value ) ) ;
}
} else {
if ( ! cloneableTags [ tag ] ) {
return object ? value : { } ;
}
result = initCloneByTag ( value , tag , baseClone , isDeep ) ;
}
}
// Check for circular references and return its corresponding clone.
stack || ( stack = new Stack ) ;
var stacked = stack . get ( value ) ;
if ( stacked ) {
return stacked ;
}
stack . set ( value , result ) ;
var keysFunc = isFull ?
( isFlat ? getAllKeysIn : getAllKeys ) :
( isFlat ? keysIn : keys ) ;
var props = isArr ? undefined : keysFunc ( value ) ;
arrayEach ( props || value , function ( subValue , key ) {
if ( props ) {
key = subValue ;
subValue = value [ key ] ;
}
// Recursively populate clone (susceptible to call stack limits).
assignValue ( result , key , baseClone ( subValue , bitmask , customizer , key , value , stack ) ) ;
} ) ;
return result ;
}
/ * *
* The base implementation of ` _.conforms ` which doesn ' t clone ` source ` .
*
* @ private
* @ param { Object } source The object of property predicates to conform to .
* @ returns { Function } Returns the new spec function .
* /
function baseConforms ( source ) {
var props = keys ( source ) ;
return function ( object ) {
return baseConformsTo ( object , source , props ) ;
} ;
}
/ * *
* The base implementation of ` _.conformsTo ` which accepts ` props ` to check .
*
* @ private
* @ param { Object } object The object to inspect .
* @ param { Object } source The object of property predicates to conform to .
* @ returns { boolean } Returns ` true ` if ` object ` conforms , else ` false ` .
* /
function baseConformsTo ( object , source , props ) {
var length = props . length ;
if ( object == null ) {
return ! length ;
}
object = Object ( object ) ;
while ( length -- ) {
var key = props [ length ] ,
predicate = source [ key ] ,
value = object [ key ] ;
if ( ( value === undefined && ! ( key in object ) ) || ! predicate ( value ) ) {
return false ;
}
}
return true ;
}
/ * *
* The base implementation of ` _.delay ` and ` _.defer ` which accepts ` args `
* to provide to ` func ` .
*
* @ private
* @ param { Function } func The function to delay .
* @ param { number } wait The number of milliseconds to delay invocation .
* @ param { Array } args The arguments to provide to ` func ` .
* @ returns { number | Object } Returns the timer id or timeout object .
* /
function baseDelay ( func , wait , args ) {
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
return setTimeout ( function ( ) { func . apply ( undefined , args ) ; } , wait ) ;
}
/ * *
* The base implementation of methods like ` _.difference ` without support
* for excluding multiple arrays or iteratee shorthands .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { Array } values The values to exclude .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of filtered values .
* /
function baseDifference ( array , values , iteratee , comparator ) {
var index = - 1 ,
includes = arrayIncludes ,
isCommon = true ,
length = array . length ,
result = [ ] ,
valuesLength = values . length ;
if ( ! length ) {
return result ;
}
if ( iteratee ) {
values = arrayMap ( values , baseUnary ( iteratee ) ) ;
}
if ( comparator ) {
includes = arrayIncludesWith ;
isCommon = false ;
} else if ( values . length >= LARGE _ARRAY _SIZE ) {
includes = cacheHas ;
isCommon = false ;
values = new SetCache ( values ) ;
}
outer :
while ( ++ index < length ) {
var value = array [ index ] ,
computed = iteratee == null ? value : iteratee ( value ) ;
value = ( comparator || value !== 0 ) ? value : 0 ;
if ( isCommon && computed === computed ) {
var valuesIndex = valuesLength ;
while ( valuesIndex -- ) {
if ( values [ valuesIndex ] === computed ) {
continue outer ;
}
}
result . push ( value ) ;
} else if ( ! includes ( values , computed , comparator ) ) {
result . push ( value ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.forEach ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array | Object } Returns ` collection ` .
* /
var baseEach = createBaseEach ( baseForOwn ) ;
/ * *
* The base implementation of ` _.forEachRight ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array | Object } Returns ` collection ` .
* /
var baseEachRight = createBaseEach ( baseForOwnRight , true ) ;
/ * *
* The base implementation of ` _.every ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { boolean } Returns ` true ` if all elements pass the predicate check ,
* else ` false `
* /
function baseEvery ( collection , predicate ) {
var result = true ;
baseEach ( collection , function ( value , index , collection ) {
result = ! ! predicate ( value , index , collection ) ;
return result ;
} ) ;
return result ;
}
/ * *
* The base implementation of methods like ` _.max ` and ` _.min ` which accepts a
* ` comparator ` to determine the extremum value .
*
* @ private
* @ param { Array } array The array to iterate over .
* @ param { Function } iteratee The iteratee invoked per iteration .
* @ param { Function } comparator The comparator used to compare values .
* @ returns { * } Returns the extremum value .
* /
function baseExtremum ( array , iteratee , comparator ) {
var index = - 1 ,
length = array . length ;
while ( ++ index < length ) {
var value = array [ index ] ,
current = iteratee ( value ) ;
if ( current != null && ( computed === undefined ?
( current === current && ! isSymbol ( current ) ) :
comparator ( current , computed )
) ) {
var computed = current ,
result = value ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.fill ` without an iteratee call guard .
*
* @ private
* @ param { Array } array The array to fill .
* @ param { * } value The value to fill ` array ` with .
* @ param { number } [ start = 0 ] The start position .
* @ param { number } [ end = array . length ] The end position .
* @ returns { Array } Returns ` array ` .
* /
function baseFill ( array , value , start , end ) {
var length = array . length ;
start = toInteger ( start ) ;
if ( start < 0 ) {
start = - start > length ? 0 : ( length + start ) ;
}
end = ( end === undefined || end > length ) ? length : toInteger ( end ) ;
if ( end < 0 ) {
end += length ;
}
end = start > end ? 0 : toLength ( end ) ;
while ( start < end ) {
array [ start ++ ] = value ;
}
return array ;
}
/ * *
* The base implementation of ` _.filter ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { Array } Returns the new filtered array .
* /
function baseFilter ( collection , predicate ) {
var result = [ ] ;
baseEach ( collection , function ( value , index , collection ) {
if ( predicate ( value , index , collection ) ) {
result . push ( value ) ;
}
} ) ;
return result ;
}
/ * *
* The base implementation of ` _.flatten ` with support for restricting flattening .
*
* @ private
* @ param { Array } array The array to flatten .
* @ param { number } depth The maximum recursion depth .
* @ param { boolean } [ predicate = isFlattenable ] The function invoked per iteration .
* @ param { boolean } [ isStrict ] Restrict to values that pass ` predicate ` checks .
* @ param { Array } [ result = [ ] ] The initial result value .
* @ returns { Array } Returns the new flattened array .
* /
function baseFlatten ( array , depth , predicate , isStrict , result ) {
var index = - 1 ,
length = array . length ;
predicate || ( predicate = isFlattenable ) ;
result || ( result = [ ] ) ;
while ( ++ index < length ) {
var value = array [ index ] ;
if ( depth > 0 && predicate ( value ) ) {
if ( depth > 1 ) {
// Recursively flatten arrays (susceptible to call stack limits).
baseFlatten ( value , depth - 1 , predicate , isStrict , result ) ;
} else {
arrayPush ( result , value ) ;
}
} else if ( ! isStrict ) {
result [ result . length ] = value ;
}
}
return result ;
}
/ * *
* The base implementation of ` baseForOwn ` which iterates over ` object `
* properties returned by ` keysFunc ` and invokes ` iteratee ` for each property .
* Iteratee functions may exit iteration early by explicitly returning ` false ` .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ param { Function } keysFunc The function to get the keys of ` object ` .
* @ returns { Object } Returns ` object ` .
* /
var baseFor = createBaseFor ( ) ;
/ * *
* This function is like ` baseFor ` except that it iterates over properties
* in the opposite order .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ param { Function } keysFunc The function to get the keys of ` object ` .
* @ returns { Object } Returns ` object ` .
* /
var baseForRight = createBaseFor ( true ) ;
/ * *
* The base implementation of ` _.forOwn ` without support for iteratee shorthands .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* /
function baseForOwn ( object , iteratee ) {
return object && baseFor ( object , iteratee , keys ) ;
}
/ * *
* The base implementation of ` _.forOwnRight ` without support for iteratee shorthands .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* /
function baseForOwnRight ( object , iteratee ) {
return object && baseForRight ( object , iteratee , keys ) ;
}
/ * *
* The base implementation of ` _.functions ` which creates an array of
* ` object ` function property names filtered from ` props ` .
*
* @ private
* @ param { Object } object The object to inspect .
* @ param { Array } props The property names to filter .
* @ returns { Array } Returns the function names .
* /
function baseFunctions ( object , props ) {
return arrayFilter ( props , function ( key ) {
return isFunction ( object [ key ] ) ;
} ) ;
}
/ * *
* The base implementation of ` _.get ` without support for default values .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array | string } path The path of the property to get .
* @ returns { * } Returns the resolved value .
* /
function baseGet ( object , path ) {
path = castPath ( path , object ) ;
var index = 0 ,
length = path . length ;
while ( object != null && index < length ) {
object = object [ toKey ( path [ index ++ ] ) ] ;
}
return ( index && index == length ) ? object : undefined ;
}
/ * *
* The base implementation of ` getAllKeys ` and ` getAllKeysIn ` which uses
* ` keysFunc ` and ` symbolsFunc ` to get the enumerable property names and
* symbols of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Function } keysFunc The function to get the keys of ` object ` .
* @ param { Function } symbolsFunc The function to get the symbols of ` object ` .
* @ returns { Array } Returns the array of property names and symbols .
* /
function baseGetAllKeys ( object , keysFunc , symbolsFunc ) {
var result = keysFunc ( object ) ;
return isArray ( object ) ? result : arrayPush ( result , symbolsFunc ( object ) ) ;
}
/ * *
* The base implementation of ` getTag ` without fallbacks for buggy environments .
*
* @ private
* @ param { * } value The value to query .
* @ returns { string } Returns the ` toStringTag ` .
* /
function baseGetTag ( value ) {
if ( value == null ) {
return value === undefined ? undefinedTag : nullTag ;
}
return ( symToStringTag && symToStringTag in Object ( value ) ) ?
getRawTag ( value ) :
objectToString ( value ) ;
}
/ * *
* The base implementation of ` _.gt ` which doesn ' t coerce arguments .
*
* @ private
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is greater than ` other ` ,
* else ` false ` .
* /
function baseGt ( value , other ) {
return value > other ;
}
/ * *
* The base implementation of ` _.has ` without support for deep paths .
*
* @ private
* @ param { Object } [ object ] The object to query .
* @ param { Array | string } key The key to check .
* @ returns { boolean } Returns ` true ` if ` key ` exists , else ` false ` .
* /
function baseHas ( object , key ) {
return object != null && hasOwnProperty . call ( object , key ) ;
}
/ * *
* The base implementation of ` _.hasIn ` without support for deep paths .
*
* @ private
* @ param { Object } [ object ] The object to query .
* @ param { Array | string } key The key to check .
* @ returns { boolean } Returns ` true ` if ` key ` exists , else ` false ` .
* /
function baseHasIn ( object , key ) {
return object != null && key in Object ( object ) ;
}
/ * *
* The base implementation of ` _.inRange ` which doesn ' t coerce arguments .
*
* @ private
* @ param { number } number The number to check .
* @ param { number } start The start of the range .
* @ param { number } end The end of the range .
* @ returns { boolean } Returns ` true ` if ` number ` is in the range , else ` false ` .
* /
function baseInRange ( number , start , end ) {
return number >= nativeMin ( start , end ) && number < nativeMax ( start , end ) ;
}
/ * *
* The base implementation of methods like ` _.intersection ` , without support
* for iteratee shorthands , that accepts an array of arrays to inspect .
*
* @ private
* @ param { Array } arrays The arrays to inspect .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of shared values .
* /
function baseIntersection ( arrays , iteratee , comparator ) {
var includes = comparator ? arrayIncludesWith : arrayIncludes ,
length = arrays [ 0 ] . length ,
othLength = arrays . length ,
othIndex = othLength ,
caches = Array ( othLength ) ,
maxLength = Infinity ,
result = [ ] ;
while ( othIndex -- ) {
var array = arrays [ othIndex ] ;
if ( othIndex && iteratee ) {
array = arrayMap ( array , baseUnary ( iteratee ) ) ;
}
maxLength = nativeMin ( array . length , maxLength ) ;
caches [ othIndex ] = ! comparator && ( iteratee || ( length >= 120 && array . length >= 120 ) ) ?
new SetCache ( othIndex && array ) :
undefined ;
}
array = arrays [ 0 ] ;
var index = - 1 ,
seen = caches [ 0 ] ;
outer :
while ( ++ index < length && result . length < maxLength ) {
var value = array [ index ] ,
computed = iteratee ? iteratee ( value ) : value ;
value = ( comparator || value !== 0 ) ? value : 0 ;
if ( ! ( seen ?
cacheHas ( seen , computed ) :
includes ( result , computed , comparator )
) ) {
othIndex = othLength ;
while ( -- othIndex ) {
var cache = caches [ othIndex ] ;
if ( ! ( cache ?
cacheHas ( cache , computed ) :
includes ( arrays [ othIndex ] , computed , comparator ) ) ) {
continue outer ;
}
}
if ( seen ) {
seen . push ( computed ) ;
}
result . push ( value ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.invert ` and ` _.invertBy ` which inverts
* ` object ` with values transformed by ` iteratee ` and set by ` setter ` .
*
* @ private
* @ param { Object } object The object to iterate over .
* @ param { Function } setter The function to set ` accumulator ` values .
* @ param { Function } iteratee The iteratee to transform values .
* @ param { Object } accumulator The initial inverted object .
* @ returns { Function } Returns ` accumulator ` .
* /
function baseInverter ( object , setter , iteratee , accumulator ) {
baseForOwn ( object , function ( value , key , object ) {
setter ( accumulator , iteratee ( value ) , key , object ) ;
} ) ;
return accumulator ;
}
/ * *
* The base implementation of ` _.invoke ` without support for individual
* method arguments .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array | string } path The path of the method to invoke .
* @ param { Array } args The arguments to invoke the method with .
* @ returns { * } Returns the result of the invoked method .
* /
function baseInvoke ( object , path , args ) {
path = castPath ( path , object ) ;
object = parent ( object , path ) ;
var func = object == null ? object : object [ toKey ( last ( path ) ) ] ;
return func == null ? undefined : apply ( func , object , args ) ;
}
/ * *
* The base implementation of ` _.isArguments ` .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an ` arguments ` object ,
* /
function baseIsArguments ( value ) {
return isObjectLike ( value ) && baseGetTag ( value ) == argsTag ;
}
/ * *
* The base implementation of ` _.isArrayBuffer ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an array buffer , else ` false ` .
* /
function baseIsArrayBuffer ( value ) {
return isObjectLike ( value ) && baseGetTag ( value ) == arrayBufferTag ;
}
/ * *
* The base implementation of ` _.isDate ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a date object , else ` false ` .
* /
function baseIsDate ( value ) {
return isObjectLike ( value ) && baseGetTag ( value ) == dateTag ;
}
/ * *
* The base implementation of ` _.isEqual ` which supports partial comparisons
* and tracks traversed objects .
*
* @ private
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ param { boolean } bitmask The bitmask flags .
* 1 - Unordered comparison
* 2 - Partial comparison
* @ param { Function } [ customizer ] The function to customize comparisons .
* @ param { Object } [ stack ] Tracks traversed ` value ` and ` other ` objects .
* @ returns { boolean } Returns ` true ` if the values are equivalent , else ` false ` .
* /
function baseIsEqual ( value , other , bitmask , customizer , stack ) {
if ( value === other ) {
return true ;
}
if ( value == null || other == null || ( ! isObjectLike ( value ) && ! isObjectLike ( other ) ) ) {
return value !== value && other !== other ;
}
return baseIsEqualDeep ( value , other , bitmask , customizer , baseIsEqual , stack ) ;
}
/ * *
* A specialized version of ` baseIsEqual ` for arrays and objects which performs
* deep comparisons and tracks traversed objects enabling objects with circular
* references to be compared .
*
* @ private
* @ param { Object } object The object to compare .
* @ param { Object } other The other object to compare .
* @ param { number } bitmask The bitmask flags . See ` baseIsEqual ` for more details .
* @ param { Function } customizer The function to customize comparisons .
* @ param { Function } equalFunc The function to determine equivalents of values .
* @ param { Object } [ stack ] Tracks traversed ` object ` and ` other ` objects .
* @ returns { boolean } Returns ` true ` if the objects are equivalent , else ` false ` .
* /
function baseIsEqualDeep ( object , other , bitmask , customizer , equalFunc , stack ) {
var objIsArr = isArray ( object ) ,
othIsArr = isArray ( other ) ,
objTag = objIsArr ? arrayTag : getTag ( object ) ,
othTag = othIsArr ? arrayTag : getTag ( other ) ;
objTag = objTag == argsTag ? objectTag : objTag ;
othTag = othTag == argsTag ? objectTag : othTag ;
var objIsObj = objTag == objectTag ,
othIsObj = othTag == objectTag ,
isSameTag = objTag == othTag ;
if ( isSameTag && isBuffer ( object ) ) {
if ( ! isBuffer ( other ) ) {
return false ;
}
objIsArr = true ;
objIsObj = false ;
}
if ( isSameTag && ! objIsObj ) {
stack || ( stack = new Stack ) ;
return ( objIsArr || isTypedArray ( object ) ) ?
equalArrays ( object , other , bitmask , customizer , equalFunc , stack ) :
equalByTag ( object , other , objTag , bitmask , customizer , equalFunc , stack ) ;
}
if ( ! ( bitmask & COMPARE _PARTIAL _FLAG ) ) {
var objIsWrapped = objIsObj && hasOwnProperty . call ( object , '__wrapped__' ) ,
othIsWrapped = othIsObj && hasOwnProperty . call ( other , '__wrapped__' ) ;
if ( objIsWrapped || othIsWrapped ) {
var objUnwrapped = objIsWrapped ? object . value ( ) : object ,
othUnwrapped = othIsWrapped ? other . value ( ) : other ;
stack || ( stack = new Stack ) ;
return equalFunc ( objUnwrapped , othUnwrapped , bitmask , customizer , stack ) ;
}
}
if ( ! isSameTag ) {
return false ;
}
stack || ( stack = new Stack ) ;
return equalObjects ( object , other , bitmask , customizer , equalFunc , stack ) ;
}
/ * *
* The base implementation of ` _.isMap ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a map , else ` false ` .
* /
function baseIsMap ( value ) {
return isObjectLike ( value ) && getTag ( value ) == mapTag ;
}
/ * *
* The base implementation of ` _.isMatch ` without support for iteratee shorthands .
*
* @ private
* @ param { Object } object The object to inspect .
* @ param { Object } source The object of property values to match .
* @ param { Array } matchData The property names , values , and compare flags to match .
* @ param { Function } [ customizer ] The function to customize comparisons .
* @ returns { boolean } Returns ` true ` if ` object ` is a match , else ` false ` .
* /
function baseIsMatch ( object , source , matchData , customizer ) {
var index = matchData . length ,
length = index ,
noCustomizer = ! customizer ;
if ( object == null ) {
return ! length ;
}
object = Object ( object ) ;
while ( index -- ) {
var data = matchData [ index ] ;
if ( ( noCustomizer && data [ 2 ] ) ?
data [ 1 ] !== object [ data [ 0 ] ] :
! ( data [ 0 ] in object )
) {
return false ;
}
}
while ( ++ index < length ) {
data = matchData [ index ] ;
var key = data [ 0 ] ,
objValue = object [ key ] ,
srcValue = data [ 1 ] ;
if ( noCustomizer && data [ 2 ] ) {
if ( objValue === undefined && ! ( key in object ) ) {
return false ;
}
} else {
var stack = new Stack ;
if ( customizer ) {
var result = customizer ( objValue , srcValue , key , object , source , stack ) ;
}
if ( ! ( result === undefined ?
baseIsEqual ( srcValue , objValue , COMPARE _PARTIAL _FLAG | COMPARE _UNORDERED _FLAG , customizer , stack ) :
result
) ) {
return false ;
}
}
}
return true ;
}
/ * *
* The base implementation of ` _.isNative ` without bad shim checks .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a native function ,
* else ` false ` .
* /
function baseIsNative ( value ) {
if ( ! isObject ( value ) || isMasked ( value ) ) {
return false ;
}
var pattern = isFunction ( value ) ? reIsNative : reIsHostCtor ;
return pattern . test ( toSource ( value ) ) ;
}
/ * *
* The base implementation of ` _.isRegExp ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a regexp , else ` false ` .
* /
function baseIsRegExp ( value ) {
return isObjectLike ( value ) && baseGetTag ( value ) == regexpTag ;
}
/ * *
* The base implementation of ` _.isSet ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a set , else ` false ` .
* /
function baseIsSet ( value ) {
return isObjectLike ( value ) && getTag ( value ) == setTag ;
}
/ * *
* The base implementation of ` _.isTypedArray ` without Node . js optimizations .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a typed array , else ` false ` .
* /
function baseIsTypedArray ( value ) {
return isObjectLike ( value ) &&
isLength ( value . length ) && ! ! typedArrayTags [ baseGetTag ( value ) ] ;
}
/ * *
* The base implementation of ` _.iteratee ` .
*
* @ private
* @ param { * } [ value = _ . identity ] The value to convert to an iteratee .
* @ returns { Function } Returns the iteratee .
* /
function baseIteratee ( value ) {
// Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
// See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
if ( typeof value == 'function' ) {
return value ;
}
if ( value == null ) {
return identity ;
}
if ( typeof value == 'object' ) {
return isArray ( value ) ?
baseMatchesProperty ( value [ 0 ] , value [ 1 ] ) :
baseMatches ( value ) ;
}
return property ( value ) ;
}
/ * *
* The base implementation of ` _.keys ` which doesn ' t treat sparse arrays as dense .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names .
* /
function baseKeys ( object ) {
if ( ! isPrototype ( object ) ) {
return nativeKeys ( object ) ;
}
var result = [ ] ;
for ( var key in Object ( object ) ) {
if ( hasOwnProperty . call ( object , key ) && key != 'constructor' ) {
result . push ( key ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.keysIn ` which doesn ' t treat sparse arrays as dense .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names .
* /
function baseKeysIn ( object ) {
if ( ! isObject ( object ) ) {
return nativeKeysIn ( object ) ;
}
var isProto = isPrototype ( object ) ,
result = [ ] ;
for ( var key in object ) {
if ( ! ( key == 'constructor' && ( isProto || ! hasOwnProperty . call ( object , key ) ) ) ) {
result . push ( key ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.lt ` which doesn ' t coerce arguments .
*
* @ private
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is less than ` other ` ,
* else ` false ` .
* /
function baseLt ( value , other ) {
return value < other ;
}
/ * *
* The base implementation of ` _.map ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } iteratee The function invoked per iteration .
* @ returns { Array } Returns the new mapped array .
* /
function baseMap ( collection , iteratee ) {
var index = - 1 ,
result = isArrayLike ( collection ) ? Array ( collection . length ) : [ ] ;
baseEach ( collection , function ( value , key , collection ) {
result [ ++ index ] = iteratee ( value , key , collection ) ;
} ) ;
return result ;
}
/ * *
* The base implementation of ` _.matches ` which doesn ' t clone ` source ` .
*
* @ private
* @ param { Object } source The object of property values to match .
* @ returns { Function } Returns the new spec function .
* /
function baseMatches ( source ) {
var matchData = getMatchData ( source ) ;
if ( matchData . length == 1 && matchData [ 0 ] [ 2 ] ) {
return matchesStrictComparable ( matchData [ 0 ] [ 0 ] , matchData [ 0 ] [ 1 ] ) ;
}
return function ( object ) {
return object === source || baseIsMatch ( object , source , matchData ) ;
} ;
}
/ * *
* The base implementation of ` _.matchesProperty ` which doesn ' t clone ` srcValue ` .
*
* @ private
* @ param { string } path The path of the property to get .
* @ param { * } srcValue The value to match .
* @ returns { Function } Returns the new spec function .
* /
function baseMatchesProperty ( path , srcValue ) {
if ( isKey ( path ) && isStrictComparable ( srcValue ) ) {
return matchesStrictComparable ( toKey ( path ) , srcValue ) ;
}
return function ( object ) {
var objValue = get ( object , path ) ;
return ( objValue === undefined && objValue === srcValue ) ?
hasIn ( object , path ) :
baseIsEqual ( srcValue , objValue , COMPARE _PARTIAL _FLAG | COMPARE _UNORDERED _FLAG ) ;
} ;
}
/ * *
* The base implementation of ` _.merge ` without support for multiple sources .
*
* @ private
* @ param { Object } object The destination object .
* @ param { Object } source The source object .
* @ param { number } srcIndex The index of ` source ` .
* @ param { Function } [ customizer ] The function to customize merged values .
* @ param { Object } [ stack ] Tracks traversed source values and their merged
* counterparts .
* /
function baseMerge ( object , source , srcIndex , customizer , stack ) {
if ( object === source ) {
return ;
}
baseFor ( source , function ( srcValue , key ) {
if ( isObject ( srcValue ) ) {
stack || ( stack = new Stack ) ;
baseMergeDeep ( object , source , key , srcIndex , baseMerge , customizer , stack ) ;
} else {
var newValue = customizer ?
customizer ( object [ key ] , srcValue , ( key + '' ) , object , source , stack ) :
undefined ;
if ( newValue === undefined ) {
newValue = srcValue ;
}
assignMergeValue ( object , key , newValue ) ;
}
} , keysIn ) ;
}
/ * *
* A specialized version of ` baseMerge ` for arrays and objects which performs
* deep merges and tracks traversed objects enabling objects with circular
* references to be merged .
*
* @ private
* @ param { Object } object The destination object .
* @ param { Object } source The source object .
* @ param { string } key The key of the value to merge .
* @ param { number } srcIndex The index of ` source ` .
* @ param { Function } mergeFunc The function to merge values .
* @ param { Function } [ customizer ] The function to customize assigned values .
* @ param { Object } [ stack ] Tracks traversed source values and their merged
* counterparts .
* /
function baseMergeDeep ( object , source , key , srcIndex , mergeFunc , customizer , stack ) {
var objValue = object [ key ] ,
srcValue = source [ key ] ,
stacked = stack . get ( srcValue ) ;
if ( stacked ) {
assignMergeValue ( object , key , stacked ) ;
return ;
}
var newValue = customizer ?
customizer ( objValue , srcValue , ( key + '' ) , object , source , stack ) :
undefined ;
var isCommon = newValue === undefined ;
if ( isCommon ) {
var isArr = isArray ( srcValue ) ,
isBuff = ! isArr && isBuffer ( srcValue ) ,
isTyped = ! isArr && ! isBuff && isTypedArray ( srcValue ) ;
newValue = srcValue ;
if ( isArr || isBuff || isTyped ) {
if ( isArray ( objValue ) ) {
newValue = objValue ;
} else if ( isArrayLikeObject ( objValue ) ) {
newValue = copyArray ( objValue ) ;
} else if ( isBuff ) {
isCommon = false ;
newValue = cloneBuffer ( srcValue , true ) ;
} else if ( isTyped ) {
isCommon = false ;
newValue = cloneTypedArray ( srcValue , true ) ;
} else {
newValue = [ ] ;
}
} else if ( isPlainObject ( srcValue ) || isArguments ( srcValue ) ) {
newValue = objValue ;
if ( isArguments ( objValue ) ) {
newValue = toPlainObject ( objValue ) ;
} else if ( ! isObject ( objValue ) || ( srcIndex && isFunction ( objValue ) ) ) {
newValue = initCloneObject ( srcValue ) ;
}
} else {
isCommon = false ;
}
}
if ( isCommon ) {
// Recursively merge objects and arrays (susceptible to call stack limits).
stack . set ( srcValue , newValue ) ;
mergeFunc ( newValue , srcValue , srcIndex , customizer , stack ) ;
stack [ 'delete' ] ( srcValue ) ;
}
assignMergeValue ( object , key , newValue ) ;
}
/ * *
* The base implementation of ` _.nth ` which doesn ' t coerce arguments .
*
* @ private
* @ param { Array } array The array to query .
* @ param { number } n The index of the element to return .
* @ returns { * } Returns the nth element of ` array ` .
* /
function baseNth ( array , n ) {
var length = array . length ;
if ( ! length ) {
return ;
}
n += n < 0 ? length : 0 ;
return isIndex ( n , length ) ? array [ n ] : undefined ;
}
/ * *
* The base implementation of ` _.orderBy ` without param guards .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function [ ] | Object [ ] | string [ ] } iteratees The iteratees to sort by .
* @ param { string [ ] } orders The sort orders of ` iteratees ` .
* @ returns { Array } Returns the new sorted array .
* /
function baseOrderBy ( collection , iteratees , orders ) {
var index = - 1 ;
iteratees = arrayMap ( iteratees . length ? iteratees : [ identity ] , baseUnary ( getIteratee ( ) ) ) ;
var result = baseMap ( collection , function ( value , key , collection ) {
var criteria = arrayMap ( iteratees , function ( iteratee ) {
return iteratee ( value ) ;
} ) ;
return { 'criteria' : criteria , 'index' : ++ index , 'value' : value } ;
} ) ;
return baseSortBy ( result , function ( object , other ) {
return compareMultiple ( object , other , orders ) ;
} ) ;
}
/ * *
* The base implementation of ` _.pick ` without support for individual
* property identifiers .
*
* @ private
* @ param { Object } object The source object .
* @ param { string [ ] } paths The property paths to pick .
* @ returns { Object } Returns the new object .
* /
function basePick ( object , paths ) {
return basePickBy ( object , paths , function ( value , path ) {
return hasIn ( object , path ) ;
} ) ;
}
/ * *
* The base implementation of ` _.pickBy ` without support for iteratee shorthands .
*
* @ private
* @ param { Object } object The source object .
* @ param { string [ ] } paths The property paths to pick .
* @ param { Function } predicate The function invoked per property .
* @ returns { Object } Returns the new object .
* /
function basePickBy ( object , paths , predicate ) {
var index = - 1 ,
length = paths . length ,
result = { } ;
while ( ++ index < length ) {
var path = paths [ index ] ,
value = baseGet ( object , path ) ;
if ( predicate ( value , path ) ) {
baseSet ( result , castPath ( path , object ) , value ) ;
}
}
return result ;
}
/ * *
* A specialized version of ` baseProperty ` which supports deep paths .
*
* @ private
* @ param { Array | string } path The path of the property to get .
* @ returns { Function } Returns the new accessor function .
* /
function basePropertyDeep ( path ) {
return function ( object ) {
return baseGet ( object , path ) ;
} ;
}
/ * *
* The base implementation of ` _.pullAllBy ` without support for iteratee
* shorthands .
*
* @ private
* @ param { Array } array The array to modify .
* @ param { Array } values The values to remove .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns ` array ` .
* /
function basePullAll ( array , values , iteratee , comparator ) {
var indexOf = comparator ? baseIndexOfWith : baseIndexOf ,
index = - 1 ,
length = values . length ,
seen = array ;
if ( array === values ) {
values = copyArray ( values ) ;
}
if ( iteratee ) {
seen = arrayMap ( array , baseUnary ( iteratee ) ) ;
}
while ( ++ index < length ) {
var fromIndex = 0 ,
value = values [ index ] ,
computed = iteratee ? iteratee ( value ) : value ;
while ( ( fromIndex = indexOf ( seen , computed , fromIndex , comparator ) ) > - 1 ) {
if ( seen !== array ) {
splice . call ( seen , fromIndex , 1 ) ;
}
splice . call ( array , fromIndex , 1 ) ;
}
}
return array ;
}
/ * *
* The base implementation of ` _.pullAt ` without support for individual
* indexes or capturing the removed elements .
*
* @ private
* @ param { Array } array The array to modify .
* @ param { number [ ] } indexes The indexes of elements to remove .
* @ returns { Array } Returns ` array ` .
* /
function basePullAt ( array , indexes ) {
var length = array ? indexes . length : 0 ,
lastIndex = length - 1 ;
while ( length -- ) {
var index = indexes [ length ] ;
if ( length == lastIndex || index !== previous ) {
var previous = index ;
if ( isIndex ( index ) ) {
splice . call ( array , index , 1 ) ;
} else {
baseUnset ( array , index ) ;
}
}
}
return array ;
}
/ * *
* The base implementation of ` _.random ` without support for returning
* floating - point numbers .
*
* @ private
* @ param { number } lower The lower bound .
* @ param { number } upper The upper bound .
* @ returns { number } Returns the random number .
* /
function baseRandom ( lower , upper ) {
return lower + nativeFloor ( nativeRandom ( ) * ( upper - lower + 1 ) ) ;
}
/ * *
* The base implementation of ` _.range ` and ` _.rangeRight ` which doesn ' t
* coerce arguments .
*
* @ private
* @ param { number } start The start of the range .
* @ param { number } end The end of the range .
* @ param { number } step The value to increment or decrement by .
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Array } Returns the range of numbers .
* /
function baseRange ( start , end , step , fromRight ) {
var index = - 1 ,
length = nativeMax ( nativeCeil ( ( end - start ) / ( step || 1 ) ) , 0 ) ,
result = Array ( length ) ;
while ( length -- ) {
result [ fromRight ? length : ++ index ] = start ;
start += step ;
}
return result ;
}
/ * *
* The base implementation of ` _.repeat ` which doesn ' t coerce arguments .
*
* @ private
* @ param { string } string The string to repeat .
* @ param { number } n The number of times to repeat the string .
* @ returns { string } Returns the repeated string .
* /
function baseRepeat ( string , n ) {
var result = '' ;
if ( ! string || n < 1 || n > MAX _SAFE _INTEGER ) {
return result ;
}
// Leverage the exponentiation by squaring algorithm for a faster repeat.
// See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
do {
if ( n % 2 ) {
result += string ;
}
n = nativeFloor ( n / 2 ) ;
if ( n ) {
string += string ;
}
} while ( n ) ;
return result ;
}
/ * *
* The base implementation of ` _.rest ` which doesn ' t validate or coerce arguments .
*
* @ private
* @ param { Function } func The function to apply a rest parameter to .
* @ param { number } [ start = func . length - 1 ] The start position of the rest parameter .
* @ returns { Function } Returns the new function .
* /
function baseRest ( func , start ) {
return setToString ( overRest ( func , start , identity ) , func + '' ) ;
}
/ * *
* The base implementation of ` _.sample ` .
*
* @ private
* @ param { Array | Object } collection The collection to sample .
* @ returns { * } Returns the random element .
* /
function baseSample ( collection ) {
return arraySample ( values ( collection ) ) ;
}
/ * *
* The base implementation of ` _.sampleSize ` without param guards .
*
* @ private
* @ param { Array | Object } collection The collection to sample .
* @ param { number } n The number of elements to sample .
* @ returns { Array } Returns the random elements .
* /
function baseSampleSize ( collection , n ) {
var array = values ( collection ) ;
return shuffleSelf ( array , baseClamp ( n , 0 , array . length ) ) ;
}
/ * *
* The base implementation of ` _.set ` .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to set .
* @ param { * } value The value to set .
* @ param { Function } [ customizer ] The function to customize path creation .
* @ returns { Object } Returns ` object ` .
* /
function baseSet ( object , path , value , customizer ) {
if ( ! isObject ( object ) ) {
return object ;
}
path = castPath ( path , object ) ;
var index = - 1 ,
length = path . length ,
lastIndex = length - 1 ,
nested = object ;
while ( nested != null && ++ index < length ) {
var key = toKey ( path [ index ] ) ,
newValue = value ;
if ( index != lastIndex ) {
var objValue = nested [ key ] ;
newValue = customizer ? customizer ( objValue , key , nested ) : undefined ;
if ( newValue === undefined ) {
newValue = isObject ( objValue ) ?
objValue :
( isIndex ( path [ index + 1 ] ) ? [ ] : { } ) ;
}
}
assignValue ( nested , key , newValue ) ;
nested = nested [ key ] ;
}
return object ;
}
/ * *
* The base implementation of ` setData ` without support for hot loop shorting .
*
* @ private
* @ param { Function } func The function to associate metadata with .
* @ param { * } data The metadata .
* @ returns { Function } Returns ` func ` .
* /
var baseSetData = ! metaMap ? identity : function ( func , data ) {
metaMap . set ( func , data ) ;
return func ;
} ;
/ * *
* The base implementation of ` setToString ` without support for hot loop shorting .
*
* @ private
* @ param { Function } func The function to modify .
* @ param { Function } string The ` toString ` result .
* @ returns { Function } Returns ` func ` .
* /
var baseSetToString = ! defineProperty ? identity : function ( func , string ) {
return defineProperty ( func , 'toString' , {
'configurable' : true ,
'enumerable' : false ,
'value' : constant ( string ) ,
'writable' : true
} ) ;
} ;
/ * *
* The base implementation of ` _.shuffle ` .
*
* @ private
* @ param { Array | Object } collection The collection to shuffle .
* @ returns { Array } Returns the new shuffled array .
* /
function baseShuffle ( collection ) {
return shuffleSelf ( values ( collection ) ) ;
}
/ * *
* The base implementation of ` _.slice ` without an iteratee call guard .
*
* @ private
* @ param { Array } array The array to slice .
* @ param { number } [ start = 0 ] The start position .
* @ param { number } [ end = array . length ] The end position .
* @ returns { Array } Returns the slice of ` array ` .
* /
function baseSlice ( array , start , end ) {
var index = - 1 ,
length = array . length ;
if ( start < 0 ) {
start = - start > length ? 0 : ( length + start ) ;
}
end = end > length ? length : end ;
if ( end < 0 ) {
end += length ;
}
length = start > end ? 0 : ( ( end - start ) >>> 0 ) ;
start >>>= 0 ;
var result = Array ( length ) ;
while ( ++ index < length ) {
result [ index ] = array [ index + start ] ;
}
return result ;
}
/ * *
* The base implementation of ` _.some ` without support for iteratee shorthands .
*
* @ private
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } predicate The function invoked per iteration .
* @ returns { boolean } Returns ` true ` if any element passes the predicate check ,
* else ` false ` .
* /
function baseSome ( collection , predicate ) {
var result ;
baseEach ( collection , function ( value , index , collection ) {
result = predicate ( value , index , collection ) ;
return ! result ;
} ) ;
return ! ! result ;
}
/ * *
* The base implementation of ` _.sortedIndex ` and ` _.sortedLastIndex ` which
* performs a binary search of ` array ` to determine the index at which ` value `
* should be inserted into ` array ` in order to maintain its sort order .
*
* @ private
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ param { boolean } [ retHighest ] Specify returning the highest qualified index .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* /
function baseSortedIndex ( array , value , retHighest ) {
var low = 0 ,
high = array == null ? low : array . length ;
if ( typeof value == 'number' && value === value && high <= HALF _MAX _ARRAY _LENGTH ) {
while ( low < high ) {
var mid = ( low + high ) >>> 1 ,
computed = array [ mid ] ;
if ( computed !== null && ! isSymbol ( computed ) &&
( retHighest ? ( computed <= value ) : ( computed < value ) ) ) {
low = mid + 1 ;
} else {
high = mid ;
}
}
return high ;
}
return baseSortedIndexBy ( array , value , identity , retHighest ) ;
}
/ * *
* The base implementation of ` _.sortedIndexBy ` and ` _.sortedLastIndexBy `
* which invokes ` iteratee ` for ` value ` and each element of ` array ` to compute
* their sort ranking . The iteratee is invoked with one argument ; ( value ) .
*
* @ private
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ param { Function } iteratee The iteratee invoked per element .
* @ param { boolean } [ retHighest ] Specify returning the highest qualified index .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* /
function baseSortedIndexBy ( array , value , iteratee , retHighest ) {
value = iteratee ( value ) ;
var low = 0 ,
high = array == null ? 0 : array . length ,
valIsNaN = value !== value ,
valIsNull = value === null ,
valIsSymbol = isSymbol ( value ) ,
valIsUndefined = value === undefined ;
while ( low < high ) {
var mid = nativeFloor ( ( low + high ) / 2 ) ,
computed = iteratee ( array [ mid ] ) ,
othIsDefined = computed !== undefined ,
othIsNull = computed === null ,
othIsReflexive = computed === computed ,
othIsSymbol = isSymbol ( computed ) ;
if ( valIsNaN ) {
var setLow = retHighest || othIsReflexive ;
} else if ( valIsUndefined ) {
setLow = othIsReflexive && ( retHighest || othIsDefined ) ;
} else if ( valIsNull ) {
setLow = othIsReflexive && othIsDefined && ( retHighest || ! othIsNull ) ;
} else if ( valIsSymbol ) {
setLow = othIsReflexive && othIsDefined && ! othIsNull && ( retHighest || ! othIsSymbol ) ;
} else if ( othIsNull || othIsSymbol ) {
setLow = false ;
} else {
setLow = retHighest ? ( computed <= value ) : ( computed < value ) ;
}
if ( setLow ) {
low = mid + 1 ;
} else {
high = mid ;
}
}
return nativeMin ( high , MAX _ARRAY _INDEX ) ;
}
/ * *
* The base implementation of ` _.sortedUniq ` and ` _.sortedUniqBy ` without
* support for iteratee shorthands .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ returns { Array } Returns the new duplicate free array .
* /
function baseSortedUniq ( array , iteratee ) {
var index = - 1 ,
length = array . length ,
resIndex = 0 ,
result = [ ] ;
while ( ++ index < length ) {
var value = array [ index ] ,
computed = iteratee ? iteratee ( value ) : value ;
if ( ! index || ! eq ( computed , seen ) ) {
var seen = computed ;
result [ resIndex ++ ] = value === 0 ? 0 : value ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.toNumber ` which doesn ' t ensure correct
* conversions of binary , hexadecimal , or octal string values .
*
* @ private
* @ param { * } value The value to process .
* @ returns { number } Returns the number .
* /
function baseToNumber ( value ) {
if ( typeof value == 'number' ) {
return value ;
}
if ( isSymbol ( value ) ) {
return NAN ;
}
return + value ;
}
/ * *
* The base implementation of ` _.toString ` which doesn ' t convert nullish
* values to empty strings .
*
* @ private
* @ param { * } value The value to process .
* @ returns { string } Returns the string .
* /
function baseToString ( value ) {
// Exit early for strings to avoid a performance hit in some environments.
if ( typeof value == 'string' ) {
return value ;
}
if ( isArray ( value ) ) {
// Recursively convert values (susceptible to call stack limits).
return arrayMap ( value , baseToString ) + '' ;
}
if ( isSymbol ( value ) ) {
return symbolToString ? symbolToString . call ( value ) : '' ;
}
var result = ( value + '' ) ;
return ( result == '0' && ( 1 / value ) == - INFINITY ) ? '-0' : result ;
}
/ * *
* The base implementation of ` _.uniqBy ` without support for iteratee shorthands .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new duplicate free array .
* /
function baseUniq ( array , iteratee , comparator ) {
var index = - 1 ,
includes = arrayIncludes ,
length = array . length ,
isCommon = true ,
result = [ ] ,
seen = result ;
if ( comparator ) {
isCommon = false ;
includes = arrayIncludesWith ;
} else if ( length >= LARGE _ARRAY _SIZE ) {
var set = iteratee ? null : createSet ( array ) ;
if ( set ) {
return setToArray ( set ) ;
}
isCommon = false ;
includes = cacheHas ;
seen = new SetCache ;
} else {
seen = iteratee ? [ ] : result ;
}
outer :
while ( ++ index < length ) {
var value = array [ index ] ,
computed = iteratee ? iteratee ( value ) : value ;
value = ( comparator || value !== 0 ) ? value : 0 ;
if ( isCommon && computed === computed ) {
var seenIndex = seen . length ;
while ( seenIndex -- ) {
if ( seen [ seenIndex ] === computed ) {
continue outer ;
}
}
if ( iteratee ) {
seen . push ( computed ) ;
}
result . push ( value ) ;
} else if ( ! includes ( seen , computed , comparator ) ) {
if ( seen !== result ) {
seen . push ( computed ) ;
}
result . push ( value ) ;
}
}
return result ;
}
/ * *
* The base implementation of ` _.unset ` .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { Array | string } path The property path to unset .
* @ returns { boolean } Returns ` true ` if the property is deleted , else ` false ` .
* /
function baseUnset ( object , path ) {
path = castPath ( path , object ) ;
object = parent ( object , path ) ;
return object == null || delete object [ toKey ( last ( path ) ) ] ;
}
/ * *
* The base implementation of ` _.update ` .
*
* @ private
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to update .
* @ param { Function } updater The function to produce the updated value .
* @ param { Function } [ customizer ] The function to customize path creation .
* @ returns { Object } Returns ` object ` .
* /
function baseUpdate ( object , path , updater , customizer ) {
return baseSet ( object , path , updater ( baseGet ( object , path ) ) , customizer ) ;
}
/ * *
* The base implementation of methods like ` _.dropWhile ` and ` _.takeWhile `
* without support for iteratee shorthands .
*
* @ private
* @ param { Array } array The array to query .
* @ param { Function } predicate The function invoked per iteration .
* @ param { boolean } [ isDrop ] Specify dropping elements instead of taking them .
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Array } Returns the slice of ` array ` .
* /
function baseWhile ( array , predicate , isDrop , fromRight ) {
var length = array . length ,
index = fromRight ? length : - 1 ;
while ( ( fromRight ? index -- : ++ index < length ) &&
predicate ( array [ index ] , index , array ) ) { }
return isDrop ?
baseSlice ( array , ( fromRight ? 0 : index ) , ( fromRight ? index + 1 : length ) ) :
baseSlice ( array , ( fromRight ? index + 1 : 0 ) , ( fromRight ? length : index ) ) ;
}
/ * *
* The base implementation of ` wrapperValue ` which returns the result of
* performing a sequence of actions on the unwrapped ` value ` , where each
* successive action is supplied the return value of the previous .
*
* @ private
* @ param { * } value The unwrapped value .
* @ param { Array } actions Actions to perform to resolve the unwrapped value .
* @ returns { * } Returns the resolved value .
* /
function baseWrapperValue ( value , actions ) {
var result = value ;
if ( result instanceof LazyWrapper ) {
result = result . value ( ) ;
}
return arrayReduce ( actions , function ( result , action ) {
return action . func . apply ( action . thisArg , arrayPush ( [ result ] , action . args ) ) ;
} , result ) ;
}
/ * *
* The base implementation of methods like ` _.xor ` , without support for
* iteratee shorthands , that accepts an array of arrays to inspect .
*
* @ private
* @ param { Array } arrays The arrays to inspect .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of values .
* /
function baseXor ( arrays , iteratee , comparator ) {
var length = arrays . length ;
if ( length < 2 ) {
return length ? baseUniq ( arrays [ 0 ] ) : [ ] ;
}
var index = - 1 ,
result = Array ( length ) ;
while ( ++ index < length ) {
var array = arrays [ index ] ,
othIndex = - 1 ;
while ( ++ othIndex < length ) {
if ( othIndex != index ) {
result [ index ] = baseDifference ( result [ index ] || array , arrays [ othIndex ] , iteratee , comparator ) ;
}
}
}
return baseUniq ( baseFlatten ( result , 1 ) , iteratee , comparator ) ;
}
/ * *
* This base implementation of ` _.zipObject ` which assigns values using ` assignFunc ` .
*
* @ private
* @ param { Array } props The property identifiers .
* @ param { Array } values The property values .
* @ param { Function } assignFunc The function to assign values .
* @ returns { Object } Returns the new object .
* /
function baseZipObject ( props , values , assignFunc ) {
var index = - 1 ,
length = props . length ,
valsLength = values . length ,
result = { } ;
while ( ++ index < length ) {
var value = index < valsLength ? values [ index ] : undefined ;
assignFunc ( result , props [ index ] , value ) ;
}
return result ;
}
/ * *
* Casts ` value ` to an empty array if it ' s not an array like object .
*
* @ private
* @ param { * } value The value to inspect .
* @ returns { Array | Object } Returns the cast array - like object .
* /
function castArrayLikeObject ( value ) {
return isArrayLikeObject ( value ) ? value : [ ] ;
}
/ * *
* Casts ` value ` to ` identity ` if it ' s not a function .
*
* @ private
* @ param { * } value The value to inspect .
* @ returns { Function } Returns cast function .
* /
function castFunction ( value ) {
return typeof value == 'function' ? value : identity ;
}
/ * *
* Casts ` value ` to a path array if it ' s not one .
*
* @ private
* @ param { * } value The value to inspect .
* @ param { Object } [ object ] The object to query keys on .
* @ returns { Array } Returns the cast property path array .
* /
function castPath ( value , object ) {
if ( isArray ( value ) ) {
return value ;
}
return isKey ( value , object ) ? [ value ] : stringToPath ( toString ( value ) ) ;
}
/ * *
* A ` baseRest ` alias which can be replaced with ` identity ` by module
* replacement plugins .
*
* @ private
* @ type { Function }
* @ param { Function } func The function to apply a rest parameter to .
* @ returns { Function } Returns the new function .
* /
var castRest = baseRest ;
/ * *
* Casts ` array ` to a slice if it ' s needed .
*
* @ private
* @ param { Array } array The array to inspect .
* @ param { number } start The start position .
* @ param { number } [ end = array . length ] The end position .
* @ returns { Array } Returns the cast slice .
* /
function castSlice ( array , start , end ) {
var length = array . length ;
end = end === undefined ? length : end ;
return ( ! start && end >= length ) ? array : baseSlice ( array , start , end ) ;
}
/ * *
* A simple wrapper around the global [ ` clearTimeout ` ] ( https : //mdn.io/clearTimeout).
*
* @ private
* @ param { number | Object } id The timer id or timeout object of the timer to clear .
* /
var clearTimeout = ctxClearTimeout || function ( id ) {
return root . clearTimeout ( id ) ;
} ;
/ * *
* Creates a clone of ` buffer ` .
*
* @ private
* @ param { Buffer } buffer The buffer to clone .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Buffer } Returns the cloned buffer .
* /
function cloneBuffer ( buffer , isDeep ) {
if ( isDeep ) {
return buffer . slice ( ) ;
}
var length = buffer . length ,
result = allocUnsafe ? allocUnsafe ( length ) : new buffer . constructor ( length ) ;
buffer . copy ( result ) ;
return result ;
}
/ * *
* Creates a clone of ` arrayBuffer ` .
*
* @ private
* @ param { ArrayBuffer } arrayBuffer The array buffer to clone .
* @ returns { ArrayBuffer } Returns the cloned array buffer .
* /
function cloneArrayBuffer ( arrayBuffer ) {
var result = new arrayBuffer . constructor ( arrayBuffer . byteLength ) ;
new Uint8Array ( result ) . set ( new Uint8Array ( arrayBuffer ) ) ;
return result ;
}
/ * *
* Creates a clone of ` dataView ` .
*
* @ private
* @ param { Object } dataView The data view to clone .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Object } Returns the cloned data view .
* /
function cloneDataView ( dataView , isDeep ) {
var buffer = isDeep ? cloneArrayBuffer ( dataView . buffer ) : dataView . buffer ;
return new dataView . constructor ( buffer , dataView . byteOffset , dataView . byteLength ) ;
}
/ * *
* Creates a clone of ` map ` .
*
* @ private
* @ param { Object } map The map to clone .
* @ param { Function } cloneFunc The function to clone values .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Object } Returns the cloned map .
* /
function cloneMap ( map , isDeep , cloneFunc ) {
var array = isDeep ? cloneFunc ( mapToArray ( map ) , CLONE _DEEP _FLAG ) : mapToArray ( map ) ;
return arrayReduce ( array , addMapEntry , new map . constructor ) ;
}
/ * *
* Creates a clone of ` regexp ` .
*
* @ private
* @ param { Object } regexp The regexp to clone .
* @ returns { Object } Returns the cloned regexp .
* /
function cloneRegExp ( regexp ) {
var result = new regexp . constructor ( regexp . source , reFlags . exec ( regexp ) ) ;
result . lastIndex = regexp . lastIndex ;
return result ;
}
/ * *
* Creates a clone of ` set ` .
*
* @ private
* @ param { Object } set The set to clone .
* @ param { Function } cloneFunc The function to clone values .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Object } Returns the cloned set .
* /
function cloneSet ( set , isDeep , cloneFunc ) {
var array = isDeep ? cloneFunc ( setToArray ( set ) , CLONE _DEEP _FLAG ) : setToArray ( set ) ;
return arrayReduce ( array , addSetEntry , new set . constructor ) ;
}
/ * *
* Creates a clone of the ` symbol ` object .
*
* @ private
* @ param { Object } symbol The symbol object to clone .
* @ returns { Object } Returns the cloned symbol object .
* /
function cloneSymbol ( symbol ) {
return symbolValueOf ? Object ( symbolValueOf . call ( symbol ) ) : { } ;
}
/ * *
* Creates a clone of ` typedArray ` .
*
* @ private
* @ param { Object } typedArray The typed array to clone .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Object } Returns the cloned typed array .
* /
function cloneTypedArray ( typedArray , isDeep ) {
var buffer = isDeep ? cloneArrayBuffer ( typedArray . buffer ) : typedArray . buffer ;
return new typedArray . constructor ( buffer , typedArray . byteOffset , typedArray . length ) ;
}
/ * *
* Compares values to sort them in ascending order .
*
* @ private
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { number } Returns the sort order indicator for ` value ` .
* /
function compareAscending ( value , other ) {
if ( value !== other ) {
var valIsDefined = value !== undefined ,
valIsNull = value === null ,
valIsReflexive = value === value ,
valIsSymbol = isSymbol ( value ) ;
var othIsDefined = other !== undefined ,
othIsNull = other === null ,
othIsReflexive = other === other ,
othIsSymbol = isSymbol ( other ) ;
if ( ( ! othIsNull && ! othIsSymbol && ! valIsSymbol && value > other ) ||
( valIsSymbol && othIsDefined && othIsReflexive && ! othIsNull && ! othIsSymbol ) ||
( valIsNull && othIsDefined && othIsReflexive ) ||
( ! valIsDefined && othIsReflexive ) ||
! valIsReflexive ) {
return 1 ;
}
if ( ( ! valIsNull && ! valIsSymbol && ! othIsSymbol && value < other ) ||
( othIsSymbol && valIsDefined && valIsReflexive && ! valIsNull && ! valIsSymbol ) ||
( othIsNull && valIsDefined && valIsReflexive ) ||
( ! othIsDefined && valIsReflexive ) ||
! othIsReflexive ) {
return - 1 ;
}
}
return 0 ;
}
/ * *
* Used by ` _.orderBy ` to compare multiple properties of a value to another
* and stable sort them .
*
* If ` orders ` is unspecified , all values are sorted in ascending order . Otherwise ,
* specify an order of "desc" for descending or "asc" for ascending sort order
* of corresponding values .
*
* @ private
* @ param { Object } object The object to compare .
* @ param { Object } other The other object to compare .
* @ param { boolean [ ] | string [ ] } orders The order to sort by for each property .
* @ returns { number } Returns the sort order indicator for ` object ` .
* /
function compareMultiple ( object , other , orders ) {
var index = - 1 ,
objCriteria = object . criteria ,
othCriteria = other . criteria ,
length = objCriteria . length ,
ordersLength = orders . length ;
while ( ++ index < length ) {
var result = compareAscending ( objCriteria [ index ] , othCriteria [ index ] ) ;
if ( result ) {
if ( index >= ordersLength ) {
return result ;
}
var order = orders [ index ] ;
return result * ( order == 'desc' ? - 1 : 1 ) ;
}
}
// Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
// that causes it, under certain circumstances, to provide the same value for
// `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
// for more details.
//
// This also ensures a stable sort in V8 and other engines.
// See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
return object . index - other . index ;
}
/ * *
* Creates an array that is the composition of partially applied arguments ,
* placeholders , and provided arguments into a single array of arguments .
*
* @ private
* @ param { Array } args The provided arguments .
* @ param { Array } partials The arguments to prepend to those provided .
* @ param { Array } holders The ` partials ` placeholder indexes .
* @ params { boolean } [ isCurried ] Specify composing for a curried function .
* @ returns { Array } Returns the new array of composed arguments .
* /
function composeArgs ( args , partials , holders , isCurried ) {
var argsIndex = - 1 ,
argsLength = args . length ,
holdersLength = holders . length ,
leftIndex = - 1 ,
leftLength = partials . length ,
rangeLength = nativeMax ( argsLength - holdersLength , 0 ) ,
result = Array ( leftLength + rangeLength ) ,
isUncurried = ! isCurried ;
while ( ++ leftIndex < leftLength ) {
result [ leftIndex ] = partials [ leftIndex ] ;
}
while ( ++ argsIndex < holdersLength ) {
if ( isUncurried || argsIndex < argsLength ) {
result [ holders [ argsIndex ] ] = args [ argsIndex ] ;
}
}
while ( rangeLength -- ) {
result [ leftIndex ++ ] = args [ argsIndex ++ ] ;
}
return result ;
}
/ * *
* This function is like ` composeArgs ` except that the arguments composition
* is tailored for ` _.partialRight ` .
*
* @ private
* @ param { Array } args The provided arguments .
* @ param { Array } partials The arguments to append to those provided .
* @ param { Array } holders The ` partials ` placeholder indexes .
* @ params { boolean } [ isCurried ] Specify composing for a curried function .
* @ returns { Array } Returns the new array of composed arguments .
* /
function composeArgsRight ( args , partials , holders , isCurried ) {
var argsIndex = - 1 ,
argsLength = args . length ,
holdersIndex = - 1 ,
holdersLength = holders . length ,
rightIndex = - 1 ,
rightLength = partials . length ,
rangeLength = nativeMax ( argsLength - holdersLength , 0 ) ,
result = Array ( rangeLength + rightLength ) ,
isUncurried = ! isCurried ;
while ( ++ argsIndex < rangeLength ) {
result [ argsIndex ] = args [ argsIndex ] ;
}
var offset = argsIndex ;
while ( ++ rightIndex < rightLength ) {
result [ offset + rightIndex ] = partials [ rightIndex ] ;
}
while ( ++ holdersIndex < holdersLength ) {
if ( isUncurried || argsIndex < argsLength ) {
result [ offset + holders [ holdersIndex ] ] = args [ argsIndex ++ ] ;
}
}
return result ;
}
/ * *
* Copies the values of ` source ` to ` array ` .
*
* @ private
* @ param { Array } source The array to copy values from .
* @ param { Array } [ array = [ ] ] The array to copy values to .
* @ returns { Array } Returns ` array ` .
* /
function copyArray ( source , array ) {
var index = - 1 ,
length = source . length ;
array || ( array = Array ( length ) ) ;
while ( ++ index < length ) {
array [ index ] = source [ index ] ;
}
return array ;
}
/ * *
* Copies properties of ` source ` to ` object ` .
*
* @ private
* @ param { Object } source The object to copy properties from .
* @ param { Array } props The property identifiers to copy .
* @ param { Object } [ object = { } ] The object to copy properties to .
* @ param { Function } [ customizer ] The function to customize copied values .
* @ returns { Object } Returns ` object ` .
* /
function copyObject ( source , props , object , customizer ) {
var isNew = ! object ;
object || ( object = { } ) ;
var index = - 1 ,
length = props . length ;
while ( ++ index < length ) {
var key = props [ index ] ;
var newValue = customizer ?
customizer ( object [ key ] , source [ key ] , key , object , source ) :
undefined ;
if ( newValue === undefined ) {
newValue = source [ key ] ;
}
if ( isNew ) {
baseAssignValue ( object , key , newValue ) ;
} else {
assignValue ( object , key , newValue ) ;
}
}
return object ;
}
/ * *
* Copies own symbols of ` source ` to ` object ` .
*
* @ private
* @ param { Object } source The object to copy symbols from .
* @ param { Object } [ object = { } ] The object to copy symbols to .
* @ returns { Object } Returns ` object ` .
* /
function copySymbols ( source , object ) {
return copyObject ( source , getSymbols ( source ) , object ) ;
}
/ * *
* Copies own and inherited symbols of ` source ` to ` object ` .
*
* @ private
* @ param { Object } source The object to copy symbols from .
* @ param { Object } [ object = { } ] The object to copy symbols to .
* @ returns { Object } Returns ` object ` .
* /
function copySymbolsIn ( source , object ) {
return copyObject ( source , getSymbolsIn ( source ) , object ) ;
}
/ * *
* Creates a function like ` _.groupBy ` .
*
* @ private
* @ param { Function } setter The function to set accumulator values .
* @ param { Function } [ initializer ] The accumulator object initializer .
* @ returns { Function } Returns the new aggregator function .
* /
function createAggregator ( setter , initializer ) {
return function ( collection , iteratee ) {
var func = isArray ( collection ) ? arrayAggregator : baseAggregator ,
accumulator = initializer ? initializer ( ) : { } ;
return func ( collection , setter , getIteratee ( iteratee , 2 ) , accumulator ) ;
} ;
}
/ * *
* Creates a function like ` _.assign ` .
*
* @ private
* @ param { Function } assigner The function to assign values .
* @ returns { Function } Returns the new assigner function .
* /
function createAssigner ( assigner ) {
return baseRest ( function ( object , sources ) {
var index = - 1 ,
length = sources . length ,
customizer = length > 1 ? sources [ length - 1 ] : undefined ,
guard = length > 2 ? sources [ 2 ] : undefined ;
customizer = ( assigner . length > 3 && typeof customizer == 'function' ) ?
( length -- , customizer ) :
undefined ;
if ( guard && isIterateeCall ( sources [ 0 ] , sources [ 1 ] , guard ) ) {
customizer = length < 3 ? undefined : customizer ;
length = 1 ;
}
object = Object ( object ) ;
while ( ++ index < length ) {
var source = sources [ index ] ;
if ( source ) {
assigner ( object , source , index , customizer ) ;
}
}
return object ;
} ) ;
}
/ * *
* Creates a ` baseEach ` or ` baseEachRight ` function .
*
* @ private
* @ param { Function } eachFunc The function to iterate over a collection .
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Function } Returns the new base function .
* /
function createBaseEach ( eachFunc , fromRight ) {
return function ( collection , iteratee ) {
if ( collection == null ) {
return collection ;
}
if ( ! isArrayLike ( collection ) ) {
return eachFunc ( collection , iteratee ) ;
}
var length = collection . length ,
index = fromRight ? length : - 1 ,
iterable = Object ( collection ) ;
while ( ( fromRight ? index -- : ++ index < length ) ) {
if ( iteratee ( iterable [ index ] , index , iterable ) === false ) {
break ;
}
}
return collection ;
} ;
}
/ * *
* Creates a base function for methods like ` _.forIn ` and ` _.forOwn ` .
*
* @ private
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Function } Returns the new base function .
* /
function createBaseFor ( fromRight ) {
return function ( object , iteratee , keysFunc ) {
var index = - 1 ,
iterable = Object ( object ) ,
props = keysFunc ( object ) ,
length = props . length ;
while ( length -- ) {
var key = props [ fromRight ? length : ++ index ] ;
if ( iteratee ( iterable [ key ] , key , iterable ) === false ) {
break ;
}
}
return object ;
} ;
}
/ * *
* Creates a function that wraps ` func ` to invoke it with the optional ` this `
* binding of ` thisArg ` .
*
* @ private
* @ param { Function } func The function to wrap .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ param { * } [ thisArg ] The ` this ` binding of ` func ` .
* @ returns { Function } Returns the new wrapped function .
* /
function createBind ( func , bitmask , thisArg ) {
var isBind = bitmask & WRAP _BIND _FLAG ,
Ctor = createCtor ( func ) ;
function wrapper ( ) {
var fn = ( this && this !== root && this instanceof wrapper ) ? Ctor : func ;
return fn . apply ( isBind ? thisArg : this , arguments ) ;
}
return wrapper ;
}
/ * *
* Creates a function like ` _.lowerFirst ` .
*
* @ private
* @ param { string } methodName The name of the ` String ` case method to use .
* @ returns { Function } Returns the new case function .
* /
function createCaseFirst ( methodName ) {
return function ( string ) {
string = toString ( string ) ;
var strSymbols = hasUnicode ( string ) ?
stringToArray ( string ) :
undefined ;
var chr = strSymbols ?
strSymbols [ 0 ] :
string . charAt ( 0 ) ;
var trailing = strSymbols ?
castSlice ( strSymbols , 1 ) . join ( '' ) :
string . slice ( 1 ) ;
return chr [ methodName ] ( ) + trailing ;
} ;
}
/ * *
* Creates a function like ` _.camelCase ` .
*
* @ private
* @ param { Function } callback The function to combine each word .
* @ returns { Function } Returns the new compounder function .
* /
function createCompounder ( callback ) {
return function ( string ) {
return arrayReduce ( words ( deburr ( string ) . replace ( reApos , '' ) ) , callback , '' ) ;
} ;
}
/ * *
* Creates a function that produces an instance of ` Ctor ` regardless of
* whether it was invoked as part of a ` new ` expression or by ` call ` or ` apply ` .
*
* @ private
* @ param { Function } Ctor The constructor to wrap .
* @ returns { Function } Returns the new wrapped function .
* /
function createCtor ( Ctor ) {
return function ( ) {
// Use a `switch` statement to work with class constructors. See
// http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
// for more details.
var args = arguments ;
switch ( args . length ) {
case 0 :
return new Ctor ;
case 1 :
return new Ctor ( args [ 0 ] ) ;
case 2 :
return new Ctor ( args [ 0 ] , args [ 1 ] ) ;
case 3 :
return new Ctor ( args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
case 4 :
return new Ctor ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] ) ;
case 5 :
return new Ctor ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] ) ;
case 6 :
return new Ctor ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] ) ;
case 7 :
return new Ctor ( args [ 0 ] , args [ 1 ] , args [ 2 ] , args [ 3 ] , args [ 4 ] , args [ 5 ] , args [ 6 ] ) ;
}
var thisBinding = baseCreate ( Ctor . prototype ) ,
result = Ctor . apply ( thisBinding , args ) ;
// Mimic the constructor's `return` behavior.
// See https://es5.github.io/#x13.2.2 for more details.
return isObject ( result ) ? result : thisBinding ;
} ;
}
/ * *
* Creates a function that wraps ` func ` to enable currying .
*
* @ private
* @ param { Function } func The function to wrap .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ param { number } arity The arity of ` func ` .
* @ returns { Function } Returns the new wrapped function .
* /
function createCurry ( func , bitmask , arity ) {
var Ctor = createCtor ( func ) ;
function wrapper ( ) {
var length = arguments . length ,
args = Array ( length ) ,
index = length ,
placeholder = getHolder ( wrapper ) ;
while ( index -- ) {
args [ index ] = arguments [ index ] ;
}
var holders = ( length < 3 && args [ 0 ] !== placeholder && args [ length - 1 ] !== placeholder ) ? [ ] :
replaceHolders ( args , placeholder ) ;
length -= holders . length ;
if ( length < arity ) {
return createRecurry (
func , bitmask , createHybrid , wrapper . placeholder , undefined ,
args , holders , undefined , undefined , arity - length ) ;
}
var fn = ( this && this !== root && this instanceof wrapper ) ? Ctor : func ;
return apply ( fn , this , args ) ;
}
return wrapper ;
}
/ * *
* Creates a ` _.find ` or ` _.findLast ` function .
*
* @ private
* @ param { Function } findIndexFunc The function to find the collection index .
* @ returns { Function } Returns the new find function .
* /
function createFind ( findIndexFunc ) {
return function ( collection , predicate , fromIndex ) {
var iterable = Object ( collection ) ;
if ( ! isArrayLike ( collection ) ) {
var iteratee = getIteratee ( predicate , 3 ) ;
collection = keys ( collection ) ;
predicate = function ( key ) { return iteratee ( iterable [ key ] , key , iterable ) ; } ;
}
var index = findIndexFunc ( collection , predicate , fromIndex ) ;
return index > - 1 ? iterable [ iteratee ? collection [ index ] : index ] : undefined ;
} ;
}
/ * *
* Creates a ` _.flow ` or ` _.flowRight ` function .
*
* @ private
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Function } Returns the new flow function .
* /
function createFlow ( fromRight ) {
return flatRest ( function ( funcs ) {
var length = funcs . length ,
index = length ,
prereq = LodashWrapper . prototype . thru ;
if ( fromRight ) {
funcs . reverse ( ) ;
}
while ( index -- ) {
var func = funcs [ index ] ;
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
if ( prereq && ! wrapper && getFuncName ( func ) == 'wrapper' ) {
var wrapper = new LodashWrapper ( [ ] , true ) ;
}
}
index = wrapper ? index : length ;
while ( ++ index < length ) {
func = funcs [ index ] ;
var funcName = getFuncName ( func ) ,
data = funcName == 'wrapper' ? getData ( func ) : undefined ;
if ( data && isLaziable ( data [ 0 ] ) &&
data [ 1 ] == ( WRAP _ARY _FLAG | WRAP _CURRY _FLAG | WRAP _PARTIAL _FLAG | WRAP _REARG _FLAG ) &&
! data [ 4 ] . length && data [ 9 ] == 1
) {
wrapper = wrapper [ getFuncName ( data [ 0 ] ) ] . apply ( wrapper , data [ 3 ] ) ;
} else {
wrapper = ( func . length == 1 && isLaziable ( func ) ) ?
wrapper [ funcName ] ( ) :
wrapper . thru ( func ) ;
}
}
return function ( ) {
var args = arguments ,
value = args [ 0 ] ;
if ( wrapper && args . length == 1 && isArray ( value ) ) {
return wrapper . plant ( value ) . value ( ) ;
}
var index = 0 ,
result = length ? funcs [ index ] . apply ( this , args ) : value ;
while ( ++ index < length ) {
result = funcs [ index ] . call ( this , result ) ;
}
return result ;
} ;
} ) ;
}
/ * *
* Creates a function that wraps ` func ` to invoke it with optional ` this `
* binding of ` thisArg ` , partial application , and currying .
*
* @ private
* @ param { Function | string } func The function or method name to wrap .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ param { * } [ thisArg ] The ` this ` binding of ` func ` .
* @ param { Array } [ partials ] The arguments to prepend to those provided to
* the new function .
* @ param { Array } [ holders ] The ` partials ` placeholder indexes .
* @ param { Array } [ partialsRight ] The arguments to append to those provided
* to the new function .
* @ param { Array } [ holdersRight ] The ` partialsRight ` placeholder indexes .
* @ param { Array } [ argPos ] The argument positions of the new function .
* @ param { number } [ ary ] The arity cap of ` func ` .
* @ param { number } [ arity ] The arity of ` func ` .
* @ returns { Function } Returns the new wrapped function .
* /
function createHybrid ( func , bitmask , thisArg , partials , holders , partialsRight , holdersRight , argPos , ary , arity ) {
var isAry = bitmask & WRAP _ARY _FLAG ,
isBind = bitmask & WRAP _BIND _FLAG ,
isBindKey = bitmask & WRAP _BIND _KEY _FLAG ,
isCurried = bitmask & ( WRAP _CURRY _FLAG | WRAP _CURRY _RIGHT _FLAG ) ,
isFlip = bitmask & WRAP _FLIP _FLAG ,
Ctor = isBindKey ? undefined : createCtor ( func ) ;
function wrapper ( ) {
var length = arguments . length ,
args = Array ( length ) ,
index = length ;
while ( index -- ) {
args [ index ] = arguments [ index ] ;
}
if ( isCurried ) {
var placeholder = getHolder ( wrapper ) ,
holdersCount = countHolders ( args , placeholder ) ;
}
if ( partials ) {
args = composeArgs ( args , partials , holders , isCurried ) ;
}
if ( partialsRight ) {
args = composeArgsRight ( args , partialsRight , holdersRight , isCurried ) ;
}
length -= holdersCount ;
if ( isCurried && length < arity ) {
var newHolders = replaceHolders ( args , placeholder ) ;
return createRecurry (
func , bitmask , createHybrid , wrapper . placeholder , thisArg ,
args , newHolders , argPos , ary , arity - length
) ;
}
var thisBinding = isBind ? thisArg : this ,
fn = isBindKey ? thisBinding [ func ] : func ;
length = args . length ;
if ( argPos ) {
args = reorder ( args , argPos ) ;
} else if ( isFlip && length > 1 ) {
args . reverse ( ) ;
}
if ( isAry && ary < length ) {
args . length = ary ;
}
if ( this && this !== root && this instanceof wrapper ) {
fn = Ctor || createCtor ( fn ) ;
}
return fn . apply ( thisBinding , args ) ;
}
return wrapper ;
}
/ * *
* Creates a function like ` _.invertBy ` .
*
* @ private
* @ param { Function } setter The function to set accumulator values .
* @ param { Function } toIteratee The function to resolve iteratees .
* @ returns { Function } Returns the new inverter function .
* /
function createInverter ( setter , toIteratee ) {
return function ( object , iteratee ) {
return baseInverter ( object , setter , toIteratee ( iteratee ) , { } ) ;
} ;
}
/ * *
* Creates a function that performs a mathematical operation on two values .
*
* @ private
* @ param { Function } operator The function to perform the operation .
* @ param { number } [ defaultValue ] The value used for ` undefined ` arguments .
* @ returns { Function } Returns the new mathematical operation function .
* /
function createMathOperation ( operator , defaultValue ) {
return function ( value , other ) {
var result ;
if ( value === undefined && other === undefined ) {
return defaultValue ;
}
if ( value !== undefined ) {
result = value ;
}
if ( other !== undefined ) {
if ( result === undefined ) {
return other ;
}
if ( typeof value == 'string' || typeof other == 'string' ) {
value = baseToString ( value ) ;
other = baseToString ( other ) ;
} else {
value = baseToNumber ( value ) ;
other = baseToNumber ( other ) ;
}
result = operator ( value , other ) ;
}
return result ;
} ;
}
/ * *
* Creates a function like ` _.over ` .
*
* @ private
* @ param { Function } arrayFunc The function to iterate over iteratees .
* @ returns { Function } Returns the new over function .
* /
function createOver ( arrayFunc ) {
return flatRest ( function ( iteratees ) {
iteratees = arrayMap ( iteratees , baseUnary ( getIteratee ( ) ) ) ;
return baseRest ( function ( args ) {
var thisArg = this ;
return arrayFunc ( iteratees , function ( iteratee ) {
return apply ( iteratee , thisArg , args ) ;
} ) ;
} ) ;
} ) ;
}
/ * *
* Creates the padding for ` string ` based on ` length ` . The ` chars ` string
* is truncated if the number of characters exceeds ` length ` .
*
* @ private
* @ param { number } length The padding length .
* @ param { string } [ chars = ' ' ] The string used as padding .
* @ returns { string } Returns the padding for ` string ` .
* /
function createPadding ( length , chars ) {
chars = chars === undefined ? ' ' : baseToString ( chars ) ;
var charsLength = chars . length ;
if ( charsLength < 2 ) {
return charsLength ? baseRepeat ( chars , length ) : chars ;
}
var result = baseRepeat ( chars , nativeCeil ( length / stringSize ( chars ) ) ) ;
return hasUnicode ( chars ) ?
castSlice ( stringToArray ( result ) , 0 , length ) . join ( '' ) :
result . slice ( 0 , length ) ;
}
/ * *
* Creates a function that wraps ` func ` to invoke it with the ` this ` binding
* of ` thisArg ` and ` partials ` prepended to the arguments it receives .
*
* @ private
* @ param { Function } func The function to wrap .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ param { * } thisArg The ` this ` binding of ` func ` .
* @ param { Array } partials The arguments to prepend to those provided to
* the new function .
* @ returns { Function } Returns the new wrapped function .
* /
function createPartial ( func , bitmask , thisArg , partials ) {
var isBind = bitmask & WRAP _BIND _FLAG ,
Ctor = createCtor ( func ) ;
function wrapper ( ) {
var argsIndex = - 1 ,
argsLength = arguments . length ,
leftIndex = - 1 ,
leftLength = partials . length ,
args = Array ( leftLength + argsLength ) ,
fn = ( this && this !== root && this instanceof wrapper ) ? Ctor : func ;
while ( ++ leftIndex < leftLength ) {
args [ leftIndex ] = partials [ leftIndex ] ;
}
while ( argsLength -- ) {
args [ leftIndex ++ ] = arguments [ ++ argsIndex ] ;
}
return apply ( fn , isBind ? thisArg : this , args ) ;
}
return wrapper ;
}
/ * *
* Creates a ` _.range ` or ` _.rangeRight ` function .
*
* @ private
* @ param { boolean } [ fromRight ] Specify iterating from right to left .
* @ returns { Function } Returns the new range function .
* /
function createRange ( fromRight ) {
return function ( start , end , step ) {
if ( step && typeof step != 'number' && isIterateeCall ( start , end , step ) ) {
end = step = undefined ;
}
// Ensure the sign of `-0` is preserved.
start = toFinite ( start ) ;
if ( end === undefined ) {
end = start ;
start = 0 ;
} else {
end = toFinite ( end ) ;
}
step = step === undefined ? ( start < end ? 1 : - 1 ) : toFinite ( step ) ;
return baseRange ( start , end , step , fromRight ) ;
} ;
}
/ * *
* Creates a function that performs a relational operation on two values .
*
* @ private
* @ param { Function } operator The function to perform the operation .
* @ returns { Function } Returns the new relational operation function .
* /
function createRelationalOperation ( operator ) {
return function ( value , other ) {
if ( ! ( typeof value == 'string' && typeof other == 'string' ) ) {
value = toNumber ( value ) ;
other = toNumber ( other ) ;
}
return operator ( value , other ) ;
} ;
}
/ * *
* Creates a function that wraps ` func ` to continue currying .
*
* @ private
* @ param { Function } func The function to wrap .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ param { Function } wrapFunc The function to create the ` func ` wrapper .
* @ param { * } placeholder The placeholder value .
* @ param { * } [ thisArg ] The ` this ` binding of ` func ` .
* @ param { Array } [ partials ] The arguments to prepend to those provided to
* the new function .
* @ param { Array } [ holders ] The ` partials ` placeholder indexes .
* @ param { Array } [ argPos ] The argument positions of the new function .
* @ param { number } [ ary ] The arity cap of ` func ` .
* @ param { number } [ arity ] The arity of ` func ` .
* @ returns { Function } Returns the new wrapped function .
* /
function createRecurry ( func , bitmask , wrapFunc , placeholder , thisArg , partials , holders , argPos , ary , arity ) {
var isCurry = bitmask & WRAP _CURRY _FLAG ,
newHolders = isCurry ? holders : undefined ,
newHoldersRight = isCurry ? undefined : holders ,
newPartials = isCurry ? partials : undefined ,
newPartialsRight = isCurry ? undefined : partials ;
bitmask |= ( isCurry ? WRAP _PARTIAL _FLAG : WRAP _PARTIAL _RIGHT _FLAG ) ;
bitmask &= ~ ( isCurry ? WRAP _PARTIAL _RIGHT _FLAG : WRAP _PARTIAL _FLAG ) ;
if ( ! ( bitmask & WRAP _CURRY _BOUND _FLAG ) ) {
bitmask &= ~ ( WRAP _BIND _FLAG | WRAP _BIND _KEY _FLAG ) ;
}
var newData = [
func , bitmask , thisArg , newPartials , newHolders , newPartialsRight ,
newHoldersRight , argPos , ary , arity
] ;
var result = wrapFunc . apply ( undefined , newData ) ;
if ( isLaziable ( func ) ) {
setData ( result , newData ) ;
}
result . placeholder = placeholder ;
return setWrapToString ( result , func , bitmask ) ;
}
/ * *
* Creates a function like ` _.round ` .
*
* @ private
* @ param { string } methodName The name of the ` Math ` method to use when rounding .
* @ returns { Function } Returns the new round function .
* /
function createRound ( methodName ) {
var func = Math [ methodName ] ;
return function ( number , precision ) {
number = toNumber ( number ) ;
precision = precision == null ? 0 : nativeMin ( toInteger ( precision ) , 292 ) ;
if ( precision ) {
// Shift with exponential notation to avoid floating-point issues.
// See [MDN](https://mdn.io/round#Examples) for more details.
var pair = ( toString ( number ) + 'e' ) . split ( 'e' ) ,
value = func ( pair [ 0 ] + 'e' + ( + pair [ 1 ] + precision ) ) ;
pair = ( toString ( value ) + 'e' ) . split ( 'e' ) ;
return + ( pair [ 0 ] + 'e' + ( + pair [ 1 ] - precision ) ) ;
}
return func ( number ) ;
} ;
}
/ * *
* Creates a set object of ` values ` .
*
* @ private
* @ param { Array } values The values to add to the set .
* @ returns { Object } Returns the new set .
* /
var createSet = ! ( Set && ( 1 / setToArray ( new Set ( [ , - 0 ] ) ) [ 1 ] ) == INFINITY ) ? noop : function ( values ) {
return new Set ( values ) ;
} ;
/ * *
* Creates a ` _.toPairs ` or ` _.toPairsIn ` function .
*
* @ private
* @ param { Function } keysFunc The function to get the keys of a given object .
* @ returns { Function } Returns the new pairs function .
* /
function createToPairs ( keysFunc ) {
return function ( object ) {
var tag = getTag ( object ) ;
if ( tag == mapTag ) {
return mapToArray ( object ) ;
}
if ( tag == setTag ) {
return setToPairs ( object ) ;
}
return baseToPairs ( object , keysFunc ( object ) ) ;
} ;
}
/ * *
* Creates a function that either curries or invokes ` func ` with optional
* ` this ` binding and partially applied arguments .
*
* @ private
* @ param { Function | string } func The function or method name to wrap .
* @ param { number } bitmask The bitmask flags .
* 1 - ` _.bind `
* 2 - ` _.bindKey `
* 4 - ` _.curry ` or ` _.curryRight ` of a bound function
* 8 - ` _.curry `
* 16 - ` _.curryRight `
* 32 - ` _.partial `
* 64 - ` _.partialRight `
* 128 - ` _.rearg `
* 256 - ` _.ary `
* 512 - ` _.flip `
* @ param { * } [ thisArg ] The ` this ` binding of ` func ` .
* @ param { Array } [ partials ] The arguments to be partially applied .
* @ param { Array } [ holders ] The ` partials ` placeholder indexes .
* @ param { Array } [ argPos ] The argument positions of the new function .
* @ param { number } [ ary ] The arity cap of ` func ` .
* @ param { number } [ arity ] The arity of ` func ` .
* @ returns { Function } Returns the new wrapped function .
* /
function createWrap ( func , bitmask , thisArg , partials , holders , argPos , ary , arity ) {
var isBindKey = bitmask & WRAP _BIND _KEY _FLAG ;
if ( ! isBindKey && typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
var length = partials ? partials . length : 0 ;
if ( ! length ) {
bitmask &= ~ ( WRAP _PARTIAL _FLAG | WRAP _PARTIAL _RIGHT _FLAG ) ;
partials = holders = undefined ;
}
ary = ary === undefined ? ary : nativeMax ( toInteger ( ary ) , 0 ) ;
arity = arity === undefined ? arity : toInteger ( arity ) ;
length -= holders ? holders . length : 0 ;
if ( bitmask & WRAP _PARTIAL _RIGHT _FLAG ) {
var partialsRight = partials ,
holdersRight = holders ;
partials = holders = undefined ;
}
var data = isBindKey ? undefined : getData ( func ) ;
var newData = [
func , bitmask , thisArg , partials , holders , partialsRight , holdersRight ,
argPos , ary , arity
] ;
if ( data ) {
mergeData ( newData , data ) ;
}
func = newData [ 0 ] ;
bitmask = newData [ 1 ] ;
thisArg = newData [ 2 ] ;
partials = newData [ 3 ] ;
holders = newData [ 4 ] ;
arity = newData [ 9 ] = newData [ 9 ] === undefined ?
( isBindKey ? 0 : func . length ) :
nativeMax ( newData [ 9 ] - length , 0 ) ;
if ( ! arity && bitmask & ( WRAP _CURRY _FLAG | WRAP _CURRY _RIGHT _FLAG ) ) {
bitmask &= ~ ( WRAP _CURRY _FLAG | WRAP _CURRY _RIGHT _FLAG ) ;
}
if ( ! bitmask || bitmask == WRAP _BIND _FLAG ) {
var result = createBind ( func , bitmask , thisArg ) ;
} else if ( bitmask == WRAP _CURRY _FLAG || bitmask == WRAP _CURRY _RIGHT _FLAG ) {
result = createCurry ( func , bitmask , arity ) ;
} else if ( ( bitmask == WRAP _PARTIAL _FLAG || bitmask == ( WRAP _BIND _FLAG | WRAP _PARTIAL _FLAG ) ) && ! holders . length ) {
result = createPartial ( func , bitmask , thisArg , partials ) ;
} else {
result = createHybrid . apply ( undefined , newData ) ;
}
var setter = data ? baseSetData : setData ;
return setWrapToString ( setter ( result , newData ) , func , bitmask ) ;
}
/ * *
* Used by ` _.defaults ` to customize its ` _.assignIn ` use to assign properties
* of source objects to the destination object for all destination properties
* that resolve to ` undefined ` .
*
* @ private
* @ param { * } objValue The destination value .
* @ param { * } srcValue The source value .
* @ param { string } key The key of the property to assign .
* @ param { Object } object The parent object of ` objValue ` .
* @ returns { * } Returns the value to assign .
* /
function customDefaultsAssignIn ( objValue , srcValue , key , object ) {
if ( objValue === undefined ||
( eq ( objValue , objectProto [ key ] ) && ! hasOwnProperty . call ( object , key ) ) ) {
return srcValue ;
}
return objValue ;
}
/ * *
* Used by ` _.defaultsDeep ` to customize its ` _.merge ` use to merge source
* objects into destination objects that are passed thru .
*
* @ private
* @ param { * } objValue The destination value .
* @ param { * } srcValue The source value .
* @ param { string } key The key of the property to merge .
* @ param { Object } object The parent object of ` objValue ` .
* @ param { Object } source The parent object of ` srcValue ` .
* @ param { Object } [ stack ] Tracks traversed source values and their merged
* counterparts .
* @ returns { * } Returns the value to assign .
* /
function customDefaultsMerge ( objValue , srcValue , key , object , source , stack ) {
if ( isObject ( objValue ) && isObject ( srcValue ) ) {
// Recursively merge objects and arrays (susceptible to call stack limits).
stack . set ( srcValue , objValue ) ;
baseMerge ( objValue , srcValue , undefined , customDefaultsMerge , stack ) ;
stack [ 'delete' ] ( srcValue ) ;
}
return objValue ;
}
/ * *
* Used by ` _.omit ` to customize its ` _.cloneDeep ` use to only clone plain
* objects .
*
* @ private
* @ param { * } value The value to inspect .
* @ param { string } key The key of the property to inspect .
* @ returns { * } Returns the uncloned value or ` undefined ` to defer cloning to ` _.cloneDeep ` .
* /
function customOmitClone ( value ) {
return isPlainObject ( value ) ? undefined : value ;
}
/ * *
* A specialized version of ` baseIsEqualDeep ` for arrays with support for
* partial deep comparisons .
*
* @ private
* @ param { Array } array The array to compare .
* @ param { Array } other The other array to compare .
* @ param { number } bitmask The bitmask flags . See ` baseIsEqual ` for more details .
* @ param { Function } customizer The function to customize comparisons .
* @ param { Function } equalFunc The function to determine equivalents of values .
* @ param { Object } stack Tracks traversed ` array ` and ` other ` objects .
* @ returns { boolean } Returns ` true ` if the arrays are equivalent , else ` false ` .
* /
function equalArrays ( array , other , bitmask , customizer , equalFunc , stack ) {
var isPartial = bitmask & COMPARE _PARTIAL _FLAG ,
arrLength = array . length ,
othLength = other . length ;
if ( arrLength != othLength && ! ( isPartial && othLength > arrLength ) ) {
return false ;
}
// Assume cyclic values are equal.
var stacked = stack . get ( array ) ;
if ( stacked && stack . get ( other ) ) {
return stacked == other ;
}
var index = - 1 ,
result = true ,
seen = ( bitmask & COMPARE _UNORDERED _FLAG ) ? new SetCache : undefined ;
stack . set ( array , other ) ;
stack . set ( other , array ) ;
// Ignore non-index properties.
while ( ++ index < arrLength ) {
var arrValue = array [ index ] ,
othValue = other [ index ] ;
if ( customizer ) {
var compared = isPartial ?
customizer ( othValue , arrValue , index , other , array , stack ) :
customizer ( arrValue , othValue , index , array , other , stack ) ;
}
if ( compared !== undefined ) {
if ( compared ) {
continue ;
}
result = false ;
break ;
}
// Recursively compare arrays (susceptible to call stack limits).
if ( seen ) {
if ( ! arraySome ( other , function ( othValue , othIndex ) {
if ( ! cacheHas ( seen , othIndex ) &&
( arrValue === othValue || equalFunc ( arrValue , othValue , bitmask , customizer , stack ) ) ) {
return seen . push ( othIndex ) ;
}
} ) ) {
result = false ;
break ;
}
} else if ( ! (
arrValue === othValue ||
equalFunc ( arrValue , othValue , bitmask , customizer , stack )
) ) {
result = false ;
break ;
}
}
stack [ 'delete' ] ( array ) ;
stack [ 'delete' ] ( other ) ;
return result ;
}
/ * *
* A specialized version of ` baseIsEqualDeep ` for comparing objects of
* the same ` toStringTag ` .
*
* * * Note : * * This function only supports comparing values with tags of
* ` Boolean ` , ` Date ` , ` Error ` , ` Number ` , ` RegExp ` , or ` String ` .
*
* @ private
* @ param { Object } object The object to compare .
* @ param { Object } other The other object to compare .
* @ param { string } tag The ` toStringTag ` of the objects to compare .
* @ param { number } bitmask The bitmask flags . See ` baseIsEqual ` for more details .
* @ param { Function } customizer The function to customize comparisons .
* @ param { Function } equalFunc The function to determine equivalents of values .
* @ param { Object } stack Tracks traversed ` object ` and ` other ` objects .
* @ returns { boolean } Returns ` true ` if the objects are equivalent , else ` false ` .
* /
function equalByTag ( object , other , tag , bitmask , customizer , equalFunc , stack ) {
switch ( tag ) {
case dataViewTag :
if ( ( object . byteLength != other . byteLength ) ||
( object . byteOffset != other . byteOffset ) ) {
return false ;
}
object = object . buffer ;
other = other . buffer ;
case arrayBufferTag :
if ( ( object . byteLength != other . byteLength ) ||
! equalFunc ( new Uint8Array ( object ) , new Uint8Array ( other ) ) ) {
return false ;
}
return true ;
case boolTag :
case dateTag :
case numberTag :
// Coerce booleans to `1` or `0` and dates to milliseconds.
// Invalid dates are coerced to `NaN`.
return eq ( + object , + other ) ;
case errorTag :
return object . name == other . name && object . message == other . message ;
case regexpTag :
case stringTag :
// Coerce regexes to strings and treat strings, primitives and objects,
// as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
// for more details.
return object == ( other + '' ) ;
case mapTag :
var convert = mapToArray ;
case setTag :
var isPartial = bitmask & COMPARE _PARTIAL _FLAG ;
convert || ( convert = setToArray ) ;
if ( object . size != other . size && ! isPartial ) {
return false ;
}
// Assume cyclic values are equal.
var stacked = stack . get ( object ) ;
if ( stacked ) {
return stacked == other ;
}
bitmask |= COMPARE _UNORDERED _FLAG ;
// Recursively compare objects (susceptible to call stack limits).
stack . set ( object , other ) ;
var result = equalArrays ( convert ( object ) , convert ( other ) , bitmask , customizer , equalFunc , stack ) ;
stack [ 'delete' ] ( object ) ;
return result ;
case symbolTag :
if ( symbolValueOf ) {
return symbolValueOf . call ( object ) == symbolValueOf . call ( other ) ;
}
}
return false ;
}
/ * *
* A specialized version of ` baseIsEqualDeep ` for objects with support for
* partial deep comparisons .
*
* @ private
* @ param { Object } object The object to compare .
* @ param { Object } other The other object to compare .
* @ param { number } bitmask The bitmask flags . See ` baseIsEqual ` for more details .
* @ param { Function } customizer The function to customize comparisons .
* @ param { Function } equalFunc The function to determine equivalents of values .
* @ param { Object } stack Tracks traversed ` object ` and ` other ` objects .
* @ returns { boolean } Returns ` true ` if the objects are equivalent , else ` false ` .
* /
function equalObjects ( object , other , bitmask , customizer , equalFunc , stack ) {
var isPartial = bitmask & COMPARE _PARTIAL _FLAG ,
objProps = getAllKeys ( object ) ,
objLength = objProps . length ,
othProps = getAllKeys ( other ) ,
othLength = othProps . length ;
if ( objLength != othLength && ! isPartial ) {
return false ;
}
var index = objLength ;
while ( index -- ) {
var key = objProps [ index ] ;
if ( ! ( isPartial ? key in other : hasOwnProperty . call ( other , key ) ) ) {
return false ;
}
}
// Assume cyclic values are equal.
var stacked = stack . get ( object ) ;
if ( stacked && stack . get ( other ) ) {
return stacked == other ;
}
var result = true ;
stack . set ( object , other ) ;
stack . set ( other , object ) ;
var skipCtor = isPartial ;
while ( ++ index < objLength ) {
key = objProps [ index ] ;
var objValue = object [ key ] ,
othValue = other [ key ] ;
if ( customizer ) {
var compared = isPartial ?
customizer ( othValue , objValue , key , other , object , stack ) :
customizer ( objValue , othValue , key , object , other , stack ) ;
}
// Recursively compare objects (susceptible to call stack limits).
if ( ! ( compared === undefined ?
( objValue === othValue || equalFunc ( objValue , othValue , bitmask , customizer , stack ) ) :
compared
) ) {
result = false ;
break ;
}
skipCtor || ( skipCtor = key == 'constructor' ) ;
}
if ( result && ! skipCtor ) {
var objCtor = object . constructor ,
othCtor = other . constructor ;
// Non `Object` object instances with different constructors are not equal.
if ( objCtor != othCtor &&
( 'constructor' in object && 'constructor' in other ) &&
! ( typeof objCtor == 'function' && objCtor instanceof objCtor &&
typeof othCtor == 'function' && othCtor instanceof othCtor ) ) {
result = false ;
}
}
stack [ 'delete' ] ( object ) ;
stack [ 'delete' ] ( other ) ;
return result ;
}
/ * *
* A specialized version of ` baseRest ` which flattens the rest array .
*
* @ private
* @ param { Function } func The function to apply a rest parameter to .
* @ returns { Function } Returns the new function .
* /
function flatRest ( func ) {
return setToString ( overRest ( func , undefined , flatten ) , func + '' ) ;
}
/ * *
* Creates an array of own enumerable property names and symbols of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names and symbols .
* /
function getAllKeys ( object ) {
return baseGetAllKeys ( object , keys , getSymbols ) ;
}
/ * *
* Creates an array of own and inherited enumerable property names and
* symbols of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names and symbols .
* /
function getAllKeysIn ( object ) {
return baseGetAllKeys ( object , keysIn , getSymbolsIn ) ;
}
/ * *
* Gets metadata for ` func ` .
*
* @ private
* @ param { Function } func The function to query .
* @ returns { * } Returns the metadata for ` func ` .
* /
var getData = ! metaMap ? noop : function ( func ) {
return metaMap . get ( func ) ;
} ;
/ * *
* Gets the name of ` func ` .
*
* @ private
* @ param { Function } func The function to query .
* @ returns { string } Returns the function name .
* /
function getFuncName ( func ) {
var result = ( func . name + '' ) ,
array = realNames [ result ] ,
length = hasOwnProperty . call ( realNames , result ) ? array . length : 0 ;
while ( length -- ) {
var data = array [ length ] ,
otherFunc = data . func ;
if ( otherFunc == null || otherFunc == func ) {
return data . name ;
}
}
return result ;
}
/ * *
* Gets the argument placeholder value for ` func ` .
*
* @ private
* @ param { Function } func The function to inspect .
* @ returns { * } Returns the placeholder value .
* /
function getHolder ( func ) {
var object = hasOwnProperty . call ( lodash , 'placeholder' ) ? lodash : func ;
return object . placeholder ;
}
/ * *
* Gets the appropriate "iteratee" function . If ` _.iteratee ` is customized ,
* this function returns the custom method , otherwise it returns ` baseIteratee ` .
* If arguments are provided , the chosen function is invoked with them and
* its result is returned .
*
* @ private
* @ param { * } [ value ] The value to convert to an iteratee .
* @ param { number } [ arity ] The arity of the created iteratee .
* @ returns { Function } Returns the chosen function or its result .
* /
function getIteratee ( ) {
var result = lodash . iteratee || iteratee ;
result = result === iteratee ? baseIteratee : result ;
return arguments . length ? result ( arguments [ 0 ] , arguments [ 1 ] ) : result ;
}
/ * *
* Gets the data for ` map ` .
*
* @ private
* @ param { Object } map The map to query .
* @ param { string } key The reference key .
* @ returns { * } Returns the map data .
* /
function getMapData ( map , key ) {
var data = map . _ _data _ _ ;
return isKeyable ( key ) ?
data [ typeof key == 'string' ? 'string' : 'hash' ] :
data . map ;
}
/ * *
* Gets the property names , values , and compare flags of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the match data of ` object ` .
* /
function getMatchData ( object ) {
var result = keys ( object ) ,
length = result . length ;
while ( length -- ) {
var key = result [ length ] ,
value = object [ key ] ;
result [ length ] = [ key , value , isStrictComparable ( value ) ] ;
}
return result ;
}
/ * *
* Gets the native function at ` key ` of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { string } key The key of the method to get .
* @ returns { * } Returns the function if it ' s native , else ` undefined ` .
* /
function getNative ( object , key ) {
var value = getValue ( object , key ) ;
return baseIsNative ( value ) ? value : undefined ;
}
/ * *
* A specialized version of ` baseGetTag ` which ignores ` Symbol.toStringTag ` values .
*
* @ private
* @ param { * } value The value to query .
* @ returns { string } Returns the raw ` toStringTag ` .
* /
function getRawTag ( value ) {
var isOwn = hasOwnProperty . call ( value , symToStringTag ) ,
tag = value [ symToStringTag ] ;
try {
value [ symToStringTag ] = undefined ;
var unmasked = true ;
} catch ( e ) { }
var result = nativeObjectToString . call ( value ) ;
if ( unmasked ) {
if ( isOwn ) {
value [ symToStringTag ] = tag ;
} else {
delete value [ symToStringTag ] ;
}
}
return result ;
}
/ * *
* Creates an array of the own enumerable symbols of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of symbols .
* /
var getSymbols = ! nativeGetSymbols ? stubArray : function ( object ) {
if ( object == null ) {
return [ ] ;
}
object = Object ( object ) ;
return arrayFilter ( nativeGetSymbols ( object ) , function ( symbol ) {
return propertyIsEnumerable . call ( object , symbol ) ;
} ) ;
} ;
/ * *
* Creates an array of the own and inherited enumerable symbols of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of symbols .
* /
var getSymbolsIn = ! nativeGetSymbols ? stubArray : function ( object ) {
var result = [ ] ;
while ( object ) {
arrayPush ( result , getSymbols ( object ) ) ;
object = getPrototype ( object ) ;
}
return result ;
} ;
/ * *
* Gets the ` toStringTag ` of ` value ` .
*
* @ private
* @ param { * } value The value to query .
* @ returns { string } Returns the ` toStringTag ` .
* /
var getTag = baseGetTag ;
// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.
if ( ( DataView && getTag ( new DataView ( new ArrayBuffer ( 1 ) ) ) != dataViewTag ) ||
( Map && getTag ( new Map ) != mapTag ) ||
( Promise && getTag ( Promise . resolve ( ) ) != promiseTag ) ||
( Set && getTag ( new Set ) != setTag ) ||
( WeakMap && getTag ( new WeakMap ) != weakMapTag ) ) {
getTag = function ( value ) {
var result = baseGetTag ( value ) ,
Ctor = result == objectTag ? value . constructor : undefined ,
ctorString = Ctor ? toSource ( Ctor ) : '' ;
if ( ctorString ) {
switch ( ctorString ) {
case dataViewCtorString :
return dataViewTag ;
case mapCtorString :
return mapTag ;
case promiseCtorString :
return promiseTag ;
case setCtorString :
return setTag ;
case weakMapCtorString :
return weakMapTag ;
}
}
return result ;
} ;
}
/ * *
* Gets the view , applying any ` transforms ` to the ` start ` and ` end ` positions .
*
* @ private
* @ param { number } start The start of the view .
* @ param { number } end The end of the view .
* @ param { Array } transforms The transformations to apply to the view .
* @ returns { Object } Returns an object containing the ` start ` and ` end `
* positions of the view .
* /
function getView ( start , end , transforms ) {
var index = - 1 ,
length = transforms . length ;
while ( ++ index < length ) {
var data = transforms [ index ] ,
size = data . size ;
switch ( data . type ) {
case 'drop' :
start += size ;
break ;
case 'dropRight' :
end -= size ;
break ;
case 'take' :
end = nativeMin ( end , start + size ) ;
break ;
case 'takeRight' :
start = nativeMax ( start , end - size ) ;
break ;
}
}
return { 'start' : start , 'end' : end } ;
}
/ * *
* Extracts wrapper details from the ` source ` body comment .
*
* @ private
* @ param { string } source The source to inspect .
* @ returns { Array } Returns the wrapper details .
* /
function getWrapDetails ( source ) {
var match = source . match ( reWrapDetails ) ;
return match ? match [ 1 ] . split ( reSplitDetails ) : [ ] ;
}
/ * *
* Checks if ` path ` exists on ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array | string } path The path to check .
* @ param { Function } hasFunc The function to check properties .
* @ returns { boolean } Returns ` true ` if ` path ` exists , else ` false ` .
* /
function hasPath ( object , path , hasFunc ) {
path = castPath ( path , object ) ;
var index = - 1 ,
length = path . length ,
result = false ;
while ( ++ index < length ) {
var key = toKey ( path [ index ] ) ;
if ( ! ( result = object != null && hasFunc ( object , key ) ) ) {
break ;
}
object = object [ key ] ;
}
if ( result || ++ index != length ) {
return result ;
}
length = object == null ? 0 : object . length ;
return ! ! length && isLength ( length ) && isIndex ( key , length ) &&
( isArray ( object ) || isArguments ( object ) ) ;
}
/ * *
* Initializes an array clone .
*
* @ private
* @ param { Array } array The array to clone .
* @ returns { Array } Returns the initialized clone .
* /
function initCloneArray ( array ) {
var length = array . length ,
result = array . constructor ( length ) ;
// Add properties assigned by `RegExp#exec`.
if ( length && typeof array [ 0 ] == 'string' && hasOwnProperty . call ( array , 'index' ) ) {
result . index = array . index ;
result . input = array . input ;
}
return result ;
}
/ * *
* Initializes an object clone .
*
* @ private
* @ param { Object } object The object to clone .
* @ returns { Object } Returns the initialized clone .
* /
function initCloneObject ( object ) {
return ( typeof object . constructor == 'function' && ! isPrototype ( object ) ) ?
baseCreate ( getPrototype ( object ) ) : { } ;
}
/ * *
* Initializes an object clone based on its ` toStringTag ` .
*
* * * Note : * * This function only supports cloning values with tags of
* ` Boolean ` , ` Date ` , ` Error ` , ` Number ` , ` RegExp ` , or ` String ` .
*
* @ private
* @ param { Object } object The object to clone .
* @ param { string } tag The ` toStringTag ` of the object to clone .
* @ param { Function } cloneFunc The function to clone values .
* @ param { boolean } [ isDeep ] Specify a deep clone .
* @ returns { Object } Returns the initialized clone .
* /
function initCloneByTag ( object , tag , cloneFunc , isDeep ) {
var Ctor = object . constructor ;
switch ( tag ) {
case arrayBufferTag :
return cloneArrayBuffer ( object ) ;
case boolTag :
case dateTag :
return new Ctor ( + object ) ;
case dataViewTag :
return cloneDataView ( object , isDeep ) ;
case float32Tag :
case float64Tag :
case int8Tag :
case int16Tag :
case int32Tag :
case uint8Tag :
case uint8ClampedTag :
case uint16Tag :
case uint32Tag :
return cloneTypedArray ( object , isDeep ) ;
case mapTag :
return cloneMap ( object , isDeep , cloneFunc ) ;
case numberTag :
case stringTag :
return new Ctor ( object ) ;
case regexpTag :
return cloneRegExp ( object ) ;
case setTag :
return cloneSet ( object , isDeep , cloneFunc ) ;
case symbolTag :
return cloneSymbol ( object ) ;
}
}
/ * *
* Inserts wrapper ` details ` in a comment at the top of the ` source ` body .
*
* @ private
* @ param { string } source The source to modify .
* @ returns { Array } details The details to insert .
* @ returns { string } Returns the modified source .
* /
function insertWrapDetails ( source , details ) {
var length = details . length ;
if ( ! length ) {
return source ;
}
var lastIndex = length - 1 ;
details [ lastIndex ] = ( length > 1 ? '& ' : '' ) + details [ lastIndex ] ;
details = details . join ( length > 2 ? ', ' : ' ' ) ;
return source . replace ( reWrapComment , '{\n/* [wrapped with ' + details + '] */\n' ) ;
}
/ * *
* Checks if ` value ` is a flattenable ` arguments ` object or array .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is flattenable , else ` false ` .
* /
function isFlattenable ( value ) {
return isArray ( value ) || isArguments ( value ) ||
! ! ( spreadableSymbol && value && value [ spreadableSymbol ] ) ;
}
/ * *
* Checks if ` value ` is a valid array - like index .
*
* @ private
* @ param { * } value The value to check .
* @ param { number } [ length = MAX _SAFE _INTEGER ] The upper bounds of a valid index .
* @ returns { boolean } Returns ` true ` if ` value ` is a valid index , else ` false ` .
* /
function isIndex ( value , length ) {
length = length == null ? MAX _SAFE _INTEGER : length ;
return ! ! length &&
( typeof value == 'number' || reIsUint . test ( value ) ) &&
( value > - 1 && value % 1 == 0 && value < length ) ;
}
/ * *
* Checks if the given arguments are from an iteratee call .
*
* @ private
* @ param { * } value The potential iteratee value argument .
* @ param { * } index The potential iteratee index or key argument .
* @ param { * } object The potential iteratee object argument .
* @ returns { boolean } Returns ` true ` if the arguments are from an iteratee call ,
* else ` false ` .
* /
function isIterateeCall ( value , index , object ) {
if ( ! isObject ( object ) ) {
return false ;
}
var type = typeof index ;
if ( type == 'number' ?
( isArrayLike ( object ) && isIndex ( index , object . length ) ) :
( type == 'string' && index in object )
) {
return eq ( object [ index ] , value ) ;
}
return false ;
}
/ * *
* Checks if ` value ` is a property name and not a property path .
*
* @ private
* @ param { * } value The value to check .
* @ param { Object } [ object ] The object to query keys on .
* @ returns { boolean } Returns ` true ` if ` value ` is a property name , else ` false ` .
* /
function isKey ( value , object ) {
if ( isArray ( value ) ) {
return false ;
}
var type = typeof value ;
if ( type == 'number' || type == 'symbol' || type == 'boolean' ||
value == null || isSymbol ( value ) ) {
return true ;
}
return reIsPlainProp . test ( value ) || ! reIsDeepProp . test ( value ) ||
( object != null && value in Object ( object ) ) ;
}
/ * *
* Checks if ` value ` is suitable for use as unique object key .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is suitable , else ` false ` .
* /
function isKeyable ( value ) {
var type = typeof value ;
return ( type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean' ) ?
( value !== '__proto__' ) :
( value === null ) ;
}
/ * *
* Checks if ` func ` has a lazy counterpart .
*
* @ private
* @ param { Function } func The function to check .
* @ returns { boolean } Returns ` true ` if ` func ` has a lazy counterpart ,
* else ` false ` .
* /
function isLaziable ( func ) {
var funcName = getFuncName ( func ) ,
other = lodash [ funcName ] ;
if ( typeof other != 'function' || ! ( funcName in LazyWrapper . prototype ) ) {
return false ;
}
if ( func === other ) {
return true ;
}
var data = getData ( other ) ;
return ! ! data && func === data [ 0 ] ;
}
/ * *
* Checks if ` func ` has its source masked .
*
* @ private
* @ param { Function } func The function to check .
* @ returns { boolean } Returns ` true ` if ` func ` is masked , else ` false ` .
* /
function isMasked ( func ) {
return ! ! maskSrcKey && ( maskSrcKey in func ) ;
}
/ * *
* Checks if ` func ` is capable of being masked .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` func ` is maskable , else ` false ` .
* /
var isMaskable = coreJsData ? isFunction : stubFalse ;
/ * *
* Checks if ` value ` is likely a prototype object .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a prototype , else ` false ` .
* /
function isPrototype ( value ) {
var Ctor = value && value . constructor ,
proto = ( typeof Ctor == 'function' && Ctor . prototype ) || objectProto ;
return value === proto ;
}
/ * *
* Checks if ` value ` is suitable for strict equality comparisons , i . e . ` === ` .
*
* @ private
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` if suitable for strict
* equality comparisons , else ` false ` .
* /
function isStrictComparable ( value ) {
return value === value && ! isObject ( value ) ;
}
/ * *
* A specialized version of ` matchesProperty ` for source values suitable
* for strict equality comparisons , i . e . ` === ` .
*
* @ private
* @ param { string } key The key of the property to get .
* @ param { * } srcValue The value to match .
* @ returns { Function } Returns the new spec function .
* /
function matchesStrictComparable ( key , srcValue ) {
return function ( object ) {
if ( object == null ) {
return false ;
}
return object [ key ] === srcValue &&
( srcValue !== undefined || ( key in Object ( object ) ) ) ;
} ;
}
/ * *
* A specialized version of ` _.memoize ` which clears the memoized function ' s
* cache when it exceeds ` MAX_MEMOIZE_SIZE ` .
*
* @ private
* @ param { Function } func The function to have its output memoized .
* @ returns { Function } Returns the new memoized function .
* /
function memoizeCapped ( func ) {
var result = memoize ( func , function ( key ) {
if ( cache . size === MAX _MEMOIZE _SIZE ) {
cache . clear ( ) ;
}
return key ;
} ) ;
var cache = result . cache ;
return result ;
}
/ * *
* Merges the function metadata of ` source ` into ` data ` .
*
* Merging metadata reduces the number of wrappers used to invoke a function .
* This is possible because methods like ` _.bind ` , ` _.curry ` , and ` _.partial `
* may be applied regardless of execution order . Methods like ` _.ary ` and
* ` _.rearg ` modify function arguments , making the order in which they are
* executed important , preventing the merging of metadata . However , we make
* an exception for a safe combined case where curried functions have ` _.ary `
* and or ` _.rearg ` applied .
*
* @ private
* @ param { Array } data The destination metadata .
* @ param { Array } source The source metadata .
* @ returns { Array } Returns ` data ` .
* /
function mergeData ( data , source ) {
var bitmask = data [ 1 ] ,
srcBitmask = source [ 1 ] ,
newBitmask = bitmask | srcBitmask ,
isCommon = newBitmask < ( WRAP _BIND _FLAG | WRAP _BIND _KEY _FLAG | WRAP _ARY _FLAG ) ;
var isCombo =
( ( srcBitmask == WRAP _ARY _FLAG ) && ( bitmask == WRAP _CURRY _FLAG ) ) ||
( ( srcBitmask == WRAP _ARY _FLAG ) && ( bitmask == WRAP _REARG _FLAG ) && ( data [ 7 ] . length <= source [ 8 ] ) ) ||
( ( srcBitmask == ( WRAP _ARY _FLAG | WRAP _REARG _FLAG ) ) && ( source [ 7 ] . length <= source [ 8 ] ) && ( bitmask == WRAP _CURRY _FLAG ) ) ;
// Exit early if metadata can't be merged.
if ( ! ( isCommon || isCombo ) ) {
return data ;
}
// Use source `thisArg` if available.
if ( srcBitmask & WRAP _BIND _FLAG ) {
data [ 2 ] = source [ 2 ] ;
// Set when currying a bound function.
newBitmask |= bitmask & WRAP _BIND _FLAG ? 0 : WRAP _CURRY _BOUND _FLAG ;
}
// Compose partial arguments.
var value = source [ 3 ] ;
if ( value ) {
var partials = data [ 3 ] ;
data [ 3 ] = partials ? composeArgs ( partials , value , source [ 4 ] ) : value ;
data [ 4 ] = partials ? replaceHolders ( data [ 3 ] , PLACEHOLDER ) : source [ 4 ] ;
}
// Compose partial right arguments.
value = source [ 5 ] ;
if ( value ) {
partials = data [ 5 ] ;
data [ 5 ] = partials ? composeArgsRight ( partials , value , source [ 6 ] ) : value ;
data [ 6 ] = partials ? replaceHolders ( data [ 5 ] , PLACEHOLDER ) : source [ 6 ] ;
}
// Use source `argPos` if available.
value = source [ 7 ] ;
if ( value ) {
data [ 7 ] = value ;
}
// Use source `ary` if it's smaller.
if ( srcBitmask & WRAP _ARY _FLAG ) {
data [ 8 ] = data [ 8 ] == null ? source [ 8 ] : nativeMin ( data [ 8 ] , source [ 8 ] ) ;
}
// Use source `arity` if one is not provided.
if ( data [ 9 ] == null ) {
data [ 9 ] = source [ 9 ] ;
}
// Use source `func` and merge bitmasks.
data [ 0 ] = source [ 0 ] ;
data [ 1 ] = newBitmask ;
return data ;
}
/ * *
* This function is like
* [ ` Object.keys ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-object.keys)
* except that it includes inherited enumerable properties .
*
* @ private
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names .
* /
function nativeKeysIn ( object ) {
var result = [ ] ;
if ( object != null ) {
for ( var key in Object ( object ) ) {
result . push ( key ) ;
}
}
return result ;
}
/ * *
* Converts ` value ` to a string using ` Object.prototype.toString ` .
*
* @ private
* @ param { * } value The value to convert .
* @ returns { string } Returns the converted string .
* /
function objectToString ( value ) {
return nativeObjectToString . call ( value ) ;
}
/ * *
* A specialized version of ` baseRest ` which transforms the rest array .
*
* @ private
* @ param { Function } func The function to apply a rest parameter to .
* @ param { number } [ start = func . length - 1 ] The start position of the rest parameter .
* @ param { Function } transform The rest array transform .
* @ returns { Function } Returns the new function .
* /
function overRest ( func , start , transform ) {
start = nativeMax ( start === undefined ? ( func . length - 1 ) : start , 0 ) ;
return function ( ) {
var args = arguments ,
index = - 1 ,
length = nativeMax ( args . length - start , 0 ) ,
array = Array ( length ) ;
while ( ++ index < length ) {
array [ index ] = args [ start + index ] ;
}
index = - 1 ;
var otherArgs = Array ( start + 1 ) ;
while ( ++ index < start ) {
otherArgs [ index ] = args [ index ] ;
}
otherArgs [ start ] = transform ( array ) ;
return apply ( func , this , otherArgs ) ;
} ;
}
/ * *
* Gets the parent value at ` path ` of ` object ` .
*
* @ private
* @ param { Object } object The object to query .
* @ param { Array } path The path to get the parent value of .
* @ returns { * } Returns the parent value .
* /
function parent ( object , path ) {
return path . length < 2 ? object : baseGet ( object , baseSlice ( path , 0 , - 1 ) ) ;
}
/ * *
* Reorder ` array ` according to the specified indexes where the element at
* the first index is assigned as the first element , the element at
* the second index is assigned as the second element , and so on .
*
* @ private
* @ param { Array } array The array to reorder .
* @ param { Array } indexes The arranged array indexes .
* @ returns { Array } Returns ` array ` .
* /
function reorder ( array , indexes ) {
var arrLength = array . length ,
length = nativeMin ( indexes . length , arrLength ) ,
oldArray = copyArray ( array ) ;
while ( length -- ) {
var index = indexes [ length ] ;
array [ length ] = isIndex ( index , arrLength ) ? oldArray [ index ] : undefined ;
}
return array ;
}
/ * *
* Sets metadata for ` func ` .
*
* * * Note : * * If this function becomes hot , i . e . is invoked a lot in a short
* period of time , it will trip its breaker and transition to an identity
* function to avoid garbage collection pauses in V8 . See
* [ V8 issue 2070 ] ( https : //bugs.chromium.org/p/v8/issues/detail?id=2070)
* for more details .
*
* @ private
* @ param { Function } func The function to associate metadata with .
* @ param { * } data The metadata .
* @ returns { Function } Returns ` func ` .
* /
var setData = shortOut ( baseSetData ) ;
/ * *
* A simple wrapper around the global [ ` setTimeout ` ] ( https : //mdn.io/setTimeout).
*
* @ private
* @ param { Function } func The function to delay .
* @ param { number } wait The number of milliseconds to delay invocation .
* @ returns { number | Object } Returns the timer id or timeout object .
* /
var setTimeout = ctxSetTimeout || function ( func , wait ) {
return root . setTimeout ( func , wait ) ;
} ;
/ * *
* Sets the ` toString ` method of ` func ` to return ` string ` .
*
* @ private
* @ param { Function } func The function to modify .
* @ param { Function } string The ` toString ` result .
* @ returns { Function } Returns ` func ` .
* /
var setToString = shortOut ( baseSetToString ) ;
/ * *
* Sets the ` toString ` method of ` wrapper ` to mimic the source of ` reference `
* with wrapper details in a comment at the top of the source body .
*
* @ private
* @ param { Function } wrapper The function to modify .
* @ param { Function } reference The reference function .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ returns { Function } Returns ` wrapper ` .
* /
function setWrapToString ( wrapper , reference , bitmask ) {
var source = ( reference + '' ) ;
return setToString ( wrapper , insertWrapDetails ( source , updateWrapDetails ( getWrapDetails ( source ) , bitmask ) ) ) ;
}
/ * *
* Creates a function that ' ll short out and invoke ` identity ` instead
* of ` func ` when it ' s called ` HOT_COUNT ` or more times in ` HOT_SPAN `
* milliseconds .
*
* @ private
* @ param { Function } func The function to restrict .
* @ returns { Function } Returns the new shortable function .
* /
function shortOut ( func ) {
var count = 0 ,
lastCalled = 0 ;
return function ( ) {
var stamp = nativeNow ( ) ,
remaining = HOT _SPAN - ( stamp - lastCalled ) ;
lastCalled = stamp ;
if ( remaining > 0 ) {
if ( ++ count >= HOT _COUNT ) {
return arguments [ 0 ] ;
}
} else {
count = 0 ;
}
return func . apply ( undefined , arguments ) ;
} ;
}
/ * *
* A specialized version of ` _.shuffle ` which mutates and sets the size of ` array ` .
*
* @ private
* @ param { Array } array The array to shuffle .
* @ param { number } [ size = array . length ] The size of ` array ` .
* @ returns { Array } Returns ` array ` .
* /
function shuffleSelf ( array , size ) {
var index = - 1 ,
length = array . length ,
lastIndex = length - 1 ;
size = size === undefined ? length : size ;
while ( ++ index < size ) {
var rand = baseRandom ( index , lastIndex ) ,
value = array [ rand ] ;
array [ rand ] = array [ index ] ;
array [ index ] = value ;
}
array . length = size ;
return array ;
}
/ * *
* Converts ` string ` to a property path array .
*
* @ private
* @ param { string } string The string to convert .
* @ returns { Array } Returns the property path array .
* /
var stringToPath = memoizeCapped ( function ( string ) {
var result = [ ] ;
if ( reLeadingDot . test ( string ) ) {
result . push ( '' ) ;
}
string . replace ( rePropName , function ( match , number , quote , string ) {
result . push ( quote ? string . replace ( reEscapeChar , '$1' ) : ( number || match ) ) ;
} ) ;
return result ;
} ) ;
/ * *
* Converts ` value ` to a string key if it ' s not a string or symbol .
*
* @ private
* @ param { * } value The value to inspect .
* @ returns { string | symbol } Returns the key .
* /
function toKey ( value ) {
if ( typeof value == 'string' || isSymbol ( value ) ) {
return value ;
}
var result = ( value + '' ) ;
return ( result == '0' && ( 1 / value ) == - INFINITY ) ? '-0' : result ;
}
/ * *
* Converts ` func ` to its source code .
*
* @ private
* @ param { Function } func The function to convert .
* @ returns { string } Returns the source code .
* /
function toSource ( func ) {
if ( func != null ) {
try {
return funcToString . call ( func ) ;
} catch ( e ) { }
try {
return ( func + '' ) ;
} catch ( e ) { }
}
return '' ;
}
/ * *
* Updates wrapper ` details ` based on ` bitmask ` flags .
*
* @ private
* @ returns { Array } details The details to modify .
* @ param { number } bitmask The bitmask flags . See ` createWrap ` for more details .
* @ returns { Array } Returns ` details ` .
* /
function updateWrapDetails ( details , bitmask ) {
arrayEach ( wrapFlags , function ( pair ) {
var value = '_.' + pair [ 0 ] ;
if ( ( bitmask & pair [ 1 ] ) && ! arrayIncludes ( details , value ) ) {
details . push ( value ) ;
}
} ) ;
return details . sort ( ) ;
}
/ * *
* Creates a clone of ` wrapper ` .
*
* @ private
* @ param { Object } wrapper The wrapper to clone .
* @ returns { Object } Returns the cloned wrapper .
* /
function wrapperClone ( wrapper ) {
if ( wrapper instanceof LazyWrapper ) {
return wrapper . clone ( ) ;
}
var result = new LodashWrapper ( wrapper . _ _wrapped _ _ , wrapper . _ _chain _ _ ) ;
result . _ _actions _ _ = copyArray ( wrapper . _ _actions _ _ ) ;
result . _ _index _ _ = wrapper . _ _index _ _ ;
result . _ _values _ _ = wrapper . _ _values _ _ ;
return result ;
}
/*------------------------------------------------------------------------*/
/ * *
* Creates an array of elements split into groups the length of ` size ` .
* If ` array ` can ' t be split evenly , the final chunk will be the remaining
* elements .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to process .
* @ param { number } [ size = 1 ] The length of each chunk
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the new array of chunks .
* @ example
*
* _ . chunk ( [ 'a' , 'b' , 'c' , 'd' ] , 2 ) ;
* // => [['a', 'b'], ['c', 'd']]
*
* _ . chunk ( [ 'a' , 'b' , 'c' , 'd' ] , 3 ) ;
* // => [['a', 'b', 'c'], ['d']]
* /
function chunk ( array , size , guard ) {
if ( ( guard ? isIterateeCall ( array , size , guard ) : size === undefined ) ) {
size = 1 ;
} else {
size = nativeMax ( toInteger ( size ) , 0 ) ;
}
var length = array == null ? 0 : array . length ;
if ( ! length || size < 1 ) {
return [ ] ;
}
var index = 0 ,
resIndex = 0 ,
result = Array ( nativeCeil ( length / size ) ) ;
while ( index < length ) {
result [ resIndex ++ ] = baseSlice ( array , index , ( index += size ) ) ;
}
return result ;
}
/ * *
* Creates an array with all falsey values removed . The values ` false ` , ` null ` ,
* ` 0 ` , ` "" ` , ` undefined ` , and ` NaN ` are falsey .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to compact .
* @ returns { Array } Returns the new array of filtered values .
* @ example
*
* _ . compact ( [ 0 , 1 , false , 2 , '' , 3 ] ) ;
* // => [1, 2, 3]
* /
function compact ( array ) {
var index = - 1 ,
length = array == null ? 0 : array . length ,
resIndex = 0 ,
result = [ ] ;
while ( ++ index < length ) {
var value = array [ index ] ;
if ( value ) {
result [ resIndex ++ ] = value ;
}
}
return result ;
}
/ * *
* Creates a new array concatenating ` array ` with any additional arrays
* and / or values .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to concatenate .
* @ param { ... * } [ values ] The values to concatenate .
* @ returns { Array } Returns the new concatenated array .
* @ example
*
* var array = [ 1 ] ;
* var other = _ . concat ( array , 2 , [ 3 ] , [ [ 4 ] ] ) ;
*
* console . log ( other ) ;
* // => [1, 2, 3, [4]]
*
* console . log ( array ) ;
* // => [1]
* /
function concat ( ) {
var length = arguments . length ;
if ( ! length ) {
return [ ] ;
}
var args = Array ( length - 1 ) ,
array = arguments [ 0 ] ,
index = length ;
while ( index -- ) {
args [ index - 1 ] = arguments [ index ] ;
}
return arrayPush ( isArray ( array ) ? copyArray ( array ) : [ array ] , baseFlatten ( args , 1 ) ) ;
}
/ * *
* Creates an array of ` array ` values not included in the other given arrays
* using [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons . The order and references of result values are
* determined by the first array .
*
* * * Note : * * Unlike ` _.pullAll ` , this method returns a new array .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { ... Array } [ values ] The values to exclude .
* @ returns { Array } Returns the new array of filtered values .
* @ see _ . without , _ . xor
* @ example
*
* _ . difference ( [ 2 , 1 ] , [ 2 , 3 ] ) ;
* // => [1]
* /
var difference = baseRest ( function ( array , values ) {
return isArrayLikeObject ( array ) ?
baseDifference ( array , baseFlatten ( values , 1 , isArrayLikeObject , true ) ) : [ ] ;
} ) ;
/ * *
* This method is like ` _.difference ` except that it accepts ` iteratee ` which
* is invoked for each element of ` array ` and ` values ` to generate the criterion
* by which they ' re compared . The order and references of result values are
* determined by the first array . The iteratee is invoked with one argument :
* ( value ) .
*
* * * Note : * * Unlike ` _.pullAllBy ` , this method returns a new array .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { ... Array } [ values ] The values to exclude .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns the new array of filtered values .
* @ example
*
* _ . differenceBy ( [ 2.1 , 1.2 ] , [ 2.3 , 3.4 ] , Math . floor ) ;
* // => [1.2]
*
* // The `_.property` iteratee shorthand.
* _ . differenceBy ( [ { 'x' : 2 } , { 'x' : 1 } ] , [ { 'x' : 1 } ] , 'x' ) ;
* // => [{ 'x': 2 }]
* /
var differenceBy = baseRest ( function ( array , values ) {
var iteratee = last ( values ) ;
if ( isArrayLikeObject ( iteratee ) ) {
iteratee = undefined ;
}
return isArrayLikeObject ( array ) ?
baseDifference ( array , baseFlatten ( values , 1 , isArrayLikeObject , true ) , getIteratee ( iteratee , 2 ) ) : [ ] ;
} ) ;
/ * *
* This method is like ` _.difference ` except that it accepts ` comparator `
* which is invoked to compare elements of ` array ` to ` values ` . The order and
* references of result values are determined by the first array . The comparator
* is invoked with two arguments : ( arrVal , othVal ) .
*
* * * Note : * * Unlike ` _.pullAllWith ` , this method returns a new array .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { ... Array } [ values ] The values to exclude .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of filtered values .
* @ example
*
* var objects = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 2 , 'y' : 1 } ] ;
*
* _ . differenceWith ( objects , [ { 'x' : 1 , 'y' : 2 } ] , _ . isEqual ) ;
* // => [{ 'x': 2, 'y': 1 }]
* /
var differenceWith = baseRest ( function ( array , values ) {
var comparator = last ( values ) ;
if ( isArrayLikeObject ( comparator ) ) {
comparator = undefined ;
}
return isArrayLikeObject ( array ) ?
baseDifference ( array , baseFlatten ( values , 1 , isArrayLikeObject , true ) , undefined , comparator ) : [ ] ;
} ) ;
/ * *
* Creates a slice of ` array ` with ` n ` elements dropped from the beginning .
*
* @ static
* @ memberOf _
* @ since 0.5 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { number } [ n = 1 ] The number of elements to drop .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . drop ( [ 1 , 2 , 3 ] ) ;
* // => [2, 3]
*
* _ . drop ( [ 1 , 2 , 3 ] , 2 ) ;
* // => [3]
*
* _ . drop ( [ 1 , 2 , 3 ] , 5 ) ;
* // => []
*
* _ . drop ( [ 1 , 2 , 3 ] , 0 ) ;
* // => [1, 2, 3]
* /
function drop ( array , n , guard ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
n = ( guard || n === undefined ) ? 1 : toInteger ( n ) ;
return baseSlice ( array , n < 0 ? 0 : n , length ) ;
}
/ * *
* Creates a slice of ` array ` with ` n ` elements dropped from the end .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { number } [ n = 1 ] The number of elements to drop .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . dropRight ( [ 1 , 2 , 3 ] ) ;
* // => [1, 2]
*
* _ . dropRight ( [ 1 , 2 , 3 ] , 2 ) ;
* // => [1]
*
* _ . dropRight ( [ 1 , 2 , 3 ] , 5 ) ;
* // => []
*
* _ . dropRight ( [ 1 , 2 , 3 ] , 0 ) ;
* // => [1, 2, 3]
* /
function dropRight ( array , n , guard ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
n = ( guard || n === undefined ) ? 1 : toInteger ( n ) ;
n = length - n ;
return baseSlice ( array , 0 , n < 0 ? 0 : n ) ;
}
/ * *
* Creates a slice of ` array ` excluding elements dropped from the end .
* Elements are dropped until ` predicate ` returns falsey . The predicate is
* invoked with three arguments : ( value , index , array ) .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : true } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : false }
* ] ;
*
* _ . dropRightWhile ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['barney']
*
* // The `_.matches` iteratee shorthand.
* _ . dropRightWhile ( users , { 'user' : 'pebbles' , 'active' : false } ) ;
* // => objects for ['barney', 'fred']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . dropRightWhile ( users , [ 'active' , false ] ) ;
* // => objects for ['barney']
*
* // The `_.property` iteratee shorthand.
* _ . dropRightWhile ( users , 'active' ) ;
* // => objects for ['barney', 'fred', 'pebbles']
* /
function dropRightWhile ( array , predicate ) {
return ( array && array . length ) ?
baseWhile ( array , getIteratee ( predicate , 3 ) , true , true ) : [ ] ;
}
/ * *
* Creates a slice of ` array ` excluding elements dropped from the beginning .
* Elements are dropped until ` predicate ` returns falsey . The predicate is
* invoked with three arguments : ( value , index , array ) .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : false } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : true }
* ] ;
*
* _ . dropWhile ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['pebbles']
*
* // The `_.matches` iteratee shorthand.
* _ . dropWhile ( users , { 'user' : 'barney' , 'active' : false } ) ;
* // => objects for ['fred', 'pebbles']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . dropWhile ( users , [ 'active' , false ] ) ;
* // => objects for ['pebbles']
*
* // The `_.property` iteratee shorthand.
* _ . dropWhile ( users , 'active' ) ;
* // => objects for ['barney', 'fred', 'pebbles']
* /
function dropWhile ( array , predicate ) {
return ( array && array . length ) ?
baseWhile ( array , getIteratee ( predicate , 3 ) , true ) : [ ] ;
}
/ * *
* Fills elements of ` array ` with ` value ` from ` start ` up to , but not
* including , ` end ` .
*
* * * Note : * * This method mutates ` array ` .
*
* @ static
* @ memberOf _
* @ since 3.2 . 0
* @ category Array
* @ param { Array } array The array to fill .
* @ param { * } value The value to fill ` array ` with .
* @ param { number } [ start = 0 ] The start position .
* @ param { number } [ end = array . length ] The end position .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ 1 , 2 , 3 ] ;
*
* _ . fill ( array , 'a' ) ;
* console . log ( array ) ;
* // => ['a', 'a', 'a']
*
* _ . fill ( Array ( 3 ) , 2 ) ;
* // => [2, 2, 2]
*
* _ . fill ( [ 4 , 6 , 8 , 10 ] , '*' , 1 , 3 ) ;
* // => [4, '*', '*', 10]
* /
function fill ( array , value , start , end ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
if ( start && typeof start != 'number' && isIterateeCall ( array , value , start ) ) {
start = 0 ;
end = length ;
}
return baseFill ( array , value , start , end ) ;
}
/ * *
* This method is like ` _.find ` except that it returns the index of the first
* element ` predicate ` returns truthy for instead of the element itself .
*
* @ static
* @ memberOf _
* @ since 1.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param { number } [ fromIndex = 0 ] The index to search from .
* @ returns { number } Returns the index of the found element , else ` -1 ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : false } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : true }
* ] ;
*
* _ . findIndex ( users , function ( o ) { return o . user == 'barney' ; } ) ;
* // => 0
*
* // The `_.matches` iteratee shorthand.
* _ . findIndex ( users , { 'user' : 'fred' , 'active' : false } ) ;
* // => 1
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . findIndex ( users , [ 'active' , false ] ) ;
* // => 0
*
* // The `_.property` iteratee shorthand.
* _ . findIndex ( users , 'active' ) ;
* // => 2
* /
function findIndex ( array , predicate , fromIndex ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return - 1 ;
}
var index = fromIndex == null ? 0 : toInteger ( fromIndex ) ;
if ( index < 0 ) {
index = nativeMax ( length + index , 0 ) ;
}
return baseFindIndex ( array , getIteratee ( predicate , 3 ) , index ) ;
}
/ * *
* This method is like ` _.findIndex ` except that it iterates over elements
* of ` collection ` from right to left .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param { number } [ fromIndex = array . length - 1 ] The index to search from .
* @ returns { number } Returns the index of the found element , else ` -1 ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : true } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : false }
* ] ;
*
* _ . findLastIndex ( users , function ( o ) { return o . user == 'pebbles' ; } ) ;
* // => 2
*
* // The `_.matches` iteratee shorthand.
* _ . findLastIndex ( users , { 'user' : 'barney' , 'active' : true } ) ;
* // => 0
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . findLastIndex ( users , [ 'active' , false ] ) ;
* // => 2
*
* // The `_.property` iteratee shorthand.
* _ . findLastIndex ( users , 'active' ) ;
* // => 0
* /
function findLastIndex ( array , predicate , fromIndex ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return - 1 ;
}
var index = length - 1 ;
if ( fromIndex !== undefined ) {
index = toInteger ( fromIndex ) ;
index = fromIndex < 0 ?
nativeMax ( length + index , 0 ) :
nativeMin ( index , length - 1 ) ;
}
return baseFindIndex ( array , getIteratee ( predicate , 3 ) , index , true ) ;
}
/ * *
* Flattens ` array ` a single level deep .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to flatten .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* _ . flatten ( [ 1 , [ 2 , [ 3 , [ 4 ] ] , 5 ] ] ) ;
* // => [1, 2, [3, [4]], 5]
* /
function flatten ( array ) {
var length = array == null ? 0 : array . length ;
return length ? baseFlatten ( array , 1 ) : [ ] ;
}
/ * *
* Recursively flattens ` array ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to flatten .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* _ . flattenDeep ( [ 1 , [ 2 , [ 3 , [ 4 ] ] , 5 ] ] ) ;
* // => [1, 2, 3, 4, 5]
* /
function flattenDeep ( array ) {
var length = array == null ? 0 : array . length ;
return length ? baseFlatten ( array , INFINITY ) : [ ] ;
}
/ * *
* Recursively flatten ` array ` up to ` depth ` times .
*
* @ static
* @ memberOf _
* @ since 4.4 . 0
* @ category Array
* @ param { Array } array The array to flatten .
* @ param { number } [ depth = 1 ] The maximum recursion depth .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* var array = [ 1 , [ 2 , [ 3 , [ 4 ] ] , 5 ] ] ;
*
* _ . flattenDepth ( array , 1 ) ;
* // => [1, 2, [3, [4]], 5]
*
* _ . flattenDepth ( array , 2 ) ;
* // => [1, 2, 3, [4], 5]
* /
function flattenDepth ( array , depth ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
depth = depth === undefined ? 1 : toInteger ( depth ) ;
return baseFlatten ( array , depth ) ;
}
/ * *
* The inverse of ` _.toPairs ` ; this method returns an object composed
* from key - value ` pairs ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } pairs The key - value pairs .
* @ returns { Object } Returns the new object .
* @ example
*
* _ . fromPairs ( [ [ 'a' , 1 ] , [ 'b' , 2 ] ] ) ;
* // => { 'a': 1, 'b': 2 }
* /
function fromPairs ( pairs ) {
var index = - 1 ,
length = pairs == null ? 0 : pairs . length ,
result = { } ;
while ( ++ index < length ) {
var pair = pairs [ index ] ;
result [ pair [ 0 ] ] = pair [ 1 ] ;
}
return result ;
}
/ * *
* Gets the first element of ` array ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ alias first
* @ category Array
* @ param { Array } array The array to query .
* @ returns { * } Returns the first element of ` array ` .
* @ example
*
* _ . head ( [ 1 , 2 , 3 ] ) ;
* // => 1
*
* _ . head ( [ ] ) ;
* // => undefined
* /
function head ( array ) {
return ( array && array . length ) ? array [ 0 ] : undefined ;
}
/ * *
* Gets the index at which the first occurrence of ` value ` is found in ` array `
* using [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons . If ` fromIndex ` is negative , it ' s used as the
* offset from the end of ` array ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } [ fromIndex = 0 ] The index to search from .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* @ example
*
* _ . indexOf ( [ 1 , 2 , 1 , 2 ] , 2 ) ;
* // => 1
*
* // Search from the `fromIndex`.
* _ . indexOf ( [ 1 , 2 , 1 , 2 ] , 2 , 2 ) ;
* // => 3
* /
function indexOf ( array , value , fromIndex ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return - 1 ;
}
var index = fromIndex == null ? 0 : toInteger ( fromIndex ) ;
if ( index < 0 ) {
index = nativeMax ( length + index , 0 ) ;
}
return baseIndexOf ( array , value , index ) ;
}
/ * *
* Gets all but the last element of ` array ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . initial ( [ 1 , 2 , 3 ] ) ;
* // => [1, 2]
* /
function initial ( array ) {
var length = array == null ? 0 : array . length ;
return length ? baseSlice ( array , 0 , - 1 ) : [ ] ;
}
/ * *
* Creates an array of unique values that are included in all given arrays
* using [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons . The order and references of result values are
* determined by the first array .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ returns { Array } Returns the new array of intersecting values .
* @ example
*
* _ . intersection ( [ 2 , 1 ] , [ 2 , 3 ] ) ;
* // => [2]
* /
var intersection = baseRest ( function ( arrays ) {
var mapped = arrayMap ( arrays , castArrayLikeObject ) ;
return ( mapped . length && mapped [ 0 ] === arrays [ 0 ] ) ?
baseIntersection ( mapped ) : [ ] ;
} ) ;
/ * *
* This method is like ` _.intersection ` except that it accepts ` iteratee `
* which is invoked for each element of each ` arrays ` to generate the criterion
* by which they ' re compared . The order and references of result values are
* determined by the first array . The iteratee is invoked with one argument :
* ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns the new array of intersecting values .
* @ example
*
* _ . intersectionBy ( [ 2.1 , 1.2 ] , [ 2.3 , 3.4 ] , Math . floor ) ;
* // => [2.1]
*
* // The `_.property` iteratee shorthand.
* _ . intersectionBy ( [ { 'x' : 1 } ] , [ { 'x' : 2 } , { 'x' : 1 } ] , 'x' ) ;
* // => [{ 'x': 1 }]
* /
var intersectionBy = baseRest ( function ( arrays ) {
var iteratee = last ( arrays ) ,
mapped = arrayMap ( arrays , castArrayLikeObject ) ;
if ( iteratee === last ( mapped ) ) {
iteratee = undefined ;
} else {
mapped . pop ( ) ;
}
return ( mapped . length && mapped [ 0 ] === arrays [ 0 ] ) ?
baseIntersection ( mapped , getIteratee ( iteratee , 2 ) ) : [ ] ;
} ) ;
/ * *
* This method is like ` _.intersection ` except that it accepts ` comparator `
* which is invoked to compare elements of ` arrays ` . The order and references
* of result values are determined by the first array . The comparator is
* invoked with two arguments : ( arrVal , othVal ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of intersecting values .
* @ example
*
* var objects = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 2 , 'y' : 1 } ] ;
* var others = [ { 'x' : 1 , 'y' : 1 } , { 'x' : 1 , 'y' : 2 } ] ;
*
* _ . intersectionWith ( objects , others , _ . isEqual ) ;
* // => [{ 'x': 1, 'y': 2 }]
* /
var intersectionWith = baseRest ( function ( arrays ) {
var comparator = last ( arrays ) ,
mapped = arrayMap ( arrays , castArrayLikeObject ) ;
comparator = typeof comparator == 'function' ? comparator : undefined ;
if ( comparator ) {
mapped . pop ( ) ;
}
return ( mapped . length && mapped [ 0 ] === arrays [ 0 ] ) ?
baseIntersection ( mapped , undefined , comparator ) : [ ] ;
} ) ;
/ * *
* Converts all elements in ` array ` into a string separated by ` separator ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to convert .
* @ param { string } [ separator = ',' ] The element separator .
* @ returns { string } Returns the joined string .
* @ example
*
* _ . join ( [ 'a' , 'b' , 'c' ] , '~' ) ;
* // => 'a~b~c'
* /
function join ( array , separator ) {
return array == null ? '' : nativeJoin . call ( array , separator ) ;
}
/ * *
* Gets the last element of ` array ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ returns { * } Returns the last element of ` array ` .
* @ example
*
* _ . last ( [ 1 , 2 , 3 ] ) ;
* // => 3
* /
function last ( array ) {
var length = array == null ? 0 : array . length ;
return length ? array [ length - 1 ] : undefined ;
}
/ * *
* This method is like ` _.indexOf ` except that it iterates over elements of
* ` array ` from right to left .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ param { number } [ fromIndex = array . length - 1 ] The index to search from .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* @ example
*
* _ . lastIndexOf ( [ 1 , 2 , 1 , 2 ] , 2 ) ;
* // => 3
*
* // Search from the `fromIndex`.
* _ . lastIndexOf ( [ 1 , 2 , 1 , 2 ] , 2 , 2 ) ;
* // => 1
* /
function lastIndexOf ( array , value , fromIndex ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return - 1 ;
}
var index = length ;
if ( fromIndex !== undefined ) {
index = toInteger ( fromIndex ) ;
index = index < 0 ? nativeMax ( length + index , 0 ) : nativeMin ( index , length - 1 ) ;
}
return value === value ?
strictLastIndexOf ( array , value , index ) :
baseFindIndex ( array , baseIsNaN , index , true ) ;
}
/ * *
* Gets the element at index ` n ` of ` array ` . If ` n ` is negative , the nth
* element from the end is returned .
*
* @ static
* @ memberOf _
* @ since 4.11 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { number } [ n = 0 ] The index of the element to return .
* @ returns { * } Returns the nth element of ` array ` .
* @ example
*
* var array = [ 'a' , 'b' , 'c' , 'd' ] ;
*
* _ . nth ( array , 1 ) ;
* // => 'b'
*
* _ . nth ( array , - 2 ) ;
* // => 'c';
* /
function nth ( array , n ) {
return ( array && array . length ) ? baseNth ( array , toInteger ( n ) ) : undefined ;
}
/ * *
* Removes all given values from ` array ` using
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons .
*
* * * Note : * * Unlike ` _.without ` , this method mutates ` array ` . Use ` _.remove `
* to remove elements from an array by predicate .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { ... * } [ values ] The values to remove .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ 'a' , 'b' , 'c' , 'a' , 'b' , 'c' ] ;
*
* _ . pull ( array , 'a' , 'c' ) ;
* console . log ( array ) ;
* // => ['b', 'b']
* /
var pull = baseRest ( pullAll ) ;
/ * *
* This method is like ` _.pull ` except that it accepts an array of values to remove .
*
* * * Note : * * Unlike ` _.difference ` , this method mutates ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { Array } values The values to remove .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ 'a' , 'b' , 'c' , 'a' , 'b' , 'c' ] ;
*
* _ . pullAll ( array , [ 'a' , 'c' ] ) ;
* console . log ( array ) ;
* // => ['b', 'b']
* /
function pullAll ( array , values ) {
return ( array && array . length && values && values . length ) ?
basePullAll ( array , values ) :
array ;
}
/ * *
* This method is like ` _.pullAll ` except that it accepts ` iteratee ` which is
* invoked for each element of ` array ` and ` values ` to generate the criterion
* by which they ' re compared . The iteratee is invoked with one argument : ( value ) .
*
* * * Note : * * Unlike ` _.differenceBy ` , this method mutates ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { Array } values The values to remove .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ { 'x' : 1 } , { 'x' : 2 } , { 'x' : 3 } , { 'x' : 1 } ] ;
*
* _ . pullAllBy ( array , [ { 'x' : 1 } , { 'x' : 3 } ] , 'x' ) ;
* console . log ( array ) ;
* // => [{ 'x': 2 }]
* /
function pullAllBy ( array , values , iteratee ) {
return ( array && array . length && values && values . length ) ?
basePullAll ( array , values , getIteratee ( iteratee , 2 ) ) :
array ;
}
/ * *
* This method is like ` _.pullAll ` except that it accepts ` comparator ` which
* is invoked to compare elements of ` array ` to ` values ` . The comparator is
* invoked with two arguments : ( arrVal , othVal ) .
*
* * * Note : * * Unlike ` _.differenceWith ` , this method mutates ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.6 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { Array } values The values to remove .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 3 , 'y' : 4 } , { 'x' : 5 , 'y' : 6 } ] ;
*
* _ . pullAllWith ( array , [ { 'x' : 3 , 'y' : 4 } ] , _ . isEqual ) ;
* console . log ( array ) ;
* // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]
* /
function pullAllWith ( array , values , comparator ) {
return ( array && array . length && values && values . length ) ?
basePullAll ( array , values , undefined , comparator ) :
array ;
}
/ * *
* Removes elements from ` array ` corresponding to ` indexes ` and returns an
* array of removed elements .
*
* * * Note : * * Unlike ` _.at ` , this method mutates ` array ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { ... ( number | number [ ] ) } [ indexes ] The indexes of elements to remove .
* @ returns { Array } Returns the new array of removed elements .
* @ example
*
* var array = [ 'a' , 'b' , 'c' , 'd' ] ;
* var pulled = _ . pullAt ( array , [ 1 , 3 ] ) ;
*
* console . log ( array ) ;
* // => ['a', 'c']
*
* console . log ( pulled ) ;
* // => ['b', 'd']
* /
var pullAt = flatRest ( function ( array , indexes ) {
var length = array == null ? 0 : array . length ,
result = baseAt ( array , indexes ) ;
basePullAt ( array , arrayMap ( indexes , function ( index ) {
return isIndex ( index , length ) ? + index : index ;
} ) . sort ( compareAscending ) ) ;
return result ;
} ) ;
/ * *
* Removes all elements from ` array ` that ` predicate ` returns truthy for
* and returns an array of the removed elements . The predicate is invoked
* with three arguments : ( value , index , array ) .
*
* * * Note : * * Unlike ` _.filter ` , this method mutates ` array ` . Use ` _.pull `
* to pull elements from an array by value .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new array of removed elements .
* @ example
*
* var array = [ 1 , 2 , 3 , 4 ] ;
* var evens = _ . remove ( array , function ( n ) {
* return n % 2 == 0 ;
* } ) ;
*
* console . log ( array ) ;
* // => [1, 3]
*
* console . log ( evens ) ;
* // => [2, 4]
* /
function remove ( array , predicate ) {
var result = [ ] ;
if ( ! ( array && array . length ) ) {
return result ;
}
var index = - 1 ,
indexes = [ ] ,
length = array . length ;
predicate = getIteratee ( predicate , 3 ) ;
while ( ++ index < length ) {
var value = array [ index ] ;
if ( predicate ( value , index , array ) ) {
result . push ( value ) ;
indexes . push ( index ) ;
}
}
basePullAt ( array , indexes ) ;
return result ;
}
/ * *
* Reverses ` array ` so that the first element becomes the last , the second
* element becomes the second to last , and so on .
*
* * * Note : * * This method mutates ` array ` and is based on
* [ ` Array#reverse ` ] ( https : //mdn.io/Array/reverse).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to modify .
* @ returns { Array } Returns ` array ` .
* @ example
*
* var array = [ 1 , 2 , 3 ] ;
*
* _ . reverse ( array ) ;
* // => [3, 2, 1]
*
* console . log ( array ) ;
* // => [3, 2, 1]
* /
function reverse ( array ) {
return array == null ? array : nativeReverse . call ( array ) ;
}
/ * *
* Creates a slice of ` array ` from ` start ` up to , but not including , ` end ` .
*
* * * Note : * * This method is used instead of
* [ ` Array#slice ` ] ( https : //mdn.io/Array/slice) to ensure dense arrays are
* returned .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to slice .
* @ param { number } [ start = 0 ] The start position .
* @ param { number } [ end = array . length ] The end position .
* @ returns { Array } Returns the slice of ` array ` .
* /
function slice ( array , start , end ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
if ( end && typeof end != 'number' && isIterateeCall ( array , start , end ) ) {
start = 0 ;
end = length ;
} else {
start = start == null ? 0 : toInteger ( start ) ;
end = end === undefined ? length : toInteger ( end ) ;
}
return baseSlice ( array , start , end ) ;
}
/ * *
* Uses a binary search to determine the lowest index at which ` value `
* should be inserted into ` array ` in order to maintain its sort order .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* @ example
*
* _ . sortedIndex ( [ 30 , 50 ] , 40 ) ;
* // => 1
* /
function sortedIndex ( array , value ) {
return baseSortedIndex ( array , value ) ;
}
/ * *
* This method is like ` _.sortedIndex ` except that it accepts ` iteratee `
* which is invoked for ` value ` and each element of ` array ` to compute their
* sort ranking . The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* @ example
*
* var objects = [ { 'x' : 4 } , { 'x' : 5 } ] ;
*
* _ . sortedIndexBy ( objects , { 'x' : 4 } , function ( o ) { return o . x ; } ) ;
* // => 0
*
* // The `_.property` iteratee shorthand.
* _ . sortedIndexBy ( objects , { 'x' : 4 } , 'x' ) ;
* // => 0
* /
function sortedIndexBy ( array , value , iteratee ) {
return baseSortedIndexBy ( array , value , getIteratee ( iteratee , 2 ) ) ;
}
/ * *
* This method is like ` _.indexOf ` except that it performs a binary
* search on a sorted ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* @ example
*
* _ . sortedIndexOf ( [ 4 , 5 , 5 , 5 , 6 ] , 5 ) ;
* // => 1
* /
function sortedIndexOf ( array , value ) {
var length = array == null ? 0 : array . length ;
if ( length ) {
var index = baseSortedIndex ( array , value ) ;
if ( index < length && eq ( array [ index ] , value ) ) {
return index ;
}
}
return - 1 ;
}
/ * *
* This method is like ` _.sortedIndex ` except that it returns the highest
* index at which ` value ` should be inserted into ` array ` in order to
* maintain its sort order .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* @ example
*
* _ . sortedLastIndex ( [ 4 , 5 , 5 , 5 , 6 ] , 5 ) ;
* // => 4
* /
function sortedLastIndex ( array , value ) {
return baseSortedIndex ( array , value , true ) ;
}
/ * *
* This method is like ` _.sortedLastIndex ` except that it accepts ` iteratee `
* which is invoked for ` value ` and each element of ` array ` to compute their
* sort ranking . The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The sorted array to inspect .
* @ param { * } value The value to evaluate .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { number } Returns the index at which ` value ` should be inserted
* into ` array ` .
* @ example
*
* var objects = [ { 'x' : 4 } , { 'x' : 5 } ] ;
*
* _ . sortedLastIndexBy ( objects , { 'x' : 4 } , function ( o ) { return o . x ; } ) ;
* // => 1
*
* // The `_.property` iteratee shorthand.
* _ . sortedLastIndexBy ( objects , { 'x' : 4 } , 'x' ) ;
* // => 1
* /
function sortedLastIndexBy ( array , value , iteratee ) {
return baseSortedIndexBy ( array , value , getIteratee ( iteratee , 2 ) , true ) ;
}
/ * *
* This method is like ` _.lastIndexOf ` except that it performs a binary
* search on a sorted ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { * } value The value to search for .
* @ returns { number } Returns the index of the matched value , else ` -1 ` .
* @ example
*
* _ . sortedLastIndexOf ( [ 4 , 5 , 5 , 5 , 6 ] , 5 ) ;
* // => 3
* /
function sortedLastIndexOf ( array , value ) {
var length = array == null ? 0 : array . length ;
if ( length ) {
var index = baseSortedIndex ( array , value , true ) - 1 ;
if ( eq ( array [ index ] , value ) ) {
return index ;
}
}
return - 1 ;
}
/ * *
* This method is like ` _.uniq ` except that it ' s designed and optimized
* for sorted arrays .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ returns { Array } Returns the new duplicate free array .
* @ example
*
* _ . sortedUniq ( [ 1 , 1 , 2 ] ) ;
* // => [1, 2]
* /
function sortedUniq ( array ) {
return ( array && array . length ) ?
baseSortedUniq ( array ) : [ ] ;
}
/ * *
* This method is like ` _.uniqBy ` except that it ' s designed and optimized
* for sorted arrays .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { Function } [ iteratee ] The iteratee invoked per element .
* @ returns { Array } Returns the new duplicate free array .
* @ example
*
* _ . sortedUniqBy ( [ 1.1 , 1.2 , 2.3 , 2.4 ] , Math . floor ) ;
* // => [1.1, 2.3]
* /
function sortedUniqBy ( array , iteratee ) {
return ( array && array . length ) ?
baseSortedUniq ( array , getIteratee ( iteratee , 2 ) ) : [ ] ;
}
/ * *
* Gets all but the first element of ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . tail ( [ 1 , 2 , 3 ] ) ;
* // => [2, 3]
* /
function tail ( array ) {
var length = array == null ? 0 : array . length ;
return length ? baseSlice ( array , 1 , length ) : [ ] ;
}
/ * *
* Creates a slice of ` array ` with ` n ` elements taken from the beginning .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { number } [ n = 1 ] The number of elements to take .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . take ( [ 1 , 2 , 3 ] ) ;
* // => [1]
*
* _ . take ( [ 1 , 2 , 3 ] , 2 ) ;
* // => [1, 2]
*
* _ . take ( [ 1 , 2 , 3 ] , 5 ) ;
* // => [1, 2, 3]
*
* _ . take ( [ 1 , 2 , 3 ] , 0 ) ;
* // => []
* /
function take ( array , n , guard ) {
if ( ! ( array && array . length ) ) {
return [ ] ;
}
n = ( guard || n === undefined ) ? 1 : toInteger ( n ) ;
return baseSlice ( array , 0 , n < 0 ? 0 : n ) ;
}
/ * *
* Creates a slice of ` array ` with ` n ` elements taken from the end .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { number } [ n = 1 ] The number of elements to take .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* _ . takeRight ( [ 1 , 2 , 3 ] ) ;
* // => [3]
*
* _ . takeRight ( [ 1 , 2 , 3 ] , 2 ) ;
* // => [2, 3]
*
* _ . takeRight ( [ 1 , 2 , 3 ] , 5 ) ;
* // => [1, 2, 3]
*
* _ . takeRight ( [ 1 , 2 , 3 ] , 0 ) ;
* // => []
* /
function takeRight ( array , n , guard ) {
var length = array == null ? 0 : array . length ;
if ( ! length ) {
return [ ] ;
}
n = ( guard || n === undefined ) ? 1 : toInteger ( n ) ;
n = length - n ;
return baseSlice ( array , n < 0 ? 0 : n , length ) ;
}
/ * *
* Creates a slice of ` array ` with elements taken from the end . Elements are
* taken until ` predicate ` returns falsey . The predicate is invoked with
* three arguments : ( value , index , array ) .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : true } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : false }
* ] ;
*
* _ . takeRightWhile ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['fred', 'pebbles']
*
* // The `_.matches` iteratee shorthand.
* _ . takeRightWhile ( users , { 'user' : 'pebbles' , 'active' : false } ) ;
* // => objects for ['pebbles']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . takeRightWhile ( users , [ 'active' , false ] ) ;
* // => objects for ['fred', 'pebbles']
*
* // The `_.property` iteratee shorthand.
* _ . takeRightWhile ( users , 'active' ) ;
* // => []
* /
function takeRightWhile ( array , predicate ) {
return ( array && array . length ) ?
baseWhile ( array , getIteratee ( predicate , 3 ) , false , true ) : [ ] ;
}
/ * *
* Creates a slice of ` array ` with elements taken from the beginning . Elements
* are taken until ` predicate ` returns falsey . The predicate is invoked with
* three arguments : ( value , index , array ) .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Array
* @ param { Array } array The array to query .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the slice of ` array ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'active' : false } ,
* { 'user' : 'fred' , 'active' : false } ,
* { 'user' : 'pebbles' , 'active' : true }
* ] ;
*
* _ . takeWhile ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['barney', 'fred']
*
* // The `_.matches` iteratee shorthand.
* _ . takeWhile ( users , { 'user' : 'barney' , 'active' : false } ) ;
* // => objects for ['barney']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . takeWhile ( users , [ 'active' , false ] ) ;
* // => objects for ['barney', 'fred']
*
* // The `_.property` iteratee shorthand.
* _ . takeWhile ( users , 'active' ) ;
* // => []
* /
function takeWhile ( array , predicate ) {
return ( array && array . length ) ?
baseWhile ( array , getIteratee ( predicate , 3 ) ) : [ ] ;
}
/ * *
* Creates an array of unique values , in order , from all given arrays using
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ returns { Array } Returns the new array of combined values .
* @ example
*
* _ . union ( [ 2 ] , [ 1 , 2 ] ) ;
* // => [2, 1]
* /
var union = baseRest ( function ( arrays ) {
return baseUniq ( baseFlatten ( arrays , 1 , isArrayLikeObject , true ) ) ;
} ) ;
/ * *
* This method is like ` _.union ` except that it accepts ` iteratee ` which is
* invoked for each element of each ` arrays ` to generate the criterion by
* which uniqueness is computed . Result values are chosen from the first
* array in which the value occurs . The iteratee is invoked with one argument :
* ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns the new array of combined values .
* @ example
*
* _ . unionBy ( [ 2.1 ] , [ 1.2 , 2.3 ] , Math . floor ) ;
* // => [2.1, 1.2]
*
* // The `_.property` iteratee shorthand.
* _ . unionBy ( [ { 'x' : 1 } ] , [ { 'x' : 2 } , { 'x' : 1 } ] , 'x' ) ;
* // => [{ 'x': 1 }, { 'x': 2 }]
* /
var unionBy = baseRest ( function ( arrays ) {
var iteratee = last ( arrays ) ;
if ( isArrayLikeObject ( iteratee ) ) {
iteratee = undefined ;
}
return baseUniq ( baseFlatten ( arrays , 1 , isArrayLikeObject , true ) , getIteratee ( iteratee , 2 ) ) ;
} ) ;
/ * *
* This method is like ` _.union ` except that it accepts ` comparator ` which
* is invoked to compare elements of ` arrays ` . Result values are chosen from
* the first array in which the value occurs . The comparator is invoked
* with two arguments : ( arrVal , othVal ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of combined values .
* @ example
*
* var objects = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 2 , 'y' : 1 } ] ;
* var others = [ { 'x' : 1 , 'y' : 1 } , { 'x' : 1 , 'y' : 2 } ] ;
*
* _ . unionWith ( objects , others , _ . isEqual ) ;
* // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
* /
var unionWith = baseRest ( function ( arrays ) {
var comparator = last ( arrays ) ;
comparator = typeof comparator == 'function' ? comparator : undefined ;
return baseUniq ( baseFlatten ( arrays , 1 , isArrayLikeObject , true ) , undefined , comparator ) ;
} ) ;
/ * *
* Creates a duplicate - free version of an array , using
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons , in which only the first occurrence of each element
* is kept . The order of result values is determined by the order they occur
* in the array .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ returns { Array } Returns the new duplicate free array .
* @ example
*
* _ . uniq ( [ 2 , 1 , 2 ] ) ;
* // => [2, 1]
* /
function uniq ( array ) {
return ( array && array . length ) ? baseUniq ( array ) : [ ] ;
}
/ * *
* This method is like ` _.uniq ` except that it accepts ` iteratee ` which is
* invoked for each element in ` array ` to generate the criterion by which
* uniqueness is computed . The order of result values is determined by the
* order they occur in the array . The iteratee is invoked with one argument :
* ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns the new duplicate free array .
* @ example
*
* _ . uniqBy ( [ 2.1 , 1.2 , 2.3 ] , Math . floor ) ;
* // => [2.1, 1.2]
*
* // The `_.property` iteratee shorthand.
* _ . uniqBy ( [ { 'x' : 1 } , { 'x' : 2 } , { 'x' : 1 } ] , 'x' ) ;
* // => [{ 'x': 1 }, { 'x': 2 }]
* /
function uniqBy ( array , iteratee ) {
return ( array && array . length ) ? baseUniq ( array , getIteratee ( iteratee , 2 ) ) : [ ] ;
}
/ * *
* This method is like ` _.uniq ` except that it accepts ` comparator ` which
* is invoked to compare elements of ` array ` . The order of result values is
* determined by the order they occur in the array . The comparator is invoked
* with two arguments : ( arrVal , othVal ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new duplicate free array .
* @ example
*
* var objects = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 2 , 'y' : 1 } , { 'x' : 1 , 'y' : 2 } ] ;
*
* _ . uniqWith ( objects , _ . isEqual ) ;
* // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]
* /
function uniqWith ( array , comparator ) {
comparator = typeof comparator == 'function' ? comparator : undefined ;
return ( array && array . length ) ? baseUniq ( array , undefined , comparator ) : [ ] ;
}
/ * *
* This method is like ` _.zip ` except that it accepts an array of grouped
* elements and creates an array regrouping the elements to their pre - zip
* configuration .
*
* @ static
* @ memberOf _
* @ since 1.2 . 0
* @ category Array
* @ param { Array } array The array of grouped elements to process .
* @ returns { Array } Returns the new array of regrouped elements .
* @ example
*
* var zipped = _ . zip ( [ 'a' , 'b' ] , [ 1 , 2 ] , [ true , false ] ) ;
* // => [['a', 1, true], ['b', 2, false]]
*
* _ . unzip ( zipped ) ;
* // => [['a', 'b'], [1, 2], [true, false]]
* /
function unzip ( array ) {
if ( ! ( array && array . length ) ) {
return [ ] ;
}
var length = 0 ;
array = arrayFilter ( array , function ( group ) {
if ( isArrayLikeObject ( group ) ) {
length = nativeMax ( group . length , length ) ;
return true ;
}
} ) ;
return baseTimes ( length , function ( index ) {
return arrayMap ( array , baseProperty ( index ) ) ;
} ) ;
}
/ * *
* This method is like ` _.unzip ` except that it accepts ` iteratee ` to specify
* how regrouped values should be combined . The iteratee is invoked with the
* elements of each group : ( ... group ) .
*
* @ static
* @ memberOf _
* @ since 3.8 . 0
* @ category Array
* @ param { Array } array The array of grouped elements to process .
* @ param { Function } [ iteratee = _ . identity ] The function to combine
* regrouped values .
* @ returns { Array } Returns the new array of regrouped elements .
* @ example
*
* var zipped = _ . zip ( [ 1 , 2 ] , [ 10 , 20 ] , [ 100 , 200 ] ) ;
* // => [[1, 10, 100], [2, 20, 200]]
*
* _ . unzipWith ( zipped , _ . add ) ;
* // => [3, 30, 300]
* /
function unzipWith ( array , iteratee ) {
if ( ! ( array && array . length ) ) {
return [ ] ;
}
var result = unzip ( array ) ;
if ( iteratee == null ) {
return result ;
}
return arrayMap ( result , function ( group ) {
return apply ( iteratee , undefined , group ) ;
} ) ;
}
/ * *
* Creates an array excluding all given values using
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* for equality comparisons .
*
* * * Note : * * Unlike ` _.pull ` , this method returns a new array .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { Array } array The array to inspect .
* @ param { ... * } [ values ] The values to exclude .
* @ returns { Array } Returns the new array of filtered values .
* @ see _ . difference , _ . xor
* @ example
*
* _ . without ( [ 2 , 1 , 2 , 3 ] , 1 , 2 ) ;
* // => [3]
* /
var without = baseRest ( function ( array , values ) {
return isArrayLikeObject ( array ) ?
baseDifference ( array , values ) : [ ] ;
} ) ;
/ * *
* Creates an array of unique values that is the
* [ symmetric difference ] ( https : //en.wikipedia.org/wiki/Symmetric_difference)
* of the given arrays . The order of result values is determined by the order
* they occur in the arrays .
*
* @ static
* @ memberOf _
* @ since 2.4 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ returns { Array } Returns the new array of filtered values .
* @ see _ . difference , _ . without
* @ example
*
* _ . xor ( [ 2 , 1 ] , [ 2 , 3 ] ) ;
* // => [1, 3]
* /
var xor = baseRest ( function ( arrays ) {
return baseXor ( arrayFilter ( arrays , isArrayLikeObject ) ) ;
} ) ;
/ * *
* This method is like ` _.xor ` except that it accepts ` iteratee ` which is
* invoked for each element of each ` arrays ` to generate the criterion by
* which by which they ' re compared . The order of result values is determined
* by the order they occur in the arrays . The iteratee is invoked with one
* argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Array } Returns the new array of filtered values .
* @ example
*
* _ . xorBy ( [ 2.1 , 1.2 ] , [ 2.3 , 3.4 ] , Math . floor ) ;
* // => [1.2, 3.4]
*
* // The `_.property` iteratee shorthand.
* _ . xorBy ( [ { 'x' : 1 } ] , [ { 'x' : 2 } , { 'x' : 1 } ] , 'x' ) ;
* // => [{ 'x': 2 }]
* /
var xorBy = baseRest ( function ( arrays ) {
var iteratee = last ( arrays ) ;
if ( isArrayLikeObject ( iteratee ) ) {
iteratee = undefined ;
}
return baseXor ( arrayFilter ( arrays , isArrayLikeObject ) , getIteratee ( iteratee , 2 ) ) ;
} ) ;
/ * *
* This method is like ` _.xor ` except that it accepts ` comparator ` which is
* invoked to compare elements of ` arrays ` . The order of result values is
* determined by the order they occur in the arrays . The comparator is invoked
* with two arguments : ( arrVal , othVal ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to inspect .
* @ param { Function } [ comparator ] The comparator invoked per element .
* @ returns { Array } Returns the new array of filtered values .
* @ example
*
* var objects = [ { 'x' : 1 , 'y' : 2 } , { 'x' : 2 , 'y' : 1 } ] ;
* var others = [ { 'x' : 1 , 'y' : 1 } , { 'x' : 1 , 'y' : 2 } ] ;
*
* _ . xorWith ( objects , others , _ . isEqual ) ;
* // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
* /
var xorWith = baseRest ( function ( arrays ) {
var comparator = last ( arrays ) ;
comparator = typeof comparator == 'function' ? comparator : undefined ;
return baseXor ( arrayFilter ( arrays , isArrayLikeObject ) , undefined , comparator ) ;
} ) ;
/ * *
* Creates an array of grouped elements , the first of which contains the
* first elements of the given arrays , the second of which contains the
* second elements of the given arrays , and so on .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to process .
* @ returns { Array } Returns the new array of grouped elements .
* @ example
*
* _ . zip ( [ 'a' , 'b' ] , [ 1 , 2 ] , [ true , false ] ) ;
* // => [['a', 1, true], ['b', 2, false]]
* /
var zip = baseRest ( unzip ) ;
/ * *
* This method is like ` _.fromPairs ` except that it accepts two arrays ,
* one of property identifiers and one of corresponding values .
*
* @ static
* @ memberOf _
* @ since 0.4 . 0
* @ category Array
* @ param { Array } [ props = [ ] ] The property identifiers .
* @ param { Array } [ values = [ ] ] The property values .
* @ returns { Object } Returns the new object .
* @ example
*
* _ . zipObject ( [ 'a' , 'b' ] , [ 1 , 2 ] ) ;
* // => { 'a': 1, 'b': 2 }
* /
function zipObject ( props , values ) {
return baseZipObject ( props || [ ] , values || [ ] , assignValue ) ;
}
/ * *
* This method is like ` _.zipObject ` except that it supports property paths .
*
* @ static
* @ memberOf _
* @ since 4.1 . 0
* @ category Array
* @ param { Array } [ props = [ ] ] The property identifiers .
* @ param { Array } [ values = [ ] ] The property values .
* @ returns { Object } Returns the new object .
* @ example
*
* _ . zipObjectDeep ( [ 'a.b[0].c' , 'a.b[1].d' ] , [ 1 , 2 ] ) ;
* // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }
* /
function zipObjectDeep ( props , values ) {
return baseZipObject ( props || [ ] , values || [ ] , baseSet ) ;
}
/ * *
* This method is like ` _.zip ` except that it accepts ` iteratee ` to specify
* how grouped values should be combined . The iteratee is invoked with the
* elements of each group : ( ... group ) .
*
* @ static
* @ memberOf _
* @ since 3.8 . 0
* @ category Array
* @ param { ... Array } [ arrays ] The arrays to process .
* @ param { Function } [ iteratee = _ . identity ] The function to combine
* grouped values .
* @ returns { Array } Returns the new array of grouped elements .
* @ example
*
* _ . zipWith ( [ 1 , 2 ] , [ 10 , 20 ] , [ 100 , 200 ] , function ( a , b , c ) {
* return a + b + c ;
* } ) ;
* // => [111, 222]
* /
var zipWith = baseRest ( function ( arrays ) {
var length = arrays . length ,
iteratee = length > 1 ? arrays [ length - 1 ] : undefined ;
iteratee = typeof iteratee == 'function' ? ( arrays . pop ( ) , iteratee ) : undefined ;
return unzipWith ( arrays , iteratee ) ;
} ) ;
/*------------------------------------------------------------------------*/
/ * *
* Creates a ` lodash ` wrapper instance that wraps ` value ` with explicit method
* chain sequences enabled . The result of such sequences must be unwrapped
* with ` _#value ` .
*
* @ static
* @ memberOf _
* @ since 1.3 . 0
* @ category Seq
* @ param { * } value The value to wrap .
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 } ,
* { 'user' : 'fred' , 'age' : 40 } ,
* { 'user' : 'pebbles' , 'age' : 1 }
* ] ;
*
* var youngest = _
* . chain ( users )
* . sortBy ( 'age' )
* . map ( function ( o ) {
* return o . user + ' is ' + o . age ;
* } )
* . head ( )
* . value ( ) ;
* // => 'pebbles is 1'
* /
function chain ( value ) {
var result = lodash ( value ) ;
result . _ _chain _ _ = true ;
return result ;
}
/ * *
* This method invokes ` interceptor ` and returns ` value ` . The interceptor
* is invoked with one argument ; ( value ) . The purpose of this method is to
* "tap into" a method chain sequence in order to modify intermediate results .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Seq
* @ param { * } value The value to provide to ` interceptor ` .
* @ param { Function } interceptor The function to invoke .
* @ returns { * } Returns ` value ` .
* @ example
*
* _ ( [ 1 , 2 , 3 ] )
* . tap ( function ( array ) {
* // Mutate input array.
* array . pop ( ) ;
* } )
* . reverse ( )
* . value ( ) ;
* // => [2, 1]
* /
function tap ( value , interceptor ) {
interceptor ( value ) ;
return value ;
}
/ * *
* This method is like ` _.tap ` except that it returns the result of ` interceptor ` .
* The purpose of this method is to "pass thru" values replacing intermediate
* results in a method chain sequence .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Seq
* @ param { * } value The value to provide to ` interceptor ` .
* @ param { Function } interceptor The function to invoke .
* @ returns { * } Returns the result of ` interceptor ` .
* @ example
*
* _ ( ' abc ' )
* . chain ( )
* . trim ( )
* . thru ( function ( value ) {
* return [ value ] ;
* } )
* . value ( ) ;
* // => ['abc']
* /
function thru ( value , interceptor ) {
return interceptor ( value ) ;
}
/ * *
* This method is the wrapper version of ` _.at ` .
*
* @ name at
* @ memberOf _
* @ since 1.0 . 0
* @ category Seq
* @ param { ... ( string | string [ ] ) } [ paths ] The property paths to pick .
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 3 } } , 4 ] } ;
*
* _ ( object ) . at ( [ 'a[0].b.c' , 'a[1]' ] ) . value ( ) ;
* // => [3, 4]
* /
var wrapperAt = flatRest ( function ( paths ) {
var length = paths . length ,
start = length ? paths [ 0 ] : 0 ,
value = this . _ _wrapped _ _ ,
interceptor = function ( object ) { return baseAt ( object , paths ) ; } ;
if ( length > 1 || this . _ _actions _ _ . length ||
! ( value instanceof LazyWrapper ) || ! isIndex ( start ) ) {
return this . thru ( interceptor ) ;
}
value = value . slice ( start , + start + ( length ? 1 : 0 ) ) ;
value . _ _actions _ _ . push ( {
'func' : thru ,
'args' : [ interceptor ] ,
'thisArg' : undefined
} ) ;
return new LodashWrapper ( value , this . _ _chain _ _ ) . thru ( function ( array ) {
if ( length && ! array . length ) {
array . push ( undefined ) ;
}
return array ;
} ) ;
} ) ;
/ * *
* Creates a ` lodash ` wrapper instance with explicit method chain sequences enabled .
*
* @ name chain
* @ memberOf _
* @ since 0.1 . 0
* @ category Seq
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 } ,
* { 'user' : 'fred' , 'age' : 40 }
* ] ;
*
* // A sequence without explicit chaining.
* _ ( users ) . head ( ) ;
* // => { 'user': 'barney', 'age': 36 }
*
* // A sequence with explicit chaining.
* _ ( users )
* . chain ( )
* . head ( )
* . pick ( 'user' )
* . value ( ) ;
* // => { 'user': 'barney' }
* /
function wrapperChain ( ) {
return chain ( this ) ;
}
/ * *
* Executes the chain sequence and returns the wrapped result .
*
* @ name commit
* @ memberOf _
* @ since 3.2 . 0
* @ category Seq
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* var array = [ 1 , 2 ] ;
* var wrapped = _ ( array ) . push ( 3 ) ;
*
* console . log ( array ) ;
* // => [1, 2]
*
* wrapped = wrapped . commit ( ) ;
* console . log ( array ) ;
* // => [1, 2, 3]
*
* wrapped . last ( ) ;
* // => 3
*
* console . log ( array ) ;
* // => [1, 2, 3]
* /
function wrapperCommit ( ) {
return new LodashWrapper ( this . value ( ) , this . _ _chain _ _ ) ;
}
/ * *
* Gets the next value on a wrapped object following the
* [ iterator protocol ] ( https : //mdn.io/iteration_protocols#iterator).
*
* @ name next
* @ memberOf _
* @ since 4.0 . 0
* @ category Seq
* @ returns { Object } Returns the next iterator value .
* @ example
*
* var wrapped = _ ( [ 1 , 2 ] ) ;
*
* wrapped . next ( ) ;
* // => { 'done': false, 'value': 1 }
*
* wrapped . next ( ) ;
* // => { 'done': false, 'value': 2 }
*
* wrapped . next ( ) ;
* // => { 'done': true, 'value': undefined }
* /
function wrapperNext ( ) {
if ( this . _ _values _ _ === undefined ) {
this . _ _values _ _ = toArray ( this . value ( ) ) ;
}
var done = this . _ _index _ _ >= this . _ _values _ _ . length ,
value = done ? undefined : this . _ _values _ _ [ this . _ _index _ _ ++ ] ;
return { 'done' : done , 'value' : value } ;
}
/ * *
* Enables the wrapper to be iterable .
*
* @ name Symbol . iterator
* @ memberOf _
* @ since 4.0 . 0
* @ category Seq
* @ returns { Object } Returns the wrapper object .
* @ example
*
* var wrapped = _ ( [ 1 , 2 ] ) ;
*
* wrapped [ Symbol . iterator ] ( ) === wrapped ;
* // => true
*
* Array . from ( wrapped ) ;
* // => [1, 2]
* /
function wrapperToIterator ( ) {
return this ;
}
/ * *
* Creates a clone of the chain sequence planting ` value ` as the wrapped value .
*
* @ name plant
* @ memberOf _
* @ since 3.2 . 0
* @ category Seq
* @ param { * } value The value to plant .
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* function square ( n ) {
* return n * n ;
* }
*
* var wrapped = _ ( [ 1 , 2 ] ) . map ( square ) ;
* var other = wrapped . plant ( [ 3 , 4 ] ) ;
*
* other . value ( ) ;
* // => [9, 16]
*
* wrapped . value ( ) ;
* // => [1, 4]
* /
function wrapperPlant ( value ) {
var result ,
parent = this ;
while ( parent instanceof baseLodash ) {
var clone = wrapperClone ( parent ) ;
clone . _ _index _ _ = 0 ;
clone . _ _values _ _ = undefined ;
if ( result ) {
previous . _ _wrapped _ _ = clone ;
} else {
result = clone ;
}
var previous = clone ;
parent = parent . _ _wrapped _ _ ;
}
previous . _ _wrapped _ _ = value ;
return result ;
}
/ * *
* This method is the wrapper version of ` _.reverse ` .
*
* * * Note : * * This method mutates the wrapped array .
*
* @ name reverse
* @ memberOf _
* @ since 0.1 . 0
* @ category Seq
* @ returns { Object } Returns the new ` lodash ` wrapper instance .
* @ example
*
* var array = [ 1 , 2 , 3 ] ;
*
* _ ( array ) . reverse ( ) . value ( )
* // => [3, 2, 1]
*
* console . log ( array ) ;
* // => [3, 2, 1]
* /
function wrapperReverse ( ) {
var value = this . _ _wrapped _ _ ;
if ( value instanceof LazyWrapper ) {
var wrapped = value ;
if ( this . _ _actions _ _ . length ) {
wrapped = new LazyWrapper ( this ) ;
}
wrapped = wrapped . reverse ( ) ;
wrapped . _ _actions _ _ . push ( {
'func' : thru ,
'args' : [ reverse ] ,
'thisArg' : undefined
} ) ;
return new LodashWrapper ( wrapped , this . _ _chain _ _ ) ;
}
return this . thru ( reverse ) ;
}
/ * *
* Executes the chain sequence to resolve the unwrapped value .
*
* @ name value
* @ memberOf _
* @ since 0.1 . 0
* @ alias toJSON , valueOf
* @ category Seq
* @ returns { * } Returns the resolved unwrapped value .
* @ example
*
* _ ( [ 1 , 2 , 3 ] ) . value ( ) ;
* // => [1, 2, 3]
* /
function wrapperValue ( ) {
return baseWrapperValue ( this . _ _wrapped _ _ , this . _ _actions _ _ ) ;
}
/*------------------------------------------------------------------------*/
/ * *
* Creates an object composed of keys generated from the results of running
* each element of ` collection ` thru ` iteratee ` . The corresponding value of
* each key is the number of times the key was returned by ` iteratee ` . The
* iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 0.5 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee to transform keys .
* @ returns { Object } Returns the composed aggregate object .
* @ example
*
* _ . countBy ( [ 6.1 , 4.2 , 6.3 ] , Math . floor ) ;
* // => { '4': 1, '6': 2 }
*
* // The `_.property` iteratee shorthand.
* _ . countBy ( [ 'one' , 'two' , 'three' ] , 'length' ) ;
* // => { '3': 2, '5': 1 }
* /
var countBy = createAggregator ( function ( result , value , key ) {
if ( hasOwnProperty . call ( result , key ) ) {
++ result [ key ] ;
} else {
baseAssignValue ( result , key , 1 ) ;
}
} ) ;
/ * *
* Checks if ` predicate ` returns truthy for * * all * * elements of ` collection ` .
* Iteration is stopped once ` predicate ` returns falsey . The predicate is
* invoked with three arguments : ( value , index | key , collection ) .
*
* * * Note : * * This method returns ` true ` for
* [ empty collections ] ( https : //en.wikipedia.org/wiki/Empty_set) because
* [ everything is true ] ( https : //en.wikipedia.org/wiki/Vacuous_truth) of
* elements of empty collections .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { boolean } Returns ` true ` if all elements pass the predicate check ,
* else ` false ` .
* @ example
*
* _ . every ( [ true , 1 , null , 'yes' ] , Boolean ) ;
* // => false
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : false } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : false }
* ] ;
*
* // The `_.matches` iteratee shorthand.
* _ . every ( users , { 'user' : 'barney' , 'active' : false } ) ;
* // => false
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . every ( users , [ 'active' , false ] ) ;
* // => true
*
* // The `_.property` iteratee shorthand.
* _ . every ( users , 'active' ) ;
* // => false
* /
function every ( collection , predicate , guard ) {
var func = isArray ( collection ) ? arrayEvery : baseEvery ;
if ( guard && isIterateeCall ( collection , predicate , guard ) ) {
predicate = undefined ;
}
return func ( collection , getIteratee ( predicate , 3 ) ) ;
}
/ * *
* Iterates over elements of ` collection ` , returning an array of all elements
* ` predicate ` returns truthy for . The predicate is invoked with three
* arguments : ( value , index | key , collection ) .
*
* * * Note : * * Unlike ` _.remove ` , this method returns a new array .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new filtered array .
* @ see _ . reject
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : true } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : false }
* ] ;
*
* _ . filter ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['fred']
*
* // The `_.matches` iteratee shorthand.
* _ . filter ( users , { 'age' : 36 , 'active' : true } ) ;
* // => objects for ['barney']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . filter ( users , [ 'active' , false ] ) ;
* // => objects for ['fred']
*
* // The `_.property` iteratee shorthand.
* _ . filter ( users , 'active' ) ;
* // => objects for ['barney']
* /
function filter ( collection , predicate ) {
var func = isArray ( collection ) ? arrayFilter : baseFilter ;
return func ( collection , getIteratee ( predicate , 3 ) ) ;
}
/ * *
* Iterates over elements of ` collection ` , returning the first element
* ` predicate ` returns truthy for . The predicate is invoked with three
* arguments : ( value , index | key , collection ) .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param { number } [ fromIndex = 0 ] The index to search from .
* @ returns { * } Returns the matched element , else ` undefined ` .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : true } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : false } ,
* { 'user' : 'pebbles' , 'age' : 1 , 'active' : true }
* ] ;
*
* _ . find ( users , function ( o ) { return o . age < 40 ; } ) ;
* // => object for 'barney'
*
* // The `_.matches` iteratee shorthand.
* _ . find ( users , { 'age' : 1 , 'active' : true } ) ;
* // => object for 'pebbles'
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . find ( users , [ 'active' , false ] ) ;
* // => object for 'fred'
*
* // The `_.property` iteratee shorthand.
* _ . find ( users , 'active' ) ;
* // => object for 'barney'
* /
var find = createFind ( findIndex ) ;
/ * *
* This method is like ` _.find ` except that it iterates over elements of
* ` collection ` from right to left .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param { number } [ fromIndex = collection . length - 1 ] The index to search from .
* @ returns { * } Returns the matched element , else ` undefined ` .
* @ example
*
* _ . findLast ( [ 1 , 2 , 3 , 4 ] , function ( n ) {
* return n % 2 == 1 ;
* } ) ;
* // => 3
* /
var findLast = createFind ( findLastIndex ) ;
/ * *
* Creates a flattened array of values by running each element in ` collection `
* thru ` iteratee ` and flattening the mapped results . The iteratee is invoked
* with three arguments : ( value , index | key , collection ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* function duplicate ( n ) {
* return [ n , n ] ;
* }
*
* _ . flatMap ( [ 1 , 2 ] , duplicate ) ;
* // => [1, 1, 2, 2]
* /
function flatMap ( collection , iteratee ) {
return baseFlatten ( map ( collection , iteratee ) , 1 ) ;
}
/ * *
* This method is like ` _.flatMap ` except that it recursively flattens the
* mapped results .
*
* @ static
* @ memberOf _
* @ since 4.7 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* function duplicate ( n ) {
* return [ [ [ n , n ] ] ] ;
* }
*
* _ . flatMapDeep ( [ 1 , 2 ] , duplicate ) ;
* // => [1, 1, 2, 2]
* /
function flatMapDeep ( collection , iteratee ) {
return baseFlatten ( map ( collection , iteratee ) , INFINITY ) ;
}
/ * *
* This method is like ` _.flatMap ` except that it recursively flattens the
* mapped results up to ` depth ` times .
*
* @ static
* @ memberOf _
* @ since 4.7 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ param { number } [ depth = 1 ] The maximum recursion depth .
* @ returns { Array } Returns the new flattened array .
* @ example
*
* function duplicate ( n ) {
* return [ [ [ n , n ] ] ] ;
* }
*
* _ . flatMapDepth ( [ 1 , 2 ] , duplicate , 2 ) ;
* // => [[1, 1], [2, 2]]
* /
function flatMapDepth ( collection , iteratee , depth ) {
depth = depth === undefined ? 1 : toInteger ( depth ) ;
return baseFlatten ( map ( collection , iteratee ) , depth ) ;
}
/ * *
* Iterates over elements of ` collection ` and invokes ` iteratee ` for each element .
* The iteratee is invoked with three arguments : ( value , index | key , collection ) .
* Iteratee functions may exit iteration early by explicitly returning ` false ` .
*
* * * Note : * * As with other "Collections" methods , objects with a "length"
* property are iterated like arrays . To avoid this behavior use ` _.forIn `
* or ` _.forOwn ` for object iteration .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ alias each
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array | Object } Returns ` collection ` .
* @ see _ . forEachRight
* @ example
*
* _ . forEach ( [ 1 , 2 ] , function ( value ) {
* console . log ( value ) ;
* } ) ;
* // => Logs `1` then `2`.
*
* _ . forEach ( { 'a' : 1 , 'b' : 2 } , function ( value , key ) {
* console . log ( key ) ;
* } ) ;
* // => Logs 'a' then 'b' (iteration order is not guaranteed).
* /
function forEach ( collection , iteratee ) {
var func = isArray ( collection ) ? arrayEach : baseEach ;
return func ( collection , getIteratee ( iteratee , 3 ) ) ;
}
/ * *
* This method is like ` _.forEach ` except that it iterates over elements of
* ` collection ` from right to left .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ alias eachRight
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array | Object } Returns ` collection ` .
* @ see _ . forEach
* @ example
*
* _ . forEachRight ( [ 1 , 2 ] , function ( value ) {
* console . log ( value ) ;
* } ) ;
* // => Logs `2` then `1`.
* /
function forEachRight ( collection , iteratee ) {
var func = isArray ( collection ) ? arrayEachRight : baseEachRight ;
return func ( collection , getIteratee ( iteratee , 3 ) ) ;
}
/ * *
* Creates an object composed of keys generated from the results of running
* each element of ` collection ` thru ` iteratee ` . The order of grouped values
* is determined by the order they occur in ` collection ` . The corresponding
* value of each key is an array of elements responsible for generating the
* key . The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee to transform keys .
* @ returns { Object } Returns the composed aggregate object .
* @ example
*
* _ . groupBy ( [ 6.1 , 4.2 , 6.3 ] , Math . floor ) ;
* // => { '4': [4.2], '6': [6.1, 6.3] }
*
* // The `_.property` iteratee shorthand.
* _ . groupBy ( [ 'one' , 'two' , 'three' ] , 'length' ) ;
* // => { '3': ['one', 'two'], '5': ['three'] }
* /
var groupBy = createAggregator ( function ( result , value , key ) {
if ( hasOwnProperty . call ( result , key ) ) {
result [ key ] . push ( value ) ;
} else {
baseAssignValue ( result , key , [ value ] ) ;
}
} ) ;
/ * *
* Checks if ` value ` is in ` collection ` . If ` collection ` is a string , it ' s
* checked for a substring of ` value ` , otherwise
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* is used for equality comparisons . If ` fromIndex ` is negative , it ' s used as
* the offset from the end of ` collection ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object | string } collection The collection to inspect .
* @ param { * } value The value to search for .
* @ param { number } [ fromIndex = 0 ] The index to search from .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.reduce ` .
* @ returns { boolean } Returns ` true ` if ` value ` is found , else ` false ` .
* @ example
*
* _ . includes ( [ 1 , 2 , 3 ] , 1 ) ;
* // => true
*
* _ . includes ( [ 1 , 2 , 3 ] , 1 , 2 ) ;
* // => false
*
* _ . includes ( { 'a' : 1 , 'b' : 2 } , 1 ) ;
* // => true
*
* _ . includes ( 'abcd' , 'bc' ) ;
* // => true
* /
function includes ( collection , value , fromIndex , guard ) {
collection = isArrayLike ( collection ) ? collection : values ( collection ) ;
fromIndex = ( fromIndex && ! guard ) ? toInteger ( fromIndex ) : 0 ;
var length = collection . length ;
if ( fromIndex < 0 ) {
fromIndex = nativeMax ( length + fromIndex , 0 ) ;
}
return isString ( collection ) ?
( fromIndex <= length && collection . indexOf ( value , fromIndex ) > - 1 ) :
( ! ! length && baseIndexOf ( collection , value , fromIndex ) > - 1 ) ;
}
/ * *
* Invokes the method at ` path ` of each element in ` collection ` , returning
* an array of the results of each invoked method . Any additional arguments
* are provided to each invoked method . If ` path ` is a function , it ' s invoked
* for , and ` this ` bound to , each element in ` collection ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Array | Function | string } path The path of the method to invoke or
* the function invoked per iteration .
* @ param { ... * } [ args ] The arguments to invoke each method with .
* @ returns { Array } Returns the array of results .
* @ example
*
* _ . invokeMap ( [ [ 5 , 1 , 7 ] , [ 3 , 2 , 1 ] ] , 'sort' ) ;
* // => [[1, 5, 7], [1, 2, 3]]
*
* _ . invokeMap ( [ 123 , 456 ] , String . prototype . split , '' ) ;
* // => [['1', '2', '3'], ['4', '5', '6']]
* /
var invokeMap = baseRest ( function ( collection , path , args ) {
var index = - 1 ,
isFunc = typeof path == 'function' ,
result = isArrayLike ( collection ) ? Array ( collection . length ) : [ ] ;
baseEach ( collection , function ( value ) {
result [ ++ index ] = isFunc ? apply ( path , value , args ) : baseInvoke ( value , path , args ) ;
} ) ;
return result ;
} ) ;
/ * *
* Creates an object composed of keys generated from the results of running
* each element of ` collection ` thru ` iteratee ` . The corresponding value of
* each key is the last element responsible for generating the key . The
* iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee to transform keys .
* @ returns { Object } Returns the composed aggregate object .
* @ example
*
* var array = [
* { 'dir' : 'left' , 'code' : 97 } ,
* { 'dir' : 'right' , 'code' : 100 }
* ] ;
*
* _ . keyBy ( array , function ( o ) {
* return String . fromCharCode ( o . code ) ;
* } ) ;
* // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
*
* _ . keyBy ( array , 'dir' ) ;
* // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
* /
var keyBy = createAggregator ( function ( result , value , key ) {
baseAssignValue ( result , key , value ) ;
} ) ;
/ * *
* Creates an array of values by running each element in ` collection ` thru
* ` iteratee ` . The iteratee is invoked with three arguments :
* ( value , index | key , collection ) .
*
* Many lodash methods are guarded to work as iteratees for methods like
* ` _.every ` , ` _.filter ` , ` _.map ` , ` _.mapValues ` , ` _.reject ` , and ` _.some ` .
*
* The guarded methods are :
* ` ary ` , ` chunk ` , ` curry ` , ` curryRight ` , ` drop ` , ` dropRight ` , ` every ` ,
* ` fill ` , ` invert ` , ` parseInt ` , ` random ` , ` range ` , ` rangeRight ` , ` repeat ` ,
* ` sampleSize ` , ` slice ` , ` some ` , ` sortBy ` , ` split ` , ` take ` , ` takeRight ` ,
* ` template ` , ` trim ` , ` trimEnd ` , ` trimStart ` , and ` words `
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new mapped array .
* @ example
*
* function square ( n ) {
* return n * n ;
* }
*
* _ . map ( [ 4 , 8 ] , square ) ;
* // => [16, 64]
*
* _ . map ( { 'a' : 4 , 'b' : 8 } , square ) ;
* // => [16, 64] (iteration order is not guaranteed)
*
* var users = [
* { 'user' : 'barney' } ,
* { 'user' : 'fred' }
* ] ;
*
* // The `_.property` iteratee shorthand.
* _ . map ( users , 'user' ) ;
* // => ['barney', 'fred']
* /
function map ( collection , iteratee ) {
var func = isArray ( collection ) ? arrayMap : baseMap ;
return func ( collection , getIteratee ( iteratee , 3 ) ) ;
}
/ * *
* This method is like ` _.sortBy ` except that it allows specifying the sort
* orders of the iteratees to sort by . If ` orders ` is unspecified , all values
* are sorted in ascending order . Otherwise , specify an order of "desc" for
* descending or "asc" for ascending sort order of corresponding values .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Array [ ] | Function [ ] | Object [ ] | string [ ] } [ iteratees = [ _ . identity ] ]
* The iteratees to sort by .
* @ param { string [ ] } [ orders ] The sort orders of ` iteratees ` .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.reduce ` .
* @ returns { Array } Returns the new sorted array .
* @ example
*
* var users = [
* { 'user' : 'fred' , 'age' : 48 } ,
* { 'user' : 'barney' , 'age' : 34 } ,
* { 'user' : 'fred' , 'age' : 40 } ,
* { 'user' : 'barney' , 'age' : 36 }
* ] ;
*
* // Sort by `user` in ascending order and by `age` in descending order.
* _ . orderBy ( users , [ 'user' , 'age' ] , [ 'asc' , 'desc' ] ) ;
* // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
* /
function orderBy ( collection , iteratees , orders , guard ) {
if ( collection == null ) {
return [ ] ;
}
if ( ! isArray ( iteratees ) ) {
iteratees = iteratees == null ? [ ] : [ iteratees ] ;
}
orders = guard ? undefined : orders ;
if ( ! isArray ( orders ) ) {
orders = orders == null ? [ ] : [ orders ] ;
}
return baseOrderBy ( collection , iteratees , orders ) ;
}
/ * *
* Creates an array of elements split into two groups , the first of which
* contains elements ` predicate ` returns truthy for , the second of which
* contains elements ` predicate ` returns falsey for . The predicate is
* invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the array of grouped elements .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : false } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : true } ,
* { 'user' : 'pebbles' , 'age' : 1 , 'active' : false }
* ] ;
*
* _ . partition ( users , function ( o ) { return o . active ; } ) ;
* // => objects for [['fred'], ['barney', 'pebbles']]
*
* // The `_.matches` iteratee shorthand.
* _ . partition ( users , { 'age' : 1 , 'active' : false } ) ;
* // => objects for [['pebbles'], ['barney', 'fred']]
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . partition ( users , [ 'active' , false ] ) ;
* // => objects for [['barney', 'pebbles'], ['fred']]
*
* // The `_.property` iteratee shorthand.
* _ . partition ( users , 'active' ) ;
* // => objects for [['fred'], ['barney', 'pebbles']]
* /
var partition = createAggregator ( function ( result , value , key ) {
result [ key ? 0 : 1 ] . push ( value ) ;
} , function ( ) {
return [
[ ] ,
[ ]
] ;
} ) ;
/ * *
* Reduces ` collection ` to a value which is the accumulated result of running
* each element in ` collection ` thru ` iteratee ` , where each successive
* invocation is supplied the return value of the previous . If ` accumulator `
* is not given , the first element of ` collection ` is used as the initial
* value . The iteratee is invoked with four arguments :
* ( accumulator , value , index | key , collection ) .
*
* Many lodash methods are guarded to work as iteratees for methods like
* ` _.reduce ` , ` _.reduceRight ` , and ` _.transform ` .
*
* The guarded methods are :
* ` assign ` , ` defaults ` , ` defaultsDeep ` , ` includes ` , ` merge ` , ` orderBy ` ,
* and ` sortBy `
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ param { * } [ accumulator ] The initial value .
* @ returns { * } Returns the accumulated value .
* @ see _ . reduceRight
* @ example
*
* _ . reduce ( [ 1 , 2 ] , function ( sum , n ) {
* return sum + n ;
* } , 0 ) ;
* // => 3
*
* _ . reduce ( { 'a' : 1 , 'b' : 2 , 'c' : 1 } , function ( result , value , key ) {
* ( result [ value ] || ( result [ value ] = [ ] ) ) . push ( key ) ;
* return result ;
* } , { } ) ;
* // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
* /
function reduce ( collection , iteratee , accumulator ) {
var func = isArray ( collection ) ? arrayReduce : baseReduce ,
initAccum = arguments . length < 3 ;
return func ( collection , getIteratee ( iteratee , 4 ) , accumulator , initAccum , baseEach ) ;
}
/ * *
* This method is like ` _.reduce ` except that it iterates over elements of
* ` collection ` from right to left .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ param { * } [ accumulator ] The initial value .
* @ returns { * } Returns the accumulated value .
* @ see _ . reduce
* @ example
*
* var array = [ [ 0 , 1 ] , [ 2 , 3 ] , [ 4 , 5 ] ] ;
*
* _ . reduceRight ( array , function ( flattened , other ) {
* return flattened . concat ( other ) ;
* } , [ ] ) ;
* // => [4, 5, 2, 3, 0, 1]
* /
function reduceRight ( collection , iteratee , accumulator ) {
var func = isArray ( collection ) ? arrayReduceRight : baseReduce ,
initAccum = arguments . length < 3 ;
return func ( collection , getIteratee ( iteratee , 4 ) , accumulator , initAccum , baseEachRight ) ;
}
/ * *
* The opposite of ` _.filter ` ; this method returns the elements of ` collection `
* that ` predicate ` does * * not * * return truthy for .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the new filtered array .
* @ see _ . filter
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : false } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : true }
* ] ;
*
* _ . reject ( users , function ( o ) { return ! o . active ; } ) ;
* // => objects for ['fred']
*
* // The `_.matches` iteratee shorthand.
* _ . reject ( users , { 'age' : 40 , 'active' : true } ) ;
* // => objects for ['barney']
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . reject ( users , [ 'active' , false ] ) ;
* // => objects for ['fred']
*
* // The `_.property` iteratee shorthand.
* _ . reject ( users , 'active' ) ;
* // => objects for ['barney']
* /
function reject ( collection , predicate ) {
var func = isArray ( collection ) ? arrayFilter : baseFilter ;
return func ( collection , negate ( getIteratee ( predicate , 3 ) ) ) ;
}
/ * *
* Gets a random element from ` collection ` .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to sample .
* @ returns { * } Returns the random element .
* @ example
*
* _ . sample ( [ 1 , 2 , 3 , 4 ] ) ;
* // => 2
* /
function sample ( collection ) {
var func = isArray ( collection ) ? arraySample : baseSample ;
return func ( collection ) ;
}
/ * *
* Gets ` n ` random elements at unique keys from ` collection ` up to the
* size of ` collection ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to sample .
* @ param { number } [ n = 1 ] The number of elements to sample .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the random elements .
* @ example
*
* _ . sampleSize ( [ 1 , 2 , 3 ] , 2 ) ;
* // => [3, 1]
*
* _ . sampleSize ( [ 1 , 2 , 3 ] , 4 ) ;
* // => [2, 3, 1]
* /
function sampleSize ( collection , n , guard ) {
if ( ( guard ? isIterateeCall ( collection , n , guard ) : n === undefined ) ) {
n = 1 ;
} else {
n = toInteger ( n ) ;
}
var func = isArray ( collection ) ? arraySampleSize : baseSampleSize ;
return func ( collection , n ) ;
}
/ * *
* Creates an array of shuffled values , using a version of the
* [ Fisher - Yates shuffle ] ( https : //en.wikipedia.org/wiki/Fisher-Yates_shuffle).
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to shuffle .
* @ returns { Array } Returns the new shuffled array .
* @ example
*
* _ . shuffle ( [ 1 , 2 , 3 , 4 ] ) ;
* // => [4, 1, 3, 2]
* /
function shuffle ( collection ) {
var func = isArray ( collection ) ? arrayShuffle : baseShuffle ;
return func ( collection ) ;
}
/ * *
* Gets the size of ` collection ` by returning its length for array - like
* values or the number of own enumerable string keyed properties for objects .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object | string } collection The collection to inspect .
* @ returns { number } Returns the collection size .
* @ example
*
* _ . size ( [ 1 , 2 , 3 ] ) ;
* // => 3
*
* _ . size ( { 'a' : 1 , 'b' : 2 } ) ;
* // => 2
*
* _ . size ( 'pebbles' ) ;
* // => 7
* /
function size ( collection ) {
if ( collection == null ) {
return 0 ;
}
if ( isArrayLike ( collection ) ) {
return isString ( collection ) ? stringSize ( collection ) : collection . length ;
}
var tag = getTag ( collection ) ;
if ( tag == mapTag || tag == setTag ) {
return collection . size ;
}
return baseKeys ( collection ) . length ;
}
/ * *
* Checks if ` predicate ` returns truthy for * * any * * element of ` collection ` .
* Iteration is stopped once ` predicate ` returns truthy . The predicate is
* invoked with three arguments : ( value , index | key , collection ) .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { boolean } Returns ` true ` if any element passes the predicate check ,
* else ` false ` .
* @ example
*
* _ . some ( [ null , 0 , 'yes' , false ] , Boolean ) ;
* // => true
*
* var users = [
* { 'user' : 'barney' , 'active' : true } ,
* { 'user' : 'fred' , 'active' : false }
* ] ;
*
* // The `_.matches` iteratee shorthand.
* _ . some ( users , { 'user' : 'barney' , 'active' : false } ) ;
* // => false
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . some ( users , [ 'active' , false ] ) ;
* // => true
*
* // The `_.property` iteratee shorthand.
* _ . some ( users , 'active' ) ;
* // => true
* /
function some ( collection , predicate , guard ) {
var func = isArray ( collection ) ? arraySome : baseSome ;
if ( guard && isIterateeCall ( collection , predicate , guard ) ) {
predicate = undefined ;
}
return func ( collection , getIteratee ( predicate , 3 ) ) ;
}
/ * *
* Creates an array of elements , sorted in ascending order by the results of
* running each element in a collection thru each iteratee . This method
* performs a stable sort , that is , it preserves the original sort order of
* equal elements . The iteratees are invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Collection
* @ param { Array | Object } collection The collection to iterate over .
* @ param { ... ( Function | Function [ ] ) } [ iteratees = [ _ . identity ] ]
* The iteratees to sort by .
* @ returns { Array } Returns the new sorted array .
* @ example
*
* var users = [
* { 'user' : 'fred' , 'age' : 48 } ,
* { 'user' : 'barney' , 'age' : 36 } ,
* { 'user' : 'fred' , 'age' : 40 } ,
* { 'user' : 'barney' , 'age' : 34 }
* ] ;
*
* _ . sortBy ( users , [ function ( o ) { return o . user ; } ] ) ;
* // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
*
* _ . sortBy ( users , [ 'user' , 'age' ] ) ;
* // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]
* /
var sortBy = baseRest ( function ( collection , iteratees ) {
if ( collection == null ) {
return [ ] ;
}
var length = iteratees . length ;
if ( length > 1 && isIterateeCall ( collection , iteratees [ 0 ] , iteratees [ 1 ] ) ) {
iteratees = [ ] ;
} else if ( length > 2 && isIterateeCall ( iteratees [ 0 ] , iteratees [ 1 ] , iteratees [ 2 ] ) ) {
iteratees = [ iteratees [ 0 ] ] ;
}
return baseOrderBy ( collection , baseFlatten ( iteratees , 1 ) , [ ] ) ;
} ) ;
/*------------------------------------------------------------------------*/
/ * *
* Gets the timestamp of the number of milliseconds that have elapsed since
* the Unix epoch ( 1 January 1970 00 : 00 : 00 UTC ) .
*
* @ static
* @ memberOf _
* @ since 2.4 . 0
* @ category Date
* @ returns { number } Returns the timestamp .
* @ example
*
* _ . defer ( function ( stamp ) {
* console . log ( _ . now ( ) - stamp ) ;
* } , _ . now ( ) ) ;
* // => Logs the number of milliseconds it took for the deferred invocation.
* /
var now = ctxNow || function ( ) {
return root . Date . now ( ) ;
} ;
/*------------------------------------------------------------------------*/
/ * *
* The opposite of ` _.before ` ; this method creates a function that invokes
* ` func ` once it ' s called ` n ` or more times .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { number } n The number of calls before ` func ` is invoked .
* @ param { Function } func The function to restrict .
* @ returns { Function } Returns the new restricted function .
* @ example
*
* var saves = [ 'profile' , 'settings' ] ;
*
* var done = _ . after ( saves . length , function ( ) {
* console . log ( 'done saving!' ) ;
* } ) ;
*
* _ . forEach ( saves , function ( type ) {
* asyncSave ( { 'type' : type , 'complete' : done } ) ;
* } ) ;
* // => Logs 'done saving!' after the two async saves have completed.
* /
function after ( n , func ) {
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
n = toInteger ( n ) ;
return function ( ) {
if ( -- n < 1 ) {
return func . apply ( this , arguments ) ;
}
} ;
}
/ * *
* Creates a function that invokes ` func ` , with up to ` n ` arguments ,
* ignoring any additional arguments .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Function
* @ param { Function } func The function to cap arguments for .
* @ param { number } [ n = func . length ] The arity cap .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Function } Returns the new capped function .
* @ example
*
* _ . map ( [ '6' , '8' , '10' ] , _ . ary ( parseInt , 1 ) ) ;
* // => [6, 8, 10]
* /
function ary ( func , n , guard ) {
n = guard ? undefined : n ;
n = ( func && n == null ) ? func . length : n ;
return createWrap ( func , WRAP _ARY _FLAG , undefined , undefined , undefined , undefined , n ) ;
}
/ * *
* Creates a function that invokes ` func ` , with the ` this ` binding and arguments
* of the created function , while it ' s called less than ` n ` times . Subsequent
* calls to the created function return the result of the last ` func ` invocation .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Function
* @ param { number } n The number of calls at which ` func ` is no longer invoked .
* @ param { Function } func The function to restrict .
* @ returns { Function } Returns the new restricted function .
* @ example
*
* jQuery ( element ) . on ( 'click' , _ . before ( 5 , addContactToList ) ) ;
* // => Allows adding up to 4 contacts to the list.
* /
function before ( n , func ) {
var result ;
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
n = toInteger ( n ) ;
return function ( ) {
if ( -- n > 0 ) {
result = func . apply ( this , arguments ) ;
}
if ( n <= 1 ) {
func = undefined ;
}
return result ;
} ;
}
/ * *
* Creates a function that invokes ` func ` with the ` this ` binding of ` thisArg `
* and ` partials ` prepended to the arguments it receives .
*
* The ` _.bind.placeholder ` value , which defaults to ` _ ` in monolithic builds ,
* may be used as a placeholder for partially applied arguments .
*
* * * Note : * * Unlike native ` Function#bind ` , this method doesn ' t set the "length"
* property of bound functions .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to bind .
* @ param { * } thisArg The ` this ` binding of ` func ` .
* @ param { ... * } [ partials ] The arguments to be partially applied .
* @ returns { Function } Returns the new bound function .
* @ example
*
* function greet ( greeting , punctuation ) {
* return greeting + ' ' + this . user + punctuation ;
* }
*
* var object = { 'user' : 'fred' } ;
*
* var bound = _ . bind ( greet , object , 'hi' ) ;
* bound ( '!' ) ;
* // => 'hi fred!'
*
* // Bound with placeholders.
* var bound = _ . bind ( greet , object , _ , '!' ) ;
* bound ( 'hi' ) ;
* // => 'hi fred!'
* /
var bind = baseRest ( function ( func , thisArg , partials ) {
var bitmask = WRAP _BIND _FLAG ;
if ( partials . length ) {
var holders = replaceHolders ( partials , getHolder ( bind ) ) ;
bitmask |= WRAP _PARTIAL _FLAG ;
}
return createWrap ( func , bitmask , thisArg , partials , holders ) ;
} ) ;
/ * *
* Creates a function that invokes the method at ` object[key] ` with ` partials `
* prepended to the arguments it receives .
*
* This method differs from ` _.bind ` by allowing bound functions to reference
* methods that may be redefined or don ' t yet exist . See
* [ Peter Michaux ' s article ] ( http : //peter.michaux.ca/articles/lazy-function-definition-pattern)
* for more details .
*
* The ` _.bindKey.placeholder ` value , which defaults to ` _ ` in monolithic
* builds , may be used as a placeholder for partially applied arguments .
*
* @ static
* @ memberOf _
* @ since 0.10 . 0
* @ category Function
* @ param { Object } object The object to invoke the method on .
* @ param { string } key The key of the method .
* @ param { ... * } [ partials ] The arguments to be partially applied .
* @ returns { Function } Returns the new bound function .
* @ example
*
* var object = {
* 'user' : 'fred' ,
* 'greet' : function ( greeting , punctuation ) {
* return greeting + ' ' + this . user + punctuation ;
* }
* } ;
*
* var bound = _ . bindKey ( object , 'greet' , 'hi' ) ;
* bound ( '!' ) ;
* // => 'hi fred!'
*
* object . greet = function ( greeting , punctuation ) {
* return greeting + 'ya ' + this . user + punctuation ;
* } ;
*
* bound ( '!' ) ;
* // => 'hiya fred!'
*
* // Bound with placeholders.
* var bound = _ . bindKey ( object , 'greet' , _ , '!' ) ;
* bound ( 'hi' ) ;
* // => 'hiya fred!'
* /
var bindKey = baseRest ( function ( object , key , partials ) {
var bitmask = WRAP _BIND _FLAG | WRAP _BIND _KEY _FLAG ;
if ( partials . length ) {
var holders = replaceHolders ( partials , getHolder ( bindKey ) ) ;
bitmask |= WRAP _PARTIAL _FLAG ;
}
return createWrap ( key , bitmask , object , partials , holders ) ;
} ) ;
/ * *
* Creates a function that accepts arguments of ` func ` and either invokes
* ` func ` returning its result , if at least ` arity ` number of arguments have
* been provided , or returns a function that accepts the remaining ` func `
* arguments , and so on . The arity of ` func ` may be specified if ` func.length `
* is not sufficient .
*
* The ` _.curry.placeholder ` value , which defaults to ` _ ` in monolithic builds ,
* may be used as a placeholder for provided arguments .
*
* * * Note : * * This method doesn ' t set the "length" property of curried functions .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Function
* @ param { Function } func The function to curry .
* @ param { number } [ arity = func . length ] The arity of ` func ` .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Function } Returns the new curried function .
* @ example
*
* var abc = function ( a , b , c ) {
* return [ a , b , c ] ;
* } ;
*
* var curried = _ . curry ( abc ) ;
*
* curried ( 1 ) ( 2 ) ( 3 ) ;
* // => [1, 2, 3]
*
* curried ( 1 , 2 ) ( 3 ) ;
* // => [1, 2, 3]
*
* curried ( 1 , 2 , 3 ) ;
* // => [1, 2, 3]
*
* // Curried with placeholders.
* curried ( 1 ) ( _ , 3 ) ( 2 ) ;
* // => [1, 2, 3]
* /
function curry ( func , arity , guard ) {
arity = guard ? undefined : arity ;
var result = createWrap ( func , WRAP _CURRY _FLAG , undefined , undefined , undefined , undefined , undefined , arity ) ;
result . placeholder = curry . placeholder ;
return result ;
}
/ * *
* This method is like ` _.curry ` except that arguments are applied to ` func `
* in the manner of ` _.partialRight ` instead of ` _.partial ` .
*
* The ` _.curryRight.placeholder ` value , which defaults to ` _ ` in monolithic
* builds , may be used as a placeholder for provided arguments .
*
* * * Note : * * This method doesn ' t set the "length" property of curried functions .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Function
* @ param { Function } func The function to curry .
* @ param { number } [ arity = func . length ] The arity of ` func ` .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Function } Returns the new curried function .
* @ example
*
* var abc = function ( a , b , c ) {
* return [ a , b , c ] ;
* } ;
*
* var curried = _ . curryRight ( abc ) ;
*
* curried ( 3 ) ( 2 ) ( 1 ) ;
* // => [1, 2, 3]
*
* curried ( 2 , 3 ) ( 1 ) ;
* // => [1, 2, 3]
*
* curried ( 1 , 2 , 3 ) ;
* // => [1, 2, 3]
*
* // Curried with placeholders.
* curried ( 3 ) ( 1 , _ ) ( 2 ) ;
* // => [1, 2, 3]
* /
function curryRight ( func , arity , guard ) {
arity = guard ? undefined : arity ;
var result = createWrap ( func , WRAP _CURRY _RIGHT _FLAG , undefined , undefined , undefined , undefined , undefined , arity ) ;
result . placeholder = curryRight . placeholder ;
return result ;
}
/ * *
* Creates a debounced function that delays invoking ` func ` until after ` wait `
* milliseconds have elapsed since the last time the debounced function was
* invoked . The debounced function comes with a ` cancel ` method to cancel
* delayed ` func ` invocations and a ` flush ` method to immediately invoke them .
* Provide ` options ` to indicate whether ` func ` should be invoked on the
* leading and / or trailing edge of the ` wait ` timeout . The ` func ` is invoked
* with the last arguments provided to the debounced function . Subsequent
* calls to the debounced function return the result of the last ` func `
* invocation .
*
* * * Note : * * If ` leading ` and ` trailing ` options are ` true ` , ` func ` is
* invoked on the trailing edge of the timeout only if the debounced function
* is invoked more than once during the ` wait ` timeout .
*
* If ` wait ` is ` 0 ` and ` leading ` is ` false ` , ` func ` invocation is deferred
* until to the next tick , similar to ` setTimeout ` with a timeout of ` 0 ` .
*
* See [ David Corbacho ' s article ] ( https : //css-tricks.com/debouncing-throttling-explained-examples/)
* for details over the differences between ` _.debounce ` and ` _.throttle ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to debounce .
* @ param { number } [ wait = 0 ] The number of milliseconds to delay .
* @ param { Object } [ options = { } ] The options object .
* @ param { boolean } [ options . leading = false ]
* Specify invoking on the leading edge of the timeout .
* @ param { number } [ options . maxWait ]
* The maximum time ` func ` is allowed to be delayed before it ' s invoked .
* @ param { boolean } [ options . trailing = true ]
* Specify invoking on the trailing edge of the timeout .
* @ returns { Function } Returns the new debounced function .
* @ example
*
* // Avoid costly calculations while the window size is in flux.
* jQuery ( window ) . on ( 'resize' , _ . debounce ( calculateLayout , 150 ) ) ;
*
* // Invoke `sendMail` when clicked, debouncing subsequent calls.
* jQuery ( element ) . on ( 'click' , _ . debounce ( sendMail , 300 , {
* 'leading' : true ,
* 'trailing' : false
* } ) ) ;
*
* // Ensure `batchLog` is invoked once after 1 second of debounced calls.
* var debounced = _ . debounce ( batchLog , 250 , { 'maxWait' : 1000 } ) ;
* var source = new EventSource ( '/stream' ) ;
* jQuery ( source ) . on ( 'message' , debounced ) ;
*
* // Cancel the trailing debounced invocation.
* jQuery ( window ) . on ( 'popstate' , debounced . cancel ) ;
* /
function debounce ( func , wait , options ) {
var lastArgs ,
lastThis ,
maxWait ,
result ,
timerId ,
lastCallTime ,
lastInvokeTime = 0 ,
leading = false ,
maxing = false ,
trailing = true ;
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
wait = toNumber ( wait ) || 0 ;
if ( isObject ( options ) ) {
leading = ! ! options . leading ;
maxing = 'maxWait' in options ;
maxWait = maxing ? nativeMax ( toNumber ( options . maxWait ) || 0 , wait ) : maxWait ;
trailing = 'trailing' in options ? ! ! options . trailing : trailing ;
}
function invokeFunc ( time ) {
var args = lastArgs ,
thisArg = lastThis ;
lastArgs = lastThis = undefined ;
lastInvokeTime = time ;
result = func . apply ( thisArg , args ) ;
return result ;
}
function leadingEdge ( time ) {
// Reset any `maxWait` timer.
lastInvokeTime = time ;
// Start the timer for the trailing edge.
timerId = setTimeout ( timerExpired , wait ) ;
// Invoke the leading edge.
return leading ? invokeFunc ( time ) : result ;
}
function remainingWait ( time ) {
var timeSinceLastCall = time - lastCallTime ,
timeSinceLastInvoke = time - lastInvokeTime ,
result = wait - timeSinceLastCall ;
return maxing ? nativeMin ( result , maxWait - timeSinceLastInvoke ) : result ;
}
function shouldInvoke ( time ) {
var timeSinceLastCall = time - lastCallTime ,
timeSinceLastInvoke = time - lastInvokeTime ;
// Either this is the first call, activity has stopped and we're at the
// trailing edge, the system time has gone backwards and we're treating
// it as the trailing edge, or we've hit the `maxWait` limit.
return ( lastCallTime === undefined || ( timeSinceLastCall >= wait ) ||
( timeSinceLastCall < 0 ) || ( maxing && timeSinceLastInvoke >= maxWait ) ) ;
}
function timerExpired ( ) {
var time = now ( ) ;
if ( shouldInvoke ( time ) ) {
return trailingEdge ( time ) ;
}
// Restart the timer.
timerId = setTimeout ( timerExpired , remainingWait ( time ) ) ;
}
function trailingEdge ( time ) {
timerId = undefined ;
// Only invoke if we have `lastArgs` which means `func` has been
// debounced at least once.
if ( trailing && lastArgs ) {
return invokeFunc ( time ) ;
}
lastArgs = lastThis = undefined ;
return result ;
}
function cancel ( ) {
if ( timerId !== undefined ) {
clearTimeout ( timerId ) ;
}
lastInvokeTime = 0 ;
lastArgs = lastCallTime = lastThis = timerId = undefined ;
}
function flush ( ) {
return timerId === undefined ? result : trailingEdge ( now ( ) ) ;
}
function debounced ( ) {
var time = now ( ) ,
isInvoking = shouldInvoke ( time ) ;
lastArgs = arguments ;
lastThis = this ;
lastCallTime = time ;
if ( isInvoking ) {
if ( timerId === undefined ) {
return leadingEdge ( lastCallTime ) ;
}
if ( maxing ) {
// Handle invocations in a tight loop.
timerId = setTimeout ( timerExpired , wait ) ;
return invokeFunc ( lastCallTime ) ;
}
}
if ( timerId === undefined ) {
timerId = setTimeout ( timerExpired , wait ) ;
}
return result ;
}
debounced . cancel = cancel ;
debounced . flush = flush ;
return debounced ;
}
/ * *
* Defers invoking the ` func ` until the current call stack has cleared . Any
* additional arguments are provided to ` func ` when it ' s invoked .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to defer .
* @ param { ... * } [ args ] The arguments to invoke ` func ` with .
* @ returns { number } Returns the timer id .
* @ example
*
* _ . defer ( function ( text ) {
* console . log ( text ) ;
* } , 'deferred' ) ;
* // => Logs 'deferred' after one millisecond.
* /
var defer = baseRest ( function ( func , args ) {
return baseDelay ( func , 1 , args ) ;
} ) ;
/ * *
* Invokes ` func ` after ` wait ` milliseconds . Any additional arguments are
* provided to ` func ` when it ' s invoked .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to delay .
* @ param { number } wait The number of milliseconds to delay invocation .
* @ param { ... * } [ args ] The arguments to invoke ` func ` with .
* @ returns { number } Returns the timer id .
* @ example
*
* _ . delay ( function ( text ) {
* console . log ( text ) ;
* } , 1000 , 'later' ) ;
* // => Logs 'later' after one second.
* /
var delay = baseRest ( function ( func , wait , args ) {
return baseDelay ( func , toNumber ( wait ) || 0 , args ) ;
} ) ;
/ * *
* Creates a function that invokes ` func ` with arguments reversed .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Function
* @ param { Function } func The function to flip arguments for .
* @ returns { Function } Returns the new flipped function .
* @ example
*
* var flipped = _ . flip ( function ( ) {
* return _ . toArray ( arguments ) ;
* } ) ;
*
* flipped ( 'a' , 'b' , 'c' , 'd' ) ;
* // => ['d', 'c', 'b', 'a']
* /
function flip ( func ) {
return createWrap ( func , WRAP _FLIP _FLAG ) ;
}
/ * *
* Creates a function that memoizes the result of ` func ` . If ` resolver ` is
* provided , it determines the cache key for storing the result based on the
* arguments provided to the memoized function . By default , the first argument
* provided to the memoized function is used as the map cache key . The ` func `
* is invoked with the ` this ` binding of the memoized function .
*
* * * Note : * * The cache is exposed as the ` cache ` property on the memoized
* function . Its creation may be customized by replacing the ` _.memoize.Cache `
* constructor with one whose instances implement the
* [ ` Map ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)
* method interface of ` clear ` , ` delete ` , ` get ` , ` has ` , and ` set ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to have its output memoized .
* @ param { Function } [ resolver ] The function to resolve the cache key .
* @ returns { Function } Returns the new memoized function .
* @ example
*
* var object = { 'a' : 1 , 'b' : 2 } ;
* var other = { 'c' : 3 , 'd' : 4 } ;
*
* var values = _ . memoize ( _ . values ) ;
* values ( object ) ;
* // => [1, 2]
*
* values ( other ) ;
* // => [3, 4]
*
* object . a = 2 ;
* values ( object ) ;
* // => [1, 2]
*
* // Modify the result cache.
* values . cache . set ( object , [ 'a' , 'b' ] ) ;
* values ( object ) ;
* // => ['a', 'b']
*
* // Replace `_.memoize.Cache`.
* _ . memoize . Cache = WeakMap ;
* /
function memoize ( func , resolver ) {
if ( typeof func != 'function' || ( resolver != null && typeof resolver != 'function' ) ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
var memoized = function ( ) {
var args = arguments ,
key = resolver ? resolver . apply ( this , args ) : args [ 0 ] ,
cache = memoized . cache ;
if ( cache . has ( key ) ) {
return cache . get ( key ) ;
}
var result = func . apply ( this , args ) ;
memoized . cache = cache . set ( key , result ) || cache ;
return result ;
} ;
memoized . cache = new ( memoize . Cache || MapCache ) ;
return memoized ;
}
// Expose `MapCache`.
memoize . Cache = MapCache ;
/ * *
* Creates a function that negates the result of the predicate ` func ` . The
* ` func ` predicate is invoked with the ` this ` binding and arguments of the
* created function .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Function
* @ param { Function } predicate The predicate to negate .
* @ returns { Function } Returns the new negated function .
* @ example
*
* function isEven ( n ) {
* return n % 2 == 0 ;
* }
*
* _ . filter ( [ 1 , 2 , 3 , 4 , 5 , 6 ] , _ . negate ( isEven ) ) ;
* // => [1, 3, 5]
* /
function negate ( predicate ) {
if ( typeof predicate != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
return function ( ) {
var args = arguments ;
switch ( args . length ) {
case 0 :
return ! predicate . call ( this ) ;
case 1 :
return ! predicate . call ( this , args [ 0 ] ) ;
case 2 :
return ! predicate . call ( this , args [ 0 ] , args [ 1 ] ) ;
case 3 :
return ! predicate . call ( this , args [ 0 ] , args [ 1 ] , args [ 2 ] ) ;
}
return ! predicate . apply ( this , args ) ;
} ;
}
/ * *
* Creates a function that is restricted to invoking ` func ` once . Repeat calls
* to the function return the value of the first invocation . The ` func ` is
* invoked with the ` this ` binding and arguments of the created function .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to restrict .
* @ returns { Function } Returns the new restricted function .
* @ example
*
* var initialize = _ . once ( createApplication ) ;
* initialize ( ) ;
* initialize ( ) ;
* // => `createApplication` is invoked once
* /
function once ( func ) {
return before ( 2 , func ) ;
}
/ * *
* Creates a function that invokes ` func ` with its arguments transformed .
*
* @ static
* @ since 4.0 . 0
* @ memberOf _
* @ category Function
* @ param { Function } func The function to wrap .
* @ param { ... ( Function | Function [ ] ) } [ transforms = [ _ . identity ] ]
* The argument transforms .
* @ returns { Function } Returns the new function .
* @ example
*
* function doubled ( n ) {
* return n * 2 ;
* }
*
* function square ( n ) {
* return n * n ;
* }
*
* var func = _ . overArgs ( function ( x , y ) {
* return [ x , y ] ;
* } , [ square , doubled ] ) ;
*
* func ( 9 , 3 ) ;
* // => [81, 6]
*
* func ( 10 , 5 ) ;
* // => [100, 10]
* /
var overArgs = castRest ( function ( func , transforms ) {
transforms = ( transforms . length == 1 && isArray ( transforms [ 0 ] ) ) ?
arrayMap ( transforms [ 0 ] , baseUnary ( getIteratee ( ) ) ) :
arrayMap ( baseFlatten ( transforms , 1 ) , baseUnary ( getIteratee ( ) ) ) ;
var funcsLength = transforms . length ;
return baseRest ( function ( args ) {
var index = - 1 ,
length = nativeMin ( args . length , funcsLength ) ;
while ( ++ index < length ) {
args [ index ] = transforms [ index ] . call ( this , args [ index ] ) ;
}
return apply ( func , this , args ) ;
} ) ;
} ) ;
/ * *
* Creates a function that invokes ` func ` with ` partials ` prepended to the
* arguments it receives . This method is like ` _.bind ` except it does * * not * *
* alter the ` this ` binding .
*
* The ` _.partial.placeholder ` value , which defaults to ` _ ` in monolithic
* builds , may be used as a placeholder for partially applied arguments .
*
* * * Note : * * This method doesn ' t set the "length" property of partially
* applied functions .
*
* @ static
* @ memberOf _
* @ since 0.2 . 0
* @ category Function
* @ param { Function } func The function to partially apply arguments to .
* @ param { ... * } [ partials ] The arguments to be partially applied .
* @ returns { Function } Returns the new partially applied function .
* @ example
*
* function greet ( greeting , name ) {
* return greeting + ' ' + name ;
* }
*
* var sayHelloTo = _ . partial ( greet , 'hello' ) ;
* sayHelloTo ( 'fred' ) ;
* // => 'hello fred'
*
* // Partially applied with placeholders.
* var greetFred = _ . partial ( greet , _ , 'fred' ) ;
* greetFred ( 'hi' ) ;
* // => 'hi fred'
* /
var partial = baseRest ( function ( func , partials ) {
var holders = replaceHolders ( partials , getHolder ( partial ) ) ;
return createWrap ( func , WRAP _PARTIAL _FLAG , undefined , partials , holders ) ;
} ) ;
/ * *
* This method is like ` _.partial ` except that partially applied arguments
* are appended to the arguments it receives .
*
* The ` _.partialRight.placeholder ` value , which defaults to ` _ ` in monolithic
* builds , may be used as a placeholder for partially applied arguments .
*
* * * Note : * * This method doesn ' t set the "length" property of partially
* applied functions .
*
* @ static
* @ memberOf _
* @ since 1.0 . 0
* @ category Function
* @ param { Function } func The function to partially apply arguments to .
* @ param { ... * } [ partials ] The arguments to be partially applied .
* @ returns { Function } Returns the new partially applied function .
* @ example
*
* function greet ( greeting , name ) {
* return greeting + ' ' + name ;
* }
*
* var greetFred = _ . partialRight ( greet , 'fred' ) ;
* greetFred ( 'hi' ) ;
* // => 'hi fred'
*
* // Partially applied with placeholders.
* var sayHelloTo = _ . partialRight ( greet , 'hello' , _ ) ;
* sayHelloTo ( 'fred' ) ;
* // => 'hello fred'
* /
var partialRight = baseRest ( function ( func , partials ) {
var holders = replaceHolders ( partials , getHolder ( partialRight ) ) ;
return createWrap ( func , WRAP _PARTIAL _RIGHT _FLAG , undefined , partials , holders ) ;
} ) ;
/ * *
* Creates a function that invokes ` func ` with arguments arranged according
* to the specified ` indexes ` where the argument value at the first index is
* provided as the first argument , the argument value at the second index is
* provided as the second argument , and so on .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Function
* @ param { Function } func The function to rearrange arguments for .
* @ param { ... ( number | number [ ] ) } indexes The arranged argument indexes .
* @ returns { Function } Returns the new function .
* @ example
*
* var rearged = _ . rearg ( function ( a , b , c ) {
* return [ a , b , c ] ;
* } , [ 2 , 0 , 1 ] ) ;
*
* rearged ( 'b' , 'c' , 'a' )
* // => ['a', 'b', 'c']
* /
var rearg = flatRest ( function ( func , indexes ) {
return createWrap ( func , WRAP _REARG _FLAG , undefined , undefined , undefined , indexes ) ;
} ) ;
/ * *
* Creates a function that invokes ` func ` with the ` this ` binding of the
* created function and arguments from ` start ` and beyond provided as
* an array .
*
* * * Note : * * This method is based on the
* [ rest parameter ] ( https : //mdn.io/rest_parameters).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Function
* @ param { Function } func The function to apply a rest parameter to .
* @ param { number } [ start = func . length - 1 ] The start position of the rest parameter .
* @ returns { Function } Returns the new function .
* @ example
*
* var say = _ . rest ( function ( what , names ) {
* return what + ' ' + _ . initial ( names ) . join ( ', ' ) +
* ( _ . size ( names ) > 1 ? ', & ' : '' ) + _ . last ( names ) ;
* } ) ;
*
* say ( 'hello' , 'fred' , 'barney' , 'pebbles' ) ;
* // => 'hello fred, barney, & pebbles'
* /
function rest ( func , start ) {
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
start = start === undefined ? start : toInteger ( start ) ;
return baseRest ( func , start ) ;
}
/ * *
* Creates a function that invokes ` func ` with the ` this ` binding of the
* create function and an array of arguments much like
* [ ` Function#apply ` ] ( http : //www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).
*
* * * Note : * * This method is based on the
* [ spread operator ] ( https : //mdn.io/spread_operator).
*
* @ static
* @ memberOf _
* @ since 3.2 . 0
* @ category Function
* @ param { Function } func The function to spread arguments over .
* @ param { number } [ start = 0 ] The start position of the spread .
* @ returns { Function } Returns the new function .
* @ example
*
* var say = _ . spread ( function ( who , what ) {
* return who + ' says ' + what ;
* } ) ;
*
* say ( [ 'fred' , 'hello' ] ) ;
* // => 'fred says hello'
*
* var numbers = Promise . all ( [
* Promise . resolve ( 40 ) ,
* Promise . resolve ( 36 )
* ] ) ;
*
* numbers . then ( _ . spread ( function ( x , y ) {
* return x + y ;
* } ) ) ;
* // => a Promise of 76
* /
function spread ( func , start ) {
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
start = start == null ? 0 : nativeMax ( toInteger ( start ) , 0 ) ;
return baseRest ( function ( args ) {
var array = args [ start ] ,
otherArgs = castSlice ( args , 0 , start ) ;
if ( array ) {
arrayPush ( otherArgs , array ) ;
}
return apply ( func , this , otherArgs ) ;
} ) ;
}
/ * *
* Creates a throttled function that only invokes ` func ` at most once per
* every ` wait ` milliseconds . The throttled function comes with a ` cancel `
* method to cancel delayed ` func ` invocations and a ` flush ` method to
* immediately invoke them . Provide ` options ` to indicate whether ` func `
* should be invoked on the leading and / or trailing edge of the ` wait `
* timeout . The ` func ` is invoked with the last arguments provided to the
* throttled function . Subsequent calls to the throttled function return the
* result of the last ` func ` invocation .
*
* * * Note : * * If ` leading ` and ` trailing ` options are ` true ` , ` func ` is
* invoked on the trailing edge of the timeout only if the throttled function
* is invoked more than once during the ` wait ` timeout .
*
* If ` wait ` is ` 0 ` and ` leading ` is ` false ` , ` func ` invocation is deferred
* until to the next tick , similar to ` setTimeout ` with a timeout of ` 0 ` .
*
* See [ David Corbacho ' s article ] ( https : //css-tricks.com/debouncing-throttling-explained-examples/)
* for details over the differences between ` _.throttle ` and ` _.debounce ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { Function } func The function to throttle .
* @ param { number } [ wait = 0 ] The number of milliseconds to throttle invocations to .
* @ param { Object } [ options = { } ] The options object .
* @ param { boolean } [ options . leading = true ]
* Specify invoking on the leading edge of the timeout .
* @ param { boolean } [ options . trailing = true ]
* Specify invoking on the trailing edge of the timeout .
* @ returns { Function } Returns the new throttled function .
* @ example
*
* // Avoid excessively updating the position while scrolling.
* jQuery ( window ) . on ( 'scroll' , _ . throttle ( updatePosition , 100 ) ) ;
*
* // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
* var throttled = _ . throttle ( renewToken , 300000 , { 'trailing' : false } ) ;
* jQuery ( element ) . on ( 'click' , throttled ) ;
*
* // Cancel the trailing throttled invocation.
* jQuery ( window ) . on ( 'popstate' , throttled . cancel ) ;
* /
function throttle ( func , wait , options ) {
var leading = true ,
trailing = true ;
if ( typeof func != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
if ( isObject ( options ) ) {
leading = 'leading' in options ? ! ! options . leading : leading ;
trailing = 'trailing' in options ? ! ! options . trailing : trailing ;
}
return debounce ( func , wait , {
'leading' : leading ,
'maxWait' : wait ,
'trailing' : trailing
} ) ;
}
/ * *
* Creates a function that accepts up to one argument , ignoring any
* additional arguments .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Function
* @ param { Function } func The function to cap arguments for .
* @ returns { Function } Returns the new capped function .
* @ example
*
* _ . map ( [ '6' , '8' , '10' ] , _ . unary ( parseInt ) ) ;
* // => [6, 8, 10]
* /
function unary ( func ) {
return ary ( func , 1 ) ;
}
/ * *
* Creates a function that provides ` value ` to ` wrapper ` as its first
* argument . Any additional arguments provided to the function are appended
* to those provided to the ` wrapper ` . The wrapper is invoked with the ` this `
* binding of the created function .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Function
* @ param { * } value The value to wrap .
* @ param { Function } [ wrapper = identity ] The wrapper function .
* @ returns { Function } Returns the new function .
* @ example
*
* var p = _ . wrap ( _ . escape , function ( func , text ) {
* return '<p>' + func ( text ) + '</p>' ;
* } ) ;
*
* p ( 'fred, barney, & pebbles' ) ;
* // => '<p>fred, barney, & pebbles</p>'
* /
function wrap ( value , wrapper ) {
return partial ( castFunction ( wrapper ) , value ) ;
}
/*------------------------------------------------------------------------*/
/ * *
* Casts ` value ` as an array if it ' s not one .
*
* @ static
* @ memberOf _
* @ since 4.4 . 0
* @ category Lang
* @ param { * } value The value to inspect .
* @ returns { Array } Returns the cast array .
* @ example
*
* _ . castArray ( 1 ) ;
* // => [1]
*
* _ . castArray ( { 'a' : 1 } ) ;
* // => [{ 'a': 1 }]
*
* _ . castArray ( 'abc' ) ;
* // => ['abc']
*
* _ . castArray ( null ) ;
* // => [null]
*
* _ . castArray ( undefined ) ;
* // => [undefined]
*
* _ . castArray ( ) ;
* // => []
*
* var array = [ 1 , 2 , 3 ] ;
* console . log ( _ . castArray ( array ) === array ) ;
* // => true
* /
function castArray ( ) {
if ( ! arguments . length ) {
return [ ] ;
}
var value = arguments [ 0 ] ;
return isArray ( value ) ? value : [ value ] ;
}
/ * *
* Creates a shallow clone of ` value ` .
*
* * * Note : * * This method is loosely based on the
* [ structured clone algorithm ] ( https : //mdn.io/Structured_clone_algorithm)
* and supports cloning arrays , array buffers , booleans , date objects , maps ,
* numbers , ` Object ` objects , regexes , sets , strings , symbols , and typed
* arrays . The own enumerable properties of ` arguments ` objects are cloned
* as plain objects . An empty object is returned for uncloneable values such
* as error objects , functions , DOM nodes , and WeakMaps .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to clone .
* @ returns { * } Returns the cloned value .
* @ see _ . cloneDeep
* @ example
*
* var objects = [ { 'a' : 1 } , { 'b' : 2 } ] ;
*
* var shallow = _ . clone ( objects ) ;
* console . log ( shallow [ 0 ] === objects [ 0 ] ) ;
* // => true
* /
function clone ( value ) {
return baseClone ( value , CLONE _SYMBOLS _FLAG ) ;
}
/ * *
* This method is like ` _.clone ` except that it accepts ` customizer ` which
* is invoked to produce the cloned value . If ` customizer ` returns ` undefined ` ,
* cloning is handled by the method instead . The ` customizer ` is invoked with
* up to four arguments ; ( value [ , index | key , object , stack ] ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to clone .
* @ param { Function } [ customizer ] The function to customize cloning .
* @ returns { * } Returns the cloned value .
* @ see _ . cloneDeepWith
* @ example
*
* function customizer ( value ) {
* if ( _ . isElement ( value ) ) {
* return value . cloneNode ( false ) ;
* }
* }
*
* var el = _ . cloneWith ( document . body , customizer ) ;
*
* console . log ( el === document . body ) ;
* // => false
* console . log ( el . nodeName ) ;
* // => 'BODY'
* console . log ( el . childNodes . length ) ;
* // => 0
* /
function cloneWith ( value , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
return baseClone ( value , CLONE _SYMBOLS _FLAG , customizer ) ;
}
/ * *
* This method is like ` _.clone ` except that it recursively clones ` value ` .
*
* @ static
* @ memberOf _
* @ since 1.0 . 0
* @ category Lang
* @ param { * } value The value to recursively clone .
* @ returns { * } Returns the deep cloned value .
* @ see _ . clone
* @ example
*
* var objects = [ { 'a' : 1 } , { 'b' : 2 } ] ;
*
* var deep = _ . cloneDeep ( objects ) ;
* console . log ( deep [ 0 ] === objects [ 0 ] ) ;
* // => false
* /
function cloneDeep ( value ) {
return baseClone ( value , CLONE _DEEP _FLAG | CLONE _SYMBOLS _FLAG ) ;
}
/ * *
* This method is like ` _.cloneWith ` except that it recursively clones ` value ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to recursively clone .
* @ param { Function } [ customizer ] The function to customize cloning .
* @ returns { * } Returns the deep cloned value .
* @ see _ . cloneWith
* @ example
*
* function customizer ( value ) {
* if ( _ . isElement ( value ) ) {
* return value . cloneNode ( true ) ;
* }
* }
*
* var el = _ . cloneDeepWith ( document . body , customizer ) ;
*
* console . log ( el === document . body ) ;
* // => false
* console . log ( el . nodeName ) ;
* // => 'BODY'
* console . log ( el . childNodes . length ) ;
* // => 20
* /
function cloneDeepWith ( value , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
return baseClone ( value , CLONE _DEEP _FLAG | CLONE _SYMBOLS _FLAG , customizer ) ;
}
/ * *
* Checks if ` object ` conforms to ` source ` by invoking the predicate
* properties of ` source ` with the corresponding property values of ` object ` .
*
* * * Note : * * This method is equivalent to ` _.conforms ` when ` source ` is
* partially applied .
*
* @ static
* @ memberOf _
* @ since 4.14 . 0
* @ category Lang
* @ param { Object } object The object to inspect .
* @ param { Object } source The object of property predicates to conform to .
* @ returns { boolean } Returns ` true ` if ` object ` conforms , else ` false ` .
* @ example
*
* var object = { 'a' : 1 , 'b' : 2 } ;
*
* _ . conformsTo ( object , { 'b' : function ( n ) { return n > 1 ; } } ) ;
* // => true
*
* _ . conformsTo ( object , { 'b' : function ( n ) { return n > 2 ; } } ) ;
* // => false
* /
function conformsTo ( object , source ) {
return source == null || baseConformsTo ( object , source , keys ( source ) ) ;
}
/ * *
* Performs a
* [ ` SameValueZero ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
* comparison between two values to determine if they are equivalent .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if the values are equivalent , else ` false ` .
* @ example
*
* var object = { 'a' : 1 } ;
* var other = { 'a' : 1 } ;
*
* _ . eq ( object , object ) ;
* // => true
*
* _ . eq ( object , other ) ;
* // => false
*
* _ . eq ( 'a' , 'a' ) ;
* // => true
*
* _ . eq ( 'a' , Object ( 'a' ) ) ;
* // => false
*
* _ . eq ( NaN , NaN ) ;
* // => true
* /
function eq ( value , other ) {
return value === other || ( value !== value && other !== other ) ;
}
/ * *
* Checks if ` value ` is greater than ` other ` .
*
* @ static
* @ memberOf _
* @ since 3.9 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is greater than ` other ` ,
* else ` false ` .
* @ see _ . lt
* @ example
*
* _ . gt ( 3 , 1 ) ;
* // => true
*
* _ . gt ( 3 , 3 ) ;
* // => false
*
* _ . gt ( 1 , 3 ) ;
* // => false
* /
var gt = createRelationalOperation ( baseGt ) ;
/ * *
* Checks if ` value ` is greater than or equal to ` other ` .
*
* @ static
* @ memberOf _
* @ since 3.9 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is greater than or equal to
* ` other ` , else ` false ` .
* @ see _ . lte
* @ example
*
* _ . gte ( 3 , 1 ) ;
* // => true
*
* _ . gte ( 3 , 3 ) ;
* // => true
*
* _ . gte ( 1 , 3 ) ;
* // => false
* /
var gte = createRelationalOperation ( function ( value , other ) {
return value >= other ;
} ) ;
/ * *
* Checks if ` value ` is likely an ` arguments ` object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an ` arguments ` object ,
* else ` false ` .
* @ example
*
* _ . isArguments ( function ( ) { return arguments ; } ( ) ) ;
* // => true
*
* _ . isArguments ( [ 1 , 2 , 3 ] ) ;
* // => false
* /
var isArguments = baseIsArguments ( function ( ) { return arguments ; } ( ) ) ? baseIsArguments : function ( value ) {
return isObjectLike ( value ) && hasOwnProperty . call ( value , 'callee' ) &&
! propertyIsEnumerable . call ( value , 'callee' ) ;
} ;
/ * *
* Checks if ` value ` is classified as an ` Array ` object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an array , else ` false ` .
* @ example
*
* _ . isArray ( [ 1 , 2 , 3 ] ) ;
* // => true
*
* _ . isArray ( document . body . children ) ;
* // => false
*
* _ . isArray ( 'abc' ) ;
* // => false
*
* _ . isArray ( _ . noop ) ;
* // => false
* /
var isArray = Array . isArray ;
/ * *
* Checks if ` value ` is classified as an ` ArrayBuffer ` object .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an array buffer , else ` false ` .
* @ example
*
* _ . isArrayBuffer ( new ArrayBuffer ( 2 ) ) ;
* // => true
*
* _ . isArrayBuffer ( new Array ( 2 ) ) ;
* // => false
* /
var isArrayBuffer = nodeIsArrayBuffer ? baseUnary ( nodeIsArrayBuffer ) : baseIsArrayBuffer ;
/ * *
* Checks if ` value ` is array - like . A value is considered array - like if it ' s
* not a function and has a ` value.length ` that ' s an integer greater than or
* equal to ` 0 ` and less than or equal to ` Number.MAX_SAFE_INTEGER ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is array - like , else ` false ` .
* @ example
*
* _ . isArrayLike ( [ 1 , 2 , 3 ] ) ;
* // => true
*
* _ . isArrayLike ( document . body . children ) ;
* // => true
*
* _ . isArrayLike ( 'abc' ) ;
* // => true
*
* _ . isArrayLike ( _ . noop ) ;
* // => false
* /
function isArrayLike ( value ) {
return value != null && isLength ( value . length ) && ! isFunction ( value ) ;
}
/ * *
* This method is like ` _.isArrayLike ` except that it also checks if ` value `
* is an object .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an array - like object ,
* else ` false ` .
* @ example
*
* _ . isArrayLikeObject ( [ 1 , 2 , 3 ] ) ;
* // => true
*
* _ . isArrayLikeObject ( document . body . children ) ;
* // => true
*
* _ . isArrayLikeObject ( 'abc' ) ;
* // => false
*
* _ . isArrayLikeObject ( _ . noop ) ;
* // => false
* /
function isArrayLikeObject ( value ) {
return isObjectLike ( value ) && isArrayLike ( value ) ;
}
/ * *
* Checks if ` value ` is classified as a boolean primitive or object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a boolean , else ` false ` .
* @ example
*
* _ . isBoolean ( false ) ;
* // => true
*
* _ . isBoolean ( null ) ;
* // => false
* /
function isBoolean ( value ) {
return value === true || value === false ||
( isObjectLike ( value ) && baseGetTag ( value ) == boolTag ) ;
}
/ * *
* Checks if ` value ` is a buffer .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a buffer , else ` false ` .
* @ example
*
* _ . isBuffer ( new Buffer ( 2 ) ) ;
* // => true
*
* _ . isBuffer ( new Uint8Array ( 2 ) ) ;
* // => false
* /
var isBuffer = nativeIsBuffer || stubFalse ;
/ * *
* Checks if ` value ` is classified as a ` Date ` object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a date object , else ` false ` .
* @ example
*
* _ . isDate ( new Date ) ;
* // => true
*
* _ . isDate ( 'Mon April 23 2012' ) ;
* // => false
* /
var isDate = nodeIsDate ? baseUnary ( nodeIsDate ) : baseIsDate ;
/ * *
* Checks if ` value ` is likely a DOM element .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a DOM element , else ` false ` .
* @ example
*
* _ . isElement ( document . body ) ;
* // => true
*
* _ . isElement ( '<body>' ) ;
* // => false
* /
function isElement ( value ) {
return isObjectLike ( value ) && value . nodeType === 1 && ! isPlainObject ( value ) ;
}
/ * *
* Checks if ` value ` is an empty object , collection , map , or set .
*
* Objects are considered empty if they have no own enumerable string keyed
* properties .
*
* Array - like values such as ` arguments ` objects , arrays , buffers , strings , or
* jQuery - like collections are considered empty if they have a ` length ` of ` 0 ` .
* Similarly , maps and sets are considered empty if they have a ` size ` of ` 0 ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is empty , else ` false ` .
* @ example
*
* _ . isEmpty ( null ) ;
* // => true
*
* _ . isEmpty ( true ) ;
* // => true
*
* _ . isEmpty ( 1 ) ;
* // => true
*
* _ . isEmpty ( [ 1 , 2 , 3 ] ) ;
* // => false
*
* _ . isEmpty ( { 'a' : 1 } ) ;
* // => false
* /
function isEmpty ( value ) {
if ( value == null ) {
return true ;
}
if ( isArrayLike ( value ) &&
( isArray ( value ) || typeof value == 'string' || typeof value . splice == 'function' ||
isBuffer ( value ) || isTypedArray ( value ) || isArguments ( value ) ) ) {
return ! value . length ;
}
var tag = getTag ( value ) ;
if ( tag == mapTag || tag == setTag ) {
return ! value . size ;
}
if ( isPrototype ( value ) ) {
return ! baseKeys ( value ) . length ;
}
for ( var key in value ) {
if ( hasOwnProperty . call ( value , key ) ) {
return false ;
}
}
return true ;
}
/ * *
* Performs a deep comparison between two values to determine if they are
* equivalent .
*
* * * Note : * * This method supports comparing arrays , array buffers , booleans ,
* date objects , error objects , maps , numbers , ` Object ` objects , regexes ,
* sets , strings , symbols , and typed arrays . ` Object ` objects are compared
* by their own , not inherited , enumerable properties . Functions and DOM
* nodes are compared by strict equality , i . e . ` === ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if the values are equivalent , else ` false ` .
* @ example
*
* var object = { 'a' : 1 } ;
* var other = { 'a' : 1 } ;
*
* _ . isEqual ( object , other ) ;
* // => true
*
* object === other ;
* // => false
* /
function isEqual ( value , other ) {
return baseIsEqual ( value , other ) ;
}
/ * *
* This method is like ` _.isEqual ` except that it accepts ` customizer ` which
* is invoked to compare values . If ` customizer ` returns ` undefined ` , comparisons
* are handled by the method instead . The ` customizer ` is invoked with up to
* six arguments : ( objValue , othValue [ , index | key , object , other , stack ] ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ param { Function } [ customizer ] The function to customize comparisons .
* @ returns { boolean } Returns ` true ` if the values are equivalent , else ` false ` .
* @ example
*
* function isGreeting ( value ) {
* return /^h(?:i|ello)$/ . test ( value ) ;
* }
*
* function customizer ( objValue , othValue ) {
* if ( isGreeting ( objValue ) && isGreeting ( othValue ) ) {
* return true ;
* }
* }
*
* var array = [ 'hello' , 'goodbye' ] ;
* var other = [ 'hi' , 'goodbye' ] ;
*
* _ . isEqualWith ( array , other , customizer ) ;
* // => true
* /
function isEqualWith ( value , other , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
var result = customizer ? customizer ( value , other ) : undefined ;
return result === undefined ? baseIsEqual ( value , other , undefined , customizer ) : ! ! result ;
}
/ * *
* Checks if ` value ` is an ` Error ` , ` EvalError ` , ` RangeError ` , ` ReferenceError ` ,
* ` SyntaxError ` , ` TypeError ` , or ` URIError ` object .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an error object , else ` false ` .
* @ example
*
* _ . isError ( new Error ) ;
* // => true
*
* _ . isError ( Error ) ;
* // => false
* /
function isError ( value ) {
if ( ! isObjectLike ( value ) ) {
return false ;
}
var tag = baseGetTag ( value ) ;
return tag == errorTag || tag == domExcTag ||
( typeof value . message == 'string' && typeof value . name == 'string' && ! isPlainObject ( value ) ) ;
}
/ * *
* Checks if ` value ` is a finite primitive number .
*
* * * Note : * * This method is based on
* [ ` Number.isFinite ` ] ( https : //mdn.io/Number/isFinite).
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a finite number , else ` false ` .
* @ example
*
* _ . isFinite ( 3 ) ;
* // => true
*
* _ . isFinite ( Number . MIN _VALUE ) ;
* // => true
*
* _ . isFinite ( Infinity ) ;
* // => false
*
* _ . isFinite ( '3' ) ;
* // => false
* /
function isFinite ( value ) {
return typeof value == 'number' && nativeIsFinite ( value ) ;
}
/ * *
* Checks if ` value ` is classified as a ` Function ` object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a function , else ` false ` .
* @ example
*
* _ . isFunction ( _ ) ;
* // => true
*
* _ . isFunction ( /abc/ ) ;
* // => false
* /
function isFunction ( value ) {
if ( ! isObject ( value ) ) {
return false ;
}
// The use of `Object#toString` avoids issues with the `typeof` operator
// in Safari 9 which returns 'object' for typed arrays and other constructors.
var tag = baseGetTag ( value ) ;
return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag ;
}
/ * *
* Checks if ` value ` is an integer .
*
* * * Note : * * This method is based on
* [ ` Number.isInteger ` ] ( https : //mdn.io/Number/isInteger).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an integer , else ` false ` .
* @ example
*
* _ . isInteger ( 3 ) ;
* // => true
*
* _ . isInteger ( Number . MIN _VALUE ) ;
* // => false
*
* _ . isInteger ( Infinity ) ;
* // => false
*
* _ . isInteger ( '3' ) ;
* // => false
* /
function isInteger ( value ) {
return typeof value == 'number' && value == toInteger ( value ) ;
}
/ * *
* Checks if ` value ` is a valid array - like length .
*
* * * Note : * * This method is loosely based on
* [ ` ToLength ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-tolength).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a valid length , else ` false ` .
* @ example
*
* _ . isLength ( 3 ) ;
* // => true
*
* _ . isLength ( Number . MIN _VALUE ) ;
* // => false
*
* _ . isLength ( Infinity ) ;
* // => false
*
* _ . isLength ( '3' ) ;
* // => false
* /
function isLength ( value ) {
return typeof value == 'number' &&
value > - 1 && value % 1 == 0 && value <= MAX _SAFE _INTEGER ;
}
/ * *
* Checks if ` value ` is the
* [ language type ] ( http : //www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
* of ` Object ` . ( e . g . arrays , functions , objects , regexes , ` new Number(0) ` , and ` new String('') ` )
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is an object , else ` false ` .
* @ example
*
* _ . isObject ( { } ) ;
* // => true
*
* _ . isObject ( [ 1 , 2 , 3 ] ) ;
* // => true
*
* _ . isObject ( _ . noop ) ;
* // => true
*
* _ . isObject ( null ) ;
* // => false
* /
function isObject ( value ) {
var type = typeof value ;
return value != null && ( type == 'object' || type == 'function' ) ;
}
/ * *
* Checks if ` value ` is object - like . A value is object - like if it ' s not ` null `
* and has a ` typeof ` result of "object" .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is object - like , else ` false ` .
* @ example
*
* _ . isObjectLike ( { } ) ;
* // => true
*
* _ . isObjectLike ( [ 1 , 2 , 3 ] ) ;
* // => true
*
* _ . isObjectLike ( _ . noop ) ;
* // => false
*
* _ . isObjectLike ( null ) ;
* // => false
* /
function isObjectLike ( value ) {
return value != null && typeof value == 'object' ;
}
/ * *
* Checks if ` value ` is classified as a ` Map ` object .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a map , else ` false ` .
* @ example
*
* _ . isMap ( new Map ) ;
* // => true
*
* _ . isMap ( new WeakMap ) ;
* // => false
* /
var isMap = nodeIsMap ? baseUnary ( nodeIsMap ) : baseIsMap ;
/ * *
* Performs a partial deep comparison between ` object ` and ` source ` to
* determine if ` object ` contains equivalent property values .
*
* * * Note : * * This method is equivalent to ` _.matches ` when ` source ` is
* partially applied .
*
* Partial comparisons will match empty array and empty object ` source `
* values against any array or object value , respectively . See ` _.isEqual `
* for a list of supported value comparisons .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Lang
* @ param { Object } object The object to inspect .
* @ param { Object } source The object of property values to match .
* @ returns { boolean } Returns ` true ` if ` object ` is a match , else ` false ` .
* @ example
*
* var object = { 'a' : 1 , 'b' : 2 } ;
*
* _ . isMatch ( object , { 'b' : 2 } ) ;
* // => true
*
* _ . isMatch ( object , { 'b' : 1 } ) ;
* // => false
* /
function isMatch ( object , source ) {
return object === source || baseIsMatch ( object , source , getMatchData ( source ) ) ;
}
/ * *
* This method is like ` _.isMatch ` except that it accepts ` customizer ` which
* is invoked to compare values . If ` customizer ` returns ` undefined ` , comparisons
* are handled by the method instead . The ` customizer ` is invoked with five
* arguments : ( objValue , srcValue , index | key , object , source ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { Object } object The object to inspect .
* @ param { Object } source The object of property values to match .
* @ param { Function } [ customizer ] The function to customize comparisons .
* @ returns { boolean } Returns ` true ` if ` object ` is a match , else ` false ` .
* @ example
*
* function isGreeting ( value ) {
* return /^h(?:i|ello)$/ . test ( value ) ;
* }
*
* function customizer ( objValue , srcValue ) {
* if ( isGreeting ( objValue ) && isGreeting ( srcValue ) ) {
* return true ;
* }
* }
*
* var object = { 'greeting' : 'hello' } ;
* var source = { 'greeting' : 'hi' } ;
*
* _ . isMatchWith ( object , source , customizer ) ;
* // => true
* /
function isMatchWith ( object , source , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
return baseIsMatch ( object , source , getMatchData ( source ) , customizer ) ;
}
/ * *
* Checks if ` value ` is ` NaN ` .
*
* * * Note : * * This method is based on
* [ ` Number.isNaN ` ] ( https : //mdn.io/Number/isNaN) and is not the same as
* global [ ` isNaN ` ] ( https : //mdn.io/isNaN) which returns `true` for
* ` undefined ` and other non - number values .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is ` NaN ` , else ` false ` .
* @ example
*
* _ . isNaN ( NaN ) ;
* // => true
*
* _ . isNaN ( new Number ( NaN ) ) ;
* // => true
*
* isNaN ( undefined ) ;
* // => true
*
* _ . isNaN ( undefined ) ;
* // => false
* /
function isNaN ( value ) {
// An `NaN` primitive is the only value that is not equal to itself.
// Perform the `toStringTag` check first to avoid errors with some
// ActiveX objects in IE.
return isNumber ( value ) && value != + value ;
}
/ * *
* Checks if ` value ` is a pristine native function .
*
* * * Note : * * This method can ' t reliably detect native functions in the presence
* of the core - js package because core - js circumvents this kind of detection .
* Despite multiple requests , the core - js maintainer has made it clear : any
* attempt to fix the detection will be obstructed . As a result , we ' re left
* with little choice but to throw an error . Unfortunately , this also affects
* packages , like [ babel - polyfill ] ( https : //www.npmjs.com/package/babel-polyfill),
* which rely on core - js .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a native function ,
* else ` false ` .
* @ example
*
* _ . isNative ( Array . prototype . push ) ;
* // => true
*
* _ . isNative ( _ ) ;
* // => false
* /
function isNative ( value ) {
if ( isMaskable ( value ) ) {
throw new Error ( CORE _ERROR _TEXT ) ;
}
return baseIsNative ( value ) ;
}
/ * *
* Checks if ` value ` is ` null ` .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is ` null ` , else ` false ` .
* @ example
*
* _ . isNull ( null ) ;
* // => true
*
* _ . isNull ( void 0 ) ;
* // => false
* /
function isNull ( value ) {
return value === null ;
}
/ * *
* Checks if ` value ` is ` null ` or ` undefined ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is nullish , else ` false ` .
* @ example
*
* _ . isNil ( null ) ;
* // => true
*
* _ . isNil ( void 0 ) ;
* // => true
*
* _ . isNil ( NaN ) ;
* // => false
* /
function isNil ( value ) {
return value == null ;
}
/ * *
* Checks if ` value ` is classified as a ` Number ` primitive or object .
*
* * * Note : * * To exclude ` Infinity ` , ` -Infinity ` , and ` NaN ` , which are
* classified as numbers , use the ` _.isFinite ` method .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a number , else ` false ` .
* @ example
*
* _ . isNumber ( 3 ) ;
* // => true
*
* _ . isNumber ( Number . MIN _VALUE ) ;
* // => true
*
* _ . isNumber ( Infinity ) ;
* // => true
*
* _ . isNumber ( '3' ) ;
* // => false
* /
function isNumber ( value ) {
return typeof value == 'number' ||
( isObjectLike ( value ) && baseGetTag ( value ) == numberTag ) ;
}
/ * *
* Checks if ` value ` is a plain object , that is , an object created by the
* ` Object ` constructor or one with a ` [[Prototype]] ` of ` null ` .
*
* @ static
* @ memberOf _
* @ since 0.8 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a plain object , else ` false ` .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* }
*
* _ . isPlainObject ( new Foo ) ;
* // => false
*
* _ . isPlainObject ( [ 1 , 2 , 3 ] ) ;
* // => false
*
* _ . isPlainObject ( { 'x' : 0 , 'y' : 0 } ) ;
* // => true
*
* _ . isPlainObject ( Object . create ( null ) ) ;
* // => true
* /
function isPlainObject ( value ) {
if ( ! isObjectLike ( value ) || baseGetTag ( value ) != objectTag ) {
return false ;
}
var proto = getPrototype ( value ) ;
if ( proto === null ) {
return true ;
}
var Ctor = hasOwnProperty . call ( proto , 'constructor' ) && proto . constructor ;
return typeof Ctor == 'function' && Ctor instanceof Ctor &&
funcToString . call ( Ctor ) == objectCtorString ;
}
/ * *
* Checks if ` value ` is classified as a ` RegExp ` object .
*
* @ static
* @ memberOf _
* @ since 0.1 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a regexp , else ` false ` .
* @ example
*
* _ . isRegExp ( /abc/ ) ;
* // => true
*
* _ . isRegExp ( '/abc/' ) ;
* // => false
* /
var isRegExp = nodeIsRegExp ? baseUnary ( nodeIsRegExp ) : baseIsRegExp ;
/ * *
* Checks if ` value ` is a safe integer . An integer is safe if it ' s an IEEE - 754
* double precision number which isn ' t the result of a rounded unsafe integer .
*
* * * Note : * * This method is based on
* [ ` Number.isSafeInteger ` ] ( https : //mdn.io/Number/isSafeInteger).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a safe integer , else ` false ` .
* @ example
*
* _ . isSafeInteger ( 3 ) ;
* // => true
*
* _ . isSafeInteger ( Number . MIN _VALUE ) ;
* // => false
*
* _ . isSafeInteger ( Infinity ) ;
* // => false
*
* _ . isSafeInteger ( '3' ) ;
* // => false
* /
function isSafeInteger ( value ) {
return isInteger ( value ) && value >= - MAX _SAFE _INTEGER && value <= MAX _SAFE _INTEGER ;
}
/ * *
* Checks if ` value ` is classified as a ` Set ` object .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a set , else ` false ` .
* @ example
*
* _ . isSet ( new Set ) ;
* // => true
*
* _ . isSet ( new WeakSet ) ;
* // => false
* /
var isSet = nodeIsSet ? baseUnary ( nodeIsSet ) : baseIsSet ;
/ * *
* Checks if ` value ` is classified as a ` String ` primitive or object .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a string , else ` false ` .
* @ example
*
* _ . isString ( 'abc' ) ;
* // => true
*
* _ . isString ( 1 ) ;
* // => false
* /
function isString ( value ) {
return typeof value == 'string' ||
( ! isArray ( value ) && isObjectLike ( value ) && baseGetTag ( value ) == stringTag ) ;
}
/ * *
* Checks if ` value ` is classified as a ` Symbol ` primitive or object .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a symbol , else ` false ` .
* @ example
*
* _ . isSymbol ( Symbol . iterator ) ;
* // => true
*
* _ . isSymbol ( 'abc' ) ;
* // => false
* /
function isSymbol ( value ) {
return typeof value == 'symbol' ||
( isObjectLike ( value ) && baseGetTag ( value ) == symbolTag ) ;
}
/ * *
* Checks if ` value ` is classified as a typed array .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a typed array , else ` false ` .
* @ example
*
* _ . isTypedArray ( new Uint8Array ) ;
* // => true
*
* _ . isTypedArray ( [ ] ) ;
* // => false
* /
var isTypedArray = nodeIsTypedArray ? baseUnary ( nodeIsTypedArray ) : baseIsTypedArray ;
/ * *
* Checks if ` value ` is ` undefined ` .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is ` undefined ` , else ` false ` .
* @ example
*
* _ . isUndefined ( void 0 ) ;
* // => true
*
* _ . isUndefined ( null ) ;
* // => false
* /
function isUndefined ( value ) {
return value === undefined ;
}
/ * *
* Checks if ` value ` is classified as a ` WeakMap ` object .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a weak map , else ` false ` .
* @ example
*
* _ . isWeakMap ( new WeakMap ) ;
* // => true
*
* _ . isWeakMap ( new Map ) ;
* // => false
* /
function isWeakMap ( value ) {
return isObjectLike ( value ) && getTag ( value ) == weakMapTag ;
}
/ * *
* Checks if ` value ` is classified as a ` WeakSet ` object .
*
* @ static
* @ memberOf _
* @ since 4.3 . 0
* @ category Lang
* @ param { * } value The value to check .
* @ returns { boolean } Returns ` true ` if ` value ` is a weak set , else ` false ` .
* @ example
*
* _ . isWeakSet ( new WeakSet ) ;
* // => true
*
* _ . isWeakSet ( new Set ) ;
* // => false
* /
function isWeakSet ( value ) {
return isObjectLike ( value ) && baseGetTag ( value ) == weakSetTag ;
}
/ * *
* Checks if ` value ` is less than ` other ` .
*
* @ static
* @ memberOf _
* @ since 3.9 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is less than ` other ` ,
* else ` false ` .
* @ see _ . gt
* @ example
*
* _ . lt ( 1 , 3 ) ;
* // => true
*
* _ . lt ( 3 , 3 ) ;
* // => false
*
* _ . lt ( 3 , 1 ) ;
* // => false
* /
var lt = createRelationalOperation ( baseLt ) ;
/ * *
* Checks if ` value ` is less than or equal to ` other ` .
*
* @ static
* @ memberOf _
* @ since 3.9 . 0
* @ category Lang
* @ param { * } value The value to compare .
* @ param { * } other The other value to compare .
* @ returns { boolean } Returns ` true ` if ` value ` is less than or equal to
* ` other ` , else ` false ` .
* @ see _ . gte
* @ example
*
* _ . lte ( 1 , 3 ) ;
* // => true
*
* _ . lte ( 3 , 3 ) ;
* // => true
*
* _ . lte ( 3 , 1 ) ;
* // => false
* /
var lte = createRelationalOperation ( function ( value , other ) {
return value <= other ;
} ) ;
/ * *
* Converts ` value ` to an array .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { Array } Returns the converted array .
* @ example
*
* _ . toArray ( { 'a' : 1 , 'b' : 2 } ) ;
* // => [1, 2]
*
* _ . toArray ( 'abc' ) ;
* // => ['a', 'b', 'c']
*
* _ . toArray ( 1 ) ;
* // => []
*
* _ . toArray ( null ) ;
* // => []
* /
function toArray ( value ) {
if ( ! value ) {
return [ ] ;
}
if ( isArrayLike ( value ) ) {
return isString ( value ) ? stringToArray ( value ) : copyArray ( value ) ;
}
if ( symIterator && value [ symIterator ] ) {
return iteratorToArray ( value [ symIterator ] ( ) ) ;
}
var tag = getTag ( value ) ,
func = tag == mapTag ? mapToArray : ( tag == setTag ? setToArray : values ) ;
return func ( value ) ;
}
/ * *
* Converts ` value ` to a finite number .
*
* @ static
* @ memberOf _
* @ since 4.12 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { number } Returns the converted number .
* @ example
*
* _ . toFinite ( 3.2 ) ;
* // => 3.2
*
* _ . toFinite ( Number . MIN _VALUE ) ;
* // => 5e-324
*
* _ . toFinite ( Infinity ) ;
* // => 1.7976931348623157e+308
*
* _ . toFinite ( '3.2' ) ;
* // => 3.2
* /
function toFinite ( value ) {
if ( ! value ) {
return value === 0 ? value : 0 ;
}
value = toNumber ( value ) ;
if ( value === INFINITY || value === - INFINITY ) {
var sign = ( value < 0 ? - 1 : 1 ) ;
return sign * MAX _INTEGER ;
}
return value === value ? value : 0 ;
}
/ * *
* Converts ` value ` to an integer .
*
* * * Note : * * This method is loosely based on
* [ ` ToInteger ` ] ( http : //www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { number } Returns the converted integer .
* @ example
*
* _ . toInteger ( 3.2 ) ;
* // => 3
*
* _ . toInteger ( Number . MIN _VALUE ) ;
* // => 0
*
* _ . toInteger ( Infinity ) ;
* // => 1.7976931348623157e+308
*
* _ . toInteger ( '3.2' ) ;
* // => 3
* /
function toInteger ( value ) {
var result = toFinite ( value ) ,
remainder = result % 1 ;
return result === result ? ( remainder ? result - remainder : result ) : 0 ;
}
/ * *
* Converts ` value ` to an integer suitable for use as the length of an
* array - like object .
*
* * * Note : * * This method is based on
* [ ` ToLength ` ] ( http : //ecma-international.org/ecma-262/7.0/#sec-tolength).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { number } Returns the converted integer .
* @ example
*
* _ . toLength ( 3.2 ) ;
* // => 3
*
* _ . toLength ( Number . MIN _VALUE ) ;
* // => 0
*
* _ . toLength ( Infinity ) ;
* // => 4294967295
*
* _ . toLength ( '3.2' ) ;
* // => 3
* /
function toLength ( value ) {
return value ? baseClamp ( toInteger ( value ) , 0 , MAX _ARRAY _LENGTH ) : 0 ;
}
/ * *
* Converts ` value ` to a number .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to process .
* @ returns { number } Returns the number .
* @ example
*
* _ . toNumber ( 3.2 ) ;
* // => 3.2
*
* _ . toNumber ( Number . MIN _VALUE ) ;
* // => 5e-324
*
* _ . toNumber ( Infinity ) ;
* // => Infinity
*
* _ . toNumber ( '3.2' ) ;
* // => 3.2
* /
function toNumber ( value ) {
if ( typeof value == 'number' ) {
return value ;
}
if ( isSymbol ( value ) ) {
return NAN ;
}
if ( isObject ( value ) ) {
var other = typeof value . valueOf == 'function' ? value . valueOf ( ) : value ;
value = isObject ( other ) ? ( other + '' ) : other ;
}
if ( typeof value != 'string' ) {
return value === 0 ? value : + value ;
}
value = value . replace ( reTrim , '' ) ;
var isBinary = reIsBinary . test ( value ) ;
return ( isBinary || reIsOctal . test ( value ) ) ?
freeParseInt ( value . slice ( 2 ) , isBinary ? 2 : 8 ) :
( reIsBadHex . test ( value ) ? NAN : + value ) ;
}
/ * *
* Converts ` value ` to a plain object flattening inherited enumerable string
* keyed properties of ` value ` to own properties of the plain object .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { Object } Returns the converted plain object .
* @ example
*
* function Foo ( ) {
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . assign ( { 'a' : 1 } , new Foo ) ;
* // => { 'a': 1, 'b': 2 }
*
* _ . assign ( { 'a' : 1 } , _ . toPlainObject ( new Foo ) ) ;
* // => { 'a': 1, 'b': 2, 'c': 3 }
* /
function toPlainObject ( value ) {
return copyObject ( value , keysIn ( value ) ) ;
}
/ * *
* Converts ` value ` to a safe integer . A safe integer can be compared and
* represented correctly .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { number } Returns the converted integer .
* @ example
*
* _ . toSafeInteger ( 3.2 ) ;
* // => 3
*
* _ . toSafeInteger ( Number . MIN _VALUE ) ;
* // => 0
*
* _ . toSafeInteger ( Infinity ) ;
* // => 9007199254740991
*
* _ . toSafeInteger ( '3.2' ) ;
* // => 3
* /
function toSafeInteger ( value ) {
return value ?
baseClamp ( toInteger ( value ) , - MAX _SAFE _INTEGER , MAX _SAFE _INTEGER ) :
( value === 0 ? value : 0 ) ;
}
/ * *
* Converts ` value ` to a string . An empty string is returned for ` null `
* and ` undefined ` values . The sign of ` -0 ` is preserved .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Lang
* @ param { * } value The value to convert .
* @ returns { string } Returns the converted string .
* @ example
*
* _ . toString ( null ) ;
* // => ''
*
* _ . toString ( - 0 ) ;
* // => '-0'
*
* _ . toString ( [ 1 , 2 , 3 ] ) ;
* // => '1,2,3'
* /
function toString ( value ) {
return value == null ? '' : baseToString ( value ) ;
}
/*------------------------------------------------------------------------*/
/ * *
* Assigns own enumerable string keyed properties of source objects to the
* destination object . Source objects are applied from left to right .
* Subsequent sources overwrite property assignments of previous sources .
*
* * * Note : * * This method mutates ` object ` and is loosely based on
* [ ` Object.assign ` ] ( https : //mdn.io/Object/assign).
*
* @ static
* @ memberOf _
* @ since 0.10 . 0
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } [ sources ] The source objects .
* @ returns { Object } Returns ` object ` .
* @ see _ . assignIn
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* }
*
* function Bar ( ) {
* this . c = 3 ;
* }
*
* Foo . prototype . b = 2 ;
* Bar . prototype . d = 4 ;
*
* _ . assign ( { 'a' : 0 } , new Foo , new Bar ) ;
* // => { 'a': 1, 'c': 3 }
* /
var assign = createAssigner ( function ( object , source ) {
if ( isPrototype ( source ) || isArrayLike ( source ) ) {
copyObject ( source , keys ( source ) , object ) ;
return ;
}
for ( var key in source ) {
if ( hasOwnProperty . call ( source , key ) ) {
assignValue ( object , key , source [ key ] ) ;
}
}
} ) ;
/ * *
* This method is like ` _.assign ` except that it iterates over own and
* inherited source properties .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ alias extend
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } [ sources ] The source objects .
* @ returns { Object } Returns ` object ` .
* @ see _ . assign
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* }
*
* function Bar ( ) {
* this . c = 3 ;
* }
*
* Foo . prototype . b = 2 ;
* Bar . prototype . d = 4 ;
*
* _ . assignIn ( { 'a' : 0 } , new Foo , new Bar ) ;
* // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }
* /
var assignIn = createAssigner ( function ( object , source ) {
copyObject ( source , keysIn ( source ) , object ) ;
} ) ;
/ * *
* This method is like ` _.assignIn ` except that it accepts ` customizer `
* which is invoked to produce the assigned values . If ` customizer ` returns
* ` undefined ` , assignment is handled by the method instead . The ` customizer `
* is invoked with five arguments : ( objValue , srcValue , key , object , source ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ alias extendWith
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } sources The source objects .
* @ param { Function } [ customizer ] The function to customize assigned values .
* @ returns { Object } Returns ` object ` .
* @ see _ . assignWith
* @ example
*
* function customizer ( objValue , srcValue ) {
* return _ . isUndefined ( objValue ) ? srcValue : objValue ;
* }
*
* var defaults = _ . partialRight ( _ . assignInWith , customizer ) ;
*
* defaults ( { 'a' : 1 } , { 'b' : 2 } , { 'a' : 3 } ) ;
* // => { 'a': 1, 'b': 2 }
* /
var assignInWith = createAssigner ( function ( object , source , srcIndex , customizer ) {
copyObject ( source , keysIn ( source ) , object , customizer ) ;
} ) ;
/ * *
* This method is like ` _.assign ` except that it accepts ` customizer `
* which is invoked to produce the assigned values . If ` customizer ` returns
* ` undefined ` , assignment is handled by the method instead . The ` customizer `
* is invoked with five arguments : ( objValue , srcValue , key , object , source ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } sources The source objects .
* @ param { Function } [ customizer ] The function to customize assigned values .
* @ returns { Object } Returns ` object ` .
* @ see _ . assignInWith
* @ example
*
* function customizer ( objValue , srcValue ) {
* return _ . isUndefined ( objValue ) ? srcValue : objValue ;
* }
*
* var defaults = _ . partialRight ( _ . assignWith , customizer ) ;
*
* defaults ( { 'a' : 1 } , { 'b' : 2 } , { 'a' : 3 } ) ;
* // => { 'a': 1, 'b': 2 }
* /
var assignWith = createAssigner ( function ( object , source , srcIndex , customizer ) {
copyObject ( source , keys ( source ) , object , customizer ) ;
} ) ;
/ * *
* Creates an array of values corresponding to ` paths ` of ` object ` .
*
* @ static
* @ memberOf _
* @ since 1.0 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { ... ( string | string [ ] ) } [ paths ] The property paths to pick .
* @ returns { Array } Returns the picked values .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 3 } } , 4 ] } ;
*
* _ . at ( object , [ 'a[0].b.c' , 'a[1]' ] ) ;
* // => [3, 4]
* /
var at = flatRest ( baseAt ) ;
/ * *
* Creates an object that inherits from the ` prototype ` object . If a
* ` properties ` object is given , its own enumerable string keyed properties
* are assigned to the created object .
*
* @ static
* @ memberOf _
* @ since 2.3 . 0
* @ category Object
* @ param { Object } prototype The object to inherit from .
* @ param { Object } [ properties ] The properties to assign to the object .
* @ returns { Object } Returns the new object .
* @ example
*
* function Shape ( ) {
* this . x = 0 ;
* this . y = 0 ;
* }
*
* function Circle ( ) {
* Shape . call ( this ) ;
* }
*
* Circle . prototype = _ . create ( Shape . prototype , {
* 'constructor' : Circle
* } ) ;
*
* var circle = new Circle ;
* circle instanceof Circle ;
* // => true
*
* circle instanceof Shape ;
* // => true
* /
function create ( prototype , properties ) {
var result = baseCreate ( prototype ) ;
return properties == null ? result : baseAssign ( result , properties ) ;
}
/ * *
* Assigns own and inherited enumerable string keyed properties of source
* objects to the destination object for all destination properties that
* resolve to ` undefined ` . Source objects are applied from left to right .
* Once a property is set , additional values of the same property are ignored .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } [ sources ] The source objects .
* @ returns { Object } Returns ` object ` .
* @ see _ . defaultsDeep
* @ example
*
* _ . defaults ( { 'a' : 1 } , { 'b' : 2 } , { 'a' : 3 } ) ;
* // => { 'a': 1, 'b': 2 }
* /
var defaults = baseRest ( function ( args ) {
args . push ( undefined , customDefaultsAssignIn ) ;
return apply ( assignInWith , undefined , args ) ;
} ) ;
/ * *
* This method is like ` _.defaults ` except that it recursively assigns
* default properties .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 3.10 . 0
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } [ sources ] The source objects .
* @ returns { Object } Returns ` object ` .
* @ see _ . defaults
* @ example
*
* _ . defaultsDeep ( { 'a' : { 'b' : 2 } } , { 'a' : { 'b' : 1 , 'c' : 3 } } ) ;
* // => { 'a': { 'b': 2, 'c': 3 } }
* /
var defaultsDeep = baseRest ( function ( args ) {
args . push ( undefined , customDefaultsMerge ) ;
return apply ( mergeWith , undefined , args ) ;
} ) ;
/ * *
* This method is like ` _.find ` except that it returns the key of the first
* element ` predicate ` returns truthy for instead of the element itself .
*
* @ static
* @ memberOf _
* @ since 1.1 . 0
* @ category Object
* @ param { Object } object The object to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { string | undefined } Returns the key of the matched element ,
* else ` undefined ` .
* @ example
*
* var users = {
* 'barney' : { 'age' : 36 , 'active' : true } ,
* 'fred' : { 'age' : 40 , 'active' : false } ,
* 'pebbles' : { 'age' : 1 , 'active' : true }
* } ;
*
* _ . findKey ( users , function ( o ) { return o . age < 40 ; } ) ;
* // => 'barney' (iteration order is not guaranteed)
*
* // The `_.matches` iteratee shorthand.
* _ . findKey ( users , { 'age' : 1 , 'active' : true } ) ;
* // => 'pebbles'
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . findKey ( users , [ 'active' , false ] ) ;
* // => 'fred'
*
* // The `_.property` iteratee shorthand.
* _ . findKey ( users , 'active' ) ;
* // => 'barney'
* /
function findKey ( object , predicate ) {
return baseFindKey ( object , getIteratee ( predicate , 3 ) , baseForOwn ) ;
}
/ * *
* This method is like ` _.findKey ` except that it iterates over elements of
* a collection in the opposite order .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Object
* @ param { Object } object The object to inspect .
* @ param { Function } [ predicate = _ . identity ] The function invoked per iteration .
* @ returns { string | undefined } Returns the key of the matched element ,
* else ` undefined ` .
* @ example
*
* var users = {
* 'barney' : { 'age' : 36 , 'active' : true } ,
* 'fred' : { 'age' : 40 , 'active' : false } ,
* 'pebbles' : { 'age' : 1 , 'active' : true }
* } ;
*
* _ . findLastKey ( users , function ( o ) { return o . age < 40 ; } ) ;
* // => returns 'pebbles' assuming `_.findKey` returns 'barney'
*
* // The `_.matches` iteratee shorthand.
* _ . findLastKey ( users , { 'age' : 36 , 'active' : true } ) ;
* // => 'barney'
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . findLastKey ( users , [ 'active' , false ] ) ;
* // => 'fred'
*
* // The `_.property` iteratee shorthand.
* _ . findLastKey ( users , 'active' ) ;
* // => 'pebbles'
* /
function findLastKey ( object , predicate ) {
return baseFindKey ( object , getIteratee ( predicate , 3 ) , baseForOwnRight ) ;
}
/ * *
* Iterates over own and inherited enumerable string keyed properties of an
* object and invokes ` iteratee ` for each property . The iteratee is invoked
* with three arguments : ( value , key , object ) . Iteratee functions may exit
* iteration early by explicitly returning ` false ` .
*
* @ static
* @ memberOf _
* @ since 0.3 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* @ see _ . forInRight
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . forIn ( new Foo , function ( value , key ) {
* console . log ( key ) ;
* } ) ;
* // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
* /
function forIn ( object , iteratee ) {
return object == null ?
object :
baseFor ( object , getIteratee ( iteratee , 3 ) , keysIn ) ;
}
/ * *
* This method is like ` _.forIn ` except that it iterates over properties of
* ` object ` in the opposite order .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* @ see _ . forIn
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . forInRight ( new Foo , function ( value , key ) {
* console . log ( key ) ;
* } ) ;
* // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.
* /
function forInRight ( object , iteratee ) {
return object == null ?
object :
baseForRight ( object , getIteratee ( iteratee , 3 ) , keysIn ) ;
}
/ * *
* Iterates over own enumerable string keyed properties of an object and
* invokes ` iteratee ` for each property . The iteratee is invoked with three
* arguments : ( value , key , object ) . Iteratee functions may exit iteration
* early by explicitly returning ` false ` .
*
* @ static
* @ memberOf _
* @ since 0.3 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* @ see _ . forOwnRight
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . forOwn ( new Foo , function ( value , key ) {
* console . log ( key ) ;
* } ) ;
* // => Logs 'a' then 'b' (iteration order is not guaranteed).
* /
function forOwn ( object , iteratee ) {
return object && baseForOwn ( object , getIteratee ( iteratee , 3 ) ) ;
}
/ * *
* This method is like ` _.forOwn ` except that it iterates over properties of
* ` object ` in the opposite order .
*
* @ static
* @ memberOf _
* @ since 2.0 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns ` object ` .
* @ see _ . forOwn
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . forOwnRight ( new Foo , function ( value , key ) {
* console . log ( key ) ;
* } ) ;
* // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
* /
function forOwnRight ( object , iteratee ) {
return object && baseForOwnRight ( object , getIteratee ( iteratee , 3 ) ) ;
}
/ * *
* Creates an array of function property names from own enumerable properties
* of ` object ` .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The object to inspect .
* @ returns { Array } Returns the function names .
* @ see _ . functionsIn
* @ example
*
* function Foo ( ) {
* this . a = _ . constant ( 'a' ) ;
* this . b = _ . constant ( 'b' ) ;
* }
*
* Foo . prototype . c = _ . constant ( 'c' ) ;
*
* _ . functions ( new Foo ) ;
* // => ['a', 'b']
* /
function functions ( object ) {
return object == null ? [ ] : baseFunctions ( object , keys ( object ) ) ;
}
/ * *
* Creates an array of function property names from own and inherited
* enumerable properties of ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The object to inspect .
* @ returns { Array } Returns the function names .
* @ see _ . functions
* @ example
*
* function Foo ( ) {
* this . a = _ . constant ( 'a' ) ;
* this . b = _ . constant ( 'b' ) ;
* }
*
* Foo . prototype . c = _ . constant ( 'c' ) ;
*
* _ . functionsIn ( new Foo ) ;
* // => ['a', 'b', 'c']
* /
function functionsIn ( object ) {
return object == null ? [ ] : baseFunctions ( object , keysIn ( object ) ) ;
}
/ * *
* Gets the value at ` path ` of ` object ` . If the resolved value is
* ` undefined ` , the ` defaultValue ` is returned in its place .
*
* @ static
* @ memberOf _
* @ since 3.7 . 0
* @ category Object
* @ param { Object } object The object to query .
* @ param { Array | string } path The path of the property to get .
* @ param { * } [ defaultValue ] The value returned for ` undefined ` resolved values .
* @ returns { * } Returns the resolved value .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 3 } } ] } ;
*
* _ . get ( object , 'a[0].b.c' ) ;
* // => 3
*
* _ . get ( object , [ 'a' , '0' , 'b' , 'c' ] ) ;
* // => 3
*
* _ . get ( object , 'a.b.c' , 'default' ) ;
* // => 'default'
* /
function get ( object , path , defaultValue ) {
var result = object == null ? undefined : baseGet ( object , path ) ;
return result === undefined ? defaultValue : result ;
}
/ * *
* Checks if ` path ` is a direct property of ` object ` .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The object to query .
* @ param { Array | string } path The path to check .
* @ returns { boolean } Returns ` true ` if ` path ` exists , else ` false ` .
* @ example
*
* var object = { 'a' : { 'b' : 2 } } ;
* var other = _ . create ( { 'a' : _ . create ( { 'b' : 2 } ) } ) ;
*
* _ . has ( object , 'a' ) ;
* // => true
*
* _ . has ( object , 'a.b' ) ;
* // => true
*
* _ . has ( object , [ 'a' , 'b' ] ) ;
* // => true
*
* _ . has ( other , 'a' ) ;
* // => false
* /
function has ( object , path ) {
return object != null && hasPath ( object , path , baseHas ) ;
}
/ * *
* Checks if ` path ` is a direct or inherited property of ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The object to query .
* @ param { Array | string } path The path to check .
* @ returns { boolean } Returns ` true ` if ` path ` exists , else ` false ` .
* @ example
*
* var object = _ . create ( { 'a' : _ . create ( { 'b' : 2 } ) } ) ;
*
* _ . hasIn ( object , 'a' ) ;
* // => true
*
* _ . hasIn ( object , 'a.b' ) ;
* // => true
*
* _ . hasIn ( object , [ 'a' , 'b' ] ) ;
* // => true
*
* _ . hasIn ( object , 'b' ) ;
* // => false
* /
function hasIn ( object , path ) {
return object != null && hasPath ( object , path , baseHasIn ) ;
}
/ * *
* Creates an object composed of the inverted keys and values of ` object ` .
* If ` object ` contains duplicate values , subsequent values overwrite
* property assignments of previous values .
*
* @ static
* @ memberOf _
* @ since 0.7 . 0
* @ category Object
* @ param { Object } object The object to invert .
* @ returns { Object } Returns the new inverted object .
* @ example
*
* var object = { 'a' : 1 , 'b' : 2 , 'c' : 1 } ;
*
* _ . invert ( object ) ;
* // => { '1': 'c', '2': 'b' }
* /
var invert = createInverter ( function ( result , value , key ) {
result [ value ] = key ;
} , constant ( identity ) ) ;
/ * *
* This method is like ` _.invert ` except that the inverted object is generated
* from the results of running each element of ` object ` thru ` iteratee ` . The
* corresponding inverted value of each inverted key is an array of keys
* responsible for generating the inverted value . The iteratee is invoked
* with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.1 . 0
* @ category Object
* @ param { Object } object The object to invert .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { Object } Returns the new inverted object .
* @ example
*
* var object = { 'a' : 1 , 'b' : 2 , 'c' : 1 } ;
*
* _ . invertBy ( object ) ;
* // => { '1': ['a', 'c'], '2': ['b'] }
*
* _ . invertBy ( object , function ( value ) {
* return 'group' + value ;
* } ) ;
* // => { 'group1': ['a', 'c'], 'group2': ['b'] }
* /
var invertBy = createInverter ( function ( result , value , key ) {
if ( hasOwnProperty . call ( result , value ) ) {
result [ value ] . push ( key ) ;
} else {
result [ value ] = [ key ] ;
}
} , getIteratee ) ;
/ * *
* Invokes the method at ` path ` of ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The object to query .
* @ param { Array | string } path The path of the method to invoke .
* @ param { ... * } [ args ] The arguments to invoke the method with .
* @ returns { * } Returns the result of the invoked method .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : [ 1 , 2 , 3 , 4 ] } } ] } ;
*
* _ . invoke ( object , 'a[0].b.c.slice' , 1 , 3 ) ;
* // => [2, 3]
* /
var invoke = baseRest ( baseInvoke ) ;
/ * *
* Creates an array of the own enumerable property names of ` object ` .
*
* * * Note : * * Non - object values are coerced to objects . See the
* [ ES spec ] ( http : //ecma-international.org/ecma-262/7.0/#sec-object.keys)
* for more details .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . keys ( new Foo ) ;
* // => ['a', 'b'] (iteration order is not guaranteed)
*
* _ . keys ( 'hi' ) ;
* // => ['0', '1']
* /
function keys ( object ) {
return isArrayLike ( object ) ? arrayLikeKeys ( object ) : baseKeys ( object ) ;
}
/ * *
* Creates an array of the own and inherited enumerable property names of ` object ` .
*
* * * Note : * * Non - object values are coerced to objects .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property names .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . keysIn ( new Foo ) ;
* // => ['a', 'b', 'c'] (iteration order is not guaranteed)
* /
function keysIn ( object ) {
return isArrayLike ( object ) ? arrayLikeKeys ( object , true ) : baseKeysIn ( object ) ;
}
/ * *
* The opposite of ` _.mapValues ` ; this method creates an object with the
* same values as ` object ` and keys generated by running each own enumerable
* string keyed property of ` object ` thru ` iteratee ` . The iteratee is invoked
* with three arguments : ( value , key , object ) .
*
* @ static
* @ memberOf _
* @ since 3.8 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns the new mapped object .
* @ see _ . mapValues
* @ example
*
* _ . mapKeys ( { 'a' : 1 , 'b' : 2 } , function ( value , key ) {
* return key + value ;
* } ) ;
* // => { 'a1': 1, 'b2': 2 }
* /
function mapKeys ( object , iteratee ) {
var result = { } ;
iteratee = getIteratee ( iteratee , 3 ) ;
baseForOwn ( object , function ( value , key , object ) {
baseAssignValue ( result , iteratee ( value , key , object ) , value ) ;
} ) ;
return result ;
}
/ * *
* Creates an object with the same keys as ` object ` and values generated
* by running each own enumerable string keyed property of ` object ` thru
* ` iteratee ` . The iteratee is invoked with three arguments :
* ( value , key , object ) .
*
* @ static
* @ memberOf _
* @ since 2.4 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Object } Returns the new mapped object .
* @ see _ . mapKeys
* @ example
*
* var users = {
* 'fred' : { 'user' : 'fred' , 'age' : 40 } ,
* 'pebbles' : { 'user' : 'pebbles' , 'age' : 1 }
* } ;
*
* _ . mapValues ( users , function ( o ) { return o . age ; } ) ;
* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
*
* // The `_.property` iteratee shorthand.
* _ . mapValues ( users , 'age' ) ;
* // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
* /
function mapValues ( object , iteratee ) {
var result = { } ;
iteratee = getIteratee ( iteratee , 3 ) ;
baseForOwn ( object , function ( value , key , object ) {
baseAssignValue ( result , key , iteratee ( value , key , object ) ) ;
} ) ;
return result ;
}
/ * *
* This method is like ` _.assign ` except that it recursively merges own and
* inherited enumerable string keyed properties of source objects into the
* destination object . Source properties that resolve to ` undefined ` are
* skipped if a destination value exists . Array and plain object properties
* are merged recursively . Other objects and value types are overridden by
* assignment . Source objects are applied from left to right . Subsequent
* sources overwrite property assignments of previous sources .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 0.5 . 0
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } [ sources ] The source objects .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var object = {
* 'a' : [ { 'b' : 2 } , { 'd' : 4 } ]
* } ;
*
* var other = {
* 'a' : [ { 'c' : 3 } , { 'e' : 5 } ]
* } ;
*
* _ . merge ( object , other ) ;
* // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }
* /
var merge = createAssigner ( function ( object , source , srcIndex ) {
baseMerge ( object , source , srcIndex ) ;
} ) ;
/ * *
* This method is like ` _.merge ` except that it accepts ` customizer ` which
* is invoked to produce the merged values of the destination and source
* properties . If ` customizer ` returns ` undefined ` , merging is handled by the
* method instead . The ` customizer ` is invoked with six arguments :
* ( objValue , srcValue , key , object , source , stack ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The destination object .
* @ param { ... Object } sources The source objects .
* @ param { Function } customizer The function to customize assigned values .
* @ returns { Object } Returns ` object ` .
* @ example
*
* function customizer ( objValue , srcValue ) {
* if ( _ . isArray ( objValue ) ) {
* return objValue . concat ( srcValue ) ;
* }
* }
*
* var object = { 'a' : [ 1 ] , 'b' : [ 2 ] } ;
* var other = { 'a' : [ 3 ] , 'b' : [ 4 ] } ;
*
* _ . mergeWith ( object , other , customizer ) ;
* // => { 'a': [1, 3], 'b': [2, 4] }
* /
var mergeWith = createAssigner ( function ( object , source , srcIndex , customizer ) {
baseMerge ( object , source , srcIndex , customizer ) ;
} ) ;
/ * *
* The opposite of ` _.pick ` ; this method creates an object composed of the
* own and inherited enumerable property paths of ` object ` that are not omitted .
*
* * * Note : * * This method is considerably slower than ` _.pick ` .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The source object .
* @ param { ... ( string | string [ ] ) } [ paths ] The property paths to omit .
* @ returns { Object } Returns the new object .
* @ example
*
* var object = { 'a' : 1 , 'b' : '2' , 'c' : 3 } ;
*
* _ . omit ( object , [ 'a' , 'c' ] ) ;
* // => { 'b': '2' }
* /
var omit = flatRest ( function ( object , paths ) {
var result = { } ;
if ( object == null ) {
return result ;
}
var isDeep = false ;
paths = arrayMap ( paths , function ( path ) {
path = castPath ( path , object ) ;
isDeep || ( isDeep = path . length > 1 ) ;
return path ;
} ) ;
copyObject ( object , getAllKeysIn ( object ) , result ) ;
if ( isDeep ) {
result = baseClone ( result , CLONE _DEEP _FLAG | CLONE _FLAT _FLAG | CLONE _SYMBOLS _FLAG , customOmitClone ) ;
}
var length = paths . length ;
while ( length -- ) {
baseUnset ( result , paths [ length ] ) ;
}
return result ;
} ) ;
/ * *
* The opposite of ` _.pickBy ` ; this method creates an object composed of
* the own and inherited enumerable string keyed properties of ` object ` that
* ` predicate ` doesn ' t return truthy for . The predicate is invoked with two
* arguments : ( value , key ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The source object .
* @ param { Function } [ predicate = _ . identity ] The function invoked per property .
* @ returns { Object } Returns the new object .
* @ example
*
* var object = { 'a' : 1 , 'b' : '2' , 'c' : 3 } ;
*
* _ . omitBy ( object , _ . isNumber ) ;
* // => { 'b': '2' }
* /
function omitBy ( object , predicate ) {
return pickBy ( object , negate ( getIteratee ( predicate ) ) ) ;
}
/ * *
* Creates an object composed of the picked ` object ` properties .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The source object .
* @ param { ... ( string | string [ ] ) } [ paths ] The property paths to pick .
* @ returns { Object } Returns the new object .
* @ example
*
* var object = { 'a' : 1 , 'b' : '2' , 'c' : 3 } ;
*
* _ . pick ( object , [ 'a' , 'c' ] ) ;
* // => { 'a': 1, 'c': 3 }
* /
var pick = flatRest ( function ( object , paths ) {
return object == null ? { } : basePick ( object , paths ) ;
} ) ;
/ * *
* Creates an object composed of the ` object ` properties ` predicate ` returns
* truthy for . The predicate is invoked with two arguments : ( value , key ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The source object .
* @ param { Function } [ predicate = _ . identity ] The function invoked per property .
* @ returns { Object } Returns the new object .
* @ example
*
* var object = { 'a' : 1 , 'b' : '2' , 'c' : 3 } ;
*
* _ . pickBy ( object , _ . isNumber ) ;
* // => { 'a': 1, 'c': 3 }
* /
function pickBy ( object , predicate ) {
if ( object == null ) {
return { } ;
}
var props = arrayMap ( getAllKeysIn ( object ) , function ( prop ) {
return [ prop ] ;
} ) ;
predicate = getIteratee ( predicate ) ;
return basePickBy ( object , props , function ( value , path ) {
return predicate ( value , path [ 0 ] ) ;
} ) ;
}
/ * *
* This method is like ` _.get ` except that if the resolved value is a
* function it ' s invoked with the ` this ` binding of its parent object and
* its result is returned .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The object to query .
* @ param { Array | string } path The path of the property to resolve .
* @ param { * } [ defaultValue ] The value returned for ` undefined ` resolved values .
* @ returns { * } Returns the resolved value .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c1' : 3 , 'c2' : _ . constant ( 4 ) } } ] } ;
*
* _ . result ( object , 'a[0].b.c1' ) ;
* // => 3
*
* _ . result ( object , 'a[0].b.c2' ) ;
* // => 4
*
* _ . result ( object , 'a[0].b.c3' , 'default' ) ;
* // => 'default'
*
* _ . result ( object , 'a[0].b.c3' , _ . constant ( 'default' ) ) ;
* // => 'default'
* /
function result ( object , path , defaultValue ) {
path = castPath ( path , object ) ;
var index = - 1 ,
length = path . length ;
// Ensure the loop is entered when path is empty.
if ( ! length ) {
length = 1 ;
object = undefined ;
}
while ( ++ index < length ) {
var value = object == null ? undefined : object [ toKey ( path [ index ] ) ] ;
if ( value === undefined ) {
index = length ;
value = defaultValue ;
}
object = isFunction ( value ) ? value . call ( object ) : value ;
}
return object ;
}
/ * *
* Sets the value at ` path ` of ` object ` . If a portion of ` path ` doesn ' t exist ,
* it ' s created . Arrays are created for missing index properties while objects
* are created for all other missing properties . Use ` _.setWith ` to customize
* ` path ` creation .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 3.7 . 0
* @ category Object
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to set .
* @ param { * } value The value to set .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 3 } } ] } ;
*
* _ . set ( object , 'a[0].b.c' , 4 ) ;
* console . log ( object . a [ 0 ] . b . c ) ;
* // => 4
*
* _ . set ( object , [ 'x' , '0' , 'y' , 'z' ] , 5 ) ;
* console . log ( object . x [ 0 ] . y . z ) ;
* // => 5
* /
function set ( object , path , value ) {
return object == null ? object : baseSet ( object , path , value ) ;
}
/ * *
* This method is like ` _.set ` except that it accepts ` customizer ` which is
* invoked to produce the objects of ` path ` . If ` customizer ` returns ` undefined `
* path creation is handled by the method instead . The ` customizer ` is invoked
* with three arguments : ( nsValue , key , nsObject ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to set .
* @ param { * } value The value to set .
* @ param { Function } [ customizer ] The function to customize assigned values .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var object = { } ;
*
* _ . setWith ( object , '[0][1]' , 'a' , Object ) ;
* // => { '0': { '1': 'a' } }
* /
function setWith ( object , path , value , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
return object == null ? object : baseSet ( object , path , value , customizer ) ;
}
/ * *
* Creates an array of own enumerable string keyed - value pairs for ` object `
* which can be consumed by ` _.fromPairs ` . If ` object ` is a map or set , its
* entries are returned .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ alias entries
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the key - value pairs .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . toPairs ( new Foo ) ;
* // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
* /
var toPairs = createToPairs ( keys ) ;
/ * *
* Creates an array of own and inherited enumerable string keyed - value pairs
* for ` object ` which can be consumed by ` _.fromPairs ` . If ` object ` is a map
* or set , its entries are returned .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ alias entriesIn
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the key - value pairs .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . toPairsIn ( new Foo ) ;
* // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)
* /
var toPairsIn = createToPairs ( keysIn ) ;
/ * *
* An alternative to ` _.reduce ` ; this method transforms ` object ` to a new
* ` accumulator ` object which is the result of running each of its own
* enumerable string keyed properties thru ` iteratee ` , with each invocation
* potentially mutating the ` accumulator ` object . If ` accumulator ` is not
* provided , a new object with the same ` [[Prototype]] ` will be used . The
* iteratee is invoked with four arguments : ( accumulator , value , key , object ) .
* Iteratee functions may exit iteration early by explicitly returning ` false ` .
*
* @ static
* @ memberOf _
* @ since 1.3 . 0
* @ category Object
* @ param { Object } object The object to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ param { * } [ accumulator ] The custom accumulator value .
* @ returns { * } Returns the accumulated value .
* @ example
*
* _ . transform ( [ 2 , 3 , 4 ] , function ( result , n ) {
* result . push ( n *= n ) ;
* return n % 2 == 0 ;
* } , [ ] ) ;
* // => [4, 9]
*
* _ . transform ( { 'a' : 1 , 'b' : 2 , 'c' : 1 } , function ( result , value , key ) {
* ( result [ value ] || ( result [ value ] = [ ] ) ) . push ( key ) ;
* } , { } ) ;
* // => { '1': ['a', 'c'], '2': ['b'] }
* /
function transform ( object , iteratee , accumulator ) {
var isArr = isArray ( object ) ,
isArrLike = isArr || isBuffer ( object ) || isTypedArray ( object ) ;
iteratee = getIteratee ( iteratee , 4 ) ;
if ( accumulator == null ) {
var Ctor = object && object . constructor ;
if ( isArrLike ) {
accumulator = isArr ? new Ctor : [ ] ;
} else if ( isObject ( object ) ) {
accumulator = isFunction ( Ctor ) ? baseCreate ( getPrototype ( object ) ) : { } ;
} else {
accumulator = { } ;
}
}
( isArrLike ? arrayEach : baseForOwn ) ( object , function ( value , index , object ) {
return iteratee ( accumulator , value , index , object ) ;
} ) ;
return accumulator ;
}
/ * *
* Removes the property at ` path ` of ` object ` .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Object
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to unset .
* @ returns { boolean } Returns ` true ` if the property is deleted , else ` false ` .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 7 } } ] } ;
* _ . unset ( object , 'a[0].b.c' ) ;
* // => true
*
* console . log ( object ) ;
* // => { 'a': [{ 'b': {} }] };
*
* _ . unset ( object , [ 'a' , '0' , 'b' , 'c' ] ) ;
* // => true
*
* console . log ( object ) ;
* // => { 'a': [{ 'b': {} }] };
* /
function unset ( object , path ) {
return object == null ? true : baseUnset ( object , path ) ;
}
/ * *
* This method is like ` _.set ` except that accepts ` updater ` to produce the
* value to set . Use ` _.updateWith ` to customize ` path ` creation . The ` updater `
* is invoked with one argument : ( value ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.6 . 0
* @ category Object
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to set .
* @ param { Function } updater The function to produce the updated value .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var object = { 'a' : [ { 'b' : { 'c' : 3 } } ] } ;
*
* _ . update ( object , 'a[0].b.c' , function ( n ) { return n * n ; } ) ;
* console . log ( object . a [ 0 ] . b . c ) ;
* // => 9
*
* _ . update ( object , 'x[0].y.z' , function ( n ) { return n ? n + 1 : 0 ; } ) ;
* console . log ( object . x [ 0 ] . y . z ) ;
* // => 0
* /
function update ( object , path , updater ) {
return object == null ? object : baseUpdate ( object , path , castFunction ( updater ) ) ;
}
/ * *
* This method is like ` _.update ` except that it accepts ` customizer ` which is
* invoked to produce the objects of ` path ` . If ` customizer ` returns ` undefined `
* path creation is handled by the method instead . The ` customizer ` is invoked
* with three arguments : ( nsValue , key , nsObject ) .
*
* * * Note : * * This method mutates ` object ` .
*
* @ static
* @ memberOf _
* @ since 4.6 . 0
* @ category Object
* @ param { Object } object The object to modify .
* @ param { Array | string } path The path of the property to set .
* @ param { Function } updater The function to produce the updated value .
* @ param { Function } [ customizer ] The function to customize assigned values .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var object = { } ;
*
* _ . updateWith ( object , '[0][1]' , _ . constant ( 'a' ) , Object ) ;
* // => { '0': { '1': 'a' } }
* /
function updateWith ( object , path , updater , customizer ) {
customizer = typeof customizer == 'function' ? customizer : undefined ;
return object == null ? object : baseUpdate ( object , path , castFunction ( updater ) , customizer ) ;
}
/ * *
* Creates an array of the own enumerable string keyed property values of ` object ` .
*
* * * Note : * * Non - object values are coerced to objects .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property values .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . values ( new Foo ) ;
* // => [1, 2] (iteration order is not guaranteed)
*
* _ . values ( 'hi' ) ;
* // => ['h', 'i']
* /
function values ( object ) {
return object == null ? [ ] : baseValues ( object , keys ( object ) ) ;
}
/ * *
* Creates an array of the own and inherited enumerable string keyed property
* values of ` object ` .
*
* * * Note : * * Non - object values are coerced to objects .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Object
* @ param { Object } object The object to query .
* @ returns { Array } Returns the array of property values .
* @ example
*
* function Foo ( ) {
* this . a = 1 ;
* this . b = 2 ;
* }
*
* Foo . prototype . c = 3 ;
*
* _ . valuesIn ( new Foo ) ;
* // => [1, 2, 3] (iteration order is not guaranteed)
* /
function valuesIn ( object ) {
return object == null ? [ ] : baseValues ( object , keysIn ( object ) ) ;
}
/*------------------------------------------------------------------------*/
/ * *
* Clamps ` number ` within the inclusive ` lower ` and ` upper ` bounds .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Number
* @ param { number } number The number to clamp .
* @ param { number } [ lower ] The lower bound .
* @ param { number } upper The upper bound .
* @ returns { number } Returns the clamped number .
* @ example
*
* _ . clamp ( - 10 , - 5 , 5 ) ;
* // => -5
*
* _ . clamp ( 10 , - 5 , 5 ) ;
* // => 5
* /
function clamp ( number , lower , upper ) {
if ( upper === undefined ) {
upper = lower ;
lower = undefined ;
}
if ( upper !== undefined ) {
upper = toNumber ( upper ) ;
upper = upper === upper ? upper : 0 ;
}
if ( lower !== undefined ) {
lower = toNumber ( lower ) ;
lower = lower === lower ? lower : 0 ;
}
return baseClamp ( toNumber ( number ) , lower , upper ) ;
}
/ * *
* Checks if ` n ` is between ` start ` and up to , but not including , ` end ` . If
* ` end ` is not specified , it ' s set to ` start ` with ` start ` then set to ` 0 ` .
* If ` start ` is greater than ` end ` the params are swapped to support
* negative ranges .
*
* @ static
* @ memberOf _
* @ since 3.3 . 0
* @ category Number
* @ param { number } number The number to check .
* @ param { number } [ start = 0 ] The start of the range .
* @ param { number } end The end of the range .
* @ returns { boolean } Returns ` true ` if ` number ` is in the range , else ` false ` .
* @ see _ . range , _ . rangeRight
* @ example
*
* _ . inRange ( 3 , 2 , 4 ) ;
* // => true
*
* _ . inRange ( 4 , 8 ) ;
* // => true
*
* _ . inRange ( 4 , 2 ) ;
* // => false
*
* _ . inRange ( 2 , 2 ) ;
* // => false
*
* _ . inRange ( 1.2 , 2 ) ;
* // => true
*
* _ . inRange ( 5.2 , 4 ) ;
* // => false
*
* _ . inRange ( - 3 , - 2 , - 6 ) ;
* // => true
* /
function inRange ( number , start , end ) {
start = toFinite ( start ) ;
if ( end === undefined ) {
end = start ;
start = 0 ;
} else {
end = toFinite ( end ) ;
}
number = toNumber ( number ) ;
return baseInRange ( number , start , end ) ;
}
/ * *
* Produces a random number between the inclusive ` lower ` and ` upper ` bounds .
* If only one argument is provided a number between ` 0 ` and the given number
* is returned . If ` floating ` is ` true ` , or either ` lower ` or ` upper ` are
* floats , a floating - point number is returned instead of an integer .
*
* * * Note : * * JavaScript follows the IEEE - 754 standard for resolving
* floating - point values which can produce unexpected results .
*
* @ static
* @ memberOf _
* @ since 0.7 . 0
* @ category Number
* @ param { number } [ lower = 0 ] The lower bound .
* @ param { number } [ upper = 1 ] The upper bound .
* @ param { boolean } [ floating ] Specify returning a floating - point number .
* @ returns { number } Returns the random number .
* @ example
*
* _ . random ( 0 , 5 ) ;
* // => an integer between 0 and 5
*
* _ . random ( 5 ) ;
* // => also an integer between 0 and 5
*
* _ . random ( 5 , true ) ;
* // => a floating-point number between 0 and 5
*
* _ . random ( 1.2 , 5.2 ) ;
* // => a floating-point number between 1.2 and 5.2
* /
function random ( lower , upper , floating ) {
if ( floating && typeof floating != 'boolean' && isIterateeCall ( lower , upper , floating ) ) {
upper = floating = undefined ;
}
if ( floating === undefined ) {
if ( typeof upper == 'boolean' ) {
floating = upper ;
upper = undefined ;
} else if ( typeof lower == 'boolean' ) {
floating = lower ;
lower = undefined ;
}
}
if ( lower === undefined && upper === undefined ) {
lower = 0 ;
upper = 1 ;
} else {
lower = toFinite ( lower ) ;
if ( upper === undefined ) {
upper = lower ;
lower = 0 ;
} else {
upper = toFinite ( upper ) ;
}
}
if ( lower > upper ) {
var temp = lower ;
lower = upper ;
upper = temp ;
}
if ( floating || lower % 1 || upper % 1 ) {
var rand = nativeRandom ( ) ;
return nativeMin ( lower + ( rand * ( upper - lower + freeParseFloat ( '1e-' + ( ( rand + '' ) . length - 1 ) ) ) ) , upper ) ;
}
return baseRandom ( lower , upper ) ;
}
/*------------------------------------------------------------------------*/
/ * *
* Converts ` string ` to [ camel case ] ( https : //en.wikipedia.org/wiki/CamelCase).
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the camel cased string .
* @ example
*
* _ . camelCase ( 'Foo Bar' ) ;
* // => 'fooBar'
*
* _ . camelCase ( '--foo-bar--' ) ;
* // => 'fooBar'
*
* _ . camelCase ( '__FOO_BAR__' ) ;
* // => 'fooBar'
* /
var camelCase = createCompounder ( function ( result , word , index ) {
word = word . toLowerCase ( ) ;
return result + ( index ? capitalize ( word ) : word ) ;
} ) ;
/ * *
* Converts the first character of ` string ` to upper case and the remaining
* to lower case .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to capitalize .
* @ returns { string } Returns the capitalized string .
* @ example
*
* _ . capitalize ( 'FRED' ) ;
* // => 'Fred'
* /
function capitalize ( string ) {
return upperFirst ( toString ( string ) . toLowerCase ( ) ) ;
}
/ * *
* Deburrs ` string ` by converting
* [ Latin - 1 Supplement ] ( https : //en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
* and [ Latin Extended - A ] ( https : //en.wikipedia.org/wiki/Latin_Extended-A)
* letters to basic Latin letters and removing
* [ combining diacritical marks ] ( https : //en.wikipedia.org/wiki/Combining_Diacritical_Marks).
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to deburr .
* @ returns { string } Returns the deburred string .
* @ example
*
* _ . deburr ( 'déjà vu' ) ;
* // => 'deja vu'
* /
function deburr ( string ) {
string = toString ( string ) ;
return string && string . replace ( reLatin , deburrLetter ) . replace ( reComboMark , '' ) ;
}
/ * *
* Checks if ` string ` ends with the given target string .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to inspect .
* @ param { string } [ target ] The string to search for .
* @ param { number } [ position = string . length ] The position to search up to .
* @ returns { boolean } Returns ` true ` if ` string ` ends with ` target ` ,
* else ` false ` .
* @ example
*
* _ . endsWith ( 'abc' , 'c' ) ;
* // => true
*
* _ . endsWith ( 'abc' , 'b' ) ;
* // => false
*
* _ . endsWith ( 'abc' , 'b' , 2 ) ;
* // => true
* /
function endsWith ( string , target , position ) {
string = toString ( string ) ;
target = baseToString ( target ) ;
var length = string . length ;
position = position === undefined ?
length :
baseClamp ( toInteger ( position ) , 0 , length ) ;
var end = position ;
position -= target . length ;
return position >= 0 && string . slice ( position , end ) == target ;
}
/ * *
* Converts the characters "&" , "<" , ">" , '"' , and "'" in ` string ` to their
* corresponding HTML entities .
*
* * * Note : * * No other characters are escaped . To escape additional
* characters use a third - party library like [ _he _ ] ( https : //mths.be/he).
*
* Though the ">" character is escaped for symmetry , characters like
* ">" and "/" don ' t need escaping in HTML and have no special meaning
* unless they ' re part of a tag or unquoted attribute value . See
* [ Mathias Bynens ' s article ] ( https : //mathiasbynens.be/notes/ambiguous-ampersands)
* ( under "semi-related fun fact" ) for more details .
*
* When working with HTML you should always
* [ quote attribute values ] ( http : //wonko.com/post/html-escaping) to reduce
* XSS vectors .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category String
* @ param { string } [ string = '' ] The string to escape .
* @ returns { string } Returns the escaped string .
* @ example
*
* _ . escape ( 'fred, barney, & pebbles' ) ;
* // => 'fred, barney, & pebbles'
* /
function escape ( string ) {
string = toString ( string ) ;
return ( string && reHasUnescapedHtml . test ( string ) ) ?
string . replace ( reUnescapedHtml , escapeHtmlChar ) :
string ;
}
/ * *
* Escapes the ` RegExp ` special characters "^" , "$" , "\", " . ", " * ", " + " ,
* "?" , "(" , ")" , "[" , "]" , "{" , "}" , and "|" in ` string ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to escape .
* @ returns { string } Returns the escaped string .
* @ example
*
* _ . escapeRegExp ( '[lodash](https://lodash.com/)' ) ;
* // => '\[lodash\]\(https://lodash\.com/\)'
* /
function escapeRegExp ( string ) {
string = toString ( string ) ;
return ( string && reHasRegExpChar . test ( string ) ) ?
string . replace ( reRegExpChar , '\\$&' ) :
string ;
}
/ * *
* Converts ` string ` to
* [ kebab case ] ( https : //en.wikipedia.org/wiki/Letter_case#Special_case_styles).
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the kebab cased string .
* @ example
*
* _ . kebabCase ( 'Foo Bar' ) ;
* // => 'foo-bar'
*
* _ . kebabCase ( 'fooBar' ) ;
* // => 'foo-bar'
*
* _ . kebabCase ( '__FOO_BAR__' ) ;
* // => 'foo-bar'
* /
var kebabCase = createCompounder ( function ( result , word , index ) {
return result + ( index ? '-' : '' ) + word . toLowerCase ( ) ;
} ) ;
/ * *
* Converts ` string ` , as space separated words , to lower case .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the lower cased string .
* @ example
*
* _ . lowerCase ( '--Foo-Bar--' ) ;
* // => 'foo bar'
*
* _ . lowerCase ( 'fooBar' ) ;
* // => 'foo bar'
*
* _ . lowerCase ( '__FOO_BAR__' ) ;
* // => 'foo bar'
* /
var lowerCase = createCompounder ( function ( result , word , index ) {
return result + ( index ? ' ' : '' ) + word . toLowerCase ( ) ;
} ) ;
/ * *
* Converts the first character of ` string ` to lower case .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the converted string .
* @ example
*
* _ . lowerFirst ( 'Fred' ) ;
* // => 'fred'
*
* _ . lowerFirst ( 'FRED' ) ;
* // => 'fRED'
* /
var lowerFirst = createCaseFirst ( 'toLowerCase' ) ;
/ * *
* Pads ` string ` on the left and right sides if it ' s shorter than ` length ` .
* Padding characters are truncated if they can ' t be evenly divided by ` length ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to pad .
* @ param { number } [ length = 0 ] The padding length .
* @ param { string } [ chars = ' ' ] The string used as padding .
* @ returns { string } Returns the padded string .
* @ example
*
* _ . pad ( 'abc' , 8 ) ;
* // => ' abc '
*
* _ . pad ( 'abc' , 8 , '_-' ) ;
* // => '_-abc_-_'
*
* _ . pad ( 'abc' , 3 ) ;
* // => 'abc'
* /
function pad ( string , length , chars ) {
string = toString ( string ) ;
length = toInteger ( length ) ;
var strLength = length ? stringSize ( string ) : 0 ;
if ( ! length || strLength >= length ) {
return string ;
}
var mid = ( length - strLength ) / 2 ;
return (
createPadding ( nativeFloor ( mid ) , chars ) +
string +
createPadding ( nativeCeil ( mid ) , chars )
) ;
}
/ * *
* Pads ` string ` on the right side if it ' s shorter than ` length ` . Padding
* characters are truncated if they exceed ` length ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to pad .
* @ param { number } [ length = 0 ] The padding length .
* @ param { string } [ chars = ' ' ] The string used as padding .
* @ returns { string } Returns the padded string .
* @ example
*
* _ . padEnd ( 'abc' , 6 ) ;
* // => 'abc '
*
* _ . padEnd ( 'abc' , 6 , '_-' ) ;
* // => 'abc_-_'
*
* _ . padEnd ( 'abc' , 3 ) ;
* // => 'abc'
* /
function padEnd ( string , length , chars ) {
string = toString ( string ) ;
length = toInteger ( length ) ;
var strLength = length ? stringSize ( string ) : 0 ;
return ( length && strLength < length ) ?
( string + createPadding ( length - strLength , chars ) ) :
string ;
}
/ * *
* Pads ` string ` on the left side if it ' s shorter than ` length ` . Padding
* characters are truncated if they exceed ` length ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to pad .
* @ param { number } [ length = 0 ] The padding length .
* @ param { string } [ chars = ' ' ] The string used as padding .
* @ returns { string } Returns the padded string .
* @ example
*
* _ . padStart ( 'abc' , 6 ) ;
* // => ' abc'
*
* _ . padStart ( 'abc' , 6 , '_-' ) ;
* // => '_-_abc'
*
* _ . padStart ( 'abc' , 3 ) ;
* // => 'abc'
* /
function padStart ( string , length , chars ) {
string = toString ( string ) ;
length = toInteger ( length ) ;
var strLength = length ? stringSize ( string ) : 0 ;
return ( length && strLength < length ) ?
( createPadding ( length - strLength , chars ) + string ) :
string ;
}
/ * *
* Converts ` string ` to an integer of the specified radix . If ` radix ` is
* ` undefined ` or ` 0 ` , a ` radix ` of ` 10 ` is used unless ` value ` is a
* hexadecimal , in which case a ` radix ` of ` 16 ` is used .
*
* * * Note : * * This method aligns with the
* [ ES5 implementation ] ( https : //es5.github.io/#x15.1.2.2) of `parseInt`.
*
* @ static
* @ memberOf _
* @ since 1.1 . 0
* @ category String
* @ param { string } string The string to convert .
* @ param { number } [ radix = 10 ] The radix to interpret ` value ` by .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { number } Returns the converted integer .
* @ example
*
* _ . parseInt ( '08' ) ;
* // => 8
*
* _ . map ( [ '6' , '08' , '10' ] , _ . parseInt ) ;
* // => [6, 8, 10]
* /
function parseInt ( string , radix , guard ) {
if ( guard || radix == null ) {
radix = 0 ;
} else if ( radix ) {
radix = + radix ;
}
return nativeParseInt ( toString ( string ) . replace ( reTrimStart , '' ) , radix || 0 ) ;
}
/ * *
* Repeats the given string ` n ` times .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to repeat .
* @ param { number } [ n = 1 ] The number of times to repeat the string .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { string } Returns the repeated string .
* @ example
*
* _ . repeat ( '*' , 3 ) ;
* // => '***'
*
* _ . repeat ( 'abc' , 2 ) ;
* // => 'abcabc'
*
* _ . repeat ( 'abc' , 0 ) ;
* // => ''
* /
function repeat ( string , n , guard ) {
if ( ( guard ? isIterateeCall ( string , n , guard ) : n === undefined ) ) {
n = 1 ;
} else {
n = toInteger ( n ) ;
}
return baseRepeat ( toString ( string ) , n ) ;
}
/ * *
* Replaces matches for ` pattern ` in ` string ` with ` replacement ` .
*
* * * Note : * * This method is based on
* [ ` String#replace ` ] ( https : //mdn.io/String/replace).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to modify .
* @ param { RegExp | string } pattern The pattern to replace .
* @ param { Function | string } replacement The match replacement .
* @ returns { string } Returns the modified string .
* @ example
*
* _ . replace ( 'Hi Fred' , 'Fred' , 'Barney' ) ;
* // => 'Hi Barney'
* /
function replace ( ) {
var args = arguments ,
string = toString ( args [ 0 ] ) ;
return args . length < 3 ? string : string . replace ( args [ 1 ] , args [ 2 ] ) ;
}
/ * *
* Converts ` string ` to
* [ snake case ] ( https : //en.wikipedia.org/wiki/Snake_case).
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the snake cased string .
* @ example
*
* _ . snakeCase ( 'Foo Bar' ) ;
* // => 'foo_bar'
*
* _ . snakeCase ( 'fooBar' ) ;
* // => 'foo_bar'
*
* _ . snakeCase ( '--FOO-BAR--' ) ;
* // => 'foo_bar'
* /
var snakeCase = createCompounder ( function ( result , word , index ) {
return result + ( index ? '_' : '' ) + word . toLowerCase ( ) ;
} ) ;
/ * *
* Splits ` string ` by ` separator ` .
*
* * * Note : * * This method is based on
* [ ` String#split ` ] ( https : //mdn.io/String/split).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to split .
* @ param { RegExp | string } separator The separator pattern to split by .
* @ param { number } [ limit ] The length to truncate results to .
* @ returns { Array } Returns the string segments .
* @ example
*
* _ . split ( 'a-b-c' , '-' , 2 ) ;
* // => ['a', 'b']
* /
function split ( string , separator , limit ) {
if ( limit && typeof limit != 'number' && isIterateeCall ( string , separator , limit ) ) {
separator = limit = undefined ;
}
limit = limit === undefined ? MAX _ARRAY _LENGTH : limit >>> 0 ;
if ( ! limit ) {
return [ ] ;
}
string = toString ( string ) ;
if ( string && (
typeof separator == 'string' ||
( separator != null && ! isRegExp ( separator ) )
) ) {
separator = baseToString ( separator ) ;
if ( ! separator && hasUnicode ( string ) ) {
return castSlice ( stringToArray ( string ) , 0 , limit ) ;
}
}
return string . split ( separator , limit ) ;
}
/ * *
* Converts ` string ` to
* [ start case ] ( https : //en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
*
* @ static
* @ memberOf _
* @ since 3.1 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the start cased string .
* @ example
*
* _ . startCase ( '--foo-bar--' ) ;
* // => 'Foo Bar'
*
* _ . startCase ( 'fooBar' ) ;
* // => 'Foo Bar'
*
* _ . startCase ( '__FOO_BAR__' ) ;
* // => 'FOO BAR'
* /
var startCase = createCompounder ( function ( result , word , index ) {
return result + ( index ? ' ' : '' ) + upperFirst ( word ) ;
} ) ;
/ * *
* Checks if ` string ` starts with the given target string .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to inspect .
* @ param { string } [ target ] The string to search for .
* @ param { number } [ position = 0 ] The position to search from .
* @ returns { boolean } Returns ` true ` if ` string ` starts with ` target ` ,
* else ` false ` .
* @ example
*
* _ . startsWith ( 'abc' , 'a' ) ;
* // => true
*
* _ . startsWith ( 'abc' , 'b' ) ;
* // => false
*
* _ . startsWith ( 'abc' , 'b' , 1 ) ;
* // => true
* /
function startsWith ( string , target , position ) {
string = toString ( string ) ;
position = position == null ?
0 :
baseClamp ( toInteger ( position ) , 0 , string . length ) ;
target = baseToString ( target ) ;
return string . slice ( position , position + target . length ) == target ;
}
/ * *
* Creates a compiled template function that can interpolate data properties
* in "interpolate" delimiters , HTML - escape interpolated data properties in
* "escape" delimiters , and execute JavaScript in "evaluate" delimiters . Data
* properties may be accessed as free variables in the template . If a setting
* object is given , it takes precedence over ` _.templateSettings ` values .
*
* * * Note : * * In the development build ` _.template ` utilizes
* [ sourceURLs ] ( http : //www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
* for easier debugging .
*
* For more information on precompiling templates see
* [ lodash ' s custom builds documentation ] ( https : //lodash.com/custom-builds).
*
* For more information on Chrome extension sandboxes see
* [ Chrome ' s extensions documentation ] ( https : //developer.chrome.com/extensions/sandboxingEval).
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category String
* @ param { string } [ string = '' ] The template string .
* @ param { Object } [ options = { } ] The options object .
* @ param { RegExp } [ options . escape = _ . templateSettings . escape ]
* The HTML "escape" delimiter .
* @ param { RegExp } [ options . evaluate = _ . templateSettings . evaluate ]
* The "evaluate" delimiter .
* @ param { Object } [ options . imports = _ . templateSettings . imports ]
* An object to import into the template as free variables .
* @ param { RegExp } [ options . interpolate = _ . templateSettings . interpolate ]
* The "interpolate" delimiter .
* @ param { string } [ options . sourceURL = 'lodash.templateSources[n]' ]
* The sourceURL of the compiled template .
* @ param { string } [ options . variable = 'obj' ]
* The data object variable name .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Function } Returns the compiled template function .
* @ example
*
* // Use the "interpolate" delimiter to create a compiled template.
* var compiled = _ . template ( 'hello <%= user %>!' ) ;
* compiled ( { 'user' : 'fred' } ) ;
* // => 'hello fred!'
*
* // Use the HTML "escape" delimiter to escape data property values.
* var compiled = _ . template ( '<b><%- value %></b>' ) ;
* compiled ( { 'value' : '<script>' } ) ;
* // => '<b><script></b>'
*
* // Use the "evaluate" delimiter to execute JavaScript and generate HTML.
* var compiled = _ . template ( '<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>' ) ;
* compiled ( { 'users' : [ 'fred' , 'barney' ] } ) ;
* // => '<li>fred</li><li>barney</li>'
*
* // Use the internal `print` function in "evaluate" delimiters.
* var compiled = _ . template ( '<% print("hello " + user); %>!' ) ;
* compiled ( { 'user' : 'barney' } ) ;
* // => 'hello barney!'
*
* // Use the ES template literal delimiter as an "interpolate" delimiter.
* // Disable support by replacing the "interpolate" delimiter.
* var compiled = _ . template ( 'hello ${ user }!' ) ;
* compiled ( { 'user' : 'pebbles' } ) ;
* // => 'hello pebbles!'
*
* // Use backslashes to treat delimiters as plain text.
* var compiled = _ . template ( '<%= "\\<%- value %\\>" %>' ) ;
* compiled ( { 'value' : 'ignored' } ) ;
* // => '<%- value %>'
*
* // Use the `imports` option to import `jQuery` as `jq`.
* var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>' ;
* var compiled = _ . template ( text , { 'imports' : { 'jq' : jQuery } } ) ;
* compiled ( { 'users' : [ 'fred' , 'barney' ] } ) ;
* // => '<li>fred</li><li>barney</li>'
*
* // Use the `sourceURL` option to specify a custom sourceURL for the template.
* var compiled = _ . template ( 'hello <%= user %>!' , { 'sourceURL' : '/basic/greeting.jst' } ) ;
* compiled ( data ) ;
* // => Find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector.
*
* // Use the `variable` option to ensure a with-statement isn't used in the compiled template.
* var compiled = _ . template ( 'hi <%= data.user %>!' , { 'variable' : 'data' } ) ;
* compiled . source ;
* // => function(data) {
* // var __t, __p = '';
* // __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
* // return __p;
* // }
*
* // Use custom template delimiters.
* _ . templateSettings . interpolate = /{{([\s\S]+?)}}/g ;
* var compiled = _ . template ( 'hello {{ user }}!' ) ;
* compiled ( { 'user' : 'mustache' } ) ;
* // => 'hello mustache!'
*
* // Use the `source` property to inline compiled templates for meaningful
* // line numbers in error messages and stack traces.
* fs . writeFileSync ( path . join ( process . cwd ( ) , 'jst.js' ) , ' \
* var JST = { \
* "main" : ' + _.template(mainText).source + ' \
* } ; \
* ' ) ;
* /
function template ( string , options , guard ) {
// Based on John Resig's `tmpl` implementation
// (http://ejohn.org/blog/javascript-micro-templating/)
// and Laura Doktorova's doT.js (https://github.com/olado/doT).
var settings = lodash . templateSettings ;
if ( guard && isIterateeCall ( string , options , guard ) ) {
options = undefined ;
}
string = toString ( string ) ;
options = assignInWith ( { } , options , settings , customDefaultsAssignIn ) ;
var imports = assignInWith ( { } , options . imports , settings . imports , customDefaultsAssignIn ) ,
importsKeys = keys ( imports ) ,
importsValues = baseValues ( imports , importsKeys ) ;
var isEscaping ,
isEvaluating ,
index = 0 ,
interpolate = options . interpolate || reNoMatch ,
source = "__p += '" ;
// Compile the regexp to match each delimiter.
var reDelimiters = RegExp (
( options . escape || reNoMatch ) . source + '|' +
interpolate . source + '|' +
( interpolate === reInterpolate ? reEsTemplate : reNoMatch ) . source + '|' +
( options . evaluate || reNoMatch ) . source + '|$' , 'g' ) ;
// Use a sourceURL for easier debugging.
var sourceURL = '//# sourceURL=' +
( 'sourceURL' in options ?
options . sourceURL :
( 'lodash.templateSources[' + ( ++ templateCounter ) + ']' )
) + '\n' ;
string . replace ( reDelimiters , function ( match , escapeValue , interpolateValue , esTemplateValue , evaluateValue , offset ) {
interpolateValue || ( interpolateValue = esTemplateValue ) ;
// Escape characters that can't be included in string literals.
source += string . slice ( index , offset ) . replace ( reUnescapedString , escapeStringChar ) ;
// Replace delimiters with snippets.
if ( escapeValue ) {
isEscaping = true ;
source += "' +\n__e(" + escapeValue + ") +\n'" ;
}
if ( evaluateValue ) {
isEvaluating = true ;
source += "';\n" + evaluateValue + ";\n__p += '" ;
}
if ( interpolateValue ) {
source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'" ;
}
index = offset + match . length ;
// The JS engine embedded in Adobe products needs `match` returned in
// order to produce the correct `offset` value.
return match ;
} ) ;
source += "';\n" ;
// If `variable` is not specified wrap a with-statement around the generated
// code to add the data object to the top of the scope chain.
var variable = options . variable ;
if ( ! variable ) {
source = 'with (obj) {\n' + source + '\n}\n' ;
}
// Cleanup code by stripping empty strings.
source = ( isEvaluating ? source . replace ( reEmptyStringLeading , '' ) : source )
. replace ( reEmptyStringMiddle , '$1' )
. replace ( reEmptyStringTrailing , '$1;' ) ;
// Frame code as the function body.
source = 'function(' + ( variable || 'obj' ) + ') {\n' +
( variable ?
'' :
'obj || (obj = {});\n'
) +
"var __t, __p = ''" +
( isEscaping ?
', __e = _.escape' :
''
) +
( isEvaluating ?
', __j = Array.prototype.join;\n' +
"function print() { __p += __j.call(arguments, '') }\n" :
';\n'
) +
source +
'return __p\n}' ;
var result = attempt ( function ( ) {
return Function ( importsKeys , sourceURL + 'return ' + source )
. apply ( undefined , importsValues ) ;
} ) ;
// Provide the compiled function's source by its `toString` method or
// the `source` property as a convenience for inlining compiled templates.
result . source = source ;
if ( isError ( result ) ) {
throw result ;
}
return result ;
}
/ * *
* Converts ` string ` , as a whole , to lower case just like
* [ String # toLowerCase ] ( https : //mdn.io/toLowerCase).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the lower cased string .
* @ example
*
* _ . toLower ( '--Foo-Bar--' ) ;
* // => '--foo-bar--'
*
* _ . toLower ( 'fooBar' ) ;
* // => 'foobar'
*
* _ . toLower ( '__FOO_BAR__' ) ;
* // => '__foo_bar__'
* /
function toLower ( value ) {
return toString ( value ) . toLowerCase ( ) ;
}
/ * *
* Converts ` string ` , as a whole , to upper case just like
* [ String # toUpperCase ] ( https : //mdn.io/toUpperCase).
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the upper cased string .
* @ example
*
* _ . toUpper ( '--foo-bar--' ) ;
* // => '--FOO-BAR--'
*
* _ . toUpper ( 'fooBar' ) ;
* // => 'FOOBAR'
*
* _ . toUpper ( '__foo_bar__' ) ;
* // => '__FOO_BAR__'
* /
function toUpper ( value ) {
return toString ( value ) . toUpperCase ( ) ;
}
/ * *
* Removes leading and trailing whitespace or specified characters from ` string ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to trim .
* @ param { string } [ chars = whitespace ] The characters to trim .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { string } Returns the trimmed string .
* @ example
*
* _ . trim ( ' abc ' ) ;
* // => 'abc'
*
* _ . trim ( '-_-abc-_-' , '_-' ) ;
* // => 'abc'
*
* _ . map ( [ ' foo ' , ' bar ' ] , _ . trim ) ;
* // => ['foo', 'bar']
* /
function trim ( string , chars , guard ) {
string = toString ( string ) ;
if ( string && ( guard || chars === undefined ) ) {
return string . replace ( reTrim , '' ) ;
}
if ( ! string || ! ( chars = baseToString ( chars ) ) ) {
return string ;
}
var strSymbols = stringToArray ( string ) ,
chrSymbols = stringToArray ( chars ) ,
start = charsStartIndex ( strSymbols , chrSymbols ) ,
end = charsEndIndex ( strSymbols , chrSymbols ) + 1 ;
return castSlice ( strSymbols , start , end ) . join ( '' ) ;
}
/ * *
* Removes trailing whitespace or specified characters from ` string ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to trim .
* @ param { string } [ chars = whitespace ] The characters to trim .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { string } Returns the trimmed string .
* @ example
*
* _ . trimEnd ( ' abc ' ) ;
* // => ' abc'
*
* _ . trimEnd ( '-_-abc-_-' , '_-' ) ;
* // => '-_-abc'
* /
function trimEnd ( string , chars , guard ) {
string = toString ( string ) ;
if ( string && ( guard || chars === undefined ) ) {
return string . replace ( reTrimEnd , '' ) ;
}
if ( ! string || ! ( chars = baseToString ( chars ) ) ) {
return string ;
}
var strSymbols = stringToArray ( string ) ,
end = charsEndIndex ( strSymbols , stringToArray ( chars ) ) + 1 ;
return castSlice ( strSymbols , 0 , end ) . join ( '' ) ;
}
/ * *
* Removes leading whitespace or specified characters from ` string ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to trim .
* @ param { string } [ chars = whitespace ] The characters to trim .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { string } Returns the trimmed string .
* @ example
*
* _ . trimStart ( ' abc ' ) ;
* // => 'abc '
*
* _ . trimStart ( '-_-abc-_-' , '_-' ) ;
* // => 'abc-_-'
* /
function trimStart ( string , chars , guard ) {
string = toString ( string ) ;
if ( string && ( guard || chars === undefined ) ) {
return string . replace ( reTrimStart , '' ) ;
}
if ( ! string || ! ( chars = baseToString ( chars ) ) ) {
return string ;
}
var strSymbols = stringToArray ( string ) ,
start = charsStartIndex ( strSymbols , stringToArray ( chars ) ) ;
return castSlice ( strSymbols , start ) . join ( '' ) ;
}
/ * *
* Truncates ` string ` if it ' s longer than the given maximum string length .
* The last characters of the truncated string are replaced with the omission
* string which defaults to "..." .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to truncate .
* @ param { Object } [ options = { } ] The options object .
* @ param { number } [ options . length = 30 ] The maximum string length .
* @ param { string } [ options . omission = '...' ] The string to indicate text is omitted .
* @ param { RegExp | string } [ options . separator ] The separator pattern to truncate to .
* @ returns { string } Returns the truncated string .
* @ example
*
* _ . truncate ( 'hi-diddly-ho there, neighborino' ) ;
* // => 'hi-diddly-ho there, neighbo...'
*
* _ . truncate ( 'hi-diddly-ho there, neighborino' , {
* 'length' : 24 ,
* 'separator' : ' '
* } ) ;
* // => 'hi-diddly-ho there,...'
*
* _ . truncate ( 'hi-diddly-ho there, neighborino' , {
* 'length' : 24 ,
* 'separator' : /,? +/
* } ) ;
* // => 'hi-diddly-ho there...'
*
* _ . truncate ( 'hi-diddly-ho there, neighborino' , {
* 'omission' : ' [...]'
* } ) ;
* // => 'hi-diddly-ho there, neig [...]'
* /
function truncate ( string , options ) {
var length = DEFAULT _TRUNC _LENGTH ,
omission = DEFAULT _TRUNC _OMISSION ;
if ( isObject ( options ) ) {
var separator = 'separator' in options ? options . separator : separator ;
length = 'length' in options ? toInteger ( options . length ) : length ;
omission = 'omission' in options ? baseToString ( options . omission ) : omission ;
}
string = toString ( string ) ;
var strLength = string . length ;
if ( hasUnicode ( string ) ) {
var strSymbols = stringToArray ( string ) ;
strLength = strSymbols . length ;
}
if ( length >= strLength ) {
return string ;
}
var end = length - stringSize ( omission ) ;
if ( end < 1 ) {
return omission ;
}
var result = strSymbols ?
castSlice ( strSymbols , 0 , end ) . join ( '' ) :
string . slice ( 0 , end ) ;
if ( separator === undefined ) {
return result + omission ;
}
if ( strSymbols ) {
end += ( result . length - end ) ;
}
if ( isRegExp ( separator ) ) {
if ( string . slice ( end ) . search ( separator ) ) {
var match ,
substring = result ;
if ( ! separator . global ) {
separator = RegExp ( separator . source , toString ( reFlags . exec ( separator ) ) + 'g' ) ;
}
separator . lastIndex = 0 ;
while ( ( match = separator . exec ( substring ) ) ) {
var newEnd = match . index ;
}
result = result . slice ( 0 , newEnd === undefined ? end : newEnd ) ;
}
} else if ( string . indexOf ( baseToString ( separator ) , end ) != end ) {
var index = result . lastIndexOf ( separator ) ;
if ( index > - 1 ) {
result = result . slice ( 0 , index ) ;
}
}
return result + omission ;
}
/ * *
* The inverse of ` _.escape ` ; this method converts the HTML entities
* ` & ` , ` < ` , ` > ` , ` " ` , and ` ' ` in ` string ` to
* their corresponding characters .
*
* * * Note : * * No other HTML entities are unescaped . To unescape additional
* HTML entities use a third - party library like [ _he _ ] ( https : //mths.be/he).
*
* @ static
* @ memberOf _
* @ since 0.6 . 0
* @ category String
* @ param { string } [ string = '' ] The string to unescape .
* @ returns { string } Returns the unescaped string .
* @ example
*
* _ . unescape ( 'fred, barney, & pebbles' ) ;
* // => 'fred, barney, & pebbles'
* /
function unescape ( string ) {
string = toString ( string ) ;
return ( string && reHasEscapedHtml . test ( string ) ) ?
string . replace ( reEscapedHtml , unescapeHtmlChar ) :
string ;
}
/ * *
* Converts ` string ` , as space separated words , to upper case .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the upper cased string .
* @ example
*
* _ . upperCase ( '--foo-bar' ) ;
* // => 'FOO BAR'
*
* _ . upperCase ( 'fooBar' ) ;
* // => 'FOO BAR'
*
* _ . upperCase ( '__foo_bar__' ) ;
* // => 'FOO BAR'
* /
var upperCase = createCompounder ( function ( result , word , index ) {
return result + ( index ? ' ' : '' ) + word . toUpperCase ( ) ;
} ) ;
/ * *
* Converts the first character of ` string ` to upper case .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to convert .
* @ returns { string } Returns the converted string .
* @ example
*
* _ . upperFirst ( 'fred' ) ;
* // => 'Fred'
*
* _ . upperFirst ( 'FRED' ) ;
* // => 'FRED'
* /
var upperFirst = createCaseFirst ( 'toUpperCase' ) ;
/ * *
* Splits ` string ` into an array of its words .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category String
* @ param { string } [ string = '' ] The string to inspect .
* @ param { RegExp | string } [ pattern ] The pattern to match words .
* @ param - { Object } [ guard ] Enables use as an iteratee for methods like ` _.map ` .
* @ returns { Array } Returns the words of ` string ` .
* @ example
*
* _ . words ( 'fred, barney, & pebbles' ) ;
* // => ['fred', 'barney', 'pebbles']
*
* _ . words ( 'fred, barney, & pebbles' , /[^, ]+/g ) ;
* // => ['fred', 'barney', '&', 'pebbles']
* /
function words ( string , pattern , guard ) {
string = toString ( string ) ;
pattern = guard ? undefined : pattern ;
if ( pattern === undefined ) {
return hasUnicodeWord ( string ) ? unicodeWords ( string ) : asciiWords ( string ) ;
}
return string . match ( pattern ) || [ ] ;
}
/*------------------------------------------------------------------------*/
/ * *
* Attempts to invoke ` func ` , returning either the result or the caught error
* object . Any additional arguments are provided to ` func ` when it ' s invoked .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Util
* @ param { Function } func The function to attempt .
* @ param { ... * } [ args ] The arguments to invoke ` func ` with .
* @ returns { * } Returns the ` func ` result or error object .
* @ example
*
* // Avoid throwing errors for invalid selectors.
* var elements = _ . attempt ( function ( selector ) {
* return document . querySelectorAll ( selector ) ;
* } , '>_>' ) ;
*
* if ( _ . isError ( elements ) ) {
* elements = [ ] ;
* }
* /
var attempt = baseRest ( function ( func , args ) {
try {
return apply ( func , undefined , args ) ;
} catch ( e ) {
return isError ( e ) ? e : new Error ( e ) ;
}
} ) ;
/ * *
* Binds methods of an object to the object itself , overwriting the existing
* method .
*
* * * Note : * * This method doesn ' t set the "length" property of bound functions .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { Object } object The object to bind and assign the bound methods to .
* @ param { ... ( string | string [ ] ) } methodNames The object method names to bind .
* @ returns { Object } Returns ` object ` .
* @ example
*
* var view = {
* 'label' : 'docs' ,
* 'click' : function ( ) {
* console . log ( 'clicked ' + this . label ) ;
* }
* } ;
*
* _ . bindAll ( view , [ 'click' ] ) ;
* jQuery ( element ) . on ( 'click' , view . click ) ;
* // => Logs 'clicked docs' when clicked.
* /
var bindAll = flatRest ( function ( object , methodNames ) {
arrayEach ( methodNames , function ( key ) {
key = toKey ( key ) ;
baseAssignValue ( object , key , bind ( object [ key ] , object ) ) ;
} ) ;
return object ;
} ) ;
/ * *
* Creates a function that iterates over ` pairs ` and invokes the corresponding
* function of the first predicate to return truthy . The predicate - function
* pairs are invoked with the ` this ` binding and arguments of the created
* function .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { Array } pairs The predicate - function pairs .
* @ returns { Function } Returns the new composite function .
* @ example
*
* var func = _ . cond ( [
* [ _ . matches ( { 'a' : 1 } ) , _ . constant ( 'matches A' ) ] ,
* [ _ . conforms ( { 'b' : _ . isNumber } ) , _ . constant ( 'matches B' ) ] ,
* [ _ . stubTrue , _ . constant ( 'no match' ) ]
* ] ) ;
*
* func ( { 'a' : 1 , 'b' : 2 } ) ;
* // => 'matches A'
*
* func ( { 'a' : 0 , 'b' : 1 } ) ;
* // => 'matches B'
*
* func ( { 'a' : '1' , 'b' : '2' } ) ;
* // => 'no match'
* /
function cond ( pairs ) {
var length = pairs == null ? 0 : pairs . length ,
toIteratee = getIteratee ( ) ;
pairs = ! length ? [ ] : arrayMap ( pairs , function ( pair ) {
if ( typeof pair [ 1 ] != 'function' ) {
throw new TypeError ( FUNC _ERROR _TEXT ) ;
}
return [ toIteratee ( pair [ 0 ] ) , pair [ 1 ] ] ;
} ) ;
return baseRest ( function ( args ) {
var index = - 1 ;
while ( ++ index < length ) {
var pair = pairs [ index ] ;
if ( apply ( pair [ 0 ] , this , args ) ) {
return apply ( pair [ 1 ] , this , args ) ;
}
}
} ) ;
}
/ * *
* Creates a function that invokes the predicate properties of ` source ` with
* the corresponding property values of a given object , returning ` true ` if
* all predicates return truthy , else ` false ` .
*
* * * Note : * * The created function is equivalent to ` _.conformsTo ` with
* ` source ` partially applied .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { Object } source The object of property predicates to conform to .
* @ returns { Function } Returns the new spec function .
* @ example
*
* var objects = [
* { 'a' : 2 , 'b' : 1 } ,
* { 'a' : 1 , 'b' : 2 }
* ] ;
*
* _ . filter ( objects , _ . conforms ( { 'b' : function ( n ) { return n > 1 ; } } ) ) ;
* // => [{ 'a': 1, 'b': 2 }]
* /
function conforms ( source ) {
return baseConforms ( baseClone ( source , CLONE _DEEP _FLAG ) ) ;
}
/ * *
* Creates a function that returns ` value ` .
*
* @ static
* @ memberOf _
* @ since 2.4 . 0
* @ category Util
* @ param { * } value The value to return from the new function .
* @ returns { Function } Returns the new constant function .
* @ example
*
* var objects = _ . times ( 2 , _ . constant ( { 'a' : 1 } ) ) ;
*
* console . log ( objects ) ;
* // => [{ 'a': 1 }, { 'a': 1 }]
*
* console . log ( objects [ 0 ] === objects [ 1 ] ) ;
* // => true
* /
function constant ( value ) {
return function ( ) {
return value ;
} ;
}
/ * *
* Checks ` value ` to determine whether a default value should be returned in
* its place . The ` defaultValue ` is returned if ` value ` is ` NaN ` , ` null ` ,
* or ` undefined ` .
*
* @ static
* @ memberOf _
* @ since 4.14 . 0
* @ category Util
* @ param { * } value The value to check .
* @ param { * } defaultValue The default value .
* @ returns { * } Returns the resolved value .
* @ example
*
* _ . defaultTo ( 1 , 10 ) ;
* // => 1
*
* _ . defaultTo ( undefined , 10 ) ;
* // => 10
* /
function defaultTo ( value , defaultValue ) {
return ( value == null || value !== value ) ? defaultValue : value ;
}
/ * *
* Creates a function that returns the result of invoking the given functions
* with the ` this ` binding of the created function , where each successive
* invocation is supplied the return value of the previous .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Util
* @ param { ... ( Function | Function [ ] ) } [ funcs ] The functions to invoke .
* @ returns { Function } Returns the new composite function .
* @ see _ . flowRight
* @ example
*
* function square ( n ) {
* return n * n ;
* }
*
* var addSquare = _ . flow ( [ _ . add , square ] ) ;
* addSquare ( 1 , 2 ) ;
* // => 9
* /
var flow = createFlow ( ) ;
/ * *
* This method is like ` _.flow ` except that it creates a function that
* invokes the given functions from right to left .
*
* @ static
* @ since 3.0 . 0
* @ memberOf _
* @ category Util
* @ param { ... ( Function | Function [ ] ) } [ funcs ] The functions to invoke .
* @ returns { Function } Returns the new composite function .
* @ see _ . flow
* @ example
*
* function square ( n ) {
* return n * n ;
* }
*
* var addSquare = _ . flowRight ( [ square , _ . add ] ) ;
* addSquare ( 1 , 2 ) ;
* // => 9
* /
var flowRight = createFlow ( true ) ;
/ * *
* This method returns the first argument it receives .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { * } value Any value .
* @ returns { * } Returns ` value ` .
* @ example
*
* var object = { 'a' : 1 } ;
*
* console . log ( _ . identity ( object ) === object ) ;
* // => true
* /
function identity ( value ) {
return value ;
}
/ * *
* Creates a function that invokes ` func ` with the arguments of the created
* function . If ` func ` is a property name , the created function returns the
* property value for a given element . If ` func ` is an array or object , the
* created function returns ` true ` for elements that contain the equivalent
* source properties , otherwise it returns ` false ` .
*
* @ static
* @ since 4.0 . 0
* @ memberOf _
* @ category Util
* @ param { * } [ func = _ . identity ] The value to convert to a callback .
* @ returns { Function } Returns the callback .
* @ example
*
* var users = [
* { 'user' : 'barney' , 'age' : 36 , 'active' : true } ,
* { 'user' : 'fred' , 'age' : 40 , 'active' : false }
* ] ;
*
* // The `_.matches` iteratee shorthand.
* _ . filter ( users , _ . iteratee ( { 'user' : 'barney' , 'active' : true } ) ) ;
* // => [{ 'user': 'barney', 'age': 36, 'active': true }]
*
* // The `_.matchesProperty` iteratee shorthand.
* _ . filter ( users , _ . iteratee ( [ 'user' , 'fred' ] ) ) ;
* // => [{ 'user': 'fred', 'age': 40 }]
*
* // The `_.property` iteratee shorthand.
* _ . map ( users , _ . iteratee ( 'user' ) ) ;
* // => ['barney', 'fred']
*
* // Create custom iteratee shorthands.
* _ . iteratee = _ . wrap ( _ . iteratee , function ( iteratee , func ) {
* return ! _ . isRegExp ( func ) ? iteratee ( func ) : function ( string ) {
* return func . test ( string ) ;
* } ;
* } ) ;
*
* _ . filter ( [ 'abc' , 'def' ] , /ef/ ) ;
* // => ['def']
* /
function iteratee ( func ) {
return baseIteratee ( typeof func == 'function' ? func : baseClone ( func , CLONE _DEEP _FLAG ) ) ;
}
/ * *
* Creates a function that performs a partial deep comparison between a given
* object and ` source ` , returning ` true ` if the given object has equivalent
* property values , else ` false ` .
*
* * * Note : * * The created function is equivalent to ` _.isMatch ` with ` source `
* partially applied .
*
* Partial comparisons will match empty array and empty object ` source `
* values against any array or object value , respectively . See ` _.isEqual `
* for a list of supported value comparisons .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Util
* @ param { Object } source The object of property values to match .
* @ returns { Function } Returns the new spec function .
* @ example
*
* var objects = [
* { 'a' : 1 , 'b' : 2 , 'c' : 3 } ,
* { 'a' : 4 , 'b' : 5 , 'c' : 6 }
* ] ;
*
* _ . filter ( objects , _ . matches ( { 'a' : 4 , 'c' : 6 } ) ) ;
* // => [{ 'a': 4, 'b': 5, 'c': 6 }]
* /
function matches ( source ) {
return baseMatches ( baseClone ( source , CLONE _DEEP _FLAG ) ) ;
}
/ * *
* Creates a function that performs a partial deep comparison between the
* value at ` path ` of a given object to ` srcValue ` , returning ` true ` if the
* object value is equivalent , else ` false ` .
*
* * * Note : * * Partial comparisons will match empty array and empty object
* ` srcValue ` values against any array or object value , respectively . See
* ` _.isEqual ` for a list of supported value comparisons .
*
* @ static
* @ memberOf _
* @ since 3.2 . 0
* @ category Util
* @ param { Array | string } path The path of the property to get .
* @ param { * } srcValue The value to match .
* @ returns { Function } Returns the new spec function .
* @ example
*
* var objects = [
* { 'a' : 1 , 'b' : 2 , 'c' : 3 } ,
* { 'a' : 4 , 'b' : 5 , 'c' : 6 }
* ] ;
*
* _ . find ( objects , _ . matchesProperty ( 'a' , 4 ) ) ;
* // => { 'a': 4, 'b': 5, 'c': 6 }
* /
function matchesProperty ( path , srcValue ) {
return baseMatchesProperty ( path , baseClone ( srcValue , CLONE _DEEP _FLAG ) ) ;
}
/ * *
* Creates a function that invokes the method at ` path ` of a given object .
* Any additional arguments are provided to the invoked method .
*
* @ static
* @ memberOf _
* @ since 3.7 . 0
* @ category Util
* @ param { Array | string } path The path of the method to invoke .
* @ param { ... * } [ args ] The arguments to invoke the method with .
* @ returns { Function } Returns the new invoker function .
* @ example
*
* var objects = [
* { 'a' : { 'b' : _ . constant ( 2 ) } } ,
* { 'a' : { 'b' : _ . constant ( 1 ) } }
* ] ;
*
* _ . map ( objects , _ . method ( 'a.b' ) ) ;
* // => [2, 1]
*
* _ . map ( objects , _ . method ( [ 'a' , 'b' ] ) ) ;
* // => [2, 1]
* /
var method = baseRest ( function ( path , args ) {
return function ( object ) {
return baseInvoke ( object , path , args ) ;
} ;
} ) ;
/ * *
* The opposite of ` _.method ` ; this method creates a function that invokes
* the method at a given path of ` object ` . Any additional arguments are
* provided to the invoked method .
*
* @ static
* @ memberOf _
* @ since 3.7 . 0
* @ category Util
* @ param { Object } object The object to query .
* @ param { ... * } [ args ] The arguments to invoke the method with .
* @ returns { Function } Returns the new invoker function .
* @ example
*
* var array = _ . times ( 3 , _ . constant ) ,
* object = { 'a' : array , 'b' : array , 'c' : array } ;
*
* _ . map ( [ 'a[2]' , 'c[0]' ] , _ . methodOf ( object ) ) ;
* // => [2, 0]
*
* _ . map ( [ [ 'a' , '2' ] , [ 'c' , '0' ] ] , _ . methodOf ( object ) ) ;
* // => [2, 0]
* /
var methodOf = baseRest ( function ( object , args ) {
return function ( path ) {
return baseInvoke ( object , path , args ) ;
} ;
} ) ;
/ * *
* Adds all own enumerable string keyed function properties of a source
* object to the destination object . If ` object ` is a function , then methods
* are added to its prototype as well .
*
* * * Note : * * Use ` _.runInContext ` to create a pristine ` lodash ` function to
* avoid conflicts caused by modifying the original .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { Function | Object } [ object = lodash ] The destination object .
* @ param { Object } source The object of functions to add .
* @ param { Object } [ options = { } ] The options object .
* @ param { boolean } [ options . chain = true ] Specify whether mixins are chainable .
* @ returns { Function | Object } Returns ` object ` .
* @ example
*
* function vowels ( string ) {
* return _ . filter ( string , function ( v ) {
* return /[aeiou]/i . test ( v ) ;
* } ) ;
* }
*
* _ . mixin ( { 'vowels' : vowels } ) ;
* _ . vowels ( 'fred' ) ;
* // => ['e']
*
* _ ( 'fred' ) . vowels ( ) . value ( ) ;
* // => ['e']
*
* _ . mixin ( { 'vowels' : vowels } , { 'chain' : false } ) ;
* _ ( 'fred' ) . vowels ( ) ;
* // => ['e']
* /
function mixin ( object , source , options ) {
var props = keys ( source ) ,
methodNames = baseFunctions ( source , props ) ;
if ( options == null &&
! ( isObject ( source ) && ( methodNames . length || ! props . length ) ) ) {
options = source ;
source = object ;
object = this ;
methodNames = baseFunctions ( source , keys ( source ) ) ;
}
var chain = ! ( isObject ( options ) && 'chain' in options ) || ! ! options . chain ,
isFunc = isFunction ( object ) ;
arrayEach ( methodNames , function ( methodName ) {
var func = source [ methodName ] ;
object [ methodName ] = func ;
if ( isFunc ) {
object . prototype [ methodName ] = function ( ) {
var chainAll = this . _ _chain _ _ ;
if ( chain || chainAll ) {
var result = object ( this . _ _wrapped _ _ ) ,
actions = result . _ _actions _ _ = copyArray ( this . _ _actions _ _ ) ;
actions . push ( { 'func' : func , 'args' : arguments , 'thisArg' : object } ) ;
result . _ _chain _ _ = chainAll ;
return result ;
}
return func . apply ( object , arrayPush ( [ this . value ( ) ] , arguments ) ) ;
} ;
}
} ) ;
return object ;
}
/ * *
* Reverts the ` _ ` variable to its previous value and returns a reference to
* the ` lodash ` function .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ returns { Function } Returns the ` lodash ` function .
* @ example
*
* var lodash = _ . noConflict ( ) ;
* /
function noConflict ( ) {
if ( root . _ === this ) {
root . _ = oldDash ;
}
return this ;
}
/ * *
* This method returns ` undefined ` .
*
* @ static
* @ memberOf _
* @ since 2.3 . 0
* @ category Util
* @ example
*
* _ . times ( 2 , _ . noop ) ;
* // => [undefined, undefined]
* /
function noop ( ) {
// No operation performed.
}
/ * *
* Creates a function that gets the argument at index ` n ` . If ` n ` is negative ,
* the nth argument from the end is returned .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { number } [ n = 0 ] The index of the argument to return .
* @ returns { Function } Returns the new pass - thru function .
* @ example
*
* var func = _ . nthArg ( 1 ) ;
* func ( 'a' , 'b' , 'c' , 'd' ) ;
* // => 'b'
*
* var func = _ . nthArg ( - 2 ) ;
* func ( 'a' , 'b' , 'c' , 'd' ) ;
* // => 'c'
* /
function nthArg ( n ) {
n = toInteger ( n ) ;
return baseRest ( function ( args ) {
return baseNth ( args , n ) ;
} ) ;
}
/ * *
* Creates a function that invokes ` iteratees ` with the arguments it receives
* and returns their results .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { ... ( Function | Function [ ] ) } [ iteratees = [ _ . identity ] ]
* The iteratees to invoke .
* @ returns { Function } Returns the new function .
* @ example
*
* var func = _ . over ( [ Math . max , Math . min ] ) ;
*
* func ( 1 , 2 , 3 , 4 ) ;
* // => [4, 1]
* /
var over = createOver ( arrayMap ) ;
/ * *
* Creates a function that checks if * * all * * of the ` predicates ` return
* truthy when invoked with the arguments it receives .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { ... ( Function | Function [ ] ) } [ predicates = [ _ . identity ] ]
* The predicates to check .
* @ returns { Function } Returns the new function .
* @ example
*
* var func = _ . overEvery ( [ Boolean , isFinite ] ) ;
*
* func ( '1' ) ;
* // => true
*
* func ( null ) ;
* // => false
*
* func ( NaN ) ;
* // => false
* /
var overEvery = createOver ( arrayEvery ) ;
/ * *
* Creates a function that checks if * * any * * of the ` predicates ` return
* truthy when invoked with the arguments it receives .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { ... ( Function | Function [ ] ) } [ predicates = [ _ . identity ] ]
* The predicates to check .
* @ returns { Function } Returns the new function .
* @ example
*
* var func = _ . overSome ( [ Boolean , isFinite ] ) ;
*
* func ( '1' ) ;
* // => true
*
* func ( null ) ;
* // => true
*
* func ( NaN ) ;
* // => false
* /
var overSome = createOver ( arraySome ) ;
/ * *
* Creates a function that returns the value at ` path ` of a given object .
*
* @ static
* @ memberOf _
* @ since 2.4 . 0
* @ category Util
* @ param { Array | string } path The path of the property to get .
* @ returns { Function } Returns the new accessor function .
* @ example
*
* var objects = [
* { 'a' : { 'b' : 2 } } ,
* { 'a' : { 'b' : 1 } }
* ] ;
*
* _ . map ( objects , _ . property ( 'a.b' ) ) ;
* // => [2, 1]
*
* _ . map ( _ . sortBy ( objects , _ . property ( [ 'a' , 'b' ] ) ) , 'a.b' ) ;
* // => [1, 2]
* /
function property ( path ) {
return isKey ( path ) ? baseProperty ( toKey ( path ) ) : basePropertyDeep ( path ) ;
}
/ * *
* The opposite of ` _.property ` ; this method creates a function that returns
* the value at a given path of ` object ` .
*
* @ static
* @ memberOf _
* @ since 3.0 . 0
* @ category Util
* @ param { Object } object The object to query .
* @ returns { Function } Returns the new accessor function .
* @ example
*
* var array = [ 0 , 1 , 2 ] ,
* object = { 'a' : array , 'b' : array , 'c' : array } ;
*
* _ . map ( [ 'a[2]' , 'c[0]' ] , _ . propertyOf ( object ) ) ;
* // => [2, 0]
*
* _ . map ( [ [ 'a' , '2' ] , [ 'c' , '0' ] ] , _ . propertyOf ( object ) ) ;
* // => [2, 0]
* /
function propertyOf ( object ) {
return function ( path ) {
return object == null ? undefined : baseGet ( object , path ) ;
} ;
}
/ * *
* Creates an array of numbers ( positive and / or negative ) progressing from
* ` start ` up to , but not including , ` end ` . A step of ` -1 ` is used if a negative
* ` start ` is specified without an ` end ` or ` step ` . If ` end ` is not specified ,
* it ' s set to ` start ` with ` start ` then set to ` 0 ` .
*
* * * Note : * * JavaScript follows the IEEE - 754 standard for resolving
* floating - point values which can produce unexpected results .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { number } [ start = 0 ] The start of the range .
* @ param { number } end The end of the range .
* @ param { number } [ step = 1 ] The value to increment or decrement by .
* @ returns { Array } Returns the range of numbers .
* @ see _ . inRange , _ . rangeRight
* @ example
*
* _ . range ( 4 ) ;
* // => [0, 1, 2, 3]
*
* _ . range ( - 4 ) ;
* // => [0, -1, -2, -3]
*
* _ . range ( 1 , 5 ) ;
* // => [1, 2, 3, 4]
*
* _ . range ( 0 , 20 , 5 ) ;
* // => [0, 5, 10, 15]
*
* _ . range ( 0 , - 4 , - 1 ) ;
* // => [0, -1, -2, -3]
*
* _ . range ( 1 , 4 , 0 ) ;
* // => [1, 1, 1]
*
* _ . range ( 0 ) ;
* // => []
* /
var range = createRange ( ) ;
/ * *
* This method is like ` _.range ` except that it populates values in
* descending order .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { number } [ start = 0 ] The start of the range .
* @ param { number } end The end of the range .
* @ param { number } [ step = 1 ] The value to increment or decrement by .
* @ returns { Array } Returns the range of numbers .
* @ see _ . inRange , _ . range
* @ example
*
* _ . rangeRight ( 4 ) ;
* // => [3, 2, 1, 0]
*
* _ . rangeRight ( - 4 ) ;
* // => [-3, -2, -1, 0]
*
* _ . rangeRight ( 1 , 5 ) ;
* // => [4, 3, 2, 1]
*
* _ . rangeRight ( 0 , 20 , 5 ) ;
* // => [15, 10, 5, 0]
*
* _ . rangeRight ( 0 , - 4 , - 1 ) ;
* // => [-3, -2, -1, 0]
*
* _ . rangeRight ( 1 , 4 , 0 ) ;
* // => [1, 1, 1]
*
* _ . rangeRight ( 0 ) ;
* // => []
* /
var rangeRight = createRange ( true ) ;
/ * *
* This method returns a new empty array .
*
* @ static
* @ memberOf _
* @ since 4.13 . 0
* @ category Util
* @ returns { Array } Returns the new empty array .
* @ example
*
* var arrays = _ . times ( 2 , _ . stubArray ) ;
*
* console . log ( arrays ) ;
* // => [[], []]
*
* console . log ( arrays [ 0 ] === arrays [ 1 ] ) ;
* // => false
* /
function stubArray ( ) {
return [ ] ;
}
/ * *
* This method returns ` false ` .
*
* @ static
* @ memberOf _
* @ since 4.13 . 0
* @ category Util
* @ returns { boolean } Returns ` false ` .
* @ example
*
* _ . times ( 2 , _ . stubFalse ) ;
* // => [false, false]
* /
function stubFalse ( ) {
return false ;
}
/ * *
* This method returns a new empty object .
*
* @ static
* @ memberOf _
* @ since 4.13 . 0
* @ category Util
* @ returns { Object } Returns the new empty object .
* @ example
*
* var objects = _ . times ( 2 , _ . stubObject ) ;
*
* console . log ( objects ) ;
* // => [{}, {}]
*
* console . log ( objects [ 0 ] === objects [ 1 ] ) ;
* // => false
* /
function stubObject ( ) {
return { } ;
}
/ * *
* This method returns an empty string .
*
* @ static
* @ memberOf _
* @ since 4.13 . 0
* @ category Util
* @ returns { string } Returns the empty string .
* @ example
*
* _ . times ( 2 , _ . stubString ) ;
* // => ['', '']
* /
function stubString ( ) {
return '' ;
}
/ * *
* This method returns ` true ` .
*
* @ static
* @ memberOf _
* @ since 4.13 . 0
* @ category Util
* @ returns { boolean } Returns ` true ` .
* @ example
*
* _ . times ( 2 , _ . stubTrue ) ;
* // => [true, true]
* /
function stubTrue ( ) {
return true ;
}
/ * *
* Invokes the iteratee ` n ` times , returning an array of the results of
* each invocation . The iteratee is invoked with one argument ; ( index ) .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { number } n The number of times to invoke ` iteratee ` .
* @ param { Function } [ iteratee = _ . identity ] The function invoked per iteration .
* @ returns { Array } Returns the array of results .
* @ example
*
* _ . times ( 3 , String ) ;
* // => ['0', '1', '2']
*
* _ . times ( 4 , _ . constant ( 0 ) ) ;
* // => [0, 0, 0, 0]
* /
function times ( n , iteratee ) {
n = toInteger ( n ) ;
if ( n < 1 || n > MAX _SAFE _INTEGER ) {
return [ ] ;
}
var index = MAX _ARRAY _LENGTH ,
length = nativeMin ( n , MAX _ARRAY _LENGTH ) ;
iteratee = getIteratee ( iteratee ) ;
n -= MAX _ARRAY _LENGTH ;
var result = baseTimes ( length , iteratee ) ;
while ( ++ index < n ) {
iteratee ( index ) ;
}
return result ;
}
/ * *
* Converts ` value ` to a property path array .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Util
* @ param { * } value The value to convert .
* @ returns { Array } Returns the new property path array .
* @ example
*
* _ . toPath ( 'a.b.c' ) ;
* // => ['a', 'b', 'c']
*
* _ . toPath ( 'a[0].b.c' ) ;
* // => ['a', '0', 'b', 'c']
* /
function toPath ( value ) {
if ( isArray ( value ) ) {
return arrayMap ( value , toKey ) ;
}
return isSymbol ( value ) ? [ value ] : copyArray ( stringToPath ( toString ( value ) ) ) ;
}
/ * *
* Generates a unique ID . If ` prefix ` is given , the ID is appended to it .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Util
* @ param { string } [ prefix = '' ] The value to prefix the ID with .
* @ returns { string } Returns the unique ID .
* @ example
*
* _ . uniqueId ( 'contact_' ) ;
* // => 'contact_104'
*
* _ . uniqueId ( ) ;
* // => '105'
* /
function uniqueId ( prefix ) {
var id = ++ idCounter ;
return toString ( prefix ) + id ;
}
/*------------------------------------------------------------------------*/
/ * *
* Adds two numbers .
*
* @ static
* @ memberOf _
* @ since 3.4 . 0
* @ category Math
* @ param { number } augend The first number in an addition .
* @ param { number } addend The second number in an addition .
* @ returns { number } Returns the total .
* @ example
*
* _ . add ( 6 , 4 ) ;
* // => 10
* /
var add = createMathOperation ( function ( augend , addend ) {
return augend + addend ;
} , 0 ) ;
/ * *
* Computes ` number ` rounded up to ` precision ` .
*
* @ static
* @ memberOf _
* @ since 3.10 . 0
* @ category Math
* @ param { number } number The number to round up .
* @ param { number } [ precision = 0 ] The precision to round up to .
* @ returns { number } Returns the rounded up number .
* @ example
*
* _ . ceil ( 4.006 ) ;
* // => 5
*
* _ . ceil ( 6.004 , 2 ) ;
* // => 6.01
*
* _ . ceil ( 6040 , - 2 ) ;
* // => 6100
* /
var ceil = createRound ( 'ceil' ) ;
/ * *
* Divide two numbers .
*
* @ static
* @ memberOf _
* @ since 4.7 . 0
* @ category Math
* @ param { number } dividend The first number in a division .
* @ param { number } divisor The second number in a division .
* @ returns { number } Returns the quotient .
* @ example
*
* _ . divide ( 6 , 4 ) ;
* // => 1.5
* /
var divide = createMathOperation ( function ( dividend , divisor ) {
return dividend / divisor ;
} , 1 ) ;
/ * *
* Computes ` number ` rounded down to ` precision ` .
*
* @ static
* @ memberOf _
* @ since 3.10 . 0
* @ category Math
* @ param { number } number The number to round down .
* @ param { number } [ precision = 0 ] The precision to round down to .
* @ returns { number } Returns the rounded down number .
* @ example
*
* _ . floor ( 4.006 ) ;
* // => 4
*
* _ . floor ( 0.046 , 2 ) ;
* // => 0.04
*
* _ . floor ( 4060 , - 2 ) ;
* // => 4000
* /
var floor = createRound ( 'floor' ) ;
/ * *
* Computes the maximum value of ` array ` . If ` array ` is empty or falsey ,
* ` undefined ` is returned .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Math
* @ param { Array } array The array to iterate over .
* @ returns { * } Returns the maximum value .
* @ example
*
* _ . max ( [ 4 , 2 , 8 , 6 ] ) ;
* // => 8
*
* _ . max ( [ ] ) ;
* // => undefined
* /
function max ( array ) {
return ( array && array . length ) ?
baseExtremum ( array , identity , baseGt ) :
undefined ;
}
/ * *
* This method is like ` _.max ` except that it accepts ` iteratee ` which is
* invoked for each element in ` array ` to generate the criterion by which
* the value is ranked . The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { * } Returns the maximum value .
* @ example
*
* var objects = [ { 'n' : 1 } , { 'n' : 2 } ] ;
*
* _ . maxBy ( objects , function ( o ) { return o . n ; } ) ;
* // => { 'n': 2 }
*
* // The `_.property` iteratee shorthand.
* _ . maxBy ( objects , 'n' ) ;
* // => { 'n': 2 }
* /
function maxBy ( array , iteratee ) {
return ( array && array . length ) ?
baseExtremum ( array , getIteratee ( iteratee , 2 ) , baseGt ) :
undefined ;
}
/ * *
* Computes the mean of the values in ` array ` .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ returns { number } Returns the mean .
* @ example
*
* _ . mean ( [ 4 , 2 , 8 , 6 ] ) ;
* // => 5
* /
function mean ( array ) {
return baseMean ( array , identity ) ;
}
/ * *
* This method is like ` _.mean ` except that it accepts ` iteratee ` which is
* invoked for each element in ` array ` to generate the value to be averaged .
* The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.7 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { number } Returns the mean .
* @ example
*
* var objects = [ { 'n' : 4 } , { 'n' : 2 } , { 'n' : 8 } , { 'n' : 6 } ] ;
*
* _ . meanBy ( objects , function ( o ) { return o . n ; } ) ;
* // => 5
*
* // The `_.property` iteratee shorthand.
* _ . meanBy ( objects , 'n' ) ;
* // => 5
* /
function meanBy ( array , iteratee ) {
return baseMean ( array , getIteratee ( iteratee , 2 ) ) ;
}
/ * *
* Computes the minimum value of ` array ` . If ` array ` is empty or falsey ,
* ` undefined ` is returned .
*
* @ static
* @ since 0.1 . 0
* @ memberOf _
* @ category Math
* @ param { Array } array The array to iterate over .
* @ returns { * } Returns the minimum value .
* @ example
*
* _ . min ( [ 4 , 2 , 8 , 6 ] ) ;
* // => 2
*
* _ . min ( [ ] ) ;
* // => undefined
* /
function min ( array ) {
return ( array && array . length ) ?
baseExtremum ( array , identity , baseLt ) :
undefined ;
}
/ * *
* This method is like ` _.min ` except that it accepts ` iteratee ` which is
* invoked for each element in ` array ` to generate the criterion by which
* the value is ranked . The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { * } Returns the minimum value .
* @ example
*
* var objects = [ { 'n' : 1 } , { 'n' : 2 } ] ;
*
* _ . minBy ( objects , function ( o ) { return o . n ; } ) ;
* // => { 'n': 1 }
*
* // The `_.property` iteratee shorthand.
* _ . minBy ( objects , 'n' ) ;
* // => { 'n': 1 }
* /
function minBy ( array , iteratee ) {
return ( array && array . length ) ?
baseExtremum ( array , getIteratee ( iteratee , 2 ) , baseLt ) :
undefined ;
}
/ * *
* Multiply two numbers .
*
* @ static
* @ memberOf _
* @ since 4.7 . 0
* @ category Math
* @ param { number } multiplier The first number in a multiplication .
* @ param { number } multiplicand The second number in a multiplication .
* @ returns { number } Returns the product .
* @ example
*
* _ . multiply ( 6 , 4 ) ;
* // => 24
* /
var multiply = createMathOperation ( function ( multiplier , multiplicand ) {
return multiplier * multiplicand ;
} , 1 ) ;
/ * *
* Computes ` number ` rounded to ` precision ` .
*
* @ static
* @ memberOf _
* @ since 3.10 . 0
* @ category Math
* @ param { number } number The number to round .
* @ param { number } [ precision = 0 ] The precision to round to .
* @ returns { number } Returns the rounded number .
* @ example
*
* _ . round ( 4.006 ) ;
* // => 4
*
* _ . round ( 4.006 , 2 ) ;
* // => 4.01
*
* _ . round ( 4060 , - 2 ) ;
* // => 4100
* /
var round = createRound ( 'round' ) ;
/ * *
* Subtract two numbers .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Math
* @ param { number } minuend The first number in a subtraction .
* @ param { number } subtrahend The second number in a subtraction .
* @ returns { number } Returns the difference .
* @ example
*
* _ . subtract ( 6 , 4 ) ;
* // => 2
* /
var subtract = createMathOperation ( function ( minuend , subtrahend ) {
return minuend - subtrahend ;
} , 0 ) ;
/ * *
* Computes the sum of the values in ` array ` .
*
* @ static
* @ memberOf _
* @ since 3.4 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ returns { number } Returns the sum .
* @ example
*
* _ . sum ( [ 4 , 2 , 8 , 6 ] ) ;
* // => 20
* /
function sum ( array ) {
return ( array && array . length ) ?
baseSum ( array , identity ) :
0 ;
}
/ * *
* This method is like ` _.sum ` except that it accepts ` iteratee ` which is
* invoked for each element in ` array ` to generate the value to be summed .
* The iteratee is invoked with one argument : ( value ) .
*
* @ static
* @ memberOf _
* @ since 4.0 . 0
* @ category Math
* @ param { Array } array The array to iterate over .
* @ param { Function } [ iteratee = _ . identity ] The iteratee invoked per element .
* @ returns { number } Returns the sum .
* @ example
*
* var objects = [ { 'n' : 4 } , { 'n' : 2 } , { 'n' : 8 } , { 'n' : 6 } ] ;
*
* _ . sumBy ( objects , function ( o ) { return o . n ; } ) ;
* // => 20
*
* // The `_.property` iteratee shorthand.
* _ . sumBy ( objects , 'n' ) ;
* // => 20
* /
function sumBy ( array , iteratee ) {
return ( array && array . length ) ?
baseSum ( array , getIteratee ( iteratee , 2 ) ) :
0 ;
}
/*------------------------------------------------------------------------*/
// Add methods that return wrapped values in chain sequences.
lodash . after = after ;
lodash . ary = ary ;
lodash . assign = assign ;
lodash . assignIn = assignIn ;
lodash . assignInWith = assignInWith ;
lodash . assignWith = assignWith ;
lodash . at = at ;
lodash . before = before ;
lodash . bind = bind ;
lodash . bindAll = bindAll ;
lodash . bindKey = bindKey ;
lodash . castArray = castArray ;
lodash . chain = chain ;
lodash . chunk = chunk ;
lodash . compact = compact ;
lodash . concat = concat ;
lodash . cond = cond ;
lodash . conforms = conforms ;
lodash . constant = constant ;
lodash . countBy = countBy ;
lodash . create = create ;
lodash . curry = curry ;
lodash . curryRight = curryRight ;
lodash . debounce = debounce ;
lodash . defaults = defaults ;
lodash . defaultsDeep = defaultsDeep ;
lodash . defer = defer ;
lodash . delay = delay ;
lodash . difference = difference ;
lodash . differenceBy = differenceBy ;
lodash . differenceWith = differenceWith ;
lodash . drop = drop ;
lodash . dropRight = dropRight ;
lodash . dropRightWhile = dropRightWhile ;
lodash . dropWhile = dropWhile ;
lodash . fill = fill ;
lodash . filter = filter ;
lodash . flatMap = flatMap ;
lodash . flatMapDeep = flatMapDeep ;
lodash . flatMapDepth = flatMapDepth ;
lodash . flatten = flatten ;
lodash . flattenDeep = flattenDeep ;
lodash . flattenDepth = flattenDepth ;
lodash . flip = flip ;
lodash . flow = flow ;
lodash . flowRight = flowRight ;
lodash . fromPairs = fromPairs ;
lodash . functions = functions ;
lodash . functionsIn = functionsIn ;
lodash . groupBy = groupBy ;
lodash . initial = initial ;
lodash . intersection = intersection ;
lodash . intersectionBy = intersectionBy ;
lodash . intersectionWith = intersectionWith ;
lodash . invert = invert ;
lodash . invertBy = invertBy ;
lodash . invokeMap = invokeMap ;
lodash . iteratee = iteratee ;
lodash . keyBy = keyBy ;
lodash . keys = keys ;
lodash . keysIn = keysIn ;
lodash . map = map ;
lodash . mapKeys = mapKeys ;
lodash . mapValues = mapValues ;
lodash . matches = matches ;
lodash . matchesProperty = matchesProperty ;
lodash . memoize = memoize ;
lodash . merge = merge ;
lodash . mergeWith = mergeWith ;
lodash . method = method ;
lodash . methodOf = methodOf ;
lodash . mixin = mixin ;
lodash . negate = negate ;
lodash . nthArg = nthArg ;
lodash . omit = omit ;
lodash . omitBy = omitBy ;
lodash . once = once ;
lodash . orderBy = orderBy ;
lodash . over = over ;
lodash . overArgs = overArgs ;
lodash . overEvery = overEvery ;
lodash . overSome = overSome ;
lodash . partial = partial ;
lodash . partialRight = partialRight ;
lodash . partition = partition ;
lodash . pick = pick ;
lodash . pickBy = pickBy ;
lodash . property = property ;
lodash . propertyOf = propertyOf ;
lodash . pull = pull ;
lodash . pullAll = pullAll ;
lodash . pullAllBy = pullAllBy ;
lodash . pullAllWith = pullAllWith ;
lodash . pullAt = pullAt ;
lodash . range = range ;
lodash . rangeRight = rangeRight ;
lodash . rearg = rearg ;
lodash . reject = reject ;
lodash . remove = remove ;
lodash . rest = rest ;
lodash . reverse = reverse ;
lodash . sampleSize = sampleSize ;
lodash . set = set ;
lodash . setWith = setWith ;
lodash . shuffle = shuffle ;
lodash . slice = slice ;
lodash . sortBy = sortBy ;
lodash . sortedUniq = sortedUniq ;
lodash . sortedUniqBy = sortedUniqBy ;
lodash . split = split ;
lodash . spread = spread ;
lodash . tail = tail ;
lodash . take = take ;
lodash . takeRight = takeRight ;
lodash . takeRightWhile = takeRightWhile ;
lodash . takeWhile = takeWhile ;
lodash . tap = tap ;
lodash . throttle = throttle ;
lodash . thru = thru ;
lodash . toArray = toArray ;
lodash . toPairs = toPairs ;
lodash . toPairsIn = toPairsIn ;
lodash . toPath = toPath ;
lodash . toPlainObject = toPlainObject ;
lodash . transform = transform ;
lodash . unary = unary ;
lodash . union = union ;
lodash . unionBy = unionBy ;
lodash . unionWith = unionWith ;
lodash . uniq = uniq ;
lodash . uniqBy = uniqBy ;
lodash . uniqWith = uniqWith ;
lodash . unset = unset ;
lodash . unzip = unzip ;
lodash . unzipWith = unzipWith ;
lodash . update = update ;
lodash . updateWith = updateWith ;
lodash . values = values ;
lodash . valuesIn = valuesIn ;
lodash . without = without ;
lodash . words = words ;
lodash . wrap = wrap ;
lodash . xor = xor ;
lodash . xorBy = xorBy ;
lodash . xorWith = xorWith ;
lodash . zip = zip ;
lodash . zipObject = zipObject ;
lodash . zipObjectDeep = zipObjectDeep ;
lodash . zipWith = zipWith ;
// Add aliases.
lodash . entries = toPairs ;
lodash . entriesIn = toPairsIn ;
lodash . extend = assignIn ;
lodash . extendWith = assignInWith ;
// Add methods to `lodash.prototype`.
mixin ( lodash , lodash ) ;
/*------------------------------------------------------------------------*/
// Add methods that return unwrapped values in chain sequences.
lodash . add = add ;
lodash . attempt = attempt ;
lodash . camelCase = camelCase ;
lodash . capitalize = capitalize ;
lodash . ceil = ceil ;
lodash . clamp = clamp ;
lodash . clone = clone ;
lodash . cloneDeep = cloneDeep ;
lodash . cloneDeepWith = cloneDeepWith ;
lodash . cloneWith = cloneWith ;
lodash . conformsTo = conformsTo ;
lodash . deburr = deburr ;
lodash . defaultTo = defaultTo ;
lodash . divide = divide ;
lodash . endsWith = endsWith ;
lodash . eq = eq ;
lodash . escape = escape ;
lodash . escapeRegExp = escapeRegExp ;
lodash . every = every ;
lodash . find = find ;
lodash . findIndex = findIndex ;
lodash . findKey = findKey ;
lodash . findLast = findLast ;
lodash . findLastIndex = findLastIndex ;
lodash . findLastKey = findLastKey ;
lodash . floor = floor ;
lodash . forEach = forEach ;
lodash . forEachRight = forEachRight ;
lodash . forIn = forIn ;
lodash . forInRight = forInRight ;
lodash . forOwn = forOwn ;
lodash . forOwnRight = forOwnRight ;
lodash . get = get ;
lodash . gt = gt ;
lodash . gte = gte ;
lodash . has = has ;
lodash . hasIn = hasIn ;
lodash . head = head ;
lodash . identity = identity ;
lodash . includes = includes ;
lodash . indexOf = indexOf ;
lodash . inRange = inRange ;
lodash . invoke = invoke ;
lodash . isArguments = isArguments ;
lodash . isArray = isArray ;
lodash . isArrayBuffer = isArrayBuffer ;
lodash . isArrayLike = isArrayLike ;
lodash . isArrayLikeObject = isArrayLikeObject ;
lodash . isBoolean = isBoolean ;
lodash . isBuffer = isBuffer ;
lodash . isDate = isDate ;
lodash . isElement = isElement ;
lodash . isEmpty = isEmpty ;
lodash . isEqual = isEqual ;
lodash . isEqualWith = isEqualWith ;
lodash . isError = isError ;
lodash . isFinite = isFinite ;
lodash . isFunction = isFunction ;
lodash . isInteger = isInteger ;
lodash . isLength = isLength ;
lodash . isMap = isMap ;
lodash . isMatch = isMatch ;
lodash . isMatchWith = isMatchWith ;
lodash . isNaN = isNaN ;
lodash . isNative = isNative ;
lodash . isNil = isNil ;
lodash . isNull = isNull ;
lodash . isNumber = isNumber ;
lodash . isObject = isObject ;
lodash . isObjectLike = isObjectLike ;
lodash . isPlainObject = isPlainObject ;
lodash . isRegExp = isRegExp ;
lodash . isSafeInteger = isSafeInteger ;
lodash . isSet = isSet ;
lodash . isString = isString ;
lodash . isSymbol = isSymbol ;
lodash . isTypedArray = isTypedArray ;
lodash . isUndefined = isUndefined ;
lodash . isWeakMap = isWeakMap ;
lodash . isWeakSet = isWeakSet ;
lodash . join = join ;
lodash . kebabCase = kebabCase ;
lodash . last = last ;
lodash . lastIndexOf = lastIndexOf ;
lodash . lowerCase = lowerCase ;
lodash . lowerFirst = lowerFirst ;
lodash . lt = lt ;
lodash . lte = lte ;
lodash . max = max ;
lodash . maxBy = maxBy ;
lodash . mean = mean ;
lodash . meanBy = meanBy ;
lodash . min = min ;
lodash . minBy = minBy ;
lodash . stubArray = stubArray ;
lodash . stubFalse = stubFalse ;
lodash . stubObject = stubObject ;
lodash . stubString = stubString ;
lodash . stubTrue = stubTrue ;
lodash . multiply = multiply ;
lodash . nth = nth ;
lodash . noConflict = noConflict ;
lodash . noop = noop ;
lodash . now = now ;
lodash . pad = pad ;
lodash . padEnd = padEnd ;
lodash . padStart = padStart ;
lodash . parseInt = parseInt ;
lodash . random = random ;
lodash . reduce = reduce ;
lodash . reduceRight = reduceRight ;
lodash . repeat = repeat ;
lodash . replace = replace ;
lodash . result = result ;
lodash . round = round ;
lodash . runInContext = runInContext ;
lodash . sample = sample ;
lodash . size = size ;
lodash . snakeCase = snakeCase ;
lodash . some = some ;
lodash . sortedIndex = sortedIndex ;
lodash . sortedIndexBy = sortedIndexBy ;
lodash . sortedIndexOf = sortedIndexOf ;
lodash . sortedLastIndex = sortedLastIndex ;
lodash . sortedLastIndexBy = sortedLastIndexBy ;
lodash . sortedLastIndexOf = sortedLastIndexOf ;
lodash . startCase = startCase ;
lodash . startsWith = startsWith ;
lodash . subtract = subtract ;
lodash . sum = sum ;
lodash . sumBy = sumBy ;
lodash . template = template ;
lodash . times = times ;
lodash . toFinite = toFinite ;
lodash . toInteger = toInteger ;
lodash . toLength = toLength ;
lodash . toLower = toLower ;
lodash . toNumber = toNumber ;
lodash . toSafeInteger = toSafeInteger ;
lodash . toString = toString ;
lodash . toUpper = toUpper ;
lodash . trim = trim ;
lodash . trimEnd = trimEnd ;
lodash . trimStart = trimStart ;
lodash . truncate = truncate ;
lodash . unescape = unescape ;
lodash . uniqueId = uniqueId ;
lodash . upperCase = upperCase ;
lodash . upperFirst = upperFirst ;
// Add aliases.
lodash . each = forEach ;
lodash . eachRight = forEachRight ;
lodash . first = head ;
mixin ( lodash , ( function ( ) {
var source = { } ;
baseForOwn ( lodash , function ( func , methodName ) {
if ( ! hasOwnProperty . call ( lodash . prototype , methodName ) ) {
source [ methodName ] = func ;
}
} ) ;
return source ;
} ( ) ) , { 'chain' : false } ) ;
/*------------------------------------------------------------------------*/
/ * *
* The semantic version number .
*
* @ static
* @ memberOf _
* @ type { string }
* /
lodash . VERSION = VERSION ;
// Assign default placeholders.
arrayEach ( [ 'bind' , 'bindKey' , 'curry' , 'curryRight' , 'partial' , 'partialRight' ] , function ( methodName ) {
lodash [ methodName ] . placeholder = lodash ;
} ) ;
// Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
arrayEach ( [ 'drop' , 'take' ] , function ( methodName , index ) {
LazyWrapper . prototype [ methodName ] = function ( n ) {
n = n === undefined ? 1 : nativeMax ( toInteger ( n ) , 0 ) ;
var result = ( this . _ _filtered _ _ && ! index ) ?
new LazyWrapper ( this ) :
this . clone ( ) ;
if ( result . _ _filtered _ _ ) {
result . _ _takeCount _ _ = nativeMin ( n , result . _ _takeCount _ _ ) ;
} else {
result . _ _views _ _ . push ( {
'size' : nativeMin ( n , MAX _ARRAY _LENGTH ) ,
'type' : methodName + ( result . _ _dir _ _ < 0 ? 'Right' : '' )
} ) ;
}
return result ;
} ;
LazyWrapper . prototype [ methodName + 'Right' ] = function ( n ) {
return this . reverse ( ) [ methodName ] ( n ) . reverse ( ) ;
} ;
} ) ;
// Add `LazyWrapper` methods that accept an `iteratee` value.
arrayEach ( [ 'filter' , 'map' , 'takeWhile' ] , function ( methodName , index ) {
var type = index + 1 ,
isFilter = type == LAZY _FILTER _FLAG || type == LAZY _WHILE _FLAG ;
LazyWrapper . prototype [ methodName ] = function ( iteratee ) {
var result = this . clone ( ) ;
result . _ _iteratees _ _ . push ( {
'iteratee' : getIteratee ( iteratee , 3 ) ,
'type' : type
} ) ;
result . _ _filtered _ _ = result . _ _filtered _ _ || isFilter ;
return result ;
} ;
} ) ;
// Add `LazyWrapper` methods for `_.head` and `_.last`.
arrayEach ( [ 'head' , 'last' ] , function ( methodName , index ) {
var takeName = 'take' + ( index ? 'Right' : '' ) ;
LazyWrapper . prototype [ methodName ] = function ( ) {
return this [ takeName ] ( 1 ) . value ( ) [ 0 ] ;
} ;
} ) ;
// Add `LazyWrapper` methods for `_.initial` and `_.tail`.
arrayEach ( [ 'initial' , 'tail' ] , function ( methodName , index ) {
var dropName = 'drop' + ( index ? '' : 'Right' ) ;
LazyWrapper . prototype [ methodName ] = function ( ) {
return this . _ _filtered _ _ ? new LazyWrapper ( this ) : this [ dropName ] ( 1 ) ;
} ;
} ) ;
LazyWrapper . prototype . compact = function ( ) {
return this . filter ( identity ) ;
} ;
LazyWrapper . prototype . find = function ( predicate ) {
return this . filter ( predicate ) . head ( ) ;
} ;
LazyWrapper . prototype . findLast = function ( predicate ) {
return this . reverse ( ) . find ( predicate ) ;
} ;
LazyWrapper . prototype . invokeMap = baseRest ( function ( path , args ) {
if ( typeof path == 'function' ) {
return new LazyWrapper ( this ) ;
}
return this . map ( function ( value ) {
return baseInvoke ( value , path , args ) ;
} ) ;
} ) ;
LazyWrapper . prototype . reject = function ( predicate ) {
return this . filter ( negate ( getIteratee ( predicate ) ) ) ;
} ;
LazyWrapper . prototype . slice = function ( start , end ) {
start = toInteger ( start ) ;
var result = this ;
if ( result . _ _filtered _ _ && ( start > 0 || end < 0 ) ) {
return new LazyWrapper ( result ) ;
}
if ( start < 0 ) {
result = result . takeRight ( - start ) ;
} else if ( start ) {
result = result . drop ( start ) ;
}
if ( end !== undefined ) {
end = toInteger ( end ) ;
result = end < 0 ? result . dropRight ( - end ) : result . take ( end - start ) ;
}
return result ;
} ;
LazyWrapper . prototype . takeRightWhile = function ( predicate ) {
return this . reverse ( ) . takeWhile ( predicate ) . reverse ( ) ;
} ;
LazyWrapper . prototype . toArray = function ( ) {
return this . take ( MAX _ARRAY _LENGTH ) ;
} ;
// Add `LazyWrapper` methods to `lodash.prototype`.
baseForOwn ( LazyWrapper . prototype , function ( func , methodName ) {
var checkIteratee = /^(?:filter|find|map|reject)|While$/ . test ( methodName ) ,
isTaker = /^(?:head|last)$/ . test ( methodName ) ,
lodashFunc = lodash [ isTaker ? ( 'take' + ( methodName == 'last' ? 'Right' : '' ) ) : methodName ] ,
retUnwrapped = isTaker || /^find/ . test ( methodName ) ;
if ( ! lodashFunc ) {
return ;
}
lodash . prototype [ methodName ] = function ( ) {
var value = this . _ _wrapped _ _ ,
args = isTaker ? [ 1 ] : arguments ,
isLazy = value instanceof LazyWrapper ,
iteratee = args [ 0 ] ,
useLazy = isLazy || isArray ( value ) ;
var interceptor = function ( value ) {
var result = lodashFunc . apply ( lodash , arrayPush ( [ value ] , args ) ) ;
return ( isTaker && chainAll ) ? result [ 0 ] : result ;
} ;
if ( useLazy && checkIteratee && typeof iteratee == 'function' && iteratee . length != 1 ) {
// Avoid lazy use if the iteratee has a "length" value other than `1`.
isLazy = useLazy = false ;
}
var chainAll = this . _ _chain _ _ ,
isHybrid = ! ! this . _ _actions _ _ . length ,
isUnwrapped = retUnwrapped && ! chainAll ,
onlyLazy = isLazy && ! isHybrid ;
if ( ! retUnwrapped && useLazy ) {
value = onlyLazy ? value : new LazyWrapper ( this ) ;
var result = func . apply ( value , args ) ;
result . _ _actions _ _ . push ( { 'func' : thru , 'args' : [ interceptor ] , 'thisArg' : undefined } ) ;
return new LodashWrapper ( result , chainAll ) ;
}
if ( isUnwrapped && onlyLazy ) {
return func . apply ( this , args ) ;
}
result = this . thru ( interceptor ) ;
return isUnwrapped ? ( isTaker ? result . value ( ) [ 0 ] : result . value ( ) ) : result ;
} ;
} ) ;
// Add `Array` methods to `lodash.prototype`.
arrayEach ( [ 'pop' , 'push' , 'shift' , 'sort' , 'splice' , 'unshift' ] , function ( methodName ) {
var func = arrayProto [ methodName ] ,
chainName = /^(?:push|sort|unshift)$/ . test ( methodName ) ? 'tap' : 'thru' ,
retUnwrapped = /^(?:pop|shift)$/ . test ( methodName ) ;
lodash . prototype [ methodName ] = function ( ) {
var args = arguments ;
if ( retUnwrapped && ! this . _ _chain _ _ ) {
var value = this . value ( ) ;
return func . apply ( isArray ( value ) ? value : [ ] , args ) ;
}
return this [ chainName ] ( function ( value ) {
return func . apply ( isArray ( value ) ? value : [ ] , args ) ;
} ) ;
} ;
} ) ;
// Map minified method names to their real names.
baseForOwn ( LazyWrapper . prototype , function ( func , methodName ) {
var lodashFunc = lodash [ methodName ] ;
if ( lodashFunc ) {
var key = ( lodashFunc . name + '' ) ,
names = realNames [ key ] || ( realNames [ key ] = [ ] ) ;
names . push ( { 'name' : methodName , 'func' : lodashFunc } ) ;
}
} ) ;
realNames [ createHybrid ( undefined , WRAP _BIND _KEY _FLAG ) . name ] = [ {
'name' : 'wrapper' ,
'func' : undefined
} ] ;
// Add methods to `LazyWrapper`.
LazyWrapper . prototype . clone = lazyClone ;
LazyWrapper . prototype . reverse = lazyReverse ;
LazyWrapper . prototype . value = lazyValue ;
// Add chain sequence methods to the `lodash` wrapper.
lodash . prototype . at = wrapperAt ;
lodash . prototype . chain = wrapperChain ;
lodash . prototype . commit = wrapperCommit ;
lodash . prototype . next = wrapperNext ;
lodash . prototype . plant = wrapperPlant ;
lodash . prototype . reverse = wrapperReverse ;
lodash . prototype . toJSON = lodash . prototype . valueOf = lodash . prototype . value = wrapperValue ;
// Add lazy aliases.
lodash . prototype . first = lodash . prototype . head ;
if ( symIterator ) {
lodash . prototype [ symIterator ] = wrapperToIterator ;
}
return lodash ;
} ) ;
/*--------------------------------------------------------------------------*/
// Export lodash.
var _ = runInContext ( ) ;
// Some AMD build optimizers, like r.js, check for condition patterns like:
if ( true ) {
// Expose Lodash on the global object to prevent errors when Lodash is
// loaded by a script tag in the presence of an AMD loader.
// See http://requirejs.org/docs/errors.html#mismatch for more details.
// Use `_.noConflict` to remove Lodash from the global object.
root . _ = _ ;
// Define as an anonymous module so, through path mapping, it can be
// referenced as the "underscore" module.
! ( _ _WEBPACK _AMD _DEFINE _RESULT _ _ = function ( ) {
return _ ;
} . call ( exports , _ _webpack _require _ _ , exports , module ) ,
_ _WEBPACK _AMD _DEFINE _RESULT _ _ !== undefined && ( module . exports = _ _WEBPACK _AMD _DEFINE _RESULT _ _ ) ) ;
}
// Check for `exports` after `define` in case a build optimizer adds it.
else if ( freeModule ) {
// Export for Node.js.
( freeModule . exports = _ ) . _ = _ ;
// Export for CommonJS support.
freeExports . _ = _ ;
} else {
// Export to the global object.
root . _ = _ ;
}
} . call ( this ) ) ;
/* WEBPACK VAR INJECTION */
} . call ( exports , _ _webpack _require _ _ ( 46 ) , _ _webpack _require _ _ ( 139 ) ( module ) ) )
/***/
} ) ,
/* 6 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _constant _ _ = _ _webpack _require _ _ ( 32 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = hue ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "c" ] = gamma ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = nogamma ;
function linear ( a , d ) {
return function ( t ) {
return a + t * d ;
} ;
}
function exponential ( a , b , y ) {
return a = Math . pow ( a , y ) , b = Math . pow ( b , y ) - a , y = 1 / y ,
function ( t ) {
return Math . pow ( a + t * b , y ) ;
} ;
}
function hue ( a , b ) {
var d = b - a ;
return d ? linear ( a , d > 180 || d < - 180 ? d - 360 * Math . round ( d / 360 ) : d ) : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _constant _ _ [ "a" /* default */ ] ) ( isNaN ( a ) ? b : a ) ;
}
function gamma ( y ) {
return ( y = + y ) === 1 ? nogamma : function ( a , b ) {
return b - a ? exponential ( a , b , y ) : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _constant _ _ [ "a" /* default */ ] ) ( isNaN ( a ) ? b : a ) ;
} ;
}
function nogamma ( a , b ) {
var d = b - a ;
return d ? linear ( a , d ) : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _constant _ _ [ "a" /* default */ ] ) ( isNaN ( a ) ? b : a ) ;
}
/***/
} ) ,
/* 7 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
return a = + a , b -= a ,
function ( t ) {
return a + b * t ;
} ;
} ;
/***/
} ) ,
/* 8 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = tweenValue ;
function tweenRemove ( id , name ) {
var tween0 , tween1 ;
return function ( ) {
var schedule = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) ,
tween = schedule . tween ;
// If this node shared tween with the previous node,
// just assign the updated shared tween and we’
// Otherwise, copy-on-write.
if ( tween !== tween0 ) {
tween1 = tween0 = tween ;
for ( var i = 0 , n = tween1 . length ; i < n ; ++ i ) {
if ( tween1 [ i ] . name === name ) {
tween1 = tween1 . slice ( ) ;
tween1 . splice ( i , 1 ) ;
break ;
}
}
}
schedule . tween = tween1 ;
} ;
}
function tweenFunction ( id , name , value ) {
var tween0 , tween1 ;
if ( typeof value !== "function" ) throw new Error ;
return function ( ) {
var schedule = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) ,
tween = schedule . tween ;
// If this node shared tween with the previous node,
// just assign the updated shared tween and we’
// Otherwise, copy-on-write.
if ( tween !== tween0 ) {
tween1 = ( tween0 = tween ) . slice ( ) ;
for ( var t = { name : name , value : value } , i = 0 , n = tween1 . length ; i < n ; ++ i ) {
if ( tween1 [ i ] . name === name ) {
tween1 [ i ] = t ;
break ;
}
}
if ( i === n ) tween1 . push ( t ) ;
}
schedule . tween = tween1 ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
var id = this . _id ;
name += "" ;
if ( arguments . length < 2 ) {
var tween = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( this . node ( ) , id ) . tween ;
for ( var i = 0 , n = tween . length , t ; i < n ; ++ i ) {
if ( ( t = tween [ i ] ) . name === name ) {
return t . value ;
}
}
return null ;
}
return this . each ( ( value == null ? tweenRemove : tweenFunction ) ( id , name , value ) ) ;
} ;
function tweenValue ( transition , name , value ) {
var id = transition . _id ;
transition . each ( function ( ) {
var schedule = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) ;
( schedule . value || ( schedule . value = { } ) ) [ name ] = value . apply ( this , arguments ) ;
} ) ;
return function ( node ) {
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( node , id ) . value [ name ] ;
} ;
}
/***/
} ) ,
/* 9 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ = _ _webpack _require _ _ ( 10 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "d" ] = Color ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "f" , function ( ) { return darker ; } ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "e" , function ( ) { return brighter ; } ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = color ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "c" ] = rgbConvert ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "h" ] = rgb ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = Rgb ;
/* unused harmony export hslConvert */
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "g" ] = hsl ;
function Color ( ) { }
var darker = 0.7 ;
var brighter = 1 / darker ;
var reI = "\\s*([+-]?\\d+)\\s*" ,
reN = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*" ,
reP = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*" ,
reHex3 = /^#([0-9a-f]{3})$/ ,
reHex6 = /^#([0-9a-f]{6})$/ ,
reRgbInteger = new RegExp ( "^rgb\\(" + [ reI , reI , reI ] + "\\)$" ) ,
reRgbPercent = new RegExp ( "^rgb\\(" + [ reP , reP , reP ] + "\\)$" ) ,
reRgbaInteger = new RegExp ( "^rgba\\(" + [ reI , reI , reI , reN ] + "\\)$" ) ,
reRgbaPercent = new RegExp ( "^rgba\\(" + [ reP , reP , reP , reN ] + "\\)$" ) ,
reHslPercent = new RegExp ( "^hsl\\(" + [ reN , reP , reP ] + "\\)$" ) ,
reHslaPercent = new RegExp ( "^hsla\\(" + [ reN , reP , reP , reN ] + "\\)$" ) ;
var named = {
aliceblue : 0xf0f8ff ,
antiquewhite : 0xfaebd7 ,
aqua : 0x00ffff ,
aquamarine : 0x7fffd4 ,
azure : 0xf0ffff ,
beige : 0xf5f5dc ,
bisque : 0xffe4c4 ,
black : 0x000000 ,
blanchedalmond : 0xffebcd ,
blue : 0x0000ff ,
blueviolet : 0x8a2be2 ,
brown : 0xa52a2a ,
burlywood : 0xdeb887 ,
cadetblue : 0x5f9ea0 ,
chartreuse : 0x7fff00 ,
chocolate : 0xd2691e ,
coral : 0xff7f50 ,
cornflowerblue : 0x6495ed ,
cornsilk : 0xfff8dc ,
crimson : 0xdc143c ,
cyan : 0x00ffff ,
darkblue : 0x00008b ,
darkcyan : 0x008b8b ,
darkgoldenrod : 0xb8860b ,
darkgray : 0xa9a9a9 ,
darkgreen : 0x006400 ,
darkgrey : 0xa9a9a9 ,
darkkhaki : 0xbdb76b ,
darkmagenta : 0x8b008b ,
darkolivegreen : 0x556b2f ,
darkorange : 0xff8c00 ,
darkorchid : 0x9932cc ,
darkred : 0x8b0000 ,
darksalmon : 0xe9967a ,
darkseagreen : 0x8fbc8f ,
darkslateblue : 0x483d8b ,
darkslategray : 0x2f4f4f ,
darkslategrey : 0x2f4f4f ,
darkturquoise : 0x00ced1 ,
darkviolet : 0x9400d3 ,
deeppink : 0xff1493 ,
deepskyblue : 0x00bfff ,
dimgray : 0x696969 ,
dimgrey : 0x696969 ,
dodgerblue : 0x1e90ff ,
firebrick : 0xb22222 ,
floralwhite : 0xfffaf0 ,
forestgreen : 0x228b22 ,
fuchsia : 0xff00ff ,
gainsboro : 0xdcdcdc ,
ghostwhite : 0xf8f8ff ,
gold : 0xffd700 ,
goldenrod : 0xdaa520 ,
gray : 0x808080 ,
green : 0x008000 ,
greenyellow : 0xadff2f ,
grey : 0x808080 ,
honeydew : 0xf0fff0 ,
hotpink : 0xff69b4 ,
indianred : 0xcd5c5c ,
indigo : 0x4b0082 ,
ivory : 0xfffff0 ,
khaki : 0xf0e68c ,
lavender : 0xe6e6fa ,
lavenderblush : 0xfff0f5 ,
lawngreen : 0x7cfc00 ,
lemonchiffon : 0xfffacd ,
lightblue : 0xadd8e6 ,
lightcoral : 0xf08080 ,
lightcyan : 0xe0ffff ,
lightgoldenrodyellow : 0xfafad2 ,
lightgray : 0xd3d3d3 ,
lightgreen : 0x90ee90 ,
lightgrey : 0xd3d3d3 ,
lightpink : 0xffb6c1 ,
lightsalmon : 0xffa07a ,
lightseagreen : 0x20b2aa ,
lightskyblue : 0x87cefa ,
lightslategray : 0x778899 ,
lightslategrey : 0x778899 ,
lightsteelblue : 0xb0c4de ,
lightyellow : 0xffffe0 ,
lime : 0x00ff00 ,
limegreen : 0x32cd32 ,
linen : 0xfaf0e6 ,
magenta : 0xff00ff ,
maroon : 0x800000 ,
mediumaquamarine : 0x66cdaa ,
mediumblue : 0x0000cd ,
mediumorchid : 0xba55d3 ,
mediumpurple : 0x9370db ,
mediumseagreen : 0x3cb371 ,
mediumslateblue : 0x7b68ee ,
mediumspringgreen : 0x00fa9a ,
mediumturquoise : 0x48d1cc ,
mediumvioletred : 0xc71585 ,
midnightblue : 0x191970 ,
mintcream : 0xf5fffa ,
mistyrose : 0xffe4e1 ,
moccasin : 0xffe4b5 ,
navajowhite : 0xffdead ,
navy : 0x000080 ,
oldlace : 0xfdf5e6 ,
olive : 0x808000 ,
olivedrab : 0x6b8e23 ,
orange : 0xffa500 ,
orangered : 0xff4500 ,
orchid : 0xda70d6 ,
palegoldenrod : 0xeee8aa ,
palegreen : 0x98fb98 ,
paleturquoise : 0xafeeee ,
palevioletred : 0xdb7093 ,
papayawhip : 0xffefd5 ,
peachpuff : 0xffdab9 ,
peru : 0xcd853f ,
pink : 0xffc0cb ,
plum : 0xdda0dd ,
powderblue : 0xb0e0e6 ,
purple : 0x800080 ,
rebeccapurple : 0x663399 ,
red : 0xff0000 ,
rosybrown : 0xbc8f8f ,
royalblue : 0x4169e1 ,
saddlebrown : 0x8b4513 ,
salmon : 0xfa8072 ,
sandybrown : 0xf4a460 ,
seagreen : 0x2e8b57 ,
seashell : 0xfff5ee ,
sienna : 0xa0522d ,
silver : 0xc0c0c0 ,
skyblue : 0x87ceeb ,
slateblue : 0x6a5acd ,
slategray : 0x708090 ,
slategrey : 0x708090 ,
snow : 0xfffafa ,
springgreen : 0x00ff7f ,
steelblue : 0x4682b4 ,
tan : 0xd2b48c ,
teal : 0x008080 ,
thistle : 0xd8bfd8 ,
tomato : 0xff6347 ,
turquoise : 0x40e0d0 ,
violet : 0xee82ee ,
wheat : 0xf5deb3 ,
white : 0xffffff ,
whitesmoke : 0xf5f5f5 ,
yellow : 0xffff00 ,
yellowgreen : 0x9acd32
} ;
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Color , color , {
displayable : function ( ) {
return this . rgb ( ) . displayable ( ) ;
} ,
toString : function ( ) {
return this . rgb ( ) + "" ;
}
} ) ;
function color ( format ) {
var m ;
format = ( format + "" ) . trim ( ) . toLowerCase ( ) ;
return ( m = reHex3 . exec ( format ) ) ? ( m = parseInt ( m [ 1 ] , 16 ) , new Rgb ( ( m >> 8 & 0xf ) | ( m >> 4 & 0x0f0 ) , ( m >> 4 & 0xf ) | ( m & 0xf0 ) , ( ( m & 0xf ) << 4 ) | ( m & 0xf ) , 1 ) ) // #f00
:
( m = reHex6 . exec ( format ) ) ? rgbn ( parseInt ( m [ 1 ] , 16 ) ) // #ff0000
:
( m = reRgbInteger . exec ( format ) ) ? new Rgb ( m [ 1 ] , m [ 2 ] , m [ 3 ] , 1 ) // rgb(255, 0, 0)
:
( m = reRgbPercent . exec ( format ) ) ? new Rgb ( m [ 1 ] * 255 / 100 , m [ 2 ] * 255 / 100 , m [ 3 ] * 255 / 100 , 1 ) // rgb(100%, 0%, 0%)
:
( m = reRgbaInteger . exec ( format ) ) ? rgba ( m [ 1 ] , m [ 2 ] , m [ 3 ] , m [ 4 ] ) // rgba(255, 0, 0, 1)
:
( m = reRgbaPercent . exec ( format ) ) ? rgba ( m [ 1 ] * 255 / 100 , m [ 2 ] * 255 / 100 , m [ 3 ] * 255 / 100 , m [ 4 ] ) // rgb(100%, 0%, 0%, 1)
:
( m = reHslPercent . exec ( format ) ) ? hsla ( m [ 1 ] , m [ 2 ] / 100 , m [ 3 ] / 100 , 1 ) // hsl(120, 50%, 50%)
:
( m = reHslaPercent . exec ( format ) ) ? hsla ( m [ 1 ] , m [ 2 ] / 100 , m [ 3 ] / 100 , m [ 4 ] ) // hsla(120, 50%, 50%, 1)
:
named . hasOwnProperty ( format ) ? rgbn ( named [ format ] ) :
format === "transparent" ? new Rgb ( NaN , NaN , NaN , 0 ) :
null ;
}
function rgbn ( n ) {
return new Rgb ( n >> 16 & 0xff , n >> 8 & 0xff , n & 0xff , 1 ) ;
}
function rgba ( r , g , b , a ) {
if ( a <= 0 ) r = g = b = NaN ;
return new Rgb ( r , g , b , a ) ;
}
function rgbConvert ( o ) {
if ( ! ( o instanceof Color ) ) o = color ( o ) ;
if ( ! o ) return new Rgb ;
o = o . rgb ( ) ;
return new Rgb ( o . r , o . g , o . b , o . opacity ) ;
}
function rgb ( r , g , b , opacity ) {
return arguments . length === 1 ? rgbConvert ( r ) : new Rgb ( r , g , b , opacity == null ? 1 : opacity ) ;
}
function Rgb ( r , g , b , opacity ) {
this . r = + r ;
this . g = + g ;
this . b = + b ;
this . opacity = + opacity ;
}
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Rgb , rgb , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "b" /* extend */ ] ) ( Color , {
brighter : function ( k ) {
k = k == null ? brighter : Math . pow ( brighter , k ) ;
return new Rgb ( this . r * k , this . g * k , this . b * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? darker : Math . pow ( darker , k ) ;
return new Rgb ( this . r * k , this . g * k , this . b * k , this . opacity ) ;
} ,
rgb : function ( ) {
return this ;
} ,
displayable : function ( ) {
return ( 0 <= this . r && this . r <= 255 ) &&
( 0 <= this . g && this . g <= 255 ) &&
( 0 <= this . b && this . b <= 255 ) &&
( 0 <= this . opacity && this . opacity <= 1 ) ;
} ,
toString : function ( ) {
var a = this . opacity ;
a = isNaN ( a ) ? 1 : Math . max ( 0 , Math . min ( 1 , a ) ) ;
return ( a === 1 ? "rgb(" : "rgba(" ) +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . r ) || 0 ) ) + ", " +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . g ) || 0 ) ) + ", " +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . b ) || 0 ) ) +
( a === 1 ? ")" : ", " + a + ")" ) ;
}
} ) ) ;
function hsla ( h , s , l , a ) {
if ( a <= 0 ) h = s = l = NaN ;
else if ( l <= 0 || l >= 1 ) h = s = NaN ;
else if ( s <= 0 ) h = NaN ;
return new Hsl ( h , s , l , a ) ;
}
function hslConvert ( o ) {
if ( o instanceof Hsl ) return new Hsl ( o . h , o . s , o . l , o . opacity ) ;
if ( ! ( o instanceof Color ) ) o = color ( o ) ;
if ( ! o ) return new Hsl ;
if ( o instanceof Hsl ) return o ;
o = o . rgb ( ) ;
var r = o . r / 255 ,
g = o . g / 255 ,
b = o . b / 255 ,
min = Math . min ( r , g , b ) ,
max = Math . max ( r , g , b ) ,
h = NaN ,
s = max - min ,
l = ( max + min ) / 2 ;
if ( s ) {
if ( r === max ) h = ( g - b ) / s + ( g < b ) * 6 ;
else if ( g === max ) h = ( b - r ) / s + 2 ;
else h = ( r - g ) / s + 4 ;
s /= l < 0.5 ? max + min : 2 - max - min ;
h *= 60 ;
} else {
s = l > 0 && l < 1 ? 0 : h ;
}
return new Hsl ( h , s , l , o . opacity ) ;
}
function hsl ( h , s , l , opacity ) {
return arguments . length === 1 ? hslConvert ( h ) : new Hsl ( h , s , l , opacity == null ? 1 : opacity ) ;
}
function Hsl ( h , s , l , opacity ) {
this . h = + h ;
this . s = + s ;
this . l = + l ;
this . opacity = + opacity ;
}
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Hsl , hsl , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "b" /* extend */ ] ) ( Color , {
brighter : function ( k ) {
k = k == null ? brighter : Math . pow ( brighter , k ) ;
return new Hsl ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? darker : Math . pow ( darker , k ) ;
return new Hsl ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
rgb : function ( ) {
var h = this . h % 360 + ( this . h < 0 ) * 360 ,
s = isNaN ( h ) || isNaN ( this . s ) ? 0 : this . s ,
l = this . l ,
m2 = l + ( l < 0.5 ? l : 1 - l ) * s ,
m1 = 2 * l - m2 ;
return new Rgb (
hsl2rgb ( h >= 240 ? h - 240 : h + 120 , m1 , m2 ) ,
hsl2rgb ( h , m1 , m2 ) ,
hsl2rgb ( h < 120 ? h + 240 : h - 120 , m1 , m2 ) ,
this . opacity
) ;
} ,
displayable : function ( ) {
return ( 0 <= this . s && this . s <= 1 || isNaN ( this . s ) ) &&
( 0 <= this . l && this . l <= 1 ) &&
( 0 <= this . opacity && this . opacity <= 1 ) ;
}
} ) ) ;
/* From FvD 13.37, CSS Color Module Level 3 */
function hsl2rgb ( h , m1 , m2 ) {
return ( h < 60 ? m1 + ( m2 - m1 ) * h / 60 :
h < 180 ? m2 :
h < 240 ? m1 + ( m2 - m1 ) * ( 240 - h ) / 60 :
m1 ) * 255 ;
}
/***/
} ) ,
/* 10 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = extend ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( constructor , factory , prototype ) {
constructor . prototype = factory . prototype = prototype ;
prototype . constructor = constructor ;
} ;
function extend ( parent , definition ) {
var prototype = Object . create ( parent . prototype ) ;
for ( var key in definition ) prototype [ key ] = definition [ key ] ;
return prototype ;
}
/***/
} ) ,
/* 11 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _value _ _ = _ _webpack _require _ _ ( 13 ) ;
/* unused harmony reexport interpolate */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _array _ _ = _ _webpack _require _ _ ( 30 ) ;
/* unused harmony reexport interpolateArray */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _basis _ _ = _ _webpack _require _ _ ( 12 ) ;
/* unused harmony reexport interpolateBasis */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _src _basisClosed _ _ = _ _webpack _require _ _ ( 31 ) ;
/* unused harmony reexport interpolateBasisClosed */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _src _date _ _ = _ _webpack _require _ _ ( 33 ) ;
/* unused harmony reexport interpolateDate */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _src _number _ _ = _ _webpack _require _ _ ( 7 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _5 _ _src _number _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _src _object _ _ = _ _webpack _require _ _ ( 34 ) ;
/* unused harmony reexport interpolateObject */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _src _round _ _ = _ _webpack _require _ _ ( 74 ) ;
/* unused harmony reexport interpolateRound */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _8 _ _src _string _ _ = _ _webpack _require _ _ ( 36 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "d" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _8 _ _src _string _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _9 _ _src _transform _index _ _ = _ _webpack _require _ _ ( 76 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _9 _ _src _transform _index _ _ [ "a" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "e" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _9 _ _src _transform _index _ _ [ "b" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _10 _ _src _zoom _ _ = _ _webpack _require _ _ ( 78 ) ;
/* unused harmony reexport interpolateZoom */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _11 _ _src _rgb _ _ = _ _webpack _require _ _ ( 35 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "c" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _11 _ _src _rgb _ _ [ "a" ] ; } ) ;
/* unused harmony reexport interpolateRgbBasis */
/* unused harmony reexport interpolateRgbBasisClosed */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _12 _ _src _hsl _ _ = _ _webpack _require _ _ ( 71 ) ;
/* unused harmony reexport interpolateHsl */
/* unused harmony reexport interpolateHslLong */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _13 _ _src _lab _ _ = _ _webpack _require _ _ ( 72 ) ;
/* unused harmony reexport interpolateLab */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _14 _ _src _hcl _ _ = _ _webpack _require _ _ ( 70 ) ;
/* unused harmony reexport interpolateHcl */
/* unused harmony reexport interpolateHclLong */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _15 _ _src _cubehelix _ _ = _ _webpack _require _ _ ( 69 ) ;
/* unused harmony reexport interpolateCubehelix */
/* unused harmony reexport interpolateCubehelixLong */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _16 _ _src _quantize _ _ = _ _webpack _require _ _ ( 73 ) ;
/* unused harmony reexport quantize */
/***/
} ) ,
/* 12 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = basis ;
function basis ( t1 , v0 , v1 , v2 , v3 ) {
var t2 = t1 * t1 ,
t3 = t2 * t1 ;
return ( ( 1 - 3 * t1 + 3 * t2 - t3 ) * v0 +
( 4 - 6 * t2 + 3 * t3 ) * v1 +
( 1 + 3 * t1 + 3 * t2 - 3 * t3 ) * v2 +
t3 * v3 ) / 6 ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( values ) {
var n = values . length - 1 ;
return function ( t ) {
var i = t <= 0 ? ( t = 0 ) : t >= 1 ? ( t = 1 , n - 1 ) : Math . floor ( t * n ) ,
v1 = values [ i ] ,
v2 = values [ i + 1 ] ,
v0 = i > 0 ? values [ i - 1 ] : 2 * v1 - v2 ,
v3 = i < n - 1 ? values [ i + 2 ] : 2 * v2 - v1 ;
return basis ( ( t - i / n ) * n , v0 , v1 , v2 , v3 ) ;
} ;
} ;
/***/
} ) ,
/* 13 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _rgb _ _ = _ _webpack _require _ _ ( 35 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _array _ _ = _ _webpack _require _ _ ( 30 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _date _ _ = _ _webpack _require _ _ ( 33 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _number _ _ = _ _webpack _require _ _ ( 7 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _object _ _ = _ _webpack _require _ _ ( 34 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _string _ _ = _ _webpack _require _ _ ( 36 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _constant _ _ = _ _webpack _require _ _ ( 32 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var t = typeof b ,
c ;
return b == null || t === "boolean" ? _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _7 _ _constant _ _ [ "a" /* default */ ] ) ( b ) :
( t === "number" ? _ _WEBPACK _IMPORTED _MODULE _4 _ _number _ _ [ "a" /* default */ ] :
t === "string" ? ( ( c = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "a" /* color */ ] ) ( b ) ) ? ( b = c , _ _WEBPACK _IMPORTED _MODULE _1 _ _rgb _ _ [ "a" /* default */ ] ) : _ _WEBPACK _IMPORTED _MODULE _6 _ _string _ _ [ "a" /* default */ ] ) :
b instanceof _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "a" /* color */ ] ? _ _WEBPACK _IMPORTED _MODULE _1 _ _rgb _ _ [ "a" /* default */ ] :
b instanceof Date ? _ _WEBPACK _IMPORTED _MODULE _3 _ _date _ _ [ "a" /* default */ ] :
Array . isArray ( b ) ? _ _WEBPACK _IMPORTED _MODULE _2 _ _array _ _ [ "a" /* default */ ] :
isNaN ( b ) ? _ _WEBPACK _IMPORTED _MODULE _5 _ _object _ _ [ "a" /* default */ ] :
_ _WEBPACK _IMPORTED _MODULE _4 _ _number _ _ [ "a" /* default */ ] ) ( a , b ) ;
} ;
/***/
} ) ,
/* 14 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _namespace _ _ = _ _webpack _require _ _ ( 15 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _namespaces _ _ = _ _webpack _require _ _ ( 16 ) ;
function creatorInherit ( name ) {
return function ( ) {
var document = this . ownerDocument ,
uri = this . namespaceURI ;
return uri === _ _WEBPACK _IMPORTED _MODULE _1 _ _namespaces _ _ [ "b" /* xhtml */ ] && document . documentElement . namespaceURI === _ _WEBPACK _IMPORTED _MODULE _1 _ _namespaces _ _ [ "b" /* xhtml */ ] ?
document . createElement ( name ) :
document . createElementNS ( uri , name ) ;
} ;
}
function creatorFixed ( fullname ) {
return function ( ) {
return this . ownerDocument . createElementNS ( fullname . space , fullname . local ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name ) {
var fullname = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _namespace _ _ [ "a" /* default */ ] ) ( name ) ;
return ( fullname . local ?
creatorFixed :
creatorInherit ) ( fullname ) ;
} ;
/***/
} ) ,
/* 15 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _namespaces _ _ = _ _webpack _require _ _ ( 16 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name ) {
var prefix = name += "" ,
i = prefix . indexOf ( ":" ) ;
if ( i >= 0 && ( prefix = name . slice ( 0 , i ) ) !== "xmlns" ) name = name . slice ( i + 1 ) ;
return _ _WEBPACK _IMPORTED _MODULE _0 _ _namespaces _ _ [ "a" /* default */ ] . hasOwnProperty ( prefix ) ? { space : _ _WEBPACK _IMPORTED _MODULE _0 _ _namespaces _ _ [ "a" /* default */ ] [ prefix ] , local : name } : name ;
} ;
/***/
} ) ,
/* 16 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return xhtml ; } ) ;
var xhtml = "http://www.w3.org/1999/xhtml" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = {
svg : "http://www.w3.org/2000/svg" ,
xhtml : xhtml ,
xlink : "http://www.w3.org/1999/xlink" ,
xml : "http://www.w3.org/XML/1998/namespace" ,
xmlns : "http://www.w3.org/2000/xmlns/"
} ;
/***/
} ) ,
/* 17 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node , event ) {
var svg = node . ownerSVGElement || node ;
if ( svg . createSVGPoint ) {
var point = svg . createSVGPoint ( ) ;
point . x = event . clientX , point . y = event . clientY ;
point = point . matrixTransform ( node . getScreenCTM ( ) . inverse ( ) ) ;
return [ point . x , point . y ] ;
}
var rect = node . getBoundingClientRect ( ) ;
return [ event . clientX - rect . left - node . clientLeft , event . clientY - rect . top - node . clientTop ] ;
} ;
/***/
} ) ,
/* 18 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return event ; } ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = customEvent ;
var filterEvents = { } ;
var event = null ;
if ( typeof document !== "undefined" ) {
var element = document . documentElement ;
if ( ! ( "onmouseenter" in element ) ) {
filterEvents = { mouseenter : "mouseover" , mouseleave : "mouseout" } ;
}
}
function filterContextListener ( listener , index , group ) {
listener = contextListener ( listener , index , group ) ;
return function ( event ) {
var related = event . relatedTarget ;
if ( ! related || ( related !== this && ! ( related . compareDocumentPosition ( this ) & 8 ) ) ) {
listener . call ( this , event ) ;
}
} ;
}
function contextListener ( listener , index , group ) {
return function ( event1 ) {
var event0 = event ; // Events can be reentrant (e.g., focus).
event = event1 ;
try {
listener . call ( this , this . _ _data _ _ , index , group ) ;
} finally {
event = event0 ;
}
} ;
}
function parseTypenames ( typenames ) {
return typenames . trim ( ) . split ( /^|\s+/ ) . map ( function ( t ) {
var name = "" ,
i = t . indexOf ( "." ) ;
if ( i >= 0 ) name = t . slice ( i + 1 ) , t = t . slice ( 0 , i ) ;
return { type : t , name : name } ;
} ) ;
}
function onRemove ( typename ) {
return function ( ) {
var on = this . _ _on ;
if ( ! on ) return ;
for ( var j = 0 , i = - 1 , m = on . length , o ; j < m ; ++ j ) {
if ( o = on [ j ] , ( ! typename . type || o . type === typename . type ) && o . name === typename . name ) {
this . removeEventListener ( o . type , o . listener , o . capture ) ;
} else {
on [ ++ i ] = o ;
}
}
if ( ++ i ) on . length = i ;
else delete this . _ _on ;
} ;
}
function onAdd ( typename , value , capture ) {
var wrap = filterEvents . hasOwnProperty ( typename . type ) ? filterContextListener : contextListener ;
return function ( d , i , group ) {
var on = this . _ _on ,
o , listener = wrap ( value , i , group ) ;
if ( on )
for ( var j = 0 , m = on . length ; j < m ; ++ j ) {
if ( ( o = on [ j ] ) . type === typename . type && o . name === typename . name ) {
this . removeEventListener ( o . type , o . listener , o . capture ) ;
this . addEventListener ( o . type , o . listener = listener , o . capture = capture ) ;
o . value = value ;
return ;
}
}
this . addEventListener ( typename . type , listener , capture ) ;
o = { type : typename . type , name : typename . name , value : value , listener : listener , capture : capture } ;
if ( ! on ) this . _ _on = [ o ] ;
else on . push ( o ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "c" ] = function ( typename , value , capture ) {
var typenames = parseTypenames ( typename + "" ) ,
i , n = typenames . length ,
t ;
if ( arguments . length < 2 ) {
var on = this . node ( ) . _ _on ;
if ( on )
for ( var j = 0 , m = on . length , o ; j < m ; ++ j ) {
for ( i = 0 , o = on [ j ] ; i < n ; ++ i ) {
if ( ( t = typenames [ i ] ) . type === o . type && t . name === o . name ) {
return o . value ;
}
}
}
return ;
}
on = value ? onAdd : onRemove ;
if ( capture == null ) capture = false ;
for ( i = 0 ; i < n ; ++ i ) this . each ( on ( typenames [ i ] , value , capture ) ) ;
return this ;
} ;
function customEvent ( event1 , listener , that , args ) {
var event0 = event ;
event1 . sourceEvent = event ;
event = event1 ;
try {
return listener . apply ( that , args ) ;
} finally {
event = event0 ;
}
}
/***/
} ) ,
/* 19 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function none ( ) { }
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( selector ) {
return selector == null ? none : function ( ) {
return this . querySelector ( selector ) ;
} ;
} ;
/***/
} ) ,
/* 20 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _on _ _ = _ _webpack _require _ _ ( 18 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
var current = _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _on _ _ [ "a" /* event */ ] ,
source ;
while ( source = current . sourceEvent ) current = source ;
return current ;
} ;
/***/
} ) ,
/* 21 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node ) {
return ( node . ownerDocument && node . ownerDocument . defaultView ) // node is a Node
||
( node . document && node ) // node is a Window
||
node . defaultView ; // node is a Document
} ;
/***/
} ) ,
/* 22 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "c" ] = now ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = Timer ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = timer ;
/* unused harmony export timerFlush */
var frame = 0 , // is an animation frame pending?
timeout = 0 , // is a timeout pending?
interval = 0 , // are any timers active?
pokeDelay = 1000 , // how frequently we check for clock skew
taskHead ,
taskTail ,
clockLast = 0 ,
clockNow = 0 ,
clockSkew = 0 ,
clock = typeof performance === "object" && performance . now ? performance : Date ,
setFrame = typeof requestAnimationFrame === "function" ? requestAnimationFrame : function ( f ) { setTimeout ( f , 17 ) ; } ;
function now ( ) {
return clockNow || ( setFrame ( clearNow ) , clockNow = clock . now ( ) + clockSkew ) ;
}
function clearNow ( ) {
clockNow = 0 ;
}
function Timer ( ) {
this . _call =
this . _time =
this . _next = null ;
}
Timer . prototype = timer . prototype = {
constructor : Timer ,
restart : function ( callback , delay , time ) {
if ( typeof callback !== "function" ) throw new TypeError ( "callback is not a function" ) ;
time = ( time == null ? now ( ) : + time ) + ( delay == null ? 0 : + delay ) ;
if ( ! this . _next && taskTail !== this ) {
if ( taskTail ) taskTail . _next = this ;
else taskHead = this ;
taskTail = this ;
}
this . _call = callback ;
this . _time = time ;
sleep ( ) ;
} ,
stop : function ( ) {
if ( this . _call ) {
this . _call = null ;
this . _time = Infinity ;
sleep ( ) ;
}
}
} ;
function timer ( callback , delay , time ) {
var t = new Timer ;
t . restart ( callback , delay , time ) ;
return t ;
}
function timerFlush ( ) {
now ( ) ; // Get the current time, if not already set.
++ frame ; // Pretend we’ ’
var t = taskHead ,
e ;
while ( t ) {
if ( ( e = clockNow - t . _time ) >= 0 ) t . _call . call ( null , e ) ;
t = t . _next ;
}
-- frame ;
}
function wake ( ) {
clockNow = ( clockLast = clock . now ( ) ) + clockSkew ;
frame = timeout = 0 ;
try {
timerFlush ( ) ;
} finally {
frame = 0 ;
nap ( ) ;
clockNow = 0 ;
}
}
function poke ( ) {
var now = clock . now ( ) ,
delay = now - clockLast ;
if ( delay > pokeDelay ) clockSkew -= delay , clockLast = now ;
}
function nap ( ) {
var t0 , t1 = taskHead ,
t2 , time = Infinity ;
while ( t1 ) {
if ( t1 . _call ) {
if ( time > t1 . _time ) time = t1 . _time ;
t0 = t1 , t1 = t1 . _next ;
} else {
t2 = t1 . _next , t1 . _next = null ;
t1 = t0 ? t0 . _next = t2 : taskHead = t2 ;
}
}
taskTail = t0 ;
sleep ( time ) ;
}
function sleep ( time ) {
if ( frame ) return ; // Soonest alarm already set, or will be.
if ( timeout ) timeout = clearTimeout ( timeout ) ;
var delay = time - clockNow ;
if ( delay > 24 ) {
if ( time < Infinity ) timeout = setTimeout ( wake , delay ) ;
if ( interval ) interval = clearInterval ( interval ) ;
} else {
if ( ! interval ) clockLast = clockNow , interval = setInterval ( poke , pokeDelay ) ;
frame = 1 , setFrame ( wake ) ;
}
}
/***/
} ) ,
/* 23 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _slicedToArray = function ( ) {
function sliceIterator ( arr , i ) {
var _arr = [ ] ;
var _n = true ;
var _d = false ;
var _e = undefined ;
try { for ( var _i = arr [ Symbol . iterator ] ( ) , _s ; ! ( _n = ( _s = _i . next ( ) ) . done ) ; _n = true ) { _arr . push ( _s . value ) ; if ( i && _arr . length === i ) break ; } } catch ( err ) {
_d = true ;
_e = err ;
} finally { try { if ( ! _n && _i [ "return" ] ) _i [ "return" ] ( ) ; } finally { if ( _d ) throw _e ; } }
return _arr ;
}
return function ( arr , i ) { if ( Array . isArray ( arr ) ) { return arr ; } else if ( Symbol . iterator in Object ( arr ) ) { return sliceIterator ( arr , i ) ; } else { throw new TypeError ( "Invalid attempt to destructure non-iterable instance" ) ; } } ;
} ( ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
var _heap = _ _webpack _require _ _ ( 45 ) ;
var _heap2 = _interopRequireDefault ( _heap ) ;
var _RawGraph = _ _webpack _require _ _ ( 50 ) ;
var _RawGraph2 = _interopRequireDefault ( _RawGraph ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var DEFAULT _NODE _COUNT = 150 ;
function growSeq ( seq , terms , minSupport , maxSupport , itemset ) {
/* find the next frequent sequence by inserting a new word to current sequence */
var pos = - 1 ;
var word = null ;
var count = 0 ;
var len = seq . words . length ;
var _loop = function _loop ( s ) {
var fdist = { } ;
seq . DBs . forEach ( function ( t ) {
var l = s === 0 ? 0 : t . seqIndices [ s - 1 ] + 1 ;
var r = s === len ? t . tokens . length : t . seqIndices [ s ] ;
var duplicate = { } ;
for ( var _i = l ; _i < r ; _i ++ ) {
var w = t . tokens [ _i ] ;
if ( duplicate [ w ] ) continue ;
duplicate [ w ] = true ;
if ( w in fdist ) {
fdist [ w ] += t . count ;
} else {
fdist [ w ] = t . count ;
}
}
} ) ;
var maxw = null ;
var maxc = 0 ;
var isNotRoot = len > 0 ;
var words = isNotRoot ? Object . keys ( fdist ) : Object . keys ( fdist ) . filter ( function ( w ) {
return ! itemset [ w ] . startsWith ( '#' ) ;
} ) ;
words . forEach ( function ( w ) {
var value = fdist [ w ] ;
if ( value < maxSupport && ( value / Math . max ( idfTable [ itemset [ w ] ] , 1000 ) ) * 1000 > maxc ) {
maxw = + w ;
maxc = ( value / Math . max ( idfTable [ itemset [ w ] ] , 1000 ) ) * 1000 ;
}
} ) ;
console . log ( itemset )
if ( maxc > count ) {
pos = s ;
word = maxw ;
count = maxc ;
}
} ;
for ( var s = 0 ; s <= len ; s ++ ) {
_loop ( s ) ;
}
var s0 = null ;
var s1 = null ;
/* split the current group in two */
if ( count >= minSupport ) {
s0 = { size : 0 , DBs : [ ] } ;
s1 = { size : 0 , DBs : [ ] } ;
var words = seq . words ;
for ( var ti = 0 ; ti < seq . DBs . length ; ti ++ ) {
var t = seq . DBs [ ti ] ;
var l = pos === 0 ? 0 : t . seqIndices [ pos - 1 ] + 1 ;
var r = pos === words . length ? t . tokens . length : t . seqIndices [ pos ] ;
var i = t . tokens . slice ( l , r ) . indexOf ( word ) ;
if ( i < 0 ) {
s0 . DBs . push ( t ) ;
s0 . size += t . count ;
} else {
i += l ;
t . seqIndices . splice ( pos , 0 , i ) ;
s1 . DBs . push ( t ) ;
s1 . size += t . count ;
}
}
}
console . log ( { 's0' : s0 , 's1' : s1 } )
return { word : word , pos : pos , count : count , s0 : s0 , s1 : s1 } ;
}
function expandSeqTree ( rootSeq , graphs , expandCnt , minSupport , maxSupport , terms , itemset ) {
if ( rootSeq . words && rootSeq . words . length > 0 ) {
rootSeq . graph . nodes = rootSeq . graph . nodes . concat ( rootSeq . words ) ;
expandCnt -= rootSeq . words . length ;
}
/* Create a max heap */
var seqs = new _heap2 . default ( function ( a , b ) {
return b . size - a . size ;
} ) ;
seqs . push ( rootSeq ) ;
var leafSeqs = [ ] ;
console . log ( JSON . parse ( JSON . stringify ( seqs ) ) )
while ( ! seqs . empty ( ) && expandCnt > 0 ) {
/* find the candidate sequence with largest support DB */
var s = seqs . pop ( ) ;
console . log ( { 's' : s , 'seqs' : seqs } )
var graph = s . graph ;
var s0 = s . r ;
var s1 = s . l ;
if ( ! s0 && ! s1 ) {
/* find the next frequent sequence */
var result = growSeq ( s , terms , minSupport , maxSupport , itemset ) ;
console . log ( result )
s0 = result . s0 ;
s1 = result . s1 ;
var word = result . word ,
pos = result . pos ,
count = result . count ;
if ( count < minSupport ) {
leafSeqs . push ( s ) ;
} else {
/* create new sequences and add new word */
if ( ! graph ) {
graph = new _RawGraph2 . default ( minSupport , maxSupport ) ;
graphs . push ( graph ) ;
}
var newWord = {
id : graph . totalNodeCnt ++ ,
entity : itemset [ word ] ,
freq : count ,
topEntries : s1 . DBs . slice ( 0 , 5 ) ,
seq : s1
} ;
var newWords = s . words . slice ( ) ;
newWords . splice ( pos , 0 , newWord ) ;
s0 . words = s . words ;
s1 . words = newWords ;
s1 . newWord = newWord ;
s0 . graph = s . graph ;
s1 . graph = graph ;
}
}
if ( s1 ) {
s1 . graph . nodes . push ( s1 . newWord ) ;
expandCnt -- ;
}
/* add new sequences to seqTree */
s . l = s1 ;
s . r = s0 ;
/* add new sequences to candidates */
if ( s1 ) {
seqs . push ( s1 ) ;
}
if ( s0 && s0 . size >= minSupport ) {
seqs . push ( s0 ) ;
}
}
return leafSeqs . concat ( seqs . toArray ( ) ) ;
}
function updateNodesEdges ( graphs , leafSeqs ) {
leafSeqs . filter ( function ( seq ) {
return graphs . indexOf ( seq . graph ) >= 0 ;
} ) . forEach ( function ( seq ) {
var words = seq . words ;
var linkadj = seq . graph . linkadj ;
//printSeq(seq);
for ( var i = 0 ; i < words . length - 1 ; i ++ ) {
var word = words [ i ] ;
var id = word . id ;
var nextId = words [ i + 1 ] . id ;
if ( ! ( id in linkadj ) ) linkadj [ id ] = { } ;
if ( nextId in linkadj [ id ] ) {
linkadj [ id ] [ nextId ] += seq . size ;
} else {
linkadj [ id ] [ nextId ] = seq . size ;
}
}
words . filter ( function ( word ) {
return ! word . leafSeq || word . leafSeq < seq . size ;
} ) . forEach ( function ( word ) {
word . leafSeq = seq ;
} ) ;
} ) ;
}
function printSeq ( words ) {
var str = words . map ( function ( w ) {
return w . entity ;
} ) . join ( ' ' ) ;
console . log ( str ) ;
}
var SentenTreeModel = function ( ) {
function SentenTreeModel ( tokenizedData ) {
var options = arguments . length > 1 && arguments [ 1 ] !== undefined ? arguments [ 1 ] : { } ;
_classCallCheck ( this , SentenTreeModel ) ;
// extract options
var _options$termWeights = options . termWeights ,
termWeights = _options$termWeights === undefined ? { } : _options$termWeights ,
_options$minSupportCo = options . minSupportCount ,
minSupportCount = _options$minSupportCo === undefined ? 2 : _options$minSupportCo ,
_options$minSupportRa = options . minSupportRatio ,
minSupportRatio = _options$minSupportRa === undefined ? 0.001 : _options$minSupportRa ,
_options$maxSupportRa = options . maxSupportRatio ,
maxSupportRatio = _options$maxSupportRa === undefined ? 0.75 : _options$maxSupportRa ;
this . options = options ;
var itemset = tokenizedData . itemset ,
entries = tokenizedData . entries ;
this . tokenizedData = tokenizedData ;
this . terms = tokenizedData . encodeTermWeights ( termWeights ) ;
var size = tokenizedData . computeSize ( ) ;
this . supportRange = [ Math . max ( size * minSupportRatio , minSupportCount ) , size * maxSupportRatio ] ;
console . log ( this . supportRange )
var _supportRange = _slicedToArray ( this . supportRange , 2 ) ,
minSupport = _supportRange [ 0 ] ,
maxSupport = _supportRange [ 1 ] ;
this . rootSeq = {
words : [ ] ,
newWord : null ,
graph : null ,
size : size ,
DBs : entries
} ;
var graphs = [ ] ;
var visibleGroups = expandSeqTree ( this . rootSeq , graphs , DEFAULT _NODE _COUNT , minSupport , maxSupport , this . terms , itemset ) ;
this . graphs = graphs . filter ( function ( g ) {
return g . nodes . length > 2 ;
} ) . slice ( 0 , 10 ) ;
updateNodesEdges ( this . graphs , visibleGroups ) ;
}
_createClass ( SentenTreeModel , [ {
key : 'updateGraphs' ,
value : function updateGraphs ( newRootSeq ) {
this . graphs . forEach ( function ( g ) {
return g . clear ( ) ;
} ) ;
var rootSeq = newRootSeq || this . rootSeq ;
var _supportRange2 = _slicedToArray ( this . supportRange , 2 ) ,
minSupport = _supportRange2 [ 0 ] ,
maxSupport = _supportRange2 [ 1 ] ;
var visibleGroups = expandSeqTree ( rootSeq , this . graphs , DEFAULT _NODE _COUNT , minSupport , maxSupport , this . terms , this . tokenizedData . itemset ) ;
updateNodesEdges ( this . graphs , visibleGroups ) ;
return this ;
}
} , {
key : 'size' ,
value : function size ( ) {
return this . rootSeq . size ;
}
} , {
key : 'getRenderedGraphs' ,
value : function getRenderedGraphs ( limit ) {
var graphs = arguments . length === 1 ? this . graphs . slice ( 0 , limit ) : this . graphs ;
console . log ( "slice" )
var renderedGraphs = graphs . map ( function ( g ) {
return g . toRenderedGraph ( ) ;
} ) ;
console . log ( "toRenderedGraph" )
var globalFreqRange = [ ( 0 , _lodash . min ) ( renderedGraphs . map ( function ( g ) {
return g . freqRange [ 0 ] ;
} ) ) , ( 0 , _lodash . max ) ( renderedGraphs . map ( function ( g ) {
return g . freqRange [ 1 ] ;
} ) ) ] ;
var idPool = 0 ;
renderedGraphs . forEach ( function ( g ) {
g . globalFreqRange = globalFreqRange ;
g . nodes . forEach ( function ( n ) {
n . gid = idPool ;
idPool ++ ;
} ) ;
} ) ;
return renderedGraphs ;
}
} ] ) ;
return SentenTreeModel ;
} ( ) ;
exports . default = SentenTreeModel ;
/***/
} ) ,
/* 24 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var NLTK _STOP _WORDS = [ 'i' , 'me' , 'my' , 'myself' , 'we' , 'our' , 'ours' , 'ourselves' , 'you' , 'your' , 'yours' , 'yourself' , 'yourselves' , 'he' , 'him' , 'his' , 'himself' , 'she' , 'her' , 'hers' , 'herself' , 'it' , 'its' , 'itself' , 'they' , 'them' , 'their' , 'theirs' , 'themselves' , 'what' , 'which' , 'who' , 'whom' , 'this' , 'that' , 'these' , 'those' , 'am' , 'is' , 'are' , 'was' , 'were' , 'be' , 'been' , 'being' , 'have' , 'has' , 'had' , 'having' , 'do' , 'does' , 'did' , 'doing' , 'a' , 'an' , 'the' , 'and' , 'but' , 'if' , 'or' , 'because' , 'as' , 'until' , 'while' , 'of' , 'at' , 'by' , 'for' , 'with' , 'about' , 'against' , 'between' , 'into' , 'through' , 'during' , 'before' , 'after' , 'above' , 'below' , 'to' , 'from' , 'up' , 'down' , 'in' , 'out' , 'on' , 'off' , 'over' , 'under' , 'again' , 'further' , 'then' , 'once' , 'here' , 'there' , 'when' , 'where' , 'why' , 'how' , 'all' , 'any' , 'both' , 'each' , 'few' , 'more' , 'most' , 'other' , 'some' , 'such' , 'nor' , 'only' , 'same' , 'so' , 'than' , 'too' , 'very' , 's' , 't' , 'can' , 'will' , 'just' , 'don' , 'should' , 'now' ] ; // removed 'own', 'not', 'no' from stopwords
var CUSTOM _STOP _WORDS = [ 'de' , 'la' , 'y' , 'un' , 'que' , 'en' , 'el' , 'shit' , 'fuck' , 'fucking' ] ; // spanish
var TWEET _STOP _WORDS = [ 'rt' , 'via' , 'amp' , 'http' , 'https' , 'm' , 're' , 'co' ] ;
var DEFAULT _STOP _WORDS = ( 0 , _lodash . uniq ) ( NLTK _STOP _WORDS . concat ( CUSTOM _STOP _WORDS ) . concat ( TWEET _STOP _WORDS ) ) ;
var WordFilter = function ( ) {
function WordFilter ( ) {
var _this = this ;
var _ref = arguments . length > 0 && arguments [ 0 ] !== undefined ? arguments [ 0 ] : { } ,
_ref$includeWords = _ref . includeWords ,
includeWords = _ref$includeWords === undefined ? [ ] : _ref$includeWords ,
_ref$excludeWords = _ref . excludeWords ,
excludeWords = _ref$excludeWords === undefined ? [ ] : _ref$excludeWords ,
_ref$includeDefault = _ref . includeDefault ,
includeDefault = _ref$includeDefault === undefined ? true : _ref$includeDefault ;
_classCallCheck ( this , WordFilter ) ;
this . stopWords = includeDefault ? DEFAULT _STOP _WORDS : [ ] ;
if ( includeWords && includeWords . length > 0 ) {
this . stopWords = ( 0 , _lodash . uniq ) ( this . stopWords . concat ( includeWords ) ) ;
}
if ( excludeWords && excludeWords . length > 0 ) {
( function ( ) {
var exclusionLookup = ( 0 , _lodash . keyBy ) ( excludeWords , function ( w ) {
return w ;
} ) ;
_this . stopWords = _this . stopWords . filter ( function ( w ) {
return ! exclusionLookup [ w ] ;
} ) ;
} ) ( ) ;
}
this . regex = new RegExp ( '^(' + this . stopWords . join ( '|' ) + ')$' ) ;
}
_createClass ( WordFilter , [ {
key : 'test' ,
value : function test ( word ) {
return this . regex . test ( word ) ;
}
} ] ) ;
return WordFilter ;
} ( ) ;
exports . default = WordFilter ;
var defaultFilter = null ;
WordFilter . getDefault = function ( ) {
if ( ! defaultFilter ) {
defaultFilter = new WordFilter ( ) ;
}
return defaultFilter ;
} ;
/***/
} ) ,
/* 25 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
exports . tokenize = tokenize ;
exports . tokenizeBySpace = tokenizeBySpace ;
var PATTERN = /http:\/\/t\.co\/\w+|http:\/\/vine\.co\/\w+|http:\/\/t\.co\w+|http:\/\/vine\.co\w+|http:\/\/t\.\w+|http:\/\/vine\.\w+|http:\/\/\w+|\@\w+|\#\w+|\d+(,\d+)+|\w+(-\w+)*|\$?\d+(\.\d+)?\%?|([A-Za-z]\.)+/g ;
function tokenize ( text ) {
var tokens = [ ] ;
PATTERN . lastIndex = 0 ;
var tokenResult = PATTERN . exec ( text ) ;
while ( tokenResult != null ) {
tokens . push ( tokenResult [ 0 ] . trim ( ) ) ;
tokenResult = PATTERN . exec ( text ) ;
}
return tokens ;
}
function tokenizeBySpace ( text ) {
return text . split ( ' ' ) . filter ( function ( x ) {
return x . length > 0 ;
} ) ;
}
/***/
} ) ,
/* 26 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var Link = function ( ) {
function Link ( sourceNode , targetNode , freq ) {
_classCallCheck ( this , Link ) ;
this . source = sourceNode ;
this . target = targetNode ;
this . freq = freq ;
this . attachPoints = {
x1 : 0 ,
y1 : 0 ,
x2 : 1 ,
y2 : 1
} ;
}
_createClass ( Link , [ {
key : 'getKey' ,
value : function getKey ( ) {
return [ this . source . id , this . target . id ] . join ( ',' ) ;
}
} , {
key : 'isTheOnlyBridge' ,
value : function isTheOnlyBridge ( ) {
return this . source . rightLinks . length === 1 && this . target . leftLinks . length === 1 ;
}
} , {
key : 'toConstraint' ,
value : function toConstraint ( ) {
var gap = this . isTheOnlyBridge ( ) ? 5 : 15 ;
return {
axis : 'x' ,
left : this . source . id ,
right : this . target . id ,
gap : ( this . source . width + this . target . width ) / 2 + gap
} ;
}
} , {
key : 'toOnlyBridgeConstraint' ,
value : function toOnlyBridgeConstraint ( ) {
return {
type : 'alignment' ,
axis : 'y' ,
offsets : [ { node : this . source . id , offset : 0 } , { node : this . target . id , offset : 0 } ]
} ;
}
} ] ) ;
return Link ;
} ( ) ;
exports . default = Link ;
/***/
} ) ,
/* 27 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var Node = function ( ) {
function Node ( rawNode ) {
_classCallCheck ( this , Node ) ;
this . data = rawNode ;
this . leftLinks = [ ] ;
this . rightLinks = [ ] ;
this . id = - 1 ;
this . x = 0 ;
this . y = 0 ;
this . width = 50 ;
this . height = 18 ;
}
_createClass ( Node , [ {
key : 'isLeaf' ,
value : function isLeaf ( ) {
return this . leftLinks . length === 0 || this . rightLinks . length === 0 ;
}
} , {
key : 'isLeftLeaf' ,
value : function isLeftLeaf ( ) {
return this . leftLinks . length === 0 ;
}
} , {
key : 'isRightLeaf' ,
value : function isRightLeaf ( ) {
return this . rightLinks . length === 0 ;
}
} , {
key : 'leftEdge' ,
value : function leftEdge ( ) {
return this . x - this . width / 2 ;
}
} , {
key : 'rightEdge' ,
value : function rightEdge ( ) {
return this . x + this . width / 2 ;
}
} , {
key : 'getLeftNodes' ,
value : function getLeftNodes ( ) {
return this . leftLinks . map ( function ( l ) {
return l . source ;
} ) ;
}
} , {
key : 'getRightNodes' ,
value : function getRightNodes ( ) {
return this . rightLinks . map ( function ( l ) {
return l . target ;
} ) ;
}
} , {
key : 'createAlignmentConstraints' ,
value : function createAlignmentConstraints ( axis , nodes ) {
return nodes . length > 1 ? {
type : 'alignment' ,
axis : axis ,
offsets : nodes . map ( function ( n ) {
return { node : n . id , offset : 0 } ;
} )
} : null ;
}
} , {
key : 'computeLeftConstraints' ,
value : function computeLeftConstraints ( ) {
var nodes = this . getLeftNodes ( ) . filter ( function ( n ) {
return n . rightLinks . length === 1 ;
} ) ;
return this . createAlignmentConstraints ( 'x' , nodes ) ;
}
} , {
key : 'computeRightConstraints' ,
value : function computeRightConstraints ( ) {
var nodes = this . getRightNodes ( ) . filter ( function ( n ) {
return n . leftLinks . length === 1 ;
} ) ;
return this . createAlignmentConstraints ( 'x' , nodes ) ;
}
} , {
key : 'computeOrderConstraints' ,
value : function computeOrderConstraints ( ) {
var rules = [ ] ;
if ( this . getRightNodes ( ) . length > 1 ) {
var nodes = this . getRightNodes ( ) ;
for ( var i = 1 ; i < nodes . length ; i ++ ) {
rules . push ( {
axis : 'y' ,
left : nodes [ i - 1 ] . id ,
right : nodes [ i ] . id ,
gap : 5
} ) ;
}
}
if ( this . getLeftNodes ( ) . length > 1 ) {
var _nodes = this . getLeftNodes ( ) ;
for ( var _i = 1 ; _i < _nodes . length ; _i ++ ) {
rules . push ( {
axis : 'y' ,
left : _nodes [ _i - 1 ] . id ,
right : _nodes [ _i ] . id ,
gap : 5
} ) ;
}
}
return rules ;
}
} , {
key : 'updateAttachPoints' ,
value : function updateAttachPoints ( ) {
var _this = this ;
if ( this . leftLinks . length === 1 ) {
this . leftLinks [ 0 ] . attachPoints . y2 = this . y ;
} else if ( this . leftLinks . length > 1 ) {
( function ( ) {
var totalLeft = ( 0 , _lodash . sum ) ( _this . leftLinks . map ( function ( l ) {
return l . strokeWidth ;
} ) ) ;
var startPos = _this . y - ( totalLeft + ( _this . leftLinks . length - 1 ) * 2 ) / 2 ;
_this . leftLinks . concat ( ) . sort ( function ( a , b ) {
return a . source . y - b . source . y ;
} ) . forEach ( function ( link ) {
link . attachPoints . y2 = startPos + link . strokeWidth / 2 ;
startPos += link . strokeWidth + 2 ;
} ) ;
} ) ( ) ;
}
if ( this . rightLinks . length === 1 ) {
this . rightLinks [ 0 ] . attachPoints . y1 = this . y ;
} else if ( this . rightLinks . length > 1 ) {
( function ( ) {
var totalRight = ( 0 , _lodash . sum ) ( _this . rightLinks . map ( function ( l ) {
return l . strokeWidth ;
} ) ) ;
var startPos = _this . y - ( totalRight + ( _this . rightLinks . length - 1 ) * 2 ) / 2 ;
_this . rightLinks . concat ( ) . sort ( function ( a , b ) {
return a . target . y - b . target . y ;
} ) . forEach ( function ( link ) {
link . attachPoints . y1 = startPos + link . strokeWidth / 2 ;
startPos += link . strokeWidth + 2 ;
} ) ;
} ) ( ) ;
}
}
} , {
key : 'canMerge' ,
value : function canMerge ( node ) {
return this . data . entity === node . data . entity ;
}
} ] , [ {
key : 'merge' ,
value : function merge ( nodes ) {
return new Node ( {
id : ( 0 , _lodash . min ) ( nodes . map ( function ( n ) {
return n . data . id ;
} ) ) ,
entity : nodes [ 0 ] . data . entity ,
freq : ( 0 , _lodash . sum ) ( nodes . map ( function ( n ) {
return n . data . freq ;
} ) ) ,
mergedData : nodes . map ( function ( n ) {
return n . data ;
} ) ,
topEntries : nodes . reduce ( function ( acc , curr ) {
return acc . concat ( curr . data . topEntries ) ;
} , [ ] ) . slice ( 0 , 5 )
} ) ;
}
} ] ) ;
return Node ;
} ( ) ;
exports . default = Node ;
/***/
} ) ,
/* 28 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return deg2rad ; } ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return rad2deg ; } ) ;
var deg2rad = Math . PI / 180 ;
var rad2deg = 180 / Math . PI ;
/***/
} ) ,
/* 29 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( _ _webpack _exports _ _ , "__esModule" , { value : true } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _dispatch _ _ = _ _webpack _require _ _ ( 57 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "dispatch" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _dispatch _ _ [ "a" ] ; } ) ;
/***/
} ) ,
/* 30 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _value _ _ = _ _webpack _require _ _ ( 13 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var nb = b ? b . length : 0 ,
na = a ? Math . min ( nb , a . length ) : 0 ,
x = new Array ( nb ) ,
c = new Array ( nb ) ,
i ;
for ( i = 0 ; i < na ; ++ i ) x [ i ] = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _value _ _ [ "a" /* default */ ] ) ( a [ i ] , b [ i ] ) ;
for ( ; i < nb ; ++ i ) c [ i ] = b [ i ] ;
return function ( t ) {
for ( i = 0 ; i < na ; ++ i ) c [ i ] = x [ i ] ( t ) ;
return c ;
} ;
} ;
/***/
} ) ,
/* 31 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _basis _ _ = _ _webpack _require _ _ ( 12 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( values ) {
var n = values . length ;
return function ( t ) {
var i = Math . floor ( ( ( t %= 1 ) < 0 ? ++ t : t ) * n ) ,
v0 = values [ ( i + n - 1 ) % n ] ,
v1 = values [ i % n ] ,
v2 = values [ ( i + 1 ) % n ] ,
v3 = values [ ( i + 2 ) % n ] ;
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _basis _ _ [ "b" /* basis */ ] ) ( ( t - i / n ) * n , v0 , v1 , v2 , v3 ) ;
} ;
} ;
/***/
} ) ,
/* 32 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
/***/
} ) ,
/* 33 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var d = new Date ;
return a = + a , b -= a ,
function ( t ) {
return d . setTime ( a + b * t ) , d ;
} ;
} ;
/***/
} ) ,
/* 34 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _value _ _ = _ _webpack _require _ _ ( 13 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var i = { } ,
c = { } ,
k ;
if ( a === null || typeof a !== "object" ) a = { } ;
if ( b === null || typeof b !== "object" ) b = { } ;
for ( k in b ) {
if ( k in a ) {
i [ k ] = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _value _ _ [ "a" /* default */ ] ) ( a [ k ] , b [ k ] ) ;
} else {
c [ k ] = b [ k ] ;
}
}
return function ( t ) {
for ( k in i ) c [ k ] = i [ k ] ( t ) ;
return c ;
} ;
} ;
/***/
} ) ,
/* 35 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _basis _ _ = _ _webpack _require _ _ ( 12 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _basisClosed _ _ = _ _webpack _require _ _ ( 31 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _color _ _ = _ _webpack _require _ _ ( 6 ) ;
/* unused harmony export rgbBasis */
/* unused harmony export rgbBasisClosed */
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = ( function rgbGamma ( y ) {
var color = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _3 _ _color _ _ [ "c" /* gamma */ ] ) ( y ) ;
function rgb ( start , end ) {
var r = color ( ( start = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "f" /* rgb */ ] ) ( start ) ) . r , ( end = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "f" /* rgb */ ] ) ( end ) ) . r ) ,
g = color ( start . g , end . g ) ,
b = color ( start . b , end . b ) ,
opacity = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _3 _ _color _ _ [ "a" /* default */ ] ) ( start . opacity , end . opacity ) ;
return function ( t ) {
start . r = r ( t ) ;
start . g = g ( t ) ;
start . b = b ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
rgb . gamma = rgbGamma ;
return rgb ;
} ) ( 1 ) ;
function rgbSpline ( spline ) {
return function ( colors ) {
var n = colors . length ,
r = new Array ( n ) ,
g = new Array ( n ) ,
b = new Array ( n ) ,
i , color ;
for ( i = 0 ; i < n ; ++ i ) {
color = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "f" /* rgb */ ] ) ( colors [ i ] ) ;
r [ i ] = color . r || 0 ;
g [ i ] = color . g || 0 ;
b [ i ] = color . b || 0 ;
}
r = spline ( r ) ;
g = spline ( g ) ;
b = spline ( b ) ;
color . opacity = 1 ;
return function ( t ) {
color . r = r ( t ) ;
color . g = g ( t ) ;
color . b = b ( t ) ;
return color + "" ;
} ;
} ;
}
var rgbBasis = rgbSpline ( _ _WEBPACK _IMPORTED _MODULE _1 _ _basis _ _ [ "a" /* default */ ] ) ;
var rgbBasisClosed = rgbSpline ( _ _WEBPACK _IMPORTED _MODULE _2 _ _basisClosed _ _ [ "a" /* default */ ] ) ;
/***/
} ) ,
/* 36 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ = _ _webpack _require _ _ ( 7 ) ;
var reA = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g ,
reB = new RegExp ( reA . source , "g" ) ;
function zero ( b ) {
return function ( ) {
return b ;
} ;
}
function one ( b ) {
return function ( t ) {
return b ( t ) + "" ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var bi = reA . lastIndex = reB . lastIndex = 0 , // scan index for next number in b
am , // current match in a
bm , // current match in b
bs , // string preceding current number in b, if any
i = - 1 , // index in s
s = [ ] , // string constants and placeholders
q = [ ] ; // number interpolators
// Coerce inputs to strings.
a = a + "" , b = b + "" ;
// Interpolate pairs of numbers in a & b.
while ( ( am = reA . exec ( a ) ) &&
( bm = reB . exec ( b ) ) ) {
if ( ( bs = bm . index ) > bi ) { // a string precedes the next number in b
bs = b . slice ( bi , bs ) ;
if ( s [ i ] ) s [ i ] += bs ; // coalesce with previous string
else s [ ++ i ] = bs ;
}
if ( ( am = am [ 0 ] ) === ( bm = bm [ 0 ] ) ) { // numbers in a & b match
if ( s [ i ] ) s [ i ] += bm ; // coalesce with previous string
else s [ ++ i ] = bm ;
} else { // interpolate non-matching numbers
s [ ++ i ] = null ;
q . push ( { i : i , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( am , bm ) } ) ;
}
bi = reB . lastIndex ;
}
// Add remains of b.
if ( bi < b . length ) {
bs = b . slice ( bi ) ;
if ( s [ i ] ) s [ i ] += bs ; // coalesce with previous string
else s [ ++ i ] = bs ;
}
// Special optimization for only a single match.
// Otherwise, interpolate each of the numbers and rejoin the string.
return s . length < 2 ? ( q [ 0 ] ?
one ( q [ 0 ] . x ) :
zero ( b ) ) :
( b = q . length , function ( t ) {
for ( var i = 0 , o ; i < b ; ++ i ) s [ ( o = q [ i ] ) . i ] = o . x ( t ) ;
return s . join ( "" ) ;
} ) ;
} ;
/***/
} ) ,
/* 37 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
var matcher = function ( selector ) {
return function ( ) {
return this . matches ( selector ) ;
} ;
} ;
if ( typeof document !== "undefined" ) {
var element = document . documentElement ;
if ( ! element . matches ) {
var vendorMatches = element . webkitMatchesSelector ||
element . msMatchesSelector ||
element . mozMatchesSelector ||
element . oMatchesSelector ;
matcher = function ( selector ) {
return function ( ) {
return vendorMatches . call ( this , selector ) ;
} ;
} ;
}
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = matcher ;
/***/
} ) ,
/* 38 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _sparse _ _ = _ _webpack _require _ _ ( 39 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = EnterNode ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ [ "b" /* Selection */ ] ( this . _enter || this . _groups . map ( _ _WEBPACK _IMPORTED _MODULE _0 _ _sparse _ _ [ "a" /* default */ ] ) , this . _parents ) ;
} ;
function EnterNode ( parent , datum ) {
this . ownerDocument = parent . ownerDocument ;
this . namespaceURI = parent . namespaceURI ;
this . _next = null ;
this . _parent = parent ;
this . _ _data _ _ = datum ;
}
EnterNode . prototype = {
constructor : EnterNode ,
appendChild : function ( child ) { return this . _parent . insertBefore ( child , this . _next ) ; } ,
insertBefore : function ( child , next ) { return this . _parent . insertBefore ( child , next ) ; } ,
querySelector : function ( selector ) { return this . _parent . querySelector ( selector ) ; } ,
querySelectorAll : function ( selector ) { return this . _parent . querySelectorAll ( selector ) ; }
} ;
/***/
} ) ,
/* 39 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( update ) {
return new Array ( update . length ) ;
} ;
/***/
} ) ,
/* 40 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function empty ( ) {
return [ ] ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( selector ) {
return selector == null ? empty : function ( ) {
return this . querySelectorAll ( selector ) ;
} ;
} ;
/***/
} ) ,
/* 41 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _timer _ _ = _ _webpack _require _ _ ( 22 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "c" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _timer _ _ [ "c" ] ; } ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _0 _ _src _timer _ _ [ "a" ] ; } ) ;
/* unused harmony reexport timerFlush */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _timeout _ _ = _ _webpack _require _ _ ( 114 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _1 _ _src _timeout _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _interval _ _ = _ _webpack _require _ _ ( 113 ) ;
/* unused harmony reexport interval */
/***/
} ) ,
/* 42 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node , name ) {
var schedules = node . _ _transition ,
schedule ,
active ,
empty = true ,
i ;
if ( ! schedules ) return ;
name = name == null ? null : name + "" ;
for ( i in schedules ) {
if ( ( schedule = schedules [ i ] ) . name !== name ) { empty = false ; continue ; }
active = schedule . state > _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _schedule _ _ [ "a" /* STARTING */ ] && schedule . state < _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _schedule _ _ [ "b" /* ENDING */ ] ;
schedule . state = _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _schedule _ _ [ "c" /* ENDED */ ] ;
schedule . timer . stop ( ) ;
if ( active ) schedule . on . call ( "interrupt" , node , node . _ _data _ _ , schedule . index , schedule . group ) ;
delete schedules [ i ] ;
}
if ( empty ) delete node . _ _transition ;
} ;
/***/
} ) ,
/* 43 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _d3 _interpolate _ _ = _ _webpack _require _ _ ( 11 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( a , b ) {
var c ;
return ( typeof b === "number" ? _ _WEBPACK _IMPORTED _MODULE _1 _d3 _interpolate _ _ [ "b" /* interpolateNumber */ ] :
b instanceof _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "a" /* color */ ] ? _ _WEBPACK _IMPORTED _MODULE _1 _d3 _interpolate _ _ [ "c" /* interpolateRgb */ ] :
( c = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "a" /* color */ ] ) ( b ) ) ? ( b = c , _ _WEBPACK _IMPORTED _MODULE _1 _d3 _interpolate _ _ [ "c" /* interpolateRgb */ ] ) :
_ _WEBPACK _IMPORTED _MODULE _1 _d3 _interpolate _ _ [ "d" /* interpolateString */ ] ) ( a , b ) ;
} ;
/***/
} ) ,
/* 44 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
// https://d3js.org Version 4.5.0. Copyright 2017 Mike Bostock.
( function ( global , factory ) {
true ? factory ( exports ) :
typeof define === 'function' && define . amd ? define ( [ 'exports' ] , factory ) :
( factory ( ( global . d3 = global . d3 || { } ) ) ) ;
} ( this , ( function ( exports ) {
'use strict' ;
var version = "4.5.0" ;
var ascending = function ( a , b ) {
return a < b ? - 1 : a > b ? 1 : a >= b ? 0 : NaN ;
} ;
var bisector = function ( compare ) {
if ( compare . length === 1 ) compare = ascendingComparator ( compare ) ;
return {
left : function ( a , x , lo , hi ) {
if ( lo == null ) lo = 0 ;
if ( hi == null ) hi = a . length ;
while ( lo < hi ) {
var mid = lo + hi >>> 1 ;
if ( compare ( a [ mid ] , x ) < 0 ) lo = mid + 1 ;
else hi = mid ;
}
return lo ;
} ,
right : function ( a , x , lo , hi ) {
if ( lo == null ) lo = 0 ;
if ( hi == null ) hi = a . length ;
while ( lo < hi ) {
var mid = lo + hi >>> 1 ;
if ( compare ( a [ mid ] , x ) > 0 ) hi = mid ;
else lo = mid + 1 ;
}
return lo ;
}
} ;
} ;
function ascendingComparator ( f ) {
return function ( d , x ) {
return ascending ( f ( d ) , x ) ;
} ;
}
var ascendingBisect = bisector ( ascending ) ;
var bisectRight = ascendingBisect . right ;
var bisectLeft = ascendingBisect . left ;
var descending = function ( a , b ) {
return b < a ? - 1 : b > a ? 1 : b >= a ? 0 : NaN ;
} ;
var number = function ( x ) {
return x === null ? NaN : + x ;
} ;
var variance = function ( array , f ) {
var n = array . length ,
m = 0 ,
a ,
d ,
s = 0 ,
i = - 1 ,
j = 0 ;
if ( f == null ) {
while ( ++ i < n ) {
if ( ! isNaN ( a = number ( array [ i ] ) ) ) {
d = a - m ;
m += d / ++ j ;
s += d * ( a - m ) ;
}
}
} else {
while ( ++ i < n ) {
if ( ! isNaN ( a = number ( f ( array [ i ] , i , array ) ) ) ) {
d = a - m ;
m += d / ++ j ;
s += d * ( a - m ) ;
}
}
}
if ( j > 1 ) return s / ( j - 1 ) ;
} ;
var deviation = function ( array , f ) {
var v = variance ( array , f ) ;
return v ? Math . sqrt ( v ) : v ;
} ;
var extent = function ( array , f ) {
var i = - 1 ,
n = array . length ,
a ,
b ,
c ;
if ( f == null ) {
while ( ++ i < n )
if ( ( b = array [ i ] ) != null && b >= b ) { a = c = b ; break ; }
while ( ++ i < n )
if ( ( b = array [ i ] ) != null ) {
if ( a > b ) a = b ;
if ( c < b ) c = b ;
}
} else {
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null && b >= b ) { a = c = b ; break ; }
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null ) {
if ( a > b ) a = b ;
if ( c < b ) c = b ;
}
}
return [ a , c ] ;
} ;
var array = Array . prototype ;
var slice = array . slice ;
var map = array . map ;
var constant = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var identity = function ( x ) {
return x ;
} ;
var sequence = function ( start , stop , step ) {
start = + start , stop = + stop , step = ( n = arguments . length ) < 2 ? ( stop = start , start = 0 , 1 ) : n < 3 ? 1 : + step ;
var i = - 1 ,
n = Math . max ( 0 , Math . ceil ( ( stop - start ) / step ) ) | 0 ,
range = new Array ( n ) ;
while ( ++ i < n ) {
range [ i ] = start + i * step ;
}
return range ;
} ;
var e10 = Math . sqrt ( 50 ) ;
var e5 = Math . sqrt ( 10 ) ;
var e2 = Math . sqrt ( 2 ) ;
var ticks = function ( start , stop , count ) {
var step = tickStep ( start , stop , count ) ;
return sequence (
Math . ceil ( start / step ) * step ,
Math . floor ( stop / step ) * step + step / 2 , // inclusive
step
) ;
} ;
function tickStep ( start , stop , count ) {
var step0 = Math . abs ( stop - start ) / Math . max ( 0 , count ) ,
step1 = Math . pow ( 10 , Math . floor ( Math . log ( step0 ) / Math . LN10 ) ) ,
error = step0 / step1 ;
if ( error >= e10 ) step1 *= 10 ;
else if ( error >= e5 ) step1 *= 5 ;
else if ( error >= e2 ) step1 *= 2 ;
return stop < start ? - step1 : step1 ;
}
var sturges = function ( values ) {
return Math . ceil ( Math . log ( values . length ) / Math . LN2 ) + 1 ;
} ;
var histogram = function ( ) {
var value = identity ,
domain = extent ,
threshold = sturges ;
function histogram ( data ) {
var i ,
n = data . length ,
x ,
values = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) {
values [ i ] = value ( data [ i ] , i , data ) ;
}
var xz = domain ( values ) ,
x0 = xz [ 0 ] ,
x1 = xz [ 1 ] ,
tz = threshold ( values , x0 , x1 ) ;
// Convert number of thresholds into uniform thresholds.
if ( ! Array . isArray ( tz ) ) tz = ticks ( x0 , x1 , tz ) ;
// Remove any thresholds outside the domain.
var m = tz . length ;
while ( tz [ 0 ] <= x0 ) tz . shift ( ) , -- m ;
while ( tz [ m - 1 ] >= x1 ) tz . pop ( ) , -- m ;
var bins = new Array ( m + 1 ) ,
bin ;
// Initialize bins.
for ( i = 0 ; i <= m ; ++ i ) {
bin = bins [ i ] = [ ] ;
bin . x0 = i > 0 ? tz [ i - 1 ] : x0 ;
bin . x1 = i < m ? tz [ i ] : x1 ;
}
// Assign data to bins by value, ignoring any outside the domain.
for ( i = 0 ; i < n ; ++ i ) {
x = values [ i ] ;
if ( x0 <= x && x <= x1 ) {
bins [ bisectRight ( tz , x , 0 , m ) ] . push ( data [ i ] ) ;
}
}
return bins ;
}
histogram . value = function ( _ ) {
return arguments . length ? ( value = typeof _ === "function" ? _ : constant ( _ ) , histogram ) : value ;
} ;
histogram . domain = function ( _ ) {
return arguments . length ? ( domain = typeof _ === "function" ? _ : constant ( [ _ [ 0 ] , _ [ 1 ] ] ) , histogram ) : domain ;
} ;
histogram . thresholds = function ( _ ) {
return arguments . length ? ( threshold = typeof _ === "function" ? _ : Array . isArray ( _ ) ? constant ( slice . call ( _ ) ) : constant ( _ ) , histogram ) : threshold ;
} ;
return histogram ;
} ;
var threshold = function ( array , p , f ) {
if ( f == null ) f = number ;
if ( ! ( n = array . length ) ) return ;
if ( ( p = + p ) <= 0 || n < 2 ) return + f ( array [ 0 ] , 0 , array ) ;
if ( p >= 1 ) return + f ( array [ n - 1 ] , n - 1 , array ) ;
var n ,
h = ( n - 1 ) * p ,
i = Math . floor ( h ) ,
a = + f ( array [ i ] , i , array ) ,
b = + f ( array [ i + 1 ] , i + 1 , array ) ;
return a + ( b - a ) * ( h - i ) ;
} ;
var freedmanDiaconis = function ( values , min , max ) {
values = map . call ( values , number ) . sort ( ascending ) ;
return Math . ceil ( ( max - min ) / ( 2 * ( threshold ( values , 0.75 ) - threshold ( values , 0.25 ) ) * Math . pow ( values . length , - 1 / 3 ) ) ) ;
} ;
var scott = function ( values , min , max ) {
return Math . ceil ( ( max - min ) / ( 3.5 * deviation ( values ) * Math . pow ( values . length , - 1 / 3 ) ) ) ;
} ;
var max = function ( array , f ) {
var i = - 1 ,
n = array . length ,
a ,
b ;
if ( f == null ) {
while ( ++ i < n )
if ( ( b = array [ i ] ) != null && b >= b ) { a = b ; break ; }
while ( ++ i < n )
if ( ( b = array [ i ] ) != null && b > a ) a = b ;
} else {
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null && b >= b ) { a = b ; break ; }
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null && b > a ) a = b ;
}
return a ;
} ;
var mean = function ( array , f ) {
var s = 0 ,
n = array . length ,
a ,
i = - 1 ,
j = n ;
if ( f == null ) {
while ( ++ i < n )
if ( ! isNaN ( a = number ( array [ i ] ) ) ) s += a ;
else -- j ;
} else {
while ( ++ i < n )
if ( ! isNaN ( a = number ( f ( array [ i ] , i , array ) ) ) ) s += a ;
else -- j ;
}
if ( j ) return s / j ;
} ;
var median = function ( array , f ) {
var numbers = [ ] ,
n = array . length ,
a ,
i = - 1 ;
if ( f == null ) {
while ( ++ i < n )
if ( ! isNaN ( a = number ( array [ i ] ) ) ) numbers . push ( a ) ;
} else {
while ( ++ i < n )
if ( ! isNaN ( a = number ( f ( array [ i ] , i , array ) ) ) ) numbers . push ( a ) ;
}
return threshold ( numbers . sort ( ascending ) , 0.5 ) ;
} ;
var merge = function ( arrays ) {
var n = arrays . length ,
m ,
i = - 1 ,
j = 0 ,
merged ,
array ;
while ( ++ i < n ) j += arrays [ i ] . length ;
merged = new Array ( j ) ;
while ( -- n >= 0 ) {
array = arrays [ n ] ;
m = array . length ;
while ( -- m >= 0 ) {
merged [ -- j ] = array [ m ] ;
}
}
return merged ;
} ;
var min = function ( array , f ) {
var i = - 1 ,
n = array . length ,
a ,
b ;
if ( f == null ) {
while ( ++ i < n )
if ( ( b = array [ i ] ) != null && b >= b ) { a = b ; break ; }
while ( ++ i < n )
if ( ( b = array [ i ] ) != null && a > b ) a = b ;
} else {
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null && b >= b ) { a = b ; break ; }
while ( ++ i < n )
if ( ( b = f ( array [ i ] , i , array ) ) != null && a > b ) a = b ;
}
return a ;
} ;
var pairs = function ( array ) {
var i = 0 ,
n = array . length - 1 ,
p = array [ 0 ] ,
pairs = new Array ( n < 0 ? 0 : n ) ;
while ( i < n ) pairs [ i ] = [ p , p = array [ ++ i ] ] ;
return pairs ;
} ;
var permute = function ( array , indexes ) {
var i = indexes . length ,
permutes = new Array ( i ) ;
while ( i -- ) permutes [ i ] = array [ indexes [ i ] ] ;
return permutes ;
} ;
var scan = function ( array , compare ) {
if ( ! ( n = array . length ) ) return ;
var i = 0 ,
n ,
j = 0 ,
xi ,
xj = array [ j ] ;
if ( ! compare ) compare = ascending ;
while ( ++ i < n )
if ( compare ( xi = array [ i ] , xj ) < 0 || compare ( xj , xj ) !== 0 ) xj = xi , j = i ;
if ( compare ( xj , xj ) === 0 ) return j ;
} ;
var shuffle = function ( array , i0 , i1 ) {
var m = ( i1 == null ? array . length : i1 ) - ( i0 = i0 == null ? 0 : + i0 ) ,
t ,
i ;
while ( m ) {
i = Math . random ( ) * m -- | 0 ;
t = array [ m + i0 ] ;
array [ m + i0 ] = array [ i + i0 ] ;
array [ i + i0 ] = t ;
}
return array ;
} ;
var sum = function ( array , f ) {
var s = 0 ,
n = array . length ,
a ,
i = - 1 ;
if ( f == null ) {
while ( ++ i < n )
if ( a = + array [ i ] ) s += a ; // Note: zero and null are equivalent.
} else {
while ( ++ i < n )
if ( a = + f ( array [ i ] , i , array ) ) s += a ;
}
return s ;
} ;
var transpose = function ( matrix ) {
if ( ! ( n = matrix . length ) ) return [ ] ;
for ( var i = - 1 , m = min ( matrix , length ) , transpose = new Array ( m ) ; ++ i < m ; ) {
for ( var j = - 1 , n , row = transpose [ i ] = new Array ( n ) ; ++ j < n ; ) {
row [ j ] = matrix [ j ] [ i ] ;
}
}
return transpose ;
} ;
function length ( d ) {
return d . length ;
}
var zip = function ( ) {
return transpose ( arguments ) ;
} ;
var slice$1 = Array . prototype . slice ;
var identity$1 = function ( x ) {
return x ;
} ;
var top = 1 ;
var right = 2 ;
var bottom = 3 ;
var left = 4 ;
var epsilon = 1e-6 ;
function translateX ( scale0 , scale1 , d ) {
var x = scale0 ( d ) ;
return "translate(" + ( isFinite ( x ) ? x : scale1 ( d ) ) + ",0)" ;
}
function translateY ( scale0 , scale1 , d ) {
var y = scale0 ( d ) ;
return "translate(0," + ( isFinite ( y ) ? y : scale1 ( d ) ) + ")" ;
}
function center ( scale ) {
var offset = scale . bandwidth ( ) / 2 ;
if ( scale . round ( ) ) offset = Math . round ( offset ) ;
return function ( d ) {
return scale ( d ) + offset ;
} ;
}
function entering ( ) {
return ! this . _ _axis ;
}
function axis ( orient , scale ) {
var tickArguments = [ ] ,
tickValues = null ,
tickFormat = null ,
tickSizeInner = 6 ,
tickSizeOuter = 6 ,
tickPadding = 3 ;
function axis ( context ) {
var values = tickValues == null ? ( scale . ticks ? scale . ticks . apply ( scale , tickArguments ) : scale . domain ( ) ) : tickValues ,
format = tickFormat == null ? ( scale . tickFormat ? scale . tickFormat . apply ( scale , tickArguments ) : identity$1 ) : tickFormat ,
spacing = Math . max ( tickSizeInner , 0 ) + tickPadding ,
transform = orient === top || orient === bottom ? translateX : translateY ,
range = scale . range ( ) ,
range0 = range [ 0 ] + 0.5 ,
range1 = range [ range . length - 1 ] + 0.5 ,
position = ( scale . bandwidth ? center : identity$1 ) ( scale . copy ( ) ) ,
selection = context . selection ? context . selection ( ) : context ,
path = selection . selectAll ( ".domain" ) . data ( [ null ] ) ,
tick = selection . selectAll ( ".tick" ) . data ( values , scale ) . order ( ) ,
tickExit = tick . exit ( ) ,
tickEnter = tick . enter ( ) . append ( "g" ) . attr ( "class" , "tick" ) ,
line = tick . select ( "line" ) ,
text = tick . select ( "text" ) ,
k = orient === top || orient === left ? - 1 : 1 ,
x , y = orient === left || orient === right ? ( x = "x" , "y" ) : ( x = "y" , "x" ) ;
path = path . merge ( path . enter ( ) . insert ( "path" , ".tick" )
. attr ( "class" , "domain" )
. attr ( "stroke" , "#000" ) ) ;
tick = tick . merge ( tickEnter ) ;
line = line . merge ( tickEnter . append ( "line" )
. attr ( "stroke" , "#000" )
. attr ( x + "2" , k * tickSizeInner )
. attr ( y + "1" , 0.5 )
. attr ( y + "2" , 0.5 ) ) ;
text = text . merge ( tickEnter . append ( "text" )
. attr ( "fill" , "#000" )
. attr ( x , k * spacing )
. attr ( y , 0.5 )
. attr ( "dy" , orient === top ? "0em" : orient === bottom ? "0.71em" : "0.32em" ) ) ;
if ( context !== selection ) {
path = path . transition ( context ) ;
tick = tick . transition ( context ) ;
line = line . transition ( context ) ;
text = text . transition ( context ) ;
tickExit = tickExit . transition ( context )
. attr ( "opacity" , epsilon )
. attr ( "transform" , function ( d ) { return transform ( position , this . parentNode . _ _axis || position , d ) ; } ) ;
tickEnter
. attr ( "opacity" , epsilon )
. attr ( "transform" , function ( d ) { return transform ( this . parentNode . _ _axis || position , position , d ) ; } ) ;
}
tickExit . remove ( ) ;
path
. attr ( "d" , orient === left || orient == right ?
"M" + k * tickSizeOuter + "," + range0 + "H0.5V" + range1 + "H" + k * tickSizeOuter :
"M" + range0 + "," + k * tickSizeOuter + "V0.5H" + range1 + "V" + k * tickSizeOuter ) ;
tick
. attr ( "opacity" , 1 )
. attr ( "transform" , function ( d ) { return transform ( position , position , d ) ; } ) ;
line
. attr ( x + "2" , k * tickSizeInner ) ;
text
. attr ( x , k * spacing )
. text ( format ) ;
selection . filter ( entering )
. attr ( "fill" , "none" )
. attr ( "font-size" , 10 )
. attr ( "font-family" , "sans-serif" )
. attr ( "text-anchor" , orient === right ? "start" : orient === left ? "end" : "middle" ) ;
selection
. each ( function ( ) { this . _ _axis = position ; } ) ;
}
axis . scale = function ( _ ) {
return arguments . length ? ( scale = _ , axis ) : scale ;
} ;
axis . ticks = function ( ) {
return tickArguments = slice$1 . call ( arguments ) , axis ;
} ;
axis . tickArguments = function ( _ ) {
return arguments . length ? ( tickArguments = _ == null ? [ ] : slice$1 . call ( _ ) , axis ) : tickArguments . slice ( ) ;
} ;
axis . tickValues = function ( _ ) {
return arguments . length ? ( tickValues = _ == null ? null : slice$1 . call ( _ ) , axis ) : tickValues && tickValues . slice ( ) ;
} ;
axis . tickFormat = function ( _ ) {
return arguments . length ? ( tickFormat = _ , axis ) : tickFormat ;
} ;
axis . tickSize = function ( _ ) {
return arguments . length ? ( tickSizeInner = tickSizeOuter = + _ , axis ) : tickSizeInner ;
} ;
axis . tickSizeInner = function ( _ ) {
return arguments . length ? ( tickSizeInner = + _ , axis ) : tickSizeInner ;
} ;
axis . tickSizeOuter = function ( _ ) {
return arguments . length ? ( tickSizeOuter = + _ , axis ) : tickSizeOuter ;
} ;
axis . tickPadding = function ( _ ) {
return arguments . length ? ( tickPadding = + _ , axis ) : tickPadding ;
} ;
return axis ;
}
function axisTop ( scale ) {
return axis ( top , scale ) ;
}
function axisRight ( scale ) {
return axis ( right , scale ) ;
}
function axisBottom ( scale ) {
return axis ( bottom , scale ) ;
}
function axisLeft ( scale ) {
return axis ( left , scale ) ;
}
var noop = { value : function ( ) { } } ;
function dispatch ( ) {
for ( var i = 0 , n = arguments . length , _ = { } , t ; i < n ; ++ i ) {
if ( ! ( t = arguments [ i ] + "" ) || ( t in _ ) ) throw new Error ( "illegal type: " + t ) ;
_ [ t ] = [ ] ;
}
return new Dispatch ( _ ) ;
}
function Dispatch ( _ ) {
this . _ = _ ;
}
function parseTypenames ( typenames , types ) {
return typenames . trim ( ) . split ( /^|\s+/ ) . map ( function ( t ) {
var name = "" ,
i = t . indexOf ( "." ) ;
if ( i >= 0 ) name = t . slice ( i + 1 ) , t = t . slice ( 0 , i ) ;
if ( t && ! types . hasOwnProperty ( t ) ) throw new Error ( "unknown type: " + t ) ;
return { type : t , name : name } ;
} ) ;
}
Dispatch . prototype = dispatch . prototype = {
constructor : Dispatch ,
on : function ( typename , callback ) {
var _ = this . _ ,
T = parseTypenames ( typename + "" , _ ) ,
t ,
i = - 1 ,
n = T . length ;
// If no callback was specified, return the callback of the given type and name.
if ( arguments . length < 2 ) {
while ( ++ i < n )
if ( ( t = ( typename = T [ i ] ) . type ) && ( t = get ( _ [ t ] , typename . name ) ) ) return t ;
return ;
}
// If a type was specified, set the callback for the given type and name.
// Otherwise, if a null callback was specified, remove callbacks of the given name.
if ( callback != null && typeof callback !== "function" ) throw new Error ( "invalid callback: " + callback ) ;
while ( ++ i < n ) {
if ( t = ( typename = T [ i ] ) . type ) _ [ t ] = set ( _ [ t ] , typename . name , callback ) ;
else if ( callback == null )
for ( t in _ ) _ [ t ] = set ( _ [ t ] , typename . name , null ) ;
}
return this ;
} ,
copy : function ( ) {
var copy = { } ,
_ = this . _ ;
for ( var t in _ ) copy [ t ] = _ [ t ] . slice ( ) ;
return new Dispatch ( copy ) ;
} ,
call : function ( type , that ) {
if ( ( n = arguments . length - 2 ) > 0 )
for ( var args = new Array ( n ) , i = 0 , n , t ; i < n ; ++ i ) args [ i ] = arguments [ i + 2 ] ;
if ( ! this . _ . hasOwnProperty ( type ) ) throw new Error ( "unknown type: " + type ) ;
for ( t = this . _ [ type ] , i = 0 , n = t . length ; i < n ; ++ i ) t [ i ] . value . apply ( that , args ) ;
} ,
apply : function ( type , that , args ) {
if ( ! this . _ . hasOwnProperty ( type ) ) throw new Error ( "unknown type: " + type ) ;
for ( var t = this . _ [ type ] , i = 0 , n = t . length ; i < n ; ++ i ) t [ i ] . value . apply ( that , args ) ;
}
} ;
function get ( type , name ) {
for ( var i = 0 , n = type . length , c ; i < n ; ++ i ) {
if ( ( c = type [ i ] ) . name === name ) {
return c . value ;
}
}
}
function set ( type , name , callback ) {
for ( var i = 0 , n = type . length ; i < n ; ++ i ) {
if ( type [ i ] . name === name ) {
type [ i ] = noop , type = type . slice ( 0 , i ) . concat ( type . slice ( i + 1 ) ) ;
break ;
}
}
if ( callback != null ) type . push ( { name : name , value : callback } ) ;
return type ;
}
var xhtml = "http://www.w3.org/1999/xhtml" ;
var namespaces = {
svg : "http://www.w3.org/2000/svg" ,
xhtml : xhtml ,
xlink : "http://www.w3.org/1999/xlink" ,
xml : "http://www.w3.org/XML/1998/namespace" ,
xmlns : "http://www.w3.org/2000/xmlns/"
} ;
var namespace = function ( name ) {
var prefix = name += "" ,
i = prefix . indexOf ( ":" ) ;
if ( i >= 0 && ( prefix = name . slice ( 0 , i ) ) !== "xmlns" ) name = name . slice ( i + 1 ) ;
return namespaces . hasOwnProperty ( prefix ) ? { space : namespaces [ prefix ] , local : name } : name ;
} ;
function creatorInherit ( name ) {
return function ( ) {
var document = this . ownerDocument ,
uri = this . namespaceURI ;
return uri === xhtml && document . documentElement . namespaceURI === xhtml ?
document . createElement ( name ) :
document . createElementNS ( uri , name ) ;
} ;
}
function creatorFixed ( fullname ) {
return function ( ) {
return this . ownerDocument . createElementNS ( fullname . space , fullname . local ) ;
} ;
}
var creator = function ( name ) {
var fullname = namespace ( name ) ;
return ( fullname . local ?
creatorFixed :
creatorInherit ) ( fullname ) ;
} ;
var nextId = 0 ;
function local$1 ( ) {
return new Local ;
}
function Local ( ) {
this . _ = "@" + ( ++ nextId ) . toString ( 36 ) ;
}
Local . prototype = local$1 . prototype = {
constructor : Local ,
get : function ( node ) {
var id = this . _ ;
while ( ! ( id in node ) )
if ( ! ( node = node . parentNode ) ) return ;
return node [ id ] ;
} ,
set : function ( node , value ) {
return node [ this . _ ] = value ;
} ,
remove : function ( node ) {
return this . _ in node && delete node [ this . _ ] ;
} ,
toString : function ( ) {
return this . _ ;
}
} ;
var matcher = function ( selector ) {
return function ( ) {
return this . matches ( selector ) ;
} ;
} ;
if ( typeof document !== "undefined" ) {
var element = document . documentElement ;
if ( ! element . matches ) {
var vendorMatches = element . webkitMatchesSelector ||
element . msMatchesSelector ||
element . mozMatchesSelector ||
element . oMatchesSelector ;
matcher = function ( selector ) {
return function ( ) {
return vendorMatches . call ( this , selector ) ;
} ;
} ;
}
}
var matcher$1 = matcher ;
var filterEvents = { } ;
exports . event = null ;
if ( typeof document !== "undefined" ) {
var element$1 = document . documentElement ;
if ( ! ( "onmouseenter" in element$1 ) ) {
filterEvents = { mouseenter : "mouseover" , mouseleave : "mouseout" } ;
}
}
function filterContextListener ( listener , index , group ) {
listener = contextListener ( listener , index , group ) ;
return function ( event ) {
var related = event . relatedTarget ;
if ( ! related || ( related !== this && ! ( related . compareDocumentPosition ( this ) & 8 ) ) ) {
listener . call ( this , event ) ;
}
} ;
}
function contextListener ( listener , index , group ) {
return function ( event1 ) {
var event0 = exports . event ; // Events can be reentrant (e.g., focus).
exports . event = event1 ;
try {
listener . call ( this , this . _ _data _ _ , index , group ) ;
} finally {
exports . event = event0 ;
}
} ;
}
function parseTypenames$1 ( typenames ) {
return typenames . trim ( ) . split ( /^|\s+/ ) . map ( function ( t ) {
var name = "" ,
i = t . indexOf ( "." ) ;
if ( i >= 0 ) name = t . slice ( i + 1 ) , t = t . slice ( 0 , i ) ;
return { type : t , name : name } ;
} ) ;
}
function onRemove ( typename ) {
return function ( ) {
var on = this . _ _on ;
if ( ! on ) return ;
for ( var j = 0 , i = - 1 , m = on . length , o ; j < m ; ++ j ) {
if ( o = on [ j ] , ( ! typename . type || o . type === typename . type ) && o . name === typename . name ) {
this . removeEventListener ( o . type , o . listener , o . capture ) ;
} else {
on [ ++ i ] = o ;
}
}
if ( ++ i ) on . length = i ;
else delete this . _ _on ;
} ;
}
function onAdd ( typename , value , capture ) {
var wrap = filterEvents . hasOwnProperty ( typename . type ) ? filterContextListener : contextListener ;
return function ( d , i , group ) {
var on = this . _ _on ,
o , listener = wrap ( value , i , group ) ;
if ( on )
for ( var j = 0 , m = on . length ; j < m ; ++ j ) {
if ( ( o = on [ j ] ) . type === typename . type && o . name === typename . name ) {
this . removeEventListener ( o . type , o . listener , o . capture ) ;
this . addEventListener ( o . type , o . listener = listener , o . capture = capture ) ;
o . value = value ;
return ;
}
}
this . addEventListener ( typename . type , listener , capture ) ;
o = { type : typename . type , name : typename . name , value : value , listener : listener , capture : capture } ;
if ( ! on ) this . _ _on = [ o ] ;
else on . push ( o ) ;
} ;
}
var selection _on = function ( typename , value , capture ) {
var typenames = parseTypenames$1 ( typename + "" ) ,
i , n = typenames . length ,
t ;
if ( arguments . length < 2 ) {
var on = this . node ( ) . _ _on ;
if ( on )
for ( var j = 0 , m = on . length , o ; j < m ; ++ j ) {
for ( i = 0 , o = on [ j ] ; i < n ; ++ i ) {
if ( ( t = typenames [ i ] ) . type === o . type && t . name === o . name ) {
return o . value ;
}
}
}
return ;
}
on = value ? onAdd : onRemove ;
if ( capture == null ) capture = false ;
for ( i = 0 ; i < n ; ++ i ) this . each ( on ( typenames [ i ] , value , capture ) ) ;
return this ;
} ;
function customEvent ( event1 , listener , that , args ) {
var event0 = exports . event ;
event1 . sourceEvent = exports . event ;
exports . event = event1 ;
try {
return listener . apply ( that , args ) ;
} finally {
exports . event = event0 ;
}
}
var sourceEvent = function ( ) {
var current = exports . event ,
source ;
while ( source = current . sourceEvent ) current = source ;
return current ;
} ;
var point = function ( node , event ) {
var svg = node . ownerSVGElement || node ;
if ( svg . createSVGPoint ) {
var point = svg . createSVGPoint ( ) ;
point . x = event . clientX , point . y = event . clientY ;
point = point . matrixTransform ( node . getScreenCTM ( ) . inverse ( ) ) ;
return [ point . x , point . y ] ;
}
var rect = node . getBoundingClientRect ( ) ;
return [ event . clientX - rect . left - node . clientLeft , event . clientY - rect . top - node . clientTop ] ;
} ;
var mouse = function ( node ) {
var event = sourceEvent ( ) ;
if ( event . changedTouches ) event = event . changedTouches [ 0 ] ;
return point ( node , event ) ;
} ;
function none ( ) { }
var selector = function ( selector ) {
return selector == null ? none : function ( ) {
return this . querySelector ( selector ) ;
} ;
} ;
var selection _select = function ( select ) {
if ( typeof select !== "function" ) select = selector ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = new Array ( n ) , node , subnode , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && ( subnode = select . call ( node , node . _ _data _ _ , i , group ) ) ) {
if ( "__data__" in node ) subnode . _ _data _ _ = node . _ _data _ _ ;
subgroup [ i ] = subnode ;
}
}
}
return new Selection ( subgroups , this . _parents ) ;
} ;
function empty$1 ( ) {
return [ ] ;
}
var selectorAll = function ( selector ) {
return selector == null ? empty$1 : function ( ) {
return this . querySelectorAll ( selector ) ;
} ;
} ;
var selection _selectAll = function ( select ) {
if ( typeof select !== "function" ) select = selectorAll ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = [ ] , parents = [ ] , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
subgroups . push ( select . call ( node , node . _ _data _ _ , i , group ) ) ;
parents . push ( node ) ;
}
}
}
return new Selection ( subgroups , parents ) ;
} ;
var selection _filter = function ( match ) {
if ( typeof match !== "function" ) match = matcher$1 ( match ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = [ ] , node , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && match . call ( node , node . _ _data _ _ , i , group ) ) {
subgroup . push ( node ) ;
}
}
}
return new Selection ( subgroups , this . _parents ) ;
} ;
var sparse = function ( update ) {
return new Array ( update . length ) ;
} ;
var selection _enter = function ( ) {
return new Selection ( this . _enter || this . _groups . map ( sparse ) , this . _parents ) ;
} ;
function EnterNode ( parent , datum ) {
this . ownerDocument = parent . ownerDocument ;
this . namespaceURI = parent . namespaceURI ;
this . _next = null ;
this . _parent = parent ;
this . _ _data _ _ = datum ;
}
EnterNode . prototype = {
constructor : EnterNode ,
appendChild : function ( child ) { return this . _parent . insertBefore ( child , this . _next ) ; } ,
insertBefore : function ( child , next ) { return this . _parent . insertBefore ( child , next ) ; } ,
querySelector : function ( selector ) { return this . _parent . querySelector ( selector ) ; } ,
querySelectorAll : function ( selector ) { return this . _parent . querySelectorAll ( selector ) ; }
} ;
var constant$1 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var keyPrefix = "$" ; // Protect against keys like “__proto__”.
function bindIndex ( parent , group , enter , update , exit , data ) {
var i = 0 ,
node ,
groupLength = group . length ,
dataLength = data . length ;
// Put any non-null nodes that fit into update.
// Put any null nodes into enter.
// Put any remaining data into enter.
for ( ; i < dataLength ; ++ i ) {
if ( node = group [ i ] ) {
node . _ _data _ _ = data [ i ] ;
update [ i ] = node ;
} else {
enter [ i ] = new EnterNode ( parent , data [ i ] ) ;
}
}
// Put any non-null nodes that don’
for ( ; i < groupLength ; ++ i ) {
if ( node = group [ i ] ) {
exit [ i ] = node ;
}
}
}
function bindKey ( parent , group , enter , update , exit , data , key ) {
var i ,
node ,
nodeByKeyValue = { } ,
groupLength = group . length ,
dataLength = data . length ,
keyValues = new Array ( groupLength ) ,
keyValue ;
// Compute the key for each node.
// If multiple nodes have the same key, the duplicates are added to exit.
for ( i = 0 ; i < groupLength ; ++ i ) {
if ( node = group [ i ] ) {
keyValues [ i ] = keyValue = keyPrefix + key . call ( node , node . _ _data _ _ , i , group ) ;
if ( keyValue in nodeByKeyValue ) {
exit [ i ] = node ;
} else {
nodeByKeyValue [ keyValue ] = node ;
}
}
}
// Compute the key for each datum.
// If there a node associated with this key, join and add it to update.
// If there is not (or the key is a duplicate), add it to enter.
for ( i = 0 ; i < dataLength ; ++ i ) {
keyValue = keyPrefix + key . call ( parent , data [ i ] , i , data ) ;
if ( node = nodeByKeyValue [ keyValue ] ) {
update [ i ] = node ;
node . _ _data _ _ = data [ i ] ;
nodeByKeyValue [ keyValue ] = null ;
} else {
enter [ i ] = new EnterNode ( parent , data [ i ] ) ;
}
}
// Add any remaining nodes that were not bound to data to exit.
for ( i = 0 ; i < groupLength ; ++ i ) {
if ( ( node = group [ i ] ) && ( nodeByKeyValue [ keyValues [ i ] ] === node ) ) {
exit [ i ] = node ;
}
}
}
var selection _data = function ( value , key ) {
if ( ! value ) {
data = new Array ( this . size ( ) ) , j = - 1 ;
this . each ( function ( d ) { data [ ++ j ] = d ; } ) ;
return data ;
}
var bind = key ? bindKey : bindIndex ,
parents = this . _parents ,
groups = this . _groups ;
if ( typeof value !== "function" ) value = constant$1 ( value ) ;
for ( var m = groups . length , update = new Array ( m ) , enter = new Array ( m ) , exit = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
var parent = parents [ j ] ,
group = groups [ j ] ,
groupLength = group . length ,
data = value . call ( parent , parent && parent . _ _data _ _ , j , parents ) ,
dataLength = data . length ,
enterGroup = enter [ j ] = new Array ( dataLength ) ,
updateGroup = update [ j ] = new Array ( dataLength ) ,
exitGroup = exit [ j ] = new Array ( groupLength ) ;
bind ( parent , group , enterGroup , updateGroup , exitGroup , data , key ) ;
// Now connect the enter nodes to their following update node, such that
// appendChild can insert the materialized enter node before this node,
// rather than at the end of the parent node.
for ( var i0 = 0 , i1 = 0 , previous , next ; i0 < dataLength ; ++ i0 ) {
if ( previous = enterGroup [ i0 ] ) {
if ( i0 >= i1 ) i1 = i0 + 1 ;
while ( ! ( next = updateGroup [ i1 ] ) && ++ i1 < dataLength ) ;
previous . _next = next || null ;
}
}
}
update = new Selection ( update , parents ) ;
update . _enter = enter ;
update . _exit = exit ;
return update ;
} ;
var selection _exit = function ( ) {
return new Selection ( this . _exit || this . _groups . map ( sparse ) , this . _parents ) ;
} ;
var selection _merge = function ( selection ) {
for ( var groups0 = this . _groups , groups1 = selection . _groups , m0 = groups0 . length , m1 = groups1 . length , m = Math . min ( m0 , m1 ) , merges = new Array ( m0 ) , j = 0 ; j < m ; ++ j ) {
for ( var group0 = groups0 [ j ] , group1 = groups1 [ j ] , n = group0 . length , merge = merges [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group0 [ i ] || group1 [ i ] ) {
merge [ i ] = node ;
}
}
}
for ( ; j < m0 ; ++ j ) {
merges [ j ] = groups0 [ j ] ;
}
return new Selection ( merges , this . _parents ) ;
} ;
var selection _order = function ( ) {
for ( var groups = this . _groups , j = - 1 , m = groups . length ; ++ j < m ; ) {
for ( var group = groups [ j ] , i = group . length - 1 , next = group [ i ] , node ; -- i >= 0 ; ) {
if ( node = group [ i ] ) {
if ( next && next !== node . nextSibling ) next . parentNode . insertBefore ( node , next ) ;
next = node ;
}
}
}
return this ;
} ;
var selection _sort = function ( compare ) {
if ( ! compare ) compare = ascending$1 ;
function compareNode ( a , b ) {
return a && b ? compare ( a . _ _data _ _ , b . _ _data _ _ ) : ! a - ! b ;
}
for ( var groups = this . _groups , m = groups . length , sortgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , sortgroup = sortgroups [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
sortgroup [ i ] = node ;
}
}
sortgroup . sort ( compareNode ) ;
}
return new Selection ( sortgroups , this . _parents ) . order ( ) ;
} ;
function ascending$1 ( a , b ) {
return a < b ? - 1 : a > b ? 1 : a >= b ? 0 : NaN ;
}
var selection _call = function ( ) {
var callback = arguments [ 0 ] ;
arguments [ 0 ] = this ;
callback . apply ( null , arguments ) ;
return this ;
} ;
var selection _nodes = function ( ) {
var nodes = new Array ( this . size ( ) ) ,
i = - 1 ;
this . each ( function ( ) { nodes [ ++ i ] = this ; } ) ;
return nodes ;
} ;
var selection _node = function ( ) {
for ( var groups = this . _groups , j = 0 , m = groups . length ; j < m ; ++ j ) {
for ( var group = groups [ j ] , i = 0 , n = group . length ; i < n ; ++ i ) {
var node = group [ i ] ;
if ( node ) return node ;
}
}
return null ;
} ;
var selection _size = function ( ) {
var size = 0 ;
this . each ( function ( ) { ++ size ; } ) ;
return size ;
} ;
var selection _empty = function ( ) {
return ! this . node ( ) ;
} ;
var selection _each = function ( callback ) {
for ( var groups = this . _groups , j = 0 , m = groups . length ; j < m ; ++ j ) {
for ( var group = groups [ j ] , i = 0 , n = group . length , node ; i < n ; ++ i ) {
if ( node = group [ i ] ) callback . call ( node , node . _ _data _ _ , i , group ) ;
}
}
return this ;
} ;
function attrRemove ( name ) {
return function ( ) {
this . removeAttribute ( name ) ;
} ;
}
function attrRemoveNS ( fullname ) {
return function ( ) {
this . removeAttributeNS ( fullname . space , fullname . local ) ;
} ;
}
function attrConstant ( name , value ) {
return function ( ) {
this . setAttribute ( name , value ) ;
} ;
}
function attrConstantNS ( fullname , value ) {
return function ( ) {
this . setAttributeNS ( fullname . space , fullname . local , value ) ;
} ;
}
function attrFunction ( name , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . removeAttribute ( name ) ;
else this . setAttribute ( name , v ) ;
} ;
}
function attrFunctionNS ( fullname , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . removeAttributeNS ( fullname . space , fullname . local ) ;
else this . setAttributeNS ( fullname . space , fullname . local , v ) ;
} ;
}
var selection _attr = function ( name , value ) {
var fullname = namespace ( name ) ;
if ( arguments . length < 2 ) {
var node = this . node ( ) ;
return fullname . local ?
node . getAttributeNS ( fullname . space , fullname . local ) :
node . getAttribute ( fullname ) ;
}
return this . each ( ( value == null ?
( fullname . local ? attrRemoveNS : attrRemove ) : ( typeof value === "function" ?
( fullname . local ? attrFunctionNS : attrFunction ) :
( fullname . local ? attrConstantNS : attrConstant ) ) ) ( fullname , value ) ) ;
} ;
var window = function ( node ) {
return ( node . ownerDocument && node . ownerDocument . defaultView ) // node is a Node
||
( node . document && node ) // node is a Window
||
node . defaultView ; // node is a Document
} ;
function styleRemove ( name ) {
return function ( ) {
this . style . removeProperty ( name ) ;
} ;
}
function styleConstant ( name , value , priority ) {
return function ( ) {
this . style . setProperty ( name , value , priority ) ;
} ;
}
function styleFunction ( name , value , priority ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . style . removeProperty ( name ) ;
else this . style . setProperty ( name , v , priority ) ;
} ;
}
var selection _style = function ( name , value , priority ) {
var node ;
return arguments . length > 1 ?
this . each ( ( value == null ?
styleRemove : typeof value === "function" ?
styleFunction :
styleConstant ) ( name , value , priority == null ? "" : priority ) ) :
window ( node = this . node ( ) )
. getComputedStyle ( node , null )
. getPropertyValue ( name ) ;
} ;
function propertyRemove ( name ) {
return function ( ) {
delete this [ name ] ;
} ;
}
function propertyConstant ( name , value ) {
return function ( ) {
this [ name ] = value ;
} ;
}
function propertyFunction ( name , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) delete this [ name ] ;
else this [ name ] = v ;
} ;
}
var selection _property = function ( name , value ) {
return arguments . length > 1 ?
this . each ( ( value == null ?
propertyRemove : typeof value === "function" ?
propertyFunction :
propertyConstant ) ( name , value ) ) :
this . node ( ) [ name ] ;
} ;
function classArray ( string ) {
return string . trim ( ) . split ( /^|\s+/ ) ;
}
function classList ( node ) {
return node . classList || new ClassList ( node ) ;
}
function ClassList ( node ) {
this . _node = node ;
this . _names = classArray ( node . getAttribute ( "class" ) || "" ) ;
}
ClassList . prototype = {
add : function ( name ) {
var i = this . _names . indexOf ( name ) ;
if ( i < 0 ) {
this . _names . push ( name ) ;
this . _node . setAttribute ( "class" , this . _names . join ( " " ) ) ;
}
} ,
remove : function ( name ) {
var i = this . _names . indexOf ( name ) ;
if ( i >= 0 ) {
this . _names . splice ( i , 1 ) ;
this . _node . setAttribute ( "class" , this . _names . join ( " " ) ) ;
}
} ,
contains : function ( name ) {
return this . _names . indexOf ( name ) >= 0 ;
}
} ;
function classedAdd ( node , names ) {
var list = classList ( node ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n ) list . add ( names [ i ] ) ;
}
function classedRemove ( node , names ) {
var list = classList ( node ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n ) list . remove ( names [ i ] ) ;
}
function classedTrue ( names ) {
return function ( ) {
classedAdd ( this , names ) ;
} ;
}
function classedFalse ( names ) {
return function ( ) {
classedRemove ( this , names ) ;
} ;
}
function classedFunction ( names , value ) {
return function ( ) {
( value . apply ( this , arguments ) ? classedAdd : classedRemove ) ( this , names ) ;
} ;
}
var selection _classed = function ( name , value ) {
var names = classArray ( name + "" ) ;
if ( arguments . length < 2 ) {
var list = classList ( this . node ( ) ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n )
if ( ! list . contains ( names [ i ] ) ) return false ;
return true ;
}
return this . each ( ( typeof value === "function" ?
classedFunction : value ?
classedTrue :
classedFalse ) ( names , value ) ) ;
} ;
function textRemove ( ) {
this . textContent = "" ;
}
function textConstant ( value ) {
return function ( ) {
this . textContent = value ;
} ;
}
function textFunction ( value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
this . textContent = v == null ? "" : v ;
} ;
}
var selection _text = function ( value ) {
return arguments . length ?
this . each ( value == null ?
textRemove : ( typeof value === "function" ?
textFunction :
textConstant ) ( value ) ) :
this . node ( ) . textContent ;
} ;
function htmlRemove ( ) {
this . innerHTML = "" ;
}
function htmlConstant ( value ) {
return function ( ) {
this . innerHTML = value ;
} ;
}
function htmlFunction ( value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
this . innerHTML = v == null ? "" : v ;
} ;
}
var selection _html = function ( value ) {
return arguments . length ?
this . each ( value == null ?
htmlRemove : ( typeof value === "function" ?
htmlFunction :
htmlConstant ) ( value ) ) :
this . node ( ) . innerHTML ;
} ;
function raise ( ) {
if ( this . nextSibling ) this . parentNode . appendChild ( this ) ;
}
var selection _raise = function ( ) {
return this . each ( raise ) ;
} ;
function lower ( ) {
if ( this . previousSibling ) this . parentNode . insertBefore ( this , this . parentNode . firstChild ) ;
}
var selection _lower = function ( ) {
return this . each ( lower ) ;
} ;
var selection _append = function ( name ) {
var create = typeof name === "function" ? name : creator ( name ) ;
return this . select ( function ( ) {
return this . appendChild ( create . apply ( this , arguments ) ) ;
} ) ;
} ;
function constantNull ( ) {
return null ;
}
var selection _insert = function ( name , before ) {
var create = typeof name === "function" ? name : creator ( name ) ,
select = before == null ? constantNull : typeof before === "function" ? before : selector ( before ) ;
return this . select ( function ( ) {
return this . insertBefore ( create . apply ( this , arguments ) , select . apply ( this , arguments ) || null ) ;
} ) ;
} ;
function remove ( ) {
var parent = this . parentNode ;
if ( parent ) parent . removeChild ( this ) ;
}
var selection _remove = function ( ) {
return this . each ( remove ) ;
} ;
var selection _datum = function ( value ) {
return arguments . length ?
this . property ( "__data__" , value ) :
this . node ( ) . _ _data _ _ ;
} ;
function dispatchEvent ( node , type , params ) {
var window $$1 = window ( node ) ,
event = window $$1 . CustomEvent ;
if ( event ) {
event = new event ( type , params ) ;
} else {
event = window $$1 . document . createEvent ( "Event" ) ;
if ( params ) event . initEvent ( type , params . bubbles , params . cancelable ) , event . detail = params . detail ;
else event . initEvent ( type , false , false ) ;
}
node . dispatchEvent ( event ) ;
}
function dispatchConstant ( type , params ) {
return function ( ) {
return dispatchEvent ( this , type , params ) ;
} ;
}
function dispatchFunction ( type , params ) {
return function ( ) {
return dispatchEvent ( this , type , params . apply ( this , arguments ) ) ;
} ;
}
var selection _dispatch = function ( type , params ) {
return this . each ( ( typeof params === "function" ?
dispatchFunction :
dispatchConstant ) ( type , params ) ) ;
} ;
var root = [ null ] ;
function Selection ( groups , parents ) {
this . _groups = groups ;
this . _parents = parents ;
}
function selection ( ) {
return new Selection ( [
[ document . documentElement ]
] , root ) ;
}
Selection . prototype = selection . prototype = {
constructor : Selection ,
select : selection _select ,
selectAll : selection _selectAll ,
filter : selection _filter ,
data : selection _data ,
enter : selection _enter ,
exit : selection _exit ,
merge : selection _merge ,
order : selection _order ,
sort : selection _sort ,
call : selection _call ,
nodes : selection _nodes ,
node : selection _node ,
size : selection _size ,
empty : selection _empty ,
each : selection _each ,
attr : selection _attr ,
style : selection _style ,
property : selection _property ,
classed : selection _classed ,
text : selection _text ,
html : selection _html ,
raise : selection _raise ,
lower : selection _lower ,
append : selection _append ,
insert : selection _insert ,
remove : selection _remove ,
datum : selection _datum ,
on : selection _on ,
dispatch : selection _dispatch
} ;
var select = function ( selector ) {
return typeof selector === "string" ?
new Selection ( [
[ document . querySelector ( selector ) ]
] , [ document . documentElement ] ) :
new Selection ( [
[ selector ]
] , root ) ;
} ;
var selectAll = function ( selector ) {
return typeof selector === "string" ?
new Selection ( [ document . querySelectorAll ( selector ) ] , [ document . documentElement ] ) :
new Selection ( [ selector == null ? [ ] : selector ] , root ) ;
} ;
var touch = function ( node , touches , identifier ) {
if ( arguments . length < 3 ) identifier = touches , touches = sourceEvent ( ) . changedTouches ;
for ( var i = 0 , n = touches ? touches . length : 0 , touch ; i < n ; ++ i ) {
if ( ( touch = touches [ i ] ) . identifier === identifier ) {
return point ( node , touch ) ;
}
}
return null ;
} ;
var touches = function ( node , touches ) {
if ( touches == null ) touches = sourceEvent ( ) . touches ;
for ( var i = 0 , n = touches ? touches . length : 0 , points = new Array ( n ) ; i < n ; ++ i ) {
points [ i ] = point ( node , touches [ i ] ) ;
}
return points ;
} ;
function nopropagation ( ) {
exports . event . stopImmediatePropagation ( ) ;
}
var noevent = function ( ) {
exports . event . preventDefault ( ) ;
exports . event . stopImmediatePropagation ( ) ;
} ;
var dragDisable = function ( view ) {
var root = view . document . documentElement ,
selection$$1 = select ( view ) . on ( "dragstart.drag" , noevent , true ) ;
if ( "onselectstart" in root ) {
selection$$1 . on ( "selectstart.drag" , noevent , true ) ;
} else {
root . _ _noselect = root . style . MozUserSelect ;
root . style . MozUserSelect = "none" ;
}
} ;
function yesdrag ( view , noclick ) {
var root = view . document . documentElement ,
selection$$1 = select ( view ) . on ( "dragstart.drag" , null ) ;
if ( noclick ) {
selection$$1 . on ( "click.drag" , noevent , true ) ;
setTimeout ( function ( ) { selection$$1 . on ( "click.drag" , null ) ; } , 0 ) ;
}
if ( "onselectstart" in root ) {
selection$$1 . on ( "selectstart.drag" , null ) ;
} else {
root . style . MozUserSelect = root . _ _noselect ;
delete root . _ _noselect ;
}
}
var constant$2 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
function DragEvent ( target , type , subject , id , active , x , y , dx , dy , dispatch ) {
this . target = target ;
this . type = type ;
this . subject = subject ;
this . identifier = id ;
this . active = active ;
this . x = x ;
this . y = y ;
this . dx = dx ;
this . dy = dy ;
this . _ = dispatch ;
}
DragEvent . prototype . on = function ( ) {
var value = this . _ . on . apply ( this . _ , arguments ) ;
return value === this . _ ? this : value ;
} ;
// Ignore right-click, since that should open the context menu.
function defaultFilter$1 ( ) {
return ! exports . event . button ;
}
function defaultContainer ( ) {
return this . parentNode ;
}
function defaultSubject ( d ) {
return d == null ? { x : exports . event . x , y : exports . event . y } : d ;
}
var drag = function ( ) {
var filter = defaultFilter$1 ,
container = defaultContainer ,
subject = defaultSubject ,
gestures = { } ,
listeners = dispatch ( "start" , "drag" , "end" ) ,
active = 0 ,
mousemoving ,
touchending ;
function drag ( selection$$1 ) {
selection$$1
. on ( "mousedown.drag" , mousedowned )
. on ( "touchstart.drag" , touchstarted )
. on ( "touchmove.drag" , touchmoved )
. on ( "touchend.drag touchcancel.drag" , touchended )
. style ( "-webkit-tap-highlight-color" , "rgba(0,0,0,0)" ) ;
}
function mousedowned ( ) {
if ( touchending || ! filter . apply ( this , arguments ) ) return ;
var gesture = beforestart ( "mouse" , container . apply ( this , arguments ) , mouse , this , arguments ) ;
if ( ! gesture ) return ;
select ( exports . event . view ) . on ( "mousemove.drag" , mousemoved , true ) . on ( "mouseup.drag" , mouseupped , true ) ;
dragDisable ( exports . event . view ) ;
nopropagation ( ) ;
mousemoving = false ;
gesture ( "start" ) ;
}
function mousemoved ( ) {
noevent ( ) ;
mousemoving = true ;
gestures . mouse ( "drag" ) ;
}
function mouseupped ( ) {
select ( exports . event . view ) . on ( "mousemove.drag mouseup.drag" , null ) ;
yesdrag ( exports . event . view , mousemoving ) ;
noevent ( ) ;
gestures . mouse ( "end" ) ;
}
function touchstarted ( ) {
if ( ! filter . apply ( this , arguments ) ) return ;
var touches$$1 = exports . event . changedTouches ,
c = container . apply ( this , arguments ) ,
n = touches$$1 . length ,
i , gesture ;
for ( i = 0 ; i < n ; ++ i ) {
if ( gesture = beforestart ( touches$$1 [ i ] . identifier , c , touch , this , arguments ) ) {
nopropagation ( ) ;
gesture ( "start" ) ;
}
}
}
function touchmoved ( ) {
var touches$$1 = exports . event . changedTouches ,
n = touches$$1 . length ,
i , gesture ;
for ( i = 0 ; i < n ; ++ i ) {
if ( gesture = gestures [ touches$$1 [ i ] . identifier ] ) {
noevent ( ) ;
gesture ( "drag" ) ;
}
}
}
function touchended ( ) {
var touches$$1 = exports . event . changedTouches ,
n = touches$$1 . length ,
i , gesture ;
if ( touchending ) clearTimeout ( touchending ) ;
touchending = setTimeout ( function ( ) { touchending = null ; } , 500 ) ; // Ghost clicks are delayed!
for ( i = 0 ; i < n ; ++ i ) {
if ( gesture = gestures [ touches$$1 [ i ] . identifier ] ) {
nopropagation ( ) ;
gesture ( "end" ) ;
}
}
}
function beforestart ( id , container , point , that , args ) {
var p = point ( container , id ) ,
s , dx , dy ,
sublisteners = listeners . copy ( ) ;
if ( ! customEvent ( new DragEvent ( drag , "beforestart" , s , id , active , p [ 0 ] , p [ 1 ] , 0 , 0 , sublisteners ) , function ( ) {
if ( ( exports . event . subject = s = subject . apply ( that , args ) ) == null ) return false ;
dx = s . x - p [ 0 ] || 0 ;
dy = s . y - p [ 1 ] || 0 ;
return true ;
} ) ) return ;
return function gesture ( type ) {
var p0 = p ,
n ;
switch ( type ) {
case "start" :
gestures [ id ] = gesture , n = active ++ ;
break ;
case "end" :
delete gestures [ id ] , -- active ; // nobreak
case "drag" :
p = point ( container , id ) , n = active ;
break ;
}
customEvent ( new DragEvent ( drag , type , s , id , n , p [ 0 ] + dx , p [ 1 ] + dy , p [ 0 ] - p0 [ 0 ] , p [ 1 ] - p0 [ 1 ] , sublisteners ) , sublisteners . apply , sublisteners , [ type , that , args ] ) ;
} ;
}
drag . filter = function ( _ ) {
return arguments . length ? ( filter = typeof _ === "function" ? _ : constant$2 ( ! ! _ ) , drag ) : filter ;
} ;
drag . container = function ( _ ) {
return arguments . length ? ( container = typeof _ === "function" ? _ : constant$2 ( _ ) , drag ) : container ;
} ;
drag . subject = function ( _ ) {
return arguments . length ? ( subject = typeof _ === "function" ? _ : constant$2 ( _ ) , drag ) : subject ;
} ;
drag . on = function ( ) {
var value = listeners . on . apply ( listeners , arguments ) ;
return value === listeners ? drag : value ;
} ;
return drag ;
} ;
var define = function ( constructor , factory , prototype ) {
constructor . prototype = factory . prototype = prototype ;
prototype . constructor = constructor ;
} ;
function extend ( parent , definition ) {
var prototype = Object . create ( parent . prototype ) ;
for ( var key in definition ) prototype [ key ] = definition [ key ] ;
return prototype ;
}
function Color ( ) { }
var darker = 0.7 ;
var brighter = 1 / darker ;
var reI = "\\s*([+-]?\\d+)\\s*" ;
var reN = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*" ;
var reP = "\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*" ;
var reHex3 = /^#([0-9a-f]{3})$/ ;
var reHex6 = /^#([0-9a-f]{6})$/ ;
var reRgbInteger = new RegExp ( "^rgb\\(" + [ reI , reI , reI ] + "\\)$" ) ;
var reRgbPercent = new RegExp ( "^rgb\\(" + [ reP , reP , reP ] + "\\)$" ) ;
var reRgbaInteger = new RegExp ( "^rgba\\(" + [ reI , reI , reI , reN ] + "\\)$" ) ;
var reRgbaPercent = new RegExp ( "^rgba\\(" + [ reP , reP , reP , reN ] + "\\)$" ) ;
var reHslPercent = new RegExp ( "^hsl\\(" + [ reN , reP , reP ] + "\\)$" ) ;
var reHslaPercent = new RegExp ( "^hsla\\(" + [ reN , reP , reP , reN ] + "\\)$" ) ;
var named = {
aliceblue : 0xf0f8ff ,
antiquewhite : 0xfaebd7 ,
aqua : 0x00ffff ,
aquamarine : 0x7fffd4 ,
azure : 0xf0ffff ,
beige : 0xf5f5dc ,
bisque : 0xffe4c4 ,
black : 0x000000 ,
blanchedalmond : 0xffebcd ,
blue : 0x0000ff ,
blueviolet : 0x8a2be2 ,
brown : 0xa52a2a ,
burlywood : 0xdeb887 ,
cadetblue : 0x5f9ea0 ,
chartreuse : 0x7fff00 ,
chocolate : 0xd2691e ,
coral : 0xff7f50 ,
cornflowerblue : 0x6495ed ,
cornsilk : 0xfff8dc ,
crimson : 0xdc143c ,
cyan : 0x00ffff ,
darkblue : 0x00008b ,
darkcyan : 0x008b8b ,
darkgoldenrod : 0xb8860b ,
darkgray : 0xa9a9a9 ,
darkgreen : 0x006400 ,
darkgrey : 0xa9a9a9 ,
darkkhaki : 0xbdb76b ,
darkmagenta : 0x8b008b ,
darkolivegreen : 0x556b2f ,
darkorange : 0xff8c00 ,
darkorchid : 0x9932cc ,
darkred : 0x8b0000 ,
darksalmon : 0xe9967a ,
darkseagreen : 0x8fbc8f ,
darkslateblue : 0x483d8b ,
darkslategray : 0x2f4f4f ,
darkslategrey : 0x2f4f4f ,
darkturquoise : 0x00ced1 ,
darkviolet : 0x9400d3 ,
deeppink : 0xff1493 ,
deepskyblue : 0x00bfff ,
dimgray : 0x696969 ,
dimgrey : 0x696969 ,
dodgerblue : 0x1e90ff ,
firebrick : 0xb22222 ,
floralwhite : 0xfffaf0 ,
forestgreen : 0x228b22 ,
fuchsia : 0xff00ff ,
gainsboro : 0xdcdcdc ,
ghostwhite : 0xf8f8ff ,
gold : 0xffd700 ,
goldenrod : 0xdaa520 ,
gray : 0x808080 ,
green : 0x008000 ,
greenyellow : 0xadff2f ,
grey : 0x808080 ,
honeydew : 0xf0fff0 ,
hotpink : 0xff69b4 ,
indianred : 0xcd5c5c ,
indigo : 0x4b0082 ,
ivory : 0xfffff0 ,
khaki : 0xf0e68c ,
lavender : 0xe6e6fa ,
lavenderblush : 0xfff0f5 ,
lawngreen : 0x7cfc00 ,
lemonchiffon : 0xfffacd ,
lightblue : 0xadd8e6 ,
lightcoral : 0xf08080 ,
lightcyan : 0xe0ffff ,
lightgoldenrodyellow : 0xfafad2 ,
lightgray : 0xd3d3d3 ,
lightgreen : 0x90ee90 ,
lightgrey : 0xd3d3d3 ,
lightpink : 0xffb6c1 ,
lightsalmon : 0xffa07a ,
lightseagreen : 0x20b2aa ,
lightskyblue : 0x87cefa ,
lightslategray : 0x778899 ,
lightslategrey : 0x778899 ,
lightsteelblue : 0xb0c4de ,
lightyellow : 0xffffe0 ,
lime : 0x00ff00 ,
limegreen : 0x32cd32 ,
linen : 0xfaf0e6 ,
magenta : 0xff00ff ,
maroon : 0x800000 ,
mediumaquamarine : 0x66cdaa ,
mediumblue : 0x0000cd ,
mediumorchid : 0xba55d3 ,
mediumpurple : 0x9370db ,
mediumseagreen : 0x3cb371 ,
mediumslateblue : 0x7b68ee ,
mediumspringgreen : 0x00fa9a ,
mediumturquoise : 0x48d1cc ,
mediumvioletred : 0xc71585 ,
midnightblue : 0x191970 ,
mintcream : 0xf5fffa ,
mistyrose : 0xffe4e1 ,
moccasin : 0xffe4b5 ,
navajowhite : 0xffdead ,
navy : 0x000080 ,
oldlace : 0xfdf5e6 ,
olive : 0x808000 ,
olivedrab : 0x6b8e23 ,
orange : 0xffa500 ,
orangered : 0xff4500 ,
orchid : 0xda70d6 ,
palegoldenrod : 0xeee8aa ,
palegreen : 0x98fb98 ,
paleturquoise : 0xafeeee ,
palevioletred : 0xdb7093 ,
papayawhip : 0xffefd5 ,
peachpuff : 0xffdab9 ,
peru : 0xcd853f ,
pink : 0xffc0cb ,
plum : 0xdda0dd ,
powderblue : 0xb0e0e6 ,
purple : 0x800080 ,
rebeccapurple : 0x663399 ,
red : 0xff0000 ,
rosybrown : 0xbc8f8f ,
royalblue : 0x4169e1 ,
saddlebrown : 0x8b4513 ,
salmon : 0xfa8072 ,
sandybrown : 0xf4a460 ,
seagreen : 0x2e8b57 ,
seashell : 0xfff5ee ,
sienna : 0xa0522d ,
silver : 0xc0c0c0 ,
skyblue : 0x87ceeb ,
slateblue : 0x6a5acd ,
slategray : 0x708090 ,
slategrey : 0x708090 ,
snow : 0xfffafa ,
springgreen : 0x00ff7f ,
steelblue : 0x4682b4 ,
tan : 0xd2b48c ,
teal : 0x008080 ,
thistle : 0xd8bfd8 ,
tomato : 0xff6347 ,
turquoise : 0x40e0d0 ,
violet : 0xee82ee ,
wheat : 0xf5deb3 ,
white : 0xffffff ,
whitesmoke : 0xf5f5f5 ,
yellow : 0xffff00 ,
yellowgreen : 0x9acd32
} ;
define ( Color , color , {
displayable : function ( ) {
return this . rgb ( ) . displayable ( ) ;
} ,
toString : function ( ) {
return this . rgb ( ) + "" ;
}
} ) ;
function color ( format ) {
var m ;
format = ( format + "" ) . trim ( ) . toLowerCase ( ) ;
return ( m = reHex3 . exec ( format ) ) ? ( m = parseInt ( m [ 1 ] , 16 ) , new Rgb ( ( m >> 8 & 0xf ) | ( m >> 4 & 0x0f0 ) , ( m >> 4 & 0xf ) | ( m & 0xf0 ) , ( ( m & 0xf ) << 4 ) | ( m & 0xf ) , 1 ) ) // #f00
:
( m = reHex6 . exec ( format ) ) ? rgbn ( parseInt ( m [ 1 ] , 16 ) ) // #ff0000
:
( m = reRgbInteger . exec ( format ) ) ? new Rgb ( m [ 1 ] , m [ 2 ] , m [ 3 ] , 1 ) // rgb(255, 0, 0)
:
( m = reRgbPercent . exec ( format ) ) ? new Rgb ( m [ 1 ] * 255 / 100 , m [ 2 ] * 255 / 100 , m [ 3 ] * 255 / 100 , 1 ) // rgb(100%, 0%, 0%)
:
( m = reRgbaInteger . exec ( format ) ) ? rgba ( m [ 1 ] , m [ 2 ] , m [ 3 ] , m [ 4 ] ) // rgba(255, 0, 0, 1)
:
( m = reRgbaPercent . exec ( format ) ) ? rgba ( m [ 1 ] * 255 / 100 , m [ 2 ] * 255 / 100 , m [ 3 ] * 255 / 100 , m [ 4 ] ) // rgb(100%, 0%, 0%, 1)
:
( m = reHslPercent . exec ( format ) ) ? hsla ( m [ 1 ] , m [ 2 ] / 100 , m [ 3 ] / 100 , 1 ) // hsl(120, 50%, 50%)
:
( m = reHslaPercent . exec ( format ) ) ? hsla ( m [ 1 ] , m [ 2 ] / 100 , m [ 3 ] / 100 , m [ 4 ] ) // hsla(120, 50%, 50%, 1)
:
named . hasOwnProperty ( format ) ? rgbn ( named [ format ] ) :
format === "transparent" ? new Rgb ( NaN , NaN , NaN , 0 ) :
null ;
}
function rgbn ( n ) {
return new Rgb ( n >> 16 & 0xff , n >> 8 & 0xff , n & 0xff , 1 ) ;
}
function rgba ( r , g , b , a ) {
if ( a <= 0 ) r = g = b = NaN ;
return new Rgb ( r , g , b , a ) ;
}
function rgbConvert ( o ) {
if ( ! ( o instanceof Color ) ) o = color ( o ) ;
if ( ! o ) return new Rgb ;
o = o . rgb ( ) ;
return new Rgb ( o . r , o . g , o . b , o . opacity ) ;
}
function rgb ( r , g , b , opacity ) {
return arguments . length === 1 ? rgbConvert ( r ) : new Rgb ( r , g , b , opacity == null ? 1 : opacity ) ;
}
function Rgb ( r , g , b , opacity ) {
this . r = + r ;
this . g = + g ;
this . b = + b ;
this . opacity = + opacity ;
}
define ( Rgb , rgb , extend ( Color , {
brighter : function ( k ) {
k = k == null ? brighter : Math . pow ( brighter , k ) ;
return new Rgb ( this . r * k , this . g * k , this . b * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? darker : Math . pow ( darker , k ) ;
return new Rgb ( this . r * k , this . g * k , this . b * k , this . opacity ) ;
} ,
rgb : function ( ) {
return this ;
} ,
displayable : function ( ) {
return ( 0 <= this . r && this . r <= 255 ) &&
( 0 <= this . g && this . g <= 255 ) &&
( 0 <= this . b && this . b <= 255 ) &&
( 0 <= this . opacity && this . opacity <= 1 ) ;
} ,
toString : function ( ) {
var a = this . opacity ;
a = isNaN ( a ) ? 1 : Math . max ( 0 , Math . min ( 1 , a ) ) ;
return ( a === 1 ? "rgb(" : "rgba(" ) +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . r ) || 0 ) ) + ", " +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . g ) || 0 ) ) + ", " +
Math . max ( 0 , Math . min ( 255 , Math . round ( this . b ) || 0 ) ) +
( a === 1 ? ")" : ", " + a + ")" ) ;
}
} ) ) ;
function hsla ( h , s , l , a ) {
if ( a <= 0 ) h = s = l = NaN ;
else if ( l <= 0 || l >= 1 ) h = s = NaN ;
else if ( s <= 0 ) h = NaN ;
return new Hsl ( h , s , l , a ) ;
}
function hslConvert ( o ) {
if ( o instanceof Hsl ) return new Hsl ( o . h , o . s , o . l , o . opacity ) ;
if ( ! ( o instanceof Color ) ) o = color ( o ) ;
if ( ! o ) return new Hsl ;
if ( o instanceof Hsl ) return o ;
o = o . rgb ( ) ;
var r = o . r / 255 ,
g = o . g / 255 ,
b = o . b / 255 ,
min = Math . min ( r , g , b ) ,
max = Math . max ( r , g , b ) ,
h = NaN ,
s = max - min ,
l = ( max + min ) / 2 ;
if ( s ) {
if ( r === max ) h = ( g - b ) / s + ( g < b ) * 6 ;
else if ( g === max ) h = ( b - r ) / s + 2 ;
else h = ( r - g ) / s + 4 ;
s /= l < 0.5 ? max + min : 2 - max - min ;
h *= 60 ;
} else {
s = l > 0 && l < 1 ? 0 : h ;
}
return new Hsl ( h , s , l , o . opacity ) ;
}
function hsl ( h , s , l , opacity ) {
return arguments . length === 1 ? hslConvert ( h ) : new Hsl ( h , s , l , opacity == null ? 1 : opacity ) ;
}
function Hsl ( h , s , l , opacity ) {
this . h = + h ;
this . s = + s ;
this . l = + l ;
this . opacity = + opacity ;
}
define ( Hsl , hsl , extend ( Color , {
brighter : function ( k ) {
k = k == null ? brighter : Math . pow ( brighter , k ) ;
return new Hsl ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? darker : Math . pow ( darker , k ) ;
return new Hsl ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
rgb : function ( ) {
var h = this . h % 360 + ( this . h < 0 ) * 360 ,
s = isNaN ( h ) || isNaN ( this . s ) ? 0 : this . s ,
l = this . l ,
m2 = l + ( l < 0.5 ? l : 1 - l ) * s ,
m1 = 2 * l - m2 ;
return new Rgb (
hsl2rgb ( h >= 240 ? h - 240 : h + 120 , m1 , m2 ) ,
hsl2rgb ( h , m1 , m2 ) ,
hsl2rgb ( h < 120 ? h + 240 : h - 120 , m1 , m2 ) ,
this . opacity
) ;
} ,
displayable : function ( ) {
return ( 0 <= this . s && this . s <= 1 || isNaN ( this . s ) ) &&
( 0 <= this . l && this . l <= 1 ) &&
( 0 <= this . opacity && this . opacity <= 1 ) ;
}
} ) ) ;
/* From FvD 13.37, CSS Color Module Level 3 */
function hsl2rgb ( h , m1 , m2 ) {
return ( h < 60 ? m1 + ( m2 - m1 ) * h / 60 :
h < 180 ? m2 :
h < 240 ? m1 + ( m2 - m1 ) * ( 240 - h ) / 60 :
m1 ) * 255 ;
}
var deg2rad = Math . PI / 180 ;
var rad2deg = 180 / Math . PI ;
var Kn = 18 ;
var Xn = 0.950470 ;
var Yn = 1 ;
var Zn = 1.088830 ;
var t0 = 4 / 29 ;
var t1 = 6 / 29 ;
var t2 = 3 * t1 * t1 ;
var t3 = t1 * t1 * t1 ;
function labConvert ( o ) {
if ( o instanceof Lab ) return new Lab ( o . l , o . a , o . b , o . opacity ) ;
if ( o instanceof Hcl ) {
var h = o . h * deg2rad ;
return new Lab ( o . l , Math . cos ( h ) * o . c , Math . sin ( h ) * o . c , o . opacity ) ;
}
if ( ! ( o instanceof Rgb ) ) o = rgbConvert ( o ) ;
var b = rgb2xyz ( o . r ) ,
a = rgb2xyz ( o . g ) ,
l = rgb2xyz ( o . b ) ,
x = xyz2lab ( ( 0.4124564 * b + 0.3575761 * a + 0.1804375 * l ) / Xn ) ,
y = xyz2lab ( ( 0.2126729 * b + 0.7151522 * a + 0.0721750 * l ) / Yn ) ,
z = xyz2lab ( ( 0.0193339 * b + 0.1191920 * a + 0.9503041 * l ) / Zn ) ;
return new Lab ( 116 * y - 16 , 500 * ( x - y ) , 200 * ( y - z ) , o . opacity ) ;
}
function lab ( l , a , b , opacity ) {
return arguments . length === 1 ? labConvert ( l ) : new Lab ( l , a , b , opacity == null ? 1 : opacity ) ;
}
function Lab ( l , a , b , opacity ) {
this . l = + l ;
this . a = + a ;
this . b = + b ;
this . opacity = + opacity ;
}
define ( Lab , lab , extend ( Color , {
brighter : function ( k ) {
return new Lab ( this . l + Kn * ( k == null ? 1 : k ) , this . a , this . b , this . opacity ) ;
} ,
darker : function ( k ) {
return new Lab ( this . l - Kn * ( k == null ? 1 : k ) , this . a , this . b , this . opacity ) ;
} ,
rgb : function ( ) {
var y = ( this . l + 16 ) / 116 ,
x = isNaN ( this . a ) ? y : y + this . a / 500 ,
z = isNaN ( this . b ) ? y : y - this . b / 200 ;
y = Yn * lab2xyz ( y ) ;
x = Xn * lab2xyz ( x ) ;
z = Zn * lab2xyz ( z ) ;
return new Rgb (
xyz2rgb ( 3.2404542 * x - 1.5371385 * y - 0.4985314 * z ) , // D65 -> sRGB
xyz2rgb ( - 0.9692660 * x + 1.8760108 * y + 0.0415560 * z ) ,
xyz2rgb ( 0.0556434 * x - 0.2040259 * y + 1.0572252 * z ) ,
this . opacity
) ;
}
} ) ) ;
function xyz2lab ( t ) {
return t > t3 ? Math . pow ( t , 1 / 3 ) : t / t2 + t0 ;
}
function lab2xyz ( t ) {
return t > t1 ? t * t * t : t2 * ( t - t0 ) ;
}
function xyz2rgb ( x ) {
return 255 * ( x <= 0.0031308 ? 12.92 * x : 1.055 * Math . pow ( x , 1 / 2.4 ) - 0.055 ) ;
}
function rgb2xyz ( x ) {
return ( x /= 255 ) <= 0.04045 ? x / 12.92 : Math . pow ( ( x + 0.055 ) / 1.055 , 2.4 ) ;
}
function hclConvert ( o ) {
if ( o instanceof Hcl ) return new Hcl ( o . h , o . c , o . l , o . opacity ) ;
if ( ! ( o instanceof Lab ) ) o = labConvert ( o ) ;
var h = Math . atan2 ( o . b , o . a ) * rad2deg ;
return new Hcl ( h < 0 ? h + 360 : h , Math . sqrt ( o . a * o . a + o . b * o . b ) , o . l , o . opacity ) ;
}
function hcl ( h , c , l , opacity ) {
return arguments . length === 1 ? hclConvert ( h ) : new Hcl ( h , c , l , opacity == null ? 1 : opacity ) ;
}
function Hcl ( h , c , l , opacity ) {
this . h = + h ;
this . c = + c ;
this . l = + l ;
this . opacity = + opacity ;
}
define ( Hcl , hcl , extend ( Color , {
brighter : function ( k ) {
return new Hcl ( this . h , this . c , this . l + Kn * ( k == null ? 1 : k ) , this . opacity ) ;
} ,
darker : function ( k ) {
return new Hcl ( this . h , this . c , this . l - Kn * ( k == null ? 1 : k ) , this . opacity ) ;
} ,
rgb : function ( ) {
return labConvert ( this ) . rgb ( ) ;
}
} ) ) ;
var A = - 0.14861 ;
var B = + 1.78277 ;
var C = - 0.29227 ;
var D = - 0.90649 ;
var E = + 1.97294 ;
var ED = E * D ;
var EB = E * B ;
var BC _DA = B * C - D * A ;
function cubehelixConvert ( o ) {
if ( o instanceof Cubehelix ) return new Cubehelix ( o . h , o . s , o . l , o . opacity ) ;
if ( ! ( o instanceof Rgb ) ) o = rgbConvert ( o ) ;
var r = o . r / 255 ,
g = o . g / 255 ,
b = o . b / 255 ,
l = ( BC _DA * b + ED * r - EB * g ) / ( BC _DA + ED - EB ) ,
bl = b - l ,
k = ( E * ( g - l ) - C * bl ) / D ,
s = Math . sqrt ( k * k + bl * bl ) / ( E * l * ( 1 - l ) ) , // NaN if l=0 or l=1
h = s ? Math . atan2 ( k , bl ) * rad2deg - 120 : NaN ;
return new Cubehelix ( h < 0 ? h + 360 : h , s , l , o . opacity ) ;
}
function cubehelix ( h , s , l , opacity ) {
return arguments . length === 1 ? cubehelixConvert ( h ) : new Cubehelix ( h , s , l , opacity == null ? 1 : opacity ) ;
}
function Cubehelix ( h , s , l , opacity ) {
this . h = + h ;
this . s = + s ;
this . l = + l ;
this . opacity = + opacity ;
}
define ( Cubehelix , cubehelix , extend ( Color , {
brighter : function ( k ) {
k = k == null ? brighter : Math . pow ( brighter , k ) ;
return new Cubehelix ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? darker : Math . pow ( darker , k ) ;
return new Cubehelix ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
rgb : function ( ) {
var h = isNaN ( this . h ) ? 0 : ( this . h + 120 ) * deg2rad ,
l = + this . l ,
a = isNaN ( this . s ) ? 0 : this . s * l * ( 1 - l ) ,
cosh = Math . cos ( h ) ,
sinh = Math . sin ( h ) ;
return new Rgb (
255 * ( l + a * ( A * cosh + B * sinh ) ) ,
255 * ( l + a * ( C * cosh + D * sinh ) ) ,
255 * ( l + a * ( E * cosh ) ) ,
this . opacity
) ;
}
} ) ) ;
function basis ( t1 , v0 , v1 , v2 , v3 ) {
var t2 = t1 * t1 ,
t3 = t2 * t1 ;
return ( ( 1 - 3 * t1 + 3 * t2 - t3 ) * v0 +
( 4 - 6 * t2 + 3 * t3 ) * v1 +
( 1 + 3 * t1 + 3 * t2 - 3 * t3 ) * v2 +
t3 * v3 ) / 6 ;
}
var basis$1 = function ( values ) {
var n = values . length - 1 ;
return function ( t ) {
var i = t <= 0 ? ( t = 0 ) : t >= 1 ? ( t = 1 , n - 1 ) : Math . floor ( t * n ) ,
v1 = values [ i ] ,
v2 = values [ i + 1 ] ,
v0 = i > 0 ? values [ i - 1 ] : 2 * v1 - v2 ,
v3 = i < n - 1 ? values [ i + 2 ] : 2 * v2 - v1 ;
return basis ( ( t - i / n ) * n , v0 , v1 , v2 , v3 ) ;
} ;
} ;
var basisClosed = function ( values ) {
var n = values . length ;
return function ( t ) {
var i = Math . floor ( ( ( t %= 1 ) < 0 ? ++ t : t ) * n ) ,
v0 = values [ ( i + n - 1 ) % n ] ,
v1 = values [ i % n ] ,
v2 = values [ ( i + 1 ) % n ] ,
v3 = values [ ( i + 2 ) % n ] ;
return basis ( ( t - i / n ) * n , v0 , v1 , v2 , v3 ) ;
} ;
} ;
var constant$3 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
function linear ( a , d ) {
return function ( t ) {
return a + t * d ;
} ;
}
function exponential ( a , b , y ) {
return a = Math . pow ( a , y ) , b = Math . pow ( b , y ) - a , y = 1 / y ,
function ( t ) {
return Math . pow ( a + t * b , y ) ;
} ;
}
function hue ( a , b ) {
var d = b - a ;
return d ? linear ( a , d > 180 || d < - 180 ? d - 360 * Math . round ( d / 360 ) : d ) : constant$3 ( isNaN ( a ) ? b : a ) ;
}
function gamma ( y ) {
return ( y = + y ) === 1 ? nogamma : function ( a , b ) {
return b - a ? exponential ( a , b , y ) : constant$3 ( isNaN ( a ) ? b : a ) ;
} ;
}
function nogamma ( a , b ) {
var d = b - a ;
return d ? linear ( a , d ) : constant$3 ( isNaN ( a ) ? b : a ) ;
}
var interpolateRgb = ( ( function rgbGamma ( y ) {
var color$$1 = gamma ( y ) ;
function rgb$$1 ( start , end ) {
var r = color$$1 ( ( start = rgb ( start ) ) . r , ( end = rgb ( end ) ) . r ) ,
g = color$$1 ( start . g , end . g ) ,
b = color$$1 ( start . b , end . b ) ,
opacity = nogamma ( start . opacity , end . opacity ) ;
return function ( t ) {
start . r = r ( t ) ;
start . g = g ( t ) ;
start . b = b ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
rgb$$1 . gamma = rgbGamma ;
return rgb$$1 ;
} ) ) ( 1 ) ;
function rgbSpline ( spline ) {
return function ( colors ) {
var n = colors . length ,
r = new Array ( n ) ,
g = new Array ( n ) ,
b = new Array ( n ) ,
i , color$$1 ;
for ( i = 0 ; i < n ; ++ i ) {
color$$1 = rgb ( colors [ i ] ) ;
r [ i ] = color$$1 . r || 0 ;
g [ i ] = color$$1 . g || 0 ;
b [ i ] = color$$1 . b || 0 ;
}
r = spline ( r ) ;
g = spline ( g ) ;
b = spline ( b ) ;
color$$1 . opacity = 1 ;
return function ( t ) {
color$$1 . r = r ( t ) ;
color$$1 . g = g ( t ) ;
color$$1 . b = b ( t ) ;
return color$$1 + "" ;
} ;
} ;
}
var rgbBasis = rgbSpline ( basis$1 ) ;
var rgbBasisClosed = rgbSpline ( basisClosed ) ;
var array$1 = function ( a , b ) {
var nb = b ? b . length : 0 ,
na = a ? Math . min ( nb , a . length ) : 0 ,
x = new Array ( nb ) ,
c = new Array ( nb ) ,
i ;
for ( i = 0 ; i < na ; ++ i ) x [ i ] = interpolateValue ( a [ i ] , b [ i ] ) ;
for ( ; i < nb ; ++ i ) c [ i ] = b [ i ] ;
return function ( t ) {
for ( i = 0 ; i < na ; ++ i ) c [ i ] = x [ i ] ( t ) ;
return c ;
} ;
} ;
var date = function ( a , b ) {
var d = new Date ;
return a = + a , b -= a ,
function ( t ) {
return d . setTime ( a + b * t ) , d ;
} ;
} ;
var reinterpolate = function ( a , b ) {
return a = + a , b -= a ,
function ( t ) {
return a + b * t ;
} ;
} ;
var object = function ( a , b ) {
var i = { } ,
c = { } ,
k ;
if ( a === null || typeof a !== "object" ) a = { } ;
if ( b === null || typeof b !== "object" ) b = { } ;
for ( k in b ) {
if ( k in a ) {
i [ k ] = interpolateValue ( a [ k ] , b [ k ] ) ;
} else {
c [ k ] = b [ k ] ;
}
}
return function ( t ) {
for ( k in i ) c [ k ] = i [ k ] ( t ) ;
return c ;
} ;
} ;
var reA = /[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g ;
var reB = new RegExp ( reA . source , "g" ) ;
function zero ( b ) {
return function ( ) {
return b ;
} ;
}
function one ( b ) {
return function ( t ) {
return b ( t ) + "" ;
} ;
}
var interpolateString = function ( a , b ) {
var bi = reA . lastIndex = reB . lastIndex = 0 , // scan index for next number in b
am , // current match in a
bm , // current match in b
bs , // string preceding current number in b, if any
i = - 1 , // index in s
s = [ ] , // string constants and placeholders
q = [ ] ; // number interpolators
// Coerce inputs to strings.
a = a + "" , b = b + "" ;
// Interpolate pairs of numbers in a & b.
while ( ( am = reA . exec ( a ) ) &&
( bm = reB . exec ( b ) ) ) {
if ( ( bs = bm . index ) > bi ) { // a string precedes the next number in b
bs = b . slice ( bi , bs ) ;
if ( s [ i ] ) s [ i ] += bs ; // coalesce with previous string
else s [ ++ i ] = bs ;
}
if ( ( am = am [ 0 ] ) === ( bm = bm [ 0 ] ) ) { // numbers in a & b match
if ( s [ i ] ) s [ i ] += bm ; // coalesce with previous string
else s [ ++ i ] = bm ;
} else { // interpolate non-matching numbers
s [ ++ i ] = null ;
q . push ( { i : i , x : reinterpolate ( am , bm ) } ) ;
}
bi = reB . lastIndex ;
}
// Add remains of b.
if ( bi < b . length ) {
bs = b . slice ( bi ) ;
if ( s [ i ] ) s [ i ] += bs ; // coalesce with previous string
else s [ ++ i ] = bs ;
}
// Special optimization for only a single match.
// Otherwise, interpolate each of the numbers and rejoin the string.
return s . length < 2 ? ( q [ 0 ] ?
one ( q [ 0 ] . x ) :
zero ( b ) ) :
( b = q . length , function ( t ) {
for ( var i = 0 , o ; i < b ; ++ i ) s [ ( o = q [ i ] ) . i ] = o . x ( t ) ;
return s . join ( "" ) ;
} ) ;
} ;
var interpolateValue = function ( a , b ) {
var t = typeof b ,
c ;
return b == null || t === "boolean" ? constant$3 ( b ) :
( t === "number" ? reinterpolate :
t === "string" ? ( ( c = color ( b ) ) ? ( b = c , interpolateRgb ) : interpolateString ) :
b instanceof color ? interpolateRgb :
b instanceof Date ? date :
Array . isArray ( b ) ? array$1 :
isNaN ( b ) ? object :
reinterpolate ) ( a , b ) ;
} ;
var interpolateRound = function ( a , b ) {
return a = + a , b -= a ,
function ( t ) {
return Math . round ( a + b * t ) ;
} ;
} ;
var degrees = 180 / Math . PI ;
var identity$2 = {
translateX : 0 ,
translateY : 0 ,
rotate : 0 ,
skewX : 0 ,
scaleX : 1 ,
scaleY : 1
} ;
var decompose = function ( a , b , c , d , e , f ) {
var scaleX , scaleY , skewX ;
if ( scaleX = Math . sqrt ( a * a + b * b ) ) a /= scaleX , b /= scaleX ;
if ( skewX = a * c + b * d ) c -= a * skewX , d -= b * skewX ;
if ( scaleY = Math . sqrt ( c * c + d * d ) ) c /= scaleY , d /= scaleY , skewX /= scaleY ;
if ( a * d < b * c ) a = - a , b = - b , skewX = - skewX , scaleX = - scaleX ;
return {
translateX : e ,
translateY : f ,
rotate : Math . atan2 ( b , a ) * degrees ,
skewX : Math . atan ( skewX ) * degrees ,
scaleX : scaleX ,
scaleY : scaleY
} ;
} ;
var cssNode ;
var cssRoot ;
var cssView ;
var svgNode ;
function parseCss ( value ) {
if ( value === "none" ) return identity$2 ;
if ( ! cssNode ) cssNode = document . createElement ( "DIV" ) , cssRoot = document . documentElement , cssView = document . defaultView ;
cssNode . style . transform = value ;
value = cssView . getComputedStyle ( cssRoot . appendChild ( cssNode ) , null ) . getPropertyValue ( "transform" ) ;
cssRoot . removeChild ( cssNode ) ;
value = value . slice ( 7 , - 1 ) . split ( "," ) ;
return decompose ( + value [ 0 ] , + value [ 1 ] , + value [ 2 ] , + value [ 3 ] , + value [ 4 ] , + value [ 5 ] ) ;
}
function parseSvg ( value ) {
if ( value == null ) return identity$2 ;
if ( ! svgNode ) svgNode = document . createElementNS ( "http://www.w3.org/2000/svg" , "g" ) ;
svgNode . setAttribute ( "transform" , value ) ;
if ( ! ( value = svgNode . transform . baseVal . consolidate ( ) ) ) return identity$2 ;
value = value . matrix ;
return decompose ( value . a , value . b , value . c , value . d , value . e , value . f ) ;
}
function interpolateTransform ( parse , pxComma , pxParen , degParen ) {
function pop ( s ) {
return s . length ? s . pop ( ) + " " : "" ;
}
function translate ( xa , ya , xb , yb , s , q ) {
if ( xa !== xb || ya !== yb ) {
var i = s . push ( "translate(" , null , pxComma , null , pxParen ) ;
q . push ( { i : i - 4 , x : reinterpolate ( xa , xb ) } , { i : i - 2 , x : reinterpolate ( ya , yb ) } ) ;
} else if ( xb || yb ) {
s . push ( "translate(" + xb + pxComma + yb + pxParen ) ;
}
}
function rotate ( a , b , s , q ) {
if ( a !== b ) {
if ( a - b > 180 ) b += 360 ;
else if ( b - a > 180 ) a += 360 ; // shortest path
q . push ( { i : s . push ( pop ( s ) + "rotate(" , null , degParen ) - 2 , x : reinterpolate ( a , b ) } ) ;
} else if ( b ) {
s . push ( pop ( s ) + "rotate(" + b + degParen ) ;
}
}
function skewX ( a , b , s , q ) {
if ( a !== b ) {
q . push ( { i : s . push ( pop ( s ) + "skewX(" , null , degParen ) - 2 , x : reinterpolate ( a , b ) } ) ;
} else if ( b ) {
s . push ( pop ( s ) + "skewX(" + b + degParen ) ;
}
}
function scale ( xa , ya , xb , yb , s , q ) {
if ( xa !== xb || ya !== yb ) {
var i = s . push ( pop ( s ) + "scale(" , null , "," , null , ")" ) ;
q . push ( { i : i - 4 , x : reinterpolate ( xa , xb ) } , { i : i - 2 , x : reinterpolate ( ya , yb ) } ) ;
} else if ( xb !== 1 || yb !== 1 ) {
s . push ( pop ( s ) + "scale(" + xb + "," + yb + ")" ) ;
}
}
return function ( a , b ) {
var s = [ ] , // string constants and placeholders
q = [ ] ; // number interpolators
a = parse ( a ) , b = parse ( b ) ;
translate ( a . translateX , a . translateY , b . translateX , b . translateY , s , q ) ;
rotate ( a . rotate , b . rotate , s , q ) ;
skewX ( a . skewX , b . skewX , s , q ) ;
scale ( a . scaleX , a . scaleY , b . scaleX , b . scaleY , s , q ) ;
a = b = null ; // gc
return function ( t ) {
var i = - 1 ,
n = q . length ,
o ;
while ( ++ i < n ) s [ ( o = q [ i ] ) . i ] = o . x ( t ) ;
return s . join ( "" ) ;
} ;
} ;
}
var interpolateTransformCss = interpolateTransform ( parseCss , "px, " , "px)" , "deg)" ) ;
var interpolateTransformSvg = interpolateTransform ( parseSvg , ", " , ")" , ")" ) ;
var rho = Math . SQRT2 ;
var rho2 = 2 ;
var rho4 = 4 ;
var epsilon2 = 1e-12 ;
function cosh ( x ) {
return ( ( x = Math . exp ( x ) ) + 1 / x ) / 2 ;
}
function sinh ( x ) {
return ( ( x = Math . exp ( x ) ) - 1 / x ) / 2 ;
}
function tanh ( x ) {
return ( ( x = Math . exp ( 2 * x ) ) - 1 ) / ( x + 1 ) ;
}
// p0 = [ux0, uy0, w0]
// p1 = [ux1, uy1, w1]
var interpolateZoom = function ( p0 , p1 ) {
var ux0 = p0 [ 0 ] ,
uy0 = p0 [ 1 ] ,
w0 = p0 [ 2 ] ,
ux1 = p1 [ 0 ] ,
uy1 = p1 [ 1 ] ,
w1 = p1 [ 2 ] ,
dx = ux1 - ux0 ,
dy = uy1 - uy0 ,
d2 = dx * dx + dy * dy ,
i ,
S ;
// Special case for u0 ≅ u1.
if ( d2 < epsilon2 ) {
S = Math . log ( w1 / w0 ) / rho ;
i = function ( t ) {
return [
ux0 + t * dx ,
uy0 + t * dy ,
w0 * Math . exp ( rho * t * S )
] ;
} ;
}
// General case.
else {
var d1 = Math . sqrt ( d2 ) ,
b0 = ( w1 * w1 - w0 * w0 + rho4 * d2 ) / ( 2 * w0 * rho2 * d1 ) ,
b1 = ( w1 * w1 - w0 * w0 - rho4 * d2 ) / ( 2 * w1 * rho2 * d1 ) ,
r0 = Math . log ( Math . sqrt ( b0 * b0 + 1 ) - b0 ) ,
r1 = Math . log ( Math . sqrt ( b1 * b1 + 1 ) - b1 ) ;
S = ( r1 - r0 ) / rho ;
i = function ( t ) {
var s = t * S ,
coshr0 = cosh ( r0 ) ,
u = w0 / ( rho2 * d1 ) * ( coshr0 * tanh ( rho * s + r0 ) - sinh ( r0 ) ) ;
return [
ux0 + u * dx ,
uy0 + u * dy ,
w0 * coshr0 / cosh ( rho * s + r0 )
] ;
} ;
}
i . duration = S * 1000 ;
return i ;
} ;
function hsl$1 ( hue$$1 ) {
return function ( start , end ) {
var h = hue$$1 ( ( start = hsl ( start ) ) . h , ( end = hsl ( end ) ) . h ) ,
s = nogamma ( start . s , end . s ) ,
l = nogamma ( start . l , end . l ) ,
opacity = nogamma ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . s = s ( t ) ;
start . l = l ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
}
var hsl$2 = hsl$1 ( hue ) ;
var hslLong = hsl$1 ( nogamma ) ;
function lab$1 ( start , end ) {
var l = nogamma ( ( start = lab ( start ) ) . l , ( end = lab ( end ) ) . l ) ,
a = nogamma ( start . a , end . a ) ,
b = nogamma ( start . b , end . b ) ,
opacity = nogamma ( start . opacity , end . opacity ) ;
return function ( t ) {
start . l = l ( t ) ;
start . a = a ( t ) ;
start . b = b ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
function hcl$1 ( hue$$1 ) {
return function ( start , end ) {
var h = hue$$1 ( ( start = hcl ( start ) ) . h , ( end = hcl ( end ) ) . h ) ,
c = nogamma ( start . c , end . c ) ,
l = nogamma ( start . l , end . l ) ,
opacity = nogamma ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . c = c ( t ) ;
start . l = l ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
}
var hcl$2 = hcl$1 ( hue ) ;
var hclLong = hcl$1 ( nogamma ) ;
function cubehelix$1 ( hue$$1 ) {
return ( function cubehelixGamma ( y ) {
y = + y ;
function cubehelix$$1 ( start , end ) {
var h = hue$$1 ( ( start = cubehelix ( start ) ) . h , ( end = cubehelix ( end ) ) . h ) ,
s = nogamma ( start . s , end . s ) ,
l = nogamma ( start . l , end . l ) ,
opacity = nogamma ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . s = s ( t ) ;
start . l = l ( Math . pow ( t , y ) ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
cubehelix$$1 . gamma = cubehelixGamma ;
return cubehelix$$1 ;
} ) ( 1 ) ;
}
var cubehelix$2 = cubehelix$1 ( hue ) ;
var cubehelixLong = cubehelix$1 ( nogamma ) ;
var quantize = function ( interpolator , n ) {
var samples = new Array ( n ) ;
for ( var i = 0 ; i < n ; ++ i ) samples [ i ] = interpolator ( i / ( n - 1 ) ) ;
return samples ;
} ;
var frame = 0 ;
var timeout = 0 ;
var interval = 0 ;
var pokeDelay = 1000 ;
var taskHead ;
var taskTail ;
var clockLast = 0 ;
var clockNow = 0 ;
var clockSkew = 0 ;
var clock = typeof performance === "object" && performance . now ? performance : Date ;
var setFrame = typeof requestAnimationFrame === "function" ? requestAnimationFrame : function ( f ) { setTimeout ( f , 17 ) ; } ;
function now ( ) {
return clockNow || ( setFrame ( clearNow ) , clockNow = clock . now ( ) + clockSkew ) ;
}
function clearNow ( ) {
clockNow = 0 ;
}
function Timer ( ) {
this . _call =
this . _time =
this . _next = null ;
}
Timer . prototype = timer . prototype = {
constructor : Timer ,
restart : function ( callback , delay , time ) {
if ( typeof callback !== "function" ) throw new TypeError ( "callback is not a function" ) ;
time = ( time == null ? now ( ) : + time ) + ( delay == null ? 0 : + delay ) ;
if ( ! this . _next && taskTail !== this ) {
if ( taskTail ) taskTail . _next = this ;
else taskHead = this ;
taskTail = this ;
}
this . _call = callback ;
this . _time = time ;
sleep ( ) ;
} ,
stop : function ( ) {
if ( this . _call ) {
this . _call = null ;
this . _time = Infinity ;
sleep ( ) ;
}
}
} ;
function timer ( callback , delay , time ) {
var t = new Timer ;
t . restart ( callback , delay , time ) ;
return t ;
}
function timerFlush ( ) {
now ( ) ; // Get the current time, if not already set.
++ frame ; // Pretend we’ ’
var t = taskHead ,
e ;
while ( t ) {
if ( ( e = clockNow - t . _time ) >= 0 ) t . _call . call ( null , e ) ;
t = t . _next ;
}
-- frame ;
}
function wake ( ) {
clockNow = ( clockLast = clock . now ( ) ) + clockSkew ;
frame = timeout = 0 ;
try {
timerFlush ( ) ;
} finally {
frame = 0 ;
nap ( ) ;
clockNow = 0 ;
}
}
function poke ( ) {
var now = clock . now ( ) ,
delay = now - clockLast ;
if ( delay > pokeDelay ) clockSkew -= delay , clockLast = now ;
}
function nap ( ) {
var t0 , t1 = taskHead ,
t2 , time = Infinity ;
while ( t1 ) {
if ( t1 . _call ) {
if ( time > t1 . _time ) time = t1 . _time ;
t0 = t1 , t1 = t1 . _next ;
} else {
t2 = t1 . _next , t1 . _next = null ;
t1 = t0 ? t0 . _next = t2 : taskHead = t2 ;
}
}
taskTail = t0 ;
sleep ( time ) ;
}
function sleep ( time ) {
if ( frame ) return ; // Soonest alarm already set, or will be.
if ( timeout ) timeout = clearTimeout ( timeout ) ;
var delay = time - clockNow ;
if ( delay > 24 ) {
if ( time < Infinity ) timeout = setTimeout ( wake , delay ) ;
if ( interval ) interval = clearInterval ( interval ) ;
} else {
if ( ! interval ) clockLast = clockNow , interval = setInterval ( poke , pokeDelay ) ;
frame = 1 , setFrame ( wake ) ;
}
}
var timeout$1 = function ( callback , delay , time ) {
var t = new Timer ;
delay = delay == null ? 0 : + delay ;
t . restart ( function ( elapsed ) {
t . stop ( ) ;
callback ( elapsed + delay ) ;
} , delay , time ) ;
return t ;
} ;
var interval$1 = function ( callback , delay , time ) {
var t = new Timer ,
total = delay ;
if ( delay == null ) return t . restart ( callback , delay , time ) , t ;
delay = + delay , time = time == null ? now ( ) : + time ;
t . restart ( function tick ( elapsed ) {
elapsed += total ;
t . restart ( tick , total += delay , time ) ;
callback ( elapsed ) ;
} , delay , time ) ;
return t ;
} ;
var emptyOn = dispatch ( "start" , "end" , "interrupt" ) ;
var emptyTween = [ ] ;
var CREATED = 0 ;
var SCHEDULED = 1 ;
var STARTING = 2 ;
var STARTED = 3 ;
var RUNNING = 4 ;
var ENDING = 5 ;
var ENDED = 6 ;
var schedule = function ( node , name , id , index , group , timing ) {
var schedules = node . _ _transition ;
if ( ! schedules ) node . _ _transition = { } ;
else if ( id in schedules ) return ;
create ( node , id , {
name : name ,
index : index , // For context during callback.
group : group , // For context during callback.
on : emptyOn ,
tween : emptyTween ,
time : timing . time ,
delay : timing . delay ,
duration : timing . duration ,
ease : timing . ease ,
timer : null ,
state : CREATED
} ) ;
} ;
function init ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) || schedule . state > CREATED ) throw new Error ( "too late" ) ;
return schedule ;
}
function set$1 ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) || schedule . state > STARTING ) throw new Error ( "too late" ) ;
return schedule ;
}
function get$1 ( node , id ) {
var schedule = node . _ _transition ;
if ( ! schedule || ! ( schedule = schedule [ id ] ) ) throw new Error ( "too late" ) ;
return schedule ;
}
function create ( node , id , self ) {
var schedules = node . _ _transition ,
tween ;
// Initialize the self timer when the transition is created.
// Note the actual delay is not known until the first callback!
schedules [ id ] = self ;
self . timer = timer ( schedule , 0 , self . time ) ;
function schedule ( elapsed ) {
self . state = SCHEDULED ;
self . timer . restart ( start , self . delay , self . time ) ;
// If the elapsed delay is less than our first sleep, start immediately.
if ( self . delay <= elapsed ) start ( elapsed - self . delay ) ;
}
function start ( elapsed ) {
var i , j , n , o ;
// If the state is not SCHEDULED, then we previously errored on start.
if ( self . state !== SCHEDULED ) return stop ( ) ;
for ( i in schedules ) {
o = schedules [ i ] ;
if ( o . name !== self . name ) continue ;
// While this element already has a starting transition during this frame,
// defer starting an interrupting transition until that transition has a
// chance to tick (and possibly end); see d3/d3-transition#54!
if ( o . state === STARTED ) return timeout$1 ( start ) ;
// Interrupt the active transition, if any.
// Dispatch the interrupt event.
if ( o . state === RUNNING ) {
o . state = ENDED ;
o . timer . stop ( ) ;
o . on . call ( "interrupt" , node , node . _ _data _ _ , o . index , o . group ) ;
delete schedules [ i ] ;
}
// Cancel any pre-empted transitions. No interrupt event is dispatched
// because the cancelled transitions never started. Note that this also
// removes this transition from the pending list!
else if ( + i < id ) {
o . state = ENDED ;
o . timer . stop ( ) ;
delete schedules [ i ] ;
}
}
// Defer the first tick to end of the current frame; see d3/d3#1576.
// Note the transition may be canceled after start and before the first tick!
// Note this must be scheduled before the start event; see d3/d3-transition#16!
// Assuming this is successful, subsequent callbacks go straight to tick.
timeout$1 ( function ( ) {
if ( self . state === STARTED ) {
self . state = RUNNING ;
self . timer . restart ( tick , self . delay , self . time ) ;
tick ( elapsed ) ;
}
} ) ;
// Dispatch the start event.
// Note this must be done before the tween are initialized.
self . state = STARTING ;
self . on . call ( "start" , node , node . _ _data _ _ , self . index , self . group ) ;
if ( self . state !== STARTING ) return ; // interrupted
self . state = STARTED ;
// Initialize the tween, deleting null tween.
tween = new Array ( n = self . tween . length ) ;
for ( i = 0 , j = - 1 ; i < n ; ++ i ) {
if ( o = self . tween [ i ] . value . call ( node , node . _ _data _ _ , self . index , self . group ) ) {
tween [ ++ j ] = o ;
}
}
tween . length = j + 1 ;
}
function tick ( elapsed ) {
var t = elapsed < self . duration ? self . ease . call ( null , elapsed / self . duration ) : ( self . timer . restart ( stop ) , self . state = ENDING , 1 ) ,
i = - 1 ,
n = tween . length ;
while ( ++ i < n ) {
tween [ i ] . call ( null , t ) ;
}
// Dispatch the end event.
if ( self . state === ENDING ) {
self . on . call ( "end" , node , node . _ _data _ _ , self . index , self . group ) ;
stop ( ) ;
}
}
function stop ( ) {
self . state = ENDED ;
self . timer . stop ( ) ;
delete schedules [ id ] ;
for ( var i in schedules ) return ; // eslint-disable-line no-unused-vars
delete node . _ _transition ;
}
}
var interrupt = function ( node , name ) {
var schedules = node . _ _transition ,
schedule ,
active ,
empty = true ,
i ;
if ( ! schedules ) return ;
name = name == null ? null : name + "" ;
for ( i in schedules ) {
if ( ( schedule = schedules [ i ] ) . name !== name ) { empty = false ; continue ; }
active = schedule . state > STARTING && schedule . state < ENDING ;
schedule . state = ENDED ;
schedule . timer . stop ( ) ;
if ( active ) schedule . on . call ( "interrupt" , node , node . _ _data _ _ , schedule . index , schedule . group ) ;
delete schedules [ i ] ;
}
if ( empty ) delete node . _ _transition ;
} ;
var selection _interrupt = function ( name ) {
return this . each ( function ( ) {
interrupt ( this , name ) ;
} ) ;
} ;
function tweenRemove ( id , name ) {
var tween0 , tween1 ;
return function ( ) {
var schedule = set$1 ( this , id ) ,
tween = schedule . tween ;
// If this node shared tween with the previous node,
// just assign the updated shared tween and we’
// Otherwise, copy-on-write.
if ( tween !== tween0 ) {
tween1 = tween0 = tween ;
for ( var i = 0 , n = tween1 . length ; i < n ; ++ i ) {
if ( tween1 [ i ] . name === name ) {
tween1 = tween1 . slice ( ) ;
tween1 . splice ( i , 1 ) ;
break ;
}
}
}
schedule . tween = tween1 ;
} ;
}
function tweenFunction ( id , name , value ) {
var tween0 , tween1 ;
if ( typeof value !== "function" ) throw new Error ;
return function ( ) {
var schedule = set$1 ( this , id ) ,
tween = schedule . tween ;
// If this node shared tween with the previous node,
// just assign the updated shared tween and we’
// Otherwise, copy-on-write.
if ( tween !== tween0 ) {
tween1 = ( tween0 = tween ) . slice ( ) ;
for ( var t = { name : name , value : value } , i = 0 , n = tween1 . length ; i < n ; ++ i ) {
if ( tween1 [ i ] . name === name ) {
tween1 [ i ] = t ;
break ;
}
}
if ( i === n ) tween1 . push ( t ) ;
}
schedule . tween = tween1 ;
} ;
}
var transition _tween = function ( name , value ) {
var id = this . _id ;
name += "" ;
if ( arguments . length < 2 ) {
var tween = get$1 ( this . node ( ) , id ) . tween ;
for ( var i = 0 , n = tween . length , t ; i < n ; ++ i ) {
if ( ( t = tween [ i ] ) . name === name ) {
return t . value ;
}
}
return null ;
}
return this . each ( ( value == null ? tweenRemove : tweenFunction ) ( id , name , value ) ) ;
} ;
function tweenValue ( transition , name , value ) {
var id = transition . _id ;
transition . each ( function ( ) {
var schedule = set$1 ( this , id ) ;
( schedule . value || ( schedule . value = { } ) ) [ name ] = value . apply ( this , arguments ) ;
} ) ;
return function ( node ) {
return get$1 ( node , id ) . value [ name ] ;
} ;
}
var interpolate$$1 = function ( a , b ) {
var c ;
return ( typeof b === "number" ? reinterpolate :
b instanceof color ? interpolateRgb :
( c = color ( b ) ) ? ( b = c , interpolateRgb ) :
interpolateString ) ( a , b ) ;
} ;
function attrRemove$1 ( name ) {
return function ( ) {
this . removeAttribute ( name ) ;
} ;
}
function attrRemoveNS$1 ( fullname ) {
return function ( ) {
this . removeAttributeNS ( fullname . space , fullname . local ) ;
} ;
}
function attrConstant$1 ( name , interpolate$$1 , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = this . getAttribute ( name ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate$$1 ( value00 = value0 , value1 ) ;
} ;
}
function attrConstantNS$1 ( fullname , interpolate$$1 , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = this . getAttributeNS ( fullname . space , fullname . local ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate$$1 ( value00 = value0 , value1 ) ;
} ;
}
function attrFunction$1 ( name , interpolate$$1 , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var value0 , value1 = value ( this ) ;
if ( value1 == null ) return void this . removeAttribute ( name ) ;
value0 = this . getAttribute ( name ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate$$1 ( value00 = value0 , value10 = value1 ) ;
} ;
}
function attrFunctionNS$1 ( fullname , interpolate$$1 , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var value0 , value1 = value ( this ) ;
if ( value1 == null ) return void this . removeAttributeNS ( fullname . space , fullname . local ) ;
value0 = this . getAttributeNS ( fullname . space , fullname . local ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate$$1 ( value00 = value0 , value10 = value1 ) ;
} ;
}
var transition _attr = function ( name , value ) {
var fullname = namespace ( name ) ,
i = fullname === "transform" ? interpolateTransformSvg : interpolate$$1 ;
return this . attrTween ( name , typeof value === "function" ?
( fullname . local ? attrFunctionNS$1 : attrFunction$1 ) ( fullname , i , tweenValue ( this , "attr." + name , value ) ) :
value == null ? ( fullname . local ? attrRemoveNS$1 : attrRemove$1 ) ( fullname ) :
( fullname . local ? attrConstantNS$1 : attrConstant$1 ) ( fullname , i , value ) ) ;
} ;
function attrTweenNS ( fullname , value ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . setAttributeNS ( fullname . space , fullname . local , i ( t ) ) ;
} ;
}
tween . _value = value ;
return tween ;
}
function attrTween ( name , value ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . setAttribute ( name , i ( t ) ) ;
} ;
}
tween . _value = value ;
return tween ;
}
var transition _attrTween = function ( name , value ) {
var key = "attr." + name ;
if ( arguments . length < 2 ) return ( key = this . tween ( key ) ) && key . _value ;
if ( value == null ) return this . tween ( key , null ) ;
if ( typeof value !== "function" ) throw new Error ;
var fullname = namespace ( name ) ;
return this . tween ( key , ( fullname . local ? attrTweenNS : attrTween ) ( fullname , value ) ) ;
} ;
function delayFunction ( id , value ) {
return function ( ) {
init ( this , id ) . delay = + value . apply ( this , arguments ) ;
} ;
}
function delayConstant ( id , value ) {
return value = + value ,
function ( ) {
init ( this , id ) . delay = value ;
} ;
}
var transition _delay = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( ( typeof value === "function" ?
delayFunction :
delayConstant ) ( id , value ) ) :
get$1 ( this . node ( ) , id ) . delay ;
} ;
function durationFunction ( id , value ) {
return function ( ) {
set$1 ( this , id ) . duration = + value . apply ( this , arguments ) ;
} ;
}
function durationConstant ( id , value ) {
return value = + value ,
function ( ) {
set$1 ( this , id ) . duration = value ;
} ;
}
var transition _duration = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( ( typeof value === "function" ?
durationFunction :
durationConstant ) ( id , value ) ) :
get$1 ( this . node ( ) , id ) . duration ;
} ;
function easeConstant ( id , value ) {
if ( typeof value !== "function" ) throw new Error ;
return function ( ) {
set$1 ( this , id ) . ease = value ;
} ;
}
var transition _ease = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( easeConstant ( id , value ) ) :
get$1 ( this . node ( ) , id ) . ease ;
} ;
var transition _filter = function ( match ) {
if ( typeof match !== "function" ) match = matcher$1 ( match ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = [ ] , node , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && match . call ( node , node . _ _data _ _ , i , group ) ) {
subgroup . push ( node ) ;
}
}
}
return new Transition ( subgroups , this . _parents , this . _name , this . _id ) ;
} ;
var transition _merge = function ( transition ) {
if ( transition . _id !== this . _id ) throw new Error ;
for ( var groups0 = this . _groups , groups1 = transition . _groups , m0 = groups0 . length , m1 = groups1 . length , m = Math . min ( m0 , m1 ) , merges = new Array ( m0 ) , j = 0 ; j < m ; ++ j ) {
for ( var group0 = groups0 [ j ] , group1 = groups1 [ j ] , n = group0 . length , merge = merges [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group0 [ i ] || group1 [ i ] ) {
merge [ i ] = node ;
}
}
}
for ( ; j < m0 ; ++ j ) {
merges [ j ] = groups0 [ j ] ;
}
return new Transition ( merges , this . _parents , this . _name , this . _id ) ;
} ;
function start ( name ) {
return ( name + "" ) . trim ( ) . split ( /^|\s+/ ) . every ( function ( t ) {
var i = t . indexOf ( "." ) ;
if ( i >= 0 ) t = t . slice ( 0 , i ) ;
return ! t || t === "start" ;
} ) ;
}
function onFunction ( id , name , listener ) {
var on0 , on1 , sit = start ( name ) ? init : set$1 ;
return function ( ) {
var schedule = sit ( this , id ) ,
on = schedule . on ;
// If this node shared a dispatch with the previous node,
// just assign the updated shared dispatch and we’
// Otherwise, copy-on-write.
if ( on !== on0 ) ( on1 = ( on0 = on ) . copy ( ) ) . on ( name , listener ) ;
schedule . on = on1 ;
} ;
}
var transition _on = function ( name , listener ) {
var id = this . _id ;
return arguments . length < 2 ?
get$1 ( this . node ( ) , id ) . on . on ( name ) :
this . each ( onFunction ( id , name , listener ) ) ;
} ;
function removeFunction ( id ) {
return function ( ) {
var parent = this . parentNode ;
for ( var i in this . _ _transition )
if ( + i !== id ) return ;
if ( parent ) parent . removeChild ( this ) ;
} ;
}
var transition _remove = function ( ) {
return this . on ( "end.remove" , removeFunction ( this . _id ) ) ;
} ;
var transition _select = function ( select$$1 ) {
var name = this . _name ,
id = this . _id ;
if ( typeof select$$1 !== "function" ) select$$1 = selector ( select$$1 ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = new Array ( n ) , node , subnode , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && ( subnode = select$$1 . call ( node , node . _ _data _ _ , i , group ) ) ) {
if ( "__data__" in node ) subnode . _ _data _ _ = node . _ _data _ _ ;
subgroup [ i ] = subnode ;
schedule ( subgroup [ i ] , name , id , i , subgroup , get$1 ( node , id ) ) ;
}
}
}
return new Transition ( subgroups , this . _parents , name , id ) ;
} ;
var transition _selectAll = function ( select$$1 ) {
var name = this . _name ,
id = this . _id ;
if ( typeof select$$1 !== "function" ) select$$1 = selectorAll ( select$$1 ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = [ ] , parents = [ ] , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
for ( var children = select$$1 . call ( node , node . _ _data _ _ , i , group ) , child , inherit = get$1 ( node , id ) , k = 0 , l = children . length ; k < l ; ++ k ) {
if ( child = children [ k ] ) {
schedule ( child , name , id , k , children , inherit ) ;
}
}
subgroups . push ( children ) ;
parents . push ( node ) ;
}
}
}
return new Transition ( subgroups , parents , name , id ) ;
} ;
var Selection$1 = selection . prototype . constructor ;
var transition _selection = function ( ) {
return new Selection$1 ( this . _groups , this . _parents ) ;
} ;
function styleRemove$1 ( name , interpolate$$2 ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var style = window ( this ) . getComputedStyle ( this , null ) ,
value0 = style . getPropertyValue ( name ) ,
value1 = ( this . style . removeProperty ( name ) , style . getPropertyValue ( name ) ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate$$2 ( value00 = value0 , value10 = value1 ) ;
} ;
}
function styleRemoveEnd ( name ) {
return function ( ) {
this . style . removeProperty ( name ) ;
} ;
}
function styleConstant$1 ( name , interpolate$$2 , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = window ( this ) . getComputedStyle ( this , null ) . getPropertyValue ( name ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate$$2 ( value00 = value0 , value1 ) ;
} ;
}
function styleFunction$1 ( name , interpolate$$2 , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var style = window ( this ) . getComputedStyle ( this , null ) ,
value0 = style . getPropertyValue ( name ) ,
value1 = value ( this ) ;
if ( value1 == null ) value1 = ( this . style . removeProperty ( name ) , style . getPropertyValue ( name ) ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate$$2 ( value00 = value0 , value10 = value1 ) ;
} ;
}
var transition _style = function ( name , value , priority ) {
var i = ( name += "" ) === "transform" ? interpolateTransformCss : interpolate$$1 ;
return value == null ? this
. styleTween ( name , styleRemove$1 ( name , i ) )
. on ( "end.style." + name , styleRemoveEnd ( name ) ) :
this . styleTween ( name , typeof value === "function" ?
styleFunction$1 ( name , i , tweenValue ( this , "style." + name , value ) ) :
styleConstant$1 ( name , i , value ) , priority ) ;
} ;
function styleTween ( name , value , priority ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . style . setProperty ( name , i ( t ) , priority ) ;
} ;
}
tween . _value = value ;
return tween ;
}
var transition _styleTween = function ( name , value , priority ) {
var key = "style." + ( name += "" ) ;
if ( arguments . length < 2 ) return ( key = this . tween ( key ) ) && key . _value ;
if ( value == null ) return this . tween ( key , null ) ;
if ( typeof value !== "function" ) throw new Error ;
return this . tween ( key , styleTween ( name , value , priority == null ? "" : priority ) ) ;
} ;
function textConstant$1 ( value ) {
return function ( ) {
this . textContent = value ;
} ;
}
function textFunction$1 ( value ) {
return function ( ) {
var value1 = value ( this ) ;
this . textContent = value1 == null ? "" : value1 ;
} ;
}
var transition _text = function ( value ) {
return this . tween ( "text" , typeof value === "function" ?
textFunction$1 ( tweenValue ( this , "text" , value ) ) :
textConstant$1 ( value == null ? "" : value + "" ) ) ;
} ;
var transition _transition = function ( ) {
var name = this . _name ,
id0 = this . _id ,
id1 = newId ( ) ;
for ( var groups = this . _groups , m = groups . length , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
var inherit = get$1 ( node , id0 ) ;
schedule ( node , name , id1 , i , group , {
time : inherit . time + inherit . delay + inherit . duration ,
delay : 0 ,
duration : inherit . duration ,
ease : inherit . ease
} ) ;
}
}
}
return new Transition ( groups , this . _parents , name , id1 ) ;
} ;
var id = 0 ;
function Transition ( groups , parents , name , id ) {
this . _groups = groups ;
this . _parents = parents ;
this . _name = name ;
this . _id = id ;
}
function transition ( name ) {
return selection ( ) . transition ( name ) ;
}
function newId ( ) {
return ++ id ;
}
var selection _prototype = selection . prototype ;
Transition . prototype = transition . prototype = {
constructor : Transition ,
select : transition _select ,
selectAll : transition _selectAll ,
filter : transition _filter ,
merge : transition _merge ,
selection : transition _selection ,
transition : transition _transition ,
call : selection _prototype . call ,
nodes : selection _prototype . nodes ,
node : selection _prototype . node ,
size : selection _prototype . size ,
empty : selection _prototype . empty ,
each : selection _prototype . each ,
on : transition _on ,
attr : transition _attr ,
attrTween : transition _attrTween ,
style : transition _style ,
styleTween : transition _styleTween ,
text : transition _text ,
remove : transition _remove ,
tween : transition _tween ,
delay : transition _delay ,
duration : transition _duration ,
ease : transition _ease
} ;
function linear$1 ( t ) {
return + t ;
}
function quadIn ( t ) {
return t * t ;
}
function quadOut ( t ) {
return t * ( 2 - t ) ;
}
function quadInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? t * t : -- t * ( 2 - t ) + 1 ) / 2 ;
}
function cubicIn ( t ) {
return t * t * t ;
}
function cubicOut ( t ) {
return -- t * t * t + 1 ;
}
function cubicInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? t * t * t : ( t -= 2 ) * t * t + 2 ) / 2 ;
}
var exponent = 3 ;
var polyIn = ( function custom ( e ) {
e = + e ;
function polyIn ( t ) {
return Math . pow ( t , e ) ;
}
polyIn . exponent = custom ;
return polyIn ;
} ) ( exponent ) ;
var polyOut = ( function custom ( e ) {
e = + e ;
function polyOut ( t ) {
return 1 - Math . pow ( 1 - t , e ) ;
}
polyOut . exponent = custom ;
return polyOut ;
} ) ( exponent ) ;
var polyInOut = ( function custom ( e ) {
e = + e ;
function polyInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? Math . pow ( t , e ) : 2 - Math . pow ( 2 - t , e ) ) / 2 ;
}
polyInOut . exponent = custom ;
return polyInOut ;
} ) ( exponent ) ;
var pi = Math . PI ;
var halfPi = pi / 2 ;
function sinIn ( t ) {
return 1 - Math . cos ( t * halfPi ) ;
}
function sinOut ( t ) {
return Math . sin ( t * halfPi ) ;
}
function sinInOut ( t ) {
return ( 1 - Math . cos ( pi * t ) ) / 2 ;
}
function expIn ( t ) {
return Math . pow ( 2 , 10 * t - 10 ) ;
}
function expOut ( t ) {
return 1 - Math . pow ( 2 , - 10 * t ) ;
}
function expInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? Math . pow ( 2 , 10 * t - 10 ) : 2 - Math . pow ( 2 , 10 - 10 * t ) ) / 2 ;
}
function circleIn ( t ) {
return 1 - Math . sqrt ( 1 - t * t ) ;
}
function circleOut ( t ) {
return Math . sqrt ( 1 - -- t * t ) ;
}
function circleInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? 1 - Math . sqrt ( 1 - t * t ) : Math . sqrt ( 1 - ( t -= 2 ) * t ) + 1 ) / 2 ;
}
var b1 = 4 / 11 ;
var b2 = 6 / 11 ;
var b3 = 8 / 11 ;
var b4 = 3 / 4 ;
var b5 = 9 / 11 ;
var b6 = 10 / 11 ;
var b7 = 15 / 16 ;
var b8 = 21 / 22 ;
var b9 = 63 / 64 ;
var b0 = 1 / b1 / b1 ;
function bounceIn ( t ) {
return 1 - bounceOut ( 1 - t ) ;
}
function bounceOut ( t ) {
return ( t = + t ) < b1 ? b0 * t * t : t < b3 ? b0 * ( t -= b2 ) * t + b4 : t < b6 ? b0 * ( t -= b5 ) * t + b7 : b0 * ( t -= b8 ) * t + b9 ;
}
function bounceInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? 1 - bounceOut ( 1 - t ) : bounceOut ( t - 1 ) + 1 ) / 2 ;
}
var overshoot = 1.70158 ;
var backIn = ( function custom ( s ) {
s = + s ;
function backIn ( t ) {
return t * t * ( ( s + 1 ) * t - s ) ;
}
backIn . overshoot = custom ;
return backIn ;
} ) ( overshoot ) ;
var backOut = ( function custom ( s ) {
s = + s ;
function backOut ( t ) {
return -- t * t * ( ( s + 1 ) * t + s ) + 1 ;
}
backOut . overshoot = custom ;
return backOut ;
} ) ( overshoot ) ;
var backInOut = ( function custom ( s ) {
s = + s ;
function backInOut ( t ) {
return ( ( t *= 2 ) < 1 ? t * t * ( ( s + 1 ) * t - s ) : ( t -= 2 ) * t * ( ( s + 1 ) * t + s ) + 2 ) / 2 ;
}
backInOut . overshoot = custom ;
return backInOut ;
} ) ( overshoot ) ;
var tau = 2 * Math . PI ;
var amplitude = 1 ;
var period = 0.3 ;
var elasticIn = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticIn ( t ) {
return a * Math . pow ( 2 , 10 * -- t ) * Math . sin ( ( s - t ) / p ) ;
}
elasticIn . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticIn . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticIn ;
} ) ( amplitude , period ) ;
var elasticOut = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticOut ( t ) {
return 1 - a * Math . pow ( 2 , - 10 * ( t = + t ) ) * Math . sin ( ( t + s ) / p ) ;
}
elasticOut . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticOut . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticOut ;
} ) ( amplitude , period ) ;
var elasticInOut = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticInOut ( t ) {
return ( ( t = t * 2 - 1 ) < 0 ?
a * Math . pow ( 2 , 10 * t ) * Math . sin ( ( s - t ) / p ) :
2 - a * Math . pow ( 2 , - 10 * t ) * Math . sin ( ( s + t ) / p ) ) / 2 ;
}
elasticInOut . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticInOut . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticInOut ;
} ) ( amplitude , period ) ;
var defaultTiming = {
time : null , // Set on use.
delay : 0 ,
duration : 250 ,
ease : cubicInOut
} ;
function inherit ( node , id ) {
var timing ;
while ( ! ( timing = node . _ _transition ) || ! ( timing = timing [ id ] ) ) {
if ( ! ( node = node . parentNode ) ) {
return defaultTiming . time = now ( ) , defaultTiming ;
}
}
return timing ;
}
var selection _transition = function ( name ) {
var id ,
timing ;
if ( name instanceof Transition ) {
id = name . _id , name = name . _name ;
} else {
id = newId ( ) , ( timing = defaultTiming ) . time = now ( ) , name = name == null ? null : name + "" ;
}
for ( var groups = this . _groups , m = groups . length , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
schedule ( node , name , id , i , group , timing || inherit ( node , id ) ) ;
}
}
}
return new Transition ( groups , this . _parents , name , id ) ;
} ;
selection . prototype . interrupt = selection _interrupt ;
selection . prototype . transition = selection _transition ;
var root$1 = [ null ] ;
var active = function ( node , name ) {
var schedules = node . _ _transition ,
schedule ,
i ;
if ( schedules ) {
name = name == null ? null : name + "" ;
for ( i in schedules ) {
if ( ( schedule = schedules [ i ] ) . state > SCHEDULED && schedule . name === name ) {
return new Transition ( [
[ node ]
] , root$1 , name , + i ) ;
}
}
}
return null ;
} ;
var constant$4 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var BrushEvent = function ( target , type , selection ) {
this . target = target ;
this . type = type ;
this . selection = selection ;
} ;
function nopropagation$1 ( ) {
exports . event . stopImmediatePropagation ( ) ;
}
var noevent$1 = function ( ) {
exports . event . preventDefault ( ) ;
exports . event . stopImmediatePropagation ( ) ;
} ;
var MODE _DRAG = { name : "drag" } ;
var MODE _SPACE = { name : "space" } ;
var MODE _HANDLE = { name : "handle" } ;
var MODE _CENTER = { name : "center" } ;
var X = {
name : "x" ,
handles : [ "e" , "w" ] . map ( type ) ,
input : function ( x , e ) {
return x && [
[ x [ 0 ] , e [ 0 ] [ 1 ] ] ,
[ x [ 1 ] , e [ 1 ] [ 1 ] ]
] ;
} ,
output : function ( xy ) { return xy && [ xy [ 0 ] [ 0 ] , xy [ 1 ] [ 0 ] ] ; }
} ;
var Y = {
name : "y" ,
handles : [ "n" , "s" ] . map ( type ) ,
input : function ( y , e ) {
return y && [
[ e [ 0 ] [ 0 ] , y [ 0 ] ] ,
[ e [ 1 ] [ 0 ] , y [ 1 ] ]
] ;
} ,
output : function ( xy ) { return xy && [ xy [ 0 ] [ 1 ] , xy [ 1 ] [ 1 ] ] ; }
} ;
var XY = {
name : "xy" ,
handles : [ "n" , "e" , "s" , "w" , "nw" , "ne" , "se" , "sw" ] . map ( type ) ,
input : function ( xy ) { return xy ; } ,
output : function ( xy ) { return xy ; }
} ;
var cursors = {
overlay : "crosshair" ,
selection : "move" ,
n : "ns-resize" ,
e : "ew-resize" ,
s : "ns-resize" ,
w : "ew-resize" ,
nw : "nwse-resize" ,
ne : "nesw-resize" ,
se : "nwse-resize" ,
sw : "nesw-resize"
} ;
var flipX = {
e : "w" ,
w : "e" ,
nw : "ne" ,
ne : "nw" ,
se : "sw" ,
sw : "se"
} ;
var flipY = {
n : "s" ,
s : "n" ,
nw : "sw" ,
ne : "se" ,
se : "ne" ,
sw : "nw"
} ;
var signsX = {
overlay : + 1 ,
selection : + 1 ,
n : null ,
e : + 1 ,
s : null ,
w : - 1 ,
nw : - 1 ,
ne : + 1 ,
se : + 1 ,
sw : - 1
} ;
var signsY = {
overlay : + 1 ,
selection : + 1 ,
n : - 1 ,
e : null ,
s : + 1 ,
w : null ,
nw : - 1 ,
ne : - 1 ,
se : + 1 ,
sw : + 1
} ;
function type ( t ) {
return { type : t } ;
}
// Ignore right-click, since that should open the context menu.
function defaultFilter ( ) {
return ! exports . event . button ;
}
function defaultExtent ( ) {
var svg = this . ownerSVGElement || this ;
return [
[ 0 , 0 ] ,
[ svg . width . baseVal . value , svg . height . baseVal . value ]
] ;
}
// Like d3.local, but with the name “__brush” rather than auto-generated.
function local$$1 ( node ) {
while ( ! node . _ _brush )
if ( ! ( node = node . parentNode ) ) return ;
return node . _ _brush ;
}
function empty ( extent ) {
return extent [ 0 ] [ 0 ] === extent [ 1 ] [ 0 ] ||
extent [ 0 ] [ 1 ] === extent [ 1 ] [ 1 ] ;
}
function brushSelection ( node ) {
var state = node . _ _brush ;
return state ? state . dim . output ( state . selection ) : null ;
}
function brushX ( ) {
return brush$1 ( X ) ;
}
function brushY ( ) {
return brush$1 ( Y ) ;
}
var brush = function ( ) {
return brush$1 ( XY ) ;
} ;
function brush$1 ( dim ) {
var extent = defaultExtent ,
filter = defaultFilter ,
listeners = dispatch ( brush , "start" , "brush" , "end" ) ,
handleSize = 6 ,
touchending ;
function brush ( group ) {
var overlay = group
. property ( "__brush" , initialize )
. selectAll ( ".overlay" )
. data ( [ type ( "overlay" ) ] ) ;
overlay . enter ( ) . append ( "rect" )
. attr ( "class" , "overlay" )
. attr ( "pointer-events" , "all" )
. attr ( "cursor" , cursors . overlay )
. merge ( overlay )
. each ( function ( ) {
var extent = local$$1 ( this ) . extent ;
select ( this )
. attr ( "x" , extent [ 0 ] [ 0 ] )
. attr ( "y" , extent [ 0 ] [ 1 ] )
. attr ( "width" , extent [ 1 ] [ 0 ] - extent [ 0 ] [ 0 ] )
. attr ( "height" , extent [ 1 ] [ 1 ] - extent [ 0 ] [ 1 ] ) ;
} ) ;
group . selectAll ( ".selection" )
. data ( [ type ( "selection" ) ] )
. enter ( ) . append ( "rect" )
. attr ( "class" , "selection" )
. attr ( "cursor" , cursors . selection )
. attr ( "fill" , "#777" )
. attr ( "fill-opacity" , 0.3 )
. attr ( "stroke" , "#fff" )
. attr ( "shape-rendering" , "crispEdges" ) ;
var handle = group . selectAll ( ".handle" )
. data ( dim . handles , function ( d ) { return d . type ; } ) ;
handle . exit ( ) . remove ( ) ;
handle . enter ( ) . append ( "rect" )
. attr ( "class" , function ( d ) { return "handle handle--" + d . type ; } )
. attr ( "cursor" , function ( d ) { return cursors [ d . type ] ; } ) ;
group
. each ( redraw )
. attr ( "fill" , "none" )
. attr ( "pointer-events" , "all" )
. style ( "-webkit-tap-highlight-color" , "rgba(0,0,0,0)" )
. on ( "mousedown.brush touchstart.brush" , started ) ;
}
brush . move = function ( group , selection$$1 ) {
if ( group . selection ) {
group
. on ( "start.brush" , function ( ) { emitter ( this , arguments ) . beforestart ( ) . start ( ) ; } )
. on ( "interrupt.brush end.brush" , function ( ) { emitter ( this , arguments ) . end ( ) ; } )
. tween ( "brush" , function ( ) {
var that = this ,
state = that . _ _brush ,
emit = emitter ( that , arguments ) ,
selection0 = state . selection ,
selection1 = dim . input ( typeof selection$$1 === "function" ? selection$$1 . apply ( this , arguments ) : selection$$1 , state . extent ) ,
i = interpolateValue ( selection0 , selection1 ) ;
function tween ( t ) {
state . selection = t === 1 && empty ( selection1 ) ? null : i ( t ) ;
redraw . call ( that ) ;
emit . brush ( ) ;
}
return selection0 && selection1 ? tween : tween ( 1 ) ;
} ) ;
} else {
group
. each ( function ( ) {
var that = this ,
args = arguments ,
state = that . _ _brush ,
selection1 = dim . input ( typeof selection$$1 === "function" ? selection$$1 . apply ( that , args ) : selection$$1 , state . extent ) ,
emit = emitter ( that , args ) . beforestart ( ) ;
interrupt ( that ) ;
state . selection = selection1 == null || empty ( selection1 ) ? null : selection1 ;
redraw . call ( that ) ;
emit . start ( ) . brush ( ) . end ( ) ;
} ) ;
}
} ;
function redraw ( ) {
var group = select ( this ) ,
selection$$1 = local$$1 ( this ) . selection ;
if ( selection$$1 ) {
group . selectAll ( ".selection" )
. style ( "display" , null )
. attr ( "x" , selection$$1 [ 0 ] [ 0 ] )
. attr ( "y" , selection$$1 [ 0 ] [ 1 ] )
. attr ( "width" , selection$$1 [ 1 ] [ 0 ] - selection$$1 [ 0 ] [ 0 ] )
. attr ( "height" , selection$$1 [ 1 ] [ 1 ] - selection$$1 [ 0 ] [ 1 ] ) ;
group . selectAll ( ".handle" )
. style ( "display" , null )
. attr ( "x" , function ( d ) { return d . type [ d . type . length - 1 ] === "e" ? selection$$1 [ 1 ] [ 0 ] - handleSize / 2 : selection$$1 [ 0 ] [ 0 ] - handleSize / 2 ; } )
. attr ( "y" , function ( d ) { return d . type [ 0 ] === "s" ? selection$$1 [ 1 ] [ 1 ] - handleSize / 2 : selection$$1 [ 0 ] [ 1 ] - handleSize / 2 ; } )
. attr ( "width" , function ( d ) { return d . type === "n" || d . type === "s" ? selection$$1 [ 1 ] [ 0 ] - selection$$1 [ 0 ] [ 0 ] + handleSize : handleSize ; } )
. attr ( "height" , function ( d ) { return d . type === "e" || d . type === "w" ? selection$$1 [ 1 ] [ 1 ] - selection$$1 [ 0 ] [ 1 ] + handleSize : handleSize ; } ) ;
} else {
group . selectAll ( ".selection,.handle" )
. style ( "display" , "none" )
. attr ( "x" , null )
. attr ( "y" , null )
. attr ( "width" , null )
. attr ( "height" , null ) ;
}
}
function emitter ( that , args ) {
return that . _ _brush . emitter || new Emitter ( that , args ) ;
}
function Emitter ( that , args ) {
this . that = that ;
this . args = args ;
this . state = that . _ _brush ;
this . active = 0 ;
}
Emitter . prototype = {
beforestart : function ( ) {
if ( ++ this . active === 1 ) this . state . emitter = this , this . starting = true ;
return this ;
} ,
start : function ( ) {
if ( this . starting ) this . starting = false , this . emit ( "start" ) ;
return this ;
} ,
brush : function ( ) {
this . emit ( "brush" ) ;
return this ;
} ,
end : function ( ) {
if ( -- this . active === 0 ) delete this . state . emitter , this . emit ( "end" ) ;
return this ;
} ,
emit : function ( type ) {
customEvent ( new BrushEvent ( brush , type , dim . output ( this . state . selection ) ) , listeners . apply , listeners , [ type , this . that , this . args ] ) ;
}
} ;
function started ( ) {
if ( exports . event . touches ) { if ( exports . event . changedTouches . length < exports . event . touches . length ) return noevent$1 ( ) ; } else if ( touchending ) return ;
if ( ! filter . apply ( this , arguments ) ) return ;
var that = this ,
type = exports . event . target . _ _data _ _ . type ,
mode = ( exports . event . metaKey ? type = "overlay" : type ) === "selection" ? MODE _DRAG : ( exports . event . altKey ? MODE _CENTER : MODE _HANDLE ) ,
signX = dim === Y ? null : signsX [ type ] ,
signY = dim === X ? null : signsY [ type ] ,
state = local$$1 ( that ) ,
extent = state . extent ,
selection$$1 = state . selection ,
W = extent [ 0 ] [ 0 ] ,
w0 , w1 ,
N = extent [ 0 ] [ 1 ] ,
n0 , n1 ,
E = extent [ 1 ] [ 0 ] ,
e0 , e1 ,
S = extent [ 1 ] [ 1 ] ,
s0 , s1 ,
dx ,
dy ,
moving ,
shifting = signX && signY && exports . event . shiftKey ,
lockX ,
lockY ,
point0 = mouse ( that ) ,
point = point0 ,
emit = emitter ( that , arguments ) . beforestart ( ) ;
if ( type === "overlay" ) {
state . selection = selection$$1 = [
[ w0 = dim === Y ? W : point0 [ 0 ] , n0 = dim === X ? N : point0 [ 1 ] ] ,
[ e0 = dim === Y ? E : w0 , s0 = dim === X ? S : n0 ]
] ;
} else {
w0 = selection$$1 [ 0 ] [ 0 ] ;
n0 = selection$$1 [ 0 ] [ 1 ] ;
e0 = selection$$1 [ 1 ] [ 0 ] ;
s0 = selection$$1 [ 1 ] [ 1 ] ;
}
w1 = w0 ;
n1 = n0 ;
e1 = e0 ;
s1 = s0 ;
var group = select ( that )
. attr ( "pointer-events" , "none" ) ;
var overlay = group . selectAll ( ".overlay" )
. attr ( "cursor" , cursors [ type ] ) ;
if ( exports . event . touches ) {
group
. on ( "touchmove.brush" , moved , true )
. on ( "touchend.brush touchcancel.brush" , ended , true ) ;
} else {
var view = select ( exports . event . view )
. on ( "keydown.brush" , keydowned , true )
. on ( "keyup.brush" , keyupped , true )
. on ( "mousemove.brush" , moved , true )
. on ( "mouseup.brush" , ended , true ) ;
dragDisable ( exports . event . view ) ;
}
nopropagation$1 ( ) ;
interrupt ( that ) ;
redraw . call ( that ) ;
emit . start ( ) ;
function moved ( ) {
var point1 = mouse ( that ) ;
if ( shifting && ! lockX && ! lockY ) {
if ( Math . abs ( point1 [ 0 ] - point [ 0 ] ) > Math . abs ( point1 [ 1 ] - point [ 1 ] ) ) lockY = true ;
else lockX = true ;
}
point = point1 ;
moving = true ;
noevent$1 ( ) ;
move ( ) ;
}
function move ( ) {
var t ;
dx = point [ 0 ] - point0 [ 0 ] ;
dy = point [ 1 ] - point0 [ 1 ] ;
switch ( mode ) {
case MODE _SPACE :
case MODE _DRAG :
{
if ( signX ) dx = Math . max ( W - w0 , Math . min ( E - e0 , dx ) ) ,
w1 = w0 + dx ,
e1 = e0 + dx ;
if ( signY ) dy = Math . max ( N - n0 , Math . min ( S - s0 , dy ) ) ,
n1 = n0 + dy ,
s1 = s0 + dy ;
break ;
}
case MODE _HANDLE :
{
if ( signX < 0 ) dx = Math . max ( W - w0 , Math . min ( E - w0 , dx ) ) ,
w1 = w0 + dx ,
e1 = e0 ;
else if ( signX > 0 ) dx = Math . max ( W - e0 , Math . min ( E - e0 , dx ) ) ,
w1 = w0 ,
e1 = e0 + dx ;
if ( signY < 0 ) dy = Math . max ( N - n0 , Math . min ( S - n0 , dy ) ) ,
n1 = n0 + dy ,
s1 = s0 ;
else if ( signY > 0 ) dy = Math . max ( N - s0 , Math . min ( S - s0 , dy ) ) ,
n1 = n0 ,
s1 = s0 + dy ;
break ;
}
case MODE _CENTER :
{
if ( signX ) w1 = Math . max ( W , Math . min ( E , w0 - dx * signX ) ) ,
e1 = Math . max ( W , Math . min ( E , e0 + dx * signX ) ) ;
if ( signY ) n1 = Math . max ( N , Math . min ( S , n0 - dy * signY ) ) ,
s1 = Math . max ( N , Math . min ( S , s0 + dy * signY ) ) ;
break ;
}
}
if ( e1 < w1 ) {
signX *= - 1 ;
t = w0 , w0 = e0 , e0 = t ;
t = w1 , w1 = e1 , e1 = t ;
if ( type in flipX ) overlay . attr ( "cursor" , cursors [ type = flipX [ type ] ] ) ;
}
if ( s1 < n1 ) {
signY *= - 1 ;
t = n0 , n0 = s0 , s0 = t ;
t = n1 , n1 = s1 , s1 = t ;
if ( type in flipY ) overlay . attr ( "cursor" , cursors [ type = flipY [ type ] ] ) ;
}
if ( state . selection ) selection$$1 = state . selection ; // May be set by brush.move!
if ( lockX ) w1 = selection$$1 [ 0 ] [ 0 ] , e1 = selection$$1 [ 1 ] [ 0 ] ;
if ( lockY ) n1 = selection$$1 [ 0 ] [ 1 ] , s1 = selection$$1 [ 1 ] [ 1 ] ;
if ( selection$$1 [ 0 ] [ 0 ] !== w1 ||
selection$$1 [ 0 ] [ 1 ] !== n1 ||
selection$$1 [ 1 ] [ 0 ] !== e1 ||
selection$$1 [ 1 ] [ 1 ] !== s1 ) {
state . selection = [
[ w1 , n1 ] ,
[ e1 , s1 ]
] ;
redraw . call ( that ) ;
emit . brush ( ) ;
}
}
function ended ( ) {
nopropagation$1 ( ) ;
if ( exports . event . touches ) {
if ( exports . event . touches . length ) return ;
if ( touchending ) clearTimeout ( touchending ) ;
touchending = setTimeout ( function ( ) { touchending = null ; } , 500 ) ; // Ghost clicks are delayed!
group . on ( "touchmove.brush touchend.brush touchcancel.brush" , null ) ;
} else {
yesdrag ( exports . event . view , moving ) ;
view . on ( "keydown.brush keyup.brush mousemove.brush mouseup.brush" , null ) ;
}
group . attr ( "pointer-events" , "all" ) ;
overlay . attr ( "cursor" , cursors . overlay ) ;
if ( state . selection ) selection$$1 = state . selection ; // May be set by brush.move (on start)!
if ( empty ( selection$$1 ) ) state . selection = null , redraw . call ( that ) ;
emit . end ( ) ;
}
function keydowned ( ) {
switch ( exports . event . keyCode ) {
case 16 :
{ // SHIFT
shifting = signX && signY ;
break ;
}
case 18 :
{ // ALT
if ( mode === MODE _HANDLE ) {
if ( signX ) e0 = e1 - dx * signX , w0 = w1 + dx * signX ;
if ( signY ) s0 = s1 - dy * signY , n0 = n1 + dy * signY ;
mode = MODE _CENTER ;
move ( ) ;
}
break ;
}
case 32 :
{ // SPACE; takes priority over ALT
if ( mode === MODE _HANDLE || mode === MODE _CENTER ) {
if ( signX < 0 ) e0 = e1 - dx ;
else if ( signX > 0 ) w0 = w1 - dx ;
if ( signY < 0 ) s0 = s1 - dy ;
else if ( signY > 0 ) n0 = n1 - dy ;
mode = MODE _SPACE ;
overlay . attr ( "cursor" , cursors . selection ) ;
move ( ) ;
}
break ;
}
default :
return ;
}
noevent$1 ( ) ;
}
function keyupped ( ) {
switch ( exports . event . keyCode ) {
case 16 :
{ // SHIFT
if ( shifting ) {
lockX = lockY = shifting = false ;
move ( ) ;
}
break ;
}
case 18 :
{ // ALT
if ( mode === MODE _CENTER ) {
if ( signX < 0 ) e0 = e1 ;
else if ( signX > 0 ) w0 = w1 ;
if ( signY < 0 ) s0 = s1 ;
else if ( signY > 0 ) n0 = n1 ;
mode = MODE _HANDLE ;
move ( ) ;
}
break ;
}
case 32 :
{ // SPACE
if ( mode === MODE _SPACE ) {
if ( exports . event . altKey ) {
if ( signX ) e0 = e1 - dx * signX , w0 = w1 + dx * signX ;
if ( signY ) s0 = s1 - dy * signY , n0 = n1 + dy * signY ;
mode = MODE _CENTER ;
} else {
if ( signX < 0 ) e0 = e1 ;
else if ( signX > 0 ) w0 = w1 ;
if ( signY < 0 ) s0 = s1 ;
else if ( signY > 0 ) n0 = n1 ;
mode = MODE _HANDLE ;
}
overlay . attr ( "cursor" , cursors [ type ] ) ;
move ( ) ;
}
break ;
}
default :
return ;
}
noevent$1 ( ) ;
}
}
function initialize ( ) {
var state = this . _ _brush || { selection : null } ;
state . extent = extent . apply ( this , arguments ) ;
state . dim = dim ;
return state ;
}
brush . extent = function ( _ ) {
return arguments . length ? ( extent = typeof _ === "function" ? _ : constant$4 ( [
[ + _ [ 0 ] [ 0 ] , + _ [ 0 ] [ 1 ] ] ,
[ + _ [ 1 ] [ 0 ] , + _ [ 1 ] [ 1 ] ]
] ) , brush ) : extent ;
} ;
brush . filter = function ( _ ) {
return arguments . length ? ( filter = typeof _ === "function" ? _ : constant$4 ( ! ! _ ) , brush ) : filter ;
} ;
brush . handleSize = function ( _ ) {
return arguments . length ? ( handleSize = + _ , brush ) : handleSize ;
} ;
brush . on = function ( ) {
var value = listeners . on . apply ( listeners , arguments ) ;
return value === listeners ? brush : value ;
} ;
return brush ;
}
var cos = Math . cos ;
var sin = Math . sin ;
var pi$1 = Math . PI ;
var halfPi$1 = pi$1 / 2 ;
var tau$1 = pi$1 * 2 ;
var max$1 = Math . max ;
function compareValue ( compare ) {
return function ( a , b ) {
return compare (
a . source . value + a . target . value ,
b . source . value + b . target . value
) ;
} ;
}
var chord = function ( ) {
var padAngle = 0 ,
sortGroups = null ,
sortSubgroups = null ,
sortChords = null ;
function chord ( matrix ) {
var n = matrix . length ,
groupSums = [ ] ,
groupIndex = sequence ( n ) ,
subgroupIndex = [ ] ,
chords = [ ] ,
groups = chords . groups = new Array ( n ) ,
subgroups = new Array ( n * n ) ,
k ,
x ,
x0 ,
dx ,
i ,
j ;
// Compute the sum.
k = 0 , i = - 1 ;
while ( ++ i < n ) {
x = 0 , j = - 1 ;
while ( ++ j < n ) {
x += matrix [ i ] [ j ] ;
}
groupSums . push ( x ) ;
subgroupIndex . push ( sequence ( n ) ) ;
k += x ;
}
// Sort groups…
if ( sortGroups ) groupIndex . sort ( function ( a , b ) {
return sortGroups ( groupSums [ a ] , groupSums [ b ] ) ;
} ) ;
// Sort subgroups…
if ( sortSubgroups ) subgroupIndex . forEach ( function ( d , i ) {
d . sort ( function ( a , b ) {
return sortSubgroups ( matrix [ i ] [ a ] , matrix [ i ] [ b ] ) ;
} ) ;
} ) ;
// Convert the sum to scaling factor for [0, 2pi].
// TODO Allow start and end angle to be specified?
// TODO Allow padding to be specified as percentage?
k = max$1 ( 0 , tau$1 - padAngle * n ) / k ;
dx = k ? padAngle : tau$1 / n ;
// Compute the start and end angle for each group and subgroup.
// Note: Opera has a bug reordering object literal properties!
x = 0 , i = - 1 ;
while ( ++ i < n ) {
x0 = x , j = - 1 ;
while ( ++ j < n ) {
var di = groupIndex [ i ] ,
dj = subgroupIndex [ di ] [ j ] ,
v = matrix [ di ] [ dj ] ,
a0 = x ,
a1 = x += v * k ;
subgroups [ dj * n + di ] = {
index : di ,
subindex : dj ,
startAngle : a0 ,
endAngle : a1 ,
value : v
} ;
}
groups [ di ] = {
index : di ,
startAngle : x0 ,
endAngle : x ,
value : groupSums [ di ]
} ;
x += dx ;
}
// Generate chords for each (non-empty) subgroup-subgroup link.
i = - 1 ;
while ( ++ i < n ) {
j = i - 1 ;
while ( ++ j < n ) {
var source = subgroups [ j * n + i ] ,
target = subgroups [ i * n + j ] ;
if ( source . value || target . value ) {
chords . push ( source . value < target . value ? { source : target , target : source } : { source : source , target : target } ) ;
}
}
}
return sortChords ? chords . sort ( sortChords ) : chords ;
}
chord . padAngle = function ( _ ) {
return arguments . length ? ( padAngle = max$1 ( 0 , _ ) , chord ) : padAngle ;
} ;
chord . sortGroups = function ( _ ) {
return arguments . length ? ( sortGroups = _ , chord ) : sortGroups ;
} ;
chord . sortSubgroups = function ( _ ) {
return arguments . length ? ( sortSubgroups = _ , chord ) : sortSubgroups ;
} ;
chord . sortChords = function ( _ ) {
return arguments . length ? ( _ == null ? sortChords = null : ( sortChords = compareValue ( _ ) ) . _ = _ , chord ) : sortChords && sortChords . _ ;
} ;
return chord ;
} ;
var slice$2 = Array . prototype . slice ;
var constant$5 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var pi$2 = Math . PI ;
var tau$2 = 2 * pi$2 ;
var epsilon$1 = 1e-6 ;
var tauEpsilon = tau$2 - epsilon$1 ;
function Path ( ) {
this . _x0 = this . _y0 = // start of current subpath
this . _x1 = this . _y1 = null ; // end of current subpath
this . _ = "" ;
}
function path ( ) {
return new Path ;
}
Path . prototype = path . prototype = {
constructor : Path ,
moveTo : function ( x , y ) {
this . _ += "M" + ( this . _x0 = this . _x1 = + x ) + "," + ( this . _y0 = this . _y1 = + y ) ;
} ,
closePath : function ( ) {
if ( this . _x1 !== null ) {
this . _x1 = this . _x0 , this . _y1 = this . _y0 ;
this . _ += "Z" ;
}
} ,
lineTo : function ( x , y ) {
this . _ += "L" + ( this . _x1 = + x ) + "," + ( this . _y1 = + y ) ;
} ,
quadraticCurveTo : function ( x1 , y1 , x , y ) {
this . _ += "Q" + ( + x1 ) + "," + ( + y1 ) + "," + ( this . _x1 = + x ) + "," + ( this . _y1 = + y ) ;
} ,
bezierCurveTo : function ( x1 , y1 , x2 , y2 , x , y ) {
this . _ += "C" + ( + x1 ) + "," + ( + y1 ) + "," + ( + x2 ) + "," + ( + y2 ) + "," + ( this . _x1 = + x ) + "," + ( this . _y1 = + y ) ;
} ,
arcTo : function ( x1 , y1 , x2 , y2 , r ) {
x1 = + x1 , y1 = + y1 , x2 = + x2 , y2 = + y2 , r = + r ;
var x0 = this . _x1 ,
y0 = this . _y1 ,
x21 = x2 - x1 ,
y21 = y2 - y1 ,
x01 = x0 - x1 ,
y01 = y0 - y1 ,
l01 _2 = x01 * x01 + y01 * y01 ;
// Is the radius negative? Error.
if ( r < 0 ) throw new Error ( "negative radius: " + r ) ;
// Is this path empty? Move to (x1,y1).
if ( this . _x1 === null ) {
this . _ += "M" + ( this . _x1 = x1 ) + "," + ( this . _y1 = y1 ) ;
}
// Or, is (x1,y1) coincident with (x0,y0)? Do nothing.
else if ( ! ( l01 _2 > epsilon$1 ) ) { }
// Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?
// Equivalently, is (x1,y1) coincident with (x2,y2)?
// Or, is the radius zero? Line to (x1,y1).
else if ( ! ( Math . abs ( y01 * x21 - y21 * x01 ) > epsilon$1 ) || ! r ) {
this . _ += "L" + ( this . _x1 = x1 ) + "," + ( this . _y1 = y1 ) ;
}
// Otherwise, draw an arc!
else {
var x20 = x2 - x0 ,
y20 = y2 - y0 ,
l21 _2 = x21 * x21 + y21 * y21 ,
l20 _2 = x20 * x20 + y20 * y20 ,
l21 = Math . sqrt ( l21 _2 ) ,
l01 = Math . sqrt ( l01 _2 ) ,
l = r * Math . tan ( ( pi$2 - Math . acos ( ( l21 _2 + l01 _2 - l20 _2 ) / ( 2 * l21 * l01 ) ) ) / 2 ) ,
t01 = l / l01 ,
t21 = l / l21 ;
// If the start tangent is not coincident with (x0,y0), line to.
if ( Math . abs ( t01 - 1 ) > epsilon$1 ) {
this . _ += "L" + ( x1 + t01 * x01 ) + "," + ( y1 + t01 * y01 ) ;
}
this . _ += "A" + r + "," + r + ",0,0," + ( + ( y01 * x20 > x01 * y20 ) ) + "," + ( this . _x1 = x1 + t21 * x21 ) + "," + ( this . _y1 = y1 + t21 * y21 ) ;
}
} ,
arc : function ( x , y , r , a0 , a1 , ccw ) {
x = + x , y = + y , r = + r ;
var dx = r * Math . cos ( a0 ) ,
dy = r * Math . sin ( a0 ) ,
x0 = x + dx ,
y0 = y + dy ,
cw = 1 ^ ccw ,
da = ccw ? a0 - a1 : a1 - a0 ;
// Is the radius negative? Error.
if ( r < 0 ) throw new Error ( "negative radius: " + r ) ;
// Is this path empty? Move to (x0,y0).
if ( this . _x1 === null ) {
this . _ += "M" + x0 + "," + y0 ;
}
// Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).
else if ( Math . abs ( this . _x1 - x0 ) > epsilon$1 || Math . abs ( this . _y1 - y0 ) > epsilon$1 ) {
this . _ += "L" + x0 + "," + y0 ;
}
// Is this arc empty? We’
if ( ! r ) return ;
// Is this a complete circle? Draw two arcs to complete the circle.
if ( da > tauEpsilon ) {
this . _ += "A" + r + "," + r + ",0,1," + cw + "," + ( x - dx ) + "," + ( y - dy ) + "A" + r + "," + r + ",0,1," + cw + "," + ( this . _x1 = x0 ) + "," + ( this . _y1 = y0 ) ;
}
// Otherwise, draw an arc!
else {
if ( da < 0 ) da = da % tau$2 + tau$2 ;
this . _ += "A" + r + "," + r + ",0," + ( + ( da >= pi$2 ) ) + "," + cw + "," + ( this . _x1 = x + r * Math . cos ( a1 ) ) + "," + ( this . _y1 = y + r * Math . sin ( a1 ) ) ;
}
} ,
rect : function ( x , y , w , h ) {
this . _ += "M" + ( this . _x0 = this . _x1 = + x ) + "," + ( this . _y0 = this . _y1 = + y ) + "h" + ( + w ) + "v" + ( + h ) + "h" + ( - w ) + "Z" ;
} ,
toString : function ( ) {
return this . _ ;
}
} ;
function defaultSource ( d ) {
return d . source ;
}
function defaultTarget ( d ) {
return d . target ;
}
function defaultRadius ( d ) {
return d . radius ;
}
function defaultStartAngle ( d ) {
return d . startAngle ;
}
function defaultEndAngle ( d ) {
return d . endAngle ;
}
var ribbon = function ( ) {
var source = defaultSource ,
target = defaultTarget ,
radius = defaultRadius ,
startAngle = defaultStartAngle ,
endAngle = defaultEndAngle ,
context = null ;
function ribbon ( ) {
var buffer ,
argv = slice$2 . call ( arguments ) ,
s = source . apply ( this , argv ) ,
t = target . apply ( this , argv ) ,
sr = + radius . apply ( this , ( argv [ 0 ] = s , argv ) ) ,
sa0 = startAngle . apply ( this , argv ) - halfPi$1 ,
sa1 = endAngle . apply ( this , argv ) - halfPi$1 ,
sx0 = sr * cos ( sa0 ) ,
sy0 = sr * sin ( sa0 ) ,
tr = + radius . apply ( this , ( argv [ 0 ] = t , argv ) ) ,
ta0 = startAngle . apply ( this , argv ) - halfPi$1 ,
ta1 = endAngle . apply ( this , argv ) - halfPi$1 ;
if ( ! context ) context = buffer = path ( ) ;
context . moveTo ( sx0 , sy0 ) ;
context . arc ( 0 , 0 , sr , sa0 , sa1 ) ;
if ( sa0 !== ta0 || sa1 !== ta1 ) { // TODO sr !== tr?
context . quadraticCurveTo ( 0 , 0 , tr * cos ( ta0 ) , tr * sin ( ta0 ) ) ;
context . arc ( 0 , 0 , tr , ta0 , ta1 ) ;
}
context . quadraticCurveTo ( 0 , 0 , sx0 , sy0 ) ;
context . closePath ( ) ;
if ( buffer ) return context = null , buffer + "" || null ;
}
ribbon . radius = function ( _ ) {
return arguments . length ? ( radius = typeof _ === "function" ? _ : constant$5 ( + _ ) , ribbon ) : radius ;
} ;
ribbon . startAngle = function ( _ ) {
return arguments . length ? ( startAngle = typeof _ === "function" ? _ : constant$5 ( + _ ) , ribbon ) : startAngle ;
} ;
ribbon . endAngle = function ( _ ) {
return arguments . length ? ( endAngle = typeof _ === "function" ? _ : constant$5 ( + _ ) , ribbon ) : endAngle ;
} ;
ribbon . source = function ( _ ) {
return arguments . length ? ( source = _ , ribbon ) : source ;
} ;
ribbon . target = function ( _ ) {
return arguments . length ? ( target = _ , ribbon ) : target ;
} ;
ribbon . context = function ( _ ) {
return arguments . length ? ( ( context = _ == null ? null : _ ) , ribbon ) : context ;
} ;
return ribbon ;
} ;
var prefix = "$" ;
function Map ( ) { }
Map . prototype = map$1 . prototype = {
constructor : Map ,
has : function ( key ) {
return ( prefix + key ) in this ;
} ,
get : function ( key ) {
return this [ prefix + key ] ;
} ,
set : function ( key , value ) {
this [ prefix + key ] = value ;
return this ;
} ,
remove : function ( key ) {
var property = prefix + key ;
return property in this && delete this [ property ] ;
} ,
clear : function ( ) {
for ( var property in this )
if ( property [ 0 ] === prefix ) delete this [ property ] ;
} ,
keys : function ( ) {
var keys = [ ] ;
for ( var property in this )
if ( property [ 0 ] === prefix ) keys . push ( property . slice ( 1 ) ) ;
return keys ;
} ,
values : function ( ) {
var values = [ ] ;
for ( var property in this )
if ( property [ 0 ] === prefix ) values . push ( this [ property ] ) ;
return values ;
} ,
entries : function ( ) {
var entries = [ ] ;
for ( var property in this )
if ( property [ 0 ] === prefix ) entries . push ( { key : property . slice ( 1 ) , value : this [ property ] } ) ;
return entries ;
} ,
size : function ( ) {
var size = 0 ;
for ( var property in this )
if ( property [ 0 ] === prefix ) ++ size ;
return size ;
} ,
empty : function ( ) {
for ( var property in this )
if ( property [ 0 ] === prefix ) return false ;
return true ;
} ,
each : function ( f ) {
for ( var property in this )
if ( property [ 0 ] === prefix ) f ( this [ property ] , property . slice ( 1 ) , this ) ;
}
} ;
function map$1 ( object , f ) {
var map = new Map ;
// Copy constructor.
if ( object instanceof Map ) object . each ( function ( value , key ) { map . set ( key , value ) ; } ) ;
// Index array by numeric index or specified key function.
else if ( Array . isArray ( object ) ) {
var i = - 1 ,
n = object . length ,
o ;
if ( f == null )
while ( ++ i < n ) map . set ( i , object [ i ] ) ;
else
while ( ++ i < n ) map . set ( f ( o = object [ i ] , i , object ) , o ) ;
}
// Convert object to map.
else if ( object )
for ( var key in object ) map . set ( key , object [ key ] ) ;
return map ;
}
var nest = function ( ) {
var keys = [ ] ,
sortKeys = [ ] ,
sortValues ,
rollup ,
nest ;
function apply ( array , depth , createResult , setResult ) {
if ( depth >= keys . length ) return rollup != null ?
rollup ( array ) : ( sortValues != null ?
array . sort ( sortValues ) :
array ) ;
var i = - 1 ,
n = array . length ,
key = keys [ depth ++ ] ,
keyValue ,
value ,
valuesByKey = map$1 ( ) ,
values ,
result = createResult ( ) ;
while ( ++ i < n ) {
if ( values = valuesByKey . get ( keyValue = key ( value = array [ i ] ) + "" ) ) {
values . push ( value ) ;
} else {
valuesByKey . set ( keyValue , [ value ] ) ;
}
}
valuesByKey . each ( function ( values , key ) {
setResult ( result , key , apply ( values , depth , createResult , setResult ) ) ;
} ) ;
return result ;
}
function entries ( map , depth ) {
if ( ++ depth > keys . length ) return map ;
var array , sortKey = sortKeys [ depth - 1 ] ;
if ( rollup != null && depth >= keys . length ) array = map . entries ( ) ;
else array = [ ] , map . each ( function ( v , k ) { array . push ( { key : k , values : entries ( v , depth ) } ) ; } ) ;
return sortKey != null ? array . sort ( function ( a , b ) { return sortKey ( a . key , b . key ) ; } ) : array ;
}
return nest = {
object : function ( array ) { return apply ( array , 0 , createObject , setObject ) ; } ,
map : function ( array ) { return apply ( array , 0 , createMap , setMap ) ; } ,
entries : function ( array ) { return entries ( apply ( array , 0 , createMap , setMap ) , 0 ) ; } ,
key : function ( d ) { keys . push ( d ) ; return nest ; } ,
sortKeys : function ( order ) { sortKeys [ keys . length - 1 ] = order ; return nest ; } ,
sortValues : function ( order ) { sortValues = order ; return nest ; } ,
rollup : function ( f ) { rollup = f ; return nest ; }
} ;
} ;
function createObject ( ) {
return { } ;
}
function setObject ( object , key , value ) {
object [ key ] = value ;
}
function createMap ( ) {
return map$1 ( ) ;
}
function setMap ( map , key , value ) {
map . set ( key , value ) ;
}
function Set ( ) { }
var proto = map$1 . prototype ;
Set . prototype = set$2 . prototype = {
constructor : Set ,
has : proto . has ,
add : function ( value ) {
value += "" ;
this [ prefix + value ] = value ;
return this ;
} ,
remove : proto . remove ,
clear : proto . clear ,
values : proto . keys ,
size : proto . size ,
empty : proto . empty ,
each : proto . each
} ;
function set$2 ( object , f ) {
var set = new Set ;
// Copy constructor.
if ( object instanceof Set ) object . each ( function ( value ) { set . add ( value ) ; } ) ;
// Otherwise, assume it’
else if ( object ) {
var i = - 1 ,
n = object . length ;
if ( f == null )
while ( ++ i < n ) set . add ( object [ i ] ) ;
else
while ( ++ i < n ) set . add ( f ( object [ i ] , i , object ) ) ;
}
return set ;
}
var keys = function ( map ) {
var keys = [ ] ;
for ( var key in map ) keys . push ( key ) ;
return keys ;
} ;
var values = function ( map ) {
var values = [ ] ;
for ( var key in map ) values . push ( map [ key ] ) ;
return values ;
} ;
var entries = function ( map ) {
var entries = [ ] ;
for ( var key in map ) entries . push ( { key : key , value : map [ key ] } ) ;
return entries ;
} ;
function objectConverter ( columns ) {
return new Function ( "d" , "return {" + columns . map ( function ( name , i ) {
return JSON . stringify ( name ) + ": d[" + i + "]" ;
} ) . join ( "," ) + "}" ) ;
}
function customConverter ( columns , f ) {
var object = objectConverter ( columns ) ;
return function ( row , i ) {
return f ( object ( row ) , i , columns ) ;
} ;
}
// Compute unique columns in order of discovery.
function inferColumns ( rows ) {
var columnSet = Object . create ( null ) ,
columns = [ ] ;
rows . forEach ( function ( row ) {
for ( var column in row ) {
if ( ! ( column in columnSet ) ) {
columns . push ( columnSet [ column ] = column ) ;
}
}
} ) ;
return columns ;
}
var dsv = function ( delimiter ) {
var reFormat = new RegExp ( "[\"" + delimiter + "\n]" ) ,
delimiterCode = delimiter . charCodeAt ( 0 ) ;
function parse ( text , f ) {
var convert , columns , rows = parseRows ( text , function ( row , i ) {
if ( convert ) return convert ( row , i - 1 ) ;
columns = row , convert = f ? customConverter ( row , f ) : objectConverter ( row ) ;
} ) ;
rows . columns = columns ;
return rows ;
}
function parseRows ( text , f ) {
var EOL = { } , // sentinel value for end-of-line
EOF = { } , // sentinel value for end-of-file
rows = [ ] , // output rows
N = text . length ,
I = 0 , // current character index
n = 0 , // the current line number
t , // the current token
eol ; // is the current token followed by EOL?
function token ( ) {
if ( I >= N ) return EOF ; // special case: end of file
if ( eol ) return eol = false , EOL ; // special case: end of line
// special case: quotes
var j = I ,
c ;
if ( text . charCodeAt ( j ) === 34 ) {
var i = j ;
while ( i ++ < N ) {
if ( text . charCodeAt ( i ) === 34 ) {
if ( text . charCodeAt ( i + 1 ) !== 34 ) break ;
++ i ;
}
}
I = i + 2 ;
c = text . charCodeAt ( i + 1 ) ;
if ( c === 13 ) {
eol = true ;
if ( text . charCodeAt ( i + 2 ) === 10 ) ++ I ;
} else if ( c === 10 ) {
eol = true ;
}
return text . slice ( j + 1 , i ) . replace ( /""/g , "\"" ) ;
}
// common case: find next delimiter or newline
while ( I < N ) {
var k = 1 ;
c = text . charCodeAt ( I ++ ) ;
if ( c === 10 ) eol = true ; // \n
else if ( c === 13 ) { eol = true ; if ( text . charCodeAt ( I ) === 10 ) ++ I , ++ k ; } // \r|\r\n
else if ( c !== delimiterCode ) continue ;
return text . slice ( j , I - k ) ;
}
// special case: last token before EOF
return text . slice ( j ) ;
}
while ( ( t = token ( ) ) !== EOF ) {
var a = [ ] ;
while ( t !== EOL && t !== EOF ) {
a . push ( t ) ;
t = token ( ) ;
}
if ( f && ( a = f ( a , n ++ ) ) == null ) continue ;
rows . push ( a ) ;
}
return rows ;
}
function format ( rows , columns ) {
if ( columns == null ) columns = inferColumns ( rows ) ;
return [ columns . map ( formatValue ) . join ( delimiter ) ] . concat ( rows . map ( function ( row ) {
return columns . map ( function ( column ) {
return formatValue ( row [ column ] ) ;
} ) . join ( delimiter ) ;
} ) ) . join ( "\n" ) ;
}
function formatRows ( rows ) {
return rows . map ( formatRow ) . join ( "\n" ) ;
}
function formatRow ( row ) {
return row . map ( formatValue ) . join ( delimiter ) ;
}
function formatValue ( text ) {
return text == null ? "" :
reFormat . test ( text += "" ) ? "\"" + text . replace ( /\"/g , "\"\"" ) + "\"" :
text ;
}
return {
parse : parse ,
parseRows : parseRows ,
format : format ,
formatRows : formatRows
} ;
} ;
var csv = dsv ( "," ) ;
var csvParse = csv . parse ;
var csvParseRows = csv . parseRows ;
var csvFormat = csv . format ;
var csvFormatRows = csv . formatRows ;
var tsv = dsv ( "\t" ) ;
var tsvParse = tsv . parse ;
var tsvParseRows = tsv . parseRows ;
var tsvFormat = tsv . format ;
var tsvFormatRows = tsv . formatRows ;
var center$1 = function ( x , y ) {
var nodes ;
if ( x == null ) x = 0 ;
if ( y == null ) y = 0 ;
function force ( ) {
var i ,
n = nodes . length ,
node ,
sx = 0 ,
sy = 0 ;
for ( i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] , sx += node . x , sy += node . y ;
}
for ( sx = sx / n - x , sy = sy / n - y , i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] , node . x -= sx , node . y -= sy ;
}
}
force . initialize = function ( _ ) {
nodes = _ ;
} ;
force . x = function ( _ ) {
return arguments . length ? ( x = + _ , force ) : x ;
} ;
force . y = function ( _ ) {
return arguments . length ? ( y = + _ , force ) : y ;
} ;
return force ;
} ;
var constant$6 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var jiggle = function ( ) {
return ( Math . random ( ) - 0.5 ) * 1e-6 ;
} ;
var tree _add = function ( d ) {
var x = + this . _x . call ( null , d ) ,
y = + this . _y . call ( null , d ) ;
return add ( this . cover ( x , y ) , x , y , d ) ;
} ;
function add ( tree , x , y , d ) {
if ( isNaN ( x ) || isNaN ( y ) ) return tree ; // ignore invalid points
var parent ,
node = tree . _root ,
leaf = { data : d } ,
x0 = tree . _x0 ,
y0 = tree . _y0 ,
x1 = tree . _x1 ,
y1 = tree . _y1 ,
xm ,
ym ,
xp ,
yp ,
right ,
bottom ,
i ,
j ;
// If the tree is empty, initialize the root as a leaf.
if ( ! node ) return tree . _root = leaf , tree ;
// Find the existing leaf for the new point, or add it.
while ( node . length ) {
if ( right = x >= ( xm = ( x0 + x1 ) / 2 ) ) x0 = xm ;
else x1 = xm ;
if ( bottom = y >= ( ym = ( y0 + y1 ) / 2 ) ) y0 = ym ;
else y1 = ym ;
if ( parent = node , ! ( node = node [ i = bottom << 1 | right ] ) ) return parent [ i ] = leaf , tree ;
}
// Is the new point is exactly coincident with the existing point?
xp = + tree . _x . call ( null , node . data ) ;
yp = + tree . _y . call ( null , node . data ) ;
if ( x === xp && y === yp ) return leaf . next = node , parent ? parent [ i ] = leaf : tree . _root = leaf , tree ;
// Otherwise, split the leaf node until the old and new point are separated.
do {
parent = parent ? parent [ i ] = new Array ( 4 ) : tree . _root = new Array ( 4 ) ;
if ( right = x >= ( xm = ( x0 + x1 ) / 2 ) ) x0 = xm ;
else x1 = xm ;
if ( bottom = y >= ( ym = ( y0 + y1 ) / 2 ) ) y0 = ym ;
else y1 = ym ;
} while ( ( i = bottom << 1 | right ) === ( j = ( yp >= ym ) << 1 | ( xp >= xm ) ) ) ;
return parent [ j ] = node , parent [ i ] = leaf , tree ;
}
function addAll ( data ) {
var d , i , n = data . length ,
x ,
y ,
xz = new Array ( n ) ,
yz = new Array ( n ) ,
x0 = Infinity ,
y0 = Infinity ,
x1 = - Infinity ,
y1 = - Infinity ;
// Compute the points and their extent.
for ( i = 0 ; i < n ; ++ i ) {
if ( isNaN ( x = + this . _x . call ( null , d = data [ i ] ) ) || isNaN ( y = + this . _y . call ( null , d ) ) ) continue ;
xz [ i ] = x ;
yz [ i ] = y ;
if ( x < x0 ) x0 = x ;
if ( x > x1 ) x1 = x ;
if ( y < y0 ) y0 = y ;
if ( y > y1 ) y1 = y ;
}
// If there were no (valid) points, inherit the existing extent.
if ( x1 < x0 ) x0 = this . _x0 , x1 = this . _x1 ;
if ( y1 < y0 ) y0 = this . _y0 , y1 = this . _y1 ;
// Expand the tree to cover the new points.
this . cover ( x0 , y0 ) . cover ( x1 , y1 ) ;
// Add the new points.
for ( i = 0 ; i < n ; ++ i ) {
add ( this , xz [ i ] , yz [ i ] , data [ i ] ) ;
}
return this ;
}
var tree _cover = function ( x , y ) {
if ( isNaN ( x = + x ) || isNaN ( y = + y ) ) return this ; // ignore invalid points
var x0 = this . _x0 ,
y0 = this . _y0 ,
x1 = this . _x1 ,
y1 = this . _y1 ;
// If the quadtree has no extent, initialize them.
// Integer extent are necessary so that if we later double the extent,
// the existing quadrant boundaries don’
if ( isNaN ( x0 ) ) {
x1 = ( x0 = Math . floor ( x ) ) + 1 ;
y1 = ( y0 = Math . floor ( y ) ) + 1 ;
}
// Otherwise, double repeatedly to cover.
else if ( x0 > x || x > x1 || y0 > y || y > y1 ) {
var z = x1 - x0 ,
node = this . _root ,
parent ,
i ;
switch ( i = ( y < ( y0 + y1 ) / 2 ) << 1 | ( x < ( x0 + x1 ) / 2 ) ) {
case 0 :
{
do parent = new Array ( 4 ) ,
parent [ i ] = node ,
node = parent ;
while ( z *= 2 , x1 = x0 + z , y1 = y0 + z , x > x1 || y > y1 ) ;
break ;
}
case 1 :
{
do parent = new Array ( 4 ) ,
parent [ i ] = node ,
node = parent ;
while ( z *= 2 , x0 = x1 - z , y1 = y0 + z , x0 > x || y > y1 ) ;
break ;
}
case 2 :
{
do parent = new Array ( 4 ) ,
parent [ i ] = node ,
node = parent ;
while ( z *= 2 , x1 = x0 + z , y0 = y1 - z , x > x1 || y0 > y ) ;
break ;
}
case 3 :
{
do parent = new Array ( 4 ) ,
parent [ i ] = node ,
node = parent ;
while ( z *= 2 , x0 = x1 - z , y0 = y1 - z , x0 > x || y0 > y ) ;
break ;
}
}
if ( this . _root && this . _root . length ) this . _root = node ;
}
// If the quadtree covers the point already, just return.
else return this ;
this . _x0 = x0 ;
this . _y0 = y0 ;
this . _x1 = x1 ;
this . _y1 = y1 ;
return this ;
} ;
var tree _data = function ( ) {
var data = [ ] ;
this . visit ( function ( node ) {
if ( ! node . length )
do data . push ( node . data ) ; while ( node = node . next )
} ) ;
return data ;
} ;
var tree _extent = function ( _ ) {
return arguments . length ?
this . cover ( + _ [ 0 ] [ 0 ] , + _ [ 0 ] [ 1 ] ) . cover ( + _ [ 1 ] [ 0 ] , + _ [ 1 ] [ 1 ] ) :
isNaN ( this . _x0 ) ? undefined : [
[ this . _x0 , this . _y0 ] ,
[ this . _x1 , this . _y1 ]
] ;
} ;
var Quad = function ( node , x0 , y0 , x1 , y1 ) {
this . node = node ;
this . x0 = x0 ;
this . y0 = y0 ;
this . x1 = x1 ;
this . y1 = y1 ;
} ;
var tree _find = function ( x , y , radius ) {
var data ,
x0 = this . _x0 ,
y0 = this . _y0 ,
x1 ,
y1 ,
x2 ,
y2 ,
x3 = this . _x1 ,
y3 = this . _y1 ,
quads = [ ] ,
node = this . _root ,
q ,
i ;
if ( node ) quads . push ( new Quad ( node , x0 , y0 , x3 , y3 ) ) ;
if ( radius == null ) radius = Infinity ;
else {
x0 = x - radius , y0 = y - radius ;
x3 = x + radius , y3 = y + radius ;
radius *= radius ;
}
while ( q = quads . pop ( ) ) {
// Stop searching if this quadrant can’
if ( ! ( node = q . node ) ||
( x1 = q . x0 ) > x3 ||
( y1 = q . y0 ) > y3 ||
( x2 = q . x1 ) < x0 ||
( y2 = q . y1 ) < y0 ) continue ;
// Bisect the current quadrant.
if ( node . length ) {
var xm = ( x1 + x2 ) / 2 ,
ym = ( y1 + y2 ) / 2 ;
quads . push (
new Quad ( node [ 3 ] , xm , ym , x2 , y2 ) ,
new Quad ( node [ 2 ] , x1 , ym , xm , y2 ) ,
new Quad ( node [ 1 ] , xm , y1 , x2 , ym ) ,
new Quad ( node [ 0 ] , x1 , y1 , xm , ym )
) ;
// Visit the closest quadrant first.
if ( i = ( y >= ym ) << 1 | ( x >= xm ) ) {
q = quads [ quads . length - 1 ] ;
quads [ quads . length - 1 ] = quads [ quads . length - 1 - i ] ;
quads [ quads . length - 1 - i ] = q ;
}
}
// Visit this point. (Visiting coincident points isn’
else {
var dx = x - + this . _x . call ( null , node . data ) ,
dy = y - + this . _y . call ( null , node . data ) ,
d2 = dx * dx + dy * dy ;
if ( d2 < radius ) {
var d = Math . sqrt ( radius = d2 ) ;
x0 = x - d , y0 = y - d ;
x3 = x + d , y3 = y + d ;
data = node . data ;
}
}
}
return data ;
} ;
var tree _remove = function ( d ) {
if ( isNaN ( x = + this . _x . call ( null , d ) ) || isNaN ( y = + this . _y . call ( null , d ) ) ) return this ; // ignore invalid points
var parent ,
node = this . _root ,
retainer ,
previous ,
next ,
x0 = this . _x0 ,
y0 = this . _y0 ,
x1 = this . _x1 ,
y1 = this . _y1 ,
x ,
y ,
xm ,
ym ,
right ,
bottom ,
i ,
j ;
// If the tree is empty, initialize the root as a leaf.
if ( ! node ) return this ;
// Find the leaf node for the point.
// While descending, also retain the deepest parent with a non-removed sibling.
if ( node . length )
while ( true ) {
if ( right = x >= ( xm = ( x0 + x1 ) / 2 ) ) x0 = xm ;
else x1 = xm ;
if ( bottom = y >= ( ym = ( y0 + y1 ) / 2 ) ) y0 = ym ;
else y1 = ym ;
if ( ! ( parent = node , node = node [ i = bottom << 1 | right ] ) ) return this ;
if ( ! node . length ) break ;
if ( parent [ ( i + 1 ) & 3 ] || parent [ ( i + 2 ) & 3 ] || parent [ ( i + 3 ) & 3 ] ) retainer = parent , j = i ;
}
// Find the point to remove.
while ( node . data !== d )
if ( ! ( previous = node , node = node . next ) ) return this ;
if ( next = node . next ) delete node . next ;
// If there are multiple coincident points, remove just the point.
if ( previous ) return ( next ? previous . next = next : delete previous . next ) , this ;
// If this is the root point, remove it.
if ( ! parent ) return this . _root = next , this ;
// Remove this leaf.
next ? parent [ i ] = next : delete parent [ i ] ;
// If the parent now contains exactly one leaf, collapse superfluous parents.
if ( ( node = parent [ 0 ] || parent [ 1 ] || parent [ 2 ] || parent [ 3 ] ) &&
node === ( parent [ 3 ] || parent [ 2 ] || parent [ 1 ] || parent [ 0 ] ) &&
! node . length ) {
if ( retainer ) retainer [ j ] = node ;
else this . _root = node ;
}
return this ;
} ;
function removeAll ( data ) {
for ( var i = 0 , n = data . length ; i < n ; ++ i ) this . remove ( data [ i ] ) ;
return this ;
}
var tree _root = function ( ) {
return this . _root ;
} ;
var tree _size = function ( ) {
var size = 0 ;
this . visit ( function ( node ) {
if ( ! node . length )
do ++ size ; while ( node = node . next )
} ) ;
return size ;
} ;
var tree _visit = function ( callback ) {
var quads = [ ] ,
q , node = this . _root ,
child , x0 , y0 , x1 , y1 ;
if ( node ) quads . push ( new Quad ( node , this . _x0 , this . _y0 , this . _x1 , this . _y1 ) ) ;
while ( q = quads . pop ( ) ) {
if ( ! callback ( node = q . node , x0 = q . x0 , y0 = q . y0 , x1 = q . x1 , y1 = q . y1 ) && node . length ) {
var xm = ( x0 + x1 ) / 2 ,
ym = ( y0 + y1 ) / 2 ;
if ( child = node [ 3 ] ) quads . push ( new Quad ( child , xm , ym , x1 , y1 ) ) ;
if ( child = node [ 2 ] ) quads . push ( new Quad ( child , x0 , ym , xm , y1 ) ) ;
if ( child = node [ 1 ] ) quads . push ( new Quad ( child , xm , y0 , x1 , ym ) ) ;
if ( child = node [ 0 ] ) quads . push ( new Quad ( child , x0 , y0 , xm , ym ) ) ;
}
}
return this ;
} ;
var tree _visitAfter = function ( callback ) {
var quads = [ ] ,
next = [ ] ,
q ;
if ( this . _root ) quads . push ( new Quad ( this . _root , this . _x0 , this . _y0 , this . _x1 , this . _y1 ) ) ;
while ( q = quads . pop ( ) ) {
var node = q . node ;
if ( node . length ) {
var child , x0 = q . x0 ,
y0 = q . y0 ,
x1 = q . x1 ,
y1 = q . y1 ,
xm = ( x0 + x1 ) / 2 ,
ym = ( y0 + y1 ) / 2 ;
if ( child = node [ 0 ] ) quads . push ( new Quad ( child , x0 , y0 , xm , ym ) ) ;
if ( child = node [ 1 ] ) quads . push ( new Quad ( child , xm , y0 , x1 , ym ) ) ;
if ( child = node [ 2 ] ) quads . push ( new Quad ( child , x0 , ym , xm , y1 ) ) ;
if ( child = node [ 3 ] ) quads . push ( new Quad ( child , xm , ym , x1 , y1 ) ) ;
}
next . push ( q ) ;
}
while ( q = next . pop ( ) ) {
callback ( q . node , q . x0 , q . y0 , q . x1 , q . y1 ) ;
}
return this ;
} ;
function defaultX ( d ) {
return d [ 0 ] ;
}
var tree _x = function ( _ ) {
return arguments . length ? ( this . _x = _ , this ) : this . _x ;
} ;
function defaultY ( d ) {
return d [ 1 ] ;
}
var tree _y = function ( _ ) {
return arguments . length ? ( this . _y = _ , this ) : this . _y ;
} ;
function quadtree ( nodes , x , y ) {
var tree = new Quadtree ( x == null ? defaultX : x , y == null ? defaultY : y , NaN , NaN , NaN , NaN ) ;
return nodes == null ? tree : tree . addAll ( nodes ) ;
}
function Quadtree ( x , y , x0 , y0 , x1 , y1 ) {
this . _x = x ;
this . _y = y ;
this . _x0 = x0 ;
this . _y0 = y0 ;
this . _x1 = x1 ;
this . _y1 = y1 ;
this . _root = undefined ;
}
function leaf _copy ( leaf ) {
var copy = { data : leaf . data } ,
next = copy ;
while ( leaf = leaf . next ) next = next . next = { data : leaf . data } ;
return copy ;
}
var treeProto = quadtree . prototype = Quadtree . prototype ;
treeProto . copy = function ( ) {
var copy = new Quadtree ( this . _x , this . _y , this . _x0 , this . _y0 , this . _x1 , this . _y1 ) ,
node = this . _root ,
nodes ,
child ;
if ( ! node ) return copy ;
if ( ! node . length ) return copy . _root = leaf _copy ( node ) , copy ;
nodes = [ { source : node , target : copy . _root = new Array ( 4 ) } ] ;
while ( node = nodes . pop ( ) ) {
for ( var i = 0 ; i < 4 ; ++ i ) {
if ( child = node . source [ i ] ) {
if ( child . length ) nodes . push ( { source : child , target : node . target [ i ] = new Array ( 4 ) } ) ;
else node . target [ i ] = leaf _copy ( child ) ;
}
}
}
return copy ;
} ;
treeProto . add = tree _add ;
treeProto . addAll = addAll ;
treeProto . cover = tree _cover ;
treeProto . data = tree _data ;
treeProto . extent = tree _extent ;
treeProto . find = tree _find ;
treeProto . remove = tree _remove ;
treeProto . removeAll = removeAll ;
treeProto . root = tree _root ;
treeProto . size = tree _size ;
treeProto . visit = tree _visit ;
treeProto . visitAfter = tree _visitAfter ;
treeProto . x = tree _x ;
treeProto . y = tree _y ;
function x ( d ) {
return d . x + d . vx ;
}
function y ( d ) {
return d . y + d . vy ;
}
var collide = function ( radius ) {
var nodes ,
radii ,
strength = 1 ,
iterations = 1 ;
if ( typeof radius !== "function" ) radius = constant$6 ( radius == null ? 1 : + radius ) ;
function force ( ) {
var i , n = nodes . length ,
tree ,
node ,
xi ,
yi ,
ri ,
ri2 ;
for ( var k = 0 ; k < iterations ; ++ k ) {
tree = quadtree ( nodes , x , y ) . visitAfter ( prepare ) ;
for ( i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] ;
ri = radii [ node . index ] , ri2 = ri * ri ;
xi = node . x + node . vx ;
yi = node . y + node . vy ;
tree . visit ( apply ) ;
}
}
function apply ( quad , x0 , y0 , x1 , y1 ) {
var data = quad . data ,
rj = quad . r ,
r = ri + rj ;
if ( data ) {
if ( data . index > node . index ) {
var x = xi - data . x - data . vx ,
y = yi - data . y - data . vy ,
l = x * x + y * y ;
if ( l < r * r ) {
if ( x === 0 ) x = jiggle ( ) , l += x * x ;
if ( y === 0 ) y = jiggle ( ) , l += y * y ;
l = ( r - ( l = Math . sqrt ( l ) ) ) / l * strength ;
node . vx += ( x *= l ) * ( r = ( rj *= rj ) / ( ri2 + rj ) ) ;
node . vy += ( y *= l ) * r ;
data . vx -= x * ( r = 1 - r ) ;
data . vy -= y * r ;
}
}
return ;
}
return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r ;
}
}
function prepare ( quad ) {
if ( quad . data ) return quad . r = radii [ quad . data . index ] ;
for ( var i = quad . r = 0 ; i < 4 ; ++ i ) {
if ( quad [ i ] && quad [ i ] . r > quad . r ) {
quad . r = quad [ i ] . r ;
}
}
}
function initialize ( ) {
if ( ! nodes ) return ;
var i , n = nodes . length ,
node ;
radii = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) node = nodes [ i ] , radii [ node . index ] = + radius ( node , i , nodes ) ;
}
force . initialize = function ( _ ) {
nodes = _ ;
initialize ( ) ;
} ;
force . iterations = function ( _ ) {
return arguments . length ? ( iterations = + _ , force ) : iterations ;
} ;
force . strength = function ( _ ) {
return arguments . length ? ( strength = + _ , force ) : strength ;
} ;
force . radius = function ( _ ) {
return arguments . length ? ( radius = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : radius ;
} ;
return force ;
} ;
function index ( d ) {
return d . index ;
}
function find ( nodeById , nodeId ) {
var node = nodeById . get ( nodeId ) ;
if ( ! node ) throw new Error ( "missing: " + nodeId ) ;
return node ;
}
var link = function ( links ) {
var id = index ,
strength = defaultStrength ,
strengths ,
distance = constant$6 ( 30 ) ,
distances ,
nodes ,
count ,
bias ,
iterations = 1 ;
if ( links == null ) links = [ ] ;
function defaultStrength ( link ) {
return 1 / Math . min ( count [ link . source . index ] , count [ link . target . index ] ) ;
}
function force ( alpha ) {
for ( var k = 0 , n = links . length ; k < iterations ; ++ k ) {
for ( var i = 0 , link , source , target , x , y , l , b ; i < n ; ++ i ) {
link = links [ i ] , source = link . source , target = link . target ;
x = target . x + target . vx - source . x - source . vx || jiggle ( ) ;
y = target . y + target . vy - source . y - source . vy || jiggle ( ) ;
l = Math . sqrt ( x * x + y * y ) ;
l = ( l - distances [ i ] ) / l * alpha * strengths [ i ] ;
x *= l , y *= l ;
target . vx -= x * ( b = bias [ i ] ) ;
target . vy -= y * b ;
source . vx += x * ( b = 1 - b ) ;
source . vy += y * b ;
}
}
}
function initialize ( ) {
if ( ! nodes ) return ;
var i ,
n = nodes . length ,
m = links . length ,
nodeById = map$1 ( nodes , id ) ,
link ;
for ( i = 0 , count = new Array ( n ) ; i < m ; ++ i ) {
link = links [ i ] , link . index = i ;
if ( typeof link . source !== "object" ) link . source = find ( nodeById , link . source ) ;
if ( typeof link . target !== "object" ) link . target = find ( nodeById , link . target ) ;
count [ link . source . index ] = ( count [ link . source . index ] || 0 ) + 1 ;
count [ link . target . index ] = ( count [ link . target . index ] || 0 ) + 1 ;
}
for ( i = 0 , bias = new Array ( m ) ; i < m ; ++ i ) {
link = links [ i ] , bias [ i ] = count [ link . source . index ] / ( count [ link . source . index ] + count [ link . target . index ] ) ;
}
strengths = new Array ( m ) , initializeStrength ( ) ;
distances = new Array ( m ) , initializeDistance ( ) ;
}
function initializeStrength ( ) {
if ( ! nodes ) return ;
for ( var i = 0 , n = links . length ; i < n ; ++ i ) {
strengths [ i ] = + strength ( links [ i ] , i , links ) ;
}
}
function initializeDistance ( ) {
if ( ! nodes ) return ;
for ( var i = 0 , n = links . length ; i < n ; ++ i ) {
distances [ i ] = + distance ( links [ i ] , i , links ) ;
}
}
force . initialize = function ( _ ) {
nodes = _ ;
initialize ( ) ;
} ;
force . links = function ( _ ) {
return arguments . length ? ( links = _ , initialize ( ) , force ) : links ;
} ;
force . id = function ( _ ) {
return arguments . length ? ( id = _ , force ) : id ;
} ;
force . iterations = function ( _ ) {
return arguments . length ? ( iterations = + _ , force ) : iterations ;
} ;
force . strength = function ( _ ) {
return arguments . length ? ( strength = typeof _ === "function" ? _ : constant$6 ( + _ ) , initializeStrength ( ) , force ) : strength ;
} ;
force . distance = function ( _ ) {
return arguments . length ? ( distance = typeof _ === "function" ? _ : constant$6 ( + _ ) , initializeDistance ( ) , force ) : distance ;
} ;
return force ;
} ;
function x$1 ( d ) {
return d . x ;
}
function y$1 ( d ) {
return d . y ;
}
var initialRadius = 10 ;
var initialAngle = Math . PI * ( 3 - Math . sqrt ( 5 ) ) ;
var simulation = function ( nodes ) {
var simulation ,
alpha = 1 ,
alphaMin = 0.001 ,
alphaDecay = 1 - Math . pow ( alphaMin , 1 / 300 ) ,
alphaTarget = 0 ,
velocityDecay = 0.6 ,
forces = map$1 ( ) ,
stepper = timer ( step ) ,
event = dispatch ( "tick" , "end" ) ;
if ( nodes == null ) nodes = [ ] ;
function step ( ) {
tick ( ) ;
event . call ( "tick" , simulation ) ;
if ( alpha < alphaMin ) {
stepper . stop ( ) ;
event . call ( "end" , simulation ) ;
}
}
function tick ( ) {
var i , n = nodes . length ,
node ;
alpha += ( alphaTarget - alpha ) * alphaDecay ;
forces . each ( function ( force ) {
force ( alpha ) ;
} ) ;
for ( i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] ;
if ( node . fx == null ) node . x += node . vx *= velocityDecay ;
else node . x = node . fx , node . vx = 0 ;
if ( node . fy == null ) node . y += node . vy *= velocityDecay ;
else node . y = node . fy , node . vy = 0 ;
}
}
function initializeNodes ( ) {
for ( var i = 0 , n = nodes . length , node ; i < n ; ++ i ) {
node = nodes [ i ] , node . index = i ;
if ( isNaN ( node . x ) || isNaN ( node . y ) ) {
var radius = initialRadius * Math . sqrt ( i ) ,
angle = i * initialAngle ;
node . x = radius * Math . cos ( angle ) ;
node . y = radius * Math . sin ( angle ) ;
}
if ( isNaN ( node . vx ) || isNaN ( node . vy ) ) {
node . vx = node . vy = 0 ;
}
}
}
function initializeForce ( force ) {
if ( force . initialize ) force . initialize ( nodes ) ;
return force ;
}
initializeNodes ( ) ;
return simulation = {
tick : tick ,
restart : function ( ) {
return stepper . restart ( step ) , simulation ;
} ,
stop : function ( ) {
return stepper . stop ( ) , simulation ;
} ,
nodes : function ( _ ) {
return arguments . length ? ( nodes = _ , initializeNodes ( ) , forces . each ( initializeForce ) , simulation ) : nodes ;
} ,
alpha : function ( _ ) {
return arguments . length ? ( alpha = + _ , simulation ) : alpha ;
} ,
alphaMin : function ( _ ) {
return arguments . length ? ( alphaMin = + _ , simulation ) : alphaMin ;
} ,
alphaDecay : function ( _ ) {
return arguments . length ? ( alphaDecay = + _ , simulation ) : + alphaDecay ;
} ,
alphaTarget : function ( _ ) {
return arguments . length ? ( alphaTarget = + _ , simulation ) : alphaTarget ;
} ,
velocityDecay : function ( _ ) {
return arguments . length ? ( velocityDecay = 1 - _ , simulation ) : 1 - velocityDecay ;
} ,
force : function ( name , _ ) {
return arguments . length > 1 ? ( ( _ == null ? forces . remove ( name ) : forces . set ( name , initializeForce ( _ ) ) ) , simulation ) : forces . get ( name ) ;
} ,
find : function ( x , y , radius ) {
var i = 0 ,
n = nodes . length ,
dx ,
dy ,
d2 ,
node ,
closest ;
if ( radius == null ) radius = Infinity ;
else radius *= radius ;
for ( i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] ;
dx = x - node . x ;
dy = y - node . y ;
d2 = dx * dx + dy * dy ;
if ( d2 < radius ) closest = node , radius = d2 ;
}
return closest ;
} ,
on : function ( name , _ ) {
return arguments . length > 1 ? ( event . on ( name , _ ) , simulation ) : event . on ( name ) ;
}
} ;
} ;
var manyBody = function ( ) {
var nodes ,
node ,
alpha ,
strength = constant$6 ( - 30 ) ,
strengths ,
distanceMin2 = 1 ,
distanceMax2 = Infinity ,
theta2 = 0.81 ;
function force ( _ ) {
var i , n = nodes . length ,
tree = quadtree ( nodes , x$1 , y$1 ) . visitAfter ( accumulate ) ;
for ( alpha = _ , i = 0 ; i < n ; ++ i ) node = nodes [ i ] , tree . visit ( apply ) ;
}
function initialize ( ) {
if ( ! nodes ) return ;
var i , n = nodes . length ,
node ;
strengths = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) node = nodes [ i ] , strengths [ node . index ] = + strength ( node , i , nodes ) ;
}
function accumulate ( quad ) {
var strength = 0 ,
q , c , x$$1 , y$$1 , i ;
// For internal nodes, accumulate forces from child quadrants.
if ( quad . length ) {
for ( x$$1 = y$$1 = i = 0 ; i < 4 ; ++ i ) {
if ( ( q = quad [ i ] ) && ( c = q . value ) ) {
strength += c , x$$1 += c * q . x , y$$1 += c * q . y ;
}
}
quad . x = x$$1 / strength ;
quad . y = y$$1 / strength ;
}
// For leaf nodes, accumulate forces from coincident quadrants.
else {
q = quad ;
q . x = q . data . x ;
q . y = q . data . y ;
do strength += strengths [ q . data . index ] ;
while ( q = q . next ) ;
}
quad . value = strength ;
}
function apply ( quad , x1 , _ , x2 ) {
if ( ! quad . value ) return true ;
var x$$1 = quad . x - node . x ,
y$$1 = quad . y - node . y ,
w = x2 - x1 ,
l = x$$1 * x$$1 + y$$1 * y$$1 ;
// Apply the Barnes-Hut approximation if possible.
// Limit forces for very close nodes; randomize direction if coincident.
if ( w * w / theta2 < l ) {
if ( l < distanceMax2 ) {
if ( x$$1 === 0 ) x$$1 = jiggle ( ) , l += x$$1 * x$$1 ;
if ( y$$1 === 0 ) y$$1 = jiggle ( ) , l += y$$1 * y$$1 ;
if ( l < distanceMin2 ) l = Math . sqrt ( distanceMin2 * l ) ;
node . vx += x$$1 * quad . value * alpha / l ;
node . vy += y$$1 * quad . value * alpha / l ;
}
return true ;
}
// Otherwise, process points directly.
else if ( quad . length || l >= distanceMax2 ) return ;
// Limit forces for very close nodes; randomize direction if coincident.
if ( quad . data !== node || quad . next ) {
if ( x$$1 === 0 ) x$$1 = jiggle ( ) , l += x$$1 * x$$1 ;
if ( y$$1 === 0 ) y$$1 = jiggle ( ) , l += y$$1 * y$$1 ;
if ( l < distanceMin2 ) l = Math . sqrt ( distanceMin2 * l ) ;
}
do
if ( quad . data !== node ) {
w = strengths [ quad . data . index ] * alpha / l ;
node . vx += x$$1 * w ;
node . vy += y$$1 * w ;
}
while ( quad = quad . next ) ;
}
force . initialize = function ( _ ) {
nodes = _ ;
initialize ( ) ;
} ;
force . strength = function ( _ ) {
return arguments . length ? ( strength = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : strength ;
} ;
force . distanceMin = function ( _ ) {
return arguments . length ? ( distanceMin2 = _ * _ , force ) : Math . sqrt ( distanceMin2 ) ;
} ;
force . distanceMax = function ( _ ) {
return arguments . length ? ( distanceMax2 = _ * _ , force ) : Math . sqrt ( distanceMax2 ) ;
} ;
force . theta = function ( _ ) {
return arguments . length ? ( theta2 = _ * _ , force ) : Math . sqrt ( theta2 ) ;
} ;
return force ;
} ;
var x$2 = function ( x ) {
var strength = constant$6 ( 0.1 ) ,
nodes ,
strengths ,
xz ;
if ( typeof x !== "function" ) x = constant$6 ( x == null ? 0 : + x ) ;
function force ( alpha ) {
for ( var i = 0 , n = nodes . length , node ; i < n ; ++ i ) {
node = nodes [ i ] , node . vx += ( xz [ i ] - node . x ) * strengths [ i ] * alpha ;
}
}
function initialize ( ) {
if ( ! nodes ) return ;
var i , n = nodes . length ;
strengths = new Array ( n ) ;
xz = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) {
strengths [ i ] = isNaN ( xz [ i ] = + x ( nodes [ i ] , i , nodes ) ) ? 0 : + strength ( nodes [ i ] , i , nodes ) ;
}
}
force . initialize = function ( _ ) {
nodes = _ ;
initialize ( ) ;
} ;
force . strength = function ( _ ) {
return arguments . length ? ( strength = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : strength ;
} ;
force . x = function ( _ ) {
return arguments . length ? ( x = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : x ;
} ;
return force ;
} ;
var y$2 = function ( y ) {
var strength = constant$6 ( 0.1 ) ,
nodes ,
strengths ,
yz ;
if ( typeof y !== "function" ) y = constant$6 ( y == null ? 0 : + y ) ;
function force ( alpha ) {
for ( var i = 0 , n = nodes . length , node ; i < n ; ++ i ) {
node = nodes [ i ] , node . vy += ( yz [ i ] - node . y ) * strengths [ i ] * alpha ;
}
}
function initialize ( ) {
if ( ! nodes ) return ;
var i , n = nodes . length ;
strengths = new Array ( n ) ;
yz = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) {
strengths [ i ] = isNaN ( yz [ i ] = + y ( nodes [ i ] , i , nodes ) ) ? 0 : + strength ( nodes [ i ] , i , nodes ) ;
}
}
force . initialize = function ( _ ) {
nodes = _ ;
initialize ( ) ;
} ;
force . strength = function ( _ ) {
return arguments . length ? ( strength = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : strength ;
} ;
force . y = function ( _ ) {
return arguments . length ? ( y = typeof _ === "function" ? _ : constant$6 ( + _ ) , initialize ( ) , force ) : y ;
} ;
return force ;
} ;
// Computes the decimal coefficient and exponent of the specified number x with
// significant digits p, where x is positive and p is in [1, 21] or undefined.
// For example, formatDecimal(1.23) returns ["123", 0].
var formatDecimal = function ( x , p ) {
if ( ( i = ( x = p ? x . toExponential ( p - 1 ) : x . toExponential ( ) ) . indexOf ( "e" ) ) < 0 ) return null ; // NaN, ±Infinity
var i , coefficient = x . slice ( 0 , i ) ;
// The string returned by toExponential either has the form \d\.\d+e[-+]\d+
// (e.g., 1.2e+3) or the form \de[-+]\d+ (e.g., 1e+3).
return [
coefficient . length > 1 ? coefficient [ 0 ] + coefficient . slice ( 2 ) : coefficient , + x . slice ( i + 1 )
] ;
} ;
var exponent$1 = function ( x ) {
return x = formatDecimal ( Math . abs ( x ) ) , x ? x [ 1 ] : NaN ;
} ;
var formatGroup = function ( grouping , thousands ) {
return function ( value , width ) {
var i = value . length ,
t = [ ] ,
j = 0 ,
g = grouping [ 0 ] ,
length = 0 ;
while ( i > 0 && g > 0 ) {
if ( length + g + 1 > width ) g = Math . max ( 1 , width - length ) ;
t . push ( value . substring ( i -= g , i + g ) ) ;
if ( ( length += g + 1 ) > width ) break ;
g = grouping [ j = ( j + 1 ) % grouping . length ] ;
}
return t . reverse ( ) . join ( thousands ) ;
} ;
} ;
var formatDefault = function ( x , p ) {
x = x . toPrecision ( p ) ;
out : for ( var n = x . length , i = 1 , i0 = - 1 , i1 ; i < n ; ++ i ) {
switch ( x [ i ] ) {
case "." :
i0 = i1 = i ;
break ;
case "0" :
if ( i0 === 0 ) i0 = i ;
i1 = i ;
break ;
case "e" :
break out ;
default :
if ( i0 > 0 ) i0 = 0 ;
break ;
}
}
return i0 > 0 ? x . slice ( 0 , i0 ) + x . slice ( i1 + 1 ) : x ;
} ;
var prefixExponent ;
var formatPrefixAuto = function ( x , p ) {
var d = formatDecimal ( x , p ) ;
if ( ! d ) return x + "" ;
var coefficient = d [ 0 ] ,
exponent = d [ 1 ] ,
i = exponent - ( prefixExponent = Math . max ( - 8 , Math . min ( 8 , Math . floor ( exponent / 3 ) ) ) * 3 ) + 1 ,
n = coefficient . length ;
return i === n ? coefficient :
i > n ? coefficient + new Array ( i - n + 1 ) . join ( "0" ) :
i > 0 ? coefficient . slice ( 0 , i ) + "." + coefficient . slice ( i ) :
"0." + new Array ( 1 - i ) . join ( "0" ) + formatDecimal ( x , Math . max ( 0 , p + i - 1 ) ) [ 0 ] ; // less than 1y!
} ;
var formatRounded = function ( x , p ) {
var d = formatDecimal ( x , p ) ;
if ( ! d ) return x + "" ;
var coefficient = d [ 0 ] ,
exponent = d [ 1 ] ;
return exponent < 0 ? "0." + new Array ( - exponent ) . join ( "0" ) + coefficient :
coefficient . length > exponent + 1 ? coefficient . slice ( 0 , exponent + 1 ) + "." + coefficient . slice ( exponent + 1 ) :
coefficient + new Array ( exponent - coefficient . length + 2 ) . join ( "0" ) ;
} ;
var formatTypes = {
"" : formatDefault ,
"%" : function ( x , p ) { return ( x * 100 ) . toFixed ( p ) ; } ,
"b" : function ( x ) { return Math . round ( x ) . toString ( 2 ) ; } ,
"c" : function ( x ) { return x + "" ; } ,
"d" : function ( x ) { return Math . round ( x ) . toString ( 10 ) ; } ,
"e" : function ( x , p ) { return x . toExponential ( p ) ; } ,
"f" : function ( x , p ) { return x . toFixed ( p ) ; } ,
"g" : function ( x , p ) { return x . toPrecision ( p ) ; } ,
"o" : function ( x ) { return Math . round ( x ) . toString ( 8 ) ; } ,
"p" : function ( x , p ) { return formatRounded ( x * 100 , p ) ; } ,
"r" : formatRounded ,
"s" : formatPrefixAuto ,
"X" : function ( x ) { return Math . round ( x ) . toString ( 16 ) . toUpperCase ( ) ; } ,
"x" : function ( x ) { return Math . round ( x ) . toString ( 16 ) ; }
} ;
// [[fill]align][sign][symbol][0][width][,][.precision][type]
var re = /^(?:(.)?([<>=^]))?([+\-\( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?([a-z%])?$/i ;
var formatSpecifier = function ( specifier ) {
return new FormatSpecifier ( specifier ) ;
} ;
function FormatSpecifier ( specifier ) {
if ( ! ( match = re . exec ( specifier ) ) ) throw new Error ( "invalid format: " + specifier ) ;
var match ,
fill = match [ 1 ] || " " ,
align = match [ 2 ] || ">" ,
sign = match [ 3 ] || "-" ,
symbol = match [ 4 ] || "" ,
zero = ! ! match [ 5 ] ,
width = match [ 6 ] && + match [ 6 ] ,
comma = ! ! match [ 7 ] ,
precision = match [ 8 ] && + match [ 8 ] . slice ( 1 ) ,
type = match [ 9 ] || "" ;
// The "n" type is an alias for ",g".
if ( type === "n" ) comma = true , type = "g" ;
// Map invalid types to the default format.
else if ( ! formatTypes [ type ] ) type = "" ;
// If zero fill is specified, padding goes after sign and before digits.
if ( zero || ( fill === "0" && align === "=" ) ) zero = true , fill = "0" , align = "=" ;
this . fill = fill ;
this . align = align ;
this . sign = sign ;
this . symbol = symbol ;
this . zero = zero ;
this . width = width ;
this . comma = comma ;
this . precision = precision ;
this . type = type ;
}
FormatSpecifier . prototype . toString = function ( ) {
return this . fill +
this . align +
this . sign +
this . symbol +
( this . zero ? "0" : "" ) +
( this . width == null ? "" : Math . max ( 1 , this . width | 0 ) ) +
( this . comma ? "," : "" ) +
( this . precision == null ? "" : "." + Math . max ( 0 , this . precision | 0 ) ) +
this . type ;
} ;
var prefixes = [ "y" , "z" , "a" , "f" , "p" , "n" , "\xB5" , "m" , "" , "k" , "M" , "G" , "T" , "P" , "E" , "Z" , "Y" ] ;
function identity$3 ( x ) {
return x ;
}
var formatLocale = function ( locale ) {
var group = locale . grouping && locale . thousands ? formatGroup ( locale . grouping , locale . thousands ) : identity$3 ,
currency = locale . currency ,
decimal = locale . decimal ;
function newFormat ( specifier ) {
specifier = formatSpecifier ( specifier ) ;
var fill = specifier . fill ,
align = specifier . align ,
sign = specifier . sign ,
symbol = specifier . symbol ,
zero = specifier . zero ,
width = specifier . width ,
comma = specifier . comma ,
precision = specifier . precision ,
type = specifier . type ;
// Compute the prefix and suffix.
// For SI-prefix, the suffix is lazily computed.
var prefix = symbol === "$" ? currency [ 0 ] : symbol === "#" && /[boxX]/ . test ( type ) ? "0" + type . toLowerCase ( ) : "" ,
suffix = symbol === "$" ? currency [ 1 ] : /[%p]/ . test ( type ) ? "%" : "" ;
// What format function should we use?
// Is this an integer type?
// Can this type generate exponential notation?
var formatType = formatTypes [ type ] ,
maybeSuffix = ! type || /[defgprs%]/ . test ( type ) ;
// Set the default precision if not specified,
// or clamp the specified precision to the supported range.
// For significant precision, it must be in [1, 21].
// For fixed precision, it must be in [0, 20].
precision = precision == null ? ( type ? 6 : 12 ) :
/[gprs]/ . test ( type ) ? Math . max ( 1 , Math . min ( 21 , precision ) ) :
Math . max ( 0 , Math . min ( 20 , precision ) ) ;
function format ( value ) {
var valuePrefix = prefix ,
valueSuffix = suffix ,
i , n , c ;
if ( type === "c" ) {
valueSuffix = formatType ( value ) + valueSuffix ;
value = "" ;
} else {
value = + value ;
// Convert negative to positive, and compute the prefix.
// Note that -0 is not less than 0, but 1 / -0 is!
var valueNegative = ( value < 0 || 1 / value < 0 ) && ( value *= - 1 , true ) ;
// Perform the initial formatting.
value = formatType ( value , precision ) ;
// If the original value was negative, it may be rounded to zero during
// formatting; treat this as (positive) zero.
if ( valueNegative ) {
i = - 1 , n = value . length ;
valueNegative = false ;
while ( ++ i < n ) {
if ( c = value . charCodeAt ( i ) , ( 48 < c && c < 58 ) ||
( type === "x" && 96 < c && c < 103 ) ||
( type === "X" && 64 < c && c < 71 ) ) {
valueNegative = true ;
break ;
}
}
}
// Compute the prefix and suffix.
valuePrefix = ( valueNegative ? ( sign === "(" ? sign : "-" ) : sign === "-" || sign === "(" ? "" : sign ) + valuePrefix ;
valueSuffix = valueSuffix + ( type === "s" ? prefixes [ 8 + prefixExponent / 3 ] : "" ) + ( valueNegative && sign === "(" ? ")" : "" ) ;
// Break the formatted value into the integer “value” part that can be
// grouped, and fractional or exponential “suffix” part that is not.
if ( maybeSuffix ) {
i = - 1 , n = value . length ;
while ( ++ i < n ) {
if ( c = value . charCodeAt ( i ) , 48 > c || c > 57 ) {
valueSuffix = ( c === 46 ? decimal + value . slice ( i + 1 ) : value . slice ( i ) ) + valueSuffix ;
value = value . slice ( 0 , i ) ;
break ;
}
}
}
}
// If the fill character is not "0", grouping is applied before padding.
if ( comma && ! zero ) value = group ( value , Infinity ) ;
// Compute the padding.
var length = valuePrefix . length + value . length + valueSuffix . length ,
padding = length < width ? new Array ( width - length + 1 ) . join ( fill ) : "" ;
// If the fill character is "0", grouping is applied after padding.
if ( comma && zero ) value = group ( padding + value , padding . length ? width - valueSuffix . length : Infinity ) , padding = "" ;
// Reconstruct the final output based on the desired alignment.
switch ( align ) {
case "<" :
return valuePrefix + value + valueSuffix + padding ;
case "=" :
return valuePrefix + padding + value + valueSuffix ;
case "^" :
return padding . slice ( 0 , length = padding . length >> 1 ) + valuePrefix + value + valueSuffix + padding . slice ( length ) ;
}
return padding + valuePrefix + value + valueSuffix ;
}
format . toString = function ( ) {
return specifier + "" ;
} ;
return format ;
}
function formatPrefix ( specifier , value ) {
var f = newFormat ( ( specifier = formatSpecifier ( specifier ) , specifier . type = "f" , specifier ) ) ,
e = Math . max ( - 8 , Math . min ( 8 , Math . floor ( exponent$1 ( value ) / 3 ) ) ) * 3 ,
k = Math . pow ( 10 , - e ) ,
prefix = prefixes [ 8 + e / 3 ] ;
return function ( value ) {
return f ( k * value ) + prefix ;
} ;
}
return {
format : newFormat ,
formatPrefix : formatPrefix
} ;
} ;
var locale$1 ;
defaultLocale ( {
decimal : "." ,
thousands : "," ,
grouping : [ 3 ] ,
currency : [ "$" , "" ]
} ) ;
function defaultLocale ( definition ) {
locale$1 = formatLocale ( definition ) ;
exports . format = locale$1 . format ;
exports . formatPrefix = locale$1 . formatPrefix ;
return locale$1 ;
}
var precisionFixed = function ( step ) {
return Math . max ( 0 , - exponent$1 ( Math . abs ( step ) ) ) ;
} ;
var precisionPrefix = function ( step , value ) {
return Math . max ( 0 , Math . max ( - 8 , Math . min ( 8 , Math . floor ( exponent$1 ( value ) / 3 ) ) ) * 3 - exponent$1 ( Math . abs ( step ) ) ) ;
} ;
var precisionRound = function ( step , max ) {
step = Math . abs ( step ) , max = Math . abs ( max ) - step ;
return Math . max ( 0 , exponent$1 ( max ) - exponent$1 ( step ) ) + 1 ;
} ;
// Adds floating point numbers with twice the normal precision.
// Reference: J. R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and
// Fast Robust Geometric Predicates, Discrete & Computational Geometry 18(3)
// 305–
// Code adapted from GeographicLib by Charles F. F. Karney,
// http://geographiclib.sourceforge.net/
var adder = function ( ) {
return new Adder ;
} ;
function Adder ( ) {
this . reset ( ) ;
}
Adder . prototype = {
constructor : Adder ,
reset : function ( ) {
this . s = // rounded value
this . t = 0 ; // exact error
} ,
add : function ( y ) {
add$1 ( temp , y , this . t ) ;
add$1 ( this , temp . s , this . s ) ;
if ( this . s ) this . t += temp . t ;
else this . s = temp . t ;
} ,
valueOf : function ( ) {
return this . s ;
}
} ;
var temp = new Adder ;
function add$1 ( adder , a , b ) {
var x = adder . s = a + b ,
bv = x - a ,
av = x - bv ;
adder . t = ( a - av ) + ( b - bv ) ;
}
var epsilon$2 = 1e-6 ;
var epsilon2$1 = 1e-12 ;
var pi$3 = Math . PI ;
var halfPi$2 = pi$3 / 2 ;
var quarterPi = pi$3 / 4 ;
var tau$3 = pi$3 * 2 ;
var degrees$1 = 180 / pi$3 ;
var radians = pi$3 / 180 ;
var abs = Math . abs ;
var atan = Math . atan ;
var atan2 = Math . atan2 ;
var cos$1 = Math . cos ;
var ceil = Math . ceil ;
var exp = Math . exp ;
var log = Math . log ;
var pow = Math . pow ;
var sin$1 = Math . sin ;
var sign = Math . sign || function ( x ) { return x > 0 ? 1 : x < 0 ? - 1 : 0 ; } ;
var sqrt = Math . sqrt ;
var tan = Math . tan ;
function acos ( x ) {
return x > 1 ? 0 : x < - 1 ? pi$3 : Math . acos ( x ) ;
}
function asin ( x ) {
return x > 1 ? halfPi$2 : x < - 1 ? - halfPi$2 : Math . asin ( x ) ;
}
function haversin ( x ) {
return ( x = sin$1 ( x / 2 ) ) * x ;
}
function noop$1 ( ) { }
function streamGeometry ( geometry , stream ) {
if ( geometry && streamGeometryType . hasOwnProperty ( geometry . type ) ) {
streamGeometryType [ geometry . type ] ( geometry , stream ) ;
}
}
var streamObjectType = {
Feature : function ( feature , stream ) {
streamGeometry ( feature . geometry , stream ) ;
} ,
FeatureCollection : function ( object , stream ) {
var features = object . features ,
i = - 1 ,
n = features . length ;
while ( ++ i < n ) streamGeometry ( features [ i ] . geometry , stream ) ;
}
} ;
var streamGeometryType = {
Sphere : function ( object , stream ) {
stream . sphere ( ) ;
} ,
Point : function ( object , stream ) {
object = object . coordinates ;
stream . point ( object [ 0 ] , object [ 1 ] , object [ 2 ] ) ;
} ,
MultiPoint : function ( object , stream ) {
var coordinates = object . coordinates ,
i = - 1 ,
n = coordinates . length ;
while ( ++ i < n ) object = coordinates [ i ] , stream . point ( object [ 0 ] , object [ 1 ] , object [ 2 ] ) ;
} ,
LineString : function ( object , stream ) {
streamLine ( object . coordinates , stream , 0 ) ;
} ,
MultiLineString : function ( object , stream ) {
var coordinates = object . coordinates ,
i = - 1 ,
n = coordinates . length ;
while ( ++ i < n ) streamLine ( coordinates [ i ] , stream , 0 ) ;
} ,
Polygon : function ( object , stream ) {
streamPolygon ( object . coordinates , stream ) ;
} ,
MultiPolygon : function ( object , stream ) {
var coordinates = object . coordinates ,
i = - 1 ,
n = coordinates . length ;
while ( ++ i < n ) streamPolygon ( coordinates [ i ] , stream ) ;
} ,
GeometryCollection : function ( object , stream ) {
var geometries = object . geometries ,
i = - 1 ,
n = geometries . length ;
while ( ++ i < n ) streamGeometry ( geometries [ i ] , stream ) ;
}
} ;
function streamLine ( coordinates , stream , closed ) {
var i = - 1 ,
n = coordinates . length - closed ,
coordinate ;
stream . lineStart ( ) ;
while ( ++ i < n ) coordinate = coordinates [ i ] , stream . point ( coordinate [ 0 ] , coordinate [ 1 ] , coordinate [ 2 ] ) ;
stream . lineEnd ( ) ;
}
function streamPolygon ( coordinates , stream ) {
var i = - 1 ,
n = coordinates . length ;
stream . polygonStart ( ) ;
while ( ++ i < n ) streamLine ( coordinates [ i ] , stream , 1 ) ;
stream . polygonEnd ( ) ;
}
var geoStream = function ( object , stream ) {
if ( object && streamObjectType . hasOwnProperty ( object . type ) ) {
streamObjectType [ object . type ] ( object , stream ) ;
} else {
streamGeometry ( object , stream ) ;
}
} ;
var areaRingSum = adder ( ) ;
var areaSum = adder ( ) ;
var lambda00 ;
var phi00 ;
var lambda0 ;
var cosPhi0 ;
var sinPhi0 ;
var areaStream = {
point : noop$1 ,
lineStart : noop$1 ,
lineEnd : noop$1 ,
polygonStart : function ( ) {
areaRingSum . reset ( ) ;
areaStream . lineStart = areaRingStart ;
areaStream . lineEnd = areaRingEnd ;
} ,
polygonEnd : function ( ) {
var areaRing = + areaRingSum ;
areaSum . add ( areaRing < 0 ? tau$3 + areaRing : areaRing ) ;
this . lineStart = this . lineEnd = this . point = noop$1 ;
} ,
sphere : function ( ) {
areaSum . add ( tau$3 ) ;
}
} ;
function areaRingStart ( ) {
areaStream . point = areaPointFirst ;
}
function areaRingEnd ( ) {
areaPoint ( lambda00 , phi00 ) ;
}
function areaPointFirst ( lambda , phi ) {
areaStream . point = areaPoint ;
lambda00 = lambda , phi00 = phi ;
lambda *= radians , phi *= radians ;
lambda0 = lambda , cosPhi0 = cos$1 ( phi = phi / 2 + quarterPi ) , sinPhi0 = sin$1 ( phi ) ;
}
function areaPoint ( lambda , phi ) {
lambda *= radians , phi *= radians ;
phi = phi / 2 + quarterPi ; // half the angular distance from south pole
// Spherical excess E for a spherical triangle with vertices: south pole,
// previous point, current point. Uses a formula derived from Cagnoli’
// theorem. See Todhunter, Spherical Trig. (1871), Sec. 103, Eq. (2).
var dLambda = lambda - lambda0 ,
sdLambda = dLambda >= 0 ? 1 : - 1 ,
adLambda = sdLambda * dLambda ,
cosPhi = cos$1 ( phi ) ,
sinPhi = sin$1 ( phi ) ,
k = sinPhi0 * sinPhi ,
u = cosPhi0 * cosPhi + k * cos$1 ( adLambda ) ,
v = k * sdLambda * sin$1 ( adLambda ) ;
areaRingSum . add ( atan2 ( v , u ) ) ;
// Advance the previous points.
lambda0 = lambda , cosPhi0 = cosPhi , sinPhi0 = sinPhi ;
}
var area = function ( object ) {
areaSum . reset ( ) ;
geoStream ( object , areaStream ) ;
return areaSum * 2 ;
} ;
function spherical ( cartesian ) {
return [ atan2 ( cartesian [ 1 ] , cartesian [ 0 ] ) , asin ( cartesian [ 2 ] ) ] ;
}
function cartesian ( spherical ) {
var lambda = spherical [ 0 ] ,
phi = spherical [ 1 ] ,
cosPhi = cos$1 ( phi ) ;
return [ cosPhi * cos$1 ( lambda ) , cosPhi * sin$1 ( lambda ) , sin$1 ( phi ) ] ;
}
function cartesianDot ( a , b ) {
return a [ 0 ] * b [ 0 ] + a [ 1 ] * b [ 1 ] + a [ 2 ] * b [ 2 ] ;
}
function cartesianCross ( a , b ) {
return [ a [ 1 ] * b [ 2 ] - a [ 2 ] * b [ 1 ] , a [ 2 ] * b [ 0 ] - a [ 0 ] * b [ 2 ] , a [ 0 ] * b [ 1 ] - a [ 1 ] * b [ 0 ] ] ;
}
// TODO return a
function cartesianAddInPlace ( a , b ) {
a [ 0 ] += b [ 0 ] , a [ 1 ] += b [ 1 ] , a [ 2 ] += b [ 2 ] ;
}
function cartesianScale ( vector , k ) {
return [ vector [ 0 ] * k , vector [ 1 ] * k , vector [ 2 ] * k ] ;
}
// TODO return d
function cartesianNormalizeInPlace ( d ) {
var l = sqrt ( d [ 0 ] * d [ 0 ] + d [ 1 ] * d [ 1 ] + d [ 2 ] * d [ 2 ] ) ;
d [ 0 ] /= l , d [ 1 ] /= l , d [ 2 ] /= l ;
}
var lambda0$1 ;
var phi0 ;
var lambda1 ;
var phi1 ;
var lambda2 ;
var lambda00$1 ;
var phi00$1 ;
var p0 ;
var deltaSum = adder ( ) ;
var ranges ;
var range ;
var boundsStream = {
point : boundsPoint ,
lineStart : boundsLineStart ,
lineEnd : boundsLineEnd ,
polygonStart : function ( ) {
boundsStream . point = boundsRingPoint ;
boundsStream . lineStart = boundsRingStart ;
boundsStream . lineEnd = boundsRingEnd ;
deltaSum . reset ( ) ;
areaStream . polygonStart ( ) ;
} ,
polygonEnd : function ( ) {
areaStream . polygonEnd ( ) ;
boundsStream . point = boundsPoint ;
boundsStream . lineStart = boundsLineStart ;
boundsStream . lineEnd = boundsLineEnd ;
if ( areaRingSum < 0 ) lambda0$1 = - ( lambda1 = 180 ) , phi0 = - ( phi1 = 90 ) ;
else if ( deltaSum > epsilon$2 ) phi1 = 90 ;
else if ( deltaSum < - epsilon$2 ) phi0 = - 90 ;
range [ 0 ] = lambda0$1 , range [ 1 ] = lambda1 ;
}
} ;
function boundsPoint ( lambda , phi ) {
ranges . push ( range = [ lambda0$1 = lambda , lambda1 = lambda ] ) ;
if ( phi < phi0 ) phi0 = phi ;
if ( phi > phi1 ) phi1 = phi ;
}
function linePoint ( lambda , phi ) {
var p = cartesian ( [ lambda * radians , phi * radians ] ) ;
if ( p0 ) {
var normal = cartesianCross ( p0 , p ) ,
equatorial = [ normal [ 1 ] , - normal [ 0 ] , 0 ] ,
inflection = cartesianCross ( equatorial , normal ) ;
cartesianNormalizeInPlace ( inflection ) ;
inflection = spherical ( inflection ) ;
var delta = lambda - lambda2 ,
sign$$1 = delta > 0 ? 1 : - 1 ,
lambdai = inflection [ 0 ] * degrees$1 * sign$$1 ,
phii ,
antimeridian = abs ( delta ) > 180 ;
if ( antimeridian ^ ( sign$$1 * lambda2 < lambdai && lambdai < sign$$1 * lambda ) ) {
phii = inflection [ 1 ] * degrees$1 ;
if ( phii > phi1 ) phi1 = phii ;
} else if ( lambdai = ( lambdai + 360 ) % 360 - 180 , antimeridian ^ ( sign$$1 * lambda2 < lambdai && lambdai < sign$$1 * lambda ) ) {
phii = - inflection [ 1 ] * degrees$1 ;
if ( phii < phi0 ) phi0 = phii ;
} else {
if ( phi < phi0 ) phi0 = phi ;
if ( phi > phi1 ) phi1 = phi ;
}
if ( antimeridian ) {
if ( lambda < lambda2 ) {
if ( angle ( lambda0$1 , lambda ) > angle ( lambda0$1 , lambda1 ) ) lambda1 = lambda ;
} else {
if ( angle ( lambda , lambda1 ) > angle ( lambda0$1 , lambda1 ) ) lambda0$1 = lambda ;
}
} else {
if ( lambda1 >= lambda0$1 ) {
if ( lambda < lambda0$1 ) lambda0$1 = lambda ;
if ( lambda > lambda1 ) lambda1 = lambda ;
} else {
if ( lambda > lambda2 ) {
if ( angle ( lambda0$1 , lambda ) > angle ( lambda0$1 , lambda1 ) ) lambda1 = lambda ;
} else {
if ( angle ( lambda , lambda1 ) > angle ( lambda0$1 , lambda1 ) ) lambda0$1 = lambda ;
}
}
}
} else {
boundsPoint ( lambda , phi ) ;
}
p0 = p , lambda2 = lambda ;
}
function boundsLineStart ( ) {
boundsStream . point = linePoint ;
}
function boundsLineEnd ( ) {
range [ 0 ] = lambda0$1 , range [ 1 ] = lambda1 ;
boundsStream . point = boundsPoint ;
p0 = null ;
}
function boundsRingPoint ( lambda , phi ) {
if ( p0 ) {
var delta = lambda - lambda2 ;
deltaSum . add ( abs ( delta ) > 180 ? delta + ( delta > 0 ? 360 : - 360 ) : delta ) ;
} else {
lambda00$1 = lambda , phi00$1 = phi ;
}
areaStream . point ( lambda , phi ) ;
linePoint ( lambda , phi ) ;
}
function boundsRingStart ( ) {
areaStream . lineStart ( ) ;
}
function boundsRingEnd ( ) {
boundsRingPoint ( lambda00$1 , phi00$1 ) ;
areaStream . lineEnd ( ) ;
if ( abs ( deltaSum ) > epsilon$2 ) lambda0$1 = - ( lambda1 = 180 ) ;
range [ 0 ] = lambda0$1 , range [ 1 ] = lambda1 ;
p0 = null ;
}
// Finds the left-right distance between two longitudes.
// This is almost the same as (lambda1 - lambda0 + 360°) % 360°, except that we want
// the distance between ±180° to be 360°.
function angle ( lambda0 , lambda1 ) {
return ( lambda1 -= lambda0 ) < 0 ? lambda1 + 360 : lambda1 ;
}
function rangeCompare ( a , b ) {
return a [ 0 ] - b [ 0 ] ;
}
function rangeContains ( range , x ) {
return range [ 0 ] <= range [ 1 ] ? range [ 0 ] <= x && x <= range [ 1 ] : x < range [ 0 ] || range [ 1 ] < x ;
}
var bounds = function ( feature ) {
var i , n , a , b , merged , deltaMax , delta ;
phi1 = lambda1 = - ( lambda0$1 = phi0 = Infinity ) ;
ranges = [ ] ;
geoStream ( feature , boundsStream ) ;
// First, sort ranges by their minimum longitudes.
if ( n = ranges . length ) {
ranges . sort ( rangeCompare ) ;
// Then, merge any ranges that overlap.
for ( i = 1 , a = ranges [ 0 ] , merged = [ a ] ; i < n ; ++ i ) {
b = ranges [ i ] ;
if ( rangeContains ( a , b [ 0 ] ) || rangeContains ( a , b [ 1 ] ) ) {
if ( angle ( a [ 0 ] , b [ 1 ] ) > angle ( a [ 0 ] , a [ 1 ] ) ) a [ 1 ] = b [ 1 ] ;
if ( angle ( b [ 0 ] , a [ 1 ] ) > angle ( a [ 0 ] , a [ 1 ] ) ) a [ 0 ] = b [ 0 ] ;
} else {
merged . push ( a = b ) ;
}
}
// Finally, find the largest gap between the merged ranges.
// The final bounding box will be the inverse of this gap.
for ( deltaMax = - Infinity , n = merged . length - 1 , i = 0 , a = merged [ n ] ; i <= n ; a = b , ++ i ) {
b = merged [ i ] ;
if ( ( delta = angle ( a [ 1 ] , b [ 0 ] ) ) > deltaMax ) deltaMax = delta , lambda0$1 = b [ 0 ] , lambda1 = a [ 1 ] ;
}
}
ranges = range = null ;
return lambda0$1 === Infinity || phi0 === Infinity ? [
[ NaN , NaN ] ,
[ NaN , NaN ]
] : [
[ lambda0$1 , phi0 ] ,
[ lambda1 , phi1 ]
] ;
} ;
var W0 ;
var W1 ;
var X0 ;
var Y0 ;
var Z0 ;
var X1 ;
var Y1 ;
var Z1 ;
var X2 ;
var Y2 ;
var Z2 ;
var lambda00$2 ;
var phi00$2 ;
var x0 ;
var y0 ;
var z0 ; // previous point
var centroidStream = {
sphere : noop$1 ,
point : centroidPoint ,
lineStart : centroidLineStart ,
lineEnd : centroidLineEnd ,
polygonStart : function ( ) {
centroidStream . lineStart = centroidRingStart ;
centroidStream . lineEnd = centroidRingEnd ;
} ,
polygonEnd : function ( ) {
centroidStream . lineStart = centroidLineStart ;
centroidStream . lineEnd = centroidLineEnd ;
}
} ;
// Arithmetic mean of Cartesian vectors.
function centroidPoint ( lambda , phi ) {
lambda *= radians , phi *= radians ;
var cosPhi = cos$1 ( phi ) ;
centroidPointCartesian ( cosPhi * cos$1 ( lambda ) , cosPhi * sin$1 ( lambda ) , sin$1 ( phi ) ) ;
}
function centroidPointCartesian ( x , y , z ) {
++ W0 ;
X0 += ( x - X0 ) / W0 ;
Y0 += ( y - Y0 ) / W0 ;
Z0 += ( z - Z0 ) / W0 ;
}
function centroidLineStart ( ) {
centroidStream . point = centroidLinePointFirst ;
}
function centroidLinePointFirst ( lambda , phi ) {
lambda *= radians , phi *= radians ;
var cosPhi = cos$1 ( phi ) ;
x0 = cosPhi * cos$1 ( lambda ) ;
y0 = cosPhi * sin$1 ( lambda ) ;
z0 = sin$1 ( phi ) ;
centroidStream . point = centroidLinePoint ;
centroidPointCartesian ( x0 , y0 , z0 ) ;
}
function centroidLinePoint ( lambda , phi ) {
lambda *= radians , phi *= radians ;
var cosPhi = cos$1 ( phi ) ,
x = cosPhi * cos$1 ( lambda ) ,
y = cosPhi * sin$1 ( lambda ) ,
z = sin$1 ( phi ) ,
w = atan2 ( sqrt ( ( w = y0 * z - z0 * y ) * w + ( w = z0 * x - x0 * z ) * w + ( w = x0 * y - y0 * x ) * w ) , x0 * x + y0 * y + z0 * z ) ;
W1 += w ;
X1 += w * ( x0 + ( x0 = x ) ) ;
Y1 += w * ( y0 + ( y0 = y ) ) ;
Z1 += w * ( z0 + ( z0 = z ) ) ;
centroidPointCartesian ( x0 , y0 , z0 ) ;
}
function centroidLineEnd ( ) {
centroidStream . point = centroidPoint ;
}
// See J. E. Brock, The Inertia Tensor for a Spherical Triangle,
// J. Applied Mechanics 42, 239 (1975).
function centroidRingStart ( ) {
centroidStream . point = centroidRingPointFirst ;
}
function centroidRingEnd ( ) {
centroidRingPoint ( lambda00$2 , phi00$2 ) ;
centroidStream . point = centroidPoint ;
}
function centroidRingPointFirst ( lambda , phi ) {
lambda00$2 = lambda , phi00$2 = phi ;
lambda *= radians , phi *= radians ;
centroidStream . point = centroidRingPoint ;
var cosPhi = cos$1 ( phi ) ;
x0 = cosPhi * cos$1 ( lambda ) ;
y0 = cosPhi * sin$1 ( lambda ) ;
z0 = sin$1 ( phi ) ;
centroidPointCartesian ( x0 , y0 , z0 ) ;
}
function centroidRingPoint ( lambda , phi ) {
lambda *= radians , phi *= radians ;
var cosPhi = cos$1 ( phi ) ,
x = cosPhi * cos$1 ( lambda ) ,
y = cosPhi * sin$1 ( lambda ) ,
z = sin$1 ( phi ) ,
cx = y0 * z - z0 * y ,
cy = z0 * x - x0 * z ,
cz = x0 * y - y0 * x ,
m = sqrt ( cx * cx + cy * cy + cz * cz ) ,
u = x0 * x + y0 * y + z0 * z ,
v = m && - acos ( u ) / m , // area weight
w = atan2 ( m , u ) ; // line weight
X2 += v * cx ;
Y2 += v * cy ;
Z2 += v * cz ;
W1 += w ;
X1 += w * ( x0 + ( x0 = x ) ) ;
Y1 += w * ( y0 + ( y0 = y ) ) ;
Z1 += w * ( z0 + ( z0 = z ) ) ;
centroidPointCartesian ( x0 , y0 , z0 ) ;
}
var centroid = function ( object ) {
W0 = W1 =
X0 = Y0 = Z0 =
X1 = Y1 = Z1 =
X2 = Y2 = Z2 = 0 ;
geoStream ( object , centroidStream ) ;
var x = X2 ,
y = Y2 ,
z = Z2 ,
m = x * x + y * y + z * z ;
// If the area-weighted ccentroid is undefined, fall back to length-weighted ccentroid.
if ( m < epsilon2$1 ) {
x = X1 , y = Y1 , z = Z1 ;
// If the feature has zero length, fall back to arithmetic mean of point vectors.
if ( W1 < epsilon$2 ) x = X0 , y = Y0 , z = Z0 ;
m = x * x + y * y + z * z ;
// If the feature still has an undefined ccentroid, then return.
if ( m < epsilon2$1 ) return [ NaN , NaN ] ;
}
return [ atan2 ( y , x ) * degrees$1 , asin ( z / sqrt ( m ) ) * degrees$1 ] ;
} ;
var constant$7 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var compose = function ( a , b ) {
function compose ( x , y ) {
return x = a ( x , y ) , b ( x [ 0 ] , x [ 1 ] ) ;
}
if ( a . invert && b . invert ) compose . invert = function ( x , y ) {
return x = b . invert ( x , y ) , x && a . invert ( x [ 0 ] , x [ 1 ] ) ;
} ;
return compose ;
} ;
function rotationIdentity ( lambda , phi ) {
return [ lambda > pi$3 ? lambda - tau$3 : lambda < - pi$3 ? lambda + tau$3 : lambda , phi ] ;
}
rotationIdentity . invert = rotationIdentity ;
function rotateRadians ( deltaLambda , deltaPhi , deltaGamma ) {
return ( deltaLambda %= tau$3 ) ? ( deltaPhi || deltaGamma ? compose ( rotationLambda ( deltaLambda ) , rotationPhiGamma ( deltaPhi , deltaGamma ) ) :
rotationLambda ( deltaLambda ) ) :
( deltaPhi || deltaGamma ? rotationPhiGamma ( deltaPhi , deltaGamma ) :
rotationIdentity ) ;
}
function forwardRotationLambda ( deltaLambda ) {
return function ( lambda , phi ) {
return lambda += deltaLambda , [ lambda > pi$3 ? lambda - tau$3 : lambda < - pi$3 ? lambda + tau$3 : lambda , phi ] ;
} ;
}
function rotationLambda ( deltaLambda ) {
var rotation = forwardRotationLambda ( deltaLambda ) ;
rotation . invert = forwardRotationLambda ( - deltaLambda ) ;
return rotation ;
}
function rotationPhiGamma ( deltaPhi , deltaGamma ) {
var cosDeltaPhi = cos$1 ( deltaPhi ) ,
sinDeltaPhi = sin$1 ( deltaPhi ) ,
cosDeltaGamma = cos$1 ( deltaGamma ) ,
sinDeltaGamma = sin$1 ( deltaGamma ) ;
function rotation ( lambda , phi ) {
var cosPhi = cos$1 ( phi ) ,
x = cos$1 ( lambda ) * cosPhi ,
y = sin$1 ( lambda ) * cosPhi ,
z = sin$1 ( phi ) ,
k = z * cosDeltaPhi + x * sinDeltaPhi ;
return [
atan2 ( y * cosDeltaGamma - k * sinDeltaGamma , x * cosDeltaPhi - z * sinDeltaPhi ) ,
asin ( k * cosDeltaGamma + y * sinDeltaGamma )
] ;
}
rotation . invert = function ( lambda , phi ) {
var cosPhi = cos$1 ( phi ) ,
x = cos$1 ( lambda ) * cosPhi ,
y = sin$1 ( lambda ) * cosPhi ,
z = sin$1 ( phi ) ,
k = z * cosDeltaGamma - y * sinDeltaGamma ;
return [
atan2 ( y * cosDeltaGamma + z * sinDeltaGamma , x * cosDeltaPhi + k * sinDeltaPhi ) ,
asin ( k * cosDeltaPhi - x * sinDeltaPhi )
] ;
} ;
return rotation ;
}
var rotation = function ( rotate ) {
rotate = rotateRadians ( rotate [ 0 ] * radians , rotate [ 1 ] * radians , rotate . length > 2 ? rotate [ 2 ] * radians : 0 ) ;
function forward ( coordinates ) {
coordinates = rotate ( coordinates [ 0 ] * radians , coordinates [ 1 ] * radians ) ;
return coordinates [ 0 ] *= degrees$1 , coordinates [ 1 ] *= degrees$1 , coordinates ;
}
forward . invert = function ( coordinates ) {
coordinates = rotate . invert ( coordinates [ 0 ] * radians , coordinates [ 1 ] * radians ) ;
return coordinates [ 0 ] *= degrees$1 , coordinates [ 1 ] *= degrees$1 , coordinates ;
} ;
return forward ;
} ;
// Generates a circle centered at [0°, 0°], with a given radius and precision.
function circleStream ( stream , radius , delta , direction , t0 , t1 ) {
if ( ! delta ) return ;
var cosRadius = cos$1 ( radius ) ,
sinRadius = sin$1 ( radius ) ,
step = direction * delta ;
if ( t0 == null ) {
t0 = radius + direction * tau$3 ;
t1 = radius - step / 2 ;
} else {
t0 = circleRadius ( cosRadius , t0 ) ;
t1 = circleRadius ( cosRadius , t1 ) ;
if ( direction > 0 ? t0 < t1 : t0 > t1 ) t0 += direction * tau$3 ;
}
for ( var point , t = t0 ; direction > 0 ? t > t1 : t < t1 ; t -= step ) {
point = spherical ( [ cosRadius , - sinRadius * cos$1 ( t ) , - sinRadius * sin$1 ( t ) ] ) ;
stream . point ( point [ 0 ] , point [ 1 ] ) ;
}
}
// Returns the signed angle of a cartesian point relative to [cosRadius, 0, 0].
function circleRadius ( cosRadius , point ) {
point = cartesian ( point ) , point [ 0 ] -= cosRadius ;
cartesianNormalizeInPlace ( point ) ;
var radius = acos ( - point [ 1 ] ) ;
return ( ( - point [ 2 ] < 0 ? - radius : radius ) + tau$3 - epsilon$2 ) % tau$3 ;
}
var circle = function ( ) {
var center = constant$7 ( [ 0 , 0 ] ) ,
radius = constant$7 ( 90 ) ,
precision = constant$7 ( 6 ) ,
ring ,
rotate ,
stream = { point : point } ;
function point ( x , y ) {
ring . push ( x = rotate ( x , y ) ) ;
x [ 0 ] *= degrees$1 , x [ 1 ] *= degrees$1 ;
}
function circle ( ) {
var c = center . apply ( this , arguments ) ,
r = radius . apply ( this , arguments ) * radians ,
p = precision . apply ( this , arguments ) * radians ;
ring = [ ] ;
rotate = rotateRadians ( - c [ 0 ] * radians , - c [ 1 ] * radians , 0 ) . invert ;
circleStream ( stream , r , p , 1 ) ;
c = { type : "Polygon" , coordinates : [ ring ] } ;
ring = rotate = null ;
return c ;
}
circle . center = function ( _ ) {
return arguments . length ? ( center = typeof _ === "function" ? _ : constant$7 ( [ + _ [ 0 ] , + _ [ 1 ] ] ) , circle ) : center ;
} ;
circle . radius = function ( _ ) {
return arguments . length ? ( radius = typeof _ === "function" ? _ : constant$7 ( + _ ) , circle ) : radius ;
} ;
circle . precision = function ( _ ) {
return arguments . length ? ( precision = typeof _ === "function" ? _ : constant$7 ( + _ ) , circle ) : precision ;
} ;
return circle ;
} ;
var clipBuffer = function ( ) {
var lines = [ ] ,
line ;
return {
point : function ( x , y ) {
line . push ( [ x , y ] ) ;
} ,
lineStart : function ( ) {
lines . push ( line = [ ] ) ;
} ,
lineEnd : noop$1 ,
rejoin : function ( ) {
if ( lines . length > 1 ) lines . push ( lines . pop ( ) . concat ( lines . shift ( ) ) ) ;
} ,
result : function ( ) {
var result = lines ;
lines = [ ] ;
line = null ;
return result ;
}
} ;
} ;
var clipLine = function ( a , b , x0 , y0 , x1 , y1 ) {
var ax = a [ 0 ] ,
ay = a [ 1 ] ,
bx = b [ 0 ] ,
by = b [ 1 ] ,
t0 = 0 ,
t1 = 1 ,
dx = bx - ax ,
dy = by - ay ,
r ;
r = x0 - ax ;
if ( ! dx && r > 0 ) return ;
r /= dx ;
if ( dx < 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
} else if ( dx > 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
}
r = x1 - ax ;
if ( ! dx && r < 0 ) return ;
r /= dx ;
if ( dx < 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
} else if ( dx > 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
}
r = y0 - ay ;
if ( ! dy && r > 0 ) return ;
r /= dy ;
if ( dy < 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
} else if ( dy > 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
}
r = y1 - ay ;
if ( ! dy && r < 0 ) return ;
r /= dy ;
if ( dy < 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
} else if ( dy > 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
}
if ( t0 > 0 ) a [ 0 ] = ax + t0 * dx , a [ 1 ] = ay + t0 * dy ;
if ( t1 < 1 ) b [ 0 ] = ax + t1 * dx , b [ 1 ] = ay + t1 * dy ;
return true ;
} ;
var pointEqual = function ( a , b ) {
return abs ( a [ 0 ] - b [ 0 ] ) < epsilon$2 && abs ( a [ 1 ] - b [ 1 ] ) < epsilon$2 ;
} ;
function Intersection ( point , points , other , entry ) {
this . x = point ;
this . z = points ;
this . o = other ; // another intersection
this . e = entry ; // is an entry?
this . v = false ; // visited
this . n = this . p = null ; // next & previous
}
// A generalized polygon clipping algorithm: given a polygon that has been cut
// into its visible line segments, and rejoins the segments by interpolating
// along the clip edge.
var clipPolygon = function ( segments , compareIntersection , startInside , interpolate , stream ) {
var subject = [ ] ,
clip = [ ] ,
i ,
n ;
segments . forEach ( function ( segment ) {
if ( ( n = segment . length - 1 ) <= 0 ) return ;
var n , p0 = segment [ 0 ] ,
p1 = segment [ n ] ,
x ;
// If the first and last points of a segment are coincident, then treat as a
// closed ring. TODO if all rings are closed, then the winding order of the
// exterior ring should be checked.
if ( pointEqual ( p0 , p1 ) ) {
stream . lineStart ( ) ;
for ( i = 0 ; i < n ; ++ i ) stream . point ( ( p0 = segment [ i ] ) [ 0 ] , p0 [ 1 ] ) ;
stream . lineEnd ( ) ;
return ;
}
subject . push ( x = new Intersection ( p0 , segment , null , true ) ) ;
clip . push ( x . o = new Intersection ( p0 , null , x , false ) ) ;
subject . push ( x = new Intersection ( p1 , segment , null , false ) ) ;
clip . push ( x . o = new Intersection ( p1 , null , x , true ) ) ;
} ) ;
if ( ! subject . length ) return ;
clip . sort ( compareIntersection ) ;
link$1 ( subject ) ;
link$1 ( clip ) ;
for ( i = 0 , n = clip . length ; i < n ; ++ i ) {
clip [ i ] . e = startInside = ! startInside ;
}
var start = subject [ 0 ] ,
points ,
point ;
while ( 1 ) {
// Find first unvisited intersection.
var current = start ,
isSubject = true ;
while ( current . v )
if ( ( current = current . n ) === start ) return ;
points = current . z ;
stream . lineStart ( ) ;
do {
current . v = current . o . v = true ;
if ( current . e ) {
if ( isSubject ) {
for ( i = 0 , n = points . length ; i < n ; ++ i ) stream . point ( ( point = points [ i ] ) [ 0 ] , point [ 1 ] ) ;
} else {
interpolate ( current . x , current . n . x , 1 , stream ) ;
}
current = current . n ;
} else {
if ( isSubject ) {
points = current . p . z ;
for ( i = points . length - 1 ; i >= 0 ; -- i ) stream . point ( ( point = points [ i ] ) [ 0 ] , point [ 1 ] ) ;
} else {
interpolate ( current . x , current . p . x , - 1 , stream ) ;
}
current = current . p ;
}
current = current . o ;
points = current . z ;
isSubject = ! isSubject ;
} while ( ! current . v ) ;
stream . lineEnd ( ) ;
}
} ;
function link$1 ( array ) {
if ( ! ( n = array . length ) ) return ;
var n ,
i = 0 ,
a = array [ 0 ] ,
b ;
while ( ++ i < n ) {
a . n = b = array [ i ] ;
b . p = a ;
a = b ;
}
a . n = b = array [ 0 ] ;
b . p = a ;
}
var clipMax = 1e9 ;
var clipMin = - clipMax ;
// TODO Use d3-polygon’
// TODO Eliminate duplicate buffering in clipBuffer and polygon.push?
function clipExtent ( x0 , y0 , x1 , y1 ) {
function visible ( x , y ) {
return x0 <= x && x <= x1 && y0 <= y && y <= y1 ;
}
function interpolate ( from , to , direction , stream ) {
var a = 0 ,
a1 = 0 ;
if ( from == null ||
( a = corner ( from , direction ) ) !== ( a1 = corner ( to , direction ) ) ||
comparePoint ( from , to ) < 0 ^ direction > 0 ) {
do stream . point ( a === 0 || a === 3 ? x0 : x1 , a > 1 ? y1 : y0 ) ;
while ( ( a = ( a + direction + 4 ) % 4 ) !== a1 ) ;
} else {
stream . point ( to [ 0 ] , to [ 1 ] ) ;
}
}
function corner ( p , direction ) {
return abs ( p [ 0 ] - x0 ) < epsilon$2 ? direction > 0 ? 0 : 3 :
abs ( p [ 0 ] - x1 ) < epsilon$2 ? direction > 0 ? 2 : 1 :
abs ( p [ 1 ] - y0 ) < epsilon$2 ? direction > 0 ? 1 : 0 :
direction > 0 ? 3 : 2 ; // abs(p[1] - y1) < epsilon
}
function compareIntersection ( a , b ) {
return comparePoint ( a . x , b . x ) ;
}
function comparePoint ( a , b ) {
var ca = corner ( a , 1 ) ,
cb = corner ( b , 1 ) ;
return ca !== cb ? ca - cb :
ca === 0 ? b [ 1 ] - a [ 1 ] :
ca === 1 ? a [ 0 ] - b [ 0 ] :
ca === 2 ? a [ 1 ] - b [ 1 ] :
b [ 0 ] - a [ 0 ] ;
}
return function ( stream ) {
var activeStream = stream ,
bufferStream = clipBuffer ( ) ,
segments ,
polygon ,
ring ,
x _ _ , y _ _ , v _ _ , // first point
x _ , y _ , v _ , // previous point
first ,
clean ;
var clipStream = {
point : point ,
lineStart : lineStart ,
lineEnd : lineEnd ,
polygonStart : polygonStart ,
polygonEnd : polygonEnd
} ;
function point ( x , y ) {
if ( visible ( x , y ) ) activeStream . point ( x , y ) ;
}
function polygonInside ( ) {
var winding = 0 ;
for ( var i = 0 , n = polygon . length ; i < n ; ++ i ) {
for ( var ring = polygon [ i ] , j = 1 , m = ring . length , point = ring [ 0 ] , a0 , a1 , b0 = point [ 0 ] , b1 = point [ 1 ] ; j < m ; ++ j ) {
a0 = b0 , a1 = b1 , point = ring [ j ] , b0 = point [ 0 ] , b1 = point [ 1 ] ;
if ( a1 <= y1 ) { if ( b1 > y1 && ( b0 - a0 ) * ( y1 - a1 ) > ( b1 - a1 ) * ( x0 - a0 ) ) ++ winding ; } else { if ( b1 <= y1 && ( b0 - a0 ) * ( y1 - a1 ) < ( b1 - a1 ) * ( x0 - a0 ) ) -- winding ; }
}
}
return winding ;
}
// Buffer geometry within a polygon and then clip it en masse.
function polygonStart ( ) {
activeStream = bufferStream , segments = [ ] , polygon = [ ] , clean = true ;
}
function polygonEnd ( ) {
var startInside = polygonInside ( ) ,
cleanInside = clean && startInside ,
visible = ( segments = merge ( segments ) ) . length ;
if ( cleanInside || visible ) {
stream . polygonStart ( ) ;
if ( cleanInside ) {
stream . lineStart ( ) ;
interpolate ( null , null , 1 , stream ) ;
stream . lineEnd ( ) ;
}
if ( visible ) {
clipPolygon ( segments , compareIntersection , startInside , interpolate , stream ) ;
}
stream . polygonEnd ( ) ;
}
activeStream = stream , segments = polygon = ring = null ;
}
function lineStart ( ) {
clipStream . point = linePoint ;
if ( polygon ) polygon . push ( ring = [ ] ) ;
first = true ;
v _ = false ;
x _ = y _ = NaN ;
}
// TODO rather than special-case polygons, simply handle them separately.
// Ideally, coincident intersection points should be jittered to avoid
// clipping issues.
function lineEnd ( ) {
if ( segments ) {
linePoint ( x _ _ , y _ _ ) ;
if ( v _ _ && v _ ) bufferStream . rejoin ( ) ;
segments . push ( bufferStream . result ( ) ) ;
}
clipStream . point = point ;
if ( v _ ) activeStream . lineEnd ( ) ;
}
function linePoint ( x , y ) {
var v = visible ( x , y ) ;
if ( polygon ) ring . push ( [ x , y ] ) ;
if ( first ) {
x _ _ = x , y _ _ = y , v _ _ = v ;
first = false ;
if ( v ) {
activeStream . lineStart ( ) ;
activeStream . point ( x , y ) ;
}
} else {
if ( v && v _ ) activeStream . point ( x , y ) ;
else {
var a = [ x _ = Math . max ( clipMin , Math . min ( clipMax , x _ ) ) , y _ = Math . max ( clipMin , Math . min ( clipMax , y _ ) ) ] ,
b = [ x = Math . max ( clipMin , Math . min ( clipMax , x ) ) , y = Math . max ( clipMin , Math . min ( clipMax , y ) ) ] ;
if ( clipLine ( a , b , x0 , y0 , x1 , y1 ) ) {
if ( ! v _ ) {
activeStream . lineStart ( ) ;
activeStream . point ( a [ 0 ] , a [ 1 ] ) ;
}
activeStream . point ( b [ 0 ] , b [ 1 ] ) ;
if ( ! v ) activeStream . lineEnd ( ) ;
clean = false ;
} else if ( v ) {
activeStream . lineStart ( ) ;
activeStream . point ( x , y ) ;
clean = false ;
}
}
}
x _ = x , y _ = y , v _ = v ;
}
return clipStream ;
} ;
}
var extent$1 = function ( ) {
var x0 = 0 ,
y0 = 0 ,
x1 = 960 ,
y1 = 500 ,
cache ,
cacheStream ,
clip ;
return clip = {
stream : function ( stream ) {
return cache && cacheStream === stream ? cache : cache = clipExtent ( x0 , y0 , x1 , y1 ) ( cacheStream = stream ) ;
} ,
extent : function ( _ ) {
return arguments . length ? ( x0 = + _ [ 0 ] [ 0 ] , y0 = + _ [ 0 ] [ 1 ] , x1 = + _ [ 1 ] [ 0 ] , y1 = + _ [ 1 ] [ 1 ] , cache = cacheStream = null , clip ) : [
[ x0 , y0 ] ,
[ x1 , y1 ]
] ;
}
} ;
} ;
var lengthSum = adder ( ) ;
var lambda0$2 ;
var sinPhi0$1 ;
var cosPhi0$1 ;
var lengthStream = {
sphere : noop$1 ,
point : noop$1 ,
lineStart : lengthLineStart ,
lineEnd : noop$1 ,
polygonStart : noop$1 ,
polygonEnd : noop$1
} ;
function lengthLineStart ( ) {
lengthStream . point = lengthPointFirst ;
lengthStream . lineEnd = lengthLineEnd ;
}
function lengthLineEnd ( ) {
lengthStream . point = lengthStream . lineEnd = noop$1 ;
}
function lengthPointFirst ( lambda , phi ) {
lambda *= radians , phi *= radians ;
lambda0$2 = lambda , sinPhi0$1 = sin$1 ( phi ) , cosPhi0$1 = cos$1 ( phi ) ;
lengthStream . point = lengthPoint ;
}
function lengthPoint ( lambda , phi ) {
lambda *= radians , phi *= radians ;
var sinPhi = sin$1 ( phi ) ,
cosPhi = cos$1 ( phi ) ,
delta = abs ( lambda - lambda0$2 ) ,
cosDelta = cos$1 ( delta ) ,
sinDelta = sin$1 ( delta ) ,
x = cosPhi * sinDelta ,
y = cosPhi0$1 * sinPhi - sinPhi0$1 * cosPhi * cosDelta ,
z = sinPhi0$1 * sinPhi + cosPhi0$1 * cosPhi * cosDelta ;
lengthSum . add ( atan2 ( sqrt ( x * x + y * y ) , z ) ) ;
lambda0$2 = lambda , sinPhi0$1 = sinPhi , cosPhi0$1 = cosPhi ;
}
var length$1 = function ( object ) {
lengthSum . reset ( ) ;
geoStream ( object , lengthStream ) ;
return + lengthSum ;
} ;
var coordinates = [ null , null ] ;
var object$1 = { type : "LineString" , coordinates : coordinates } ;
var distance = function ( a , b ) {
coordinates [ 0 ] = a ;
coordinates [ 1 ] = b ;
return length$1 ( object$1 ) ;
} ;
function graticuleX ( y0 , y1 , dy ) {
var y = sequence ( y0 , y1 - epsilon$2 , dy ) . concat ( y1 ) ;
return function ( x ) { return y . map ( function ( y ) { return [ x , y ] ; } ) ; } ;
}
function graticuleY ( x0 , x1 , dx ) {
var x = sequence ( x0 , x1 - epsilon$2 , dx ) . concat ( x1 ) ;
return function ( y ) { return x . map ( function ( x ) { return [ x , y ] ; } ) ; } ;
}
function graticule ( ) {
var x1 , x0 , X1 , X0 ,
y1 , y0 , Y1 , Y0 ,
dx = 10 ,
dy = dx ,
DX = 90 ,
DY = 360 ,
x , y , X , Y ,
precision = 2.5 ;
function graticule ( ) {
return { type : "MultiLineString" , coordinates : lines ( ) } ;
}
function lines ( ) {
return sequence ( ceil ( X0 / DX ) * DX , X1 , DX ) . map ( X )
. concat ( sequence ( ceil ( Y0 / DY ) * DY , Y1 , DY ) . map ( Y ) )
. concat ( sequence ( ceil ( x0 / dx ) * dx , x1 , dx ) . filter ( function ( x ) { return abs ( x % DX ) > epsilon$2 ; } ) . map ( x ) )
. concat ( sequence ( ceil ( y0 / dy ) * dy , y1 , dy ) . filter ( function ( y ) { return abs ( y % DY ) > epsilon$2 ; } ) . map ( y ) ) ;
}
graticule . lines = function ( ) {
return lines ( ) . map ( function ( coordinates ) { return { type : "LineString" , coordinates : coordinates } ; } ) ;
} ;
graticule . outline = function ( ) {
return {
type : "Polygon" ,
coordinates : [
X ( X0 ) . concat (
Y ( Y1 ) . slice ( 1 ) ,
X ( X1 ) . reverse ( ) . slice ( 1 ) ,
Y ( Y0 ) . reverse ( ) . slice ( 1 ) )
]
} ;
} ;
graticule . extent = function ( _ ) {
if ( ! arguments . length ) return graticule . extentMinor ( ) ;
return graticule . extentMajor ( _ ) . extentMinor ( _ ) ;
} ;
graticule . extentMajor = function ( _ ) {
if ( ! arguments . length ) return [
[ X0 , Y0 ] ,
[ X1 , Y1 ]
] ;
X0 = + _ [ 0 ] [ 0 ] , X1 = + _ [ 1 ] [ 0 ] ;
Y0 = + _ [ 0 ] [ 1 ] , Y1 = + _ [ 1 ] [ 1 ] ;
if ( X0 > X1 ) _ = X0 , X0 = X1 , X1 = _ ;
if ( Y0 > Y1 ) _ = Y0 , Y0 = Y1 , Y1 = _ ;
return graticule . precision ( precision ) ;
} ;
graticule . extentMinor = function ( _ ) {
if ( ! arguments . length ) return [
[ x0 , y0 ] ,
[ x1 , y1 ]
] ;
x0 = + _ [ 0 ] [ 0 ] , x1 = + _ [ 1 ] [ 0 ] ;
y0 = + _ [ 0 ] [ 1 ] , y1 = + _ [ 1 ] [ 1 ] ;
if ( x0 > x1 ) _ = x0 , x0 = x1 , x1 = _ ;
if ( y0 > y1 ) _ = y0 , y0 = y1 , y1 = _ ;
return graticule . precision ( precision ) ;
} ;
graticule . step = function ( _ ) {
if ( ! arguments . length ) return graticule . stepMinor ( ) ;
return graticule . stepMajor ( _ ) . stepMinor ( _ ) ;
} ;
graticule . stepMajor = function ( _ ) {
if ( ! arguments . length ) return [ DX , DY ] ;
DX = + _ [ 0 ] , DY = + _ [ 1 ] ;
return graticule ;
} ;
graticule . stepMinor = function ( _ ) {
if ( ! arguments . length ) return [ dx , dy ] ;
dx = + _ [ 0 ] , dy = + _ [ 1 ] ;
return graticule ;
} ;
graticule . precision = function ( _ ) {
if ( ! arguments . length ) return precision ;
precision = + _ ;
x = graticuleX ( y0 , y1 , 90 ) ;
y = graticuleY ( x0 , x1 , precision ) ;
X = graticuleX ( Y0 , Y1 , 90 ) ;
Y = graticuleY ( X0 , X1 , precision ) ;
return graticule ;
} ;
return graticule
. extentMajor ( [
[ - 180 , - 90 + epsilon$2 ] ,
[ 180 , 90 - epsilon$2 ]
] )
. extentMinor ( [
[ - 180 , - 80 - epsilon$2 ] ,
[ 180 , 80 + epsilon$2 ]
] ) ;
}
function graticule10 ( ) {
return graticule ( ) ( ) ;
}
var interpolate$1 = function ( a , b ) {
var x0 = a [ 0 ] * radians ,
y0 = a [ 1 ] * radians ,
x1 = b [ 0 ] * radians ,
y1 = b [ 1 ] * radians ,
cy0 = cos$1 ( y0 ) ,
sy0 = sin$1 ( y0 ) ,
cy1 = cos$1 ( y1 ) ,
sy1 = sin$1 ( y1 ) ,
kx0 = cy0 * cos$1 ( x0 ) ,
ky0 = cy0 * sin$1 ( x0 ) ,
kx1 = cy1 * cos$1 ( x1 ) ,
ky1 = cy1 * sin$1 ( x1 ) ,
d = 2 * asin ( sqrt ( haversin ( y1 - y0 ) + cy0 * cy1 * haversin ( x1 - x0 ) ) ) ,
k = sin$1 ( d ) ;
var interpolate = d ? function ( t ) {
var B = sin$1 ( t *= d ) / k ,
A = sin$1 ( d - t ) / k ,
x = A * kx0 + B * kx1 ,
y = A * ky0 + B * ky1 ,
z = A * sy0 + B * sy1 ;
return [
atan2 ( y , x ) * degrees$1 ,
atan2 ( z , sqrt ( x * x + y * y ) ) * degrees$1
] ;
} : function ( ) {
return [ x0 * degrees$1 , y0 * degrees$1 ] ;
} ;
interpolate . distance = d ;
return interpolate ;
} ;
var identity$4 = function ( x ) {
return x ;
} ;
var areaSum$1 = adder ( ) ;
var areaRingSum$1 = adder ( ) ;
var x00 ;
var y00 ;
var x0$1 ;
var y0$1 ;
var areaStream$1 = {
point : noop$1 ,
lineStart : noop$1 ,
lineEnd : noop$1 ,
polygonStart : function ( ) {
areaStream$1 . lineStart = areaRingStart$1 ;
areaStream$1 . lineEnd = areaRingEnd$1 ;
} ,
polygonEnd : function ( ) {
areaStream$1 . lineStart = areaStream$1 . lineEnd = areaStream$1 . point = noop$1 ;
areaSum$1 . add ( abs ( areaRingSum$1 ) ) ;
areaRingSum$1 . reset ( ) ;
} ,
result : function ( ) {
var area = areaSum$1 / 2 ;
areaSum$1 . reset ( ) ;
return area ;
}
} ;
function areaRingStart$1 ( ) {
areaStream$1 . point = areaPointFirst$1 ;
}
function areaPointFirst$1 ( x , y ) {
areaStream$1 . point = areaPoint$1 ;
x00 = x0$1 = x , y00 = y0$1 = y ;
}
function areaPoint$1 ( x , y ) {
areaRingSum$1 . add ( y0$1 * x - x0$1 * y ) ;
x0$1 = x , y0$1 = y ;
}
function areaRingEnd$1 ( ) {
areaPoint$1 ( x00 , y00 ) ;
}
var x0$2 = Infinity ;
var y0$2 = x0$2 ;
var x1 = - x0$2 ;
var y1 = x1 ;
var boundsStream$1 = {
point : boundsPoint$1 ,
lineStart : noop$1 ,
lineEnd : noop$1 ,
polygonStart : noop$1 ,
polygonEnd : noop$1 ,
result : function ( ) {
var bounds = [
[ x0$2 , y0$2 ] ,
[ x1 , y1 ]
] ;
x1 = y1 = - ( y0$2 = x0$2 = Infinity ) ;
return bounds ;
}
} ;
function boundsPoint$1 ( x , y ) {
if ( x < x0$2 ) x0$2 = x ;
if ( x > x1 ) x1 = x ;
if ( y < y0$2 ) y0$2 = y ;
if ( y > y1 ) y1 = y ;
}
// TODO Enforce positive area for exterior, negative area for interior?
var X0$1 = 0 ;
var Y0$1 = 0 ;
var Z0$1 = 0 ;
var X1$1 = 0 ;
var Y1$1 = 0 ;
var Z1$1 = 0 ;
var X2$1 = 0 ;
var Y2$1 = 0 ;
var Z2$1 = 0 ;
var x00$1 ;
var y00$1 ;
var x0$3 ;
var y0$3 ;
var centroidStream$1 = {
point : centroidPoint$1 ,
lineStart : centroidLineStart$1 ,
lineEnd : centroidLineEnd$1 ,
polygonStart : function ( ) {
centroidStream$1 . lineStart = centroidRingStart$1 ;
centroidStream$1 . lineEnd = centroidRingEnd$1 ;
} ,
polygonEnd : function ( ) {
centroidStream$1 . point = centroidPoint$1 ;
centroidStream$1 . lineStart = centroidLineStart$1 ;
centroidStream$1 . lineEnd = centroidLineEnd$1 ;
} ,
result : function ( ) {
var centroid = Z2$1 ? [ X2$1 / Z2$1 , Y2$1 / Z2$1 ] :
Z1$1 ? [ X1$1 / Z1$1 , Y1$1 / Z1$1 ] :
Z0$1 ? [ X0$1 / Z0$1 , Y0$1 / Z0$1 ] : [ NaN , NaN ] ;
X0$1 = Y0$1 = Z0$1 =
X1$1 = Y1$1 = Z1$1 =
X2$1 = Y2$1 = Z2$1 = 0 ;
return centroid ;
}
} ;
function centroidPoint$1 ( x , y ) {
X0$1 += x ;
Y0$1 += y ;
++ Z0$1 ;
}
function centroidLineStart$1 ( ) {
centroidStream$1 . point = centroidPointFirstLine ;
}
function centroidPointFirstLine ( x , y ) {
centroidStream$1 . point = centroidPointLine ;
centroidPoint$1 ( x0$3 = x , y0$3 = y ) ;
}
function centroidPointLine ( x , y ) {
var dx = x - x0$3 ,
dy = y - y0$3 ,
z = sqrt ( dx * dx + dy * dy ) ;
X1$1 += z * ( x0$3 + x ) / 2 ;
Y1$1 += z * ( y0$3 + y ) / 2 ;
Z1$1 += z ;
centroidPoint$1 ( x0$3 = x , y0$3 = y ) ;
}
function centroidLineEnd$1 ( ) {
centroidStream$1 . point = centroidPoint$1 ;
}
function centroidRingStart$1 ( ) {
centroidStream$1 . point = centroidPointFirstRing ;
}
function centroidRingEnd$1 ( ) {
centroidPointRing ( x00$1 , y00$1 ) ;
}
function centroidPointFirstRing ( x , y ) {
centroidStream$1 . point = centroidPointRing ;
centroidPoint$1 ( x00$1 = x0$3 = x , y00$1 = y0$3 = y ) ;
}
function centroidPointRing ( x , y ) {
var dx = x - x0$3 ,
dy = y - y0$3 ,
z = sqrt ( dx * dx + dy * dy ) ;
X1$1 += z * ( x0$3 + x ) / 2 ;
Y1$1 += z * ( y0$3 + y ) / 2 ;
Z1$1 += z ;
z = y0$3 * x - x0$3 * y ;
X2$1 += z * ( x0$3 + x ) ;
Y2$1 += z * ( y0$3 + y ) ;
Z2$1 += z * 3 ;
centroidPoint$1 ( x0$3 = x , y0$3 = y ) ;
}
function PathContext ( context ) {
this . _context = context ;
}
PathContext . prototype = {
_radius : 4.5 ,
pointRadius : function ( _ ) {
return this . _radius = _ , this ;
} ,
polygonStart : function ( ) {
this . _line = 0 ;
} ,
polygonEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line === 0 ) this . _context . closePath ( ) ;
this . _point = NaN ;
} ,
point : function ( x , y ) {
switch ( this . _point ) {
case 0 :
{
this . _context . moveTo ( x , y ) ;
this . _point = 1 ;
break ;
}
case 1 :
{
this . _context . lineTo ( x , y ) ;
break ;
}
default :
{
this . _context . moveTo ( x + this . _radius , y ) ;
this . _context . arc ( x , y , this . _radius , 0 , tau$3 ) ;
break ;
}
}
} ,
result : noop$1
} ;
function PathString ( ) {
this . _string = [ ] ;
}
PathString . prototype = {
_circle : circle$1 ( 4.5 ) ,
pointRadius : function ( _ ) {
return this . _circle = circle$1 ( _ ) , this ;
} ,
polygonStart : function ( ) {
this . _line = 0 ;
} ,
polygonEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line === 0 ) this . _string . push ( "Z" ) ;
this . _point = NaN ;
} ,
point : function ( x , y ) {
switch ( this . _point ) {
case 0 :
{
this . _string . push ( "M" , x , "," , y ) ;
this . _point = 1 ;
break ;
}
case 1 :
{
this . _string . push ( "L" , x , "," , y ) ;
break ;
}
default :
{
this . _string . push ( "M" , x , "," , y , this . _circle ) ;
break ;
}
}
} ,
result : function ( ) {
if ( this . _string . length ) {
var result = this . _string . join ( "" ) ;
this . _string = [ ] ;
return result ;
}
}
} ;
function circle$1 ( radius ) {
return "m0," + radius +
"a" + radius + "," + radius + " 0 1,1 0," + - 2 * radius +
"a" + radius + "," + radius + " 0 1,1 0," + 2 * radius +
"z" ;
}
var index$1 = function ( projection , context ) {
var pointRadius = 4.5 ,
projectionStream ,
contextStream ;
function path ( object ) {
if ( object ) {
if ( typeof pointRadius === "function" ) contextStream . pointRadius ( + pointRadius . apply ( this , arguments ) ) ;
geoStream ( object , projectionStream ( contextStream ) ) ;
}
return contextStream . result ( ) ;
}
path . area = function ( object ) {
geoStream ( object , projectionStream ( areaStream$1 ) ) ;
return areaStream$1 . result ( ) ;
} ;
path . bounds = function ( object ) {
geoStream ( object , projectionStream ( boundsStream$1 ) ) ;
return boundsStream$1 . result ( ) ;
} ;
path . centroid = function ( object ) {
geoStream ( object , projectionStream ( centroidStream$1 ) ) ;
return centroidStream$1 . result ( ) ;
} ;
path . projection = function ( _ ) {
return arguments . length ? ( projectionStream = _ == null ? ( projection = null , identity$4 ) : ( projection = _ ) . stream , path ) : projection ;
} ;
path . context = function ( _ ) {
if ( ! arguments . length ) return context ;
contextStream = _ == null ? ( context = null , new PathString ) : new PathContext ( context = _ ) ;
if ( typeof pointRadius !== "function" ) contextStream . pointRadius ( pointRadius ) ;
return path ;
} ;
path . pointRadius = function ( _ ) {
if ( ! arguments . length ) return pointRadius ;
pointRadius = typeof _ === "function" ? _ : ( contextStream . pointRadius ( + _ ) , + _ ) ;
return path ;
} ;
return path . projection ( projection ) . context ( context ) ;
} ;
var sum$1 = adder ( ) ;
var polygonContains = function ( polygon , point ) {
var lambda = point [ 0 ] ,
phi = point [ 1 ] ,
normal = [ sin$1 ( lambda ) , - cos$1 ( lambda ) , 0 ] ,
angle = 0 ,
winding = 0 ;
sum$1 . reset ( ) ;
for ( var i = 0 , n = polygon . length ; i < n ; ++ i ) {
if ( ! ( m = ( ring = polygon [ i ] ) . length ) ) continue ;
var ring ,
m ,
point0 = ring [ m - 1 ] ,
lambda0 = point0 [ 0 ] ,
phi0 = point0 [ 1 ] / 2 + quarterPi ,
sinPhi0 = sin$1 ( phi0 ) ,
cosPhi0 = cos$1 ( phi0 ) ;
for ( var j = 0 ; j < m ; ++ j , lambda0 = lambda1 , sinPhi0 = sinPhi1 , cosPhi0 = cosPhi1 , point0 = point1 ) {
var point1 = ring [ j ] ,
lambda1 = point1 [ 0 ] ,
phi1 = point1 [ 1 ] / 2 + quarterPi ,
sinPhi1 = sin$1 ( phi1 ) ,
cosPhi1 = cos$1 ( phi1 ) ,
delta = lambda1 - lambda0 ,
sign$$1 = delta >= 0 ? 1 : - 1 ,
absDelta = sign$$1 * delta ,
antimeridian = absDelta > pi$3 ,
k = sinPhi0 * sinPhi1 ;
sum$1 . add ( atan2 ( k * sign$$1 * sin$1 ( absDelta ) , cosPhi0 * cosPhi1 + k * cos$1 ( absDelta ) ) ) ;
angle += antimeridian ? delta + sign$$1 * tau$3 : delta ;
// Are the longitudes either side of the point’
// and are the latitudes smaller than the parallel (phi)?
if ( antimeridian ^ lambda0 >= lambda ^ lambda1 >= lambda ) {
var arc = cartesianCross ( cartesian ( point0 ) , cartesian ( point1 ) ) ;
cartesianNormalizeInPlace ( arc ) ;
var intersection = cartesianCross ( normal , arc ) ;
cartesianNormalizeInPlace ( intersection ) ;
var phiArc = ( antimeridian ^ delta >= 0 ? - 1 : 1 ) * asin ( intersection [ 2 ] ) ;
if ( phi > phiArc || phi === phiArc && ( arc [ 0 ] || arc [ 1 ] ) ) {
winding += antimeridian ^ delta >= 0 ? 1 : - 1 ;
}
}
}
}
// First, determine whether the South pole is inside or outside:
//
// It is inside if:
// * the polygon winds around it in a clockwise direction.
// * the polygon does not (cumulatively) wind around it, but has a negative
// (counter-clockwise) area.
//
// Second, count the (signed) number of times a segment crosses a lambda
// from the point to the South pole. If it is zero, then the point is the
// same side as the South pole.
return ( angle < - epsilon$2 || angle < epsilon$2 && sum$1 < - epsilon$2 ) ^ ( winding & 1 ) ;
} ;
var clip = function ( pointVisible , clipLine , interpolate , start ) {
return function ( rotate , sink ) {
var line = clipLine ( sink ) ,
rotatedStart = rotate . invert ( start [ 0 ] , start [ 1 ] ) ,
ringBuffer = clipBuffer ( ) ,
ringSink = clipLine ( ringBuffer ) ,
polygonStarted = false ,
polygon ,
segments ,
ring ;
var clip = {
point : point ,
lineStart : lineStart ,
lineEnd : lineEnd ,
polygonStart : function ( ) {
clip . point = pointRing ;
clip . lineStart = ringStart ;
clip . lineEnd = ringEnd ;
segments = [ ] ;
polygon = [ ] ;
} ,
polygonEnd : function ( ) {
clip . point = point ;
clip . lineStart = lineStart ;
clip . lineEnd = lineEnd ;
segments = merge ( segments ) ;
var startInside = polygonContains ( polygon , rotatedStart ) ;
if ( segments . length ) {
if ( ! polygonStarted ) sink . polygonStart ( ) , polygonStarted = true ;
clipPolygon ( segments , compareIntersection , startInside , interpolate , sink ) ;
} else if ( startInside ) {
if ( ! polygonStarted ) sink . polygonStart ( ) , polygonStarted = true ;
sink . lineStart ( ) ;
interpolate ( null , null , 1 , sink ) ;
sink . lineEnd ( ) ;
}
if ( polygonStarted ) sink . polygonEnd ( ) , polygonStarted = false ;
segments = polygon = null ;
} ,
sphere : function ( ) {
sink . polygonStart ( ) ;
sink . lineStart ( ) ;
interpolate ( null , null , 1 , sink ) ;
sink . lineEnd ( ) ;
sink . polygonEnd ( ) ;
}
} ;
function point ( lambda , phi ) {
var point = rotate ( lambda , phi ) ;
if ( pointVisible ( lambda = point [ 0 ] , phi = point [ 1 ] ) ) sink . point ( lambda , phi ) ;
}
function pointLine ( lambda , phi ) {
var point = rotate ( lambda , phi ) ;
line . point ( point [ 0 ] , point [ 1 ] ) ;
}
function lineStart ( ) {
clip . point = pointLine ;
line . lineStart ( ) ;
}
function lineEnd ( ) {
clip . point = point ;
line . lineEnd ( ) ;
}
function pointRing ( lambda , phi ) {
ring . push ( [ lambda , phi ] ) ;
var point = rotate ( lambda , phi ) ;
ringSink . point ( point [ 0 ] , point [ 1 ] ) ;
}
function ringStart ( ) {
ringSink . lineStart ( ) ;
ring = [ ] ;
}
function ringEnd ( ) {
pointRing ( ring [ 0 ] [ 0 ] , ring [ 0 ] [ 1 ] ) ;
ringSink . lineEnd ( ) ;
var clean = ringSink . clean ( ) ,
ringSegments = ringBuffer . result ( ) ,
i , n = ringSegments . length ,
m ,
segment ,
point ;
ring . pop ( ) ;
polygon . push ( ring ) ;
ring = null ;
if ( ! n ) return ;
// No intersections.
if ( clean & 1 ) {
segment = ringSegments [ 0 ] ;
if ( ( m = segment . length - 1 ) > 0 ) {
if ( ! polygonStarted ) sink . polygonStart ( ) , polygonStarted = true ;
sink . lineStart ( ) ;
for ( i = 0 ; i < m ; ++ i ) sink . point ( ( point = segment [ i ] ) [ 0 ] , point [ 1 ] ) ;
sink . lineEnd ( ) ;
}
return ;
}
// Rejoin connected segments.
// TODO reuse ringBuffer.rejoin()?
if ( n > 1 && clean & 2 ) ringSegments . push ( ringSegments . pop ( ) . concat ( ringSegments . shift ( ) ) ) ;
segments . push ( ringSegments . filter ( validSegment ) ) ;
}
return clip ;
} ;
} ;
function validSegment ( segment ) {
return segment . length > 1 ;
}
// Intersections are sorted along the clip edge. For both antimeridian cutting
// and circle clipping, the same comparison is used.
function compareIntersection ( a , b ) {
return ( ( a = a . x ) [ 0 ] < 0 ? a [ 1 ] - halfPi$2 - epsilon$2 : halfPi$2 - a [ 1 ] ) -
( ( b = b . x ) [ 0 ] < 0 ? b [ 1 ] - halfPi$2 - epsilon$2 : halfPi$2 - b [ 1 ] ) ;
}
var clipAntimeridian = clip (
function ( ) { return true ; } ,
clipAntimeridianLine ,
clipAntimeridianInterpolate , [ - pi$3 , - halfPi$2 ]
) ;
// Takes a line and cuts into visible segments. Return values: 0 - there were
// intersections or the line was empty; 1 - no intersections; 2 - there were
// intersections, and the first and last segments should be rejoined.
function clipAntimeridianLine ( stream ) {
var lambda0 = NaN ,
phi0 = NaN ,
sign0 = NaN ,
clean ; // no intersections
return {
lineStart : function ( ) {
stream . lineStart ( ) ;
clean = 1 ;
} ,
point : function ( lambda1 , phi1 ) {
var sign1 = lambda1 > 0 ? pi$3 : - pi$3 ,
delta = abs ( lambda1 - lambda0 ) ;
if ( abs ( delta - pi$3 ) < epsilon$2 ) { // line crosses a pole
stream . point ( lambda0 , phi0 = ( phi0 + phi1 ) / 2 > 0 ? halfPi$2 : - halfPi$2 ) ;
stream . point ( sign0 , phi0 ) ;
stream . lineEnd ( ) ;
stream . lineStart ( ) ;
stream . point ( sign1 , phi0 ) ;
stream . point ( lambda1 , phi0 ) ;
clean = 0 ;
} else if ( sign0 !== sign1 && delta >= pi$3 ) { // line crosses antimeridian
if ( abs ( lambda0 - sign0 ) < epsilon$2 ) lambda0 -= sign0 * epsilon$2 ; // handle degeneracies
if ( abs ( lambda1 - sign1 ) < epsilon$2 ) lambda1 -= sign1 * epsilon$2 ;
phi0 = clipAntimeridianIntersect ( lambda0 , phi0 , lambda1 , phi1 ) ;
stream . point ( sign0 , phi0 ) ;
stream . lineEnd ( ) ;
stream . lineStart ( ) ;
stream . point ( sign1 , phi0 ) ;
clean = 0 ;
}
stream . point ( lambda0 = lambda1 , phi0 = phi1 ) ;
sign0 = sign1 ;
} ,
lineEnd : function ( ) {
stream . lineEnd ( ) ;
lambda0 = phi0 = NaN ;
} ,
clean : function ( ) {
return 2 - clean ; // if intersections, rejoin first and last segments
}
} ;
}
function clipAntimeridianIntersect ( lambda0 , phi0 , lambda1 , phi1 ) {
var cosPhi0 ,
cosPhi1 ,
sinLambda0Lambda1 = sin$1 ( lambda0 - lambda1 ) ;
return abs ( sinLambda0Lambda1 ) > epsilon$2 ?
atan ( ( sin$1 ( phi0 ) * ( cosPhi1 = cos$1 ( phi1 ) ) * sin$1 ( lambda1 ) -
sin$1 ( phi1 ) * ( cosPhi0 = cos$1 ( phi0 ) ) * sin$1 ( lambda0 ) ) /
( cosPhi0 * cosPhi1 * sinLambda0Lambda1 ) ) :
( phi0 + phi1 ) / 2 ;
}
function clipAntimeridianInterpolate ( from , to , direction , stream ) {
var phi ;
if ( from == null ) {
phi = direction * halfPi$2 ;
stream . point ( - pi$3 , phi ) ;
stream . point ( 0 , phi ) ;
stream . point ( pi$3 , phi ) ;
stream . point ( pi$3 , 0 ) ;
stream . point ( pi$3 , - phi ) ;
stream . point ( 0 , - phi ) ;
stream . point ( - pi$3 , - phi ) ;
stream . point ( - pi$3 , 0 ) ;
stream . point ( - pi$3 , phi ) ;
} else if ( abs ( from [ 0 ] - to [ 0 ] ) > epsilon$2 ) {
var lambda = from [ 0 ] < to [ 0 ] ? pi$3 : - pi$3 ;
phi = direction * lambda / 2 ;
stream . point ( - lambda , phi ) ;
stream . point ( 0 , phi ) ;
stream . point ( lambda , phi ) ;
} else {
stream . point ( to [ 0 ] , to [ 1 ] ) ;
}
}
var clipCircle = function ( radius , delta ) {
var cr = cos$1 ( radius ) ,
smallRadius = cr > 0 ,
notHemisphere = abs ( cr ) > epsilon$2 ; // TODO optimise for this common case
function interpolate ( from , to , direction , stream ) {
circleStream ( stream , radius , delta , direction , from , to ) ;
}
function visible ( lambda , phi ) {
return cos$1 ( lambda ) * cos$1 ( phi ) > cr ;
}
// Takes a line and cuts into visible segments. Return values used for polygon
// clipping: 0 - there were intersections or the line was empty; 1 - no
// intersections 2 - there were intersections, and the first and last segments
// should be rejoined.
function clipLine ( stream ) {
var point0 , // previous point
c0 , // code for previous point
v0 , // visibility of previous point
v00 , // visibility of first point
clean ; // no intersections
return {
lineStart : function ( ) {
v00 = v0 = false ;
clean = 1 ;
} ,
point : function ( lambda , phi ) {
var point1 = [ lambda , phi ] ,
point2 ,
v = visible ( lambda , phi ) ,
c = smallRadius ?
v ? 0 : code ( lambda , phi ) :
v ? code ( lambda + ( lambda < 0 ? pi$3 : - pi$3 ) , phi ) : 0 ;
if ( ! point0 && ( v00 = v0 = v ) ) stream . lineStart ( ) ;
// Handle degeneracies.
// TODO ignore if not clipping polygons.
if ( v !== v0 ) {
point2 = intersect ( point0 , point1 ) ;
if ( pointEqual ( point0 , point2 ) || pointEqual ( point1 , point2 ) ) {
point1 [ 0 ] += epsilon$2 ;
point1 [ 1 ] += epsilon$2 ;
v = visible ( point1 [ 0 ] , point1 [ 1 ] ) ;
}
}
if ( v !== v0 ) {
clean = 0 ;
if ( v ) {
// outside going in
stream . lineStart ( ) ;
point2 = intersect ( point1 , point0 ) ;
stream . point ( point2 [ 0 ] , point2 [ 1 ] ) ;
} else {
// inside going out
point2 = intersect ( point0 , point1 ) ;
stream . point ( point2 [ 0 ] , point2 [ 1 ] ) ;
stream . lineEnd ( ) ;
}
point0 = point2 ;
} else if ( notHemisphere && point0 && smallRadius ^ v ) {
var t ;
// If the codes for two points are different, or are both zero,
// and there this segment intersects with the small circle.
if ( ! ( c & c0 ) && ( t = intersect ( point1 , point0 , true ) ) ) {
clean = 0 ;
if ( smallRadius ) {
stream . lineStart ( ) ;
stream . point ( t [ 0 ] [ 0 ] , t [ 0 ] [ 1 ] ) ;
stream . point ( t [ 1 ] [ 0 ] , t [ 1 ] [ 1 ] ) ;
stream . lineEnd ( ) ;
} else {
stream . point ( t [ 1 ] [ 0 ] , t [ 1 ] [ 1 ] ) ;
stream . lineEnd ( ) ;
stream . lineStart ( ) ;
stream . point ( t [ 0 ] [ 0 ] , t [ 0 ] [ 1 ] ) ;
}
}
}
if ( v && ( ! point0 || ! pointEqual ( point0 , point1 ) ) ) {
stream . point ( point1 [ 0 ] , point1 [ 1 ] ) ;
}
point0 = point1 , v0 = v , c0 = c ;
} ,
lineEnd : function ( ) {
if ( v0 ) stream . lineEnd ( ) ;
point0 = null ;
} ,
// Rejoin first and last segments if there were intersections and the first
// and last points were visible.
clean : function ( ) {
return clean | ( ( v00 && v0 ) << 1 ) ;
}
} ;
}
// Intersects the great circle between a and b with the clip circle.
function intersect ( a , b , two ) {
var pa = cartesian ( a ) ,
pb = cartesian ( b ) ;
// We have two planes, n1.p = d1 and n2.p = d2.
// Find intersection line p(t) = c1 n1 + c2 n2 + t (n1 ⨯
var n1 = [ 1 , 0 , 0 ] , // normal
n2 = cartesianCross ( pa , pb ) ,
n2n2 = cartesianDot ( n2 , n2 ) ,
n1n2 = n2 [ 0 ] , // cartesianDot(n1, n2),
determinant = n2n2 - n1n2 * n1n2 ;
// Two polar points.
if ( ! determinant ) return ! two && a ;
var c1 = cr * n2n2 / determinant ,
c2 = - cr * n1n2 / determinant ,
n1xn2 = cartesianCross ( n1 , n2 ) ,
A = cartesianScale ( n1 , c1 ) ,
B = cartesianScale ( n2 , c2 ) ;
cartesianAddInPlace ( A , B ) ;
// Solve |p(t)|^2 = 1.
var u = n1xn2 ,
w = cartesianDot ( A , u ) ,
uu = cartesianDot ( u , u ) ,
t2 = w * w - uu * ( cartesianDot ( A , A ) - 1 ) ;
if ( t2 < 0 ) return ;
var t = sqrt ( t2 ) ,
q = cartesianScale ( u , ( - w - t ) / uu ) ;
cartesianAddInPlace ( q , A ) ;
q = spherical ( q ) ;
if ( ! two ) return q ;
// Two intersection points.
var lambda0 = a [ 0 ] ,
lambda1 = b [ 0 ] ,
phi0 = a [ 1 ] ,
phi1 = b [ 1 ] ,
z ;
if ( lambda1 < lambda0 ) z = lambda0 , lambda0 = lambda1 , lambda1 = z ;
var delta = lambda1 - lambda0 ,
polar = abs ( delta - pi$3 ) < epsilon$2 ,
meridian = polar || delta < epsilon$2 ;
if ( ! polar && phi1 < phi0 ) z = phi0 , phi0 = phi1 , phi1 = z ;
// Check that the first point is between a and b.
if ( meridian ?
polar ?
phi0 + phi1 > 0 ^ q [ 1 ] < ( abs ( q [ 0 ] - lambda0 ) < epsilon$2 ? phi0 : phi1 ) :
phi0 <= q [ 1 ] && q [ 1 ] <= phi1 :
delta > pi$3 ^ ( lambda0 <= q [ 0 ] && q [ 0 ] <= lambda1 ) ) {
var q1 = cartesianScale ( u , ( - w + t ) / uu ) ;
cartesianAddInPlace ( q1 , A ) ;
return [ q , spherical ( q1 ) ] ;
}
}
// Generates a 4-bit vector representing the location of a point relative to
// the small circle's bounding box.
function code ( lambda , phi ) {
var r = smallRadius ? radius : pi$3 - radius ,
code = 0 ;
if ( lambda < - r ) code |= 1 ; // left
else if ( lambda > r ) code |= 2 ; // right
if ( phi < - r ) code |= 4 ; // below
else if ( phi > r ) code |= 8 ; // above
return code ;
}
return clip ( visible , clipLine , interpolate , smallRadius ? [ 0 , - radius ] : [ - pi$3 , radius - pi$3 ] ) ;
} ;
var transform = function ( methods ) {
return {
stream : transformer ( methods )
} ;
} ;
function transformer ( methods ) {
return function ( stream ) {
var s = new TransformStream ;
for ( var key in methods ) s [ key ] = methods [ key ] ;
s . stream = stream ;
return s ;
} ;
}
function TransformStream ( ) { }
TransformStream . prototype = {
constructor : TransformStream ,
point : function ( x , y ) { this . stream . point ( x , y ) ; } ,
sphere : function ( ) { this . stream . sphere ( ) ; } ,
lineStart : function ( ) { this . stream . lineStart ( ) ; } ,
lineEnd : function ( ) { this . stream . lineEnd ( ) ; } ,
polygonStart : function ( ) { this . stream . polygonStart ( ) ; } ,
polygonEnd : function ( ) { this . stream . polygonEnd ( ) ; }
} ;
function fitExtent ( projection , extent , object ) {
var w = extent [ 1 ] [ 0 ] - extent [ 0 ] [ 0 ] ,
h = extent [ 1 ] [ 1 ] - extent [ 0 ] [ 1 ] ,
clip = projection . clipExtent && projection . clipExtent ( ) ;
projection
. scale ( 150 )
. translate ( [ 0 , 0 ] ) ;
if ( clip != null ) projection . clipExtent ( null ) ;
geoStream ( object , projection . stream ( boundsStream$1 ) ) ;
var b = boundsStream$1 . result ( ) ,
k = Math . min ( w / ( b [ 1 ] [ 0 ] - b [ 0 ] [ 0 ] ) , h / ( b [ 1 ] [ 1 ] - b [ 0 ] [ 1 ] ) ) ,
x = + extent [ 0 ] [ 0 ] + ( w - k * ( b [ 1 ] [ 0 ] + b [ 0 ] [ 0 ] ) ) / 2 ,
y = + extent [ 0 ] [ 1 ] + ( h - k * ( b [ 1 ] [ 1 ] + b [ 0 ] [ 1 ] ) ) / 2 ;
if ( clip != null ) projection . clipExtent ( clip ) ;
return projection
. scale ( k * 150 )
. translate ( [ x , y ] ) ;
}
function fitSize ( projection , size , object ) {
return fitExtent ( projection , [
[ 0 , 0 ] , size
] , object ) ;
}
var maxDepth = 16 ;
var cosMinDistance = cos$1 ( 30 * radians ) ; // cos(minimum angular distance)
var resample = function ( project , delta2 ) {
return + delta2 ? resample$1 ( project , delta2 ) : resampleNone ( project ) ;
} ;
function resampleNone ( project ) {
return transformer ( {
point : function ( x , y ) {
x = project ( x , y ) ;
this . stream . point ( x [ 0 ] , x [ 1 ] ) ;
}
} ) ;
}
function resample$1 ( project , delta2 ) {
function resampleLineTo ( x0 , y0 , lambda0 , a0 , b0 , c0 , x1 , y1 , lambda1 , a1 , b1 , c1 , depth , stream ) {
var dx = x1 - x0 ,
dy = y1 - y0 ,
d2 = dx * dx + dy * dy ;
if ( d2 > 4 * delta2 && depth -- ) {
var a = a0 + a1 ,
b = b0 + b1 ,
c = c0 + c1 ,
m = sqrt ( a * a + b * b + c * c ) ,
phi2 = asin ( c /= m ) ,
lambda2 = abs ( abs ( c ) - 1 ) < epsilon$2 || abs ( lambda0 - lambda1 ) < epsilon$2 ? ( lambda0 + lambda1 ) / 2 : atan2 ( b , a ) ,
p = project ( lambda2 , phi2 ) ,
x2 = p [ 0 ] ,
y2 = p [ 1 ] ,
dx2 = x2 - x0 ,
dy2 = y2 - y0 ,
dz = dy * dx2 - dx * dy2 ;
if ( dz * dz / d2 > delta2 // perpendicular projected distance
||
abs ( ( dx * dx2 + dy * dy2 ) / d2 - 0.5 ) > 0.3 // midpoint close to an end
||
a0 * a1 + b0 * b1 + c0 * c1 < cosMinDistance ) { // angular distance
resampleLineTo ( x0 , y0 , lambda0 , a0 , b0 , c0 , x2 , y2 , lambda2 , a /= m , b /= m , c , depth , stream ) ;
stream . point ( x2 , y2 ) ;
resampleLineTo ( x2 , y2 , lambda2 , a , b , c , x1 , y1 , lambda1 , a1 , b1 , c1 , depth , stream ) ;
}
}
}
return function ( stream ) {
var lambda00 , x00 , y00 , a00 , b00 , c00 , // first point
lambda0 , x0 , y0 , a0 , b0 , c0 ; // previous point
var resampleStream = {
point : point ,
lineStart : lineStart ,
lineEnd : lineEnd ,
polygonStart : function ( ) {
stream . polygonStart ( ) ;
resampleStream . lineStart = ringStart ;
} ,
polygonEnd : function ( ) {
stream . polygonEnd ( ) ;
resampleStream . lineStart = lineStart ;
}
} ;
function point ( x , y ) {
x = project ( x , y ) ;
stream . point ( x [ 0 ] , x [ 1 ] ) ;
}
function lineStart ( ) {
x0 = NaN ;
resampleStream . point = linePoint ;
stream . lineStart ( ) ;
}
function linePoint ( lambda , phi ) {
var c = cartesian ( [ lambda , phi ] ) ,
p = project ( lambda , phi ) ;
resampleLineTo ( x0 , y0 , lambda0 , a0 , b0 , c0 , x0 = p [ 0 ] , y0 = p [ 1 ] , lambda0 = lambda , a0 = c [ 0 ] , b0 = c [ 1 ] , c0 = c [ 2 ] , maxDepth , stream ) ;
stream . point ( x0 , y0 ) ;
}
function lineEnd ( ) {
resampleStream . point = point ;
stream . lineEnd ( ) ;
}
function ringStart ( ) {
lineStart ( ) ;
resampleStream . point = ringPoint ;
resampleStream . lineEnd = ringEnd ;
}
function ringPoint ( lambda , phi ) {
linePoint ( lambda00 = lambda , phi ) , x00 = x0 , y00 = y0 , a00 = a0 , b00 = b0 , c00 = c0 ;
resampleStream . point = linePoint ;
}
function ringEnd ( ) {
resampleLineTo ( x0 , y0 , lambda0 , a0 , b0 , c0 , x00 , y00 , lambda00 , a00 , b00 , c00 , maxDepth , stream ) ;
resampleStream . lineEnd = lineEnd ;
lineEnd ( ) ;
}
return resampleStream ;
} ;
}
var transformRadians = transformer ( {
point : function ( x , y ) {
this . stream . point ( x * radians , y * radians ) ;
}
} ) ;
function projection ( project ) {
return projectionMutator ( function ( ) { return project ; } ) ( ) ;
}
function projectionMutator ( projectAt ) {
var project ,
k = 150 , // scale
x = 480 ,
y = 250 , // translate
dx , dy , lambda = 0 ,
phi = 0 , // center
deltaLambda = 0 ,
deltaPhi = 0 ,
deltaGamma = 0 ,
rotate , projectRotate , // rotate
theta = null ,
preclip = clipAntimeridian , // clip angle
x0 = null ,
y0 , x1 , y1 , postclip = identity$4 , // clip extent
delta2 = 0.5 ,
projectResample = resample ( projectTransform , delta2 ) , // precision
cache ,
cacheStream ;
function projection ( point ) {
point = projectRotate ( point [ 0 ] * radians , point [ 1 ] * radians ) ;
return [ point [ 0 ] * k + dx , dy - point [ 1 ] * k ] ;
}
function invert ( point ) {
point = projectRotate . invert ( ( point [ 0 ] - dx ) / k , ( dy - point [ 1 ] ) / k ) ;
return point && [ point [ 0 ] * degrees$1 , point [ 1 ] * degrees$1 ] ;
}
function projectTransform ( x , y ) {
return x = project ( x , y ) , [ x [ 0 ] * k + dx , dy - x [ 1 ] * k ] ;
}
projection . stream = function ( stream ) {
return cache && cacheStream === stream ? cache : cache = transformRadians ( preclip ( rotate , projectResample ( postclip ( cacheStream = stream ) ) ) ) ;
} ;
projection . clipAngle = function ( _ ) {
return arguments . length ? ( preclip = + _ ? clipCircle ( theta = _ * radians , 6 * radians ) : ( theta = null , clipAntimeridian ) , reset ( ) ) : theta * degrees$1 ;
} ;
projection . clipExtent = function ( _ ) {
return arguments . length ? ( postclip = _ == null ? ( x0 = y0 = x1 = y1 = null , identity$4 ) : clipExtent ( x0 = + _ [ 0 ] [ 0 ] , y0 = + _ [ 0 ] [ 1 ] , x1 = + _ [ 1 ] [ 0 ] , y1 = + _ [ 1 ] [ 1 ] ) , reset ( ) ) : x0 == null ? null : [
[ x0 , y0 ] ,
[ x1 , y1 ]
] ;
} ;
projection . scale = function ( _ ) {
return arguments . length ? ( k = + _ , recenter ( ) ) : k ;
} ;
projection . translate = function ( _ ) {
return arguments . length ? ( x = + _ [ 0 ] , y = + _ [ 1 ] , recenter ( ) ) : [ x , y ] ;
} ;
projection . center = function ( _ ) {
return arguments . length ? ( lambda = _ [ 0 ] % 360 * radians , phi = _ [ 1 ] % 360 * radians , recenter ( ) ) : [ lambda * degrees$1 , phi * degrees$1 ] ;
} ;
projection . rotate = function ( _ ) {
return arguments . length ? ( deltaLambda = _ [ 0 ] % 360 * radians , deltaPhi = _ [ 1 ] % 360 * radians , deltaGamma = _ . length > 2 ? _ [ 2 ] % 360 * radians : 0 , recenter ( ) ) : [ deltaLambda * degrees$1 , deltaPhi * degrees$1 , deltaGamma * degrees$1 ] ;
} ;
projection . precision = function ( _ ) {
return arguments . length ? ( projectResample = resample ( projectTransform , delta2 = _ * _ ) , reset ( ) ) : sqrt ( delta2 ) ;
} ;
projection . fitExtent = function ( extent , object ) {
return fitExtent ( projection , extent , object ) ;
} ;
projection . fitSize = function ( size , object ) {
return fitSize ( projection , size , object ) ;
} ;
function recenter ( ) {
projectRotate = compose ( rotate = rotateRadians ( deltaLambda , deltaPhi , deltaGamma ) , project ) ;
var center = project ( lambda , phi ) ;
dx = x - center [ 0 ] * k ;
dy = y + center [ 1 ] * k ;
return reset ( ) ;
}
function reset ( ) {
cache = cacheStream = null ;
return projection ;
}
return function ( ) {
project = projectAt . apply ( this , arguments ) ;
projection . invert = project . invert && invert ;
return recenter ( ) ;
} ;
}
function conicProjection ( projectAt ) {
var phi0 = 0 ,
phi1 = pi$3 / 3 ,
m = projectionMutator ( projectAt ) ,
p = m ( phi0 , phi1 ) ;
p . parallels = function ( _ ) {
return arguments . length ? m ( phi0 = _ [ 0 ] * radians , phi1 = _ [ 1 ] * radians ) : [ phi0 * degrees$1 , phi1 * degrees$1 ] ;
} ;
return p ;
}
function cylindricalEqualAreaRaw ( phi0 ) {
var cosPhi0 = cos$1 ( phi0 ) ;
function forward ( lambda , phi ) {
return [ lambda * cosPhi0 , sin$1 ( phi ) / cosPhi0 ] ;
}
forward . invert = function ( x , y ) {
return [ x / cosPhi0 , asin ( y * cosPhi0 ) ] ;
} ;
return forward ;
}
function conicEqualAreaRaw ( y0 , y1 ) {
var sy0 = sin$1 ( y0 ) ,
n = ( sy0 + sin$1 ( y1 ) ) / 2 ;
// Are the parallels symmetrical around the Equator?
if ( abs ( n ) < epsilon$2 ) return cylindricalEqualAreaRaw ( y0 ) ;
var c = 1 + sy0 * ( 2 * n - sy0 ) ,
r0 = sqrt ( c ) / n ;
function project ( x , y ) {
var r = sqrt ( c - 2 * n * sin$1 ( y ) ) / n ;
return [ r * sin$1 ( x *= n ) , r0 - r * cos$1 ( x ) ] ;
}
project . invert = function ( x , y ) {
var r0y = r0 - y ;
return [ atan2 ( x , abs ( r0y ) ) / n * sign ( r0y ) , asin ( ( c - ( x * x + r0y * r0y ) * n * n ) / ( 2 * n ) ) ] ;
} ;
return project ;
}
var conicEqualArea = function ( ) {
return conicProjection ( conicEqualAreaRaw )
. scale ( 155.424 )
. center ( [ 0 , 33.6442 ] ) ;
} ;
var albers = function ( ) {
return conicEqualArea ( )
. parallels ( [ 29.5 , 45.5 ] )
. scale ( 1070 )
. translate ( [ 480 , 250 ] )
. rotate ( [ 96 , 0 ] )
. center ( [ - 0.6 , 38.7 ] ) ;
} ;
// The projections must have mutually exclusive clip regions on the sphere,
// as this will avoid emitting interleaving lines and polygons.
function multiplex ( streams ) {
var n = streams . length ;
return {
point : function ( x , y ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . point ( x , y ) ; } ,
sphere : function ( ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . sphere ( ) ; } ,
lineStart : function ( ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . lineStart ( ) ; } ,
lineEnd : function ( ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . lineEnd ( ) ; } ,
polygonStart : function ( ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . polygonStart ( ) ; } ,
polygonEnd : function ( ) { var i = - 1 ; while ( ++ i < n ) streams [ i ] . polygonEnd ( ) ; }
} ;
}
// A composite projection for the United States, configured by default for
// 960× ×
// scale to 1285 and adjust the translate accordingly. The set of standard
// parallels for each region comes from USGS, which is published here:
// http://egsc.usgs.gov/isb/pubs/MapProjections/projections.html#albers
var albersUsa = function ( ) {
var cache ,
cacheStream ,
lower48 = albers ( ) ,
lower48Point ,
alaska = conicEqualArea ( ) . rotate ( [ 154 , 0 ] ) . center ( [ - 2 , 58.5 ] ) . parallels ( [ 55 , 65 ] ) ,
alaskaPoint , // EPSG:3338
hawaii = conicEqualArea ( ) . rotate ( [ 157 , 0 ] ) . center ( [ - 3 , 19.9 ] ) . parallels ( [ 8 , 18 ] ) ,
hawaiiPoint , // ESRI:102007
point , pointStream = { point : function ( x , y ) { point = [ x , y ] ; } } ;
function albersUsa ( coordinates ) {
var x = coordinates [ 0 ] ,
y = coordinates [ 1 ] ;
return point = null ,
( lower48Point . point ( x , y ) , point ) ||
( alaskaPoint . point ( x , y ) , point ) ||
( hawaiiPoint . point ( x , y ) , point ) ;
}
albersUsa . invert = function ( coordinates ) {
var k = lower48 . scale ( ) ,
t = lower48 . translate ( ) ,
x = ( coordinates [ 0 ] - t [ 0 ] ) / k ,
y = ( coordinates [ 1 ] - t [ 1 ] ) / k ;
return ( y >= 0.120 && y < 0.234 && x >= - 0.425 && x < - 0.214 ? alaska :
y >= 0.166 && y < 0.234 && x >= - 0.214 && x < - 0.115 ? hawaii :
lower48 ) . invert ( coordinates ) ;
} ;
albersUsa . stream = function ( stream ) {
return cache && cacheStream === stream ? cache : cache = multiplex ( [ lower48 . stream ( cacheStream = stream ) , alaska . stream ( stream ) , hawaii . stream ( stream ) ] ) ;
} ;
albersUsa . precision = function ( _ ) {
if ( ! arguments . length ) return lower48 . precision ( ) ;
lower48 . precision ( _ ) , alaska . precision ( _ ) , hawaii . precision ( _ ) ;
return reset ( ) ;
} ;
albersUsa . scale = function ( _ ) {
if ( ! arguments . length ) return lower48 . scale ( ) ;
lower48 . scale ( _ ) , alaska . scale ( _ * 0.35 ) , hawaii . scale ( _ ) ;
return albersUsa . translate ( lower48 . translate ( ) ) ;
} ;
albersUsa . translate = function ( _ ) {
if ( ! arguments . length ) return lower48 . translate ( ) ;
var k = lower48 . scale ( ) ,
x = + _ [ 0 ] ,
y = + _ [ 1 ] ;
lower48Point = lower48
. translate ( _ )
. clipExtent ( [
[ x - 0.455 * k , y - 0.238 * k ] ,
[ x + 0.455 * k , y + 0.238 * k ]
] )
. stream ( pointStream ) ;
alaskaPoint = alaska
. translate ( [ x - 0.307 * k , y + 0.201 * k ] )
. clipExtent ( [
[ x - 0.425 * k + epsilon$2 , y + 0.120 * k + epsilon$2 ] ,
[ x - 0.214 * k - epsilon$2 , y + 0.234 * k - epsilon$2 ]
] )
. stream ( pointStream ) ;
hawaiiPoint = hawaii
. translate ( [ x - 0.205 * k , y + 0.212 * k ] )
. clipExtent ( [
[ x - 0.214 * k + epsilon$2 , y + 0.166 * k + epsilon$2 ] ,
[ x - 0.115 * k - epsilon$2 , y + 0.234 * k - epsilon$2 ]
] )
. stream ( pointStream ) ;
return reset ( ) ;
} ;
albersUsa . fitExtent = function ( extent , object ) {
return fitExtent ( albersUsa , extent , object ) ;
} ;
albersUsa . fitSize = function ( size , object ) {
return fitSize ( albersUsa , size , object ) ;
} ;
function reset ( ) {
cache = cacheStream = null ;
return albersUsa ;
}
return albersUsa . scale ( 1070 ) ;
} ;
function azimuthalRaw ( scale ) {
return function ( x , y ) {
var cx = cos$1 ( x ) ,
cy = cos$1 ( y ) ,
k = scale ( cx * cy ) ;
return [
k * cy * sin$1 ( x ) ,
k * sin$1 ( y )
] ;
}
}
function azimuthalInvert ( angle ) {
return function ( x , y ) {
var z = sqrt ( x * x + y * y ) ,
c = angle ( z ) ,
sc = sin$1 ( c ) ,
cc = cos$1 ( c ) ;
return [
atan2 ( x * sc , z * cc ) ,
asin ( z && y * sc / z )
] ;
}
}
var azimuthalEqualAreaRaw = azimuthalRaw ( function ( cxcy ) {
return sqrt ( 2 / ( 1 + cxcy ) ) ;
} ) ;
azimuthalEqualAreaRaw . invert = azimuthalInvert ( function ( z ) {
return 2 * asin ( z / 2 ) ;
} ) ;
var azimuthalEqualArea = function ( ) {
return projection ( azimuthalEqualAreaRaw )
. scale ( 124.75 )
. clipAngle ( 180 - 1e-3 ) ;
} ;
var azimuthalEquidistantRaw = azimuthalRaw ( function ( c ) {
return ( c = acos ( c ) ) && c / sin$1 ( c ) ;
} ) ;
azimuthalEquidistantRaw . invert = azimuthalInvert ( function ( z ) {
return z ;
} ) ;
var azimuthalEquidistant = function ( ) {
return projection ( azimuthalEquidistantRaw )
. scale ( 79.4188 )
. clipAngle ( 180 - 1e-3 ) ;
} ;
function mercatorRaw ( lambda , phi ) {
return [ lambda , log ( tan ( ( halfPi$2 + phi ) / 2 ) ) ] ;
}
mercatorRaw . invert = function ( x , y ) {
return [ x , 2 * atan ( exp ( y ) ) - halfPi$2 ] ;
} ;
var mercator = function ( ) {
return mercatorProjection ( mercatorRaw )
. scale ( 961 / tau$3 ) ;
} ;
function mercatorProjection ( project ) {
var m = projection ( project ) ,
scale = m . scale ,
translate = m . translate ,
clipExtent = m . clipExtent ,
clipAuto ;
m . scale = function ( _ ) {
return arguments . length ? ( scale ( _ ) , clipAuto && m . clipExtent ( null ) , m ) : scale ( ) ;
} ;
m . translate = function ( _ ) {
return arguments . length ? ( translate ( _ ) , clipAuto && m . clipExtent ( null ) , m ) : translate ( ) ;
} ;
m . clipExtent = function ( _ ) {
if ( ! arguments . length ) return clipAuto ? null : clipExtent ( ) ;
if ( clipAuto = _ == null ) {
var k = pi$3 * scale ( ) ,
t = translate ( ) ;
_ = [
[ t [ 0 ] - k , t [ 1 ] - k ] ,
[ t [ 0 ] + k , t [ 1 ] + k ]
] ;
}
clipExtent ( _ ) ;
return m ;
} ;
return m . clipExtent ( null ) ;
}
function tany ( y ) {
return tan ( ( halfPi$2 + y ) / 2 ) ;
}
function conicConformalRaw ( y0 , y1 ) {
var cy0 = cos$1 ( y0 ) ,
n = y0 === y1 ? sin$1 ( y0 ) : log ( cy0 / cos$1 ( y1 ) ) / log ( tany ( y1 ) / tany ( y0 ) ) ,
f = cy0 * pow ( tany ( y0 ) , n ) / n ;
if ( ! n ) return mercatorRaw ;
function project ( x , y ) {
if ( f > 0 ) { if ( y < - halfPi$2 + epsilon$2 ) y = - halfPi$2 + epsilon$2 ; } else { if ( y > halfPi$2 - epsilon$2 ) y = halfPi$2 - epsilon$2 ; }
var r = f / pow ( tany ( y ) , n ) ;
return [ r * sin$1 ( n * x ) , f - r * cos$1 ( n * x ) ] ;
}
project . invert = function ( x , y ) {
var fy = f - y ,
r = sign ( n ) * sqrt ( x * x + fy * fy ) ;
return [ atan2 ( x , abs ( fy ) ) / n * sign ( fy ) , 2 * atan ( pow ( f / r , 1 / n ) ) - halfPi$2 ] ;
} ;
return project ;
}
var conicConformal = function ( ) {
return conicProjection ( conicConformalRaw )
. scale ( 109.5 )
. parallels ( [ 30 , 30 ] ) ;
} ;
function equirectangularRaw ( lambda , phi ) {
return [ lambda , phi ] ;
}
equirectangularRaw . invert = equirectangularRaw ;
var equirectangular = function ( ) {
return projection ( equirectangularRaw )
. scale ( 152.63 ) ;
} ;
function conicEquidistantRaw ( y0 , y1 ) {
var cy0 = cos$1 ( y0 ) ,
n = y0 === y1 ? sin$1 ( y0 ) : ( cy0 - cos$1 ( y1 ) ) / ( y1 - y0 ) ,
g = cy0 / n + y0 ;
if ( abs ( n ) < epsilon$2 ) return equirectangularRaw ;
function project ( x , y ) {
var gy = g - y ,
nx = n * x ;
return [ gy * sin$1 ( nx ) , g - gy * cos$1 ( nx ) ] ;
}
project . invert = function ( x , y ) {
var gy = g - y ;
return [ atan2 ( x , abs ( gy ) ) / n * sign ( gy ) , g - sign ( n ) * sqrt ( x * x + gy * gy ) ] ;
} ;
return project ;
}
var conicEquidistant = function ( ) {
return conicProjection ( conicEquidistantRaw )
. scale ( 131.154 )
. center ( [ 0 , 13.9389 ] ) ;
} ;
function gnomonicRaw ( x , y ) {
var cy = cos$1 ( y ) ,
k = cos$1 ( x ) * cy ;
return [ cy * sin$1 ( x ) / k , sin$1 ( y ) / k ] ;
}
gnomonicRaw . invert = azimuthalInvert ( atan ) ;
var gnomonic = function ( ) {
return projection ( gnomonicRaw )
. scale ( 144.049 )
. clipAngle ( 60 ) ;
} ;
function scaleTranslate ( kx , ky , tx , ty ) {
return kx === 1 && ky === 1 && tx === 0 && ty === 0 ? identity$4 : transformer ( {
point : function ( x , y ) {
this . stream . point ( x * kx + tx , y * ky + ty ) ;
}
} ) ;
}
var identity$5 = function ( ) {
var k = 1 ,
tx = 0 ,
ty = 0 ,
sx = 1 ,
sy = 1 ,
transform = identity$4 , // scale, translate and reflect
x0 = null ,
y0 , x1 , y1 , clip = identity$4 , // clip extent
cache ,
cacheStream ,
projection ;
function reset ( ) {
cache = cacheStream = null ;
return projection ;
}
return projection = {
stream : function ( stream ) {
return cache && cacheStream === stream ? cache : cache = transform ( clip ( cacheStream = stream ) ) ;
} ,
clipExtent : function ( _ ) {
return arguments . length ? ( clip = _ == null ? ( x0 = y0 = x1 = y1 = null , identity$4 ) : clipExtent ( x0 = + _ [ 0 ] [ 0 ] , y0 = + _ [ 0 ] [ 1 ] , x1 = + _ [ 1 ] [ 0 ] , y1 = + _ [ 1 ] [ 1 ] ) , reset ( ) ) : x0 == null ? null : [
[ x0 , y0 ] ,
[ x1 , y1 ]
] ;
} ,
scale : function ( _ ) {
return arguments . length ? ( transform = scaleTranslate ( ( k = + _ ) * sx , k * sy , tx , ty ) , reset ( ) ) : k ;
} ,
translate : function ( _ ) {
return arguments . length ? ( transform = scaleTranslate ( k * sx , k * sy , tx = + _ [ 0 ] , ty = + _ [ 1 ] ) , reset ( ) ) : [ tx , ty ] ;
} ,
reflectX : function ( _ ) {
return arguments . length ? ( transform = scaleTranslate ( k * ( sx = _ ? - 1 : 1 ) , k * sy , tx , ty ) , reset ( ) ) : sx < 0 ;
} ,
reflectY : function ( _ ) {
return arguments . length ? ( transform = scaleTranslate ( k * sx , k * ( sy = _ ? - 1 : 1 ) , tx , ty ) , reset ( ) ) : sy < 0 ;
} ,
fitExtent : function ( extent , object ) {
return fitExtent ( projection , extent , object ) ;
} ,
fitSize : function ( size , object ) {
return fitSize ( projection , size , object ) ;
}
} ;
} ;
function orthographicRaw ( x , y ) {
return [ cos$1 ( y ) * sin$1 ( x ) , sin$1 ( y ) ] ;
}
orthographicRaw . invert = azimuthalInvert ( asin ) ;
var orthographic = function ( ) {
return projection ( orthographicRaw )
. scale ( 249.5 )
. clipAngle ( 90 + epsilon$2 ) ;
} ;
function stereographicRaw ( x , y ) {
var cy = cos$1 ( y ) ,
k = 1 + cos$1 ( x ) * cy ;
return [ cy * sin$1 ( x ) / k , sin$1 ( y ) / k ] ;
}
stereographicRaw . invert = azimuthalInvert ( function ( z ) {
return 2 * atan ( z ) ;
} ) ;
var stereographic = function ( ) {
return projection ( stereographicRaw )
. scale ( 250 )
. clipAngle ( 142 ) ;
} ;
function transverseMercatorRaw ( lambda , phi ) {
return [ log ( tan ( ( halfPi$2 + phi ) / 2 ) ) , - lambda ] ;
}
transverseMercatorRaw . invert = function ( x , y ) {
return [ - y , 2 * atan ( exp ( x ) ) - halfPi$2 ] ;
} ;
var transverseMercator = function ( ) {
var m = mercatorProjection ( transverseMercatorRaw ) ,
center = m . center ,
rotate = m . rotate ;
m . center = function ( _ ) {
return arguments . length ? center ( [ - _ [ 1 ] , _ [ 0 ] ] ) : ( _ = center ( ) , [ _ [ 1 ] , - _ [ 0 ] ] ) ;
} ;
m . rotate = function ( _ ) {
return arguments . length ? rotate ( [ _ [ 0 ] , _ [ 1 ] , _ . length > 2 ? _ [ 2 ] + 90 : 90 ] ) : ( _ = rotate ( ) , [ _ [ 0 ] , _ [ 1 ] , _ [ 2 ] - 90 ] ) ;
} ;
return rotate ( [ 0 , 0 , 90 ] )
. scale ( 159.155 ) ;
} ;
function defaultSeparation ( a , b ) {
return a . parent === b . parent ? 1 : 2 ;
}
function meanX ( children ) {
return children . reduce ( meanXReduce , 0 ) / children . length ;
}
function meanXReduce ( x , c ) {
return x + c . x ;
}
function maxY ( children ) {
return 1 + children . reduce ( maxYReduce , 0 ) ;
}
function maxYReduce ( y , c ) {
return Math . max ( y , c . y ) ;
}
function leafLeft ( node ) {
var children ;
while ( children = node . children ) node = children [ 0 ] ;
return node ;
}
function leafRight ( node ) {
var children ;
while ( children = node . children ) node = children [ children . length - 1 ] ;
return node ;
}
var cluster = function ( ) {
var separation = defaultSeparation ,
dx = 1 ,
dy = 1 ,
nodeSize = false ;
function cluster ( root ) {
var previousNode ,
x = 0 ;
// First walk, computing the initial x & y values.
root . eachAfter ( function ( node ) {
var children = node . children ;
if ( children ) {
node . x = meanX ( children ) ;
node . y = maxY ( children ) ;
} else {
node . x = previousNode ? x += separation ( node , previousNode ) : 0 ;
node . y = 0 ;
previousNode = node ;
}
} ) ;
var left = leafLeft ( root ) ,
right = leafRight ( root ) ,
x0 = left . x - separation ( left , right ) / 2 ,
x1 = right . x + separation ( right , left ) / 2 ;
// Second walk, normalizing x & y to the desired size.
return root . eachAfter ( nodeSize ? function ( node ) {
node . x = ( node . x - root . x ) * dx ;
node . y = ( root . y - node . y ) * dy ;
} : function ( node ) {
node . x = ( node . x - x0 ) / ( x1 - x0 ) * dx ;
node . y = ( 1 - ( root . y ? node . y / root . y : 1 ) ) * dy ;
} ) ;
}
cluster . separation = function ( x ) {
return arguments . length ? ( separation = x , cluster ) : separation ;
} ;
cluster . size = function ( x ) {
return arguments . length ? ( nodeSize = false , dx = + x [ 0 ] , dy = + x [ 1 ] , cluster ) : ( nodeSize ? null : [ dx , dy ] ) ;
} ;
cluster . nodeSize = function ( x ) {
return arguments . length ? ( nodeSize = true , dx = + x [ 0 ] , dy = + x [ 1 ] , cluster ) : ( nodeSize ? [ dx , dy ] : null ) ;
} ;
return cluster ;
} ;
function count ( node ) {
var sum = 0 ,
children = node . children ,
i = children && children . length ;
if ( ! i ) sum = 1 ;
else
while ( -- i >= 0 ) sum += children [ i ] . value ;
node . value = sum ;
}
var node _count = function ( ) {
return this . eachAfter ( count ) ;
} ;
var node _each = function ( callback ) {
var node = this ,
current , next = [ node ] ,
children , i , n ;
do {
current = next . reverse ( ) , next = [ ] ;
while ( node = current . pop ( ) ) {
callback ( node ) , children = node . children ;
if ( children )
for ( i = 0 , n = children . length ; i < n ; ++ i ) {
next . push ( children [ i ] ) ;
}
}
} while ( next . length ) ;
return this ;
} ;
var node _eachBefore = function ( callback ) {
var node = this ,
nodes = [ node ] ,
children , i ;
while ( node = nodes . pop ( ) ) {
callback ( node ) , children = node . children ;
if ( children )
for ( i = children . length - 1 ; i >= 0 ; -- i ) {
nodes . push ( children [ i ] ) ;
}
}
return this ;
} ;
var node _eachAfter = function ( callback ) {
var node = this ,
nodes = [ node ] ,
next = [ ] ,
children , i , n ;
while ( node = nodes . pop ( ) ) {
next . push ( node ) , children = node . children ;
if ( children )
for ( i = 0 , n = children . length ; i < n ; ++ i ) {
nodes . push ( children [ i ] ) ;
}
}
while ( node = next . pop ( ) ) {
callback ( node ) ;
}
return this ;
} ;
var node _sum = function ( value ) {
return this . eachAfter ( function ( node ) {
var sum = + value ( node . data ) || 0 ,
children = node . children ,
i = children && children . length ;
while ( -- i >= 0 ) sum += children [ i ] . value ;
node . value = sum ;
} ) ;
} ;
var node _sort = function ( compare ) {
return this . eachBefore ( function ( node ) {
if ( node . children ) {
node . children . sort ( compare ) ;
}
} ) ;
} ;
var node _path = function ( end ) {
var start = this ,
ancestor = leastCommonAncestor ( start , end ) ,
nodes = [ start ] ;
while ( start !== ancestor ) {
start = start . parent ;
nodes . push ( start ) ;
}
var k = nodes . length ;
while ( end !== ancestor ) {
nodes . splice ( k , 0 , end ) ;
end = end . parent ;
}
return nodes ;
} ;
function leastCommonAncestor ( a , b ) {
if ( a === b ) return a ;
var aNodes = a . ancestors ( ) ,
bNodes = b . ancestors ( ) ,
c = null ;
a = aNodes . pop ( ) ;
b = bNodes . pop ( ) ;
while ( a === b ) {
c = a ;
a = aNodes . pop ( ) ;
b = bNodes . pop ( ) ;
}
return c ;
}
var node _ancestors = function ( ) {
var node = this ,
nodes = [ node ] ;
while ( node = node . parent ) {
nodes . push ( node ) ;
}
return nodes ;
} ;
var node _descendants = function ( ) {
var nodes = [ ] ;
this . each ( function ( node ) {
nodes . push ( node ) ;
} ) ;
return nodes ;
} ;
var node _leaves = function ( ) {
var leaves = [ ] ;
this . eachBefore ( function ( node ) {
if ( ! node . children ) {
leaves . push ( node ) ;
}
} ) ;
return leaves ;
} ;
var node _links = function ( ) {
var root = this ,
links = [ ] ;
root . each ( function ( node ) {
if ( node !== root ) { // Don’ ’
links . push ( { source : node . parent , target : node } ) ;
}
} ) ;
return links ;
} ;
function hierarchy ( data , children ) {
var root = new Node ( data ) ,
valued = + data . value && ( root . value = data . value ) ,
node ,
nodes = [ root ] ,
child ,
childs ,
i ,
n ;
if ( children == null ) children = defaultChildren ;
while ( node = nodes . pop ( ) ) {
if ( valued ) node . value = + node . data . value ;
if ( ( childs = children ( node . data ) ) && ( n = childs . length ) ) {
node . children = new Array ( n ) ;
for ( i = n - 1 ; i >= 0 ; -- i ) {
nodes . push ( child = node . children [ i ] = new Node ( childs [ i ] ) ) ;
child . parent = node ;
child . depth = node . depth + 1 ;
}
}
}
return root . eachBefore ( computeHeight ) ;
}
function node _copy ( ) {
return hierarchy ( this ) . eachBefore ( copyData ) ;
}
function defaultChildren ( d ) {
return d . children ;
}
function copyData ( node ) {
node . data = node . data . data ;
}
function computeHeight ( node ) {
var height = 0 ;
do node . height = height ;
while ( ( node = node . parent ) && ( node . height < ++ height ) ) ;
}
function Node ( data ) {
this . data = data ;
this . depth =
this . height = 0 ;
this . parent = null ;
}
Node . prototype = hierarchy . prototype = {
constructor : Node ,
count : node _count ,
each : node _each ,
eachAfter : node _eachAfter ,
eachBefore : node _eachBefore ,
sum : node _sum ,
sort : node _sort ,
path : node _path ,
ancestors : node _ancestors ,
descendants : node _descendants ,
leaves : node _leaves ,
links : node _links ,
copy : node _copy
} ;
function Node$2 ( value ) {
this . _ = value ;
this . next = null ;
}
var shuffle$1 = function ( array ) {
var i ,
n = ( array = array . slice ( ) ) . length ,
head = null ,
node = head ;
while ( n ) {
var next = new Node$2 ( array [ n - 1 ] ) ;
if ( node ) node = node . next = next ;
else node = head = next ;
array [ i ] = array [ -- n ] ;
}
return {
head : head ,
tail : node
} ;
} ;
var enclose = function ( circles ) {
return encloseN ( shuffle$1 ( circles ) , [ ] ) ;
} ;
function encloses ( a , b ) {
var dx = b . x - a . x ,
dy = b . y - a . y ,
dr = a . r - b . r ;
return dr * dr + 1e-6 > dx * dx + dy * dy ;
}
// Returns the smallest circle that contains circles L and intersects circles B.
function encloseN ( L , B ) {
var circle ,
l0 = null ,
l1 = L . head ,
l2 ,
p1 ;
switch ( B . length ) {
case 1 :
circle = enclose1 ( B [ 0 ] ) ;
break ;
case 2 :
circle = enclose2 ( B [ 0 ] , B [ 1 ] ) ;
break ;
case 3 :
circle = enclose3 ( B [ 0 ] , B [ 1 ] , B [ 2 ] ) ;
break ;
}
while ( l1 ) {
p1 = l1 . _ , l2 = l1 . next ;
if ( ! circle || ! encloses ( circle , p1 ) ) {
// Temporarily truncate L before l1.
if ( l0 ) L . tail = l0 , l0 . next = null ;
else L . head = L . tail = null ;
B . push ( p1 ) ;
circle = encloseN ( L , B ) ; // Note: reorders L!
B . pop ( ) ;
// Move l1 to the front of L and reconnect the truncated list L.
if ( L . head ) l1 . next = L . head , L . head = l1 ;
else l1 . next = null , L . head = L . tail = l1 ;
l0 = L . tail , l0 . next = l2 ;
} else {
l0 = l1 ;
}
l1 = l2 ;
}
L . tail = l0 ;
return circle ;
}
function enclose1 ( a ) {
return {
x : a . x ,
y : a . y ,
r : a . r
} ;
}
function enclose2 ( a , b ) {
var x1 = a . x ,
y1 = a . y ,
r1 = a . r ,
x2 = b . x ,
y2 = b . y ,
r2 = b . r ,
x21 = x2 - x1 ,
y21 = y2 - y1 ,
r21 = r2 - r1 ,
l = Math . sqrt ( x21 * x21 + y21 * y21 ) ;
return {
x : ( x1 + x2 + x21 / l * r21 ) / 2 ,
y : ( y1 + y2 + y21 / l * r21 ) / 2 ,
r : ( l + r1 + r2 ) / 2
} ;
}
function enclose3 ( a , b , c ) {
var x1 = a . x ,
y1 = a . y ,
r1 = a . r ,
x2 = b . x ,
y2 = b . y ,
r2 = b . r ,
x3 = c . x ,
y3 = c . y ,
r3 = c . r ,
a2 = 2 * ( x1 - x2 ) ,
b2 = 2 * ( y1 - y2 ) ,
c2 = 2 * ( r2 - r1 ) ,
d2 = x1 * x1 + y1 * y1 - r1 * r1 - x2 * x2 - y2 * y2 + r2 * r2 ,
a3 = 2 * ( x1 - x3 ) ,
b3 = 2 * ( y1 - y3 ) ,
c3 = 2 * ( r3 - r1 ) ,
d3 = x1 * x1 + y1 * y1 - r1 * r1 - x3 * x3 - y3 * y3 + r3 * r3 ,
ab = a3 * b2 - a2 * b3 ,
xa = ( b2 * d3 - b3 * d2 ) / ab - x1 ,
xb = ( b3 * c2 - b2 * c3 ) / ab ,
ya = ( a3 * d2 - a2 * d3 ) / ab - y1 ,
yb = ( a2 * c3 - a3 * c2 ) / ab ,
A = xb * xb + yb * yb - 1 ,
B = 2 * ( xa * xb + ya * yb + r1 ) ,
C = xa * xa + ya * ya - r1 * r1 ,
r = ( - B - Math . sqrt ( B * B - 4 * A * C ) ) / ( 2 * A ) ;
return {
x : xa + xb * r + x1 ,
y : ya + yb * r + y1 ,
r : r
} ;
}
function place ( a , b , c ) {
var ax = a . x ,
ay = a . y ,
da = b . r + c . r ,
db = a . r + c . r ,
dx = b . x - ax ,
dy = b . y - ay ,
dc = dx * dx + dy * dy ;
if ( dc ) {
var x = 0.5 + ( ( db *= db ) - ( da *= da ) ) / ( 2 * dc ) ,
y = Math . sqrt ( Math . max ( 0 , 2 * da * ( db + dc ) - ( db -= dc ) * db - da * da ) ) / ( 2 * dc ) ;
c . x = ax + x * dx + y * dy ;
c . y = ay + x * dy - y * dx ;
} else {
c . x = ax + db ;
c . y = ay ;
}
}
function intersects ( a , b ) {
var dx = b . x - a . x ,
dy = b . y - a . y ,
dr = a . r + b . r ;
return dr * dr - 1e-6 > dx * dx + dy * dy ;
}
function distance1 ( a , b ) {
var l = a . _ . r ;
while ( a !== b ) l += 2 * ( a = a . next ) . _ . r ;
return l - b . _ . r ;
}
function distance2 ( circle , x , y ) {
var dx = circle . x - x ,
dy = circle . y - y ;
return dx * dx + dy * dy ;
}
function Node$1 ( circle ) {
this . _ = circle ;
this . next = null ;
this . previous = null ;
}
function packEnclose ( circles ) {
if ( ! ( n = circles . length ) ) return 0 ;
var a , b , c , n ;
// Place the first circle.
a = circles [ 0 ] , a . x = 0 , a . y = 0 ;
if ( ! ( n > 1 ) ) return a . r ;
// Place the second circle.
b = circles [ 1 ] , a . x = - b . r , b . x = a . r , b . y = 0 ;
if ( ! ( n > 2 ) ) return a . r + b . r ;
// Place the third circle.
place ( b , a , c = circles [ 2 ] ) ;
// Initialize the weighted centroid.
var aa = a . r * a . r ,
ba = b . r * b . r ,
ca = c . r * c . r ,
oa = aa + ba + ca ,
ox = aa * a . x + ba * b . x + ca * c . x ,
oy = aa * a . y + ba * b . y + ca * c . y ,
cx , cy , i , j , k , sj , sk ;
// Initialize the front-chain using the first three circles a, b and c.
a = new Node$1 ( a ) , b = new Node$1 ( b ) , c = new Node$1 ( c ) ;
a . next = c . previous = b ;
b . next = a . previous = c ;
c . next = b . previous = a ;
// Attempt to place each remaining circle…
pack : for ( i = 3 ; i < n ; ++ i ) {
place ( a . _ , b . _ , c = circles [ i ] ) , c = new Node$1 ( c ) ;
// Find the closest intersecting circle on the front-chain, if any.
// “Closeness” is determined by linear distance along the front-chain.
// “Ahead” or “behind” is likewise determined by linear distance.
j = b . next , k = a . previous , sj = b . _ . r , sk = a . _ . r ;
do {
if ( sj <= sk ) {
if ( intersects ( j . _ , c . _ ) ) {
if ( sj + a . _ . r + b . _ . r > distance1 ( j , b ) ) a = j ;
else b = j ;
a . next = b , b . previous = a , -- i ;
continue pack ;
}
sj += j . _ . r , j = j . next ;
} else {
if ( intersects ( k . _ , c . _ ) ) {
if ( distance1 ( a , k ) > sk + a . _ . r + b . _ . r ) a = k ;
else b = k ;
a . next = b , b . previous = a , -- i ;
continue pack ;
}
sk += k . _ . r , k = k . previous ;
}
} while ( j !== k . next ) ;
// Success! Insert the new circle c between a and b.
c . previous = a , c . next = b , a . next = b . previous = b = c ;
// Update the weighted centroid.
oa += ca = c . _ . r * c . _ . r ;
ox += ca * c . _ . x ;
oy += ca * c . _ . y ;
// Compute the new closest circle a to centroid.
aa = distance2 ( a . _ , cx = ox / oa , cy = oy / oa ) ;
while ( ( c = c . next ) !== b ) {
if ( ( ca = distance2 ( c . _ , cx , cy ) ) < aa ) {
a = c , aa = ca ;
}
}
b = a . next ;
}
// Compute the enclosing circle of the front chain.
a = [ b . _ ] , c = b ;
while ( ( c = c . next ) !== b ) a . push ( c . _ ) ;
c = enclose ( a ) ;
// Translate the circles to put the enclosing circle around the origin.
for ( i = 0 ; i < n ; ++ i ) a = circles [ i ] , a . x -= c . x , a . y -= c . y ;
return c . r ;
}
var siblings = function ( circles ) {
packEnclose ( circles ) ;
return circles ;
} ;
function optional ( f ) {
return f == null ? null : required ( f ) ;
}
function required ( f ) {
if ( typeof f !== "function" ) throw new Error ;
return f ;
}
function constantZero ( ) {
return 0 ;
}
var constant$8 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
function defaultRadius$1 ( d ) {
return Math . sqrt ( d . value ) ;
}
var index$2 = function ( ) {
var radius = null ,
dx = 1 ,
dy = 1 ,
padding = constantZero ;
function pack ( root ) {
root . x = dx / 2 , root . y = dy / 2 ;
if ( radius ) {
root . eachBefore ( radiusLeaf ( radius ) )
. eachAfter ( packChildren ( padding , 0.5 ) )
. eachBefore ( translateChild ( 1 ) ) ;
} else {
root . eachBefore ( radiusLeaf ( defaultRadius$1 ) )
. eachAfter ( packChildren ( constantZero , 1 ) )
. eachAfter ( packChildren ( padding , root . r / Math . min ( dx , dy ) ) )
. eachBefore ( translateChild ( Math . min ( dx , dy ) / ( 2 * root . r ) ) ) ;
}
return root ;
}
pack . radius = function ( x ) {
return arguments . length ? ( radius = optional ( x ) , pack ) : radius ;
} ;
pack . size = function ( x ) {
return arguments . length ? ( dx = + x [ 0 ] , dy = + x [ 1 ] , pack ) : [ dx , dy ] ;
} ;
pack . padding = function ( x ) {
return arguments . length ? ( padding = typeof x === "function" ? x : constant$8 ( + x ) , pack ) : padding ;
} ;
return pack ;
} ;
function radiusLeaf ( radius ) {
return function ( node ) {
if ( ! node . children ) {
node . r = Math . max ( 0 , + radius ( node ) || 0 ) ;
}
} ;
}
function packChildren ( padding , k ) {
return function ( node ) {
if ( children = node . children ) {
var children ,
i ,
n = children . length ,
r = padding ( node ) * k || 0 ,
e ;
if ( r )
for ( i = 0 ; i < n ; ++ i ) children [ i ] . r += r ;
e = packEnclose ( children ) ;
if ( r )
for ( i = 0 ; i < n ; ++ i ) children [ i ] . r -= r ;
node . r = e + r ;
}
} ;
}
function translateChild ( k ) {
return function ( node ) {
var parent = node . parent ;
node . r *= k ;
if ( parent ) {
node . x = parent . x + k * node . x ;
node . y = parent . y + k * node . y ;
}
} ;
}
var roundNode = function ( node ) {
node . x0 = Math . round ( node . x0 ) ;
node . y0 = Math . round ( node . y0 ) ;
node . x1 = Math . round ( node . x1 ) ;
node . y1 = Math . round ( node . y1 ) ;
} ;
var treemapDice = function ( parent , x0 , y0 , x1 , y1 ) {
var nodes = parent . children ,
node ,
i = - 1 ,
n = nodes . length ,
k = parent . value && ( x1 - x0 ) / parent . value ;
while ( ++ i < n ) {
node = nodes [ i ] , node . y0 = y0 , node . y1 = y1 ;
node . x0 = x0 , node . x1 = x0 += node . value * k ;
}
} ;
var partition = function ( ) {
var dx = 1 ,
dy = 1 ,
padding = 0 ,
round = false ;
function partition ( root ) {
var n = root . height + 1 ;
root . x0 =
root . y0 = padding ;
root . x1 = dx ;
root . y1 = dy / n ;
root . eachBefore ( positionNode ( dy , n ) ) ;
if ( round ) root . eachBefore ( roundNode ) ;
return root ;
}
function positionNode ( dy , n ) {
return function ( node ) {
if ( node . children ) {
treemapDice ( node , node . x0 , dy * ( node . depth + 1 ) / n , node . x1 , dy * ( node . depth + 2 ) / n ) ;
}
var x0 = node . x0 ,
y0 = node . y0 ,
x1 = node . x1 - padding ,
y1 = node . y1 - padding ;
if ( x1 < x0 ) x0 = x1 = ( x0 + x1 ) / 2 ;
if ( y1 < y0 ) y0 = y1 = ( y0 + y1 ) / 2 ;
node . x0 = x0 ;
node . y0 = y0 ;
node . x1 = x1 ;
node . y1 = y1 ;
} ;
}
partition . round = function ( x ) {
return arguments . length ? ( round = ! ! x , partition ) : round ;
} ;
partition . size = function ( x ) {
return arguments . length ? ( dx = + x [ 0 ] , dy = + x [ 1 ] , partition ) : [ dx , dy ] ;
} ;
partition . padding = function ( x ) {
return arguments . length ? ( padding = + x , partition ) : padding ;
} ;
return partition ;
} ;
var keyPrefix$1 = "$" ;
var preroot = { depth : - 1 } ;
var ambiguous = { } ;
function defaultId ( d ) {
return d . id ;
}
function defaultParentId ( d ) {
return d . parentId ;
}
var stratify = function ( ) {
var id = defaultId ,
parentId = defaultParentId ;
function stratify ( data ) {
var d ,
i ,
n = data . length ,
root ,
parent ,
node ,
nodes = new Array ( n ) ,
nodeId ,
nodeKey ,
nodeByKey = { } ;
for ( i = 0 ; i < n ; ++ i ) {
d = data [ i ] , node = nodes [ i ] = new Node ( d ) ;
if ( ( nodeId = id ( d , i , data ) ) != null && ( nodeId += "" ) ) {
nodeKey = keyPrefix$1 + ( node . id = nodeId ) ;
nodeByKey [ nodeKey ] = nodeKey in nodeByKey ? ambiguous : node ;
}
}
for ( i = 0 ; i < n ; ++ i ) {
node = nodes [ i ] , nodeId = parentId ( data [ i ] , i , data ) ;
if ( nodeId == null || ! ( nodeId += "" ) ) {
if ( root ) throw new Error ( "multiple roots" ) ;
root = node ;
} else {
parent = nodeByKey [ keyPrefix$1 + nodeId ] ;
if ( ! parent ) throw new Error ( "missing: " + nodeId ) ;
if ( parent === ambiguous ) throw new Error ( "ambiguous: " + nodeId ) ;
if ( parent . children ) parent . children . push ( node ) ;
else parent . children = [ node ] ;
node . parent = parent ;
}
}
if ( ! root ) throw new Error ( "no root" ) ;
root . parent = preroot ;
root . eachBefore ( function ( node ) { node . depth = node . parent . depth + 1 ; -- n ; } ) . eachBefore ( computeHeight ) ;
root . parent = null ;
if ( n > 0 ) throw new Error ( "cycle" ) ;
return root ;
}
stratify . id = function ( x ) {
return arguments . length ? ( id = required ( x ) , stratify ) : id ;
} ;
stratify . parentId = function ( x ) {
return arguments . length ? ( parentId = required ( x ) , stratify ) : parentId ;
} ;
return stratify ;
} ;
function defaultSeparation$1 ( a , b ) {
return a . parent === b . parent ? 1 : 2 ;
}
// function radialSeparation(a, b) {
// return (a.parent === b.parent ? 1 : 2) / a.depth;
// }
// This function is used to traverse the left contour of a subtree (or
// subforest). It returns the successor of v on this contour. This successor is
// either given by the leftmost child of v or by the thread of v. The function
// returns null if and only if v is on the highest level of its subtree.
function nextLeft ( v ) {
var children = v . children ;
return children ? children [ 0 ] : v . t ;
}
// This function works analogously to nextLeft.
function nextRight ( v ) {
var children = v . children ;
return children ? children [ children . length - 1 ] : v . t ;
}
// Shifts the current subtree rooted at w+. This is done by increasing
// prelim(w+) and mod(w+) by shift.
function moveSubtree ( wm , wp , shift ) {
var change = shift / ( wp . i - wm . i ) ;
wp . c -= change ;
wp . s += shift ;
wm . c += change ;
wp . z += shift ;
wp . m += shift ;
}
// All other shifts, applied to the smaller subtrees between w- and w+, are
// performed by this function. To prepare the shifts, we have to adjust
// change(w+), shift(w+), and change(w-).
function executeShifts ( v ) {
var shift = 0 ,
change = 0 ,
children = v . children ,
i = children . length ,
w ;
while ( -- i >= 0 ) {
w = children [ i ] ;
w . z += shift ;
w . m += shift ;
shift += w . s + ( change += w . c ) ;
}
}
// If vi-’ ’
// returns the specified (default) ancestor.
function nextAncestor ( vim , v , ancestor ) {
return vim . a . parent === v . parent ? vim . a : ancestor ;
}
function TreeNode ( node , i ) {
this . _ = node ;
this . parent = null ;
this . children = null ;
this . A = null ; // default ancestor
this . a = this ; // ancestor
this . z = 0 ; // prelim
this . m = 0 ; // mod
this . c = 0 ; // change
this . s = 0 ; // shift
this . t = null ; // thread
this . i = i ; // number
}
TreeNode . prototype = Object . create ( Node . prototype ) ;
function treeRoot ( root ) {
var tree = new TreeNode ( root , 0 ) ,
node ,
nodes = [ tree ] ,
child ,
children ,
i ,
n ;
while ( node = nodes . pop ( ) ) {
if ( children = node . _ . children ) {
node . children = new Array ( n = children . length ) ;
for ( i = n - 1 ; i >= 0 ; -- i ) {
nodes . push ( child = node . children [ i ] = new TreeNode ( children [ i ] , i ) ) ;
child . parent = node ;
}
}
}
( tree . parent = new TreeNode ( null , 0 ) ) . children = [ tree ] ;
return tree ;
}
// Node-link tree diagram using the Reingold-Tilford "tidy" algorithm
var tree = function ( ) {
var separation = defaultSeparation$1 ,
dx = 1 ,
dy = 1 ,
nodeSize = null ;
function tree ( root ) {
var t = treeRoot ( root ) ;
// Compute the layout using Buchheim et al.’
t . eachAfter ( firstWalk ) , t . parent . m = - t . z ;
t . eachBefore ( secondWalk ) ;
// If a fixed node size is specified, scale x and y.
if ( nodeSize ) root . eachBefore ( sizeNode ) ;
// If a fixed tree size is specified, scale x and y based on the extent.
// Compute the left-most, right-most, and depth-most nodes for extents.
else {
var left = root ,
right = root ,
bottom = root ;
root . eachBefore ( function ( node ) {
if ( node . x < left . x ) left = node ;
if ( node . x > right . x ) right = node ;
if ( node . depth > bottom . depth ) bottom = node ;
} ) ;
var s = left === right ? 1 : separation ( left , right ) / 2 ,
tx = s - left . x ,
kx = dx / ( right . x + s + tx ) ,
ky = dy / ( bottom . depth || 1 ) ;
root . eachBefore ( function ( node ) {
node . x = ( node . x + tx ) * kx ;
node . y = node . depth * ky ;
} ) ;
}
return root ;
}
// Computes a preliminary x-coordinate for v. Before that, FIRST WALK is
// applied recursively to the children of v, as well as the function
// APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the
// node v is placed to the midpoint of its outermost children.
function firstWalk ( v ) {
var children = v . children ,
siblings = v . parent . children ,
w = v . i ? siblings [ v . i - 1 ] : null ;
if ( children ) {
executeShifts ( v ) ;
var midpoint = ( children [ 0 ] . z + children [ children . length - 1 ] . z ) / 2 ;
if ( w ) {
v . z = w . z + separation ( v . _ , w . _ ) ;
v . m = v . z - midpoint ;
} else {
v . z = midpoint ;
}
} else if ( w ) {
v . z = w . z + separation ( v . _ , w . _ ) ;
}
v . parent . A = apportion ( v , w , v . parent . A || siblings [ 0 ] ) ;
}
// Computes all real x-coordinates by summing up the modifiers recursively.
function secondWalk ( v ) {
v . _ . x = v . z + v . parent . m ;
v . m += v . parent . m ;
}
// The core of the algorithm. Here, a new subtree is combined with the
// previous subtrees. Threads are used to traverse the inside and outside
// contours of the left and right subtree up to the highest common level. The
// vertices used for the traversals are vi+, vi-, vo-, and vo+, where the
// superscript o means outside and i means inside, the subscript - means left
// subtree and + means right subtree. For summing up the modifiers along the
// contour, we use respective variables si+, si-, so-, and so+. Whenever two
// nodes of the inside contours conflict, we compute the left one of the
// greatest uncommon ancestors using the function ANCESTOR and call MOVE
// SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.
// Finally, we add a new thread (if necessary).
function apportion ( v , w , ancestor ) {
if ( w ) {
var vip = v ,
vop = v ,
vim = w ,
vom = vip . parent . children [ 0 ] ,
sip = vip . m ,
sop = vop . m ,
sim = vim . m ,
som = vom . m ,
shift ;
while ( vim = nextRight ( vim ) , vip = nextLeft ( vip ) , vim && vip ) {
vom = nextLeft ( vom ) ;
vop = nextRight ( vop ) ;
vop . a = v ;
shift = vim . z + sim - vip . z - sip + separation ( vim . _ , vip . _ ) ;
if ( shift > 0 ) {
moveSubtree ( nextAncestor ( vim , v , ancestor ) , v , shift ) ;
sip += shift ;
sop += shift ;
}
sim += vim . m ;
sip += vip . m ;
som += vom . m ;
sop += vop . m ;
}
if ( vim && ! nextRight ( vop ) ) {
vop . t = vim ;
vop . m += sim - sop ;
}
if ( vip && ! nextLeft ( vom ) ) {
vom . t = vip ;
vom . m += sip - som ;
ancestor = v ;
}
}
return ancestor ;
}
function sizeNode ( node ) {
node . x *= dx ;
node . y = node . depth * dy ;
}
tree . separation = function ( x ) {
return arguments . length ? ( separation = x , tree ) : separation ;
} ;
tree . size = function ( x ) {
return arguments . length ? ( nodeSize = false , dx = + x [ 0 ] , dy = + x [ 1 ] , tree ) : ( nodeSize ? null : [ dx , dy ] ) ;
} ;
tree . nodeSize = function ( x ) {
return arguments . length ? ( nodeSize = true , dx = + x [ 0 ] , dy = + x [ 1 ] , tree ) : ( nodeSize ? [ dx , dy ] : null ) ;
} ;
return tree ;
} ;
var treemapSlice = function ( parent , x0 , y0 , x1 , y1 ) {
var nodes = parent . children ,
node ,
i = - 1 ,
n = nodes . length ,
k = parent . value && ( y1 - y0 ) / parent . value ;
while ( ++ i < n ) {
node = nodes [ i ] , node . x0 = x0 , node . x1 = x1 ;
node . y0 = y0 , node . y1 = y0 += node . value * k ;
}
} ;
var phi = ( 1 + Math . sqrt ( 5 ) ) / 2 ;
function squarifyRatio ( ratio , parent , x0 , y0 , x1 , y1 ) {
var rows = [ ] ,
nodes = parent . children ,
row ,
nodeValue ,
i0 = 0 ,
i1 = 0 ,
n = nodes . length ,
dx , dy ,
value = parent . value ,
sumValue ,
minValue ,
maxValue ,
newRatio ,
minRatio ,
alpha ,
beta ;
while ( i0 < n ) {
dx = x1 - x0 , dy = y1 - y0 ;
// Find the next non-empty node.
do sumValue = nodes [ i1 ++ ] . value ; while ( ! sumValue && i1 < n ) ;
minValue = maxValue = sumValue ;
alpha = Math . max ( dy / dx , dx / dy ) / ( value * ratio ) ;
beta = sumValue * sumValue * alpha ;
minRatio = Math . max ( maxValue / beta , beta / minValue ) ;
// Keep adding nodes while the aspect ratio maintains or improves.
for ( ; i1 < n ; ++ i1 ) {
sumValue += nodeValue = nodes [ i1 ] . value ;
if ( nodeValue < minValue ) minValue = nodeValue ;
if ( nodeValue > maxValue ) maxValue = nodeValue ;
beta = sumValue * sumValue * alpha ;
newRatio = Math . max ( maxValue / beta , beta / minValue ) ;
if ( newRatio > minRatio ) { sumValue -= nodeValue ; break ; }
minRatio = newRatio ;
}
// Position and record the row orientation.
rows . push ( row = { value : sumValue , dice : dx < dy , children : nodes . slice ( i0 , i1 ) } ) ;
if ( row . dice ) treemapDice ( row , x0 , y0 , x1 , value ? y0 += dy * sumValue / value : y1 ) ;
else treemapSlice ( row , x0 , y0 , value ? x0 += dx * sumValue / value : x1 , y1 ) ;
value -= sumValue , i0 = i1 ;
}
return rows ;
}
var squarify = ( ( function custom ( ratio ) {
function squarify ( parent , x0 , y0 , x1 , y1 ) {
squarifyRatio ( ratio , parent , x0 , y0 , x1 , y1 ) ;
}
squarify . ratio = function ( x ) {
return custom ( ( x = + x ) > 1 ? x : 1 ) ;
} ;
return squarify ;
} ) ) ( phi ) ;
var index$3 = function ( ) {
var tile = squarify ,
round = false ,
dx = 1 ,
dy = 1 ,
paddingStack = [ 0 ] ,
paddingInner = constantZero ,
paddingTop = constantZero ,
paddingRight = constantZero ,
paddingBottom = constantZero ,
paddingLeft = constantZero ;
function treemap ( root ) {
root . x0 =
root . y0 = 0 ;
root . x1 = dx ;
root . y1 = dy ;
root . eachBefore ( positionNode ) ;
paddingStack = [ 0 ] ;
if ( round ) root . eachBefore ( roundNode ) ;
return root ;
}
function positionNode ( node ) {
var p = paddingStack [ node . depth ] ,
x0 = node . x0 + p ,
y0 = node . y0 + p ,
x1 = node . x1 - p ,
y1 = node . y1 - p ;
if ( x1 < x0 ) x0 = x1 = ( x0 + x1 ) / 2 ;
if ( y1 < y0 ) y0 = y1 = ( y0 + y1 ) / 2 ;
node . x0 = x0 ;
node . y0 = y0 ;
node . x1 = x1 ;
node . y1 = y1 ;
if ( node . children ) {
p = paddingStack [ node . depth + 1 ] = paddingInner ( node ) / 2 ;
x0 += paddingLeft ( node ) - p ;
y0 += paddingTop ( node ) - p ;
x1 -= paddingRight ( node ) - p ;
y1 -= paddingBottom ( node ) - p ;
if ( x1 < x0 ) x0 = x1 = ( x0 + x1 ) / 2 ;
if ( y1 < y0 ) y0 = y1 = ( y0 + y1 ) / 2 ;
tile ( node , x0 , y0 , x1 , y1 ) ;
}
}
treemap . round = function ( x ) {
return arguments . length ? ( round = ! ! x , treemap ) : round ;
} ;
treemap . size = function ( x ) {
return arguments . length ? ( dx = + x [ 0 ] , dy = + x [ 1 ] , treemap ) : [ dx , dy ] ;
} ;
treemap . tile = function ( x ) {
return arguments . length ? ( tile = required ( x ) , treemap ) : tile ;
} ;
treemap . padding = function ( x ) {
return arguments . length ? treemap . paddingInner ( x ) . paddingOuter ( x ) : treemap . paddingInner ( ) ;
} ;
treemap . paddingInner = function ( x ) {
return arguments . length ? ( paddingInner = typeof x === "function" ? x : constant$8 ( + x ) , treemap ) : paddingInner ;
} ;
treemap . paddingOuter = function ( x ) {
return arguments . length ? treemap . paddingTop ( x ) . paddingRight ( x ) . paddingBottom ( x ) . paddingLeft ( x ) : treemap . paddingTop ( ) ;
} ;
treemap . paddingTop = function ( x ) {
return arguments . length ? ( paddingTop = typeof x === "function" ? x : constant$8 ( + x ) , treemap ) : paddingTop ;
} ;
treemap . paddingRight = function ( x ) {
return arguments . length ? ( paddingRight = typeof x === "function" ? x : constant$8 ( + x ) , treemap ) : paddingRight ;
} ;
treemap . paddingBottom = function ( x ) {
return arguments . length ? ( paddingBottom = typeof x === "function" ? x : constant$8 ( + x ) , treemap ) : paddingBottom ;
} ;
treemap . paddingLeft = function ( x ) {
return arguments . length ? ( paddingLeft = typeof x === "function" ? x : constant$8 ( + x ) , treemap ) : paddingLeft ;
} ;
return treemap ;
} ;
var binary = function ( parent , x0 , y0 , x1 , y1 ) {
var nodes = parent . children ,
i , n = nodes . length ,
sum , sums = new Array ( n + 1 ) ;
for ( sums [ 0 ] = sum = i = 0 ; i < n ; ++ i ) {
sums [ i + 1 ] = sum += nodes [ i ] . value ;
}
partition ( 0 , n , parent . value , x0 , y0 , x1 , y1 ) ;
function partition ( i , j , value , x0 , y0 , x1 , y1 ) {
if ( i >= j - 1 ) {
var node = nodes [ i ] ;
node . x0 = x0 , node . y0 = y0 ;
node . x1 = x1 , node . y1 = y1 ;
return ;
}
var valueOffset = sums [ i ] ,
valueTarget = ( value / 2 ) + valueOffset ,
k = i + 1 ,
hi = j - 1 ;
while ( k < hi ) {
var mid = k + hi >>> 1 ;
if ( sums [ mid ] < valueTarget ) k = mid + 1 ;
else hi = mid ;
}
var valueLeft = sums [ k ] - valueOffset ,
valueRight = value - valueLeft ;
if ( ( y1 - y0 ) > ( x1 - x0 ) ) {
var yk = ( y0 * valueRight + y1 * valueLeft ) / value ;
partition ( i , k , valueLeft , x0 , y0 , x1 , yk ) ;
partition ( k , j , valueRight , x0 , yk , x1 , y1 ) ;
} else {
var xk = ( x0 * valueRight + x1 * valueLeft ) / value ;
partition ( i , k , valueLeft , x0 , y0 , xk , y1 ) ;
partition ( k , j , valueRight , xk , y0 , x1 , y1 ) ;
}
}
} ;
var sliceDice = function ( parent , x0 , y0 , x1 , y1 ) {
( parent . depth & 1 ? treemapSlice : treemapDice ) ( parent , x0 , y0 , x1 , y1 ) ;
} ;
var resquarify = ( ( function custom ( ratio ) {
function resquarify ( parent , x0 , y0 , x1 , y1 ) {
if ( ( rows = parent . _squarify ) && ( rows . ratio === ratio ) ) {
var rows ,
row ,
nodes ,
i ,
j = - 1 ,
n ,
m = rows . length ,
value = parent . value ;
while ( ++ j < m ) {
row = rows [ j ] , nodes = row . children ;
for ( i = row . value = 0 , n = nodes . length ; i < n ; ++ i ) row . value += nodes [ i ] . value ;
if ( row . dice ) treemapDice ( row , x0 , y0 , x1 , y0 += ( y1 - y0 ) * row . value / value ) ;
else treemapSlice ( row , x0 , y0 , x0 += ( x1 - x0 ) * row . value / value , y1 ) ;
value -= row . value ;
}
} else {
parent . _squarify = rows = squarifyRatio ( ratio , parent , x0 , y0 , x1 , y1 ) ;
rows . ratio = ratio ;
}
}
resquarify . ratio = function ( x ) {
return custom ( ( x = + x ) > 1 ? x : 1 ) ;
} ;
return resquarify ;
} ) ) ( phi ) ;
var area$1 = function ( polygon ) {
var i = - 1 ,
n = polygon . length ,
a ,
b = polygon [ n - 1 ] ,
area = 0 ;
while ( ++ i < n ) {
a = b ;
b = polygon [ i ] ;
area += a [ 1 ] * b [ 0 ] - a [ 0 ] * b [ 1 ] ;
}
return area / 2 ;
} ;
var centroid$1 = function ( polygon ) {
var i = - 1 ,
n = polygon . length ,
x = 0 ,
y = 0 ,
a ,
b = polygon [ n - 1 ] ,
c ,
k = 0 ;
while ( ++ i < n ) {
a = b ;
b = polygon [ i ] ;
k += c = a [ 0 ] * b [ 1 ] - b [ 0 ] * a [ 1 ] ;
x += ( a [ 0 ] + b [ 0 ] ) * c ;
y += ( a [ 1 ] + b [ 1 ] ) * c ;
}
return k *= 3 , [ x / k , y / k ] ;
} ;
// Returns the 2D cross product of AB and AC vectors, i.e., the z-component of
// the 3D cross product in a quadrant I Cartesian coordinate system (+x is
// right, +y is up). Returns a positive value if ABC is counter-clockwise,
// negative if clockwise, and zero if the points are collinear.
var cross = function ( a , b , c ) {
return ( b [ 0 ] - a [ 0 ] ) * ( c [ 1 ] - a [ 1 ] ) - ( b [ 1 ] - a [ 1 ] ) * ( c [ 0 ] - a [ 0 ] ) ;
} ;
function lexicographicOrder ( a , b ) {
return a [ 0 ] - b [ 0 ] || a [ 1 ] - b [ 1 ] ;
}
// Computes the upper convex hull per the monotone chain algorithm.
// Assumes points.length >= 3, is sorted by x, unique in y.
// Returns an array of indices into points in left-to-right order.
function computeUpperHullIndexes ( points ) {
var n = points . length ,
indexes = [ 0 , 1 ] ,
size = 2 ;
for ( var i = 2 ; i < n ; ++ i ) {
while ( size > 1 && cross ( points [ indexes [ size - 2 ] ] , points [ indexes [ size - 1 ] ] , points [ i ] ) <= 0 ) -- size ;
indexes [ size ++ ] = i ;
}
return indexes . slice ( 0 , size ) ; // remove popped points
}
var hull = function ( points ) {
if ( ( n = points . length ) < 3 ) return null ;
var i ,
n ,
sortedPoints = new Array ( n ) ,
flippedPoints = new Array ( n ) ;
for ( i = 0 ; i < n ; ++ i ) sortedPoints [ i ] = [ + points [ i ] [ 0 ] , + points [ i ] [ 1 ] , i ] ;
sortedPoints . sort ( lexicographicOrder ) ;
for ( i = 0 ; i < n ; ++ i ) flippedPoints [ i ] = [ sortedPoints [ i ] [ 0 ] , - sortedPoints [ i ] [ 1 ] ] ;
var upperIndexes = computeUpperHullIndexes ( sortedPoints ) ,
lowerIndexes = computeUpperHullIndexes ( flippedPoints ) ;
// Construct the hull polygon, removing possible duplicate endpoints.
var skipLeft = lowerIndexes [ 0 ] === upperIndexes [ 0 ] ,
skipRight = lowerIndexes [ lowerIndexes . length - 1 ] === upperIndexes [ upperIndexes . length - 1 ] ,
hull = [ ] ;
// Add upper hull in right-to-l order.
// Then add lower hull in left-to-right order.
for ( i = upperIndexes . length - 1 ; i >= 0 ; -- i ) hull . push ( points [ sortedPoints [ upperIndexes [ i ] ] [ 2 ] ] ) ;
for ( i = + skipLeft ; i < lowerIndexes . length - skipRight ; ++ i ) hull . push ( points [ sortedPoints [ lowerIndexes [ i ] ] [ 2 ] ] ) ;
return hull ;
} ;
var contains = function ( polygon , point ) {
var n = polygon . length ,
p = polygon [ n - 1 ] ,
x = point [ 0 ] ,
y = point [ 1 ] ,
x0 = p [ 0 ] ,
y0 = p [ 1 ] ,
x1 , y1 ,
inside = false ;
for ( var i = 0 ; i < n ; ++ i ) {
p = polygon [ i ] , x1 = p [ 0 ] , y1 = p [ 1 ] ;
if ( ( ( y1 > y ) !== ( y0 > y ) ) && ( x < ( x0 - x1 ) * ( y - y1 ) / ( y0 - y1 ) + x1 ) ) inside = ! inside ;
x0 = x1 , y0 = y1 ;
}
return inside ;
} ;
var length$2 = function ( polygon ) {
var i = - 1 ,
n = polygon . length ,
b = polygon [ n - 1 ] ,
xa ,
ya ,
xb = b [ 0 ] ,
yb = b [ 1 ] ,
perimeter = 0 ;
while ( ++ i < n ) {
xa = xb ;
ya = yb ;
b = polygon [ i ] ;
xb = b [ 0 ] ;
yb = b [ 1 ] ;
xa -= xb ;
ya -= yb ;
perimeter += Math . sqrt ( xa * xa + ya * ya ) ;
}
return perimeter ;
} ;
var slice$3 = [ ] . slice ;
var noabort = { } ;
function Queue ( size ) {
if ( ! ( size >= 1 ) ) throw new Error ;
this . _size = size ;
this . _call =
this . _error = null ;
this . _tasks = [ ] ;
this . _data = [ ] ;
this . _waiting =
this . _active =
this . _ended =
this . _start = 0 ; // inside a synchronous task callback?
}
Queue . prototype = queue . prototype = {
constructor : Queue ,
defer : function ( callback ) {
if ( typeof callback !== "function" || this . _call ) throw new Error ;
if ( this . _error != null ) return this ;
var t = slice$3 . call ( arguments , 1 ) ;
t . push ( callback ) ;
++ this . _waiting , this . _tasks . push ( t ) ;
poke$1 ( this ) ;
return this ;
} ,
abort : function ( ) {
if ( this . _error == null ) abort ( this , new Error ( "abort" ) ) ;
return this ;
} ,
await : function ( callback ) {
if ( typeof callback !== "function" || this . _call ) throw new Error ;
this . _call = function ( error , results ) { callback . apply ( null , [ error ] . concat ( results ) ) ; } ;
maybeNotify ( this ) ;
return this ;
} ,
awaitAll : function ( callback ) {
if ( typeof callback !== "function" || this . _call ) throw new Error ;
this . _call = callback ;
maybeNotify ( this ) ;
return this ;
}
} ;
function poke$1 ( q ) {
if ( ! q . _start ) {
try { start$1 ( q ) ; } // let the current task complete
catch ( e ) {
if ( q . _tasks [ q . _ended + q . _active - 1 ] ) abort ( q , e ) ; // task errored synchronously
else if ( ! q . _data ) throw e ; // await callback errored synchronously
}
}
}
function start$1 ( q ) {
while ( q . _start = q . _waiting && q . _active < q . _size ) {
var i = q . _ended + q . _active ,
t = q . _tasks [ i ] ,
j = t . length - 1 ,
c = t [ j ] ;
t [ j ] = end ( q , i ) ;
-- q . _waiting , ++ q . _active ;
t = c . apply ( null , t ) ;
if ( ! q . _tasks [ i ] ) continue ; // task finished synchronously
q . _tasks [ i ] = t || noabort ;
}
}
function end ( q , i ) {
return function ( e , r ) {
if ( ! q . _tasks [ i ] ) return ; // ignore multiple callbacks
-- q . _active , ++ q . _ended ;
q . _tasks [ i ] = null ;
if ( q . _error != null ) return ; // ignore secondary errors
if ( e != null ) {
abort ( q , e ) ;
} else {
q . _data [ i ] = r ;
if ( q . _waiting ) poke$1 ( q ) ;
else maybeNotify ( q ) ;
}
} ;
}
function abort ( q , e ) {
var i = q . _tasks . length ,
t ;
q . _error = e ; // ignore active callbacks
q . _data = undefined ; // allow gc
q . _waiting = NaN ; // prevent starting
while ( -- i >= 0 ) {
if ( t = q . _tasks [ i ] ) {
q . _tasks [ i ] = null ;
if ( t . abort ) {
try { t . abort ( ) ; } catch ( e ) { /* ignore */ }
}
}
}
q . _active = NaN ; // allow notification
maybeNotify ( q ) ;
}
function maybeNotify ( q ) {
if ( ! q . _active && q . _call ) {
var d = q . _data ;
q . _data = undefined ; // allow gc
q . _call ( q . _error , d ) ;
}
}
function queue ( concurrency ) {
return new Queue ( arguments . length ? + concurrency : Infinity ) ;
}
var uniform = function ( min , max ) {
min = min == null ? 0 : + min ;
max = max == null ? 1 : + max ;
if ( arguments . length === 1 ) max = min , min = 0 ;
else max -= min ;
return function ( ) {
return Math . random ( ) * max + min ;
} ;
} ;
var normal = function ( mu , sigma ) {
var x , r ;
mu = mu == null ? 0 : + mu ;
sigma = sigma == null ? 1 : + sigma ;
return function ( ) {
var y ;
// If available, use the second previously-generated uniform random.
if ( x != null ) y = x , x = null ;
// Otherwise, generate a new x and y.
else
do {
x = Math . random ( ) * 2 - 1 ;
y = Math . random ( ) * 2 - 1 ;
r = x * x + y * y ;
} while ( ! r || r > 1 ) ;
return mu + sigma * y * Math . sqrt ( - 2 * Math . log ( r ) / r ) ;
} ;
} ;
var logNormal = function ( ) {
var randomNormal = normal . apply ( this , arguments ) ;
return function ( ) {
return Math . exp ( randomNormal ( ) ) ;
} ;
} ;
var irwinHall = function ( n ) {
return function ( ) {
for ( var sum = 0 , i = 0 ; i < n ; ++ i ) sum += Math . random ( ) ;
return sum ;
} ;
} ;
var bates = function ( n ) {
var randomIrwinHall = irwinHall ( n ) ;
return function ( ) {
return randomIrwinHall ( ) / n ;
} ;
} ;
var exponential$1 = function ( lambda ) {
return function ( ) {
return - Math . log ( 1 - Math . random ( ) ) / lambda ;
} ;
} ;
var request = function ( url , callback ) {
var request ,
event = dispatch ( "beforesend" , "progress" , "load" , "error" ) ,
mimeType ,
headers = map$1 ( ) ,
xhr = new XMLHttpRequest ,
user = null ,
password = null ,
response ,
responseType ,
timeout = 0 ;
// If IE does not support CORS, use XDomainRequest.
if ( typeof XDomainRequest !== "undefined" &&
! ( "withCredentials" in xhr ) &&
/^(http(s)?:)?\/\// . test ( url ) ) xhr = new XDomainRequest ;
"onload" in xhr
?
xhr . onload = xhr . onerror = xhr . ontimeout = respond :
xhr . onreadystatechange = function ( o ) { xhr . readyState > 3 && respond ( o ) ; } ;
function respond ( o ) {
var status = xhr . status ,
result ;
if ( ! status && hasResponse ( xhr ) ||
status >= 200 && status < 300 ||
status === 304 ) {
if ( response ) {
try {
result = response . call ( request , xhr ) ;
} catch ( e ) {
event . call ( "error" , request , e ) ;
return ;
}
} else {
result = xhr ;
}
event . call ( "load" , request , result ) ;
} else {
event . call ( "error" , request , o ) ;
}
}
xhr . onprogress = function ( e ) {
event . call ( "progress" , request , e ) ;
} ;
request = {
header : function ( name , value ) {
name = ( name + "" ) . toLowerCase ( ) ;
if ( arguments . length < 2 ) return headers . get ( name ) ;
if ( value == null ) headers . remove ( name ) ;
else headers . set ( name , value + "" ) ;
return request ;
} ,
// If mimeType is non-null and no Accept header is set, a default is used.
mimeType : function ( value ) {
if ( ! arguments . length ) return mimeType ;
mimeType = value == null ? null : value + "" ;
return request ;
} ,
// Specifies what type the response value should take;
// for instance, arraybuffer, blob, document, or text.
responseType : function ( value ) {
if ( ! arguments . length ) return responseType ;
responseType = value ;
return request ;
} ,
timeout : function ( value ) {
if ( ! arguments . length ) return timeout ;
timeout = + value ;
return request ;
} ,
user : function ( value ) {
return arguments . length < 1 ? user : ( user = value == null ? null : value + "" , request ) ;
} ,
password : function ( value ) {
return arguments . length < 1 ? password : ( password = value == null ? null : value + "" , request ) ;
} ,
// Specify how to convert the response content to a specific type;
// changes the callback value on "load" events.
response : function ( value ) {
response = value ;
return request ;
} ,
// Alias for send("GET", …).
get : function ( data , callback ) {
return request . send ( "GET" , data , callback ) ;
} ,
// Alias for send("POST", …).
post : function ( data , callback ) {
return request . send ( "POST" , data , callback ) ;
} ,
// If callback is non-null, it will be used for error and load events.
send : function ( method , data , callback ) {
xhr . open ( method , url , true , user , password ) ;
if ( mimeType != null && ! headers . has ( "accept" ) ) headers . set ( "accept" , mimeType + ",*/*" ) ;
if ( xhr . setRequestHeader ) headers . each ( function ( value , name ) { xhr . setRequestHeader ( name , value ) ; } ) ;
if ( mimeType != null && xhr . overrideMimeType ) xhr . overrideMimeType ( mimeType ) ;
if ( responseType != null ) xhr . responseType = responseType ;
if ( timeout > 0 ) xhr . timeout = timeout ;
if ( callback == null && typeof data === "function" ) callback = data , data = null ;
if ( callback != null && callback . length === 1 ) callback = fixCallback ( callback ) ;
if ( callback != null ) request . on ( "error" , callback ) . on ( "load" , function ( xhr ) { callback ( null , xhr ) ; } ) ;
event . call ( "beforesend" , request , xhr ) ;
xhr . send ( data == null ? null : data ) ;
return request ;
} ,
abort : function ( ) {
xhr . abort ( ) ;
return request ;
} ,
on : function ( ) {
var value = event . on . apply ( event , arguments ) ;
return value === event ? request : value ;
}
} ;
if ( callback != null ) {
if ( typeof callback !== "function" ) throw new Error ( "invalid callback: " + callback ) ;
return request . get ( callback ) ;
}
return request ;
} ;
function fixCallback ( callback ) {
return function ( error , xhr ) {
callback ( error == null ? xhr : null ) ;
} ;
}
function hasResponse ( xhr ) {
var type = xhr . responseType ;
return type && type !== "text" ?
xhr . response // null on error
:
xhr . responseText ; // "" on error
}
var type$1 = function ( defaultMimeType , response ) {
return function ( url , callback ) {
var r = request ( url ) . mimeType ( defaultMimeType ) . response ( response ) ;
if ( callback != null ) {
if ( typeof callback !== "function" ) throw new Error ( "invalid callback: " + callback ) ;
return r . get ( callback ) ;
}
return r ;
} ;
} ;
var html = type$1 ( "text/html" , function ( xhr ) {
return document . createRange ( ) . createContextualFragment ( xhr . responseText ) ;
} ) ;
var json = type$1 ( "application/json" , function ( xhr ) {
return JSON . parse ( xhr . responseText ) ;
} ) ;
var text = type$1 ( "text/plain" , function ( xhr ) {
return xhr . responseText ;
} ) ;
var xml = type$1 ( "application/xml" , function ( xhr ) {
var xml = xhr . responseXML ;
if ( ! xml ) throw new Error ( "parse error" ) ;
return xml ;
} ) ;
var dsv$1 = function ( defaultMimeType , parse ) {
return function ( url , row , callback ) {
if ( arguments . length < 3 ) callback = row , row = null ;
var r = request ( url ) . mimeType ( defaultMimeType ) ;
r . row = function ( _ ) { return arguments . length ? r . response ( responseOf ( parse , row = _ ) ) : row ; } ;
r . row ( row ) ;
return callback ? r . get ( callback ) : r ;
} ;
} ;
function responseOf ( parse , row ) {
return function ( request$$1 ) {
return parse ( request$$1 . responseText , row ) ;
} ;
}
var csv$1 = dsv$1 ( "text/csv" , csvParse ) ;
var tsv$1 = dsv$1 ( "text/tab-separated-values" , tsvParse ) ;
var array$2 = Array . prototype ;
var map$3 = array$2 . map ;
var slice$4 = array$2 . slice ;
var implicit = { name : "implicit" } ;
function ordinal ( range ) {
var index = map$1 ( ) ,
domain = [ ] ,
unknown = implicit ;
range = range == null ? [ ] : slice$4 . call ( range ) ;
function scale ( d ) {
var key = d + "" ,
i = index . get ( key ) ;
if ( ! i ) {
if ( unknown !== implicit ) return unknown ;
index . set ( key , i = domain . push ( d ) ) ;
}
return range [ ( i - 1 ) % range . length ] ;
}
scale . domain = function ( _ ) {
if ( ! arguments . length ) return domain . slice ( ) ;
domain = [ ] , index = map$1 ( ) ;
var i = - 1 ,
n = _ . length ,
d , key ;
while ( ++ i < n )
if ( ! index . has ( key = ( d = _ [ i ] ) + "" ) ) index . set ( key , domain . push ( d ) ) ;
return scale ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( range = slice$4 . call ( _ ) , scale ) : range . slice ( ) ;
} ;
scale . unknown = function ( _ ) {
return arguments . length ? ( unknown = _ , scale ) : unknown ;
} ;
scale . copy = function ( ) {
return ordinal ( )
. domain ( domain )
. range ( range )
. unknown ( unknown ) ;
} ;
return scale ;
}
function band ( ) {
var scale = ordinal ( ) . unknown ( undefined ) ,
domain = scale . domain ,
ordinalRange = scale . range ,
range$$1 = [ 0 , 1 ] ,
step ,
bandwidth ,
round = false ,
paddingInner = 0 ,
paddingOuter = 0 ,
align = 0.5 ;
delete scale . unknown ;
function rescale ( ) {
var n = domain ( ) . length ,
reverse = range$$1 [ 1 ] < range$$1 [ 0 ] ,
start = range$$1 [ reverse - 0 ] ,
stop = range$$1 [ 1 - reverse ] ;
step = ( stop - start ) / Math . max ( 1 , n - paddingInner + paddingOuter * 2 ) ;
if ( round ) step = Math . floor ( step ) ;
start += ( stop - start - step * ( n - paddingInner ) ) * align ;
bandwidth = step * ( 1 - paddingInner ) ;
if ( round ) start = Math . round ( start ) , bandwidth = Math . round ( bandwidth ) ;
var values = sequence ( n ) . map ( function ( i ) { return start + step * i ; } ) ;
return ordinalRange ( reverse ? values . reverse ( ) : values ) ;
}
scale . domain = function ( _ ) {
return arguments . length ? ( domain ( _ ) , rescale ( ) ) : domain ( ) ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( range$$1 = [ + _ [ 0 ] , + _ [ 1 ] ] , rescale ( ) ) : range$$1 . slice ( ) ;
} ;
scale . rangeRound = function ( _ ) {
return range$$1 = [ + _ [ 0 ] , + _ [ 1 ] ] , round = true , rescale ( ) ;
} ;
scale . bandwidth = function ( ) {
return bandwidth ;
} ;
scale . step = function ( ) {
return step ;
} ;
scale . round = function ( _ ) {
return arguments . length ? ( round = ! ! _ , rescale ( ) ) : round ;
} ;
scale . padding = function ( _ ) {
return arguments . length ? ( paddingInner = paddingOuter = Math . max ( 0 , Math . min ( 1 , _ ) ) , rescale ( ) ) : paddingInner ;
} ;
scale . paddingInner = function ( _ ) {
return arguments . length ? ( paddingInner = Math . max ( 0 , Math . min ( 1 , _ ) ) , rescale ( ) ) : paddingInner ;
} ;
scale . paddingOuter = function ( _ ) {
return arguments . length ? ( paddingOuter = Math . max ( 0 , Math . min ( 1 , _ ) ) , rescale ( ) ) : paddingOuter ;
} ;
scale . align = function ( _ ) {
return arguments . length ? ( align = Math . max ( 0 , Math . min ( 1 , _ ) ) , rescale ( ) ) : align ;
} ;
scale . copy = function ( ) {
return band ( )
. domain ( domain ( ) )
. range ( range$$1 )
. round ( round )
. paddingInner ( paddingInner )
. paddingOuter ( paddingOuter )
. align ( align ) ;
} ;
return rescale ( ) ;
}
function pointish ( scale ) {
var copy = scale . copy ;
scale . padding = scale . paddingOuter ;
delete scale . paddingInner ;
delete scale . paddingOuter ;
scale . copy = function ( ) {
return pointish ( copy ( ) ) ;
} ;
return scale ;
}
function point$1 ( ) {
return pointish ( band ( ) . paddingInner ( 1 ) ) ;
}
var constant$9 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
var number$1 = function ( x ) {
return + x ;
} ;
var unit = [ 0 , 1 ] ;
function deinterpolateLinear ( a , b ) {
return ( b -= ( a = + a ) ) ?
function ( x ) { return ( x - a ) / b ; } :
constant$9 ( b ) ;
}
function deinterpolateClamp ( deinterpolate ) {
return function ( a , b ) {
var d = deinterpolate ( a = + a , b = + b ) ;
return function ( x ) { return x <= a ? 0 : x >= b ? 1 : d ( x ) ; } ;
} ;
}
function reinterpolateClamp ( reinterpolate ) {
return function ( a , b ) {
var r = reinterpolate ( a = + a , b = + b ) ;
return function ( t ) { return t <= 0 ? a : t >= 1 ? b : r ( t ) ; } ;
} ;
}
function bimap ( domain , range$$1 , deinterpolate , reinterpolate ) {
var d0 = domain [ 0 ] ,
d1 = domain [ 1 ] ,
r0 = range$$1 [ 0 ] ,
r1 = range$$1 [ 1 ] ;
if ( d1 < d0 ) d0 = deinterpolate ( d1 , d0 ) , r0 = reinterpolate ( r1 , r0 ) ;
else d0 = deinterpolate ( d0 , d1 ) , r0 = reinterpolate ( r0 , r1 ) ;
return function ( x ) { return r0 ( d0 ( x ) ) ; } ;
}
function polymap ( domain , range$$1 , deinterpolate , reinterpolate ) {
var j = Math . min ( domain . length , range$$1 . length ) - 1 ,
d = new Array ( j ) ,
r = new Array ( j ) ,
i = - 1 ;
// Reverse descending domains.
if ( domain [ j ] < domain [ 0 ] ) {
domain = domain . slice ( ) . reverse ( ) ;
range$$1 = range$$1 . slice ( ) . reverse ( ) ;
}
while ( ++ i < j ) {
d [ i ] = deinterpolate ( domain [ i ] , domain [ i + 1 ] ) ;
r [ i ] = reinterpolate ( range$$1 [ i ] , range$$1 [ i + 1 ] ) ;
}
return function ( x ) {
var i = bisectRight ( domain , x , 1 , j ) - 1 ;
return r [ i ] ( d [ i ] ( x ) ) ;
} ;
}
function copy ( source , target ) {
return target
. domain ( source . domain ( ) )
. range ( source . range ( ) )
. interpolate ( source . interpolate ( ) )
. clamp ( source . clamp ( ) ) ;
}
// deinterpolate(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1].
// reinterpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding domain value x in [a,b].
function continuous ( deinterpolate , reinterpolate ) {
var domain = unit ,
range$$1 = unit ,
interpolate$$1 = interpolateValue ,
clamp = false ,
piecewise ,
output ,
input ;
function rescale ( ) {
piecewise = Math . min ( domain . length , range$$1 . length ) > 2 ? polymap : bimap ;
output = input = null ;
return scale ;
}
function scale ( x ) {
return ( output || ( output = piecewise ( domain , range$$1 , clamp ? deinterpolateClamp ( deinterpolate ) : deinterpolate , interpolate$$1 ) ) ) ( + x ) ;
}
scale . invert = function ( y ) {
return ( input || ( input = piecewise ( range$$1 , domain , deinterpolateLinear , clamp ? reinterpolateClamp ( reinterpolate ) : reinterpolate ) ) ) ( + y ) ;
} ;
scale . domain = function ( _ ) {
return arguments . length ? ( domain = map$3 . call ( _ , number$1 ) , rescale ( ) ) : domain . slice ( ) ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( range$$1 = slice$4 . call ( _ ) , rescale ( ) ) : range$$1 . slice ( ) ;
} ;
scale . rangeRound = function ( _ ) {
return range$$1 = slice$4 . call ( _ ) , interpolate$$1 = interpolateRound , rescale ( ) ;
} ;
scale . clamp = function ( _ ) {
return arguments . length ? ( clamp = ! ! _ , rescale ( ) ) : clamp ;
} ;
scale . interpolate = function ( _ ) {
return arguments . length ? ( interpolate$$1 = _ , rescale ( ) ) : interpolate$$1 ;
} ;
return rescale ( ) ;
}
var tickFormat = function ( domain , count , specifier ) {
var start = domain [ 0 ] ,
stop = domain [ domain . length - 1 ] ,
step = tickStep ( start , stop , count == null ? 10 : count ) ,
precision ;
specifier = formatSpecifier ( specifier == null ? ",f" : specifier ) ;
switch ( specifier . type ) {
case "s" :
{
var value = Math . max ( Math . abs ( start ) , Math . abs ( stop ) ) ;
if ( specifier . precision == null && ! isNaN ( precision = precisionPrefix ( step , value ) ) ) specifier . precision = precision ;
return exports . formatPrefix ( specifier , value ) ;
}
case "" :
case "e" :
case "g" :
case "p" :
case "r" :
{
if ( specifier . precision == null && ! isNaN ( precision = precisionRound ( step , Math . max ( Math . abs ( start ) , Math . abs ( stop ) ) ) ) ) specifier . precision = precision - ( specifier . type === "e" ) ;
break ;
}
case "f" :
case "%" :
{
if ( specifier . precision == null && ! isNaN ( precision = precisionFixed ( step ) ) ) specifier . precision = precision - ( specifier . type === "%" ) * 2 ;
break ;
}
}
return exports . format ( specifier ) ;
} ;
function linearish ( scale ) {
var domain = scale . domain ;
scale . ticks = function ( count ) {
var d = domain ( ) ;
return ticks ( d [ 0 ] , d [ d . length - 1 ] , count == null ? 10 : count ) ;
} ;
scale . tickFormat = function ( count , specifier ) {
return tickFormat ( domain ( ) , count , specifier ) ;
} ;
scale . nice = function ( count ) {
var d = domain ( ) ,
i = d . length - 1 ,
n = count == null ? 10 : count ,
start = d [ 0 ] ,
stop = d [ i ] ,
step = tickStep ( start , stop , n ) ;
if ( step ) {
step = tickStep ( Math . floor ( start / step ) * step , Math . ceil ( stop / step ) * step , n ) ;
d [ 0 ] = Math . floor ( start / step ) * step ;
d [ i ] = Math . ceil ( stop / step ) * step ;
domain ( d ) ;
}
return scale ;
} ;
return scale ;
}
function linear$2 ( ) {
var scale = continuous ( deinterpolateLinear , reinterpolate ) ;
scale . copy = function ( ) {
return copy ( scale , linear$2 ( ) ) ;
} ;
return linearish ( scale ) ;
}
function identity$6 ( ) {
var domain = [ 0 , 1 ] ;
function scale ( x ) {
return + x ;
}
scale . invert = scale ;
scale . domain = scale . range = function ( _ ) {
return arguments . length ? ( domain = map$3 . call ( _ , number$1 ) , scale ) : domain . slice ( ) ;
} ;
scale . copy = function ( ) {
return identity$6 ( ) . domain ( domain ) ;
} ;
return linearish ( scale ) ;
}
var nice = function ( domain , interval ) {
domain = domain . slice ( ) ;
var i0 = 0 ,
i1 = domain . length - 1 ,
x0 = domain [ i0 ] ,
x1 = domain [ i1 ] ,
t ;
if ( x1 < x0 ) {
t = i0 , i0 = i1 , i1 = t ;
t = x0 , x0 = x1 , x1 = t ;
}
domain [ i0 ] = interval . floor ( x0 ) ;
domain [ i1 ] = interval . ceil ( x1 ) ;
return domain ;
} ;
function deinterpolate ( a , b ) {
return ( b = Math . log ( b / a ) ) ?
function ( x ) { return Math . log ( x / a ) / b ; } :
constant$9 ( b ) ;
}
function reinterpolate$1 ( a , b ) {
return a < 0 ?
function ( t ) { return - Math . pow ( - b , t ) * Math . pow ( - a , 1 - t ) ; } :
function ( t ) { return Math . pow ( b , t ) * Math . pow ( a , 1 - t ) ; } ;
}
function pow10 ( x ) {
return isFinite ( x ) ? + ( "1e" + x ) : x < 0 ? 0 : x ;
}
function powp ( base ) {
return base === 10 ? pow10 :
base === Math . E ? Math . exp :
function ( x ) { return Math . pow ( base , x ) ; } ;
}
function logp ( base ) {
return base === Math . E ? Math . log :
base === 10 && Math . log10 ||
base === 2 && Math . log2 ||
( base = Math . log ( base ) , function ( x ) { return Math . log ( x ) / base ; } ) ;
}
function reflect ( f ) {
return function ( x ) {
return - f ( - x ) ;
} ;
}
function log$1 ( ) {
var scale = continuous ( deinterpolate , reinterpolate$1 ) . domain ( [ 1 , 10 ] ) ,
domain = scale . domain ,
base = 10 ,
logs = logp ( 10 ) ,
pows = powp ( 10 ) ;
function rescale ( ) {
logs = logp ( base ) , pows = powp ( base ) ;
if ( domain ( ) [ 0 ] < 0 ) logs = reflect ( logs ) , pows = reflect ( pows ) ;
return scale ;
}
scale . base = function ( _ ) {
return arguments . length ? ( base = + _ , rescale ( ) ) : base ;
} ;
scale . domain = function ( _ ) {
return arguments . length ? ( domain ( _ ) , rescale ( ) ) : domain ( ) ;
} ;
scale . ticks = function ( count ) {
var d = domain ( ) ,
u = d [ 0 ] ,
v = d [ d . length - 1 ] ,
r ;
if ( r = v < u ) i = u , u = v , v = i ;
var i = logs ( u ) ,
j = logs ( v ) ,
p ,
k ,
t ,
n = count == null ? 10 : + count ,
z = [ ] ;
if ( ! ( base % 1 ) && j - i < n ) {
i = Math . round ( i ) - 1 , j = Math . round ( j ) + 1 ;
if ( u > 0 )
for ( ; i < j ; ++ i ) {
for ( k = 1 , p = pows ( i ) ; k < base ; ++ k ) {
t = p * k ;
if ( t < u ) continue ;
if ( t > v ) break ;
z . push ( t ) ;
}
} else
for ( ; i < j ; ++ i ) {
for ( k = base - 1 , p = pows ( i ) ; k >= 1 ; -- k ) {
t = p * k ;
if ( t < u ) continue ;
if ( t > v ) break ;
z . push ( t ) ;
}
}
} else {
z = ticks ( i , j , Math . min ( j - i , n ) ) . map ( pows ) ;
}
return r ? z . reverse ( ) : z ;
} ;
scale . tickFormat = function ( count , specifier ) {
if ( specifier == null ) specifier = base === 10 ? ".0e" : "," ;
if ( typeof specifier !== "function" ) specifier = exports . format ( specifier ) ;
if ( count === Infinity ) return specifier ;
if ( count == null ) count = 10 ;
var k = Math . max ( 1 , base * count / scale . ticks ( ) . length ) ; // TODO fast estimate?
return function ( d ) {
var i = d / pows ( Math . round ( logs ( d ) ) ) ;
if ( i * base < base - 0.5 ) i *= base ;
return i <= k ? specifier ( d ) : "" ;
} ;
} ;
scale . nice = function ( ) {
return domain ( nice ( domain ( ) , {
floor : function ( x ) { return pows ( Math . floor ( logs ( x ) ) ) ; } ,
ceil : function ( x ) { return pows ( Math . ceil ( logs ( x ) ) ) ; }
} ) ) ;
} ;
scale . copy = function ( ) {
return copy ( scale , log$1 ( ) . base ( base ) ) ;
} ;
return scale ;
}
function raise$1 ( x , exponent ) {
return x < 0 ? - Math . pow ( - x , exponent ) : Math . pow ( x , exponent ) ;
}
function pow$1 ( ) {
var exponent = 1 ,
scale = continuous ( deinterpolate , reinterpolate ) ,
domain = scale . domain ;
function deinterpolate ( a , b ) {
return ( b = raise$1 ( b , exponent ) - ( a = raise$1 ( a , exponent ) ) ) ?
function ( x ) { return ( raise$1 ( x , exponent ) - a ) / b ; } :
constant$9 ( b ) ;
}
function reinterpolate ( a , b ) {
b = raise$1 ( b , exponent ) - ( a = raise$1 ( a , exponent ) ) ;
return function ( t ) { return raise$1 ( a + b * t , 1 / exponent ) ; } ;
}
scale . exponent = function ( _ ) {
return arguments . length ? ( exponent = + _ , domain ( domain ( ) ) ) : exponent ;
} ;
scale . copy = function ( ) {
return copy ( scale , pow$1 ( ) . exponent ( exponent ) ) ;
} ;
return linearish ( scale ) ;
}
function sqrt$1 ( ) {
return pow$1 ( ) . exponent ( 0.5 ) ;
}
function quantile$$1 ( ) {
var domain = [ ] ,
range$$1 = [ ] ,
thresholds = [ ] ;
function rescale ( ) {
var i = 0 ,
n = Math . max ( 1 , range$$1 . length ) ;
thresholds = new Array ( n - 1 ) ;
while ( ++ i < n ) thresholds [ i - 1 ] = threshold ( domain , i / n ) ;
return scale ;
}
function scale ( x ) {
if ( ! isNaN ( x = + x ) ) return range$$1 [ bisectRight ( thresholds , x ) ] ;
}
scale . invertExtent = function ( y ) {
var i = range$$1 . indexOf ( y ) ;
return i < 0 ? [ NaN , NaN ] : [
i > 0 ? thresholds [ i - 1 ] : domain [ 0 ] ,
i < thresholds . length ? thresholds [ i ] : domain [ domain . length - 1 ]
] ;
} ;
scale . domain = function ( _ ) {
if ( ! arguments . length ) return domain . slice ( ) ;
domain = [ ] ;
for ( var i = 0 , n = _ . length , d ; i < n ; ++ i )
if ( d = _ [ i ] , d != null && ! isNaN ( d = + d ) ) domain . push ( d ) ;
domain . sort ( ascending ) ;
return rescale ( ) ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( range$$1 = slice$4 . call ( _ ) , rescale ( ) ) : range$$1 . slice ( ) ;
} ;
scale . quantiles = function ( ) {
return thresholds . slice ( ) ;
} ;
scale . copy = function ( ) {
return quantile$$1 ( )
. domain ( domain )
. range ( range$$1 ) ;
} ;
return scale ;
}
function quantize$1 ( ) {
var x0 = 0 ,
x1 = 1 ,
n = 1 ,
domain = [ 0.5 ] ,
range$$1 = [ 0 , 1 ] ;
function scale ( x ) {
if ( x <= x ) return range$$1 [ bisectRight ( domain , x , 0 , n ) ] ;
}
function rescale ( ) {
var i = - 1 ;
domain = new Array ( n ) ;
while ( ++ i < n ) domain [ i ] = ( ( i + 1 ) * x1 - ( i - n ) * x0 ) / ( n + 1 ) ;
return scale ;
}
scale . domain = function ( _ ) {
return arguments . length ? ( x0 = + _ [ 0 ] , x1 = + _ [ 1 ] , rescale ( ) ) : [ x0 , x1 ] ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( n = ( range$$1 = slice$4 . call ( _ ) ) . length - 1 , rescale ( ) ) : range$$1 . slice ( ) ;
} ;
scale . invertExtent = function ( y ) {
var i = range$$1 . indexOf ( y ) ;
return i < 0 ? [ NaN , NaN ] :
i < 1 ? [ x0 , domain [ 0 ] ] :
i >= n ? [ domain [ n - 1 ] , x1 ] : [ domain [ i - 1 ] , domain [ i ] ] ;
} ;
scale . copy = function ( ) {
return quantize$1 ( )
. domain ( [ x0 , x1 ] )
. range ( range$$1 ) ;
} ;
return linearish ( scale ) ;
}
function threshold$1 ( ) {
var domain = [ 0.5 ] ,
range$$1 = [ 0 , 1 ] ,
n = 1 ;
function scale ( x ) {
if ( x <= x ) return range$$1 [ bisectRight ( domain , x , 0 , n ) ] ;
}
scale . domain = function ( _ ) {
return arguments . length ? ( domain = slice$4 . call ( _ ) , n = Math . min ( domain . length , range$$1 . length - 1 ) , scale ) : domain . slice ( ) ;
} ;
scale . range = function ( _ ) {
return arguments . length ? ( range$$1 = slice$4 . call ( _ ) , n = Math . min ( domain . length , range$$1 . length - 1 ) , scale ) : range$$1 . slice ( ) ;
} ;
scale . invertExtent = function ( y ) {
var i = range$$1 . indexOf ( y ) ;
return [ domain [ i - 1 ] , domain [ i ] ] ;
} ;
scale . copy = function ( ) {
return threshold$1 ( )
. domain ( domain )
. range ( range$$1 ) ;
} ;
return scale ;
}
var t0$1 = new Date ;
var t1$1 = new Date ;
function newInterval ( floori , offseti , count , field ) {
function interval ( date ) {
return floori ( date = new Date ( + date ) ) , date ;
}
interval . floor = interval ;
interval . ceil = function ( date ) {
return floori ( date = new Date ( date - 1 ) ) , offseti ( date , 1 ) , floori ( date ) , date ;
} ;
interval . round = function ( date ) {
var d0 = interval ( date ) ,
d1 = interval . ceil ( date ) ;
return date - d0 < d1 - date ? d0 : d1 ;
} ;
interval . offset = function ( date , step ) {
return offseti ( date = new Date ( + date ) , step == null ? 1 : Math . floor ( step ) ) , date ;
} ;
interval . range = function ( start , stop , step ) {
var range = [ ] ;
start = interval . ceil ( start ) ;
step = step == null ? 1 : Math . floor ( step ) ;
if ( ! ( start < stop ) || ! ( step > 0 ) ) return range ; // also handles Invalid Date
do range . push ( new Date ( + start ) ) ; while ( offseti ( start , step ) , floori ( start ) , start < stop )
return range ;
} ;
interval . filter = function ( test ) {
return newInterval ( function ( date ) {
if ( date >= date )
while ( floori ( date ) , ! test ( date ) ) date . setTime ( date - 1 ) ;
} , function ( date , step ) {
if ( date >= date )
while ( -- step >= 0 )
while ( offseti ( date , 1 ) , ! test ( date ) ) { } // eslint-disable-line no-empty
} ) ;
} ;
if ( count ) {
interval . count = function ( start , end ) {
t0$1 . setTime ( + start ) , t1$1 . setTime ( + end ) ;
floori ( t0$1 ) , floori ( t1$1 ) ;
return Math . floor ( count ( t0$1 , t1$1 ) ) ;
} ;
interval . every = function ( step ) {
step = Math . floor ( step ) ;
return ! isFinite ( step ) || ! ( step > 0 ) ? null :
! ( step > 1 ) ? interval :
interval . filter ( field ?
function ( d ) { return field ( d ) % step === 0 ; } :
function ( d ) { return interval . count ( 0 , d ) % step === 0 ; } ) ;
} ;
}
return interval ;
}
var millisecond = newInterval ( function ( ) {
// noop
} , function ( date , step ) {
date . setTime ( + date + step ) ;
} , function ( start , end ) {
return end - start ;
} ) ;
// An optimized implementation for this simple case.
millisecond . every = function ( k ) {
k = Math . floor ( k ) ;
if ( ! isFinite ( k ) || ! ( k > 0 ) ) return null ;
if ( ! ( k > 1 ) ) return millisecond ;
return newInterval ( function ( date ) {
date . setTime ( Math . floor ( date / k ) * k ) ;
} , function ( date , step ) {
date . setTime ( + date + step * k ) ;
} , function ( start , end ) {
return ( end - start ) / k ;
} ) ;
} ;
var milliseconds = millisecond . range ;
var durationSecond$1 = 1e3 ;
var durationMinute$1 = 6e4 ;
var durationHour$1 = 36e5 ;
var durationDay$1 = 864e5 ;
var durationWeek$1 = 6048e5 ;
var second = newInterval ( function ( date ) {
date . setTime ( Math . floor ( date / durationSecond$1 ) * durationSecond$1 ) ;
} , function ( date , step ) {
date . setTime ( + date + step * durationSecond$1 ) ;
} , function ( start , end ) {
return ( end - start ) / durationSecond$1 ;
} , function ( date ) {
return date . getUTCSeconds ( ) ;
} ) ;
var seconds = second . range ;
var minute = newInterval ( function ( date ) {
date . setTime ( Math . floor ( date / durationMinute$1 ) * durationMinute$1 ) ;
} , function ( date , step ) {
date . setTime ( + date + step * durationMinute$1 ) ;
} , function ( start , end ) {
return ( end - start ) / durationMinute$1 ;
} , function ( date ) {
return date . getMinutes ( ) ;
} ) ;
var minutes = minute . range ;
var hour = newInterval ( function ( date ) {
var offset = date . getTimezoneOffset ( ) * durationMinute$1 % durationHour$1 ;
if ( offset < 0 ) offset += durationHour$1 ;
date . setTime ( Math . floor ( ( + date - offset ) / durationHour$1 ) * durationHour$1 + offset ) ;
} , function ( date , step ) {
date . setTime ( + date + step * durationHour$1 ) ;
} , function ( start , end ) {
return ( end - start ) / durationHour$1 ;
} , function ( date ) {
return date . getHours ( ) ;
} ) ;
var hours = hour . range ;
var day = newInterval ( function ( date ) {
date . setHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setDate ( date . getDate ( ) + step ) ;
} , function ( start , end ) {
return ( end - start - ( end . getTimezoneOffset ( ) - start . getTimezoneOffset ( ) ) * durationMinute$1 ) / durationDay$1 ;
} , function ( date ) {
return date . getDate ( ) - 1 ;
} ) ;
var days = day . range ;
function weekday ( i ) {
return newInterval ( function ( date ) {
date . setDate ( date . getDate ( ) - ( date . getDay ( ) + 7 - i ) % 7 ) ;
date . setHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setDate ( date . getDate ( ) + step * 7 ) ;
} , function ( start , end ) {
return ( end - start - ( end . getTimezoneOffset ( ) - start . getTimezoneOffset ( ) ) * durationMinute$1 ) / durationWeek$1 ;
} ) ;
}
var sunday = weekday ( 0 ) ;
var monday = weekday ( 1 ) ;
var tuesday = weekday ( 2 ) ;
var wednesday = weekday ( 3 ) ;
var thursday = weekday ( 4 ) ;
var friday = weekday ( 5 ) ;
var saturday = weekday ( 6 ) ;
var sundays = sunday . range ;
var mondays = monday . range ;
var tuesdays = tuesday . range ;
var wednesdays = wednesday . range ;
var thursdays = thursday . range ;
var fridays = friday . range ;
var saturdays = saturday . range ;
var month = newInterval ( function ( date ) {
date . setDate ( 1 ) ;
date . setHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setMonth ( date . getMonth ( ) + step ) ;
} , function ( start , end ) {
return end . getMonth ( ) - start . getMonth ( ) + ( end . getFullYear ( ) - start . getFullYear ( ) ) * 12 ;
} , function ( date ) {
return date . getMonth ( ) ;
} ) ;
var months = month . range ;
var year = newInterval ( function ( date ) {
date . setMonth ( 0 , 1 ) ;
date . setHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setFullYear ( date . getFullYear ( ) + step ) ;
} , function ( start , end ) {
return end . getFullYear ( ) - start . getFullYear ( ) ;
} , function ( date ) {
return date . getFullYear ( ) ;
} ) ;
// An optimized implementation for this simple case.
year . every = function ( k ) {
return ! isFinite ( k = Math . floor ( k ) ) || ! ( k > 0 ) ? null : newInterval ( function ( date ) {
date . setFullYear ( Math . floor ( date . getFullYear ( ) / k ) * k ) ;
date . setMonth ( 0 , 1 ) ;
date . setHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setFullYear ( date . getFullYear ( ) + step * k ) ;
} ) ;
} ;
var years = year . range ;
var utcMinute = newInterval ( function ( date ) {
date . setUTCSeconds ( 0 , 0 ) ;
} , function ( date , step ) {
date . setTime ( + date + step * durationMinute$1 ) ;
} , function ( start , end ) {
return ( end - start ) / durationMinute$1 ;
} , function ( date ) {
return date . getUTCMinutes ( ) ;
} ) ;
var utcMinutes = utcMinute . range ;
var utcHour = newInterval ( function ( date ) {
date . setUTCMinutes ( 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setTime ( + date + step * durationHour$1 ) ;
} , function ( start , end ) {
return ( end - start ) / durationHour$1 ;
} , function ( date ) {
return date . getUTCHours ( ) ;
} ) ;
var utcHours = utcHour . range ;
var utcDay = newInterval ( function ( date ) {
date . setUTCHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setUTCDate ( date . getUTCDate ( ) + step ) ;
} , function ( start , end ) {
return ( end - start ) / durationDay$1 ;
} , function ( date ) {
return date . getUTCDate ( ) - 1 ;
} ) ;
var utcDays = utcDay . range ;
function utcWeekday ( i ) {
return newInterval ( function ( date ) {
date . setUTCDate ( date . getUTCDate ( ) - ( date . getUTCDay ( ) + 7 - i ) % 7 ) ;
date . setUTCHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setUTCDate ( date . getUTCDate ( ) + step * 7 ) ;
} , function ( start , end ) {
return ( end - start ) / durationWeek$1 ;
} ) ;
}
var utcSunday = utcWeekday ( 0 ) ;
var utcMonday = utcWeekday ( 1 ) ;
var utcTuesday = utcWeekday ( 2 ) ;
var utcWednesday = utcWeekday ( 3 ) ;
var utcThursday = utcWeekday ( 4 ) ;
var utcFriday = utcWeekday ( 5 ) ;
var utcSaturday = utcWeekday ( 6 ) ;
var utcSundays = utcSunday . range ;
var utcMondays = utcMonday . range ;
var utcTuesdays = utcTuesday . range ;
var utcWednesdays = utcWednesday . range ;
var utcThursdays = utcThursday . range ;
var utcFridays = utcFriday . range ;
var utcSaturdays = utcSaturday . range ;
var utcMonth = newInterval ( function ( date ) {
date . setUTCDate ( 1 ) ;
date . setUTCHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setUTCMonth ( date . getUTCMonth ( ) + step ) ;
} , function ( start , end ) {
return end . getUTCMonth ( ) - start . getUTCMonth ( ) + ( end . getUTCFullYear ( ) - start . getUTCFullYear ( ) ) * 12 ;
} , function ( date ) {
return date . getUTCMonth ( ) ;
} ) ;
var utcMonths = utcMonth . range ;
var utcYear = newInterval ( function ( date ) {
date . setUTCMonth ( 0 , 1 ) ;
date . setUTCHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setUTCFullYear ( date . getUTCFullYear ( ) + step ) ;
} , function ( start , end ) {
return end . getUTCFullYear ( ) - start . getUTCFullYear ( ) ;
} , function ( date ) {
return date . getUTCFullYear ( ) ;
} ) ;
// An optimized implementation for this simple case.
utcYear . every = function ( k ) {
return ! isFinite ( k = Math . floor ( k ) ) || ! ( k > 0 ) ? null : newInterval ( function ( date ) {
date . setUTCFullYear ( Math . floor ( date . getUTCFullYear ( ) / k ) * k ) ;
date . setUTCMonth ( 0 , 1 ) ;
date . setUTCHours ( 0 , 0 , 0 , 0 ) ;
} , function ( date , step ) {
date . setUTCFullYear ( date . getUTCFullYear ( ) + step * k ) ;
} ) ;
} ;
var utcYears = utcYear . range ;
function localDate ( d ) {
if ( 0 <= d . y && d . y < 100 ) {
var date = new Date ( - 1 , d . m , d . d , d . H , d . M , d . S , d . L ) ;
date . setFullYear ( d . y ) ;
return date ;
}
return new Date ( d . y , d . m , d . d , d . H , d . M , d . S , d . L ) ;
}
function utcDate ( d ) {
if ( 0 <= d . y && d . y < 100 ) {
var date = new Date ( Date . UTC ( - 1 , d . m , d . d , d . H , d . M , d . S , d . L ) ) ;
date . setUTCFullYear ( d . y ) ;
return date ;
}
return new Date ( Date . UTC ( d . y , d . m , d . d , d . H , d . M , d . S , d . L ) ) ;
}
function newYear ( y ) {
return { y : y , m : 0 , d : 1 , H : 0 , M : 0 , S : 0 , L : 0 } ;
}
function formatLocale$1 ( locale ) {
var locale _dateTime = locale . dateTime ,
locale _date = locale . date ,
locale _time = locale . time ,
locale _periods = locale . periods ,
locale _weekdays = locale . days ,
locale _shortWeekdays = locale . shortDays ,
locale _months = locale . months ,
locale _shortMonths = locale . shortMonths ;
var periodRe = formatRe ( locale _periods ) ,
periodLookup = formatLookup ( locale _periods ) ,
weekdayRe = formatRe ( locale _weekdays ) ,
weekdayLookup = formatLookup ( locale _weekdays ) ,
shortWeekdayRe = formatRe ( locale _shortWeekdays ) ,
shortWeekdayLookup = formatLookup ( locale _shortWeekdays ) ,
monthRe = formatRe ( locale _months ) ,
monthLookup = formatLookup ( locale _months ) ,
shortMonthRe = formatRe ( locale _shortMonths ) ,
shortMonthLookup = formatLookup ( locale _shortMonths ) ;
var formats = {
"a" : formatShortWeekday ,
"A" : formatWeekday ,
"b" : formatShortMonth ,
"B" : formatMonth ,
"c" : null ,
"d" : formatDayOfMonth ,
"e" : formatDayOfMonth ,
"H" : formatHour24 ,
"I" : formatHour12 ,
"j" : formatDayOfYear ,
"L" : formatMilliseconds ,
"m" : formatMonthNumber ,
"M" : formatMinutes ,
"p" : formatPeriod ,
"S" : formatSeconds ,
"U" : formatWeekNumberSunday ,
"w" : formatWeekdayNumber ,
"W" : formatWeekNumberMonday ,
"x" : null ,
"X" : null ,
"y" : formatYear ,
"Y" : formatFullYear ,
"Z" : formatZone ,
"%" : formatLiteralPercent
} ;
var utcFormats = {
"a" : formatUTCShortWeekday ,
"A" : formatUTCWeekday ,
"b" : formatUTCShortMonth ,
"B" : formatUTCMonth ,
"c" : null ,
"d" : formatUTCDayOfMonth ,
"e" : formatUTCDayOfMonth ,
"H" : formatUTCHour24 ,
"I" : formatUTCHour12 ,
"j" : formatUTCDayOfYear ,
"L" : formatUTCMilliseconds ,
"m" : formatUTCMonthNumber ,
"M" : formatUTCMinutes ,
"p" : formatUTCPeriod ,
"S" : formatUTCSeconds ,
"U" : formatUTCWeekNumberSunday ,
"w" : formatUTCWeekdayNumber ,
"W" : formatUTCWeekNumberMonday ,
"x" : null ,
"X" : null ,
"y" : formatUTCYear ,
"Y" : formatUTCFullYear ,
"Z" : formatUTCZone ,
"%" : formatLiteralPercent
} ;
var parses = {
"a" : parseShortWeekday ,
"A" : parseWeekday ,
"b" : parseShortMonth ,
"B" : parseMonth ,
"c" : parseLocaleDateTime ,
"d" : parseDayOfMonth ,
"e" : parseDayOfMonth ,
"H" : parseHour24 ,
"I" : parseHour24 ,
"j" : parseDayOfYear ,
"L" : parseMilliseconds ,
"m" : parseMonthNumber ,
"M" : parseMinutes ,
"p" : parsePeriod ,
"S" : parseSeconds ,
"U" : parseWeekNumberSunday ,
"w" : parseWeekdayNumber ,
"W" : parseWeekNumberMonday ,
"x" : parseLocaleDate ,
"X" : parseLocaleTime ,
"y" : parseYear ,
"Y" : parseFullYear ,
"Z" : parseZone ,
"%" : parseLiteralPercent
} ;
// These recursive directive definitions must be deferred.
formats . x = newFormat ( locale _date , formats ) ;
formats . X = newFormat ( locale _time , formats ) ;
formats . c = newFormat ( locale _dateTime , formats ) ;
utcFormats . x = newFormat ( locale _date , utcFormats ) ;
utcFormats . X = newFormat ( locale _time , utcFormats ) ;
utcFormats . c = newFormat ( locale _dateTime , utcFormats ) ;
function newFormat ( specifier , formats ) {
return function ( date ) {
var string = [ ] ,
i = - 1 ,
j = 0 ,
n = specifier . length ,
c ,
pad ,
format ;
if ( ! ( date instanceof Date ) ) date = new Date ( + date ) ;
while ( ++ i < n ) {
if ( specifier . charCodeAt ( i ) === 37 ) {
string . push ( specifier . slice ( j , i ) ) ;
if ( ( pad = pads [ c = specifier . charAt ( ++ i ) ] ) != null ) c = specifier . charAt ( ++ i ) ;
else pad = c === "e" ? " " : "0" ;
if ( format = formats [ c ] ) c = format ( date , pad ) ;
string . push ( c ) ;
j = i + 1 ;
}
}
string . push ( specifier . slice ( j , i ) ) ;
return string . join ( "" ) ;
} ;
}
function newParse ( specifier , newDate ) {
return function ( string ) {
var d = newYear ( 1900 ) ,
i = parseSpecifier ( d , specifier , string += "" , 0 ) ;
if ( i != string . length ) return null ;
// The am-pm flag is 0 for AM, and 1 for PM.
if ( "p" in d ) d . H = d . H % 12 + d . p * 12 ;
// Convert day-of-week and week-of-year to day-of-year.
if ( "W" in d || "U" in d ) {
if ( ! ( "w" in d ) ) d . w = "W" in d ? 1 : 0 ;
var day$$1 = "Z" in d ? utcDate ( newYear ( d . y ) ) . getUTCDay ( ) : newDate ( newYear ( d . y ) ) . getDay ( ) ;
d . m = 0 ;
d . d = "W" in d ? ( d . w + 6 ) % 7 + d . W * 7 - ( day$$1 + 5 ) % 7 : d . w + d . U * 7 - ( day$$1 + 6 ) % 7 ;
}
// If a time zone is specified, all fields are interpreted as UTC and then
// offset according to the specified time zone.
if ( "Z" in d ) {
d . H += d . Z / 100 | 0 ;
d . M += d . Z % 100 ;
return utcDate ( d ) ;
}
// Otherwise, all fields are in local time.
return newDate ( d ) ;
} ;
}
function parseSpecifier ( d , specifier , string , j ) {
var i = 0 ,
n = specifier . length ,
m = string . length ,
c ,
parse ;
while ( i < n ) {
if ( j >= m ) return - 1 ;
c = specifier . charCodeAt ( i ++ ) ;
if ( c === 37 ) {
c = specifier . charAt ( i ++ ) ;
parse = parses [ c in pads ? specifier . charAt ( i ++ ) : c ] ;
if ( ! parse || ( ( j = parse ( d , string , j ) ) < 0 ) ) return - 1 ;
} else if ( c != string . charCodeAt ( j ++ ) ) {
return - 1 ;
}
}
return j ;
}
function parsePeriod ( d , string , i ) {
var n = periodRe . exec ( string . slice ( i ) ) ;
return n ? ( d . p = periodLookup [ n [ 0 ] . toLowerCase ( ) ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseShortWeekday ( d , string , i ) {
var n = shortWeekdayRe . exec ( string . slice ( i ) ) ;
return n ? ( d . w = shortWeekdayLookup [ n [ 0 ] . toLowerCase ( ) ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseWeekday ( d , string , i ) {
var n = weekdayRe . exec ( string . slice ( i ) ) ;
return n ? ( d . w = weekdayLookup [ n [ 0 ] . toLowerCase ( ) ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseShortMonth ( d , string , i ) {
var n = shortMonthRe . exec ( string . slice ( i ) ) ;
return n ? ( d . m = shortMonthLookup [ n [ 0 ] . toLowerCase ( ) ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseMonth ( d , string , i ) {
var n = monthRe . exec ( string . slice ( i ) ) ;
return n ? ( d . m = monthLookup [ n [ 0 ] . toLowerCase ( ) ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseLocaleDateTime ( d , string , i ) {
return parseSpecifier ( d , locale _dateTime , string , i ) ;
}
function parseLocaleDate ( d , string , i ) {
return parseSpecifier ( d , locale _date , string , i ) ;
}
function parseLocaleTime ( d , string , i ) {
return parseSpecifier ( d , locale _time , string , i ) ;
}
function formatShortWeekday ( d ) {
return locale _shortWeekdays [ d . getDay ( ) ] ;
}
function formatWeekday ( d ) {
return locale _weekdays [ d . getDay ( ) ] ;
}
function formatShortMonth ( d ) {
return locale _shortMonths [ d . getMonth ( ) ] ;
}
function formatMonth ( d ) {
return locale _months [ d . getMonth ( ) ] ;
}
function formatPeriod ( d ) {
return locale _periods [ + ( d . getHours ( ) >= 12 ) ] ;
}
function formatUTCShortWeekday ( d ) {
return locale _shortWeekdays [ d . getUTCDay ( ) ] ;
}
function formatUTCWeekday ( d ) {
return locale _weekdays [ d . getUTCDay ( ) ] ;
}
function formatUTCShortMonth ( d ) {
return locale _shortMonths [ d . getUTCMonth ( ) ] ;
}
function formatUTCMonth ( d ) {
return locale _months [ d . getUTCMonth ( ) ] ;
}
function formatUTCPeriod ( d ) {
return locale _periods [ + ( d . getUTCHours ( ) >= 12 ) ] ;
}
return {
format : function ( specifier ) {
var f = newFormat ( specifier += "" , formats ) ;
f . toString = function ( ) { return specifier ; } ;
return f ;
} ,
parse : function ( specifier ) {
var p = newParse ( specifier += "" , localDate ) ;
p . toString = function ( ) { return specifier ; } ;
return p ;
} ,
utcFormat : function ( specifier ) {
var f = newFormat ( specifier += "" , utcFormats ) ;
f . toString = function ( ) { return specifier ; } ;
return f ;
} ,
utcParse : function ( specifier ) {
var p = newParse ( specifier , utcDate ) ;
p . toString = function ( ) { return specifier ; } ;
return p ;
}
} ;
}
var pads = { "-" : "" , "_" : " " , "0" : "0" } ;
var numberRe = /^\s*\d+/ ;
var percentRe = /^%/ ;
var requoteRe = /[\\\^\$\*\+\?\|\[\]\(\)\.\{\}]/g ;
function pad ( value , fill , width ) {
var sign = value < 0 ? "-" : "" ,
string = ( sign ? - value : value ) + "" ,
length = string . length ;
return sign + ( length < width ? new Array ( width - length + 1 ) . join ( fill ) + string : string ) ;
}
function requote ( s ) {
return s . replace ( requoteRe , "\\$&" ) ;
}
function formatRe ( names ) {
return new RegExp ( "^(?:" + names . map ( requote ) . join ( "|" ) + ")" , "i" ) ;
}
function formatLookup ( names ) {
var map = { } ,
i = - 1 ,
n = names . length ;
while ( ++ i < n ) map [ names [ i ] . toLowerCase ( ) ] = i ;
return map ;
}
function parseWeekdayNumber ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 1 ) ) ;
return n ? ( d . w = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseWeekNumberSunday ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i ) ) ;
return n ? ( d . U = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseWeekNumberMonday ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i ) ) ;
return n ? ( d . W = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseFullYear ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 4 ) ) ;
return n ? ( d . y = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseYear ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . y = + n [ 0 ] + ( + n [ 0 ] > 68 ? 1900 : 2000 ) , i + n [ 0 ] . length ) : - 1 ;
}
function parseZone ( d , string , i ) {
var n = /^(Z)|([+-]\d\d)(?:\:?(\d\d))?/ . exec ( string . slice ( i , i + 6 ) ) ;
return n ? ( d . Z = n [ 1 ] ? 0 : - ( n [ 2 ] + ( n [ 3 ] || "00" ) ) , i + n [ 0 ] . length ) : - 1 ;
}
function parseMonthNumber ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . m = n [ 0 ] - 1 , i + n [ 0 ] . length ) : - 1 ;
}
function parseDayOfMonth ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . d = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseDayOfYear ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 3 ) ) ;
return n ? ( d . m = 0 , d . d = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseHour24 ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . H = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseMinutes ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . M = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseSeconds ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 2 ) ) ;
return n ? ( d . S = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseMilliseconds ( d , string , i ) {
var n = numberRe . exec ( string . slice ( i , i + 3 ) ) ;
return n ? ( d . L = + n [ 0 ] , i + n [ 0 ] . length ) : - 1 ;
}
function parseLiteralPercent ( d , string , i ) {
var n = percentRe . exec ( string . slice ( i , i + 1 ) ) ;
return n ? i + n [ 0 ] . length : - 1 ;
}
function formatDayOfMonth ( d , p ) {
return pad ( d . getDate ( ) , p , 2 ) ;
}
function formatHour24 ( d , p ) {
return pad ( d . getHours ( ) , p , 2 ) ;
}
function formatHour12 ( d , p ) {
return pad ( d . getHours ( ) % 12 || 12 , p , 2 ) ;
}
function formatDayOfYear ( d , p ) {
return pad ( 1 + day . count ( year ( d ) , d ) , p , 3 ) ;
}
function formatMilliseconds ( d , p ) {
return pad ( d . getMilliseconds ( ) , p , 3 ) ;
}
function formatMonthNumber ( d , p ) {
return pad ( d . getMonth ( ) + 1 , p , 2 ) ;
}
function formatMinutes ( d , p ) {
return pad ( d . getMinutes ( ) , p , 2 ) ;
}
function formatSeconds ( d , p ) {
return pad ( d . getSeconds ( ) , p , 2 ) ;
}
function formatWeekNumberSunday ( d , p ) {
return pad ( sunday . count ( year ( d ) , d ) , p , 2 ) ;
}
function formatWeekdayNumber ( d ) {
return d . getDay ( ) ;
}
function formatWeekNumberMonday ( d , p ) {
return pad ( monday . count ( year ( d ) , d ) , p , 2 ) ;
}
function formatYear ( d , p ) {
return pad ( d . getFullYear ( ) % 100 , p , 2 ) ;
}
function formatFullYear ( d , p ) {
return pad ( d . getFullYear ( ) % 10000 , p , 4 ) ;
}
function formatZone ( d ) {
var z = d . getTimezoneOffset ( ) ;
return ( z > 0 ? "-" : ( z *= - 1 , "+" ) ) +
pad ( z / 60 | 0 , "0" , 2 ) +
pad ( z % 60 , "0" , 2 ) ;
}
function formatUTCDayOfMonth ( d , p ) {
return pad ( d . getUTCDate ( ) , p , 2 ) ;
}
function formatUTCHour24 ( d , p ) {
return pad ( d . getUTCHours ( ) , p , 2 ) ;
}
function formatUTCHour12 ( d , p ) {
return pad ( d . getUTCHours ( ) % 12 || 12 , p , 2 ) ;
}
function formatUTCDayOfYear ( d , p ) {
return pad ( 1 + utcDay . count ( utcYear ( d ) , d ) , p , 3 ) ;
}
function formatUTCMilliseconds ( d , p ) {
return pad ( d . getUTCMilliseconds ( ) , p , 3 ) ;
}
function formatUTCMonthNumber ( d , p ) {
return pad ( d . getUTCMonth ( ) + 1 , p , 2 ) ;
}
function formatUTCMinutes ( d , p ) {
return pad ( d . getUTCMinutes ( ) , p , 2 ) ;
}
function formatUTCSeconds ( d , p ) {
return pad ( d . getUTCSeconds ( ) , p , 2 ) ;
}
function formatUTCWeekNumberSunday ( d , p ) {
return pad ( utcSunday . count ( utcYear ( d ) , d ) , p , 2 ) ;
}
function formatUTCWeekdayNumber ( d ) {
return d . getUTCDay ( ) ;
}
function formatUTCWeekNumberMonday ( d , p ) {
return pad ( utcMonday . count ( utcYear ( d ) , d ) , p , 2 ) ;
}
function formatUTCYear ( d , p ) {
return pad ( d . getUTCFullYear ( ) % 100 , p , 2 ) ;
}
function formatUTCFullYear ( d , p ) {
return pad ( d . getUTCFullYear ( ) % 10000 , p , 4 ) ;
}
function formatUTCZone ( ) {
return "+0000" ;
}
function formatLiteralPercent ( ) {
return "%" ;
}
var locale$2 ;
defaultLocale$1 ( {
dateTime : "%x, %X" ,
date : "%-m/%-d/%Y" ,
time : "%-I:%M:%S %p" ,
periods : [ "AM" , "PM" ] ,
days : [ "Sunday" , "Monday" , "Tuesday" , "Wednesday" , "Thursday" , "Friday" , "Saturday" ] ,
shortDays : [ "Sun" , "Mon" , "Tue" , "Wed" , "Thu" , "Fri" , "Sat" ] ,
months : [ "January" , "February" , "March" , "April" , "May" , "June" , "July" , "August" , "September" , "October" , "November" , "December" ] ,
shortMonths : [ "Jan" , "Feb" , "Mar" , "Apr" , "May" , "Jun" , "Jul" , "Aug" , "Sep" , "Oct" , "Nov" , "Dec" ]
} ) ;
function defaultLocale$1 ( definition ) {
locale$2 = formatLocale$1 ( definition ) ;
exports . timeFormat = locale$2 . format ;
exports . timeParse = locale$2 . parse ;
exports . utcFormat = locale$2 . utcFormat ;
exports . utcParse = locale$2 . utcParse ;
return locale$2 ;
}
var isoSpecifier = "%Y-%m-%dT%H:%M:%S.%LZ" ;
function formatIsoNative ( date ) {
return date . toISOString ( ) ;
}
var formatIso = Date . prototype . toISOString ?
formatIsoNative :
exports . utcFormat ( isoSpecifier ) ;
function parseIsoNative ( string ) {
var date = new Date ( string ) ;
return isNaN ( date ) ? null : date ;
}
var parseIso = + new Date ( "2000-01-01T00:00:00.000Z" ) ?
parseIsoNative :
exports . utcParse ( isoSpecifier ) ;
var durationSecond = 1000 ;
var durationMinute = durationSecond * 60 ;
var durationHour = durationMinute * 60 ;
var durationDay = durationHour * 24 ;
var durationWeek = durationDay * 7 ;
var durationMonth = durationDay * 30 ;
var durationYear = durationDay * 365 ;
function date$1 ( t ) {
return new Date ( t ) ;
}
function number$2 ( t ) {
return t instanceof Date ? + t : + new Date ( + t ) ;
}
function calendar ( year$$1 , month$$1 , week , day$$1 , hour$$1 , minute$$1 , second$$1 , millisecond$$1 , format ) {
var scale = continuous ( deinterpolateLinear , reinterpolate ) ,
invert = scale . invert ,
domain = scale . domain ;
var formatMillisecond = format ( ".%L" ) ,
formatSecond = format ( ":%S" ) ,
formatMinute = format ( "%I:%M" ) ,
formatHour = format ( "%I %p" ) ,
formatDay = format ( "%a %d" ) ,
formatWeek = format ( "%b %d" ) ,
formatMonth = format ( "%B" ) ,
formatYear = format ( "%Y" ) ;
var tickIntervals = [
[ second$$1 , 1 , durationSecond ] ,
[ second$$1 , 5 , 5 * durationSecond ] ,
[ second$$1 , 15 , 15 * durationSecond ] ,
[ second$$1 , 30 , 30 * durationSecond ] ,
[ minute$$1 , 1 , durationMinute ] ,
[ minute$$1 , 5 , 5 * durationMinute ] ,
[ minute$$1 , 15 , 15 * durationMinute ] ,
[ minute$$1 , 30 , 30 * durationMinute ] ,
[ hour$$1 , 1 , durationHour ] ,
[ hour$$1 , 3 , 3 * durationHour ] ,
[ hour$$1 , 6 , 6 * durationHour ] ,
[ hour$$1 , 12 , 12 * durationHour ] ,
[ day$$1 , 1 , durationDay ] ,
[ day$$1 , 2 , 2 * durationDay ] ,
[ week , 1 , durationWeek ] ,
[ month$$1 , 1 , durationMonth ] ,
[ month$$1 , 3 , 3 * durationMonth ] ,
[ year$$1 , 1 , durationYear ]
] ;
function tickFormat ( date ) {
return ( second$$1 ( date ) < date ? formatMillisecond :
minute$$1 ( date ) < date ? formatSecond :
hour$$1 ( date ) < date ? formatMinute :
day$$1 ( date ) < date ? formatHour :
month$$1 ( date ) < date ? ( week ( date ) < date ? formatDay : formatWeek ) :
year$$1 ( date ) < date ? formatMonth :
formatYear ) ( date ) ;
}
function tickInterval ( interval , start , stop , step ) {
if ( interval == null ) interval = 10 ;
// If a desired tick count is specified, pick a reasonable tick interval
// based on the extent of the domain and a rough estimate of tick size.
// Otherwise, assume interval is already a time interval and use it.
if ( typeof interval === "number" ) {
var target = Math . abs ( stop - start ) / interval ,
i = bisector ( function ( i ) { return i [ 2 ] ; } ) . right ( tickIntervals , target ) ;
if ( i === tickIntervals . length ) {
step = tickStep ( start / durationYear , stop / durationYear , interval ) ;
interval = year$$1 ;
} else if ( i ) {
i = tickIntervals [ target / tickIntervals [ i - 1 ] [ 2 ] < tickIntervals [ i ] [ 2 ] / target ? i - 1 : i ] ;
step = i [ 1 ] ;
interval = i [ 0 ] ;
} else {
step = tickStep ( start , stop , interval ) ;
interval = millisecond$$1 ;
}
}
return step == null ? interval : interval . every ( step ) ;
}
scale . invert = function ( y ) {
return new Date ( invert ( y ) ) ;
} ;
scale . domain = function ( _ ) {
return arguments . length ? domain ( map$3 . call ( _ , number$2 ) ) : domain ( ) . map ( date$1 ) ;
} ;
scale . ticks = function ( interval , step ) {
var d = domain ( ) ,
t0 = d [ 0 ] ,
t1 = d [ d . length - 1 ] ,
r = t1 < t0 ,
t ;
if ( r ) t = t0 , t0 = t1 , t1 = t ;
t = tickInterval ( interval , t0 , t1 , step ) ;
t = t ? t . range ( t0 , t1 + 1 ) : [ ] ; // inclusive stop
return r ? t . reverse ( ) : t ;
} ;
scale . tickFormat = function ( count , specifier ) {
return specifier == null ? tickFormat : format ( specifier ) ;
} ;
scale . nice = function ( interval , step ) {
var d = domain ( ) ;
return ( interval = tickInterval ( interval , d [ 0 ] , d [ d . length - 1 ] , step ) ) ?
domain ( nice ( d , interval ) ) :
scale ;
} ;
scale . copy = function ( ) {
return copy ( scale , calendar ( year$$1 , month$$1 , week , day$$1 , hour$$1 , minute$$1 , second$$1 , millisecond$$1 , format ) ) ;
} ;
return scale ;
}
var time = function ( ) {
return calendar ( year , month , sunday , day , hour , minute , second , millisecond , exports . timeFormat ) . domain ( [ new Date ( 2000 , 0 , 1 ) , new Date ( 2000 , 0 , 2 ) ] ) ;
} ;
var utcTime = function ( ) {
return calendar ( utcYear , utcMonth , utcSunday , utcDay , utcHour , utcMinute , second , millisecond , exports . utcFormat ) . domain ( [ Date . UTC ( 2000 , 0 , 1 ) , Date . UTC ( 2000 , 0 , 2 ) ] ) ;
} ;
var colors = function ( s ) {
return s . match ( /.{6}/g ) . map ( function ( x ) {
return "#" + x ;
} ) ;
} ;
var category10 = colors ( "1f77b4ff7f0e2ca02cd627289467bd8c564be377c27f7f7fbcbd2217becf" ) ;
var category20b = colors ( "393b795254a36b6ecf9c9ede6379398ca252b5cf6bcedb9c8c6d31bd9e39e7ba52e7cb94843c39ad494ad6616be7969c7b4173a55194ce6dbdde9ed6" ) ;
var category20c = colors ( "3182bd6baed69ecae1c6dbefe6550dfd8d3cfdae6bfdd0a231a35474c476a1d99bc7e9c0756bb19e9ac8bcbddcdadaeb636363969696bdbdbdd9d9d9" ) ;
var category20 = colors ( "1f77b4aec7e8ff7f0effbb782ca02c98df8ad62728ff98969467bdc5b0d58c564bc49c94e377c2f7b6d27f7f7fc7c7c7bcbd22dbdb8d17becf9edae5" ) ;
var cubehelix$3 = cubehelixLong ( cubehelix ( 300 , 0.5 , 0.0 ) , cubehelix ( - 240 , 0.5 , 1.0 ) ) ;
var warm = cubehelixLong ( cubehelix ( - 100 , 0.75 , 0.35 ) , cubehelix ( 80 , 1.50 , 0.8 ) ) ;
var cool = cubehelixLong ( cubehelix ( 260 , 0.75 , 0.35 ) , cubehelix ( 80 , 1.50 , 0.8 ) ) ;
var rainbow = cubehelix ( ) ;
var rainbow$1 = function ( t ) {
if ( t < 0 || t > 1 ) t -= Math . floor ( t ) ;
var ts = Math . abs ( t - 0.5 ) ;
rainbow . h = 360 * t - 100 ;
rainbow . s = 1.5 - 1.5 * ts ;
rainbow . l = 0.8 - 0.9 * ts ;
return rainbow + "" ;
} ;
function ramp ( range ) {
var n = range . length ;
return function ( t ) {
return range [ Math . max ( 0 , Math . min ( n - 1 , Math . floor ( t * n ) ) ) ] ;
} ;
}
var viridis = ramp ( colors ( "44015444025645045745055946075a46085c460a5d460b5e470d60470e6147106347116447136548146748166848176948186a481a6c481b6d481c6e481d6f481f70482071482173482374482475482576482677482878482979472a7a472c7a472d7b472e7c472f7d46307e46327e46337f463480453581453781453882443983443a83443b84433d84433e85423f854240864241864142874144874045884046883f47883f48893e49893e4a893e4c8a3d4d8a3d4e8a3c4f8a3c508b3b518b3b528b3a538b3a548c39558c39568c38588c38598c375a8c375b8d365c8d365d8d355e8d355f8d34608d34618d33628d33638d32648e32658e31668e31678e31688e30698e306a8e2f6b8e2f6c8e2e6d8e2e6e8e2e6f8e2d708e2d718e2c718e2c728e2c738e2b748e2b758e2a768e2a778e2a788e29798e297a8e297b8e287c8e287d8e277e8e277f8e27808e26818e26828e26828e25838e25848e25858e24868e24878e23888e23898e238a8d228b8d228c8d228d8d218e8d218f8d21908d21918c20928c20928c20938c1f948c1f958b1f968b1f978b1f988b1f998a1f9a8a1e9b8a1e9c891e9d891f9e891f9f881fa0881fa1881fa1871fa28720a38620a48621a58521a68522a78522a88423a98324aa8325ab8225ac8226ad8127ad8128ae8029af7f2ab07f2cb17e2db27d2eb37c2fb47c31b57b32b67a34b67935b77937b87838b9773aba763bbb753dbc743fbc7340bd7242be7144bf7046c06f48c16e4ac16d4cc26c4ec36b50c46a52c56954c56856c66758c7655ac8645cc8635ec96260ca6063cb5f65cb5e67cc5c69cd5b6ccd5a6ece5870cf5773d05675d05477d1537ad1517cd2507fd34e81d34d84d44b86d54989d5488bd6468ed64590d74393d74195d84098d83e9bd93c9dd93ba0da39a2da37a5db36a8db34aadc32addc30b0dd2fb2dd2db5de2bb8de29bade28bddf26c0df25c2df23c5e021c8e020cae11fcde11dd0e11cd2e21bd5e21ad8e219dae319dde318dfe318e2e418e5e419e7e419eae51aece51befe51cf1e51df4e61ef6e620f8e621fbe723fde725" ) ) ;
var magma = ramp ( colors ( "00000401000501010601010802010902020b02020d03030f03031204041405041606051806051a07061c08071e0907200a08220b09240c09260d0a290e0b2b100b2d110c2f120d31130d34140e36150e38160f3b180f3d19103f1a10421c10441d11471e114920114b21114e22115024125325125527125829115a2a115c2c115f2d11612f116331116533106734106936106b38106c390f6e3b0f703d0f713f0f72400f74420f75440f764510774710784910784a10794c117a4e117b4f127b51127c52137c54137d56147d57157e59157e5a167e5c167f5d177f5f187f601880621980641a80651a80671b80681c816a1c816b1d816d1d816e1e81701f81721f817320817521817621817822817922827b23827c23827e24828025828125818326818426818627818827818928818b29818c29818e2a81902a81912b81932b80942c80962c80982d80992d809b2e7f9c2e7f9e2f7fa02f7fa1307ea3307ea5317ea6317da8327daa337dab337cad347cae347bb0357bb2357bb3367ab5367ab73779b83779ba3878bc3978bd3977bf3a77c03a76c23b75c43c75c53c74c73d73c83e73ca3e72cc3f71cd4071cf4070d0416fd2426fd3436ed5446dd6456cd8456cd9466bdb476adc4869de4968df4a68e04c67e24d66e34e65e44f64e55064e75263e85362e95462ea5661eb5760ec5860ed5a5fee5b5eef5d5ef05f5ef1605df2625df2645cf3655cf4675cf4695cf56b5cf66c5cf66e5cf7705cf7725cf8745cf8765cf9785df9795df97b5dfa7d5efa7f5efa815ffb835ffb8560fb8761fc8961fc8a62fc8c63fc8e64fc9065fd9266fd9467fd9668fd9869fd9a6afd9b6bfe9d6cfe9f6dfea16efea36ffea571fea772fea973feaa74feac76feae77feb078feb27afeb47bfeb67cfeb77efeb97ffebb81febd82febf84fec185fec287fec488fec68afec88cfeca8dfecc8ffecd90fecf92fed194fed395fed597fed799fed89afdda9cfddc9efddea0fde0a1fde2a3fde3a5fde5a7fde7a9fde9aafdebacfcecaefceeb0fcf0b2fcf2b4fcf4b6fcf6b8fcf7b9fcf9bbfcfbbdfcfdbf" ) ) ;
var inferno = ramp ( colors ( "00000401000501010601010802010a02020c02020e03021004031204031405041706041907051b08051d09061f0a07220b07240c08260d08290e092b10092d110a30120a32140b34150b37160b39180c3c190c3e1b0c411c0c431e0c451f0c48210c4a230c4c240c4f260c51280b53290b552b0b572d0b592f0a5b310a5c320a5e340a5f3609613809623909633b09643d09653e0966400a67420a68440a68450a69470b6a490b6a4a0c6b4c0c6b4d0d6c4f0d6c510e6c520e6d540f6d550f6d57106e59106e5a116e5c126e5d126e5f136e61136e62146e64156e65156e67166e69166e6a176e6c186e6d186e6f196e71196e721a6e741a6e751b6e771c6d781c6d7a1d6d7c1d6d7d1e6d7f1e6c801f6c82206c84206b85216b87216b88226a8a226a8c23698d23698f24699025689225689326679526679727669827669a28659b29649d29649f2a63a02a63a22b62a32c61a52c60a62d60a82e5fa92e5eab2f5ead305dae305cb0315bb1325ab3325ab43359b63458b73557b93556ba3655bc3754bd3853bf3952c03a51c13a50c33b4fc43c4ec63d4dc73e4cc83f4bca404acb4149cc4248ce4347cf4446d04545d24644d34743d44842d54a41d74b3fd84c3ed94d3dda4e3cdb503bdd513ade5238df5337e05536e15635e25734e35933e45a31e55c30e65d2fe75e2ee8602de9612bea632aeb6429eb6628ec6726ed6925ee6a24ef6c23ef6e21f06f20f1711ff1731df2741cf3761bf37819f47918f57b17f57d15f67e14f68013f78212f78410f8850ff8870ef8890cf98b0bf98c0af98e09fa9008fa9207fa9407fb9606fb9706fb9906fb9b06fb9d07fc9f07fca108fca309fca50afca60cfca80dfcaa0ffcac11fcae12fcb014fcb216fcb418fbb61afbb81dfbba1ffbbc21fbbe23fac026fac228fac42afac62df9c72ff9c932f9cb35f8cd37f8cf3af7d13df7d340f6d543f6d746f5d949f5db4cf4dd4ff4df53f4e156f3e35af3e55df2e661f2e865f2ea69f1ec6df1ed71f1ef75f1f179f2f27df2f482f3f586f3f68af4f88ef5f992f6fa96f8fb9af9fc9dfafda1fcffa4" ) ) ;
var plasma = ramp ( colors ( "0d088710078813078916078a19068c1b068d1d068e20068f2206902406912605912805922a05932c05942e05952f059631059733059735049837049938049a3a049a3c049b3e049c3f049c41049d43039e44039e46039f48039f4903a04b03a14c02a14e02a25002a25102a35302a35502a45601a45801a45901a55b01a55c01a65e01a66001a66100a76300a76400a76600a76700a86900a86a00a86c00a86e00a86f00a87100a87201a87401a87501a87701a87801a87a02a87b02a87d03a87e03a88004a88104a78305a78405a78606a68707a68808a68a09a58b0aa58d0ba58e0ca48f0da4910ea3920fa39410a29511a19613a19814a099159f9a169f9c179e9d189d9e199da01a9ca11b9ba21d9aa31e9aa51f99a62098a72197a82296aa2395ab2494ac2694ad2793ae2892b02991b12a90b22b8fb32c8eb42e8db52f8cb6308bb7318ab83289ba3388bb3488bc3587bd3786be3885bf3984c03a83c13b82c23c81c33d80c43e7fc5407ec6417dc7427cc8437bc9447aca457acb4679cc4778cc4977cd4a76ce4b75cf4c74d04d73d14e72d24f71d35171d45270d5536fd5546ed6556dd7566cd8576bd9586ada5a6ada5b69db5c68dc5d67dd5e66de5f65de6164df6263e06363e16462e26561e26660e3685fe4695ee56a5de56b5de66c5ce76e5be76f5ae87059e97158e97257ea7457eb7556eb7655ec7754ed7953ed7a52ee7b51ef7c51ef7e50f07f4ff0804ef1814df1834cf2844bf3854bf3874af48849f48948f58b47f58c46f68d45f68f44f79044f79143f79342f89441f89540f9973ff9983ef99a3efa9b3dfa9c3cfa9e3bfb9f3afba139fba238fca338fca537fca636fca835fca934fdab33fdac33fdae32fdaf31fdb130fdb22ffdb42ffdb52efeb72dfeb82cfeba2cfebb2bfebd2afebe2afec029fdc229fdc328fdc527fdc627fdc827fdca26fdcb26fccd25fcce25fcd025fcd225fbd324fbd524fbd724fad824fada24f9dc24f9dd25f8df25f8e125f7e225f7e425f6e626f6e826f5e926f5eb27f4ed27f3ee27f3f027f2f227f1f426f1f525f0f724f0f921" ) ) ;
function sequential ( interpolator ) {
var x0 = 0 ,
x1 = 1 ,
clamp = false ;
function scale ( x ) {
var t = ( x - x0 ) / ( x1 - x0 ) ;
return interpolator ( clamp ? Math . max ( 0 , Math . min ( 1 , t ) ) : t ) ;
}
scale . domain = function ( _ ) {
return arguments . length ? ( x0 = + _ [ 0 ] , x1 = + _ [ 1 ] , scale ) : [ x0 , x1 ] ;
} ;
scale . clamp = function ( _ ) {
return arguments . length ? ( clamp = ! ! _ , scale ) : clamp ;
} ;
scale . interpolator = function ( _ ) {
return arguments . length ? ( interpolator = _ , scale ) : interpolator ;
} ;
scale . copy = function ( ) {
return sequential ( interpolator ) . domain ( [ x0 , x1 ] ) . clamp ( clamp ) ;
} ;
return linearish ( scale ) ;
}
var constant$10 = function ( x ) {
return function constant ( ) {
return x ;
} ;
} ;
var epsilon$3 = 1e-12 ;
var pi$4 = Math . PI ;
var halfPi$3 = pi$4 / 2 ;
var tau$4 = 2 * pi$4 ;
function arcInnerRadius ( d ) {
return d . innerRadius ;
}
function arcOuterRadius ( d ) {
return d . outerRadius ;
}
function arcStartAngle ( d ) {
return d . startAngle ;
}
function arcEndAngle ( d ) {
return d . endAngle ;
}
function arcPadAngle ( d ) {
return d && d . padAngle ; // Note: optional!
}
function asin$1 ( x ) {
return x >= 1 ? halfPi$3 : x <= - 1 ? - halfPi$3 : Math . asin ( x ) ;
}
function intersect ( x0 , y0 , x1 , y1 , x2 , y2 , x3 , y3 ) {
var x10 = x1 - x0 ,
y10 = y1 - y0 ,
x32 = x3 - x2 ,
y32 = y3 - y2 ,
t = ( x32 * ( y0 - y2 ) - y32 * ( x0 - x2 ) ) / ( y32 * x10 - x32 * y10 ) ;
return [ x0 + t * x10 , y0 + t * y10 ] ;
}
// Compute perpendicular offset line of length rc.
// http://mathworld.wolfram.com/Circle-LineIntersection.html
function cornerTangents ( x0 , y0 , x1 , y1 , r1 , rc , cw ) {
var x01 = x0 - x1 ,
y01 = y0 - y1 ,
lo = ( cw ? rc : - rc ) / Math . sqrt ( x01 * x01 + y01 * y01 ) ,
ox = lo * y01 ,
oy = - lo * x01 ,
x11 = x0 + ox ,
y11 = y0 + oy ,
x10 = x1 + ox ,
y10 = y1 + oy ,
x00 = ( x11 + x10 ) / 2 ,
y00 = ( y11 + y10 ) / 2 ,
dx = x10 - x11 ,
dy = y10 - y11 ,
d2 = dx * dx + dy * dy ,
r = r1 - rc ,
D = x11 * y10 - x10 * y11 ,
d = ( dy < 0 ? - 1 : 1 ) * Math . sqrt ( Math . max ( 0 , r * r * d2 - D * D ) ) ,
cx0 = ( D * dy - dx * d ) / d2 ,
cy0 = ( - D * dx - dy * d ) / d2 ,
cx1 = ( D * dy + dx * d ) / d2 ,
cy1 = ( - D * dx + dy * d ) / d2 ,
dx0 = cx0 - x00 ,
dy0 = cy0 - y00 ,
dx1 = cx1 - x00 ,
dy1 = cy1 - y00 ;
// Pick the closer of the two intersection points.
// TODO Is there a faster way to determine which intersection to use?
if ( dx0 * dx0 + dy0 * dy0 > dx1 * dx1 + dy1 * dy1 ) cx0 = cx1 , cy0 = cy1 ;
return {
cx : cx0 ,
cy : cy0 ,
x01 : - ox ,
y01 : - oy ,
x11 : cx0 * ( r1 / r - 1 ) ,
y11 : cy0 * ( r1 / r - 1 )
} ;
}
var arc = function ( ) {
var innerRadius = arcInnerRadius ,
outerRadius = arcOuterRadius ,
cornerRadius = constant$10 ( 0 ) ,
padRadius = null ,
startAngle = arcStartAngle ,
endAngle = arcEndAngle ,
padAngle = arcPadAngle ,
context = null ;
function arc ( ) {
var buffer ,
r ,
r0 = + innerRadius . apply ( this , arguments ) ,
r1 = + outerRadius . apply ( this , arguments ) ,
a0 = startAngle . apply ( this , arguments ) - halfPi$3 ,
a1 = endAngle . apply ( this , arguments ) - halfPi$3 ,
da = Math . abs ( a1 - a0 ) ,
cw = a1 > a0 ;
if ( ! context ) context = buffer = path ( ) ;
// Ensure that the outer radius is always larger than the inner radius.
if ( r1 < r0 ) r = r1 , r1 = r0 , r0 = r ;
// Is it a point?
if ( ! ( r1 > epsilon$3 ) ) context . moveTo ( 0 , 0 ) ;
// Or is it a circle or annulus?
else if ( da > tau$4 - epsilon$3 ) {
context . moveTo ( r1 * Math . cos ( a0 ) , r1 * Math . sin ( a0 ) ) ;
context . arc ( 0 , 0 , r1 , a0 , a1 , ! cw ) ;
if ( r0 > epsilon$3 ) {
context . moveTo ( r0 * Math . cos ( a1 ) , r0 * Math . sin ( a1 ) ) ;
context . arc ( 0 , 0 , r0 , a1 , a0 , cw ) ;
}
}
// Or is it a circular or annular sector?
else {
var a01 = a0 ,
a11 = a1 ,
a00 = a0 ,
a10 = a1 ,
da0 = da ,
da1 = da ,
ap = padAngle . apply ( this , arguments ) / 2 ,
rp = ( ap > epsilon$3 ) && ( padRadius ? + padRadius . apply ( this , arguments ) : Math . sqrt ( r0 * r0 + r1 * r1 ) ) ,
rc = Math . min ( Math . abs ( r1 - r0 ) / 2 , + cornerRadius . apply ( this , arguments ) ) ,
rc0 = rc ,
rc1 = rc ,
t0 ,
t1 ;
// Apply padding? Note that since r1 ≥ r0, da1 ≥ da0.
if ( rp > epsilon$3 ) {
var p0 = asin$1 ( rp / r0 * Math . sin ( ap ) ) ,
p1 = asin$1 ( rp / r1 * Math . sin ( ap ) ) ;
if ( ( da0 -= p0 * 2 ) > epsilon$3 ) p0 *= ( cw ? 1 : - 1 ) , a00 += p0 , a10 -= p0 ;
else da0 = 0 , a00 = a10 = ( a0 + a1 ) / 2 ;
if ( ( da1 -= p1 * 2 ) > epsilon$3 ) p1 *= ( cw ? 1 : - 1 ) , a01 += p1 , a11 -= p1 ;
else da1 = 0 , a01 = a11 = ( a0 + a1 ) / 2 ;
}
var x01 = r1 * Math . cos ( a01 ) ,
y01 = r1 * Math . sin ( a01 ) ,
x10 = r0 * Math . cos ( a10 ) ,
y10 = r0 * Math . sin ( a10 ) ;
// Apply rounded corners?
if ( rc > epsilon$3 ) {
var x11 = r1 * Math . cos ( a11 ) ,
y11 = r1 * Math . sin ( a11 ) ,
x00 = r0 * Math . cos ( a00 ) ,
y00 = r0 * Math . sin ( a00 ) ;
// Restrict the corner radius according to the sector angle.
if ( da < pi$4 ) {
var oc = da0 > epsilon$3 ? intersect ( x01 , y01 , x00 , y00 , x11 , y11 , x10 , y10 ) : [ x10 , y10 ] ,
ax = x01 - oc [ 0 ] ,
ay = y01 - oc [ 1 ] ,
bx = x11 - oc [ 0 ] ,
by = y11 - oc [ 1 ] ,
kc = 1 / Math . sin ( Math . acos ( ( ax * bx + ay * by ) / ( Math . sqrt ( ax * ax + ay * ay ) * Math . sqrt ( bx * bx + by * by ) ) ) / 2 ) ,
lc = Math . sqrt ( oc [ 0 ] * oc [ 0 ] + oc [ 1 ] * oc [ 1 ] ) ;
rc0 = Math . min ( rc , ( r0 - lc ) / ( kc - 1 ) ) ;
rc1 = Math . min ( rc , ( r1 - lc ) / ( kc + 1 ) ) ;
}
}
// Is the sector collapsed to a line?
if ( ! ( da1 > epsilon$3 ) ) context . moveTo ( x01 , y01 ) ;
// Does the sector’
else if ( rc1 > epsilon$3 ) {
t0 = cornerTangents ( x00 , y00 , x01 , y01 , r1 , rc1 , cw ) ;
t1 = cornerTangents ( x11 , y11 , x10 , y10 , r1 , rc1 , cw ) ;
context . moveTo ( t0 . cx + t0 . x01 , t0 . cy + t0 . y01 ) ;
// Have the corners merged?
if ( rc1 < rc ) context . arc ( t0 . cx , t0 . cy , rc1 , Math . atan2 ( t0 . y01 , t0 . x01 ) , Math . atan2 ( t1 . y01 , t1 . x01 ) , ! cw ) ;
// Otherwise, draw the two corners and the ring.
else {
context . arc ( t0 . cx , t0 . cy , rc1 , Math . atan2 ( t0 . y01 , t0 . x01 ) , Math . atan2 ( t0 . y11 , t0 . x11 ) , ! cw ) ;
context . arc ( 0 , 0 , r1 , Math . atan2 ( t0 . cy + t0 . y11 , t0 . cx + t0 . x11 ) , Math . atan2 ( t1 . cy + t1 . y11 , t1 . cx + t1 . x11 ) , ! cw ) ;
context . arc ( t1 . cx , t1 . cy , rc1 , Math . atan2 ( t1 . y11 , t1 . x11 ) , Math . atan2 ( t1 . y01 , t1 . x01 ) , ! cw ) ;
}
}
// Or is the outer ring just a circular arc?
else context . moveTo ( x01 , y01 ) , context . arc ( 0 , 0 , r1 , a01 , a11 , ! cw ) ;
// Is there no inner ring, and it’
// Or perhaps it’
if ( ! ( r0 > epsilon$3 ) || ! ( da0 > epsilon$3 ) ) context . lineTo ( x10 , y10 ) ;
// Does the sector’
else if ( rc0 > epsilon$3 ) {
t0 = cornerTangents ( x10 , y10 , x11 , y11 , r0 , - rc0 , cw ) ;
t1 = cornerTangents ( x01 , y01 , x00 , y00 , r0 , - rc0 , cw ) ;
context . lineTo ( t0 . cx + t0 . x01 , t0 . cy + t0 . y01 ) ;
// Have the corners merged?
if ( rc0 < rc ) context . arc ( t0 . cx , t0 . cy , rc0 , Math . atan2 ( t0 . y01 , t0 . x01 ) , Math . atan2 ( t1 . y01 , t1 . x01 ) , ! cw ) ;
// Otherwise, draw the two corners and the ring.
else {
context . arc ( t0 . cx , t0 . cy , rc0 , Math . atan2 ( t0 . y01 , t0 . x01 ) , Math . atan2 ( t0 . y11 , t0 . x11 ) , ! cw ) ;
context . arc ( 0 , 0 , r0 , Math . atan2 ( t0 . cy + t0 . y11 , t0 . cx + t0 . x11 ) , Math . atan2 ( t1 . cy + t1 . y11 , t1 . cx + t1 . x11 ) , cw ) ;
context . arc ( t1 . cx , t1 . cy , rc0 , Math . atan2 ( t1 . y11 , t1 . x11 ) , Math . atan2 ( t1 . y01 , t1 . x01 ) , ! cw ) ;
}
}
// Or is the inner ring just a circular arc?
else context . arc ( 0 , 0 , r0 , a10 , a00 , cw ) ;
}
context . closePath ( ) ;
if ( buffer ) return context = null , buffer + "" || null ;
}
arc . centroid = function ( ) {
var r = ( + innerRadius . apply ( this , arguments ) + + outerRadius . apply ( this , arguments ) ) / 2 ,
a = ( + startAngle . apply ( this , arguments ) + + endAngle . apply ( this , arguments ) ) / 2 - pi$4 / 2 ;
return [ Math . cos ( a ) * r , Math . sin ( a ) * r ] ;
} ;
arc . innerRadius = function ( _ ) {
return arguments . length ? ( innerRadius = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : innerRadius ;
} ;
arc . outerRadius = function ( _ ) {
return arguments . length ? ( outerRadius = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : outerRadius ;
} ;
arc . cornerRadius = function ( _ ) {
return arguments . length ? ( cornerRadius = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : cornerRadius ;
} ;
arc . padRadius = function ( _ ) {
return arguments . length ? ( padRadius = _ == null ? null : typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : padRadius ;
} ;
arc . startAngle = function ( _ ) {
return arguments . length ? ( startAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : startAngle ;
} ;
arc . endAngle = function ( _ ) {
return arguments . length ? ( endAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : endAngle ;
} ;
arc . padAngle = function ( _ ) {
return arguments . length ? ( padAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , arc ) : padAngle ;
} ;
arc . context = function ( _ ) {
return arguments . length ? ( ( context = _ == null ? null : _ ) , arc ) : context ;
} ;
return arc ;
} ;
function Linear ( context ) {
this . _context = context ;
}
Linear . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ; // proceed
default :
this . _context . lineTo ( x , y ) ;
break ;
}
}
} ;
var curveLinear = function ( context ) {
return new Linear ( context ) ;
} ;
function x$3 ( p ) {
return p [ 0 ] ;
}
function y$3 ( p ) {
return p [ 1 ] ;
}
var line = function ( ) {
var x$$1 = x$3 ,
y$$1 = y$3 ,
defined = constant$10 ( true ) ,
context = null ,
curve = curveLinear ,
output = null ;
function line ( data ) {
var i ,
n = data . length ,
d ,
defined0 = false ,
buffer ;
if ( context == null ) output = curve ( buffer = path ( ) ) ;
for ( i = 0 ; i <= n ; ++ i ) {
if ( ! ( i < n && defined ( d = data [ i ] , i , data ) ) === defined0 ) {
if ( defined0 = ! defined0 ) output . lineStart ( ) ;
else output . lineEnd ( ) ;
}
if ( defined0 ) output . point ( + x$$1 ( d , i , data ) , + y$$1 ( d , i , data ) ) ;
}
if ( buffer ) return output = null , buffer + "" || null ;
}
line . x = function ( _ ) {
return arguments . length ? ( x$$1 = typeof _ === "function" ? _ : constant$10 ( + _ ) , line ) : x$$1 ;
} ;
line . y = function ( _ ) {
return arguments . length ? ( y$$1 = typeof _ === "function" ? _ : constant$10 ( + _ ) , line ) : y$$1 ;
} ;
line . defined = function ( _ ) {
return arguments . length ? ( defined = typeof _ === "function" ? _ : constant$10 ( ! ! _ ) , line ) : defined ;
} ;
line . curve = function ( _ ) {
return arguments . length ? ( curve = _ , context != null && ( output = curve ( context ) ) , line ) : curve ;
} ;
line . context = function ( _ ) {
return arguments . length ? ( _ == null ? context = output = null : output = curve ( context = _ ) , line ) : context ;
} ;
return line ;
} ;
var area$2 = function ( ) {
var x0 = x$3 ,
x1 = null ,
y0 = constant$10 ( 0 ) ,
y1 = y$3 ,
defined = constant$10 ( true ) ,
context = null ,
curve = curveLinear ,
output = null ;
function area ( data ) {
var i ,
j ,
k ,
n = data . length ,
d ,
defined0 = false ,
buffer ,
x0z = new Array ( n ) ,
y0z = new Array ( n ) ;
if ( context == null ) output = curve ( buffer = path ( ) ) ;
for ( i = 0 ; i <= n ; ++ i ) {
if ( ! ( i < n && defined ( d = data [ i ] , i , data ) ) === defined0 ) {
if ( defined0 = ! defined0 ) {
j = i ;
output . areaStart ( ) ;
output . lineStart ( ) ;
} else {
output . lineEnd ( ) ;
output . lineStart ( ) ;
for ( k = i - 1 ; k >= j ; -- k ) {
output . point ( x0z [ k ] , y0z [ k ] ) ;
}
output . lineEnd ( ) ;
output . areaEnd ( ) ;
}
}
if ( defined0 ) {
x0z [ i ] = + x0 ( d , i , data ) , y0z [ i ] = + y0 ( d , i , data ) ;
output . point ( x1 ? + x1 ( d , i , data ) : x0z [ i ] , y1 ? + y1 ( d , i , data ) : y0z [ i ] ) ;
}
}
if ( buffer ) return output = null , buffer + "" || null ;
}
function arealine ( ) {
return line ( ) . defined ( defined ) . curve ( curve ) . context ( context ) ;
}
area . x = function ( _ ) {
return arguments . length ? ( x0 = typeof _ === "function" ? _ : constant$10 ( + _ ) , x1 = null , area ) : x0 ;
} ;
area . x0 = function ( _ ) {
return arguments . length ? ( x0 = typeof _ === "function" ? _ : constant$10 ( + _ ) , area ) : x0 ;
} ;
area . x1 = function ( _ ) {
return arguments . length ? ( x1 = _ == null ? null : typeof _ === "function" ? _ : constant$10 ( + _ ) , area ) : x1 ;
} ;
area . y = function ( _ ) {
return arguments . length ? ( y0 = typeof _ === "function" ? _ : constant$10 ( + _ ) , y1 = null , area ) : y0 ;
} ;
area . y0 = function ( _ ) {
return arguments . length ? ( y0 = typeof _ === "function" ? _ : constant$10 ( + _ ) , area ) : y0 ;
} ;
area . y1 = function ( _ ) {
return arguments . length ? ( y1 = _ == null ? null : typeof _ === "function" ? _ : constant$10 ( + _ ) , area ) : y1 ;
} ;
area . lineX0 =
area . lineY0 = function ( ) {
return arealine ( ) . x ( x0 ) . y ( y0 ) ;
} ;
area . lineY1 = function ( ) {
return arealine ( ) . x ( x0 ) . y ( y1 ) ;
} ;
area . lineX1 = function ( ) {
return arealine ( ) . x ( x1 ) . y ( y0 ) ;
} ;
area . defined = function ( _ ) {
return arguments . length ? ( defined = typeof _ === "function" ? _ : constant$10 ( ! ! _ ) , area ) : defined ;
} ;
area . curve = function ( _ ) {
return arguments . length ? ( curve = _ , context != null && ( output = curve ( context ) ) , area ) : curve ;
} ;
area . context = function ( _ ) {
return arguments . length ? ( _ == null ? context = output = null : output = curve ( context = _ ) , area ) : context ;
} ;
return area ;
} ;
var descending$1 = function ( a , b ) {
return b < a ? - 1 : b > a ? 1 : b >= a ? 0 : NaN ;
} ;
var identity$7 = function ( d ) {
return d ;
} ;
var pie = function ( ) {
var value = identity$7 ,
sortValues = descending$1 ,
sort = null ,
startAngle = constant$10 ( 0 ) ,
endAngle = constant$10 ( tau$4 ) ,
padAngle = constant$10 ( 0 ) ;
function pie ( data ) {
var i ,
n = data . length ,
j ,
k ,
sum = 0 ,
index = new Array ( n ) ,
arcs = new Array ( n ) ,
a0 = + startAngle . apply ( this , arguments ) ,
da = Math . min ( tau$4 , Math . max ( - tau$4 , endAngle . apply ( this , arguments ) - a0 ) ) ,
a1 ,
p = Math . min ( Math . abs ( da ) / n , padAngle . apply ( this , arguments ) ) ,
pa = p * ( da < 0 ? - 1 : 1 ) ,
v ;
for ( i = 0 ; i < n ; ++ i ) {
if ( ( v = arcs [ index [ i ] = i ] = + value ( data [ i ] , i , data ) ) > 0 ) {
sum += v ;
}
}
// Optionally sort the arcs by previously-computed values or by data.
if ( sortValues != null ) index . sort ( function ( i , j ) { return sortValues ( arcs [ i ] , arcs [ j ] ) ; } ) ;
else if ( sort != null ) index . sort ( function ( i , j ) { return sort ( data [ i ] , data [ j ] ) ; } ) ;
// Compute the arcs! They are stored in the original data's order.
for ( i = 0 , k = sum ? ( da - n * pa ) / sum : 0 ; i < n ; ++ i , a0 = a1 ) {
j = index [ i ] , v = arcs [ j ] , a1 = a0 + ( v > 0 ? v * k : 0 ) + pa , arcs [ j ] = {
data : data [ j ] ,
index : i ,
value : v ,
startAngle : a0 ,
endAngle : a1 ,
padAngle : p
} ;
}
return arcs ;
}
pie . value = function ( _ ) {
return arguments . length ? ( value = typeof _ === "function" ? _ : constant$10 ( + _ ) , pie ) : value ;
} ;
pie . sortValues = function ( _ ) {
return arguments . length ? ( sortValues = _ , sort = null , pie ) : sortValues ;
} ;
pie . sort = function ( _ ) {
return arguments . length ? ( sort = _ , sortValues = null , pie ) : sort ;
} ;
pie . startAngle = function ( _ ) {
return arguments . length ? ( startAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , pie ) : startAngle ;
} ;
pie . endAngle = function ( _ ) {
return arguments . length ? ( endAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , pie ) : endAngle ;
} ;
pie . padAngle = function ( _ ) {
return arguments . length ? ( padAngle = typeof _ === "function" ? _ : constant$10 ( + _ ) , pie ) : padAngle ;
} ;
return pie ;
} ;
var curveRadialLinear = curveRadial ( curveLinear ) ;
function Radial ( curve ) {
this . _curve = curve ;
}
Radial . prototype = {
areaStart : function ( ) {
this . _curve . areaStart ( ) ;
} ,
areaEnd : function ( ) {
this . _curve . areaEnd ( ) ;
} ,
lineStart : function ( ) {
this . _curve . lineStart ( ) ;
} ,
lineEnd : function ( ) {
this . _curve . lineEnd ( ) ;
} ,
point : function ( a , r ) {
this . _curve . point ( r * Math . sin ( a ) , r * - Math . cos ( a ) ) ;
}
} ;
function curveRadial ( curve ) {
function radial ( context ) {
return new Radial ( curve ( context ) ) ;
}
radial . _curve = curve ;
return radial ;
}
function radialLine ( l ) {
var c = l . curve ;
l . angle = l . x , delete l . x ;
l . radius = l . y , delete l . y ;
l . curve = function ( _ ) {
return arguments . length ? c ( curveRadial ( _ ) ) : c ( ) . _curve ;
} ;
return l ;
}
var radialLine$1 = function ( ) {
return radialLine ( line ( ) . curve ( curveRadialLinear ) ) ;
} ;
var radialArea = function ( ) {
var a = area$2 ( ) . curve ( curveRadialLinear ) ,
c = a . curve ,
x0 = a . lineX0 ,
x1 = a . lineX1 ,
y0 = a . lineY0 ,
y1 = a . lineY1 ;
a . angle = a . x , delete a . x ;
a . startAngle = a . x0 , delete a . x0 ;
a . endAngle = a . x1 , delete a . x1 ;
a . radius = a . y , delete a . y ;
a . innerRadius = a . y0 , delete a . y0 ;
a . outerRadius = a . y1 , delete a . y1 ;
a . lineStartAngle = function ( ) { return radialLine ( x0 ( ) ) ; } , delete a . lineX0 ;
a . lineEndAngle = function ( ) { return radialLine ( x1 ( ) ) ; } , delete a . lineX1 ;
a . lineInnerRadius = function ( ) { return radialLine ( y0 ( ) ) ; } , delete a . lineY0 ;
a . lineOuterRadius = function ( ) { return radialLine ( y1 ( ) ) ; } , delete a . lineY1 ;
a . curve = function ( _ ) {
return arguments . length ? c ( curveRadial ( _ ) ) : c ( ) . _curve ;
} ;
return a ;
} ;
var circle$2 = {
draw : function ( context , size ) {
var r = Math . sqrt ( size / pi$4 ) ;
context . moveTo ( r , 0 ) ;
context . arc ( 0 , 0 , r , 0 , tau$4 ) ;
}
} ;
var cross$1 = {
draw : function ( context , size ) {
var r = Math . sqrt ( size / 5 ) / 2 ;
context . moveTo ( - 3 * r , - r ) ;
context . lineTo ( - r , - r ) ;
context . lineTo ( - r , - 3 * r ) ;
context . lineTo ( r , - 3 * r ) ;
context . lineTo ( r , - r ) ;
context . lineTo ( 3 * r , - r ) ;
context . lineTo ( 3 * r , r ) ;
context . lineTo ( r , r ) ;
context . lineTo ( r , 3 * r ) ;
context . lineTo ( - r , 3 * r ) ;
context . lineTo ( - r , r ) ;
context . lineTo ( - 3 * r , r ) ;
context . closePath ( ) ;
}
} ;
var tan30 = Math . sqrt ( 1 / 3 ) ;
var tan30 _2 = tan30 * 2 ;
var diamond = {
draw : function ( context , size ) {
var y = Math . sqrt ( size / tan30 _2 ) ,
x = y * tan30 ;
context . moveTo ( 0 , - y ) ;
context . lineTo ( x , 0 ) ;
context . lineTo ( 0 , y ) ;
context . lineTo ( - x , 0 ) ;
context . closePath ( ) ;
}
} ;
var ka = 0.89081309152928522810 ;
var kr = Math . sin ( pi$4 / 10 ) / Math . sin ( 7 * pi$4 / 10 ) ;
var kx = Math . sin ( tau$4 / 10 ) * kr ;
var ky = - Math . cos ( tau$4 / 10 ) * kr ;
var star = {
draw : function ( context , size ) {
var r = Math . sqrt ( size * ka ) ,
x = kx * r ,
y = ky * r ;
context . moveTo ( 0 , - r ) ;
context . lineTo ( x , y ) ;
for ( var i = 1 ; i < 5 ; ++ i ) {
var a = tau$4 * i / 5 ,
c = Math . cos ( a ) ,
s = Math . sin ( a ) ;
context . lineTo ( s * r , - c * r ) ;
context . lineTo ( c * x - s * y , s * x + c * y ) ;
}
context . closePath ( ) ;
}
} ;
var square = {
draw : function ( context , size ) {
var w = Math . sqrt ( size ) ,
x = - w / 2 ;
context . rect ( x , x , w , w ) ;
}
} ;
var sqrt3 = Math . sqrt ( 3 ) ;
var triangle = {
draw : function ( context , size ) {
var y = - Math . sqrt ( size / ( sqrt3 * 3 ) ) ;
context . moveTo ( 0 , y * 2 ) ;
context . lineTo ( - sqrt3 * y , - y ) ;
context . lineTo ( sqrt3 * y , - y ) ;
context . closePath ( ) ;
}
} ;
var c = - 0.5 ;
var s = Math . sqrt ( 3 ) / 2 ;
var k = 1 / Math . sqrt ( 12 ) ;
var a = ( k / 2 + 1 ) * 3 ;
var wye = {
draw : function ( context , size ) {
var r = Math . sqrt ( size / a ) ,
x0 = r / 2 ,
y0 = r * k ,
x1 = x0 ,
y1 = r * k + r ,
x2 = - x1 ,
y2 = y1 ;
context . moveTo ( x0 , y0 ) ;
context . lineTo ( x1 , y1 ) ;
context . lineTo ( x2 , y2 ) ;
context . lineTo ( c * x0 - s * y0 , s * x0 + c * y0 ) ;
context . lineTo ( c * x1 - s * y1 , s * x1 + c * y1 ) ;
context . lineTo ( c * x2 - s * y2 , s * x2 + c * y2 ) ;
context . lineTo ( c * x0 + s * y0 , c * y0 - s * x0 ) ;
context . lineTo ( c * x1 + s * y1 , c * y1 - s * x1 ) ;
context . lineTo ( c * x2 + s * y2 , c * y2 - s * x2 ) ;
context . closePath ( ) ;
}
} ;
var symbols = [
circle$2 ,
cross$1 ,
diamond ,
square ,
star ,
triangle ,
wye
] ;
var symbol = function ( ) {
var type = constant$10 ( circle$2 ) ,
size = constant$10 ( 64 ) ,
context = null ;
function symbol ( ) {
var buffer ;
if ( ! context ) context = buffer = path ( ) ;
type . apply ( this , arguments ) . draw ( context , + size . apply ( this , arguments ) ) ;
if ( buffer ) return context = null , buffer + "" || null ;
}
symbol . type = function ( _ ) {
return arguments . length ? ( type = typeof _ === "function" ? _ : constant$10 ( _ ) , symbol ) : type ;
} ;
symbol . size = function ( _ ) {
return arguments . length ? ( size = typeof _ === "function" ? _ : constant$10 ( + _ ) , symbol ) : size ;
} ;
symbol . context = function ( _ ) {
return arguments . length ? ( context = _ == null ? null : _ , symbol ) : context ;
} ;
return symbol ;
} ;
var noop$2 = function ( ) { } ;
function point$2 ( that , x , y ) {
that . _context . bezierCurveTo (
( 2 * that . _x0 + that . _x1 ) / 3 ,
( 2 * that . _y0 + that . _y1 ) / 3 ,
( that . _x0 + 2 * that . _x1 ) / 3 ,
( that . _y0 + 2 * that . _y1 ) / 3 ,
( that . _x0 + 4 * that . _x1 + x ) / 6 ,
( that . _y0 + 4 * that . _y1 + y ) / 6
) ;
}
function Basis ( context ) {
this . _context = context ;
}
Basis . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 =
this . _y0 = this . _y1 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 3 :
point$2 ( this , this . _x1 , this . _y1 ) ; // proceed
case 2 :
this . _context . lineTo ( this . _x1 , this . _y1 ) ;
break ;
}
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ;
this . _context . lineTo ( ( 5 * this . _x0 + this . _x1 ) / 6 , ( 5 * this . _y0 + this . _y1 ) / 6 ) ; // proceed
default :
point$2 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = x ;
this . _y0 = this . _y1 , this . _y1 = y ;
}
} ;
var basis$2 = function ( context ) {
return new Basis ( context ) ;
} ;
function BasisClosed ( context ) {
this . _context = context ;
}
BasisClosed . prototype = {
areaStart : noop$2 ,
areaEnd : noop$2 ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 = this . _x3 = this . _x4 =
this . _y0 = this . _y1 = this . _y2 = this . _y3 = this . _y4 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 1 :
{
this . _context . moveTo ( this . _x2 , this . _y2 ) ;
this . _context . closePath ( ) ;
break ;
}
case 2 :
{
this . _context . moveTo ( ( this . _x2 + 2 * this . _x3 ) / 3 , ( this . _y2 + 2 * this . _y3 ) / 3 ) ;
this . _context . lineTo ( ( this . _x3 + 2 * this . _x2 ) / 3 , ( this . _y3 + 2 * this . _y2 ) / 3 ) ;
this . _context . closePath ( ) ;
break ;
}
case 3 :
{
this . point ( this . _x2 , this . _y2 ) ;
this . point ( this . _x3 , this . _y3 ) ;
this . point ( this . _x4 , this . _y4 ) ;
break ;
}
}
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _x2 = x , this . _y2 = y ;
break ;
case 1 :
this . _point = 2 ;
this . _x3 = x , this . _y3 = y ;
break ;
case 2 :
this . _point = 3 ;
this . _x4 = x , this . _y4 = y ;
this . _context . moveTo ( ( this . _x0 + 4 * this . _x1 + x ) / 6 , ( this . _y0 + 4 * this . _y1 + y ) / 6 ) ;
break ;
default :
point$2 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = x ;
this . _y0 = this . _y1 , this . _y1 = y ;
}
} ;
var basisClosed$1 = function ( context ) {
return new BasisClosed ( context ) ;
} ;
function BasisOpen ( context ) {
this . _context = context ;
}
BasisOpen . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 =
this . _y0 = this . _y1 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line || ( this . _line !== 0 && this . _point === 3 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ;
var x0 = ( this . _x0 + 4 * this . _x1 + x ) / 6 ,
y0 = ( this . _y0 + 4 * this . _y1 + y ) / 6 ;
this . _line ? this . _context . lineTo ( x0 , y0 ) : this . _context . moveTo ( x0 , y0 ) ;
break ;
case 3 :
this . _point = 4 ; // proceed
default :
point$2 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = x ;
this . _y0 = this . _y1 , this . _y1 = y ;
}
} ;
var basisOpen = function ( context ) {
return new BasisOpen ( context ) ;
} ;
function Bundle ( context , beta ) {
this . _basis = new Basis ( context ) ;
this . _beta = beta ;
}
Bundle . prototype = {
lineStart : function ( ) {
this . _x = [ ] ;
this . _y = [ ] ;
this . _basis . lineStart ( ) ;
} ,
lineEnd : function ( ) {
var x = this . _x ,
y = this . _y ,
j = x . length - 1 ;
if ( j > 0 ) {
var x0 = x [ 0 ] ,
y0 = y [ 0 ] ,
dx = x [ j ] - x0 ,
dy = y [ j ] - y0 ,
i = - 1 ,
t ;
while ( ++ i <= j ) {
t = i / j ;
this . _basis . point (
this . _beta * x [ i ] + ( 1 - this . _beta ) * ( x0 + t * dx ) ,
this . _beta * y [ i ] + ( 1 - this . _beta ) * ( y0 + t * dy )
) ;
}
}
this . _x = this . _y = null ;
this . _basis . lineEnd ( ) ;
} ,
point : function ( x , y ) {
this . _x . push ( + x ) ;
this . _y . push ( + y ) ;
}
} ;
var bundle = ( ( function custom ( beta ) {
function bundle ( context ) {
return beta === 1 ? new Basis ( context ) : new Bundle ( context , beta ) ;
}
bundle . beta = function ( beta ) {
return custom ( + beta ) ;
} ;
return bundle ;
} ) ) ( 0.85 ) ;
function point$3 ( that , x , y ) {
that . _context . bezierCurveTo (
that . _x1 + that . _k * ( that . _x2 - that . _x0 ) ,
that . _y1 + that . _k * ( that . _y2 - that . _y0 ) ,
that . _x2 + that . _k * ( that . _x1 - x ) ,
that . _y2 + that . _k * ( that . _y1 - y ) ,
that . _x2 ,
that . _y2
) ;
}
function Cardinal ( context , tension ) {
this . _context = context ;
this . _k = ( 1 - tension ) / 6 ;
}
Cardinal . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 =
this . _y0 = this . _y1 = this . _y2 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 2 :
this . _context . lineTo ( this . _x2 , this . _y2 ) ;
break ;
case 3 :
point$3 ( this , this . _x1 , this . _y1 ) ;
break ;
}
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ;
this . _x1 = x , this . _y1 = y ;
break ;
case 2 :
this . _point = 3 ; // proceed
default :
point$3 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var cardinal = ( ( function custom ( tension ) {
function cardinal ( context ) {
return new Cardinal ( context , tension ) ;
}
cardinal . tension = function ( tension ) {
return custom ( + tension ) ;
} ;
return cardinal ;
} ) ) ( 0 ) ;
function CardinalClosed ( context , tension ) {
this . _context = context ;
this . _k = ( 1 - tension ) / 6 ;
}
CardinalClosed . prototype = {
areaStart : noop$2 ,
areaEnd : noop$2 ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 = this . _x3 = this . _x4 = this . _x5 =
this . _y0 = this . _y1 = this . _y2 = this . _y3 = this . _y4 = this . _y5 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 1 :
{
this . _context . moveTo ( this . _x3 , this . _y3 ) ;
this . _context . closePath ( ) ;
break ;
}
case 2 :
{
this . _context . lineTo ( this . _x3 , this . _y3 ) ;
this . _context . closePath ( ) ;
break ;
}
case 3 :
{
this . point ( this . _x3 , this . _y3 ) ;
this . point ( this . _x4 , this . _y4 ) ;
this . point ( this . _x5 , this . _y5 ) ;
break ;
}
}
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _x3 = x , this . _y3 = y ;
break ;
case 1 :
this . _point = 2 ;
this . _context . moveTo ( this . _x4 = x , this . _y4 = y ) ;
break ;
case 2 :
this . _point = 3 ;
this . _x5 = x , this . _y5 = y ;
break ;
default :
point$3 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var cardinalClosed = ( ( function custom ( tension ) {
function cardinal ( context ) {
return new CardinalClosed ( context , tension ) ;
}
cardinal . tension = function ( tension ) {
return custom ( + tension ) ;
} ;
return cardinal ;
} ) ) ( 0 ) ;
function CardinalOpen ( context , tension ) {
this . _context = context ;
this . _k = ( 1 - tension ) / 6 ;
}
CardinalOpen . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 =
this . _y0 = this . _y1 = this . _y2 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line || ( this . _line !== 0 && this . _point === 3 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ;
this . _line ? this . _context . lineTo ( this . _x2 , this . _y2 ) : this . _context . moveTo ( this . _x2 , this . _y2 ) ;
break ;
case 3 :
this . _point = 4 ; // proceed
default :
point$3 ( this , x , y ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var cardinalOpen = ( ( function custom ( tension ) {
function cardinal ( context ) {
return new CardinalOpen ( context , tension ) ;
}
cardinal . tension = function ( tension ) {
return custom ( + tension ) ;
} ;
return cardinal ;
} ) ) ( 0 ) ;
function point$4 ( that , x , y ) {
var x1 = that . _x1 ,
y1 = that . _y1 ,
x2 = that . _x2 ,
y2 = that . _y2 ;
if ( that . _l01 _a > epsilon$3 ) {
var a = 2 * that . _l01 _2a + 3 * that . _l01 _a * that . _l12 _a + that . _l12 _2a ,
n = 3 * that . _l01 _a * ( that . _l01 _a + that . _l12 _a ) ;
x1 = ( x1 * a - that . _x0 * that . _l12 _2a + that . _x2 * that . _l01 _2a ) / n ;
y1 = ( y1 * a - that . _y0 * that . _l12 _2a + that . _y2 * that . _l01 _2a ) / n ;
}
if ( that . _l23 _a > epsilon$3 ) {
var b = 2 * that . _l23 _2a + 3 * that . _l23 _a * that . _l12 _a + that . _l12 _2a ,
m = 3 * that . _l23 _a * ( that . _l23 _a + that . _l12 _a ) ;
x2 = ( x2 * b + that . _x1 * that . _l23 _2a - x * that . _l12 _2a ) / m ;
y2 = ( y2 * b + that . _y1 * that . _l23 _2a - y * that . _l12 _2a ) / m ;
}
that . _context . bezierCurveTo ( x1 , y1 , x2 , y2 , that . _x2 , that . _y2 ) ;
}
function CatmullRom ( context , alpha ) {
this . _context = context ;
this . _alpha = alpha ;
}
CatmullRom . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 =
this . _y0 = this . _y1 = this . _y2 = NaN ;
this . _l01 _a = this . _l12 _a = this . _l23 _a =
this . _l01 _2a = this . _l12 _2a = this . _l23 _2a =
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 2 :
this . _context . lineTo ( this . _x2 , this . _y2 ) ;
break ;
case 3 :
this . point ( this . _x2 , this . _y2 ) ;
break ;
}
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
if ( this . _point ) {
var x23 = this . _x2 - x ,
y23 = this . _y2 - y ;
this . _l23 _a = Math . sqrt ( this . _l23 _2a = Math . pow ( x23 * x23 + y23 * y23 , this . _alpha ) ) ;
}
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ; // proceed
default :
point$4 ( this , x , y ) ;
break ;
}
this . _l01 _a = this . _l12 _a , this . _l12 _a = this . _l23 _a ;
this . _l01 _2a = this . _l12 _2a , this . _l12 _2a = this . _l23 _2a ;
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var catmullRom = ( ( function custom ( alpha ) {
function catmullRom ( context ) {
return alpha ? new CatmullRom ( context , alpha ) : new Cardinal ( context , 0 ) ;
}
catmullRom . alpha = function ( alpha ) {
return custom ( + alpha ) ;
} ;
return catmullRom ;
} ) ) ( 0.5 ) ;
function CatmullRomClosed ( context , alpha ) {
this . _context = context ;
this . _alpha = alpha ;
}
CatmullRomClosed . prototype = {
areaStart : noop$2 ,
areaEnd : noop$2 ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 = this . _x3 = this . _x4 = this . _x5 =
this . _y0 = this . _y1 = this . _y2 = this . _y3 = this . _y4 = this . _y5 = NaN ;
this . _l01 _a = this . _l12 _a = this . _l23 _a =
this . _l01 _2a = this . _l12 _2a = this . _l23 _2a =
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 1 :
{
this . _context . moveTo ( this . _x3 , this . _y3 ) ;
this . _context . closePath ( ) ;
break ;
}
case 2 :
{
this . _context . lineTo ( this . _x3 , this . _y3 ) ;
this . _context . closePath ( ) ;
break ;
}
case 3 :
{
this . point ( this . _x3 , this . _y3 ) ;
this . point ( this . _x4 , this . _y4 ) ;
this . point ( this . _x5 , this . _y5 ) ;
break ;
}
}
} ,
point : function ( x , y ) {
x = + x , y = + y ;
if ( this . _point ) {
var x23 = this . _x2 - x ,
y23 = this . _y2 - y ;
this . _l23 _a = Math . sqrt ( this . _l23 _2a = Math . pow ( x23 * x23 + y23 * y23 , this . _alpha ) ) ;
}
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _x3 = x , this . _y3 = y ;
break ;
case 1 :
this . _point = 2 ;
this . _context . moveTo ( this . _x4 = x , this . _y4 = y ) ;
break ;
case 2 :
this . _point = 3 ;
this . _x5 = x , this . _y5 = y ;
break ;
default :
point$4 ( this , x , y ) ;
break ;
}
this . _l01 _a = this . _l12 _a , this . _l12 _a = this . _l23 _a ;
this . _l01 _2a = this . _l12 _2a , this . _l12 _2a = this . _l23 _2a ;
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var catmullRomClosed = ( ( function custom ( alpha ) {
function catmullRom ( context ) {
return alpha ? new CatmullRomClosed ( context , alpha ) : new CardinalClosed ( context , 0 ) ;
}
catmullRom . alpha = function ( alpha ) {
return custom ( + alpha ) ;
} ;
return catmullRom ;
} ) ) ( 0.5 ) ;
function CatmullRomOpen ( context , alpha ) {
this . _context = context ;
this . _alpha = alpha ;
}
CatmullRomOpen . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 = this . _x2 =
this . _y0 = this . _y1 = this . _y2 = NaN ;
this . _l01 _a = this . _l12 _a = this . _l23 _a =
this . _l01 _2a = this . _l12 _2a = this . _l23 _2a =
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _line || ( this . _line !== 0 && this . _point === 3 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
if ( this . _point ) {
var x23 = this . _x2 - x ,
y23 = this . _y2 - y ;
this . _l23 _a = Math . sqrt ( this . _l23 _2a = Math . pow ( x23 * x23 + y23 * y23 , this . _alpha ) ) ;
}
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ;
this . _line ? this . _context . lineTo ( this . _x2 , this . _y2 ) : this . _context . moveTo ( this . _x2 , this . _y2 ) ;
break ;
case 3 :
this . _point = 4 ; // proceed
default :
point$4 ( this , x , y ) ;
break ;
}
this . _l01 _a = this . _l12 _a , this . _l12 _a = this . _l23 _a ;
this . _l01 _2a = this . _l12 _2a , this . _l12 _2a = this . _l23 _2a ;
this . _x0 = this . _x1 , this . _x1 = this . _x2 , this . _x2 = x ;
this . _y0 = this . _y1 , this . _y1 = this . _y2 , this . _y2 = y ;
}
} ;
var catmullRomOpen = ( ( function custom ( alpha ) {
function catmullRom ( context ) {
return alpha ? new CatmullRomOpen ( context , alpha ) : new CardinalOpen ( context , 0 ) ;
}
catmullRom . alpha = function ( alpha ) {
return custom ( + alpha ) ;
} ;
return catmullRom ;
} ) ) ( 0.5 ) ;
function LinearClosed ( context ) {
this . _context = context ;
}
LinearClosed . prototype = {
areaStart : noop$2 ,
areaEnd : noop$2 ,
lineStart : function ( ) {
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( this . _point ) this . _context . closePath ( ) ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
if ( this . _point ) this . _context . lineTo ( x , y ) ;
else this . _point = 1 , this . _context . moveTo ( x , y ) ;
}
} ;
var linearClosed = function ( context ) {
return new LinearClosed ( context ) ;
} ;
function sign$1 ( x ) {
return x < 0 ? - 1 : 1 ;
}
// Calculate the slopes of the tangents (Hermite-type interpolation) based on
// the following paper: Steffen, M. 1990. A Simple Method for Monotonic
// Interpolation in One Dimension. Astronomy and Astrophysics, Vol. 239, NO.
// NOV(II), P. 443, 1990.
function slope3 ( that , x2 , y2 ) {
var h0 = that . _x1 - that . _x0 ,
h1 = x2 - that . _x1 ,
s0 = ( that . _y1 - that . _y0 ) / ( h0 || h1 < 0 && - 0 ) ,
s1 = ( y2 - that . _y1 ) / ( h1 || h0 < 0 && - 0 ) ,
p = ( s0 * h1 + s1 * h0 ) / ( h0 + h1 ) ;
return ( sign$1 ( s0 ) + sign$1 ( s1 ) ) * Math . min ( Math . abs ( s0 ) , Math . abs ( s1 ) , 0.5 * Math . abs ( p ) ) || 0 ;
}
// Calculate a one-sided slope.
function slope2 ( that , t ) {
var h = that . _x1 - that . _x0 ;
return h ? ( 3 * ( that . _y1 - that . _y0 ) / h - t ) / 2 : t ;
}
// According to https://en.wikipedia.org/wiki/Cubic_Hermite_spline#Representations
// "you can express cubic Hermite interpolation in terms of cubic Bézier curves
// with respect to the four values p0, p0 + m0 / 3, p1 - m1 / 3, p1".
function point$5 ( that , t0 , t1 ) {
var x0 = that . _x0 ,
y0 = that . _y0 ,
x1 = that . _x1 ,
y1 = that . _y1 ,
dx = ( x1 - x0 ) / 3 ;
that . _context . bezierCurveTo ( x0 + dx , y0 + dx * t0 , x1 - dx , y1 - dx * t1 , x1 , y1 ) ;
}
function MonotoneX ( context ) {
this . _context = context ;
}
MonotoneX . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x0 = this . _x1 =
this . _y0 = this . _y1 =
this . _t0 = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
switch ( this . _point ) {
case 2 :
this . _context . lineTo ( this . _x1 , this . _y1 ) ;
break ;
case 3 :
point$5 ( this , this . _t0 , slope2 ( this , this . _t0 ) ) ;
break ;
}
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
var t1 = NaN ;
x = + x , y = + y ;
if ( x === this . _x1 && y === this . _y1 ) return ; // Ignore coincident points.
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ;
break ;
case 2 :
this . _point = 3 ;
point$5 ( this , slope2 ( this , t1 = slope3 ( this , x , y ) ) , t1 ) ;
break ;
default :
point$5 ( this , this . _t0 , t1 = slope3 ( this , x , y ) ) ;
break ;
}
this . _x0 = this . _x1 , this . _x1 = x ;
this . _y0 = this . _y1 , this . _y1 = y ;
this . _t0 = t1 ;
}
} ;
function MonotoneY ( context ) {
this . _context = new ReflectContext ( context ) ;
}
( MonotoneY . prototype = Object . create ( MonotoneX . prototype ) ) . point = function ( x , y ) {
MonotoneX . prototype . point . call ( this , y , x ) ;
} ;
function ReflectContext ( context ) {
this . _context = context ;
}
ReflectContext . prototype = {
moveTo : function ( x , y ) { this . _context . moveTo ( y , x ) ; } ,
closePath : function ( ) { this . _context . closePath ( ) ; } ,
lineTo : function ( x , y ) { this . _context . lineTo ( y , x ) ; } ,
bezierCurveTo : function ( x1 , y1 , x2 , y2 , x , y ) { this . _context . bezierCurveTo ( y1 , x1 , y2 , x2 , y , x ) ; }
} ;
function monotoneX ( context ) {
return new MonotoneX ( context ) ;
}
function monotoneY ( context ) {
return new MonotoneY ( context ) ;
}
function Natural ( context ) {
this . _context = context ;
}
Natural . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x = [ ] ;
this . _y = [ ] ;
} ,
lineEnd : function ( ) {
var x = this . _x ,
y = this . _y ,
n = x . length ;
if ( n ) {
this . _line ? this . _context . lineTo ( x [ 0 ] , y [ 0 ] ) : this . _context . moveTo ( x [ 0 ] , y [ 0 ] ) ;
if ( n === 2 ) {
this . _context . lineTo ( x [ 1 ] , y [ 1 ] ) ;
} else {
var px = controlPoints ( x ) ,
py = controlPoints ( y ) ;
for ( var i0 = 0 , i1 = 1 ; i1 < n ; ++ i0 , ++ i1 ) {
this . _context . bezierCurveTo ( px [ 0 ] [ i0 ] , py [ 0 ] [ i0 ] , px [ 1 ] [ i0 ] , py [ 1 ] [ i0 ] , x [ i1 ] , y [ i1 ] ) ;
}
}
}
if ( this . _line || ( this . _line !== 0 && n === 1 ) ) this . _context . closePath ( ) ;
this . _line = 1 - this . _line ;
this . _x = this . _y = null ;
} ,
point : function ( x , y ) {
this . _x . push ( + x ) ;
this . _y . push ( + y ) ;
}
} ;
// See https://www.particleincell.com/2012/bezier-splines/ for derivation.
function controlPoints ( x ) {
var i ,
n = x . length - 1 ,
m ,
a = new Array ( n ) ,
b = new Array ( n ) ,
r = new Array ( n ) ;
a [ 0 ] = 0 , b [ 0 ] = 2 , r [ 0 ] = x [ 0 ] + 2 * x [ 1 ] ;
for ( i = 1 ; i < n - 1 ; ++ i ) a [ i ] = 1 , b [ i ] = 4 , r [ i ] = 4 * x [ i ] + 2 * x [ i + 1 ] ;
a [ n - 1 ] = 2 , b [ n - 1 ] = 7 , r [ n - 1 ] = 8 * x [ n - 1 ] + x [ n ] ;
for ( i = 1 ; i < n ; ++ i ) m = a [ i ] / b [ i - 1 ] , b [ i ] -= m , r [ i ] -= m * r [ i - 1 ] ;
a [ n - 1 ] = r [ n - 1 ] / b [ n - 1 ] ;
for ( i = n - 2 ; i >= 0 ; -- i ) a [ i ] = ( r [ i ] - a [ i + 1 ] ) / b [ i ] ;
b [ n - 1 ] = ( x [ n ] + a [ n - 1 ] ) / 2 ;
for ( i = 0 ; i < n - 1 ; ++ i ) b [ i ] = 2 * x [ i + 1 ] - a [ i + 1 ] ;
return [ a , b ] ;
}
var natural = function ( context ) {
return new Natural ( context ) ;
} ;
function Step ( context , t ) {
this . _context = context ;
this . _t = t ;
}
Step . prototype = {
areaStart : function ( ) {
this . _line = 0 ;
} ,
areaEnd : function ( ) {
this . _line = NaN ;
} ,
lineStart : function ( ) {
this . _x = this . _y = NaN ;
this . _point = 0 ;
} ,
lineEnd : function ( ) {
if ( 0 < this . _t && this . _t < 1 && this . _point === 2 ) this . _context . lineTo ( this . _x , this . _y ) ;
if ( this . _line || ( this . _line !== 0 && this . _point === 1 ) ) this . _context . closePath ( ) ;
if ( this . _line >= 0 ) this . _t = 1 - this . _t , this . _line = 1 - this . _line ;
} ,
point : function ( x , y ) {
x = + x , y = + y ;
switch ( this . _point ) {
case 0 :
this . _point = 1 ;
this . _line ? this . _context . lineTo ( x , y ) : this . _context . moveTo ( x , y ) ;
break ;
case 1 :
this . _point = 2 ; // proceed
default :
{
if ( this . _t <= 0 ) {
this . _context . lineTo ( this . _x , y ) ;
this . _context . lineTo ( x , y ) ;
} else {
var x1 = this . _x * ( 1 - this . _t ) + x * this . _t ;
this . _context . lineTo ( x1 , this . _y ) ;
this . _context . lineTo ( x1 , y ) ;
}
break ;
}
}
this . _x = x , this . _y = y ;
}
} ;
var step = function ( context ) {
return new Step ( context , 0.5 ) ;
} ;
function stepBefore ( context ) {
return new Step ( context , 0 ) ;
}
function stepAfter ( context ) {
return new Step ( context , 1 ) ;
}
var slice$5 = Array . prototype . slice ;
var none$1 = function ( series , order ) {
if ( ! ( ( n = series . length ) > 1 ) ) return ;
for ( var i = 1 , s0 , s1 = series [ order [ 0 ] ] , n , m = s1 . length ; i < n ; ++ i ) {
s0 = s1 , s1 = series [ order [ i ] ] ;
for ( var j = 0 ; j < m ; ++ j ) {
s1 [ j ] [ 1 ] += s1 [ j ] [ 0 ] = isNaN ( s0 [ j ] [ 1 ] ) ? s0 [ j ] [ 0 ] : s0 [ j ] [ 1 ] ;
}
}
} ;
var none$2 = function ( series ) {
var n = series . length ,
o = new Array ( n ) ;
while ( -- n >= 0 ) o [ n ] = n ;
return o ;
} ;
function stackValue ( d , key ) {
return d [ key ] ;
}
var stack = function ( ) {
var keys = constant$10 ( [ ] ) ,
order = none$2 ,
offset = none$1 ,
value = stackValue ;
function stack ( data ) {
var kz = keys . apply ( this , arguments ) ,
i ,
m = data . length ,
n = kz . length ,
sz = new Array ( n ) ,
oz ;
for ( i = 0 ; i < n ; ++ i ) {
for ( var ki = kz [ i ] , si = sz [ i ] = new Array ( m ) , j = 0 , sij ; j < m ; ++ j ) {
si [ j ] = sij = [ 0 , + value ( data [ j ] , ki , j , data ) ] ;
sij . data = data [ j ] ;
}
si . key = ki ;
}
for ( i = 0 , oz = order ( sz ) ; i < n ; ++ i ) {
sz [ oz [ i ] ] . index = i ;
}
offset ( sz , oz ) ;
return sz ;
}
stack . keys = function ( _ ) {
return arguments . length ? ( keys = typeof _ === "function" ? _ : constant$10 ( slice$5 . call ( _ ) ) , stack ) : keys ;
} ;
stack . value = function ( _ ) {
return arguments . length ? ( value = typeof _ === "function" ? _ : constant$10 ( + _ ) , stack ) : value ;
} ;
stack . order = function ( _ ) {
return arguments . length ? ( order = _ == null ? none$2 : typeof _ === "function" ? _ : constant$10 ( slice$5 . call ( _ ) ) , stack ) : order ;
} ;
stack . offset = function ( _ ) {
return arguments . length ? ( offset = _ == null ? none$1 : _ , stack ) : offset ;
} ;
return stack ;
} ;
var expand = function ( series , order ) {
if ( ! ( ( n = series . length ) > 0 ) ) return ;
for ( var i , n , j = 0 , m = series [ 0 ] . length , y ; j < m ; ++ j ) {
for ( y = i = 0 ; i < n ; ++ i ) y += series [ i ] [ j ] [ 1 ] || 0 ;
if ( y )
for ( i = 0 ; i < n ; ++ i ) series [ i ] [ j ] [ 1 ] /= y ;
}
none$1 ( series , order ) ;
} ;
var silhouette = function ( series , order ) {
if ( ! ( ( n = series . length ) > 0 ) ) return ;
for ( var j = 0 , s0 = series [ order [ 0 ] ] , n , m = s0 . length ; j < m ; ++ j ) {
for ( var i = 0 , y = 0 ; i < n ; ++ i ) y += series [ i ] [ j ] [ 1 ] || 0 ;
s0 [ j ] [ 1 ] += s0 [ j ] [ 0 ] = - y / 2 ;
}
none$1 ( series , order ) ;
} ;
var wiggle = function ( series , order ) {
if ( ! ( ( n = series . length ) > 0 ) || ! ( ( m = ( s0 = series [ order [ 0 ] ] ) . length ) > 0 ) ) return ;
for ( var y = 0 , j = 1 , s0 , m , n ; j < m ; ++ j ) {
for ( var i = 0 , s1 = 0 , s2 = 0 ; i < n ; ++ i ) {
var si = series [ order [ i ] ] ,
sij0 = si [ j ] [ 1 ] || 0 ,
sij1 = si [ j - 1 ] [ 1 ] || 0 ,
s3 = ( sij0 - sij1 ) / 2 ;
for ( var k = 0 ; k < i ; ++ k ) {
var sk = series [ order [ k ] ] ,
skj0 = sk [ j ] [ 1 ] || 0 ,
skj1 = sk [ j - 1 ] [ 1 ] || 0 ;
s3 += skj0 - skj1 ;
}
s1 += sij0 , s2 += s3 * sij0 ;
}
s0 [ j - 1 ] [ 1 ] += s0 [ j - 1 ] [ 0 ] = y ;
if ( s1 ) y -= s2 / s1 ;
}
s0 [ j - 1 ] [ 1 ] += s0 [ j - 1 ] [ 0 ] = y ;
none$1 ( series , order ) ;
} ;
var ascending$2 = function ( series ) {
var sums = series . map ( sum$2 ) ;
return none$2 ( series ) . sort ( function ( a , b ) { return sums [ a ] - sums [ b ] ; } ) ;
} ;
function sum$2 ( series ) {
var s = 0 ,
i = - 1 ,
n = series . length ,
v ;
while ( ++ i < n )
if ( v = + series [ i ] [ 1 ] ) s += v ;
return s ;
}
var descending$2 = function ( series ) {
return ascending$2 ( series ) . reverse ( ) ;
} ;
var insideOut = function ( series ) {
var n = series . length ,
i ,
j ,
sums = series . map ( sum$2 ) ,
order = none$2 ( series ) . sort ( function ( a , b ) { return sums [ b ] - sums [ a ] ; } ) ,
top = 0 ,
bottom = 0 ,
tops = [ ] ,
bottoms = [ ] ;
for ( i = 0 ; i < n ; ++ i ) {
j = order [ i ] ;
if ( top < bottom ) {
top += sums [ j ] ;
tops . push ( j ) ;
} else {
bottom += sums [ j ] ;
bottoms . push ( j ) ;
}
}
return bottoms . reverse ( ) . concat ( tops ) ;
} ;
var reverse = function ( series ) {
return none$2 ( series ) . reverse ( ) ;
} ;
var constant$11 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
function x$4 ( d ) {
return d [ 0 ] ;
}
function y$4 ( d ) {
return d [ 1 ] ;
}
function RedBlackTree ( ) {
this . _ = null ; // root node
}
function RedBlackNode ( node ) {
node . U = // parent node
node . C = // color - true for red, false for black
node . L = // left node
node . R = // right node
node . P = // previous node
node . N = null ; // next node
}
RedBlackTree . prototype = {
constructor : RedBlackTree ,
insert : function ( after , node ) {
var parent , grandpa , uncle ;
if ( after ) {
node . P = after ;
node . N = after . N ;
if ( after . N ) after . N . P = node ;
after . N = node ;
if ( after . R ) {
after = after . R ;
while ( after . L ) after = after . L ;
after . L = node ;
} else {
after . R = node ;
}
parent = after ;
} else if ( this . _ ) {
after = RedBlackFirst ( this . _ ) ;
node . P = null ;
node . N = after ;
after . P = after . L = node ;
parent = after ;
} else {
node . P = node . N = null ;
this . _ = node ;
parent = null ;
}
node . L = node . R = null ;
node . U = parent ;
node . C = true ;
after = node ;
while ( parent && parent . C ) {
grandpa = parent . U ;
if ( parent === grandpa . L ) {
uncle = grandpa . R ;
if ( uncle && uncle . C ) {
parent . C = uncle . C = false ;
grandpa . C = true ;
after = grandpa ;
} else {
if ( after === parent . R ) {
RedBlackRotateLeft ( this , parent ) ;
after = parent ;
parent = after . U ;
}
parent . C = false ;
grandpa . C = true ;
RedBlackRotateRight ( this , grandpa ) ;
}
} else {
uncle = grandpa . L ;
if ( uncle && uncle . C ) {
parent . C = uncle . C = false ;
grandpa . C = true ;
after = grandpa ;
} else {
if ( after === parent . L ) {
RedBlackRotateRight ( this , parent ) ;
after = parent ;
parent = after . U ;
}
parent . C = false ;
grandpa . C = true ;
RedBlackRotateLeft ( this , grandpa ) ;
}
}
parent = after . U ;
}
this . _ . C = false ;
} ,
remove : function ( node ) {
if ( node . N ) node . N . P = node . P ;
if ( node . P ) node . P . N = node . N ;
node . N = node . P = null ;
var parent = node . U ,
sibling ,
left = node . L ,
right = node . R ,
next ,
red ;
if ( ! left ) next = right ;
else if ( ! right ) next = left ;
else next = RedBlackFirst ( right ) ;
if ( parent ) {
if ( parent . L === node ) parent . L = next ;
else parent . R = next ;
} else {
this . _ = next ;
}
if ( left && right ) {
red = next . C ;
next . C = node . C ;
next . L = left ;
left . U = next ;
if ( next !== right ) {
parent = next . U ;
next . U = node . U ;
node = next . R ;
parent . L = node ;
next . R = right ;
right . U = next ;
} else {
next . U = parent ;
parent = next ;
node = next . R ;
}
} else {
red = node . C ;
node = next ;
}
if ( node ) node . U = parent ;
if ( red ) return ;
if ( node && node . C ) { node . C = false ; return ; }
do {
if ( node === this . _ ) break ;
if ( node === parent . L ) {
sibling = parent . R ;
if ( sibling . C ) {
sibling . C = false ;
parent . C = true ;
RedBlackRotateLeft ( this , parent ) ;
sibling = parent . R ;
}
if ( ( sibling . L && sibling . L . C ) ||
( sibling . R && sibling . R . C ) ) {
if ( ! sibling . R || ! sibling . R . C ) {
sibling . L . C = false ;
sibling . C = true ;
RedBlackRotateRight ( this , sibling ) ;
sibling = parent . R ;
}
sibling . C = parent . C ;
parent . C = sibling . R . C = false ;
RedBlackRotateLeft ( this , parent ) ;
node = this . _ ;
break ;
}
} else {
sibling = parent . L ;
if ( sibling . C ) {
sibling . C = false ;
parent . C = true ;
RedBlackRotateRight ( this , parent ) ;
sibling = parent . L ;
}
if ( ( sibling . L && sibling . L . C ) ||
( sibling . R && sibling . R . C ) ) {
if ( ! sibling . L || ! sibling . L . C ) {
sibling . R . C = false ;
sibling . C = true ;
RedBlackRotateLeft ( this , sibling ) ;
sibling = parent . L ;
}
sibling . C = parent . C ;
parent . C = sibling . L . C = false ;
RedBlackRotateRight ( this , parent ) ;
node = this . _ ;
break ;
}
}
sibling . C = true ;
node = parent ;
parent = parent . U ;
} while ( ! node . C ) ;
if ( node ) node . C = false ;
}
} ;
function RedBlackRotateLeft ( tree , node ) {
var p = node ,
q = node . R ,
parent = p . U ;
if ( parent ) {
if ( parent . L === p ) parent . L = q ;
else parent . R = q ;
} else {
tree . _ = q ;
}
q . U = parent ;
p . U = q ;
p . R = q . L ;
if ( p . R ) p . R . U = p ;
q . L = p ;
}
function RedBlackRotateRight ( tree , node ) {
var p = node ,
q = node . L ,
parent = p . U ;
if ( parent ) {
if ( parent . L === p ) parent . L = q ;
else parent . R = q ;
} else {
tree . _ = q ;
}
q . U = parent ;
p . U = q ;
p . L = q . R ;
if ( p . L ) p . L . U = p ;
q . R = p ;
}
function RedBlackFirst ( node ) {
while ( node . L ) node = node . L ;
return node ;
}
function createEdge ( left , right , v0 , v1 ) {
var edge = [ null , null ] ,
index = edges . push ( edge ) - 1 ;
edge . left = left ;
edge . right = right ;
if ( v0 ) setEdgeEnd ( edge , left , right , v0 ) ;
if ( v1 ) setEdgeEnd ( edge , right , left , v1 ) ;
cells [ left . index ] . halfedges . push ( index ) ;
cells [ right . index ] . halfedges . push ( index ) ;
return edge ;
}
function createBorderEdge ( left , v0 , v1 ) {
var edge = [ v0 , v1 ] ;
edge . left = left ;
return edge ;
}
function setEdgeEnd ( edge , left , right , vertex ) {
if ( ! edge [ 0 ] && ! edge [ 1 ] ) {
edge [ 0 ] = vertex ;
edge . left = left ;
edge . right = right ;
} else if ( edge . left === right ) {
edge [ 1 ] = vertex ;
} else {
edge [ 0 ] = vertex ;
}
}
// Liang–
function clipEdge ( edge , x0 , y0 , x1 , y1 ) {
var a = edge [ 0 ] ,
b = edge [ 1 ] ,
ax = a [ 0 ] ,
ay = a [ 1 ] ,
bx = b [ 0 ] ,
by = b [ 1 ] ,
t0 = 0 ,
t1 = 1 ,
dx = bx - ax ,
dy = by - ay ,
r ;
r = x0 - ax ;
if ( ! dx && r > 0 ) return ;
r /= dx ;
if ( dx < 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
} else if ( dx > 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
}
r = x1 - ax ;
if ( ! dx && r < 0 ) return ;
r /= dx ;
if ( dx < 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
} else if ( dx > 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
}
r = y0 - ay ;
if ( ! dy && r > 0 ) return ;
r /= dy ;
if ( dy < 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
} else if ( dy > 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
}
r = y1 - ay ;
if ( ! dy && r < 0 ) return ;
r /= dy ;
if ( dy < 0 ) {
if ( r > t1 ) return ;
if ( r > t0 ) t0 = r ;
} else if ( dy > 0 ) {
if ( r < t0 ) return ;
if ( r < t1 ) t1 = r ;
}
if ( ! ( t0 > 0 ) && ! ( t1 < 1 ) ) return true ; // TODO Better check?
if ( t0 > 0 ) edge [ 0 ] = [ ax + t0 * dx , ay + t0 * dy ] ;
if ( t1 < 1 ) edge [ 1 ] = [ ax + t1 * dx , ay + t1 * dy ] ;
return true ;
}
function connectEdge ( edge , x0 , y0 , x1 , y1 ) {
var v1 = edge [ 1 ] ;
if ( v1 ) return true ;
var v0 = edge [ 0 ] ,
left = edge . left ,
right = edge . right ,
lx = left [ 0 ] ,
ly = left [ 1 ] ,
rx = right [ 0 ] ,
ry = right [ 1 ] ,
fx = ( lx + rx ) / 2 ,
fy = ( ly + ry ) / 2 ,
fm ,
fb ;
if ( ry === ly ) {
if ( fx < x0 || fx >= x1 ) return ;
if ( lx > rx ) {
if ( ! v0 ) v0 = [ fx , y0 ] ;
else if ( v0 [ 1 ] >= y1 ) return ;
v1 = [ fx , y1 ] ;
} else {
if ( ! v0 ) v0 = [ fx , y1 ] ;
else if ( v0 [ 1 ] < y0 ) return ;
v1 = [ fx , y0 ] ;
}
} else {
fm = ( lx - rx ) / ( ry - ly ) ;
fb = fy - fm * fx ;
if ( fm < - 1 || fm > 1 ) {
if ( lx > rx ) {
if ( ! v0 ) v0 = [ ( y0 - fb ) / fm , y0 ] ;
else if ( v0 [ 1 ] >= y1 ) return ;
v1 = [ ( y1 - fb ) / fm , y1 ] ;
} else {
if ( ! v0 ) v0 = [ ( y1 - fb ) / fm , y1 ] ;
else if ( v0 [ 1 ] < y0 ) return ;
v1 = [ ( y0 - fb ) / fm , y0 ] ;
}
} else {
if ( ly < ry ) {
if ( ! v0 ) v0 = [ x0 , fm * x0 + fb ] ;
else if ( v0 [ 0 ] >= x1 ) return ;
v1 = [ x1 , fm * x1 + fb ] ;
} else {
if ( ! v0 ) v0 = [ x1 , fm * x1 + fb ] ;
else if ( v0 [ 0 ] < x0 ) return ;
v1 = [ x0 , fm * x0 + fb ] ;
}
}
}
edge [ 0 ] = v0 ;
edge [ 1 ] = v1 ;
return true ;
}
function clipEdges ( x0 , y0 , x1 , y1 ) {
var i = edges . length ,
edge ;
while ( i -- ) {
if ( ! connectEdge ( edge = edges [ i ] , x0 , y0 , x1 , y1 ) ||
! clipEdge ( edge , x0 , y0 , x1 , y1 ) ||
! ( Math . abs ( edge [ 0 ] [ 0 ] - edge [ 1 ] [ 0 ] ) > epsilon$4 ||
Math . abs ( edge [ 0 ] [ 1 ] - edge [ 1 ] [ 1 ] ) > epsilon$4 ) ) {
delete edges [ i ] ;
}
}
}
function createCell ( site ) {
return cells [ site . index ] = {
site : site ,
halfedges : [ ]
} ;
}
function cellHalfedgeAngle ( cell , edge ) {
var site = cell . site ,
va = edge . left ,
vb = edge . right ;
if ( site === vb ) vb = va , va = site ;
if ( vb ) return Math . atan2 ( vb [ 1 ] - va [ 1 ] , vb [ 0 ] - va [ 0 ] ) ;
if ( site === va ) va = edge [ 1 ] , vb = edge [ 0 ] ;
else va = edge [ 0 ] , vb = edge [ 1 ] ;
return Math . atan2 ( va [ 0 ] - vb [ 0 ] , vb [ 1 ] - va [ 1 ] ) ;
}
function cellHalfedgeStart ( cell , edge ) {
return edge [ + ( edge . left !== cell . site ) ] ;
}
function cellHalfedgeEnd ( cell , edge ) {
return edge [ + ( edge . left === cell . site ) ] ;
}
function sortCellHalfedges ( ) {
for ( var i = 0 , n = cells . length , cell , halfedges , j , m ; i < n ; ++ i ) {
if ( ( cell = cells [ i ] ) && ( m = ( halfedges = cell . halfedges ) . length ) ) {
var index = new Array ( m ) ,
array = new Array ( m ) ;
for ( j = 0 ; j < m ; ++ j ) index [ j ] = j , array [ j ] = cellHalfedgeAngle ( cell , edges [ halfedges [ j ] ] ) ;
index . sort ( function ( i , j ) { return array [ j ] - array [ i ] ; } ) ;
for ( j = 0 ; j < m ; ++ j ) array [ j ] = halfedges [ index [ j ] ] ;
for ( j = 0 ; j < m ; ++ j ) halfedges [ j ] = array [ j ] ;
}
}
}
function clipCells ( x0 , y0 , x1 , y1 ) {
var nCells = cells . length ,
iCell ,
cell ,
site ,
iHalfedge ,
halfedges ,
nHalfedges ,
start ,
startX ,
startY ,
end ,
endX ,
endY ,
cover = true ;
for ( iCell = 0 ; iCell < nCells ; ++ iCell ) {
if ( cell = cells [ iCell ] ) {
site = cell . site ;
halfedges = cell . halfedges ;
iHalfedge = halfedges . length ;
// Remove any dangling clipped edges.
while ( iHalfedge -- ) {
if ( ! edges [ halfedges [ iHalfedge ] ] ) {
halfedges . splice ( iHalfedge , 1 ) ;
}
}
// Insert any border edges as necessary.
iHalfedge = 0 , nHalfedges = halfedges . length ;
while ( iHalfedge < nHalfedges ) {
end = cellHalfedgeEnd ( cell , edges [ halfedges [ iHalfedge ] ] ) , endX = end [ 0 ] , endY = end [ 1 ] ;
start = cellHalfedgeStart ( cell , edges [ halfedges [ ++ iHalfedge % nHalfedges ] ] ) , startX = start [ 0 ] , startY = start [ 1 ] ;
if ( Math . abs ( endX - startX ) > epsilon$4 || Math . abs ( endY - startY ) > epsilon$4 ) {
halfedges . splice ( iHalfedge , 0 , edges . push ( createBorderEdge ( site , end ,
Math . abs ( endX - x0 ) < epsilon$4 && y1 - endY > epsilon$4 ? [ x0 , Math . abs ( startX - x0 ) < epsilon$4 ? startY : y1 ] :
Math . abs ( endY - y1 ) < epsilon$4 && x1 - endX > epsilon$4 ? [ Math . abs ( startY - y1 ) < epsilon$4 ? startX : x1 , y1 ] :
Math . abs ( endX - x1 ) < epsilon$4 && endY - y0 > epsilon$4 ? [ x1 , Math . abs ( startX - x1 ) < epsilon$4 ? startY : y0 ] :
Math . abs ( endY - y0 ) < epsilon$4 && endX - x0 > epsilon$4 ? [ Math . abs ( startY - y0 ) < epsilon$4 ? startX : x0 , y0 ] :
null ) ) - 1 ) ;
++ nHalfedges ;
}
}
if ( nHalfedges ) cover = false ;
}
}
// If there weren’
// It doesn’
if ( cover ) {
var dx , dy , d2 , dc = Infinity ;
for ( iCell = 0 , cover = null ; iCell < nCells ; ++ iCell ) {
if ( cell = cells [ iCell ] ) {
site = cell . site ;
dx = site [ 0 ] - x0 ;
dy = site [ 1 ] - y0 ;
d2 = dx * dx + dy * dy ;
if ( d2 < dc ) dc = d2 , cover = cell ;
}
}
if ( cover ) {
var v00 = [ x0 , y0 ] ,
v01 = [ x0 , y1 ] ,
v11 = [ x1 , y1 ] ,
v10 = [ x1 , y0 ] ;
cover . halfedges . push (
edges . push ( createBorderEdge ( site = cover . site , v00 , v01 ) ) - 1 ,
edges . push ( createBorderEdge ( site , v01 , v11 ) ) - 1 ,
edges . push ( createBorderEdge ( site , v11 , v10 ) ) - 1 ,
edges . push ( createBorderEdge ( site , v10 , v00 ) ) - 1
) ;
}
}
// Lastly delete any cells with no edges; these were entirely clipped.
for ( iCell = 0 ; iCell < nCells ; ++ iCell ) {
if ( cell = cells [ iCell ] ) {
if ( ! cell . halfedges . length ) {
delete cells [ iCell ] ;
}
}
}
}
var circlePool = [ ] ;
var firstCircle ;
function Circle ( ) {
RedBlackNode ( this ) ;
this . x =
this . y =
this . arc =
this . site =
this . cy = null ;
}
function attachCircle ( arc ) {
var lArc = arc . P ,
rArc = arc . N ;
if ( ! lArc || ! rArc ) return ;
var lSite = lArc . site ,
cSite = arc . site ,
rSite = rArc . site ;
if ( lSite === rSite ) return ;
var bx = cSite [ 0 ] ,
by = cSite [ 1 ] ,
ax = lSite [ 0 ] - bx ,
ay = lSite [ 1 ] - by ,
cx = rSite [ 0 ] - bx ,
cy = rSite [ 1 ] - by ;
var d = 2 * ( ax * cy - ay * cx ) ;
if ( d >= - epsilon2$2 ) return ;
var ha = ax * ax + ay * ay ,
hc = cx * cx + cy * cy ,
x = ( cy * ha - ay * hc ) / d ,
y = ( ax * hc - cx * ha ) / d ;
var circle = circlePool . pop ( ) || new Circle ;
circle . arc = arc ;
circle . site = cSite ;
circle . x = x + bx ;
circle . y = ( circle . cy = y + by ) + Math . sqrt ( x * x + y * y ) ; // y bottom
arc . circle = circle ;
var before = null ,
node = circles . _ ;
while ( node ) {
if ( circle . y < node . y || ( circle . y === node . y && circle . x <= node . x ) ) {
if ( node . L ) node = node . L ;
else { before = node . P ; break ; }
} else {
if ( node . R ) node = node . R ;
else { before = node ; break ; }
}
}
circles . insert ( before , circle ) ;
if ( ! before ) firstCircle = circle ;
}
function detachCircle ( arc ) {
var circle = arc . circle ;
if ( circle ) {
if ( ! circle . P ) firstCircle = circle . N ;
circles . remove ( circle ) ;
circlePool . push ( circle ) ;
RedBlackNode ( circle ) ;
arc . circle = null ;
}
}
var beachPool = [ ] ;
function Beach ( ) {
RedBlackNode ( this ) ;
this . edge =
this . site =
this . circle = null ;
}
function createBeach ( site ) {
var beach = beachPool . pop ( ) || new Beach ;
beach . site = site ;
return beach ;
}
function detachBeach ( beach ) {
detachCircle ( beach ) ;
beaches . remove ( beach ) ;
beachPool . push ( beach ) ;
RedBlackNode ( beach ) ;
}
function removeBeach ( beach ) {
var circle = beach . circle ,
x = circle . x ,
y = circle . cy ,
vertex = [ x , y ] ,
previous = beach . P ,
next = beach . N ,
disappearing = [ beach ] ;
detachBeach ( beach ) ;
var lArc = previous ;
while ( lArc . circle &&
Math . abs ( x - lArc . circle . x ) < epsilon$4 &&
Math . abs ( y - lArc . circle . cy ) < epsilon$4 ) {
previous = lArc . P ;
disappearing . unshift ( lArc ) ;
detachBeach ( lArc ) ;
lArc = previous ;
}
disappearing . unshift ( lArc ) ;
detachCircle ( lArc ) ;
var rArc = next ;
while ( rArc . circle &&
Math . abs ( x - rArc . circle . x ) < epsilon$4 &&
Math . abs ( y - rArc . circle . cy ) < epsilon$4 ) {
next = rArc . N ;
disappearing . push ( rArc ) ;
detachBeach ( rArc ) ;
rArc = next ;
}
disappearing . push ( rArc ) ;
detachCircle ( rArc ) ;
var nArcs = disappearing . length ,
iArc ;
for ( iArc = 1 ; iArc < nArcs ; ++ iArc ) {
rArc = disappearing [ iArc ] ;
lArc = disappearing [ iArc - 1 ] ;
setEdgeEnd ( rArc . edge , lArc . site , rArc . site , vertex ) ;
}
lArc = disappearing [ 0 ] ;
rArc = disappearing [ nArcs - 1 ] ;
rArc . edge = createEdge ( lArc . site , rArc . site , null , vertex ) ;
attachCircle ( lArc ) ;
attachCircle ( rArc ) ;
}
function addBeach ( site ) {
var x = site [ 0 ] ,
directrix = site [ 1 ] ,
lArc ,
rArc ,
dxl ,
dxr ,
node = beaches . _ ;
while ( node ) {
dxl = leftBreakPoint ( node , directrix ) - x ;
if ( dxl > epsilon$4 ) node = node . L ;
else {
dxr = x - rightBreakPoint ( node , directrix ) ;
if ( dxr > epsilon$4 ) {
if ( ! node . R ) {
lArc = node ;
break ;
}
node = node . R ;
} else {
if ( dxl > - epsilon$4 ) {
lArc = node . P ;
rArc = node ;
} else if ( dxr > - epsilon$4 ) {
lArc = node ;
rArc = node . N ;
} else {
lArc = rArc = node ;
}
break ;
}
}
}
createCell ( site ) ;
var newArc = createBeach ( site ) ;
beaches . insert ( lArc , newArc ) ;
if ( ! lArc && ! rArc ) return ;
if ( lArc === rArc ) {
detachCircle ( lArc ) ;
rArc = createBeach ( lArc . site ) ;
beaches . insert ( newArc , rArc ) ;
newArc . edge = rArc . edge = createEdge ( lArc . site , newArc . site ) ;
attachCircle ( lArc ) ;
attachCircle ( rArc ) ;
return ;
}
if ( ! rArc ) { // && lArc
newArc . edge = createEdge ( lArc . site , newArc . site ) ;
return ;
}
// else lArc !== rArc
detachCircle ( lArc ) ;
detachCircle ( rArc ) ;
var lSite = lArc . site ,
ax = lSite [ 0 ] ,
ay = lSite [ 1 ] ,
bx = site [ 0 ] - ax ,
by = site [ 1 ] - ay ,
rSite = rArc . site ,
cx = rSite [ 0 ] - ax ,
cy = rSite [ 1 ] - ay ,
d = 2 * ( bx * cy - by * cx ) ,
hb = bx * bx + by * by ,
hc = cx * cx + cy * cy ,
vertex = [ ( cy * hb - by * hc ) / d + ax , ( bx * hc - cx * hb ) / d + ay ] ;
setEdgeEnd ( rArc . edge , lSite , rSite , vertex ) ;
newArc . edge = createEdge ( lSite , site , null , vertex ) ;
rArc . edge = createEdge ( site , rSite , null , vertex ) ;
attachCircle ( lArc ) ;
attachCircle ( rArc ) ;
}
function leftBreakPoint ( arc , directrix ) {
var site = arc . site ,
rfocx = site [ 0 ] ,
rfocy = site [ 1 ] ,
pby2 = rfocy - directrix ;
if ( ! pby2 ) return rfocx ;
var lArc = arc . P ;
if ( ! lArc ) return - Infinity ;
site = lArc . site ;
var lfocx = site [ 0 ] ,
lfocy = site [ 1 ] ,
plby2 = lfocy - directrix ;
if ( ! plby2 ) return lfocx ;
var hl = lfocx - rfocx ,
aby2 = 1 / pby2 - 1 / plby2 ,
b = hl / plby2 ;
if ( aby2 ) return ( - b + Math . sqrt ( b * b - 2 * aby2 * ( hl * hl / ( - 2 * plby2 ) - lfocy + plby2 / 2 + rfocy - pby2 / 2 ) ) ) / aby2 + rfocx ;
return ( rfocx + lfocx ) / 2 ;
}
function rightBreakPoint ( arc , directrix ) {
var rArc = arc . N ;
if ( rArc ) return leftBreakPoint ( rArc , directrix ) ;
var site = arc . site ;
return site [ 1 ] === directrix ? site [ 0 ] : Infinity ;
}
var epsilon$4 = 1e-6 ;
var epsilon2$2 = 1e-12 ;
var beaches ;
var cells ;
var circles ;
var edges ;
function triangleArea ( a , b , c ) {
return ( a [ 0 ] - c [ 0 ] ) * ( b [ 1 ] - a [ 1 ] ) - ( a [ 0 ] - b [ 0 ] ) * ( c [ 1 ] - a [ 1 ] ) ;
}
function lexicographic ( a , b ) {
return b [ 1 ] - a [ 1 ] ||
b [ 0 ] - a [ 0 ] ;
}
function Diagram ( sites , extent ) {
var site = sites . sort ( lexicographic ) . pop ( ) ,
x ,
y ,
circle ;
edges = [ ] ;
cells = new Array ( sites . length ) ;
beaches = new RedBlackTree ;
circles = new RedBlackTree ;
while ( true ) {
circle = firstCircle ;
if ( site && ( ! circle || site [ 1 ] < circle . y || ( site [ 1 ] === circle . y && site [ 0 ] < circle . x ) ) ) {
if ( site [ 0 ] !== x || site [ 1 ] !== y ) {
addBeach ( site ) ;
x = site [ 0 ] , y = site [ 1 ] ;
}
site = sites . pop ( ) ;
} else if ( circle ) {
removeBeach ( circle . arc ) ;
} else {
break ;
}
}
sortCellHalfedges ( ) ;
if ( extent ) {
var x0 = + extent [ 0 ] [ 0 ] ,
y0 = + extent [ 0 ] [ 1 ] ,
x1 = + extent [ 1 ] [ 0 ] ,
y1 = + extent [ 1 ] [ 1 ] ;
clipEdges ( x0 , y0 , x1 , y1 ) ;
clipCells ( x0 , y0 , x1 , y1 ) ;
}
this . edges = edges ;
this . cells = cells ;
beaches =
circles =
edges =
cells = null ;
}
Diagram . prototype = {
constructor : Diagram ,
polygons : function ( ) {
var edges = this . edges ;
return this . cells . map ( function ( cell ) {
var polygon = cell . halfedges . map ( function ( i ) { return cellHalfedgeStart ( cell , edges [ i ] ) ; } ) ;
polygon . data = cell . site . data ;
return polygon ;
} ) ;
} ,
triangles : function ( ) {
var triangles = [ ] ,
edges = this . edges ;
this . cells . forEach ( function ( cell , i ) {
if ( ! ( m = ( halfedges = cell . halfedges ) . length ) ) return ;
var site = cell . site ,
halfedges ,
j = - 1 ,
m ,
s0 ,
e1 = edges [ halfedges [ m - 1 ] ] ,
s1 = e1 . left === site ? e1 . right : e1 . left ;
while ( ++ j < m ) {
s0 = s1 ;
e1 = edges [ halfedges [ j ] ] ;
s1 = e1 . left === site ? e1 . right : e1 . left ;
if ( s0 && s1 && i < s0 . index && i < s1 . index && triangleArea ( site , s0 , s1 ) < 0 ) {
triangles . push ( [ site . data , s0 . data , s1 . data ] ) ;
}
}
} ) ;
return triangles ;
} ,
links : function ( ) {
return this . edges . filter ( function ( edge ) {
return edge . right ;
} ) . map ( function ( edge ) {
return {
source : edge . left . data ,
target : edge . right . data
} ;
} ) ;
} ,
find : function ( x , y , radius ) {
var that = this ,
i0 , i1 = that . _found || 0 ,
n = that . cells . length ,
cell ;
// Use the previously-found cell, or start with an arbitrary one.
while ( ! ( cell = that . cells [ i1 ] ) )
if ( ++ i1 >= n ) return null ;
var dx = x - cell . site [ 0 ] ,
dy = y - cell . site [ 1 ] ,
d2 = dx * dx + dy * dy ;
// Traverse the half-edges to find a closer cell, if any.
do {
cell = that . cells [ i0 = i1 ] , i1 = null ;
cell . halfedges . forEach ( function ( e ) {
var edge = that . edges [ e ] ,
v = edge . left ;
if ( ( v === cell . site || ! v ) && ! ( v = edge . right ) ) return ;
var vx = x - v [ 0 ] ,
vy = y - v [ 1 ] ,
v2 = vx * vx + vy * vy ;
if ( v2 < d2 ) d2 = v2 , i1 = v . index ;
} ) ;
} while ( i1 !== null ) ;
that . _found = i0 ;
return radius == null || d2 <= radius * radius ? cell . site : null ;
}
} ;
var voronoi = function ( ) {
var x$$1 = x$4 ,
y$$1 = y$4 ,
extent = null ;
function voronoi ( data ) {
return new Diagram ( data . map ( function ( d , i ) {
var s = [ Math . round ( x$$1 ( d , i , data ) / epsilon$4 ) * epsilon$4 , Math . round ( y$$1 ( d , i , data ) / epsilon$4 ) * epsilon$4 ] ;
s . index = i ;
s . data = d ;
return s ;
} ) , extent ) ;
}
voronoi . polygons = function ( data ) {
return voronoi ( data ) . polygons ( ) ;
} ;
voronoi . links = function ( data ) {
return voronoi ( data ) . links ( ) ;
} ;
voronoi . triangles = function ( data ) {
return voronoi ( data ) . triangles ( ) ;
} ;
voronoi . x = function ( _ ) {
return arguments . length ? ( x$$1 = typeof _ === "function" ? _ : constant$11 ( + _ ) , voronoi ) : x$$1 ;
} ;
voronoi . y = function ( _ ) {
return arguments . length ? ( y$$1 = typeof _ === "function" ? _ : constant$11 ( + _ ) , voronoi ) : y$$1 ;
} ;
voronoi . extent = function ( _ ) {
return arguments . length ? ( extent = _ == null ? null : [
[ + _ [ 0 ] [ 0 ] , + _ [ 0 ] [ 1 ] ] ,
[ + _ [ 1 ] [ 0 ] , + _ [ 1 ] [ 1 ] ]
] , voronoi ) : extent && [
[ extent [ 0 ] [ 0 ] , extent [ 0 ] [ 1 ] ] ,
[ extent [ 1 ] [ 0 ] , extent [ 1 ] [ 1 ] ]
] ;
} ;
voronoi . size = function ( _ ) {
return arguments . length ? ( extent = _ == null ? null : [
[ 0 , 0 ] ,
[ + _ [ 0 ] , + _ [ 1 ] ]
] , voronoi ) : extent && [ extent [ 1 ] [ 0 ] - extent [ 0 ] [ 0 ] , extent [ 1 ] [ 1 ] - extent [ 0 ] [ 1 ] ] ;
} ;
return voronoi ;
} ;
var constant$12 = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
function ZoomEvent ( target , type , transform ) {
this . target = target ;
this . type = type ;
this . transform = transform ;
}
function Transform ( k , x , y ) {
this . k = k ;
this . x = x ;
this . y = y ;
}
Transform . prototype = {
constructor : Transform ,
scale : function ( k ) {
return k === 1 ? this : new Transform ( this . k * k , this . x , this . y ) ;
} ,
translate : function ( x , y ) {
return x === 0 & y === 0 ? this : new Transform ( this . k , this . x + this . k * x , this . y + this . k * y ) ;
} ,
apply : function ( point ) {
return [ point [ 0 ] * this . k + this . x , point [ 1 ] * this . k + this . y ] ;
} ,
applyX : function ( x ) {
return x * this . k + this . x ;
} ,
applyY : function ( y ) {
return y * this . k + this . y ;
} ,
invert : function ( location ) {
return [ ( location [ 0 ] - this . x ) / this . k , ( location [ 1 ] - this . y ) / this . k ] ;
} ,
invertX : function ( x ) {
return ( x - this . x ) / this . k ;
} ,
invertY : function ( y ) {
return ( y - this . y ) / this . k ;
} ,
rescaleX : function ( x ) {
return x . copy ( ) . domain ( x . range ( ) . map ( this . invertX , this ) . map ( x . invert , x ) ) ;
} ,
rescaleY : function ( y ) {
return y . copy ( ) . domain ( y . range ( ) . map ( this . invertY , this ) . map ( y . invert , y ) ) ;
} ,
toString : function ( ) {
return "translate(" + this . x + "," + this . y + ") scale(" + this . k + ")" ;
}
} ;
var identity$8 = new Transform ( 1 , 0 , 0 ) ;
transform$1 . prototype = Transform . prototype ;
function transform$1 ( node ) {
return node . _ _zoom || identity$8 ;
}
function nopropagation$2 ( ) {
exports . event . stopImmediatePropagation ( ) ;
}
var noevent$2 = function ( ) {
exports . event . preventDefault ( ) ;
exports . event . stopImmediatePropagation ( ) ;
} ;
// Ignore right-click, since that should open the context menu.
function defaultFilter$2 ( ) {
return ! exports . event . button ;
}
function defaultExtent$1 ( ) {
var e = this ,
w , h ;
if ( e instanceof SVGElement ) {
e = e . ownerSVGElement || e ;
w = e . width . baseVal . value ;
h = e . height . baseVal . value ;
} else {
w = e . clientWidth ;
h = e . clientHeight ;
}
return [
[ 0 , 0 ] ,
[ w , h ]
] ;
}
function defaultTransform ( ) {
return this . _ _zoom || identity$8 ;
}
var zoom = function ( ) {
var filter = defaultFilter$2 ,
extent = defaultExtent$1 ,
k0 = 0 ,
k1 = Infinity ,
x0 = - k1 ,
x1 = k1 ,
y0 = x0 ,
y1 = x1 ,
duration = 250 ,
interpolate$$1 = interpolateZoom ,
gestures = [ ] ,
listeners = dispatch ( "start" , "zoom" , "end" ) ,
touchstarting ,
touchending ,
touchDelay = 500 ,
wheelDelay = 150 ;
function zoom ( selection$$1 ) {
selection$$1
. on ( "wheel.zoom" , wheeled )
. on ( "mousedown.zoom" , mousedowned )
. on ( "dblclick.zoom" , dblclicked )
. on ( "touchstart.zoom" , touchstarted )
. on ( "touchmove.zoom" , touchmoved )
. on ( "touchend.zoom touchcancel.zoom" , touchended )
. style ( "-webkit-tap-highlight-color" , "rgba(0,0,0,0)" )
. property ( "__zoom" , defaultTransform ) ;
}
zoom . transform = function ( collection , transform ) {
var selection$$1 = collection . selection ? collection . selection ( ) : collection ;
selection$$1 . property ( "__zoom" , defaultTransform ) ;
if ( collection !== selection$$1 ) {
schedule ( collection , transform ) ;
} else {
selection$$1 . interrupt ( ) . each ( function ( ) {
gesture ( this , arguments )
. start ( )
. zoom ( null , typeof transform === "function" ? transform . apply ( this , arguments ) : transform )
. end ( ) ;
} ) ;
}
} ;
zoom . scaleBy = function ( selection$$1 , k ) {
zoom . scaleTo ( selection$$1 , function ( ) {
var k0 = this . _ _zoom . k ,
k1 = typeof k === "function" ? k . apply ( this , arguments ) : k ;
return k0 * k1 ;
} ) ;
} ;
zoom . scaleTo = function ( selection$$1 , k ) {
zoom . transform ( selection$$1 , function ( ) {
var e = extent . apply ( this , arguments ) ,
t0 = this . _ _zoom ,
p0 = centroid ( e ) ,
p1 = t0 . invert ( p0 ) ,
k1 = typeof k === "function" ? k . apply ( this , arguments ) : k ;
return constrain ( translate ( scale ( t0 , k1 ) , p0 , p1 ) , e ) ;
} ) ;
} ;
zoom . translateBy = function ( selection$$1 , x , y ) {
zoom . transform ( selection$$1 , function ( ) {
return constrain ( this . _ _zoom . translate (
typeof x === "function" ? x . apply ( this , arguments ) : x ,
typeof y === "function" ? y . apply ( this , arguments ) : y
) , extent . apply ( this , arguments ) ) ;
} ) ;
} ;
function scale ( transform , k ) {
k = Math . max ( k0 , Math . min ( k1 , k ) ) ;
return k === transform . k ? transform : new Transform ( k , transform . x , transform . y ) ;
}
function translate ( transform , p0 , p1 ) {
var x = p0 [ 0 ] - p1 [ 0 ] * transform . k ,
y = p0 [ 1 ] - p1 [ 1 ] * transform . k ;
return x === transform . x && y === transform . y ? transform : new Transform ( transform . k , x , y ) ;
}
function constrain ( transform , extent ) {
var dx0 = transform . invertX ( extent [ 0 ] [ 0 ] ) - x0 ,
dx1 = transform . invertX ( extent [ 1 ] [ 0 ] ) - x1 ,
dy0 = transform . invertY ( extent [ 0 ] [ 1 ] ) - y0 ,
dy1 = transform . invertY ( extent [ 1 ] [ 1 ] ) - y1 ;
return transform . translate (
dx1 > dx0 ? ( dx0 + dx1 ) / 2 : Math . min ( 0 , dx0 ) || Math . max ( 0 , dx1 ) ,
dy1 > dy0 ? ( dy0 + dy1 ) / 2 : Math . min ( 0 , dy0 ) || Math . max ( 0 , dy1 )
) ;
}
function centroid ( extent ) {
return [ ( + extent [ 0 ] [ 0 ] + + extent [ 1 ] [ 0 ] ) / 2 , ( + extent [ 0 ] [ 1 ] + + extent [ 1 ] [ 1 ] ) / 2 ] ;
}
function schedule ( transition$$1 , transform , center ) {
transition$$1
. on ( "start.zoom" , function ( ) { gesture ( this , arguments ) . start ( ) ; } )
. on ( "interrupt.zoom end.zoom" , function ( ) { gesture ( this , arguments ) . end ( ) ; } )
. tween ( "zoom" , function ( ) {
var that = this ,
args = arguments ,
g = gesture ( that , args ) ,
e = extent . apply ( that , args ) ,
p = center || centroid ( e ) ,
w = Math . max ( e [ 1 ] [ 0 ] - e [ 0 ] [ 0 ] , e [ 1 ] [ 1 ] - e [ 0 ] [ 1 ] ) ,
a = that . _ _zoom ,
b = typeof transform === "function" ? transform . apply ( that , args ) : transform ,
i = interpolate$$1 ( a . invert ( p ) . concat ( w / a . k ) , b . invert ( p ) . concat ( w / b . k ) ) ;
return function ( t ) {
if ( t === 1 ) t = b ; // Avoid rounding error on end.
else {
var l = i ( t ) ,
k = w / l [ 2 ] ;
t = new Transform ( k , p [ 0 ] - l [ 0 ] * k , p [ 1 ] - l [ 1 ] * k ) ;
}
g . zoom ( null , t ) ;
} ;
} ) ;
}
function gesture ( that , args ) {
for ( var i = 0 , n = gestures . length , g ; i < n ; ++ i ) {
if ( ( g = gestures [ i ] ) . that === that ) {
return g ;
}
}
return new Gesture ( that , args ) ;
}
function Gesture ( that , args ) {
this . that = that ;
this . args = args ;
this . index = - 1 ;
this . active = 0 ;
this . extent = extent . apply ( that , args ) ;
}
Gesture . prototype = {
start : function ( ) {
if ( ++ this . active === 1 ) {
this . index = gestures . push ( this ) - 1 ;
this . emit ( "start" ) ;
}
return this ;
} ,
zoom : function ( key , transform ) {
if ( this . mouse && key !== "mouse" ) this . mouse [ 1 ] = transform . invert ( this . mouse [ 0 ] ) ;
if ( this . touch0 && key !== "touch" ) this . touch0 [ 1 ] = transform . invert ( this . touch0 [ 0 ] ) ;
if ( this . touch1 && key !== "touch" ) this . touch1 [ 1 ] = transform . invert ( this . touch1 [ 0 ] ) ;
this . that . _ _zoom = transform ;
this . emit ( "zoom" ) ;
return this ;
} ,
end : function ( ) {
if ( -- this . active === 0 ) {
gestures . splice ( this . index , 1 ) ;
this . index = - 1 ;
this . emit ( "end" ) ;
}
return this ;
} ,
emit : function ( type ) {
customEvent ( new ZoomEvent ( zoom , type , this . that . _ _zoom ) , listeners . apply , listeners , [ type , this . that , this . args ] ) ;
}
} ;
function wheeled ( ) {
if ( ! filter . apply ( this , arguments ) ) return ;
var g = gesture ( this , arguments ) ,
t = this . _ _zoom ,
k = Math . max ( k0 , Math . min ( k1 , t . k * Math . pow ( 2 , - exports . event . deltaY * ( exports . event . deltaMode ? 120 : 1 ) / 500 ) ) ) ,
p = mouse ( this ) ;
// If the mouse is in the same location as before, reuse it.
// If there were recent wheel events, reset the wheel idle timeout.
if ( g . wheel ) {
if ( g . mouse [ 0 ] [ 0 ] !== p [ 0 ] || g . mouse [ 0 ] [ 1 ] !== p [ 1 ] ) {
g . mouse [ 1 ] = t . invert ( g . mouse [ 0 ] = p ) ;
}
clearTimeout ( g . wheel ) ;
}
// If this wheel event won’
else if ( t . k === k ) return ;
// Otherwise, capture the mouse point and location at the start.
else {
g . mouse = [ p , t . invert ( p ) ] ;
interrupt ( this ) ;
g . start ( ) ;
}
noevent$2 ( ) ;
g . wheel = setTimeout ( wheelidled , wheelDelay ) ;
g . zoom ( "mouse" , constrain ( translate ( scale ( t , k ) , g . mouse [ 0 ] , g . mouse [ 1 ] ) , g . extent ) ) ;
function wheelidled ( ) {
g . wheel = null ;
g . end ( ) ;
}
}
function mousedowned ( ) {
if ( touchending || ! filter . apply ( this , arguments ) ) return ;
var g = gesture ( this , arguments ) ,
v = select ( exports . event . view ) . on ( "mousemove.zoom" , mousemoved , true ) . on ( "mouseup.zoom" , mouseupped , true ) ,
p = mouse ( this ) ;
dragDisable ( exports . event . view ) ;
nopropagation$2 ( ) ;
g . mouse = [ p , this . _ _zoom . invert ( p ) ] ;
interrupt ( this ) ;
g . start ( ) ;
function mousemoved ( ) {
noevent$2 ( ) ;
g . moved = true ;
g . zoom ( "mouse" , constrain ( translate ( g . that . _ _zoom , g . mouse [ 0 ] = mouse ( g . that ) , g . mouse [ 1 ] ) , g . extent ) ) ;
}
function mouseupped ( ) {
v . on ( "mousemove.zoom mouseup.zoom" , null ) ;
yesdrag ( exports . event . view , g . moved ) ;
noevent$2 ( ) ;
g . end ( ) ;
}
}
function dblclicked ( ) {
if ( ! filter . apply ( this , arguments ) ) return ;
var t0 = this . _ _zoom ,
p0 = mouse ( this ) ,
p1 = t0 . invert ( p0 ) ,
k1 = t0 . k * ( exports . event . shiftKey ? 0.5 : 2 ) ,
t1 = constrain ( translate ( scale ( t0 , k1 ) , p0 , p1 ) , extent . apply ( this , arguments ) ) ;
noevent$2 ( ) ;
if ( duration > 0 ) select ( this ) . transition ( ) . duration ( duration ) . call ( schedule , t1 , p0 ) ;
else select ( this ) . call ( zoom . transform , t1 ) ;
}
function touchstarted ( ) {
if ( ! filter . apply ( this , arguments ) ) return ;
var g = gesture ( this , arguments ) ,
touches$$1 = exports . event . changedTouches ,
started ,
n = touches$$1 . length ,
i , t , p ;
nopropagation$2 ( ) ;
for ( i = 0 ; i < n ; ++ i ) {
t = touches$$1 [ i ] , p = touch ( this , touches$$1 , t . identifier ) ;
p = [ p , this . _ _zoom . invert ( p ) , t . identifier ] ;
if ( ! g . touch0 ) g . touch0 = p , started = true ;
else if ( ! g . touch1 ) g . touch1 = p ;
}
// If this is a dbltap, reroute to the (optional) dblclick.zoom handler.
if ( touchstarting ) {
touchstarting = clearTimeout ( touchstarting ) ;
if ( ! g . touch1 ) {
g . end ( ) ;
p = select ( this ) . on ( "dblclick.zoom" ) ;
if ( p ) p . apply ( this , arguments ) ;
return ;
}
}
if ( started ) {
touchstarting = setTimeout ( function ( ) { touchstarting = null ; } , touchDelay ) ;
interrupt ( this ) ;
g . start ( ) ;
}
}
function touchmoved ( ) {
var g = gesture ( this , arguments ) ,
touches$$1 = exports . event . changedTouches ,
n = touches$$1 . length ,
i , t , p , l ;
noevent$2 ( ) ;
if ( touchstarting ) touchstarting = clearTimeout ( touchstarting ) ;
for ( i = 0 ; i < n ; ++ i ) {
t = touches$$1 [ i ] , p = touch ( this , touches$$1 , t . identifier ) ;
if ( g . touch0 && g . touch0 [ 2 ] === t . identifier ) g . touch0 [ 0 ] = p ;
else if ( g . touch1 && g . touch1 [ 2 ] === t . identifier ) g . touch1 [ 0 ] = p ;
}
t = g . that . _ _zoom ;
if ( g . touch1 ) {
var p0 = g . touch0 [ 0 ] ,
l0 = g . touch0 [ 1 ] ,
p1 = g . touch1 [ 0 ] ,
l1 = g . touch1 [ 1 ] ,
dp = ( dp = p1 [ 0 ] - p0 [ 0 ] ) * dp + ( dp = p1 [ 1 ] - p0 [ 1 ] ) * dp ,
dl = ( dl = l1 [ 0 ] - l0 [ 0 ] ) * dl + ( dl = l1 [ 1 ] - l0 [ 1 ] ) * dl ;
t = scale ( t , Math . sqrt ( dp / dl ) ) ;
p = [ ( p0 [ 0 ] + p1 [ 0 ] ) / 2 , ( p0 [ 1 ] + p1 [ 1 ] ) / 2 ] ;
l = [ ( l0 [ 0 ] + l1 [ 0 ] ) / 2 , ( l0 [ 1 ] + l1 [ 1 ] ) / 2 ] ;
} else if ( g . touch0 ) p = g . touch0 [ 0 ] , l = g . touch0 [ 1 ] ;
else return ;
g . zoom ( "touch" , constrain ( translate ( t , p , l ) , g . extent ) ) ;
}
function touchended ( ) {
var g = gesture ( this , arguments ) ,
touches$$1 = exports . event . changedTouches ,
n = touches$$1 . length ,
i , t ;
nopropagation$2 ( ) ;
if ( touchending ) clearTimeout ( touchending ) ;
touchending = setTimeout ( function ( ) { touchending = null ; } , touchDelay ) ;
for ( i = 0 ; i < n ; ++ i ) {
t = touches$$1 [ i ] ;
if ( g . touch0 && g . touch0 [ 2 ] === t . identifier ) delete g . touch0 ;
else if ( g . touch1 && g . touch1 [ 2 ] === t . identifier ) delete g . touch1 ;
}
if ( g . touch1 && ! g . touch0 ) g . touch0 = g . touch1 , delete g . touch1 ;
if ( ! g . touch0 ) g . end ( ) ;
}
zoom . filter = function ( _ ) {
return arguments . length ? ( filter = typeof _ === "function" ? _ : constant$12 ( ! ! _ ) , zoom ) : filter ;
} ;
zoom . extent = function ( _ ) {
return arguments . length ? ( extent = typeof _ === "function" ? _ : constant$12 ( [
[ + _ [ 0 ] [ 0 ] , + _ [ 0 ] [ 1 ] ] ,
[ + _ [ 1 ] [ 0 ] , + _ [ 1 ] [ 1 ] ]
] ) , zoom ) : extent ;
} ;
zoom . scaleExtent = function ( _ ) {
return arguments . length ? ( k0 = + _ [ 0 ] , k1 = + _ [ 1 ] , zoom ) : [ k0 , k1 ] ;
} ;
zoom . translateExtent = function ( _ ) {
return arguments . length ? ( x0 = + _ [ 0 ] [ 0 ] , x1 = + _ [ 1 ] [ 0 ] , y0 = + _ [ 0 ] [ 1 ] , y1 = + _ [ 1 ] [ 1 ] , zoom ) : [
[ x0 , y0 ] ,
[ x1 , y1 ]
] ;
} ;
zoom . duration = function ( _ ) {
return arguments . length ? ( duration = + _ , zoom ) : duration ;
} ;
zoom . interpolate = function ( _ ) {
return arguments . length ? ( interpolate$$1 = _ , zoom ) : interpolate$$1 ;
} ;
zoom . on = function ( ) {
var value = listeners . on . apply ( listeners , arguments ) ;
return value === listeners ? zoom : value ;
} ;
return zoom ;
} ;
exports . version = version ;
exports . bisect = bisectRight ;
exports . bisectRight = bisectRight ;
exports . bisectLeft = bisectLeft ;
exports . ascending = ascending ;
exports . bisector = bisector ;
exports . descending = descending ;
exports . deviation = deviation ;
exports . extent = extent ;
exports . histogram = histogram ;
exports . thresholdFreedmanDiaconis = freedmanDiaconis ;
exports . thresholdScott = scott ;
exports . thresholdSturges = sturges ;
exports . max = max ;
exports . mean = mean ;
exports . median = median ;
exports . merge = merge ;
exports . min = min ;
exports . pairs = pairs ;
exports . permute = permute ;
exports . quantile = threshold ;
exports . range = sequence ;
exports . scan = scan ;
exports . shuffle = shuffle ;
exports . sum = sum ;
exports . ticks = ticks ;
exports . tickStep = tickStep ;
exports . transpose = transpose ;
exports . variance = variance ;
exports . zip = zip ;
exports . axisTop = axisTop ;
exports . axisRight = axisRight ;
exports . axisBottom = axisBottom ;
exports . axisLeft = axisLeft ;
exports . brush = brush ;
exports . brushX = brushX ;
exports . brushY = brushY ;
exports . brushSelection = brushSelection ;
exports . chord = chord ;
exports . ribbon = ribbon ;
exports . nest = nest ;
exports . set = set$2 ;
exports . map = map$1 ;
exports . keys = keys ;
exports . values = values ;
exports . entries = entries ;
exports . color = color ;
exports . rgb = rgb ;
exports . hsl = hsl ;
exports . lab = lab ;
exports . hcl = hcl ;
exports . cubehelix = cubehelix ;
exports . dispatch = dispatch ;
exports . drag = drag ;
exports . dragDisable = dragDisable ;
exports . dragEnable = yesdrag ;
exports . dsvFormat = dsv ;
exports . csvParse = csvParse ;
exports . csvParseRows = csvParseRows ;
exports . csvFormat = csvFormat ;
exports . csvFormatRows = csvFormatRows ;
exports . tsvParse = tsvParse ;
exports . tsvParseRows = tsvParseRows ;
exports . tsvFormat = tsvFormat ;
exports . tsvFormatRows = tsvFormatRows ;
exports . easeLinear = linear$1 ;
exports . easeQuad = quadInOut ;
exports . easeQuadIn = quadIn ;
exports . easeQuadOut = quadOut ;
exports . easeQuadInOut = quadInOut ;
exports . easeCubic = cubicInOut ;
exports . easeCubicIn = cubicIn ;
exports . easeCubicOut = cubicOut ;
exports . easeCubicInOut = cubicInOut ;
exports . easePoly = polyInOut ;
exports . easePolyIn = polyIn ;
exports . easePolyOut = polyOut ;
exports . easePolyInOut = polyInOut ;
exports . easeSin = sinInOut ;
exports . easeSinIn = sinIn ;
exports . easeSinOut = sinOut ;
exports . easeSinInOut = sinInOut ;
exports . easeExp = expInOut ;
exports . easeExpIn = expIn ;
exports . easeExpOut = expOut ;
exports . easeExpInOut = expInOut ;
exports . easeCircle = circleInOut ;
exports . easeCircleIn = circleIn ;
exports . easeCircleOut = circleOut ;
exports . easeCircleInOut = circleInOut ;
exports . easeBounce = bounceOut ;
exports . easeBounceIn = bounceIn ;
exports . easeBounceOut = bounceOut ;
exports . easeBounceInOut = bounceInOut ;
exports . easeBack = backInOut ;
exports . easeBackIn = backIn ;
exports . easeBackOut = backOut ;
exports . easeBackInOut = backInOut ;
exports . easeElastic = elasticOut ;
exports . easeElasticIn = elasticIn ;
exports . easeElasticOut = elasticOut ;
exports . easeElasticInOut = elasticInOut ;
exports . forceCenter = center$1 ;
exports . forceCollide = collide ;
exports . forceLink = link ;
exports . forceManyBody = manyBody ;
exports . forceSimulation = simulation ;
exports . forceX = x$2 ;
exports . forceY = y$2 ;
exports . formatDefaultLocale = defaultLocale ;
exports . formatLocale = formatLocale ;
exports . formatSpecifier = formatSpecifier ;
exports . precisionFixed = precisionFixed ;
exports . precisionPrefix = precisionPrefix ;
exports . precisionRound = precisionRound ;
exports . geoArea = area ;
exports . geoBounds = bounds ;
exports . geoCentroid = centroid ;
exports . geoCircle = circle ;
exports . geoClipExtent = extent$1 ;
exports . geoDistance = distance ;
exports . geoGraticule = graticule ;
exports . geoGraticule10 = graticule10 ;
exports . geoInterpolate = interpolate$1 ;
exports . geoLength = length$1 ;
exports . geoPath = index$1 ;
exports . geoAlbers = albers ;
exports . geoAlbersUsa = albersUsa ;
exports . geoAzimuthalEqualArea = azimuthalEqualArea ;
exports . geoAzimuthalEqualAreaRaw = azimuthalEqualAreaRaw ;
exports . geoAzimuthalEquidistant = azimuthalEquidistant ;
exports . geoAzimuthalEquidistantRaw = azimuthalEquidistantRaw ;
exports . geoConicConformal = conicConformal ;
exports . geoConicConformalRaw = conicConformalRaw ;
exports . geoConicEqualArea = conicEqualArea ;
exports . geoConicEqualAreaRaw = conicEqualAreaRaw ;
exports . geoConicEquidistant = conicEquidistant ;
exports . geoConicEquidistantRaw = conicEquidistantRaw ;
exports . geoEquirectangular = equirectangular ;
exports . geoEquirectangularRaw = equirectangularRaw ;
exports . geoGnomonic = gnomonic ;
exports . geoGnomonicRaw = gnomonicRaw ;
exports . geoIdentity = identity$5 ;
exports . geoProjection = projection ;
exports . geoProjectionMutator = projectionMutator ;
exports . geoMercator = mercator ;
exports . geoMercatorRaw = mercatorRaw ;
exports . geoOrthographic = orthographic ;
exports . geoOrthographicRaw = orthographicRaw ;
exports . geoStereographic = stereographic ;
exports . geoStereographicRaw = stereographicRaw ;
exports . geoTransverseMercator = transverseMercator ;
exports . geoTransverseMercatorRaw = transverseMercatorRaw ;
exports . geoRotation = rotation ;
exports . geoStream = geoStream ;
exports . geoTransform = transform ;
exports . cluster = cluster ;
exports . hierarchy = hierarchy ;
exports . pack = index$2 ;
exports . packSiblings = siblings ;
exports . packEnclose = enclose ;
exports . partition = partition ;
exports . stratify = stratify ;
exports . tree = tree ;
exports . treemap = index$3 ;
exports . treemapBinary = binary ;
exports . treemapDice = treemapDice ;
exports . treemapSlice = treemapSlice ;
exports . treemapSliceDice = sliceDice ;
exports . treemapSquarify = squarify ;
exports . treemapResquarify = resquarify ;
exports . interpolate = interpolateValue ;
exports . interpolateArray = array$1 ;
exports . interpolateBasis = basis$1 ;
exports . interpolateBasisClosed = basisClosed ;
exports . interpolateDate = date ;
exports . interpolateNumber = reinterpolate ;
exports . interpolateObject = object ;
exports . interpolateRound = interpolateRound ;
exports . interpolateString = interpolateString ;
exports . interpolateTransformCss = interpolateTransformCss ;
exports . interpolateTransformSvg = interpolateTransformSvg ;
exports . interpolateZoom = interpolateZoom ;
exports . interpolateRgb = interpolateRgb ;
exports . interpolateRgbBasis = rgbBasis ;
exports . interpolateRgbBasisClosed = rgbBasisClosed ;
exports . interpolateHsl = hsl$2 ;
exports . interpolateHslLong = hslLong ;
exports . interpolateLab = lab$1 ;
exports . interpolateHcl = hcl$2 ;
exports . interpolateHclLong = hclLong ;
exports . interpolateCubehelix = cubehelix$2 ;
exports . interpolateCubehelixLong = cubehelixLong ;
exports . quantize = quantize ;
exports . path = path ;
exports . polygonArea = area$1 ;
exports . polygonCentroid = centroid$1 ;
exports . polygonHull = hull ;
exports . polygonContains = contains ;
exports . polygonLength = length$2 ;
exports . quadtree = quadtree ;
exports . queue = queue ;
exports . randomUniform = uniform ;
exports . randomNormal = normal ;
exports . randomLogNormal = logNormal ;
exports . randomBates = bates ;
exports . randomIrwinHall = irwinHall ;
exports . randomExponential = exponential$1 ;
exports . request = request ;
exports . html = html ;
exports . json = json ;
exports . text = text ;
exports . xml = xml ;
exports . csv = csv$1 ;
exports . tsv = tsv$1 ;
exports . scaleBand = band ;
exports . scalePoint = point$1 ;
exports . scaleIdentity = identity$6 ;
exports . scaleLinear = linear$2 ;
exports . scaleLog = log$1 ;
exports . scaleOrdinal = ordinal ;
exports . scaleImplicit = implicit ;
exports . scalePow = pow$1 ;
exports . scaleSqrt = sqrt$1 ;
exports . scaleQuantile = quantile$$1 ;
exports . scaleQuantize = quantize$1 ;
exports . scaleThreshold = threshold$1 ;
exports . scaleTime = time ;
exports . scaleUtc = utcTime ;
exports . schemeCategory10 = category10 ;
exports . schemeCategory20b = category20b ;
exports . schemeCategory20c = category20c ;
exports . schemeCategory20 = category20 ;
exports . interpolateCubehelixDefault = cubehelix$3 ;
exports . interpolateRainbow = rainbow$1 ;
exports . interpolateWarm = warm ;
exports . interpolateCool = cool ;
exports . interpolateViridis = viridis ;
exports . interpolateMagma = magma ;
exports . interpolateInferno = inferno ;
exports . interpolatePlasma = plasma ;
exports . scaleSequential = sequential ;
exports . creator = creator ;
exports . local = local$1 ;
exports . matcher = matcher$1 ;
exports . mouse = mouse ;
exports . namespace = namespace ;
exports . namespaces = namespaces ;
exports . select = select ;
exports . selectAll = selectAll ;
exports . selection = selection ;
exports . selector = selector ;
exports . selectorAll = selectorAll ;
exports . touch = touch ;
exports . touches = touches ;
exports . window = window ;
exports . customEvent = customEvent ;
exports . arc = arc ;
exports . area = area$2 ;
exports . line = line ;
exports . pie = pie ;
exports . radialArea = radialArea ;
exports . radialLine = radialLine$1 ;
exports . symbol = symbol ;
exports . symbols = symbols ;
exports . symbolCircle = circle$2 ;
exports . symbolCross = cross$1 ;
exports . symbolDiamond = diamond ;
exports . symbolSquare = square ;
exports . symbolStar = star ;
exports . symbolTriangle = triangle ;
exports . symbolWye = wye ;
exports . curveBasisClosed = basisClosed$1 ;
exports . curveBasisOpen = basisOpen ;
exports . curveBasis = basis$2 ;
exports . curveBundle = bundle ;
exports . curveCardinalClosed = cardinalClosed ;
exports . curveCardinalOpen = cardinalOpen ;
exports . curveCardinal = cardinal ;
exports . curveCatmullRomClosed = catmullRomClosed ;
exports . curveCatmullRomOpen = catmullRomOpen ;
exports . curveCatmullRom = catmullRom ;
exports . curveLinearClosed = linearClosed ;
exports . curveLinear = curveLinear ;
exports . curveMonotoneX = monotoneX ;
exports . curveMonotoneY = monotoneY ;
exports . curveNatural = natural ;
exports . curveStep = step ;
exports . curveStepAfter = stepAfter ;
exports . curveStepBefore = stepBefore ;
exports . stack = stack ;
exports . stackOffsetExpand = expand ;
exports . stackOffsetNone = none$1 ;
exports . stackOffsetSilhouette = silhouette ;
exports . stackOffsetWiggle = wiggle ;
exports . stackOrderAscending = ascending$2 ;
exports . stackOrderDescending = descending$2 ;
exports . stackOrderInsideOut = insideOut ;
exports . stackOrderNone = none$2 ;
exports . stackOrderReverse = reverse ;
exports . timeInterval = newInterval ;
exports . timeMillisecond = millisecond ;
exports . timeMilliseconds = milliseconds ;
exports . utcMillisecond = millisecond ;
exports . utcMilliseconds = milliseconds ;
exports . timeSecond = second ;
exports . timeSeconds = seconds ;
exports . utcSecond = second ;
exports . utcSeconds = seconds ;
exports . timeMinute = minute ;
exports . timeMinutes = minutes ;
exports . timeHour = hour ;
exports . timeHours = hours ;
exports . timeDay = day ;
exports . timeDays = days ;
exports . timeWeek = sunday ;
exports . timeWeeks = sundays ;
exports . timeSunday = sunday ;
exports . timeSundays = sundays ;
exports . timeMonday = monday ;
exports . timeMondays = mondays ;
exports . timeTuesday = tuesday ;
exports . timeTuesdays = tuesdays ;
exports . timeWednesday = wednesday ;
exports . timeWednesdays = wednesdays ;
exports . timeThursday = thursday ;
exports . timeThursdays = thursdays ;
exports . timeFriday = friday ;
exports . timeFridays = fridays ;
exports . timeSaturday = saturday ;
exports . timeSaturdays = saturdays ;
exports . timeMonth = month ;
exports . timeMonths = months ;
exports . timeYear = year ;
exports . timeYears = years ;
exports . utcMinute = utcMinute ;
exports . utcMinutes = utcMinutes ;
exports . utcHour = utcHour ;
exports . utcHours = utcHours ;
exports . utcDay = utcDay ;
exports . utcDays = utcDays ;
exports . utcWeek = utcSunday ;
exports . utcWeeks = utcSundays ;
exports . utcSunday = utcSunday ;
exports . utcSundays = utcSundays ;
exports . utcMonday = utcMonday ;
exports . utcMondays = utcMondays ;
exports . utcTuesday = utcTuesday ;
exports . utcTuesdays = utcTuesdays ;
exports . utcWednesday = utcWednesday ;
exports . utcWednesdays = utcWednesdays ;
exports . utcThursday = utcThursday ;
exports . utcThursdays = utcThursdays ;
exports . utcFriday = utcFriday ;
exports . utcFridays = utcFridays ;
exports . utcSaturday = utcSaturday ;
exports . utcSaturdays = utcSaturdays ;
exports . utcMonth = utcMonth ;
exports . utcMonths = utcMonths ;
exports . utcYear = utcYear ;
exports . utcYears = utcYears ;
exports . timeFormatDefaultLocale = defaultLocale$1 ;
exports . timeFormatLocale = formatLocale$1 ;
exports . isoFormat = formatIso ;
exports . isoParse = parseIso ;
exports . now = now ;
exports . timer = timer ;
exports . timerFlush = timerFlush ;
exports . timeout = timeout$1 ;
exports . interval = interval$1 ;
exports . transition = transition ;
exports . active = active ;
exports . interrupt = interrupt ;
exports . voronoi = voronoi ;
exports . zoom = zoom ;
exports . zoomTransform = transform$1 ;
exports . zoomIdentity = identity$8 ;
Object . defineProperty ( exports , '__esModule' , { value : true } ) ;
} ) ) ) ;
/***/
} ) ,
/* 45 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
module . exports = _ _webpack _require _ _ ( 137 ) ;
/***/
} ) ,
/* 46 */
/***/
( function ( module , exports ) {
var g ;
// This works in non-strict mode
g = ( function ( ) {
return this ;
} ) ( ) ;
try {
// This works if eval is allowed (see CSP)
g = g || Function ( "return this" ) ( ) || ( 1 , eval ) ( "this" ) ;
} catch ( e ) {
// This works if the window reference is available
if ( 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 ;
/***/
} ) ,
/* 47 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _SentenTreeModel = _ _webpack _require _ _ ( 23 ) ;
var _SentenTreeModel2 = _interopRequireDefault ( _SentenTreeModel ) ;
var _TokenizedDataset = _ _webpack _require _ _ ( 52 ) ;
var _TokenizedDataset2 = _interopRequireDefault ( _TokenizedDataset ) ;
var _WordFilter = _ _webpack _require _ _ ( 24 ) ;
var _WordFilter2 = _interopRequireDefault ( _WordFilter ) ;
var _tokenize = _ _webpack _require _ _ ( 25 ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var identity = function identity ( x ) {
return x ;
} ;
var SentenTreeBuilder = function ( ) {
function SentenTreeBuilder ( ) {
_classCallCheck ( this , SentenTreeBuilder ) ;
this . _tokenize = _tokenize . tokenize ;
this . _transformToken = identity ;
var filter = _WordFilter2 . default . getDefault ( ) ;
this . _filterToken = function ( token ) {
return ! filter . test ( token ) ;
} ;
}
_createClass ( SentenTreeBuilder , [ {
key : 'tokenize' ,
value : function tokenize ( ) {
if ( arguments . length === 0 ) return this . _tokenize ;
this . _tokenize = arguments . length <= 0 ? undefined : arguments [ 0 ] ;
return this ;
}
} , {
key : 'transformToken' ,
value : function transformToken ( ) {
if ( arguments . length === 0 ) return this . _transformToken ;
this . _transformToken = arguments . length <= 0 ? undefined : arguments [ 0 ] ;
return this ;
}
} , {
key : 'filterToken' ,
value : function filterToken ( ) {
if ( arguments . length === 0 ) return this . _filterToken ;
this . _filterToken = arguments . length <= 0 ? undefined : arguments [ 0 ] ;
return this ;
}
} , {
key : 'buildTokenizedDataset' ,
value : function buildTokenizedDataset ( entries ) {
var _this = this ;
var tokenizedEntries = entries . map ( function ( entry ) {
return {
id : entry . id ,
count : entry . count || 1 ,
tokens : _this . _tokenize ( entry . text ) . map ( _this . _transformToken ) . filter ( _this . _filterToken ) ,
rawText : entry . text
} ;
} ) . filter ( function ( entry ) {
return entry . tokens . length > 0 ;
} ) ;
return new _TokenizedDataset2 . default ( tokenizedEntries ) ;
}
} , {
key : 'buildModel' ,
value : function buildModel ( entries , options ) {
return new _SentenTreeModel2 . default ( this . buildTokenizedDataset ( entries ) , options ) ;
}
} ] ) ;
return SentenTreeBuilder ;
} ( ) ;
exports . default = SentenTreeBuilder ;
/***/
} ) ,
/* 48 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _get = function get ( object , property , receiver ) { if ( object === null ) object = Function . prototype ; var desc = Object . getOwnPropertyDescriptor ( object , property ) ; if ( desc === undefined ) { var parent = Object . getPrototypeOf ( object ) ; if ( parent === null ) { return undefined ; } else { return get ( parent , property , receiver ) ; } } else if ( "value" in desc ) { return desc . value ; } else { var getter = desc . get ; if ( getter === undefined ) { return undefined ; } return getter . call ( receiver ) ; } } ;
_ _webpack _require _ _ ( 115 ) ;
var _d = _ _webpack _require _ _ ( 44 ) ;
var d3 = _interopRequireWildcard ( _d ) ;
var _d3kit = _ _webpack _require _ _ ( 136 ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
var _Layout = _ _webpack _require _ _ ( 53 ) ;
var _Layout2 = _interopRequireDefault ( _Layout ) ;
var _shapeUtil = _ _webpack _require _ _ ( 54 ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _interopRequireWildcard ( obj ) {
if ( obj && obj . _ _esModule ) { return obj ; } else {
var newObj = { } ;
if ( obj != null ) { for ( var key in obj ) { if ( Object . prototype . hasOwnProperty . call ( obj , key ) ) newObj [ key ] = obj [ key ] ; } }
newObj . default = obj ;
return newObj ;
}
}
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
function _possibleConstructorReturn ( self , call ) { if ( ! self ) { throw new ReferenceError ( "this hasn't been initialised - super() hasn't been called" ) ; } return call && ( typeof call === "object" || typeof call === "function" ) ? call : self ; }
function _inherits ( subClass , superClass ) {
if ( typeof superClass !== "function" && superClass !== null ) { throw new TypeError ( "Super expression must either be null or a function, not " + typeof superClass ) ; }
subClass . prototype = Object . create ( superClass && superClass . prototype , { constructor : { value : subClass , enumerable : false , writable : true , configurable : true } } ) ;
if ( superClass ) Object . setPrototypeOf ? Object . setPrototypeOf ( subClass , superClass ) : subClass . _ _proto _ _ = superClass ;
}
var SentenTreeVis = function ( _SvgChart ) {
_inherits ( SentenTreeVis , _SvgChart ) ;
_createClass ( SentenTreeVis , null , [ {
key : 'getDefaultOptions' ,
value : function getDefaultOptions ( ) {
return _d3kit . helper . deepExtend ( _get ( SentenTreeVis . _ _proto _ _ || Object . getPrototypeOf ( SentenTreeVis ) , 'getDefaultOptions' , this ) . call ( this ) , {
initialWidth : 800 ,
initialHeight : 200 ,
margin : { left : 0 , top : 0 , bottom : 0 , right : 0 } ,
fontSize : [ 10 , 32 ] ,
gapBetweenGraph : 10
} ) ;
}
} , {
key : 'getCustomEventNames' ,
value : function getCustomEventNames ( ) {
return [ 'layoutStart' , 'layoutTick' , 'layoutEnd' , 'nodeMouseenter' , 'nodeMouseleave' , 'nodeMousemove' , 'nodeClick' , 'linkMouseenter' , 'linkMouseleave' , 'linkMousemove' , 'linkClick' ] ;
}
} ] ) ;
function SentenTreeVis ( element , options ) {
_classCallCheck ( this , SentenTreeVis ) ;
var _this = _possibleConstructorReturn ( this , ( SentenTreeVis . _ _proto _ _ || Object . getPrototypeOf ( SentenTreeVis ) ) . call ( this , element , options ) ) ;
_this . layers . create ( [ 'link' , 'node' ] ) ;
_this . fontSizeScale = d3 . scaleSqrt ( ) . clamp ( true ) ;
_this . strokeSizeScale = d3 . scaleSqrt ( ) . domain ( [ 1 , 100 ] ) . range ( [ 1 , 6 ] ) . clamp ( true ) ;
_this . layouts = [ ] ;
_this . updatePosition = _this . updatePosition . bind ( _this ) ;
_this . visualize = _this . visualize . bind ( _this ) ;
_this . on ( 'data' , _this . visualize ) ;
_this . on ( 'options' , _this . visualize ) ;
// this.on('resize', this.visualize);
return _this ;
}
_createClass ( SentenTreeVis , [ {
key : 'fontSize' ,
value : function fontSize ( node ) {
return Math . round ( this . fontSizeScale ( node . data . freq ) ) + 'px' ;
}
} , {
key : 'renderNodes' ,
value : function renderNodes ( graphs ) {
var _this2 = this ;
var sUpdate = this . layers . get ( 'node' ) . selectAll ( 'g.graph' ) . data ( graphs ) ;
sUpdate . exit ( ) . remove ( ) ;
var sEnter = sUpdate . enter ( ) . append ( 'g' ) . classed ( 'graph' , true ) ;
this . sNodeGraphs = sUpdate . merge ( sEnter ) . attr ( 'transform' , 'translate(' + this . getInnerWidth ( ) / 2 + ',' + this . getInnerHeight ( ) / 2 + ')' ) ;
var sUpdateNode = sEnter . selectAll ( 'g' ) . data ( function ( d ) {
return d . nodes ;
} , function ( n ) {
return n . id ;
} ) ;
sUpdateNode . exit ( ) . remove ( ) ;
sUpdateNode . enter ( ) . append ( 'g' )
. classed ( 'node' , true )
. on ( 'click.event' , this . dispatchAs ( 'nodeClick' ) )
. on ( 'mouseenter.event' , this . dispatchAs ( 'nodeMouseenter' ) )
. on ( 'mousemove.event' , this . dispatchAs ( 'nodeMousemove' ) )
. on ( 'mouseleave.event' , this . dispatchAs ( 'nodeMouseleave' ) )
. append ( 'text' ) . attr ( 'dy' , '.28em' ) . text ( function ( d ) {
return d . data . entity ;
} ) . style ( 'cursor' , 'pointer' ) ;
this . sNodes = this . layers . get ( 'node' ) . selectAll ( 'g.node' ) ;
this . sNodes . select ( 'text' ) . style ( 'font-size' , function ( d ) {
return _this2 . fontSize ( d ) ;
} ) . style ( 'text-anchor' , 'middle' ) ;
}
} , {
key : 'renderLinks' ,
value : function renderLinks ( graphs ) {
var _this3 = this ;
var sUpdate = this . layers . get ( 'link' ) . selectAll ( 'g.graph' ) . data ( graphs ) ;
sUpdate . exit ( ) . remove ( ) ;
var sEnter = sUpdate . enter ( ) . append ( 'g' ) . classed ( 'graph' , true ) ;
this . sLinkGraphs = sUpdate . merge ( sEnter ) . attr ( 'transform' , 'translate(' + this . getInnerWidth ( ) / 2 + ',' + this . getInnerHeight ( ) / 2 + ')' ) ;
var sUpdateLink = sEnter . selectAll ( 'path.link' ) . data ( function ( d ) {
return d . links ;
} , function ( l ) {
return l . getKey ( ) ;
} ) ;
sUpdateLink . exit ( ) . remove ( ) ;
sUpdateLink . enter ( ) . append ( 'path' ) . classed ( 'link' , true ) . on ( 'click.event' , this . dispatchAs ( 'linkClick' ) ) . on ( 'mouseenter.event' , this . dispatchAs ( 'linkMouseenter' ) ) . on ( 'mousemove.event' , this . dispatchAs ( 'linkMousemove' ) ) . on ( 'mouseleave.event' , this . dispatchAs ( 'linkMouseleave' ) ) . style ( 'vector-effect' , 'non-scaling-stroke' ) . style ( 'opacity' , 0.5 ) . style ( 'stroke' , '#222' ) . style ( 'fill' , 'none' ) ;
graphs . forEach ( function ( graph ) {
graph . links . forEach ( function ( link ) {
link . strokeWidth = Math . round ( _this3 . strokeSizeScale ( link . freq / graph . minSupport ) ) ;
} ) ;
} ) ;
this . sLinks = this . layers . get ( 'link' ) . selectAll ( 'path.link' ) . style ( 'stroke-width' , function ( d ) {
return d . strokeWidth + 'px' ;
} ) . style ( 'stroke' , function ( l ) {
return l . isTheOnlyBridge ( ) ? '#777' : '#FF9800' ;
} ) ;
}
} , {
key : 'updatePosition' ,
value : function updatePosition ( ) {
var yPos = 0 ;
var maxw = 0 ;
var _options = this . options ( ) ,
margin = _options . margin ,
gapBetweenGraph = _options . gapBetweenGraph ;
var top = margin . top ,
left = margin . left ,
bottom = margin . bottom ,
right = margin . right ;
// Get bbox of <g> for each graph to compute total dimension
// and stack each graph on top of each other
this . sNodeGraphs . each ( function fn ( graph ) {
var bbox = this . getBBox ( ) ;
var w = bbox . width ;
var h = bbox . height ;
maxw = Math . max ( w , maxw ) ;
graph . x = - bbox . x ;
graph . y = - bbox . y + yPos ;
yPos += h + gapBetweenGraph ;
} ) ;
this . sNodeGraphs . attr ( 'transform' , function ( graph ) {
return 'translate(' + graph . x + ',' + graph . y + ')' ;
} ) ;
this . sLinkGraphs . attr ( 'transform' , function ( graph ) {
return 'translate(' + graph . x + ',' + graph . y + ')' ;
} ) ;
// Update component size to fit all content
this . dimension ( [ maxw + left + right , Math . max ( 0 , yPos - gapBetweenGraph ) + top + bottom ] ) ;
this . placeNodes ( ) ;
this . placeLinks ( ) ;
}
} , {
key : 'placeNodes' ,
value : function placeNodes ( ) {
this . sNodes . attr ( 'transform' , function ( d ) {
return 'translate(' + d . x + ', ' + d . y + ')' ;
} ) ;
}
} , {
key : 'placeLinks' ,
value : function placeLinks ( ) {
// draw directed edges with proper padding from node centers
var graphs = this . data ( ) ;
graphs . forEach ( function ( graph ) {
graph . nodes . forEach ( function ( node ) {
node . updateAttachPoints ( ) ;
} ) ;
} ) ;
this . sLinks . attr ( 'd' , function ( link ) {
var points = [ link . source . rightEdge ( ) , link . attachPoints . y1 , link . target . leftEdge ( ) , link . attachPoints . y2 ] ;
// const xGap = link.target.leftEdge() - link.source.rightEdge();
// if (xGap > 30) {
// return line(...points);
// }
return _shapeUtil . diagonal . apply ( undefined , points ) ;
} ) ;
}
} , {
key : 'visualize' ,
value : function visualize ( ) {
if ( ! this . hasData ( ) ) return ;
var graphs = this . data ( ) ;
if ( graphs . length > 0 ) {
var _options2 = this . options ( ) ,
fontSize = _options2 . fontSize ;
this . fontSizeScale . domain ( graphs [ 0 ] . globalFreqRange ) . range ( fontSize ) ;
}
this . linkLookup = ( 0 , _lodash . keyBy ) ( ( 0 , _lodash . flatMap ) ( graphs , function ( g ) {
return g . links ;
} ) , function ( l ) {
return [ l . source . gid , l . target . gid ] . join ( ',' ) ;
} ) ;
this . renderNodes ( graphs ) ;
this . renderLinks ( graphs ) ;
// Update node position for layout computation
this . sNodes . each ( function fn ( node ) {
var bbox = this . getBBox ( ) ;
node . width = bbox . width + 4 ;
node . height = bbox . height + 4 ;
} ) ;
// Update layout pool
var len = Math . max ( graphs . length , this . layouts . length ) ;
for ( var i = 0 ; i < len ; i ++ ) {
if ( i >= this . layouts . length ) {
this . layouts . push ( new _Layout2 . default ( ) . on ( 'tick' , this . updatePosition ) ) ;
}
if ( i >= graphs . length ) {
this . layouts [ i ] . stop ( ) . destroy ( ) ;
continue ;
}
this . layouts [ i ] . stop ( ) . setGraph ( graphs [ i ] ) . start ( ) ;
}
this . layouts = this . layouts . slice ( 0 , graphs . length ) ;
this . updatePosition ( ) ;
// const colaAdaptor = this.colaAdaptor;
// this.sNodes.call(colaAdaptor.drag);
// this.sLinks.call(colaAdaptor.drag);
// this.colaAdaptor.on('tick', event => {
// this.placeNodes();
// this.placeLinks();
// });
}
} , {
key : 'highlightNeighbors' ,
value : function highlightNeighbors ( node ) {
var _this4 = this ;
this . sNodes . transition ( ) . style ( 'opacity' , function ( d ) {
return d . gid === node . gid || _this4 . linkLookup [ [ d . gid , node . gid ] . join ( ',' ) ] || _this4 . linkLookup [ [ node . gid , d . gid ] . join ( ',' ) ] ? 1 : 0.3 ;
} ) ;
this . sLinks . transition ( ) . style ( 'opacity' , function ( d ) {
return d . source . gid === node . gid || d . target . gid === node . gid ? 1 : 0.3 ;
} ) ;
}
} , {
key : 'clearHighlightNeighbors' ,
value : function clearHighlightNeighbors ( ) {
this . sNodes . transition ( ) . style ( 'opacity' , 1 ) ;
this . sLinks . transition ( ) . style ( 'opacity' , 0.3 ) ;
}
} ] ) ;
return SentenTreeVis ;
} ( _d3kit . SvgChart ) ;
exports . default = SentenTreeVis ;
/***/
} ) ,
/* 49 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
var _heap = _ _webpack _require _ _ ( 45 ) ;
var _heap2 = _interopRequireDefault ( _heap ) ;
var _Link = _ _webpack _require _ _ ( 26 ) ;
var _Link2 = _interopRequireDefault ( _Link ) ;
var _Node = _ _webpack _require _ _ ( 27 ) ;
var _Node2 = _interopRequireDefault ( _Node ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var GraphBundler = function ( ) {
function GraphBundler ( nodes , links ) {
_classCallCheck ( this , GraphBundler ) ;
this . nodes = nodes ;
this . links = links ;
this . linkLookup = ( 0 , _lodash . keyBy ) ( this . links , function ( l ) {
return l . getKey ( ) ;
} ) ;
}
_createClass ( GraphBundler , [ {
key : 'addLinks' ,
value : function addLinks ( links ) {
var _this = this ;
this . links = this . links . concat ( links ) ;
links . forEach ( function ( link ) {
_this . linkLookup [ link . getKey ( ) ] = link ;
} ) ;
}
} , {
key : 'bundle' ,
value : function bundle ( ) {
var _this2 = this ;
var heap = new _heap2 . default ( function ( a , b ) {
return a . data . id - b . data . id ;
} ) ;
// Add candidate parents to heap
this . nodes . filter ( function ( n ) {
return _this2 . hasPotential ( n ) ;
} ) . forEach ( function ( n ) {
heap . push ( n ) ;
} ) ;
let counter = 1 ;
while ( heap . size ( ) > 0 ) {
console . log ( ` in while ${ counter ++ } ` )
var parent = heap . pop ( ) ;
console . log ( heap )
if ( parent . merged ) {
continue ;
}
var groups = [ ] ;
console . log ( parent . data . id )
if ( parent . leftLinks . length > 1 ) {
var lNodes = parent . leftLinks . map ( function ( l ) {
return l . source ;
} ) ;
groups = groups . concat ( this . groupMergeableNodes ( lNodes ) ) ;
}
if ( parent . rightLinks . length > 1 ) {
var rNodes = parent . rightLinks . map ( function ( l ) {
return l . target ;
} ) ;
groups = groups . concat ( this . groupMergeableNodes ( rNodes ) ) ;
}
console . log ( groups )
if ( groups . length > 0 ) {
var newNodes = groups . map ( function ( group ) {
return _this2 . mergeNodes ( group ) ;
} ) ;
newNodes . filter ( function ( n ) {
return _this2 . hasPotential ( n ) ;
} ) . forEach ( function ( n ) {
heap . push ( n ) ;
} ) ;
}
}
return {
nodes : this . nodes . filter ( function ( n ) {
return ! n . merged ;
} ) ,
links : this . links . filter ( function ( l ) {
return ! l . source . merged && ! l . target . merged ;
} )
} ;
}
} , {
key : 'groupMergeableNodes' ,
value : function groupMergeableNodes ( nodes ) {
var linkLookup = this . linkLookup ;
return ( 0 , _lodash . chain ) ( nodes ) . groupBy ( function ( n ) {
return n . data . entity ;
} ) . values ( ) . filter ( function ( g ) {
return g . length > 1 ;
} ) . flatMap ( function ( g ) {
var subgroups = [
[ g [ 0 ] ]
] ;
var _loop = function _loop ( i ) {
var node = g [ i ] ;
for ( var j = 0 ; j < subgroups . length ; j ++ ) {
var subgroup = subgroups [ j ] ;
if ( subgroup . every ( function ( n ) {
return ! linkLookup [ [ n . id , node . id ] . join ( ',' ) ] && ! linkLookup [ [ n . id , node . id ] . join ( ',' ) ] ;
} ) ) {
subgroup . push ( node ) ;
continue ;
}
subgroups . push ( [ node ] ) ;
}
} ;
for ( var i = 1 ; i < g . length ; i ++ ) {
_loop ( i ) ;
}
return subgroups . filter ( function ( subgroup ) {
return subgroup . length > 1 ;
} ) ;
} ) . value ( ) ;
}
} , {
key : 'hasPotential' ,
value : function hasPotential ( node ) {
return node . rightLinks . length > 1 || node . leftLinks . length > 1 ;
}
} , {
key : 'mergeNodes' ,
value : function mergeNodes ( nodes ) {
var newNode = _Node2 . default . merge ( nodes ) ;
newNode . id = this . nodes . length ;
this . nodes . push ( newNode ) ;
nodes . forEach ( function ( n ) {
n . merged = true ;
} ) ;
newNode . rightLinks = ( 0 , _lodash . chain ) ( nodes ) . flatMap ( function ( n ) {
return n . rightLinks ;
} ) . groupBy ( function ( l ) {
return l . target . id ;
} ) . mapValues ( function ( links ) {
var target = links [ 0 ] . target ;
target . leftLinks = target . leftLinks . filter ( function ( l ) {
return ! l . source . merged ;
} ) ;
var link = new _Link2 . default ( newNode , links [ 0 ] . target , ( 0 , _lodash . sum ) ( links . map ( function ( l ) {
return l . freq ;
} ) ) ) ;
target . leftLinks . push ( link ) ;
return link ;
} ) . values ( ) . value ( ) ;
this . addLinks ( newNode . rightLinks ) ;
newNode . leftLinks = ( 0 , _lodash . chain ) ( nodes ) . flatMap ( function ( n ) {
return n . leftLinks ;
} ) . groupBy ( function ( l ) {
return l . source . id ;
} ) . mapValues ( function ( links ) {
var source = links [ 0 ] . source ;
source . rightLinks = source . rightLinks . filter ( function ( l ) {
return ! l . target . merged ;
} ) ;
var link = new _Link2 . default ( links [ 0 ] . source , newNode , ( 0 , _lodash . sum ) ( links . map ( function ( l ) {
return l . freq ;
} ) ) ) ;
source . rightLinks . push ( link ) ;
return link ;
} ) . values ( ) . value ( ) ;
this . addLinks ( newNode . leftLinks ) ;
return newNode ;
}
} ] ) ;
return GraphBundler ;
} ( ) ;
exports . default = GraphBundler ;
/***/
} ) ,
/* 50 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _RenderedGraph = _ _webpack _require _ _ ( 51 ) ;
var _RenderedGraph2 = _interopRequireDefault ( _RenderedGraph ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var RawGraph = function ( ) {
function RawGraph ( minSupport , maxSupport ) {
_classCallCheck ( this , RawGraph ) ;
this . nodes = [ ] ;
this . linkadj = [ ] ;
this . minSupport = minSupport ;
this . maxSupport = maxSupport ;
this . totalNodeCnt = 0 ;
}
_createClass ( RawGraph , [ {
key : 'clear' ,
value : function clear ( ) {
this . nodes = [ ] ;
this . linkadj = [ ] ;
return this ;
}
} , {
key : 'toRenderedGraph' ,
value : function toRenderedGraph ( ) {
return new _RenderedGraph2 . default ( this ) ;
}
} ] ) ;
return RawGraph ;
} ( ) ;
exports . default = RawGraph ;
/***/
} ) ,
/* 51 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
var _GraphBundler = _ _webpack _require _ _ ( 49 ) ;
var _GraphBundler2 = _interopRequireDefault ( _GraphBundler ) ;
var _Link = _ _webpack _require _ _ ( 26 ) ;
var _Link2 = _interopRequireDefault ( _Link ) ;
var _Node = _ _webpack _require _ _ ( 27 ) ;
var _Node2 = _interopRequireDefault ( _Node ) ;
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var RenderedGraph = function ( ) {
function RenderedGraph ( rawGraph ) {
console . log ( arguments )
var _ref = arguments . length > 1 && arguments [ 1 ] !== undefined ? arguments [ 1 ] : { } ,
_ref$bundle = _ref . bundle ,
bundle = _ref$bundle === undefined ? true : _ref$bundle ,
_ref$highFrequencyOnT = _ref . highFrequencyOnTop ,
highFrequencyOnTop = _ref$highFrequencyOnT === undefined ? true : _ref$highFrequencyOnT ;
_classCallCheck ( this , RenderedGraph ) ;
this . options = { bundle : bundle , highFrequencyOnTop : highFrequencyOnTop } ;
this . minSupport = rawGraph . minSupport ;
this . maxSupport = rawGraph . maxSupport ;
var nodes = rawGraph . nodes . map ( function ( n ) {
return new _Node2 . default ( n ) ;
} ) ;
var links = [ ] ;
Object . keys ( rawGraph . linkadj ) . forEach ( function ( l ) {
var leftNode = nodes [ l ] ;
var rights = rawGraph . linkadj [ l ] ;
Object . keys ( rights ) . forEach ( function ( r ) {
var rightNode = nodes [ r ] ;
var link = new _Link2 . default ( leftNode , rightNode , rights [ r ] ) ;
links . push ( link ) ;
leftNode . rightLinks . push ( link ) ;
rightNode . leftLinks . push ( link ) ;
} ) ;
} ) ;
this . assignNodeIds ( nodes ) ;
console . log ( bundle )
if ( bundle ) {
var bundled = new _GraphBundler2 . default ( nodes , links ) . bundle ( ) ;
console . log ( bundled )
this . nodes = bundled . nodes ;
this . links = bundled . links ;
this . assignNodeIds ( this . nodes ) ;
} else {
this . nodes = nodes ;
this . links = links ;
}
this . linkLookup = ( 0 , _lodash . keyBy ) ( this . links , function ( l ) {
return l . getKey ( ) ;
} ) ;
if ( highFrequencyOnTop ) {
this . nodes . forEach ( function ( n ) {
n . rightLinks . sort ( function ( a , b ) {
return b . freq - a . freq ;
} ) ;
n . leftLinks . sort ( function ( a , b ) {
return b . freq - a . freq ;
} ) ;
} ) ;
}
var frequencies = this . nodes . map ( function ( n ) {
return n . data . freq ;
} ) ;
this . freqRange = [ ( 0 , _lodash . min ) ( frequencies ) , ( 0 , _lodash . max ) ( frequencies ) ] ;
this . globalFreqRange = this . freqRange ;
var onlyBridgeConstraints = this . links . filter ( function ( link ) {
return link . isTheOnlyBridge ( ) ;
} ) . map ( function ( link ) {
return link . toOnlyBridgeConstraint ( ) ;
} ) ;
this . baseConstraints = onlyBridgeConstraints . concat ( this . getAlignmentConstraints ( ) ) ;
}
_createClass ( RenderedGraph , [ {
key : 'updateNodeSize' ,
value : function updateNodeSize ( sizeFn ) {
this . nodes . forEach ( function ( node ) {
var _sizeFn = sizeFn ( node ) ,
width = _sizeFn . width ,
height = _sizeFn . height ;
node . width = width ;
node . height = height ;
} ) ;
return this ;
}
} , {
key : 'assignNodeIds' ,
value : function assignNodeIds ( nodes ) {
var startIndex = arguments . length > 1 && arguments [ 1 ] !== undefined ? arguments [ 1 ] : 0 ;
nodes . forEach ( function ( n , i ) {
n . id = i + startIndex ;
} ) ;
return this ;
}
} , {
key : 'getAlignmentConstraints' ,
value : function getAlignmentConstraints ( ) {
var alignmentConstraints = [ ] ;
if ( this . nodes . length > 0 ) {
var visitedNodes = this . nodes . map ( function ( ) {
return false ;
} ) ;
var queue = [ this . nodes [ 0 ] ] ;
while ( queue . length > 0 ) {
var node = queue . shift ( ) ;
var nodeIndex = node . id ;
if ( visitedNodes [ nodeIndex ] ) continue ;
visitedNodes [ nodeIndex ] = true ;
var constraints = node . computeRightConstraints ( ) ;
if ( constraints ) {
alignmentConstraints . push ( constraints ) ;
}
var rNodes = node . getRightNodes ( ) ;
if ( rNodes . length > 0 ) {
queue = queue . concat ( rNodes ) ;
}
}
for ( var i = 0 ; i < this . nodes . length ; i ++ ) {
visitedNodes [ i ] = false ;
}
queue = [ this . nodes [ 0 ] ] ;
while ( queue . length > 0 ) {
var _node = queue . shift ( ) ;
var _nodeIndex = _node . id ;
if ( visitedNodes [ _nodeIndex ] ) continue ;
visitedNodes [ _nodeIndex ] = true ;
var _constraints = _node . computeLeftConstraints ( ) ;
if ( _constraints ) {
alignmentConstraints . push ( _constraints ) ;
}
var lNodes = _node . getLeftNodes ( ) ;
if ( lNodes . length > 0 ) {
queue = queue . concat ( lNodes ) ;
}
}
}
return alignmentConstraints ;
}
} , {
key : 'getLinkConstraints' ,
value : function getLinkConstraints ( ) {
return this . links . map ( function ( l ) {
return l . toConstraint ( ) ;
} ) ;
}
} , {
key : 'getConstraints' ,
value : function getConstraints ( ) {
var constraints = this . baseConstraints . concat ( this . links . map ( function ( l ) {
return l . toConstraint ( ) ;
} ) ) ;
return this . options . highFrequencyOnTop ? constraints . concat ( ( 0 , _lodash . flatMap ) ( this . nodes , function ( n ) {
return n . computeOrderConstraints ( ) ;
} ) ) : constraints ;
}
} , {
key : 'toGroupConstraint' ,
value : function toGroupConstraint ( ) {
return {
leaves : this . nodes . map ( function ( n ) {
return n . id ;
} )
} ;
}
} ] ) ;
return RenderedGraph ;
} ( ) ;
exports . default = RenderedGraph ;
/***/
} ) ,
/* 52 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _lodash = _ _webpack _require _ _ ( 5 ) ;
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var TokenizedDataset = function ( ) {
function TokenizedDataset ( ) {
var _this = this ;
var entries = arguments . length > 0 && arguments [ 0 ] !== undefined ? arguments [ 0 ] : [ ] ;
_classCallCheck ( this , TokenizedDataset ) ;
this . vocabularies = { } ;
this . itemset = [ ] ;
this . entries = entries . map ( function ( _ref ) {
var id = _ref . id ,
count = _ref . count ,
tokens = _ref . tokens ,
rawText = _ref . rawText ;
return {
id : id ,
count : count ,
tokens : tokens . map ( function ( t ) {
return _this . encode ( t ) ;
} ) ,
rawText : rawText ,
seqIndices : [ ]
} ;
} ) ;
}
_createClass ( TokenizedDataset , [ {
key : 'hasToken' ,
value : function hasToken ( token ) {
return this . vocabularies . hasOwnProperty ( token ) ;
}
} , {
key : 'hasCode' ,
value : function hasCode ( code ) {
return code >= 0 && code < this . itemset . length ;
}
} , {
key : 'getCode' ,
value : function getCode ( token ) {
return this . vocabularies [ token ] ;
}
} , {
key : 'encode' ,
value : function encode ( token ) {
if ( this . vocabularies . hasOwnProperty ( token ) ) {
return this . vocabularies [ token ] ;
}
var code = this . itemset . length ;
this . itemset . push ( token ) ;
this . vocabularies [ token ] = code ;
return code ;
}
} , {
key : 'decode' ,
value : function decode ( code ) {
return this . itemset [ code ] ;
}
} , {
key : 'encodeTermWeights' ,
value : function encodeTermWeights ( ) {
var _this2 = this ;
var termWeights = arguments . length > 0 && arguments [ 0 ] !== undefined ? arguments [ 0 ] : { } ;
return Object . keys ( termWeights ) . filter ( function ( key ) {
return _this2 . hasToken ( key ) ;
} ) . reduce ( function ( acc , key ) {
acc [ _this2 . getCode ( key ) ] = termWeights [ key ] ;
return acc ;
} , { } ) ;
}
} , {
key : 'computeSize' ,
value : function computeSize ( ) {
return ( 0 , _lodash . sum ) ( this . entries . map ( function ( e ) {
return e . count ;
} ) ) ;
}
} ] ) ;
return TokenizedDataset ;
} ( ) ;
exports . default = TokenizedDataset ;
/***/
} ) ,
/* 53 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
var _createClass = function ( ) {
function defineProperties ( target , props ) {
for ( var i = 0 ; i < props . length ; i ++ ) {
var descriptor = props [ i ] ;
descriptor . enumerable = descriptor . enumerable || false ;
descriptor . configurable = true ;
if ( "value" in descriptor ) descriptor . writable = true ;
Object . defineProperty ( target , descriptor . key , descriptor ) ;
}
}
return function ( Constructor , protoProps , staticProps ) { if ( protoProps ) defineProperties ( Constructor . prototype , protoProps ) ; if ( staticProps ) defineProperties ( Constructor , staticProps ) ; return Constructor ; } ;
} ( ) ;
var _d = _ _webpack _require _ _ ( 44 ) ;
var d3 = _interopRequireWildcard ( _d ) ;
var _cola = _ _webpack _require _ _ ( 138 ) ;
function _interopRequireWildcard ( obj ) {
if ( obj && obj . _ _esModule ) { return obj ; } else {
var newObj = { } ;
if ( obj != null ) { for ( var key in obj ) { if ( Object . prototype . hasOwnProperty . call ( obj , key ) ) newObj [ key ] = obj [ key ] ; } }
newObj . default = obj ;
return newObj ;
}
}
function _classCallCheck ( instance , Constructor ) { if ( ! ( instance instanceof Constructor ) ) { throw new TypeError ( "Cannot call a class as a function" ) ; } }
var Layout = function ( ) {
function Layout ( ) {
var _this = this ;
_classCallCheck ( this , Layout ) ;
this . isRunning = false ;
this . simulation = ( 0 , _cola . d3adaptor ) ( d3 ) . flowLayout ( 'x' , 5 ) . avoidOverlaps ( true )
// .symmetricDiffLinkLengths(5)
. jaccardLinkLengths ( 10 ) . linkDistance ( 5 ) ;
this . dispatcher = d3 . dispatch ( 'start' , 'tick' , 'end' ) ;
this . simulation . on ( 'start.default' , function ( ) {
_this . isRunning = true ;
_this . dispatcher . call ( 'start' , _this ) ;
} ) ;
this . simulation . on ( 'tick.default' , function ( ) {
_this . dispatcher . call ( 'tick' , _this ) ;
} ) ;
this . simulation . on ( 'end.default' , function ( ) {
if ( _this . isRunning ) {
_this . isRunning = false ;
_this . dispatcher . call ( 'end' , _this ) ;
}
} ) ;
}
_createClass ( Layout , [ {
key : 'on' ,
value : function on ( ) {
var _dispatcher ;
( _dispatcher = this . dispatcher ) . on . apply ( _dispatcher , arguments ) ;
return this ;
}
} , {
key : 'setGraph' ,
value : function setGraph ( graph ) {
this . simulation . nodes ( graph . nodes ) . links ( graph . links ) . constraints ( graph . getConstraints ( ) ) ;
return this ;
}
} , {
key : 'start' ,
value : function start ( ) {
this . simulation . start ( 10 , 10 , 10 ) ;
return this ;
}
} , {
key : 'stop' ,
value : function stop ( ) {
this . simulation . stop ( ) ;
return this ;
}
} , {
key : 'destroy' ,
value : function destroy ( ) {
this . dispatcher . on ( 'start' , null ) ;
this . dispatcher . on ( 'tick' , null ) ;
this . dispatcher . on ( 'end' , null ) ;
this . simulation . on ( 'start' , null ) ;
this . simulation . on ( 'tick' , null ) ;
this . simulation . on ( 'end' , null ) ;
return this ;
}
} ] ) ;
return Layout ;
} ( ) ;
exports . default = Layout ;
/***/
} ) ,
/* 54 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
exports . diagonal = diagonal ;
exports . line = line ;
function diagonal ( x1 , y1 , x2 , y2 ) {
return 'M' + x1 + ',' + y1 + 'C' + ( x1 + x2 ) / 2 + ',' + y1 + ' ' + ( x1 + x2 ) / 2 + ',' + y2 + ' ' + x2 + ',' + y2 ;
}
function line ( x1 , y1 , x2 , y2 ) {
return 'M ' + x1 + ',' + y1 + ' L ' + x2 + ',' + y2 ;
}
/***/
} ) ,
/* 55 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ = _ _webpack _require _ _ ( 10 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 9 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ = _ _webpack _require _ _ ( 28 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = cubehelix ;
/* unused harmony export Cubehelix */
var A = - 0.14861 ,
B = + 1.78277 ,
C = - 0.29227 ,
D = - 0.90649 ,
E = + 1.97294 ,
ED = E * D ,
EB = E * B ,
BC _DA = B * C - D * A ;
function cubehelixConvert ( o ) {
if ( o instanceof Cubehelix ) return new Cubehelix ( o . h , o . s , o . l , o . opacity ) ;
if ( ! ( o instanceof _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* Rgb */ ] ) ) o = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "c" /* rgbConvert */ ] ) ( o ) ;
var r = o . r / 255 ,
g = o . g / 255 ,
b = o . b / 255 ,
l = ( BC _DA * b + ED * r - EB * g ) / ( BC _DA + ED - EB ) ,
bl = b - l ,
k = ( E * ( g - l ) - C * bl ) / D ,
s = Math . sqrt ( k * k + bl * bl ) / ( E * l * ( 1 - l ) ) , // NaN if l=0 or l=1
h = s ? Math . atan2 ( k , bl ) * _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ [ "a" /* rad2deg */ ] - 120 : NaN ;
return new Cubehelix ( h < 0 ? h + 360 : h , s , l , o . opacity ) ;
}
function cubehelix ( h , s , l , opacity ) {
return arguments . length === 1 ? cubehelixConvert ( h ) : new Cubehelix ( h , s , l , opacity == null ? 1 : opacity ) ;
}
function Cubehelix ( h , s , l , opacity ) {
this . h = + h ;
this . s = + s ;
this . l = + l ;
this . opacity = + opacity ;
}
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Cubehelix , cubehelix , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "b" /* extend */ ] ) ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "d" /* Color */ ] , {
brighter : function ( k ) {
k = k == null ? _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "e" /* brighter */ ] : Math . pow ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "e" /* brighter */ ] , k ) ;
return new Cubehelix ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
darker : function ( k ) {
k = k == null ? _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "f" /* darker */ ] : Math . pow ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "f" /* darker */ ] , k ) ;
return new Cubehelix ( this . h , this . s , this . l * k , this . opacity ) ;
} ,
rgb : function ( ) {
var h = isNaN ( this . h ) ? 0 : ( this . h + 120 ) * _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ [ "b" /* deg2rad */ ] ,
l = + this . l ,
a = isNaN ( this . s ) ? 0 : this . s * l * ( 1 - l ) ,
cosh = Math . cos ( h ) ,
sinh = Math . sin ( h ) ;
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* Rgb */ ] (
255 * ( l + a * ( A * cosh + B * sinh ) ) ,
255 * ( l + a * ( C * cosh + D * sinh ) ) ,
255 * ( l + a * ( E * cosh ) ) ,
this . opacity
) ;
}
} ) ) ;
/***/
} ) ,
/* 56 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ = _ _webpack _require _ _ ( 10 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 9 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ = _ _webpack _require _ _ ( 28 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = lab ;
/* unused harmony export Lab */
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = hcl ;
/* unused harmony export Hcl */
var Kn = 18 ,
Xn = 0.950470 , // D65 standard referent
Yn = 1 ,
Zn = 1.088830 ,
t0 = 4 / 29 ,
t1 = 6 / 29 ,
t2 = 3 * t1 * t1 ,
t3 = t1 * t1 * t1 ;
function labConvert ( o ) {
if ( o instanceof Lab ) return new Lab ( o . l , o . a , o . b , o . opacity ) ;
if ( o instanceof Hcl ) {
var h = o . h * _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ [ "b" /* deg2rad */ ] ;
return new Lab ( o . l , Math . cos ( h ) * o . c , Math . sin ( h ) * o . c , o . opacity ) ;
}
if ( ! ( o instanceof _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* Rgb */ ] ) ) o = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "c" /* rgbConvert */ ] ) ( o ) ;
var b = rgb2xyz ( o . r ) ,
a = rgb2xyz ( o . g ) ,
l = rgb2xyz ( o . b ) ,
x = xyz2lab ( ( 0.4124564 * b + 0.3575761 * a + 0.1804375 * l ) / Xn ) ,
y = xyz2lab ( ( 0.2126729 * b + 0.7151522 * a + 0.0721750 * l ) / Yn ) ,
z = xyz2lab ( ( 0.0193339 * b + 0.1191920 * a + 0.9503041 * l ) / Zn ) ;
return new Lab ( 116 * y - 16 , 500 * ( x - y ) , 200 * ( y - z ) , o . opacity ) ;
}
function lab ( l , a , b , opacity ) {
return arguments . length === 1 ? labConvert ( l ) : new Lab ( l , a , b , opacity == null ? 1 : opacity ) ;
}
function Lab ( l , a , b , opacity ) {
this . l = + l ;
this . a = + a ;
this . b = + b ;
this . opacity = + opacity ;
}
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Lab , lab , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "b" /* extend */ ] ) ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "d" /* Color */ ] , {
brighter : function ( k ) {
return new Lab ( this . l + Kn * ( k == null ? 1 : k ) , this . a , this . b , this . opacity ) ;
} ,
darker : function ( k ) {
return new Lab ( this . l - Kn * ( k == null ? 1 : k ) , this . a , this . b , this . opacity ) ;
} ,
rgb : function ( ) {
var y = ( this . l + 16 ) / 116 ,
x = isNaN ( this . a ) ? y : y + this . a / 500 ,
z = isNaN ( this . b ) ? y : y - this . b / 200 ;
y = Yn * lab2xyz ( y ) ;
x = Xn * lab2xyz ( x ) ;
z = Zn * lab2xyz ( z ) ;
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* Rgb */ ] (
xyz2rgb ( 3.2404542 * x - 1.5371385 * y - 0.4985314 * z ) , // D65 -> sRGB
xyz2rgb ( - 0.9692660 * x + 1.8760108 * y + 0.0415560 * z ) ,
xyz2rgb ( 0.0556434 * x - 0.2040259 * y + 1.0572252 * z ) ,
this . opacity
) ;
}
} ) ) ;
function xyz2lab ( t ) {
return t > t3 ? Math . pow ( t , 1 / 3 ) : t / t2 + t0 ;
}
function lab2xyz ( t ) {
return t > t1 ? t * t * t : t2 * ( t - t0 ) ;
}
function xyz2rgb ( x ) {
return 255 * ( x <= 0.0031308 ? 12.92 * x : 1.055 * Math . pow ( x , 1 / 2.4 ) - 0.055 ) ;
}
function rgb2xyz ( x ) {
return ( x /= 255 ) <= 0.04045 ? x / 12.92 : Math . pow ( ( x + 0.055 ) / 1.055 , 2.4 ) ;
}
function hclConvert ( o ) {
if ( o instanceof Hcl ) return new Hcl ( o . h , o . c , o . l , o . opacity ) ;
if ( ! ( o instanceof Lab ) ) o = labConvert ( o ) ;
var h = Math . atan2 ( o . b , o . a ) * _ _WEBPACK _IMPORTED _MODULE _2 _ _math _ _ [ "a" /* rad2deg */ ] ;
return new Hcl ( h < 0 ? h + 360 : h , Math . sqrt ( o . a * o . a + o . b * o . b ) , o . l , o . opacity ) ;
}
function hcl ( h , c , l , opacity ) {
return arguments . length === 1 ? hclConvert ( h ) : new Hcl ( h , c , l , opacity == null ? 1 : opacity ) ;
}
function Hcl ( h , c , l , opacity ) {
this . h = + h ;
this . c = + c ;
this . l = + l ;
this . opacity = + opacity ;
}
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "a" /* default */ ] ) ( Hcl , hcl , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _define _ _ [ "b" /* extend */ ] ) ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "d" /* Color */ ] , {
brighter : function ( k ) {
return new Hcl ( this . h , this . c , this . l + Kn * ( k == null ? 1 : k ) , this . opacity ) ;
} ,
darker : function ( k ) {
return new Hcl ( this . h , this . c , this . l - Kn * ( k == null ? 1 : k ) , this . opacity ) ;
} ,
rgb : function ( ) {
return labConvert ( this ) . rgb ( ) ;
}
} ) ) ;
/***/
} ) ,
/* 57 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
var noop = { value : function ( ) { } } ;
function dispatch ( ) {
for ( var i = 0 , n = arguments . length , _ = { } , t ; i < n ; ++ i ) {
if ( ! ( t = arguments [ i ] + "" ) || ( t in _ ) ) throw new Error ( "illegal type: " + t ) ;
_ [ t ] = [ ] ;
}
return new Dispatch ( _ ) ;
}
function Dispatch ( _ ) {
this . _ = _ ;
}
function parseTypenames ( typenames , types ) {
return typenames . trim ( ) . split ( /^|\s+/ ) . map ( function ( t ) {
var name = "" ,
i = t . indexOf ( "." ) ;
if ( i >= 0 ) name = t . slice ( i + 1 ) , t = t . slice ( 0 , i ) ;
if ( t && ! types . hasOwnProperty ( t ) ) throw new Error ( "unknown type: " + t ) ;
return { type : t , name : name } ;
} ) ;
}
Dispatch . prototype = dispatch . prototype = {
constructor : Dispatch ,
on : function ( typename , callback ) {
var _ = this . _ ,
T = parseTypenames ( typename + "" , _ ) ,
t ,
i = - 1 ,
n = T . length ;
// If no callback was specified, return the callback of the given type and name.
if ( arguments . length < 2 ) {
while ( ++ i < n )
if ( ( t = ( typename = T [ i ] ) . type ) && ( t = get ( _ [ t ] , typename . name ) ) ) return t ;
return ;
}
// If a type was specified, set the callback for the given type and name.
// Otherwise, if a null callback was specified, remove callbacks of the given name.
if ( callback != null && typeof callback !== "function" ) throw new Error ( "invalid callback: " + callback ) ;
while ( ++ i < n ) {
if ( t = ( typename = T [ i ] ) . type ) _ [ t ] = set ( _ [ t ] , typename . name , callback ) ;
else if ( callback == null )
for ( t in _ ) _ [ t ] = set ( _ [ t ] , typename . name , null ) ;
}
return this ;
} ,
copy : function ( ) {
var copy = { } ,
_ = this . _ ;
for ( var t in _ ) copy [ t ] = _ [ t ] . slice ( ) ;
return new Dispatch ( copy ) ;
} ,
call : function ( type , that ) {
if ( ( n = arguments . length - 2 ) > 0 )
for ( var args = new Array ( n ) , i = 0 , n , t ; i < n ; ++ i ) args [ i ] = arguments [ i + 2 ] ;
if ( ! this . _ . hasOwnProperty ( type ) ) throw new Error ( "unknown type: " + type ) ;
for ( t = this . _ [ type ] , i = 0 , n = t . length ; i < n ; ++ i ) t [ i ] . value . apply ( that , args ) ;
} ,
apply : function ( type , that , args ) {
if ( ! this . _ . hasOwnProperty ( type ) ) throw new Error ( "unknown type: " + type ) ;
for ( var t = this . _ [ type ] , i = 0 , n = t . length ; i < n ; ++ i ) t [ i ] . value . apply ( that , args ) ;
}
} ;
function get ( type , name ) {
for ( var i = 0 , n = type . length , c ; i < n ; ++ i ) {
if ( ( c = type [ i ] ) . name === name ) {
return c . value ;
}
}
}
function set ( type , name , callback ) {
for ( var i = 0 , n = type . length ; i < n ; ++ i ) {
if ( type [ i ] . name === name ) {
type [ i ] = noop , type = type . slice ( 0 , i ) . concat ( type . slice ( i + 1 ) ) ;
break ;
}
}
if ( callback != null ) type . push ( { name : name , value : callback } ) ;
return type ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = dispatch ;
/***/
} ) ,
/* 58 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _linear _ _ = _ _webpack _require _ _ ( 65 ) ;
/* unused harmony reexport easeLinear */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _quad _ _ = _ _webpack _require _ _ ( 67 ) ;
/* unused harmony reexport easeQuad */
/* unused harmony reexport easeQuadIn */
/* unused harmony reexport easeQuadOut */
/* unused harmony reexport easeQuadInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _cubic _ _ = _ _webpack _require _ _ ( 62 ) ;
/* unused harmony reexport easeCubic */
/* unused harmony reexport easeCubicIn */
/* unused harmony reexport easeCubicOut */
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _2 _ _src _cubic _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _src _poly _ _ = _ _webpack _require _ _ ( 66 ) ;
/* unused harmony reexport easePoly */
/* unused harmony reexport easePolyIn */
/* unused harmony reexport easePolyOut */
/* unused harmony reexport easePolyInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _4 _ _src _sin _ _ = _ _webpack _require _ _ ( 68 ) ;
/* unused harmony reexport easeSin */
/* unused harmony reexport easeSinIn */
/* unused harmony reexport easeSinOut */
/* unused harmony reexport easeSinInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _5 _ _src _exp _ _ = _ _webpack _require _ _ ( 64 ) ;
/* unused harmony reexport easeExp */
/* unused harmony reexport easeExpIn */
/* unused harmony reexport easeExpOut */
/* unused harmony reexport easeExpInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _6 _ _src _circle _ _ = _ _webpack _require _ _ ( 61 ) ;
/* unused harmony reexport easeCircle */
/* unused harmony reexport easeCircleIn */
/* unused harmony reexport easeCircleOut */
/* unused harmony reexport easeCircleInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _7 _ _src _bounce _ _ = _ _webpack _require _ _ ( 60 ) ;
/* unused harmony reexport easeBounce */
/* unused harmony reexport easeBounceIn */
/* unused harmony reexport easeBounceOut */
/* unused harmony reexport easeBounceInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _8 _ _src _back _ _ = _ _webpack _require _ _ ( 59 ) ;
/* unused harmony reexport easeBack */
/* unused harmony reexport easeBackIn */
/* unused harmony reexport easeBackOut */
/* unused harmony reexport easeBackInOut */
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _9 _ _src _elastic _ _ = _ _webpack _require _ _ ( 63 ) ;
/* unused harmony reexport easeElastic */
/* unused harmony reexport easeElasticIn */
/* unused harmony reexport easeElasticOut */
/* unused harmony reexport easeElasticInOut */
/***/
} ) ,
/* 59 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export backIn */
/* unused harmony export backOut */
/* unused harmony export backInOut */
var overshoot = 1.70158 ;
var backIn = ( function custom ( s ) {
s = + s ;
function backIn ( t ) {
return t * t * ( ( s + 1 ) * t - s ) ;
}
backIn . overshoot = custom ;
return backIn ;
} ) ( overshoot ) ;
var backOut = ( function custom ( s ) {
s = + s ;
function backOut ( t ) {
return -- t * t * ( ( s + 1 ) * t + s ) + 1 ;
}
backOut . overshoot = custom ;
return backOut ;
} ) ( overshoot ) ;
var backInOut = ( function custom ( s ) {
s = + s ;
function backInOut ( t ) {
return ( ( t *= 2 ) < 1 ? t * t * ( ( s + 1 ) * t - s ) : ( t -= 2 ) * t * ( ( s + 1 ) * t + s ) + 2 ) / 2 ;
}
backInOut . overshoot = custom ;
return backInOut ;
} ) ( overshoot ) ;
/***/
} ) ,
/* 60 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export bounceIn */
/* unused harmony export bounceOut */
/* unused harmony export bounceInOut */
var b1 = 4 / 11 ,
b2 = 6 / 11 ,
b3 = 8 / 11 ,
b4 = 3 / 4 ,
b5 = 9 / 11 ,
b6 = 10 / 11 ,
b7 = 15 / 16 ,
b8 = 21 / 22 ,
b9 = 63 / 64 ,
b0 = 1 / b1 / b1 ;
function bounceIn ( t ) {
return 1 - bounceOut ( 1 - t ) ;
}
function bounceOut ( t ) {
return ( t = + t ) < b1 ? b0 * t * t : t < b3 ? b0 * ( t -= b2 ) * t + b4 : t < b6 ? b0 * ( t -= b5 ) * t + b7 : b0 * ( t -= b8 ) * t + b9 ;
}
function bounceInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? 1 - bounceOut ( 1 - t ) : bounceOut ( t - 1 ) + 1 ) / 2 ;
}
/***/
} ) ,
/* 61 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export circleIn */
/* unused harmony export circleOut */
/* unused harmony export circleInOut */
function circleIn ( t ) {
return 1 - Math . sqrt ( 1 - t * t ) ;
}
function circleOut ( t ) {
return Math . sqrt ( 1 - -- t * t ) ;
}
function circleInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? 1 - Math . sqrt ( 1 - t * t ) : Math . sqrt ( 1 - ( t -= 2 ) * t ) + 1 ) / 2 ;
}
/***/
} ) ,
/* 62 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export cubicIn */
/* unused harmony export cubicOut */
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = cubicInOut ;
function cubicIn ( t ) {
return t * t * t ;
}
function cubicOut ( t ) {
return -- t * t * t + 1 ;
}
function cubicInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? t * t * t : ( t -= 2 ) * t * t + 2 ) / 2 ;
}
/***/
} ) ,
/* 63 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export elasticIn */
/* unused harmony export elasticOut */
/* unused harmony export elasticInOut */
var tau = 2 * Math . PI ,
amplitude = 1 ,
period = 0.3 ;
var elasticIn = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticIn ( t ) {
return a * Math . pow ( 2 , 10 * -- t ) * Math . sin ( ( s - t ) / p ) ;
}
elasticIn . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticIn . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticIn ;
} ) ( amplitude , period ) ;
var elasticOut = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticOut ( t ) {
return 1 - a * Math . pow ( 2 , - 10 * ( t = + t ) ) * Math . sin ( ( t + s ) / p ) ;
}
elasticOut . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticOut . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticOut ;
} ) ( amplitude , period ) ;
var elasticInOut = ( function custom ( a , p ) {
var s = Math . asin ( 1 / ( a = Math . max ( 1 , a ) ) ) * ( p /= tau ) ;
function elasticInOut ( t ) {
return ( ( t = t * 2 - 1 ) < 0 ?
a * Math . pow ( 2 , 10 * t ) * Math . sin ( ( s - t ) / p ) :
2 - a * Math . pow ( 2 , - 10 * t ) * Math . sin ( ( s + t ) / p ) ) / 2 ;
}
elasticInOut . amplitude = function ( a ) { return custom ( a , p * tau ) ; } ;
elasticInOut . period = function ( p ) { return custom ( a , p ) ; } ;
return elasticInOut ;
} ) ( amplitude , period ) ;
/***/
} ) ,
/* 64 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export expIn */
/* unused harmony export expOut */
/* unused harmony export expInOut */
function expIn ( t ) {
return Math . pow ( 2 , 10 * t - 10 ) ;
}
function expOut ( t ) {
return 1 - Math . pow ( 2 , - 10 * t ) ;
}
function expInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? Math . pow ( 2 , 10 * t - 10 ) : 2 - Math . pow ( 2 , 10 - 10 * t ) ) / 2 ;
}
/***/
} ) ,
/* 65 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export linear */
function linear ( t ) {
return + t ;
}
/***/
} ) ,
/* 66 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export polyIn */
/* unused harmony export polyOut */
/* unused harmony export polyInOut */
var exponent = 3 ;
var polyIn = ( function custom ( e ) {
e = + e ;
function polyIn ( t ) {
return Math . pow ( t , e ) ;
}
polyIn . exponent = custom ;
return polyIn ;
} ) ( exponent ) ;
var polyOut = ( function custom ( e ) {
e = + e ;
function polyOut ( t ) {
return 1 - Math . pow ( 1 - t , e ) ;
}
polyOut . exponent = custom ;
return polyOut ;
} ) ( exponent ) ;
var polyInOut = ( function custom ( e ) {
e = + e ;
function polyInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? Math . pow ( t , e ) : 2 - Math . pow ( 2 - t , e ) ) / 2 ;
}
polyInOut . exponent = custom ;
return polyInOut ;
} ) ( exponent ) ;
/***/
} ) ,
/* 67 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export quadIn */
/* unused harmony export quadOut */
/* unused harmony export quadInOut */
function quadIn ( t ) {
return t * t ;
}
function quadOut ( t ) {
return t * ( 2 - t ) ;
}
function quadInOut ( t ) {
return ( ( t *= 2 ) <= 1 ? t * t : -- t * ( 2 - t ) + 1 ) / 2 ;
}
/***/
} ) ,
/* 68 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony export sinIn */
/* unused harmony export sinOut */
/* unused harmony export sinInOut */
var pi = Math . PI ,
halfPi = pi / 2 ;
function sinIn ( t ) {
return 1 - Math . cos ( t * halfPi ) ;
}
function sinOut ( t ) {
return Math . sin ( t * halfPi ) ;
}
function sinInOut ( t ) {
return ( 1 - Math . cos ( pi * t ) ) / 2 ;
}
/***/
} ) ,
/* 69 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 6 ) ;
/* unused harmony export cubehelixLong */
function cubehelix ( hue ) {
return ( function cubehelixGamma ( y ) {
y = + y ;
function cubehelix ( start , end ) {
var h = hue ( ( start = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "b" /* cubehelix */ ] ) ( start ) ) . h , ( end = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "b" /* cubehelix */ ] ) ( end ) ) . h ) ,
s = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . s , end . s ) ,
l = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . l , end . l ) ,
opacity = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . s = s ( t ) ;
start . l = l ( Math . pow ( t , y ) ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
cubehelix . gamma = cubehelixGamma ;
return cubehelix ;
} ) ( 1 ) ;
}
/* unused harmony default export */
var _unused _webpack _default _export = cubehelix ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* hue */ ] ) ;
var cubehelixLong = cubehelix ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ;
/***/
} ) ,
/* 70 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 6 ) ;
/* unused harmony export hclLong */
function hcl ( hue ) {
return function ( start , end ) {
var h = hue ( ( start = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "c" /* hcl */ ] ) ( start ) ) . h , ( end = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "c" /* hcl */ ] ) ( end ) ) . h ) ,
c = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . c , end . c ) ,
l = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . l , end . l ) ,
opacity = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . c = c ( t ) ;
start . l = l ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
}
/* unused harmony default export */
var _unused _webpack _default _export = hcl ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* hue */ ] ) ;
var hclLong = hcl ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ;
/***/
} ) ,
/* 71 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 6 ) ;
/* unused harmony export hslLong */
function hsl ( hue ) {
return function ( start , end ) {
var h = hue ( ( start = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "e" /* hsl */ ] ) ( start ) ) . h , ( end = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "e" /* hsl */ ] ) ( end ) ) . h ) ,
s = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . s , end . s ) ,
l = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . l , end . l ) ,
opacity = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . opacity , end . opacity ) ;
return function ( t ) {
start . h = h ( t ) ;
start . s = s ( t ) ;
start . l = l ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
}
/* unused harmony default export */
var _unused _webpack _default _export = hsl ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "b" /* hue */ ] ) ;
var hslLong = hsl ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ;
/***/
} ) ,
/* 72 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ = _ _webpack _require _ _ ( 4 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ = _ _webpack _require _ _ ( 6 ) ;
/* unused harmony export default */
function lab ( start , end ) {
var l = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( ( start = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "d" /* lab */ ] ) ( start ) ) . l , ( end = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _color _ _ [ "d" /* lab */ ] ) ( end ) ) . l ) ,
a = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . a , end . a ) ,
b = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . b , end . b ) ,
opacity = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _color _ _ [ "a" /* default */ ] ) ( start . opacity , end . opacity ) ;
return function ( t ) {
start . l = l ( t ) ;
start . a = a ( t ) ;
start . b = b ( t ) ;
start . opacity = opacity ( t ) ;
return start + "" ;
} ;
}
/***/
} ) ,
/* 73 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony default export */
var _unused _webpack _default _export = function ( interpolator , n ) {
var samples = new Array ( n ) ;
for ( var i = 0 ; i < n ; ++ i ) samples [ i ] = interpolator ( i / ( n - 1 ) ) ;
return samples ;
} ;
/***/
} ) ,
/* 74 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* unused harmony default export */
var _unused _webpack _default _export = function ( a , b ) {
return a = + a , b -= a ,
function ( t ) {
return Math . round ( a + b * t ) ;
} ;
} ;
/***/
} ) ,
/* 75 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return identity ; } ) ;
var degrees = 180 / Math . PI ;
var identity = {
translateX : 0 ,
translateY : 0 ,
rotate : 0 ,
skewX : 0 ,
scaleX : 1 ,
scaleY : 1
} ;
/* harmony default export */
_ _webpack _exports _ _ [ "b" ] = function ( a , b , c , d , e , f ) {
var scaleX , scaleY , skewX ;
if ( scaleX = Math . sqrt ( a * a + b * b ) ) a /= scaleX , b /= scaleX ;
if ( skewX = a * c + b * d ) c -= a * skewX , d -= b * skewX ;
if ( scaleY = Math . sqrt ( c * c + d * d ) ) c /= scaleY , d /= scaleY , skewX /= scaleY ;
if ( a * d < b * c ) a = - a , b = - b , skewX = - skewX , scaleX = - scaleX ;
return {
translateX : e ,
translateY : f ,
rotate : Math . atan2 ( b , a ) * degrees ,
skewX : Math . atan ( skewX ) * degrees ,
scaleX : scaleX ,
scaleY : scaleY
} ;
} ;
/***/
} ) ,
/* 76 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ = _ _webpack _require _ _ ( 7 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _parse _ _ = _ _webpack _require _ _ ( 77 ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "a" , function ( ) { return interpolateTransformCss ; } ) ;
/* harmony export (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "b" , function ( ) { return interpolateTransformSvg ; } ) ;
function interpolateTransform ( parse , pxComma , pxParen , degParen ) {
function pop ( s ) {
return s . length ? s . pop ( ) + " " : "" ;
}
function translate ( xa , ya , xb , yb , s , q ) {
if ( xa !== xb || ya !== yb ) {
var i = s . push ( "translate(" , null , pxComma , null , pxParen ) ;
q . push ( { i : i - 4 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( xa , xb ) } , { i : i - 2 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( ya , yb ) } ) ;
} else if ( xb || yb ) {
s . push ( "translate(" + xb + pxComma + yb + pxParen ) ;
}
}
function rotate ( a , b , s , q ) {
if ( a !== b ) {
if ( a - b > 180 ) b += 360 ;
else if ( b - a > 180 ) a += 360 ; // shortest path
q . push ( { i : s . push ( pop ( s ) + "rotate(" , null , degParen ) - 2 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( a , b ) } ) ;
} else if ( b ) {
s . push ( pop ( s ) + "rotate(" + b + degParen ) ;
}
}
function skewX ( a , b , s , q ) {
if ( a !== b ) {
q . push ( { i : s . push ( pop ( s ) + "skewX(" , null , degParen ) - 2 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( a , b ) } ) ;
} else if ( b ) {
s . push ( pop ( s ) + "skewX(" + b + degParen ) ;
}
}
function scale ( xa , ya , xb , yb , s , q ) {
if ( xa !== xb || ya !== yb ) {
var i = s . push ( pop ( s ) + "scale(" , null , "," , null , ")" ) ;
q . push ( { i : i - 4 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( xa , xb ) } , { i : i - 2 , x : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _number _ _ [ "a" /* default */ ] ) ( ya , yb ) } ) ;
} else if ( xb !== 1 || yb !== 1 ) {
s . push ( pop ( s ) + "scale(" + xb + "," + yb + ")" ) ;
}
}
return function ( a , b ) {
var s = [ ] , // string constants and placeholders
q = [ ] ; // number interpolators
a = parse ( a ) , b = parse ( b ) ;
translate ( a . translateX , a . translateY , b . translateX , b . translateY , s , q ) ;
rotate ( a . rotate , b . rotate , s , q ) ;
skewX ( a . skewX , b . skewX , s , q ) ;
scale ( a . scaleX , a . scaleY , b . scaleX , b . scaleY , s , q ) ;
a = b = null ; // gc
return function ( t ) {
var i = - 1 ,
n = q . length ,
o ;
while ( ++ i < n ) s [ ( o = q [ i ] ) . i ] = o . x ( t ) ;
return s . join ( "" ) ;
} ;
} ;
}
var interpolateTransformCss = interpolateTransform ( _ _WEBPACK _IMPORTED _MODULE _1 _ _parse _ _ [ "a" /* parseCss */ ] , "px, " , "px)" , "deg)" ) ;
var interpolateTransformSvg = interpolateTransform ( _ _WEBPACK _IMPORTED _MODULE _1 _ _parse _ _ [ "b" /* parseSvg */ ] , ", " , ")" , ")" ) ;
/***/
} ) ,
/* 77 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ = _ _webpack _require _ _ ( 75 ) ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = parseCss ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "b" ] = parseSvg ;
var cssNode ,
cssRoot ,
cssView ,
svgNode ;
function parseCss ( value ) {
if ( value === "none" ) return _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ [ "a" /* identity */ ] ;
if ( ! cssNode ) cssNode = document . createElement ( "DIV" ) , cssRoot = document . documentElement , cssView = document . defaultView ;
cssNode . style . transform = value ;
value = cssView . getComputedStyle ( cssRoot . appendChild ( cssNode ) , null ) . getPropertyValue ( "transform" ) ;
cssRoot . removeChild ( cssNode ) ;
value = value . slice ( 7 , - 1 ) . split ( "," ) ;
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ [ "b" /* default */ ] ) ( + value [ 0 ] , + value [ 1 ] , + value [ 2 ] , + value [ 3 ] , + value [ 4 ] , + value [ 5 ] ) ;
}
function parseSvg ( value ) {
if ( value == null ) return _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ [ "a" /* identity */ ] ;
if ( ! svgNode ) svgNode = document . createElementNS ( "http://www.w3.org/2000/svg" , "g" ) ;
svgNode . setAttribute ( "transform" , value ) ;
if ( ! ( value = svgNode . transform . baseVal . consolidate ( ) ) ) return _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ [ "a" /* identity */ ] ;
value = value . matrix ;
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _decompose _ _ [ "b" /* default */ ] ) ( value . a , value . b , value . c , value . d , value . e , value . f ) ;
}
/***/
} ) ,
/* 78 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
var rho = Math . SQRT2 ,
rho2 = 2 ,
rho4 = 4 ,
epsilon2 = 1e-12 ;
function cosh ( x ) {
return ( ( x = Math . exp ( x ) ) + 1 / x ) / 2 ;
}
function sinh ( x ) {
return ( ( x = Math . exp ( x ) ) - 1 / x ) / 2 ;
}
function tanh ( x ) {
return ( ( x = Math . exp ( 2 * x ) ) - 1 ) / ( x + 1 ) ;
}
// p0 = [ux0, uy0, w0]
// p1 = [ux1, uy1, w1]
/* unused harmony default export */
var _unused _webpack _default _export = function ( p0 , p1 ) {
var ux0 = p0 [ 0 ] ,
uy0 = p0 [ 1 ] ,
w0 = p0 [ 2 ] ,
ux1 = p1 [ 0 ] ,
uy1 = p1 [ 1 ] ,
w1 = p1 [ 2 ] ,
dx = ux1 - ux0 ,
dy = uy1 - uy0 ,
d2 = dx * dx + dy * dy ,
i ,
S ;
// Special case for u0 ≅ u1.
if ( d2 < epsilon2 ) {
S = Math . log ( w1 / w0 ) / rho ;
i = function ( t ) {
return [
ux0 + t * dx ,
uy0 + t * dy ,
w0 * Math . exp ( rho * t * S )
] ;
}
}
// General case.
else {
var d1 = Math . sqrt ( d2 ) ,
b0 = ( w1 * w1 - w0 * w0 + rho4 * d2 ) / ( 2 * w0 * rho2 * d1 ) ,
b1 = ( w1 * w1 - w0 * w0 - rho4 * d2 ) / ( 2 * w1 * rho2 * d1 ) ,
r0 = Math . log ( Math . sqrt ( b0 * b0 + 1 ) - b0 ) ,
r1 = Math . log ( Math . sqrt ( b1 * b1 + 1 ) - b1 ) ;
S = ( r1 - r0 ) / rho ;
i = function ( t ) {
var s = t * S ,
coshr0 = cosh ( r0 ) ,
u = w0 / ( rho2 * d1 ) * ( coshr0 * tanh ( rho * s + r0 ) - sinh ( r0 ) ) ;
return [
ux0 + u * dx ,
uy0 + u * dy ,
w0 * coshr0 / cosh ( rho * s + r0 )
] ;
}
}
i . duration = S * 1000 ;
return i ;
} ;
/***/
} ) ,
/* 79 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( x ) {
return function ( ) {
return x ;
} ;
} ;
/***/
} ) ,
/* 80 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony export (immutable) */
_ _webpack _exports _ _ [ "a" ] = local ;
var nextId = 0 ;
function local ( ) {
return new Local ;
}
function Local ( ) {
this . _ = "@" + ( ++ nextId ) . toString ( 36 ) ;
}
Local . prototype = local . prototype = {
constructor : Local ,
get : function ( node ) {
var id = this . _ ;
while ( ! ( id in node ) )
if ( ! ( node = node . parentNode ) ) return ;
return node [ id ] ;
} ,
set : function ( node , value ) {
return node [ this . _ ] = value ;
} ,
remove : function ( node ) {
return this . _ in node && delete node [ this . _ ] ;
} ,
toString : function ( ) {
return this . _ ;
}
} ;
/***/
} ) ,
/* 81 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ = _ _webpack _require _ _ ( 20 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ = _ _webpack _require _ _ ( 17 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node ) {
var event = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ [ "a" /* default */ ] ) ( ) ;
if ( event . changedTouches ) event = event . changedTouches [ 0 ] ;
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ [ "a" /* default */ ] ) ( node , event ) ;
} ;
/***/
} ) ,
/* 82 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( selector ) {
return typeof selector === "string" ?
new _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "b" /* Selection */ ] ( [
[ document . querySelector ( selector ) ]
] , [ document . documentElement ] ) :
new _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "b" /* Selection */ ] ( [
[ selector ]
] , _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "c" /* root */ ] ) ;
} ;
/***/
} ) ,
/* 83 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( selector ) {
return typeof selector === "string" ?
new _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "b" /* Selection */ ] ( [ document . querySelectorAll ( selector ) ] , [ document . documentElement ] ) :
new _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "b" /* Selection */ ] ( [ selector == null ? [ ] : selector ] , _ _WEBPACK _IMPORTED _MODULE _0 _ _selection _index _ _ [ "c" /* root */ ] ) ;
} ;
/***/
} ) ,
/* 84 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _creator _ _ = _ _webpack _require _ _ ( 14 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name ) {
var create = typeof name === "function" ? name : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _creator _ _ [ "a" /* default */ ] ) ( name ) ;
return this . select ( function ( ) {
return this . appendChild ( create . apply ( this , arguments ) ) ;
} ) ;
} ;
/***/
} ) ,
/* 85 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _namespace _ _ = _ _webpack _require _ _ ( 15 ) ;
function attrRemove ( name ) {
return function ( ) {
this . removeAttribute ( name ) ;
} ;
}
function attrRemoveNS ( fullname ) {
return function ( ) {
this . removeAttributeNS ( fullname . space , fullname . local ) ;
} ;
}
function attrConstant ( name , value ) {
return function ( ) {
this . setAttribute ( name , value ) ;
} ;
}
function attrConstantNS ( fullname , value ) {
return function ( ) {
this . setAttributeNS ( fullname . space , fullname . local , value ) ;
} ;
}
function attrFunction ( name , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . removeAttribute ( name ) ;
else this . setAttribute ( name , v ) ;
} ;
}
function attrFunctionNS ( fullname , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . removeAttributeNS ( fullname . space , fullname . local ) ;
else this . setAttributeNS ( fullname . space , fullname . local , v ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
var fullname = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _namespace _ _ [ "a" /* default */ ] ) ( name ) ;
if ( arguments . length < 2 ) {
var node = this . node ( ) ;
return fullname . local ?
node . getAttributeNS ( fullname . space , fullname . local ) :
node . getAttribute ( fullname ) ;
}
return this . each ( ( value == null ?
( fullname . local ? attrRemoveNS : attrRemove ) : ( typeof value === "function" ?
( fullname . local ? attrFunctionNS : attrFunction ) :
( fullname . local ? attrConstantNS : attrConstant ) ) ) ( fullname , value ) ) ;
} ;
/***/
} ) ,
/* 86 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
var callback = arguments [ 0 ] ;
arguments [ 0 ] = this ;
callback . apply ( null , arguments ) ;
return this ;
} ;
/***/
} ) ,
/* 87 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function classArray ( string ) {
return string . trim ( ) . split ( /^|\s+/ ) ;
}
function classList ( node ) {
return node . classList || new ClassList ( node ) ;
}
function ClassList ( node ) {
this . _node = node ;
this . _names = classArray ( node . getAttribute ( "class" ) || "" ) ;
}
ClassList . prototype = {
add : function ( name ) {
var i = this . _names . indexOf ( name ) ;
if ( i < 0 ) {
this . _names . push ( name ) ;
this . _node . setAttribute ( "class" , this . _names . join ( " " ) ) ;
}
} ,
remove : function ( name ) {
var i = this . _names . indexOf ( name ) ;
if ( i >= 0 ) {
this . _names . splice ( i , 1 ) ;
this . _node . setAttribute ( "class" , this . _names . join ( " " ) ) ;
}
} ,
contains : function ( name ) {
return this . _names . indexOf ( name ) >= 0 ;
}
} ;
function classedAdd ( node , names ) {
var list = classList ( node ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n ) list . add ( names [ i ] ) ;
}
function classedRemove ( node , names ) {
var list = classList ( node ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n ) list . remove ( names [ i ] ) ;
}
function classedTrue ( names ) {
return function ( ) {
classedAdd ( this , names ) ;
} ;
}
function classedFalse ( names ) {
return function ( ) {
classedRemove ( this , names ) ;
} ;
}
function classedFunction ( names , value ) {
return function ( ) {
( value . apply ( this , arguments ) ? classedAdd : classedRemove ) ( this , names ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
var names = classArray ( name + "" ) ;
if ( arguments . length < 2 ) {
var list = classList ( this . node ( ) ) ,
i = - 1 ,
n = names . length ;
while ( ++ i < n )
if ( ! list . contains ( names [ i ] ) ) return false ;
return true ;
}
return this . each ( ( typeof value === "function" ?
classedFunction : value ?
classedTrue :
classedFalse ) ( names , value ) ) ;
} ;
/***/
} ) ,
/* 88 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _enter _ _ = _ _webpack _require _ _ ( 38 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _constant _ _ = _ _webpack _require _ _ ( 79 ) ;
var keyPrefix = "$" ; // Protect against keys like “__proto__”.
function bindIndex ( parent , group , enter , update , exit , data ) {
var i = 0 ,
node ,
groupLength = group . length ,
dataLength = data . length ;
// Put any non-null nodes that fit into update.
// Put any null nodes into enter.
// Put any remaining data into enter.
for ( ; i < dataLength ; ++ i ) {
if ( node = group [ i ] ) {
node . _ _data _ _ = data [ i ] ;
update [ i ] = node ;
} else {
enter [ i ] = new _ _WEBPACK _IMPORTED _MODULE _1 _ _enter _ _ [ "b" /* EnterNode */ ] ( parent , data [ i ] ) ;
}
}
// Put any non-null nodes that don’
for ( ; i < groupLength ; ++ i ) {
if ( node = group [ i ] ) {
exit [ i ] = node ;
}
}
}
function bindKey ( parent , group , enter , update , exit , data , key ) {
var i ,
node ,
nodeByKeyValue = { } ,
groupLength = group . length ,
dataLength = data . length ,
keyValues = new Array ( groupLength ) ,
keyValue ;
// Compute the key for each node.
// If multiple nodes have the same key, the duplicates are added to exit.
for ( i = 0 ; i < groupLength ; ++ i ) {
if ( node = group [ i ] ) {
keyValues [ i ] = keyValue = keyPrefix + key . call ( node , node . _ _data _ _ , i , group ) ;
if ( keyValue in nodeByKeyValue ) {
exit [ i ] = node ;
} else {
nodeByKeyValue [ keyValue ] = node ;
}
}
}
// Compute the key for each datum.
// If there a node associated with this key, join and add it to update.
// If there is not (or the key is a duplicate), add it to enter.
for ( i = 0 ; i < dataLength ; ++ i ) {
keyValue = keyPrefix + key . call ( parent , data [ i ] , i , data ) ;
if ( node = nodeByKeyValue [ keyValue ] ) {
update [ i ] = node ;
node . _ _data _ _ = data [ i ] ;
nodeByKeyValue [ keyValue ] = null ;
} else {
enter [ i ] = new _ _WEBPACK _IMPORTED _MODULE _1 _ _enter _ _ [ "b" /* EnterNode */ ] ( parent , data [ i ] ) ;
}
}
// Add any remaining nodes that were not bound to data to exit.
for ( i = 0 ; i < groupLength ; ++ i ) {
if ( ( node = group [ i ] ) && ( nodeByKeyValue [ keyValues [ i ] ] === node ) ) {
exit [ i ] = node ;
}
}
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value , key ) {
if ( ! value ) {
data = new Array ( this . size ( ) ) , j = - 1 ;
this . each ( function ( d ) { data [ ++ j ] = d ; } ) ;
return data ;
}
var bind = key ? bindKey : bindIndex ,
parents = this . _parents ,
groups = this . _groups ;
if ( typeof value !== "function" ) value = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _constant _ _ [ "a" /* default */ ] ) ( value ) ;
for ( var m = groups . length , update = new Array ( m ) , enter = new Array ( m ) , exit = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
var parent = parents [ j ] ,
group = groups [ j ] ,
groupLength = group . length ,
data = value . call ( parent , parent && parent . _ _data _ _ , j , parents ) ,
dataLength = data . length ,
enterGroup = enter [ j ] = new Array ( dataLength ) ,
updateGroup = update [ j ] = new Array ( dataLength ) ,
exitGroup = exit [ j ] = new Array ( groupLength ) ;
bind ( parent , group , enterGroup , updateGroup , exitGroup , data , key ) ;
// Now connect the enter nodes to their following update node, such that
// appendChild can insert the materialized enter node before this node,
// rather than at the end of the parent node.
for ( var i0 = 0 , i1 = 0 , previous , next ; i0 < dataLength ; ++ i0 ) {
if ( previous = enterGroup [ i0 ] ) {
if ( i0 >= i1 ) i1 = i0 + 1 ;
while ( ! ( next = updateGroup [ i1 ] ) && ++ i1 < dataLength ) ;
previous . _next = next || null ;
}
}
}
update = new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( update , parents ) ;
update . _enter = enter ;
update . _exit = exit ;
return update ;
} ;
/***/
} ) ,
/* 89 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
return arguments . length ?
this . property ( "__data__" , value ) :
this . node ( ) . _ _data _ _ ;
} ;
/***/
} ) ,
/* 90 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _window _ _ = _ _webpack _require _ _ ( 21 ) ;
function dispatchEvent ( node , type , params ) {
var window = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _window _ _ [ "a" /* default */ ] ) ( node ) ,
event = window . CustomEvent ;
if ( event ) {
event = new event ( type , params ) ;
} else {
event = window . document . createEvent ( "Event" ) ;
if ( params ) event . initEvent ( type , params . bubbles , params . cancelable ) , event . detail = params . detail ;
else event . initEvent ( type , false , false ) ;
}
node . dispatchEvent ( event ) ;
}
function dispatchConstant ( type , params ) {
return function ( ) {
return dispatchEvent ( this , type , params ) ;
} ;
}
function dispatchFunction ( type , params ) {
return function ( ) {
return dispatchEvent ( this , type , params . apply ( this , arguments ) ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( type , params ) {
return this . each ( ( typeof params === "function" ?
dispatchFunction :
dispatchConstant ) ( type , params ) ) ;
} ;
/***/
} ) ,
/* 91 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( callback ) {
for ( var groups = this . _groups , j = 0 , m = groups . length ; j < m ; ++ j ) {
for ( var group = groups [ j ] , i = 0 , n = group . length , node ; i < n ; ++ i ) {
if ( node = group [ i ] ) callback . call ( node , node . _ _data _ _ , i , group ) ;
}
}
return this ;
} ;
/***/
} ) ,
/* 92 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return ! this . node ( ) ;
} ;
/***/
} ) ,
/* 93 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _sparse _ _ = _ _webpack _require _ _ ( 39 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ [ "b" /* Selection */ ] ( this . _exit || this . _groups . map ( _ _WEBPACK _IMPORTED _MODULE _0 _ _sparse _ _ [ "a" /* default */ ] ) , this . _parents ) ;
} ;
/***/
} ) ,
/* 94 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _matcher _ _ = _ _webpack _require _ _ ( 37 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( match ) {
if ( typeof match !== "function" ) match = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _matcher _ _ [ "a" /* default */ ] ) ( match ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = [ ] , node , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && match . call ( node , node . _ _data _ _ , i , group ) ) {
subgroup . push ( node ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( subgroups , this . _parents ) ;
} ;
/***/
} ) ,
/* 95 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function htmlRemove ( ) {
this . innerHTML = "" ;
}
function htmlConstant ( value ) {
return function ( ) {
this . innerHTML = value ;
} ;
}
function htmlFunction ( value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
this . innerHTML = v == null ? "" : v ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
return arguments . length ?
this . each ( value == null ?
htmlRemove : ( typeof value === "function" ?
htmlFunction :
htmlConstant ) ( value ) ) :
this . node ( ) . innerHTML ;
} ;
/***/
} ) ,
/* 96 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _creator _ _ = _ _webpack _require _ _ ( 14 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _selector _ _ = _ _webpack _require _ _ ( 19 ) ;
function constantNull ( ) {
return null ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , before ) {
var create = typeof name === "function" ? name : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _creator _ _ [ "a" /* default */ ] ) ( name ) ,
select = before == null ? constantNull : typeof before === "function" ? before : _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _selector _ _ [ "a" /* default */ ] ) ( before ) ;
return this . select ( function ( ) {
return this . insertBefore ( create . apply ( this , arguments ) , select . apply ( this , arguments ) || null ) ;
} ) ;
} ;
/***/
} ) ,
/* 97 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function lower ( ) {
if ( this . previousSibling ) this . parentNode . insertBefore ( this , this . parentNode . firstChild ) ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return this . each ( lower ) ;
} ;
/***/
} ) ,
/* 98 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( selection ) {
for ( var groups0 = this . _groups , groups1 = selection . _groups , m0 = groups0 . length , m1 = groups1 . length , m = Math . min ( m0 , m1 ) , merges = new Array ( m0 ) , j = 0 ; j < m ; ++ j ) {
for ( var group0 = groups0 [ j ] , group1 = groups1 [ j ] , n = group0 . length , merge = merges [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group0 [ i ] || group1 [ i ] ) {
merge [ i ] = node ;
}
}
}
for ( ; j < m0 ; ++ j ) {
merges [ j ] = groups0 [ j ] ;
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( merges , this . _parents ) ;
} ;
/***/
} ) ,
/* 99 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
for ( var groups = this . _groups , j = 0 , m = groups . length ; j < m ; ++ j ) {
for ( var group = groups [ j ] , i = 0 , n = group . length ; i < n ; ++ i ) {
var node = group [ i ] ;
if ( node ) return node ;
}
}
return null ;
} ;
/***/
} ) ,
/* 100 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
var nodes = new Array ( this . size ( ) ) ,
i = - 1 ;
this . each ( function ( ) { nodes [ ++ i ] = this ; } ) ;
return nodes ;
} ;
/***/
} ) ,
/* 101 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
for ( var groups = this . _groups , j = - 1 , m = groups . length ; ++ j < m ; ) {
for ( var group = groups [ j ] , i = group . length - 1 , next = group [ i ] , node ; -- i >= 0 ; ) {
if ( node = group [ i ] ) {
if ( next && next !== node . nextSibling ) next . parentNode . insertBefore ( node , next ) ;
next = node ;
}
}
}
return this ;
} ;
/***/
} ) ,
/* 102 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function propertyRemove ( name ) {
return function ( ) {
delete this [ name ] ;
} ;
}
function propertyConstant ( name , value ) {
return function ( ) {
this [ name ] = value ;
} ;
}
function propertyFunction ( name , value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) delete this [ name ] ;
else this [ name ] = v ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
return arguments . length > 1 ?
this . each ( ( value == null ?
propertyRemove : typeof value === "function" ?
propertyFunction :
propertyConstant ) ( name , value ) ) :
this . node ( ) [ name ] ;
} ;
/***/
} ) ,
/* 103 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function raise ( ) {
if ( this . nextSibling ) this . parentNode . appendChild ( this ) ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return this . each ( raise ) ;
} ;
/***/
} ) ,
/* 104 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function remove ( ) {
var parent = this . parentNode ;
if ( parent ) parent . removeChild ( this ) ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return this . each ( remove ) ;
} ;
/***/
} ) ,
/* 105 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _selector _ _ = _ _webpack _require _ _ ( 19 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( select ) {
if ( typeof select !== "function" ) select = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _selector _ _ [ "a" /* default */ ] ) ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = new Array ( n ) , node , subnode , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && ( subnode = select . call ( node , node . _ _data _ _ , i , group ) ) ) {
if ( "__data__" in node ) subnode . _ _data _ _ = node . _ _data _ _ ;
subgroup [ i ] = subnode ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( subgroups , this . _parents ) ;
} ;
/***/
} ) ,
/* 106 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _selectorAll _ _ = _ _webpack _require _ _ ( 40 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( select ) {
if ( typeof select !== "function" ) select = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _selectorAll _ _ [ "a" /* default */ ] ) ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = [ ] , parents = [ ] , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
subgroups . push ( select . call ( node , node . _ _data _ _ , i , group ) ) ;
parents . push ( node ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( subgroups , parents ) ;
} ;
/***/
} ) ,
/* 107 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
var size = 0 ;
this . each ( function ( ) { ++ size ; } ) ;
return size ;
} ;
/***/
} ) ,
/* 108 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 0 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( compare ) {
if ( ! compare ) compare = ascending ;
function compareNode ( a , b ) {
return a && b ? compare ( a . _ _data _ _ , b . _ _data _ _ ) : ! a - ! b ;
}
for ( var groups = this . _groups , m = groups . length , sortgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , sortgroup = sortgroups [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
sortgroup [ i ] = node ;
}
}
sortgroup . sort ( compareNode ) ;
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Selection */ ] ( sortgroups , this . _parents ) . order ( ) ;
} ;
function ascending ( a , b ) {
return a < b ? - 1 : a > b ? 1 : a >= b ? 0 : NaN ;
}
/***/
} ) ,
/* 109 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _window _ _ = _ _webpack _require _ _ ( 21 ) ;
function styleRemove ( name ) {
return function ( ) {
this . style . removeProperty ( name ) ;
} ;
}
function styleConstant ( name , value , priority ) {
return function ( ) {
this . style . setProperty ( name , value , priority ) ;
} ;
}
function styleFunction ( name , value , priority ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
if ( v == null ) this . style . removeProperty ( name ) ;
else this . style . setProperty ( name , v , priority ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value , priority ) {
var node ;
return arguments . length > 1 ?
this . each ( ( value == null ?
styleRemove : typeof value === "function" ?
styleFunction :
styleConstant ) ( name , value , priority == null ? "" : priority ) ) :
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _window _ _ [ "a" /* default */ ] ) ( node = this . node ( ) )
. getComputedStyle ( node , null )
. getPropertyValue ( name ) ;
} ;
/***/
} ) ,
/* 110 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function textRemove ( ) {
this . textContent = "" ;
}
function textConstant ( value ) {
return function ( ) {
this . textContent = value ;
} ;
}
function textFunction ( value ) {
return function ( ) {
var v = value . apply ( this , arguments ) ;
this . textContent = v == null ? "" : v ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
return arguments . length ?
this . each ( value == null ?
textRemove : ( typeof value === "function" ?
textFunction :
textConstant ) ( value ) ) :
this . node ( ) . textContent ;
} ;
/***/
} ) ,
/* 111 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ = _ _webpack _require _ _ ( 20 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ = _ _webpack _require _ _ ( 17 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node , touches , identifier ) {
if ( arguments . length < 3 ) identifier = touches , touches = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ [ "a" /* default */ ] ) ( ) . changedTouches ;
for ( var i = 0 , n = touches ? touches . length : 0 , touch ; i < n ; ++ i ) {
if ( ( touch = touches [ i ] ) . identifier === identifier ) {
return _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ [ "a" /* default */ ] ) ( node , touch ) ;
}
}
return null ;
} ;
/***/
} ) ,
/* 112 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ = _ _webpack _require _ _ ( 20 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ = _ _webpack _require _ _ ( 17 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node , touches ) {
if ( touches == null ) touches = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _sourceEvent _ _ [ "a" /* default */ ] ) ( ) . touches ;
for ( var i = 0 , n = touches ? touches . length : 0 , points = new Array ( n ) ; i < n ; ++ i ) {
points [ i ] = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _point _ _ [ "a" /* default */ ] ) ( node , touches [ i ] ) ;
}
return points ;
} ;
/***/
} ) ,
/* 113 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _timer _ _ = _ _webpack _require _ _ ( 22 ) ;
/* unused harmony default export */
var _unused _webpack _default _export = function ( callback , delay , time ) {
var t = new _ _WEBPACK _IMPORTED _MODULE _0 _ _timer _ _ [ "b" /* Timer */ ] ,
total = delay ;
if ( delay == null ) return t . restart ( callback , delay , time ) , t ;
delay = + delay , time = time == null ? _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _timer _ _ [ "c" /* now */ ] ) ( ) : + time ;
t . restart ( function tick ( elapsed ) {
elapsed += total ;
t . restart ( tick , total += delay , time ) ;
callback ( elapsed ) ;
} , delay , time ) ;
return t ;
} ;
/***/
} ) ,
/* 114 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _timer _ _ = _ _webpack _require _ _ ( 22 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( callback , delay , time ) {
var t = new _ _WEBPACK _IMPORTED _MODULE _0 _ _timer _ _ [ "b" /* Timer */ ] ;
delay = delay == null ? 0 : + delay ;
t . restart ( function ( elapsed ) {
t . stop ( ) ;
callback ( elapsed + delay ) ;
} , delay , time ) ;
return t ;
} ;
/***/
} ) ,
/* 115 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( _ _webpack _exports _ _ , "__esModule" , { value : true } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _src _selection _index _ _ = _ _webpack _require _ _ ( 117 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _src _transition _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "transition" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _1 _ _src _transition _index _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _src _active _ _ = _ _webpack _require _ _ ( 116 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "active" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _2 _ _src _active _ _ [ "a" ] ; } ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _src _interrupt _ _ = _ _webpack _require _ _ ( 42 ) ;
/* harmony reexport (binding) */
_ _webpack _require _ _ . d ( _ _webpack _exports _ _ , "interrupt" , function ( ) { return _ _WEBPACK _IMPORTED _MODULE _3 _ _src _interrupt _ _ [ "a" ] ; } ) ;
/***/
} ) ,
/* 116 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _transition _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
var root = [ null ] ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( node , name ) {
var schedules = node . _ _transition ,
schedule ,
i ;
if ( schedules ) {
name = name == null ? null : name + "" ;
for ( i in schedules ) {
if ( ( schedule = schedules [ i ] ) . state > _ _WEBPACK _IMPORTED _MODULE _1 _ _transition _schedule _ _ [ "d" /* SCHEDULED */ ] && schedule . name === name ) {
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ [ "b" /* Transition */ ] ( [
[ node ]
] , root , name , + i ) ;
}
}
}
return null ;
} ;
/***/
} ) ,
/* 117 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _interrupt _ _ = _ _webpack _require _ _ ( 118 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _transition _ _ = _ _webpack _require _ _ ( 119 ) ;
_ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selection" ] . prototype . interrupt = _ _WEBPACK _IMPORTED _MODULE _1 _ _interrupt _ _ [ "a" /* default */ ] ;
_ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selection" ] . prototype . transition = _ _WEBPACK _IMPORTED _MODULE _2 _ _transition _ _ [ "a" /* default */ ] ;
/***/
} ) ,
/* 118 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _interrupt _ _ = _ _webpack _require _ _ ( 42 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name ) {
return this . each ( function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _interrupt _ _ [ "a" /* default */ ] ) ( this , name ) ;
} ) ;
} ;
/***/
} ) ,
/* 119 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _transition _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _d3 _ease _ _ = _ _webpack _require _ _ ( 58 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _d3 _timer _ _ = _ _webpack _require _ _ ( 41 ) ;
var defaultTiming = {
time : null , // Set on use.
delay : 0 ,
duration : 250 ,
ease : _ _WEBPACK _IMPORTED _MODULE _2 _d3 _ease _ _ [ "a" /* easeCubicInOut */ ]
} ;
function inherit ( node , id ) {
var timing ;
while ( ! ( timing = node . _ _transition ) || ! ( timing = timing [ id ] ) ) {
if ( ! ( node = node . parentNode ) ) {
return defaultTiming . time = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _3 _d3 _timer _ _ [ "c" /* now */ ] ) ( ) , defaultTiming ;
}
}
return timing ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name ) {
var id ,
timing ;
if ( name instanceof _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ [ "b" /* Transition */ ] ) {
id = name . _id , name = name . _name ;
} else {
id = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ [ "c" /* newId */ ] ) ( ) , ( timing = defaultTiming ) . time = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _3 _d3 _timer _ _ [ "c" /* now */ ] ) ( ) , name = name == null ? null : name + "" ;
}
for ( var groups = this . _groups , m = groups . length , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _transition _schedule _ _ [ "h" /* default */ ] ) ( node , name , id , i , group , timing || inherit ( node , id ) ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _transition _index _ _ [ "b" /* Transition */ ] ( groups , this . _parents , name , id ) ;
} ;
/***/
} ) ,
/* 120 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _interpolate _ _ = _ _webpack _require _ _ ( 11 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _tween _ _ = _ _webpack _require _ _ ( 8 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _interpolate _ _ = _ _webpack _require _ _ ( 43 ) ;
function attrRemove ( name ) {
return function ( ) {
this . removeAttribute ( name ) ;
} ;
}
function attrRemoveNS ( fullname ) {
return function ( ) {
this . removeAttributeNS ( fullname . space , fullname . local ) ;
} ;
}
function attrConstant ( name , interpolate , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = this . getAttribute ( name ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value1 ) ;
} ;
}
function attrConstantNS ( fullname , interpolate , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = this . getAttributeNS ( fullname . space , fullname . local ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value1 ) ;
} ;
}
function attrFunction ( name , interpolate , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var value0 , value1 = value ( this ) ;
if ( value1 == null ) return void this . removeAttribute ( name ) ;
value0 = this . getAttribute ( name ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value10 = value1 ) ;
} ;
}
function attrFunctionNS ( fullname , interpolate , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var value0 , value1 = value ( this ) ;
if ( value1 == null ) return void this . removeAttributeNS ( fullname . space , fullname . local ) ;
value0 = this . getAttributeNS ( fullname . space , fullname . local ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value10 = value1 ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
var fullname = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ [ "namespace" ] ) ( name ) ,
i = fullname === "transform" ? _ _WEBPACK _IMPORTED _MODULE _0 _d3 _interpolate _ _ [ "e" /* interpolateTransformSvg */ ] : _ _WEBPACK _IMPORTED _MODULE _3 _ _interpolate _ _ [ "a" /* default */ ] ;
return this . attrTween ( name , typeof value === "function" ?
( fullname . local ? attrFunctionNS : attrFunction ) ( fullname , i , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _tween _ _ [ "b" /* tweenValue */ ] ) ( this , "attr." + name , value ) ) :
value == null ? ( fullname . local ? attrRemoveNS : attrRemove ) ( fullname ) :
( fullname . local ? attrConstantNS : attrConstant ) ( fullname , i , value ) ) ;
} ;
/***/
} ) ,
/* 121 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
function attrTweenNS ( fullname , value ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . setAttributeNS ( fullname . space , fullname . local , i ( t ) ) ;
} ;
}
tween . _value = value ;
return tween ;
}
function attrTween ( name , value ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . setAttribute ( name , i ( t ) ) ;
} ;
}
tween . _value = value ;
return tween ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value ) {
var key = "attr." + name ;
if ( arguments . length < 2 ) return ( key = this . tween ( key ) ) && key . _value ;
if ( value == null ) return this . tween ( key , null ) ;
if ( typeof value !== "function" ) throw new Error ;
var fullname = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "namespace" ] ) ( name ) ;
return this . tween ( key , ( fullname . local ? attrTweenNS : attrTween ) ( fullname , value ) ) ;
} ;
/***/
} ) ,
/* 122 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
function delayFunction ( id , value ) {
return function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "g" /* init */ ] ) ( this , id ) . delay = + value . apply ( this , arguments ) ;
} ;
}
function delayConstant ( id , value ) {
return value = + value ,
function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "g" /* init */ ] ) ( this , id ) . delay = value ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( ( typeof value === "function" ?
delayFunction :
delayConstant ) ( id , value ) ) :
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( this . node ( ) , id ) . delay ;
} ;
/***/
} ) ,
/* 123 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
function durationFunction ( id , value ) {
return function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) . duration = + value . apply ( this , arguments ) ;
} ;
}
function durationConstant ( id , value ) {
return value = + value ,
function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) . duration = value ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( ( typeof value === "function" ?
durationFunction :
durationConstant ) ( id , value ) ) :
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( this . node ( ) , id ) . duration ;
} ;
/***/
} ) ,
/* 124 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
function easeConstant ( id , value ) {
if ( typeof value !== "function" ) throw new Error ;
return function ( ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ) ( this , id ) . ease = value ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
var id = this . _id ;
return arguments . length ?
this . each ( easeConstant ( id , value ) ) :
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( this . node ( ) , id ) . ease ;
} ;
/***/
} ) ,
/* 125 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( match ) {
if ( typeof match !== "function" ) match = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "matcher" ] ) ( match ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = [ ] , node , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && match . call ( node , node . _ _data _ _ , i , group ) ) {
subgroup . push ( node ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ [ "b" /* Transition */ ] ( subgroups , this . _parents , this . _name , this . _id ) ;
} ;
/***/
} ) ,
/* 126 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( transition ) {
if ( transition . _id !== this . _id ) throw new Error ;
for ( var groups0 = this . _groups , groups1 = transition . _groups , m0 = groups0 . length , m1 = groups1 . length , m = Math . min ( m0 , m1 ) , merges = new Array ( m0 ) , j = 0 ; j < m ; ++ j ) {
for ( var group0 = groups0 [ j ] , group1 = groups1 [ j ] , n = group0 . length , merge = merges [ j ] = new Array ( n ) , node , i = 0 ; i < n ; ++ i ) {
if ( node = group0 [ i ] || group1 [ i ] ) {
merge [ i ] = node ;
}
}
}
for ( ; j < m0 ; ++ j ) {
merges [ j ] = groups0 [ j ] ;
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Transition */ ] ( merges , this . _parents , this . _name , this . _id ) ;
} ;
/***/
} ) ,
/* 127 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
function start ( name ) {
return ( name + "" ) . trim ( ) . split ( /^|\s+/ ) . every ( function ( t ) {
var i = t . indexOf ( "." ) ;
if ( i >= 0 ) t = t . slice ( 0 , i ) ;
return ! t || t === "start" ;
} ) ;
}
function onFunction ( id , name , listener ) {
var on0 , on1 , sit = start ( name ) ? _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "g" /* init */ ] : _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "e" /* set */ ] ;
return function ( ) {
var schedule = sit ( this , id ) ,
on = schedule . on ;
// If this node shared a dispatch with the previous node,
// just assign the updated shared dispatch and we’
// Otherwise, copy-on-write.
if ( on !== on0 ) ( on1 = ( on0 = on ) . copy ( ) ) . on ( name , listener ) ;
schedule . on = on1 ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , listener ) {
var id = this . _id ;
return arguments . length < 2 ?
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _schedule _ _ [ "f" /* get */ ] ) ( this . node ( ) , id ) . on . on ( name ) :
this . each ( onFunction ( id , name , listener ) ) ;
} ;
/***/
} ) ,
/* 128 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function removeFunction ( id ) {
return function ( ) {
var parent = this . parentNode ;
for ( var i in this . _ _transition )
if ( + i !== id ) return ;
if ( parent ) parent . removeChild ( this ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return this . on ( "end.remove" , removeFunction ( this . _id ) ) ;
} ;
/***/
} ) ,
/* 129 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( select ) {
var name = this . _name ,
id = this . _id ;
if ( typeof select !== "function" ) select = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selector" ] ) ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = new Array ( m ) , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , subgroup = subgroups [ j ] = new Array ( n ) , node , subnode , i = 0 ; i < n ; ++ i ) {
if ( ( node = group [ i ] ) && ( subnode = select . call ( node , node . _ _data _ _ , i , group ) ) ) {
if ( "__data__" in node ) subnode . _ _data _ _ = node . _ _data _ _ ;
subgroup [ i ] = subnode ;
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ [ "h" /* default */ ] ) ( subgroup [ i ] , name , id , i , subgroup , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ [ "f" /* get */ ] ) ( node , id ) ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ [ "b" /* Transition */ ] ( subgroups , this . _parents , name , id ) ;
} ;
/***/
} ) ,
/* 130 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( select ) {
var name = this . _name ,
id = this . _id ;
if ( typeof select !== "function" ) select = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selectorAll" ] ) ( select ) ;
for ( var groups = this . _groups , m = groups . length , subgroups = [ ] , parents = [ ] , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
for ( var children = select . call ( node , node . _ _data _ _ , i , group ) , child , inherit = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ [ "f" /* get */ ] ) ( node , id ) , k = 0 , l = children . length ; k < l ; ++ k ) {
if ( child = children [ k ] ) {
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _schedule _ _ [ "h" /* default */ ] ) ( child , name , id , k , children , inherit ) ;
}
}
subgroups . push ( children ) ;
parents . push ( node ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _1 _ _index _ _ [ "b" /* Transition */ ] ( subgroups , parents , name , id ) ;
} ;
/***/
} ) ,
/* 131 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
var Selection = _ _WEBPACK _IMPORTED _MODULE _0 _d3 _selection _ _ [ "selection" ] . prototype . constructor ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
return new Selection ( this . _groups , this . _parents ) ;
} ;
/***/
} ) ,
/* 132 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _d3 _interpolate _ _ = _ _webpack _require _ _ ( 11 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ = _ _webpack _require _ _ ( 2 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _2 _ _tween _ _ = _ _webpack _require _ _ ( 8 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _3 _ _interpolate _ _ = _ _webpack _require _ _ ( 43 ) ;
function styleRemove ( name , interpolate ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var style = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ [ "window" ] ) ( this ) . getComputedStyle ( this , null ) ,
value0 = style . getPropertyValue ( name ) ,
value1 = ( this . style . removeProperty ( name ) , style . getPropertyValue ( name ) ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value10 = value1 ) ;
} ;
}
function styleRemoveEnd ( name ) {
return function ( ) {
this . style . removeProperty ( name ) ;
} ;
}
function styleConstant ( name , interpolate , value1 ) {
var value00 ,
interpolate0 ;
return function ( ) {
var value0 = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ [ "window" ] ) ( this ) . getComputedStyle ( this , null ) . getPropertyValue ( name ) ;
return value0 === value1 ? null :
value0 === value00 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value1 ) ;
} ;
}
function styleFunction ( name , interpolate , value ) {
var value00 ,
value10 ,
interpolate0 ;
return function ( ) {
var style = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _d3 _selection _ _ [ "window" ] ) ( this ) . getComputedStyle ( this , null ) ,
value0 = style . getPropertyValue ( name ) ,
value1 = value ( this ) ;
if ( value1 == null ) value1 = ( this . style . removeProperty ( name ) , style . getPropertyValue ( name ) ) ;
return value0 === value1 ? null :
value0 === value00 && value1 === value10 ? interpolate0 :
interpolate0 = interpolate ( value00 = value0 , value10 = value1 ) ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value , priority ) {
var i = ( name += "" ) === "transform" ? _ _WEBPACK _IMPORTED _MODULE _0 _d3 _interpolate _ _ [ "a" /* interpolateTransformCss */ ] : _ _WEBPACK _IMPORTED _MODULE _3 _ _interpolate _ _ [ "a" /* default */ ] ;
return value == null ? this
. styleTween ( name , styleRemove ( name , i ) )
. on ( "end.style." + name , styleRemoveEnd ( name ) ) :
this . styleTween ( name , typeof value === "function" ?
styleFunction ( name , i , _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _2 _ _tween _ _ [ "b" /* tweenValue */ ] ) ( this , "style." + name , value ) ) :
styleConstant ( name , i , value ) , priority ) ;
} ;
/***/
} ) ,
/* 133 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
function styleTween ( name , value , priority ) {
function tween ( ) {
var node = this ,
i = value . apply ( node , arguments ) ;
return i && function ( t ) {
node . style . setProperty ( name , i ( t ) , priority ) ;
} ;
}
tween . _value = value ;
return tween ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( name , value , priority ) {
var key = "style." + ( name += "" ) ;
if ( arguments . length < 2 ) return ( key = this . tween ( key ) ) && key . _value ;
if ( value == null ) return this . tween ( key , null ) ;
if ( typeof value !== "function" ) throw new Error ;
return this . tween ( key , styleTween ( name , value , priority == null ? "" : priority ) ) ;
} ;
/***/
} ) ,
/* 134 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _tween _ _ = _ _webpack _require _ _ ( 8 ) ;
function textConstant ( value ) {
return function ( ) {
this . textContent = value ;
} ;
}
function textFunction ( value ) {
return function ( ) {
var value1 = value ( this ) ;
this . textContent = value1 == null ? "" : value1 ;
} ;
}
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( value ) {
return this . tween ( "text" , typeof value === "function" ?
textFunction ( _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _tween _ _ [ "b" /* tweenValue */ ] ) ( this , "text" , value ) ) :
textConstant ( value == null ? "" : value + "" ) ) ;
} ;
/***/
} ) ,
/* 135 */
/***/
( function ( module , _ _webpack _exports _ _ , _ _webpack _require _ _ ) {
"use strict" ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ = _ _webpack _require _ _ ( 3 ) ;
/* harmony import */
var _ _WEBPACK _IMPORTED _MODULE _1 _ _schedule _ _ = _ _webpack _require _ _ ( 1 ) ;
/* harmony default export */
_ _webpack _exports _ _ [ "a" ] = function ( ) {
var name = this . _name ,
id0 = this . _id ,
id1 = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "c" /* newId */ ] ) ( ) ;
for ( var groups = this . _groups , m = groups . length , j = 0 ; j < m ; ++ j ) {
for ( var group = groups [ j ] , n = group . length , node , i = 0 ; i < n ; ++ i ) {
if ( node = group [ i ] ) {
var inherit = _ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _schedule _ _ [ "f" /* get */ ] ) ( node , id0 ) ;
_ _webpack _require _ _ . i ( _ _WEBPACK _IMPORTED _MODULE _1 _ _schedule _ _ [ "h" /* default */ ] ) ( node , name , id1 , i , group , {
time : inherit . time + inherit . delay + inherit . duration ,
delay : 0 ,
duration : inherit . duration ,
ease : inherit . ease
} ) ;
}
}
}
return new _ _WEBPACK _IMPORTED _MODULE _0 _ _index _ _ [ "b" /* Transition */ ] ( groups , this . _parents , name , id1 ) ;
} ;
/***/
} ) ,
/* 136 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
/* WEBPACK VAR INJECTION */
( function ( global ) {
! function ( t , e ) {
true ? e ( exports , _ _webpack _require _ _ ( 2 ) , _ _webpack _require _ _ ( 29 ) ) :
"function" == typeof define && define . amd ? define ( [ "exports" , "d3-selection" , "d3-dispatch" ] , e ) :
e ( t . d3Kit = t . d3Kit || { } , t . d3 , t . d3 )
} ( this , function ( t , e , n ) {
"use strict" ;
function i ( t ) {
var e = "undefined" == typeof t ? "undefined" : x ( t ) ;
return null != t && ( "object" == e || "function" == e )
}
function r ( t ) {
var e = i ( t ) ? T . call ( t ) : "" ;
return e == N || e == C || e == R
}
function a ( t ) {
return null != t && "object" == ( "undefined" == typeof t ? "undefined" : x ( t ) )
}
function s ( t ) {
return "symbol" == ( "undefined" == typeof t ? "undefined" : x ( t ) ) || a ( t ) && $ . call ( t ) == G
}
function o ( t ) {
if ( "number" == typeof t ) return t ;
if ( s ( t ) ) return z ;
if ( i ( t ) ) {
var e = "function" == typeof t . valueOf ? t . valueOf ( ) : t ;
t = i ( e ) ? e + "" : e
}
if ( "string" != typeof t ) return 0 === t ? t : + t ;
t = t . replace ( q , "" ) ;
var n = U . test ( t ) ;
return n || K . test ( t ) ? V ( t . slice ( 2 ) , n ? 2 : 8 ) : B . test ( t ) ? z : + t
}
function h ( t , e , n ) {
function r ( e ) {
var n = g ,
i = p ;
return g = p = void 0 , _ = e , m = t . apply ( i , n )
}
function a ( t ) { return _ = t , y = setTimeout ( u , e ) , b ? r ( t ) : m }
function s ( t ) {
var n = t - w ,
i = t - _ ,
r = e - n ;
return O ? Q ( r , v - i ) : r
}
function h ( t ) {
var n = t - w ,
i = t - _ ;
return void 0 === w || n >= e || 0 > n || O && i >= v
}
function u ( ) { var t = L ( ) ; return h ( t ) ? l ( t ) : void ( y = setTimeout ( u , s ( t ) ) ) }
function l ( t ) { return y = void 0 , k && g ? r ( t ) : ( g = p = void 0 , m ) }
function c ( ) { void 0 !== y && clearTimeout ( y ) , _ = 0 , g = w = p = y = void 0 }
function f ( ) { return void 0 === y ? m : l ( L ( ) ) }
function d ( ) {
var t = L ( ) ,
n = h ( t ) ;
if ( g = arguments , p = this , w = t , n ) { if ( void 0 === y ) return a ( w ) ; if ( O ) return y = setTimeout ( u , e ) , r ( w ) }
return void 0 === y && ( y = setTimeout ( u , e ) ) , m
}
var g , p , v , m , y , w , _ = 0 ,
b = ! 1 ,
O = ! 1 ,
k = ! 0 ;
if ( "function" != typeof t ) throw new TypeError ( Z ) ;
return e = o ( e ) || 0 , i ( n ) && ( b = ! ! n . leading , O = "maxWait" in n , v = O ? J ( o ( n . maxWait ) || 0 , e ) : v , k = "trailing" in n ? ! ! n . trailing : k ) , d . cancel = c , d . flush = f , d
}
function u ( t , e , n ) {
var r = ! 0 ,
a = ! 0 ;
if ( "function" != typeof t ) throw new TypeError ( X ) ;
return i ( n ) && ( r = "leading" in n ? ! ! n . leading : r , a = "trailing" in n ? ! ! n . trailing : a ) , h ( t , e , { leading : r , maxWait : e , trailing : a } )
}
function l ( t ) {
return null == t ? "" : String ( t ) . replace ( /([.*+?^=!:${}()|[\]\/\\])/g , "\\$1" )
}
function c ( t ) {
return null == t ? "\\s" : t . source ? t . source : "[" + l ( t ) + "]"
}
function f ( t , e ) {
if ( null == t ) return "" ;
if ( ! e && Y ) return Y . call ( t ) ;
var n = c ( e ) ,
i = new RegExp ( "^" + n + "+|" + n + "+$" , "g" ) ;
return String ( t ) . replace ( i , "" )
}
function d ( t ) {
return f ( t ) . replace ( /([A-Z])/g , "-$1" ) . replace ( /[-_\s]+/g , "-" ) . toLowerCase ( )
}
function g ( t ) {
t = t || { } ;
for ( var e = 1 ; e < arguments . length ; e ++ ) {
var n = arguments [ e ] ;
if ( n )
for ( var a in n )
if ( n . hasOwnProperty ( a ) ) {
var s = n [ a ] ;
t [ a ] = ! i ( s ) || Array . isArray ( s ) || r ( s ) ? s : g ( t [ a ] , s )
}
}
return t
}
function p ( t ) {
t = t || { } ;
for ( var e = 1 ; e < arguments . length ; e ++ )
if ( arguments [ e ] )
for ( var n in arguments [ e ] ) arguments [ e ] . hasOwnProperty ( n ) && ( t [ n ] = arguments [ e ] [ n ] ) ;
return t
}
function v ( t , e , n ) {
return function ( ) { var i = n . apply ( e , arguments ) ; return i === e ? t : i }
}
function m ( t , e ) {
for ( var n = 1 , i = arguments . length , r = void 0 ; ++ n < i ; ) t [ r = arguments [ n ] ] = v ( t , e , e [ r ] ) ;
return t
}
function y ( t ) {
return r ( t ) ? t : function ( ) { return t }
}
function w ( t ) {
throw new Error ( "Missing parameter " + t )
}
function _ ( t ) {
return null !== t && void 0 !== t
}
function b ( t ) {
return null === t || void 0 === t
}
function O ( t ) {
return ! ( ! t || 1 !== t . nodeType )
}
function k ( t ) {
if ( b ( t ) ) return function ( t , e ) {
return Math . min ( t , e )
} ;
var e = ( "" + t ) . trim ( ) . toLowerCase ( ) ;
if ( e . indexOf ( "%" ) > - 1 ) {
var n = function ( ) {
var t = + e . replace ( "%" , "" ) / 100 ;
return { v : function ( e , n ) { return n * t } }
} ( ) ;
if ( "object" === ( "undefined" == typeof n ? "undefined" : x ( n ) ) ) return n . v
}
return function ( ) { return + e . replace ( "px" , "" ) }
}
function D ( t ) {
function e ( t , e ) {
var n = arguments . length <= 2 || void 0 === arguments [ 2 ] ? "" : arguments [ 2 ] ,
i = e . split ( "." ) ,
r = void 0 ,
a = void 0 ;
i . length > 1 ? ( a = i [ 0 ] . length > 0 ? i [ 0 ] : h , r = i [ 1 ] ) : ( a = h , r = i [ 0 ] ) ;
var s = "" + n + r ;
if ( u . hasOwnProperty ( s ) ) throw new Error ( "invalid or duplicate layer id: " + s ) ;
var o = d ( r ) + "-layer" ,
l = t . append ( a ) . classed ( o , ! 0 ) ;
return u [ s ] = l , l
}
function n ( t , r ) {
var a = arguments . length <= 2 || void 0 === arguments [ 2 ] ? "" : arguments [ 2 ] ;
if ( Array . isArray ( r ) ) return r . map ( function ( e ) { return n ( t , e , a ) } ) ;
if ( i ( r ) ) {
var s = Object . keys ( r ) ,
o = W ( s , 1 ) ,
h = o [ 0 ] ,
u = e ( t , h , a ) ;
return n ( u , r [ h ] , "" + a + h + "/" ) , u
}
return e ( t , r , a )
}
function r ( e ) { return n ( t , e ) }
function a ( t ) {
return Array . isArray ( t ) ? t . map ( r ) : r ( t )
}
function s ( t ) { return u [ t ] }
function o ( t ) { return ! ! u [ t ] }
var h = arguments . length <= 1 || void 0 === arguments [ 1 ] ? "g" : arguments [ 1 ] ,
u = { } ;
return { create : a , get : s , has : o }
}
var x = "function" == typeof Symbol && "symbol" == typeof Symbol . iterator ? function ( t ) { return typeof t } : function ( t ) {
return t && "function" == typeof Symbol && t . constructor === Symbol ? "symbol" : typeof t
} ,
E = function ( t , e ) {
if ( ! ( t instanceof e ) ) throw new TypeError ( "Cannot call a class as a function" )
} ,
A = function ( ) {
function t ( t , e ) {
for ( var n = 0 ; n < e . length ; n ++ ) {
var i = e [ n ] ;
i . enumerable = i . enumerable || ! 1 , i . configurable = ! 0 , "value" in i && ( i . writable = ! 0 ) , Object . defineProperty ( t , i . key , i )
}
}
return function ( e , n , i ) {
return n && t ( e . prototype , n ) , i && t ( e , i ) , e
}
} ( ) ,
j = function ( t , e ) {
if ( "function" != typeof e && null !== e ) throw new TypeError ( "Super expression must either be null or a function, not " + typeof e ) ;
t . prototype = Object . create ( e && e . prototype , { constructor : { value : t , enumerable : ! 1 , writable : ! 0 , configurable : ! 0 } } ) , e && ( Object . setPrototypeOf ? Object . setPrototypeOf ( t , e ) : t . _ _proto _ _ = e )
} ,
P = function ( t , e ) {
if ( ! t ) throw new ReferenceError ( "this hasn't been initialised - super() hasn't been called" ) ;
return ! e || "object" != typeof e && "function" != typeof e ? t : e
} ,
W = function ( ) {
function t ( t , e ) {
var n = [ ] ,
i = ! 0 ,
r = ! 1 ,
a = void 0 ;
try {
for ( var s , o = t [ Symbol . iterator ] ( ) ; ! ( i = ( s = o . next ( ) ) . done ) && ( n . push ( s . value ) , ! e || n . length !== e ) ; i = ! 0 ) ;
} catch ( h ) { r = ! 0 , a = h } finally {
try { ! i && o [ "return" ] && o [ "return" ] ( ) } finally { if ( r ) throw a }
}
return n
}
return function ( e , n ) {
if ( Array . isArray ( e ) ) return e ;
if ( Symbol . iterator in Object ( e ) ) return t ( e , n ) ;
throw new TypeError ( "Invalid attempt to destructure non-iterable instance" )
}
} ( ) ,
N = "[object Function]" ,
C = "[object GeneratorFunction]" ,
R = "[object Proxy]" ,
S = Object . prototype ,
T = S . toString ,
M = "object" == ( "undefined" == typeof global ? "undefined" : x ( global ) ) && global && global . Object === Object && global ,
I = "object" == ( "undefined" == typeof self ? "undefined" : x ( self ) ) && self && self . Object === Object && self ,
F = M || I || Function ( "return this" ) ( ) ,
L = function ( ) { return F . Date . now ( ) } ,
G = "[object Symbol]" ,
H = Object . prototype ,
$ = H . toString ,
z = 0 / 0 ,
q = /^\s+|\s+$/g ,
B = /^[-+]0x[0-9a-f]+$/i ,
U = /^0b[01]+$/i ,
K = /^0o[0-7]+$/i ,
V = parseInt ,
Z = "Expected a function" ,
J = Math . max ,
Q = Math . min ,
X = "Expected a function" ,
Y = String . prototype . trim ,
tt = Object . freeze ( { isObject : i , isFunction : r , kebabCase : d , deepExtend : g , extend : p , rebind : m , functor : y , debounce : h , throttle : u } ) ,
et = function ( ) {
function t ( ) {
E ( this , t ) ;
for ( var e = arguments . length , n = Array ( e ) , i = 0 ; e > i ; i ++ ) n [ i ] = arguments [ i ] ;
if ( 1 === n . length ) {
var a = n [ 0 ] ,
s = r ( a ) ? a ( ) : a ;
if ( s instanceof t ) this . width = s . width , this . height = s . height ;
else if ( O ( s ) ) this . width = s . clientWidth , this . height = s . clientHeight ;
else if ( Array . isArray ( s ) ) this . width = s [ 0 ] , this . height = s [ 1 ] ;
else {
if ( ! ( _ ( s ) && _ ( s . width ) && _ ( s . height ) ) ) { var o = new Error ( "Unsupported input. Must be either\n DOMNode, Array or Object with field width and height,\n or a function that returns any of the above." ) ; throw o . value = a , o }
this . width = s . width , this . height = s . height
}
} else {
var h = n [ 0 ] ,
u = n [ 1 ] ;
this . width = h , this . height = u
}
}
return A ( t , [ { key : "isEqual" , value : function ( e ) { if ( e instanceof t ) return this . width === e . width && this . height === e . height ; var n = new t ( e ) ; return this . width === n . width && this . height === n . height } } , { key : "toArray" , value : function ( ) { return [ this . width , this . height ] } } , { key : "toObject" , value : function ( ) { return { width : this . width , height : this . height } } } ] ) , t
} ( ) ,
nt = function ( ) {
function t ( ) {
var e = arguments . length <= 0 || void 0 === arguments [ 0 ] ? { } : arguments [ 0 ] ;
E ( this , t ) ;
var n = e || { } ,
i = n . mode ,
r = void 0 === i ? t . MODE _BASIC : i ,
a = n . width ,
s = void 0 === a ? "100%" : a ,
o = n . height ,
h = void 0 === o ? null : o ,
u = n . ratio ,
l = void 0 === u ? 1 : u ,
c = n . maxWidth ,
f = void 0 === c ? null : c ,
d = n . maxHeight ,
g = void 0 === d ? null : d ;
r === t . MODE _ASPECT _RATIO ? ( this . wFn = k ( f ) , this . hFn = k ( g ) , this . options = { mode : r , ratio : l , maxWidth : f , maxHeight : g } ) : ( this . wFn = k ( s ) , this . hFn = k ( h ) , this . options = { mode : r , width : s , height : h } )
}
return A ( t , [ {
key : "fit" ,
value : function ( ) {
var e = arguments . length <= 0 || void 0 === arguments [ 0 ] ? w ( "box" ) : arguments [ 0 ] ,
n = arguments . length <= 1 || void 0 === arguments [ 1 ] ? w ( "container" ) : arguments [ 1 ] ,
i = new et ( e ) ,
r = i . width ,
a = i . height ,
s = new et ( n ) ,
o = s . width ,
h = s . height ,
u = void 0 ;
if ( this . options . mode === t . MODE _ASPECT _RATIO ) {
var l = this . options . ratio ,
c = this . wFn ( o , o ) ,
f = this . hFn ( h , h ) ,
d = Math . floor ( l * f ) ;
u = c >= d ? new et ( d , f ) : new et ( c , Math . floor ( c / l ) )
} else u = new et ( this . wFn ( r , o ) , this . hFn ( a , h ) ) ;
return { dimension : u , changed : ! u . isEqual ( i ) }
}
} ] ) , t
} ( ) ;
nt . MODE _BASIC = "basic" , nt . MODE _ASPECT _RATIO = "aspectRatio" ;
var it = function ( ) {
function t ( ) {
var e = arguments . length <= 0 || void 0 === arguments [ 0 ] ? { } : arguments [ 0 ] ;
E ( this , t ) ;
var n = e || { } ,
i = n . mode ,
r = void 0 === i ? t . MODE _WINDOW : i ,
a = n . target ,
s = void 0 === a ? null : a ,
o = n . interval ,
h = void 0 === o ? 200 : o ;
r !== t . MODE _POLLING || s || w ( "options.target" ) , this . mode = r , this . target = s , this . interval = h , this . check = this . check . bind ( this ) , this . throttledCheck = u ( this . check , this . interval ) , this . isWatching = ! 1 , this . listeners = { change : [ ] }
}
return A ( t , [ { key : "hasTargetChanged" , value : function ( ) { if ( ! this . target ) return ! 0 ; var t = new et ( this . target ) ; return this . currentDim && t . isEqual ( this . currentDim ) ? ! 1 : ( this . currentDim = t , ! 0 ) } } , { key : "check" , value : function ( ) { return this . hasTargetChanged ( ) && this . dispatch ( "change" , this . currentDim ) , this } } , { key : "dispatch" , value : function ( t ) { for ( var e = this , n = arguments . length , i = Array ( n > 1 ? n - 1 : 0 ) , r = 1 ; n > r ; r ++ ) i [ r - 1 ] = arguments [ r ] ; return this . listeners [ t ] . forEach ( function ( t ) { return t . apply ( e , i ) } ) , this } } , { key : "on" , value : function ( t , e ) { return - 1 === this . listeners [ t ] . indexOf ( e ) && this . listeners [ t ] . push ( e ) , this } } , { key : "off" , value : function ( t , e ) { return this . listeners [ t ] = this . listeners [ t ] . filter ( function ( t ) { return t !== e } ) , this } } , { key : "start" , value : function ( ) { return this . isWatching || ( this . target && ( this . currentDim = new et ( this . target ) ) , this . mode === t . MODE _WINDOW ? window . addEventListener ( "resize" , this . throttledCheck ) : this . mode === t . MODE _POLLING && ( this . intervalId = window . setInterval ( this . check , this . interval ) ) , this . isWatching = ! 0 ) , this } } , { key : "stop" , value : function ( ) { return this . isWatching && ( this . mode === t . MODE _WINDOW ? window . removeEventListener ( "resize" , this . throttledCheck ) : this . mode === t . MODE _POLLING && this . intervalId && ( window . clearInterval ( this . intervalId ) , this . intervalId = null ) , this . isWatching = ! 1 ) , this } } , { key : "destroy" , value : function ( ) { return this . stop ( ) , this . listeners . change = [ ] , this } } ] ) , t
} ( ) ;
it . MODE _WINDOW = "window" , it . MODE _POLLING = "polling" ;
var rt = function ( t ) {
function e ( ) {
var t = arguments . length <= 0 || void 0 === arguments [ 0 ] ? w ( "box" ) : arguments [ 0 ] ,
n = arguments . length <= 1 || void 0 === arguments [ 1 ] ? w ( "container" ) : arguments [ 1 ] ,
i = arguments [ 2 ] ,
r = arguments [ 3 ] ;
E ( this , e ) ;
var a = P ( this , Object . getPrototypeOf ( e ) . call ( this , r ) ) ,
s = new nt ( i ) ;
return a . fit = function ( ) { return s . fit ( t , n ) } , a
}
return j ( e , t ) , A ( e , [ {
key : "check" ,
value : function ( ) {
if ( this . hasTargetChanged ( ) ) {
var t = this . fit ( ) ,
e = t . changed ,
n = t . dimension ;
e && this . dispatch ( "change" , n )
}
return this
}
} ] ) , e
} ( it ) ,
at = function ( ) {
function t ( ) {
E ( this , t ) ;
for ( var e = arguments . length , n = Array ( e ) , i = 0 ; e > i ; i ++ ) n [ i ] = arguments [ i ] ;
var r = g . apply ( void 0 , [ this . constructor . getDefaultOptions ( ) ] . concat ( n ) ) ;
this . _state = { width : r . initialWidth , height : r . initialHeight , options : r } , this . _updateDimension = h ( this . _updateDimension . bind ( this ) , 1 )
}
return A ( t , null , [ { key : "getDefaultOptions" , value : function ( ) { for ( var t = arguments . length , e = Array ( t ) , n = 0 ; t > n ; n ++ ) e [ n ] = arguments [ n ] ; return g . apply ( void 0 , [ { initialWidth : 720 , initialHeight : 500 , margin : { top : 30 , right : 30 , bottom : 30 , left : 30 } , offset : [ . 5 , . 5 ] , pixelRatio : window . devicePixelRatio || 1 } ] . concat ( e ) ) } } ] ) , A ( t , [ {
key : "copyDimension" ,
value : function ( t ) {
if ( t ) {
var e = t . _state ,
n = e . width ,
i = e . height ,
r = t . _state . options ,
a = r . offset ,
s = r . margin ,
o = r . pixelRatio ;
g ( this . _state , { width : n , height : i , options : { offset : a . concat ( ) , margin : s , pixelRatio : o } } ) , this . _updateDimension ( )
}
return this
}
} , { key : "width" , value : function ( ) { if ( 0 === arguments . length ) return this . _state . width ; var t = Math . floor ( + ( arguments . length <= 0 ? void 0 : arguments [ 0 ] ) ) ; return t !== this . _state . width && ( this . _state . width = t , this . _updateDimension ( ) ) , this } } , { key : "height" , value : function ( ) { if ( 0 === arguments . length ) return this . _state . height ; var t = Math . floor ( + ( arguments . length <= 0 ? void 0 : arguments [ 0 ] ) ) ; return t !== this . _state . height && ( this . _state . height = t , this . _updateDimension ( ) ) , this } } , {
key : "dimension" ,
value : function ( ) {
if ( 0 === arguments . length ) return [ this . _state . width , this . _state . height ] ;
var t = arguments . length <= 0 ? void 0 : arguments [ 0 ] ,
e = W ( t , 2 ) ,
n = e [ 0 ] ,
i = e [ 1 ] ;
return this . width ( n ) . height ( i ) , this
}
} , {
key : "margin" ,
value : function ( ) {
if ( 0 === arguments . length ) return this . _state . options . margin ;
var t = this . _state . options . margin ,
e = p ( { } , this . _state . options . margin , arguments . length <= 0 ? void 0 : arguments [ 0 ] ) ,
n = Object . keys ( e ) . some ( function ( n ) { return t [ n ] !== e [ n ] } ) ;
return n && ( this . _state . options . margin = e , this . _updateDimension ( ) ) , this
}
} , {
key : "offset" ,
value : function ( ) {
if ( 0 === arguments . length ) return this . _state . options . offset ;
var t = arguments . length <= 0 ? void 0 : arguments [ 0 ] ,
e = W ( this . _state . options . offset , 2 ) ,
n = e [ 0 ] ,
i = e [ 1 ] ,
r = W ( t , 2 ) ,
a = r [ 0 ] ,
s = r [ 1 ] ;
return ( n !== a || i !== s ) && ( this . _state . options . offset = t , this . _updateDimension ( ) ) , this
}
} , { key : "pixelRatio" , value : function ( ) { if ( 0 === arguments . length ) return this . _state . options . pixelRatio ; var t = + ( arguments . length <= 0 ? void 0 : arguments [ 0 ] ) ; return t !== this . _state . options . pixelRatio && ( this . _state . options . pixelRatio = t , this . _updateDimension ( ) ) , this } } , { key : "_updateDimension" , value : function ( ) { return this } } , { key : "updateDimensionNow" , value : function ( ) { return this . _updateDimension ( ) , this . _updateDimension . flush ( ) , this } } ] ) , t
} ( ) ,
st = function ( t ) {
function r ( t ) {
var n ;
E ( this , r ) ;
for ( var i = arguments . length , a = Array ( i > 1 ? i - 1 : 0 ) , s = 1 ; i > s ; s ++ ) a [ s - 1 ] = arguments [ s ] ;
var o = P ( this , ( n = Object . getPrototypeOf ( r ) ) . call . apply ( n , [ this ] . concat ( a ) ) ) ;
p ( o . _state , { innerWidth : 0 , innerHeight : 0 , fitOptions : null , data : null , plates : [ ] } ) , o . container = e . select ( t ) , o . container . style ( "line-height" , 0 ) , o . chartRoot = o . container . append ( "div" ) . classed ( "d3kit-chart-root" , ! 0 ) . attr ( 'id' , 'd3kitRoot' ) . style ( "display" , "inline-block" ) . style ( "position" , "relative" ) . style ( "line-height" , 0 ) , o . plates = { } ;
var u = o . constructor . getCustomEventNames ( ) ;
return o . setupDispatcher ( u ) , o . _dispatchData = h ( o . _dispatchData . bind ( o ) , 1 ) , o . _dispatchOptions = h ( o . _dispatchOptions . bind ( o ) , 1 ) , o
}
return j ( r , t ) , A ( r , null , [ { key : "getCustomEventNames" , value : function ( ) { return [ ] } } ] ) , A ( r , [ { key : "addPlate" , value : function ( t , e , n ) { if ( this . plates [ t ] ) throw new Error ( "Plate with this name already exists" , t ) ; return this . _state . plates . push ( e ) , this . plates [ t ] = e , n ? e : ( e . getSelection ( ) . classed ( "d3kit-plate" , ! 0 ) . style ( "position" , "absolute" ) . style ( "top" , 0 ) . style ( "left" , 0 ) , this . chartRoot . append ( function ( ) { return e . getNode ( ) } ) , this ) } } , {
key : "removePlate" ,
value : function ( t ) {
var e = this . plates [ t ] ;
if ( e ) {
var n = this . _state . plates . indexOf ( e ) ;
n > - 1 && this . _state . plates . splice ( n , 1 ) , e . getNode ( ) . parentNode === this . chartRoot . node ( ) && this . chartRoot . node ( ) . removeChild ( e . getNode ( ) ) , delete this . plates [ t ]
}
return this
}
} , { key : "setupDispatcher" , value : function ( ) { var t = arguments . length <= 0 || void 0 === arguments [ 0 ] ? [ ] : arguments [ 0 ] ; return this . _customEventNames = t , this . _eventNames = r . DEFAULT _EVENTS . concat ( t ) , this . dispatcher = n . dispatch . apply ( this , this . _eventNames ) , this } } , { key : "getCustomEventNames" , value : function ( ) { return this . _customEventNames } } , { key : "getInnerWidth" , value : function ( ) { return this . _state . innerWidth } } , { key : "getInnerHeight" , value : function ( ) { return this . _state . innerHeight } } , { key : "data" , value : function ( ) { for ( var t = arguments . length , e = Array ( t ) , n = 0 ; t > n ; n ++ ) e [ n ] = arguments [ n ] ; if ( 0 === e . length ) return this . _state . data ; var i = e [ 0 ] ; return this . _state . data = i , this . _dispatchData ( ) , this } } , {
key : "options" ,
value : function ( ) {
for ( var t = arguments . length , e = Array ( t ) , n = 0 ; t > n ; n ++ ) e [ n ] = arguments [ n ] ;
if ( 0 === e . length ) return this . _state . options ;
var i = e [ 0 ] ,
r = p ( { } , i ) ;
return i . margin && ( this . margin ( i . margin ) , delete r . margin ) , i . offset && ( this . offset ( i . offset ) , delete r . offset ) , i . pixelRatio && ( this . pixelRatio ( i . pixelRatio ) , delete r . pixelRatio ) , this . _state . options = g ( this . _state . options , r ) , this . _dispatchOptions ( ) , this
}
} , {
key : "_updateDimension" ,
value : function ( ) {
var t = this ,
e = this . _state ,
n = e . width ,
i = e . height ,
r = e . plates ,
a = this . _state . options . margin ,
s = a . top ,
o = a . right ,
h = a . bottom ,
u = a . left ;
this . _state . innerWidth = n - u - o , this . _state . innerHeight = i - s - h , this . chartRoot . style ( "width" , n + "px" ) . style ( "height" , i + "px" ) , r . forEach ( function ( e ) { e . copyDimension ( t ) . updateDimensionNow ( ) } ) ;
var l = this . _state ,
c = l . innerWidth ,
f = l . innerHeight ;
return this . dispatcher . apply ( "resize" , this , [ n , i , c , f ] ) , this
}
} , { key : "hasData" , value : function ( ) { var t = this . _state . data ; return null !== t && void 0 !== t } } , {
key : "hasNonZeroArea" ,
value : function ( ) {
var t = this . _state ,
e = t . innerWidth ,
n = t . innerHeight ;
return e > 0 && n > 0
}
} , {
key : "fit" ,
value : function ( t ) {
var e = this ,
n = arguments . length <= 1 || void 0 === arguments [ 1 ] ? ! 1 : arguments [ 1 ] ;
t && ( this . _state . fitOptions = t ) ;
var r = new nt ( this . _state . fitOptions ) ,
a = r . fit ( this . dimension ( ) , this . container . node ( ) ) ,
s = a . changed ,
o = a . dimension ;
s && this . dimension ( [ o . width , o . height ] ) ;
var h = ! ! n ;
return h && ( this . fitWatcher && this . fitWatcher . destroy ( ) , this . fitWatcher = new rt ( function ( ) { return e . dimension ( ) } , this . container . node ( ) , this . _state . fitOptions , i ( n ) ? n : null ) . on ( "change" , function ( t ) { return e . dimension ( [ t . width , t . height ] ) } ) . start ( ) ) , this
}
} , { key : "stopFitWatcher" , value : function ( ) { return this . fitWatcher && ( this . fitWatcher . destroy ( ) , this . fitWatcher = null ) , this } } , { key : "_dispatchData" , value : function ( ) { return this . dispatcher . call ( "data" , this , this . _state . data ) , this } } , { key : "_dispatchOptions" , value : function ( ) { return this . dispatcher . call ( "options" , this , this . _state . options ) , this } } , { key : "on" , value : function ( t , e ) { return this . dispatcher . on ( t , e ) , this } } , { key : "off" , value : function ( t ) { return this . dispatcher . on ( t , null ) , this } } , {
key : "dispatchAs" ,
value : function ( t ) {
var e = this ;
return function ( ) {
for ( var n = arguments . length , i = Array ( n ) , r = 0 ; n > r ; r ++ ) i [ r ] = arguments [ r ] ;
e . dispatcher . apply ( t , e , i )
}
}
} , { key : "destroy" , value : function ( ) { var t = this ; return this . _eventNames . forEach ( function ( e ) { t . off ( e ) } ) , this . stopFitWatcher ( ) , this } } ] ) , r
} ( at ) ;
st . DEFAULT _EVENTS = [ "data" , "options" , "resize" ] ;
var ot = function ( t ) {
function n ( t ) {
var i ;
E ( this , n ) ;
for ( var r = arguments . length , a = Array ( r > 1 ? r - 1 : 0 ) , s = 1 ; r > s ; s ++ ) a [ s - 1 ] = arguments [ s ] ;
var o = P ( this , ( i = Object . getPrototypeOf ( n ) ) . call . apply ( i , [ this ] . concat ( a ) ) ) ;
return o . node = t , o . selection = e . select ( o . node ) , o
}
return j ( n , t ) , A ( n , [ { key : "getNode" , value : function ( ) { return this . node } } , { key : "getSelection" , value : function ( ) { return this . selection } } ] ) , n
} ( at ) ,
ht = function ( t ) {
function e ( ) {
var t ;
E ( this , e ) ;
for ( var n = arguments . length , i = Array ( n ) , r = 0 ; n > r ; r ++ ) i [ r ] = arguments [ r ] ;
return P ( this , ( t = Object . getPrototypeOf ( e ) ) . call . apply ( t , [ this , document . createElement ( "canvas" ) ] . concat ( i ) ) )
}
return j ( e , t ) , A ( e , [ {
key : "getContext2d" ,
value : function ( ) {
var t = ( this . width ( ) , this . height ( ) , this . pixelRatio ( ) ) ,
e = this . margin ( ) ,
n = e . top ,
i = e . left ,
r = this . offset ( ) ,
a = W ( r , 2 ) ,
s = a [ 0 ] ,
o = a [ 1 ] ,
h = this . node . getContext ( "2d" ) ;
return h . setTransform ( 1 , 0 , 0 , 1 , 0 , 0 ) , h . scale ( t , t ) , h . translate ( i + s , n + o ) , h
}
} , {
key : "clear" ,
value : function ( ) {
var t = this . width ( ) ,
e = this . height ( ) ,
n = this . pixelRatio ( ) ,
i = this . node . getContext ( "2d" ) ;
return i . setTransform ( 1 , 0 , 0 , 1 , 0 , 0 ) , i . scale ( n , n ) , i . clearRect ( 0 , 0 , t , e ) , this
}
} , {
key : "_updateDimension" ,
value : function ( ) {
var t = this . width ( ) ,
e = this . height ( ) ,
n = this . pixelRatio ( ) ;
return this . node . setAttribute ( "width" , t * n ) , this . node . setAttribute ( "height" , e * n ) , this . node . style . width = t + "px" , this . node . style . height = e + "px" , this
}
} ] ) , e
} ( ot ) ,
ut = function ( t ) {
function e ( t ) {
var n ;
E ( this , e ) ;
for ( var i = arguments . length , r = Array ( i > 1 ? i - 1 : 0 ) , a = 1 ; i > a ; a ++ ) r [ a - 1 ] = arguments [ a ] ;
var s = P ( this , ( n = Object . getPrototypeOf ( e ) ) . call . apply ( n , [ this , t ] . concat ( r ) ) ) ;
return s . addPlate ( "canvas" , new ht ) , s . canvas = s . plates . canvas . getSelection ( ) , s . updateDimensionNow ( ) , s
}
return j ( e , t ) , A ( e , [ { key : "getContext2d" , value : function ( ) { return this . plates . canvas . getContext2d ( ) } } , { key : "clear" , value : function ( ) { return this . plates . canvas . clear ( ) , this } } ] ) , e
} ( st ) ,
lt = function ( t ) {
function e ( ) {
var t ;
E ( this , e ) ;
for ( var n = arguments . length , i = Array ( n ) , r = 0 ; n > r ; r ++ ) i [ r ] = arguments [ r ] ;
var a = P ( this , ( t = Object . getPrototypeOf ( e ) ) . call . apply ( t , [ this , document . createElementNS ( "http://www.w3.org/2000/svg" , "svg" ) ] . concat ( i ) ) ) ;
return a . rootG = a . selection . append ( "g" ) , a . layers = new D ( a . rootG ) , a
}
return j ( e , t ) , A ( e , [ {
key : "_updateDimension" ,
value : function ( ) {
var t = this . width ( ) ,
e = this . height ( ) ,
n = this . margin ( ) ,
i = n . top ,
r = n . left ,
a = this . offset ( ) ,
s = W ( a , 2 ) ,
o = s [ 0 ] ,
h = s [ 1 ] ;
return this . selection . attr ( "width" , t ) . attr ( "height" , e ) , this . rootG . attr ( "transform" , "translate(" + ( r + o ) + "," + ( i + h ) + ")" ) , this
}
} ] ) , e
} ( ot ) ,
ct = function ( t ) {
function e ( t ) {
var n ;
E ( this , e ) ;
for ( var i = arguments . length , r = Array ( i > 1 ? i - 1 : 0 ) , a = 1 ; i > a ; a ++ ) r [ a - 1 ] = arguments [ a ] ;
var s = P ( this , ( n = Object . getPrototypeOf ( e ) ) . call . apply ( n , [ this , t ] . concat ( r ) ) ) ;
s . addPlate ( "svg" , new lt ) ;
var o = s . plates . svg ;
return s . svg = o . getSelection ( ) , s . rootG = o . rootG , s . layers = o . layers , s . updateDimensionNow ( ) , s
}
return j ( e , t ) , e
} ( ut ) ,
ft = function ( t ) {
function e ( t ) {
var n ;
E ( this , e ) ;
for ( var i = arguments . length , r = Array ( i > 1 ? i - 1 : 0 ) , a = 1 ; i > a ; a ++ ) r [ a - 1 ] = arguments [ a ] ;
var s = P ( this , ( n = Object . getPrototypeOf ( e ) ) . call . apply ( n , [ this , t ] . concat ( r ) ) ) ;
s . addPlate ( "svg" , new lt ) ;
var o = s . plates . svg ;
return s . svg = o . getSelection ( ) , s . rootG = o . rootG , s . layers = o . layers , s . updateDimensionNow ( ) , s
}
return j ( e , t ) , e
} ( st ) ,
dt = function ( t ) {
function e ( ) {
var t ;
E ( this , e ) ;
for ( var n = arguments . length , i = Array ( n ) , r = 0 ; n > r ; r ++ ) i [ r ] = arguments [ r ] ;
return P ( this , ( t = Object . getPrototypeOf ( e ) ) . call . apply ( t , [ this , document . createElement ( "div" ) ] . concat ( i ) ) )
}
return j ( e , t ) , A ( e , [ {
key : "_updateDimension" ,
value : function ( ) {
var t = this . width ( ) ,
e = this . height ( ) ,
n = this . margin ( ) ;
return this . node . style . width = t - n . left - n . right + "px" , this . node . style . height = e - n . top - n . bottom + "px" , this . node . style . marginLeft = n . left + "px" , this . node . style . marginRight = n . right + "px" , this . node . style . marginTop = n . top + "px" , this . node . style . marginBottom = n . bottom + "px" , this
}
} ] ) , e
} ( ot ) ;
t . helper = tt , t . AbstractChart = st , t . CanvasChart = ut , t . HybridChart = ct , t . SvgChart = ft , t . AbstractPlate = ot , t . CanvasPlate = ht , t . DivPlate = dt , t . SvgPlate = lt , t . LayerOrganizer = D , Object . defineProperty ( t , "__esModule" , { value : ! 0 } )
} ) ;
/* WEBPACK VAR INJECTION */
} . call ( exports , _ _webpack _require _ _ ( 46 ) ) )
/***/
} ) ,
/* 137 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
var _ _WEBPACK _AMD _DEFINE _FACTORY _ _ , _ _WEBPACK _AMD _DEFINE _ARRAY _ _ , _ _WEBPACK _AMD _DEFINE _RESULT _ _ ; // Generated by CoffeeScript 1.8.0
( function ( ) {
var Heap , defaultCmp , floor , heapify , heappop , heappush , heappushpop , heapreplace , insort , min , nlargest , nsmallest , updateItem , _siftdown , _siftup ;
floor = Math . floor , min = Math . min ;
/ *
Default comparison function to be used
* /
defaultCmp = function ( x , y ) {
if ( x < y ) {
return - 1 ;
}
if ( x > y ) {
return 1 ;
}
return 0 ;
} ;
/ *
Insert item x in list a , and keep it sorted assuming a is sorted .
If x is already in a , insert it to the right of the rightmost x .
Optional args lo ( default 0 ) and hi ( default a . length ) bound the slice
of a to be searched .
* /
insort = function ( a , x , lo , hi , cmp ) {
var mid ;
if ( lo == null ) {
lo = 0 ;
}
if ( cmp == null ) {
cmp = defaultCmp ;
}
if ( lo < 0 ) {
throw new Error ( 'lo must be non-negative' ) ;
}
if ( hi == null ) {
hi = a . length ;
}
while ( lo < hi ) {
mid = floor ( ( lo + hi ) / 2 ) ;
if ( cmp ( x , a [ mid ] ) < 0 ) {
hi = mid ;
} else {
lo = mid + 1 ;
}
}
return ( [ ] . splice . apply ( a , [ lo , lo - lo ] . concat ( x ) ) , x ) ;
} ;
/ *
Push item onto heap , maintaining the heap invariant .
* /
heappush = function ( array , item , cmp ) {
if ( cmp == null ) {
cmp = defaultCmp ;
}
array . push ( item ) ;
return _siftdown ( array , 0 , array . length - 1 , cmp ) ;
} ;
/ *
Pop the smallest item off the heap , maintaining the heap invariant .
* /
heappop = function ( array , cmp ) {
var lastelt , returnitem ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
lastelt = array . pop ( ) ;
if ( array . length ) {
returnitem = array [ 0 ] ;
array [ 0 ] = lastelt ;
_siftup ( array , 0 , cmp ) ;
} else {
returnitem = lastelt ;
}
return returnitem ;
} ;
/ *
Pop and return the current smallest value , and add the new item .
This is more efficient than heappop ( ) followed by heappush ( ) , and can be
more appropriate when using a fixed size heap . Note that the value
returned may be larger than item ! That constrains reasonable use of
this routine unless written as part of a conditional replacement :
if item > array [ 0 ]
item = heapreplace ( array , item )
* /
heapreplace = function ( array , item , cmp ) {
var returnitem ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
returnitem = array [ 0 ] ;
array [ 0 ] = item ;
_siftup ( array , 0 , cmp ) ;
return returnitem ;
} ;
/ *
Fast version of a heappush followed by a heappop .
* /
heappushpop = function ( array , item , cmp ) {
var _ref ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
if ( array . length && cmp ( array [ 0 ] , item ) < 0 ) {
_ref = [ array [ 0 ] , item ] , item = _ref [ 0 ] , array [ 0 ] = _ref [ 1 ] ;
_siftup ( array , 0 , cmp ) ;
}
return item ;
} ;
/ *
Transform list into a heap , in - place , in O ( array . length ) time .
* /
heapify = function ( array , cmp ) {
var i , _i , _j , _len , _ref , _ref1 , _results , _results1 ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
_ref1 = ( function ( ) {
_results1 = [ ] ;
for ( var _j = 0 , _ref = floor ( array . length / 2 ) ; 0 <= _ref ? _j < _ref : _j > _ref ; 0 <= _ref ? _j ++ : _j -- ) { _results1 . push ( _j ) ; }
return _results1 ;
} ) . apply ( this ) . reverse ( ) ;
_results = [ ] ;
for ( _i = 0 , _len = _ref1 . length ; _i < _len ; _i ++ ) {
i = _ref1 [ _i ] ;
_results . push ( _siftup ( array , i , cmp ) ) ;
}
return _results ;
} ;
/ *
Update the position of the given item in the heap .
This function should be called every time the item is being modified .
* /
updateItem = function ( array , item , cmp ) {
var pos ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
pos = array . indexOf ( item ) ;
if ( pos === - 1 ) {
return ;
}
_siftdown ( array , 0 , pos , cmp ) ;
return _siftup ( array , pos , cmp ) ;
} ;
/ *
Find the n largest elements in a dataset .
* /
nlargest = function ( array , n , cmp ) {
var elem , result , _i , _len , _ref ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
result = array . slice ( 0 , n ) ;
if ( ! result . length ) {
return result ;
}
heapify ( result , cmp ) ;
_ref = array . slice ( n ) ;
for ( _i = 0 , _len = _ref . length ; _i < _len ; _i ++ ) {
elem = _ref [ _i ] ;
heappushpop ( result , elem , cmp ) ;
}
return result . sort ( cmp ) . reverse ( ) ;
} ;
/ *
Find the n smallest elements in a dataset .
* /
nsmallest = function ( array , n , cmp ) {
var elem , i , los , result , _i , _j , _len , _ref , _ref1 , _results ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
if ( n * 10 <= array . length ) {
result = array . slice ( 0 , n ) . sort ( cmp ) ;
if ( ! result . length ) {
return result ;
}
los = result [ result . length - 1 ] ;
_ref = array . slice ( n ) ;
for ( _i = 0 , _len = _ref . length ; _i < _len ; _i ++ ) {
elem = _ref [ _i ] ;
if ( cmp ( elem , los ) < 0 ) {
insort ( result , elem , 0 , null , cmp ) ;
result . pop ( ) ;
los = result [ result . length - 1 ] ;
}
}
return result ;
}
heapify ( array , cmp ) ;
_results = [ ] ;
for ( i = _j = 0 , _ref1 = min ( n , array . length ) ; 0 <= _ref1 ? _j < _ref1 : _j > _ref1 ; i = 0 <= _ref1 ? ++ _j : -- _j ) {
_results . push ( heappop ( array , cmp ) ) ;
}
return _results ;
} ;
_siftdown = function ( array , startpos , pos , cmp ) {
var newitem , parent , parentpos ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
newitem = array [ pos ] ;
while ( pos > startpos ) {
parentpos = ( pos - 1 ) >> 1 ;
parent = array [ parentpos ] ;
if ( cmp ( newitem , parent ) < 0 ) {
array [ pos ] = parent ;
pos = parentpos ;
continue ;
}
break ;
}
return array [ pos ] = newitem ;
} ;
_siftup = function ( array , pos , cmp ) {
var childpos , endpos , newitem , rightpos , startpos ;
if ( cmp == null ) {
cmp = defaultCmp ;
}
endpos = array . length ;
startpos = pos ;
newitem = array [ pos ] ;
childpos = 2 * pos + 1 ;
while ( childpos < endpos ) {
rightpos = childpos + 1 ;
if ( rightpos < endpos && ! ( cmp ( array [ childpos ] , array [ rightpos ] ) < 0 ) ) {
childpos = rightpos ;
}
array [ pos ] = array [ childpos ] ;
pos = childpos ;
childpos = 2 * pos + 1 ;
}
array [ pos ] = newitem ;
return _siftdown ( array , startpos , pos , cmp ) ;
} ;
Heap = ( function ( ) {
Heap . push = heappush ;
Heap . pop = heappop ;
Heap . replace = heapreplace ;
Heap . pushpop = heappushpop ;
Heap . heapify = heapify ;
Heap . updateItem = updateItem ;
Heap . nlargest = nlargest ;
Heap . nsmallest = nsmallest ;
function Heap ( cmp ) {
this . cmp = cmp != null ? cmp : defaultCmp ;
this . nodes = [ ] ;
}
Heap . prototype . push = function ( x ) {
return heappush ( this . nodes , x , this . cmp ) ;
} ;
Heap . prototype . pop = function ( ) {
return heappop ( this . nodes , this . cmp ) ;
} ;
Heap . prototype . peek = function ( ) {
return this . nodes [ 0 ] ;
} ;
Heap . prototype . contains = function ( x ) {
return this . nodes . indexOf ( x ) !== - 1 ;
} ;
Heap . prototype . replace = function ( x ) {
return heapreplace ( this . nodes , x , this . cmp ) ;
} ;
Heap . prototype . pushpop = function ( x ) {
return heappushpop ( this . nodes , x , this . cmp ) ;
} ;
Heap . prototype . heapify = function ( ) {
return heapify ( this . nodes , this . cmp ) ;
} ;
Heap . prototype . updateItem = function ( x ) {
return updateItem ( this . nodes , x , this . cmp ) ;
} ;
Heap . prototype . clear = function ( ) {
return this . nodes = [ ] ;
} ;
Heap . prototype . empty = function ( ) {
return this . nodes . length === 0 ;
} ;
Heap . prototype . size = function ( ) {
return this . nodes . length ;
} ;
Heap . prototype . clone = function ( ) {
var heap ;
heap = new Heap ( ) ;
heap . nodes = this . nodes . slice ( 0 ) ;
return heap ;
} ;
Heap . prototype . toArray = function ( ) {
return this . nodes . slice ( 0 ) ;
} ;
Heap . prototype . insert = Heap . prototype . push ;
Heap . prototype . top = Heap . prototype . peek ;
Heap . prototype . front = Heap . prototype . peek ;
Heap . prototype . has = Heap . prototype . contains ;
Heap . prototype . copy = Heap . prototype . clone ;
return Heap ;
} ) ( ) ;
( function ( root , factory ) {
if ( true ) {
return ! ( _ _WEBPACK _AMD _DEFINE _ARRAY _ _ = [ ] , _ _WEBPACK _AMD _DEFINE _FACTORY _ _ = ( factory ) ,
_ _WEBPACK _AMD _DEFINE _RESULT _ _ = ( typeof _ _WEBPACK _AMD _DEFINE _FACTORY _ _ === 'function' ?
( _ _WEBPACK _AMD _DEFINE _FACTORY _ _ . apply ( exports , _ _WEBPACK _AMD _DEFINE _ARRAY _ _ ) ) : _ _WEBPACK _AMD _DEFINE _FACTORY _ _ ) ,
_ _WEBPACK _AMD _DEFINE _RESULT _ _ !== undefined && ( module . exports = _ _WEBPACK _AMD _DEFINE _RESULT _ _ ) ) ;
} else if ( typeof exports === 'object' ) {
return module . exports = factory ( ) ;
} else {
return root . Heap = factory ( ) ;
}
} ) ( this , function ( ) {
return Heap ;
} ) ;
} ) . call ( this ) ;
/***/
} ) ,
/* 138 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
var require ;
var require ;
( function ( f ) {
if ( true ) { module . exports = f ( ) } else if ( typeof define === "function" && define . amd ) { define ( [ ] , f ) } else {
var g ;
if ( typeof window !== "undefined" ) { g = window } else if ( typeof global !== "undefined" ) { g = global } else if ( typeof self !== "undefined" ) { g = self } else { g = this }
g . cola = f ( )
}
} ) ( function ( ) {
var define , module , exports ;
return ( function e ( t , n , r ) {
function s ( o , u ) {
if ( ! n [ o ] ) {
if ( ! t [ o ] ) { var a = typeof require == "function" && require ; if ( ! u && a ) return require ( o , ! 0 ) ; if ( i ) return i ( o , ! 0 ) ; var f = new Error ( "Cannot find module '" + o + "'" ) ; throw f . code = "MODULE_NOT_FOUND" , f }
var l = n [ o ] = { exports : { } } ;
t [ o ] [ 0 ] . call ( l . exports , function ( e ) { var n = t [ o ] [ 1 ] [ e ] ; return s ( n ? n : e ) } , l , l . exports , e , t , n , r )
}
return n [ o ] . exports
}
var i = typeof require == "function" && require ;
for ( var o = 0 ; o < r . length ; o ++ ) s ( r [ o ] ) ;
return s
} ) ( {
1 : [ function ( require , module , exports ) {
"use strict" ;
function _ _export ( m ) {
for ( var p in m )
if ( ! exports . hasOwnProperty ( p ) ) exports [ p ] = m [ p ] ;
}
_ _export ( require ( "./src/adaptor" ) ) ;
_ _export ( require ( "./src/d3adaptor" ) ) ;
_ _export ( require ( "./src/descent" ) ) ;
_ _export ( require ( "./src/geom" ) ) ;
_ _export ( require ( "./src/gridrouter" ) ) ;
_ _export ( require ( "./src/handledisconnected" ) ) ;
_ _export ( require ( "./src/layout" ) ) ;
_ _export ( require ( "./src/layout3d" ) ) ;
_ _export ( require ( "./src/linklengths" ) ) ;
_ _export ( require ( "./src/powergraph" ) ) ;
_ _export ( require ( "./src/pqueue" ) ) ;
_ _export ( require ( "./src/rbtree" ) ) ;
_ _export ( require ( "./src/rectangle" ) ) ;
_ _export ( require ( "./src/shortestpaths" ) ) ;
_ _export ( require ( "./src/vpsc" ) ) ;
} , { "./src/adaptor" : 2 , "./src/d3adaptor" : 3 , "./src/descent" : 6 , "./src/geom" : 7 , "./src/gridrouter" : 8 , "./src/handledisconnected" : 9 , "./src/layout" : 10 , "./src/layout3d" : 11 , "./src/linklengths" : 12 , "./src/powergraph" : 13 , "./src/pqueue" : 14 , "./src/rbtree" : 15 , "./src/rectangle" : 16 , "./src/shortestpaths" : 17 , "./src/vpsc" : 18 } ] ,
2 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var layout _1 = require ( "./layout" ) ;
var LayoutAdaptor = ( function ( _super ) {
_ _extends ( LayoutAdaptor , _super ) ;
function LayoutAdaptor ( options ) {
var _this = _super . call ( this ) || this ;
var self = _this ;
var o = options ;
if ( o . trigger ) {
_this . trigger = o . trigger ;
}
if ( o . kick ) {
_this . kick = o . kick ;
}
if ( o . drag ) {
_this . drag = o . drag ;
}
if ( o . on ) {
_this . on = o . on ;
}
_this . dragstart = _this . dragStart = layout _1 . Layout . dragStart ;
_this . dragend = _this . dragEnd = layout _1 . Layout . dragEnd ;
return _this ;
}
LayoutAdaptor . prototype . trigger = function ( e ) { } ; ;
LayoutAdaptor . prototype . kick = function ( ) { } ; ;
LayoutAdaptor . prototype . drag = function ( ) { } ; ;
LayoutAdaptor . prototype . on = function ( eventType , listener ) { return this ; } ; ;
return LayoutAdaptor ;
} ( layout _1 . Layout ) ) ;
exports . LayoutAdaptor = LayoutAdaptor ;
function adaptor ( options ) {
return new LayoutAdaptor ( options ) ;
}
exports . adaptor = adaptor ;
} , { "./layout" : 10 } ] ,
3 : [ function ( require , module , exports ) {
"use strict" ;
var d3v3 = require ( "./d3v3adaptor" ) ;
var d3v4 = require ( "./d3v4adaptor" ) ; ;
function d3adaptor ( d3Context ) {
if ( ! d3Context || isD3V3 ( d3Context ) ) {
return new d3v3 . D3StyleLayoutAdaptor ( ) ;
}
return new d3v4 . D3StyleLayoutAdaptor ( d3Context ) ;
}
exports . d3adaptor = d3adaptor ;
function isD3V3 ( d3Context ) {
var v3exp = /^3\./ ;
return d3Context . version && d3Context . version . match ( v3exp ) !== null ;
}
} , { "./d3v3adaptor" : 4 , "./d3v4adaptor" : 5 } ] ,
4 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var layout _1 = require ( "./layout" ) ;
var D3StyleLayoutAdaptor = ( function ( _super ) {
_ _extends ( D3StyleLayoutAdaptor , _super ) ;
function D3StyleLayoutAdaptor ( ) {
var _this = _super . call ( this ) || this ;
_this . event = d3 . dispatch ( layout _1 . EventType [ layout _1 . EventType . start ] , layout _1 . EventType [ layout _1 . EventType . tick ] , layout _1 . EventType [ layout _1 . EventType . end ] ) ;
var d3layout = _this ;
var drag ;
_this . drag = function ( ) {
if ( ! drag ) {
var drag = d3 . behavior . drag ( )
. origin ( layout _1 . Layout . dragOrigin )
. on ( "dragstart.d3adaptor" , layout _1 . Layout . dragStart )
. on ( "drag.d3adaptor" , function ( d ) {
layout _1 . Layout . drag ( d , d3 . event ) ;
d3layout . resume ( ) ;
} )
. on ( "dragend.d3adaptor" , layout _1 . Layout . dragEnd ) ;
}
if ( ! arguments . length )
return drag ;
this
. call ( drag ) ;
} ;
return _this ;
}
D3StyleLayoutAdaptor . prototype . trigger = function ( e ) {
var d3event = { type : layout _1 . EventType [ e . type ] , alpha : e . alpha , stress : e . stress } ;
this . event [ d3event . type ] ( d3event ) ;
} ;
D3StyleLayoutAdaptor . prototype . kick = function ( ) {
var _this = this ;
d3 . timer ( function ( ) { return _super . prototype . tick . call ( _this ) ; } ) ;
} ;
D3StyleLayoutAdaptor . prototype . on = function ( eventType , listener ) {
if ( typeof eventType === 'string' ) {
this . event . on ( eventType , listener ) ;
} else {
this . event . on ( layout _1 . EventType [ eventType ] , listener ) ;
}
return this ;
} ;
return D3StyleLayoutAdaptor ;
} ( layout _1 . Layout ) ) ;
exports . D3StyleLayoutAdaptor = D3StyleLayoutAdaptor ;
function d3adaptor ( ) {
return new D3StyleLayoutAdaptor ( ) ;
}
exports . d3adaptor = d3adaptor ;
} , { "./layout" : 10 } ] ,
5 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var layout _1 = require ( "./layout" ) ;
var D3StyleLayoutAdaptor = ( function ( _super ) {
_ _extends ( D3StyleLayoutAdaptor , _super ) ;
function D3StyleLayoutAdaptor ( d3Context ) {
var _this = _super . call ( this ) || this ;
_this . d3Context = d3Context ;
_this . event = d3Context . dispatch ( layout _1 . EventType [ layout _1 . EventType . start ] , layout _1 . EventType [ layout _1 . EventType . tick ] , layout _1 . EventType [ layout _1 . EventType . end ] ) ;
var d3layout = _this ;
var drag ;
_this . drag = function ( ) {
if ( ! drag ) {
var drag = d3Context . drag ( )
. subject ( layout _1 . Layout . dragOrigin )
. on ( "start.d3adaptor" , layout _1 . Layout . dragStart )
. on ( "drag.d3adaptor" , function ( d ) {
layout _1 . Layout . drag ( d , d3Context . event ) ;
d3layout . resume ( ) ;
} )
. on ( "end.d3adaptor" , layout _1 . Layout . dragEnd ) ;
}
if ( ! arguments . length )
return drag ;
arguments [ 0 ] . call ( drag ) ;
} ;
return _this ;
}
D3StyleLayoutAdaptor . prototype . trigger = function ( e ) {
var d3event = { type : layout _1 . EventType [ e . type ] , alpha : e . alpha , stress : e . stress } ;
this . event . call ( d3event . type , d3event ) ;
} ;
D3StyleLayoutAdaptor . prototype . kick = function ( ) {
var _this = this ;
this . d3Context . timer ( function ( ) { return _super . prototype . tick . call ( _this ) ; } ) ;
} ;
D3StyleLayoutAdaptor . prototype . on = function ( eventType , listener ) {
if ( typeof eventType === 'string' ) {
this . event . on ( eventType , listener ) ;
} else {
this . event . on ( layout _1 . EventType [ eventType ] , listener ) ;
}
return this ;
} ;
return D3StyleLayoutAdaptor ;
} ( layout _1 . Layout ) ) ;
exports . D3StyleLayoutAdaptor = D3StyleLayoutAdaptor ;
} , { "./layout" : 10 } ] ,
6 : [ function ( require , module , exports ) {
"use strict" ;
var Locks = ( function ( ) {
function Locks ( ) {
this . locks = { } ;
}
Locks . prototype . add = function ( id , x ) {
this . locks [ id ] = x ;
} ;
Locks . prototype . clear = function ( ) {
this . locks = { } ;
} ;
Locks . prototype . isEmpty = function ( ) {
for ( var l in this . locks )
return false ;
return true ;
} ;
Locks . prototype . apply = function ( f ) {
for ( var l in this . locks ) {
f ( Number ( l ) , this . locks [ l ] ) ;
}
} ;
return Locks ;
} ( ) ) ;
exports . Locks = Locks ;
var Descent = ( function ( ) {
function Descent ( x , D , G ) {
if ( G === void 0 ) { G = null ; }
this . D = D ;
this . G = G ;
this . threshold = 0.0001 ;
this . numGridSnapNodes = 0 ;
this . snapGridSize = 100 ;
this . snapStrength = 1000 ;
this . scaleSnapByMaxH = false ;
this . random = new PseudoRandom ( ) ;
this . project = null ;
this . x = x ;
this . k = x . length ;
var n = this . n = x [ 0 ] . length ;
this . H = new Array ( this . k ) ;
this . g = new Array ( this . k ) ;
this . Hd = new Array ( this . k ) ;
this . a = new Array ( this . k ) ;
this . b = new Array ( this . k ) ;
this . c = new Array ( this . k ) ;
this . d = new Array ( this . k ) ;
this . e = new Array ( this . k ) ;
this . ia = new Array ( this . k ) ;
this . ib = new Array ( this . k ) ;
this . xtmp = new Array ( this . k ) ;
this . locks = new Locks ( ) ;
this . minD = Number . MAX _VALUE ;
var i = n ,
j ;
while ( i -- ) {
j = n ;
while ( -- j > i ) {
var d = D [ i ] [ j ] ;
if ( d > 0 && d < this . minD ) {
this . minD = d ;
}
}
}
if ( this . minD === Number . MAX _VALUE )
this . minD = 1 ;
i = this . k ;
while ( i -- ) {
this . g [ i ] = new Array ( n ) ;
this . H [ i ] = new Array ( n ) ;
j = n ;
while ( j -- ) {
this . H [ i ] [ j ] = new Array ( n ) ;
}
this . Hd [ i ] = new Array ( n ) ;
this . a [ i ] = new Array ( n ) ;
this . b [ i ] = new Array ( n ) ;
this . c [ i ] = new Array ( n ) ;
this . d [ i ] = new Array ( n ) ;
this . e [ i ] = new Array ( n ) ;
this . ia [ i ] = new Array ( n ) ;
this . ib [ i ] = new Array ( n ) ;
this . xtmp [ i ] = new Array ( n ) ;
}
}
Descent . createSquareMatrix = function ( n , f ) {
var M = new Array ( n ) ;
for ( var i = 0 ; i < n ; ++ i ) {
M [ i ] = new Array ( n ) ;
for ( var j = 0 ; j < n ; ++ j ) {
M [ i ] [ j ] = f ( i , j ) ;
}
}
return M ;
} ;
Descent . prototype . offsetDir = function ( ) {
var _this = this ;
var u = new Array ( this . k ) ;
var l = 0 ;
for ( var i = 0 ; i < this . k ; ++ i ) {
var x = u [ i ] = this . random . getNextBetween ( 0.01 , 1 ) - 0.5 ;
l += x * x ;
}
l = Math . sqrt ( l ) ;
return u . map ( function ( x ) { return x *= _this . minD / l ; } ) ;
} ;
Descent . prototype . computeDerivatives = function ( x ) {
var _this = this ;
var n = this . n ;
if ( n < 1 )
return ;
var i ;
var d = new Array ( this . k ) ;
var d2 = new Array ( this . k ) ;
var Huu = new Array ( this . k ) ;
var maxH = 0 ;
for ( var u = 0 ; u < n ; ++ u ) {
for ( i = 0 ; i < this . k ; ++ i )
Huu [ i ] = this . g [ i ] [ u ] = 0 ;
for ( var v = 0 ; v < n ; ++ v ) {
if ( u === v )
continue ;
var maxDisplaces = n ;
while ( maxDisplaces -- ) {
var sd2 = 0 ;
for ( i = 0 ; i < this . k ; ++ i ) {
var dx = d [ i ] = x [ i ] [ u ] - x [ i ] [ v ] ;
sd2 += d2 [ i ] = dx * dx ;
}
if ( sd2 > 1e-9 )
break ;
var rd = this . offsetDir ( ) ;
for ( i = 0 ; i < this . k ; ++ i )
x [ i ] [ v ] += rd [ i ] ;
}
var l = Math . sqrt ( sd2 ) ;
var D = this . D [ u ] [ v ] ;
var weight = this . G != null ? this . G [ u ] [ v ] : 1 ;
if ( weight > 1 && l > D || ! isFinite ( D ) ) {
for ( i = 0 ; i < this . k ; ++ i )
this . H [ i ] [ u ] [ v ] = 0 ;
continue ;
}
if ( weight > 1 ) {
weight = 1 ;
}
var D2 = D * D ;
var gs = 2 * weight * ( l - D ) / ( D2 * l ) ;
var l3 = l * l * l ;
var hs = 2 * - weight / ( D2 * l3 ) ;
if ( ! isFinite ( gs ) )
console . log ( gs ) ;
for ( i = 0 ; i < this . k ; ++ i ) {
this . g [ i ] [ u ] += d [ i ] * gs ;
Huu [ i ] -= this . H [ i ] [ u ] [ v ] = hs * ( l3 + D * ( d2 [ i ] - sd2 ) + l * sd2 ) ;
}
}
for ( i = 0 ; i < this . k ; ++ i )
maxH = Math . max ( maxH , this . H [ i ] [ u ] [ u ] = Huu [ i ] ) ;
}
var r = this . snapGridSize / 2 ;
var g = this . snapGridSize ;
var w = this . snapStrength ;
var k = w / ( r * r ) ;
var numNodes = this . numGridSnapNodes ;
for ( var u = 0 ; u < numNodes ; ++ u ) {
for ( i = 0 ; i < this . k ; ++ i ) {
var xiu = this . x [ i ] [ u ] ;
var m = xiu / g ;
var f = m % 1 ;
var q = m - f ;
var a = Math . abs ( f ) ;
var dx = ( a <= 0.5 ) ? xiu - q * g :
( xiu > 0 ) ? xiu - ( q + 1 ) * g : xiu - ( q - 1 ) * g ;
if ( - r < dx && dx <= r ) {
if ( this . scaleSnapByMaxH ) {
this . g [ i ] [ u ] += maxH * k * dx ;
this . H [ i ] [ u ] [ u ] += maxH * k ;
} else {
this . g [ i ] [ u ] += k * dx ;
this . H [ i ] [ u ] [ u ] += k ;
}
}
}
}
if ( ! this . locks . isEmpty ( ) ) {
this . locks . apply ( function ( u , p ) {
for ( i = 0 ; i < _this . k ; ++ i ) {
_this . H [ i ] [ u ] [ u ] += maxH ;
_this . g [ i ] [ u ] -= maxH * ( p [ i ] - x [ i ] [ u ] ) ;
}
} ) ;
}
} ;
Descent . dotProd = function ( a , b ) {
var x = 0 ,
i = a . length ;
while ( i -- )
x += a [ i ] * b [ i ] ;
return x ;
} ;
Descent . rightMultiply = function ( m , v , r ) {
var i = m . length ;
while ( i -- )
r [ i ] = Descent . dotProd ( m [ i ] , v ) ;
} ;
Descent . prototype . computeStepSize = function ( d ) {
var numerator = 0 ,
denominator = 0 ;
for ( var i = 0 ; i < this . k ; ++ i ) {
numerator += Descent . dotProd ( this . g [ i ] , d [ i ] ) ;
Descent . rightMultiply ( this . H [ i ] , d [ i ] , this . Hd [ i ] ) ;
denominator += Descent . dotProd ( d [ i ] , this . Hd [ i ] ) ;
}
if ( denominator === 0 || ! isFinite ( denominator ) )
return 0 ;
return 1 * numerator / denominator ;
} ;
Descent . prototype . reduceStress = function ( ) {
this . computeDerivatives ( this . x ) ;
var alpha = this . computeStepSize ( this . g ) ;
for ( var i = 0 ; i < this . k ; ++ i ) {
this . takeDescentStep ( this . x [ i ] , this . g [ i ] , alpha ) ;
}
return this . computeStress ( ) ;
} ;
Descent . copy = function ( a , b ) {
var m = a . length ,
n = b [ 0 ] . length ;
for ( var i = 0 ; i < m ; ++ i ) {
for ( var j = 0 ; j < n ; ++ j ) {
b [ i ] [ j ] = a [ i ] [ j ] ;
}
}
} ;
Descent . prototype . stepAndProject = function ( x0 , r , d , stepSize ) {
Descent . copy ( x0 , r ) ;
this . takeDescentStep ( r [ 0 ] , d [ 0 ] , stepSize ) ;
if ( this . project )
this . project [ 0 ] ( x0 [ 0 ] , x0 [ 1 ] , r [ 0 ] ) ;
this . takeDescentStep ( r [ 1 ] , d [ 1 ] , stepSize ) ;
if ( this . project )
this . project [ 1 ] ( r [ 0 ] , x0 [ 1 ] , r [ 1 ] ) ;
for ( var i = 2 ; i < this . k ; i ++ )
this . takeDescentStep ( r [ i ] , d [ i ] , stepSize ) ;
} ;
Descent . mApply = function ( m , n , f ) {
var i = m ;
while ( i -- > 0 ) {
var j = n ;
while ( j -- > 0 )
f ( i , j ) ;
}
} ;
Descent . prototype . matrixApply = function ( f ) {
Descent . mApply ( this . k , this . n , f ) ;
} ;
Descent . prototype . computeNextPosition = function ( x0 , r ) {
var _this = this ;
this . computeDerivatives ( x0 ) ;
var alpha = this . computeStepSize ( this . g ) ;
this . stepAndProject ( x0 , r , this . g , alpha ) ;
if ( this . project ) {
this . matrixApply ( function ( i , j ) { return _this . e [ i ] [ j ] = x0 [ i ] [ j ] - r [ i ] [ j ] ; } ) ;
var beta = this . computeStepSize ( this . e ) ;
beta = Math . max ( 0.2 , Math . min ( beta , 1 ) ) ;
this . stepAndProject ( x0 , r , this . e , beta ) ;
}
} ;
Descent . prototype . run = function ( iterations ) {
var stress = Number . MAX _VALUE ,
converged = false ;
while ( ! converged && iterations -- > 0 ) {
var s = this . rungeKutta ( ) ;
converged = Math . abs ( stress / s - 1 ) < this . threshold ;
stress = s ;
}
return stress ;
} ;
Descent . prototype . rungeKutta = function ( ) {
var _this = this ;
this . computeNextPosition ( this . x , this . a ) ;
Descent . mid ( this . x , this . a , this . ia ) ;
this . computeNextPosition ( this . ia , this . b ) ;
Descent . mid ( this . x , this . b , this . ib ) ;
this . computeNextPosition ( this . ib , this . c ) ;
this . computeNextPosition ( this . c , this . d ) ;
var disp = 0 ;
this . matrixApply ( function ( i , j ) {
var x = ( _this . a [ i ] [ j ] + 2.0 * _this . b [ i ] [ j ] + 2.0 * _this . c [ i ] [ j ] + _this . d [ i ] [ j ] ) / 6.0 ,
d = _this . x [ i ] [ j ] - x ;
disp += d * d ;
_this . x [ i ] [ j ] = x ;
} ) ;
return disp ;
} ;
Descent . mid = function ( a , b , m ) {
Descent . mApply ( a . length , a [ 0 ] . length , function ( i , j ) {
return m [ i ] [ j ] = a [ i ] [ j ] + ( b [ i ] [ j ] - a [ i ] [ j ] ) / 2.0 ;
} ) ;
} ;
Descent . prototype . takeDescentStep = function ( x , d , stepSize ) {
for ( var i = 0 ; i < this . n ; ++ i ) {
x [ i ] = x [ i ] - stepSize * d [ i ] ;
}
} ;
Descent . prototype . computeStress = function ( ) {
var stress = 0 ;
for ( var u = 0 , nMinus1 = this . n - 1 ; u < nMinus1 ; ++ u ) {
for ( var v = u + 1 , n = this . n ; v < n ; ++ v ) {
var l = 0 ;
for ( var i = 0 ; i < this . k ; ++ i ) {
var dx = this . x [ i ] [ u ] - this . x [ i ] [ v ] ;
l += dx * dx ;
}
l = Math . sqrt ( l ) ;
var d = this . D [ u ] [ v ] ;
if ( ! isFinite ( d ) )
continue ;
var rl = d - l ;
var d2 = d * d ;
stress += rl * rl / d2 ;
}
}
return stress ;
} ;
return Descent ;
} ( ) ) ;
Descent . zeroDistance = 1e-10 ;
exports . Descent = Descent ;
var PseudoRandom = ( function ( ) {
function PseudoRandom ( seed ) {
if ( seed === void 0 ) { seed = 1 ; }
this . seed = seed ;
this . a = 214013 ;
this . c = 2531011 ;
this . m = 2147483648 ;
this . range = 32767 ;
}
PseudoRandom . prototype . getNext = function ( ) {
this . seed = ( this . seed * this . a + this . c ) % this . m ;
return ( this . seed >> 16 ) / this . range ;
} ;
PseudoRandom . prototype . getNextBetween = function ( min , max ) {
return min + this . getNext ( ) * ( max - min ) ;
} ;
return PseudoRandom ;
} ( ) ) ;
exports . PseudoRandom = PseudoRandom ;
} , { } ] ,
7 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var rectangle _1 = require ( "./rectangle" ) ;
var Point = ( function ( ) {
function Point ( ) { }
return Point ;
} ( ) ) ;
exports . Point = Point ;
var LineSegment = ( function ( ) {
function LineSegment ( x1 , y1 , x2 , y2 ) {
this . x1 = x1 ;
this . y1 = y1 ;
this . x2 = x2 ;
this . y2 = y2 ;
}
return LineSegment ;
} ( ) ) ;
exports . LineSegment = LineSegment ;
var PolyPoint = ( function ( _super ) {
_ _extends ( PolyPoint , _super ) ;
function PolyPoint ( ) {
return _super . apply ( this , arguments ) || this ;
}
return PolyPoint ;
} ( Point ) ) ;
exports . PolyPoint = PolyPoint ;
function isLeft ( P0 , P1 , P2 ) {
return ( P1 . x - P0 . x ) * ( P2 . y - P0 . y ) - ( P2 . x - P0 . x ) * ( P1 . y - P0 . y ) ;
}
exports . isLeft = isLeft ;
function above ( p , vi , vj ) {
return isLeft ( p , vi , vj ) > 0 ;
}
function below ( p , vi , vj ) {
return isLeft ( p , vi , vj ) < 0 ;
}
function ConvexHull ( S ) {
var P = S . slice ( 0 ) . sort ( function ( a , b ) { return a . x !== b . x ? b . x - a . x : b . y - a . y ; } ) ;
var n = S . length ,
i ;
var minmin = 0 ;
var xmin = P [ 0 ] . x ;
for ( i = 1 ; i < n ; ++ i ) {
if ( P [ i ] . x !== xmin )
break ;
}
var minmax = i - 1 ;
var H = [ ] ;
H . push ( P [ minmin ] ) ;
if ( minmax === n - 1 ) {
if ( P [ minmax ] . y !== P [ minmin ] . y )
H . push ( P [ minmax ] ) ;
} else {
var maxmin , maxmax = n - 1 ;
var xmax = P [ n - 1 ] . x ;
for ( i = n - 2 ; i >= 0 ; i -- )
if ( P [ i ] . x !== xmax )
break ;
maxmin = i + 1 ;
i = minmax ;
while ( ++ i <= maxmin ) {
if ( isLeft ( P [ minmin ] , P [ maxmin ] , P [ i ] ) >= 0 && i < maxmin )
continue ;
while ( H . length > 1 ) {
if ( isLeft ( H [ H . length - 2 ] , H [ H . length - 1 ] , P [ i ] ) > 0 )
break ;
else
H . length -= 1 ;
}
if ( i != minmin )
H . push ( P [ i ] ) ;
}
if ( maxmax != maxmin )
H . push ( P [ maxmax ] ) ;
var bot = H . length ;
i = maxmin ;
while ( -- i >= minmax ) {
if ( isLeft ( P [ maxmax ] , P [ minmax ] , P [ i ] ) >= 0 && i > minmax )
continue ;
while ( H . length > bot ) {
if ( isLeft ( H [ H . length - 2 ] , H [ H . length - 1 ] , P [ i ] ) > 0 )
break ;
else
H . length -= 1 ;
}
if ( i != minmin )
H . push ( P [ i ] ) ;
}
}
return H ;
}
exports . ConvexHull = ConvexHull ;
function clockwiseRadialSweep ( p , P , f ) {
P . slice ( 0 ) . sort ( function ( a , b ) { return Math . atan2 ( a . y - p . y , a . x - p . x ) - Math . atan2 ( b . y - p . y , b . x - p . x ) ; } ) . forEach ( f ) ;
}
exports . clockwiseRadialSweep = clockwiseRadialSweep ;
function nextPolyPoint ( p , ps ) {
if ( p . polyIndex === ps . length - 1 )
return ps [ 0 ] ;
return ps [ p . polyIndex + 1 ] ;
}
function prevPolyPoint ( p , ps ) {
if ( p . polyIndex === 0 )
return ps [ ps . length - 1 ] ;
return ps [ p . polyIndex - 1 ] ;
}
function tangent _PointPolyC ( P , V ) {
return { rtan : Rtangent _PointPolyC ( P , V ) , ltan : Ltangent _PointPolyC ( P , V ) } ;
}
function Rtangent _PointPolyC ( P , V ) {
var n = V . length - 1 ;
var a , b , c ;
var upA , dnC ;
if ( below ( P , V [ 1 ] , V [ 0 ] ) && ! above ( P , V [ n - 1 ] , V [ 0 ] ) )
return 0 ;
for ( a = 0 , b = n ; ; ) {
if ( b - a === 1 )
if ( above ( P , V [ a ] , V [ b ] ) )
return a ;
else
return b ;
c = Math . floor ( ( a + b ) / 2 ) ;
dnC = below ( P , V [ c + 1 ] , V [ c ] ) ;
if ( dnC && ! above ( P , V [ c - 1 ] , V [ c ] ) )
return c ;
upA = above ( P , V [ a + 1 ] , V [ a ] ) ;
if ( upA ) {
if ( dnC )
b = c ;
else {
if ( above ( P , V [ a ] , V [ c ] ) )
b = c ;
else
a = c ;
}
} else {
if ( ! dnC )
a = c ;
else {
if ( below ( P , V [ a ] , V [ c ] ) )
b = c ;
else
a = c ;
}
}
}
}
function Ltangent _PointPolyC ( P , V ) {
var n = V . length - 1 ;
var a , b , c ;
var dnA , dnC ;
if ( above ( P , V [ n - 1 ] , V [ 0 ] ) && ! below ( P , V [ 1 ] , V [ 0 ] ) )
return 0 ;
for ( a = 0 , b = n ; ; ) {
if ( b - a === 1 )
if ( below ( P , V [ a ] , V [ b ] ) )
return a ;
else
return b ;
c = Math . floor ( ( a + b ) / 2 ) ;
dnC = below ( P , V [ c + 1 ] , V [ c ] ) ;
if ( above ( P , V [ c - 1 ] , V [ c ] ) && ! dnC )
return c ;
dnA = below ( P , V [ a + 1 ] , V [ a ] ) ;
if ( dnA ) {
if ( ! dnC )
b = c ;
else {
if ( below ( P , V [ a ] , V [ c ] ) )
b = c ;
else
a = c ;
}
} else {
if ( dnC )
a = c ;
else {
if ( above ( P , V [ a ] , V [ c ] ) )
b = c ;
else
a = c ;
}
}
}
}
function tangent _PolyPolyC ( V , W , t1 , t2 , cmp1 , cmp2 ) {
var ix1 , ix2 ;
ix1 = t1 ( W [ 0 ] , V ) ;
ix2 = t2 ( V [ ix1 ] , W ) ;
var done = false ;
while ( ! done ) {
done = true ;
while ( true ) {
if ( ix1 === V . length - 1 )
ix1 = 0 ;
if ( cmp1 ( W [ ix2 ] , V [ ix1 ] , V [ ix1 + 1 ] ) )
break ;
++ ix1 ;
}
while ( true ) {
if ( ix2 === 0 )
ix2 = W . length - 1 ;
if ( cmp2 ( V [ ix1 ] , W [ ix2 ] , W [ ix2 - 1 ] ) )
break ;
-- ix2 ;
done = false ;
}
}
return { t1 : ix1 , t2 : ix2 } ;
}
exports . tangent _PolyPolyC = tangent _PolyPolyC ;
function LRtangent _PolyPolyC ( V , W ) {
var rl = RLtangent _PolyPolyC ( W , V ) ;
return { t1 : rl . t2 , t2 : rl . t1 } ;
}
exports . LRtangent _PolyPolyC = LRtangent _PolyPolyC ;
function RLtangent _PolyPolyC ( V , W ) {
return tangent _PolyPolyC ( V , W , Rtangent _PointPolyC , Ltangent _PointPolyC , above , below ) ;
}
exports . RLtangent _PolyPolyC = RLtangent _PolyPolyC ;
function LLtangent _PolyPolyC ( V , W ) {
return tangent _PolyPolyC ( V , W , Ltangent _PointPolyC , Ltangent _PointPolyC , below , below ) ;
}
exports . LLtangent _PolyPolyC = LLtangent _PolyPolyC ;
function RRtangent _PolyPolyC ( V , W ) {
return tangent _PolyPolyC ( V , W , Rtangent _PointPolyC , Rtangent _PointPolyC , above , above ) ;
}
exports . RRtangent _PolyPolyC = RRtangent _PolyPolyC ;
var BiTangent = ( function ( ) {
function BiTangent ( t1 , t2 ) {
this . t1 = t1 ;
this . t2 = t2 ;
}
return BiTangent ;
} ( ) ) ;
exports . BiTangent = BiTangent ;
var BiTangents = ( function ( ) {
function BiTangents ( ) { }
return BiTangents ;
} ( ) ) ;
exports . BiTangents = BiTangents ;
var TVGPoint = ( function ( _super ) {
_ _extends ( TVGPoint , _super ) ;
function TVGPoint ( ) {
return _super . apply ( this , arguments ) || this ;
}
return TVGPoint ;
} ( Point ) ) ;
exports . TVGPoint = TVGPoint ;
var VisibilityVertex = ( function ( ) {
function VisibilityVertex ( id , polyid , polyvertid , p ) {
this . id = id ;
this . polyid = polyid ;
this . polyvertid = polyvertid ;
this . p = p ;
p . vv = this ;
}
return VisibilityVertex ;
} ( ) ) ;
exports . VisibilityVertex = VisibilityVertex ;
var VisibilityEdge = ( function ( ) {
function VisibilityEdge ( source , target ) {
this . source = source ;
this . target = target ;
}
VisibilityEdge . prototype . length = function ( ) {
var dx = this . source . p . x - this . target . p . x ;
var dy = this . source . p . y - this . target . p . y ;
return Math . sqrt ( dx * dx + dy * dy ) ;
} ;
return VisibilityEdge ;
} ( ) ) ;
exports . VisibilityEdge = VisibilityEdge ;
var TangentVisibilityGraph = ( function ( ) {
function TangentVisibilityGraph ( P , g0 ) {
this . P = P ;
this . V = [ ] ;
this . E = [ ] ;
if ( ! g0 ) {
var n = P . length ;
for ( var i = 0 ; i < n ; i ++ ) {
var p = P [ i ] ;
for ( var j = 0 ; j < p . length ; ++ j ) {
var pj = p [ j ] ,
vv = new VisibilityVertex ( this . V . length , i , j , pj ) ;
this . V . push ( vv ) ;
if ( j > 0 )
this . E . push ( new VisibilityEdge ( p [ j - 1 ] . vv , vv ) ) ;
}
}
for ( var i = 0 ; i < n - 1 ; i ++ ) {
var Pi = P [ i ] ;
for ( var j = i + 1 ; j < n ; j ++ ) {
var Pj = P [ j ] ,
t = tangents ( Pi , Pj ) ;
for ( var q in t ) {
var c = t [ q ] ,
source = Pi [ c . t1 ] ,
target = Pj [ c . t2 ] ;
this . addEdgeIfVisible ( source , target , i , j ) ;
}
}
}
} else {
this . V = g0 . V . slice ( 0 ) ;
this . E = g0 . E . slice ( 0 ) ;
}
}
TangentVisibilityGraph . prototype . addEdgeIfVisible = function ( u , v , i1 , i2 ) {
if ( ! this . intersectsPolys ( new LineSegment ( u . x , u . y , v . x , v . y ) , i1 , i2 ) ) {
this . E . push ( new VisibilityEdge ( u . vv , v . vv ) ) ;
}
} ;
TangentVisibilityGraph . prototype . addPoint = function ( p , i1 ) {
var n = this . P . length ;
this . V . push ( new VisibilityVertex ( this . V . length , n , 0 , p ) ) ;
for ( var i = 0 ; i < n ; ++ i ) {
if ( i === i1 )
continue ;
var poly = this . P [ i ] ,
t = tangent _PointPolyC ( p , poly ) ;
this . addEdgeIfVisible ( p , poly [ t . ltan ] , i1 , i ) ;
this . addEdgeIfVisible ( p , poly [ t . rtan ] , i1 , i ) ;
}
return p . vv ;
} ;
TangentVisibilityGraph . prototype . intersectsPolys = function ( l , i1 , i2 ) {
for ( var i = 0 , n = this . P . length ; i < n ; ++ i ) {
if ( i != i1 && i != i2 && intersects ( l , this . P [ i ] ) . length > 0 ) {
return true ;
}
}
return false ;
} ;
return TangentVisibilityGraph ;
} ( ) ) ;
exports . TangentVisibilityGraph = TangentVisibilityGraph ;
function intersects ( l , P ) {
var ints = [ ] ;
for ( var i = 1 , n = P . length ; i < n ; ++ i ) {
var int = rectangle _1 . Rectangle . lineIntersection ( l . x1 , l . y1 , l . x2 , l . y2 , P [ i - 1 ] . x , P [ i - 1 ] . y , P [ i ] . x , P [ i ] . y ) ;
if ( int )
ints . push ( int ) ;
}
return ints ;
}
function tangents ( V , W ) {
var m = V . length - 1 ,
n = W . length - 1 ;
var bt = new BiTangents ( ) ;
for ( var i = 0 ; i < m ; ++ i ) {
for ( var j = 0 ; j < n ; ++ j ) {
var v1 = V [ i == 0 ? m - 1 : i - 1 ] ;
var v2 = V [ i ] ;
var v3 = V [ i + 1 ] ;
var w1 = W [ j == 0 ? n - 1 : j - 1 ] ;
var w2 = W [ j ] ;
var w3 = W [ j + 1 ] ;
var v1v2w2 = isLeft ( v1 , v2 , w2 ) ;
var v2w1w2 = isLeft ( v2 , w1 , w2 ) ;
var v2w2w3 = isLeft ( v2 , w2 , w3 ) ;
var w1w2v2 = isLeft ( w1 , w2 , v2 ) ;
var w2v1v2 = isLeft ( w2 , v1 , v2 ) ;
var w2v2v3 = isLeft ( w2 , v2 , v3 ) ;
if ( v1v2w2 >= 0 && v2w1w2 >= 0 && v2w2w3 < 0 &&
w1w2v2 >= 0 && w2v1v2 >= 0 && w2v2v3 < 0 ) {
bt . ll = new BiTangent ( i , j ) ;
} else if ( v1v2w2 <= 0 && v2w1w2 <= 0 && v2w2w3 > 0 &&
w1w2v2 <= 0 && w2v1v2 <= 0 && w2v2v3 > 0 ) {
bt . rr = new BiTangent ( i , j ) ;
} else if ( v1v2w2 <= 0 && v2w1w2 > 0 && v2w2w3 <= 0 &&
w1w2v2 >= 0 && w2v1v2 < 0 && w2v2v3 >= 0 ) {
bt . rl = new BiTangent ( i , j ) ;
} else if ( v1v2w2 >= 0 && v2w1w2 < 0 && v2w2w3 >= 0 &&
w1w2v2 <= 0 && w2v1v2 > 0 && w2v2v3 <= 0 ) {
bt . lr = new BiTangent ( i , j ) ;
}
}
}
return bt ;
}
exports . tangents = tangents ;
function isPointInsidePoly ( p , poly ) {
for ( var i = 1 , n = poly . length ; i < n ; ++ i )
if ( below ( poly [ i - 1 ] , poly [ i ] , p ) )
return false ;
return true ;
}
function isAnyPInQ ( p , q ) {
return ! p . every ( function ( v ) { return ! isPointInsidePoly ( v , q ) ; } ) ;
}
function polysOverlap ( p , q ) {
if ( isAnyPInQ ( p , q ) )
return true ;
if ( isAnyPInQ ( q , p ) )
return true ;
for ( var i = 1 , n = p . length ; i < n ; ++ i ) {
var v = p [ i ] ,
u = p [ i - 1 ] ;
if ( intersects ( new LineSegment ( u . x , u . y , v . x , v . y ) , q ) . length > 0 )
return true ;
}
return false ;
}
exports . polysOverlap = polysOverlap ;
} , { "./rectangle" : 16 } ] ,
8 : [ function ( require , module , exports ) {
"use strict" ;
var rectangle _1 = require ( "./rectangle" ) ;
var vpsc _1 = require ( "./vpsc" ) ;
var shortestpaths _1 = require ( "./shortestpaths" ) ;
var NodeWrapper = ( function ( ) {
function NodeWrapper ( id , rect , children ) {
this . id = id ;
this . rect = rect ;
this . children = children ;
this . leaf = typeof children === 'undefined' || children . length === 0 ;
}
return NodeWrapper ;
} ( ) ) ;
exports . NodeWrapper = NodeWrapper ;
var Vert = ( function ( ) {
function Vert ( id , x , y , node , line ) {
if ( node === void 0 ) { node = null ; }
if ( line === void 0 ) { line = null ; }
this . id = id ;
this . x = x ;
this . y = y ;
this . node = node ;
this . line = line ;
}
return Vert ;
} ( ) ) ;
exports . Vert = Vert ;
var LongestCommonSubsequence = ( function ( ) {
function LongestCommonSubsequence ( s , t ) {
this . s = s ;
this . t = t ;
var mf = LongestCommonSubsequence . findMatch ( s , t ) ;
var tr = t . slice ( 0 ) . reverse ( ) ;
var mr = LongestCommonSubsequence . findMatch ( s , tr ) ;
if ( mf . length >= mr . length ) {
this . length = mf . length ;
this . si = mf . si ;
this . ti = mf . ti ;
this . reversed = false ;
} else {
this . length = mr . length ;
this . si = mr . si ;
this . ti = t . length - mr . ti - mr . length ;
this . reversed = true ;
}
}
LongestCommonSubsequence . findMatch = function ( s , t ) {
var m = s . length ;
var n = t . length ;
var match = { length : 0 , si : - 1 , ti : - 1 } ;
var l = new Array ( m ) ;
for ( var i = 0 ; i < m ; i ++ ) {
l [ i ] = new Array ( n ) ;
for ( var j = 0 ; j < n ; j ++ )
if ( s [ i ] === t [ j ] ) {
var v = l [ i ] [ j ] = ( i === 0 || j === 0 ) ? 1 : l [ i - 1 ] [ j - 1 ] + 1 ;
if ( v > match . length ) {
match . length = v ;
match . si = i - v + 1 ;
match . ti = j - v + 1 ;
} ;
} else
l [ i ] [ j ] = 0 ;
}
return match ;
} ;
LongestCommonSubsequence . prototype . getSequence = function ( ) {
return this . length >= 0 ? this . s . slice ( this . si , this . si + this . length ) : [ ] ;
} ;
return LongestCommonSubsequence ;
} ( ) ) ;
exports . LongestCommonSubsequence = LongestCommonSubsequence ;
var GridRouter = ( function ( ) {
function GridRouter ( originalnodes , accessor , groupPadding ) {
if ( groupPadding === void 0 ) { groupPadding = 12 ; }
var _this = this ;
this . originalnodes = originalnodes ;
this . groupPadding = groupPadding ;
this . leaves = null ;
this . nodes = originalnodes . map ( function ( v , i ) { return new NodeWrapper ( i , accessor . getBounds ( v ) , accessor . getChildren ( v ) ) ; } ) ;
this . leaves = this . nodes . filter ( function ( v ) { return v . leaf ; } ) ;
this . groups = this . nodes . filter ( function ( g ) { return ! g . leaf ; } ) ;
this . cols = this . getGridLines ( 'x' ) ;
this . rows = this . getGridLines ( 'y' ) ;
this . groups . forEach ( function ( v ) {
return v . children . forEach ( function ( c ) { return _this . nodes [ c ] . parent = v ; } ) ;
} ) ;
this . root = { children : [ ] } ;
this . nodes . forEach ( function ( v ) {
if ( typeof v . parent === 'undefined' ) {
v . parent = _this . root ;
_this . root . children . push ( v . id ) ;
}
v . ports = [ ] ;
} ) ;
this . backToFront = this . nodes . slice ( 0 ) ;
this . backToFront . sort ( function ( x , y ) { return _this . getDepth ( x ) - _this . getDepth ( y ) ; } ) ;
var frontToBackGroups = this . backToFront . slice ( 0 ) . reverse ( ) . filter ( function ( g ) { return ! g . leaf ; } ) ;
frontToBackGroups . forEach ( function ( v ) {
var r = rectangle _1 . Rectangle . empty ( ) ;
v . children . forEach ( function ( c ) { return r = r . union ( _this . nodes [ c ] . rect ) ; } ) ;
v . rect = r . inflate ( _this . groupPadding ) ;
} ) ;
var colMids = this . midPoints ( this . cols . map ( function ( r ) { return r . pos ; } ) ) ;
var rowMids = this . midPoints ( this . rows . map ( function ( r ) { return r . pos ; } ) ) ;
var rowx = colMids [ 0 ] ,
rowX = colMids [ colMids . length - 1 ] ;
var coly = rowMids [ 0 ] ,
colY = rowMids [ rowMids . length - 1 ] ;
var hlines = this . rows . map ( function ( r ) { return ( { x1 : rowx , x2 : rowX , y1 : r . pos , y2 : r . pos } ) ; } )
. concat ( rowMids . map ( function ( m ) { return ( { x1 : rowx , x2 : rowX , y1 : m , y2 : m } ) ; } ) ) ;
var vlines = this . cols . map ( function ( c ) { return ( { x1 : c . pos , x2 : c . pos , y1 : coly , y2 : colY } ) ; } )
. concat ( colMids . map ( function ( m ) { return ( { x1 : m , x2 : m , y1 : coly , y2 : colY } ) ; } ) ) ;
var lines = hlines . concat ( vlines ) ;
lines . forEach ( function ( l ) { return l . verts = [ ] ; } ) ;
this . verts = [ ] ;
this . edges = [ ] ;
hlines . forEach ( function ( h ) {
return vlines . forEach ( function ( v ) {
var p = new Vert ( _this . verts . length , v . x1 , h . y1 ) ;
h . verts . push ( p ) ;
v . verts . push ( p ) ;
_this . verts . push ( p ) ;
var i = _this . backToFront . length ;
while ( i -- > 0 ) {
var node = _this . backToFront [ i ] ,
r = node . rect ;
var dx = Math . abs ( p . x - r . cx ( ) ) ,
dy = Math . abs ( p . y - r . cy ( ) ) ;
if ( dx < r . width ( ) / 2 && dy < r . height ( ) / 2 ) {
p . node = node ;
break ;
}
}
} ) ;
} ) ;
lines . forEach ( function ( l , li ) {
_this . nodes . forEach ( function ( v , i ) {
v . rect . lineIntersections ( l . x1 , l . y1 , l . x2 , l . y2 ) . forEach ( function ( intersect , j ) {
var p = new Vert ( _this . verts . length , intersect . x , intersect . y , v , l ) ;
_this . verts . push ( p ) ;
l . verts . push ( p ) ;
v . ports . push ( p ) ;
} ) ;
} ) ;
var isHoriz = Math . abs ( l . y1 - l . y2 ) < 0.1 ;
var delta = function ( a , b ) { return isHoriz ? b . x - a . x : b . y - a . y ; } ;
l . verts . sort ( delta ) ;
for ( var i = 1 ; i < l . verts . length ; i ++ ) {
var u = l . verts [ i - 1 ] ,
v = l . verts [ i ] ;
if ( u . node && u . node === v . node && u . node . leaf )
continue ;
_this . edges . push ( { source : u . id , target : v . id , length : Math . abs ( delta ( u , v ) ) } ) ;
}
} ) ;
}
GridRouter . prototype . avg = function ( a ) { return a . reduce ( function ( x , y ) { return x + y ; } ) / a . length ; } ;
GridRouter . prototype . getGridLines = function ( axis ) {
var columns = [ ] ;
var ls = this . leaves . slice ( 0 , this . leaves . length ) ;
while ( ls . length > 0 ) {
var overlapping = ls . filter ( function ( v ) { return v . rect [ 'overlap' + axis . toUpperCase ( ) ] ( ls [ 0 ] . rect ) ; } ) ;
var col = {
nodes : overlapping ,
pos : this . avg ( overlapping . map ( function ( v ) { return v . rect [ 'c' + axis ] ( ) ; } ) )
} ;
columns . push ( col ) ;
col . nodes . forEach ( function ( v ) { return ls . splice ( ls . indexOf ( v ) , 1 ) ; } ) ;
}
columns . sort ( function ( a , b ) { return a . pos - b . pos ; } ) ;
return columns ;
} ;
GridRouter . prototype . getDepth = function ( v ) {
var depth = 0 ;
while ( v . parent !== this . root ) {
depth ++ ;
v = v . parent ;
}
return depth ;
} ;
GridRouter . prototype . midPoints = function ( a ) {
var gap = a [ 1 ] - a [ 0 ] ;
var mids = [ a [ 0 ] - gap / 2 ] ;
for ( var i = 1 ; i < a . length ; i ++ ) {
mids . push ( ( a [ i ] + a [ i - 1 ] ) / 2 ) ;
}
mids . push ( a [ a . length - 1 ] + gap / 2 ) ;
return mids ;
} ;
GridRouter . prototype . findLineage = function ( v ) {
var lineage = [ v ] ;
do {
v = v . parent ;
lineage . push ( v ) ;
} while ( v !== this . root ) ;
return lineage . reverse ( ) ;
} ;
GridRouter . prototype . findAncestorPathBetween = function ( a , b ) {
var aa = this . findLineage ( a ) ,
ba = this . findLineage ( b ) ,
i = 0 ;
while ( aa [ i ] === ba [ i ] )
i ++ ;
return { commonAncestor : aa [ i - 1 ] , lineages : aa . slice ( i ) . concat ( ba . slice ( i ) ) } ;
} ;
GridRouter . prototype . siblingObstacles = function ( a , b ) {
var _this = this ;
var path = this . findAncestorPathBetween ( a , b ) ;
var lineageLookup = { } ;
path . lineages . forEach ( function ( v ) { return lineageLookup [ v . id ] = { } ; } ) ;
var obstacles = path . commonAncestor . children . filter ( function ( v ) { return ! ( v in lineageLookup ) ; } ) ;
path . lineages
. filter ( function ( v ) { return v . parent !== path . commonAncestor ; } )
. forEach ( function ( v ) { return obstacles = obstacles . concat ( v . parent . children . filter ( function ( c ) { return c !== v . id ; } ) ) ; } ) ;
return obstacles . map ( function ( v ) { return _this . nodes [ v ] ; } ) ;
} ;
GridRouter . getSegmentSets = function ( routes , x , y ) {
var vsegments = [ ] ;
for ( var ei = 0 ; ei < routes . length ; ei ++ ) {
var route = routes [ ei ] ;
for ( var si = 0 ; si < route . length ; si ++ ) {
var s = route [ si ] ;
s . edgeid = ei ;
s . i = si ;
var sdx = s [ 1 ] [ x ] - s [ 0 ] [ x ] ;
if ( Math . abs ( sdx ) < 0.1 ) {
vsegments . push ( s ) ;
}
}
}
vsegments . sort ( function ( a , b ) { return a [ 0 ] [ x ] - b [ 0 ] [ x ] ; } ) ;
var vsegmentsets = [ ] ;
var segmentset = null ;
for ( var i = 0 ; i < vsegments . length ; i ++ ) {
var s = vsegments [ i ] ;
if ( ! segmentset || Math . abs ( s [ 0 ] [ x ] - segmentset . pos ) > 0.1 ) {
segmentset = { pos : s [ 0 ] [ x ] , segments : [ ] } ;
vsegmentsets . push ( segmentset ) ;
}
segmentset . segments . push ( s ) ;
}
return vsegmentsets ;
} ;
GridRouter . nudgeSegs = function ( x , y , routes , segments , leftOf , gap ) {
var n = segments . length ;
if ( n <= 1 )
return ;
var vs = segments . map ( function ( s ) { return new vpsc _1 . Variable ( s [ 0 ] [ x ] ) ; } ) ;
var cs = [ ] ;
for ( var i = 0 ; i < n ; i ++ ) {
for ( var j = 0 ; j < n ; j ++ ) {
if ( i === j )
continue ;
var s1 = segments [ i ] ,
s2 = segments [ j ] ,
e1 = s1 . edgeid ,
e2 = s2 . edgeid ,
lind = - 1 ,
rind = - 1 ;
if ( x == 'x' ) {
if ( leftOf ( e1 , e2 ) ) {
if ( s1 [ 0 ] [ y ] < s1 [ 1 ] [ y ] ) {
lind = j , rind = i ;
} else {
lind = i , rind = j ;
}
}
} else {
if ( leftOf ( e1 , e2 ) ) {
if ( s1 [ 0 ] [ y ] < s1 [ 1 ] [ y ] ) {
lind = i , rind = j ;
} else {
lind = j , rind = i ;
}
}
}
if ( lind >= 0 ) {
cs . push ( new vpsc _1 . Constraint ( vs [ lind ] , vs [ rind ] , gap ) ) ;
}
}
}
var solver = new vpsc _1 . Solver ( vs , cs ) ;
solver . solve ( ) ;
vs . forEach ( function ( v , i ) {
var s = segments [ i ] ;
var pos = v . position ( ) ;
s [ 0 ] [ x ] = s [ 1 ] [ x ] = pos ;
var route = routes [ s . edgeid ] ;
if ( s . i > 0 )
route [ s . i - 1 ] [ 1 ] [ x ] = pos ;
if ( s . i < route . length - 1 )
route [ s . i + 1 ] [ 0 ] [ x ] = pos ;
} ) ;
} ;
GridRouter . nudgeSegments = function ( routes , x , y , leftOf , gap ) {
var vsegmentsets = GridRouter . getSegmentSets ( routes , x , y ) ;
for ( var i = 0 ; i < vsegmentsets . length ; i ++ ) {
var ss = vsegmentsets [ i ] ;
var events = [ ] ;
for ( var j = 0 ; j < ss . segments . length ; j ++ ) {
var s = ss . segments [ j ] ;
events . push ( { type : 0 , s : s , pos : Math . min ( s [ 0 ] [ y ] , s [ 1 ] [ y ] ) } ) ;
events . push ( { type : 1 , s : s , pos : Math . max ( s [ 0 ] [ y ] , s [ 1 ] [ y ] ) } ) ;
}
events . sort ( function ( a , b ) { return a . pos - b . pos + a . type - b . type ; } ) ;
var open = [ ] ;
var openCount = 0 ;
events . forEach ( function ( e ) {
if ( e . type === 0 ) {
open . push ( e . s ) ;
openCount ++ ;
} else {
openCount -- ;
}
if ( openCount == 0 ) {
GridRouter . nudgeSegs ( x , y , routes , open , leftOf , gap ) ;
open = [ ] ;
}
} ) ;
}
} ;
GridRouter . prototype . routeEdges = function ( edges , nudgeGap , source , target ) {
var _this = this ;
var routePaths = edges . map ( function ( e ) { return _this . route ( source ( e ) , target ( e ) ) ; } ) ;
var order = GridRouter . orderEdges ( routePaths ) ;
var routes = routePaths . map ( function ( e ) { return GridRouter . makeSegments ( e ) ; } ) ;
GridRouter . nudgeSegments ( routes , 'x' , 'y' , order , nudgeGap ) ;
GridRouter . nudgeSegments ( routes , 'y' , 'x' , order , nudgeGap ) ;
GridRouter . unreverseEdges ( routes , routePaths ) ;
return routes ;
} ;
GridRouter . unreverseEdges = function ( routes , routePaths ) {
routes . forEach ( function ( segments , i ) {
var path = routePaths [ i ] ;
if ( path . reversed ) {
segments . reverse ( ) ;
segments . forEach ( function ( segment ) {
segment . reverse ( ) ;
} ) ;
}
} ) ;
} ;
GridRouter . angleBetween2Lines = function ( line1 , line2 ) {
var angle1 = Math . atan2 ( line1 [ 0 ] . y - line1 [ 1 ] . y , line1 [ 0 ] . x - line1 [ 1 ] . x ) ;
var angle2 = Math . atan2 ( line2 [ 0 ] . y - line2 [ 1 ] . y , line2 [ 0 ] . x - line2 [ 1 ] . x ) ;
var diff = angle1 - angle2 ;
if ( diff > Math . PI || diff < - Math . PI ) {
diff = angle2 - angle1 ;
}
return diff ;
} ;
GridRouter . isLeft = function ( a , b , c ) {
return ( ( b . x - a . x ) * ( c . y - a . y ) - ( b . y - a . y ) * ( c . x - a . x ) ) <= 0 ;
} ;
GridRouter . getOrder = function ( pairs ) {
var outgoing = { } ;
for ( var i = 0 ; i < pairs . length ; i ++ ) {
var p = pairs [ i ] ;
if ( typeof outgoing [ p . l ] === 'undefined' )
outgoing [ p . l ] = { } ;
outgoing [ p . l ] [ p . r ] = true ;
}
return function ( l , r ) { return typeof outgoing [ l ] !== 'undefined' && outgoing [ l ] [ r ] ; } ;
} ;
GridRouter . orderEdges = function ( edges ) {
var edgeOrder = [ ] ;
for ( var i = 0 ; i < edges . length - 1 ; i ++ ) {
for ( var j = i + 1 ; j < edges . length ; j ++ ) {
var e = edges [ i ] ,
f = edges [ j ] ,
lcs = new LongestCommonSubsequence ( e , f ) ;
var u , vi , vj ;
if ( lcs . length === 0 )
continue ;
if ( lcs . reversed ) {
f . reverse ( ) ;
f . reversed = true ;
lcs = new LongestCommonSubsequence ( e , f ) ;
}
if ( ( lcs . si <= 0 || lcs . ti <= 0 ) &&
( lcs . si + lcs . length >= e . length || lcs . ti + lcs . length >= f . length ) ) {
edgeOrder . push ( { l : i , r : j } ) ;
continue ;
}
if ( lcs . si + lcs . length >= e . length || lcs . ti + lcs . length >= f . length ) {
u = e [ lcs . si + 1 ] ;
vj = e [ lcs . si - 1 ] ;
vi = f [ lcs . ti - 1 ] ;
} else {
u = e [ lcs . si + lcs . length - 2 ] ;
vi = e [ lcs . si + lcs . length ] ;
vj = f [ lcs . ti + lcs . length ] ;
}
if ( GridRouter . isLeft ( u , vi , vj ) ) {
edgeOrder . push ( { l : j , r : i } ) ;
} else {
edgeOrder . push ( { l : i , r : j } ) ;
}
}
}
return GridRouter . getOrder ( edgeOrder ) ;
} ;
GridRouter . makeSegments = function ( path ) {
function copyPoint ( p ) {
return { x : p . x , y : p . y } ;
}
var isStraight = function ( a , b , c ) { return Math . abs ( ( b . x - a . x ) * ( c . y - a . y ) - ( b . y - a . y ) * ( c . x - a . x ) ) < 0.001 ; } ;
var segments = [ ] ;
var a = copyPoint ( path [ 0 ] ) ;
for ( var i = 1 ; i < path . length ; i ++ ) {
var b = copyPoint ( path [ i ] ) ,
c = i < path . length - 1 ? path [ i + 1 ] : null ;
if ( ! c || ! isStraight ( a , b , c ) ) {
segments . push ( [ a , b ] ) ;
a = b ;
}
}
return segments ;
} ;
GridRouter . prototype . route = function ( s , t ) {
var _this = this ;
var source = this . nodes [ s ] ,
target = this . nodes [ t ] ;
this . obstacles = this . siblingObstacles ( source , target ) ;
var obstacleLookup = { } ;
this . obstacles . forEach ( function ( o ) { return obstacleLookup [ o . id ] = o ; } ) ;
this . passableEdges = this . edges . filter ( function ( e ) {
var u = _this . verts [ e . source ] ,
v = _this . verts [ e . target ] ;
return ! ( u . node && u . node . id in obstacleLookup ||
v . node && v . node . id in obstacleLookup ) ;
} ) ;
for ( var i = 1 ; i < source . ports . length ; i ++ ) {
var u = source . ports [ 0 ] . id ;
var v = source . ports [ i ] . id ;
this . passableEdges . push ( {
source : u ,
target : v ,
length : 0
} ) ;
}
for ( var i = 1 ; i < target . ports . length ; i ++ ) {
var u = target . ports [ 0 ] . id ;
var v = target . ports [ i ] . id ;
this . passableEdges . push ( {
source : u ,
target : v ,
length : 0
} ) ;
}
var getSource = function ( e ) { return e . source ; } ,
getTarget = function ( e ) { return e . target ; } ,
getLength = function ( e ) { return e . length ; } ;
var shortestPathCalculator = new shortestpaths _1 . Calculator ( this . verts . length , this . passableEdges , getSource , getTarget , getLength ) ;
var bendPenalty = function ( u , v , w ) {
var a = _this . verts [ u ] ,
b = _this . verts [ v ] ,
c = _this . verts [ w ] ;
var dx = Math . abs ( c . x - a . x ) ,
dy = Math . abs ( c . y - a . y ) ;
if ( a . node === source && a . node === b . node || b . node === target && b . node === c . node )
return 0 ;
return dx > 1 && dy > 1 ? 1000 : 0 ;
} ;
var shortestPath = shortestPathCalculator . PathFromNodeToNodeWithPrevCost ( source . ports [ 0 ] . id , target . ports [ 0 ] . id , bendPenalty ) ;
var pathPoints = shortestPath . reverse ( ) . map ( function ( vi ) { return _this . verts [ vi ] ; } ) ;
pathPoints . push ( this . nodes [ target . id ] . ports [ 0 ] ) ;
return pathPoints . filter ( function ( v , i ) {
return ! ( i < pathPoints . length - 1 && pathPoints [ i + 1 ] . node === source && v . node === source ||
i > 0 && v . node === target && pathPoints [ i - 1 ] . node === target ) ;
} ) ;
} ;
GridRouter . getRoutePath = function ( route , cornerradius , arrowwidth , arrowheight ) {
var result = {
routepath : 'M ' + route [ 0 ] [ 0 ] . x + ' ' + route [ 0 ] [ 0 ] . y + ' ' ,
arrowpath : ''
} ;
if ( route . length > 1 ) {
for ( var i = 0 ; i < route . length ; i ++ ) {
var li = route [ i ] ;
var x = li [ 1 ] . x ,
y = li [ 1 ] . y ;
var dx = x - li [ 0 ] . x ;
var dy = y - li [ 0 ] . y ;
if ( i < route . length - 1 ) {
if ( Math . abs ( dx ) > 0 ) {
x -= dx / Math . abs ( dx ) * cornerradius ;
} else {
y -= dy / Math . abs ( dy ) * cornerradius ;
}
result . routepath += 'L ' + x + ' ' + y + ' ' ;
var l = route [ i + 1 ] ;
var x0 = l [ 0 ] . x ,
y0 = l [ 0 ] . y ;
var x1 = l [ 1 ] . x ;
var y1 = l [ 1 ] . y ;
dx = x1 - x0 ;
dy = y1 - y0 ;
var angle = GridRouter . angleBetween2Lines ( li , l ) < 0 ? 1 : 0 ;
var x2 , y2 ;
if ( Math . abs ( dx ) > 0 ) {
x2 = x0 + dx / Math . abs ( dx ) * cornerradius ;
y2 = y0 ;
} else {
x2 = x0 ;
y2 = y0 + dy / Math . abs ( dy ) * cornerradius ;
}
var cx = Math . abs ( x2 - x ) ;
var cy = Math . abs ( y2 - y ) ;
result . routepath += 'A ' + cx + ' ' + cy + ' 0 0 ' + angle + ' ' + x2 + ' ' + y2 + ' ' ;
} else {
var arrowtip = [ x , y ] ;
var arrowcorner1 , arrowcorner2 ;
if ( Math . abs ( dx ) > 0 ) {
x -= dx / Math . abs ( dx ) * arrowheight ;
arrowcorner1 = [ x , y + arrowwidth ] ;
arrowcorner2 = [ x , y - arrowwidth ] ;
} else {
y -= dy / Math . abs ( dy ) * arrowheight ;
arrowcorner1 = [ x + arrowwidth , y ] ;
arrowcorner2 = [ x - arrowwidth , y ] ;
}
result . routepath += 'L ' + x + ' ' + y + ' ' ;
if ( arrowheight > 0 ) {
result . arrowpath = 'M ' + arrowtip [ 0 ] + ' ' + arrowtip [ 1 ] + ' L ' + arrowcorner1 [ 0 ] + ' ' + arrowcorner1 [ 1 ] +
' L ' + arrowcorner2 [ 0 ] + ' ' + arrowcorner2 [ 1 ] ;
}
}
}
} else {
var li = route [ 0 ] ;
var x = li [ 1 ] . x ,
y = li [ 1 ] . y ;
var dx = x - li [ 0 ] . x ;
var dy = y - li [ 0 ] . y ;
var arrowtip = [ x , y ] ;
var arrowcorner1 , arrowcorner2 ;
if ( Math . abs ( dx ) > 0 ) {
x -= dx / Math . abs ( dx ) * arrowheight ;
arrowcorner1 = [ x , y + arrowwidth ] ;
arrowcorner2 = [ x , y - arrowwidth ] ;
} else {
y -= dy / Math . abs ( dy ) * arrowheight ;
arrowcorner1 = [ x + arrowwidth , y ] ;
arrowcorner2 = [ x - arrowwidth , y ] ;
}
result . routepath += 'L ' + x + ' ' + y + ' ' ;
if ( arrowheight > 0 ) {
result . arrowpath = 'M ' + arrowtip [ 0 ] + ' ' + arrowtip [ 1 ] + ' L ' + arrowcorner1 [ 0 ] + ' ' + arrowcorner1 [ 1 ] +
' L ' + arrowcorner2 [ 0 ] + ' ' + arrowcorner2 [ 1 ] ;
}
}
return result ;
} ;
return GridRouter ;
} ( ) ) ;
exports . GridRouter = GridRouter ;
} , { "./rectangle" : 16 , "./shortestpaths" : 17 , "./vpsc" : 18 } ] ,
9 : [ function ( require , module , exports ) {
"use strict" ;
var packingOptions = {
PADDING : 10 ,
GOLDEN _SECTION : ( 1 + Math . sqrt ( 5 ) ) / 2 ,
FLOAT _EPSILON : 0.0001 ,
MAX _INERATIONS : 100
} ;
function applyPacking ( graphs , w , h , node _size , desired _ratio ) {
if ( desired _ratio === void 0 ) { desired _ratio = 1 ; }
var init _x = 0 ,
init _y = 0 ,
svg _width = w ,
svg _height = h ,
desired _ratio = typeof desired _ratio !== 'undefined' ? desired _ratio : 1 ,
node _size = typeof node _size !== 'undefined' ? node _size : 0 ,
real _width = 0 ,
real _height = 0 ,
min _width = 0 ,
global _bottom = 0 ,
line = [ ] ;
if ( graphs . length == 0 )
return ;
calculate _bb ( graphs ) ;
apply ( graphs , desired _ratio ) ;
put _nodes _to _right _positions ( graphs ) ;
function calculate _bb ( graphs ) {
graphs . forEach ( function ( g ) {
calculate _single _bb ( g ) ;
} ) ;
function calculate _single _bb ( graph ) {
var min _x = Number . MAX _VALUE ,
min _y = Number . MAX _VALUE ,
max _x = 0 ,
max _y = 0 ;
graph . array . forEach ( function ( v ) {
var w = typeof v . width !== 'undefined' ? v . width : node _size ;
var h = typeof v . height !== 'undefined' ? v . height : node _size ;
w /= 2 ;
h /= 2 ;
max _x = Math . max ( v . x + w , max _x ) ;
min _x = Math . min ( v . x - w , min _x ) ;
max _y = Math . max ( v . y + h , max _y ) ;
min _y = Math . min ( v . y - h , min _y ) ;
} ) ;
graph . width = max _x - min _x ;
graph . height = max _y - min _y ;
}
}
function put _nodes _to _right _positions ( graphs ) {
graphs . forEach ( function ( g ) {
var center = { x : 0 , y : 0 } ;
g . array . forEach ( function ( node ) {
center . x += node . x ;
center . y += node . y ;
} ) ;
center . x /= g . array . length ;
center . y /= g . array . length ;
var corner = { x : center . x - g . width / 2 , y : center . y - g . height / 2 } ;
var offset = { x : g . x - corner . x + svg _width / 2 - real _width / 2 , y : g . y - corner . y + svg _height / 2 - real _height / 2 } ;
g . array . forEach ( function ( node ) {
node . x += offset . x ;
node . y += offset . y ;
} ) ;
} ) ;
}
function apply ( data , desired _ratio ) {
var curr _best _f = Number . POSITIVE _INFINITY ;
var curr _best = 0 ;
data . sort ( function ( a , b ) { return b . height - a . height ; } ) ;
min _width = data . reduce ( function ( a , b ) {
return a . width < b . width ? a . width : b . width ;
} ) ;
var left = x1 = min _width ;
var right = x2 = get _entire _width ( data ) ;
var iterationCounter = 0 ;
var f _x1 = Number . MAX _VALUE ;
var f _x2 = Number . MAX _VALUE ;
var flag = - 1 ;
var dx = Number . MAX _VALUE ;
var df = Number . MAX _VALUE ;
while ( ( dx > min _width ) || df > packingOptions . FLOAT _EPSILON ) {
if ( flag != 1 ) {
var x1 = right - ( right - left ) / packingOptions . GOLDEN _SECTION ;
var f _x1 = step ( data , x1 ) ;
}
if ( flag != 0 ) {
var x2 = left + ( right - left ) / packingOptions . GOLDEN _SECTION ;
var f _x2 = step ( data , x2 ) ;
}
dx = Math . abs ( x1 - x2 ) ;
df = Math . abs ( f _x1 - f _x2 ) ;
if ( f _x1 < curr _best _f ) {
curr _best _f = f _x1 ;
curr _best = x1 ;
}
if ( f _x2 < curr _best _f ) {
curr _best _f = f _x2 ;
curr _best = x2 ;
}
if ( f _x1 > f _x2 ) {
left = x1 ;
x1 = x2 ;
f _x1 = f _x2 ;
flag = 1 ;
} else {
right = x2 ;
x2 = x1 ;
f _x2 = f _x1 ;
flag = 0 ;
}
if ( iterationCounter ++ > 100 ) {
break ;
}
}
step ( data , curr _best ) ;
}
function step ( data , max _width ) {
line = [ ] ;
real _width = 0 ;
real _height = 0 ;
global _bottom = init _y ;
for ( var i = 0 ; i < data . length ; i ++ ) {
var o = data [ i ] ;
put _rect ( o , max _width ) ;
}
return Math . abs ( get _real _ratio ( ) - desired _ratio ) ;
}
function put _rect ( rect , max _width ) {
var parent = undefined ;
for ( var i = 0 ; i < line . length ; i ++ ) {
if ( ( line [ i ] . space _left >= rect . height ) && ( line [ i ] . x + line [ i ] . width + rect . width + packingOptions . PADDING - max _width ) <= packingOptions . FLOAT _EPSILON ) {
parent = line [ i ] ;
break ;
}
}
line . push ( rect ) ;
if ( parent !== undefined ) {
rect . x = parent . x + parent . width + packingOptions . PADDING ;
rect . y = parent . bottom ;
rect . space _left = rect . height ;
rect . bottom = rect . y ;
parent . space _left -= rect . height + packingOptions . PADDING ;
parent . bottom += rect . height + packingOptions . PADDING ;
} else {
rect . y = global _bottom ;
global _bottom += rect . height + packingOptions . PADDING ;
rect . x = init _x ;
rect . bottom = rect . y ;
rect . space _left = rect . height ;
}
if ( rect . y + rect . height - real _height > - packingOptions . FLOAT _EPSILON )
real _height = rect . y + rect . height - init _y ;
if ( rect . x + rect . width - real _width > - packingOptions . FLOAT _EPSILON )
real _width = rect . x + rect . width - init _x ;
} ;
function get _entire _width ( data ) {
var width = 0 ;
data . forEach ( function ( d ) { return width += d . width + packingOptions . PADDING ; } ) ;
return width ;
}
function get _real _ratio ( ) {
return ( real _width / real _height ) ;
}
}
exports . applyPacking = applyPacking ;
function separateGraphs ( nodes , links ) {
var marks = { } ;
var ways = { } ;
var graphs = [ ] ;
var clusters = 0 ;
for ( var i = 0 ; i < links . length ; i ++ ) {
var link = links [ i ] ;
var n1 = link . source ;
var n2 = link . target ;
if ( ways [ n1 . index ] )
ways [ n1 . index ] . push ( n2 ) ;
else
ways [ n1 . index ] = [ n2 ] ;
if ( ways [ n2 . index ] )
ways [ n2 . index ] . push ( n1 ) ;
else
ways [ n2 . index ] = [ n1 ] ;
}
for ( var i = 0 ; i < nodes . length ; i ++ ) {
var node = nodes [ i ] ;
if ( marks [ node . index ] )
continue ;
explore _node ( node , true ) ;
}
function explore _node ( n , is _new ) {
if ( marks [ n . index ] !== undefined )
return ;
if ( is _new ) {
clusters ++ ;
graphs . push ( { array : [ ] } ) ;
}
marks [ n . index ] = clusters ;
graphs [ clusters - 1 ] . array . push ( n ) ;
var adjacent = ways [ n . index ] ;
if ( ! adjacent )
return ;
for ( var j = 0 ; j < adjacent . length ; j ++ ) {
explore _node ( adjacent [ j ] , false ) ;
}
}
return graphs ;
}
exports . separateGraphs = separateGraphs ;
} , { } ] ,
10 : [ function ( require , module , exports ) {
"use strict" ;
var powergraph = require ( "./powergraph" ) ;
var linklengths _1 = require ( "./linklengths" ) ;
var descent _1 = require ( "./descent" ) ;
var rectangle _1 = require ( "./rectangle" ) ;
var shortestpaths _1 = require ( "./shortestpaths" ) ;
var geom _1 = require ( "./geom" ) ;
var handledisconnected _1 = require ( "./handledisconnected" ) ;
var EventType ;
( function ( EventType ) {
EventType [ EventType [ "start" ] = 0 ] = "start" ;
EventType [ EventType [ "tick" ] = 1 ] = "tick" ;
EventType [ EventType [ "end" ] = 2 ] = "end" ;
} ) ( EventType = exports . EventType || ( exports . EventType = { } ) ) ; ;
function isGroup ( g ) {
return typeof g . leaves !== 'undefined' || typeof g . groups !== 'undefined' ;
}
var Layout = ( function ( ) {
function Layout ( ) {
var _this = this ;
this . _canvasSize = [ 1 , 1 ] ;
this . _linkDistance = 20 ;
this . _defaultNodeSize = 10 ;
this . _linkLengthCalculator = null ;
this . _linkType = null ;
this . _avoidOverlaps = false ;
this . _handleDisconnected = true ;
this . _running = false ;
this . _nodes = [ ] ;
this . _groups = [ ] ;
this . _rootGroup = null ;
this . _links = [ ] ;
this . _constraints = [ ] ;
this . _distanceMatrix = null ;
this . _descent = null ;
this . _directedLinkConstraints = null ;
this . _threshold = 0.01 ;
this . _visibilityGraph = null ;
this . _groupCompactness = 1e-6 ;
this . event = null ;
this . linkAccessor = {
getSourceIndex : Layout . getSourceIndex ,
getTargetIndex : Layout . getTargetIndex ,
setLength : Layout . setLinkLength ,
getType : function ( l ) { return typeof _this . _linkType === "function" ? _this . _linkType ( l ) : 0 ; }
} ;
}
Layout . prototype . on = function ( e , listener ) {
if ( ! this . event )
this . event = { } ;
if ( typeof e === 'string' ) {
this . event [ EventType [ e ] ] = listener ;
} else {
this . event [ e ] = listener ;
}
return this ;
} ;
Layout . prototype . trigger = function ( e ) {
if ( this . event && typeof this . event [ e . type ] !== 'undefined' ) {
this . event [ e . type ] ( e ) ;
}
} ;
Layout . prototype . kick = function ( ) {
while ( ! this . tick ( ) )
;
} ;
Layout . prototype . tick = function ( ) {
if ( this . _alpha < this . _threshold ) {
this . _running = false ;
this . trigger ( { type : EventType . end , alpha : this . _alpha = 0 , stress : this . _lastStress } ) ;
return true ;
}
var n = this . _nodes . length ,
m = this . _links . length ;
var o , i ;
this . _descent . locks . clear ( ) ;
for ( i = 0 ; i < n ; ++ i ) {
o = this . _nodes [ i ] ;
if ( o . fixed ) {
if ( typeof o . px === 'undefined' || typeof o . py === 'undefined' ) {
o . px = o . x ;
o . py = o . y ;
}
var p = [ o . px , o . py ] ;
this . _descent . locks . add ( i , p ) ;
}
}
var s1 = this . _descent . rungeKutta ( ) ;
if ( s1 === 0 ) {
this . _alpha = 0 ;
} else if ( typeof this . _lastStress !== 'undefined' ) {
this . _alpha = s1 ;
}
this . _lastStress = s1 ;
this . updateNodePositions ( ) ;
this . trigger ( { type : EventType . tick , alpha : this . _alpha , stress : this . _lastStress } ) ;
return false ;
} ;
Layout . prototype . updateNodePositions = function ( ) {
var x = this . _descent . x [ 0 ] ,
y = this . _descent . x [ 1 ] ;
var o , i = this . _nodes . length ;
while ( i -- ) {
o = this . _nodes [ i ] ;
o . x = x [ i ] ;
o . y = y [ i ] ;
}
} ;
Layout . prototype . nodes = function ( v ) {
if ( ! v ) {
if ( this . _nodes . length === 0 && this . _links . length > 0 ) {
var n = 0 ;
this . _links . forEach ( function ( l ) {
n = Math . max ( n , l . source , l . target ) ;
} ) ;
this . _nodes = new Array ( ++ n ) ;
for ( var i = 0 ; i < n ; ++ i ) {
this . _nodes [ i ] = { } ;
}
}
return this . _nodes ;
}
this . _nodes = v ;
return this ;
} ;
Layout . prototype . groups = function ( x ) {
var _this = this ;
if ( ! x )
return this . _groups ;
this . _groups = x ;
this . _rootGroup = { } ;
this . _groups . forEach ( function ( g ) {
if ( typeof g . padding === "undefined" )
g . padding = 1 ;
if ( typeof g . leaves !== "undefined" ) {
g . leaves . forEach ( function ( v , i ) {
if ( typeof v === 'number' )
( g . leaves [ i ] = _this . _nodes [ v ] ) . parent = g ;
} ) ;
}
if ( typeof g . groups !== "undefined" ) {
g . groups . forEach ( function ( gi , i ) {
if ( typeof gi === 'number' )
( g . groups [ i ] = _this . _groups [ gi ] ) . parent = g ;
} ) ;
}
} ) ;
this . _rootGroup . leaves = this . _nodes . filter ( function ( v ) { return typeof v . parent === 'undefined' ; } ) ;
this . _rootGroup . groups = this . _groups . filter ( function ( g ) { return typeof g . parent === 'undefined' ; } ) ;
return this ;
} ;
Layout . prototype . powerGraphGroups = function ( f ) {
var g = powergraph . getGroups ( this . _nodes , this . _links , this . linkAccessor , this . _rootGroup ) ;
this . groups ( g . groups ) ;
f ( g ) ;
return this ;
} ;
Layout . prototype . avoidOverlaps = function ( v ) {
if ( ! arguments . length )
return this . _avoidOverlaps ;
this . _avoidOverlaps = v ;
return this ;
} ;
Layout . prototype . handleDisconnected = function ( v ) {
if ( ! arguments . length )
return this . _handleDisconnected ;
this . _handleDisconnected = v ;
return this ;
} ;
Layout . prototype . flowLayout = function ( axis , minSeparation ) {
if ( ! arguments . length )
axis = 'y' ;
this . _directedLinkConstraints = {
axis : axis ,
getMinSeparation : typeof minSeparation === 'number' ? function ( ) { return minSeparation ; } : minSeparation
} ;
return this ;
} ;
Layout . prototype . links = function ( x ) {
if ( ! arguments . length )
return this . _links ;
this . _links = x ;
return this ;
} ;
Layout . prototype . constraints = function ( c ) {
if ( ! arguments . length )
return this . _constraints ;
this . _constraints = c ;
return this ;
} ;
Layout . prototype . distanceMatrix = function ( d ) {
if ( ! arguments . length )
return this . _distanceMatrix ;
this . _distanceMatrix = d ;
return this ;
} ;
Layout . prototype . size = function ( x ) {
if ( ! x )
return this . _canvasSize ;
this . _canvasSize = x ;
return this ;
} ;
Layout . prototype . defaultNodeSize = function ( x ) {
if ( ! x )
return this . _defaultNodeSize ;
this . _defaultNodeSize = x ;
return this ;
} ;
Layout . prototype . groupCompactness = function ( x ) {
if ( ! x )
return this . _groupCompactness ;
this . _groupCompactness = x ;
return this ;
} ;
Layout . prototype . linkDistance = function ( x ) {
if ( ! x ) {
return this . _linkDistance ;
}
this . _linkDistance = typeof x === "function" ? x : + x ;
this . _linkLengthCalculator = null ;
return this ;
} ;
Layout . prototype . linkType = function ( f ) {
this . _linkType = f ;
return this ;
} ;
Layout . prototype . convergenceThreshold = function ( x ) {
if ( ! x )
return this . _threshold ;
this . _threshold = typeof x === "function" ? x : + x ;
return this ;
} ;
Layout . prototype . alpha = function ( x ) {
if ( ! arguments . length )
return this . _alpha ;
else {
x = + x ;
if ( this . _alpha ) {
if ( x > 0 )
this . _alpha = x ;
else
this . _alpha = 0 ;
} else if ( x > 0 ) {
if ( ! this . _running ) {
this . _running = true ;
this . trigger ( { type : EventType . start , alpha : this . _alpha = x } ) ;
this . kick ( ) ;
}
}
return this ;
}
} ;
Layout . prototype . getLinkLength = function ( link ) {
return typeof this . _linkDistance === "function" ? + ( this . _linkDistance ( link ) ) : this . _linkDistance ;
} ;
Layout . setLinkLength = function ( link , length ) {
link . length = length ;
} ;
Layout . prototype . getLinkType = function ( link ) {
return typeof this . _linkType === "function" ? this . _linkType ( link ) : 0 ;
} ;
Layout . prototype . symmetricDiffLinkLengths = function ( idealLength , w ) {
var _this = this ;
if ( w === void 0 ) { w = 1 ; }
this . linkDistance ( function ( l ) { return idealLength * l . length ; } ) ;
this . _linkLengthCalculator = function ( ) { return linklengths _1 . symmetricDiffLinkLengths ( _this . _links , _this . linkAccessor , w ) ; } ;
return this ;
} ;
Layout . prototype . jaccardLinkLengths = function ( idealLength , w ) {
var _this = this ;
if ( w === void 0 ) { w = 1 ; }
this . linkDistance ( function ( l ) { return idealLength * l . length ; } ) ;
this . _linkLengthCalculator = function ( ) { return linklengths _1 . jaccardLinkLengths ( _this . _links , _this . linkAccessor , w ) ; } ;
return this ;
} ;
Layout . prototype . start = function ( initialUnconstrainedIterations , initialUserConstraintIterations , initialAllConstraintsIterations , gridSnapIterations , keepRunning ) {
var _this = this ;
if ( initialUnconstrainedIterations === void 0 ) { initialUnconstrainedIterations = 0 ; }
if ( initialUserConstraintIterations === void 0 ) { initialUserConstraintIterations = 0 ; }
if ( initialAllConstraintsIterations === void 0 ) { initialAllConstraintsIterations = 0 ; }
if ( gridSnapIterations === void 0 ) { gridSnapIterations = 0 ; }
if ( keepRunning === void 0 ) { keepRunning = true ; }
var i , j , n = this . nodes ( ) . length ,
N = n + 2 * this . _groups . length ,
m = this . _links . length ,
w = this . _canvasSize [ 0 ] ,
h = this . _canvasSize [ 1 ] ;
var x = new Array ( N ) ,
y = new Array ( N ) ;
var G = null ;
var ao = this . _avoidOverlaps ;
this . _nodes . forEach ( function ( v , i ) {
v . index = i ;
if ( typeof v . x === 'undefined' ) {
v . x = w / 2 , v . y = h / 2 ;
}
x [ i ] = v . x , y [ i ] = v . y ;
} ) ;
if ( this . _linkLengthCalculator )
this . _linkLengthCalculator ( ) ;
var distances ;
if ( this . _distanceMatrix ) {
distances = this . _distanceMatrix ;
} else {
distances = ( new shortestpaths _1 . Calculator ( N , this . _links , Layout . getSourceIndex , Layout . getTargetIndex , function ( l ) { return _this . getLinkLength ( l ) ; } ) ) . DistanceMatrix ( ) ;
G = descent _1 . Descent . createSquareMatrix ( N , function ( ) { return 2 ; } ) ;
this . _links . forEach ( function ( l ) {
if ( typeof l . source == "number" )
l . source = _this . _nodes [ l . source ] ;
if ( typeof l . target == "number" )
l . target = _this . _nodes [ l . target ] ;
} ) ;
this . _links . forEach ( function ( e ) {
var u = Layout . getSourceIndex ( e ) ,
v = Layout . getTargetIndex ( e ) ;
G [ u ] [ v ] = G [ v ] [ u ] = e . weight || 1 ;
} ) ;
}
var D = descent _1 . Descent . createSquareMatrix ( N , function ( i , j ) {
return distances [ i ] [ j ] ;
} ) ;
if ( this . _rootGroup && typeof this . _rootGroup . groups !== 'undefined' ) {
var i = n ;
var addAttraction = function ( i , j , strength , idealDistance ) {
G [ i ] [ j ] = G [ j ] [ i ] = strength ;
D [ i ] [ j ] = D [ j ] [ i ] = idealDistance ;
} ;
this . _groups . forEach ( function ( g ) {
addAttraction ( i , i + 1 , _this . _groupCompactness , 0.1 ) ;
x [ i ] = 0 , y [ i ++ ] = 0 ;
x [ i ] = 0 , y [ i ++ ] = 0 ;
} ) ;
} else
this . _rootGroup = { leaves : this . _nodes , groups : [ ] } ;
var curConstraints = this . _constraints || [ ] ;
if ( this . _directedLinkConstraints ) {
this . linkAccessor . getMinSeparation = this . _directedLinkConstraints . getMinSeparation ;
curConstraints = curConstraints . concat ( linklengths _1 . generateDirectedEdgeConstraints ( n , this . _links , this . _directedLinkConstraints . axis , ( this . linkAccessor ) ) ) ;
}
this . avoidOverlaps ( false ) ;
this . _descent = new descent _1 . Descent ( [ x , y ] , D ) ;
this . _descent . locks . clear ( ) ;
for ( var i = 0 ; i < n ; ++ i ) {
var o = this . _nodes [ i ] ;
if ( o . fixed ) {
o . px = o . x ;
o . py = o . y ;
var p = [ o . x , o . y ] ;
this . _descent . locks . add ( i , p ) ;
}
}
this . _descent . threshold = this . _threshold ;
this . initialLayout ( initialUnconstrainedIterations , x , y ) ;
if ( curConstraints . length > 0 )
this . _descent . project = new rectangle _1 . Projection ( this . _nodes , this . _groups , this . _rootGroup , curConstraints ) . projectFunctions ( ) ;
this . _descent . run ( initialUserConstraintIterations ) ;
this . separateOverlappingComponents ( w , h ) ;
this . avoidOverlaps ( ao ) ;
if ( ao ) {
this . _nodes . forEach ( function ( v , i ) { v . x = x [ i ] , v . y = y [ i ] ; } ) ;
this . _descent . project = new rectangle _1 . Projection ( this . _nodes , this . _groups , this . _rootGroup , curConstraints , true ) . projectFunctions ( ) ;
this . _nodes . forEach ( function ( v , i ) { x [ i ] = v . x , y [ i ] = v . y ; } ) ;
}
this . _descent . G = G ;
this . _descent . run ( initialAllConstraintsIterations ) ;
if ( gridSnapIterations ) {
this . _descent . snapStrength = 1000 ;
this . _descent . snapGridSize = this . _nodes [ 0 ] . width ;
this . _descent . numGridSnapNodes = n ;
this . _descent . scaleSnapByMaxH = n != N ;
var G0 = descent _1 . Descent . createSquareMatrix ( N , function ( i , j ) {
if ( i >= n || j >= n )
return G [ i ] [ j ] ;
return 0 ;
} ) ;
this . _descent . G = G0 ;
this . _descent . run ( gridSnapIterations ) ;
}
this . updateNodePositions ( ) ;
this . separateOverlappingComponents ( w , h ) ;
return keepRunning ? this . resume ( ) : this ;
} ;
Layout . prototype . initialLayout = function ( iterations , x , y ) {
if ( this . _groups . length > 0 && iterations > 0 ) {
var n = this . _nodes . length ;
var edges = this . _links . map ( function ( e ) { return ( { source : e . source . index , target : e . target . index } ) ; } ) ;
var vs = this . _nodes . map ( function ( v ) { return ( { index : v . index } ) ; } ) ;
this . _groups . forEach ( function ( g , i ) {
vs . push ( { index : g . index = n + i } ) ;
} ) ;
this . _groups . forEach ( function ( g , i ) {
if ( typeof g . leaves !== 'undefined' )
g . leaves . forEach ( function ( v ) { return edges . push ( { source : g . index , target : v . index } ) ; } ) ;
if ( typeof g . groups !== 'undefined' )
g . groups . forEach ( function ( gg ) { return edges . push ( { source : g . index , target : gg . index } ) ; } ) ;
} ) ;
new Layout ( )
. size ( this . size ( ) )
. nodes ( vs )
. links ( edges )
. avoidOverlaps ( false )
. linkDistance ( this . linkDistance ( ) )
. symmetricDiffLinkLengths ( 5 )
. convergenceThreshold ( 1e-4 )
. start ( iterations , 0 , 0 , 0 , false ) ;
this . _nodes . forEach ( function ( v ) {
x [ v . index ] = vs [ v . index ] . x ;
y [ v . index ] = vs [ v . index ] . y ;
} ) ;
} else {
this . _descent . run ( iterations ) ;
}
} ;
Layout . prototype . separateOverlappingComponents = function ( width , height ) {
var _this = this ;
if ( ! this . _distanceMatrix && this . _handleDisconnected ) {
var x _1 = this . _descent . x [ 0 ] ,
y _1 = this . _descent . x [ 1 ] ;
this . _nodes . forEach ( function ( v , i ) { v . x = x _1 [ i ] , v . y = y _1 [ i ] ; } ) ;
var graphs = handledisconnected _1 . separateGraphs ( this . _nodes , this . _links ) ;
handledisconnected _1 . applyPacking ( graphs , width , height , this . _defaultNodeSize ) ;
this . _nodes . forEach ( function ( v , i ) {
_this . _descent . x [ 0 ] [ i ] = v . x , _this . _descent . x [ 1 ] [ i ] = v . y ;
if ( v . bounds ) {
v . bounds . setXCentre ( v . x ) ;
v . bounds . setYCentre ( v . y ) ;
}
} ) ;
}
} ;
Layout . prototype . resume = function ( ) {
return this . alpha ( 0.1 ) ;
} ;
Layout . prototype . stop = function ( ) {
return this . alpha ( 0 ) ;
} ;
Layout . prototype . prepareEdgeRouting = function ( nodeMargin ) {
if ( nodeMargin === void 0 ) { nodeMargin = 0 ; }
this . _visibilityGraph = new geom _1 . TangentVisibilityGraph ( this . _nodes . map ( function ( v ) {
return v . bounds . inflate ( - nodeMargin ) . vertices ( ) ;
} ) ) ;
} ;
Layout . prototype . routeEdge = function ( edge , draw ) {
var lineData = [ ] ;
var vg2 = new geom _1 . TangentVisibilityGraph ( this . _visibilityGraph . P , { V : this . _visibilityGraph . V , E : this . _visibilityGraph . E } ) ,
port1 = { x : edge . source . x , y : edge . source . y } ,
port2 = { x : edge . target . x , y : edge . target . y } ,
start = vg2 . addPoint ( port1 , edge . source . index ) ,
end = vg2 . addPoint ( port2 , edge . target . index ) ;
vg2 . addEdgeIfVisible ( port1 , port2 , edge . source . index , edge . target . index ) ;
if ( typeof draw !== 'undefined' ) {
draw ( vg2 ) ;
}
var sourceInd = function ( e ) { return e . source . id ; } ,
targetInd = function ( e ) { return e . target . id ; } ,
length = function ( e ) { return e . length ( ) ; } ,
spCalc = new shortestpaths _1 . Calculator ( vg2 . V . length , vg2 . E , sourceInd , targetInd , length ) ,
shortestPath = spCalc . PathFromNodeToNode ( start . id , end . id ) ;
if ( shortestPath . length === 1 || shortestPath . length === vg2 . V . length ) {
var route = rectangle _1 . makeEdgeBetween ( edge . source . innerBounds , edge . target . innerBounds , 5 ) ;
lineData = [ route . sourceIntersection , route . arrowStart ] ;
} else {
var n = shortestPath . length - 2 ,
p = vg2 . V [ shortestPath [ n ] ] . p ,
q = vg2 . V [ shortestPath [ 0 ] ] . p ,
lineData = [ edge . source . innerBounds . rayIntersection ( p . x , p . y ) ] ;
for ( var i = n ; i >= 0 ; -- i )
lineData . push ( vg2 . V [ shortestPath [ i ] ] . p ) ;
lineData . push ( rectangle _1 . makeEdgeTo ( q , edge . target . innerBounds , 5 ) ) ;
}
return lineData ;
} ;
Layout . getSourceIndex = function ( e ) {
return typeof e . source === 'number' ? e . source : e . source . index ;
} ;
Layout . getTargetIndex = function ( e ) {
return typeof e . target === 'number' ? e . target : e . target . index ;
} ;
Layout . linkId = function ( e ) {
return Layout . getSourceIndex ( e ) + "-" + Layout . getTargetIndex ( e ) ;
} ;
Layout . dragStart = function ( d ) {
if ( isGroup ( d ) ) {
Layout . storeOffset ( d , Layout . dragOrigin ( d ) ) ;
} else {
Layout . stopNode ( d ) ;
d . fixed |= 2 ;
}
} ;
Layout . stopNode = function ( v ) {
v . px = v . x ;
v . py = v . y ;
} ;
Layout . storeOffset = function ( d , origin ) {
if ( typeof d . leaves !== 'undefined' ) {
d . leaves . forEach ( function ( v ) {
v . fixed |= 2 ;
Layout . stopNode ( v ) ;
v . _dragGroupOffsetX = v . x - origin . x ;
v . _dragGroupOffsetY = v . y - origin . y ;
} ) ;
}
if ( typeof d . groups !== 'undefined' ) {
d . groups . forEach ( function ( g ) { return Layout . storeOffset ( g , origin ) ; } ) ;
}
} ;
Layout . dragOrigin = function ( d ) {
if ( isGroup ( d ) ) {
return {
x : d . bounds . cx ( ) ,
y : d . bounds . cy ( )
} ;
} else {
return d ;
}
} ;
Layout . drag = function ( d , position ) {
if ( isGroup ( d ) ) {
if ( typeof d . leaves !== 'undefined' ) {
d . leaves . forEach ( function ( v ) {
d . bounds . setXCentre ( position . x ) ;
d . bounds . setYCentre ( position . y ) ;
v . px = v . _dragGroupOffsetX + position . x ;
v . py = v . _dragGroupOffsetY + position . y ;
} ) ;
}
if ( typeof d . groups !== 'undefined' ) {
d . groups . forEach ( function ( g ) { return Layout . drag ( g , position ) ; } ) ;
}
} else {
d . px = position . x ;
d . py = position . y ;
}
} ;
Layout . dragEnd = function ( d ) {
if ( isGroup ( d ) ) {
if ( typeof d . leaves !== 'undefined' ) {
d . leaves . forEach ( function ( v ) {
Layout . dragEnd ( v ) ;
delete v . _dragGroupOffsetX ;
delete v . _dragGroupOffsetY ;
} ) ;
}
if ( typeof d . groups !== 'undefined' ) {
d . groups . forEach ( Layout . dragEnd ) ;
}
} else {
d . fixed &= ~ 6 ;
}
} ;
Layout . mouseOver = function ( d ) {
d . fixed |= 4 ;
d . px = d . x , d . py = d . y ;
} ;
Layout . mouseOut = function ( d ) {
d . fixed &= ~ 4 ;
} ;
return Layout ;
} ( ) ) ;
exports . Layout = Layout ;
} , { "./descent" : 6 , "./geom" : 7 , "./handledisconnected" : 9 , "./linklengths" : 12 , "./powergraph" : 13 , "./rectangle" : 16 , "./shortestpaths" : 17 } ] ,
11 : [ function ( require , module , exports ) {
"use strict" ;
var shortestpaths _1 = require ( "./shortestpaths" ) ;
var descent _1 = require ( "./descent" ) ;
var rectangle _1 = require ( "./rectangle" ) ;
var linklengths _1 = require ( "./linklengths" ) ;
var Link3D = ( function ( ) {
function Link3D ( source , target ) {
this . source = source ;
this . target = target ;
}
Link3D . prototype . actualLength = function ( x ) {
var _this = this ;
return Math . sqrt ( x . reduce ( function ( c , v ) {
var dx = v [ _this . target ] - v [ _this . source ] ;
return c + dx * dx ;
} , 0 ) ) ;
} ;
return Link3D ;
} ( ) ) ;
exports . Link3D = Link3D ;
var Node3D = ( function ( ) {
function Node3D ( x , y , z ) {
if ( x === void 0 ) { x = 0 ; }
if ( y === void 0 ) { y = 0 ; }
if ( z === void 0 ) { z = 0 ; }
this . x = x ;
this . y = y ;
this . z = z ;
}
return Node3D ;
} ( ) ) ;
exports . Node3D = Node3D ;
var Layout3D = ( function ( ) {
function Layout3D ( nodes , links , idealLinkLength ) {
if ( idealLinkLength === void 0 ) { idealLinkLength = 1 ; }
var _this = this ;
this . nodes = nodes ;
this . links = links ;
this . idealLinkLength = idealLinkLength ;
this . constraints = null ;
this . useJaccardLinkLengths = true ;
this . result = new Array ( Layout3D . k ) ;
for ( var i = 0 ; i < Layout3D . k ; ++ i ) {
this . result [ i ] = new Array ( nodes . length ) ;
}
nodes . forEach ( function ( v , i ) {
for ( var _i = 0 , _a = Layout3D . dims ; _i < _a . length ; _i ++ ) {
var dim = _a [ _i ] ;
if ( typeof v [ dim ] == 'undefined' )
v [ dim ] = Math . random ( ) ;
}
_this . result [ 0 ] [ i ] = v . x ;
_this . result [ 1 ] [ i ] = v . y ;
_this . result [ 2 ] [ i ] = v . z ;
} ) ;
} ;
Layout3D . prototype . linkLength = function ( l ) {
return l . actualLength ( this . result ) ;
} ;
Layout3D . prototype . start = function ( iterations ) {
var _this = this ;
if ( iterations === void 0 ) { iterations = 100 ; }
var n = this . nodes . length ;
var linkAccessor = new LinkAccessor ( ) ;
if ( this . useJaccardLinkLengths )
linklengths _1 . jaccardLinkLengths ( this . links , linkAccessor , 1.5 ) ;
this . links . forEach ( function ( e ) { return e . length *= _this . idealLinkLength ; } ) ;
var distanceMatrix = ( new shortestpaths _1 . Calculator ( n , this . links , function ( e ) { return e . source ; } , function ( e ) { return e . target ; } , function ( e ) { return e . length ; } ) ) . DistanceMatrix ( ) ;
var D = descent _1 . Descent . createSquareMatrix ( n , function ( i , j ) { return distanceMatrix [ i ] [ j ] ; } ) ;
var G = descent _1 . Descent . createSquareMatrix ( n , function ( ) { return 2 ; } ) ;
this . links . forEach ( function ( _a ) {
var source = _a . source ,
target = _a . target ;
return G [ source ] [ target ] = G [ target ] [ source ] = 1 ;
} ) ;
this . descent = new descent _1 . Descent ( this . result , D ) ;
this . descent . threshold = 1e-3 ;
this . descent . G = G ;
if ( this . constraints )
this . descent . project = new rectangle _1 . Projection ( this . nodes , null , null , this . constraints ) . projectFunctions ( ) ;
for ( var i = 0 ; i < this . nodes . length ; i ++ ) {
var v = this . nodes [ i ] ;
if ( v . fixed ) {
this . descent . locks . add ( i , [ v . x , v . y , v . z ] ) ;
}
}
this . descent . run ( iterations ) ;
return this ;
} ;
Layout3D . prototype . tick = function ( ) {
this . descent . locks . clear ( ) ;
for ( var i = 0 ; i < this . nodes . length ; i ++ ) {
var v = this . nodes [ i ] ;
if ( v . fixed ) {
this . descent . locks . add ( i , [ v . x , v . y , v . z ] ) ;
}
}
return this . descent . rungeKutta ( ) ;
} ;
return Layout3D ;
} ( ) ) ;
Layout3D . dims = [ 'x' , 'y' , 'z' ] ;
Layout3D . k = Layout3D . dims . length ;
exports . Layout3D = Layout3D ;
var LinkAccessor = ( function ( ) {
function LinkAccessor ( ) { }
LinkAccessor . prototype . getSourceIndex = function ( e ) { return e . source ; } ;
LinkAccessor . prototype . getTargetIndex = function ( e ) { return e . target ; } ;
LinkAccessor . prototype . getLength = function ( e ) { return e . length ; } ;
LinkAccessor . prototype . setLength = function ( e , l ) { e . length = l ; } ;
return LinkAccessor ;
} ( ) ) ;
} , { "./descent" : 6 , "./linklengths" : 12 , "./rectangle" : 16 , "./shortestpaths" : 17 } ] ,
12 : [ function ( require , module , exports ) {
"use strict" ;
function unionCount ( a , b ) {
var u = { } ;
for ( var i in a )
u [ i ] = { } ;
for ( var i in b )
u [ i ] = { } ;
return Object . keys ( u ) . length ;
}
function intersectionCount ( a , b ) {
var n = 0 ;
for ( var i in a )
if ( typeof b [ i ] !== 'undefined' )
++ n ;
return n ;
}
function getNeighbours ( links , la ) {
var neighbours = { } ;
var addNeighbours = function ( u , v ) {
if ( typeof neighbours [ u ] === 'undefined' )
neighbours [ u ] = { } ;
neighbours [ u ] [ v ] = { } ;
} ;
links . forEach ( function ( e ) {
var u = la . getSourceIndex ( e ) ,
v = la . getTargetIndex ( e ) ;
addNeighbours ( u , v ) ;
addNeighbours ( v , u ) ;
} ) ;
return neighbours ;
}
function computeLinkLengths ( links , w , f , la ) {
var neighbours = getNeighbours ( links , la ) ;
links . forEach ( function ( l ) {
var a = neighbours [ la . getSourceIndex ( l ) ] ;
var b = neighbours [ la . getTargetIndex ( l ) ] ;
la . setLength ( l , 1 + w * f ( a , b ) ) ;
} ) ;
}
function symmetricDiffLinkLengths ( links , la , w ) {
if ( w === void 0 ) { w = 1 ; }
computeLinkLengths ( links , w , function ( a , b ) { return Math . sqrt ( unionCount ( a , b ) - intersectionCount ( a , b ) ) ; } , la ) ;
}
exports . symmetricDiffLinkLengths = symmetricDiffLinkLengths ;
function jaccardLinkLengths ( links , la , w ) {
if ( w === void 0 ) { w = 1 ; }
computeLinkLengths ( links , w , function ( a , b ) {
return Math . min ( Object . keys ( a ) . length , Object . keys ( b ) . length ) < 1.1 ? 0 : intersectionCount ( a , b ) / unionCount ( a , b ) ;
} , la ) ;
}
exports . jaccardLinkLengths = jaccardLinkLengths ;
function generateDirectedEdgeConstraints ( n , links , axis , la ) {
var components = stronglyConnectedComponents ( n , links , la ) ;
var nodes = { } ;
components . forEach ( function ( c , i ) {
return c . forEach ( function ( v ) { return nodes [ v ] = i ; } ) ;
} ) ;
var constraints = [ ] ;
links . forEach ( function ( l ) {
var ui = la . getSourceIndex ( l ) ,
vi = la . getTargetIndex ( l ) ,
u = nodes [ ui ] ,
v = nodes [ vi ] ;
if ( u !== v ) {
constraints . push ( {
axis : axis ,
left : ui ,
right : vi ,
gap : la . getMinSeparation ( l )
} ) ;
}
} ) ;
return constraints ;
}
exports . generateDirectedEdgeConstraints = generateDirectedEdgeConstraints ;
function stronglyConnectedComponents ( numVertices , edges , la ) {
var nodes = [ ] ;
var index = 0 ;
var stack = [ ] ;
var components = [ ] ;
function strongConnect ( v ) {
v . index = v . lowlink = index ++ ;
stack . push ( v ) ;
v . onStack = true ;
for ( var _i = 0 , _a = v . out ; _i < _a . length ; _i ++ ) {
var w = _a [ _i ] ;
if ( typeof w . index === 'undefined' ) {
strongConnect ( w ) ;
v . lowlink = Math . min ( v . lowlink , w . lowlink ) ;
} else if ( w . onStack ) {
v . lowlink = Math . min ( v . lowlink , w . index ) ;
}
}
if ( v . lowlink === v . index ) {
var component = [ ] ;
while ( stack . length ) {
w = stack . pop ( ) ;
w . onStack = false ;
component . push ( w ) ;
if ( w === v )
break ;
}
components . push ( component . map ( function ( v ) { return v . id ; } ) ) ;
}
}
for ( var i = 0 ; i < numVertices ; i ++ ) {
nodes . push ( { id : i , out : [ ] } ) ;
}
for ( var _i = 0 , edges _1 = edges ; _i < edges _1 . length ; _i ++ ) {
var e = edges _1 [ _i ] ;
var v _1 = nodes [ la . getSourceIndex ( e ) ] ,
w = nodes [ la . getTargetIndex ( e ) ] ;
v _1 . out . push ( w ) ;
}
for ( var _a = 0 , nodes _1 = nodes ; _a < nodes _1 . length ; _a ++ ) {
var v = nodes _1 [ _a ] ;
if ( typeof v . index === 'undefined' )
strongConnect ( v ) ;
}
return components ;
}
exports . stronglyConnectedComponents = stronglyConnectedComponents ;
} , { } ] ,
13 : [ function ( require , module , exports ) {
"use strict" ;
var PowerEdge = ( function ( ) {
function PowerEdge ( source , target , type ) {
this . source = source ;
this . target = target ;
this . type = type ;
}
return PowerEdge ;
} ( ) ) ;
exports . PowerEdge = PowerEdge ;
var Configuration = ( function ( ) {
function Configuration ( n , edges , linkAccessor , rootGroup ) {
var _this = this ;
this . linkAccessor = linkAccessor ;
this . modules = new Array ( n ) ;
this . roots = [ ] ;
if ( rootGroup ) {
this . initModulesFromGroup ( rootGroup ) ;
} else {
this . roots . push ( new ModuleSet ( ) ) ;
for ( var i = 0 ; i < n ; ++ i )
this . roots [ 0 ] . add ( this . modules [ i ] = new Module ( i ) ) ;
}
this . R = edges . length ;
edges . forEach ( function ( e ) {
var s = _this . modules [ linkAccessor . getSourceIndex ( e ) ] ,
t = _this . modules [ linkAccessor . getTargetIndex ( e ) ] ,
type = linkAccessor . getType ( e ) ;
s . outgoing . add ( type , t ) ;
t . incoming . add ( type , s ) ;
} ) ;
}
Configuration . prototype . initModulesFromGroup = function ( group ) {
var moduleSet = new ModuleSet ( ) ;
this . roots . push ( moduleSet ) ;
for ( var i = 0 ; i < group . leaves . length ; ++ i ) {
var node = group . leaves [ i ] ;
var module = new Module ( node . id ) ;
this . modules [ node . id ] = module ;
moduleSet . add ( module ) ;
}
if ( group . groups ) {
for ( var j = 0 ; j < group . groups . length ; ++ j ) {
var child = group . groups [ j ] ;
var definition = { } ;
for ( var prop in child )
if ( prop !== "leaves" && prop !== "groups" && child . hasOwnProperty ( prop ) )
definition [ prop ] = child [ prop ] ;
moduleSet . add ( new Module ( - 1 - j , new LinkSets ( ) , new LinkSets ( ) , this . initModulesFromGroup ( child ) , definition ) ) ;
}
}
return moduleSet ;
} ;
Configuration . prototype . merge = function ( a , b , k ) {
if ( k === void 0 ) { k = 0 ; }
var inInt = a . incoming . intersection ( b . incoming ) ,
outInt = a . outgoing . intersection ( b . outgoing ) ;
var children = new ModuleSet ( ) ;
children . add ( a ) ;
children . add ( b ) ;
var m = new Module ( this . modules . length , outInt , inInt , children ) ;
this . modules . push ( m ) ;
var update = function ( s , i , o ) {
s . forAll ( function ( ms , linktype ) {
ms . forAll ( function ( n ) {
var nls = n [ i ] ;
nls . add ( linktype , m ) ;
nls . remove ( linktype , a ) ;
nls . remove ( linktype , b ) ;
a [ o ] . remove ( linktype , n ) ;
b [ o ] . remove ( linktype , n ) ;
} ) ;
} ) ;
} ;
update ( outInt , "incoming" , "outgoing" ) ;
update ( inInt , "outgoing" , "incoming" ) ;
this . R -= inInt . count ( ) + outInt . count ( ) ;
this . roots [ k ] . remove ( a ) ;
this . roots [ k ] . remove ( b ) ;
this . roots [ k ] . add ( m ) ;
return m ;
} ;
Configuration . prototype . rootMerges = function ( k ) {
if ( k === void 0 ) { k = 0 ; }
var rs = this . roots [ k ] . modules ( ) ;
var n = rs . length ;
var merges = new Array ( n * ( n - 1 ) ) ;
var ctr = 0 ;
for ( var i = 0 , i _ = n - 1 ; i < i _ ; ++ i ) {
for ( var j = i + 1 ; j < n ; ++ j ) {
var a = rs [ i ] ,
b = rs [ j ] ;
merges [ ctr ] = { id : ctr , nEdges : this . nEdges ( a , b ) , a : a , b : b } ;
ctr ++ ;
}
}
return merges ;
} ;
Configuration . prototype . greedyMerge = function ( ) {
for ( var i = 0 ; i < this . roots . length ; ++ i ) {
if ( this . roots [ i ] . modules ( ) . length < 2 )
continue ;
var ms = this . rootMerges ( i ) . sort ( function ( a , b ) { return a . nEdges == b . nEdges ? a . id - b . id : a . nEdges - b . nEdges ; } ) ;
var m = ms [ 0 ] ;
if ( m . nEdges >= this . R )
continue ;
this . merge ( m . a , m . b , i ) ;
return true ;
}
} ;
Configuration . prototype . nEdges = function ( a , b ) {
var inInt = a . incoming . intersection ( b . incoming ) ,
outInt = a . outgoing . intersection ( b . outgoing ) ;
return this . R - inInt . count ( ) - outInt . count ( ) ;
} ;
Configuration . prototype . getGroupHierarchy = function ( retargetedEdges ) {
var _this = this ;
var groups = [ ] ;
var root = { } ;
toGroups ( this . roots [ 0 ] , root , groups ) ;
var es = this . allEdges ( ) ;
es . forEach ( function ( e ) {
var a = _this . modules [ e . source ] ;
var b = _this . modules [ e . target ] ;
retargetedEdges . push ( new PowerEdge ( typeof a . gid === "undefined" ? e . source : groups [ a . gid ] , typeof b . gid === "undefined" ? e . target : groups [ b . gid ] , e . type ) ) ;
} ) ;
return groups ;
} ;
Configuration . prototype . allEdges = function ( ) {
var es = [ ] ;
Configuration . getEdges ( this . roots [ 0 ] , es ) ;
return es ;
} ;
Configuration . getEdges = function ( modules , es ) {
modules . forAll ( function ( m ) {
m . getEdges ( es ) ;
Configuration . getEdges ( m . children , es ) ;
} ) ;
} ;
return Configuration ;
} ( ) ) ;
exports . Configuration = Configuration ;
function toGroups ( modules , group , groups ) {
modules . forAll ( function ( m ) {
if ( m . isLeaf ( ) ) {
if ( ! group . leaves )
group . leaves = [ ] ;
group . leaves . push ( m . id ) ;
} else {
var g = group ;
m . gid = groups . length ;
if ( ! m . isIsland ( ) || m . isPredefined ( ) ) {
g = { id : m . gid } ;
if ( m . isPredefined ( ) )
for ( var prop in m . definition )
g [ prop ] = m . definition [ prop ] ;
if ( ! group . groups )
group . groups = [ ] ;
group . groups . push ( m . gid ) ;
groups . push ( g ) ;
}
toGroups ( m . children , g , groups ) ;
}
} ) ;
}
var Module = ( function ( ) {
function Module ( id , outgoing , incoming , children , definition ) {
if ( outgoing === void 0 ) { outgoing = new LinkSets ( ) ; }
if ( incoming === void 0 ) { incoming = new LinkSets ( ) ; }
if ( children === void 0 ) { children = new ModuleSet ( ) ; }
this . id = id ;
this . outgoing = outgoing ;
this . incoming = incoming ;
this . children = children ;
this . definition = definition ;
}
Module . prototype . getEdges = function ( es ) {
var _this = this ;
this . outgoing . forAll ( function ( ms , edgetype ) {
ms . forAll ( function ( target ) {
es . push ( new PowerEdge ( _this . id , target . id , edgetype ) ) ;
} ) ;
} ) ;
} ;
Module . prototype . isLeaf = function ( ) {
return this . children . count ( ) === 0 ;
} ;
Module . prototype . isIsland = function ( ) {
return this . outgoing . count ( ) === 0 && this . incoming . count ( ) === 0 ;
} ;
Module . prototype . isPredefined = function ( ) {
return typeof this . definition !== "undefined" ;
} ;
return Module ;
} ( ) ) ;
exports . Module = Module ;
function intersection ( m , n ) {
var i = { } ;
for ( var v in m )
if ( v in n )
i [ v ] = m [ v ] ;
return i ;
}
var ModuleSet = ( function ( ) {
function ModuleSet ( ) {
this . table = { } ;
}
ModuleSet . prototype . count = function ( ) {
return Object . keys ( this . table ) . length ;
} ;
ModuleSet . prototype . intersection = function ( other ) {
var result = new ModuleSet ( ) ;
result . table = intersection ( this . table , other . table ) ;
return result ;
} ;
ModuleSet . prototype . intersectionCount = function ( other ) {
return this . intersection ( other ) . count ( ) ;
} ;
ModuleSet . prototype . contains = function ( id ) {
return id in this . table ;
} ;
ModuleSet . prototype . add = function ( m ) {
this . table [ m . id ] = m ;
} ;
ModuleSet . prototype . remove = function ( m ) {
delete this . table [ m . id ] ;
} ;
ModuleSet . prototype . forAll = function ( f ) {
for ( var mid in this . table ) {
f ( this . table [ mid ] ) ;
}
} ;
ModuleSet . prototype . modules = function ( ) {
var vs = [ ] ;
this . forAll ( function ( m ) {
if ( ! m . isPredefined ( ) )
vs . push ( m ) ;
} ) ;
return vs ;
} ;
return ModuleSet ;
} ( ) ) ;
exports . ModuleSet = ModuleSet ;
var LinkSets = ( function ( ) {
function LinkSets ( ) {
this . sets = { } ;
this . n = 0 ;
}
LinkSets . prototype . count = function ( ) {
return this . n ;
} ;
LinkSets . prototype . contains = function ( id ) {
var result = false ;
this . forAllModules ( function ( m ) {
if ( ! result && m . id == id ) {
result = true ;
}
} ) ;
return result ;
} ;
LinkSets . prototype . add = function ( linktype , m ) {
var s = linktype in this . sets ? this . sets [ linktype ] : this . sets [ linktype ] = new ModuleSet ( ) ;
s . add ( m ) ;
++ this . n ;
} ;
LinkSets . prototype . remove = function ( linktype , m ) {
var ms = this . sets [ linktype ] ;
ms . remove ( m ) ;
if ( ms . count ( ) === 0 ) {
delete this . sets [ linktype ] ;
}
-- this . n ;
} ;
LinkSets . prototype . forAll = function ( f ) {
for ( var linktype in this . sets ) {
f ( this . sets [ linktype ] , Number ( linktype ) ) ;
}
} ;
LinkSets . prototype . forAllModules = function ( f ) {
this . forAll ( function ( ms , lt ) { return ms . forAll ( f ) ; } ) ;
} ;
LinkSets . prototype . intersection = function ( other ) {
var result = new LinkSets ( ) ;
this . forAll ( function ( ms , lt ) {
if ( lt in other . sets ) {
var i = ms . intersection ( other . sets [ lt ] ) ,
n = i . count ( ) ;
if ( n > 0 ) {
result . sets [ lt ] = i ;
result . n += n ;
}
}
} ) ;
return result ;
} ;
return LinkSets ;
} ( ) ) ;
exports . LinkSets = LinkSets ;
function intersectionCount ( m , n ) {
return Object . keys ( intersection ( m , n ) ) . length ;
}
function getGroups ( nodes , links , la , rootGroup ) {
var n = nodes . length ,
c = new Configuration ( n , links , la , rootGroup ) ;
while ( c . greedyMerge ( ) )
;
var powerEdges = [ ] ;
var g = c . getGroupHierarchy ( powerEdges ) ;
powerEdges . forEach ( function ( e ) {
var f = function ( end ) {
var g = e [ end ] ;
if ( typeof g == "number" )
e [ end ] = nodes [ g ] ;
} ;
f ( "source" ) ;
f ( "target" ) ;
} ) ;
return { groups : g , powerEdges : powerEdges } ;
}
exports . getGroups = getGroups ;
} , { } ] ,
14 : [ function ( require , module , exports ) {
"use strict" ;
var PairingHeap = ( function ( ) {
function PairingHeap ( elem ) {
this . elem = elem ;
this . subheaps = [ ] ;
}
PairingHeap . prototype . toString = function ( selector ) {
var str = "" ,
needComma = false ;
for ( var i = 0 ; i < this . subheaps . length ; ++ i ) {
var subheap = this . subheaps [ i ] ;
if ( ! subheap . elem ) {
needComma = false ;
continue ;
}
if ( needComma ) {
str = str + "," ;
}
str = str + subheap . toString ( selector ) ;
needComma = true ;
}
if ( str !== "" ) {
str = "(" + str + ")" ;
}
return ( this . elem ? selector ( this . elem ) : "" ) + str ;
} ;
PairingHeap . prototype . forEach = function ( f ) {
if ( ! this . empty ( ) ) {
f ( this . elem , this ) ;
this . subheaps . forEach ( function ( s ) { return s . forEach ( f ) ; } ) ;
}
} ;
PairingHeap . prototype . count = function ( ) {
return this . empty ( ) ? 0 : 1 + this . subheaps . reduce ( function ( n , h ) {
return n + h . count ( ) ;
} , 0 ) ;
} ;
PairingHeap . prototype . min = function ( ) {
return this . elem ;
} ;
PairingHeap . prototype . empty = function ( ) {
return this . elem == null ;
} ;
PairingHeap . prototype . contains = function ( h ) {
if ( this === h )
return true ;
for ( var i = 0 ; i < this . subheaps . length ; i ++ ) {
if ( this . subheaps [ i ] . contains ( h ) )
return true ;
}
return false ;
} ;
PairingHeap . prototype . isHeap = function ( lessThan ) {
var _this = this ;
return this . subheaps . every ( function ( h ) { return lessThan ( _this . elem , h . elem ) && h . isHeap ( lessThan ) ; } ) ;
} ;
PairingHeap . prototype . insert = function ( obj , lessThan ) {
return this . merge ( new PairingHeap ( obj ) , lessThan ) ;
} ;
PairingHeap . prototype . merge = function ( heap2 , lessThan ) {
if ( this . empty ( ) )
return heap2 ;
else if ( heap2 . empty ( ) )
return this ;
else if ( lessThan ( this . elem , heap2 . elem ) ) {
this . subheaps . push ( heap2 ) ;
return this ;
} else {
heap2 . subheaps . push ( this ) ;
return heap2 ;
}
} ;
PairingHeap . prototype . removeMin = function ( lessThan ) {
if ( this . empty ( ) )
return null ;
else
return this . mergePairs ( lessThan ) ;
} ;
PairingHeap . prototype . mergePairs = function ( lessThan ) {
if ( this . subheaps . length == 0 )
return new PairingHeap ( null ) ;
else if ( this . subheaps . length == 1 ) {
return this . subheaps [ 0 ] ;
} else {
var firstPair = this . subheaps . pop ( ) . merge ( this . subheaps . pop ( ) , lessThan ) ;
var remaining = this . mergePairs ( lessThan ) ;
return firstPair . merge ( remaining , lessThan ) ;
}
} ;
PairingHeap . prototype . decreaseKey = function ( subheap , newValue , setHeapNode , lessThan ) {
var newHeap = subheap . removeMin ( lessThan ) ;
subheap . elem = newHeap . elem ;
subheap . subheaps = newHeap . subheaps ;
if ( setHeapNode !== null && newHeap . elem !== null ) {
setHeapNode ( subheap . elem , subheap ) ;
}
var pairingNode = new PairingHeap ( newValue ) ;
if ( setHeapNode !== null ) {
setHeapNode ( newValue , pairingNode ) ;
}
return this . merge ( pairingNode , lessThan ) ;
} ;
return PairingHeap ;
} ( ) ) ;
exports . PairingHeap = PairingHeap ;
var PriorityQueue = ( function ( ) {
function PriorityQueue ( lessThan ) {
this . lessThan = lessThan ;
}
PriorityQueue . prototype . top = function ( ) {
if ( this . empty ( ) ) {
return null ;
}
return this . root . elem ;
} ;
PriorityQueue . prototype . push = function ( ) {
var args = [ ] ;
for ( var _i = 0 ; _i < arguments . length ; _i ++ ) {
args [ _i ] = arguments [ _i ] ;
}
var pairingNode ;
for ( var i = 0 , arg ; arg = args [ i ] ; ++ i ) {
pairingNode = new PairingHeap ( arg ) ;
this . root = this . empty ( ) ?
pairingNode : this . root . merge ( pairingNode , this . lessThan ) ;
}
return pairingNode ;
} ;
PriorityQueue . prototype . empty = function ( ) {
return ! this . root || ! this . root . elem ;
} ;
PriorityQueue . prototype . isHeap = function ( ) {
return this . root . isHeap ( this . lessThan ) ;
} ;
PriorityQueue . prototype . forEach = function ( f ) {
this . root . forEach ( f ) ;
} ;
PriorityQueue . prototype . pop = function ( ) {
if ( this . empty ( ) ) {
return null ;
}
var obj = this . root . min ( ) ;
this . root = this . root . removeMin ( this . lessThan ) ;
return obj ;
} ;
PriorityQueue . prototype . reduceKey = function ( heapNode , newKey , setHeapNode ) {
if ( setHeapNode === void 0 ) { setHeapNode = null ; }
this . root = this . root . decreaseKey ( heapNode , newKey , setHeapNode , this . lessThan ) ;
} ;
PriorityQueue . prototype . toString = function ( selector ) {
return this . root . toString ( selector ) ;
} ;
PriorityQueue . prototype . count = function ( ) {
return this . root . count ( ) ;
} ;
return PriorityQueue ;
} ( ) ) ;
exports . PriorityQueue = PriorityQueue ;
} , { } ] ,
15 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var TreeBase = ( function ( ) {
function TreeBase ( ) {
this . findIter = function ( data ) {
var res = this . _root ;
var iter = this . iterator ( ) ;
while ( res !== null ) {
var c = this . _comparator ( data , res . data ) ;
if ( c === 0 ) {
iter . _cursor = res ;
return iter ;
} else {
iter . _ancestors . push ( res ) ;
res = res . get _child ( c > 0 ) ;
}
}
return null ;
} ;
}
TreeBase . prototype . clear = function ( ) {
this . _root = null ;
this . size = 0 ;
} ; ;
TreeBase . prototype . find = function ( data ) {
var res = this . _root ;
while ( res !== null ) {
var c = this . _comparator ( data , res . data ) ;
if ( c === 0 ) {
return res . data ;
} else {
res = res . get _child ( c > 0 ) ;
}
}
return null ;
} ; ;
TreeBase . prototype . lowerBound = function ( data ) {
return this . _bound ( data , this . _comparator ) ;
} ; ;
TreeBase . prototype . upperBound = function ( data ) {
var cmp = this . _comparator ;
function reverse _cmp ( a , b ) {
return cmp ( b , a ) ;
}
return this . _bound ( data , reverse _cmp ) ;
} ; ;
TreeBase . prototype . min = function ( ) {
var res = this . _root ;
if ( res === null ) {
return null ;
}
while ( res . left !== null ) {
res = res . left ;
}
return res . data ;
} ; ;
TreeBase . prototype . max = function ( ) {
var res = this . _root ;
if ( res === null ) {
return null ;
}
while ( res . right !== null ) {
res = res . right ;
}
return res . data ;
} ; ;
TreeBase . prototype . iterator = function ( ) {
return new Iterator ( this ) ;
} ; ;
TreeBase . prototype . each = function ( cb ) {
var it = this . iterator ( ) ,
data ;
while ( ( data = it . next ( ) ) !== null ) {
cb ( data ) ;
}
} ; ;
TreeBase . prototype . reach = function ( cb ) {
var it = this . iterator ( ) ,
data ;
while ( ( data = it . prev ( ) ) !== null ) {
cb ( data ) ;
}
} ; ;
TreeBase . prototype . _bound = function ( data , cmp ) {
var cur = this . _root ;
var iter = this . iterator ( ) ;
while ( cur !== null ) {
var c = this . _comparator ( data , cur . data ) ;
if ( c === 0 ) {
iter . _cursor = cur ;
return iter ;
}
iter . _ancestors . push ( cur ) ;
cur = cur . get _child ( c > 0 ) ;
}
for ( var i = iter . _ancestors . length - 1 ; i >= 0 ; -- i ) {
cur = iter . _ancestors [ i ] ;
if ( cmp ( data , cur . data ) > 0 ) {
iter . _cursor = cur ;
iter . _ancestors . length = i ;
return iter ;
}
}
iter . _ancestors . length = 0 ;
return iter ;
} ; ;
return TreeBase ;
} ( ) ) ;
exports . TreeBase = TreeBase ;
var Iterator = ( function ( ) {
function Iterator ( tree ) {
this . _tree = tree ;
this . _ancestors = [ ] ;
this . _cursor = null ;
}
Iterator . prototype . data = function ( ) {
return this . _cursor !== null ? this . _cursor . data : null ;
} ; ;
Iterator . prototype . next = function ( ) {
if ( this . _cursor === null ) {
var root = this . _tree . _root ;
if ( root !== null ) {
this . _minNode ( root ) ;
}
} else {
if ( this . _cursor . right === null ) {
var save ;
do {
save = this . _cursor ;
if ( this . _ancestors . length ) {
this . _cursor = this . _ancestors . pop ( ) ;
} else {
this . _cursor = null ;
break ;
}
} while ( this . _cursor . right === save ) ;
} else {
this . _ancestors . push ( this . _cursor ) ;
this . _minNode ( this . _cursor . right ) ;
}
}
return this . _cursor !== null ? this . _cursor . data : null ;
} ; ;
Iterator . prototype . prev = function ( ) {
if ( this . _cursor === null ) {
var root = this . _tree . _root ;
if ( root !== null ) {
this . _maxNode ( root ) ;
}
} else {
if ( this . _cursor . left === null ) {
var save ;
do {
save = this . _cursor ;
if ( this . _ancestors . length ) {
this . _cursor = this . _ancestors . pop ( ) ;
} else {
this . _cursor = null ;
break ;
}
} while ( this . _cursor . left === save ) ;
} else {
this . _ancestors . push ( this . _cursor ) ;
this . _maxNode ( this . _cursor . left ) ;
}
}
return this . _cursor !== null ? this . _cursor . data : null ;
} ; ;
Iterator . prototype . _minNode = function ( start ) {
while ( start . left !== null ) {
this . _ancestors . push ( start ) ;
start = start . left ;
}
this . _cursor = start ;
} ; ;
Iterator . prototype . _maxNode = function ( start ) {
while ( start . right !== null ) {
this . _ancestors . push ( start ) ;
start = start . right ;
}
this . _cursor = start ;
} ; ;
return Iterator ;
} ( ) ) ;
exports . Iterator = Iterator ;
var Node = ( function ( ) {
function Node ( data ) {
this . data = data ;
this . left = null ;
this . right = null ;
this . red = true ;
}
Node . prototype . get _child = function ( dir ) {
return dir ? this . right : this . left ;
} ; ;
Node . prototype . set _child = function ( dir , val ) {
if ( dir ) {
this . right = val ;
} else {
this . left = val ;
}
} ; ;
return Node ;
} ( ) ) ;
var RBTree = ( function ( _super ) {
_ _extends ( RBTree , _super ) ;
function RBTree ( comparator ) {
var _this = _super . call ( this ) || this ;
_this . _root = null ;
_this . _comparator = comparator ;
_this . size = 0 ;
return _this ;
}
RBTree . prototype . insert = function ( data ) {
var ret = false ;
if ( this . _root === null ) {
this . _root = new Node ( data ) ;
ret = true ;
this . size ++ ;
} else {
var head = new Node ( undefined ) ;
var dir = false ;
var last = false ;
var gp = null ;
var ggp = head ;
var p = null ;
var node = this . _root ;
ggp . right = this . _root ;
while ( true ) {
if ( node === null ) {
node = new Node ( data ) ;
p . set _child ( dir , node ) ;
ret = true ;
this . size ++ ;
} else if ( RBTree . is _red ( node . left ) && RBTree . is _red ( node . right ) ) {
node . red = true ;
node . left . red = false ;
node . right . red = false ;
}
if ( RBTree . is _red ( node ) && RBTree . is _red ( p ) ) {
var dir2 = ggp . right === gp ;
if ( node === p . get _child ( last ) ) {
ggp . set _child ( dir2 , RBTree . single _rotate ( gp , ! last ) ) ;
} else {
ggp . set _child ( dir2 , RBTree . double _rotate ( gp , ! last ) ) ;
}
}
var cmp = this . _comparator ( node . data , data ) ;
if ( cmp === 0 ) {
break ;
}
last = dir ;
dir = cmp < 0 ;
if ( gp !== null ) {
ggp = gp ;
}
gp = p ;
p = node ;
node = node . get _child ( dir ) ;
}
this . _root = head . right ;
}
this . _root . red = false ;
return ret ;
} ; ;
RBTree . prototype . remove = function ( data ) {
if ( this . _root === null ) {
return false ;
}
var head = new Node ( undefined ) ;
var node = head ;
node . right = this . _root ;
var p = null ;
var gp = null ;
var found = null ;
var dir = true ;
while ( node . get _child ( dir ) !== null ) {
var last = dir ;
gp = p ;
p = node ;
node = node . get _child ( dir ) ;
var cmp = this . _comparator ( data , node . data ) ;
dir = cmp > 0 ;
if ( cmp === 0 ) {
found = node ;
}
if ( ! RBTree . is _red ( node ) && ! RBTree . is _red ( node . get _child ( dir ) ) ) {
if ( RBTree . is _red ( node . get _child ( ! dir ) ) ) {
var sr = RBTree . single _rotate ( node , dir ) ;
p . set _child ( last , sr ) ;
p = sr ;
} else if ( ! RBTree . is _red ( node . get _child ( ! dir ) ) ) {
var sibling = p . get _child ( ! last ) ;
if ( sibling !== null ) {
if ( ! RBTree . is _red ( sibling . get _child ( ! last ) ) && ! RBTree . is _red ( sibling . get _child ( last ) ) ) {
p . red = false ;
sibling . red = true ;
node . red = true ;
} else {
var dir2 = gp . right === p ;
if ( RBTree . is _red ( sibling . get _child ( last ) ) ) {
gp . set _child ( dir2 , RBTree . double _rotate ( p , last ) ) ;
} else if ( RBTree . is _red ( sibling . get _child ( ! last ) ) ) {
gp . set _child ( dir2 , RBTree . single _rotate ( p , last ) ) ;
}
var gpc = gp . get _child ( dir2 ) ;
gpc . red = true ;
node . red = true ;
gpc . left . red = false ;
gpc . right . red = false ;
}
}
}
}
}
if ( found !== null ) {
found . data = node . data ;
p . set _child ( p . right === node , node . get _child ( node . left === null ) ) ;
this . size -- ;
}
this . _root = head . right ;
if ( this . _root !== null ) {
this . _root . red = false ;
}
return found !== null ;
} ; ;
RBTree . is _red = function ( node ) {
return node !== null && node . red ;
} ;
RBTree . single _rotate = function ( root , dir ) {
var save = root . get _child ( ! dir ) ;
root . set _child ( ! dir , save . get _child ( dir ) ) ;
save . set _child ( dir , root ) ;
root . red = true ;
save . red = false ;
return save ;
} ;
RBTree . double _rotate = function ( root , dir ) {
root . set _child ( ! dir , RBTree . single _rotate ( root . get _child ( ! dir ) , ! dir ) ) ;
return RBTree . single _rotate ( root , dir ) ;
} ;
return RBTree ;
} ( TreeBase ) ) ;
exports . RBTree = RBTree ;
} , { } ] ,
16 : [ function ( require , module , exports ) {
"use strict" ;
var _ _extends = ( this && this . _ _extends ) || function ( d , b ) {
for ( var p in b )
if ( b . hasOwnProperty ( p ) ) d [ p ] = b [ p ] ;
function _ _ ( ) { this . constructor = d ; }
d . prototype = b === null ? Object . create ( b ) : ( _ _ . prototype = b . prototype , new _ _ ( ) ) ;
} ;
var vpsc _1 = require ( "./vpsc" ) ;
var rbtree _1 = require ( "./rbtree" ) ;
function computeGroupBounds ( g ) {
g . bounds = typeof g . leaves !== "undefined" ?
g . leaves . reduce ( function ( r , c ) { return c . bounds . union ( r ) ; } , Rectangle . empty ( ) ) :
Rectangle . empty ( ) ;
if ( typeof g . groups !== "undefined" )
g . bounds = g . groups . reduce ( function ( r , c ) { return computeGroupBounds ( c ) . union ( r ) ; } , g . bounds ) ;
g . bounds = g . bounds . inflate ( g . padding ) ;
return g . bounds ;
}
exports . computeGroupBounds = computeGroupBounds ;
var Rectangle = ( function ( ) {
function Rectangle ( x , X , y , Y ) {
this . x = x ;
this . X = X ;
this . y = y ;
this . Y = Y ;
}
Rectangle . empty = function ( ) { return new Rectangle ( Number . POSITIVE _INFINITY , Number . NEGATIVE _INFINITY , Number . POSITIVE _INFINITY , Number . NEGATIVE _INFINITY ) ; } ;
Rectangle . prototype . cx = function ( ) { return ( this . x + this . X ) / 2 ; } ;
Rectangle . prototype . cy = function ( ) { return ( this . y + this . Y ) / 2 ; } ;
Rectangle . prototype . overlapX = function ( r ) {
var ux = this . cx ( ) ,
vx = r . cx ( ) ;
if ( ux <= vx && r . x < this . X )
return this . X - r . x ;
if ( vx <= ux && this . x < r . X )
return r . X - this . x ;
return 0 ;
} ;
Rectangle . prototype . overlapY = function ( r ) {
var uy = this . cy ( ) ,
vy = r . cy ( ) ;
if ( uy <= vy && r . y < this . Y )
return this . Y - r . y ;
if ( vy <= uy && this . y < r . Y )
return r . Y - this . y ;
return 0 ;
} ;
Rectangle . prototype . setXCentre = function ( cx ) {
var dx = cx - this . cx ( ) ;
this . x += dx ;
this . X += dx ;
} ;
Rectangle . prototype . setYCentre = function ( cy ) {
var dy = cy - this . cy ( ) ;
this . y += dy ;
this . Y += dy ;
} ;
Rectangle . prototype . width = function ( ) {
return this . X - this . x ;
} ;
Rectangle . prototype . height = function ( ) {
return this . Y - this . y ;
} ;
Rectangle . prototype . union = function ( r ) {
return new Rectangle ( Math . min ( this . x , r . x ) , Math . max ( this . X , r . X ) , Math . min ( this . y , r . y ) , Math . max ( this . Y , r . Y ) ) ;
} ;
Rectangle . prototype . lineIntersections = function ( x1 , y1 , x2 , y2 ) {
var sides = [
[ this . x , this . y , this . X , this . y ] ,
[ this . X , this . y , this . X , this . Y ] ,
[ this . X , this . Y , this . x , this . Y ] ,
[ this . x , this . Y , this . x , this . y ]
] ;
var intersections = [ ] ;
for ( var i = 0 ; i < 4 ; ++ i ) {
var r = Rectangle . lineIntersection ( x1 , y1 , x2 , y2 , sides [ i ] [ 0 ] , sides [ i ] [ 1 ] , sides [ i ] [ 2 ] , sides [ i ] [ 3 ] ) ;
if ( r !== null )
intersections . push ( { x : r . x , y : r . y } ) ;
}
return intersections ;
} ;
Rectangle . prototype . rayIntersection = function ( x2 , y2 ) {
var ints = this . lineIntersections ( this . cx ( ) , this . cy ( ) , x2 , y2 ) ;
return ints . length > 0 ? ints [ 0 ] : null ;
} ;
Rectangle . prototype . vertices = function ( ) {
return [
{ x : this . x , y : this . y } ,
{ x : this . X , y : this . y } ,
{ x : this . X , y : this . Y } ,
{ x : this . x , y : this . Y } ,
{ x : this . x , y : this . y }
] ;
} ;
Rectangle . lineIntersection = function ( x1 , y1 , x2 , y2 , x3 , y3 , x4 , y4 ) {
var dx12 = x2 - x1 ,
dx34 = x4 - x3 ,
dy12 = y2 - y1 ,
dy34 = y4 - y3 ,
denominator = dy34 * dx12 - dx34 * dy12 ;
if ( denominator == 0 )
return null ;
var dx31 = x1 - x3 ,
dy31 = y1 - y3 ,
numa = dx34 * dy31 - dy34 * dx31 ,
a = numa / denominator ,
numb = dx12 * dy31 - dy12 * dx31 ,
b = numb / denominator ;
if ( a >= 0 && a <= 1 && b >= 0 && b <= 1 ) {
return {
x : x1 + a * dx12 ,
y : y1 + a * dy12
} ;
}
return null ;
} ;
Rectangle . prototype . inflate = function ( pad ) {
return new Rectangle ( this . x - pad , this . X + pad , this . y - pad , this . Y + pad ) ;
} ;
return Rectangle ;
} ( ) ) ;
exports . Rectangle = Rectangle ;
function makeEdgeBetween ( source , target , ah ) {
var si = source . rayIntersection ( target . cx ( ) , target . cy ( ) ) || { x : source . cx ( ) , y : source . cy ( ) } ,
ti = target . rayIntersection ( source . cx ( ) , source . cy ( ) ) || { x : target . cx ( ) , y : target . cy ( ) } ,
dx = ti . x - si . x ,
dy = ti . y - si . y ,
l = Math . sqrt ( dx * dx + dy * dy ) ,
al = l - ah ;
return {
sourceIntersection : si ,
targetIntersection : ti ,
arrowStart : { x : si . x + al * dx / l , y : si . y + al * dy / l }
} ;
}
exports . makeEdgeBetween = makeEdgeBetween ;
function makeEdgeTo ( s , target , ah ) {
var ti = target . rayIntersection ( s . x , s . y ) ;
if ( ! ti )
ti = { x : target . cx ( ) , y : target . cy ( ) } ;
var dx = ti . x - s . x ,
dy = ti . y - s . y ,
l = Math . sqrt ( dx * dx + dy * dy ) ;
return { x : ti . x - ah * dx / l , y : ti . y - ah * dy / l } ;
}
exports . makeEdgeTo = makeEdgeTo ;
var Node = ( function ( ) {
function Node ( v , r , pos ) {
this . v = v ;
this . r = r ;
this . pos = pos ;
this . prev = makeRBTree ( ) ;
this . next = makeRBTree ( ) ;
}
return Node ;
} ( ) ) ;
var Event = ( function ( ) {
function Event ( isOpen , v , pos ) {
this . isOpen = isOpen ;
this . v = v ;
this . pos = pos ;
}
return Event ;
} ( ) ) ;
function compareEvents ( a , b ) {
if ( a . pos > b . pos ) {
return 1 ;
}
if ( a . pos < b . pos ) {
return - 1 ;
}
if ( a . isOpen ) {
return - 1 ;
}
if ( b . isOpen ) {
return 1 ;
}
return 0 ;
}
function makeRBTree ( ) {
return new rbtree _1 . RBTree ( function ( a , b ) { return a . pos - b . pos ; } ) ;
}
var xRect = {
getCentre : function ( r ) { return r . cx ( ) ; } ,
getOpen : function ( r ) { return r . y ; } ,
getClose : function ( r ) { return r . Y ; } ,
getSize : function ( r ) { return r . width ( ) ; } ,
makeRect : function ( open , close , center , size ) { return new Rectangle ( center - size / 2 , center + size / 2 , open , close ) ; } ,
findNeighbours : findXNeighbours
} ;
var yRect = {
getCentre : function ( r ) { return r . cy ( ) ; } ,
getOpen : function ( r ) { return r . x ; } ,
getClose : function ( r ) { return r . X ; } ,
getSize : function ( r ) { return r . height ( ) ; } ,
makeRect : function ( open , close , center , size ) { return new Rectangle ( open , close , center - size / 2 , center + size / 2 ) ; } ,
findNeighbours : findYNeighbours
} ;
function generateGroupConstraints ( root , f , minSep , isContained ) {
if ( isContained === void 0 ) { isContained = false ; }
var padding = root . padding ,
gn = typeof root . groups !== 'undefined' ? root . groups . length : 0 ,
ln = typeof root . leaves !== 'undefined' ? root . leaves . length : 0 ,
childConstraints = ! gn ? [ ] :
root . groups . reduce ( function ( ccs , g ) { return ccs . concat ( generateGroupConstraints ( g , f , minSep , true ) ) ; } , [ ] ) ,
n = ( isContained ? 2 : 0 ) + ln + gn ,
vs = new Array ( n ) ,
rs = new Array ( n ) ,
i = 0 ,
add = function ( r , v ) {
rs [ i ] = r ;
vs [ i ++ ] = v ;
} ;
if ( isContained ) {
var b = root . bounds ,
c = f . getCentre ( b ) ,
s = f . getSize ( b ) / 2 ,
open = f . getOpen ( b ) ,
close = f . getClose ( b ) ,
min = c - s + padding / 2 ,
max = c + s - padding / 2 ;
root . minVar . desiredPosition = min ;
add ( f . makeRect ( open , close , min , padding ) , root . minVar ) ;
root . maxVar . desiredPosition = max ;
add ( f . makeRect ( open , close , max , padding ) , root . maxVar ) ;
}
if ( ln )
root . leaves . forEach ( function ( l ) { return add ( l . bounds , l . variable ) ; } ) ;
if ( gn )
root . groups . forEach ( function ( g ) {
var b = g . bounds ;
add ( f . makeRect ( f . getOpen ( b ) , f . getClose ( b ) , f . getCentre ( b ) , f . getSize ( b ) ) , g . minVar ) ;
} ) ;
var cs = generateConstraints ( rs , vs , f , minSep ) ;
if ( gn ) {
vs . forEach ( function ( v ) { v . cOut = [ ] , v . cIn = [ ] ; } ) ;
cs . forEach ( function ( c ) { c . left . cOut . push ( c ) , c . right . cIn . push ( c ) ; } ) ;
root . groups . forEach ( function ( g ) {
var gapAdjustment = ( g . padding - f . getSize ( g . bounds ) ) / 2 ;
g . minVar . cIn . forEach ( function ( c ) { return c . gap += gapAdjustment ; } ) ;
g . minVar . cOut . forEach ( function ( c ) {
c . left = g . maxVar ;
c . gap += gapAdjustment ;
} ) ;
} ) ;
}
return childConstraints . concat ( cs ) ;
}
function generateConstraints ( rs , vars , rect , minSep ) {
var i , n = rs . length ;
var N = 2 * n ;
console . assert ( vars . length >= n ) ;
var events = new Array ( N ) ;
for ( i = 0 ; i < n ; ++ i ) {
var r = rs [ i ] ;
var v = new Node ( vars [ i ] , r , rect . getCentre ( r ) ) ;
events [ i ] = new Event ( true , v , rect . getOpen ( r ) ) ;
events [ i + n ] = new Event ( false , v , rect . getClose ( r ) ) ;
}
events . sort ( compareEvents ) ;
var cs = new Array ( ) ;
var scanline = makeRBTree ( ) ;
for ( i = 0 ; i < N ; ++ i ) {
var e = events [ i ] ;
var v = e . v ;
if ( e . isOpen ) {
scanline . insert ( v ) ;
rect . findNeighbours ( v , scanline ) ;
} else {
scanline . remove ( v ) ;
var makeConstraint = function ( l , r ) {
var sep = ( rect . getSize ( l . r ) + rect . getSize ( r . r ) ) / 2 + minSep ;
cs . push ( new vpsc _1 . Constraint ( l . v , r . v , sep ) ) ;
} ;
var visitNeighbours = function ( forward , reverse , mkcon ) {
var u , it = v [ forward ] . iterator ( ) ;
while ( ( u = it [ forward ] ( ) ) !== null ) {
mkcon ( u , v ) ;
u [ reverse ] . remove ( v ) ;
}
} ;
visitNeighbours ( "prev" , "next" , function ( u , v ) { return makeConstraint ( u , v ) ; } ) ;
visitNeighbours ( "next" , "prev" , function ( u , v ) { return makeConstraint ( v , u ) ; } ) ;
}
}
console . assert ( scanline . size === 0 ) ;
return cs ;
}
function findXNeighbours ( v , scanline ) {
var f = function ( forward , reverse ) {
var it = scanline . findIter ( v ) ;
var u ;
while ( ( u = it [ forward ] ( ) ) !== null ) {
var uovervX = u . r . overlapX ( v . r ) ;
if ( uovervX <= 0 || uovervX <= u . r . overlapY ( v . r ) ) {
v [ forward ] . insert ( u ) ;
u [ reverse ] . insert ( v ) ;
}
if ( uovervX <= 0 ) {
break ;
}
}
} ;
f ( "next" , "prev" ) ;
f ( "prev" , "next" ) ;
}
function findYNeighbours ( v , scanline ) {
var f = function ( forward , reverse ) {
var u = scanline . findIter ( v ) [ forward ] ( ) ;
if ( u !== null && u . r . overlapX ( v . r ) > 0 ) {
v [ forward ] . insert ( u ) ;
u [ reverse ] . insert ( v ) ;
}
} ;
f ( "next" , "prev" ) ;
f ( "prev" , "next" ) ;
}
function generateXConstraints ( rs , vars ) {
return generateConstraints ( rs , vars , xRect , 1e-6 ) ;
}
exports . generateXConstraints = generateXConstraints ;
function generateYConstraints ( rs , vars ) {
return generateConstraints ( rs , vars , yRect , 1e-6 ) ;
}
exports . generateYConstraints = generateYConstraints ;
function generateXGroupConstraints ( root ) {
return generateGroupConstraints ( root , xRect , 1e-6 ) ;
}
exports . generateXGroupConstraints = generateXGroupConstraints ;
function generateYGroupConstraints ( root ) {
return generateGroupConstraints ( root , yRect , 1e-6 ) ;
}
exports . generateYGroupConstraints = generateYGroupConstraints ;
function removeOverlaps ( rs ) {
var vs = rs . map ( function ( r ) { return new vpsc _1 . Variable ( r . cx ( ) ) ; } ) ;
var cs = generateXConstraints ( rs , vs ) ;
var solver = new vpsc _1 . Solver ( vs , cs ) ;
solver . solve ( ) ;
vs . forEach ( function ( v , i ) { return rs [ i ] . setXCentre ( v . position ( ) ) ; } ) ;
vs = rs . map ( function ( r ) { return new vpsc _1 . Variable ( r . cy ( ) ) ; } ) ;
cs = generateYConstraints ( rs , vs ) ;
solver = new vpsc _1 . Solver ( vs , cs ) ;
solver . solve ( ) ;
vs . forEach ( function ( v , i ) { return rs [ i ] . setYCentre ( v . position ( ) ) ; } ) ;
}
exports . removeOverlaps = removeOverlaps ;
var IndexedVariable = ( function ( _super ) {
_ _extends ( IndexedVariable , _super ) ;
function IndexedVariable ( index , w ) {
var _this = _super . call ( this , 0 , w ) || this ;
_this . index = index ;
return _this ;
}
return IndexedVariable ;
} ( vpsc _1 . Variable ) ) ;
exports . IndexedVariable = IndexedVariable ;
var Projection = ( function ( ) {
function Projection ( nodes , groups , rootGroup , constraints , avoidOverlaps ) {
if ( rootGroup === void 0 ) { rootGroup = null ; }
if ( constraints === void 0 ) { constraints = null ; }
if ( avoidOverlaps === void 0 ) { avoidOverlaps = false ; }
var _this = this ;
this . nodes = nodes ;
this . groups = groups ;
this . rootGroup = rootGroup ;
this . avoidOverlaps = avoidOverlaps ;
this . variables = nodes . map ( function ( v , i ) {
return v . variable = new IndexedVariable ( i , 1 ) ;
} ) ;
if ( constraints )
this . createConstraints ( constraints ) ;
if ( avoidOverlaps && rootGroup && typeof rootGroup . groups !== 'undefined' ) {
nodes . forEach ( function ( v ) {
if ( ! v . width || ! v . height ) {
v . bounds = new Rectangle ( v . x , v . x , v . y , v . y ) ;
return ;
}
var w2 = v . width / 2 ,
h2 = v . height / 2 ;
v . bounds = new Rectangle ( v . x - w2 , v . x + w2 , v . y - h2 , v . y + h2 ) ;
} ) ;
computeGroupBounds ( rootGroup ) ;
var i = nodes . length ;
groups . forEach ( function ( g ) {
_this . variables [ i ] = g . minVar = new IndexedVariable ( i ++ , typeof g . stiffness !== "undefined" ? g . stiffness : 0.01 ) ;
_this . variables [ i ] = g . maxVar = new IndexedVariable ( i ++ , typeof g . stiffness !== "undefined" ? g . stiffness : 0.01 ) ;
} ) ;
}
}
Projection . prototype . createSeparation = function ( c ) {
return new vpsc _1 . Constraint ( this . nodes [ c . left ] . variable , this . nodes [ c . right ] . variable , c . gap , typeof c . equality !== "undefined" ? c . equality : false ) ;
} ;
Projection . prototype . makeFeasible = function ( c ) {
var _this = this ;
if ( ! this . avoidOverlaps )
return ;
var axis = 'x' ,
dim = 'width' ;
if ( c . axis === 'x' )
axis = 'y' , dim = 'height' ;
var vs = c . offsets . map ( function ( o ) { return _this . nodes [ o . node ] ; } ) . sort ( function ( a , b ) { return a [ axis ] - b [ axis ] ; } ) ;
var p = null ;
vs . forEach ( function ( v ) {
if ( p )
v [ axis ] = p [ axis ] + p [ dim ] + 1 ;
p = v ;
} ) ;
} ;
Projection . prototype . createAlignment = function ( c ) {
var _this = this ;
var u = this . nodes [ c . offsets [ 0 ] . node ] . variable ;
this . makeFeasible ( c ) ;
var cs = c . axis === 'x' ? this . xConstraints : this . yConstraints ;
c . offsets . slice ( 1 ) . forEach ( function ( o ) {
var v = _this . nodes [ o . node ] . variable ;
cs . push ( new vpsc _1 . Constraint ( u , v , o . offset , true ) ) ;
} ) ;
} ;
Projection . prototype . createConstraints = function ( constraints ) {
var _this = this ;
var isSep = function ( c ) { return typeof c . type === 'undefined' || c . type === 'separation' ; } ;
this . xConstraints = constraints
. filter ( function ( c ) { return c . axis === "x" && isSep ( c ) ; } )
. map ( function ( c ) { return _this . createSeparation ( c ) ; } ) ;
this . yConstraints = constraints
. filter ( function ( c ) { return c . axis === "y" && isSep ( c ) ; } )
. map ( function ( c ) { return _this . createSeparation ( c ) ; } ) ;
constraints
. filter ( function ( c ) { return c . type === 'alignment' ; } )
. forEach ( function ( c ) { return _this . createAlignment ( c ) ; } ) ;
} ;
Projection . prototype . setupVariablesAndBounds = function ( x0 , y0 , desired , getDesired ) {
this . nodes . forEach ( function ( v , i ) {
if ( v . fixed ) {
v . variable . weight = v . fixedWeight ? v . fixedWeight : 1000 ;
desired [ i ] = getDesired ( v ) ;
} else {
v . variable . weight = 1 ;
}
var w = ( v . width || 0 ) / 2 ,
h = ( v . height || 0 ) / 2 ;
var ix = x0 [ i ] ,
iy = y0 [ i ] ;
v . bounds = new Rectangle ( ix - w , ix + w , iy - h , iy + h ) ;
} ) ;
} ;
Projection . prototype . xProject = function ( x0 , y0 , x ) {
if ( ! this . rootGroup && ! ( this . avoidOverlaps || this . xConstraints ) )
return ;
this . project ( x0 , y0 , x0 , x , function ( v ) { return v . px ; } , this . xConstraints , generateXGroupConstraints , function ( v ) { return v . bounds . setXCentre ( x [ v . variable . index ] = v . variable . position ( ) ) ; } , function ( g ) {
var xmin = x [ g . minVar . index ] = g . minVar . position ( ) ;
var xmax = x [ g . maxVar . index ] = g . maxVar . position ( ) ;
var p2 = g . padding / 2 ;
g . bounds . x = xmin - p2 ;
g . bounds . X = xmax + p2 ;
} ) ;
} ;
Projection . prototype . yProject = function ( x0 , y0 , y ) {
if ( ! this . rootGroup && ! this . yConstraints )
return ;
this . project ( x0 , y0 , y0 , y , function ( v ) { return v . py ; } , this . yConstraints , generateYGroupConstraints , function ( v ) { return v . bounds . setYCentre ( y [ v . variable . index ] = v . variable . position ( ) ) ; } , function ( g ) {
var ymin = y [ g . minVar . index ] = g . minVar . position ( ) ;
var ymax = y [ g . maxVar . index ] = g . maxVar . position ( ) ;
var p2 = g . padding / 2 ;
g . bounds . y = ymin - p2 ; ;
g . bounds . Y = ymax + p2 ;
} ) ;
} ;
Projection . prototype . projectFunctions = function ( ) {
var _this = this ;
return [
function ( x0 , y0 , x ) { return _this . xProject ( x0 , y0 , x ) ; } ,
function ( x0 , y0 , y ) { return _this . yProject ( x0 , y0 , y ) ; }
] ;
} ;
Projection . prototype . project = function ( x0 , y0 , start , desired , getDesired , cs , generateConstraints , updateNodeBounds , updateGroupBounds ) {
this . setupVariablesAndBounds ( x0 , y0 , desired , getDesired ) ;
if ( this . rootGroup && this . avoidOverlaps ) {
computeGroupBounds ( this . rootGroup ) ;
cs = cs . concat ( generateConstraints ( this . rootGroup ) ) ;
}
this . solve ( this . variables , cs , start , desired ) ;
this . nodes . forEach ( updateNodeBounds ) ;
if ( this . rootGroup && this . avoidOverlaps ) {
this . groups . forEach ( updateGroupBounds ) ;
computeGroupBounds ( this . rootGroup ) ;
}
} ;
Projection . prototype . solve = function ( vs , cs , starting , desired ) {
var solver = new vpsc _1 . Solver ( vs , cs ) ;
solver . setStartingPositions ( starting ) ;
solver . setDesiredPositions ( desired ) ;
solver . solve ( ) ;
} ;
return Projection ;
} ( ) ) ;
exports . Projection = Projection ;
} , { "./rbtree" : 15 , "./vpsc" : 18 } ] ,
17 : [ function ( require , module , exports ) {
"use strict" ;
var pqueue _1 = require ( "./pqueue" ) ;
var Neighbour = ( function ( ) {
function Neighbour ( id , distance ) {
this . id = id ;
this . distance = distance ;
}
return Neighbour ;
} ( ) ) ;
var Node = ( function ( ) {
function Node ( id ) {
this . id = id ;
this . neighbours = [ ] ;
}
return Node ;
} ( ) ) ;
var QueueEntry = ( function ( ) {
function QueueEntry ( node , prev , d ) {
this . node = node ;
this . prev = prev ;
this . d = d ;
}
return QueueEntry ;
} ( ) ) ;
var Calculator = ( function ( ) {
function Calculator ( n , es , getSourceIndex , getTargetIndex , getLength ) {
this . n = n ;
this . es = es ;
this . neighbours = new Array ( this . n ) ;
var i = this . n ;
while ( i -- )
this . neighbours [ i ] = new Node ( i ) ;
i = this . es . length ;
while ( i -- ) {
var e = this . es [ i ] ;
var u = getSourceIndex ( e ) ,
v = getTargetIndex ( e ) ;
var d = getLength ( e ) ;
this . neighbours [ u ] . neighbours . push ( new Neighbour ( v , d ) ) ;
this . neighbours [ v ] . neighbours . push ( new Neighbour ( u , d ) ) ;
}
}
Calculator . prototype . DistanceMatrix = function ( ) {
var D = new Array ( this . n ) ;
for ( var i = 0 ; i < this . n ; ++ i ) {
D [ i ] = this . dijkstraNeighbours ( i ) ;
}
return D ;
} ;
Calculator . prototype . DistancesFromNode = function ( start ) {
return this . dijkstraNeighbours ( start ) ;
} ;
Calculator . prototype . PathFromNodeToNode = function ( start , end ) {
return this . dijkstraNeighbours ( start , end ) ;
} ;
Calculator . prototype . PathFromNodeToNodeWithPrevCost = function ( start , end , prevCost ) {
var q = new pqueue _1 . PriorityQueue ( function ( a , b ) { return a . d <= b . d ; } ) ,
u = this . neighbours [ start ] ,
qu = new QueueEntry ( u , null , 0 ) ,
visitedFrom = { } ;
q . push ( qu ) ;
while ( ! q . empty ( ) ) {
qu = q . pop ( ) ;
u = qu . node ;
if ( u . id === end ) {
break ;
}
var i = u . neighbours . length ;
while ( i -- ) {
var neighbour = u . neighbours [ i ] ,
v = this . neighbours [ neighbour . id ] ;
if ( qu . prev && v . id === qu . prev . node . id )
continue ;
var viduid = v . id + ',' + u . id ;
if ( viduid in visitedFrom && visitedFrom [ viduid ] <= qu . d )
continue ;
var cc = qu . prev ? prevCost ( qu . prev . node . id , u . id , v . id ) : 0 ,
t = qu . d + neighbour . distance + cc ;
visitedFrom [ viduid ] = t ;
q . push ( new QueueEntry ( v , qu , t ) ) ;
}
}
var path = [ ] ;
while ( qu . prev ) {
qu = qu . prev ;
path . push ( qu . node . id ) ;
}
return path ;
} ;
Calculator . prototype . dijkstraNeighbours = function ( start , dest ) {
if ( dest === void 0 ) { dest = - 1 ; }
var q = new pqueue _1 . PriorityQueue ( function ( a , b ) { return a . d <= b . d ; } ) ,
i = this . neighbours . length ,
d = new Array ( i ) ;
while ( i -- ) {
var node = this . neighbours [ i ] ;
node . d = i === start ? 0 : Number . POSITIVE _INFINITY ;
node . q = q . push ( node ) ;
}
while ( ! q . empty ( ) ) {
var u = q . pop ( ) ;
d [ u . id ] = u . d ;
if ( u . id === dest ) {
var path = [ ] ;
var v = u ;
while ( typeof v . prev !== 'undefined' ) {
path . push ( v . prev . id ) ;
v = v . prev ;
}
return path ;
}
i = u . neighbours . length ;
while ( i -- ) {
var neighbour = u . neighbours [ i ] ;
var v = this . neighbours [ neighbour . id ] ;
var t = u . d + neighbour . distance ;
if ( u . d !== Number . MAX _VALUE && v . d > t ) {
v . d = t ;
v . prev = u ;
q . reduceKey ( v . q , v , function ( e , q ) { return e . q = q ; } ) ;
}
}
}
return d ;
} ;
return Calculator ;
} ( ) ) ;
exports . Calculator = Calculator ;
} , { "./pqueue" : 14 } ] ,
18 : [ function ( require , module , exports ) {
"use strict" ;
var PositionStats = ( function ( ) {
function PositionStats ( scale ) {
this . scale = scale ;
this . AB = 0 ;
this . AD = 0 ;
this . A2 = 0 ;
}
PositionStats . prototype . addVariable = function ( v ) {
var ai = this . scale / v . scale ;
var bi = v . offset / v . scale ;
var wi = v . weight ;
this . AB += wi * ai * bi ;
this . AD += wi * ai * v . desiredPosition ;
this . A2 += wi * ai * ai ;
} ;
PositionStats . prototype . getPosn = function ( ) {
return ( this . AD - this . AB ) / this . A2 ;
} ;
return PositionStats ;
} ( ) ) ;
exports . PositionStats = PositionStats ;
var Constraint = ( function ( ) {
function Constraint ( left , right , gap , equality ) {
if ( equality === void 0 ) { equality = false ; }
this . left = left ;
this . right = right ;
this . gap = gap ;
this . equality = equality ;
this . active = false ;
this . unsatisfiable = false ;
this . left = left ;
this . right = right ;
this . gap = gap ;
this . equality = equality ;
}
Constraint . prototype . slack = function ( ) {
return this . unsatisfiable ? Number . MAX _VALUE :
this . right . scale * this . right . position ( ) - this . gap -
this . left . scale * this . left . position ( ) ;
} ;
return Constraint ;
} ( ) ) ;
exports . Constraint = Constraint ;
var Variable = ( function ( ) {
function Variable ( desiredPosition , weight , scale ) {
if ( weight === void 0 ) { weight = 1 ; }
if ( scale === void 0 ) { scale = 1 ; }
this . desiredPosition = desiredPosition ;
this . weight = weight ;
this . scale = scale ;
this . offset = 0 ;
}
Variable . prototype . dfdv = function ( ) {
return 2.0 * this . weight * ( this . position ( ) - this . desiredPosition ) ;
} ;
Variable . prototype . position = function ( ) {
return ( this . block . ps . scale * this . block . posn + this . offset ) / this . scale ;
} ;
Variable . prototype . visitNeighbours = function ( prev , f ) {
var ff = function ( c , next ) { return c . active && prev !== next && f ( c , next ) ; } ;
this . cOut . forEach ( function ( c ) { return ff ( c , c . right ) ; } ) ;
this . cIn . forEach ( function ( c ) { return ff ( c , c . left ) ; } ) ;
} ;
return Variable ;
} ( ) ) ;
exports . Variable = Variable ;
var Block = ( function ( ) {
function Block ( v ) {
this . vars = [ ] ;
v . offset = 0 ;
this . ps = new PositionStats ( v . scale ) ;
this . addVariable ( v ) ;
}
Block . prototype . addVariable = function ( v ) {
v . block = this ;
this . vars . push ( v ) ;
this . ps . addVariable ( v ) ;
this . posn = this . ps . getPosn ( ) ;
} ;
Block . prototype . updateWeightedPosition = function ( ) {
this . ps . AB = this . ps . AD = this . ps . A2 = 0 ;
for ( var i = 0 , n = this . vars . length ; i < n ; ++ i )
this . ps . addVariable ( this . vars [ i ] ) ;
this . posn = this . ps . getPosn ( ) ;
} ;
Block . prototype . compute _lm = function ( v , u , postAction ) {
var _this = this ;
var dfdv = v . dfdv ( ) ;
v . visitNeighbours ( u , function ( c , next ) {
var _dfdv = _this . compute _lm ( next , v , postAction ) ;
if ( next === c . right ) {
dfdv += _dfdv * c . left . scale ;
c . lm = _dfdv ;
} else {
dfdv += _dfdv * c . right . scale ;
c . lm = - _dfdv ;
}
postAction ( c ) ;
} ) ;
return dfdv / v . scale ;
} ;
Block . prototype . populateSplitBlock = function ( v , prev ) {
var _this = this ;
v . visitNeighbours ( prev , function ( c , next ) {
next . offset = v . offset + ( next === c . right ? c . gap : - c . gap ) ;
_this . addVariable ( next ) ;
_this . populateSplitBlock ( next , v ) ;
} ) ;
} ;
Block . prototype . traverse = function ( visit , acc , v , prev ) {
var _this = this ;
if ( v === void 0 ) { v = this . vars [ 0 ] ; }
if ( prev === void 0 ) { prev = null ; }
v . visitNeighbours ( prev , function ( c , next ) {
acc . push ( visit ( c ) ) ;
_this . traverse ( visit , acc , next , v ) ;
} ) ;
} ;
Block . prototype . findMinLM = function ( ) {
var m = null ;
this . compute _lm ( this . vars [ 0 ] , null , function ( c ) {
if ( ! c . equality && ( m === null || c . lm < m . lm ) )
m = c ;
} ) ;
return m ;
} ;
Block . prototype . findMinLMBetween = function ( lv , rv ) {
this . compute _lm ( lv , null , function ( ) { } ) ;
var m = null ;
this . findPath ( lv , null , rv , function ( c , next ) {
if ( ! c . equality && c . right === next && ( m === null || c . lm < m . lm ) )
m = c ;
} ) ;
return m ;
} ;
Block . prototype . findPath = function ( v , prev , to , visit ) {
var _this = this ;
var endFound = false ;
v . visitNeighbours ( prev , function ( c , next ) {
if ( ! endFound && ( next === to || _this . findPath ( next , v , to , visit ) ) ) {
endFound = true ;
visit ( c , next ) ;
}
} ) ;
return endFound ;
} ;
Block . prototype . isActiveDirectedPathBetween = function ( u , v ) {
if ( u === v )
return true ;
var i = u . cOut . length ;
while ( i -- ) {
var c = u . cOut [ i ] ;
if ( c . active && this . isActiveDirectedPathBetween ( c . right , v ) )
return true ;
}
return false ;
} ;
Block . split = function ( c ) {
c . active = false ;
return [ Block . createSplitBlock ( c . left ) , Block . createSplitBlock ( c . right ) ] ;
} ;
Block . createSplitBlock = function ( startVar ) {
var b = new Block ( startVar ) ;
b . populateSplitBlock ( startVar , null ) ;
return b ;
} ;
Block . prototype . splitBetween = function ( vl , vr ) {
var c = this . findMinLMBetween ( vl , vr ) ;
if ( c !== null ) {
var bs = Block . split ( c ) ;
return { constraint : c , lb : bs [ 0 ] , rb : bs [ 1 ] } ;
}
return null ;
} ;
Block . prototype . mergeAcross = function ( b , c , dist ) {
c . active = true ;
for ( var i = 0 , n = b . vars . length ; i < n ; ++ i ) {
var v = b . vars [ i ] ;
v . offset += dist ;
this . addVariable ( v ) ;
}
this . posn = this . ps . getPosn ( ) ;
} ;
Block . prototype . cost = function ( ) {
var sum = 0 ,
i = this . vars . length ;
while ( i -- ) {
var v = this . vars [ i ] ,
d = v . position ( ) - v . desiredPosition ;
sum += d * d * v . weight ;
}
return sum ;
} ;
return Block ;
} ( ) ) ;
exports . Block = Block ;
var Blocks = ( function ( ) {
function Blocks ( vs ) {
this . vs = vs ;
var n = vs . length ;
this . list = new Array ( n ) ;
while ( n -- ) {
var b = new Block ( vs [ n ] ) ;
this . list [ n ] = b ;
b . blockInd = n ;
}
}
Blocks . prototype . cost = function ( ) {
var sum = 0 ,
i = this . list . length ;
while ( i -- )
sum += this . list [ i ] . cost ( ) ;
return sum ;
} ;
Blocks . prototype . insert = function ( b ) {
b . blockInd = this . list . length ;
this . list . push ( b ) ;
} ;
Blocks . prototype . remove = function ( b ) {
var last = this . list . length - 1 ;
var swapBlock = this . list [ last ] ;
this . list . length = last ;
if ( b !== swapBlock ) {
this . list [ b . blockInd ] = swapBlock ;
swapBlock . blockInd = b . blockInd ;
}
} ;
Blocks . prototype . merge = function ( c ) {
var l = c . left . block ,
r = c . right . block ;
var dist = c . right . offset - c . left . offset - c . gap ;
if ( l . vars . length < r . vars . length ) {
r . mergeAcross ( l , c , dist ) ;
this . remove ( l ) ;
} else {
l . mergeAcross ( r , c , - dist ) ;
this . remove ( r ) ;
}
} ;
Blocks . prototype . forEach = function ( f ) {
this . list . forEach ( f ) ;
} ;
Blocks . prototype . updateBlockPositions = function ( ) {
this . list . forEach ( function ( b ) { return b . updateWeightedPosition ( ) ; } ) ;
} ;
Blocks . prototype . split = function ( inactive ) {
var _this = this ;
this . updateBlockPositions ( ) ;
this . list . forEach ( function ( b ) {
var v = b . findMinLM ( ) ;
if ( v !== null && v . lm < Solver . LAGRANGIAN _TOLERANCE ) {
b = v . left . block ;
Block . split ( v ) . forEach ( function ( nb ) { return _this . insert ( nb ) ; } ) ;
_this . remove ( b ) ;
inactive . push ( v ) ;
}
} ) ;
} ;
return Blocks ;
} ( ) ) ;
exports . Blocks = Blocks ;
var Solver = ( function ( ) {
function Solver ( vs , cs ) {
this . vs = vs ;
this . cs = cs ;
this . vs = vs ;
vs . forEach ( function ( v ) {
v . cIn = [ ] , v . cOut = [ ] ;
} ) ;
this . cs = cs ;
cs . forEach ( function ( c ) {
c . left . cOut . push ( c ) ;
c . right . cIn . push ( c ) ;
} ) ;
this . inactive = cs . map ( function ( c ) { c . active = false ; return c ; } ) ;
this . bs = null ;
}
Solver . prototype . cost = function ( ) {
return this . bs . cost ( ) ;
} ;
Solver . prototype . setStartingPositions = function ( ps ) {
this . inactive = this . cs . map ( function ( c ) { c . active = false ; return c ; } ) ;
this . bs = new Blocks ( this . vs ) ;
this . bs . forEach ( function ( b , i ) { return b . posn = ps [ i ] ; } ) ;
} ;
Solver . prototype . setDesiredPositions = function ( ps ) {
this . vs . forEach ( function ( v , i ) { return v . desiredPosition = ps [ i ] ; } ) ;
} ;
Solver . prototype . mostViolated = function ( ) {
var minSlack = Number . MAX _VALUE ,
v = null ,
l = this . inactive ,
n = l . length ,
deletePoint = n ;
for ( var i = 0 ; i < n ; ++ i ) {
var c = l [ i ] ;
if ( c . unsatisfiable )
continue ;
var slack = c . slack ( ) ;
if ( c . equality || slack < minSlack ) {
minSlack = slack ;
v = c ;
deletePoint = i ;
if ( c . equality )
break ;
}
}
if ( deletePoint !== n &&
( minSlack < Solver . ZERO _UPPERBOUND && ! v . active || v . equality ) ) {
l [ deletePoint ] = l [ n - 1 ] ;
l . length = n - 1 ;
}
return v ;
} ;
Solver . prototype . satisfy = function ( ) {
if ( this . bs == null ) {
this . bs = new Blocks ( this . vs ) ;
}
this . bs . split ( this . inactive ) ;
var v = null ;
while ( ( v = this . mostViolated ( ) ) && ( v . equality || v . slack ( ) < Solver . ZERO _UPPERBOUND && ! v . active ) ) {
var lb = v . left . block ,
rb = v . right . block ;
if ( lb !== rb ) {
this . bs . merge ( v ) ;
} else {
if ( lb . isActiveDirectedPathBetween ( v . right , v . left ) ) {
v . unsatisfiable = true ;
continue ;
}
var split = lb . splitBetween ( v . left , v . right ) ;
if ( split !== null ) {
this . bs . insert ( split . lb ) ;
this . bs . insert ( split . rb ) ;
this . bs . remove ( lb ) ;
this . inactive . push ( split . constraint ) ;
} else {
v . unsatisfiable = true ;
continue ;
}
if ( v . slack ( ) >= 0 ) {
this . inactive . push ( v ) ;
} else {
this . bs . merge ( v ) ;
}
}
}
} ;
Solver . prototype . solve = function ( ) {
this . satisfy ( ) ;
var lastcost = Number . MAX _VALUE ,
cost = this . bs . cost ( ) ;
while ( Math . abs ( lastcost - cost ) > 0.0001 ) {
this . satisfy ( ) ;
lastcost = cost ;
cost = this . bs . cost ( ) ;
}
return cost ;
} ;
return Solver ;
} ( ) ) ;
Solver . LAGRANGIAN _TOLERANCE = - 1e-4 ;
Solver . ZERO _UPPERBOUND = - 1e-10 ;
exports . Solver = Solver ;
function removeOverlapInOneDimension ( spans , lowerBound , upperBound ) {
var vs = spans . map ( function ( s ) { return new Variable ( s . desiredCenter ) ; } ) ;
var cs = [ ] ;
var n = spans . length ;
for ( var i = 0 ; i < n - 1 ; i ++ ) {
var left = spans [ i ] ,
right = spans [ i + 1 ] ;
cs . push ( new Constraint ( vs [ i ] , vs [ i + 1 ] , ( left . size + right . size ) / 2 ) ) ;
}
var leftMost = vs [ 0 ] ,
rightMost = vs [ n - 1 ] ,
leftMostSize = spans [ 0 ] . size / 2 ,
rightMostSize = spans [ n - 1 ] . size / 2 ;
var vLower = null ,
vUpper = null ;
if ( lowerBound ) {
vLower = new Variable ( lowerBound , leftMost . weight * 1000 ) ;
vs . push ( vLower ) ;
cs . push ( new Constraint ( vLower , leftMost , leftMostSize ) ) ;
}
if ( upperBound ) {
vUpper = new Variable ( upperBound , rightMost . weight * 1000 ) ;
vs . push ( vUpper ) ;
cs . push ( new Constraint ( rightMost , vUpper , rightMostSize ) ) ;
}
var solver = new Solver ( vs , cs ) ;
solver . solve ( ) ;
return {
newCenters : vs . slice ( 0 , spans . length ) . map ( function ( v ) { return v . position ( ) ; } ) ,
lowerBound : vLower ? vLower . position ( ) : leftMost . position ( ) - leftMostSize ,
upperBound : vUpper ? vUpper . position ( ) : rightMost . position ( ) + rightMostSize
} ;
}
exports . removeOverlapInOneDimension = removeOverlapInOneDimension ;
} , { } ]
} , { } , [ 1 ] ) ( 1 )
} ) ;
/***/
} ) ,
/* 139 */
/***/
( function ( module , exports ) {
module . exports = function ( module ) {
if ( ! module . webpackPolyfill ) {
module . deprecate = function ( ) { } ;
module . paths = [ ] ;
// module.parent = undefined by default
if ( ! module . children ) module . children = [ ] ;
Object . defineProperty ( module , "loaded" , {
enumerable : true ,
get : function ( ) {
return module . l ;
}
} ) ;
Object . defineProperty ( module , "id" , {
enumerable : true ,
get : function ( ) {
return module . i ;
}
} ) ;
module . webpackPolyfill = 1 ;
}
return module ;
} ;
/***/
} ) ,
/* 140 */
/***/
( function ( module , exports , _ _webpack _require _ _ ) {
"use strict" ;
Object . defineProperty ( exports , "__esModule" , {
value : true
} ) ;
exports . SentenTreeVis = exports . SentenTreeModel = exports . SentenTreeBuilder = exports . WordFilter = exports . tokenizer = undefined ;
var _WordFilter = _ _webpack _require _ _ ( 24 ) ;
Object . defineProperty ( exports , 'WordFilter' , {
enumerable : true ,
get : function get ( ) {
return _interopRequireDefault ( _WordFilter ) . default ;
}
} ) ;
var _SentenTreeBuilder = _ _webpack _require _ _ ( 47 ) ;
Object . defineProperty ( exports , 'SentenTreeBuilder' , {
enumerable : true ,
get : function get ( ) {
return _interopRequireDefault ( _SentenTreeBuilder ) . default ;
}
} ) ;
var _SentenTreeModel = _ _webpack _require _ _ ( 23 ) ;
Object . defineProperty ( exports , 'SentenTreeModel' , {
enumerable : true ,
get : function get ( ) {
return _interopRequireDefault ( _SentenTreeModel ) . default ;
}
} ) ;
var _SentenTreeVis = _ _webpack _require _ _ ( 48 ) ;
Object . defineProperty ( exports , 'SentenTreeVis' , {
enumerable : true ,
get : function get ( ) {
return _interopRequireDefault ( _SentenTreeVis ) . default ;
}
} ) ;
var _tokenize = _ _webpack _require _ _ ( 25 ) ;
var _tokenizer = _interopRequireWildcard ( _tokenize ) ;
function _interopRequireWildcard ( obj ) {
if ( obj && obj . _ _esModule ) { return obj ; } else {
var newObj = { } ;
if ( obj != null ) { for ( var key in obj ) { if ( Object . prototype . hasOwnProperty . call ( obj , key ) ) newObj [ key ] = obj [ key ] ; } }
newObj . default = obj ;
return newObj ;
}
}
function _interopRequireDefault ( obj ) { return obj && obj . _ _esModule ? obj : { default : obj } ; }
var tokenizer = exports . tokenizer = _tokenizer ;
/***/
} )
/******/
] ) ;
} ) ;
