{
+ const coveringSpinner = {
+ visibility: 'visible',
+ position: 'absolute',
+ top: '0',
+ height: '100%',
+ width: '100%',
+ display: 'flex',
+ justifyContent: 'center',
+ alignItems: 'center',
+ };
+ const hiddenContainer = mergeRight(
+ {visibility: 'hidden', position: 'relative'},
+ overlay_style
+ );
+
+ /* Overrides default Loading behavior if target_components is set. By default,
+ * Loading fires when any recursive child enters loading state. This makes loading
+ * opt-in: Loading animation only enabled when one of target components enters loading state.
+ */
+ const isTarget = () => {
+ if (!target_components) {
+ return true;
+ }
+ const isMatchingComponent = () => {
+ return Object.entries(target_components).some(
+ ([component_name, prop_names]) => {
+ // Convert prop_names to an array if it's not already
+ const prop_names_array = Array.isArray(prop_names)
+ ? prop_names
+ : [prop_names];
+
+ return (
+ loading_state.component_name === component_name &&
+ (prop_names_array.includes('*') ||
+ prop_names_array.some(
+ prop_name =>
+ loading_state.prop_name === prop_name
+ ))
+ );
+ }
+ );
+ };
+ return isMatchingComponent;
+ };
+
+ const [showSpinner, setShowSpinner] = useState(show_initially);
+ const dismissTimer = useRef();
+ const showTimer = useRef();
+
+ // delay_hide and delay_show is from dash-bootstrap-components dbc.Spinner
+ useEffect(() => {
+ if (display === 'show' || display === 'hide') {
+ setShowSpinner(display === 'show');
+ return;
+ }
+
+ if (loading_state) {
+ if (loading_state.is_loading) {
+ // if component is currently loading and there's a dismiss timer active
+ // we need to clear it.
+ if (dismissTimer.current) {
+ dismissTimer.current = clearTimeout(dismissTimer.current);
+ }
+ // if component is currently loading but the spinner is not showing and
+ // there is no timer set to show, then set a timeout to show
+ if (!showSpinner && !showTimer.current) {
+ showTimer.current = setTimeout(() => {
+ setShowSpinner(isTarget());
+ showTimer.current = null;
+ }, delay_show);
}
- >
- {this.props.children}
-
- {isLoading && (
+ } else {
+ // if component is not currently loading and there's a show timer
+ // active we need to clear it
+ if (showTimer.current) {
+ showTimer.current = clearTimeout(showTimer.current);
+ }
+ // if component is not currently loading and the spinner is showing and
+ // there's no timer set to dismiss it, then set a timeout to hide it
+ if (showSpinner && !dismissTimer.current) {
+ dismissTimer.current = setTimeout(() => {
+ setShowSpinner(false);
+ dismissTimer.current = null;
+ }, delay_hide);
+ }
+ }
+ }
+ }, [delay_hide, delay_show, loading_state, display]);
+
+ const Spinner = showSpinner && getSpinner(spinnerType);
+
+ return (
+
+ {children}
+
+ {showSpinner &&
+ (custom_spinner || (
- )}
-
+ ))}
- );
- }
-}
+
+ );
+};
Loading._dashprivate_isLoadingComponent = true;
Loading.defaultProps = {
type: 'default',
color: '#119DFF',
+ delay_show: 0,
+ delay_hide: 0,
+ show_initially: true,
+ display: 'auto',
};
Loading.propTypes = {
@@ -106,24 +185,24 @@ Loading.propTypes = {
]),
/**
- * Property that determines which spinner to show
+ * Property that determines which built-in spinner to show
* one of 'graph', 'cube', 'circle', 'dot', or 'default'.
*/
type: PropTypes.oneOf(['graph', 'cube', 'circle', 'dot', 'default']),
/**
- * Boolean that makes the spinner display full-screen
+ * Boolean that makes the built-in spinner display full-screen
*/
fullscreen: PropTypes.bool,
/**
- * If true, the spinner will display the component_name and prop_name
+ * If true, the built-in spinner will display the component_name and prop_name
* while loading
*/
debug: PropTypes.bool,
/**
- * Additional CSS class for the spinner root DOM node
+ * Additional CSS class for the built-in spinner root DOM node
*/
className: PropTypes.string,
@@ -133,7 +212,7 @@ Loading.propTypes = {
parent_className: PropTypes.string,
/**
- * Additional CSS styling for the spinner root DOM node
+ * Additional CSS styling for the built-in spinner root DOM node
*/
style: PropTypes.object,
@@ -141,9 +220,14 @@ Loading.propTypes = {
* Additional CSS styling for the outermost dcc.Loading parent div DOM node
*/
parent_style: PropTypes.object,
+ /**
+ * Additional CSS styling for the spinner overlay. This is applied to the
+ * dcc.Loading children while the spinner is active. The default is `{'visibility': 'hidden'}`
+ */
+ overlay_style: PropTypes.object,
/**
- * Primary colour used for the loading spinners
+ * Primary color used for the built-in loading spinners
*/
color: PropTypes.string,
@@ -164,4 +248,46 @@ Loading.propTypes = {
*/
component_name: PropTypes.string,
}),
+
+ /**
+ * Setting display to "show" or "hide" will override the loading state coming from dash-renderer
+ */
+ display: PropTypes.oneOf(['auto', 'show', 'hide']),
+
+ /**
+ * Add a time delay (in ms) to the spinner being removed to prevent flickering.
+ */
+ delay_hide: PropTypes.number,
+
+ /**
+ * Add a time delay (in ms) to the spinner being shown after the loading_state
+ * is set to True.
+ */
+ delay_show: PropTypes.number,
+
+ /**
+ * Whether the Spinner should show on app start-up before the loading state
+ * has been determined. Default True. Use when also setting `delay_show`.
+ */
+ show_initially: PropTypes.bool,
+
+ /**
+ * Specify component and prop to trigger showing the loading spinner
+ * example: `{"output-container": "children", "grid": ["rowData", "columnDefs]}`
+ *
+ */
+ target_components: PropTypes.objectOf(
+ PropTypes.oneOfType([
+ PropTypes.string,
+ PropTypes.arrayOf(PropTypes.string),
+ ])
+ ),
+
+ /**
+ * Component to use rather than the built-in spinner specified in the `type` prop.
+ *
+ */
+ custom_spinner: PropTypes.node,
};
+
+export default Loading;
diff --git a/components/dash-core-components/src/fragments/Dropdown.react.js b/components/dash-core-components/src/fragments/Dropdown.react.js
index 0464fb8ff4..6847be025d 100644
--- a/components/dash-core-components/src/fragments/Dropdown.react.js
+++ b/components/dash-core-components/src/fragments/Dropdown.react.js
@@ -39,10 +39,10 @@ const Dropdown = props => {
const {
id,
clearable,
- searchable,
multi,
options,
setProps,
+ search_value,
style,
loading_state,
value,
@@ -122,7 +122,7 @@ const Dropdown = props => {
useEffect(() => {
if (
- !searchable &&
+ !search_value &&
!isNil(sanitizedOptions) &&
optionsCheck !== sanitizedOptions &&
!isNil(value)
diff --git a/components/dash-core-components/tests/integration/dropdown/test_remove_option.py b/components/dash-core-components/tests/integration/dropdown/test_remove_option.py
index 6986380b45..a90ffe400c 100644
--- a/components/dash-core-components/tests/integration/dropdown/test_remove_option.py
+++ b/components/dash-core-components/tests/integration/dropdown/test_remove_option.py
@@ -1,6 +1,8 @@
import json
-from dash import Dash, html, dcc, Output, Input
+import pytest
+
+from dash import Dash, html, dcc, Output, Input, State
from dash.exceptions import PreventUpdate
@@ -11,7 +13,8 @@
]
-def test_ddro001_remove_option_single(dash_dcc):
+@pytest.mark.parametrize("searchable", (True, False))
+def test_ddro001_remove_option_single(dash_dcc, searchable):
dropdown_options = sample_dropdown_options
app = Dash(__name__)
@@ -22,7 +25,7 @@ def test_ddro001_remove_option_single(dash_dcc):
dcc.Dropdown(
options=dropdown_options,
value=value,
- searchable=False,
+ searchable=searchable,
id="dropdown",
),
html.Button("Remove option", id="remove"),
@@ -38,18 +41,17 @@ def on_click(n_clicks):
@app.callback(Output("value-output", "children"), [Input("dropdown", "value")])
def on_change(val):
- if not val:
- raise PreventUpdate
- return val or "None"
+ return val or "Nothing Here"
dash_dcc.start_server(app)
btn = dash_dcc.wait_for_element("#remove")
btn.click()
- dash_dcc.wait_for_text_to_equal("#value-output", "None")
+ dash_dcc.wait_for_text_to_equal("#value-output", "Nothing Here")
-def test_ddro002_remove_option_multi(dash_dcc):
+@pytest.mark.parametrize("searchable", (True, False))
+def test_ddro002_remove_option_multi(dash_dcc, searchable):
dropdown_options = sample_dropdown_options
app = Dash(__name__)
@@ -62,7 +64,7 @@ def test_ddro002_remove_option_multi(dash_dcc):
value=value,
multi=True,
id="dropdown",
- searchable=False,
+ searchable=searchable,
),
html.Button("Remove option", id="remove"),
html.Div(id="value-output"),
@@ -84,3 +86,64 @@ def on_change(val):
btn.click()
dash_dcc.wait_for_text_to_equal("#value-output", '["MTL"]')
+
+
+def test_ddro003_remove_option_multiple_dropdowns(dash_dcc):
+ app = Dash(__name__)
+ app.layout = html.Div(
+ [
+ dcc.Dropdown(
+ id="available-options",
+ multi=True,
+ options=sample_dropdown_options,
+ value=["MTL", "NYC", "SF"],
+ ),
+ dcc.Dropdown(
+ id="chosen",
+ multi=True,
+ options=sample_dropdown_options,
+ value=["NYC", "SF"],
+ ),
+ html.Button(id="remove-btn", children="Remove"),
+ html.Button(id="submit-btn", children="Submit"),
+ html.Div(id="value-output"),
+ html.Div(id="options-output"),
+ ],
+ )
+
+ @app.callback(
+ Output("chosen", "options"),
+ Input("available-options", "value"),
+ )
+ def update_options(available_options):
+ if available_options is None:
+ return []
+ else:
+ return [{"label": i, "value": i} for i in available_options]
+
+ @app.callback(
+ Output("available-options", "options"), [Input("remove-btn", "n_clicks")]
+ )
+ def on_click(n_clicks):
+ if not n_clicks:
+ raise PreventUpdate
+ return sample_dropdown_options[:-1]
+
+ @app.callback(
+ [Output("value-output", "children"), Output("options-output", "children")],
+ Input("submit-btn", "n_clicks"),
+ State("chosen", "options"),
+ State("chosen", "value"),
+ )
+ def print_value(n_clicks, options, value):
+ if not n_clicks:
+ raise PreventUpdate
+ return [json.dumps(value), json.dumps([i["value"] for i in options])]
+
+ dash_dcc.start_server(app)
+ btn = dash_dcc.wait_for_element("#remove-btn")
+ btn.click()
+ btn = dash_dcc.wait_for_element("#submit-btn")
+ btn.click()
+ dash_dcc.wait_for_text_to_equal("#value-output", '["NYC"]')
+ dash_dcc.wait_for_text_to_equal("#options-output", '["MTL", "NYC"]')
diff --git a/components/dash-core-components/tests/integration/loading/test_loading_component.py b/components/dash-core-components/tests/integration/loading/test_loading_component.py
index b84c1ce72d..e511f01308 100644
--- a/components/dash-core-components/tests/integration/loading/test_loading_component.py
+++ b/components/dash-core-components/tests/integration/loading/test_loading_component.py
@@ -1,6 +1,7 @@
from multiprocessing import Lock
from dash import Dash, Input, Output, dcc, html
from dash.testing import wait
+import time
def test_ldcp001_loading_component_initialization(dash_dcc):
@@ -366,3 +367,324 @@ def test_ldcp008_graph_in_loading_fits_container_height(dash_dcc):
) == dash_dcc.wait_for_element(".outer-container").size.get("height")
assert dash_dcc.get_logs() == []
+
+
+def test_ldcp009_loading_component_overlay_style(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [
+ dcc.Loading(
+ [html.Div(id="div-1")],
+ className="loading",
+ overlay_style={
+ "visibility": "visible",
+ "opacity": 0.5,
+ "backgroundColor": "white",
+ },
+ )
+ ],
+ id="root",
+ )
+
+ @app.callback(Output("div-1", "children"), [Input("root", "n_clicks")])
+ def updateDiv(n_clicks):
+ if n_clicks is not None:
+ with lock:
+ return "changed"
+
+ return "content"
+
+ with lock:
+ dash_dcc.start_server(app)
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+
+ dash_dcc.find_element("#root").click()
+
+ dash_dcc.find_element(".loading .dash-spinner")
+ # unlike the default, the content should be visible
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+ dash_dcc.wait_for_style_to_equal("#root > div", "opacity", "0.5")
+
+ dash_dcc.wait_for_text_to_equal("#div-1", "changed")
+
+ assert dash_dcc.get_logs() == []
+
+
+# multiple components, only one triggers the spinner
+def test_ldcp010_loading_component_target_components(dash_dcc):
+
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [
+ dcc.Loading(
+ [
+ html.Button(id="btn-1"),
+ html.Button(id="btn-2"),
+ ],
+ className="loading-1",
+ target_components={"btn-2": "children"},
+ )
+ ],
+ id="root",
+ )
+
+ @app.callback(Output("btn-1", "children"), [Input("btn-2", "n_clicks")])
+ def updateDiv1(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed 1"
+
+ return "content 1"
+
+ @app.callback(Output("btn-2", "children"), [Input("btn-1", "n_clicks")])
+ def updateDiv2(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed 2"
+
+ return "content 2"
+
+ dash_dcc.start_server(app)
+
+ dash_dcc.wait_for_text_to_equal("#btn-1", "content 1")
+ dash_dcc.wait_for_text_to_equal("#btn-2", "content 2")
+
+ with lock:
+ dash_dcc.find_element("#btn-1").click()
+
+ dash_dcc.find_element(".loading-1 .dash-spinner")
+ dash_dcc.wait_for_text_to_equal("#btn-2", "")
+
+ dash_dcc.wait_for_text_to_equal("#btn-2", "changed 2")
+
+ with lock:
+ dash_dcc.find_element("#btn-2").click()
+ spinners = dash_dcc.find_elements(".loading-1 .dash-spinner")
+ dash_dcc.wait_for_text_to_equal("#btn-1", "")
+
+ dash_dcc.wait_for_text_to_equal("#btn-1", "changed 1")
+ assert spinners == []
+
+ assert dash_dcc.get_logs() == []
+
+
+# update multiple props of same component, only targeted id/prop triggers spinner
+def test_ldcp011_loading_component_target_components(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [
+ dcc.Loading(
+ [
+ html.Button(id="btn-1"),
+ html.Button(id="btn-2"),
+ html.Button(id="btn-3"),
+ ],
+ className="loading-1",
+ target_components={"btn-1": "className"},
+ )
+ ],
+ id="root",
+ )
+
+ @app.callback(Output("btn-1", "children"), [Input("btn-2", "n_clicks")])
+ def updateDiv1(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed 1"
+ return "content 1"
+
+ @app.callback(Output("btn-1", "className"), [Input("btn-3", "n_clicks")])
+ def updateDiv2(n_clicks):
+ if n_clicks:
+ with lock:
+ return "new-class"
+ return ""
+
+ dash_dcc.start_server(app)
+
+ dash_dcc.wait_for_text_to_equal("#btn-1", "content 1")
+
+ with lock:
+ dash_dcc.find_element("#btn-2").click()
+
+ spinners = dash_dcc.find_elements(".loading-1 .dash-spinner")
+ dash_dcc.wait_for_text_to_equal("#btn-1", "")
+ dash_dcc.wait_for_text_to_equal("#btn-1", "changed 1")
+ assert spinners == []
+
+ with lock:
+ dash_dcc.find_element("#btn-3").click()
+
+ dash_dcc.find_element(".loading-1 .dash-spinner")
+ dash_dcc.wait_for_text_to_equal("#btn-1", "")
+
+ dash_dcc.wait_for_class_to_equal("#btn-1", "new-class")
+
+ assert dash_dcc.get_logs() == []
+
+
+def test_ldcp012_loading_component_custom_spinner(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [
+ dcc.Loading(
+ [html.Div(id="div-1")],
+ className="loading",
+ custom_spinner=html.Div(id="my-spinner"),
+ )
+ ],
+ id="root",
+ )
+
+ @app.callback(Output("div-1", "children"), [Input("root", "n_clicks")])
+ def updateDiv(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed"
+ return "content"
+
+ with lock:
+ dash_dcc.start_server(app)
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+
+ dash_dcc.find_element("#root").click()
+
+ dash_spinner = dash_dcc.find_elements(".loading .dash-spinner")
+ dash_dcc.find_element("#my-spinner")
+ # mounted but hidden, so looks like no text
+ dash_dcc.wait_for_text_to_equal("#div-1", "")
+
+ dash_dcc.wait_for_text_to_equal("#div-1", "changed")
+ assert dash_spinner == []
+
+ assert dash_dcc.get_logs() == []
+
+
+def test_ldcp013_loading_component_display_show(dash_dcc):
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [
+ dcc.Loading(
+ [html.Div("content", id="div-1")], className="loading", display="show"
+ )
+ ],
+ id="root",
+ )
+ dash_dcc.start_server(app)
+
+ dash_dcc.find_element(".loading .dash-spinner")
+ # mounted but hidden, so looks like no text
+ dash_dcc.wait_for_text_to_equal("#div-1", "")
+
+ assert dash_dcc.get_logs() == []
+
+
+# Same as ldcp002, but with the display="hide", the spinner should not show
+def test_ldcp014_loading_component_delay_hide(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [dcc.Loading([html.Div(id="div-1")], className="loading", display="hide")],
+ id="root",
+ )
+
+ @app.callback(Output("div-1", "children"), [Input("root", "n_clicks")])
+ def updateDiv(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed"
+ return "content"
+
+ with lock:
+ dash_dcc.start_server(app)
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+
+ dash_dcc.find_element("#root").click()
+
+ spinners = dash_dcc.find_elements(".loading .dash-spinner")
+
+ dash_dcc.wait_for_text_to_equal("#div-1", "changed")
+ assert spinners == []
+
+ assert dash_dcc.get_logs() == []
+
+
+# Same as ldcp002, but with the delay, the spinner should not show
+def test_ldcp015_loading_component_delay_show(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [dcc.Loading([html.Div(id="div-1")], className="loading", delay_show=2500)],
+ id="root",
+ )
+
+ @app.callback(Output("div-1", "children"), [Input("root", "n_clicks")])
+ def updateDiv(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed"
+ return "content"
+
+ with lock:
+ dash_dcc.start_server(app)
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+
+ dash_dcc.find_element("#root").click()
+
+ spinners = dash_dcc.find_elements(".loading .dash-spinner")
+ # mounted but hidden, so looks like no text
+ dash_dcc.wait_for_text_to_equal("#div-1", "")
+
+ dash_dcc.wait_for_text_to_equal("#div-1", "changed")
+ assert spinners == []
+
+ assert dash_dcc.get_logs() == []
+
+
+def test_ldcp016_loading_component_delay_hide(dash_dcc):
+ lock = Lock()
+
+ app = Dash(__name__)
+
+ app.layout = html.Div(
+ [dcc.Loading([html.Div(id="div-1")], className="loading", delay_hide=300)],
+ id="root",
+ )
+
+ @app.callback(Output("div-1", "children"), [Input("root", "n_clicks")])
+ def updateDiv(n_clicks):
+ if n_clicks:
+ with lock:
+ return "changed"
+ return "content"
+
+ with lock:
+ dash_dcc.start_server(app)
+ dash_dcc.wait_for_text_to_equal("#div-1", "content")
+
+ dash_dcc.find_element("#root").click()
+ dash_dcc.find_element(".loading .dash-spinner")
+
+ time.sleep(0.2)
+ dash_dcc.find_element(".loading .dash-spinner")
+ dash_dcc.wait_for_text_to_equal("#div-1", "changed")
+
+ assert dash_dcc.get_logs() == []
diff --git a/components/dash-html-components/package-lock.json b/components/dash-html-components/package-lock.json
index ba0cf4aff5..607516b293 100644
--- a/components/dash-html-components/package-lock.json
+++ b/components/dash-html-components/package-lock.json
@@ -1,23 +1,22 @@
{
"name": "dash-html-components",
- "version": "2.0.17",
+ "version": "2.0.18",
"lockfileVersion": 2,
"requires": true,
"packages": {
"": {
"name": "dash-html-components",
- "version": "2.0.17",
+ "version": "2.0.18",
"license": "MIT",
"dependencies": {
- "@braintree/sanitize-url": "^7.0.0",
"prop-types": "^15.8.1",
"ramda": "^0.29.0"
},
"devDependencies": {
- "@babel/cli": "^7.23.9",
- "@babel/core": "^7.24.0",
- "@babel/preset-env": "^7.24.0",
- "@babel/preset-react": "^7.23.3",
+ "@babel/cli": "^7.24.5",
+ "@babel/core": "^7.24.5",
+ "@babel/preset-env": "^7.24.5",
+ "@babel/preset-react": "^7.24.1",
"babel-loader": "^9.1.3",
"cheerio": "^0.22.0",
"cross-env": "^7.0.3",
@@ -33,7 +32,7 @@
"request": "^2.88.2",
"rimraf": "^5.0.5",
"string": "^3.3.3",
- "webpack": "^5.90.3",
+ "webpack": "^5.91.0",
"webpack-cli": "^5.1.4"
}
},
@@ -60,12 +59,12 @@
}
},
"node_modules/@babel/cli": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.23.9.tgz",
- "integrity": "sha512-vB1UXmGDNEhcf1jNAHKT9IlYk1R+hehVTLFlCLHBi8gfuHQGP6uRjgXVYU0EVlI/qwAWpstqkBdf2aez3/z/5Q==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.24.5.tgz",
+ "integrity": "sha512-2qg1mYtJRsOOWF6IUwLP5jI42P8Cc0hQ5TmnjLrik/4DKouO8dFJN80HEz81VmVeUs97yuuf3vQ/9j7Elrcjlg==",
"dev": true,
"dependencies": {
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@jridgewell/trace-mapping": "^0.3.25",
"commander": "^4.0.1",
"convert-source-map": "^2.0.0",
"fs-readdir-recursive": "^1.1.0",
@@ -89,43 +88,43 @@
}
},
"node_modules/@babel/code-frame": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz",
- "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==",
+ "version": "7.24.2",
+ "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.24.2.tgz",
+ "integrity": "sha512-y5+tLQyV8pg3fsiln67BVLD1P13Eg4lh5RW9mF0zUuvLrv9uIQ4MCL+CRT+FTsBlBjcIan6PGsLcBN0m3ClUyQ==",
"dev": true,
"dependencies": {
- "@babel/highlight": "^7.23.4",
- "chalk": "^2.4.2"
+ "@babel/highlight": "^7.24.2",
+ "picocolors": "^1.0.0"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/compat-data": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.23.5.tgz",
- "integrity": "sha512-uU27kfDRlhfKl+w1U6vp16IuvSLtjAxdArVXPa9BvLkrr7CYIsxH5adpHObeAGY/41+syctUWOZ140a2Rvkgjw==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.24.4.tgz",
+ "integrity": "sha512-vg8Gih2MLK+kOkHJp4gBEIkyaIi00jgWot2D9QOmmfLC8jINSOzmCLta6Bvz/JSBCqnegV0L80jhxkol5GWNfQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/core": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.0.tgz",
- "integrity": "sha512-fQfkg0Gjkza3nf0c7/w6Xf34BW4YvzNfACRLmmb7XRLa6XHdR+K9AlJlxneFfWYf6uhOzuzZVTjF/8KfndZANw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.5.tgz",
+ "integrity": "sha512-tVQRucExLQ02Boi4vdPp49svNGcfL2GhdTCT9aldhXgCJVAI21EtRfBettiuLUwce/7r6bFdgs6JFkcdTiFttA==",
"dev": true,
"dependencies": {
"@ampproject/remapping": "^2.2.0",
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-module-transforms": "^7.23.3",
- "@babel/helpers": "^7.24.0",
- "@babel/parser": "^7.24.0",
+ "@babel/helper-module-transforms": "^7.24.5",
+ "@babel/helpers": "^7.24.5",
+ "@babel/parser": "^7.24.5",
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5",
"convert-source-map": "^2.0.0",
"debug": "^4.1.0",
"gensync": "^1.0.0-beta.2",
@@ -141,14 +140,14 @@
}
},
"node_modules/@babel/generator": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.23.6.tgz",
- "integrity": "sha512-qrSfCYxYQB5owCmGLbl8XRpX1ytXlpueOb0N0UmQwA073KZxejgQTzAmJezxvpwQD9uGtK2shHdi55QT+MbjIw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.24.5.tgz",
+ "integrity": "sha512-x32i4hEXvr+iI0NEoEfDKzlemF8AmtOP8CcrRaEcpzysWuoEb1KknpcvMsHKPONoKZiDuItklgWhB18xEhr9PA==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.23.6",
- "@jridgewell/gen-mapping": "^0.3.2",
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@babel/types": "^7.24.5",
+ "@jridgewell/gen-mapping": "^0.3.5",
+ "@jridgewell/trace-mapping": "^0.3.25",
"jsesc": "^2.5.1"
},
"engines": {
@@ -196,19 +195,19 @@
}
},
"node_modules/@babel/helper-create-class-features-plugin": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.23.7.tgz",
- "integrity": "sha512-xCoqR/8+BoNnXOY7RVSgv6X+o7pmT5q1d+gGcRlXYkI+9B31glE4jeejhKVpA04O1AtzOt7OSQ6VYKP5FcRl9g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.24.5.tgz",
+ "integrity": "sha512-uRc4Cv8UQWnE4NXlYTIIdM7wfFkOqlFztcC/gVXDKohKoVB3OyonfelUBaJzSwpBntZ2KYGF/9S7asCHsXwW6g==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-member-expression-to-functions": "^7.23.0",
+ "@babel/helper-member-expression-to-functions": "^7.24.5",
"@babel/helper-optimise-call-expression": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
+ "@babel/helper-replace-supers": "^7.24.1",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"semver": "^6.3.1"
},
"engines": {
@@ -236,9 +235,9 @@
}
},
"node_modules/@babel/helper-define-polyfill-provider": {
- "version": "0.5.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.5.0.tgz",
- "integrity": "sha512-NovQquuQLAQ5HuyjCz7WQP9MjRj7dx++yspwiyUiGl9ZyadHRSql1HZh5ogRd8W8w6YM6EQ/NTB8rgjLt5W65Q==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.2.tgz",
+ "integrity": "sha512-LV76g+C502biUK6AyZ3LK10vDpDyCzZnhZFXkH1L75zHPj68+qc8Zfpx2th+gzwA2MzyK+1g/3EPl62yFnVttQ==",
"dev": true,
"dependencies": {
"@babel/helper-compilation-targets": "^7.22.6",
@@ -286,40 +285,40 @@
}
},
"node_modules/@babel/helper-member-expression-to-functions": {
- "version": "7.23.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.23.0.tgz",
- "integrity": "sha512-6gfrPwh7OuT6gZyJZvd6WbTfrqAo7vm4xCzAXOusKqq/vWdKXphTpj5klHKNmRUU6/QRGlBsyU9mAIPaWHlqJA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.24.5.tgz",
+ "integrity": "sha512-4owRteeihKWKamtqg4JmWSsEZU445xpFRXPEwp44HbgbxdWlUV1b4Agg4lkA806Lil5XM/e+FJyS0vj5T6vmcA==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.23.0"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-module-imports": {
- "version": "7.22.15",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.22.15.tgz",
- "integrity": "sha512-0pYVBnDKZO2fnSPCrgM/6WMc7eS20Fbok+0r88fp+YtWVLZrp4CkafFGIp+W0VKw4a22sgebPT99y+FDNMdP4w==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.24.3.tgz",
+ "integrity": "sha512-viKb0F9f2s0BCS22QSF308z/+1YWKV/76mwt61NBzS5izMzDPwdq1pTrzf+Li3npBWX9KdQbkeCt1jSAM7lZqg==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.15"
+ "@babel/types": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-module-transforms": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.23.3.tgz",
- "integrity": "sha512-7bBs4ED9OmswdfDzpz4MpWgSrV7FXlc3zIagvLFjS5H+Mk7Snr21vQ6QwrsoCGMfNC4e4LQPdoULEt4ykz0SRQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.24.5.tgz",
+ "integrity": "sha512-9GxeY8c2d2mdQUP1Dye0ks3VDyIMS98kt/llQ2nUId8IsWqTF0l1LkSX0/uP7l7MCDrzXS009Hyhe2gzTiGW8A==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-simple-access": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/helper-validator-identifier": "^7.22.20"
+ "@babel/helper-module-imports": "^7.24.3",
+ "@babel/helper-simple-access": "^7.24.5",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/helper-validator-identifier": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -341,9 +340,9 @@
}
},
"node_modules/@babel/helper-plugin-utils": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.0.tgz",
- "integrity": "sha512-9cUznXMG0+FxRuJfvL82QlTqIzhVW9sL0KjMPHhAOOvpQGL8QtdxnBKILjBqxlHyliz0yCa1G903ZXI/FuHy2w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.5.tgz",
+ "integrity": "sha512-xjNLDopRzW2o6ba0gKbkZq5YWEBaK3PCyTOY1K2P/O07LGMhMqlMXPxwN4S5/RhWuCobT8z0jrlKGlYmeR1OhQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
@@ -367,13 +366,13 @@
}
},
"node_modules/@babel/helper-replace-supers": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.22.20.tgz",
- "integrity": "sha512-qsW0In3dbwQUbK8kejJ4R7IHVGwHJlV6lpG6UA7a9hSa2YEiAib+N1T2kr6PEeUT+Fl7najmSOS6SmAwCHK6Tw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.24.1.tgz",
+ "integrity": "sha512-QCR1UqC9BzG5vZl8BMicmZ28RuUBnHhAMddD8yHFHDRH9lLTZ9uUPehX8ctVPT8l0TKblJidqcgUUKGVrePleQ==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-member-expression-to-functions": "^7.22.15",
+ "@babel/helper-member-expression-to-functions": "^7.23.0",
"@babel/helper-optimise-call-expression": "^7.22.5"
},
"engines": {
@@ -384,12 +383,12 @@
}
},
"node_modules/@babel/helper-simple-access": {
- "version": "7.22.5",
- "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.22.5.tgz",
- "integrity": "sha512-n0H99E/K+Bika3++WNL17POvo4rKWZ7lZEp1Q+fStVbUi8nxPQEBOlTmCOxW/0JsS56SKKQ+ojAe2pHKJHN35w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.24.5.tgz",
+ "integrity": "sha512-uH3Hmf5q5n7n8mz7arjUlDOCbttY/DW4DYhE6FUsjKJ/oYC1kQQUvwEQWxRwUpX9qQKRXeqLwWxrqilMrf32sQ==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -408,30 +407,30 @@
}
},
"node_modules/@babel/helper-split-export-declaration": {
- "version": "7.22.6",
- "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.22.6.tgz",
- "integrity": "sha512-AsUnxuLhRYsisFiaJwvp1QF+I3KjD5FOxut14q/GzovUe6orHLesW2C7d754kRm53h5gqrz6sFl6sxc4BVtE/g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.24.5.tgz",
+ "integrity": "sha512-5CHncttXohrHk8GWOFCcCl4oRD9fKosWlIRgWm4ql9VYioKm52Mk2xsmoohvm7f3JoiLSM5ZgJuRaf5QZZYd3Q==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-string-parser": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz",
- "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.24.1.tgz",
+ "integrity": "sha512-2ofRCjnnA9y+wk8b9IAREroeUP02KHp431N2mhKniy2yKIDKpbrHv9eXwm8cBeWQYcJmzv5qKCu65P47eCF7CQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-validator-identifier": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz",
- "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.24.5.tgz",
+ "integrity": "sha512-3q93SSKX2TWCG30M2G2kwaKeTYgEUp5Snjuj8qm729SObL6nbtUldAi37qbxkD5gg3xnBio+f9nqpSepGZMvxA==",
"dev": true,
"engines": {
"node": ">=6.9.0"
@@ -447,51 +446,52 @@
}
},
"node_modules/@babel/helper-wrap-function": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.22.20.tgz",
- "integrity": "sha512-pms/UwkOpnQe/PDAEdV/d7dVCoBbB+R4FvYoHGZz+4VPcg7RtYy2KP7S2lbuWM6FCSgob5wshfGESbC/hzNXZw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.24.5.tgz",
+ "integrity": "sha512-/xxzuNvgRl4/HLNKvnFwdhdgN3cpLxgLROeLDl83Yx0AJ1SGvq1ak0OszTOjDfiB8Vx03eJbeDWh9r+jCCWttw==",
"dev": true,
"dependencies": {
- "@babel/helper-function-name": "^7.22.5",
- "@babel/template": "^7.22.15",
- "@babel/types": "^7.22.19"
+ "@babel/helper-function-name": "^7.23.0",
+ "@babel/template": "^7.24.0",
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helpers": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.0.tgz",
- "integrity": "sha512-ulDZdc0Aj5uLc5nETsa7EPx2L7rM0YJM8r7ck7U73AXi7qOV44IHHRAYZHY6iU1rr3C5N4NtTmMRUJP6kwCWeA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.5.tgz",
+ "integrity": "sha512-CiQmBMMpMQHwM5m01YnrM6imUG1ebgYJ+fAIW4FZe6m4qHTPaRHti+R8cggAwkdz4oXhtO4/K9JWlh+8hIfR2Q==",
"dev": true,
"dependencies": {
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0"
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/highlight": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz",
- "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.24.5.tgz",
+ "integrity": "sha512-8lLmua6AVh/8SLJRRVD6V8p73Hir9w5mJrhE+IPpILG31KKlI9iz5zmBYKcWPS59qSfgP9RaSBQSHHE81WKuEw==",
"dev": true,
"dependencies": {
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-validator-identifier": "^7.24.5",
"chalk": "^2.4.2",
- "js-tokens": "^4.0.0"
+ "js-tokens": "^4.0.0",
+ "picocolors": "^1.0.0"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/parser": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.0.tgz",
- "integrity": "sha512-QuP/FxEAzMSjXygs8v4N9dvdXzEHN4W1oF3PxuWAtPo08UdM17u89RDMgjLn/mlc56iM0HlLmVkO/wgR+rDgHg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.5.tgz",
+ "integrity": "sha512-EOv5IK8arwh3LI47dz1b0tKUb/1uhHAnHJOrjgtQMIpu1uXd9mlFrJg9IUgGUgZ41Ch0K8REPTYpO7B76b4vJg==",
"dev": true,
"bin": {
"parser": "bin/babel-parser.js"
@@ -500,13 +500,29 @@
"node": ">=6.0.0"
}
},
+ "node_modules/@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.24.5.tgz",
+ "integrity": "sha512-LdXRi1wEMTrHVR4Zc9F8OewC3vdm5h4QB6L71zy6StmYeqGi1b3ttIO8UC+BfZKcH9jdr4aI249rBkm+3+YvHw==",
+ "dev": true,
+ "dependencies": {
+ "@babel/helper-environment-visitor": "^7.22.20",
+ "@babel/helper-plugin-utils": "^7.24.5"
+ },
+ "engines": {
+ "node": ">=6.9.0"
+ },
+ "peerDependencies": {
+ "@babel/core": "^7.0.0"
+ }
+ },
"node_modules/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.23.3.tgz",
- "integrity": "sha512-iRkKcCqb7iGnq9+3G6rZ+Ciz5VywC4XNRHe57lKM+jOeYAoR0lVqdeeDRfh0tQcTfw/+vBhHn926FmQhLtlFLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.24.1.tgz",
+ "integrity": "sha512-y4HqEnkelJIOQGd+3g1bTeKsA5c6qM7eOn7VggGVbBc0y8MLSKHacwcIE2PplNlQSj0PqS9rrXL/nkPVK+kUNg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -516,14 +532,14 @@
}
},
"node_modules/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.23.3.tgz",
- "integrity": "sha512-WwlxbfMNdVEpQjZmK5mhm7oSwD3dS6eU+Iwsi4Knl9wAletWem7kaRsGOG+8UEbRyqxY4SS5zvtfXwX+jMxUwQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.24.1.tgz",
+ "integrity": "sha512-Hj791Ii4ci8HqnaKHAlLNs+zaLXb0EzSDhiAWp5VNlyvCNymYfacs64pxTxbH1znW/NcArSmwpmG9IKE/TUVVQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/plugin-transform-optional-chaining": "^7.23.3"
+ "@babel/plugin-transform-optional-chaining": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -533,13 +549,13 @@
}
},
"node_modules/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.23.7.tgz",
- "integrity": "sha512-LlRT7HgaifEpQA1ZgLVOIJZZFVPWN5iReq/7/JixwBtwcoeVGDBD53ZV28rrsLYOZs1Y/EHhA8N/Z6aazHR8cw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.24.1.tgz",
+ "integrity": "sha512-m9m/fXsXLiHfwdgydIFnpk+7jlVbnvlK5B2EKiPdLUb6WX654ZaaEWJUjk8TftRbZpK0XibovlLWX4KIZhV6jw==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -624,12 +640,12 @@
}
},
"node_modules/@babel/plugin-syntax-import-assertions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.23.3.tgz",
- "integrity": "sha512-lPgDSU+SJLK3xmFDTV2ZRQAiM7UuUjGidwBywFavObCiZc1BeAAcMtHJKUya92hPHO+at63JJPLygilZard8jw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.24.1.tgz",
+ "integrity": "sha512-IuwnI5XnuF189t91XbxmXeCDz3qs6iDRO7GJ++wcfgeXNs/8FmIlKcpDSXNVyuLQxlwvskmI3Ct73wUODkJBlQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -639,12 +655,12 @@
}
},
"node_modules/@babel/plugin-syntax-import-attributes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.23.3.tgz",
- "integrity": "sha512-pawnE0P9g10xgoP7yKr6CK63K2FMsTE+FZidZO/1PwRdzmAPVs+HS1mAURUsgaoxammTJvULUdIkEK0gOcU2tA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.24.1.tgz",
+ "integrity": "sha512-zhQTMH0X2nVLnb04tz+s7AMuasX8U0FnpE+nHTOhSOINjWMnopoZTxtIKsd45n4GQ/HIZLyfIpoul8e2m0DnRA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -811,12 +827,12 @@
}
},
"node_modules/@babel/plugin-transform-arrow-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.23.3.tgz",
- "integrity": "sha512-NzQcQrzaQPkaEwoTm4Mhyl8jI1huEL/WWIEvudjTCMJ9aBZNpsJbMASx7EQECtQQPS/DcnFpo0FIh3LvEO9cxQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.24.1.tgz",
+ "integrity": "sha512-ngT/3NkRhsaep9ck9uj2Xhv9+xB1zShY3tM3g6om4xxCELwCDN4g4Aq5dRn48+0hasAql7s2hdBOysCfNpr4fw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -826,13 +842,13 @@
}
},
"node_modules/@babel/plugin-transform-async-generator-functions": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.23.9.tgz",
- "integrity": "sha512-8Q3veQEDGe14dTYuwagbRtwxQDnytyg1JFu4/HwEMETeofocrB0U0ejBJIXoeG/t2oXZ8kzCyI0ZZfbT80VFNQ==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.24.3.tgz",
+ "integrity": "sha512-Qe26CMYVjpQxJ8zxM1340JFNjZaF+ISWpr1Kt/jGo+ZTUzKkfw/pphEWbRCb+lmSM6k/TOgfYLvmbHkUQ0asIg==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20",
"@babel/plugin-syntax-async-generators": "^7.8.4"
},
@@ -844,13 +860,13 @@
}
},
"node_modules/@babel/plugin-transform-async-to-generator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.23.3.tgz",
- "integrity": "sha512-A7LFsKi4U4fomjqXJlZg/u0ft/n8/7n7lpffUP/ZULx/DtV9SGlNKZolHH6PE8Xl1ngCc0M11OaeZptXVkfKSw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.24.1.tgz",
+ "integrity": "sha512-AawPptitRXp1y0n4ilKcGbRYWfbbzFWz2NqNu7dacYDtFtz0CMjG64b3LQsb3KIgnf4/obcUL78hfaOS7iCUfw==",
"dev": true,
"dependencies": {
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-module-imports": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20"
},
"engines": {
@@ -861,12 +877,12 @@
}
},
"node_modules/@babel/plugin-transform-block-scoped-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.23.3.tgz",
- "integrity": "sha512-vI+0sIaPIO6CNuM9Kk5VmXcMVRiOpDh7w2zZt9GXzmE/9KD70CUEVhvPR/etAeNK/FAEkhxQtXOzVF3EuRL41A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.24.1.tgz",
+ "integrity": "sha512-TWWC18OShZutrv9C6mye1xwtam+uNi2bnTOCBUd5sZxyHOiWbU6ztSROofIMrK84uweEZC219POICK/sTYwfgg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -876,12 +892,12 @@
}
},
"node_modules/@babel/plugin-transform-block-scoping": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.23.4.tgz",
- "integrity": "sha512-0QqbP6B6HOh7/8iNR4CQU2Th/bbRtBp4KS9vcaZd1fZ0wSh5Fyssg0UCIHwxh+ka+pNDREbVLQnHCMHKZfPwfw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.24.5.tgz",
+ "integrity": "sha512-sMfBc3OxghjC95BkYrYocHL3NaOplrcaunblzwXhGmlPwpmfsxr4vK+mBBt49r+S240vahmv+kUxkeKgs+haCw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -891,13 +907,13 @@
}
},
"node_modules/@babel/plugin-transform-class-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.23.3.tgz",
- "integrity": "sha512-uM+AN8yCIjDPccsKGlw271xjJtGii+xQIF/uMPS8H15L12jZTsLfF4o5vNO7d/oUguOyfdikHGc/yi9ge4SGIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.24.1.tgz",
+ "integrity": "sha512-OMLCXi0NqvJfORTaPQBwqLXHhb93wkBKZ4aNwMl6WtehO7ar+cmp+89iPEQPqxAnxsOKTaMcs3POz3rKayJ72g==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -907,13 +923,13 @@
}
},
"node_modules/@babel/plugin-transform-class-static-block": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.23.4.tgz",
- "integrity": "sha512-nsWu/1M+ggti1SOALj3hfx5FXzAY06fwPJsUZD4/A5e1bWi46VUIWtD+kOX6/IdhXGsXBWllLFDSnqSCdUNydQ==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.24.4.tgz",
+ "integrity": "sha512-B8q7Pz870Hz/q9UgP8InNpY01CSLDSCyqX7zcRuv3FcPl87A2G17lASroHWaCtbdIcbYzOZ7kWmXFKbijMSmFg==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.4",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-class-static-block": "^7.14.5"
},
"engines": {
@@ -924,18 +940,18 @@
}
},
"node_modules/@babel/plugin-transform-classes": {
- "version": "7.23.8",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.23.8.tgz",
- "integrity": "sha512-yAYslGsY1bX6Knmg46RjiCiNSwJKv2IUC8qOdYKqMMr0491SXFhcHqOdRDeCRohOOIzwN/90C6mQ9qAKgrP7dg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.24.5.tgz",
+ "integrity": "sha512-gWkLP25DFj2dwe9Ck8uwMOpko4YsqyfZJrOmqqcegeDYEbp7rmn4U6UQZNj08UF6MaX39XenSpKRCvpDRBtZ7Q==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-plugin-utils": "^7.24.5",
+ "@babel/helper-replace-supers": "^7.24.1",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"globals": "^11.1.0"
},
"engines": {
@@ -946,13 +962,13 @@
}
},
"node_modules/@babel/plugin-transform-computed-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.23.3.tgz",
- "integrity": "sha512-dTj83UVTLw/+nbiHqQSFdwO9CbTtwq1DsDqm3CUEtDrZNET5rT5E6bIdTlOftDTDLMYxvxHNEYO4B9SLl8SLZw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.24.1.tgz",
+ "integrity": "sha512-5pJGVIUfJpOS+pAqBQd+QMaTD2vCL/HcePooON6pDpHgRp4gNRmzyHTPIkXntwKsq3ayUFVfJaIKPw2pOkOcTw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/template": "^7.22.15"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/template": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -962,12 +978,12 @@
}
},
"node_modules/@babel/plugin-transform-destructuring": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.23.3.tgz",
- "integrity": "sha512-n225npDqjDIr967cMScVKHXJs7rout1q+tt50inyBCPkyZ8KxeI6d+GIbSBTT/w/9WdlWDOej3V9HE5Lgk57gw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.24.5.tgz",
+ "integrity": "sha512-SZuuLyfxvsm+Ah57I/i1HVjveBENYK9ue8MJ7qkc7ndoNjqquJiElzA7f5yaAXjyW2hKojosOTAQQRX50bPSVg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -977,13 +993,13 @@
}
},
"node_modules/@babel/plugin-transform-dotall-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.23.3.tgz",
- "integrity": "sha512-vgnFYDHAKzFaTVp+mneDsIEbnJ2Np/9ng9iviHw3P/KVcgONxpNULEW/51Z/BaFojG2GI2GwwXck5uV1+1NOYQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.24.1.tgz",
+ "integrity": "sha512-p7uUxgSoZwZ2lPNMzUkqCts3xlp8n+o05ikjy7gbtFJSt9gdU88jAmtfmOxHM14noQXBxfgzf2yRWECiNVhTCw==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -993,12 +1009,12 @@
}
},
"node_modules/@babel/plugin-transform-duplicate-keys": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.23.3.tgz",
- "integrity": "sha512-RrqQ+BQmU3Oyav3J+7/myfvRCq7Tbz+kKLLshUmMwNlDHExbGL7ARhajvoBJEvc+fCguPPu887N+3RRXBVKZUA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.24.1.tgz",
+ "integrity": "sha512-msyzuUnvsjsaSaocV6L7ErfNsa5nDWL1XKNnDePLgmz+WdU4w/J8+AxBMrWfi9m4IxfL5sZQKUPQKDQeeAT6lA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1008,12 +1024,12 @@
}
},
"node_modules/@babel/plugin-transform-dynamic-import": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.23.4.tgz",
- "integrity": "sha512-V6jIbLhdJK86MaLh4Jpghi8ho5fGzt3imHOBu/x0jlBaPYqDoWz4RDXjmMOfnh+JWNaQleEAByZLV0QzBT4YQQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.24.1.tgz",
+ "integrity": "sha512-av2gdSTyXcJVdI+8aFZsCAtR29xJt0S5tas+Ef8NvBNmD1a+N/3ecMLeMBgfcK+xzsjdLDT6oHt+DFPyeqUbDA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-dynamic-import": "^7.8.3"
},
"engines": {
@@ -1024,13 +1040,13 @@
}
},
"node_modules/@babel/plugin-transform-exponentiation-operator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.23.3.tgz",
- "integrity": "sha512-5fhCsl1odX96u7ILKHBj4/Y8vipoqwsJMh4csSA8qFfxrZDEA4Ssku2DyNvMJSmZNOEBT750LfFPbtrnTP90BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.24.1.tgz",
+ "integrity": "sha512-U1yX13dVBSwS23DEAqU+Z/PkwE9/m7QQy8Y9/+Tdb8UWYaGNDYwTLi19wqIAiROr8sXVum9A/rtiH5H0boUcTw==",
"dev": true,
"dependencies": {
"@babel/helper-builder-binary-assignment-operator-visitor": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1040,12 +1056,12 @@
}
},
"node_modules/@babel/plugin-transform-export-namespace-from": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.23.4.tgz",
- "integrity": "sha512-GzuSBcKkx62dGzZI1WVgTWvkkz84FZO5TC5T8dl/Tht/rAla6Dg/Mz9Yhypg+ezVACf/rgDuQt3kbWEv7LdUDQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.24.1.tgz",
+ "integrity": "sha512-Ft38m/KFOyzKw2UaJFkWG9QnHPG/Q/2SkOrRk4pNBPg5IPZ+dOxcmkK5IyuBcxiNPyyYowPGUReyBvrvZs7IlQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3"
},
"engines": {
@@ -1056,12 +1072,12 @@
}
},
"node_modules/@babel/plugin-transform-for-of": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.23.6.tgz",
- "integrity": "sha512-aYH4ytZ0qSuBbpfhuofbg/e96oQ7U2w1Aw/UQmKT+1l39uEhUPoFS3fHevDc1G0OvewyDudfMKY1OulczHzWIw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.24.1.tgz",
+ "integrity": "sha512-OxBdcnF04bpdQdR3i4giHZNZQn7cm8RQKcSwA17wAAqEELo1ZOwp5FFgeptWUQXFyT9kwHo10aqqauYkRZPCAg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
},
"engines": {
@@ -1072,14 +1088,14 @@
}
},
"node_modules/@babel/plugin-transform-function-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.23.3.tgz",
- "integrity": "sha512-I1QXp1LxIvt8yLaib49dRW5Okt7Q4oaxao6tFVKS/anCdEOMtYwWVKoiOA1p34GOWIZjUK0E+zCp7+l1pfQyiw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.24.1.tgz",
+ "integrity": "sha512-BXmDZpPlh7jwicKArQASrj8n22/w6iymRnvHYYd2zO30DbE277JO20/7yXJT3QxDPtiQiOxQBbZH4TpivNXIxA==",
"dev": true,
"dependencies": {
- "@babel/helper-compilation-targets": "^7.22.15",
+ "@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1089,12 +1105,12 @@
}
},
"node_modules/@babel/plugin-transform-json-strings": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.23.4.tgz",
- "integrity": "sha512-81nTOqM1dMwZ/aRXQ59zVubN9wHGqk6UtqRK+/q+ciXmRy8fSolhGVvG09HHRGo4l6fr/c4ZhXUQH0uFW7PZbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.24.1.tgz",
+ "integrity": "sha512-U7RMFmRvoasscrIFy5xA4gIp8iWnWubnKkKuUGJjsuOH7GfbMkB+XZzeslx2kLdEGdOJDamEmCqOks6e8nv8DQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-json-strings": "^7.8.3"
},
"engines": {
@@ -1105,12 +1121,12 @@
}
},
"node_modules/@babel/plugin-transform-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.23.3.tgz",
- "integrity": "sha512-wZ0PIXRxnwZvl9AYpqNUxpZ5BiTGrYt7kueGQ+N5FiQ7RCOD4cm8iShd6S6ggfVIWaJf2EMk8eRzAh52RfP4rQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.24.1.tgz",
+ "integrity": "sha512-zn9pwz8U7nCqOYIiBaOxoQOtYmMODXTJnkxG4AtX8fPmnCRYWBOHD0qcpwS9e2VDSp1zNJYpdnFMIKb8jmwu6g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1120,12 +1136,12 @@
}
},
"node_modules/@babel/plugin-transform-logical-assignment-operators": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.23.4.tgz",
- "integrity": "sha512-Mc/ALf1rmZTP4JKKEhUwiORU+vcfarFVLfcFiolKUo6sewoxSEgl36ak5t+4WamRsNr6nzjZXQjM35WsU+9vbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.24.1.tgz",
+ "integrity": "sha512-OhN6J4Bpz+hIBqItTeWJujDOfNP+unqv/NJgyhlpSqgBTPm37KkMmZV6SYcOj+pnDbdcl1qRGV/ZiIjX9Iy34w==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
},
"engines": {
@@ -1136,12 +1152,12 @@
}
},
"node_modules/@babel/plugin-transform-member-expression-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.23.3.tgz",
- "integrity": "sha512-sC3LdDBDi5x96LA+Ytekz2ZPk8i/Ck+DEuDbRAll5rknJ5XRTSaPKEYwomLcs1AA8wg9b3KjIQRsnApj+q51Ag==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.24.1.tgz",
+ "integrity": "sha512-4ojai0KysTWXzHseJKa1XPNXKRbuUrhkOPY4rEGeR+7ChlJVKxFa3H3Bz+7tWaGKgJAXUWKOGmltN+u9B3+CVg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1151,13 +1167,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-amd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.23.3.tgz",
- "integrity": "sha512-vJYQGxeKM4t8hYCKVBlZX/gtIY2I7mRGFNcm85sgXGMTBcoV3QdVtdpbcWEbzbfUIUZKwvgFT82mRvaQIebZzw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.24.1.tgz",
+ "integrity": "sha512-lAxNHi4HVtjnHd5Rxg3D5t99Xm6H7b04hUS7EHIXcUl2EV4yl1gWdqZrNzXnSrHveL9qMdbODlLF55mvgjAfaQ==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1167,13 +1183,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-commonjs": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.23.3.tgz",
- "integrity": "sha512-aVS0F65LKsdNOtcz6FRCpE4OgsP2OFnW46qNxNIX9h3wuzaNcSQsJysuMwqSibC98HPrf2vCgtxKNwS0DAlgcA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.24.1.tgz",
+ "integrity": "sha512-szog8fFTUxBfw0b98gEWPaEqF42ZUD/T3bkynW/wtgx2p/XCP55WEsb+VosKceRSd6njipdZvNogqdtI4Q0chw==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-simple-access": "^7.22.5"
},
"engines": {
@@ -1184,14 +1200,14 @@
}
},
"node_modules/@babel/plugin-transform-modules-systemjs": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.23.9.tgz",
- "integrity": "sha512-KDlPRM6sLo4o1FkiSlXoAa8edLXFsKKIda779fbLrvmeuc3itnjCtaO6RrtoaANsIJANj+Vk1zqbZIMhkCAHVw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.24.1.tgz",
+ "integrity": "sha512-mqQ3Zh9vFO1Tpmlt8QPnbwGHzNz3lpNEMxQb1kAemn/erstyqw1r9KeOlOfo3y6xAnFEcOv2tSyrXfmMk+/YZA==",
"dev": true,
"dependencies": {
"@babel/helper-hoist-variables": "^7.22.5",
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-validator-identifier": "^7.22.20"
},
"engines": {
@@ -1202,13 +1218,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-umd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.23.3.tgz",
- "integrity": "sha512-zHsy9iXX2nIsCBFPud3jKn1IRPWg3Ing1qOZgeKV39m1ZgIdpJqvlWVeiHBZC6ITRG0MfskhYe9cLgntfSFPIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.24.1.tgz",
+ "integrity": "sha512-tuA3lpPj+5ITfcCluy6nWonSL7RvaG0AOTeAuvXqEKS34lnLzXpDb0dcP6K8jD0zWZFNDVly90AGFJPnm4fOYg==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1234,12 +1250,12 @@
}
},
"node_modules/@babel/plugin-transform-new-target": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.23.3.tgz",
- "integrity": "sha512-YJ3xKqtJMAT5/TIZnpAR3I+K+WaDowYbN3xyxI8zxx/Gsypwf9B9h0VB+1Nh6ACAAPRS5NSRje0uVv5i79HYGQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.24.1.tgz",
+ "integrity": "sha512-/rurytBM34hYy0HKZQyA0nHbQgQNFm4Q/BOc9Hflxi2X3twRof7NaE5W46j4kQitm7SvACVRXsa6N/tSZxvPug==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1249,12 +1265,12 @@
}
},
"node_modules/@babel/plugin-transform-nullish-coalescing-operator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.23.4.tgz",
- "integrity": "sha512-jHE9EVVqHKAQx+VePv5LLGHjmHSJR76vawFPTdlxR/LVJPfOEGxREQwQfjuZEOPTwG92X3LINSh3M40Rv4zpVA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.24.1.tgz",
+ "integrity": "sha512-iQ+caew8wRrhCikO5DrUYx0mrmdhkaELgFa+7baMcVuhxIkN7oxt06CZ51D65ugIb1UWRQ8oQe+HXAVM6qHFjw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
},
"engines": {
@@ -1265,12 +1281,12 @@
}
},
"node_modules/@babel/plugin-transform-numeric-separator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.23.4.tgz",
- "integrity": "sha512-mps6auzgwjRrwKEZA05cOwuDc9FAzoyFS4ZsG/8F43bTLf/TgkJg7QXOrPO1JO599iA3qgK9MXdMGOEC8O1h6Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.24.1.tgz",
+ "integrity": "sha512-7GAsGlK4cNL2OExJH1DzmDeKnRv/LXq0eLUSvudrehVA5Rgg4bIrqEUW29FbKMBRT0ztSqisv7kjP+XIC4ZMNw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-numeric-separator": "^7.10.4"
},
"engines": {
@@ -1281,16 +1297,15 @@
}
},
"node_modules/@babel/plugin-transform-object-rest-spread": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.0.tgz",
- "integrity": "sha512-y/yKMm7buHpFFXfxVFS4Vk1ToRJDilIa6fKRioB9Vjichv58TDGXTvqV0dN7plobAmTW5eSEGXDngE+Mm+uO+w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.5.tgz",
+ "integrity": "sha512-7EauQHszLGM3ay7a161tTQH7fj+3vVM/gThlz5HpFtnygTxjrlvoeq7MPVA1Vy9Q555OB8SnAOsMkLShNkkrHA==",
"dev": true,
"dependencies": {
- "@babel/compat-data": "^7.23.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-object-rest-spread": "^7.8.3",
- "@babel/plugin-transform-parameters": "^7.23.3"
+ "@babel/plugin-transform-parameters": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1300,13 +1315,13 @@
}
},
"node_modules/@babel/plugin-transform-object-super": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.23.3.tgz",
- "integrity": "sha512-BwQ8q0x2JG+3lxCVFohg+KbQM7plfpBwThdW9A6TMtWwLsbDA01Ek2Zb/AgDN39BiZsExm4qrXxjk+P1/fzGrA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.24.1.tgz",
+ "integrity": "sha512-oKJqR3TeI5hSLRxudMjFQ9re9fBVUU0GICqM3J1mi8MqlhVr6hC/ZN4ttAyMuQR6EZZIY6h/exe5swqGNNIkWQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-replace-supers": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -1316,12 +1331,12 @@
}
},
"node_modules/@babel/plugin-transform-optional-catch-binding": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.23.4.tgz",
- "integrity": "sha512-XIq8t0rJPHf6Wvmbn9nFxU6ao4c7WhghTR5WyV8SrJfUFzyxhCm4nhC+iAp3HFhbAKLfYpgzhJ6t4XCtVwqO5A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.24.1.tgz",
+ "integrity": "sha512-oBTH7oURV4Y+3EUrf6cWn1OHio3qG/PVwO5J03iSJmBg6m2EhKjkAu/xuaXaYwWW9miYtvbWv4LNf0AmR43LUA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
},
"engines": {
@@ -1332,12 +1347,12 @@
}
},
"node_modules/@babel/plugin-transform-optional-chaining": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.23.4.tgz",
- "integrity": "sha512-ZU8y5zWOfjM5vZ+asjgAPwDaBjJzgufjES89Rs4Lpq63O300R/kOz30WCLo6BxxX6QVEilwSlpClnG5cZaikTA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.24.5.tgz",
+ "integrity": "sha512-xWCkmwKT+ihmA6l7SSTpk8e4qQl/274iNbSKRRS8mpqFR32ksy36+a+LWY8OXCCEefF8WFlnOHVsaDI2231wBg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
"@babel/plugin-syntax-optional-chaining": "^7.8.3"
},
@@ -1349,12 +1364,12 @@
}
},
"node_modules/@babel/plugin-transform-parameters": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.23.3.tgz",
- "integrity": "sha512-09lMt6UsUb3/34BbECKVbVwrT9bO6lILWln237z7sLaWnMsTi7Yc9fhX5DLpkJzAGfaReXI22wP41SZmnAA3Vw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.24.5.tgz",
+ "integrity": "sha512-9Co00MqZ2aoky+4j2jhofErthm6QVLKbpQrvz20c3CH9KQCLHyNB+t2ya4/UrRpQGR+Wrwjg9foopoeSdnHOkA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1364,13 +1379,13 @@
}
},
"node_modules/@babel/plugin-transform-private-methods": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.23.3.tgz",
- "integrity": "sha512-UzqRcRtWsDMTLrRWFvUBDwmw06tCQH9Rl1uAjfh6ijMSmGYQ+fpdB+cnqRC8EMh5tuuxSv0/TejGL+7vyj+50g==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.24.1.tgz",
+ "integrity": "sha512-tGvisebwBO5em4PaYNqt4fkw56K2VALsAbAakY0FjTYqJp7gfdrgr7YX76Or8/cpik0W6+tj3rZ0uHU9Oil4tw==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1380,14 +1395,14 @@
}
},
"node_modules/@babel/plugin-transform-private-property-in-object": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.23.4.tgz",
- "integrity": "sha512-9G3K1YqTq3F4Vt88Djx1UZ79PDyj+yKRnUy7cZGSMe+a7jkwD259uKKuUzQlPkGam7R+8RJwh5z4xO27fA1o2A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.24.5.tgz",
+ "integrity": "sha512-JM4MHZqnWR04jPMujQDTBVRnqxpLLpx2tkn7iPn+Hmsc0Gnb79yvRWOkvqFOx3Z7P7VxiRIR22c4eGSNj87OBQ==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-private-property-in-object": "^7.14.5"
},
"engines": {
@@ -1398,12 +1413,12 @@
}
},
"node_modules/@babel/plugin-transform-property-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.23.3.tgz",
- "integrity": "sha512-jR3Jn3y7cZp4oEWPFAlRsSWjxKe4PZILGBSd4nis1TsC5qeSpb+nrtihJuDhNI7QHiVbUaiXa0X2RZY3/TI6Nw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.24.1.tgz",
+ "integrity": "sha512-LetvD7CrHmEx0G442gOomRr66d7q8HzzGGr4PMHGr+5YIm6++Yke+jxj246rpvsbyhJwCLxcTn6zW1P1BSenqA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1413,12 +1428,12 @@
}
},
"node_modules/@babel/plugin-transform-react-display-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.23.3.tgz",
- "integrity": "sha512-GnvhtVfA2OAtzdX58FJxU19rhoGeQzyVndw3GgtdECQvQFXPEZIOVULHVZGAYmOgmqjXpVpfocAbSjh99V/Fqw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.24.1.tgz",
+ "integrity": "sha512-mvoQg2f9p2qlpDQRBC7M3c3XTr0k7cp/0+kFKKO/7Gtu0LSw16eKB+Fabe2bDT/UpsyasTBBkAnbdsLrkD5XMw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1462,13 +1477,13 @@
}
},
"node_modules/@babel/plugin-transform-react-pure-annotations": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.23.3.tgz",
- "integrity": "sha512-qMFdSS+TUhB7Q/3HVPnEdYJDQIk57jkntAwSuz9xfSE4n+3I+vHYCli3HoHawN1Z3RfCz/y1zXA/JXjG6cVImQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.24.1.tgz",
+ "integrity": "sha512-+pWEAaDJvSm9aFvJNpLiM2+ktl2Sn2U5DdyiWdZBxmLc6+xGt88dvFqsHiAiDS+8WqUwbDfkKz9jRxK3M0k+kA==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1478,12 +1493,12 @@
}
},
"node_modules/@babel/plugin-transform-regenerator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.23.3.tgz",
- "integrity": "sha512-KP+75h0KghBMcVpuKisx3XTu9Ncut8Q8TuvGO4IhY+9D5DFEckQefOuIsB/gQ2tG71lCke4NMrtIPS8pOj18BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.24.1.tgz",
+ "integrity": "sha512-sJwZBCzIBE4t+5Q4IGLaaun5ExVMRY0lYwos/jNecjMrVCygCdph3IKv0tkP5Fc87e/1+bebAmEAGBfnRD+cnw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"regenerator-transform": "^0.15.2"
},
"engines": {
@@ -1494,12 +1509,12 @@
}
},
"node_modules/@babel/plugin-transform-reserved-words": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.23.3.tgz",
- "integrity": "sha512-QnNTazY54YqgGxwIexMZva9gqbPa15t/x9VS+0fsEFWplwVpXYZivtgl43Z1vMpc1bdPP2PP8siFeVcnFvA3Cg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.24.1.tgz",
+ "integrity": "sha512-JAclqStUfIwKN15HrsQADFgeZt+wexNQ0uLhuqvqAUFoqPMjEcFCYZBhq0LUdz6dZK/mD+rErhW71fbx8RYElg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1509,12 +1524,12 @@
}
},
"node_modules/@babel/plugin-transform-shorthand-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.23.3.tgz",
- "integrity": "sha512-ED2fgqZLmexWiN+YNFX26fx4gh5qHDhn1O2gvEhreLW2iI63Sqm4llRLCXALKrCnbN4Jy0VcMQZl/SAzqug/jg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.24.1.tgz",
+ "integrity": "sha512-LyjVB1nsJ6gTTUKRjRWx9C1s9hE7dLfP/knKdrfeH9UPtAGjYGgxIbFfx7xyLIEWs7Xe1Gnf8EWiUqfjLhInZA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1524,12 +1539,12 @@
}
},
"node_modules/@babel/plugin-transform-spread": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.23.3.tgz",
- "integrity": "sha512-VvfVYlrlBVu+77xVTOAoxQ6mZbnIq5FM0aGBSFEcIh03qHf+zNqA4DC/3XMUozTg7bZV3e3mZQ0i13VB6v5yUg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.24.1.tgz",
+ "integrity": "sha512-KjmcIM+fxgY+KxPVbjelJC6hrH1CgtPmTvdXAfn3/a9CnWGSTY7nH4zm5+cjmWJybdcPSsD0++QssDsjcpe47g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
},
"engines": {
@@ -1540,12 +1555,12 @@
}
},
"node_modules/@babel/plugin-transform-sticky-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.23.3.tgz",
- "integrity": "sha512-HZOyN9g+rtvnOU3Yh7kSxXrKbzgrm5X4GncPY1QOquu7epga5MxKHVpYu2hvQnry/H+JjckSYRb93iNfsioAGg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.24.1.tgz",
+ "integrity": "sha512-9v0f1bRXgPVcPrngOQvLXeGNNVLc8UjMVfebo9ka0WF3/7+aVUHmaJVT3sa0XCzEFioPfPHZiOcYG9qOsH63cw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1555,12 +1570,12 @@
}
},
"node_modules/@babel/plugin-transform-template-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.23.3.tgz",
- "integrity": "sha512-Flok06AYNp7GV2oJPZZcP9vZdszev6vPBkHLwxwSpaIqx75wn6mUd3UFWsSsA0l8nXAKkyCmL/sR02m8RYGeHg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.24.1.tgz",
+ "integrity": "sha512-WRkhROsNzriarqECASCNu/nojeXCDTE/F2HmRgOzi7NGvyfYGq1NEjKBK3ckLfRgGc6/lPAqP0vDOSw3YtG34g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1570,12 +1585,12 @@
}
},
"node_modules/@babel/plugin-transform-typeof-symbol": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.23.3.tgz",
- "integrity": "sha512-4t15ViVnaFdrPC74be1gXBSMzXk3B4Us9lP7uLRQHTFpV5Dvt33pn+2MyyNxmN3VTTm3oTrZVMUmuw3oBnQ2oQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.24.5.tgz",
+ "integrity": "sha512-UTGnhYVZtTAjdwOTzT+sCyXmTn8AhaxOS/MjG9REclZ6ULHWF9KoCZur0HSGU7hk8PdBFKKbYe6+gqdXWz84Jg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1585,12 +1600,12 @@
}
},
"node_modules/@babel/plugin-transform-unicode-escapes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.23.3.tgz",
- "integrity": "sha512-OMCUx/bU6ChE3r4+ZdylEqAjaQgHAgipgW8nsCfu5pGqDcFytVd91AwRvUJSBZDz0exPGgnjoqhgRYLRjFZc9Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.24.1.tgz",
+ "integrity": "sha512-RlkVIcWT4TLI96zM660S877E7beKlQw7Ig+wqkKBiWfj0zH5Q4h50q6er4wzZKRNSYpfo6ILJ+hrJAGSX2qcNw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1600,13 +1615,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-property-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.23.3.tgz",
- "integrity": "sha512-KcLIm+pDZkWZQAFJ9pdfmh89EwVfmNovFBcXko8szpBeF8z68kWIPeKlmSOkT9BXJxs2C0uk+5LxoxIv62MROA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.24.1.tgz",
+ "integrity": "sha512-Ss4VvlfYV5huWApFsF8/Sq0oXnGO+jB+rijFEFugTd3cwSObUSnUi88djgR5528Csl0uKlrI331kRqe56Ov2Ng==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1616,13 +1631,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.23.3.tgz",
- "integrity": "sha512-wMHpNA4x2cIA32b/ci3AfwNgheiva2W0WUKWTK7vBHBhDKfPsc5cFGNWm69WBqpwd86u1qwZ9PWevKqm1A3yAw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.24.1.tgz",
+ "integrity": "sha512-2A/94wgZgxfTsiLaQ2E36XAOdcZmGAaEEgVmxQWwZXWkGhvoHbaqXcKnU8zny4ycpu3vNqg0L/PcCiYtHtA13g==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1632,13 +1647,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-sets-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.23.3.tgz",
- "integrity": "sha512-W7lliA/v9bNR83Qc3q1ip9CQMZ09CcHDbHfbLRDNuAhn1Mvkr1ZNF7hPmztMQvtTGVLJ9m8IZqWsTkXOml8dbw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.24.1.tgz",
+ "integrity": "sha512-fqj4WuzzS+ukpgerpAoOnMfQXwUHFxXUZUE84oL2Kao2N8uSlvcpnAidKASgsNgzZHBsHWvcm8s9FPWUhAb8fA==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1648,26 +1663,27 @@
}
},
"node_modules/@babel/preset-env": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.0.tgz",
- "integrity": "sha512-ZxPEzV9IgvGn73iK0E6VB9/95Nd7aMFpbE0l8KQFDG70cOV9IxRP7Y2FUPmlK0v6ImlLqYX50iuZ3ZTVhOF2lA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.5.tgz",
+ "integrity": "sha512-UGK2ifKtcC8i5AI4cH+sbLLuLc2ktYSFJgBAXorKAsHUZmrQ1q6aQ6i3BvU24wWs2AAKqQB6kq3N9V9Gw1HiMQ==",
"dev": true,
"dependencies": {
- "@babel/compat-data": "^7.23.5",
+ "@babel/compat-data": "^7.24.4",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-validator-option": "^7.23.5",
- "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.23.3",
- "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.23.3",
- "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.23.7",
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.24.5",
+ "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.24.1",
+ "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.24.1",
+ "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.24.1",
"@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
"@babel/plugin-syntax-async-generators": "^7.8.4",
"@babel/plugin-syntax-class-properties": "^7.12.13",
"@babel/plugin-syntax-class-static-block": "^7.14.5",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3",
- "@babel/plugin-syntax-import-assertions": "^7.23.3",
- "@babel/plugin-syntax-import-attributes": "^7.23.3",
+ "@babel/plugin-syntax-import-assertions": "^7.24.1",
+ "@babel/plugin-syntax-import-attributes": "^7.24.1",
"@babel/plugin-syntax-import-meta": "^7.10.4",
"@babel/plugin-syntax-json-strings": "^7.8.3",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
@@ -1679,58 +1695,58 @@
"@babel/plugin-syntax-private-property-in-object": "^7.14.5",
"@babel/plugin-syntax-top-level-await": "^7.14.5",
"@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
- "@babel/plugin-transform-arrow-functions": "^7.23.3",
- "@babel/plugin-transform-async-generator-functions": "^7.23.9",
- "@babel/plugin-transform-async-to-generator": "^7.23.3",
- "@babel/plugin-transform-block-scoped-functions": "^7.23.3",
- "@babel/plugin-transform-block-scoping": "^7.23.4",
- "@babel/plugin-transform-class-properties": "^7.23.3",
- "@babel/plugin-transform-class-static-block": "^7.23.4",
- "@babel/plugin-transform-classes": "^7.23.8",
- "@babel/plugin-transform-computed-properties": "^7.23.3",
- "@babel/plugin-transform-destructuring": "^7.23.3",
- "@babel/plugin-transform-dotall-regex": "^7.23.3",
- "@babel/plugin-transform-duplicate-keys": "^7.23.3",
- "@babel/plugin-transform-dynamic-import": "^7.23.4",
- "@babel/plugin-transform-exponentiation-operator": "^7.23.3",
- "@babel/plugin-transform-export-namespace-from": "^7.23.4",
- "@babel/plugin-transform-for-of": "^7.23.6",
- "@babel/plugin-transform-function-name": "^7.23.3",
- "@babel/plugin-transform-json-strings": "^7.23.4",
- "@babel/plugin-transform-literals": "^7.23.3",
- "@babel/plugin-transform-logical-assignment-operators": "^7.23.4",
- "@babel/plugin-transform-member-expression-literals": "^7.23.3",
- "@babel/plugin-transform-modules-amd": "^7.23.3",
- "@babel/plugin-transform-modules-commonjs": "^7.23.3",
- "@babel/plugin-transform-modules-systemjs": "^7.23.9",
- "@babel/plugin-transform-modules-umd": "^7.23.3",
+ "@babel/plugin-transform-arrow-functions": "^7.24.1",
+ "@babel/plugin-transform-async-generator-functions": "^7.24.3",
+ "@babel/plugin-transform-async-to-generator": "^7.24.1",
+ "@babel/plugin-transform-block-scoped-functions": "^7.24.1",
+ "@babel/plugin-transform-block-scoping": "^7.24.5",
+ "@babel/plugin-transform-class-properties": "^7.24.1",
+ "@babel/plugin-transform-class-static-block": "^7.24.4",
+ "@babel/plugin-transform-classes": "^7.24.5",
+ "@babel/plugin-transform-computed-properties": "^7.24.1",
+ "@babel/plugin-transform-destructuring": "^7.24.5",
+ "@babel/plugin-transform-dotall-regex": "^7.24.1",
+ "@babel/plugin-transform-duplicate-keys": "^7.24.1",
+ "@babel/plugin-transform-dynamic-import": "^7.24.1",
+ "@babel/plugin-transform-exponentiation-operator": "^7.24.1",
+ "@babel/plugin-transform-export-namespace-from": "^7.24.1",
+ "@babel/plugin-transform-for-of": "^7.24.1",
+ "@babel/plugin-transform-function-name": "^7.24.1",
+ "@babel/plugin-transform-json-strings": "^7.24.1",
+ "@babel/plugin-transform-literals": "^7.24.1",
+ "@babel/plugin-transform-logical-assignment-operators": "^7.24.1",
+ "@babel/plugin-transform-member-expression-literals": "^7.24.1",
+ "@babel/plugin-transform-modules-amd": "^7.24.1",
+ "@babel/plugin-transform-modules-commonjs": "^7.24.1",
+ "@babel/plugin-transform-modules-systemjs": "^7.24.1",
+ "@babel/plugin-transform-modules-umd": "^7.24.1",
"@babel/plugin-transform-named-capturing-groups-regex": "^7.22.5",
- "@babel/plugin-transform-new-target": "^7.23.3",
- "@babel/plugin-transform-nullish-coalescing-operator": "^7.23.4",
- "@babel/plugin-transform-numeric-separator": "^7.23.4",
- "@babel/plugin-transform-object-rest-spread": "^7.24.0",
- "@babel/plugin-transform-object-super": "^7.23.3",
- "@babel/plugin-transform-optional-catch-binding": "^7.23.4",
- "@babel/plugin-transform-optional-chaining": "^7.23.4",
- "@babel/plugin-transform-parameters": "^7.23.3",
- "@babel/plugin-transform-private-methods": "^7.23.3",
- "@babel/plugin-transform-private-property-in-object": "^7.23.4",
- "@babel/plugin-transform-property-literals": "^7.23.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
- "@babel/plugin-transform-reserved-words": "^7.23.3",
- "@babel/plugin-transform-shorthand-properties": "^7.23.3",
- "@babel/plugin-transform-spread": "^7.23.3",
- "@babel/plugin-transform-sticky-regex": "^7.23.3",
- "@babel/plugin-transform-template-literals": "^7.23.3",
- "@babel/plugin-transform-typeof-symbol": "^7.23.3",
- "@babel/plugin-transform-unicode-escapes": "^7.23.3",
- "@babel/plugin-transform-unicode-property-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-sets-regex": "^7.23.3",
+ "@babel/plugin-transform-new-target": "^7.24.1",
+ "@babel/plugin-transform-nullish-coalescing-operator": "^7.24.1",
+ "@babel/plugin-transform-numeric-separator": "^7.24.1",
+ "@babel/plugin-transform-object-rest-spread": "^7.24.5",
+ "@babel/plugin-transform-object-super": "^7.24.1",
+ "@babel/plugin-transform-optional-catch-binding": "^7.24.1",
+ "@babel/plugin-transform-optional-chaining": "^7.24.5",
+ "@babel/plugin-transform-parameters": "^7.24.5",
+ "@babel/plugin-transform-private-methods": "^7.24.1",
+ "@babel/plugin-transform-private-property-in-object": "^7.24.5",
+ "@babel/plugin-transform-property-literals": "^7.24.1",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
+ "@babel/plugin-transform-reserved-words": "^7.24.1",
+ "@babel/plugin-transform-shorthand-properties": "^7.24.1",
+ "@babel/plugin-transform-spread": "^7.24.1",
+ "@babel/plugin-transform-sticky-regex": "^7.24.1",
+ "@babel/plugin-transform-template-literals": "^7.24.1",
+ "@babel/plugin-transform-typeof-symbol": "^7.24.5",
+ "@babel/plugin-transform-unicode-escapes": "^7.24.1",
+ "@babel/plugin-transform-unicode-property-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-sets-regex": "^7.24.1",
"@babel/preset-modules": "0.1.6-no-external-plugins",
- "babel-plugin-polyfill-corejs2": "^0.4.8",
- "babel-plugin-polyfill-corejs3": "^0.9.0",
- "babel-plugin-polyfill-regenerator": "^0.5.5",
+ "babel-plugin-polyfill-corejs2": "^0.4.10",
+ "babel-plugin-polyfill-corejs3": "^0.10.4",
+ "babel-plugin-polyfill-regenerator": "^0.6.1",
"core-js-compat": "^3.31.0",
"semver": "^6.3.1"
},
@@ -1756,17 +1772,17 @@
}
},
"node_modules/@babel/preset-react": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.23.3.tgz",
- "integrity": "sha512-tbkHOS9axH6Ysf2OUEqoSZ6T3Fa2SrNH6WTWSPBboxKzdxNc9qOICeLXkNG0ZEwbQ1HY8liwOce4aN/Ceyuq6w==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.24.1.tgz",
+ "integrity": "sha512-eFa8up2/8cZXLIpkafhaADTXSnl7IsUFCYenRWrARBz0/qZwcT0RBXpys0LJU4+WfPoF2ZG6ew6s2V6izMCwRA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-validator-option": "^7.22.15",
- "@babel/plugin-transform-react-display-name": "^7.23.3",
- "@babel/plugin-transform-react-jsx": "^7.22.15",
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-validator-option": "^7.23.5",
+ "@babel/plugin-transform-react-display-name": "^7.24.1",
+ "@babel/plugin-transform-react-jsx": "^7.23.4",
"@babel/plugin-transform-react-jsx-development": "^7.22.5",
- "@babel/plugin-transform-react-pure-annotations": "^7.23.3"
+ "@babel/plugin-transform-react-pure-annotations": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -1808,19 +1824,19 @@
}
},
"node_modules/@babel/traverse": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.0.tgz",
- "integrity": "sha512-HfuJlI8qq3dEDmNU5ChzzpZRWq+oxCZQyMzIMEqLho+AQnhMnKQUzH6ydo3RBl/YjPCuk68Y6s0Gx0AeyULiWw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.5.tgz",
+ "integrity": "sha512-7aaBLeDQ4zYcUFDUD41lJc1fG8+5IU9DaNSJAgal866FGvmD5EbWQgnEC6kO1gGLsX0esNkfnJSndbTXA3r7UA==",
"dev": true,
"dependencies": {
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
"@babel/helper-hoist-variables": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/parser": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/parser": "^7.24.5",
+ "@babel/types": "^7.24.5",
"debug": "^4.3.1",
"globals": "^11.1.0"
},
@@ -1829,13 +1845,13 @@
}
},
"node_modules/@babel/types": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.0.tgz",
- "integrity": "sha512-+j7a5c253RfKh8iABBhywc8NSfP5LURe7Uh4qpsh6jc+aLJguvmIUBdjSdEMQv2bENrCR5MfRdjGo7vzS/ob7w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.5.tgz",
+ "integrity": "sha512-6mQNsaLeXTw0nxYUYu+NSa4Hx4BlF1x1x8/PMFbiR+GBSr+2DkECc69b8hgy2frEodNcvPffeH8YfWd3LI6jhQ==",
"dev": true,
"dependencies": {
- "@babel/helper-string-parser": "^7.23.4",
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-string-parser": "^7.24.1",
+ "@babel/helper-validator-identifier": "^7.24.5",
"to-fast-properties": "^2.0.0"
},
"engines": {
@@ -1848,11 +1864,6 @@
"integrity": "sha512-0hYQ8SB4Db5zvZB4axdMHGwEaQjkZzFjQiN9LVYvIFB2nSUHW9tYpxWriPrWDASIxiaXax83REcLxuSdnGPZtw==",
"dev": true
},
- "node_modules/@braintree/sanitize-url": {
- "version": "7.0.0",
- "resolved": "https://registry.npmjs.org/@braintree/sanitize-url/-/sanitize-url-7.0.0.tgz",
- "integrity": "sha512-GMu2OJiTd1HSe74bbJYQnVvELANpYiGFZELyyTM1CR0sdv5ReQAcJ/c/8pIrPab3lO11+D+EpuGLUxqz+y832g=="
- },
"node_modules/@colors/colors": {
"version": "1.6.0",
"resolved": "https://registry.npmjs.org/@colors/colors/-/colors-1.6.0.tgz",
@@ -2092,14 +2103,14 @@
}
},
"node_modules/@jridgewell/gen-mapping": {
- "version": "0.3.3",
- "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.3.tgz",
- "integrity": "sha512-HLhSWOLRi875zjjMG/r+Nv0oCW8umGb0BgEhyX3dDX3egwZtB8PqLnjz3yedt8R5StBrzcg4aBpnh8UA9D1BoQ==",
+ "version": "0.3.5",
+ "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.5.tgz",
+ "integrity": "sha512-IzL8ZoEDIBRWEzlCcRhOaCupYyN5gdIK+Q6fbFdPDg6HqX6jpkItn7DFIpW9LQzXG6Df9sA7+OKnq0qlz/GaQg==",
"dev": true,
"dependencies": {
- "@jridgewell/set-array": "^1.0.1",
+ "@jridgewell/set-array": "^1.2.1",
"@jridgewell/sourcemap-codec": "^1.4.10",
- "@jridgewell/trace-mapping": "^0.3.9"
+ "@jridgewell/trace-mapping": "^0.3.24"
},
"engines": {
"node": ">=6.0.0"
@@ -2115,9 +2126,9 @@
}
},
"node_modules/@jridgewell/set-array": {
- "version": "1.1.2",
- "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.1.2.tgz",
- "integrity": "sha512-xnkseuNADM0gt2bs+BvhO0p78Mk762YnZdsuzFV018NoG1Sj1SCQvpSqa7XUaTam5vAGasABV9qXASMKnFMwMw==",
+ "version": "1.2.1",
+ "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.2.1.tgz",
+ "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
"dev": true,
"engines": {
"node": ">=6.0.0"
@@ -2140,9 +2151,9 @@
"dev": true
},
"node_modules/@jridgewell/trace-mapping": {
- "version": "0.3.22",
- "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.22.tgz",
- "integrity": "sha512-Wf963MzWtA2sjrNt+g18IAln9lKnlRp+K2eH4jjIoF1wYeq3aMREpG09xhlhdzS0EjwU7qmUJYangWa+151vZw==",
+ "version": "0.3.25",
+ "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
+ "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
"dev": true,
"dependencies": {
"@jridgewell/resolve-uri": "^3.1.0",
@@ -2267,9 +2278,9 @@
"dev": true
},
"node_modules/@webassemblyjs/ast": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.6.tgz",
- "integrity": "sha512-IN1xI7PwOvLPgjcf180gC1bqn3q/QaOCwYUahIOhbYUu8KA/3tw2RT/T0Gidi1l7Hhj5D/INhJxiICObqpMu4Q==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.12.1.tgz",
+ "integrity": "sha512-EKfMUOPRRUTy5UII4qJDGPpqfwjOmZ5jeGFwid9mnoqIFK+e0vqoi1qH56JpmZSzEL53jKnNzScdmftJyG5xWg==",
"dev": true,
"dependencies": {
"@webassemblyjs/helper-numbers": "1.11.6",
@@ -2289,9 +2300,9 @@
"dev": true
},
"node_modules/@webassemblyjs/helper-buffer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.6.tgz",
- "integrity": "sha512-z3nFzdcp1mb8nEOFFk8DrYLpHvhKC3grJD2ardfKOzmbmJvEf/tPIqCY+sNcwZIY8ZD7IkB2l7/pqhUhqm7hLA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.12.1.tgz",
+ "integrity": "sha512-nzJwQw99DNDKr9BVCOZcLuJJUlqkJh+kVzVl6Fmq/tI5ZtEyWT1KZMyOXltXLZJmDtvLCDgwsyrkohEtopTXCw==",
"dev": true
},
"node_modules/@webassemblyjs/helper-numbers": {
@@ -2312,15 +2323,15 @@
"dev": true
},
"node_modules/@webassemblyjs/helper-wasm-section": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.6.tgz",
- "integrity": "sha512-LPpZbSOwTpEC2cgn4hTydySy1Ke+XEu+ETXuoyvuyezHO3Kjdu90KK95Sh9xTbmjrCsUwvWwCOQQNta37VrS9g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.12.1.tgz",
+ "integrity": "sha512-Jif4vfB6FJlUlSbgEMHUyk1j234GTNG9dBJ4XJdOySoj518Xj0oGsNi59cUQF4RRMS9ouBUxDDdyBVfPTypa5g==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6"
+ "@webassemblyjs/wasm-gen": "1.12.1"
}
},
"node_modules/@webassemblyjs/ieee754": {
@@ -2348,28 +2359,28 @@
"dev": true
},
"node_modules/@webassemblyjs/wasm-edit": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.6.tgz",
- "integrity": "sha512-Ybn2I6fnfIGuCR+Faaz7YcvtBKxvoLV3Lebn1tM4o/IAJzmi9AWYIPWpyBfU8cC+JxAO57bk4+zdsTjJR+VTOw==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.12.1.tgz",
+ "integrity": "sha512-1DuwbVvADvS5mGnXbE+c9NfA8QRcZ6iKquqjjmR10k6o+zzsRVesil54DKexiowcFCPdr/Q0qaMgB01+SQ1u6g==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/helper-wasm-section": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-opt": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6",
- "@webassemblyjs/wast-printer": "1.11.6"
+ "@webassemblyjs/helper-wasm-section": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-opt": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1",
+ "@webassemblyjs/wast-printer": "1.12.1"
}
},
"node_modules/@webassemblyjs/wasm-gen": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.6.tgz",
- "integrity": "sha512-3XOqkZP/y6B4F0PBAXvI1/bky7GryoogUtfwExeP/v7Nzwo1QLcq5oQmpKlftZLbT+ERUOAZVQjuNVak6UXjPA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.12.1.tgz",
+ "integrity": "sha512-TDq4Ojh9fcohAw6OIMXqiIcTq5KUXTGRkVxbSo1hQnSy6lAM5GSdfwWeSxpAo0YzgsgF182E/U0mDNhuA0tW7w==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
"@webassemblyjs/leb128": "1.11.6",
@@ -2377,24 +2388,24 @@
}
},
"node_modules/@webassemblyjs/wasm-opt": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.6.tgz",
- "integrity": "sha512-cOrKuLRE7PCe6AsOVl7WasYf3wbSo4CeOk6PkrjS7g57MFfVUF9u6ysQBBODX0LdgSvQqRiGz3CXvIDKcPNy4g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.12.1.tgz",
+ "integrity": "sha512-Jg99j/2gG2iaz3hijw857AVYekZe2SAskcqlWIZXjji5WStnOpVoat3gQfT/Q5tb2djnCjBtMocY/Su1GfxPBg==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6"
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1"
}
},
"node_modules/@webassemblyjs/wasm-parser": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.6.tgz",
- "integrity": "sha512-6ZwPeGzMJM3Dqp3hCsLgESxBGtT/OeCvCZ4TA1JUPYgmhAx38tTPR9JaKy0S5H3evQpO/h2uWs2j6Yc/fjkpTQ==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.12.1.tgz",
+ "integrity": "sha512-xikIi7c2FHXysxXe3COrVUPSheuBtpcfhbpFj4gmu7KRLYOzANztwUU0IbsqvMqzuNK2+glRGWCEqZo1WCLyAQ==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-api-error": "1.11.6",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
@@ -2403,12 +2414,12 @@
}
},
"node_modules/@webassemblyjs/wast-printer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.6.tgz",
- "integrity": "sha512-JM7AhRcE+yW2GWYaKeHL5vt4xqee5N2WcezptmgyhNS+ScggqcT1OtXykhAb13Sn5Yas0j2uv9tHgrjwvzAP4A==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.12.1.tgz",
+ "integrity": "sha512-+X4WAlOisVWQMikjbcvY2e0rwPsKQ9F688lksZhBcPycBBuii3O7m8FACbDMWDojpAqvjIncrG8J0XHKyQfVeA==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@xtuc/long": "4.2.2"
}
},
@@ -2820,13 +2831,13 @@
}
},
"node_modules/babel-plugin-polyfill-corejs2": {
- "version": "0.4.8",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.8.tgz",
- "integrity": "sha512-OtIuQfafSzpo/LhnJaykc0R/MMnuLSSVjVYy9mHArIZ9qTCSZ6TpWCuEKZYVoN//t8HqBNScHrOtCrIK5IaGLg==",
+ "version": "0.4.11",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.11.tgz",
+ "integrity": "sha512-sMEJ27L0gRHShOh5G54uAAPaiCOygY/5ratXuiyb2G46FmlSpc9eFCzYVyDiPxfNbwzA7mYahmjQc5q+CZQ09Q==",
"dev": true,
"dependencies": {
"@babel/compat-data": "^7.22.6",
- "@babel/helper-define-polyfill-provider": "^0.5.0",
+ "@babel/helper-define-polyfill-provider": "^0.6.2",
"semver": "^6.3.1"
},
"peerDependencies": {
@@ -2834,25 +2845,25 @@
}
},
"node_modules/babel-plugin-polyfill-corejs3": {
- "version": "0.9.0",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.9.0.tgz",
- "integrity": "sha512-7nZPG1uzK2Ymhy/NbaOWTg3uibM2BmGASS4vHS4szRZAIR8R6GwA/xAujpdrXU5iyklrimWnLWU+BLF9suPTqg==",
+ "version": "0.10.4",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.10.4.tgz",
+ "integrity": "sha512-25J6I8NGfa5YkCDogHRID3fVCadIR8/pGl1/spvCkzb6lVn6SR3ojpx9nOn9iEBcUsjY24AmdKm5khcfKdylcg==",
"dev": true,
"dependencies": {
- "@babel/helper-define-polyfill-provider": "^0.5.0",
- "core-js-compat": "^3.34.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.1",
+ "core-js-compat": "^3.36.1"
},
"peerDependencies": {
"@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
}
},
"node_modules/babel-plugin-polyfill-regenerator": {
- "version": "0.5.5",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.5.5.tgz",
- "integrity": "sha512-OJGYZlhLqBh2DDHeqAxWB1XIvr49CxiJ2gIt61/PU55CQK4Z58OzMqjDe1zwQdQk+rBYsRc+1rJmdajM3gimHg==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.2.tgz",
+ "integrity": "sha512-2R25rQZWP63nGwaAswvDazbPXfrM3HwVoBXK6HcqeKrSrL/JqcC/rDcf95l4r7LXLyxDXc8uQDa064GubtCABg==",
"dev": true,
"dependencies": {
- "@babel/helper-define-polyfill-provider": "^0.5.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.2"
},
"peerDependencies": {
"@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
@@ -3233,12 +3244,12 @@
"dev": true
},
"node_modules/core-js-compat": {
- "version": "3.36.0",
- "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.36.0.tgz",
- "integrity": "sha512-iV9Pd/PsgjNWBXeq8XRtWVSgz2tKAfhfvBs7qxYty+RlRd+OCksaWmOnc4JKrTc1cToXL1N0s3l/vwlxPtdElw==",
+ "version": "3.37.0",
+ "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.37.0.tgz",
+ "integrity": "sha512-vYq4L+T8aS5UuFg4UwDhc7YNRWVeVZwltad9C/jV3R2LgVOpS9BDr7l/WL6BN0dbV3k1XejPTHqqEzJgsa0frA==",
"dev": true,
"dependencies": {
- "browserslist": "^4.22.3"
+ "browserslist": "^4.23.0"
},
"funding": {
"type": "opencollective",
@@ -3461,9 +3472,9 @@
"dev": true
},
"node_modules/enhanced-resolve": {
- "version": "5.15.0",
- "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.15.0.tgz",
- "integrity": "sha512-LXYT42KJ7lpIKECr2mAXIaMldcNCh/7E0KBKOu4KSfkHmP+mZmSs+8V5gBAqisWBy0OO4W5Oyys0GO1Y8KtdKg==",
+ "version": "5.16.0",
+ "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.16.0.tgz",
+ "integrity": "sha512-O+QWCviPNSSLAD9Ucn8Awv+poAkqn3T1XY5/N7kR7rQO9yfSGWkYZDwpJ+iKF7B8rxaQKWngSqACpgzeapSyoA==",
"dev": true,
"dependencies": {
"graceful-fs": "^4.2.4",
@@ -8042,9 +8053,9 @@
}
},
"node_modules/watchpack": {
- "version": "2.4.0",
- "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.0.tgz",
- "integrity": "sha512-Lcvm7MGST/4fup+ifyKi2hjyIAwcdI4HRgtvTpIUxBRhB+RFtUh8XtDOxUfctVCnhVi+QQj49i91OyvzkJl6cg==",
+ "version": "2.4.1",
+ "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.1.tgz",
+ "integrity": "sha512-8wrBCMtVhqcXP2Sup1ctSkga6uc2Bx0IIvKyT7yTFier5AXHooSI+QyQQAtTb7+E0IUCCKyTFmXqdqgum2XWGg==",
"dev": true,
"dependencies": {
"glob-to-regexp": "^0.4.1",
@@ -8055,26 +8066,26 @@
}
},
"node_modules/webpack": {
- "version": "5.90.3",
- "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.90.3.tgz",
- "integrity": "sha512-h6uDYlWCctQRuXBs1oYpVe6sFcWedl0dpcVaTf/YF67J9bKvwJajFulMVSYKHrksMB3I/pIagRzDxwxkebuzKA==",
+ "version": "5.91.0",
+ "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.91.0.tgz",
+ "integrity": "sha512-rzVwlLeBWHJbmgTC/8TvAcu5vpJNII+MelQpylD4jNERPwpBJOE2lEcko1zJX3QJeLjTTAnQxn/OJ8bjDzVQaw==",
"dev": true,
"dependencies": {
"@types/eslint-scope": "^3.7.3",
"@types/estree": "^1.0.5",
- "@webassemblyjs/ast": "^1.11.5",
- "@webassemblyjs/wasm-edit": "^1.11.5",
- "@webassemblyjs/wasm-parser": "^1.11.5",
+ "@webassemblyjs/ast": "^1.12.1",
+ "@webassemblyjs/wasm-edit": "^1.12.1",
+ "@webassemblyjs/wasm-parser": "^1.12.1",
"acorn": "^8.7.1",
"acorn-import-assertions": "^1.9.0",
"browserslist": "^4.21.10",
"chrome-trace-event": "^1.0.2",
- "enhanced-resolve": "^5.15.0",
+ "enhanced-resolve": "^5.16.0",
"es-module-lexer": "^1.2.1",
"eslint-scope": "5.1.1",
"events": "^3.2.0",
"glob-to-regexp": "^0.4.1",
- "graceful-fs": "^4.2.9",
+ "graceful-fs": "^4.2.11",
"json-parse-even-better-errors": "^2.3.1",
"loader-runner": "^4.2.0",
"mime-types": "^2.1.27",
@@ -8082,7 +8093,7 @@
"schema-utils": "^3.2.0",
"tapable": "^2.1.1",
"terser-webpack-plugin": "^5.3.10",
- "watchpack": "^2.4.0",
+ "watchpack": "^2.4.1",
"webpack-sources": "^3.2.3"
},
"bin": {
@@ -8531,12 +8542,12 @@
}
},
"@babel/cli": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.23.9.tgz",
- "integrity": "sha512-vB1UXmGDNEhcf1jNAHKT9IlYk1R+hehVTLFlCLHBi8gfuHQGP6uRjgXVYU0EVlI/qwAWpstqkBdf2aez3/z/5Q==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.24.5.tgz",
+ "integrity": "sha512-2qg1mYtJRsOOWF6IUwLP5jI42P8Cc0hQ5TmnjLrik/4DKouO8dFJN80HEz81VmVeUs97yuuf3vQ/9j7Elrcjlg==",
"dev": true,
"requires": {
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@jridgewell/trace-mapping": "^0.3.25",
"@nicolo-ribaudo/chokidar-2": "2.1.8-no-fsevents.3",
"chokidar": "^3.4.0",
"commander": "^4.0.1",
@@ -8548,37 +8559,37 @@
}
},
"@babel/code-frame": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz",
- "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==",
+ "version": "7.24.2",
+ "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.24.2.tgz",
+ "integrity": "sha512-y5+tLQyV8pg3fsiln67BVLD1P13Eg4lh5RW9mF0zUuvLrv9uIQ4MCL+CRT+FTsBlBjcIan6PGsLcBN0m3ClUyQ==",
"dev": true,
"requires": {
- "@babel/highlight": "^7.23.4",
- "chalk": "^2.4.2"
+ "@babel/highlight": "^7.24.2",
+ "picocolors": "^1.0.0"
}
},
"@babel/compat-data": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.23.5.tgz",
- "integrity": "sha512-uU27kfDRlhfKl+w1U6vp16IuvSLtjAxdArVXPa9BvLkrr7CYIsxH5adpHObeAGY/41+syctUWOZ140a2Rvkgjw==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.24.4.tgz",
+ "integrity": "sha512-vg8Gih2MLK+kOkHJp4gBEIkyaIi00jgWot2D9QOmmfLC8jINSOzmCLta6Bvz/JSBCqnegV0L80jhxkol5GWNfQ==",
"dev": true
},
"@babel/core": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.0.tgz",
- "integrity": "sha512-fQfkg0Gjkza3nf0c7/w6Xf34BW4YvzNfACRLmmb7XRLa6XHdR+K9AlJlxneFfWYf6uhOzuzZVTjF/8KfndZANw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.5.tgz",
+ "integrity": "sha512-tVQRucExLQ02Boi4vdPp49svNGcfL2GhdTCT9aldhXgCJVAI21EtRfBettiuLUwce/7r6bFdgs6JFkcdTiFttA==",
"dev": true,
"requires": {
"@ampproject/remapping": "^2.2.0",
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-module-transforms": "^7.23.3",
- "@babel/helpers": "^7.24.0",
- "@babel/parser": "^7.24.0",
+ "@babel/helper-module-transforms": "^7.24.5",
+ "@babel/helpers": "^7.24.5",
+ "@babel/parser": "^7.24.5",
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5",
"convert-source-map": "^2.0.0",
"debug": "^4.1.0",
"gensync": "^1.0.0-beta.2",
@@ -8587,14 +8598,14 @@
}
},
"@babel/generator": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.23.6.tgz",
- "integrity": "sha512-qrSfCYxYQB5owCmGLbl8XRpX1ytXlpueOb0N0UmQwA073KZxejgQTzAmJezxvpwQD9uGtK2shHdi55QT+MbjIw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.24.5.tgz",
+ "integrity": "sha512-x32i4hEXvr+iI0NEoEfDKzlemF8AmtOP8CcrRaEcpzysWuoEb1KknpcvMsHKPONoKZiDuItklgWhB18xEhr9PA==",
"dev": true,
"requires": {
- "@babel/types": "^7.23.6",
- "@jridgewell/gen-mapping": "^0.3.2",
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@babel/types": "^7.24.5",
+ "@jridgewell/gen-mapping": "^0.3.5",
+ "@jridgewell/trace-mapping": "^0.3.25",
"jsesc": "^2.5.1"
}
},
@@ -8630,19 +8641,19 @@
}
},
"@babel/helper-create-class-features-plugin": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.23.7.tgz",
- "integrity": "sha512-xCoqR/8+BoNnXOY7RVSgv6X+o7pmT5q1d+gGcRlXYkI+9B31glE4jeejhKVpA04O1AtzOt7OSQ6VYKP5FcRl9g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.24.5.tgz",
+ "integrity": "sha512-uRc4Cv8UQWnE4NXlYTIIdM7wfFkOqlFztcC/gVXDKohKoVB3OyonfelUBaJzSwpBntZ2KYGF/9S7asCHsXwW6g==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-member-expression-to-functions": "^7.23.0",
+ "@babel/helper-member-expression-to-functions": "^7.24.5",
"@babel/helper-optimise-call-expression": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
+ "@babel/helper-replace-supers": "^7.24.1",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"semver": "^6.3.1"
}
},
@@ -8658,9 +8669,9 @@
}
},
"@babel/helper-define-polyfill-provider": {
- "version": "0.5.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.5.0.tgz",
- "integrity": "sha512-NovQquuQLAQ5HuyjCz7WQP9MjRj7dx++yspwiyUiGl9ZyadHRSql1HZh5ogRd8W8w6YM6EQ/NTB8rgjLt5W65Q==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.2.tgz",
+ "integrity": "sha512-LV76g+C502biUK6AyZ3LK10vDpDyCzZnhZFXkH1L75zHPj68+qc8Zfpx2th+gzwA2MzyK+1g/3EPl62yFnVttQ==",
"dev": true,
"requires": {
"@babel/helper-compilation-targets": "^7.22.6",
@@ -8696,34 +8707,34 @@
}
},
"@babel/helper-member-expression-to-functions": {
- "version": "7.23.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.23.0.tgz",
- "integrity": "sha512-6gfrPwh7OuT6gZyJZvd6WbTfrqAo7vm4xCzAXOusKqq/vWdKXphTpj5klHKNmRUU6/QRGlBsyU9mAIPaWHlqJA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.24.5.tgz",
+ "integrity": "sha512-4owRteeihKWKamtqg4JmWSsEZU445xpFRXPEwp44HbgbxdWlUV1b4Agg4lkA806Lil5XM/e+FJyS0vj5T6vmcA==",
"dev": true,
"requires": {
- "@babel/types": "^7.23.0"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-module-imports": {
- "version": "7.22.15",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.22.15.tgz",
- "integrity": "sha512-0pYVBnDKZO2fnSPCrgM/6WMc7eS20Fbok+0r88fp+YtWVLZrp4CkafFGIp+W0VKw4a22sgebPT99y+FDNMdP4w==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.24.3.tgz",
+ "integrity": "sha512-viKb0F9f2s0BCS22QSF308z/+1YWKV/76mwt61NBzS5izMzDPwdq1pTrzf+Li3npBWX9KdQbkeCt1jSAM7lZqg==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.15"
+ "@babel/types": "^7.24.0"
}
},
"@babel/helper-module-transforms": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.23.3.tgz",
- "integrity": "sha512-7bBs4ED9OmswdfDzpz4MpWgSrV7FXlc3zIagvLFjS5H+Mk7Snr21vQ6QwrsoCGMfNC4e4LQPdoULEt4ykz0SRQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.24.5.tgz",
+ "integrity": "sha512-9GxeY8c2d2mdQUP1Dye0ks3VDyIMS98kt/llQ2nUId8IsWqTF0l1LkSX0/uP7l7MCDrzXS009Hyhe2gzTiGW8A==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-simple-access": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/helper-validator-identifier": "^7.22.20"
+ "@babel/helper-module-imports": "^7.24.3",
+ "@babel/helper-simple-access": "^7.24.5",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/helper-validator-identifier": "^7.24.5"
}
},
"@babel/helper-optimise-call-expression": {
@@ -8736,9 +8747,9 @@
}
},
"@babel/helper-plugin-utils": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.0.tgz",
- "integrity": "sha512-9cUznXMG0+FxRuJfvL82QlTqIzhVW9sL0KjMPHhAOOvpQGL8QtdxnBKILjBqxlHyliz0yCa1G903ZXI/FuHy2w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.5.tgz",
+ "integrity": "sha512-xjNLDopRzW2o6ba0gKbkZq5YWEBaK3PCyTOY1K2P/O07LGMhMqlMXPxwN4S5/RhWuCobT8z0jrlKGlYmeR1OhQ==",
"dev": true
},
"@babel/helper-remap-async-to-generator": {
@@ -8753,23 +8764,23 @@
}
},
"@babel/helper-replace-supers": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.22.20.tgz",
- "integrity": "sha512-qsW0In3dbwQUbK8kejJ4R7IHVGwHJlV6lpG6UA7a9hSa2YEiAib+N1T2kr6PEeUT+Fl7najmSOS6SmAwCHK6Tw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.24.1.tgz",
+ "integrity": "sha512-QCR1UqC9BzG5vZl8BMicmZ28RuUBnHhAMddD8yHFHDRH9lLTZ9uUPehX8ctVPT8l0TKblJidqcgUUKGVrePleQ==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-member-expression-to-functions": "^7.22.15",
+ "@babel/helper-member-expression-to-functions": "^7.23.0",
"@babel/helper-optimise-call-expression": "^7.22.5"
}
},
"@babel/helper-simple-access": {
- "version": "7.22.5",
- "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.22.5.tgz",
- "integrity": "sha512-n0H99E/K+Bika3++WNL17POvo4rKWZ7lZEp1Q+fStVbUi8nxPQEBOlTmCOxW/0JsS56SKKQ+ojAe2pHKJHN35w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.24.5.tgz",
+ "integrity": "sha512-uH3Hmf5q5n7n8mz7arjUlDOCbttY/DW4DYhE6FUsjKJ/oYC1kQQUvwEQWxRwUpX9qQKRXeqLwWxrqilMrf32sQ==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-skip-transparent-expression-wrappers": {
@@ -8782,24 +8793,24 @@
}
},
"@babel/helper-split-export-declaration": {
- "version": "7.22.6",
- "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.22.6.tgz",
- "integrity": "sha512-AsUnxuLhRYsisFiaJwvp1QF+I3KjD5FOxut14q/GzovUe6orHLesW2C7d754kRm53h5gqrz6sFl6sxc4BVtE/g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.24.5.tgz",
+ "integrity": "sha512-5CHncttXohrHk8GWOFCcCl4oRD9fKosWlIRgWm4ql9VYioKm52Mk2xsmoohvm7f3JoiLSM5ZgJuRaf5QZZYd3Q==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-string-parser": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz",
- "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.24.1.tgz",
+ "integrity": "sha512-2ofRCjnnA9y+wk8b9IAREroeUP02KHp431N2mhKniy2yKIDKpbrHv9eXwm8cBeWQYcJmzv5qKCu65P47eCF7CQ==",
"dev": true
},
"@babel/helper-validator-identifier": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz",
- "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.24.5.tgz",
+ "integrity": "sha512-3q93SSKX2TWCG30M2G2kwaKeTYgEUp5Snjuj8qm729SObL6nbtUldAi37qbxkD5gg3xnBio+f9nqpSepGZMvxA==",
"dev": true
},
"@babel/helper-validator-option": {
@@ -8809,72 +8820,83 @@
"dev": true
},
"@babel/helper-wrap-function": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.22.20.tgz",
- "integrity": "sha512-pms/UwkOpnQe/PDAEdV/d7dVCoBbB+R4FvYoHGZz+4VPcg7RtYy2KP7S2lbuWM6FCSgob5wshfGESbC/hzNXZw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.24.5.tgz",
+ "integrity": "sha512-/xxzuNvgRl4/HLNKvnFwdhdgN3cpLxgLROeLDl83Yx0AJ1SGvq1ak0OszTOjDfiB8Vx03eJbeDWh9r+jCCWttw==",
"dev": true,
"requires": {
- "@babel/helper-function-name": "^7.22.5",
- "@babel/template": "^7.22.15",
- "@babel/types": "^7.22.19"
+ "@babel/helper-function-name": "^7.23.0",
+ "@babel/template": "^7.24.0",
+ "@babel/types": "^7.24.5"
}
},
"@babel/helpers": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.0.tgz",
- "integrity": "sha512-ulDZdc0Aj5uLc5nETsa7EPx2L7rM0YJM8r7ck7U73AXi7qOV44IHHRAYZHY6iU1rr3C5N4NtTmMRUJP6kwCWeA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.5.tgz",
+ "integrity": "sha512-CiQmBMMpMQHwM5m01YnrM6imUG1ebgYJ+fAIW4FZe6m4qHTPaRHti+R8cggAwkdz4oXhtO4/K9JWlh+8hIfR2Q==",
"dev": true,
"requires": {
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0"
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5"
}
},
"@babel/highlight": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz",
- "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.24.5.tgz",
+ "integrity": "sha512-8lLmua6AVh/8SLJRRVD6V8p73Hir9w5mJrhE+IPpILG31KKlI9iz5zmBYKcWPS59qSfgP9RaSBQSHHE81WKuEw==",
"dev": true,
"requires": {
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-validator-identifier": "^7.24.5",
"chalk": "^2.4.2",
- "js-tokens": "^4.0.0"
+ "js-tokens": "^4.0.0",
+ "picocolors": "^1.0.0"
}
},
"@babel/parser": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.0.tgz",
- "integrity": "sha512-QuP/FxEAzMSjXygs8v4N9dvdXzEHN4W1oF3PxuWAtPo08UdM17u89RDMgjLn/mlc56iM0HlLmVkO/wgR+rDgHg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.5.tgz",
+ "integrity": "sha512-EOv5IK8arwh3LI47dz1b0tKUb/1uhHAnHJOrjgtQMIpu1uXd9mlFrJg9IUgGUgZ41Ch0K8REPTYpO7B76b4vJg==",
"dev": true
},
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.24.5.tgz",
+ "integrity": "sha512-LdXRi1wEMTrHVR4Zc9F8OewC3vdm5h4QB6L71zy6StmYeqGi1b3ttIO8UC+BfZKcH9jdr4aI249rBkm+3+YvHw==",
+ "dev": true,
+ "requires": {
+ "@babel/helper-environment-visitor": "^7.22.20",
+ "@babel/helper-plugin-utils": "^7.24.5"
+ }
+ },
"@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.23.3.tgz",
- "integrity": "sha512-iRkKcCqb7iGnq9+3G6rZ+Ciz5VywC4XNRHe57lKM+jOeYAoR0lVqdeeDRfh0tQcTfw/+vBhHn926FmQhLtlFLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.24.1.tgz",
+ "integrity": "sha512-y4HqEnkelJIOQGd+3g1bTeKsA5c6qM7eOn7VggGVbBc0y8MLSKHacwcIE2PplNlQSj0PqS9rrXL/nkPVK+kUNg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.23.3.tgz",
- "integrity": "sha512-WwlxbfMNdVEpQjZmK5mhm7oSwD3dS6eU+Iwsi4Knl9wAletWem7kaRsGOG+8UEbRyqxY4SS5zvtfXwX+jMxUwQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.24.1.tgz",
+ "integrity": "sha512-Hj791Ii4ci8HqnaKHAlLNs+zaLXb0EzSDhiAWp5VNlyvCNymYfacs64pxTxbH1znW/NcArSmwpmG9IKE/TUVVQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/plugin-transform-optional-chaining": "^7.23.3"
+ "@babel/plugin-transform-optional-chaining": "^7.24.1"
}
},
"@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.23.7.tgz",
- "integrity": "sha512-LlRT7HgaifEpQA1ZgLVOIJZZFVPWN5iReq/7/JixwBtwcoeVGDBD53ZV28rrsLYOZs1Y/EHhA8N/Z6aazHR8cw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.24.1.tgz",
+ "integrity": "sha512-m9m/fXsXLiHfwdgydIFnpk+7jlVbnvlK5B2EKiPdLUb6WX654ZaaEWJUjk8TftRbZpK0XibovlLWX4KIZhV6jw==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-proposal-private-property-in-object": {
@@ -8930,21 +8952,21 @@
}
},
"@babel/plugin-syntax-import-assertions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.23.3.tgz",
- "integrity": "sha512-lPgDSU+SJLK3xmFDTV2ZRQAiM7UuUjGidwBywFavObCiZc1BeAAcMtHJKUya92hPHO+at63JJPLygilZard8jw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.24.1.tgz",
+ "integrity": "sha512-IuwnI5XnuF189t91XbxmXeCDz3qs6iDRO7GJ++wcfgeXNs/8FmIlKcpDSXNVyuLQxlwvskmI3Ct73wUODkJBlQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-syntax-import-attributes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.23.3.tgz",
- "integrity": "sha512-pawnE0P9g10xgoP7yKr6CK63K2FMsTE+FZidZO/1PwRdzmAPVs+HS1mAURUsgaoxammTJvULUdIkEK0gOcU2tA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.24.1.tgz",
+ "integrity": "sha512-zhQTMH0X2nVLnb04tz+s7AMuasX8U0FnpE+nHTOhSOINjWMnopoZTxtIKsd45n4GQ/HIZLyfIpoul8e2m0DnRA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-syntax-import-meta": {
@@ -9057,260 +9079,260 @@
}
},
"@babel/plugin-transform-arrow-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.23.3.tgz",
- "integrity": "sha512-NzQcQrzaQPkaEwoTm4Mhyl8jI1huEL/WWIEvudjTCMJ9aBZNpsJbMASx7EQECtQQPS/DcnFpo0FIh3LvEO9cxQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.24.1.tgz",
+ "integrity": "sha512-ngT/3NkRhsaep9ck9uj2Xhv9+xB1zShY3tM3g6om4xxCELwCDN4g4Aq5dRn48+0hasAql7s2hdBOysCfNpr4fw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-async-generator-functions": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.23.9.tgz",
- "integrity": "sha512-8Q3veQEDGe14dTYuwagbRtwxQDnytyg1JFu4/HwEMETeofocrB0U0ejBJIXoeG/t2oXZ8kzCyI0ZZfbT80VFNQ==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.24.3.tgz",
+ "integrity": "sha512-Qe26CMYVjpQxJ8zxM1340JFNjZaF+ISWpr1Kt/jGo+ZTUzKkfw/pphEWbRCb+lmSM6k/TOgfYLvmbHkUQ0asIg==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20",
"@babel/plugin-syntax-async-generators": "^7.8.4"
}
},
"@babel/plugin-transform-async-to-generator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.23.3.tgz",
- "integrity": "sha512-A7LFsKi4U4fomjqXJlZg/u0ft/n8/7n7lpffUP/ZULx/DtV9SGlNKZolHH6PE8Xl1ngCc0M11OaeZptXVkfKSw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.24.1.tgz",
+ "integrity": "sha512-AawPptitRXp1y0n4ilKcGbRYWfbbzFWz2NqNu7dacYDtFtz0CMjG64b3LQsb3KIgnf4/obcUL78hfaOS7iCUfw==",
"dev": true,
"requires": {
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-module-imports": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20"
}
},
"@babel/plugin-transform-block-scoped-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.23.3.tgz",
- "integrity": "sha512-vI+0sIaPIO6CNuM9Kk5VmXcMVRiOpDh7w2zZt9GXzmE/9KD70CUEVhvPR/etAeNK/FAEkhxQtXOzVF3EuRL41A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.24.1.tgz",
+ "integrity": "sha512-TWWC18OShZutrv9C6mye1xwtam+uNi2bnTOCBUd5sZxyHOiWbU6ztSROofIMrK84uweEZC219POICK/sTYwfgg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-block-scoping": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.23.4.tgz",
- "integrity": "sha512-0QqbP6B6HOh7/8iNR4CQU2Th/bbRtBp4KS9vcaZd1fZ0wSh5Fyssg0UCIHwxh+ka+pNDREbVLQnHCMHKZfPwfw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.24.5.tgz",
+ "integrity": "sha512-sMfBc3OxghjC95BkYrYocHL3NaOplrcaunblzwXhGmlPwpmfsxr4vK+mBBt49r+S240vahmv+kUxkeKgs+haCw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-class-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.23.3.tgz",
- "integrity": "sha512-uM+AN8yCIjDPccsKGlw271xjJtGii+xQIF/uMPS8H15L12jZTsLfF4o5vNO7d/oUguOyfdikHGc/yi9ge4SGIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.24.1.tgz",
+ "integrity": "sha512-OMLCXi0NqvJfORTaPQBwqLXHhb93wkBKZ4aNwMl6WtehO7ar+cmp+89iPEQPqxAnxsOKTaMcs3POz3rKayJ72g==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-class-static-block": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.23.4.tgz",
- "integrity": "sha512-nsWu/1M+ggti1SOALj3hfx5FXzAY06fwPJsUZD4/A5e1bWi46VUIWtD+kOX6/IdhXGsXBWllLFDSnqSCdUNydQ==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.24.4.tgz",
+ "integrity": "sha512-B8q7Pz870Hz/q9UgP8InNpY01CSLDSCyqX7zcRuv3FcPl87A2G17lASroHWaCtbdIcbYzOZ7kWmXFKbijMSmFg==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.4",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-class-static-block": "^7.14.5"
}
},
"@babel/plugin-transform-classes": {
- "version": "7.23.8",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.23.8.tgz",
- "integrity": "sha512-yAYslGsY1bX6Knmg46RjiCiNSwJKv2IUC8qOdYKqMMr0491SXFhcHqOdRDeCRohOOIzwN/90C6mQ9qAKgrP7dg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.24.5.tgz",
+ "integrity": "sha512-gWkLP25DFj2dwe9Ck8uwMOpko4YsqyfZJrOmqqcegeDYEbp7rmn4U6UQZNj08UF6MaX39XenSpKRCvpDRBtZ7Q==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-plugin-utils": "^7.24.5",
+ "@babel/helper-replace-supers": "^7.24.1",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"globals": "^11.1.0"
}
},
"@babel/plugin-transform-computed-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.23.3.tgz",
- "integrity": "sha512-dTj83UVTLw/+nbiHqQSFdwO9CbTtwq1DsDqm3CUEtDrZNET5rT5E6bIdTlOftDTDLMYxvxHNEYO4B9SLl8SLZw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.24.1.tgz",
+ "integrity": "sha512-5pJGVIUfJpOS+pAqBQd+QMaTD2vCL/HcePooON6pDpHgRp4gNRmzyHTPIkXntwKsq3ayUFVfJaIKPw2pOkOcTw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/template": "^7.22.15"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/template": "^7.24.0"
}
},
"@babel/plugin-transform-destructuring": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.23.3.tgz",
- "integrity": "sha512-n225npDqjDIr967cMScVKHXJs7rout1q+tt50inyBCPkyZ8KxeI6d+GIbSBTT/w/9WdlWDOej3V9HE5Lgk57gw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.24.5.tgz",
+ "integrity": "sha512-SZuuLyfxvsm+Ah57I/i1HVjveBENYK9ue8MJ7qkc7ndoNjqquJiElzA7f5yaAXjyW2hKojosOTAQQRX50bPSVg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-dotall-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.23.3.tgz",
- "integrity": "sha512-vgnFYDHAKzFaTVp+mneDsIEbnJ2Np/9ng9iviHw3P/KVcgONxpNULEW/51Z/BaFojG2GI2GwwXck5uV1+1NOYQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.24.1.tgz",
+ "integrity": "sha512-p7uUxgSoZwZ2lPNMzUkqCts3xlp8n+o05ikjy7gbtFJSt9gdU88jAmtfmOxHM14noQXBxfgzf2yRWECiNVhTCw==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-duplicate-keys": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.23.3.tgz",
- "integrity": "sha512-RrqQ+BQmU3Oyav3J+7/myfvRCq7Tbz+kKLLshUmMwNlDHExbGL7ARhajvoBJEvc+fCguPPu887N+3RRXBVKZUA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.24.1.tgz",
+ "integrity": "sha512-msyzuUnvsjsaSaocV6L7ErfNsa5nDWL1XKNnDePLgmz+WdU4w/J8+AxBMrWfi9m4IxfL5sZQKUPQKDQeeAT6lA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-dynamic-import": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.23.4.tgz",
- "integrity": "sha512-V6jIbLhdJK86MaLh4Jpghi8ho5fGzt3imHOBu/x0jlBaPYqDoWz4RDXjmMOfnh+JWNaQleEAByZLV0QzBT4YQQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.24.1.tgz",
+ "integrity": "sha512-av2gdSTyXcJVdI+8aFZsCAtR29xJt0S5tas+Ef8NvBNmD1a+N/3ecMLeMBgfcK+xzsjdLDT6oHt+DFPyeqUbDA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-dynamic-import": "^7.8.3"
}
},
"@babel/plugin-transform-exponentiation-operator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.23.3.tgz",
- "integrity": "sha512-5fhCsl1odX96u7ILKHBj4/Y8vipoqwsJMh4csSA8qFfxrZDEA4Ssku2DyNvMJSmZNOEBT750LfFPbtrnTP90BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.24.1.tgz",
+ "integrity": "sha512-U1yX13dVBSwS23DEAqU+Z/PkwE9/m7QQy8Y9/+Tdb8UWYaGNDYwTLi19wqIAiROr8sXVum9A/rtiH5H0boUcTw==",
"dev": true,
"requires": {
"@babel/helper-builder-binary-assignment-operator-visitor": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-export-namespace-from": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.23.4.tgz",
- "integrity": "sha512-GzuSBcKkx62dGzZI1WVgTWvkkz84FZO5TC5T8dl/Tht/rAla6Dg/Mz9Yhypg+ezVACf/rgDuQt3kbWEv7LdUDQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.24.1.tgz",
+ "integrity": "sha512-Ft38m/KFOyzKw2UaJFkWG9QnHPG/Q/2SkOrRk4pNBPg5IPZ+dOxcmkK5IyuBcxiNPyyYowPGUReyBvrvZs7IlQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3"
}
},
"@babel/plugin-transform-for-of": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.23.6.tgz",
- "integrity": "sha512-aYH4ytZ0qSuBbpfhuofbg/e96oQ7U2w1Aw/UQmKT+1l39uEhUPoFS3fHevDc1G0OvewyDudfMKY1OulczHzWIw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.24.1.tgz",
+ "integrity": "sha512-OxBdcnF04bpdQdR3i4giHZNZQn7cm8RQKcSwA17wAAqEELo1ZOwp5FFgeptWUQXFyT9kwHo10aqqauYkRZPCAg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
}
},
"@babel/plugin-transform-function-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.23.3.tgz",
- "integrity": "sha512-I1QXp1LxIvt8yLaib49dRW5Okt7Q4oaxao6tFVKS/anCdEOMtYwWVKoiOA1p34GOWIZjUK0E+zCp7+l1pfQyiw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.24.1.tgz",
+ "integrity": "sha512-BXmDZpPlh7jwicKArQASrj8n22/w6iymRnvHYYd2zO30DbE277JO20/7yXJT3QxDPtiQiOxQBbZH4TpivNXIxA==",
"dev": true,
"requires": {
- "@babel/helper-compilation-targets": "^7.22.15",
+ "@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-json-strings": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.23.4.tgz",
- "integrity": "sha512-81nTOqM1dMwZ/aRXQ59zVubN9wHGqk6UtqRK+/q+ciXmRy8fSolhGVvG09HHRGo4l6fr/c4ZhXUQH0uFW7PZbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.24.1.tgz",
+ "integrity": "sha512-U7RMFmRvoasscrIFy5xA4gIp8iWnWubnKkKuUGJjsuOH7GfbMkB+XZzeslx2kLdEGdOJDamEmCqOks6e8nv8DQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-json-strings": "^7.8.3"
}
},
"@babel/plugin-transform-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.23.3.tgz",
- "integrity": "sha512-wZ0PIXRxnwZvl9AYpqNUxpZ5BiTGrYt7kueGQ+N5FiQ7RCOD4cm8iShd6S6ggfVIWaJf2EMk8eRzAh52RfP4rQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.24.1.tgz",
+ "integrity": "sha512-zn9pwz8U7nCqOYIiBaOxoQOtYmMODXTJnkxG4AtX8fPmnCRYWBOHD0qcpwS9e2VDSp1zNJYpdnFMIKb8jmwu6g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-logical-assignment-operators": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.23.4.tgz",
- "integrity": "sha512-Mc/ALf1rmZTP4JKKEhUwiORU+vcfarFVLfcFiolKUo6sewoxSEgl36ak5t+4WamRsNr6nzjZXQjM35WsU+9vbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.24.1.tgz",
+ "integrity": "sha512-OhN6J4Bpz+hIBqItTeWJujDOfNP+unqv/NJgyhlpSqgBTPm37KkMmZV6SYcOj+pnDbdcl1qRGV/ZiIjX9Iy34w==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
}
},
"@babel/plugin-transform-member-expression-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.23.3.tgz",
- "integrity": "sha512-sC3LdDBDi5x96LA+Ytekz2ZPk8i/Ck+DEuDbRAll5rknJ5XRTSaPKEYwomLcs1AA8wg9b3KjIQRsnApj+q51Ag==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.24.1.tgz",
+ "integrity": "sha512-4ojai0KysTWXzHseJKa1XPNXKRbuUrhkOPY4rEGeR+7ChlJVKxFa3H3Bz+7tWaGKgJAXUWKOGmltN+u9B3+CVg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-modules-amd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.23.3.tgz",
- "integrity": "sha512-vJYQGxeKM4t8hYCKVBlZX/gtIY2I7mRGFNcm85sgXGMTBcoV3QdVtdpbcWEbzbfUIUZKwvgFT82mRvaQIebZzw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.24.1.tgz",
+ "integrity": "sha512-lAxNHi4HVtjnHd5Rxg3D5t99Xm6H7b04hUS7EHIXcUl2EV4yl1gWdqZrNzXnSrHveL9qMdbODlLF55mvgjAfaQ==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-modules-commonjs": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.23.3.tgz",
- "integrity": "sha512-aVS0F65LKsdNOtcz6FRCpE4OgsP2OFnW46qNxNIX9h3wuzaNcSQsJysuMwqSibC98HPrf2vCgtxKNwS0DAlgcA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.24.1.tgz",
+ "integrity": "sha512-szog8fFTUxBfw0b98gEWPaEqF42ZUD/T3bkynW/wtgx2p/XCP55WEsb+VosKceRSd6njipdZvNogqdtI4Q0chw==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-simple-access": "^7.22.5"
}
},
"@babel/plugin-transform-modules-systemjs": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.23.9.tgz",
- "integrity": "sha512-KDlPRM6sLo4o1FkiSlXoAa8edLXFsKKIda779fbLrvmeuc3itnjCtaO6RrtoaANsIJANj+Vk1zqbZIMhkCAHVw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.24.1.tgz",
+ "integrity": "sha512-mqQ3Zh9vFO1Tpmlt8QPnbwGHzNz3lpNEMxQb1kAemn/erstyqw1r9KeOlOfo3y6xAnFEcOv2tSyrXfmMk+/YZA==",
"dev": true,
"requires": {
"@babel/helper-hoist-variables": "^7.22.5",
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-validator-identifier": "^7.22.20"
}
},
"@babel/plugin-transform-modules-umd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.23.3.tgz",
- "integrity": "sha512-zHsy9iXX2nIsCBFPud3jKn1IRPWg3Ing1qOZgeKV39m1ZgIdpJqvlWVeiHBZC6ITRG0MfskhYe9cLgntfSFPIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.24.1.tgz",
+ "integrity": "sha512-tuA3lpPj+5ITfcCluy6nWonSL7RvaG0AOTeAuvXqEKS34lnLzXpDb0dcP6K8jD0zWZFNDVly90AGFJPnm4fOYg==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-named-capturing-groups-regex": {
@@ -9324,125 +9346,124 @@
}
},
"@babel/plugin-transform-new-target": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.23.3.tgz",
- "integrity": "sha512-YJ3xKqtJMAT5/TIZnpAR3I+K+WaDowYbN3xyxI8zxx/Gsypwf9B9h0VB+1Nh6ACAAPRS5NSRje0uVv5i79HYGQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.24.1.tgz",
+ "integrity": "sha512-/rurytBM34hYy0HKZQyA0nHbQgQNFm4Q/BOc9Hflxi2X3twRof7NaE5W46j4kQitm7SvACVRXsa6N/tSZxvPug==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-nullish-coalescing-operator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.23.4.tgz",
- "integrity": "sha512-jHE9EVVqHKAQx+VePv5LLGHjmHSJR76vawFPTdlxR/LVJPfOEGxREQwQfjuZEOPTwG92X3LINSh3M40Rv4zpVA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.24.1.tgz",
+ "integrity": "sha512-iQ+caew8wRrhCikO5DrUYx0mrmdhkaELgFa+7baMcVuhxIkN7oxt06CZ51D65ugIb1UWRQ8oQe+HXAVM6qHFjw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
}
},
"@babel/plugin-transform-numeric-separator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.23.4.tgz",
- "integrity": "sha512-mps6auzgwjRrwKEZA05cOwuDc9FAzoyFS4ZsG/8F43bTLf/TgkJg7QXOrPO1JO599iA3qgK9MXdMGOEC8O1h6Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.24.1.tgz",
+ "integrity": "sha512-7GAsGlK4cNL2OExJH1DzmDeKnRv/LXq0eLUSvudrehVA5Rgg4bIrqEUW29FbKMBRT0ztSqisv7kjP+XIC4ZMNw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-numeric-separator": "^7.10.4"
}
},
"@babel/plugin-transform-object-rest-spread": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.0.tgz",
- "integrity": "sha512-y/yKMm7buHpFFXfxVFS4Vk1ToRJDilIa6fKRioB9Vjichv58TDGXTvqV0dN7plobAmTW5eSEGXDngE+Mm+uO+w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.5.tgz",
+ "integrity": "sha512-7EauQHszLGM3ay7a161tTQH7fj+3vVM/gThlz5HpFtnygTxjrlvoeq7MPVA1Vy9Q555OB8SnAOsMkLShNkkrHA==",
"dev": true,
"requires": {
- "@babel/compat-data": "^7.23.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-object-rest-spread": "^7.8.3",
- "@babel/plugin-transform-parameters": "^7.23.3"
+ "@babel/plugin-transform-parameters": "^7.24.5"
}
},
"@babel/plugin-transform-object-super": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.23.3.tgz",
- "integrity": "sha512-BwQ8q0x2JG+3lxCVFohg+KbQM7plfpBwThdW9A6TMtWwLsbDA01Ek2Zb/AgDN39BiZsExm4qrXxjk+P1/fzGrA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.24.1.tgz",
+ "integrity": "sha512-oKJqR3TeI5hSLRxudMjFQ9re9fBVUU0GICqM3J1mi8MqlhVr6hC/ZN4ttAyMuQR6EZZIY6h/exe5swqGNNIkWQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-replace-supers": "^7.24.1"
}
},
"@babel/plugin-transform-optional-catch-binding": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.23.4.tgz",
- "integrity": "sha512-XIq8t0rJPHf6Wvmbn9nFxU6ao4c7WhghTR5WyV8SrJfUFzyxhCm4nhC+iAp3HFhbAKLfYpgzhJ6t4XCtVwqO5A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.24.1.tgz",
+ "integrity": "sha512-oBTH7oURV4Y+3EUrf6cWn1OHio3qG/PVwO5J03iSJmBg6m2EhKjkAu/xuaXaYwWW9miYtvbWv4LNf0AmR43LUA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
}
},
"@babel/plugin-transform-optional-chaining": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.23.4.tgz",
- "integrity": "sha512-ZU8y5zWOfjM5vZ+asjgAPwDaBjJzgufjES89Rs4Lpq63O300R/kOz30WCLo6BxxX6QVEilwSlpClnG5cZaikTA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.24.5.tgz",
+ "integrity": "sha512-xWCkmwKT+ihmA6l7SSTpk8e4qQl/274iNbSKRRS8mpqFR32ksy36+a+LWY8OXCCEefF8WFlnOHVsaDI2231wBg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
"@babel/plugin-syntax-optional-chaining": "^7.8.3"
}
},
"@babel/plugin-transform-parameters": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.23.3.tgz",
- "integrity": "sha512-09lMt6UsUb3/34BbECKVbVwrT9bO6lILWln237z7sLaWnMsTi7Yc9fhX5DLpkJzAGfaReXI22wP41SZmnAA3Vw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.24.5.tgz",
+ "integrity": "sha512-9Co00MqZ2aoky+4j2jhofErthm6QVLKbpQrvz20c3CH9KQCLHyNB+t2ya4/UrRpQGR+Wrwjg9foopoeSdnHOkA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-private-methods": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.23.3.tgz",
- "integrity": "sha512-UzqRcRtWsDMTLrRWFvUBDwmw06tCQH9Rl1uAjfh6ijMSmGYQ+fpdB+cnqRC8EMh5tuuxSv0/TejGL+7vyj+50g==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.24.1.tgz",
+ "integrity": "sha512-tGvisebwBO5em4PaYNqt4fkw56K2VALsAbAakY0FjTYqJp7gfdrgr7YX76Or8/cpik0W6+tj3rZ0uHU9Oil4tw==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-private-property-in-object": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.23.4.tgz",
- "integrity": "sha512-9G3K1YqTq3F4Vt88Djx1UZ79PDyj+yKRnUy7cZGSMe+a7jkwD259uKKuUzQlPkGam7R+8RJwh5z4xO27fA1o2A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.24.5.tgz",
+ "integrity": "sha512-JM4MHZqnWR04jPMujQDTBVRnqxpLLpx2tkn7iPn+Hmsc0Gnb79yvRWOkvqFOx3Z7P7VxiRIR22c4eGSNj87OBQ==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-private-property-in-object": "^7.14.5"
}
},
"@babel/plugin-transform-property-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.23.3.tgz",
- "integrity": "sha512-jR3Jn3y7cZp4oEWPFAlRsSWjxKe4PZILGBSd4nis1TsC5qeSpb+nrtihJuDhNI7QHiVbUaiXa0X2RZY3/TI6Nw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.24.1.tgz",
+ "integrity": "sha512-LetvD7CrHmEx0G442gOomRr66d7q8HzzGGr4PMHGr+5YIm6++Yke+jxj246rpvsbyhJwCLxcTn6zW1P1BSenqA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-react-display-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.23.3.tgz",
- "integrity": "sha512-GnvhtVfA2OAtzdX58FJxU19rhoGeQzyVndw3GgtdECQvQFXPEZIOVULHVZGAYmOgmqjXpVpfocAbSjh99V/Fqw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.24.1.tgz",
+ "integrity": "sha512-mvoQg2f9p2qlpDQRBC7M3c3XTr0k7cp/0+kFKKO/7Gtu0LSw16eKB+Fabe2bDT/UpsyasTBBkAnbdsLrkD5XMw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-react-jsx": {
@@ -9468,140 +9489,141 @@
}
},
"@babel/plugin-transform-react-pure-annotations": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.23.3.tgz",
- "integrity": "sha512-qMFdSS+TUhB7Q/3HVPnEdYJDQIk57jkntAwSuz9xfSE4n+3I+vHYCli3HoHawN1Z3RfCz/y1zXA/JXjG6cVImQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.24.1.tgz",
+ "integrity": "sha512-+pWEAaDJvSm9aFvJNpLiM2+ktl2Sn2U5DdyiWdZBxmLc6+xGt88dvFqsHiAiDS+8WqUwbDfkKz9jRxK3M0k+kA==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-regenerator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.23.3.tgz",
- "integrity": "sha512-KP+75h0KghBMcVpuKisx3XTu9Ncut8Q8TuvGO4IhY+9D5DFEckQefOuIsB/gQ2tG71lCke4NMrtIPS8pOj18BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.24.1.tgz",
+ "integrity": "sha512-sJwZBCzIBE4t+5Q4IGLaaun5ExVMRY0lYwos/jNecjMrVCygCdph3IKv0tkP5Fc87e/1+bebAmEAGBfnRD+cnw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"regenerator-transform": "^0.15.2"
}
},
"@babel/plugin-transform-reserved-words": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.23.3.tgz",
- "integrity": "sha512-QnNTazY54YqgGxwIexMZva9gqbPa15t/x9VS+0fsEFWplwVpXYZivtgl43Z1vMpc1bdPP2PP8siFeVcnFvA3Cg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.24.1.tgz",
+ "integrity": "sha512-JAclqStUfIwKN15HrsQADFgeZt+wexNQ0uLhuqvqAUFoqPMjEcFCYZBhq0LUdz6dZK/mD+rErhW71fbx8RYElg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-shorthand-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.23.3.tgz",
- "integrity": "sha512-ED2fgqZLmexWiN+YNFX26fx4gh5qHDhn1O2gvEhreLW2iI63Sqm4llRLCXALKrCnbN4Jy0VcMQZl/SAzqug/jg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.24.1.tgz",
+ "integrity": "sha512-LyjVB1nsJ6gTTUKRjRWx9C1s9hE7dLfP/knKdrfeH9UPtAGjYGgxIbFfx7xyLIEWs7Xe1Gnf8EWiUqfjLhInZA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-spread": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.23.3.tgz",
- "integrity": "sha512-VvfVYlrlBVu+77xVTOAoxQ6mZbnIq5FM0aGBSFEcIh03qHf+zNqA4DC/3XMUozTg7bZV3e3mZQ0i13VB6v5yUg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.24.1.tgz",
+ "integrity": "sha512-KjmcIM+fxgY+KxPVbjelJC6hrH1CgtPmTvdXAfn3/a9CnWGSTY7nH4zm5+cjmWJybdcPSsD0++QssDsjcpe47g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
}
},
"@babel/plugin-transform-sticky-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.23.3.tgz",
- "integrity": "sha512-HZOyN9g+rtvnOU3Yh7kSxXrKbzgrm5X4GncPY1QOquu7epga5MxKHVpYu2hvQnry/H+JjckSYRb93iNfsioAGg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.24.1.tgz",
+ "integrity": "sha512-9v0f1bRXgPVcPrngOQvLXeGNNVLc8UjMVfebo9ka0WF3/7+aVUHmaJVT3sa0XCzEFioPfPHZiOcYG9qOsH63cw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-template-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.23.3.tgz",
- "integrity": "sha512-Flok06AYNp7GV2oJPZZcP9vZdszev6vPBkHLwxwSpaIqx75wn6mUd3UFWsSsA0l8nXAKkyCmL/sR02m8RYGeHg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.24.1.tgz",
+ "integrity": "sha512-WRkhROsNzriarqECASCNu/nojeXCDTE/F2HmRgOzi7NGvyfYGq1NEjKBK3ckLfRgGc6/lPAqP0vDOSw3YtG34g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-typeof-symbol": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.23.3.tgz",
- "integrity": "sha512-4t15ViVnaFdrPC74be1gXBSMzXk3B4Us9lP7uLRQHTFpV5Dvt33pn+2MyyNxmN3VTTm3oTrZVMUmuw3oBnQ2oQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.24.5.tgz",
+ "integrity": "sha512-UTGnhYVZtTAjdwOTzT+sCyXmTn8AhaxOS/MjG9REclZ6ULHWF9KoCZur0HSGU7hk8PdBFKKbYe6+gqdXWz84Jg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-unicode-escapes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.23.3.tgz",
- "integrity": "sha512-OMCUx/bU6ChE3r4+ZdylEqAjaQgHAgipgW8nsCfu5pGqDcFytVd91AwRvUJSBZDz0exPGgnjoqhgRYLRjFZc9Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.24.1.tgz",
+ "integrity": "sha512-RlkVIcWT4TLI96zM660S877E7beKlQw7Ig+wqkKBiWfj0zH5Q4h50q6er4wzZKRNSYpfo6ILJ+hrJAGSX2qcNw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-property-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.23.3.tgz",
- "integrity": "sha512-KcLIm+pDZkWZQAFJ9pdfmh89EwVfmNovFBcXko8szpBeF8z68kWIPeKlmSOkT9BXJxs2C0uk+5LxoxIv62MROA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.24.1.tgz",
+ "integrity": "sha512-Ss4VvlfYV5huWApFsF8/Sq0oXnGO+jB+rijFEFugTd3cwSObUSnUi88djgR5528Csl0uKlrI331kRqe56Ov2Ng==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.23.3.tgz",
- "integrity": "sha512-wMHpNA4x2cIA32b/ci3AfwNgheiva2W0WUKWTK7vBHBhDKfPsc5cFGNWm69WBqpwd86u1qwZ9PWevKqm1A3yAw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.24.1.tgz",
+ "integrity": "sha512-2A/94wgZgxfTsiLaQ2E36XAOdcZmGAaEEgVmxQWwZXWkGhvoHbaqXcKnU8zny4ycpu3vNqg0L/PcCiYtHtA13g==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-sets-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.23.3.tgz",
- "integrity": "sha512-W7lliA/v9bNR83Qc3q1ip9CQMZ09CcHDbHfbLRDNuAhn1Mvkr1ZNF7hPmztMQvtTGVLJ9m8IZqWsTkXOml8dbw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.24.1.tgz",
+ "integrity": "sha512-fqj4WuzzS+ukpgerpAoOnMfQXwUHFxXUZUE84oL2Kao2N8uSlvcpnAidKASgsNgzZHBsHWvcm8s9FPWUhAb8fA==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/preset-env": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.0.tgz",
- "integrity": "sha512-ZxPEzV9IgvGn73iK0E6VB9/95Nd7aMFpbE0l8KQFDG70cOV9IxRP7Y2FUPmlK0v6ImlLqYX50iuZ3ZTVhOF2lA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.5.tgz",
+ "integrity": "sha512-UGK2ifKtcC8i5AI4cH+sbLLuLc2ktYSFJgBAXorKAsHUZmrQ1q6aQ6i3BvU24wWs2AAKqQB6kq3N9V9Gw1HiMQ==",
"dev": true,
"requires": {
- "@babel/compat-data": "^7.23.5",
+ "@babel/compat-data": "^7.24.4",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-validator-option": "^7.23.5",
- "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.23.3",
- "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.23.3",
- "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.23.7",
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.24.5",
+ "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.24.1",
+ "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.24.1",
+ "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.24.1",
"@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
"@babel/plugin-syntax-async-generators": "^7.8.4",
"@babel/plugin-syntax-class-properties": "^7.12.13",
"@babel/plugin-syntax-class-static-block": "^7.14.5",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3",
- "@babel/plugin-syntax-import-assertions": "^7.23.3",
- "@babel/plugin-syntax-import-attributes": "^7.23.3",
+ "@babel/plugin-syntax-import-assertions": "^7.24.1",
+ "@babel/plugin-syntax-import-attributes": "^7.24.1",
"@babel/plugin-syntax-import-meta": "^7.10.4",
"@babel/plugin-syntax-json-strings": "^7.8.3",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
@@ -9613,58 +9635,58 @@
"@babel/plugin-syntax-private-property-in-object": "^7.14.5",
"@babel/plugin-syntax-top-level-await": "^7.14.5",
"@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
- "@babel/plugin-transform-arrow-functions": "^7.23.3",
- "@babel/plugin-transform-async-generator-functions": "^7.23.9",
- "@babel/plugin-transform-async-to-generator": "^7.23.3",
- "@babel/plugin-transform-block-scoped-functions": "^7.23.3",
- "@babel/plugin-transform-block-scoping": "^7.23.4",
- "@babel/plugin-transform-class-properties": "^7.23.3",
- "@babel/plugin-transform-class-static-block": "^7.23.4",
- "@babel/plugin-transform-classes": "^7.23.8",
- "@babel/plugin-transform-computed-properties": "^7.23.3",
- "@babel/plugin-transform-destructuring": "^7.23.3",
- "@babel/plugin-transform-dotall-regex": "^7.23.3",
- "@babel/plugin-transform-duplicate-keys": "^7.23.3",
- "@babel/plugin-transform-dynamic-import": "^7.23.4",
- "@babel/plugin-transform-exponentiation-operator": "^7.23.3",
- "@babel/plugin-transform-export-namespace-from": "^7.23.4",
- "@babel/plugin-transform-for-of": "^7.23.6",
- "@babel/plugin-transform-function-name": "^7.23.3",
- "@babel/plugin-transform-json-strings": "^7.23.4",
- "@babel/plugin-transform-literals": "^7.23.3",
- "@babel/plugin-transform-logical-assignment-operators": "^7.23.4",
- "@babel/plugin-transform-member-expression-literals": "^7.23.3",
- "@babel/plugin-transform-modules-amd": "^7.23.3",
- "@babel/plugin-transform-modules-commonjs": "^7.23.3",
- "@babel/plugin-transform-modules-systemjs": "^7.23.9",
- "@babel/plugin-transform-modules-umd": "^7.23.3",
+ "@babel/plugin-transform-arrow-functions": "^7.24.1",
+ "@babel/plugin-transform-async-generator-functions": "^7.24.3",
+ "@babel/plugin-transform-async-to-generator": "^7.24.1",
+ "@babel/plugin-transform-block-scoped-functions": "^7.24.1",
+ "@babel/plugin-transform-block-scoping": "^7.24.5",
+ "@babel/plugin-transform-class-properties": "^7.24.1",
+ "@babel/plugin-transform-class-static-block": "^7.24.4",
+ "@babel/plugin-transform-classes": "^7.24.5",
+ "@babel/plugin-transform-computed-properties": "^7.24.1",
+ "@babel/plugin-transform-destructuring": "^7.24.5",
+ "@babel/plugin-transform-dotall-regex": "^7.24.1",
+ "@babel/plugin-transform-duplicate-keys": "^7.24.1",
+ "@babel/plugin-transform-dynamic-import": "^7.24.1",
+ "@babel/plugin-transform-exponentiation-operator": "^7.24.1",
+ "@babel/plugin-transform-export-namespace-from": "^7.24.1",
+ "@babel/plugin-transform-for-of": "^7.24.1",
+ "@babel/plugin-transform-function-name": "^7.24.1",
+ "@babel/plugin-transform-json-strings": "^7.24.1",
+ "@babel/plugin-transform-literals": "^7.24.1",
+ "@babel/plugin-transform-logical-assignment-operators": "^7.24.1",
+ "@babel/plugin-transform-member-expression-literals": "^7.24.1",
+ "@babel/plugin-transform-modules-amd": "^7.24.1",
+ "@babel/plugin-transform-modules-commonjs": "^7.24.1",
+ "@babel/plugin-transform-modules-systemjs": "^7.24.1",
+ "@babel/plugin-transform-modules-umd": "^7.24.1",
"@babel/plugin-transform-named-capturing-groups-regex": "^7.22.5",
- "@babel/plugin-transform-new-target": "^7.23.3",
- "@babel/plugin-transform-nullish-coalescing-operator": "^7.23.4",
- "@babel/plugin-transform-numeric-separator": "^7.23.4",
- "@babel/plugin-transform-object-rest-spread": "^7.24.0",
- "@babel/plugin-transform-object-super": "^7.23.3",
- "@babel/plugin-transform-optional-catch-binding": "^7.23.4",
- "@babel/plugin-transform-optional-chaining": "^7.23.4",
- "@babel/plugin-transform-parameters": "^7.23.3",
- "@babel/plugin-transform-private-methods": "^7.23.3",
- "@babel/plugin-transform-private-property-in-object": "^7.23.4",
- "@babel/plugin-transform-property-literals": "^7.23.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
- "@babel/plugin-transform-reserved-words": "^7.23.3",
- "@babel/plugin-transform-shorthand-properties": "^7.23.3",
- "@babel/plugin-transform-spread": "^7.23.3",
- "@babel/plugin-transform-sticky-regex": "^7.23.3",
- "@babel/plugin-transform-template-literals": "^7.23.3",
- "@babel/plugin-transform-typeof-symbol": "^7.23.3",
- "@babel/plugin-transform-unicode-escapes": "^7.23.3",
- "@babel/plugin-transform-unicode-property-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-sets-regex": "^7.23.3",
+ "@babel/plugin-transform-new-target": "^7.24.1",
+ "@babel/plugin-transform-nullish-coalescing-operator": "^7.24.1",
+ "@babel/plugin-transform-numeric-separator": "^7.24.1",
+ "@babel/plugin-transform-object-rest-spread": "^7.24.5",
+ "@babel/plugin-transform-object-super": "^7.24.1",
+ "@babel/plugin-transform-optional-catch-binding": "^7.24.1",
+ "@babel/plugin-transform-optional-chaining": "^7.24.5",
+ "@babel/plugin-transform-parameters": "^7.24.5",
+ "@babel/plugin-transform-private-methods": "^7.24.1",
+ "@babel/plugin-transform-private-property-in-object": "^7.24.5",
+ "@babel/plugin-transform-property-literals": "^7.24.1",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
+ "@babel/plugin-transform-reserved-words": "^7.24.1",
+ "@babel/plugin-transform-shorthand-properties": "^7.24.1",
+ "@babel/plugin-transform-spread": "^7.24.1",
+ "@babel/plugin-transform-sticky-regex": "^7.24.1",
+ "@babel/plugin-transform-template-literals": "^7.24.1",
+ "@babel/plugin-transform-typeof-symbol": "^7.24.5",
+ "@babel/plugin-transform-unicode-escapes": "^7.24.1",
+ "@babel/plugin-transform-unicode-property-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-sets-regex": "^7.24.1",
"@babel/preset-modules": "0.1.6-no-external-plugins",
- "babel-plugin-polyfill-corejs2": "^0.4.8",
- "babel-plugin-polyfill-corejs3": "^0.9.0",
- "babel-plugin-polyfill-regenerator": "^0.5.5",
+ "babel-plugin-polyfill-corejs2": "^0.4.10",
+ "babel-plugin-polyfill-corejs3": "^0.10.4",
+ "babel-plugin-polyfill-regenerator": "^0.6.1",
"core-js-compat": "^3.31.0",
"semver": "^6.3.1"
}
@@ -9681,17 +9703,17 @@
}
},
"@babel/preset-react": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.23.3.tgz",
- "integrity": "sha512-tbkHOS9axH6Ysf2OUEqoSZ6T3Fa2SrNH6WTWSPBboxKzdxNc9qOICeLXkNG0ZEwbQ1HY8liwOce4aN/Ceyuq6w==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.24.1.tgz",
+ "integrity": "sha512-eFa8up2/8cZXLIpkafhaADTXSnl7IsUFCYenRWrARBz0/qZwcT0RBXpys0LJU4+WfPoF2ZG6ew6s2V6izMCwRA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-validator-option": "^7.22.15",
- "@babel/plugin-transform-react-display-name": "^7.23.3",
- "@babel/plugin-transform-react-jsx": "^7.22.15",
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-validator-option": "^7.23.5",
+ "@babel/plugin-transform-react-display-name": "^7.24.1",
+ "@babel/plugin-transform-react-jsx": "^7.23.4",
"@babel/plugin-transform-react-jsx-development": "^7.22.5",
- "@babel/plugin-transform-react-pure-annotations": "^7.23.3"
+ "@babel/plugin-transform-react-pure-annotations": "^7.24.1"
}
},
"@babel/regjsgen": {
@@ -9721,31 +9743,31 @@
}
},
"@babel/traverse": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.0.tgz",
- "integrity": "sha512-HfuJlI8qq3dEDmNU5ChzzpZRWq+oxCZQyMzIMEqLho+AQnhMnKQUzH6ydo3RBl/YjPCuk68Y6s0Gx0AeyULiWw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.5.tgz",
+ "integrity": "sha512-7aaBLeDQ4zYcUFDUD41lJc1fG8+5IU9DaNSJAgal866FGvmD5EbWQgnEC6kO1gGLsX0esNkfnJSndbTXA3r7UA==",
"dev": true,
"requires": {
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
"@babel/helper-hoist-variables": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/parser": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/parser": "^7.24.5",
+ "@babel/types": "^7.24.5",
"debug": "^4.3.1",
"globals": "^11.1.0"
}
},
"@babel/types": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.0.tgz",
- "integrity": "sha512-+j7a5c253RfKh8iABBhywc8NSfP5LURe7Uh4qpsh6jc+aLJguvmIUBdjSdEMQv2bENrCR5MfRdjGo7vzS/ob7w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.5.tgz",
+ "integrity": "sha512-6mQNsaLeXTw0nxYUYu+NSa4Hx4BlF1x1x8/PMFbiR+GBSr+2DkECc69b8hgy2frEodNcvPffeH8YfWd3LI6jhQ==",
"dev": true,
"requires": {
- "@babel/helper-string-parser": "^7.23.4",
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-string-parser": "^7.24.1",
+ "@babel/helper-validator-identifier": "^7.24.5",
"to-fast-properties": "^2.0.0"
}
},
@@ -9755,11 +9777,6 @@
"integrity": "sha512-0hYQ8SB4Db5zvZB4axdMHGwEaQjkZzFjQiN9LVYvIFB2nSUHW9tYpxWriPrWDASIxiaXax83REcLxuSdnGPZtw==",
"dev": true
},
- "@braintree/sanitize-url": {
- "version": "7.0.0",
- "resolved": "https://registry.npmjs.org/@braintree/sanitize-url/-/sanitize-url-7.0.0.tgz",
- "integrity": "sha512-GMu2OJiTd1HSe74bbJYQnVvELANpYiGFZELyyTM1CR0sdv5ReQAcJ/c/8pIrPab3lO11+D+EpuGLUxqz+y832g=="
- },
"@colors/colors": {
"version": "1.6.0",
"resolved": "https://registry.npmjs.org/@colors/colors/-/colors-1.6.0.tgz",
@@ -9927,14 +9944,14 @@
"dev": true
},
"@jridgewell/gen-mapping": {
- "version": "0.3.3",
- "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.3.tgz",
- "integrity": "sha512-HLhSWOLRi875zjjMG/r+Nv0oCW8umGb0BgEhyX3dDX3egwZtB8PqLnjz3yedt8R5StBrzcg4aBpnh8UA9D1BoQ==",
+ "version": "0.3.5",
+ "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.5.tgz",
+ "integrity": "sha512-IzL8ZoEDIBRWEzlCcRhOaCupYyN5gdIK+Q6fbFdPDg6HqX6jpkItn7DFIpW9LQzXG6Df9sA7+OKnq0qlz/GaQg==",
"dev": true,
"requires": {
- "@jridgewell/set-array": "^1.0.1",
+ "@jridgewell/set-array": "^1.2.1",
"@jridgewell/sourcemap-codec": "^1.4.10",
- "@jridgewell/trace-mapping": "^0.3.9"
+ "@jridgewell/trace-mapping": "^0.3.24"
}
},
"@jridgewell/resolve-uri": {
@@ -9944,9 +9961,9 @@
"dev": true
},
"@jridgewell/set-array": {
- "version": "1.1.2",
- "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.1.2.tgz",
- "integrity": "sha512-xnkseuNADM0gt2bs+BvhO0p78Mk762YnZdsuzFV018NoG1Sj1SCQvpSqa7XUaTam5vAGasABV9qXASMKnFMwMw==",
+ "version": "1.2.1",
+ "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.2.1.tgz",
+ "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
"dev": true
},
"@jridgewell/source-map": {
@@ -9966,9 +9983,9 @@
"dev": true
},
"@jridgewell/trace-mapping": {
- "version": "0.3.22",
- "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.22.tgz",
- "integrity": "sha512-Wf963MzWtA2sjrNt+g18IAln9lKnlRp+K2eH4jjIoF1wYeq3aMREpG09xhlhdzS0EjwU7qmUJYangWa+151vZw==",
+ "version": "0.3.25",
+ "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
+ "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
"dev": true,
"requires": {
"@jridgewell/resolve-uri": "^3.1.0",
@@ -10081,9 +10098,9 @@
"dev": true
},
"@webassemblyjs/ast": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.6.tgz",
- "integrity": "sha512-IN1xI7PwOvLPgjcf180gC1bqn3q/QaOCwYUahIOhbYUu8KA/3tw2RT/T0Gidi1l7Hhj5D/INhJxiICObqpMu4Q==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.12.1.tgz",
+ "integrity": "sha512-EKfMUOPRRUTy5UII4qJDGPpqfwjOmZ5jeGFwid9mnoqIFK+e0vqoi1qH56JpmZSzEL53jKnNzScdmftJyG5xWg==",
"dev": true,
"requires": {
"@webassemblyjs/helper-numbers": "1.11.6",
@@ -10103,9 +10120,9 @@
"dev": true
},
"@webassemblyjs/helper-buffer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.6.tgz",
- "integrity": "sha512-z3nFzdcp1mb8nEOFFk8DrYLpHvhKC3grJD2ardfKOzmbmJvEf/tPIqCY+sNcwZIY8ZD7IkB2l7/pqhUhqm7hLA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.12.1.tgz",
+ "integrity": "sha512-nzJwQw99DNDKr9BVCOZcLuJJUlqkJh+kVzVl6Fmq/tI5ZtEyWT1KZMyOXltXLZJmDtvLCDgwsyrkohEtopTXCw==",
"dev": true
},
"@webassemblyjs/helper-numbers": {
@@ -10126,15 +10143,15 @@
"dev": true
},
"@webassemblyjs/helper-wasm-section": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.6.tgz",
- "integrity": "sha512-LPpZbSOwTpEC2cgn4hTydySy1Ke+XEu+ETXuoyvuyezHO3Kjdu90KK95Sh9xTbmjrCsUwvWwCOQQNta37VrS9g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.12.1.tgz",
+ "integrity": "sha512-Jif4vfB6FJlUlSbgEMHUyk1j234GTNG9dBJ4XJdOySoj518Xj0oGsNi59cUQF4RRMS9ouBUxDDdyBVfPTypa5g==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6"
+ "@webassemblyjs/wasm-gen": "1.12.1"
}
},
"@webassemblyjs/ieee754": {
@@ -10162,28 +10179,28 @@
"dev": true
},
"@webassemblyjs/wasm-edit": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.6.tgz",
- "integrity": "sha512-Ybn2I6fnfIGuCR+Faaz7YcvtBKxvoLV3Lebn1tM4o/IAJzmi9AWYIPWpyBfU8cC+JxAO57bk4+zdsTjJR+VTOw==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.12.1.tgz",
+ "integrity": "sha512-1DuwbVvADvS5mGnXbE+c9NfA8QRcZ6iKquqjjmR10k6o+zzsRVesil54DKexiowcFCPdr/Q0qaMgB01+SQ1u6g==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/helper-wasm-section": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-opt": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6",
- "@webassemblyjs/wast-printer": "1.11.6"
+ "@webassemblyjs/helper-wasm-section": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-opt": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1",
+ "@webassemblyjs/wast-printer": "1.12.1"
}
},
"@webassemblyjs/wasm-gen": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.6.tgz",
- "integrity": "sha512-3XOqkZP/y6B4F0PBAXvI1/bky7GryoogUtfwExeP/v7Nzwo1QLcq5oQmpKlftZLbT+ERUOAZVQjuNVak6UXjPA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.12.1.tgz",
+ "integrity": "sha512-TDq4Ojh9fcohAw6OIMXqiIcTq5KUXTGRkVxbSo1hQnSy6lAM5GSdfwWeSxpAo0YzgsgF182E/U0mDNhuA0tW7w==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
"@webassemblyjs/leb128": "1.11.6",
@@ -10191,24 +10208,24 @@
}
},
"@webassemblyjs/wasm-opt": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.6.tgz",
- "integrity": "sha512-cOrKuLRE7PCe6AsOVl7WasYf3wbSo4CeOk6PkrjS7g57MFfVUF9u6ysQBBODX0LdgSvQqRiGz3CXvIDKcPNy4g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.12.1.tgz",
+ "integrity": "sha512-Jg99j/2gG2iaz3hijw857AVYekZe2SAskcqlWIZXjji5WStnOpVoat3gQfT/Q5tb2djnCjBtMocY/Su1GfxPBg==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6"
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1"
}
},
"@webassemblyjs/wasm-parser": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.6.tgz",
- "integrity": "sha512-6ZwPeGzMJM3Dqp3hCsLgESxBGtT/OeCvCZ4TA1JUPYgmhAx38tTPR9JaKy0S5H3evQpO/h2uWs2j6Yc/fjkpTQ==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.12.1.tgz",
+ "integrity": "sha512-xikIi7c2FHXysxXe3COrVUPSheuBtpcfhbpFj4gmu7KRLYOzANztwUU0IbsqvMqzuNK2+glRGWCEqZo1WCLyAQ==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-api-error": "1.11.6",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
@@ -10217,12 +10234,12 @@
}
},
"@webassemblyjs/wast-printer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.6.tgz",
- "integrity": "sha512-JM7AhRcE+yW2GWYaKeHL5vt4xqee5N2WcezptmgyhNS+ScggqcT1OtXykhAb13Sn5Yas0j2uv9tHgrjwvzAP4A==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.12.1.tgz",
+ "integrity": "sha512-+X4WAlOisVWQMikjbcvY2e0rwPsKQ9F688lksZhBcPycBBuii3O7m8FACbDMWDojpAqvjIncrG8J0XHKyQfVeA==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@xtuc/long": "4.2.2"
}
},
@@ -10521,33 +10538,33 @@
}
},
"babel-plugin-polyfill-corejs2": {
- "version": "0.4.8",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.8.tgz",
- "integrity": "sha512-OtIuQfafSzpo/LhnJaykc0R/MMnuLSSVjVYy9mHArIZ9qTCSZ6TpWCuEKZYVoN//t8HqBNScHrOtCrIK5IaGLg==",
+ "version": "0.4.11",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.11.tgz",
+ "integrity": "sha512-sMEJ27L0gRHShOh5G54uAAPaiCOygY/5ratXuiyb2G46FmlSpc9eFCzYVyDiPxfNbwzA7mYahmjQc5q+CZQ09Q==",
"dev": true,
"requires": {
"@babel/compat-data": "^7.22.6",
- "@babel/helper-define-polyfill-provider": "^0.5.0",
+ "@babel/helper-define-polyfill-provider": "^0.6.2",
"semver": "^6.3.1"
}
},
"babel-plugin-polyfill-corejs3": {
- "version": "0.9.0",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.9.0.tgz",
- "integrity": "sha512-7nZPG1uzK2Ymhy/NbaOWTg3uibM2BmGASS4vHS4szRZAIR8R6GwA/xAujpdrXU5iyklrimWnLWU+BLF9suPTqg==",
+ "version": "0.10.4",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.10.4.tgz",
+ "integrity": "sha512-25J6I8NGfa5YkCDogHRID3fVCadIR8/pGl1/spvCkzb6lVn6SR3ojpx9nOn9iEBcUsjY24AmdKm5khcfKdylcg==",
"dev": true,
"requires": {
- "@babel/helper-define-polyfill-provider": "^0.5.0",
- "core-js-compat": "^3.34.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.1",
+ "core-js-compat": "^3.36.1"
}
},
"babel-plugin-polyfill-regenerator": {
- "version": "0.5.5",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.5.5.tgz",
- "integrity": "sha512-OJGYZlhLqBh2DDHeqAxWB1XIvr49CxiJ2gIt61/PU55CQK4Z58OzMqjDe1zwQdQk+rBYsRc+1rJmdajM3gimHg==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.2.tgz",
+ "integrity": "sha512-2R25rQZWP63nGwaAswvDazbPXfrM3HwVoBXK6HcqeKrSrL/JqcC/rDcf95l4r7LXLyxDXc8uQDa064GubtCABg==",
"dev": true,
"requires": {
- "@babel/helper-define-polyfill-provider": "^0.5.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.2"
}
},
"balanced-match": {
@@ -10840,12 +10857,12 @@
"dev": true
},
"core-js-compat": {
- "version": "3.36.0",
- "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.36.0.tgz",
- "integrity": "sha512-iV9Pd/PsgjNWBXeq8XRtWVSgz2tKAfhfvBs7qxYty+RlRd+OCksaWmOnc4JKrTc1cToXL1N0s3l/vwlxPtdElw==",
+ "version": "3.37.0",
+ "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.37.0.tgz",
+ "integrity": "sha512-vYq4L+T8aS5UuFg4UwDhc7YNRWVeVZwltad9C/jV3R2LgVOpS9BDr7l/WL6BN0dbV3k1XejPTHqqEzJgsa0frA==",
"dev": true,
"requires": {
- "browserslist": "^4.22.3"
+ "browserslist": "^4.23.0"
}
},
"core-util-is": {
@@ -11023,9 +11040,9 @@
"dev": true
},
"enhanced-resolve": {
- "version": "5.15.0",
- "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.15.0.tgz",
- "integrity": "sha512-LXYT42KJ7lpIKECr2mAXIaMldcNCh/7E0KBKOu4KSfkHmP+mZmSs+8V5gBAqisWBy0OO4W5Oyys0GO1Y8KtdKg==",
+ "version": "5.16.0",
+ "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.16.0.tgz",
+ "integrity": "sha512-O+QWCviPNSSLAD9Ucn8Awv+poAkqn3T1XY5/N7kR7rQO9yfSGWkYZDwpJ+iKF7B8rxaQKWngSqACpgzeapSyoA==",
"dev": true,
"requires": {
"graceful-fs": "^4.2.4",
@@ -14445,9 +14462,9 @@
}
},
"watchpack": {
- "version": "2.4.0",
- "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.0.tgz",
- "integrity": "sha512-Lcvm7MGST/4fup+ifyKi2hjyIAwcdI4HRgtvTpIUxBRhB+RFtUh8XtDOxUfctVCnhVi+QQj49i91OyvzkJl6cg==",
+ "version": "2.4.1",
+ "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.1.tgz",
+ "integrity": "sha512-8wrBCMtVhqcXP2Sup1ctSkga6uc2Bx0IIvKyT7yTFier5AXHooSI+QyQQAtTb7+E0IUCCKyTFmXqdqgum2XWGg==",
"dev": true,
"requires": {
"glob-to-regexp": "^0.4.1",
@@ -14455,26 +14472,26 @@
}
},
"webpack": {
- "version": "5.90.3",
- "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.90.3.tgz",
- "integrity": "sha512-h6uDYlWCctQRuXBs1oYpVe6sFcWedl0dpcVaTf/YF67J9bKvwJajFulMVSYKHrksMB3I/pIagRzDxwxkebuzKA==",
+ "version": "5.91.0",
+ "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.91.0.tgz",
+ "integrity": "sha512-rzVwlLeBWHJbmgTC/8TvAcu5vpJNII+MelQpylD4jNERPwpBJOE2lEcko1zJX3QJeLjTTAnQxn/OJ8bjDzVQaw==",
"dev": true,
"requires": {
"@types/eslint-scope": "^3.7.3",
"@types/estree": "^1.0.5",
- "@webassemblyjs/ast": "^1.11.5",
- "@webassemblyjs/wasm-edit": "^1.11.5",
- "@webassemblyjs/wasm-parser": "^1.11.5",
+ "@webassemblyjs/ast": "^1.12.1",
+ "@webassemblyjs/wasm-edit": "^1.12.1",
+ "@webassemblyjs/wasm-parser": "^1.12.1",
"acorn": "^8.7.1",
"acorn-import-assertions": "^1.9.0",
"browserslist": "^4.21.10",
"chrome-trace-event": "^1.0.2",
- "enhanced-resolve": "^5.15.0",
+ "enhanced-resolve": "^5.16.0",
"es-module-lexer": "^1.2.1",
"eslint-scope": "5.1.1",
"events": "^3.2.0",
"glob-to-regexp": "^0.4.1",
- "graceful-fs": "^4.2.9",
+ "graceful-fs": "^4.2.11",
"json-parse-even-better-errors": "^2.3.1",
"loader-runner": "^4.2.0",
"mime-types": "^2.1.27",
@@ -14482,7 +14499,7 @@
"schema-utils": "^3.2.0",
"tapable": "^2.1.1",
"terser-webpack-plugin": "^5.3.10",
- "watchpack": "^2.4.0",
+ "watchpack": "^2.4.1",
"webpack-sources": "^3.2.3"
},
"dependencies": {
diff --git a/components/dash-html-components/package.json b/components/dash-html-components/package.json
index 759968457e..8c029a52d7 100644
--- a/components/dash-html-components/package.json
+++ b/components/dash-html-components/package.json
@@ -1,6 +1,6 @@
{
"name": "dash-html-components",
- "version": "2.0.17",
+ "version": "2.0.18",
"description": "Vanilla HTML components for Dash",
"main": "lib/index.js",
"repository": {
@@ -28,15 +28,14 @@
"author": "Chris Parmer
",
"maintainer": "Alex Johnson ",
"dependencies": {
- "@braintree/sanitize-url": "^7.0.0",
"prop-types": "^15.8.1",
"ramda": "^0.29.0"
},
"devDependencies": {
- "@babel/cli": "^7.23.9",
- "@babel/core": "^7.24.0",
- "@babel/preset-env": "^7.24.0",
- "@babel/preset-react": "^7.23.3",
+ "@babel/cli": "^7.24.5",
+ "@babel/core": "^7.24.5",
+ "@babel/preset-env": "^7.24.5",
+ "@babel/preset-react": "^7.24.1",
"babel-loader": "^9.1.3",
"cheerio": "^0.22.0",
"cross-env": "^7.0.3",
@@ -44,21 +43,21 @@
"eslint": "^8.41.0",
"eslint-plugin-import": "^2.27.5",
"eslint-plugin-react": "^7.32.2",
+ "mkdirp": "^0.5.1",
"npm-run-all": "^4.1.5",
- "react-docgen": "^5.4.3",
- "request": "^2.88.2",
- "string": "^3.3.3",
- "webpack": "^5.90.3",
- "webpack-cli": "^5.1.4",
"react": "^16.14.0",
+ "react-docgen": "^5.4.3",
"react-dom": "^16.14.0",
+ "request": "^2.88.2",
"rimraf": "^5.0.5",
- "mkdirp": "^0.5.1"
+ "string": "^3.3.3",
+ "webpack": "^5.91.0",
+ "webpack-cli": "^5.1.4"
},
"files": [
"/dash_html_components/*{.js,.map}"
],
"browserslist": [
- "last 8 years and not dead"
+ "last 9 years and not dead"
]
}
diff --git a/components/dash-html-components/scripts/generate-components.js b/components/dash-html-components/scripts/generate-components.js
index 01874937bd..46ba7a2cf3 100644
--- a/components/dash-html-components/scripts/generate-components.js
+++ b/components/dash-html-components/scripts/generate-components.js
@@ -249,18 +249,12 @@ const customDocs = {
* .`
};
-const customImportsForComponents = {
- a: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
- form: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
- iframe: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
- object: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
- embed: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
- button: `import {sanitizeUrl} from '@braintree/sanitize-url';`,
-}
+const customImportsForComponents = {};
function createXSSProtection(propName) {
return `
- const ${propName} = React.useMemo(() => props.${propName} && sanitizeUrl(props.${propName}), [props.${propName}]);
+ const cleanUrl = window.dash_clientside.clean_url;
+ const ${propName} = React.useMemo(() => props.${propName} && cleanUrl(props.${propName}), [props.${propName}]);
if (${propName}) {
extraProps.${propName} = ${propName};
diff --git a/components/dash-table/package-lock.json b/components/dash-table/package-lock.json
index 77ae5ecd16..8516eb2fc0 100644
--- a/components/dash-table/package-lock.json
+++ b/components/dash-table/package-lock.json
@@ -1,21 +1,21 @@
{
"name": "dash-table",
- "version": "5.2.10",
+ "version": "5.2.11",
"lockfileVersion": 2,
"requires": true,
"packages": {
"": {
"name": "dash-table",
- "version": "5.2.10",
+ "version": "5.2.11",
"license": "MIT",
"devDependencies": {
- "@babel/cli": "^7.23.9",
- "@babel/core": "^7.24.0",
+ "@babel/cli": "^7.24.1",
+ "@babel/core": "^7.24.1",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
"@babel/polyfill": "^7.12.1",
- "@babel/preset-env": "^7.24.0",
- "@babel/preset-react": "^7.23.3",
+ "@babel/preset-env": "^7.24.5",
+ "@babel/preset-react": "^7.24.1",
"@fortawesome/fontawesome-svg-core": "1.2.36",
"@fortawesome/free-regular-svg-icons": "^5.15.4",
"@fortawesome/free-solid-svg-icons": "^5.15.4",
@@ -73,7 +73,7 @@
"style-loader": "^3.3.3",
"ts-loader": "^9.4.3",
"typescript": "^5.3.3",
- "webpack": "^5.90.3",
+ "webpack": "^5.91.0",
"webpack-cli": "^5.1.4",
"webpack-dev-server": "^4.15.1",
"webpack-preprocessor": "^0.1.12",
@@ -112,12 +112,12 @@
}
},
"node_modules/@babel/cli": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.23.9.tgz",
- "integrity": "sha512-vB1UXmGDNEhcf1jNAHKT9IlYk1R+hehVTLFlCLHBi8gfuHQGP6uRjgXVYU0EVlI/qwAWpstqkBdf2aez3/z/5Q==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.24.5.tgz",
+ "integrity": "sha512-2qg1mYtJRsOOWF6IUwLP5jI42P8Cc0hQ5TmnjLrik/4DKouO8dFJN80HEz81VmVeUs97yuuf3vQ/9j7Elrcjlg==",
"dev": true,
"dependencies": {
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@jridgewell/trace-mapping": "^0.3.25",
"commander": "^4.0.1",
"convert-source-map": "^2.0.0",
"fs-readdir-recursive": "^1.1.0",
@@ -141,43 +141,49 @@
}
},
"node_modules/@babel/code-frame": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz",
- "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==",
+ "version": "7.24.2",
+ "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.24.2.tgz",
+ "integrity": "sha512-y5+tLQyV8pg3fsiln67BVLD1P13Eg4lh5RW9mF0zUuvLrv9uIQ4MCL+CRT+FTsBlBjcIan6PGsLcBN0m3ClUyQ==",
"dev": true,
"dependencies": {
- "@babel/highlight": "^7.23.4",
- "chalk": "^2.4.2"
+ "@babel/highlight": "^7.24.2",
+ "picocolors": "^1.0.0"
},
"engines": {
"node": ">=6.9.0"
}
},
+ "node_modules/@babel/code-frame/node_modules/picocolors": {
+ "version": "1.0.0",
+ "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz",
+ "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==",
+ "dev": true
+ },
"node_modules/@babel/compat-data": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.23.5.tgz",
- "integrity": "sha512-uU27kfDRlhfKl+w1U6vp16IuvSLtjAxdArVXPa9BvLkrr7CYIsxH5adpHObeAGY/41+syctUWOZ140a2Rvkgjw==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.24.4.tgz",
+ "integrity": "sha512-vg8Gih2MLK+kOkHJp4gBEIkyaIi00jgWot2D9QOmmfLC8jINSOzmCLta6Bvz/JSBCqnegV0L80jhxkol5GWNfQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/core": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.0.tgz",
- "integrity": "sha512-fQfkg0Gjkza3nf0c7/w6Xf34BW4YvzNfACRLmmb7XRLa6XHdR+K9AlJlxneFfWYf6uhOzuzZVTjF/8KfndZANw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.5.tgz",
+ "integrity": "sha512-tVQRucExLQ02Boi4vdPp49svNGcfL2GhdTCT9aldhXgCJVAI21EtRfBettiuLUwce/7r6bFdgs6JFkcdTiFttA==",
"dev": true,
"dependencies": {
"@ampproject/remapping": "^2.2.0",
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-module-transforms": "^7.23.3",
- "@babel/helpers": "^7.24.0",
- "@babel/parser": "^7.24.0",
+ "@babel/helper-module-transforms": "^7.24.5",
+ "@babel/helpers": "^7.24.5",
+ "@babel/parser": "^7.24.5",
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5",
"convert-source-map": "^2.0.0",
"debug": "^4.1.0",
"gensync": "^1.0.0-beta.2",
@@ -193,14 +199,14 @@
}
},
"node_modules/@babel/generator": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.23.6.tgz",
- "integrity": "sha512-qrSfCYxYQB5owCmGLbl8XRpX1ytXlpueOb0N0UmQwA073KZxejgQTzAmJezxvpwQD9uGtK2shHdi55QT+MbjIw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.24.5.tgz",
+ "integrity": "sha512-x32i4hEXvr+iI0NEoEfDKzlemF8AmtOP8CcrRaEcpzysWuoEb1KknpcvMsHKPONoKZiDuItklgWhB18xEhr9PA==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.23.6",
- "@jridgewell/gen-mapping": "^0.3.2",
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@babel/types": "^7.24.5",
+ "@jridgewell/gen-mapping": "^0.3.5",
+ "@jridgewell/trace-mapping": "^0.3.25",
"jsesc": "^2.5.1"
},
"engines": {
@@ -248,19 +254,19 @@
}
},
"node_modules/@babel/helper-create-class-features-plugin": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.23.7.tgz",
- "integrity": "sha512-xCoqR/8+BoNnXOY7RVSgv6X+o7pmT5q1d+gGcRlXYkI+9B31glE4jeejhKVpA04O1AtzOt7OSQ6VYKP5FcRl9g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.24.5.tgz",
+ "integrity": "sha512-uRc4Cv8UQWnE4NXlYTIIdM7wfFkOqlFztcC/gVXDKohKoVB3OyonfelUBaJzSwpBntZ2KYGF/9S7asCHsXwW6g==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-member-expression-to-functions": "^7.23.0",
+ "@babel/helper-member-expression-to-functions": "^7.24.5",
"@babel/helper-optimise-call-expression": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
+ "@babel/helper-replace-supers": "^7.24.1",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"semver": "^6.3.1"
},
"engines": {
@@ -288,9 +294,9 @@
}
},
"node_modules/@babel/helper-define-polyfill-provider": {
- "version": "0.5.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.5.0.tgz",
- "integrity": "sha512-NovQquuQLAQ5HuyjCz7WQP9MjRj7dx++yspwiyUiGl9ZyadHRSql1HZh5ogRd8W8w6YM6EQ/NTB8rgjLt5W65Q==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.2.tgz",
+ "integrity": "sha512-LV76g+C502biUK6AyZ3LK10vDpDyCzZnhZFXkH1L75zHPj68+qc8Zfpx2th+gzwA2MzyK+1g/3EPl62yFnVttQ==",
"dev": true,
"dependencies": {
"@babel/helper-compilation-targets": "^7.22.6",
@@ -338,40 +344,40 @@
}
},
"node_modules/@babel/helper-member-expression-to-functions": {
- "version": "7.23.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.23.0.tgz",
- "integrity": "sha512-6gfrPwh7OuT6gZyJZvd6WbTfrqAo7vm4xCzAXOusKqq/vWdKXphTpj5klHKNmRUU6/QRGlBsyU9mAIPaWHlqJA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.24.5.tgz",
+ "integrity": "sha512-4owRteeihKWKamtqg4JmWSsEZU445xpFRXPEwp44HbgbxdWlUV1b4Agg4lkA806Lil5XM/e+FJyS0vj5T6vmcA==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.23.0"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-module-imports": {
- "version": "7.22.15",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.22.15.tgz",
- "integrity": "sha512-0pYVBnDKZO2fnSPCrgM/6WMc7eS20Fbok+0r88fp+YtWVLZrp4CkafFGIp+W0VKw4a22sgebPT99y+FDNMdP4w==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.24.3.tgz",
+ "integrity": "sha512-viKb0F9f2s0BCS22QSF308z/+1YWKV/76mwt61NBzS5izMzDPwdq1pTrzf+Li3npBWX9KdQbkeCt1jSAM7lZqg==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.15"
+ "@babel/types": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-module-transforms": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.23.3.tgz",
- "integrity": "sha512-7bBs4ED9OmswdfDzpz4MpWgSrV7FXlc3zIagvLFjS5H+Mk7Snr21vQ6QwrsoCGMfNC4e4LQPdoULEt4ykz0SRQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.24.5.tgz",
+ "integrity": "sha512-9GxeY8c2d2mdQUP1Dye0ks3VDyIMS98kt/llQ2nUId8IsWqTF0l1LkSX0/uP7l7MCDrzXS009Hyhe2gzTiGW8A==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-simple-access": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/helper-validator-identifier": "^7.22.20"
+ "@babel/helper-module-imports": "^7.24.3",
+ "@babel/helper-simple-access": "^7.24.5",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/helper-validator-identifier": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -393,9 +399,9 @@
}
},
"node_modules/@babel/helper-plugin-utils": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.0.tgz",
- "integrity": "sha512-9cUznXMG0+FxRuJfvL82QlTqIzhVW9sL0KjMPHhAOOvpQGL8QtdxnBKILjBqxlHyliz0yCa1G903ZXI/FuHy2w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.5.tgz",
+ "integrity": "sha512-xjNLDopRzW2o6ba0gKbkZq5YWEBaK3PCyTOY1K2P/O07LGMhMqlMXPxwN4S5/RhWuCobT8z0jrlKGlYmeR1OhQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
@@ -419,13 +425,13 @@
}
},
"node_modules/@babel/helper-replace-supers": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.22.20.tgz",
- "integrity": "sha512-qsW0In3dbwQUbK8kejJ4R7IHVGwHJlV6lpG6UA7a9hSa2YEiAib+N1T2kr6PEeUT+Fl7najmSOS6SmAwCHK6Tw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.24.1.tgz",
+ "integrity": "sha512-QCR1UqC9BzG5vZl8BMicmZ28RuUBnHhAMddD8yHFHDRH9lLTZ9uUPehX8ctVPT8l0TKblJidqcgUUKGVrePleQ==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-member-expression-to-functions": "^7.22.15",
+ "@babel/helper-member-expression-to-functions": "^7.23.0",
"@babel/helper-optimise-call-expression": "^7.22.5"
},
"engines": {
@@ -436,12 +442,12 @@
}
},
"node_modules/@babel/helper-simple-access": {
- "version": "7.22.5",
- "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.22.5.tgz",
- "integrity": "sha512-n0H99E/K+Bika3++WNL17POvo4rKWZ7lZEp1Q+fStVbUi8nxPQEBOlTmCOxW/0JsS56SKKQ+ojAe2pHKJHN35w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.24.5.tgz",
+ "integrity": "sha512-uH3Hmf5q5n7n8mz7arjUlDOCbttY/DW4DYhE6FUsjKJ/oYC1kQQUvwEQWxRwUpX9qQKRXeqLwWxrqilMrf32sQ==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -460,30 +466,30 @@
}
},
"node_modules/@babel/helper-split-export-declaration": {
- "version": "7.22.6",
- "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.22.6.tgz",
- "integrity": "sha512-AsUnxuLhRYsisFiaJwvp1QF+I3KjD5FOxut14q/GzovUe6orHLesW2C7d754kRm53h5gqrz6sFl6sxc4BVtE/g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.24.5.tgz",
+ "integrity": "sha512-5CHncttXohrHk8GWOFCcCl4oRD9fKosWlIRgWm4ql9VYioKm52Mk2xsmoohvm7f3JoiLSM5ZgJuRaf5QZZYd3Q==",
"dev": true,
"dependencies": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-string-parser": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz",
- "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.24.1.tgz",
+ "integrity": "sha512-2ofRCjnnA9y+wk8b9IAREroeUP02KHp431N2mhKniy2yKIDKpbrHv9eXwm8cBeWQYcJmzv5qKCu65P47eCF7CQ==",
"dev": true,
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helper-validator-identifier": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz",
- "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.24.5.tgz",
+ "integrity": "sha512-3q93SSKX2TWCG30M2G2kwaKeTYgEUp5Snjuj8qm729SObL6nbtUldAi37qbxkD5gg3xnBio+f9nqpSepGZMvxA==",
"dev": true,
"engines": {
"node": ">=6.9.0"
@@ -499,51 +505,58 @@
}
},
"node_modules/@babel/helper-wrap-function": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.22.20.tgz",
- "integrity": "sha512-pms/UwkOpnQe/PDAEdV/d7dVCoBbB+R4FvYoHGZz+4VPcg7RtYy2KP7S2lbuWM6FCSgob5wshfGESbC/hzNXZw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.24.5.tgz",
+ "integrity": "sha512-/xxzuNvgRl4/HLNKvnFwdhdgN3cpLxgLROeLDl83Yx0AJ1SGvq1ak0OszTOjDfiB8Vx03eJbeDWh9r+jCCWttw==",
"dev": true,
"dependencies": {
- "@babel/helper-function-name": "^7.22.5",
- "@babel/template": "^7.22.15",
- "@babel/types": "^7.22.19"
+ "@babel/helper-function-name": "^7.23.0",
+ "@babel/template": "^7.24.0",
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/helpers": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.0.tgz",
- "integrity": "sha512-ulDZdc0Aj5uLc5nETsa7EPx2L7rM0YJM8r7ck7U73AXi7qOV44IHHRAYZHY6iU1rr3C5N4NtTmMRUJP6kwCWeA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.5.tgz",
+ "integrity": "sha512-CiQmBMMpMQHwM5m01YnrM6imUG1ebgYJ+fAIW4FZe6m4qHTPaRHti+R8cggAwkdz4oXhtO4/K9JWlh+8hIfR2Q==",
"dev": true,
"dependencies": {
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0"
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
}
},
"node_modules/@babel/highlight": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz",
- "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.24.5.tgz",
+ "integrity": "sha512-8lLmua6AVh/8SLJRRVD6V8p73Hir9w5mJrhE+IPpILG31KKlI9iz5zmBYKcWPS59qSfgP9RaSBQSHHE81WKuEw==",
"dev": true,
"dependencies": {
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-validator-identifier": "^7.24.5",
"chalk": "^2.4.2",
- "js-tokens": "^4.0.0"
+ "js-tokens": "^4.0.0",
+ "picocolors": "^1.0.0"
},
"engines": {
"node": ">=6.9.0"
}
},
+ "node_modules/@babel/highlight/node_modules/picocolors": {
+ "version": "1.0.0",
+ "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz",
+ "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==",
+ "dev": true
+ },
"node_modules/@babel/parser": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.0.tgz",
- "integrity": "sha512-QuP/FxEAzMSjXygs8v4N9dvdXzEHN4W1oF3PxuWAtPo08UdM17u89RDMgjLn/mlc56iM0HlLmVkO/wgR+rDgHg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.5.tgz",
+ "integrity": "sha512-EOv5IK8arwh3LI47dz1b0tKUb/1uhHAnHJOrjgtQMIpu1uXd9mlFrJg9IUgGUgZ41Ch0K8REPTYpO7B76b4vJg==",
"dev": true,
"bin": {
"parser": "bin/babel-parser.js"
@@ -552,13 +565,29 @@
"node": ">=6.0.0"
}
},
+ "node_modules/@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.24.5.tgz",
+ "integrity": "sha512-LdXRi1wEMTrHVR4Zc9F8OewC3vdm5h4QB6L71zy6StmYeqGi1b3ttIO8UC+BfZKcH9jdr4aI249rBkm+3+YvHw==",
+ "dev": true,
+ "dependencies": {
+ "@babel/helper-environment-visitor": "^7.22.20",
+ "@babel/helper-plugin-utils": "^7.24.5"
+ },
+ "engines": {
+ "node": ">=6.9.0"
+ },
+ "peerDependencies": {
+ "@babel/core": "^7.0.0"
+ }
+ },
"node_modules/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.23.3.tgz",
- "integrity": "sha512-iRkKcCqb7iGnq9+3G6rZ+Ciz5VywC4XNRHe57lKM+jOeYAoR0lVqdeeDRfh0tQcTfw/+vBhHn926FmQhLtlFLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.24.1.tgz",
+ "integrity": "sha512-y4HqEnkelJIOQGd+3g1bTeKsA5c6qM7eOn7VggGVbBc0y8MLSKHacwcIE2PplNlQSj0PqS9rrXL/nkPVK+kUNg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -568,14 +597,14 @@
}
},
"node_modules/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.23.3.tgz",
- "integrity": "sha512-WwlxbfMNdVEpQjZmK5mhm7oSwD3dS6eU+Iwsi4Knl9wAletWem7kaRsGOG+8UEbRyqxY4SS5zvtfXwX+jMxUwQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.24.1.tgz",
+ "integrity": "sha512-Hj791Ii4ci8HqnaKHAlLNs+zaLXb0EzSDhiAWp5VNlyvCNymYfacs64pxTxbH1znW/NcArSmwpmG9IKE/TUVVQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/plugin-transform-optional-chaining": "^7.23.3"
+ "@babel/plugin-transform-optional-chaining": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -585,13 +614,13 @@
}
},
"node_modules/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.23.7.tgz",
- "integrity": "sha512-LlRT7HgaifEpQA1ZgLVOIJZZFVPWN5iReq/7/JixwBtwcoeVGDBD53ZV28rrsLYOZs1Y/EHhA8N/Z6aazHR8cw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.24.1.tgz",
+ "integrity": "sha512-m9m/fXsXLiHfwdgydIFnpk+7jlVbnvlK5B2EKiPdLUb6WX654ZaaEWJUjk8TftRbZpK0XibovlLWX4KIZhV6jw==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -843,12 +872,12 @@
}
},
"node_modules/@babel/plugin-syntax-import-assertions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.23.3.tgz",
- "integrity": "sha512-lPgDSU+SJLK3xmFDTV2ZRQAiM7UuUjGidwBywFavObCiZc1BeAAcMtHJKUya92hPHO+at63JJPLygilZard8jw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.24.1.tgz",
+ "integrity": "sha512-IuwnI5XnuF189t91XbxmXeCDz3qs6iDRO7GJ++wcfgeXNs/8FmIlKcpDSXNVyuLQxlwvskmI3Ct73wUODkJBlQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -858,12 +887,12 @@
}
},
"node_modules/@babel/plugin-syntax-import-attributes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.23.3.tgz",
- "integrity": "sha512-pawnE0P9g10xgoP7yKr6CK63K2FMsTE+FZidZO/1PwRdzmAPVs+HS1mAURUsgaoxammTJvULUdIkEK0gOcU2tA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.24.1.tgz",
+ "integrity": "sha512-zhQTMH0X2nVLnb04tz+s7AMuasX8U0FnpE+nHTOhSOINjWMnopoZTxtIKsd45n4GQ/HIZLyfIpoul8e2m0DnRA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1045,12 +1074,12 @@
}
},
"node_modules/@babel/plugin-transform-arrow-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.23.3.tgz",
- "integrity": "sha512-NzQcQrzaQPkaEwoTm4Mhyl8jI1huEL/WWIEvudjTCMJ9aBZNpsJbMASx7EQECtQQPS/DcnFpo0FIh3LvEO9cxQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.24.1.tgz",
+ "integrity": "sha512-ngT/3NkRhsaep9ck9uj2Xhv9+xB1zShY3tM3g6om4xxCELwCDN4g4Aq5dRn48+0hasAql7s2hdBOysCfNpr4fw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1060,13 +1089,13 @@
}
},
"node_modules/@babel/plugin-transform-async-generator-functions": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.23.9.tgz",
- "integrity": "sha512-8Q3veQEDGe14dTYuwagbRtwxQDnytyg1JFu4/HwEMETeofocrB0U0ejBJIXoeG/t2oXZ8kzCyI0ZZfbT80VFNQ==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.24.3.tgz",
+ "integrity": "sha512-Qe26CMYVjpQxJ8zxM1340JFNjZaF+ISWpr1Kt/jGo+ZTUzKkfw/pphEWbRCb+lmSM6k/TOgfYLvmbHkUQ0asIg==",
"dev": true,
"dependencies": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20",
"@babel/plugin-syntax-async-generators": "^7.8.4"
},
@@ -1078,13 +1107,13 @@
}
},
"node_modules/@babel/plugin-transform-async-to-generator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.23.3.tgz",
- "integrity": "sha512-A7LFsKi4U4fomjqXJlZg/u0ft/n8/7n7lpffUP/ZULx/DtV9SGlNKZolHH6PE8Xl1ngCc0M11OaeZptXVkfKSw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.24.1.tgz",
+ "integrity": "sha512-AawPptitRXp1y0n4ilKcGbRYWfbbzFWz2NqNu7dacYDtFtz0CMjG64b3LQsb3KIgnf4/obcUL78hfaOS7iCUfw==",
"dev": true,
"dependencies": {
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-module-imports": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20"
},
"engines": {
@@ -1095,12 +1124,12 @@
}
},
"node_modules/@babel/plugin-transform-block-scoped-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.23.3.tgz",
- "integrity": "sha512-vI+0sIaPIO6CNuM9Kk5VmXcMVRiOpDh7w2zZt9GXzmE/9KD70CUEVhvPR/etAeNK/FAEkhxQtXOzVF3EuRL41A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.24.1.tgz",
+ "integrity": "sha512-TWWC18OShZutrv9C6mye1xwtam+uNi2bnTOCBUd5sZxyHOiWbU6ztSROofIMrK84uweEZC219POICK/sTYwfgg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1110,12 +1139,12 @@
}
},
"node_modules/@babel/plugin-transform-block-scoping": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.23.4.tgz",
- "integrity": "sha512-0QqbP6B6HOh7/8iNR4CQU2Th/bbRtBp4KS9vcaZd1fZ0wSh5Fyssg0UCIHwxh+ka+pNDREbVLQnHCMHKZfPwfw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.24.5.tgz",
+ "integrity": "sha512-sMfBc3OxghjC95BkYrYocHL3NaOplrcaunblzwXhGmlPwpmfsxr4vK+mBBt49r+S240vahmv+kUxkeKgs+haCw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1125,13 +1154,13 @@
}
},
"node_modules/@babel/plugin-transform-class-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.23.3.tgz",
- "integrity": "sha512-uM+AN8yCIjDPccsKGlw271xjJtGii+xQIF/uMPS8H15L12jZTsLfF4o5vNO7d/oUguOyfdikHGc/yi9ge4SGIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.24.1.tgz",
+ "integrity": "sha512-OMLCXi0NqvJfORTaPQBwqLXHhb93wkBKZ4aNwMl6WtehO7ar+cmp+89iPEQPqxAnxsOKTaMcs3POz3rKayJ72g==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1141,13 +1170,13 @@
}
},
"node_modules/@babel/plugin-transform-class-static-block": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.23.4.tgz",
- "integrity": "sha512-nsWu/1M+ggti1SOALj3hfx5FXzAY06fwPJsUZD4/A5e1bWi46VUIWtD+kOX6/IdhXGsXBWllLFDSnqSCdUNydQ==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.24.4.tgz",
+ "integrity": "sha512-B8q7Pz870Hz/q9UgP8InNpY01CSLDSCyqX7zcRuv3FcPl87A2G17lASroHWaCtbdIcbYzOZ7kWmXFKbijMSmFg==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.4",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-class-static-block": "^7.14.5"
},
"engines": {
@@ -1158,18 +1187,18 @@
}
},
"node_modules/@babel/plugin-transform-classes": {
- "version": "7.23.8",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.23.8.tgz",
- "integrity": "sha512-yAYslGsY1bX6Knmg46RjiCiNSwJKv2IUC8qOdYKqMMr0491SXFhcHqOdRDeCRohOOIzwN/90C6mQ9qAKgrP7dg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.24.5.tgz",
+ "integrity": "sha512-gWkLP25DFj2dwe9Ck8uwMOpko4YsqyfZJrOmqqcegeDYEbp7rmn4U6UQZNj08UF6MaX39XenSpKRCvpDRBtZ7Q==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-plugin-utils": "^7.24.5",
+ "@babel/helper-replace-supers": "^7.24.1",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"globals": "^11.1.0"
},
"engines": {
@@ -1180,13 +1209,13 @@
}
},
"node_modules/@babel/plugin-transform-computed-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.23.3.tgz",
- "integrity": "sha512-dTj83UVTLw/+nbiHqQSFdwO9CbTtwq1DsDqm3CUEtDrZNET5rT5E6bIdTlOftDTDLMYxvxHNEYO4B9SLl8SLZw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.24.1.tgz",
+ "integrity": "sha512-5pJGVIUfJpOS+pAqBQd+QMaTD2vCL/HcePooON6pDpHgRp4gNRmzyHTPIkXntwKsq3ayUFVfJaIKPw2pOkOcTw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/template": "^7.22.15"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/template": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1196,12 +1225,12 @@
}
},
"node_modules/@babel/plugin-transform-destructuring": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.23.3.tgz",
- "integrity": "sha512-n225npDqjDIr967cMScVKHXJs7rout1q+tt50inyBCPkyZ8KxeI6d+GIbSBTT/w/9WdlWDOej3V9HE5Lgk57gw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.24.5.tgz",
+ "integrity": "sha512-SZuuLyfxvsm+Ah57I/i1HVjveBENYK9ue8MJ7qkc7ndoNjqquJiElzA7f5yaAXjyW2hKojosOTAQQRX50bPSVg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1211,13 +1240,13 @@
}
},
"node_modules/@babel/plugin-transform-dotall-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.23.3.tgz",
- "integrity": "sha512-vgnFYDHAKzFaTVp+mneDsIEbnJ2Np/9ng9iviHw3P/KVcgONxpNULEW/51Z/BaFojG2GI2GwwXck5uV1+1NOYQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.24.1.tgz",
+ "integrity": "sha512-p7uUxgSoZwZ2lPNMzUkqCts3xlp8n+o05ikjy7gbtFJSt9gdU88jAmtfmOxHM14noQXBxfgzf2yRWECiNVhTCw==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1227,12 +1256,12 @@
}
},
"node_modules/@babel/plugin-transform-duplicate-keys": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.23.3.tgz",
- "integrity": "sha512-RrqQ+BQmU3Oyav3J+7/myfvRCq7Tbz+kKLLshUmMwNlDHExbGL7ARhajvoBJEvc+fCguPPu887N+3RRXBVKZUA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.24.1.tgz",
+ "integrity": "sha512-msyzuUnvsjsaSaocV6L7ErfNsa5nDWL1XKNnDePLgmz+WdU4w/J8+AxBMrWfi9m4IxfL5sZQKUPQKDQeeAT6lA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1242,12 +1271,12 @@
}
},
"node_modules/@babel/plugin-transform-dynamic-import": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.23.4.tgz",
- "integrity": "sha512-V6jIbLhdJK86MaLh4Jpghi8ho5fGzt3imHOBu/x0jlBaPYqDoWz4RDXjmMOfnh+JWNaQleEAByZLV0QzBT4YQQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.24.1.tgz",
+ "integrity": "sha512-av2gdSTyXcJVdI+8aFZsCAtR29xJt0S5tas+Ef8NvBNmD1a+N/3ecMLeMBgfcK+xzsjdLDT6oHt+DFPyeqUbDA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-dynamic-import": "^7.8.3"
},
"engines": {
@@ -1258,13 +1287,13 @@
}
},
"node_modules/@babel/plugin-transform-exponentiation-operator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.23.3.tgz",
- "integrity": "sha512-5fhCsl1odX96u7ILKHBj4/Y8vipoqwsJMh4csSA8qFfxrZDEA4Ssku2DyNvMJSmZNOEBT750LfFPbtrnTP90BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.24.1.tgz",
+ "integrity": "sha512-U1yX13dVBSwS23DEAqU+Z/PkwE9/m7QQy8Y9/+Tdb8UWYaGNDYwTLi19wqIAiROr8sXVum9A/rtiH5H0boUcTw==",
"dev": true,
"dependencies": {
"@babel/helper-builder-binary-assignment-operator-visitor": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1274,12 +1303,12 @@
}
},
"node_modules/@babel/plugin-transform-export-namespace-from": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.23.4.tgz",
- "integrity": "sha512-GzuSBcKkx62dGzZI1WVgTWvkkz84FZO5TC5T8dl/Tht/rAla6Dg/Mz9Yhypg+ezVACf/rgDuQt3kbWEv7LdUDQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.24.1.tgz",
+ "integrity": "sha512-Ft38m/KFOyzKw2UaJFkWG9QnHPG/Q/2SkOrRk4pNBPg5IPZ+dOxcmkK5IyuBcxiNPyyYowPGUReyBvrvZs7IlQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3"
},
"engines": {
@@ -1306,12 +1335,12 @@
}
},
"node_modules/@babel/plugin-transform-for-of": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.23.6.tgz",
- "integrity": "sha512-aYH4ytZ0qSuBbpfhuofbg/e96oQ7U2w1Aw/UQmKT+1l39uEhUPoFS3fHevDc1G0OvewyDudfMKY1OulczHzWIw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.24.1.tgz",
+ "integrity": "sha512-OxBdcnF04bpdQdR3i4giHZNZQn7cm8RQKcSwA17wAAqEELo1ZOwp5FFgeptWUQXFyT9kwHo10aqqauYkRZPCAg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
},
"engines": {
@@ -1322,14 +1351,14 @@
}
},
"node_modules/@babel/plugin-transform-function-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.23.3.tgz",
- "integrity": "sha512-I1QXp1LxIvt8yLaib49dRW5Okt7Q4oaxao6tFVKS/anCdEOMtYwWVKoiOA1p34GOWIZjUK0E+zCp7+l1pfQyiw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.24.1.tgz",
+ "integrity": "sha512-BXmDZpPlh7jwicKArQASrj8n22/w6iymRnvHYYd2zO30DbE277JO20/7yXJT3QxDPtiQiOxQBbZH4TpivNXIxA==",
"dev": true,
"dependencies": {
- "@babel/helper-compilation-targets": "^7.22.15",
+ "@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1339,12 +1368,12 @@
}
},
"node_modules/@babel/plugin-transform-json-strings": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.23.4.tgz",
- "integrity": "sha512-81nTOqM1dMwZ/aRXQ59zVubN9wHGqk6UtqRK+/q+ciXmRy8fSolhGVvG09HHRGo4l6fr/c4ZhXUQH0uFW7PZbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.24.1.tgz",
+ "integrity": "sha512-U7RMFmRvoasscrIFy5xA4gIp8iWnWubnKkKuUGJjsuOH7GfbMkB+XZzeslx2kLdEGdOJDamEmCqOks6e8nv8DQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-json-strings": "^7.8.3"
},
"engines": {
@@ -1355,12 +1384,12 @@
}
},
"node_modules/@babel/plugin-transform-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.23.3.tgz",
- "integrity": "sha512-wZ0PIXRxnwZvl9AYpqNUxpZ5BiTGrYt7kueGQ+N5FiQ7RCOD4cm8iShd6S6ggfVIWaJf2EMk8eRzAh52RfP4rQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.24.1.tgz",
+ "integrity": "sha512-zn9pwz8U7nCqOYIiBaOxoQOtYmMODXTJnkxG4AtX8fPmnCRYWBOHD0qcpwS9e2VDSp1zNJYpdnFMIKb8jmwu6g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1370,12 +1399,12 @@
}
},
"node_modules/@babel/plugin-transform-logical-assignment-operators": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.23.4.tgz",
- "integrity": "sha512-Mc/ALf1rmZTP4JKKEhUwiORU+vcfarFVLfcFiolKUo6sewoxSEgl36ak5t+4WamRsNr6nzjZXQjM35WsU+9vbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.24.1.tgz",
+ "integrity": "sha512-OhN6J4Bpz+hIBqItTeWJujDOfNP+unqv/NJgyhlpSqgBTPm37KkMmZV6SYcOj+pnDbdcl1qRGV/ZiIjX9Iy34w==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
},
"engines": {
@@ -1386,12 +1415,12 @@
}
},
"node_modules/@babel/plugin-transform-member-expression-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.23.3.tgz",
- "integrity": "sha512-sC3LdDBDi5x96LA+Ytekz2ZPk8i/Ck+DEuDbRAll5rknJ5XRTSaPKEYwomLcs1AA8wg9b3KjIQRsnApj+q51Ag==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.24.1.tgz",
+ "integrity": "sha512-4ojai0KysTWXzHseJKa1XPNXKRbuUrhkOPY4rEGeR+7ChlJVKxFa3H3Bz+7tWaGKgJAXUWKOGmltN+u9B3+CVg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1401,13 +1430,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-amd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.23.3.tgz",
- "integrity": "sha512-vJYQGxeKM4t8hYCKVBlZX/gtIY2I7mRGFNcm85sgXGMTBcoV3QdVtdpbcWEbzbfUIUZKwvgFT82mRvaQIebZzw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.24.1.tgz",
+ "integrity": "sha512-lAxNHi4HVtjnHd5Rxg3D5t99Xm6H7b04hUS7EHIXcUl2EV4yl1gWdqZrNzXnSrHveL9qMdbODlLF55mvgjAfaQ==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1417,13 +1446,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-commonjs": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.23.3.tgz",
- "integrity": "sha512-aVS0F65LKsdNOtcz6FRCpE4OgsP2OFnW46qNxNIX9h3wuzaNcSQsJysuMwqSibC98HPrf2vCgtxKNwS0DAlgcA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.24.1.tgz",
+ "integrity": "sha512-szog8fFTUxBfw0b98gEWPaEqF42ZUD/T3bkynW/wtgx2p/XCP55WEsb+VosKceRSd6njipdZvNogqdtI4Q0chw==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-simple-access": "^7.22.5"
},
"engines": {
@@ -1434,14 +1463,14 @@
}
},
"node_modules/@babel/plugin-transform-modules-systemjs": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.23.9.tgz",
- "integrity": "sha512-KDlPRM6sLo4o1FkiSlXoAa8edLXFsKKIda779fbLrvmeuc3itnjCtaO6RrtoaANsIJANj+Vk1zqbZIMhkCAHVw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.24.1.tgz",
+ "integrity": "sha512-mqQ3Zh9vFO1Tpmlt8QPnbwGHzNz3lpNEMxQb1kAemn/erstyqw1r9KeOlOfo3y6xAnFEcOv2tSyrXfmMk+/YZA==",
"dev": true,
"dependencies": {
"@babel/helper-hoist-variables": "^7.22.5",
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-validator-identifier": "^7.22.20"
},
"engines": {
@@ -1452,13 +1481,13 @@
}
},
"node_modules/@babel/plugin-transform-modules-umd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.23.3.tgz",
- "integrity": "sha512-zHsy9iXX2nIsCBFPud3jKn1IRPWg3Ing1qOZgeKV39m1ZgIdpJqvlWVeiHBZC6ITRG0MfskhYe9cLgntfSFPIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.24.1.tgz",
+ "integrity": "sha512-tuA3lpPj+5ITfcCluy6nWonSL7RvaG0AOTeAuvXqEKS34lnLzXpDb0dcP6K8jD0zWZFNDVly90AGFJPnm4fOYg==",
"dev": true,
"dependencies": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1484,12 +1513,12 @@
}
},
"node_modules/@babel/plugin-transform-new-target": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.23.3.tgz",
- "integrity": "sha512-YJ3xKqtJMAT5/TIZnpAR3I+K+WaDowYbN3xyxI8zxx/Gsypwf9B9h0VB+1Nh6ACAAPRS5NSRje0uVv5i79HYGQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.24.1.tgz",
+ "integrity": "sha512-/rurytBM34hYy0HKZQyA0nHbQgQNFm4Q/BOc9Hflxi2X3twRof7NaE5W46j4kQitm7SvACVRXsa6N/tSZxvPug==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1499,12 +1528,12 @@
}
},
"node_modules/@babel/plugin-transform-nullish-coalescing-operator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.23.4.tgz",
- "integrity": "sha512-jHE9EVVqHKAQx+VePv5LLGHjmHSJR76vawFPTdlxR/LVJPfOEGxREQwQfjuZEOPTwG92X3LINSh3M40Rv4zpVA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.24.1.tgz",
+ "integrity": "sha512-iQ+caew8wRrhCikO5DrUYx0mrmdhkaELgFa+7baMcVuhxIkN7oxt06CZ51D65ugIb1UWRQ8oQe+HXAVM6qHFjw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
},
"engines": {
@@ -1515,12 +1544,12 @@
}
},
"node_modules/@babel/plugin-transform-numeric-separator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.23.4.tgz",
- "integrity": "sha512-mps6auzgwjRrwKEZA05cOwuDc9FAzoyFS4ZsG/8F43bTLf/TgkJg7QXOrPO1JO599iA3qgK9MXdMGOEC8O1h6Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.24.1.tgz",
+ "integrity": "sha512-7GAsGlK4cNL2OExJH1DzmDeKnRv/LXq0eLUSvudrehVA5Rgg4bIrqEUW29FbKMBRT0ztSqisv7kjP+XIC4ZMNw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-numeric-separator": "^7.10.4"
},
"engines": {
@@ -1531,16 +1560,15 @@
}
},
"node_modules/@babel/plugin-transform-object-rest-spread": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.0.tgz",
- "integrity": "sha512-y/yKMm7buHpFFXfxVFS4Vk1ToRJDilIa6fKRioB9Vjichv58TDGXTvqV0dN7plobAmTW5eSEGXDngE+Mm+uO+w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.5.tgz",
+ "integrity": "sha512-7EauQHszLGM3ay7a161tTQH7fj+3vVM/gThlz5HpFtnygTxjrlvoeq7MPVA1Vy9Q555OB8SnAOsMkLShNkkrHA==",
"dev": true,
"dependencies": {
- "@babel/compat-data": "^7.23.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-object-rest-spread": "^7.8.3",
- "@babel/plugin-transform-parameters": "^7.23.3"
+ "@babel/plugin-transform-parameters": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1550,13 +1578,13 @@
}
},
"node_modules/@babel/plugin-transform-object-super": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.23.3.tgz",
- "integrity": "sha512-BwQ8q0x2JG+3lxCVFohg+KbQM7plfpBwThdW9A6TMtWwLsbDA01Ek2Zb/AgDN39BiZsExm4qrXxjk+P1/fzGrA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.24.1.tgz",
+ "integrity": "sha512-oKJqR3TeI5hSLRxudMjFQ9re9fBVUU0GICqM3J1mi8MqlhVr6hC/ZN4ttAyMuQR6EZZIY6h/exe5swqGNNIkWQ==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-replace-supers": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -1566,12 +1594,12 @@
}
},
"node_modules/@babel/plugin-transform-optional-catch-binding": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.23.4.tgz",
- "integrity": "sha512-XIq8t0rJPHf6Wvmbn9nFxU6ao4c7WhghTR5WyV8SrJfUFzyxhCm4nhC+iAp3HFhbAKLfYpgzhJ6t4XCtVwqO5A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.24.1.tgz",
+ "integrity": "sha512-oBTH7oURV4Y+3EUrf6cWn1OHio3qG/PVwO5J03iSJmBg6m2EhKjkAu/xuaXaYwWW9miYtvbWv4LNf0AmR43LUA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
},
"engines": {
@@ -1582,12 +1610,12 @@
}
},
"node_modules/@babel/plugin-transform-optional-chaining": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.23.4.tgz",
- "integrity": "sha512-ZU8y5zWOfjM5vZ+asjgAPwDaBjJzgufjES89Rs4Lpq63O300R/kOz30WCLo6BxxX6QVEilwSlpClnG5cZaikTA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.24.5.tgz",
+ "integrity": "sha512-xWCkmwKT+ihmA6l7SSTpk8e4qQl/274iNbSKRRS8mpqFR32ksy36+a+LWY8OXCCEefF8WFlnOHVsaDI2231wBg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
"@babel/plugin-syntax-optional-chaining": "^7.8.3"
},
@@ -1599,12 +1627,12 @@
}
},
"node_modules/@babel/plugin-transform-parameters": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.23.3.tgz",
- "integrity": "sha512-09lMt6UsUb3/34BbECKVbVwrT9bO6lILWln237z7sLaWnMsTi7Yc9fhX5DLpkJzAGfaReXI22wP41SZmnAA3Vw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.24.5.tgz",
+ "integrity": "sha512-9Co00MqZ2aoky+4j2jhofErthm6QVLKbpQrvz20c3CH9KQCLHyNB+t2ya4/UrRpQGR+Wrwjg9foopoeSdnHOkA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1614,13 +1642,13 @@
}
},
"node_modules/@babel/plugin-transform-private-methods": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.23.3.tgz",
- "integrity": "sha512-UzqRcRtWsDMTLrRWFvUBDwmw06tCQH9Rl1uAjfh6ijMSmGYQ+fpdB+cnqRC8EMh5tuuxSv0/TejGL+7vyj+50g==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.24.1.tgz",
+ "integrity": "sha512-tGvisebwBO5em4PaYNqt4fkw56K2VALsAbAakY0FjTYqJp7gfdrgr7YX76Or8/cpik0W6+tj3rZ0uHU9Oil4tw==",
"dev": true,
"dependencies": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1630,14 +1658,14 @@
}
},
"node_modules/@babel/plugin-transform-private-property-in-object": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.23.4.tgz",
- "integrity": "sha512-9G3K1YqTq3F4Vt88Djx1UZ79PDyj+yKRnUy7cZGSMe+a7jkwD259uKKuUzQlPkGam7R+8RJwh5z4xO27fA1o2A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.24.5.tgz",
+ "integrity": "sha512-JM4MHZqnWR04jPMujQDTBVRnqxpLLpx2tkn7iPn+Hmsc0Gnb79yvRWOkvqFOx3Z7P7VxiRIR22c4eGSNj87OBQ==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-private-property-in-object": "^7.14.5"
},
"engines": {
@@ -1648,12 +1676,12 @@
}
},
"node_modules/@babel/plugin-transform-property-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.23.3.tgz",
- "integrity": "sha512-jR3Jn3y7cZp4oEWPFAlRsSWjxKe4PZILGBSd4nis1TsC5qeSpb+nrtihJuDhNI7QHiVbUaiXa0X2RZY3/TI6Nw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.24.1.tgz",
+ "integrity": "sha512-LetvD7CrHmEx0G442gOomRr66d7q8HzzGGr4PMHGr+5YIm6++Yke+jxj246rpvsbyhJwCLxcTn6zW1P1BSenqA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1663,12 +1691,12 @@
}
},
"node_modules/@babel/plugin-transform-react-display-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.23.3.tgz",
- "integrity": "sha512-GnvhtVfA2OAtzdX58FJxU19rhoGeQzyVndw3GgtdECQvQFXPEZIOVULHVZGAYmOgmqjXpVpfocAbSjh99V/Fqw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.24.1.tgz",
+ "integrity": "sha512-mvoQg2f9p2qlpDQRBC7M3c3XTr0k7cp/0+kFKKO/7Gtu0LSw16eKB+Fabe2bDT/UpsyasTBBkAnbdsLrkD5XMw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1712,13 +1740,13 @@
}
},
"node_modules/@babel/plugin-transform-react-pure-annotations": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.23.3.tgz",
- "integrity": "sha512-qMFdSS+TUhB7Q/3HVPnEdYJDQIk57jkntAwSuz9xfSE4n+3I+vHYCli3HoHawN1Z3RfCz/y1zXA/JXjG6cVImQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.24.1.tgz",
+ "integrity": "sha512-+pWEAaDJvSm9aFvJNpLiM2+ktl2Sn2U5DdyiWdZBxmLc6+xGt88dvFqsHiAiDS+8WqUwbDfkKz9jRxK3M0k+kA==",
"dev": true,
"dependencies": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1728,12 +1756,12 @@
}
},
"node_modules/@babel/plugin-transform-regenerator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.23.3.tgz",
- "integrity": "sha512-KP+75h0KghBMcVpuKisx3XTu9Ncut8Q8TuvGO4IhY+9D5DFEckQefOuIsB/gQ2tG71lCke4NMrtIPS8pOj18BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.24.1.tgz",
+ "integrity": "sha512-sJwZBCzIBE4t+5Q4IGLaaun5ExVMRY0lYwos/jNecjMrVCygCdph3IKv0tkP5Fc87e/1+bebAmEAGBfnRD+cnw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"regenerator-transform": "^0.15.2"
},
"engines": {
@@ -1744,12 +1772,12 @@
}
},
"node_modules/@babel/plugin-transform-reserved-words": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.23.3.tgz",
- "integrity": "sha512-QnNTazY54YqgGxwIexMZva9gqbPa15t/x9VS+0fsEFWplwVpXYZivtgl43Z1vMpc1bdPP2PP8siFeVcnFvA3Cg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.24.1.tgz",
+ "integrity": "sha512-JAclqStUfIwKN15HrsQADFgeZt+wexNQ0uLhuqvqAUFoqPMjEcFCYZBhq0LUdz6dZK/mD+rErhW71fbx8RYElg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1759,12 +1787,12 @@
}
},
"node_modules/@babel/plugin-transform-shorthand-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.23.3.tgz",
- "integrity": "sha512-ED2fgqZLmexWiN+YNFX26fx4gh5qHDhn1O2gvEhreLW2iI63Sqm4llRLCXALKrCnbN4Jy0VcMQZl/SAzqug/jg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.24.1.tgz",
+ "integrity": "sha512-LyjVB1nsJ6gTTUKRjRWx9C1s9hE7dLfP/knKdrfeH9UPtAGjYGgxIbFfx7xyLIEWs7Xe1Gnf8EWiUqfjLhInZA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1774,12 +1802,12 @@
}
},
"node_modules/@babel/plugin-transform-spread": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.23.3.tgz",
- "integrity": "sha512-VvfVYlrlBVu+77xVTOAoxQ6mZbnIq5FM0aGBSFEcIh03qHf+zNqA4DC/3XMUozTg7bZV3e3mZQ0i13VB6v5yUg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.24.1.tgz",
+ "integrity": "sha512-KjmcIM+fxgY+KxPVbjelJC6hrH1CgtPmTvdXAfn3/a9CnWGSTY7nH4zm5+cjmWJybdcPSsD0++QssDsjcpe47g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
},
"engines": {
@@ -1790,12 +1818,12 @@
}
},
"node_modules/@babel/plugin-transform-sticky-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.23.3.tgz",
- "integrity": "sha512-HZOyN9g+rtvnOU3Yh7kSxXrKbzgrm5X4GncPY1QOquu7epga5MxKHVpYu2hvQnry/H+JjckSYRb93iNfsioAGg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.24.1.tgz",
+ "integrity": "sha512-9v0f1bRXgPVcPrngOQvLXeGNNVLc8UjMVfebo9ka0WF3/7+aVUHmaJVT3sa0XCzEFioPfPHZiOcYG9qOsH63cw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1805,12 +1833,12 @@
}
},
"node_modules/@babel/plugin-transform-template-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.23.3.tgz",
- "integrity": "sha512-Flok06AYNp7GV2oJPZZcP9vZdszev6vPBkHLwxwSpaIqx75wn6mUd3UFWsSsA0l8nXAKkyCmL/sR02m8RYGeHg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.24.1.tgz",
+ "integrity": "sha512-WRkhROsNzriarqECASCNu/nojeXCDTE/F2HmRgOzi7NGvyfYGq1NEjKBK3ckLfRgGc6/lPAqP0vDOSw3YtG34g==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1820,12 +1848,12 @@
}
},
"node_modules/@babel/plugin-transform-typeof-symbol": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.23.3.tgz",
- "integrity": "sha512-4t15ViVnaFdrPC74be1gXBSMzXk3B4Us9lP7uLRQHTFpV5Dvt33pn+2MyyNxmN3VTTm3oTrZVMUmuw3oBnQ2oQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.24.5.tgz",
+ "integrity": "sha512-UTGnhYVZtTAjdwOTzT+sCyXmTn8AhaxOS/MjG9REclZ6ULHWF9KoCZur0HSGU7hk8PdBFKKbYe6+gqdXWz84Jg==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
},
"engines": {
"node": ">=6.9.0"
@@ -1853,12 +1881,12 @@
}
},
"node_modules/@babel/plugin-transform-unicode-escapes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.23.3.tgz",
- "integrity": "sha512-OMCUx/bU6ChE3r4+ZdylEqAjaQgHAgipgW8nsCfu5pGqDcFytVd91AwRvUJSBZDz0exPGgnjoqhgRYLRjFZc9Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.24.1.tgz",
+ "integrity": "sha512-RlkVIcWT4TLI96zM660S877E7beKlQw7Ig+wqkKBiWfj0zH5Q4h50q6er4wzZKRNSYpfo6ILJ+hrJAGSX2qcNw==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1868,13 +1896,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-property-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.23.3.tgz",
- "integrity": "sha512-KcLIm+pDZkWZQAFJ9pdfmh89EwVfmNovFBcXko8szpBeF8z68kWIPeKlmSOkT9BXJxs2C0uk+5LxoxIv62MROA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.24.1.tgz",
+ "integrity": "sha512-Ss4VvlfYV5huWApFsF8/Sq0oXnGO+jB+rijFEFugTd3cwSObUSnUi88djgR5528Csl0uKlrI331kRqe56Ov2Ng==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1884,13 +1912,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.23.3.tgz",
- "integrity": "sha512-wMHpNA4x2cIA32b/ci3AfwNgheiva2W0WUKWTK7vBHBhDKfPsc5cFGNWm69WBqpwd86u1qwZ9PWevKqm1A3yAw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.24.1.tgz",
+ "integrity": "sha512-2A/94wgZgxfTsiLaQ2E36XAOdcZmGAaEEgVmxQWwZXWkGhvoHbaqXcKnU8zny4ycpu3vNqg0L/PcCiYtHtA13g==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1900,13 +1928,13 @@
}
},
"node_modules/@babel/plugin-transform-unicode-sets-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.23.3.tgz",
- "integrity": "sha512-W7lliA/v9bNR83Qc3q1ip9CQMZ09CcHDbHfbLRDNuAhn1Mvkr1ZNF7hPmztMQvtTGVLJ9m8IZqWsTkXOml8dbw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.24.1.tgz",
+ "integrity": "sha512-fqj4WuzzS+ukpgerpAoOnMfQXwUHFxXUZUE84oL2Kao2N8uSlvcpnAidKASgsNgzZHBsHWvcm8s9FPWUhAb8fA==",
"dev": true,
"dependencies": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
},
"engines": {
"node": ">=6.9.0"
@@ -1927,26 +1955,27 @@
}
},
"node_modules/@babel/preset-env": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.0.tgz",
- "integrity": "sha512-ZxPEzV9IgvGn73iK0E6VB9/95Nd7aMFpbE0l8KQFDG70cOV9IxRP7Y2FUPmlK0v6ImlLqYX50iuZ3ZTVhOF2lA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.5.tgz",
+ "integrity": "sha512-UGK2ifKtcC8i5AI4cH+sbLLuLc2ktYSFJgBAXorKAsHUZmrQ1q6aQ6i3BvU24wWs2AAKqQB6kq3N9V9Gw1HiMQ==",
"dev": true,
"dependencies": {
- "@babel/compat-data": "^7.23.5",
+ "@babel/compat-data": "^7.24.4",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-validator-option": "^7.23.5",
- "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.23.3",
- "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.23.3",
- "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.23.7",
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.24.5",
+ "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.24.1",
+ "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.24.1",
+ "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.24.1",
"@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
"@babel/plugin-syntax-async-generators": "^7.8.4",
"@babel/plugin-syntax-class-properties": "^7.12.13",
"@babel/plugin-syntax-class-static-block": "^7.14.5",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3",
- "@babel/plugin-syntax-import-assertions": "^7.23.3",
- "@babel/plugin-syntax-import-attributes": "^7.23.3",
+ "@babel/plugin-syntax-import-assertions": "^7.24.1",
+ "@babel/plugin-syntax-import-attributes": "^7.24.1",
"@babel/plugin-syntax-import-meta": "^7.10.4",
"@babel/plugin-syntax-json-strings": "^7.8.3",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
@@ -1958,58 +1987,58 @@
"@babel/plugin-syntax-private-property-in-object": "^7.14.5",
"@babel/plugin-syntax-top-level-await": "^7.14.5",
"@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
- "@babel/plugin-transform-arrow-functions": "^7.23.3",
- "@babel/plugin-transform-async-generator-functions": "^7.23.9",
- "@babel/plugin-transform-async-to-generator": "^7.23.3",
- "@babel/plugin-transform-block-scoped-functions": "^7.23.3",
- "@babel/plugin-transform-block-scoping": "^7.23.4",
- "@babel/plugin-transform-class-properties": "^7.23.3",
- "@babel/plugin-transform-class-static-block": "^7.23.4",
- "@babel/plugin-transform-classes": "^7.23.8",
- "@babel/plugin-transform-computed-properties": "^7.23.3",
- "@babel/plugin-transform-destructuring": "^7.23.3",
- "@babel/plugin-transform-dotall-regex": "^7.23.3",
- "@babel/plugin-transform-duplicate-keys": "^7.23.3",
- "@babel/plugin-transform-dynamic-import": "^7.23.4",
- "@babel/plugin-transform-exponentiation-operator": "^7.23.3",
- "@babel/plugin-transform-export-namespace-from": "^7.23.4",
- "@babel/plugin-transform-for-of": "^7.23.6",
- "@babel/plugin-transform-function-name": "^7.23.3",
- "@babel/plugin-transform-json-strings": "^7.23.4",
- "@babel/plugin-transform-literals": "^7.23.3",
- "@babel/plugin-transform-logical-assignment-operators": "^7.23.4",
- "@babel/plugin-transform-member-expression-literals": "^7.23.3",
- "@babel/plugin-transform-modules-amd": "^7.23.3",
- "@babel/plugin-transform-modules-commonjs": "^7.23.3",
- "@babel/plugin-transform-modules-systemjs": "^7.23.9",
- "@babel/plugin-transform-modules-umd": "^7.23.3",
+ "@babel/plugin-transform-arrow-functions": "^7.24.1",
+ "@babel/plugin-transform-async-generator-functions": "^7.24.3",
+ "@babel/plugin-transform-async-to-generator": "^7.24.1",
+ "@babel/plugin-transform-block-scoped-functions": "^7.24.1",
+ "@babel/plugin-transform-block-scoping": "^7.24.5",
+ "@babel/plugin-transform-class-properties": "^7.24.1",
+ "@babel/plugin-transform-class-static-block": "^7.24.4",
+ "@babel/plugin-transform-classes": "^7.24.5",
+ "@babel/plugin-transform-computed-properties": "^7.24.1",
+ "@babel/plugin-transform-destructuring": "^7.24.5",
+ "@babel/plugin-transform-dotall-regex": "^7.24.1",
+ "@babel/plugin-transform-duplicate-keys": "^7.24.1",
+ "@babel/plugin-transform-dynamic-import": "^7.24.1",
+ "@babel/plugin-transform-exponentiation-operator": "^7.24.1",
+ "@babel/plugin-transform-export-namespace-from": "^7.24.1",
+ "@babel/plugin-transform-for-of": "^7.24.1",
+ "@babel/plugin-transform-function-name": "^7.24.1",
+ "@babel/plugin-transform-json-strings": "^7.24.1",
+ "@babel/plugin-transform-literals": "^7.24.1",
+ "@babel/plugin-transform-logical-assignment-operators": "^7.24.1",
+ "@babel/plugin-transform-member-expression-literals": "^7.24.1",
+ "@babel/plugin-transform-modules-amd": "^7.24.1",
+ "@babel/plugin-transform-modules-commonjs": "^7.24.1",
+ "@babel/plugin-transform-modules-systemjs": "^7.24.1",
+ "@babel/plugin-transform-modules-umd": "^7.24.1",
"@babel/plugin-transform-named-capturing-groups-regex": "^7.22.5",
- "@babel/plugin-transform-new-target": "^7.23.3",
- "@babel/plugin-transform-nullish-coalescing-operator": "^7.23.4",
- "@babel/plugin-transform-numeric-separator": "^7.23.4",
- "@babel/plugin-transform-object-rest-spread": "^7.24.0",
- "@babel/plugin-transform-object-super": "^7.23.3",
- "@babel/plugin-transform-optional-catch-binding": "^7.23.4",
- "@babel/plugin-transform-optional-chaining": "^7.23.4",
- "@babel/plugin-transform-parameters": "^7.23.3",
- "@babel/plugin-transform-private-methods": "^7.23.3",
- "@babel/plugin-transform-private-property-in-object": "^7.23.4",
- "@babel/plugin-transform-property-literals": "^7.23.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
- "@babel/plugin-transform-reserved-words": "^7.23.3",
- "@babel/plugin-transform-shorthand-properties": "^7.23.3",
- "@babel/plugin-transform-spread": "^7.23.3",
- "@babel/plugin-transform-sticky-regex": "^7.23.3",
- "@babel/plugin-transform-template-literals": "^7.23.3",
- "@babel/plugin-transform-typeof-symbol": "^7.23.3",
- "@babel/plugin-transform-unicode-escapes": "^7.23.3",
- "@babel/plugin-transform-unicode-property-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-sets-regex": "^7.23.3",
+ "@babel/plugin-transform-new-target": "^7.24.1",
+ "@babel/plugin-transform-nullish-coalescing-operator": "^7.24.1",
+ "@babel/plugin-transform-numeric-separator": "^7.24.1",
+ "@babel/plugin-transform-object-rest-spread": "^7.24.5",
+ "@babel/plugin-transform-object-super": "^7.24.1",
+ "@babel/plugin-transform-optional-catch-binding": "^7.24.1",
+ "@babel/plugin-transform-optional-chaining": "^7.24.5",
+ "@babel/plugin-transform-parameters": "^7.24.5",
+ "@babel/plugin-transform-private-methods": "^7.24.1",
+ "@babel/plugin-transform-private-property-in-object": "^7.24.5",
+ "@babel/plugin-transform-property-literals": "^7.24.1",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
+ "@babel/plugin-transform-reserved-words": "^7.24.1",
+ "@babel/plugin-transform-shorthand-properties": "^7.24.1",
+ "@babel/plugin-transform-spread": "^7.24.1",
+ "@babel/plugin-transform-sticky-regex": "^7.24.1",
+ "@babel/plugin-transform-template-literals": "^7.24.1",
+ "@babel/plugin-transform-typeof-symbol": "^7.24.5",
+ "@babel/plugin-transform-unicode-escapes": "^7.24.1",
+ "@babel/plugin-transform-unicode-property-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-sets-regex": "^7.24.1",
"@babel/preset-modules": "0.1.6-no-external-plugins",
- "babel-plugin-polyfill-corejs2": "^0.4.8",
- "babel-plugin-polyfill-corejs3": "^0.9.0",
- "babel-plugin-polyfill-regenerator": "^0.5.5",
+ "babel-plugin-polyfill-corejs2": "^0.4.10",
+ "babel-plugin-polyfill-corejs3": "^0.10.4",
+ "babel-plugin-polyfill-regenerator": "^0.6.1",
"core-js-compat": "^3.31.0",
"semver": "^6.3.1"
},
@@ -2052,17 +2081,17 @@
}
},
"node_modules/@babel/preset-react": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.23.3.tgz",
- "integrity": "sha512-tbkHOS9axH6Ysf2OUEqoSZ6T3Fa2SrNH6WTWSPBboxKzdxNc9qOICeLXkNG0ZEwbQ1HY8liwOce4aN/Ceyuq6w==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.24.1.tgz",
+ "integrity": "sha512-eFa8up2/8cZXLIpkafhaADTXSnl7IsUFCYenRWrARBz0/qZwcT0RBXpys0LJU4+WfPoF2ZG6ew6s2V6izMCwRA==",
"dev": true,
"dependencies": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-validator-option": "^7.22.15",
- "@babel/plugin-transform-react-display-name": "^7.23.3",
- "@babel/plugin-transform-react-jsx": "^7.22.15",
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-validator-option": "^7.23.5",
+ "@babel/plugin-transform-react-display-name": "^7.24.1",
+ "@babel/plugin-transform-react-jsx": "^7.23.4",
"@babel/plugin-transform-react-jsx-development": "^7.22.5",
- "@babel/plugin-transform-react-pure-annotations": "^7.23.3"
+ "@babel/plugin-transform-react-pure-annotations": "^7.24.1"
},
"engines": {
"node": ">=6.9.0"
@@ -2148,19 +2177,19 @@
}
},
"node_modules/@babel/traverse": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.0.tgz",
- "integrity": "sha512-HfuJlI8qq3dEDmNU5ChzzpZRWq+oxCZQyMzIMEqLho+AQnhMnKQUzH6ydo3RBl/YjPCuk68Y6s0Gx0AeyULiWw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.5.tgz",
+ "integrity": "sha512-7aaBLeDQ4zYcUFDUD41lJc1fG8+5IU9DaNSJAgal866FGvmD5EbWQgnEC6kO1gGLsX0esNkfnJSndbTXA3r7UA==",
"dev": true,
"dependencies": {
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
"@babel/helper-hoist-variables": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/parser": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/parser": "^7.24.5",
+ "@babel/types": "^7.24.5",
"debug": "^4.3.1",
"globals": "^11.1.0"
},
@@ -2169,13 +2198,13 @@
}
},
"node_modules/@babel/types": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.0.tgz",
- "integrity": "sha512-+j7a5c253RfKh8iABBhywc8NSfP5LURe7Uh4qpsh6jc+aLJguvmIUBdjSdEMQv2bENrCR5MfRdjGo7vzS/ob7w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.5.tgz",
+ "integrity": "sha512-6mQNsaLeXTw0nxYUYu+NSa4Hx4BlF1x1x8/PMFbiR+GBSr+2DkECc69b8hgy2frEodNcvPffeH8YfWd3LI6jhQ==",
"dev": true,
"dependencies": {
- "@babel/helper-string-parser": "^7.23.4",
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-string-parser": "^7.24.1",
+ "@babel/helper-validator-identifier": "^7.24.5",
"to-fast-properties": "^2.0.0"
},
"engines": {
@@ -2538,14 +2567,14 @@
}
},
"node_modules/@jridgewell/gen-mapping": {
- "version": "0.3.3",
- "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.3.tgz",
- "integrity": "sha512-HLhSWOLRi875zjjMG/r+Nv0oCW8umGb0BgEhyX3dDX3egwZtB8PqLnjz3yedt8R5StBrzcg4aBpnh8UA9D1BoQ==",
+ "version": "0.3.5",
+ "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.5.tgz",
+ "integrity": "sha512-IzL8ZoEDIBRWEzlCcRhOaCupYyN5gdIK+Q6fbFdPDg6HqX6jpkItn7DFIpW9LQzXG6Df9sA7+OKnq0qlz/GaQg==",
"dev": true,
"dependencies": {
- "@jridgewell/set-array": "^1.0.1",
+ "@jridgewell/set-array": "^1.2.1",
"@jridgewell/sourcemap-codec": "^1.4.10",
- "@jridgewell/trace-mapping": "^0.3.9"
+ "@jridgewell/trace-mapping": "^0.3.24"
},
"engines": {
"node": ">=6.0.0"
@@ -2561,9 +2590,9 @@
}
},
"node_modules/@jridgewell/set-array": {
- "version": "1.1.2",
- "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.1.2.tgz",
- "integrity": "sha512-xnkseuNADM0gt2bs+BvhO0p78Mk762YnZdsuzFV018NoG1Sj1SCQvpSqa7XUaTam5vAGasABV9qXASMKnFMwMw==",
+ "version": "1.2.1",
+ "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.2.1.tgz",
+ "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
"dev": true,
"engines": {
"node": ">=6.0.0"
@@ -2586,9 +2615,9 @@
"dev": true
},
"node_modules/@jridgewell/trace-mapping": {
- "version": "0.3.22",
- "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.22.tgz",
- "integrity": "sha512-Wf963MzWtA2sjrNt+g18IAln9lKnlRp+K2eH4jjIoF1wYeq3aMREpG09xhlhdzS0EjwU7qmUJYangWa+151vZw==",
+ "version": "0.3.25",
+ "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
+ "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
"dev": true,
"dependencies": {
"@jridgewell/resolve-uri": "^3.1.0",
@@ -10514,9 +10543,9 @@
"dev": true
},
"node_modules/@webassemblyjs/ast": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.6.tgz",
- "integrity": "sha512-IN1xI7PwOvLPgjcf180gC1bqn3q/QaOCwYUahIOhbYUu8KA/3tw2RT/T0Gidi1l7Hhj5D/INhJxiICObqpMu4Q==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.12.1.tgz",
+ "integrity": "sha512-EKfMUOPRRUTy5UII4qJDGPpqfwjOmZ5jeGFwid9mnoqIFK+e0vqoi1qH56JpmZSzEL53jKnNzScdmftJyG5xWg==",
"dev": true,
"dependencies": {
"@webassemblyjs/helper-numbers": "1.11.6",
@@ -10536,9 +10565,9 @@
"dev": true
},
"node_modules/@webassemblyjs/helper-buffer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.6.tgz",
- "integrity": "sha512-z3nFzdcp1mb8nEOFFk8DrYLpHvhKC3grJD2ardfKOzmbmJvEf/tPIqCY+sNcwZIY8ZD7IkB2l7/pqhUhqm7hLA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.12.1.tgz",
+ "integrity": "sha512-nzJwQw99DNDKr9BVCOZcLuJJUlqkJh+kVzVl6Fmq/tI5ZtEyWT1KZMyOXltXLZJmDtvLCDgwsyrkohEtopTXCw==",
"dev": true
},
"node_modules/@webassemblyjs/helper-code-frame": {
@@ -10628,15 +10657,15 @@
"dev": true
},
"node_modules/@webassemblyjs/helper-wasm-section": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.6.tgz",
- "integrity": "sha512-LPpZbSOwTpEC2cgn4hTydySy1Ke+XEu+ETXuoyvuyezHO3Kjdu90KK95Sh9xTbmjrCsUwvWwCOQQNta37VrS9g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.12.1.tgz",
+ "integrity": "sha512-Jif4vfB6FJlUlSbgEMHUyk1j234GTNG9dBJ4XJdOySoj518Xj0oGsNi59cUQF4RRMS9ouBUxDDdyBVfPTypa5g==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6"
+ "@webassemblyjs/wasm-gen": "1.12.1"
}
},
"node_modules/@webassemblyjs/ieee754": {
@@ -10664,28 +10693,28 @@
"dev": true
},
"node_modules/@webassemblyjs/wasm-edit": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.6.tgz",
- "integrity": "sha512-Ybn2I6fnfIGuCR+Faaz7YcvtBKxvoLV3Lebn1tM4o/IAJzmi9AWYIPWpyBfU8cC+JxAO57bk4+zdsTjJR+VTOw==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.12.1.tgz",
+ "integrity": "sha512-1DuwbVvADvS5mGnXbE+c9NfA8QRcZ6iKquqjjmR10k6o+zzsRVesil54DKexiowcFCPdr/Q0qaMgB01+SQ1u6g==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/helper-wasm-section": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-opt": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6",
- "@webassemblyjs/wast-printer": "1.11.6"
+ "@webassemblyjs/helper-wasm-section": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-opt": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1",
+ "@webassemblyjs/wast-printer": "1.12.1"
}
},
"node_modules/@webassemblyjs/wasm-gen": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.6.tgz",
- "integrity": "sha512-3XOqkZP/y6B4F0PBAXvI1/bky7GryoogUtfwExeP/v7Nzwo1QLcq5oQmpKlftZLbT+ERUOAZVQjuNVak6UXjPA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.12.1.tgz",
+ "integrity": "sha512-TDq4Ojh9fcohAw6OIMXqiIcTq5KUXTGRkVxbSo1hQnSy6lAM5GSdfwWeSxpAo0YzgsgF182E/U0mDNhuA0tW7w==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
"@webassemblyjs/leb128": "1.11.6",
@@ -10693,24 +10722,24 @@
}
},
"node_modules/@webassemblyjs/wasm-opt": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.6.tgz",
- "integrity": "sha512-cOrKuLRE7PCe6AsOVl7WasYf3wbSo4CeOk6PkrjS7g57MFfVUF9u6ysQBBODX0LdgSvQqRiGz3CXvIDKcPNy4g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.12.1.tgz",
+ "integrity": "sha512-Jg99j/2gG2iaz3hijw857AVYekZe2SAskcqlWIZXjji5WStnOpVoat3gQfT/Q5tb2djnCjBtMocY/Su1GfxPBg==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6"
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1"
}
},
"node_modules/@webassemblyjs/wasm-parser": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.6.tgz",
- "integrity": "sha512-6ZwPeGzMJM3Dqp3hCsLgESxBGtT/OeCvCZ4TA1JUPYgmhAx38tTPR9JaKy0S5H3evQpO/h2uWs2j6Yc/fjkpTQ==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.12.1.tgz",
+ "integrity": "sha512-xikIi7c2FHXysxXe3COrVUPSheuBtpcfhbpFj4gmu7KRLYOzANztwUU0IbsqvMqzuNK2+glRGWCEqZo1WCLyAQ==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-api-error": "1.11.6",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
@@ -10762,12 +10791,12 @@
"dev": true
},
"node_modules/@webassemblyjs/wast-printer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.6.tgz",
- "integrity": "sha512-JM7AhRcE+yW2GWYaKeHL5vt4xqee5N2WcezptmgyhNS+ScggqcT1OtXykhAb13Sn5Yas0j2uv9tHgrjwvzAP4A==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.12.1.tgz",
+ "integrity": "sha512-+X4WAlOisVWQMikjbcvY2e0rwPsKQ9F688lksZhBcPycBBuii3O7m8FACbDMWDojpAqvjIncrG8J0XHKyQfVeA==",
"dev": true,
"dependencies": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@xtuc/long": "4.2.2"
}
},
@@ -11785,13 +11814,13 @@
"dev": true
},
"node_modules/babel-plugin-polyfill-corejs2": {
- "version": "0.4.8",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.8.tgz",
- "integrity": "sha512-OtIuQfafSzpo/LhnJaykc0R/MMnuLSSVjVYy9mHArIZ9qTCSZ6TpWCuEKZYVoN//t8HqBNScHrOtCrIK5IaGLg==",
+ "version": "0.4.11",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.11.tgz",
+ "integrity": "sha512-sMEJ27L0gRHShOh5G54uAAPaiCOygY/5ratXuiyb2G46FmlSpc9eFCzYVyDiPxfNbwzA7mYahmjQc5q+CZQ09Q==",
"dev": true,
"dependencies": {
"@babel/compat-data": "^7.22.6",
- "@babel/helper-define-polyfill-provider": "^0.5.0",
+ "@babel/helper-define-polyfill-provider": "^0.6.2",
"semver": "^6.3.1"
},
"peerDependencies": {
@@ -11799,25 +11828,25 @@
}
},
"node_modules/babel-plugin-polyfill-corejs3": {
- "version": "0.9.0",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.9.0.tgz",
- "integrity": "sha512-7nZPG1uzK2Ymhy/NbaOWTg3uibM2BmGASS4vHS4szRZAIR8R6GwA/xAujpdrXU5iyklrimWnLWU+BLF9suPTqg==",
+ "version": "0.10.4",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.10.4.tgz",
+ "integrity": "sha512-25J6I8NGfa5YkCDogHRID3fVCadIR8/pGl1/spvCkzb6lVn6SR3ojpx9nOn9iEBcUsjY24AmdKm5khcfKdylcg==",
"dev": true,
"dependencies": {
- "@babel/helper-define-polyfill-provider": "^0.5.0",
- "core-js-compat": "^3.34.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.1",
+ "core-js-compat": "^3.36.1"
},
"peerDependencies": {
"@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
}
},
"node_modules/babel-plugin-polyfill-regenerator": {
- "version": "0.5.5",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.5.5.tgz",
- "integrity": "sha512-OJGYZlhLqBh2DDHeqAxWB1XIvr49CxiJ2gIt61/PU55CQK4Z58OzMqjDe1zwQdQk+rBYsRc+1rJmdajM3gimHg==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.2.tgz",
+ "integrity": "sha512-2R25rQZWP63nGwaAswvDazbPXfrM3HwVoBXK6HcqeKrSrL/JqcC/rDcf95l4r7LXLyxDXc8uQDa064GubtCABg==",
"dev": true,
"dependencies": {
- "@babel/helper-define-polyfill-provider": "^0.5.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.2"
},
"peerDependencies": {
"@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
@@ -12354,9 +12383,9 @@
}
},
"node_modules/browserslist": {
- "version": "4.22.2",
- "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.22.2.tgz",
- "integrity": "sha512-0UgcrvQmBDvZHFGdYUehrCNIazki7/lUP3kkoi/r3YB2amZbFM9J43ZRkJTXBUZK4gmx56+Sqk9+Vs9mwZx9+A==",
+ "version": "4.23.0",
+ "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.23.0.tgz",
+ "integrity": "sha512-QW8HiM1shhT2GuzkvklfjcKDiWFXHOeFCIA/huJPwHsslwcydgk7X+z2zXpEijP98UCY7HbubZt5J2Zgvf0CaQ==",
"dev": true,
"funding": [
{
@@ -12373,8 +12402,8 @@
}
],
"dependencies": {
- "caniuse-lite": "^1.0.30001565",
- "electron-to-chromium": "^1.4.601",
+ "caniuse-lite": "^1.0.30001587",
+ "electron-to-chromium": "^1.4.668",
"node-releases": "^2.0.14",
"update-browserslist-db": "^1.0.13"
},
@@ -12793,9 +12822,9 @@
}
},
"node_modules/caniuse-lite": {
- "version": "1.0.30001580",
- "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001580.tgz",
- "integrity": "sha512-mtj5ur2FFPZcCEpXFy8ADXbDACuNFXg6mxVDqp7tqooX6l3zwm+d8EPoeOSIFRDvHs8qu7/SLFOGniULkcH2iA==",
+ "version": "1.0.30001615",
+ "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001615.tgz",
+ "integrity": "sha512-1IpazM5G3r38meiae0bHRnPhz+CBQ3ZLqbQMtrg+AsTPKAXgW38JNsXkyZ+v8waCsDmPq87lmfun5Q2AGysNEQ==",
"dev": true,
"funding": [
{
@@ -13743,12 +13772,12 @@
"hasInstallScript": true
},
"node_modules/core-js-compat": {
- "version": "3.35.1",
- "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.35.1.tgz",
- "integrity": "sha512-sftHa5qUJY3rs9Zht1WEnmkvXputCyDBczPnr7QDgL8n3qrF3CMXY4VPSYtOLLiOUJcah2WNXREd48iOl6mQIw==",
+ "version": "3.37.0",
+ "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.37.0.tgz",
+ "integrity": "sha512-vYq4L+T8aS5UuFg4UwDhc7YNRWVeVZwltad9C/jV3R2LgVOpS9BDr7l/WL6BN0dbV3k1XejPTHqqEzJgsa0frA==",
"dev": true,
"dependencies": {
- "browserslist": "^4.22.2"
+ "browserslist": "^4.23.0"
},
"funding": {
"type": "opencollective",
@@ -15041,9 +15070,9 @@
"dev": true
},
"node_modules/electron-to-chromium": {
- "version": "1.4.645",
- "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.4.645.tgz",
- "integrity": "sha512-EeS1oQDCmnYsRDRy2zTeC336a/4LZ6WKqvSaM1jLocEk5ZuyszkQtCpsqvuvaIXGOUjwtvF6LTcS8WueibXvSw==",
+ "version": "1.4.754",
+ "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.4.754.tgz",
+ "integrity": "sha512-7Kr5jUdns5rL/M9wFFmMZAgFDuL2YOnanFH4OI4iFzUqyh3XOL7nAGbSlSMZdzKMIyyTpNSbqZsWG9odwLeKvA==",
"dev": true
},
"node_modules/elliptic": {
@@ -15178,9 +15207,9 @@
}
},
"node_modules/enhanced-resolve": {
- "version": "5.15.0",
- "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.15.0.tgz",
- "integrity": "sha512-LXYT42KJ7lpIKECr2mAXIaMldcNCh/7E0KBKOu4KSfkHmP+mZmSs+8V5gBAqisWBy0OO4W5Oyys0GO1Y8KtdKg==",
+ "version": "5.16.0",
+ "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.16.0.tgz",
+ "integrity": "sha512-O+QWCviPNSSLAD9Ucn8Awv+poAkqn3T1XY5/N7kR7rQO9yfSGWkYZDwpJ+iKF7B8rxaQKWngSqACpgzeapSyoA==",
"dev": true,
"dependencies": {
"graceful-fs": "^4.2.4",
@@ -27850,9 +27879,9 @@
}
},
"node_modules/watchpack": {
- "version": "2.4.0",
- "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.0.tgz",
- "integrity": "sha512-Lcvm7MGST/4fup+ifyKi2hjyIAwcdI4HRgtvTpIUxBRhB+RFtUh8XtDOxUfctVCnhVi+QQj49i91OyvzkJl6cg==",
+ "version": "2.4.1",
+ "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.1.tgz",
+ "integrity": "sha512-8wrBCMtVhqcXP2Sup1ctSkga6uc2Bx0IIvKyT7yTFier5AXHooSI+QyQQAtTb7+E0IUCCKyTFmXqdqgum2XWGg==",
"dev": true,
"dependencies": {
"glob-to-regexp": "^0.4.1",
@@ -28215,26 +28244,26 @@
"dev": true
},
"node_modules/webpack": {
- "version": "5.90.3",
- "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.90.3.tgz",
- "integrity": "sha512-h6uDYlWCctQRuXBs1oYpVe6sFcWedl0dpcVaTf/YF67J9bKvwJajFulMVSYKHrksMB3I/pIagRzDxwxkebuzKA==",
+ "version": "5.91.0",
+ "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.91.0.tgz",
+ "integrity": "sha512-rzVwlLeBWHJbmgTC/8TvAcu5vpJNII+MelQpylD4jNERPwpBJOE2lEcko1zJX3QJeLjTTAnQxn/OJ8bjDzVQaw==",
"dev": true,
"dependencies": {
"@types/eslint-scope": "^3.7.3",
"@types/estree": "^1.0.5",
- "@webassemblyjs/ast": "^1.11.5",
- "@webassemblyjs/wasm-edit": "^1.11.5",
- "@webassemblyjs/wasm-parser": "^1.11.5",
+ "@webassemblyjs/ast": "^1.12.1",
+ "@webassemblyjs/wasm-edit": "^1.12.1",
+ "@webassemblyjs/wasm-parser": "^1.12.1",
"acorn": "^8.7.1",
"acorn-import-assertions": "^1.9.0",
"browserslist": "^4.21.10",
"chrome-trace-event": "^1.0.2",
- "enhanced-resolve": "^5.15.0",
+ "enhanced-resolve": "^5.16.0",
"es-module-lexer": "^1.2.1",
"eslint-scope": "5.1.1",
"events": "^3.2.0",
"glob-to-regexp": "^0.4.1",
- "graceful-fs": "^4.2.9",
+ "graceful-fs": "^4.2.11",
"json-parse-even-better-errors": "^2.3.1",
"loader-runner": "^4.2.0",
"mime-types": "^2.1.27",
@@ -28242,7 +28271,7 @@
"schema-utils": "^3.2.0",
"tapable": "^2.1.1",
"terser-webpack-plugin": "^5.3.10",
- "watchpack": "^2.4.0",
+ "watchpack": "^2.4.1",
"webpack-sources": "^3.2.3"
},
"bin": {
@@ -29350,12 +29379,12 @@
}
},
"@babel/cli": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.23.9.tgz",
- "integrity": "sha512-vB1UXmGDNEhcf1jNAHKT9IlYk1R+hehVTLFlCLHBi8gfuHQGP6uRjgXVYU0EVlI/qwAWpstqkBdf2aez3/z/5Q==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/cli/-/cli-7.24.5.tgz",
+ "integrity": "sha512-2qg1mYtJRsOOWF6IUwLP5jI42P8Cc0hQ5TmnjLrik/4DKouO8dFJN80HEz81VmVeUs97yuuf3vQ/9j7Elrcjlg==",
"dev": true,
"requires": {
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@jridgewell/trace-mapping": "^0.3.25",
"@nicolo-ribaudo/chokidar-2": "2.1.8-no-fsevents.3",
"chokidar": "^3.4.0",
"commander": "^4.0.1",
@@ -29367,37 +29396,45 @@
}
},
"@babel/code-frame": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.23.5.tgz",
- "integrity": "sha512-CgH3s1a96LipHCmSUmYFPwY7MNx8C3avkq7i4Wl3cfa662ldtUe4VM1TPXX70pfmrlWTb6jLqTYrZyT2ZTJBgA==",
+ "version": "7.24.2",
+ "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.24.2.tgz",
+ "integrity": "sha512-y5+tLQyV8pg3fsiln67BVLD1P13Eg4lh5RW9mF0zUuvLrv9uIQ4MCL+CRT+FTsBlBjcIan6PGsLcBN0m3ClUyQ==",
"dev": true,
"requires": {
- "@babel/highlight": "^7.23.4",
- "chalk": "^2.4.2"
+ "@babel/highlight": "^7.24.2",
+ "picocolors": "^1.0.0"
+ },
+ "dependencies": {
+ "picocolors": {
+ "version": "1.0.0",
+ "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz",
+ "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==",
+ "dev": true
+ }
}
},
"@babel/compat-data": {
- "version": "7.23.5",
- "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.23.5.tgz",
- "integrity": "sha512-uU27kfDRlhfKl+w1U6vp16IuvSLtjAxdArVXPa9BvLkrr7CYIsxH5adpHObeAGY/41+syctUWOZ140a2Rvkgjw==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.24.4.tgz",
+ "integrity": "sha512-vg8Gih2MLK+kOkHJp4gBEIkyaIi00jgWot2D9QOmmfLC8jINSOzmCLta6Bvz/JSBCqnegV0L80jhxkol5GWNfQ==",
"dev": true
},
"@babel/core": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.0.tgz",
- "integrity": "sha512-fQfkg0Gjkza3nf0c7/w6Xf34BW4YvzNfACRLmmb7XRLa6XHdR+K9AlJlxneFfWYf6uhOzuzZVTjF/8KfndZANw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.24.5.tgz",
+ "integrity": "sha512-tVQRucExLQ02Boi4vdPp49svNGcfL2GhdTCT9aldhXgCJVAI21EtRfBettiuLUwce/7r6bFdgs6JFkcdTiFttA==",
"dev": true,
"requires": {
"@ampproject/remapping": "^2.2.0",
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-module-transforms": "^7.23.3",
- "@babel/helpers": "^7.24.0",
- "@babel/parser": "^7.24.0",
+ "@babel/helper-module-transforms": "^7.24.5",
+ "@babel/helpers": "^7.24.5",
+ "@babel/parser": "^7.24.5",
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5",
"convert-source-map": "^2.0.0",
"debug": "^4.1.0",
"gensync": "^1.0.0-beta.2",
@@ -29406,14 +29443,14 @@
}
},
"@babel/generator": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.23.6.tgz",
- "integrity": "sha512-qrSfCYxYQB5owCmGLbl8XRpX1ytXlpueOb0N0UmQwA073KZxejgQTzAmJezxvpwQD9uGtK2shHdi55QT+MbjIw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.24.5.tgz",
+ "integrity": "sha512-x32i4hEXvr+iI0NEoEfDKzlemF8AmtOP8CcrRaEcpzysWuoEb1KknpcvMsHKPONoKZiDuItklgWhB18xEhr9PA==",
"dev": true,
"requires": {
- "@babel/types": "^7.23.6",
- "@jridgewell/gen-mapping": "^0.3.2",
- "@jridgewell/trace-mapping": "^0.3.17",
+ "@babel/types": "^7.24.5",
+ "@jridgewell/gen-mapping": "^0.3.5",
+ "@jridgewell/trace-mapping": "^0.3.25",
"jsesc": "^2.5.1"
}
},
@@ -29449,19 +29486,19 @@
}
},
"@babel/helper-create-class-features-plugin": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.23.7.tgz",
- "integrity": "sha512-xCoqR/8+BoNnXOY7RVSgv6X+o7pmT5q1d+gGcRlXYkI+9B31glE4jeejhKVpA04O1AtzOt7OSQ6VYKP5FcRl9g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.24.5.tgz",
+ "integrity": "sha512-uRc4Cv8UQWnE4NXlYTIIdM7wfFkOqlFztcC/gVXDKohKoVB3OyonfelUBaJzSwpBntZ2KYGF/9S7asCHsXwW6g==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-member-expression-to-functions": "^7.23.0",
+ "@babel/helper-member-expression-to-functions": "^7.24.5",
"@babel/helper-optimise-call-expression": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
+ "@babel/helper-replace-supers": "^7.24.1",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"semver": "^6.3.1"
}
},
@@ -29477,9 +29514,9 @@
}
},
"@babel/helper-define-polyfill-provider": {
- "version": "0.5.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.5.0.tgz",
- "integrity": "sha512-NovQquuQLAQ5HuyjCz7WQP9MjRj7dx++yspwiyUiGl9ZyadHRSql1HZh5ogRd8W8w6YM6EQ/NTB8rgjLt5W65Q==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.2.tgz",
+ "integrity": "sha512-LV76g+C502biUK6AyZ3LK10vDpDyCzZnhZFXkH1L75zHPj68+qc8Zfpx2th+gzwA2MzyK+1g/3EPl62yFnVttQ==",
"dev": true,
"requires": {
"@babel/helper-compilation-targets": "^7.22.6",
@@ -29515,34 +29552,34 @@
}
},
"@babel/helper-member-expression-to-functions": {
- "version": "7.23.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.23.0.tgz",
- "integrity": "sha512-6gfrPwh7OuT6gZyJZvd6WbTfrqAo7vm4xCzAXOusKqq/vWdKXphTpj5klHKNmRUU6/QRGlBsyU9mAIPaWHlqJA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.24.5.tgz",
+ "integrity": "sha512-4owRteeihKWKamtqg4JmWSsEZU445xpFRXPEwp44HbgbxdWlUV1b4Agg4lkA806Lil5XM/e+FJyS0vj5T6vmcA==",
"dev": true,
"requires": {
- "@babel/types": "^7.23.0"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-module-imports": {
- "version": "7.22.15",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.22.15.tgz",
- "integrity": "sha512-0pYVBnDKZO2fnSPCrgM/6WMc7eS20Fbok+0r88fp+YtWVLZrp4CkafFGIp+W0VKw4a22sgebPT99y+FDNMdP4w==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.24.3.tgz",
+ "integrity": "sha512-viKb0F9f2s0BCS22QSF308z/+1YWKV/76mwt61NBzS5izMzDPwdq1pTrzf+Li3npBWX9KdQbkeCt1jSAM7lZqg==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.15"
+ "@babel/types": "^7.24.0"
}
},
"@babel/helper-module-transforms": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.23.3.tgz",
- "integrity": "sha512-7bBs4ED9OmswdfDzpz4MpWgSrV7FXlc3zIagvLFjS5H+Mk7Snr21vQ6QwrsoCGMfNC4e4LQPdoULEt4ykz0SRQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.24.5.tgz",
+ "integrity": "sha512-9GxeY8c2d2mdQUP1Dye0ks3VDyIMS98kt/llQ2nUId8IsWqTF0l1LkSX0/uP7l7MCDrzXS009Hyhe2gzTiGW8A==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-simple-access": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/helper-validator-identifier": "^7.22.20"
+ "@babel/helper-module-imports": "^7.24.3",
+ "@babel/helper-simple-access": "^7.24.5",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/helper-validator-identifier": "^7.24.5"
}
},
"@babel/helper-optimise-call-expression": {
@@ -29555,9 +29592,9 @@
}
},
"@babel/helper-plugin-utils": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.0.tgz",
- "integrity": "sha512-9cUznXMG0+FxRuJfvL82QlTqIzhVW9sL0KjMPHhAOOvpQGL8QtdxnBKILjBqxlHyliz0yCa1G903ZXI/FuHy2w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.24.5.tgz",
+ "integrity": "sha512-xjNLDopRzW2o6ba0gKbkZq5YWEBaK3PCyTOY1K2P/O07LGMhMqlMXPxwN4S5/RhWuCobT8z0jrlKGlYmeR1OhQ==",
"dev": true
},
"@babel/helper-remap-async-to-generator": {
@@ -29572,23 +29609,23 @@
}
},
"@babel/helper-replace-supers": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.22.20.tgz",
- "integrity": "sha512-qsW0In3dbwQUbK8kejJ4R7IHVGwHJlV6lpG6UA7a9hSa2YEiAib+N1T2kr6PEeUT+Fl7najmSOS6SmAwCHK6Tw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.24.1.tgz",
+ "integrity": "sha512-QCR1UqC9BzG5vZl8BMicmZ28RuUBnHhAMddD8yHFHDRH9lLTZ9uUPehX8ctVPT8l0TKblJidqcgUUKGVrePleQ==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-member-expression-to-functions": "^7.22.15",
+ "@babel/helper-member-expression-to-functions": "^7.23.0",
"@babel/helper-optimise-call-expression": "^7.22.5"
}
},
"@babel/helper-simple-access": {
- "version": "7.22.5",
- "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.22.5.tgz",
- "integrity": "sha512-n0H99E/K+Bika3++WNL17POvo4rKWZ7lZEp1Q+fStVbUi8nxPQEBOlTmCOxW/0JsS56SKKQ+ojAe2pHKJHN35w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-simple-access/-/helper-simple-access-7.24.5.tgz",
+ "integrity": "sha512-uH3Hmf5q5n7n8mz7arjUlDOCbttY/DW4DYhE6FUsjKJ/oYC1kQQUvwEQWxRwUpX9qQKRXeqLwWxrqilMrf32sQ==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-skip-transparent-expression-wrappers": {
@@ -29601,24 +29638,24 @@
}
},
"@babel/helper-split-export-declaration": {
- "version": "7.22.6",
- "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.22.6.tgz",
- "integrity": "sha512-AsUnxuLhRYsisFiaJwvp1QF+I3KjD5FOxut14q/GzovUe6orHLesW2C7d754kRm53h5gqrz6sFl6sxc4BVtE/g==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-split-export-declaration/-/helper-split-export-declaration-7.24.5.tgz",
+ "integrity": "sha512-5CHncttXohrHk8GWOFCcCl4oRD9fKosWlIRgWm4ql9VYioKm52Mk2xsmoohvm7f3JoiLSM5ZgJuRaf5QZZYd3Q==",
"dev": true,
"requires": {
- "@babel/types": "^7.22.5"
+ "@babel/types": "^7.24.5"
}
},
"@babel/helper-string-parser": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.23.4.tgz",
- "integrity": "sha512-803gmbQdqwdf4olxrX4AJyFBV/RTr3rSmOj0rKwesmzlfhYNDEs+/iOcznzpNWlJlIlTJC2QfPFcHB6DlzdVLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.24.1.tgz",
+ "integrity": "sha512-2ofRCjnnA9y+wk8b9IAREroeUP02KHp431N2mhKniy2yKIDKpbrHv9eXwm8cBeWQYcJmzv5qKCu65P47eCF7CQ==",
"dev": true
},
"@babel/helper-validator-identifier": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.22.20.tgz",
- "integrity": "sha512-Y4OZ+ytlatR8AI+8KZfKuL5urKp7qey08ha31L8b3BwewJAoJamTzyvxPR/5D+KkdJCGPq/+8TukHBlY10FX9A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.24.5.tgz",
+ "integrity": "sha512-3q93SSKX2TWCG30M2G2kwaKeTYgEUp5Snjuj8qm729SObL6nbtUldAi37qbxkD5gg3xnBio+f9nqpSepGZMvxA==",
"dev": true
},
"@babel/helper-validator-option": {
@@ -29628,72 +29665,91 @@
"dev": true
},
"@babel/helper-wrap-function": {
- "version": "7.22.20",
- "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.22.20.tgz",
- "integrity": "sha512-pms/UwkOpnQe/PDAEdV/d7dVCoBbB+R4FvYoHGZz+4VPcg7RtYy2KP7S2lbuWM6FCSgob5wshfGESbC/hzNXZw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.24.5.tgz",
+ "integrity": "sha512-/xxzuNvgRl4/HLNKvnFwdhdgN3cpLxgLROeLDl83Yx0AJ1SGvq1ak0OszTOjDfiB8Vx03eJbeDWh9r+jCCWttw==",
"dev": true,
"requires": {
- "@babel/helper-function-name": "^7.22.5",
- "@babel/template": "^7.22.15",
- "@babel/types": "^7.22.19"
+ "@babel/helper-function-name": "^7.23.0",
+ "@babel/template": "^7.24.0",
+ "@babel/types": "^7.24.5"
}
},
"@babel/helpers": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.0.tgz",
- "integrity": "sha512-ulDZdc0Aj5uLc5nETsa7EPx2L7rM0YJM8r7ck7U73AXi7qOV44IHHRAYZHY6iU1rr3C5N4NtTmMRUJP6kwCWeA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.24.5.tgz",
+ "integrity": "sha512-CiQmBMMpMQHwM5m01YnrM6imUG1ebgYJ+fAIW4FZe6m4qHTPaRHti+R8cggAwkdz4oXhtO4/K9JWlh+8hIfR2Q==",
"dev": true,
"requires": {
"@babel/template": "^7.24.0",
- "@babel/traverse": "^7.24.0",
- "@babel/types": "^7.24.0"
+ "@babel/traverse": "^7.24.5",
+ "@babel/types": "^7.24.5"
}
},
"@babel/highlight": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.23.4.tgz",
- "integrity": "sha512-acGdbYSfp2WheJoJm/EBBBLh/ID8KDc64ISZ9DYtBmC8/Q204PZJLHyzeB5qMzJ5trcOkybd78M4x2KWsUq++A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/highlight/-/highlight-7.24.5.tgz",
+ "integrity": "sha512-8lLmua6AVh/8SLJRRVD6V8p73Hir9w5mJrhE+IPpILG31KKlI9iz5zmBYKcWPS59qSfgP9RaSBQSHHE81WKuEw==",
"dev": true,
"requires": {
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-validator-identifier": "^7.24.5",
"chalk": "^2.4.2",
- "js-tokens": "^4.0.0"
+ "js-tokens": "^4.0.0",
+ "picocolors": "^1.0.0"
+ },
+ "dependencies": {
+ "picocolors": {
+ "version": "1.0.0",
+ "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.0.0.tgz",
+ "integrity": "sha512-1fygroTLlHu66zi26VoTDv8yRgm0Fccecssto+MhsZ0D/DGW2sm8E8AjW7NU5VVTRt5GxbeZ5qBuJr+HyLYkjQ==",
+ "dev": true
+ }
}
},
"@babel/parser": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.0.tgz",
- "integrity": "sha512-QuP/FxEAzMSjXygs8v4N9dvdXzEHN4W1oF3PxuWAtPo08UdM17u89RDMgjLn/mlc56iM0HlLmVkO/wgR+rDgHg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.24.5.tgz",
+ "integrity": "sha512-EOv5IK8arwh3LI47dz1b0tKUb/1uhHAnHJOrjgtQMIpu1uXd9mlFrJg9IUgGUgZ41Ch0K8REPTYpO7B76b4vJg==",
"dev": true
},
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.24.5.tgz",
+ "integrity": "sha512-LdXRi1wEMTrHVR4Zc9F8OewC3vdm5h4QB6L71zy6StmYeqGi1b3ttIO8UC+BfZKcH9jdr4aI249rBkm+3+YvHw==",
+ "dev": true,
+ "requires": {
+ "@babel/helper-environment-visitor": "^7.22.20",
+ "@babel/helper-plugin-utils": "^7.24.5"
+ }
+ },
"@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.23.3.tgz",
- "integrity": "sha512-iRkKcCqb7iGnq9+3G6rZ+Ciz5VywC4XNRHe57lKM+jOeYAoR0lVqdeeDRfh0tQcTfw/+vBhHn926FmQhLtlFLQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.24.1.tgz",
+ "integrity": "sha512-y4HqEnkelJIOQGd+3g1bTeKsA5c6qM7eOn7VggGVbBc0y8MLSKHacwcIE2PplNlQSj0PqS9rrXL/nkPVK+kUNg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.23.3.tgz",
- "integrity": "sha512-WwlxbfMNdVEpQjZmK5mhm7oSwD3dS6eU+Iwsi4Knl9wAletWem7kaRsGOG+8UEbRyqxY4SS5zvtfXwX+jMxUwQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.24.1.tgz",
+ "integrity": "sha512-Hj791Ii4ci8HqnaKHAlLNs+zaLXb0EzSDhiAWp5VNlyvCNymYfacs64pxTxbH1znW/NcArSmwpmG9IKE/TUVVQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
- "@babel/plugin-transform-optional-chaining": "^7.23.3"
+ "@babel/plugin-transform-optional-chaining": "^7.24.1"
}
},
"@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
- "version": "7.23.7",
- "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.23.7.tgz",
- "integrity": "sha512-LlRT7HgaifEpQA1ZgLVOIJZZFVPWN5iReq/7/JixwBtwcoeVGDBD53ZV28rrsLYOZs1Y/EHhA8N/Z6aazHR8cw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.24.1.tgz",
+ "integrity": "sha512-m9m/fXsXLiHfwdgydIFnpk+7jlVbnvlK5B2EKiPdLUb6WX654ZaaEWJUjk8TftRbZpK0XibovlLWX4KIZhV6jw==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-proposal-class-properties": {
@@ -29851,21 +29907,21 @@
}
},
"@babel/plugin-syntax-import-assertions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.23.3.tgz",
- "integrity": "sha512-lPgDSU+SJLK3xmFDTV2ZRQAiM7UuUjGidwBywFavObCiZc1BeAAcMtHJKUya92hPHO+at63JJPLygilZard8jw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.24.1.tgz",
+ "integrity": "sha512-IuwnI5XnuF189t91XbxmXeCDz3qs6iDRO7GJ++wcfgeXNs/8FmIlKcpDSXNVyuLQxlwvskmI3Ct73wUODkJBlQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-syntax-import-attributes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.23.3.tgz",
- "integrity": "sha512-pawnE0P9g10xgoP7yKr6CK63K2FMsTE+FZidZO/1PwRdzmAPVs+HS1mAURUsgaoxammTJvULUdIkEK0gOcU2tA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.24.1.tgz",
+ "integrity": "sha512-zhQTMH0X2nVLnb04tz+s7AMuasX8U0FnpE+nHTOhSOINjWMnopoZTxtIKsd45n4GQ/HIZLyfIpoul8e2m0DnRA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-syntax-import-meta": {
@@ -29987,157 +30043,157 @@
}
},
"@babel/plugin-transform-arrow-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.23.3.tgz",
- "integrity": "sha512-NzQcQrzaQPkaEwoTm4Mhyl8jI1huEL/WWIEvudjTCMJ9aBZNpsJbMASx7EQECtQQPS/DcnFpo0FIh3LvEO9cxQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.24.1.tgz",
+ "integrity": "sha512-ngT/3NkRhsaep9ck9uj2Xhv9+xB1zShY3tM3g6om4xxCELwCDN4g4Aq5dRn48+0hasAql7s2hdBOysCfNpr4fw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-async-generator-functions": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.23.9.tgz",
- "integrity": "sha512-8Q3veQEDGe14dTYuwagbRtwxQDnytyg1JFu4/HwEMETeofocrB0U0ejBJIXoeG/t2oXZ8kzCyI0ZZfbT80VFNQ==",
+ "version": "7.24.3",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.24.3.tgz",
+ "integrity": "sha512-Qe26CMYVjpQxJ8zxM1340JFNjZaF+ISWpr1Kt/jGo+ZTUzKkfw/pphEWbRCb+lmSM6k/TOgfYLvmbHkUQ0asIg==",
"dev": true,
"requires": {
"@babel/helper-environment-visitor": "^7.22.20",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20",
"@babel/plugin-syntax-async-generators": "^7.8.4"
}
},
"@babel/plugin-transform-async-to-generator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.23.3.tgz",
- "integrity": "sha512-A7LFsKi4U4fomjqXJlZg/u0ft/n8/7n7lpffUP/ZULx/DtV9SGlNKZolHH6PE8Xl1ngCc0M11OaeZptXVkfKSw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.24.1.tgz",
+ "integrity": "sha512-AawPptitRXp1y0n4ilKcGbRYWfbbzFWz2NqNu7dacYDtFtz0CMjG64b3LQsb3KIgnf4/obcUL78hfaOS7iCUfw==",
"dev": true,
"requires": {
- "@babel/helper-module-imports": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-module-imports": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-remap-async-to-generator": "^7.22.20"
}
},
"@babel/plugin-transform-block-scoped-functions": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.23.3.tgz",
- "integrity": "sha512-vI+0sIaPIO6CNuM9Kk5VmXcMVRiOpDh7w2zZt9GXzmE/9KD70CUEVhvPR/etAeNK/FAEkhxQtXOzVF3EuRL41A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.24.1.tgz",
+ "integrity": "sha512-TWWC18OShZutrv9C6mye1xwtam+uNi2bnTOCBUd5sZxyHOiWbU6ztSROofIMrK84uweEZC219POICK/sTYwfgg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-block-scoping": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.23.4.tgz",
- "integrity": "sha512-0QqbP6B6HOh7/8iNR4CQU2Th/bbRtBp4KS9vcaZd1fZ0wSh5Fyssg0UCIHwxh+ka+pNDREbVLQnHCMHKZfPwfw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.24.5.tgz",
+ "integrity": "sha512-sMfBc3OxghjC95BkYrYocHL3NaOplrcaunblzwXhGmlPwpmfsxr4vK+mBBt49r+S240vahmv+kUxkeKgs+haCw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-class-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.23.3.tgz",
- "integrity": "sha512-uM+AN8yCIjDPccsKGlw271xjJtGii+xQIF/uMPS8H15L12jZTsLfF4o5vNO7d/oUguOyfdikHGc/yi9ge4SGIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.24.1.tgz",
+ "integrity": "sha512-OMLCXi0NqvJfORTaPQBwqLXHhb93wkBKZ4aNwMl6WtehO7ar+cmp+89iPEQPqxAnxsOKTaMcs3POz3rKayJ72g==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-class-static-block": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.23.4.tgz",
- "integrity": "sha512-nsWu/1M+ggti1SOALj3hfx5FXzAY06fwPJsUZD4/A5e1bWi46VUIWtD+kOX6/IdhXGsXBWllLFDSnqSCdUNydQ==",
+ "version": "7.24.4",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.24.4.tgz",
+ "integrity": "sha512-B8q7Pz870Hz/q9UgP8InNpY01CSLDSCyqX7zcRuv3FcPl87A2G17lASroHWaCtbdIcbYzOZ7kWmXFKbijMSmFg==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.4",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-class-static-block": "^7.14.5"
}
},
"@babel/plugin-transform-classes": {
- "version": "7.23.8",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.23.8.tgz",
- "integrity": "sha512-yAYslGsY1bX6Knmg46RjiCiNSwJKv2IUC8qOdYKqMMr0491SXFhcHqOdRDeCRohOOIzwN/90C6mQ9qAKgrP7dg==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.24.5.tgz",
+ "integrity": "sha512-gWkLP25DFj2dwe9Ck8uwMOpko4YsqyfZJrOmqqcegeDYEbp7rmn4U6UQZNj08UF6MaX39XenSpKRCvpDRBtZ7Q==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
"@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20",
- "@babel/helper-split-export-declaration": "^7.22.6",
+ "@babel/helper-plugin-utils": "^7.24.5",
+ "@babel/helper-replace-supers": "^7.24.1",
+ "@babel/helper-split-export-declaration": "^7.24.5",
"globals": "^11.1.0"
}
},
"@babel/plugin-transform-computed-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.23.3.tgz",
- "integrity": "sha512-dTj83UVTLw/+nbiHqQSFdwO9CbTtwq1DsDqm3CUEtDrZNET5rT5E6bIdTlOftDTDLMYxvxHNEYO4B9SLl8SLZw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.24.1.tgz",
+ "integrity": "sha512-5pJGVIUfJpOS+pAqBQd+QMaTD2vCL/HcePooON6pDpHgRp4gNRmzyHTPIkXntwKsq3ayUFVfJaIKPw2pOkOcTw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/template": "^7.22.15"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/template": "^7.24.0"
}
},
"@babel/plugin-transform-destructuring": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.23.3.tgz",
- "integrity": "sha512-n225npDqjDIr967cMScVKHXJs7rout1q+tt50inyBCPkyZ8KxeI6d+GIbSBTT/w/9WdlWDOej3V9HE5Lgk57gw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.24.5.tgz",
+ "integrity": "sha512-SZuuLyfxvsm+Ah57I/i1HVjveBENYK9ue8MJ7qkc7ndoNjqquJiElzA7f5yaAXjyW2hKojosOTAQQRX50bPSVg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-dotall-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.23.3.tgz",
- "integrity": "sha512-vgnFYDHAKzFaTVp+mneDsIEbnJ2Np/9ng9iviHw3P/KVcgONxpNULEW/51Z/BaFojG2GI2GwwXck5uV1+1NOYQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.24.1.tgz",
+ "integrity": "sha512-p7uUxgSoZwZ2lPNMzUkqCts3xlp8n+o05ikjy7gbtFJSt9gdU88jAmtfmOxHM14noQXBxfgzf2yRWECiNVhTCw==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-duplicate-keys": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.23.3.tgz",
- "integrity": "sha512-RrqQ+BQmU3Oyav3J+7/myfvRCq7Tbz+kKLLshUmMwNlDHExbGL7ARhajvoBJEvc+fCguPPu887N+3RRXBVKZUA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.24.1.tgz",
+ "integrity": "sha512-msyzuUnvsjsaSaocV6L7ErfNsa5nDWL1XKNnDePLgmz+WdU4w/J8+AxBMrWfi9m4IxfL5sZQKUPQKDQeeAT6lA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-dynamic-import": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.23.4.tgz",
- "integrity": "sha512-V6jIbLhdJK86MaLh4Jpghi8ho5fGzt3imHOBu/x0jlBaPYqDoWz4RDXjmMOfnh+JWNaQleEAByZLV0QzBT4YQQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.24.1.tgz",
+ "integrity": "sha512-av2gdSTyXcJVdI+8aFZsCAtR29xJt0S5tas+Ef8NvBNmD1a+N/3ecMLeMBgfcK+xzsjdLDT6oHt+DFPyeqUbDA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-dynamic-import": "^7.8.3"
}
},
"@babel/plugin-transform-exponentiation-operator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.23.3.tgz",
- "integrity": "sha512-5fhCsl1odX96u7ILKHBj4/Y8vipoqwsJMh4csSA8qFfxrZDEA4Ssku2DyNvMJSmZNOEBT750LfFPbtrnTP90BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.24.1.tgz",
+ "integrity": "sha512-U1yX13dVBSwS23DEAqU+Z/PkwE9/m7QQy8Y9/+Tdb8UWYaGNDYwTLi19wqIAiROr8sXVum9A/rtiH5H0boUcTw==",
"dev": true,
"requires": {
"@babel/helper-builder-binary-assignment-operator-visitor": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-export-namespace-from": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.23.4.tgz",
- "integrity": "sha512-GzuSBcKkx62dGzZI1WVgTWvkkz84FZO5TC5T8dl/Tht/rAla6Dg/Mz9Yhypg+ezVACf/rgDuQt3kbWEv7LdUDQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.24.1.tgz",
+ "integrity": "sha512-Ft38m/KFOyzKw2UaJFkWG9QnHPG/Q/2SkOrRk4pNBPg5IPZ+dOxcmkK5IyuBcxiNPyyYowPGUReyBvrvZs7IlQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3"
}
},
@@ -30152,105 +30208,105 @@
}
},
"@babel/plugin-transform-for-of": {
- "version": "7.23.6",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.23.6.tgz",
- "integrity": "sha512-aYH4ytZ0qSuBbpfhuofbg/e96oQ7U2w1Aw/UQmKT+1l39uEhUPoFS3fHevDc1G0OvewyDudfMKY1OulczHzWIw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.24.1.tgz",
+ "integrity": "sha512-OxBdcnF04bpdQdR3i4giHZNZQn7cm8RQKcSwA17wAAqEELo1ZOwp5FFgeptWUQXFyT9kwHo10aqqauYkRZPCAg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
}
},
"@babel/plugin-transform-function-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.23.3.tgz",
- "integrity": "sha512-I1QXp1LxIvt8yLaib49dRW5Okt7Q4oaxao6tFVKS/anCdEOMtYwWVKoiOA1p34GOWIZjUK0E+zCp7+l1pfQyiw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.24.1.tgz",
+ "integrity": "sha512-BXmDZpPlh7jwicKArQASrj8n22/w6iymRnvHYYd2zO30DbE277JO20/7yXJT3QxDPtiQiOxQBbZH4TpivNXIxA==",
"dev": true,
"requires": {
- "@babel/helper-compilation-targets": "^7.22.15",
+ "@babel/helper-compilation-targets": "^7.23.6",
"@babel/helper-function-name": "^7.23.0",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-json-strings": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.23.4.tgz",
- "integrity": "sha512-81nTOqM1dMwZ/aRXQ59zVubN9wHGqk6UtqRK+/q+ciXmRy8fSolhGVvG09HHRGo4l6fr/c4ZhXUQH0uFW7PZbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.24.1.tgz",
+ "integrity": "sha512-U7RMFmRvoasscrIFy5xA4gIp8iWnWubnKkKuUGJjsuOH7GfbMkB+XZzeslx2kLdEGdOJDamEmCqOks6e8nv8DQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-json-strings": "^7.8.3"
}
},
"@babel/plugin-transform-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.23.3.tgz",
- "integrity": "sha512-wZ0PIXRxnwZvl9AYpqNUxpZ5BiTGrYt7kueGQ+N5FiQ7RCOD4cm8iShd6S6ggfVIWaJf2EMk8eRzAh52RfP4rQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.24.1.tgz",
+ "integrity": "sha512-zn9pwz8U7nCqOYIiBaOxoQOtYmMODXTJnkxG4AtX8fPmnCRYWBOHD0qcpwS9e2VDSp1zNJYpdnFMIKb8jmwu6g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-logical-assignment-operators": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.23.4.tgz",
- "integrity": "sha512-Mc/ALf1rmZTP4JKKEhUwiORU+vcfarFVLfcFiolKUo6sewoxSEgl36ak5t+4WamRsNr6nzjZXQjM35WsU+9vbg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.24.1.tgz",
+ "integrity": "sha512-OhN6J4Bpz+hIBqItTeWJujDOfNP+unqv/NJgyhlpSqgBTPm37KkMmZV6SYcOj+pnDbdcl1qRGV/ZiIjX9Iy34w==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4"
}
},
"@babel/plugin-transform-member-expression-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.23.3.tgz",
- "integrity": "sha512-sC3LdDBDi5x96LA+Ytekz2ZPk8i/Ck+DEuDbRAll5rknJ5XRTSaPKEYwomLcs1AA8wg9b3KjIQRsnApj+q51Ag==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.24.1.tgz",
+ "integrity": "sha512-4ojai0KysTWXzHseJKa1XPNXKRbuUrhkOPY4rEGeR+7ChlJVKxFa3H3Bz+7tWaGKgJAXUWKOGmltN+u9B3+CVg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-modules-amd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.23.3.tgz",
- "integrity": "sha512-vJYQGxeKM4t8hYCKVBlZX/gtIY2I7mRGFNcm85sgXGMTBcoV3QdVtdpbcWEbzbfUIUZKwvgFT82mRvaQIebZzw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.24.1.tgz",
+ "integrity": "sha512-lAxNHi4HVtjnHd5Rxg3D5t99Xm6H7b04hUS7EHIXcUl2EV4yl1gWdqZrNzXnSrHveL9qMdbODlLF55mvgjAfaQ==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-modules-commonjs": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.23.3.tgz",
- "integrity": "sha512-aVS0F65LKsdNOtcz6FRCpE4OgsP2OFnW46qNxNIX9h3wuzaNcSQsJysuMwqSibC98HPrf2vCgtxKNwS0DAlgcA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.24.1.tgz",
+ "integrity": "sha512-szog8fFTUxBfw0b98gEWPaEqF42ZUD/T3bkynW/wtgx2p/XCP55WEsb+VosKceRSd6njipdZvNogqdtI4Q0chw==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-simple-access": "^7.22.5"
}
},
"@babel/plugin-transform-modules-systemjs": {
- "version": "7.23.9",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.23.9.tgz",
- "integrity": "sha512-KDlPRM6sLo4o1FkiSlXoAa8edLXFsKKIda779fbLrvmeuc3itnjCtaO6RrtoaANsIJANj+Vk1zqbZIMhkCAHVw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.24.1.tgz",
+ "integrity": "sha512-mqQ3Zh9vFO1Tpmlt8QPnbwGHzNz3lpNEMxQb1kAemn/erstyqw1r9KeOlOfo3y6xAnFEcOv2tSyrXfmMk+/YZA==",
"dev": true,
"requires": {
"@babel/helper-hoist-variables": "^7.22.5",
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-validator-identifier": "^7.22.20"
}
},
"@babel/plugin-transform-modules-umd": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.23.3.tgz",
- "integrity": "sha512-zHsy9iXX2nIsCBFPud3jKn1IRPWg3Ing1qOZgeKV39m1ZgIdpJqvlWVeiHBZC6ITRG0MfskhYe9cLgntfSFPIg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.24.1.tgz",
+ "integrity": "sha512-tuA3lpPj+5ITfcCluy6nWonSL7RvaG0AOTeAuvXqEKS34lnLzXpDb0dcP6K8jD0zWZFNDVly90AGFJPnm4fOYg==",
"dev": true,
"requires": {
"@babel/helper-module-transforms": "^7.23.3",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-named-capturing-groups-regex": {
@@ -30264,125 +30320,124 @@
}
},
"@babel/plugin-transform-new-target": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.23.3.tgz",
- "integrity": "sha512-YJ3xKqtJMAT5/TIZnpAR3I+K+WaDowYbN3xyxI8zxx/Gsypwf9B9h0VB+1Nh6ACAAPRS5NSRje0uVv5i79HYGQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.24.1.tgz",
+ "integrity": "sha512-/rurytBM34hYy0HKZQyA0nHbQgQNFm4Q/BOc9Hflxi2X3twRof7NaE5W46j4kQitm7SvACVRXsa6N/tSZxvPug==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-nullish-coalescing-operator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.23.4.tgz",
- "integrity": "sha512-jHE9EVVqHKAQx+VePv5LLGHjmHSJR76vawFPTdlxR/LVJPfOEGxREQwQfjuZEOPTwG92X3LINSh3M40Rv4zpVA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.24.1.tgz",
+ "integrity": "sha512-iQ+caew8wRrhCikO5DrUYx0mrmdhkaELgFa+7baMcVuhxIkN7oxt06CZ51D65ugIb1UWRQ8oQe+HXAVM6qHFjw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-nullish-coalescing-operator": "^7.8.3"
}
},
"@babel/plugin-transform-numeric-separator": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.23.4.tgz",
- "integrity": "sha512-mps6auzgwjRrwKEZA05cOwuDc9FAzoyFS4ZsG/8F43bTLf/TgkJg7QXOrPO1JO599iA3qgK9MXdMGOEC8O1h6Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.24.1.tgz",
+ "integrity": "sha512-7GAsGlK4cNL2OExJH1DzmDeKnRv/LXq0eLUSvudrehVA5Rgg4bIrqEUW29FbKMBRT0ztSqisv7kjP+XIC4ZMNw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-numeric-separator": "^7.10.4"
}
},
"@babel/plugin-transform-object-rest-spread": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.0.tgz",
- "integrity": "sha512-y/yKMm7buHpFFXfxVFS4Vk1ToRJDilIa6fKRioB9Vjichv58TDGXTvqV0dN7plobAmTW5eSEGXDngE+Mm+uO+w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.24.5.tgz",
+ "integrity": "sha512-7EauQHszLGM3ay7a161tTQH7fj+3vVM/gThlz5HpFtnygTxjrlvoeq7MPVA1Vy9Q555OB8SnAOsMkLShNkkrHA==",
"dev": true,
"requires": {
- "@babel/compat-data": "^7.23.5",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-object-rest-spread": "^7.8.3",
- "@babel/plugin-transform-parameters": "^7.23.3"
+ "@babel/plugin-transform-parameters": "^7.24.5"
}
},
"@babel/plugin-transform-object-super": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.23.3.tgz",
- "integrity": "sha512-BwQ8q0x2JG+3lxCVFohg+KbQM7plfpBwThdW9A6TMtWwLsbDA01Ek2Zb/AgDN39BiZsExm4qrXxjk+P1/fzGrA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.24.1.tgz",
+ "integrity": "sha512-oKJqR3TeI5hSLRxudMjFQ9re9fBVUU0GICqM3J1mi8MqlhVr6hC/ZN4ttAyMuQR6EZZIY6h/exe5swqGNNIkWQ==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-replace-supers": "^7.22.20"
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-replace-supers": "^7.24.1"
}
},
"@babel/plugin-transform-optional-catch-binding": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.23.4.tgz",
- "integrity": "sha512-XIq8t0rJPHf6Wvmbn9nFxU6ao4c7WhghTR5WyV8SrJfUFzyxhCm4nhC+iAp3HFhbAKLfYpgzhJ6t4XCtVwqO5A==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.24.1.tgz",
+ "integrity": "sha512-oBTH7oURV4Y+3EUrf6cWn1OHio3qG/PVwO5J03iSJmBg6m2EhKjkAu/xuaXaYwWW9miYtvbWv4LNf0AmR43LUA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/plugin-syntax-optional-catch-binding": "^7.8.3"
}
},
"@babel/plugin-transform-optional-chaining": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.23.4.tgz",
- "integrity": "sha512-ZU8y5zWOfjM5vZ+asjgAPwDaBjJzgufjES89Rs4Lpq63O300R/kOz30WCLo6BxxX6QVEilwSlpClnG5cZaikTA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.24.5.tgz",
+ "integrity": "sha512-xWCkmwKT+ihmA6l7SSTpk8e4qQl/274iNbSKRRS8mpqFR32ksy36+a+LWY8OXCCEefF8WFlnOHVsaDI2231wBg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5",
"@babel/plugin-syntax-optional-chaining": "^7.8.3"
}
},
"@babel/plugin-transform-parameters": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.23.3.tgz",
- "integrity": "sha512-09lMt6UsUb3/34BbECKVbVwrT9bO6lILWln237z7sLaWnMsTi7Yc9fhX5DLpkJzAGfaReXI22wP41SZmnAA3Vw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.24.5.tgz",
+ "integrity": "sha512-9Co00MqZ2aoky+4j2jhofErthm6QVLKbpQrvz20c3CH9KQCLHyNB+t2ya4/UrRpQGR+Wrwjg9foopoeSdnHOkA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-private-methods": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.23.3.tgz",
- "integrity": "sha512-UzqRcRtWsDMTLrRWFvUBDwmw06tCQH9Rl1uAjfh6ijMSmGYQ+fpdB+cnqRC8EMh5tuuxSv0/TejGL+7vyj+50g==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.24.1.tgz",
+ "integrity": "sha512-tGvisebwBO5em4PaYNqt4fkw56K2VALsAbAakY0FjTYqJp7gfdrgr7YX76Or8/cpik0W6+tj3rZ0uHU9Oil4tw==",
"dev": true,
"requires": {
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-create-class-features-plugin": "^7.24.1",
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-private-property-in-object": {
- "version": "7.23.4",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.23.4.tgz",
- "integrity": "sha512-9G3K1YqTq3F4Vt88Djx1UZ79PDyj+yKRnUy7cZGSMe+a7jkwD259uKKuUzQlPkGam7R+8RJwh5z4xO27fA1o2A==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.24.5.tgz",
+ "integrity": "sha512-JM4MHZqnWR04jPMujQDTBVRnqxpLLpx2tkn7iPn+Hmsc0Gnb79yvRWOkvqFOx3Z7P7VxiRIR22c4eGSNj87OBQ==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-create-class-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-create-class-features-plugin": "^7.24.5",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/plugin-syntax-private-property-in-object": "^7.14.5"
}
},
"@babel/plugin-transform-property-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.23.3.tgz",
- "integrity": "sha512-jR3Jn3y7cZp4oEWPFAlRsSWjxKe4PZILGBSd4nis1TsC5qeSpb+nrtihJuDhNI7QHiVbUaiXa0X2RZY3/TI6Nw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.24.1.tgz",
+ "integrity": "sha512-LetvD7CrHmEx0G442gOomRr66d7q8HzzGGr4PMHGr+5YIm6++Yke+jxj246rpvsbyhJwCLxcTn6zW1P1BSenqA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-react-display-name": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.23.3.tgz",
- "integrity": "sha512-GnvhtVfA2OAtzdX58FJxU19rhoGeQzyVndw3GgtdECQvQFXPEZIOVULHVZGAYmOgmqjXpVpfocAbSjh99V/Fqw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-display-name/-/plugin-transform-react-display-name-7.24.1.tgz",
+ "integrity": "sha512-mvoQg2f9p2qlpDQRBC7M3c3XTr0k7cp/0+kFKKO/7Gtu0LSw16eKB+Fabe2bDT/UpsyasTBBkAnbdsLrkD5XMw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-react-jsx": {
@@ -30408,78 +30463,78 @@
}
},
"@babel/plugin-transform-react-pure-annotations": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.23.3.tgz",
- "integrity": "sha512-qMFdSS+TUhB7Q/3HVPnEdYJDQIk57jkntAwSuz9xfSE4n+3I+vHYCli3HoHawN1Z3RfCz/y1zXA/JXjG6cVImQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-react-pure-annotations/-/plugin-transform-react-pure-annotations-7.24.1.tgz",
+ "integrity": "sha512-+pWEAaDJvSm9aFvJNpLiM2+ktl2Sn2U5DdyiWdZBxmLc6+xGt88dvFqsHiAiDS+8WqUwbDfkKz9jRxK3M0k+kA==",
"dev": true,
"requires": {
"@babel/helper-annotate-as-pure": "^7.22.5",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-regenerator": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.23.3.tgz",
- "integrity": "sha512-KP+75h0KghBMcVpuKisx3XTu9Ncut8Q8TuvGO4IhY+9D5DFEckQefOuIsB/gQ2tG71lCke4NMrtIPS8pOj18BQ==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.24.1.tgz",
+ "integrity": "sha512-sJwZBCzIBE4t+5Q4IGLaaun5ExVMRY0lYwos/jNecjMrVCygCdph3IKv0tkP5Fc87e/1+bebAmEAGBfnRD+cnw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"regenerator-transform": "^0.15.2"
}
},
"@babel/plugin-transform-reserved-words": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.23.3.tgz",
- "integrity": "sha512-QnNTazY54YqgGxwIexMZva9gqbPa15t/x9VS+0fsEFWplwVpXYZivtgl43Z1vMpc1bdPP2PP8siFeVcnFvA3Cg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.24.1.tgz",
+ "integrity": "sha512-JAclqStUfIwKN15HrsQADFgeZt+wexNQ0uLhuqvqAUFoqPMjEcFCYZBhq0LUdz6dZK/mD+rErhW71fbx8RYElg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-shorthand-properties": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.23.3.tgz",
- "integrity": "sha512-ED2fgqZLmexWiN+YNFX26fx4gh5qHDhn1O2gvEhreLW2iI63Sqm4llRLCXALKrCnbN4Jy0VcMQZl/SAzqug/jg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.24.1.tgz",
+ "integrity": "sha512-LyjVB1nsJ6gTTUKRjRWx9C1s9hE7dLfP/knKdrfeH9UPtAGjYGgxIbFfx7xyLIEWs7Xe1Gnf8EWiUqfjLhInZA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-spread": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.23.3.tgz",
- "integrity": "sha512-VvfVYlrlBVu+77xVTOAoxQ6mZbnIq5FM0aGBSFEcIh03qHf+zNqA4DC/3XMUozTg7bZV3e3mZQ0i13VB6v5yUg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.24.1.tgz",
+ "integrity": "sha512-KjmcIM+fxgY+KxPVbjelJC6hrH1CgtPmTvdXAfn3/a9CnWGSTY7nH4zm5+cjmWJybdcPSsD0++QssDsjcpe47g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
+ "@babel/helper-plugin-utils": "^7.24.0",
"@babel/helper-skip-transparent-expression-wrappers": "^7.22.5"
}
},
"@babel/plugin-transform-sticky-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.23.3.tgz",
- "integrity": "sha512-HZOyN9g+rtvnOU3Yh7kSxXrKbzgrm5X4GncPY1QOquu7epga5MxKHVpYu2hvQnry/H+JjckSYRb93iNfsioAGg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.24.1.tgz",
+ "integrity": "sha512-9v0f1bRXgPVcPrngOQvLXeGNNVLc8UjMVfebo9ka0WF3/7+aVUHmaJVT3sa0XCzEFioPfPHZiOcYG9qOsH63cw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-template-literals": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.23.3.tgz",
- "integrity": "sha512-Flok06AYNp7GV2oJPZZcP9vZdszev6vPBkHLwxwSpaIqx75wn6mUd3UFWsSsA0l8nXAKkyCmL/sR02m8RYGeHg==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.24.1.tgz",
+ "integrity": "sha512-WRkhROsNzriarqECASCNu/nojeXCDTE/F2HmRgOzi7NGvyfYGq1NEjKBK3ckLfRgGc6/lPAqP0vDOSw3YtG34g==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-typeof-symbol": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.23.3.tgz",
- "integrity": "sha512-4t15ViVnaFdrPC74be1gXBSMzXk3B4Us9lP7uLRQHTFpV5Dvt33pn+2MyyNxmN3VTTm3oTrZVMUmuw3oBnQ2oQ==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.24.5.tgz",
+ "integrity": "sha512-UTGnhYVZtTAjdwOTzT+sCyXmTn8AhaxOS/MjG9REclZ6ULHWF9KoCZur0HSGU7hk8PdBFKKbYe6+gqdXWz84Jg==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.5"
}
},
"@babel/plugin-transform-typescript": {
@@ -30495,42 +30550,42 @@
}
},
"@babel/plugin-transform-unicode-escapes": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.23.3.tgz",
- "integrity": "sha512-OMCUx/bU6ChE3r4+ZdylEqAjaQgHAgipgW8nsCfu5pGqDcFytVd91AwRvUJSBZDz0exPGgnjoqhgRYLRjFZc9Q==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.24.1.tgz",
+ "integrity": "sha512-RlkVIcWT4TLI96zM660S877E7beKlQw7Ig+wqkKBiWfj0zH5Q4h50q6er4wzZKRNSYpfo6ILJ+hrJAGSX2qcNw==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-property-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.23.3.tgz",
- "integrity": "sha512-KcLIm+pDZkWZQAFJ9pdfmh89EwVfmNovFBcXko8szpBeF8z68kWIPeKlmSOkT9BXJxs2C0uk+5LxoxIv62MROA==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.24.1.tgz",
+ "integrity": "sha512-Ss4VvlfYV5huWApFsF8/Sq0oXnGO+jB+rijFEFugTd3cwSObUSnUi88djgR5528Csl0uKlrI331kRqe56Ov2Ng==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.23.3.tgz",
- "integrity": "sha512-wMHpNA4x2cIA32b/ci3AfwNgheiva2W0WUKWTK7vBHBhDKfPsc5cFGNWm69WBqpwd86u1qwZ9PWevKqm1A3yAw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.24.1.tgz",
+ "integrity": "sha512-2A/94wgZgxfTsiLaQ2E36XAOdcZmGAaEEgVmxQWwZXWkGhvoHbaqXcKnU8zny4ycpu3vNqg0L/PcCiYtHtA13g==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/plugin-transform-unicode-sets-regex": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.23.3.tgz",
- "integrity": "sha512-W7lliA/v9bNR83Qc3q1ip9CQMZ09CcHDbHfbLRDNuAhn1Mvkr1ZNF7hPmztMQvtTGVLJ9m8IZqWsTkXOml8dbw==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.24.1.tgz",
+ "integrity": "sha512-fqj4WuzzS+ukpgerpAoOnMfQXwUHFxXUZUE84oL2Kao2N8uSlvcpnAidKASgsNgzZHBsHWvcm8s9FPWUhAb8fA==",
"dev": true,
"requires": {
"@babel/helper-create-regexp-features-plugin": "^7.22.15",
- "@babel/helper-plugin-utils": "^7.22.5"
+ "@babel/helper-plugin-utils": "^7.24.0"
}
},
"@babel/polyfill": {
@@ -30544,26 +30599,27 @@
}
},
"@babel/preset-env": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.0.tgz",
- "integrity": "sha512-ZxPEzV9IgvGn73iK0E6VB9/95Nd7aMFpbE0l8KQFDG70cOV9IxRP7Y2FUPmlK0v6ImlLqYX50iuZ3ZTVhOF2lA==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.24.5.tgz",
+ "integrity": "sha512-UGK2ifKtcC8i5AI4cH+sbLLuLc2ktYSFJgBAXorKAsHUZmrQ1q6aQ6i3BvU24wWs2AAKqQB6kq3N9V9Gw1HiMQ==",
"dev": true,
"requires": {
- "@babel/compat-data": "^7.23.5",
+ "@babel/compat-data": "^7.24.4",
"@babel/helper-compilation-targets": "^7.23.6",
- "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-plugin-utils": "^7.24.5",
"@babel/helper-validator-option": "^7.23.5",
- "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.23.3",
- "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.23.3",
- "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.23.7",
+ "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.24.5",
+ "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.24.1",
+ "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.24.1",
+ "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.24.1",
"@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
"@babel/plugin-syntax-async-generators": "^7.8.4",
"@babel/plugin-syntax-class-properties": "^7.12.13",
"@babel/plugin-syntax-class-static-block": "^7.14.5",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
"@babel/plugin-syntax-export-namespace-from": "^7.8.3",
- "@babel/plugin-syntax-import-assertions": "^7.23.3",
- "@babel/plugin-syntax-import-attributes": "^7.23.3",
+ "@babel/plugin-syntax-import-assertions": "^7.24.1",
+ "@babel/plugin-syntax-import-attributes": "^7.24.1",
"@babel/plugin-syntax-import-meta": "^7.10.4",
"@babel/plugin-syntax-json-strings": "^7.8.3",
"@babel/plugin-syntax-logical-assignment-operators": "^7.10.4",
@@ -30575,58 +30631,58 @@
"@babel/plugin-syntax-private-property-in-object": "^7.14.5",
"@babel/plugin-syntax-top-level-await": "^7.14.5",
"@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
- "@babel/plugin-transform-arrow-functions": "^7.23.3",
- "@babel/plugin-transform-async-generator-functions": "^7.23.9",
- "@babel/plugin-transform-async-to-generator": "^7.23.3",
- "@babel/plugin-transform-block-scoped-functions": "^7.23.3",
- "@babel/plugin-transform-block-scoping": "^7.23.4",
- "@babel/plugin-transform-class-properties": "^7.23.3",
- "@babel/plugin-transform-class-static-block": "^7.23.4",
- "@babel/plugin-transform-classes": "^7.23.8",
- "@babel/plugin-transform-computed-properties": "^7.23.3",
- "@babel/plugin-transform-destructuring": "^7.23.3",
- "@babel/plugin-transform-dotall-regex": "^7.23.3",
- "@babel/plugin-transform-duplicate-keys": "^7.23.3",
- "@babel/plugin-transform-dynamic-import": "^7.23.4",
- "@babel/plugin-transform-exponentiation-operator": "^7.23.3",
- "@babel/plugin-transform-export-namespace-from": "^7.23.4",
- "@babel/plugin-transform-for-of": "^7.23.6",
- "@babel/plugin-transform-function-name": "^7.23.3",
- "@babel/plugin-transform-json-strings": "^7.23.4",
- "@babel/plugin-transform-literals": "^7.23.3",
- "@babel/plugin-transform-logical-assignment-operators": "^7.23.4",
- "@babel/plugin-transform-member-expression-literals": "^7.23.3",
- "@babel/plugin-transform-modules-amd": "^7.23.3",
- "@babel/plugin-transform-modules-commonjs": "^7.23.3",
- "@babel/plugin-transform-modules-systemjs": "^7.23.9",
- "@babel/plugin-transform-modules-umd": "^7.23.3",
+ "@babel/plugin-transform-arrow-functions": "^7.24.1",
+ "@babel/plugin-transform-async-generator-functions": "^7.24.3",
+ "@babel/plugin-transform-async-to-generator": "^7.24.1",
+ "@babel/plugin-transform-block-scoped-functions": "^7.24.1",
+ "@babel/plugin-transform-block-scoping": "^7.24.5",
+ "@babel/plugin-transform-class-properties": "^7.24.1",
+ "@babel/plugin-transform-class-static-block": "^7.24.4",
+ "@babel/plugin-transform-classes": "^7.24.5",
+ "@babel/plugin-transform-computed-properties": "^7.24.1",
+ "@babel/plugin-transform-destructuring": "^7.24.5",
+ "@babel/plugin-transform-dotall-regex": "^7.24.1",
+ "@babel/plugin-transform-duplicate-keys": "^7.24.1",
+ "@babel/plugin-transform-dynamic-import": "^7.24.1",
+ "@babel/plugin-transform-exponentiation-operator": "^7.24.1",
+ "@babel/plugin-transform-export-namespace-from": "^7.24.1",
+ "@babel/plugin-transform-for-of": "^7.24.1",
+ "@babel/plugin-transform-function-name": "^7.24.1",
+ "@babel/plugin-transform-json-strings": "^7.24.1",
+ "@babel/plugin-transform-literals": "^7.24.1",
+ "@babel/plugin-transform-logical-assignment-operators": "^7.24.1",
+ "@babel/plugin-transform-member-expression-literals": "^7.24.1",
+ "@babel/plugin-transform-modules-amd": "^7.24.1",
+ "@babel/plugin-transform-modules-commonjs": "^7.24.1",
+ "@babel/plugin-transform-modules-systemjs": "^7.24.1",
+ "@babel/plugin-transform-modules-umd": "^7.24.1",
"@babel/plugin-transform-named-capturing-groups-regex": "^7.22.5",
- "@babel/plugin-transform-new-target": "^7.23.3",
- "@babel/plugin-transform-nullish-coalescing-operator": "^7.23.4",
- "@babel/plugin-transform-numeric-separator": "^7.23.4",
- "@babel/plugin-transform-object-rest-spread": "^7.24.0",
- "@babel/plugin-transform-object-super": "^7.23.3",
- "@babel/plugin-transform-optional-catch-binding": "^7.23.4",
- "@babel/plugin-transform-optional-chaining": "^7.23.4",
- "@babel/plugin-transform-parameters": "^7.23.3",
- "@babel/plugin-transform-private-methods": "^7.23.3",
- "@babel/plugin-transform-private-property-in-object": "^7.23.4",
- "@babel/plugin-transform-property-literals": "^7.23.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
- "@babel/plugin-transform-reserved-words": "^7.23.3",
- "@babel/plugin-transform-shorthand-properties": "^7.23.3",
- "@babel/plugin-transform-spread": "^7.23.3",
- "@babel/plugin-transform-sticky-regex": "^7.23.3",
- "@babel/plugin-transform-template-literals": "^7.23.3",
- "@babel/plugin-transform-typeof-symbol": "^7.23.3",
- "@babel/plugin-transform-unicode-escapes": "^7.23.3",
- "@babel/plugin-transform-unicode-property-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-regex": "^7.23.3",
- "@babel/plugin-transform-unicode-sets-regex": "^7.23.3",
+ "@babel/plugin-transform-new-target": "^7.24.1",
+ "@babel/plugin-transform-nullish-coalescing-operator": "^7.24.1",
+ "@babel/plugin-transform-numeric-separator": "^7.24.1",
+ "@babel/plugin-transform-object-rest-spread": "^7.24.5",
+ "@babel/plugin-transform-object-super": "^7.24.1",
+ "@babel/plugin-transform-optional-catch-binding": "^7.24.1",
+ "@babel/plugin-transform-optional-chaining": "^7.24.5",
+ "@babel/plugin-transform-parameters": "^7.24.5",
+ "@babel/plugin-transform-private-methods": "^7.24.1",
+ "@babel/plugin-transform-private-property-in-object": "^7.24.5",
+ "@babel/plugin-transform-property-literals": "^7.24.1",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
+ "@babel/plugin-transform-reserved-words": "^7.24.1",
+ "@babel/plugin-transform-shorthand-properties": "^7.24.1",
+ "@babel/plugin-transform-spread": "^7.24.1",
+ "@babel/plugin-transform-sticky-regex": "^7.24.1",
+ "@babel/plugin-transform-template-literals": "^7.24.1",
+ "@babel/plugin-transform-typeof-symbol": "^7.24.5",
+ "@babel/plugin-transform-unicode-escapes": "^7.24.1",
+ "@babel/plugin-transform-unicode-property-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-regex": "^7.24.1",
+ "@babel/plugin-transform-unicode-sets-regex": "^7.24.1",
"@babel/preset-modules": "0.1.6-no-external-plugins",
- "babel-plugin-polyfill-corejs2": "^0.4.8",
- "babel-plugin-polyfill-corejs3": "^0.9.0",
- "babel-plugin-polyfill-regenerator": "^0.5.5",
+ "babel-plugin-polyfill-corejs2": "^0.4.10",
+ "babel-plugin-polyfill-corejs3": "^0.10.4",
+ "babel-plugin-polyfill-regenerator": "^0.6.1",
"core-js-compat": "^3.31.0",
"semver": "^6.3.1"
}
@@ -30654,17 +30710,17 @@
}
},
"@babel/preset-react": {
- "version": "7.23.3",
- "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.23.3.tgz",
- "integrity": "sha512-tbkHOS9axH6Ysf2OUEqoSZ6T3Fa2SrNH6WTWSPBboxKzdxNc9qOICeLXkNG0ZEwbQ1HY8liwOce4aN/Ceyuq6w==",
+ "version": "7.24.1",
+ "resolved": "https://registry.npmjs.org/@babel/preset-react/-/preset-react-7.24.1.tgz",
+ "integrity": "sha512-eFa8up2/8cZXLIpkafhaADTXSnl7IsUFCYenRWrARBz0/qZwcT0RBXpys0LJU4+WfPoF2ZG6ew6s2V6izMCwRA==",
"dev": true,
"requires": {
- "@babel/helper-plugin-utils": "^7.22.5",
- "@babel/helper-validator-option": "^7.22.15",
- "@babel/plugin-transform-react-display-name": "^7.23.3",
- "@babel/plugin-transform-react-jsx": "^7.22.15",
+ "@babel/helper-plugin-utils": "^7.24.0",
+ "@babel/helper-validator-option": "^7.23.5",
+ "@babel/plugin-transform-react-display-name": "^7.24.1",
+ "@babel/plugin-transform-react-jsx": "^7.23.4",
"@babel/plugin-transform-react-jsx-development": "^7.22.5",
- "@babel/plugin-transform-react-pure-annotations": "^7.23.3"
+ "@babel/plugin-transform-react-pure-annotations": "^7.24.1"
}
},
"@babel/preset-typescript": {
@@ -30728,31 +30784,31 @@
}
},
"@babel/traverse": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.0.tgz",
- "integrity": "sha512-HfuJlI8qq3dEDmNU5ChzzpZRWq+oxCZQyMzIMEqLho+AQnhMnKQUzH6ydo3RBl/YjPCuk68Y6s0Gx0AeyULiWw==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.24.5.tgz",
+ "integrity": "sha512-7aaBLeDQ4zYcUFDUD41lJc1fG8+5IU9DaNSJAgal866FGvmD5EbWQgnEC6kO1gGLsX0esNkfnJSndbTXA3r7UA==",
"dev": true,
"requires": {
- "@babel/code-frame": "^7.23.5",
- "@babel/generator": "^7.23.6",
+ "@babel/code-frame": "^7.24.2",
+ "@babel/generator": "^7.24.5",
"@babel/helper-environment-visitor": "^7.22.20",
"@babel/helper-function-name": "^7.23.0",
"@babel/helper-hoist-variables": "^7.22.5",
- "@babel/helper-split-export-declaration": "^7.22.6",
- "@babel/parser": "^7.24.0",
- "@babel/types": "^7.24.0",
+ "@babel/helper-split-export-declaration": "^7.24.5",
+ "@babel/parser": "^7.24.5",
+ "@babel/types": "^7.24.5",
"debug": "^4.3.1",
"globals": "^11.1.0"
}
},
"@babel/types": {
- "version": "7.24.0",
- "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.0.tgz",
- "integrity": "sha512-+j7a5c253RfKh8iABBhywc8NSfP5LURe7Uh4qpsh6jc+aLJguvmIUBdjSdEMQv2bENrCR5MfRdjGo7vzS/ob7w==",
+ "version": "7.24.5",
+ "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.24.5.tgz",
+ "integrity": "sha512-6mQNsaLeXTw0nxYUYu+NSa4Hx4BlF1x1x8/PMFbiR+GBSr+2DkECc69b8hgy2frEodNcvPffeH8YfWd3LI6jhQ==",
"dev": true,
"requires": {
- "@babel/helper-string-parser": "^7.23.4",
- "@babel/helper-validator-identifier": "^7.22.20",
+ "@babel/helper-string-parser": "^7.24.1",
+ "@babel/helper-validator-identifier": "^7.24.5",
"to-fast-properties": "^2.0.0"
}
},
@@ -31020,14 +31076,14 @@
"dev": true
},
"@jridgewell/gen-mapping": {
- "version": "0.3.3",
- "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.3.tgz",
- "integrity": "sha512-HLhSWOLRi875zjjMG/r+Nv0oCW8umGb0BgEhyX3dDX3egwZtB8PqLnjz3yedt8R5StBrzcg4aBpnh8UA9D1BoQ==",
+ "version": "0.3.5",
+ "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.5.tgz",
+ "integrity": "sha512-IzL8ZoEDIBRWEzlCcRhOaCupYyN5gdIK+Q6fbFdPDg6HqX6jpkItn7DFIpW9LQzXG6Df9sA7+OKnq0qlz/GaQg==",
"dev": true,
"requires": {
- "@jridgewell/set-array": "^1.0.1",
+ "@jridgewell/set-array": "^1.2.1",
"@jridgewell/sourcemap-codec": "^1.4.10",
- "@jridgewell/trace-mapping": "^0.3.9"
+ "@jridgewell/trace-mapping": "^0.3.24"
}
},
"@jridgewell/resolve-uri": {
@@ -31037,9 +31093,9 @@
"dev": true
},
"@jridgewell/set-array": {
- "version": "1.1.2",
- "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.1.2.tgz",
- "integrity": "sha512-xnkseuNADM0gt2bs+BvhO0p78Mk762YnZdsuzFV018NoG1Sj1SCQvpSqa7XUaTam5vAGasABV9qXASMKnFMwMw==",
+ "version": "1.2.1",
+ "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.2.1.tgz",
+ "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
"dev": true
},
"@jridgewell/source-map": {
@@ -31059,9 +31115,9 @@
"dev": true
},
"@jridgewell/trace-mapping": {
- "version": "0.3.22",
- "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.22.tgz",
- "integrity": "sha512-Wf963MzWtA2sjrNt+g18IAln9lKnlRp+K2eH4jjIoF1wYeq3aMREpG09xhlhdzS0EjwU7qmUJYangWa+151vZw==",
+ "version": "0.3.25",
+ "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
+ "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
"dev": true,
"requires": {
"@jridgewell/resolve-uri": "^3.1.0",
@@ -37212,9 +37268,9 @@
"dev": true
},
"@webassemblyjs/ast": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.11.6.tgz",
- "integrity": "sha512-IN1xI7PwOvLPgjcf180gC1bqn3q/QaOCwYUahIOhbYUu8KA/3tw2RT/T0Gidi1l7Hhj5D/INhJxiICObqpMu4Q==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.12.1.tgz",
+ "integrity": "sha512-EKfMUOPRRUTy5UII4qJDGPpqfwjOmZ5jeGFwid9mnoqIFK+e0vqoi1qH56JpmZSzEL53jKnNzScdmftJyG5xWg==",
"dev": true,
"requires": {
"@webassemblyjs/helper-numbers": "1.11.6",
@@ -37234,9 +37290,9 @@
"dev": true
},
"@webassemblyjs/helper-buffer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.11.6.tgz",
- "integrity": "sha512-z3nFzdcp1mb8nEOFFk8DrYLpHvhKC3grJD2ardfKOzmbmJvEf/tPIqCY+sNcwZIY8ZD7IkB2l7/pqhUhqm7hLA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.12.1.tgz",
+ "integrity": "sha512-nzJwQw99DNDKr9BVCOZcLuJJUlqkJh+kVzVl6Fmq/tI5ZtEyWT1KZMyOXltXLZJmDtvLCDgwsyrkohEtopTXCw==",
"dev": true
},
"@webassemblyjs/helper-code-frame": {
@@ -37330,15 +37386,15 @@
"dev": true
},
"@webassemblyjs/helper-wasm-section": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.11.6.tgz",
- "integrity": "sha512-LPpZbSOwTpEC2cgn4hTydySy1Ke+XEu+ETXuoyvuyezHO3Kjdu90KK95Sh9xTbmjrCsUwvWwCOQQNta37VrS9g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.12.1.tgz",
+ "integrity": "sha512-Jif4vfB6FJlUlSbgEMHUyk1j234GTNG9dBJ4XJdOySoj518Xj0oGsNi59cUQF4RRMS9ouBUxDDdyBVfPTypa5g==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6"
+ "@webassemblyjs/wasm-gen": "1.12.1"
}
},
"@webassemblyjs/ieee754": {
@@ -37366,28 +37422,28 @@
"dev": true
},
"@webassemblyjs/wasm-edit": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.11.6.tgz",
- "integrity": "sha512-Ybn2I6fnfIGuCR+Faaz7YcvtBKxvoLV3Lebn1tM4o/IAJzmi9AWYIPWpyBfU8cC+JxAO57bk4+zdsTjJR+VTOw==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.12.1.tgz",
+ "integrity": "sha512-1DuwbVvADvS5mGnXbE+c9NfA8QRcZ6iKquqjjmR10k6o+zzsRVesil54DKexiowcFCPdr/Q0qaMgB01+SQ1u6g==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
- "@webassemblyjs/helper-wasm-section": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-opt": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6",
- "@webassemblyjs/wast-printer": "1.11.6"
+ "@webassemblyjs/helper-wasm-section": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-opt": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1",
+ "@webassemblyjs/wast-printer": "1.12.1"
}
},
"@webassemblyjs/wasm-gen": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.11.6.tgz",
- "integrity": "sha512-3XOqkZP/y6B4F0PBAXvI1/bky7GryoogUtfwExeP/v7Nzwo1QLcq5oQmpKlftZLbT+ERUOAZVQjuNVak6UXjPA==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.12.1.tgz",
+ "integrity": "sha512-TDq4Ojh9fcohAw6OIMXqiIcTq5KUXTGRkVxbSo1hQnSy6lAM5GSdfwWeSxpAo0YzgsgF182E/U0mDNhuA0tW7w==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
"@webassemblyjs/leb128": "1.11.6",
@@ -37395,24 +37451,24 @@
}
},
"@webassemblyjs/wasm-opt": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.11.6.tgz",
- "integrity": "sha512-cOrKuLRE7PCe6AsOVl7WasYf3wbSo4CeOk6PkrjS7g57MFfVUF9u6ysQBBODX0LdgSvQqRiGz3CXvIDKcPNy4g==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.12.1.tgz",
+ "integrity": "sha512-Jg99j/2gG2iaz3hijw857AVYekZe2SAskcqlWIZXjji5WStnOpVoat3gQfT/Q5tb2djnCjBtMocY/Su1GfxPBg==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
- "@webassemblyjs/helper-buffer": "1.11.6",
- "@webassemblyjs/wasm-gen": "1.11.6",
- "@webassemblyjs/wasm-parser": "1.11.6"
+ "@webassemblyjs/ast": "1.12.1",
+ "@webassemblyjs/helper-buffer": "1.12.1",
+ "@webassemblyjs/wasm-gen": "1.12.1",
+ "@webassemblyjs/wasm-parser": "1.12.1"
}
},
"@webassemblyjs/wasm-parser": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.11.6.tgz",
- "integrity": "sha512-6ZwPeGzMJM3Dqp3hCsLgESxBGtT/OeCvCZ4TA1JUPYgmhAx38tTPR9JaKy0S5H3evQpO/h2uWs2j6Yc/fjkpTQ==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.12.1.tgz",
+ "integrity": "sha512-xikIi7c2FHXysxXe3COrVUPSheuBtpcfhbpFj4gmu7KRLYOzANztwUU0IbsqvMqzuNK2+glRGWCEqZo1WCLyAQ==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@webassemblyjs/helper-api-error": "1.11.6",
"@webassemblyjs/helper-wasm-bytecode": "1.11.6",
"@webassemblyjs/ieee754": "1.11.6",
@@ -37466,12 +37522,12 @@
}
},
"@webassemblyjs/wast-printer": {
- "version": "1.11.6",
- "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.11.6.tgz",
- "integrity": "sha512-JM7AhRcE+yW2GWYaKeHL5vt4xqee5N2WcezptmgyhNS+ScggqcT1OtXykhAb13Sn5Yas0j2uv9tHgrjwvzAP4A==",
+ "version": "1.12.1",
+ "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.12.1.tgz",
+ "integrity": "sha512-+X4WAlOisVWQMikjbcvY2e0rwPsKQ9F688lksZhBcPycBBuii3O7m8FACbDMWDojpAqvjIncrG8J0XHKyQfVeA==",
"dev": true,
"requires": {
- "@webassemblyjs/ast": "1.11.6",
+ "@webassemblyjs/ast": "1.12.1",
"@xtuc/long": "4.2.2"
}
},
@@ -38211,33 +38267,33 @@
"dev": true
},
"babel-plugin-polyfill-corejs2": {
- "version": "0.4.8",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.8.tgz",
- "integrity": "sha512-OtIuQfafSzpo/LhnJaykc0R/MMnuLSSVjVYy9mHArIZ9qTCSZ6TpWCuEKZYVoN//t8HqBNScHrOtCrIK5IaGLg==",
+ "version": "0.4.11",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.11.tgz",
+ "integrity": "sha512-sMEJ27L0gRHShOh5G54uAAPaiCOygY/5ratXuiyb2G46FmlSpc9eFCzYVyDiPxfNbwzA7mYahmjQc5q+CZQ09Q==",
"dev": true,
"requires": {
"@babel/compat-data": "^7.22.6",
- "@babel/helper-define-polyfill-provider": "^0.5.0",
+ "@babel/helper-define-polyfill-provider": "^0.6.2",
"semver": "^6.3.1"
}
},
"babel-plugin-polyfill-corejs3": {
- "version": "0.9.0",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.9.0.tgz",
- "integrity": "sha512-7nZPG1uzK2Ymhy/NbaOWTg3uibM2BmGASS4vHS4szRZAIR8R6GwA/xAujpdrXU5iyklrimWnLWU+BLF9suPTqg==",
+ "version": "0.10.4",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.10.4.tgz",
+ "integrity": "sha512-25J6I8NGfa5YkCDogHRID3fVCadIR8/pGl1/spvCkzb6lVn6SR3ojpx9nOn9iEBcUsjY24AmdKm5khcfKdylcg==",
"dev": true,
"requires": {
- "@babel/helper-define-polyfill-provider": "^0.5.0",
- "core-js-compat": "^3.34.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.1",
+ "core-js-compat": "^3.36.1"
}
},
"babel-plugin-polyfill-regenerator": {
- "version": "0.5.5",
- "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.5.5.tgz",
- "integrity": "sha512-OJGYZlhLqBh2DDHeqAxWB1XIvr49CxiJ2gIt61/PU55CQK4Z58OzMqjDe1zwQdQk+rBYsRc+1rJmdajM3gimHg==",
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.2.tgz",
+ "integrity": "sha512-2R25rQZWP63nGwaAswvDazbPXfrM3HwVoBXK6HcqeKrSrL/JqcC/rDcf95l4r7LXLyxDXc8uQDa064GubtCABg==",
"dev": true,
"requires": {
- "@babel/helper-define-polyfill-provider": "^0.5.0"
+ "@babel/helper-define-polyfill-provider": "^0.6.2"
}
},
"babel-plugin-react-docgen": {
@@ -38676,13 +38732,13 @@
}
},
"browserslist": {
- "version": "4.22.2",
- "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.22.2.tgz",
- "integrity": "sha512-0UgcrvQmBDvZHFGdYUehrCNIazki7/lUP3kkoi/r3YB2amZbFM9J43ZRkJTXBUZK4gmx56+Sqk9+Vs9mwZx9+A==",
+ "version": "4.23.0",
+ "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.23.0.tgz",
+ "integrity": "sha512-QW8HiM1shhT2GuzkvklfjcKDiWFXHOeFCIA/huJPwHsslwcydgk7X+z2zXpEijP98UCY7HbubZt5J2Zgvf0CaQ==",
"dev": true,
"requires": {
- "caniuse-lite": "^1.0.30001565",
- "electron-to-chromium": "^1.4.601",
+ "caniuse-lite": "^1.0.30001587",
+ "electron-to-chromium": "^1.4.668",
"node-releases": "^2.0.14",
"update-browserslist-db": "^1.0.13"
}
@@ -38999,9 +39055,9 @@
}
},
"caniuse-lite": {
- "version": "1.0.30001580",
- "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001580.tgz",
- "integrity": "sha512-mtj5ur2FFPZcCEpXFy8ADXbDACuNFXg6mxVDqp7tqooX6l3zwm+d8EPoeOSIFRDvHs8qu7/SLFOGniULkcH2iA==",
+ "version": "1.0.30001615",
+ "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001615.tgz",
+ "integrity": "sha512-1IpazM5G3r38meiae0bHRnPhz+CBQ3ZLqbQMtrg+AsTPKAXgW38JNsXkyZ+v8waCsDmPq87lmfun5Q2AGysNEQ==",
"dev": true
},
"case-sensitive-paths-webpack-plugin": {
@@ -39754,12 +39810,12 @@
"dev": true
},
"core-js-compat": {
- "version": "3.35.1",
- "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.35.1.tgz",
- "integrity": "sha512-sftHa5qUJY3rs9Zht1WEnmkvXputCyDBczPnr7QDgL8n3qrF3CMXY4VPSYtOLLiOUJcah2WNXREd48iOl6mQIw==",
+ "version": "3.37.0",
+ "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.37.0.tgz",
+ "integrity": "sha512-vYq4L+T8aS5UuFg4UwDhc7YNRWVeVZwltad9C/jV3R2LgVOpS9BDr7l/WL6BN0dbV3k1XejPTHqqEzJgsa0frA==",
"dev": true,
"requires": {
- "browserslist": "^4.22.2"
+ "browserslist": "^4.23.0"
}
},
"core-js-pure": {
@@ -40768,9 +40824,9 @@
"dev": true
},
"electron-to-chromium": {
- "version": "1.4.645",
- "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.4.645.tgz",
- "integrity": "sha512-EeS1oQDCmnYsRDRy2zTeC336a/4LZ6WKqvSaM1jLocEk5ZuyszkQtCpsqvuvaIXGOUjwtvF6LTcS8WueibXvSw==",
+ "version": "1.4.754",
+ "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.4.754.tgz",
+ "integrity": "sha512-7Kr5jUdns5rL/M9wFFmMZAgFDuL2YOnanFH4OI4iFzUqyh3XOL7nAGbSlSMZdzKMIyyTpNSbqZsWG9odwLeKvA==",
"dev": true
},
"elliptic": {
@@ -40880,9 +40936,9 @@
"dev": true
},
"enhanced-resolve": {
- "version": "5.15.0",
- "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.15.0.tgz",
- "integrity": "sha512-LXYT42KJ7lpIKECr2mAXIaMldcNCh/7E0KBKOu4KSfkHmP+mZmSs+8V5gBAqisWBy0OO4W5Oyys0GO1Y8KtdKg==",
+ "version": "5.16.0",
+ "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.16.0.tgz",
+ "integrity": "sha512-O+QWCviPNSSLAD9Ucn8Awv+poAkqn3T1XY5/N7kR7rQO9yfSGWkYZDwpJ+iKF7B8rxaQKWngSqACpgzeapSyoA==",
"dev": true,
"requires": {
"graceful-fs": "^4.2.4",
@@ -50637,9 +50693,9 @@
}
},
"watchpack": {
- "version": "2.4.0",
- "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.0.tgz",
- "integrity": "sha512-Lcvm7MGST/4fup+ifyKi2hjyIAwcdI4HRgtvTpIUxBRhB+RFtUh8XtDOxUfctVCnhVi+QQj49i91OyvzkJl6cg==",
+ "version": "2.4.1",
+ "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.1.tgz",
+ "integrity": "sha512-8wrBCMtVhqcXP2Sup1ctSkga6uc2Bx0IIvKyT7yTFier5AXHooSI+QyQQAtTb7+E0IUCCKyTFmXqdqgum2XWGg==",
"dev": true,
"requires": {
"glob-to-regexp": "^0.4.1",
@@ -50954,26 +51010,26 @@
"dev": true
},
"webpack": {
- "version": "5.90.3",
- "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.90.3.tgz",
- "integrity": "sha512-h6uDYlWCctQRuXBs1oYpVe6sFcWedl0dpcVaTf/YF67J9bKvwJajFulMVSYKHrksMB3I/pIagRzDxwxkebuzKA==",
+ "version": "5.91.0",
+ "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.91.0.tgz",
+ "integrity": "sha512-rzVwlLeBWHJbmgTC/8TvAcu5vpJNII+MelQpylD4jNERPwpBJOE2lEcko1zJX3QJeLjTTAnQxn/OJ8bjDzVQaw==",
"dev": true,
"requires": {
"@types/eslint-scope": "^3.7.3",
"@types/estree": "^1.0.5",
- "@webassemblyjs/ast": "^1.11.5",
- "@webassemblyjs/wasm-edit": "^1.11.5",
- "@webassemblyjs/wasm-parser": "^1.11.5",
+ "@webassemblyjs/ast": "^1.12.1",
+ "@webassemblyjs/wasm-edit": "^1.12.1",
+ "@webassemblyjs/wasm-parser": "^1.12.1",
"acorn": "^8.7.1",
"acorn-import-assertions": "^1.9.0",
"browserslist": "^4.21.10",
"chrome-trace-event": "^1.0.2",
- "enhanced-resolve": "^5.15.0",
+ "enhanced-resolve": "^5.16.0",
"es-module-lexer": "^1.2.1",
"eslint-scope": "5.1.1",
"events": "^3.2.0",
"glob-to-regexp": "^0.4.1",
- "graceful-fs": "^4.2.9",
+ "graceful-fs": "^4.2.11",
"json-parse-even-better-errors": "^2.3.1",
"loader-runner": "^4.2.0",
"mime-types": "^2.1.27",
@@ -50981,7 +51037,7 @@
"schema-utils": "^3.2.0",
"tapable": "^2.1.1",
"terser-webpack-plugin": "^5.3.10",
- "watchpack": "^2.4.0",
+ "watchpack": "^2.4.1",
"webpack-sources": "^3.2.3"
},
"dependencies": {
diff --git a/components/dash-table/package.json b/components/dash-table/package.json
index 54972bea0e..57068b8a24 100644
--- a/components/dash-table/package.json
+++ b/components/dash-table/package.json
@@ -1,6 +1,6 @@
{
"name": "dash-table",
- "version": "5.2.10",
+ "version": "5.2.11",
"description": "Dash table",
"repository": {
"type": "git",
@@ -41,13 +41,13 @@
"maintainer": "Alex Johnson ",
"license": "MIT",
"devDependencies": {
- "@babel/cli": "^7.23.9",
- "@babel/core": "^7.24.0",
+ "@babel/cli": "^7.24.1",
+ "@babel/core": "^7.24.1",
"@babel/plugin-syntax-dynamic-import": "^7.8.3",
- "@babel/plugin-transform-regenerator": "^7.23.3",
+ "@babel/plugin-transform-regenerator": "^7.24.1",
"@babel/polyfill": "^7.12.1",
- "@babel/preset-env": "^7.24.0",
- "@babel/preset-react": "^7.23.3",
+ "@babel/preset-env": "^7.24.5",
+ "@babel/preset-react": "^7.24.1",
"@fortawesome/fontawesome-svg-core": "1.2.36",
"@fortawesome/free-regular-svg-icons": "^5.15.4",
"@fortawesome/free-solid-svg-icons": "^5.15.4",
@@ -104,7 +104,7 @@
"style-loader": "^3.3.3",
"ts-loader": "^9.4.3",
"typescript": "^5.3.3",
- "webpack": "^5.90.3",
+ "webpack": "^5.91.0",
"webpack-cli": "^5.1.4",
"webpack-dev-server": "^4.15.1",
"webpack-preprocessor": "^0.1.12",
@@ -125,6 +125,6 @@
"npm": ">=6.1.0"
},
"browserslist": [
- "last 8 years and not dead"
+ "last 9 years and not dead"
]
}
diff --git a/dash/__init__.py b/dash/__init__.py
index f46d6f77e1..8f740e35ba 100644
--- a/dash/__init__.py
+++ b/dash/__init__.py
@@ -18,7 +18,7 @@
from . import html # noqa: F401,E402
from . import dash_table # noqa: F401,E402
from .version import __version__ # noqa: F401,E402
-from ._callback_context import callback_context # noqa: F401,E402
+from ._callback_context import callback_context, set_props # noqa: F401,E402
from ._callback import callback, clientside_callback # noqa: F401,E402
from ._get_app import get_app # noqa: F401,E402
from ._get_paths import ( # noqa: F401,E402
diff --git a/dash/_callback.py b/dash/_callback.py
index d2fa15742d..3d63d4b21e 100644
--- a/dash/_callback.py
+++ b/dash/_callback.py
@@ -10,6 +10,7 @@
Output,
)
from .exceptions import (
+ InvalidCallbackReturnValue,
PreventUpdate,
WildcardInLongCallback,
MissingLongCallbackManagerError,
@@ -226,6 +227,7 @@ def insert_callback(
manager=None,
running=None,
dynamic_creator=False,
+ no_output=False,
):
if prevent_initial_call is None:
prevent_initial_call = config_prevent_initial_callbacks
@@ -234,7 +236,7 @@ def insert_callback(
output, prevent_initial_call, config_prevent_initial_callbacks
)
- callback_id = create_callback_id(output, inputs)
+ callback_id = create_callback_id(output, inputs, no_output)
callback_spec = {
"output": callback_id,
"inputs": [c.to_dict() for c in inputs],
@@ -248,6 +250,7 @@ def insert_callback(
"interval": long["interval"],
},
"dynamic_creator": dynamic_creator,
+ "no_output": no_output,
}
if running:
callback_spec["running"] = running
@@ -262,6 +265,7 @@ def insert_callback(
"raw_inputs": inputs,
"manager": manager,
"allow_dynamic_callbacks": dynamic_creator,
+ "no_output": no_output,
}
callback_list.append(callback_spec)
@@ -283,10 +287,12 @@ def register_callback( # pylint: disable=R0914
# Insert callback with scalar (non-multi) Output
insert_output = output
multi = False
+ has_output = True
else:
# Insert callback as multi Output
insert_output = flatten_grouping(output)
multi = True
+ has_output = len(output) > 0
long = _kwargs.get("long")
manager = _kwargs.get("manager")
@@ -315,6 +321,7 @@ def register_callback( # pylint: disable=R0914
manager=manager,
dynamic_creator=allow_dynamic_callbacks,
running=running,
+ no_output=not has_output,
)
# pylint: disable=too-many-locals
@@ -331,9 +338,12 @@ def wrap_func(func):
def add_context(*args, **kwargs):
output_spec = kwargs.pop("outputs_list")
app_callback_manager = kwargs.pop("long_callback_manager", None)
- callback_ctx = kwargs.pop("callback_context", {})
+ callback_ctx = kwargs.pop(
+ "callback_context", AttributeDict({"updated_props": {}})
+ )
callback_manager = long and long.get("manager", app_callback_manager)
- _validate.validate_output_spec(insert_output, output_spec, Output)
+ if has_output:
+ _validate.validate_output_spec(insert_output, output_spec, Output)
context_value.set(callback_ctx)
@@ -342,6 +352,7 @@ def add_context(*args, **kwargs):
)
response = {"multi": True}
+ has_update = False
if long is not None:
if not callback_manager:
@@ -443,6 +454,10 @@ def add_context(*args, **kwargs):
NoUpdate() if NoUpdate.is_no_update(r) else r
for r in output_value
]
+ updated_props = callback_manager.get_updated_props(cache_key)
+ if len(updated_props) > 0:
+ response["sideUpdate"] = updated_props
+ has_update = True
if output_value is callback_manager.UNDEFINED:
return to_json(response)
@@ -452,35 +467,49 @@ def add_context(*args, **kwargs):
if NoUpdate.is_no_update(output_value):
raise PreventUpdate
- if not multi:
- output_value, output_spec = [output_value], [output_spec]
- flat_output_values = output_value
- else:
- if isinstance(output_value, (list, tuple)):
- # For multi-output, allow top-level collection to be
- # list or tuple
- output_value = list(output_value)
+ component_ids = collections.defaultdict(dict)
- # Flatten grouping and validate grouping structure
- flat_output_values = flatten_grouping(output_value, output)
+ if has_output:
+ if not multi:
+ output_value, output_spec = [output_value], [output_spec]
+ flat_output_values = output_value
+ else:
+ if isinstance(output_value, (list, tuple)):
+ # For multi-output, allow top-level collection to be
+ # list or tuple
+ output_value = list(output_value)
+
+ # Flatten grouping and validate grouping structure
+ flat_output_values = flatten_grouping(output_value, output)
+
+ _validate.validate_multi_return(
+ output_spec, flat_output_values, callback_id
+ )
- _validate.validate_multi_return(
- output_spec, flat_output_values, callback_id
- )
+ for val, spec in zip(flat_output_values, output_spec):
+ if isinstance(val, NoUpdate):
+ continue
+ for vali, speci in (
+ zip(val, spec) if isinstance(spec, list) else [[val, spec]]
+ ):
+ if not isinstance(vali, NoUpdate):
+ has_update = True
+ id_str = stringify_id(speci["id"])
+ prop = clean_property_name(speci["property"])
+ component_ids[id_str][prop] = vali
+ else:
+ if output_value is not None:
+ raise InvalidCallbackReturnValue(
+ f"No-output callback received return value: {output_value}"
+ )
+ output_value = []
+ flat_output_values = []
- component_ids = collections.defaultdict(dict)
- has_update = False
- for val, spec in zip(flat_output_values, output_spec):
- if isinstance(val, NoUpdate):
- continue
- for vali, speci in (
- zip(val, spec) if isinstance(spec, list) else [[val, spec]]
- ):
- if not isinstance(vali, NoUpdate):
- has_update = True
- id_str = stringify_id(speci["id"])
- prop = clean_property_name(speci["property"])
- component_ids[id_str][prop] = vali
+ if not long:
+ side_update = dict(callback_ctx.updated_props)
+ if len(side_update) > 0:
+ has_update = True
+ response["sideUpdate"] = side_update
if not has_update:
raise PreventUpdate
@@ -502,9 +531,11 @@ def add_context(*args, **kwargs):
_inline_clientside_template = """
-var clientside = window.dash_clientside = window.dash_clientside || {{}};
-var ns = clientside["{namespace}"] = clientside["{namespace}"] || {{}};
-ns["{function_name}"] = {clientside_function};
+(function() {{
+ var clientside = window.dash_clientside = window.dash_clientside || {{}};
+ var ns = clientside["{namespace}"] = clientside["{namespace}"] || {{}};
+ ns["{function_name}"] = {clientside_function};
+}})();
"""
@@ -535,7 +566,7 @@ def register_clientside_callback(
if isinstance(clientside_function, str):
namespace = "_dashprivate_clientside_funcs"
# Create a hash from the function, it will be the same always
- function_name = hashlib.md5(clientside_function.encode("utf-8")).hexdigest()
+ function_name = hashlib.sha256(clientside_function.encode("utf-8")).hexdigest()
inline_scripts.append(
_inline_clientside_template.format(
diff --git a/dash/_callback_context.py b/dash/_callback_context.py
index 7638d0a860..aaa721369e 100644
--- a/dash/_callback_context.py
+++ b/dash/_callback_context.py
@@ -2,11 +2,12 @@
import warnings
import json
import contextvars
+import typing
import flask
from . import exceptions
-from ._utils import AttributeDict
+from ._utils import AttributeDict, stringify_id
context_value = contextvars.ContextVar("callback_context")
@@ -247,5 +248,18 @@ def using_outputs_grouping(self):
def timing_information(self):
return getattr(flask.g, "timing_information", {})
+ @has_context
+ def set_props(self, component_id: typing.Union[str, dict], props: dict):
+ ctx_value = _get_context_value()
+ _id = stringify_id(component_id)
+ ctx_value.updated_props[_id] = props
+
callback_context = CallbackContext()
+
+
+def set_props(component_id: typing.Union[str, dict], props: dict):
+ """
+ Set the props for a component not included in the callback outputs.
+ """
+ callback_context.set_props(component_id, props)
diff --git a/dash/_dash_renderer.py b/dash/_dash_renderer.py
index b1d8512d2b..34ad6bb6ea 100644
--- a/dash/_dash_renderer.py
+++ b/dash/_dash_renderer.py
@@ -1,6 +1,6 @@
import os
-__version__ = "1.19.1"
+__version__ = "1.20.0"
_available_react_versions = {"16.14.0", "18.2.0"}
_available_reactdom_versions = {"16.14.0", "18.2.0"}
@@ -64,7 +64,7 @@ def _set_react_version(v_react, v_reactdom=None):
{
"relative_package_path": "dash-renderer/build/dash_renderer.min.js",
"dev_package_path": "dash-renderer/build/dash_renderer.dev.js",
- "external_url": "https://unpkg.com/dash-renderer@1.19.1"
+ "external_url": "https://unpkg.com/dash-renderer@1.20.0"
"/build/dash_renderer.min.js",
"namespace": "dash",
},
diff --git a/dash/_pages.py b/dash/_pages.py
index c204dfdc18..ab97ba80df 100644
--- a/dash/_pages.py
+++ b/dash/_pages.py
@@ -235,13 +235,14 @@ def register_page(
order `0`
- `title`:
- (string or function) The name of the page . That is, what appears in the browser title.
- If not supplied, will use the supplied `name` or will be inferred by module,
- e.g. `pages.weekly_analytics` to `Weekly analytics`
+ (string or function) Specifies the page title displayed in the browser tab.
+ If not supplied, the app's title is used if different from the default "Dash".
+ Otherwise, the title is the given `name` or inferred from the module name.
+ For example, `pages.weekly_analytics` is inferred as "Weekly Analytics".
- `description`:
(string or function) The <meta type="description"></meta>.
- If not supplied, then nothing is supplied.
+ If not defined, the application description will be used if available.
- `image`:
The meta description image used by social media platforms.
@@ -319,10 +320,18 @@ def register_page(
)
page.update(
supplied_title=title,
- title=(title if title is not None else page["name"]),
+ title=title
+ if title is not None
+ else CONFIG.title
+ if CONFIG.title != "Dash"
+ else page["name"],
)
page.update(
- description=description if description else "",
+ description=description
+ if description
+ else CONFIG.description
+ if CONFIG.description
+ else "",
order=order,
supplied_order=order,
supplied_layout=layout,
diff --git a/dash/_utils.py b/dash/_utils.py
index 5b3b1d62e1..38ff0c39ac 100644
--- a/dash/_utils.py
+++ b/dash/_utils.py
@@ -131,24 +131,31 @@ def first(self, *names):
return next(iter(self), {})
-def create_callback_id(output, inputs):
+def create_callback_id(output, inputs, no_output=False):
# A single dot within a dict id key or value is OK
# but in case of multiple dots together escape each dot
# with `\` so we don't mistake it for multi-outputs
hashed_inputs = None
+ def _hash_inputs():
+ return hashlib.sha256(
+ ".".join(str(x) for x in inputs).encode("utf-8")
+ ).hexdigest()
+
def _concat(x):
nonlocal hashed_inputs
_id = x.component_id_str().replace(".", "\\.") + "." + x.component_property
if x.allow_duplicate:
if not hashed_inputs:
- hashed_inputs = hashlib.md5(
- ".".join(str(x) for x in inputs).encode("utf-8")
- ).hexdigest()
+ hashed_inputs = _hash_inputs()
# Actually adds on the property part.
_id += f"@{hashed_inputs}"
return _id
+ if no_output:
+ # No output will hash the inputs.
+ return _hash_inputs()
+
if isinstance(output, (list, tuple)):
return ".." + "...".join(_concat(x) for x in output) + ".."
@@ -167,8 +174,12 @@ def split_callback_id(callback_id):
def stringify_id(id_):
+ def _json(k, v):
+ vstr = v.to_json() if hasattr(v, "to_json") else json.dumps(v)
+ return f"{json.dumps(k)}:{vstr}"
+
if isinstance(id_, dict):
- return json.dumps(id_, sort_keys=True, separators=(",", ":"))
+ return "{" + ",".join(_json(k, id_[k]) for k in sorted(id_)) + "}"
return id_
@@ -213,9 +224,9 @@ def run_command_with_process(cmd):
proc.communicate()
-def compute_md5(path):
+def compute_hash(path):
with io.open(path, encoding="utf-8") as fp:
- return hashlib.md5(fp.read().encode("utf-8")).hexdigest()
+ return hashlib.sha256(fp.read().encode("utf-8")).hexdigest()
def job(msg=""):
diff --git a/dash/_validate.py b/dash/_validate.py
index dcd075b8cd..b5e21d9eb5 100644
--- a/dash/_validate.py
+++ b/dash/_validate.py
@@ -398,12 +398,13 @@ def validate_index(name, checks, index):
def validate_layout_type(value):
- if not isinstance(value, (Component, patch_collections_abc("Callable"))):
+ if not isinstance(
+ value, (Component, patch_collections_abc("Callable"), list, tuple)
+ ):
raise exceptions.NoLayoutException(
"""
- Layout must be a single dash component
+ Layout must be a single dash component, a list of dash components,
or a function that returns a dash component.
- Cannot be a tuple (are there any trailing commas?)
"""
)
@@ -418,18 +419,34 @@ def validate_layout(layout, layout_value):
"""
)
- layout_id = stringify_id(getattr(layout_value, "id", None))
+ component_ids = set()
- component_ids = {layout_id} if layout_id else set()
- for component in layout_value._traverse(): # pylint: disable=protected-access
- component_id = stringify_id(getattr(component, "id", None))
- if component_id and component_id in component_ids:
- raise exceptions.DuplicateIdError(
- f"""
- Duplicate component id found in the initial layout: `{component_id}`
- """
- )
- component_ids.add(component_id)
+ def _validate(value):
+ def _validate_id(comp):
+ component_id = stringify_id(getattr(comp, "id", None))
+ if component_id and component_id in component_ids:
+ raise exceptions.DuplicateIdError(
+ f"""
+ Duplicate component id found in the initial layout: `{component_id}`
+ """
+ )
+ component_ids.add(component_id)
+
+ _validate_id(value)
+
+ for component in value._traverse(): # pylint: disable=protected-access
+ _validate_id(component)
+
+ if isinstance(layout_value, (list, tuple)):
+ for component in layout_value:
+ if isinstance(component, (Component,)):
+ _validate(component)
+ else:
+ raise exceptions.NoLayoutException(
+ "List of components as layout must be a list of components only."
+ )
+ else:
+ _validate(layout_value)
def validate_template(template):
diff --git a/dash/dash-renderer/build/dash_renderer.dev.js b/dash/dash-renderer/build/dash_renderer.dev.js
index bb8d491fd1..b1ef3c4791 100644
--- a/dash/dash-renderer/build/dash_renderer.dev.js
+++ b/dash/dash-renderer/build/dash_renderer.dev.js
@@ -287,7 +287,7 @@ function _defineProperties(target, props) { for (var i = 0; i < props.length; i+
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
var StoreObserver = /*#__PURE__*/_createClass(function StoreObserver(_store) {
@@ -419,11 +419,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _patch__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./patch */ "./src/actions/patch.ts");
/* harmony import */ var _paths__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./paths */ "./src/actions/paths.js");
/* harmony import */ var _requestDependencies__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./requestDependencies */ "./src/actions/requestDependencies.ts");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
@@ -606,14 +606,14 @@ function _handleClientside() {
case 24:
returnValue = _context3.sent;
case 25:
- zipIfArray(outputs, returnValue).forEach(function (_ref10) {
- var _ref11 = _slicedToArray(_ref10, 2),
- outi = _ref11[0],
- reti = _ref11[1];
- zipIfArray(outi, reti).forEach(function (_ref12) {
- var _ref13 = _slicedToArray(_ref12, 2),
- outij = _ref13[0],
- retij = _ref13[1];
+ zipIfArray(outputs, returnValue).forEach(function (_ref11) {
+ var _ref12 = _slicedToArray(_ref11, 2),
+ outi = _ref12[0],
+ reti = _ref12[1];
+ zipIfArray(outi, reti).forEach(function (_ref13) {
+ var _ref14 = _slicedToArray(_ref13, 2),
+ outij = _ref14[0],
+ retij = _ref14[1];
var id = outij.id,
property = outij.property;
var idStr = (0,_dependencies__WEBPACK_IMPORTED_MODULE_3__.stringifyId)(id);
@@ -670,31 +670,46 @@ function _handleClientside() {
}));
return _handleClientside.apply(this, arguments);
}
-function sideUpdate(outputs, dispatch, paths) {
- (0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(outputs).forEach(function (_ref2) {
- var _ref3 = _slicedToArray(_ref2, 2),
- id = _ref3[0],
- value = _ref3[1];
- var _id$split = id.split('.'),
- _id$split2 = _slicedToArray(_id$split, 2),
- componentId = _id$split2[0],
- propName = _id$split2[1];
- var componentPath = paths.strs[componentId];
+function updateComponent(component_id, props) {
+ return function (dispatch, getState) {
+ var paths = getState().paths;
+ var componentPath = (0,_paths__WEBPACK_IMPORTED_MODULE_7__.getPath)(paths, component_id);
dispatch((0,___WEBPACK_IMPORTED_MODULE_5__.updateProps)({
- props: {
- [propName]: value
- },
+ props,
itempath: componentPath
}));
dispatch((0,___WEBPACK_IMPORTED_MODULE_5__.notifyObservers)({
- id: componentId,
- props: {
- [propName]: value
- }
+ id: component_id,
+ props
}));
+ };
+}
+function sideUpdate(outputs, dispatch) {
+ (0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(outputs).forEach(function (_ref2) {
+ var _ref3 = _slicedToArray(_ref2, 2),
+ id = _ref3[0],
+ value = _ref3[1];
+ var componentId = id,
+ propName;
+ if (id.startsWith('{')) {
+ var index = id.lastIndexOf('}');
+ if (index + 2 < id.length) {
+ propName = id.substring(index + 2);
+ componentId = JSON.parse(id.substring(0, index + 1));
+ } else {
+ componentId = JSON.parse(id);
+ }
+ } else if (id.includes('.')) {
+ var _id$split = id.split('.');
+ var _id$split2 = _slicedToArray(_id$split, 2);
+ componentId = _id$split2[0];
+ propName = _id$split2[1];
+ }
+ var props = propName ? _defineProperty({}, propName, value) : value;
+ dispatch(updateComponent(componentId, props));
});
}
-function handleServerside(dispatch, hooks, config, payload, paths, long, additionalArgs, getState, output, running) {
+function handleServerside(dispatch, hooks, config, payload, long, additionalArgs, getState, output, running) {
if (hooks.request_pre) {
hooks.request_pre(payload);
}
@@ -706,7 +721,7 @@ function handleServerside(dispatch, hooks, config, payload, paths, long, additio
var progressDefault;
var moreArgs = additionalArgs;
if (running) {
- sideUpdate(running.running, dispatch, paths);
+ sideUpdate(running.running, dispatch);
runningOff = running.runningOff;
}
var fetchCallback = function fetchCallback() {
@@ -726,17 +741,17 @@ function handleServerside(dispatch, hooks, config, payload, paths, long, additio
addArg('job', job);
}
if (moreArgs) {
- moreArgs.forEach(function (_ref4) {
- var _ref5 = _slicedToArray(_ref4, 2),
- key = _ref5[0],
- value = _ref5[1];
+ moreArgs.forEach(function (_ref5) {
+ var _ref6 = _slicedToArray(_ref5, 2),
+ key = _ref6[0],
+ value = _ref6[1];
return addArg(key, value);
});
- moreArgs = moreArgs.filter(function (_ref6) {
- var _ref7 = _slicedToArray(_ref6, 3),
- _ = _ref7[0],
- __ = _ref7[1],
- single = _ref7[2];
+ moreArgs = moreArgs.filter(function (_ref7) {
+ var _ref8 = _slicedToArray(_ref7, 3),
+ _ = _ref8[0],
+ __ = _ref8[1],
+ single = _ref8[2];
return !single;
});
}
@@ -797,9 +812,7 @@ function handleServerside(dispatch, hooks, config, payload, paths, long, additio
} else {
var _output = payload.output;
var id = _output.substr(0, _output.lastIndexOf('.'));
- result = {
- [id]: response.props
- };
+ result = _defineProperty({}, id, response.props);
}
recordProfile(result);
resolve(result);
@@ -811,10 +824,10 @@ function handleServerside(dispatch, hooks, config, payload, paths, long, additio
}));
}
if (runningOff) {
- sideUpdate(runningOff, dispatch, paths);
+ sideUpdate(runningOff, dispatch);
}
if (progressDefault) {
- sideUpdate(progressDefault, dispatch, paths);
+ sideUpdate(progressDefault, dispatch);
}
};
if (status === _constants_constants__WEBPACK_IMPORTED_MODULE_0__.STATUS.OK) {
@@ -833,8 +846,11 @@ function handleServerside(dispatch, hooks, config, payload, paths, long, additio
dispatch(addCallbackJob(jobInfo));
job = data.job;
}
+ if (data.sideUpdate) {
+ sideUpdate(data.sideUpdate, dispatch);
+ }
if (data.progress) {
- sideUpdate(data.progress, dispatch, paths);
+ sideUpdate(data.progress, dispatch);
}
if (!progressDefault && data.progressDefault) {
progressDefault = data.progressDefault;
@@ -911,8 +927,8 @@ function getTriggeredId(triggered) {
return componentId;
}
}
-function executeCallback(cb, config, hooks, paths, layout, _ref8, dispatch, getState) {
- var allOutputs = _ref8.allOutputs;
+function executeCallback(cb, config, hooks, paths, layout, _ref9, dispatch, getState) {
+ var allOutputs = _ref9.allOutputs;
var _cb$callback = cb.callback,
output = _cb$callback.output,
inputs = _cb$callback.inputs,
@@ -953,7 +969,7 @@ function executeCallback(cb, config, hooks, paths, layout, _ref8, dispatch, getS
});
}
var __execute = /*#__PURE__*/function () {
- var _ref9 = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+ var _ref10 = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
var payload, data, newConfig, newHeaders, lastError, additionalArgs, _loop, _ret, retry;
return _regeneratorRuntime().wrap(function _callee$(_context2) {
while (1) switch (_context2.prev = _context2.next) {
@@ -1007,7 +1023,7 @@ function executeCallback(cb, config, hooks, paths, layout, _ref8, dispatch, getS
if (inter.length) {
additionalArgs.push(['cancelJob', job.jobId]);
if (job.progressDefault) {
- sideUpdate(job.progressDefault, dispatch, paths);
+ sideUpdate(job.progressDefault, dispatch);
}
}
});
@@ -1018,7 +1034,7 @@ function executeCallback(cb, config, hooks, paths, layout, _ref8, dispatch, getS
case 0:
_context.prev = 0;
_context.next = 3;
- return handleServerside(dispatch, hooks, newConfig, payload, paths, long, additionalArgs.length ? additionalArgs : undefined, getState, cb.callback.output, cb.callback.running);
+ return handleServerside(dispatch, hooks, newConfig, payload, long, additionalArgs.length ? additionalArgs : undefined, getState, cb.callback.output, cb.callback.running);
case 3:
_data = _context.sent;
if (newHeaders) {
@@ -1148,7 +1164,7 @@ function executeCallback(cb, config, hooks, paths, layout, _ref8, dispatch, getS
}, _callee, null, [[0, 34], [3, 10]]);
}));
return function __execute() {
- return _ref9.apply(this, arguments);
+ return _ref10.apply(this, arguments);
};
}();
var newCb = _objectSpread(_objectSpread({}, cb), {}, {
@@ -1212,7 +1228,7 @@ __webpack_require__.r(__webpack_exports__);
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
@@ -1589,7 +1605,7 @@ __webpack_require__.r(__webpack_exports__);
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function isPatch(obj) {
@@ -1702,7 +1718,7 @@ __webpack_require__.r(__webpack_exports__);
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
@@ -1827,7 +1843,7 @@ __webpack_require__.r(__webpack_exports__);
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
@@ -2013,8 +2029,14 @@ var observer = {
}));
}
if (error !== undefined) {
- var outputs = payload ? (0,ramda__WEBPACK_IMPORTED_MODULE_10__["default"])(_actions_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__.combineIdAndProp, (0,ramda__WEBPACK_IMPORTED_MODULE_9__["default"])([payload.outputs])).join(', ') : output;
- var message = "Callback error updating ".concat(outputs);
+ var message;
+ if (cb.callback.no_output) {
+ var inpts = (0,ramda__WEBPACK_IMPORTED_MODULE_11__["default"])(cb.changedPropIds).join(', ');
+ message = "Callback error with no output from input ".concat(inpts);
+ } else {
+ var outputs = payload ? (0,ramda__WEBPACK_IMPORTED_MODULE_10__["default"])(_actions_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__.combineIdAndProp, (0,ramda__WEBPACK_IMPORTED_MODULE_9__["default"])([payload.outputs])).join(', ') : output;
+ message = "Callback error updating ".concat(outputs);
+ }
if (clientside_function) {
var ns = clientside_function.namespace,
fn = clientside_function.function_name;
@@ -2050,11 +2072,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/find.js");
/* harmony import */ var _actions_callbacks__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../actions/callbacks */ "./src/actions/callbacks.ts");
/* harmony import */ var _reducers_constants__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../reducers/constants */ "./src/reducers/constants.js");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
@@ -2259,11 +2281,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _actions_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../actions/dependencies_ts */ "./src/actions/dependencies_ts.ts");
/* harmony import */ var _actions_isAppReady__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../actions/isAppReady */ "./src/actions/isAppReady.js");
/* harmony import */ var _reducers_constants__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../reducers/constants */ "./src/reducers/constants.js");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
@@ -2429,11 +2451,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _actions_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../actions/dependencies_ts */ "./src/actions/dependencies_ts.ts");
/* harmony import */ var _utils_wait__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./../utils/wait */ "./src/utils/wait.ts");
/* harmony import */ var _utils_callbacks__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../utils/callbacks */ "./src/utils/callbacks.ts");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
@@ -2807,10 +2829,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/concat.js");
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/difference.js");
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/reduce.js");
+var _transforms, _fields;
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
var CallbackActionType;
@@ -2845,38 +2868,8 @@ var DEFAULT_STATE = {
watched: [],
completed: 0
};
-var transforms = {
- [CallbackActionType.AddBlocked]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddExecuted]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddExecuting]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddPrioritized]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddRequested]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddStored]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.AddWatched]: ramda__WEBPACK_IMPORTED_MODULE_0__["default"],
- [CallbackActionType.RemoveBlocked]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemoveExecuted]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemoveExecuting]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemovePrioritized]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemoveRequested]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemoveStored]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"],
- [CallbackActionType.RemoveWatched]: ramda__WEBPACK_IMPORTED_MODULE_1__["default"]
-};
-var fields = {
- [CallbackActionType.AddBlocked]: 'blocked',
- [CallbackActionType.AddExecuted]: 'executed',
- [CallbackActionType.AddExecuting]: 'executing',
- [CallbackActionType.AddPrioritized]: 'prioritized',
- [CallbackActionType.AddRequested]: 'requested',
- [CallbackActionType.AddStored]: 'stored',
- [CallbackActionType.AddWatched]: 'watched',
- [CallbackActionType.RemoveBlocked]: 'blocked',
- [CallbackActionType.RemoveExecuted]: 'executed',
- [CallbackActionType.RemoveExecuting]: 'executing',
- [CallbackActionType.RemovePrioritized]: 'prioritized',
- [CallbackActionType.RemoveRequested]: 'requested',
- [CallbackActionType.RemoveStored]: 'stored',
- [CallbackActionType.RemoveWatched]: 'watched'
-};
+var transforms = (_transforms = {}, _defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_transforms, CallbackActionType.AddBlocked, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddExecuted, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddExecuting, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddPrioritized, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddRequested, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddStored, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.AddWatched, ramda__WEBPACK_IMPORTED_MODULE_0__["default"]), CallbackActionType.RemoveBlocked, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), CallbackActionType.RemoveExecuted, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), CallbackActionType.RemoveExecuting, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), _defineProperty(_defineProperty(_defineProperty(_defineProperty(_transforms, CallbackActionType.RemovePrioritized, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), CallbackActionType.RemoveRequested, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), CallbackActionType.RemoveStored, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]), CallbackActionType.RemoveWatched, ramda__WEBPACK_IMPORTED_MODULE_1__["default"]));
+var fields = (_fields = {}, _defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_defineProperty(_fields, CallbackActionType.AddBlocked, 'blocked'), CallbackActionType.AddExecuted, 'executed'), CallbackActionType.AddExecuting, 'executing'), CallbackActionType.AddPrioritized, 'prioritized'), CallbackActionType.AddRequested, 'requested'), CallbackActionType.AddStored, 'stored'), CallbackActionType.AddWatched, 'watched'), CallbackActionType.RemoveBlocked, 'blocked'), CallbackActionType.RemoveExecuted, 'executed'), CallbackActionType.RemoveExecuting, 'executing'), _defineProperty(_defineProperty(_defineProperty(_defineProperty(_fields, CallbackActionType.RemovePrioritized, 'prioritized'), CallbackActionType.RemoveRequested, 'requested'), CallbackActionType.RemoveStored, 'stored'), CallbackActionType.RemoveWatched, 'watched'));
var mutateCompleted = function mutateCompleted(state, action) {
return _objectSpread(_objectSpread({}, state), {}, {
completed: state.completed + action.payload
@@ -2885,9 +2878,7 @@ var mutateCompleted = function mutateCompleted(state, action) {
var mutateCallbacks = function mutateCallbacks(state, action) {
var transform = transforms[action.type];
var field = fields[action.type];
- return !transform || !field || action.payload.length === 0 ? state : _objectSpread(_objectSpread({}, state), {}, {
- [field]: transform(state[field], action.payload)
- });
+ return !transform || !field || action.payload.length === 0 ? state : _objectSpread(_objectSpread({}, state), {}, _defineProperty({}, field, transform(state[field], action.payload)));
};
/* harmony default export */ __webpack_exports__["default"] = (function () {
var state = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : DEFAULT_STATE;
@@ -2980,7 +2971,7 @@ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Cons
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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
@@ -3055,13 +3046,12 @@ var RendererStore = /*#__PURE__*/function () {
});
this.__store = this.initializeStore();
}
- _createClass(RendererStore, [{
+ return _createClass(RendererStore, [{
key: "store",
get: function get() {
return this.__store;
}
}]);
- return RendererStore;
}();
@@ -3199,8 +3189,29 @@ var set_props = function set_props(id, props) {
}));
}
};
+// Clean url code adapted from https://github.com/braintree/sanitize-url/blob/main/src/constants.ts
+// to allow for data protocol.
+var invalidProtocols = /^([^\w]*)(javascript|vbscript)/im;
+var newLines = /&(tab|newline);/gi;
+// eslint-disable-next-line no-control-regex
+var ctrlChars = /[\u0000-\u001F\u007F-\u009F\u2000-\u200D\uFEFF]/gim;
+var htmlEntities = /&#(\w+)(^\w|;)?/g;
+var clean_url = function clean_url(url) {
+ var fallback = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'about:blank';
+ if (url === '') {
+ return url;
+ }
+ var cleaned = url.replace(newLines, '').replace(ctrlChars, '').replace(htmlEntities, function (_, dec) {
+ return String.fromCharCode(dec);
+ }).trim();
+ if (invalidProtocols.test(cleaned)) {
+ return fallback;
+ }
+ return url;
+};
var dc = window.dash_clientside = window.dash_clientside || {};
dc['set_props'] = set_props;
+dc['clean_url'] = dc['clean_url'] === undefined ? clean_url : dc['clean_url'];
/***/ }),
@@ -3212,7 +3223,7 @@ dc['set_props'] = set_props;
"use strict";
__webpack_require__.r(__webpack_exports__);
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
/* harmony default export */ __webpack_exports__["default"] = (/*#__PURE__*/(function () {
@@ -3251,8 +3262,8 @@ __webpack_require__.r(__webpack_exports__);
/* harmony export */ DashContext: function() { return /* binding */ DashContext; }
/* harmony export */ });
/* harmony import */ var react_redux__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! react-redux */ "./node_modules/react-redux/es/index.js");
-/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/includes.js");
-/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/isEmpty.js");
+/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/includes.js");
+/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/isEmpty.js");
/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prop-types */ "prop-types");
@@ -3269,7 +3280,8 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _constants_constants__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./constants/constants */ "./src/constants/constants.js");
/* harmony import */ var _utils_TreeContainer__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./utils/TreeContainer */ "./src/utils/TreeContainer.ts");
/* harmony import */ var _utils_wait__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./utils/wait */ "./src/utils/wait.ts");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+/* harmony import */ var _isSimpleComponent__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ./isSimpleComponent */ "./src/isSimpleComponent.js");
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
@@ -3294,6 +3306,7 @@ function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
+
var DashContext = /*#__PURE__*/(0,react__WEBPACK_IMPORTED_MODULE_1__.createContext)({});
/**
@@ -3358,11 +3371,11 @@ var UnconnectedContainer = function UnconnectedContainer(props) {
}
}, []);
var content;
- if (layoutRequest.status && !(0,ramda__WEBPACK_IMPORTED_MODULE_15__["default"])(layoutRequest.status, [_constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK, 'loading'])) {
+ if (layoutRequest.status && !(0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(layoutRequest.status, [_constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK, 'loading'])) {
content = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", {
className: "_dash-error"
}, "Error loading layout");
- } else if (errorLoading || dependenciesRequest.status && !(0,ramda__WEBPACK_IMPORTED_MODULE_15__["default"])(dependenciesRequest.status, [_constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK, 'loading'])) {
+ } else if (errorLoading || dependenciesRequest.status && !(0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(dependenciesRequest.status, [_constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK, 'loading'])) {
content = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", {
className: "_dash-error"
}, "Error loading dependencies");
@@ -3370,12 +3383,21 @@ var UnconnectedContainer = function UnconnectedContainer(props) {
renderedTree.current = true;
content = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(DashContext.Provider, {
value: provider.current
- }, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_TreeContainer__WEBPACK_IMPORTED_MODULE_3__["default"], {
+ }, Array.isArray(layout) ? layout.map(function (c, i) {
+ return (0,_isSimpleComponent__WEBPACK_IMPORTED_MODULE_15__["default"])(c) ? c : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_TreeContainer__WEBPACK_IMPORTED_MODULE_3__["default"], {
+ _dashprivate_error: error,
+ _dashprivate_layout: c,
+ _dashprivate_loadingState: (0,_utils_TreeContainer__WEBPACK_IMPORTED_MODULE_13__.getLoadingState)(c, [i], loadingMap),
+ _dashprivate_loadingStateHash: (0,_utils_TreeContainer__WEBPACK_IMPORTED_MODULE_13__.getLoadingHash)([i], loadingMap),
+ _dashprivate_path: "[".concat(i, "]"),
+ key: i
+ });
+ }) : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_TreeContainer__WEBPACK_IMPORTED_MODULE_3__["default"], {
_dashprivate_error: error,
_dashprivate_layout: layout,
_dashprivate_loadingState: (0,_utils_TreeContainer__WEBPACK_IMPORTED_MODULE_13__.getLoadingState)(layout, [], loadingMap),
_dashprivate_loadingStateHash: (0,_utils_TreeContainer__WEBPACK_IMPORTED_MODULE_13__.getLoadingHash)([], loadingMap),
- _dashprivate_path: JSON.stringify([])
+ _dashprivate_path: '[]'
}));
} else {
content = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", {
@@ -3394,13 +3416,13 @@ function storeEffect(props, events, setErrorLoading) {
layout = props.layout,
layoutRequest = props.layoutRequest;
(0,react_redux__WEBPACK_IMPORTED_MODULE_0__.batch)(function () {
- if ((0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(layoutRequest)) {
+ if ((0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(layoutRequest)) {
if (typeof hooks.layout_pre === 'function') {
hooks.layout_pre();
}
dispatch((0,_actions_api__WEBPACK_IMPORTED_MODULE_8__["default"])('_dash-layout', 'GET', 'layoutRequest'));
} else if (layoutRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK) {
- if ((0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(layout)) {
+ if ((0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(layout)) {
if (typeof hooks.layout_post === 'function') {
hooks.layout_post(layoutRequest.content);
}
@@ -3409,16 +3431,16 @@ function storeEffect(props, events, setErrorLoading) {
dispatch((0,_actions__WEBPACK_IMPORTED_MODULE_5__.setLayout)(finalLayout));
}
}
- if ((0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(dependenciesRequest)) {
+ if ((0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(dependenciesRequest)) {
dispatch((0,_actions_api__WEBPACK_IMPORTED_MODULE_8__["default"])('_dash-dependencies', 'GET', 'dependenciesRequest'));
- } else if (dependenciesRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && ((0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(graphs) || graphs.reset)) {
+ } else if (dependenciesRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && ((0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(graphs) || graphs.reset)) {
dispatch((0,_actions__WEBPACK_IMPORTED_MODULE_5__.setGraphs)((0,_actions_dependencies__WEBPACK_IMPORTED_MODULE_7__.computeGraphs)(dependenciesRequest.content, (0,_actions__WEBPACK_IMPORTED_MODULE_5__.dispatchError)(dispatch))));
}
if (
// dependenciesRequest and its computed stores
- dependenciesRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && !(0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(graphs) &&
+ dependenciesRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && !(0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(graphs) &&
// LayoutRequest and its computed stores
- layoutRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && !(0,ramda__WEBPACK_IMPORTED_MODULE_16__["default"])(layout) &&
+ layoutRequest.status === _constants_constants__WEBPACK_IMPORTED_MODULE_12__.STATUS.OK && !(0,ramda__WEBPACK_IMPORTED_MODULE_17__["default"])(layout) &&
// Hasn't already hydrated
appLifecycle === (0,_reducers_constants__WEBPACK_IMPORTED_MODULE_11__.getAppState)('STARTED')) {
var hasError = false;
@@ -3447,7 +3469,7 @@ UnconnectedContainer.propTypes = {
graphs: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
hooks: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
layoutRequest: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
- layout: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
+ layout: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().any),
loadingMap: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().any),
history: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().any),
error: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
@@ -3505,7 +3527,7 @@ function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key i
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -3525,7 +3547,6 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var UnconnectedAppContainer = /*#__PURE__*/function (_React$Component) {
- _inherits(UnconnectedAppContainer, _React$Component);
function UnconnectedAppContainer(props) {
var _this;
_classCallCheck(this, UnconnectedAppContainer);
@@ -3541,7 +3562,8 @@ var UnconnectedAppContainer = /*#__PURE__*/function (_React$Component) {
}
return _this;
}
- _createClass(UnconnectedAppContainer, [{
+ _inherits(UnconnectedAppContainer, _React$Component);
+ return _createClass(UnconnectedAppContainer, [{
key: "UNSAFE_componentWillMount",
value: function UNSAFE_componentWillMount() {
var dispatch = this.props.dispatch;
@@ -3570,7 +3592,6 @@ var UnconnectedAppContainer = /*#__PURE__*/function (_React$Component) {
return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement((react__WEBPACK_IMPORTED_MODULE_1___default().Fragment), null, show_undo_redo ? /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_components_core_Toolbar_react__WEBPACK_IMPORTED_MODULE_5__["default"], null) : null, /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_APIController_react__WEBPACK_IMPORTED_MODULE_3__["default"], null), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_components_core_Loading_react__WEBPACK_IMPORTED_MODULE_4__["default"], null), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_components_core_Reloader_react__WEBPACK_IMPORTED_MODULE_6__["default"], null));
}
}]);
- return UnconnectedAppContainer;
}((react__WEBPACK_IMPORTED_MODULE_1___default().Component));
UnconnectedAppContainer.propTypes = {
hooks: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
@@ -3609,7 +3630,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _AppProvider_react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./AppProvider.react */ "./src/AppProvider.react.tsx");
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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
@@ -3667,6 +3688,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/assocPath.js");
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/assoc.js");
/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/propOr.js");
+/* harmony import */ var ramda__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ramda */ "./node_modules/ramda/es/omit.js");
/* harmony import */ var _actions__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./actions */ "./src/actions/index.js");
/* harmony import */ var _isSimpleComponent__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./isSimpleComponent */ "./src/isSimpleComponent.js");
/* harmony import */ var _persistence__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./persistence */ "./src/persistence.js");
@@ -3681,17 +3703,17 @@ function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbol
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
-function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
+function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } } return target; }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
+function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
function _isNativeReflectConstruct() { try { var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); } catch (t) {} return (_isNativeReflectConstruct = function _isNativeReflectConstruct() { return !!t; })(); }
function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }
-function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, "prototype", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }
function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }
function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
@@ -3756,15 +3778,15 @@ var DashWrapper = function DashWrapper(props) {
};
var TreeContainer = /*#__PURE__*/(0,react__WEBPACK_IMPORTED_MODULE_0__.memo)(DashWrapper);
var BaseTreeContainer = /*#__PURE__*/function (_Component) {
- _inherits(BaseTreeContainer, _Component);
function BaseTreeContainer(props) {
var _this;
_classCallCheck(this, BaseTreeContainer);
_this = _callSuper(this, BaseTreeContainer, [props]);
- _this.setProps = _this.setProps.bind(_assertThisInitialized(_this));
+ _this.setProps = _this.setProps.bind(_this);
return _this;
}
- _createClass(BaseTreeContainer, [{
+ _inherits(BaseTreeContainer, _Component);
+ return _createClass(BaseTreeContainer, [{
key: "createContainer",
value: function createContainer(props, component, path) {
var key = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : undefined;
@@ -3852,7 +3874,7 @@ var BaseTreeContainer = /*#__PURE__*/function (_Component) {
}
}, {
key: "getComponent",
- value: function getComponent(_dashprivate_layout, children, loading_state, setProps) {
+ value: function getComponent(_dashprivate_layout, children, loading_state, setProps, _extraProps) {
var _this4 = this;
var _this$props2 = this.props,
_dashprivate_config = _this$props2._dashprivate_config,
@@ -3869,7 +3891,7 @@ var BaseTreeContainer = /*#__PURE__*/function (_Component) {
// Hydrate components props
var childrenProps = (0,ramda__WEBPACK_IMPORTED_MODULE_25__["default"])([], ['children_props', _dashprivate_layout.namespace, _dashprivate_layout.type], _dashprivate_config);
- var props = (0,ramda__WEBPACK_IMPORTED_MODULE_26__["default"])('children', _dashprivate_layout.props);
+ var props = (0,ramda__WEBPACK_IMPORTED_MODULE_13__["default"])((0,ramda__WEBPACK_IMPORTED_MODULE_26__["default"])('children', _dashprivate_layout.props), _extraProps);
var _loop = function _loop() {
var childrenProp = childrenProps[i];
var handleObject = function handleObject(obj, opath) {
@@ -4039,12 +4061,12 @@ var BaseTreeContainer = /*#__PURE__*/function (_Component) {
_dashprivate_layout = _this$props3._dashprivate_layout,
_dashprivate_loadingState = _this$props3._dashprivate_loadingState,
_dashprivate_path = _this$props3._dashprivate_path;
+ var _extraProps = (0,ramda__WEBPACK_IMPORTED_MODULE_32__["default"])(['id', '_dashprivate_error', '_dashprivate_layout', '_dashprivate_loadingState', '_dashprivate_loadingStateHash', '_dashprivate_path', '_dashprivate_config', '_dashprivate_dispatch', '_dashprivate_graphs', '_dashprivate_loadingMap'], this.props);
var layoutProps = this.getLayoutProps();
var children = this.getChildren(layoutProps.children, _dashprivate_path);
- return this.getComponent(_dashprivate_layout, children, _dashprivate_loadingState, this.setProps);
+ return this.getComponent(_dashprivate_layout, children, _dashprivate_loadingState, this.setProps, _extraProps);
}
}]);
- return BaseTreeContainer;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
TreeContainer.propTypes = {
_dashprivate_error: (prop_types__WEBPACK_IMPORTED_MODULE_1___default().any),
@@ -4081,7 +4103,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _utils__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils */ "./src/actions/utils.js");
/* harmony import */ var _constants__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./constants */ "./src/actions/constants.js");
/* harmony import */ var _constants_constants__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../constants/constants */ "./src/constants/constants.js");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
@@ -4336,7 +4358,7 @@ __webpack_require__.r(__webpack_exports__);
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
@@ -4527,7 +4549,6 @@ function validateDependencies(parsedDependencies, dispatchError) {
var hasOutputs = true;
if (outputs.length === 1 && !outputs[0].id && !outputs[0].property) {
hasOutputs = false;
- dispatchError('A callback is missing Outputs', ['Please provide an output for this callback:', JSON.stringify(dep, null, 2)]);
}
var head = 'In the callback for output(s):\n ' + outputs.map(_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__.combineIdAndProp).join('\n ');
if (!inputs.length) {
@@ -4551,8 +4572,10 @@ function validateDependencies(parsedDependencies, dispatchError) {
validateArg(idProp, head, cls, i, dispatchError);
});
});
- findDuplicateOutputs(outputs, head, dispatchError, outStrs, outObjs);
- findMismatchedWildcards(outputs, inputs, state, head, dispatchError);
+ if (hasOutputs) {
+ findDuplicateOutputs(outputs, head, dispatchError, outStrs, outObjs);
+ findMismatchedWildcards(outputs, inputs, state, head, dispatchError);
+ }
});
}
function validateArg(_ref3, head, cls, i, dispatchError) {
@@ -4652,7 +4675,7 @@ function checkInOutOverlap(out, inputs) {
});
}
function findMismatchedWildcards(outputs, inputs, state, head, dispatchError) {
- var _findWildcardKeys = findWildcardKeys(outputs[0].id),
+ var _findWildcardKeys = findWildcardKeys(outputs.length ? outputs[0].id : undefined),
out0MatchKeys = _findWildcardKeys.matchKeys;
outputs.forEach(function (out, i) {
if (i && !(0,ramda__WEBPACK_IMPORTED_MODULE_8__["default"])(findWildcardKeys(out.id).matchKeys, out0MatchKeys)) {
@@ -4852,14 +4875,21 @@ function computeGraphs(dependencies, dispatchError) {
id: parseIfWildcard
}));
var parsedDependencies = (0,ramda__WEBPACK_IMPORTED_MODULE_6__["default"])(function (dep) {
- var output = dep.output;
+ var output = dep.output,
+ no_output = dep.no_output;
var out = (0,ramda__WEBPACK_IMPORTED_MODULE_21__["default"])({
inputs: fixIds,
state: fixIds
}, dep);
- out.outputs = (0,ramda__WEBPACK_IMPORTED_MODULE_6__["default"])(function (outi) {
- return (0,ramda__WEBPACK_IMPORTED_MODULE_22__["default"])('out', true, splitIdAndProp(outi));
- }, isMultiOutputProp(output) ? parseMultipleOutputs(output) : [output]);
+ if (no_output) {
+ // No output case
+ out.outputs = [];
+ out.noOutput = true;
+ } else {
+ out.outputs = (0,ramda__WEBPACK_IMPORTED_MODULE_6__["default"])(function (outi) {
+ return (0,ramda__WEBPACK_IMPORTED_MODULE_22__["default"])('out', true, splitIdAndProp(outi));
+ }, isMultiOutputProp(output) ? parseMultipleOutputs(output) : [output]);
+ }
return out;
}, dependencies);
var hasError = false;
@@ -5050,7 +5080,7 @@ function computeGraphs(dependencies, dispatchError) {
// Also collect MATCH keys in the output (all outputs must share these)
// and ALL keys in the first output (need not be shared but we'll use
// the first output for calculations) for later convenience.
- var _findWildcardKeys3 = findWildcardKeys(outputs[0].id),
+ var _findWildcardKeys3 = findWildcardKeys(outputs.length ? outputs[0].id : undefined),
matchKeys = _findWildcardKeys3.matchKeys;
var firstSingleOutput = (0,ramda__WEBPACK_IMPORTED_MODULE_24__["default"])(function (o) {
return !isMultiValued(o.id);
@@ -5315,9 +5345,7 @@ function addAllResolvedFromOutputs(resolve, paths, matches) {
}
} else {
var cb = (0,_dependencies_ts__WEBPACK_IMPORTED_MODULE_2__.makeResolvedCallback)(callback, resolve, '');
- if ((0,ramda__WEBPACK_IMPORTED_MODULE_19__["default"])(cb.getOutputs(paths)).length) {
- matches.push(cb);
- }
+ matches.push(cb);
}
};
}
@@ -5510,7 +5538,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _dependencies__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./dependencies */ "./src/actions/dependencies.js");
/* harmony import */ var _dependencies_ts__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./dependencies_ts */ "./src/actions/dependencies_ts.ts");
/* harmony import */ var _paths__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./paths */ "./src/actions/paths.js");
-function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == typeof h && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(typeof e + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
@@ -5846,7 +5874,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
@@ -5984,7 +6012,7 @@ var EventEmitter = /*#__PURE__*/function () {
_classCallCheck(this, EventEmitter);
this._ev = {};
}
- _createClass(EventEmitter, [{
+ return _createClass(EventEmitter, [{
key: "on",
value: function on(event, listener) {
var _this = this;
@@ -6032,7 +6060,6 @@ var EventEmitter = /*#__PURE__*/function () {
});
}
}]);
- return EventEmitter;
}();
/***/ }),
@@ -6167,13 +6194,13 @@ function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
+function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
function _isNativeReflectConstruct() { try { var t = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); } catch (t) {} return (_isNativeReflectConstruct = function _isNativeReflectConstruct() { return !!t; })(); }
function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }
-function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; }
function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); Object.defineProperty(subClass, "prototype", { writable: false }); if (superClass) _setPrototypeOf(subClass, superClass); }
function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }
@@ -6182,7 +6209,6 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var Reloader = /*#__PURE__*/function (_React$Component) {
- _inherits(Reloader, _React$Component);
function Reloader(props) {
var _this;
_classCallCheck(this, Reloader);
@@ -6205,10 +6231,11 @@ var Reloader = /*#__PURE__*/function (_React$Component) {
}
_this._retry = 0;
_this._head = document.querySelector('head');
- _this.clearInterval = _this.clearInterval.bind(_assertThisInitialized(_this));
+ _this.clearInterval = _this.clearInterval.bind(_this);
return _this;
}
- _createClass(Reloader, [{
+ _inherits(Reloader, _React$Component);
+ return _createClass(Reloader, [{
key: "clearInterval",
value: function clearInterval() {
window.clearInterval(this.state.intervalId);
@@ -6353,7 +6380,6 @@ var Reloader = /*#__PURE__*/function (_React$Component) {
return null;
}
}]);
- return Reloader;
}((react__WEBPACK_IMPORTED_MODULE_0___default().Component));
Reloader.defaultProps = {};
Reloader.propTypes = {
@@ -6458,8 +6484,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prop-types */ "prop-types");
/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_1__);
/* harmony import */ var react_redux__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! react-redux */ "./node_modules/react-redux/es/index.js");
-/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! cytoscape */ "./node_modules/cytoscape/dist/cytoscape.cjs.js");
-/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(cytoscape__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! cytoscape */ "./node_modules/cytoscape/dist/cytoscape.esm.mjs");
/* harmony import */ var react_cytoscapejs__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! react-cytoscapejs */ "./node_modules/react-cytoscapejs/dist/react-cytoscape.modern.js");
/* harmony import */ var cytoscape_dagre__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! cytoscape-dagre */ "./node_modules/cytoscape-dagre/cytoscape-dagre.js");
/* harmony import */ var cytoscape_dagre__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(cytoscape_dagre__WEBPACK_IMPORTED_MODULE_5__);
@@ -6496,7 +6521,7 @@ function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
function ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }
function _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }
function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
@@ -6513,8 +6538,8 @@ function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e =
-cytoscape__WEBPACK_IMPORTED_MODULE_3___default().use((cytoscape_dagre__WEBPACK_IMPORTED_MODULE_5___default()));
-cytoscape__WEBPACK_IMPORTED_MODULE_3___default().use((cytoscape_fcose__WEBPACK_IMPORTED_MODULE_6___default()));
+cytoscape__WEBPACK_IMPORTED_MODULE_3__["default"].use((cytoscape_dagre__WEBPACK_IMPORTED_MODULE_5___default()));
+cytoscape__WEBPACK_IMPORTED_MODULE_3__["default"].use((cytoscape_fcose__WEBPACK_IMPORTED_MODULE_6___default()));
/*
* Generates all the elements (nodes, edges) for the dependency graph.
@@ -6921,7 +6946,6 @@ function CallbackGraph() {
}
CallbackGraph.propTypes = {};
var UnconnectedCallbackGraphContainer = /*#__PURE__*/function (_Component) {
- _inherits(UnconnectedCallbackGraphContainer, _Component);
function UnconnectedCallbackGraphContainer(props) {
var _this;
_classCallCheck(this, UnconnectedCallbackGraphContainer);
@@ -6931,7 +6955,8 @@ var UnconnectedCallbackGraphContainer = /*#__PURE__*/function (_Component) {
};
return _this;
}
- _createClass(UnconnectedCallbackGraphContainer, [{
+ _inherits(UnconnectedCallbackGraphContainer, _Component);
+ return _createClass(UnconnectedCallbackGraphContainer, [{
key: "componentDidCatch",
value: function componentDidCatch(error, info) {
var dispatch = this.props.dispatch;
@@ -6959,7 +6984,6 @@ var UnconnectedCallbackGraphContainer = /*#__PURE__*/function (_Component) {
};
}
}]);
- return UnconnectedCallbackGraphContainer;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
UnconnectedCallbackGraphContainer.propTypes = {
dispatch: (prop_types__WEBPACK_IMPORTED_MODULE_1___default().func)
@@ -7305,7 +7329,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7318,7 +7342,6 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var ComponentErrorBoundary = /*#__PURE__*/function (_Component) {
- _inherits(ComponentErrorBoundary, _Component);
function ComponentErrorBoundary(props) {
var _this;
_classCallCheck(this, ComponentErrorBoundary);
@@ -7330,7 +7353,8 @@ var ComponentErrorBoundary = /*#__PURE__*/function (_Component) {
};
return _this;
}
- _createClass(ComponentErrorBoundary, [{
+ _inherits(ComponentErrorBoundary, _Component);
+ return _createClass(ComponentErrorBoundary, [{
key: "componentDidCatch",
value: function componentDidCatch(error, info) {
var dispatch = this.props.dispatch;
@@ -7369,7 +7393,6 @@ var ComponentErrorBoundary = /*#__PURE__*/function (_Component) {
};
}
}]);
- return ComponentErrorBoundary;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
ComponentErrorBoundary.propTypes = {
children: (prop_types__WEBPACK_IMPORTED_MODULE_1___default().object),
@@ -7405,7 +7428,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7423,7 +7446,6 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var FrontEndError = /*#__PURE__*/function (_Component) {
- _inherits(FrontEndError, _Component);
function FrontEndError(props) {
var _this;
_classCallCheck(this, FrontEndError);
@@ -7433,7 +7455,8 @@ var FrontEndError = /*#__PURE__*/function (_Component) {
};
return _this;
}
- _createClass(FrontEndError, [{
+ _inherits(FrontEndError, _Component);
+ return _createClass(FrontEndError, [{
key: "render",
value: function render() {
var _this2 = this;
@@ -7480,7 +7503,6 @@ var FrontEndError = /*#__PURE__*/function (_Component) {
}));
}
}]);
- return FrontEndError;
}(react__WEBPACK_IMPORTED_MODULE_2__.Component);
var MAX_MESSAGE_LENGTH = 40;
/* eslint-disable no-inline-comments */
@@ -7578,7 +7600,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7592,12 +7614,12 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var FrontEndErrorContainer = /*#__PURE__*/function (_Component) {
- _inherits(FrontEndErrorContainer, _Component);
function FrontEndErrorContainer(props) {
_classCallCheck(this, FrontEndErrorContainer);
return _callSuper(this, FrontEndErrorContainer, [props]);
}
- _createClass(FrontEndErrorContainer, [{
+ _inherits(FrontEndErrorContainer, _Component);
+ return _createClass(FrontEndErrorContainer, [{
key: "render",
value: function render() {
var _this$props = this.props,
@@ -7639,7 +7661,6 @@ var FrontEndErrorContainer = /*#__PURE__*/function (_Component) {
}, errorElements));
}
}]);
- return FrontEndErrorContainer;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
FrontEndErrorContainer.propTypes = {
id: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().string),
@@ -7673,7 +7694,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7687,12 +7708,12 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var UnconnectedGlobalErrorContainer = /*#__PURE__*/function (_Component) {
- _inherits(UnconnectedGlobalErrorContainer, _Component);
function UnconnectedGlobalErrorContainer(props) {
_classCallCheck(this, UnconnectedGlobalErrorContainer);
return _callSuper(this, UnconnectedGlobalErrorContainer, [props]);
}
- _createClass(UnconnectedGlobalErrorContainer, [{
+ _inherits(UnconnectedGlobalErrorContainer, _Component);
+ return _createClass(UnconnectedGlobalErrorContainer, [{
key: "render",
value: function render() {
var _this$props = this.props,
@@ -7709,7 +7730,6 @@ var UnconnectedGlobalErrorContainer = /*#__PURE__*/function (_Component) {
}, children)));
}
}]);
- return UnconnectedGlobalErrorContainer;
}(react__WEBPACK_IMPORTED_MODULE_1__.Component);
UnconnectedGlobalErrorContainer.propTypes = {
children: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().object),
@@ -7747,7 +7767,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7762,12 +7782,12 @@ function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf ? Objec
var GlobalErrorOverlay = /*#__PURE__*/function (_Component) {
- _inherits(GlobalErrorOverlay, _Component);
function GlobalErrorOverlay(props) {
_classCallCheck(this, GlobalErrorOverlay);
return _callSuper(this, GlobalErrorOverlay, [props]);
}
- _createClass(GlobalErrorOverlay, [{
+ _inherits(GlobalErrorOverlay, _Component);
+ return _createClass(GlobalErrorOverlay, [{
key: "render",
value: function render() {
var _this$props = this.props,
@@ -7792,7 +7812,6 @@ var GlobalErrorOverlay = /*#__PURE__*/function (_Component) {
}, frontEndErrors)));
}
}]);
- return GlobalErrorOverlay;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
GlobalErrorOverlay.propTypes = {
@@ -7832,7 +7851,7 @@ __webpack_require__.r(__webpack_exports__);
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -7868,7 +7887,6 @@ var buttonFactory = function buttonFactory(enabled, buttonVariant, toggle, _Icon
}, label) : null));
};
var DebugMenu = /*#__PURE__*/function (_Component) {
- _inherits(DebugMenu, _Component);
function DebugMenu(props) {
var _this;
_classCallCheck(this, DebugMenu);
@@ -7880,7 +7898,8 @@ var DebugMenu = /*#__PURE__*/function (_Component) {
};
return _this;
}
- _createClass(DebugMenu, [{
+ _inherits(DebugMenu, _Component);
+ return _createClass(DebugMenu, [{
key: "render",
value: function render() {
var _this2 = this;
@@ -7939,7 +7958,6 @@ var DebugMenu = /*#__PURE__*/function (_Component) {
}, this.props.children));
}
}]);
- return DebugMenu;
}(react__WEBPACK_IMPORTED_MODULE_0__.Component);
DebugMenu.propTypes = {
children: (prop_types__WEBPACK_IMPORTED_MODULE_1___default().object),
@@ -7980,6 +7998,9 @@ __webpack_require__.r(__webpack_exports__);
/* harmony export */ STATUS: function() { return /* binding */ STATUS; },
/* harmony export */ STATUSMAP: function() { return /* binding */ STATUSMAP; }
/* harmony export */ });
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
var REDIRECT_URI_PATHNAME = '/_oauth2/callback';
var OAUTH_COOKIE_NAME = 'plotly_oauth_token';
var JWT_EXPIRED_MESSAGE = 'JWT Expired';
@@ -7994,10 +8015,7 @@ var STATUS = {
CLIENTSIDE_ERROR: 'CLIENTSIDE_ERROR',
NO_RESPONSE: 'NO_RESPONSE'
};
-var STATUSMAP = {
- [STATUS.OK]: 'SUCCESS',
- [STATUS.PREVENT_UPDATE]: 'NO_UPDATE'
-};
+var STATUSMAP = _defineProperty(_defineProperty({}, STATUS.OK, 'SUCCESS'), STATUS.PREVENT_UPDATE, 'NO_UPDATE');
/***/ }),
@@ -8173,7 +8191,7 @@ function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
/**
* Generalized persistence for component props
@@ -8271,7 +8289,7 @@ var WebStore = /*#__PURE__*/function () {
this._name = backEnd;
this._storage = window[backEnd];
}
- _createClass(WebStore, [{
+ return _createClass(WebStore, [{
key: "hasItem",
value: function hasItem(key) {
return this._storage.getItem(storePrefix + key) !== null;
@@ -8335,14 +8353,13 @@ var WebStore = /*#__PURE__*/function () {
}, keysToRemove);
}
}]);
- return WebStore;
}();
var MemStore = /*#__PURE__*/function () {
function MemStore() {
_classCallCheck(this, MemStore);
this._data = {};
}
- _createClass(MemStore, [{
+ return _createClass(MemStore, [{
key: "hasItem",
value: function hasItem(key) {
return key in this._data;
@@ -8377,7 +8394,6 @@ var MemStore = /*#__PURE__*/function () {
}
}
}]);
- return MemStore;
}(); // Make a string 2^16 characters long (*2 bytes/char = 130kB), to test storage.
// That should be plenty for common persistence use cases,
// without getting anywhere near typical browser limits
@@ -9071,7 +9087,7 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var _constants_constants__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../constants/constants */ "./src/constants/constants.js");
var _excluded = ["__dash_client", "__dash_server", "__dash_upload", "__dash_download"];
function _objectWithoutProperties(source, excluded) { if (source == null) return {}; var target = _objectWithoutPropertiesLoose(source, excluded); var key, i; if (Object.getOwnPropertySymbols) { var sourceSymbolKeys = Object.getOwnPropertySymbols(source); for (i = 0; i < sourceSymbolKeys.length; i++) { key = sourceSymbolKeys[i]; if (excluded.indexOf(key) >= 0) continue; if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue; target[key] = source[key]; } } return target; }
-function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; var sourceKeys = Object.keys(source); var key, i; for (i = 0; i < sourceKeys.length; i++) { key = sourceKeys[i]; if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } return target; }
+function _objectWithoutPropertiesLoose(source, excluded) { if (source == null) return {}; var target = {}; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { if (excluded.indexOf(key) >= 0) continue; target[key] = source[key]; } } return target; }
var defaultProfile = {
@@ -10894,12 +10910,11 @@ __webpack_require__.r(__webpack_exports__);
/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_0__);
/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! prop-types */ "prop-types");
/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_1__);
-/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! cytoscape */ "./node_modules/cytoscape/dist/cytoscape.cjs.js");
-/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(cytoscape__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var cytoscape__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! cytoscape */ "./node_modules/cytoscape/dist/cytoscape.esm.mjs");
function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a 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, _toPropertyKey(descriptor.key), descriptor); } }
function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
-function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : String(i); }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
function _callSuper(t, o, e) { return o = _getPrototypeOf(o), _possibleConstructorReturn(t, _isNativeReflectConstruct() ? Reflect.construct(o, e || [], _getPrototypeOf(t).constructor) : o.apply(t, e)); }
function _possibleConstructorReturn(self, call) { if (call && (typeof call === "object" || typeof call === "function")) { return call; } else if (call !== void 0) { throw new TypeError("Derived constructors may only return object or undefined"); } return _assertThisInitialized(self); }
@@ -11073,14 +11088,14 @@ var o = (prop_types__WEBPACK_IMPORTED_MODULE_1___default().string),
s(c, l(t, "scratch")) && i.scratch(o(c)), Object.keys(r).length > 0 && i.json(r);
};
var w = /*#__PURE__*/function (_e$Component) {
- _inherits(w, _e$Component);
function w(t) {
var _this;
_classCallCheck(this, w);
_this = _callSuper(this, w, [t]), _this.displayName = "CytoscapeComponent", _this.containerRef = react__WEBPACK_IMPORTED_MODULE_0___default().createRef();
return _this;
}
- _createClass(w, [{
+ _inherits(w, _e$Component);
+ return _createClass(w, [{
key: "componentDidMount",
value: function componentDidMount() {
var e = this.containerRef.current,
@@ -11094,7 +11109,7 @@ var w = /*#__PURE__*/function (_e$Component) {
r = _this$props.motionBlurOpacity,
c = _this$props.wheelSensitivity,
u = _this$props.pixelRatio,
- d = this._cy = new (cytoscape__WEBPACK_IMPORTED_MODULE_2___default())({
+ d = this._cy = new cytoscape__WEBPACK_IMPORTED_MODULE_2__["default"]({
container: e,
headless: o,
styleEnabled: l,
@@ -11162,7 +11177,6 @@ var w = /*#__PURE__*/function (_e$Component) {
}
}
}]);
- return w;
}((react__WEBPACK_IMPORTED_MODULE_0___default().Component));
@@ -19882,42 +19896,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `._dash-undo-redo {
- position: fixed;
- bottom: 30px;
- left: 30px;
- font-size: 20px;
- text-align: center;
- z-index: 9999;
- background-color: rgba(255, 255, 255, 0.9);
-
-}
-._dash-undo-redo>div {
- position: relative;
-}
-._dash-undo-redo-link {
- color: #0074D9;
- cursor: pointer;
- margin-left: 10px;
- margin-right: 10px;
- display: inline-block;
- opacity: 0.2;
-}
-._dash-undo-redo-link:hover {
- opacity: 1;
-}
-._dash-undo-redo-link ._dash-icon-undo {
- font-size: 20px;
- transform: rotate(270deg);
-}
-._dash-undo-redo-link ._dash-icon-redo {
- font-size: 20px;
- transform: rotate(90deg);
-}
-._dash-undo-redo-link ._dash-undo-redo-label {
- font-size: 15px;
-}
-`, "",{"version":3,"sources":["webpack://./src/components/core/Toolbar.css"],"names":[],"mappings":"AAAA;IACI,eAAe;IACf,YAAY;IACZ,UAAU;IACV,eAAe;IACf,kBAAkB;IAClB,aAAa;IACb,0CAA0C;;AAE9C;AACA;IACI,kBAAkB;AACtB;AACA;IACI,cAAc;IACd,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,qBAAqB;IACrB,YAAY;AAChB;AACA;IACI,UAAU;AACd;AACA;IACI,eAAe;IACf,yBAAyB;AAC7B;AACA;IACI,eAAe;IACf,wBAAwB;AAC5B;AACA;IACI,eAAe;AACnB","sourcesContent":["._dash-undo-redo {\n position: fixed;\n bottom: 30px;\n left: 30px;\n font-size: 20px;\n text-align: center;\n z-index: 9999;\n background-color: rgba(255, 255, 255, 0.9);\n\n}\n._dash-undo-redo>div {\n position: relative;\n}\n._dash-undo-redo-link {\n color: #0074D9;\n cursor: pointer;\n margin-left: 10px;\n margin-right: 10px;\n display: inline-block;\n opacity: 0.2;\n}\n._dash-undo-redo-link:hover {\n opacity: 1;\n}\n._dash-undo-redo-link ._dash-icon-undo {\n font-size: 20px;\n transform: rotate(270deg);\n}\n._dash-undo-redo-link ._dash-icon-redo {\n font-size: 20px;\n transform: rotate(90deg);\n}\n._dash-undo-redo-link ._dash-undo-redo-label {\n font-size: 15px;\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, "._dash-undo-redo {\n position: fixed;\n bottom: 30px;\n left: 30px;\n font-size: 20px;\n text-align: center;\n z-index: 9999;\n background-color: rgba(255, 255, 255, 0.9);\n\n}\n._dash-undo-redo>div {\n position: relative;\n}\n._dash-undo-redo-link {\n color: #0074D9;\n cursor: pointer;\n margin-left: 10px;\n margin-right: 10px;\n display: inline-block;\n opacity: 0.2;\n}\n._dash-undo-redo-link:hover {\n opacity: 1;\n}\n._dash-undo-redo-link ._dash-icon-undo {\n font-size: 20px;\n transform: rotate(270deg);\n}\n._dash-undo-redo-link ._dash-icon-redo {\n font-size: 20px;\n transform: rotate(90deg);\n}\n._dash-undo-redo-link ._dash-undo-redo-label {\n font-size: 15px;\n}\n", "",{"version":3,"sources":["webpack://./src/components/core/Toolbar.css"],"names":[],"mappings":"AAAA;IACI,eAAe;IACf,YAAY;IACZ,UAAU;IACV,eAAe;IACf,kBAAkB;IAClB,aAAa;IACb,0CAA0C;;AAE9C;AACA;IACI,kBAAkB;AACtB;AACA;IACI,cAAc;IACd,eAAe;IACf,iBAAiB;IACjB,kBAAkB;IAClB,qBAAqB;IACrB,YAAY;AAChB;AACA;IACI,UAAU;AACd;AACA;IACI,eAAe;IACf,yBAAyB;AAC7B;AACA;IACI,eAAe;IACf,wBAAwB;AAC5B;AACA;IACI,eAAe;AACnB","sourcesContent":["._dash-undo-redo {\n position: fixed;\n bottom: 30px;\n left: 30px;\n font-size: 20px;\n text-align: center;\n z-index: 9999;\n background-color: rgba(255, 255, 255, 0.9);\n\n}\n._dash-undo-redo>div {\n position: relative;\n}\n._dash-undo-redo-link {\n color: #0074D9;\n cursor: pointer;\n margin-left: 10px;\n margin-right: 10px;\n display: inline-block;\n opacity: 0.2;\n}\n._dash-undo-redo-link:hover {\n opacity: 1;\n}\n._dash-undo-redo-link ._dash-icon-undo {\n font-size: 20px;\n transform: rotate(270deg);\n}\n._dash-undo-redo-link ._dash-icon-redo {\n font-size: 20px;\n transform: rotate(90deg);\n}\n._dash-undo-redo-link ._dash-undo-redo-label {\n font-size: 15px;\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -19941,54 +19920,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `.dash-callback-dag--container {
- border-radius: 4px;
- position: fixed;
- bottom: 165px;
- right: 16px;
- width: 80vw;
- height: calc(100vh - 180px);
- overflow: auto;
- box-sizing: border-box;
- background: #ffffff;
- display: inline-block;
- /* shadow-1 */
- box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),
- 0px 2px 6px rgba(80, 103, 132, 0.12),
- 0px 0px 1px rgba(80, 103, 132, 0.32);
-}
-
-.dash-callback-dag--info {
- border-radius: 4px;
- position: absolute;
- padding: 8px;
- bottom: 16px;
- left: 16px;
- max-width: calc(100% - 32px);
- max-height: 50%;
- overflow: auto;
- box-sizing: border-box;
- background: rgba(255,255,255,0.9);
- border: 2px solid #ccc;
- font-family: "Arial", sans-serif;
-}
-
-.dash-callback-dag--message {
- display: flex;
- flex-direction: column;
- justify-content: center;
- align-items: center;
- height: 100%;
- line-height: 2em;
- font-family: "Arial", sans-serif;
-}
-
-.dash-callback-dag--layoutSelector {
- position: absolute;
- top: 10px;
- right: 10px;
-}
-`, "",{"version":3,"sources":["webpack://./src/components/error/CallbackGraph/CallbackGraphContainer.css"],"names":[],"mappings":"AAAA;IACI,kBAAkB;IAClB,eAAe;IACf,aAAa;IACb,WAAW;IACX,WAAW;IACX,2BAA2B;IAC3B,cAAc;IACd,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,aAAa;IACb;;4CAEwC;AAC5C;;AAEA;IACI,kBAAkB;IAClB,kBAAkB;IAClB,YAAY;IACZ,YAAY;IACZ,UAAU;IACV,4BAA4B;IAC5B,eAAe;IACf,cAAc;IACd,sBAAsB;IACtB,iCAAiC;IACjC,sBAAsB;IACtB,gCAAgC;AACpC;;AAEA;IACI,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,YAAY;IACZ,gBAAgB;IAChB,gCAAgC;AACpC;;AAEA;IACI,kBAAkB;IAClB,SAAS;IACT,WAAW;AACf","sourcesContent":[".dash-callback-dag--container {\n border-radius: 4px;\n position: fixed;\n bottom: 165px;\n right: 16px;\n width: 80vw;\n height: calc(100vh - 180px);\n overflow: auto;\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n}\n\n.dash-callback-dag--info {\n border-radius: 4px;\n position: absolute;\n padding: 8px;\n bottom: 16px;\n left: 16px;\n max-width: calc(100% - 32px);\n max-height: 50%;\n overflow: auto;\n box-sizing: border-box;\n background: rgba(255,255,255,0.9);\n border: 2px solid #ccc;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--message {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n height: 100%;\n line-height: 2em;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--layoutSelector {\n position: absolute;\n top: 10px;\n right: 10px;\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, ".dash-callback-dag--container {\n border-radius: 4px;\n position: fixed;\n bottom: 165px;\n right: 16px;\n width: 80vw;\n height: calc(100vh - 180px);\n overflow: auto;\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n}\n\n.dash-callback-dag--info {\n border-radius: 4px;\n position: absolute;\n padding: 8px;\n bottom: 16px;\n left: 16px;\n max-width: calc(100% - 32px);\n max-height: 50%;\n overflow: auto;\n box-sizing: border-box;\n background: rgba(255,255,255,0.9);\n border: 2px solid #ccc;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--message {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n height: 100%;\n line-height: 2em;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--layoutSelector {\n position: absolute;\n top: 10px;\n right: 10px;\n}\n", "",{"version":3,"sources":["webpack://./src/components/error/CallbackGraph/CallbackGraphContainer.css"],"names":[],"mappings":"AAAA;IACI,kBAAkB;IAClB,eAAe;IACf,aAAa;IACb,WAAW;IACX,WAAW;IACX,2BAA2B;IAC3B,cAAc;IACd,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,aAAa;IACb;;4CAEwC;AAC5C;;AAEA;IACI,kBAAkB;IAClB,kBAAkB;IAClB,YAAY;IACZ,YAAY;IACZ,UAAU;IACV,4BAA4B;IAC5B,eAAe;IACf,cAAc;IACd,sBAAsB;IACtB,iCAAiC;IACjC,sBAAsB;IACtB,gCAAgC;AACpC;;AAEA;IACI,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,YAAY;IACZ,gBAAgB;IAChB,gCAAgC;AACpC;;AAEA;IACI,kBAAkB;IAClB,SAAS;IACT,WAAW;AACf","sourcesContent":[".dash-callback-dag--container {\n border-radius: 4px;\n position: fixed;\n bottom: 165px;\n right: 16px;\n width: 80vw;\n height: calc(100vh - 180px);\n overflow: auto;\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n}\n\n.dash-callback-dag--info {\n border-radius: 4px;\n position: absolute;\n padding: 8px;\n bottom: 16px;\n left: 16px;\n max-width: calc(100% - 32px);\n max-height: 50%;\n overflow: auto;\n box-sizing: border-box;\n background: rgba(255,255,255,0.9);\n border: 2px solid #ccc;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--message {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n height: 100%;\n line-height: 2em;\n font-family: \"Arial\", sans-serif;\n}\n\n.dash-callback-dag--layoutSelector {\n position: absolute;\n top: 10px;\n right: 10px;\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -20012,148 +19944,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `.error-container {
- margin-top: 10px;
-}
-
-.dash-fe-error__icon-x {
- position: absolute;
- right: 0;
- top: 0;
- color: #B9C2CE;
- font-size: 20px;
- cursor: pointer;
- margin-right: 10px
-}
-
-.dash-fe-error__icon-x:hover
-{
- color:#a1a9b5;
-}
-
-
-.dash-fe-errors {
- min-width: 386px;
- max-width: 650px;
- max-height: 450px;
- display: inline-block;
-}
-
-.dash-fe-error__icon-error {
- width: 20px;
- height: 20px;
- display: inline-block;
- margin-right: 16px;
-}
-.dash-fe-error__icon-close {
- width: 10px;
- height: 10px;
- position: absolute;
- right: 12px;
- top: 12px;
- display: inline-block;
-}
-.dash-fe-error__icon-arrow {
- width: 8px;
- height: 28px;
- margin: 0px 8px;
-}
-.dash-fe-error-top {
- height: 20px;
- display: flex;
- justify-content: space-between;
- width: 100%;
- cursor: pointer;
-}
-.dash-fe-error-top__group:first-child {
- /*
- * 77% is the maximum space allowed based off of the other elements
- * in the top part of the error container (timestamp & collapse arrow).
- * this was manually determined */
- width: 77%;
-}
-.dash-fe-error-top__group {
- display: inline-flex;
- align-items: center;
-}
-.dash-fe-error__title {
- text-align: left;
- margin: 0px;
- margin-left: 5px;
- padding: 0px;
- font-size: 14px;
- display: inline-block;
- text-overflow: ellipsis;
- white-space: nowrap;
- overflow: hidden;
-}
-.dash-fe-error__timestamp {
- margin-right: 20px;
-}
-.dash-fe-error__collapse--flipped {
- -webkit-transform: rotate(180deg);
- -ms-transform: rotate(180deg);
- transform: rotate(180deg);
-}
-
-.dash-fe-error__info_title {
- margin: 0;
- color: #506784;
- font-size: 16px;
- background-color: #f3f6fa;
- border: 2px solid #dfe8f3;
- box-sizing: border-box;
- border-top-left-radius: 4px;
- border-top-right-radius: 4px;
- padding: 10px;
-}
-
-.dash-fe-error__info {
- border: 1px solid #dfe8f3;
- margin: 0 0 1em 0;
- padding: 10px;
-
- background-color: white;
- border: 2px solid #dfe8f3;
- color: #506784;
- overflow: auto;
- white-space: pre-wrap;
-}
-
-.dash-fe-error__curved {
- border-radius: 4px;
-}
-
-.dash-fe-error__curved-top {
- border-top-left-radius: 4px;
- border-top-right-radius: 4px;
- border-bottom-width: 0px;
-}
-
-.dash-fe-error__curved-bottom {
- border-radius-bottom-left: 4px;
- border-radius-bottom-right: 4px;
- background-color: #FFEFEF;
-}
-
-.dash-be-error__st {
- background-color: #fdf3f4;
- min-width: 386px;
- max-width: 650px;
- /* iframe container handles the scrolling */
- overflow: hidden;
- display: inline-block;
-}
-
-.dash-be-error__str {
- background-color: #fdf3f4;
- min-width: 386px;
- max-width: 650px;
- overflow: auto;
- display: inline-block;
- white-space: pre-wrap;
-}
-`, "",{"version":3,"sources":["webpack://./src/components/error/FrontEnd/FrontEndError.css"],"names":[],"mappings":"AAAA;IACI,gBAAgB;AACpB;;AAEA;IACI,kBAAkB;IAClB,QAAQ;IACR,MAAM;IACN,cAAc;IACd,eAAe;IACf,eAAe;IACf;AACJ;;AAEA;;CAEC,aAAa;AACd;;;AAGA;IACI,gBAAgB;IAChB,gBAAgB;IAChB,iBAAiB;IACjB,qBAAqB;AACzB;;AAEA;IACI,WAAW;IACX,YAAY;IACZ,qBAAqB;IACrB,kBAAkB;AACtB;AACA;IACI,WAAW;IACX,YAAY;IACZ,kBAAkB;IAClB,WAAW;IACX,SAAS;IACT,qBAAqB;AACzB;AACA;IACI,UAAU;IACV,YAAY;IACZ,eAAe;AACnB;AACA;IACI,YAAY;IACZ,aAAa;IACb,8BAA8B;IAC9B,WAAW;IACX,eAAe;AACnB;AACA;IACI;;;qCAGiC;IACjC,UAAU;AACd;AACA;IACI,oBAAoB;IACpB,mBAAmB;AACvB;AACA;IACI,gBAAgB;IAChB,WAAW;IACX,gBAAgB;IAChB,YAAY;IACZ,eAAe;IACf,qBAAqB;IACrB,uBAAuB;IACvB,mBAAmB;IACnB,gBAAgB;AACpB;AACA;IACI,kBAAkB;AACtB;AACA;IACI,iCAAiC;IACjC,6BAA6B;IAC7B,yBAAyB;AAC7B;;AAEA;IACI,SAAS;IACT,cAAc;IACd,eAAe;IACf,yBAAyB;IACzB,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,4BAA4B;IAC5B,aAAa;AACjB;;AAEA;IACI,yBAAyB;IACzB,iBAAiB;IACjB,aAAa;;IAEb,uBAAuB;IACvB,yBAAyB;IACzB,cAAc;IACd,cAAc;IACd,qBAAqB;AACzB;;AAEA;IACI,kBAAkB;AACtB;;AAEA;IACI,2BAA2B;IAC3B,4BAA4B;IAC5B,wBAAwB;AAC5B;;AAEA;IACI,8BAA8B;IAC9B,+BAA+B;IAC/B,yBAAyB;AAC7B;;AAEA;IACI,yBAAyB;IACzB,gBAAgB;IAChB,gBAAgB;IAChB,2CAA2C;IAC3C,gBAAgB;IAChB,qBAAqB;AACzB;;AAEA;IACI,yBAAyB;IACzB,gBAAgB;IAChB,gBAAgB;IAChB,cAAc;IACd,qBAAqB;IACrB,qBAAqB;AACzB","sourcesContent":[".error-container {\n margin-top: 10px;\n}\n\n.dash-fe-error__icon-x {\n position: absolute;\n right: 0;\n top: 0;\n color: #B9C2CE;\n font-size: 20px;\n cursor: pointer;\n margin-right: 10px\n}\n\n.dash-fe-error__icon-x:hover\n{\n color:#a1a9b5;\n}\n\n\n.dash-fe-errors {\n min-width: 386px;\n max-width: 650px;\n max-height: 450px;\n display: inline-block;\n}\n\n.dash-fe-error__icon-error {\n width: 20px;\n height: 20px;\n display: inline-block;\n margin-right: 16px;\n}\n.dash-fe-error__icon-close {\n width: 10px;\n height: 10px;\n position: absolute;\n right: 12px;\n top: 12px;\n display: inline-block;\n}\n.dash-fe-error__icon-arrow {\n width: 8px;\n height: 28px;\n margin: 0px 8px;\n}\n.dash-fe-error-top {\n height: 20px;\n display: flex;\n justify-content: space-between;\n width: 100%;\n cursor: pointer;\n}\n.dash-fe-error-top__group:first-child {\n /*\n * 77% is the maximum space allowed based off of the other elements\n * in the top part of the error container (timestamp & collapse arrow).\n * this was manually determined */\n width: 77%;\n}\n.dash-fe-error-top__group {\n display: inline-flex;\n align-items: center;\n}\n.dash-fe-error__title {\n text-align: left;\n margin: 0px;\n margin-left: 5px;\n padding: 0px;\n font-size: 14px;\n display: inline-block;\n text-overflow: ellipsis;\n white-space: nowrap;\n overflow: hidden;\n}\n.dash-fe-error__timestamp {\n margin-right: 20px;\n}\n.dash-fe-error__collapse--flipped {\n -webkit-transform: rotate(180deg);\n -ms-transform: rotate(180deg);\n transform: rotate(180deg);\n}\n\n.dash-fe-error__info_title {\n margin: 0;\n color: #506784;\n font-size: 16px;\n background-color: #f3f6fa;\n border: 2px solid #dfe8f3;\n box-sizing: border-box;\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n padding: 10px;\n}\n\n.dash-fe-error__info {\n border: 1px solid #dfe8f3;\n margin: 0 0 1em 0;\n padding: 10px;\n\n background-color: white;\n border: 2px solid #dfe8f3;\n color: #506784;\n overflow: auto;\n white-space: pre-wrap;\n}\n\n.dash-fe-error__curved {\n border-radius: 4px;\n}\n\n.dash-fe-error__curved-top {\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n border-bottom-width: 0px;\n}\n\n.dash-fe-error__curved-bottom {\n border-radius-bottom-left: 4px;\n border-radius-bottom-right: 4px;\n background-color: #FFEFEF;\n}\n\n.dash-be-error__st {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n /* iframe container handles the scrolling */\n overflow: hidden;\n display: inline-block;\n}\n\n.dash-be-error__str {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n overflow: auto;\n display: inline-block;\n white-space: pre-wrap;\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, ".error-container {\n margin-top: 10px;\n}\n\n.dash-fe-error__icon-x {\n position: absolute;\n right: 0;\n top: 0;\n color: #B9C2CE;\n font-size: 20px;\n cursor: pointer;\n margin-right: 10px\n}\n\n.dash-fe-error__icon-x:hover\n{\n color:#a1a9b5;\n}\n\n\n.dash-fe-errors {\n min-width: 386px;\n max-width: 650px;\n max-height: 450px;\n display: inline-block;\n}\n\n.dash-fe-error__icon-error {\n width: 20px;\n height: 20px;\n display: inline-block;\n margin-right: 16px;\n}\n.dash-fe-error__icon-close {\n width: 10px;\n height: 10px;\n position: absolute;\n right: 12px;\n top: 12px;\n display: inline-block;\n}\n.dash-fe-error__icon-arrow {\n width: 8px;\n height: 28px;\n margin: 0px 8px;\n}\n.dash-fe-error-top {\n height: 20px;\n display: flex;\n justify-content: space-between;\n width: 100%;\n cursor: pointer;\n}\n.dash-fe-error-top__group:first-child {\n /*\n * 77% is the maximum space allowed based off of the other elements\n * in the top part of the error container (timestamp & collapse arrow).\n * this was manually determined */\n width: 77%;\n}\n.dash-fe-error-top__group {\n display: inline-flex;\n align-items: center;\n}\n.dash-fe-error__title {\n text-align: left;\n margin: 0px;\n margin-left: 5px;\n padding: 0px;\n font-size: 14px;\n display: inline-block;\n text-overflow: ellipsis;\n white-space: nowrap;\n overflow: hidden;\n}\n.dash-fe-error__timestamp {\n margin-right: 20px;\n}\n.dash-fe-error__collapse--flipped {\n -webkit-transform: rotate(180deg);\n -ms-transform: rotate(180deg);\n transform: rotate(180deg);\n}\n\n.dash-fe-error__info_title {\n margin: 0;\n color: #506784;\n font-size: 16px;\n background-color: #f3f6fa;\n border: 2px solid #dfe8f3;\n box-sizing: border-box;\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n padding: 10px;\n}\n\n.dash-fe-error__info {\n border: 1px solid #dfe8f3;\n margin: 0 0 1em 0;\n padding: 10px;\n\n background-color: white;\n border: 2px solid #dfe8f3;\n color: #506784;\n overflow: auto;\n white-space: pre-wrap;\n}\n\n.dash-fe-error__curved {\n border-radius: 4px;\n}\n\n.dash-fe-error__curved-top {\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n border-bottom-width: 0px;\n}\n\n.dash-fe-error__curved-bottom {\n border-radius-bottom-left: 4px;\n border-radius-bottom-right: 4px;\n background-color: #FFEFEF;\n}\n\n.dash-be-error__st {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n /* iframe container handles the scrolling */\n overflow: hidden;\n display: inline-block;\n}\n\n.dash-be-error__str {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n overflow: auto;\n display: inline-block;\n white-space: pre-wrap;\n}\n", "",{"version":3,"sources":["webpack://./src/components/error/FrontEnd/FrontEndError.css"],"names":[],"mappings":"AAAA;IACI,gBAAgB;AACpB;;AAEA;IACI,kBAAkB;IAClB,QAAQ;IACR,MAAM;IACN,cAAc;IACd,eAAe;IACf,eAAe;IACf;AACJ;;AAEA;;CAEC,aAAa;AACd;;;AAGA;IACI,gBAAgB;IAChB,gBAAgB;IAChB,iBAAiB;IACjB,qBAAqB;AACzB;;AAEA;IACI,WAAW;IACX,YAAY;IACZ,qBAAqB;IACrB,kBAAkB;AACtB;AACA;IACI,WAAW;IACX,YAAY;IACZ,kBAAkB;IAClB,WAAW;IACX,SAAS;IACT,qBAAqB;AACzB;AACA;IACI,UAAU;IACV,YAAY;IACZ,eAAe;AACnB;AACA;IACI,YAAY;IACZ,aAAa;IACb,8BAA8B;IAC9B,WAAW;IACX,eAAe;AACnB;AACA;IACI;;;qCAGiC;IACjC,UAAU;AACd;AACA;IACI,oBAAoB;IACpB,mBAAmB;AACvB;AACA;IACI,gBAAgB;IAChB,WAAW;IACX,gBAAgB;IAChB,YAAY;IACZ,eAAe;IACf,qBAAqB;IACrB,uBAAuB;IACvB,mBAAmB;IACnB,gBAAgB;AACpB;AACA;IACI,kBAAkB;AACtB;AACA;IACI,iCAAiC;IACjC,6BAA6B;IAC7B,yBAAyB;AAC7B;;AAEA;IACI,SAAS;IACT,cAAc;IACd,eAAe;IACf,yBAAyB;IACzB,yBAAyB;IACzB,sBAAsB;IACtB,2BAA2B;IAC3B,4BAA4B;IAC5B,aAAa;AACjB;;AAEA;IACI,yBAAyB;IACzB,iBAAiB;IACjB,aAAa;;IAEb,uBAAuB;IACvB,yBAAyB;IACzB,cAAc;IACd,cAAc;IACd,qBAAqB;AACzB;;AAEA;IACI,kBAAkB;AACtB;;AAEA;IACI,2BAA2B;IAC3B,4BAA4B;IAC5B,wBAAwB;AAC5B;;AAEA;IACI,8BAA8B;IAC9B,+BAA+B;IAC/B,yBAAyB;AAC7B;;AAEA;IACI,yBAAyB;IACzB,gBAAgB;IAChB,gBAAgB;IAChB,2CAA2C;IAC3C,gBAAgB;IAChB,qBAAqB;AACzB;;AAEA;IACI,yBAAyB;IACzB,gBAAgB;IAChB,gBAAgB;IAChB,cAAc;IACd,qBAAqB;IACrB,qBAAqB;AACzB","sourcesContent":[".error-container {\n margin-top: 10px;\n}\n\n.dash-fe-error__icon-x {\n position: absolute;\n right: 0;\n top: 0;\n color: #B9C2CE;\n font-size: 20px;\n cursor: pointer;\n margin-right: 10px\n}\n\n.dash-fe-error__icon-x:hover\n{\n color:#a1a9b5;\n}\n\n\n.dash-fe-errors {\n min-width: 386px;\n max-width: 650px;\n max-height: 450px;\n display: inline-block;\n}\n\n.dash-fe-error__icon-error {\n width: 20px;\n height: 20px;\n display: inline-block;\n margin-right: 16px;\n}\n.dash-fe-error__icon-close {\n width: 10px;\n height: 10px;\n position: absolute;\n right: 12px;\n top: 12px;\n display: inline-block;\n}\n.dash-fe-error__icon-arrow {\n width: 8px;\n height: 28px;\n margin: 0px 8px;\n}\n.dash-fe-error-top {\n height: 20px;\n display: flex;\n justify-content: space-between;\n width: 100%;\n cursor: pointer;\n}\n.dash-fe-error-top__group:first-child {\n /*\n * 77% is the maximum space allowed based off of the other elements\n * in the top part of the error container (timestamp & collapse arrow).\n * this was manually determined */\n width: 77%;\n}\n.dash-fe-error-top__group {\n display: inline-flex;\n align-items: center;\n}\n.dash-fe-error__title {\n text-align: left;\n margin: 0px;\n margin-left: 5px;\n padding: 0px;\n font-size: 14px;\n display: inline-block;\n text-overflow: ellipsis;\n white-space: nowrap;\n overflow: hidden;\n}\n.dash-fe-error__timestamp {\n margin-right: 20px;\n}\n.dash-fe-error__collapse--flipped {\n -webkit-transform: rotate(180deg);\n -ms-transform: rotate(180deg);\n transform: rotate(180deg);\n}\n\n.dash-fe-error__info_title {\n margin: 0;\n color: #506784;\n font-size: 16px;\n background-color: #f3f6fa;\n border: 2px solid #dfe8f3;\n box-sizing: border-box;\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n padding: 10px;\n}\n\n.dash-fe-error__info {\n border: 1px solid #dfe8f3;\n margin: 0 0 1em 0;\n padding: 10px;\n\n background-color: white;\n border: 2px solid #dfe8f3;\n color: #506784;\n overflow: auto;\n white-space: pre-wrap;\n}\n\n.dash-fe-error__curved {\n border-radius: 4px;\n}\n\n.dash-fe-error__curved-top {\n border-top-left-radius: 4px;\n border-top-right-radius: 4px;\n border-bottom-width: 0px;\n}\n\n.dash-fe-error__curved-bottom {\n border-radius-bottom-left: 4px;\n border-radius-bottom-right: 4px;\n background-color: #FFEFEF;\n}\n\n.dash-be-error__st {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n /* iframe container handles the scrolling */\n overflow: hidden;\n display: inline-block;\n}\n\n.dash-be-error__str {\n background-color: #fdf3f4;\n min-width: 386px;\n max-width: 650px;\n overflow: auto;\n display: inline-block;\n white-space: pre-wrap;\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -20177,110 +19968,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `.dash-error-menu {
- max-width: 50%;
- max-height: 60%;
- display: contents;
- font-family: monospace;
- font-size: 14px;
- font-variant-ligatures: common-ligatures;
- color: rgb(50, 50, 50);
-}
-
-.dash-error-card {
- box-sizing: border-box;
- background: #ffffff;
- display: inline-block;
- /* shadow-1 */
- box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),
- 0px 2px 6px rgba(80, 103, 132, 0.12),
- 0px 0px 1px rgba(80, 103, 132, 0.32);
- border-radius: 4px;
- position: fixed;
- top: 16px;
- right: 16px;
- animation: dash-error-card-animation 0.5s;
- padding: 24px;
- text-align: left;
- background-color: white;
-
-}
-.dash-error-card--alerts-tray {
- position: absolute;
- top: -300px;
- left: -1px;
- animation: none;
- box-shadow: none;
- border: 1px solid #ececec;
- border-bottom: 0;
- border-bottom-left-radius: 0px;
- border-bottom-right-radius: 0px;
- width: 422px;
-}
-.dash-error-card--container {
- padding: 10px 10px;
- width: 600px;
- max-width: 800px;
- max-height: calc(100vh - 50px);
- margin: 10px;
- overflow: auto;
- z-index: 1100; /* above the plotly.js toolbar and Bootstrap components */
-}
-
-.dash-error-card__topbar {
- width: 100%;
- height: 32px;
- display: flex;
- justify-content: center;
- align-items: center;
- position: relative;
-}
-.dash-error-card__message {
- font-size: 14px;
-}
-
-.dash-error-card__message > strong {
- color: #ff4500;
-}
-
-.dash-error-card__content {
- box-sizing: border-box;
- padding: 10px 10px;
- background-color: white;
- box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),
- 0px 1px 3px rgba(162, 177, 198, 0.32);
- border-radius: 2px;
- margin-bottom: 8px;
-}
-
-.dash-error-card__list-item {
- background: #ffffff;
- box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),
- 0px 1px 3px rgba(162, 177, 198, 0.32);
- border-radius: 2px;
- padding: 10px 10px;
- margin-bottom: 10px;
- display: flex;
- align-items: center;
-}
-
-@keyframes dash-error-card-animation {
- from {
- opacity: 0;
- -webkit-transform: scale(1.1);
- -moz-transform: scale(1.1);
- -ms-transform: scale(1.1);
- transform: scale(1.1);
- }
- to {
- opacity: 1;
- -webkit-transform: scale(1);
- -moz-transform: scale(1);
- -ms-transform: scale(1);
- transform: scale(1);
- }
-}
-`, "",{"version":3,"sources":["webpack://./src/components/error/GlobalErrorOverlay.css"],"names":[],"mappings":"AAAA;IACI,cAAc;IACd,eAAe;IACf,iBAAiB;IACjB,sBAAsB;IACtB,eAAe;IACf,wCAAwC;IACxC,sBAAsB;AAC1B;;AAEA;IACI,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,aAAa;IACb;;4CAEwC;IACxC,kBAAkB;IAClB,eAAe;IACf,SAAS;IACT,WAAW;IACX,yCAAyC;IACzC,aAAa;IACb,gBAAgB;IAChB,uBAAuB;;AAE3B;AACA;IACI,kBAAkB;IAClB,WAAW;IACX,UAAU;IACV,eAAe;IACf,gBAAgB;IAChB,yBAAyB;IACzB,gBAAgB;IAChB,8BAA8B;IAC9B,+BAA+B;IAC/B,YAAY;AAChB;AACA;IACI,kBAAkB;IAClB,YAAY;IACZ,gBAAgB;IAChB,8BAA8B;IAC9B,YAAY;IACZ,cAAc;IACd,aAAa,GAAG,yDAAyD;AAC7E;;AAEA;IACI,WAAW;IACX,YAAY;IACZ,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,kBAAkB;AACtB;AACA;IACI,eAAe;AACnB;;AAEA;IACI,cAAc;AAClB;;AAEA;IACI,sBAAsB;IACtB,kBAAkB;IAClB,uBAAuB;IACvB;6CACyC;IACzC,kBAAkB;IAClB,kBAAkB;AACtB;;AAEA;IACI,mBAAmB;IACnB;6CACyC;IACzC,kBAAkB;IAClB,kBAAkB;IAClB,mBAAmB;IACnB,aAAa;IACb,mBAAmB;AACvB;;AAEA;IACI;QACI,UAAU;QACV,6BAA6B;QAC7B,0BAA0B;QAC1B,yBAAyB;QACzB,qBAAqB;IACzB;IACA;QACI,UAAU;QACV,2BAA2B;QAC3B,wBAAwB;QACxB,uBAAuB;QACvB,mBAAmB;IACvB;AACJ","sourcesContent":[".dash-error-menu {\n max-width: 50%;\n max-height: 60%;\n display: contents;\n font-family: monospace;\n font-size: 14px;\n font-variant-ligatures: common-ligatures;\n color: rgb(50, 50, 50);\n}\n\n.dash-error-card {\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n border-radius: 4px;\n position: fixed;\n top: 16px;\n right: 16px;\n animation: dash-error-card-animation 0.5s;\n padding: 24px;\n text-align: left;\n background-color: white;\n\n}\n.dash-error-card--alerts-tray {\n position: absolute;\n top: -300px;\n left: -1px;\n animation: none;\n box-shadow: none;\n border: 1px solid #ececec;\n border-bottom: 0;\n border-bottom-left-radius: 0px;\n border-bottom-right-radius: 0px;\n width: 422px;\n}\n.dash-error-card--container {\n padding: 10px 10px;\n width: 600px;\n max-width: 800px;\n max-height: calc(100vh - 50px);\n margin: 10px;\n overflow: auto;\n z-index: 1100; /* above the plotly.js toolbar and Bootstrap components */\n}\n\n.dash-error-card__topbar {\n width: 100%;\n height: 32px;\n display: flex;\n justify-content: center;\n align-items: center;\n position: relative;\n}\n.dash-error-card__message {\n font-size: 14px;\n}\n\n.dash-error-card__message > strong {\n color: #ff4500;\n}\n\n.dash-error-card__content {\n box-sizing: border-box;\n padding: 10px 10px;\n background-color: white;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n margin-bottom: 8px;\n}\n\n.dash-error-card__list-item {\n background: #ffffff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n padding: 10px 10px;\n margin-bottom: 10px;\n display: flex;\n align-items: center;\n}\n\n@keyframes dash-error-card-animation {\n from {\n opacity: 0;\n -webkit-transform: scale(1.1);\n -moz-transform: scale(1.1);\n -ms-transform: scale(1.1);\n transform: scale(1.1);\n }\n to {\n opacity: 1;\n -webkit-transform: scale(1);\n -moz-transform: scale(1);\n -ms-transform: scale(1);\n transform: scale(1);\n }\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, ".dash-error-menu {\n max-width: 50%;\n max-height: 60%;\n display: contents;\n font-family: monospace;\n font-size: 14px;\n font-variant-ligatures: common-ligatures;\n color: rgb(50, 50, 50);\n}\n\n.dash-error-card {\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n border-radius: 4px;\n position: fixed;\n top: 16px;\n right: 16px;\n animation: dash-error-card-animation 0.5s;\n padding: 24px;\n text-align: left;\n background-color: white;\n\n}\n.dash-error-card--alerts-tray {\n position: absolute;\n top: -300px;\n left: -1px;\n animation: none;\n box-shadow: none;\n border: 1px solid #ececec;\n border-bottom: 0;\n border-bottom-left-radius: 0px;\n border-bottom-right-radius: 0px;\n width: 422px;\n}\n.dash-error-card--container {\n padding: 10px 10px;\n width: 600px;\n max-width: 800px;\n max-height: calc(100vh - 50px);\n margin: 10px;\n overflow: auto;\n z-index: 1100; /* above the plotly.js toolbar and Bootstrap components */\n}\n\n.dash-error-card__topbar {\n width: 100%;\n height: 32px;\n display: flex;\n justify-content: center;\n align-items: center;\n position: relative;\n}\n.dash-error-card__message {\n font-size: 14px;\n}\n\n.dash-error-card__message > strong {\n color: #ff4500;\n}\n\n.dash-error-card__content {\n box-sizing: border-box;\n padding: 10px 10px;\n background-color: white;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n margin-bottom: 8px;\n}\n\n.dash-error-card__list-item {\n background: #ffffff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n padding: 10px 10px;\n margin-bottom: 10px;\n display: flex;\n align-items: center;\n}\n\n@keyframes dash-error-card-animation {\n from {\n opacity: 0;\n -webkit-transform: scale(1.1);\n -moz-transform: scale(1.1);\n -ms-transform: scale(1.1);\n transform: scale(1.1);\n }\n to {\n opacity: 1;\n -webkit-transform: scale(1);\n -moz-transform: scale(1);\n -ms-transform: scale(1);\n transform: scale(1);\n }\n}\n", "",{"version":3,"sources":["webpack://./src/components/error/GlobalErrorOverlay.css"],"names":[],"mappings":"AAAA;IACI,cAAc;IACd,eAAe;IACf,iBAAiB;IACjB,sBAAsB;IACtB,eAAe;IACf,wCAAwC;IACxC,sBAAsB;AAC1B;;AAEA;IACI,sBAAsB;IACtB,mBAAmB;IACnB,qBAAqB;IACrB,aAAa;IACb;;4CAEwC;IACxC,kBAAkB;IAClB,eAAe;IACf,SAAS;IACT,WAAW;IACX,yCAAyC;IACzC,aAAa;IACb,gBAAgB;IAChB,uBAAuB;;AAE3B;AACA;IACI,kBAAkB;IAClB,WAAW;IACX,UAAU;IACV,eAAe;IACf,gBAAgB;IAChB,yBAAyB;IACzB,gBAAgB;IAChB,8BAA8B;IAC9B,+BAA+B;IAC/B,YAAY;AAChB;AACA;IACI,kBAAkB;IAClB,YAAY;IACZ,gBAAgB;IAChB,8BAA8B;IAC9B,YAAY;IACZ,cAAc;IACd,aAAa,GAAG,yDAAyD;AAC7E;;AAEA;IACI,WAAW;IACX,YAAY;IACZ,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,kBAAkB;AACtB;AACA;IACI,eAAe;AACnB;;AAEA;IACI,cAAc;AAClB;;AAEA;IACI,sBAAsB;IACtB,kBAAkB;IAClB,uBAAuB;IACvB;6CACyC;IACzC,kBAAkB;IAClB,kBAAkB;AACtB;;AAEA;IACI,mBAAmB;IACnB;6CACyC;IACzC,kBAAkB;IAClB,kBAAkB;IAClB,mBAAmB;IACnB,aAAa;IACb,mBAAmB;AACvB;;AAEA;IACI;QACI,UAAU;QACV,6BAA6B;QAC7B,0BAA0B;QAC1B,yBAAyB;QACzB,qBAAqB;IACzB;IACA;QACI,UAAU;QACV,2BAA2B;QAC3B,wBAAwB;QACxB,uBAAuB;QACvB,mBAAmB;IACvB;AACJ","sourcesContent":[".dash-error-menu {\n max-width: 50%;\n max-height: 60%;\n display: contents;\n font-family: monospace;\n font-size: 14px;\n font-variant-ligatures: common-ligatures;\n color: rgb(50, 50, 50);\n}\n\n.dash-error-card {\n box-sizing: border-box;\n background: #ffffff;\n display: inline-block;\n /* shadow-1 */\n box-shadow: 0px 6px 16px rgba(80, 103, 132, 0.165),\n 0px 2px 6px rgba(80, 103, 132, 0.12),\n 0px 0px 1px rgba(80, 103, 132, 0.32);\n border-radius: 4px;\n position: fixed;\n top: 16px;\n right: 16px;\n animation: dash-error-card-animation 0.5s;\n padding: 24px;\n text-align: left;\n background-color: white;\n\n}\n.dash-error-card--alerts-tray {\n position: absolute;\n top: -300px;\n left: -1px;\n animation: none;\n box-shadow: none;\n border: 1px solid #ececec;\n border-bottom: 0;\n border-bottom-left-radius: 0px;\n border-bottom-right-radius: 0px;\n width: 422px;\n}\n.dash-error-card--container {\n padding: 10px 10px;\n width: 600px;\n max-width: 800px;\n max-height: calc(100vh - 50px);\n margin: 10px;\n overflow: auto;\n z-index: 1100; /* above the plotly.js toolbar and Bootstrap components */\n}\n\n.dash-error-card__topbar {\n width: 100%;\n height: 32px;\n display: flex;\n justify-content: center;\n align-items: center;\n position: relative;\n}\n.dash-error-card__message {\n font-size: 14px;\n}\n\n.dash-error-card__message > strong {\n color: #ff4500;\n}\n\n.dash-error-card__content {\n box-sizing: border-box;\n padding: 10px 10px;\n background-color: white;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n margin-bottom: 8px;\n}\n\n.dash-error-card__list-item {\n background: #ffffff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 2px;\n padding: 10px 10px;\n margin-bottom: 10px;\n display: flex;\n align-items: center;\n}\n\n@keyframes dash-error-card-animation {\n from {\n opacity: 0;\n -webkit-transform: scale(1.1);\n -moz-transform: scale(1.1);\n -ms-transform: scale(1.1);\n transform: scale(1.1);\n }\n to {\n opacity: 1;\n -webkit-transform: scale(1);\n -moz-transform: scale(1);\n -ms-transform: scale(1);\n transform: scale(1);\n }\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -20304,19 +19992,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `.percy-show {
- display: none;
-}
-
-@media only percy {
- .percy-hide {
- display: none;
- }
- .percy-show {
- display: block;
- }
-}
-`, "",{"version":3,"sources":["webpack://./src/components/error/Percy.css"],"names":[],"mappings":"AAAA;IACI,aAAa;AACjB;;AAEA;IACI;QACI,aAAa;IACjB;IACA;QACI,cAAc;IAClB;AACJ","sourcesContent":[".percy-show {\n display: none;\n}\n\n@media only percy {\n .percy-hide {\n display: none;\n }\n .percy-show {\n display: block;\n }\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, ".percy-show {\n display: none;\n}\n\n@media only percy {\n .percy-hide {\n display: none;\n }\n .percy-show {\n display: block;\n }\n}\n", "",{"version":3,"sources":["webpack://./src/components/error/Percy.css"],"names":[],"mappings":"AAAA;IACI,aAAa;AACjB;;AAEA;IACI;QACI,aAAa;IACjB;IACA;QACI,cAAc;IAClB;AACJ","sourcesContent":[".percy-show {\n display: none;\n}\n\n@media only percy {\n .percy-hide {\n display: none;\n }\n .percy-show {\n display: block;\n }\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -20340,184 +20016,7 @@ __webpack_require__.r(__webpack_exports__);
var ___CSS_LOADER_EXPORT___ = _node_modules_css_loader_dist_runtime_api_js__WEBPACK_IMPORTED_MODULE_1___default()((_node_modules_css_loader_dist_runtime_sourceMaps_js__WEBPACK_IMPORTED_MODULE_0___default()));
// Module
-___CSS_LOADER_EXPORT___.push([module.id, `.dash-debug-menu {
- transition: 0.3s;
- position: fixed;
- bottom: 35px;
- right: 35px;
- display: flex;
- justify-content: center;
- align-items: center;
- z-index: 10001;
- background-color: #119dff;
- border-radius: 100%;
- width: 64px;
- height: 64px;
- cursor: pointer;
-}
-.dash-debug-menu--open {
- transform: rotate(-180deg);
-}
-
-.dash-debug-menu:hover {
- background-color: #108de4;
-}
-
-.dash-debug-menu__icon {
- width: auto;
- height: 24px;
-}
-
-.dash-debug-menu__outer {
- transition: 0.3s;
- box-sizing: border-box;
- position: fixed;
- bottom: 27px;
- right: 27px;
- display: flex;
- justify-content: center;
- align-items: center;
- z-index: 10000;
- height: 80px;
- border-radius: 40px;
- padding: 5px 78px 5px 5px;
- background-color: #fff;
- box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),
- 0px 1px 3px rgba(162, 177, 198, 0.32);
-}
-.dash-debug-menu__outer--closed {
- height: 60px;
- width: 60px;
- bottom: 37px;
- right: 37px;
- padding: 0;
-}
-
-.dash-debug-menu__content {
- display: flex;
- width: 100%;
- height: 100%;
-}
-
-.dash-debug-menu__button-container {
- display: flex;
- flex-direction: column;
- justify-content: center;
- align-items: center;
- width: 74px;
-}
-
-.dash-debug-menu__button {
- position: relative;
- background-color: #B9C2CE;
- border-radius: 100%;
- width: 64px;
- height: 64px;
- font-size: 10px;
- display: flex;
- flex-direction: column;
- justify-content: center;
- align-items: center;
- transition: background-color 0.2s;
- color: #fff;
- cursor: pointer;
-}
-.dash-debug-menu__button:hover {
- background-color: #a1a9b5;
-}
-.dash-debug-menu__button--enabled {
- background-color: #00CC96;
-}
-.dash-debug-menu__button.dash-debug-menu__button--enabled:hover {
- background-color: #03bb8a;
-}
-
-.dash-debug-menu__button-label {
- cursor: inherit;
-}
-
-.dash-debug-menu__button::before {
- visibility: hidden;
- pointer-events: none;
- position: absolute;
- box-sizing: border-box;
- bottom: 110%;
- left: 50%;
- margin-left: -60px;
- padding: 7px;
- width: 120px;
- border-radius: 3px;
- background-color: rgba(68,68,68,0.7);
- color: #fff;
- text-align: center;
- font-size: 10px;
- line-height: 1.2;
-}
-.dash-debug-menu__button:hover::before {
- visibility: visible;
-}
-.dash-debug-menu__button--callbacks::before {
- content: "Toggle Callback Graph";
-}
-.dash-debug-menu__button--errors::before {
- content: "Toggle Errors";
-}
-.dash-debug-menu__button--available,
-.dash-debug-menu__button--available:hover {
- background-color: #00CC96;
- cursor: default;
-}
-.dash-debug-menu__button--available::before {
- content: "Server Available";
-}
-.dash-debug-menu__button--unavailable,
-.dash-debug-menu__button--unavailable:hover {
- background-color: #F1564E;
- cursor: default;
-}
-.dash-debug-menu__button--unavailable::before {
- content: "Server Unavailable. Check if the process has halted or crashed.";
-}
-.dash-debug-menu__button--cold,
-.dash-debug-menu__button--cold:hover {
- background-color: #FDDA68;
- cursor: default;
-}
-.dash-debug-menu__button--cold::before {
- content: "Hot Reload Disabled";
-}
-
-.dash-debug-alert {
- display: flex;
- align-items: center;
- font-size: 10px;
-}
-
-.dash-debug-alert-label {
- display: flex;
- position: fixed;
- bottom: 81px;
- right: 29px;
- z-index: 10002;
- cursor: pointer;
- box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),
- 0px 1px 3px rgba(162, 177, 198, 0.32);
- border-radius: 32px;
- background-color: white;
- padding: 4px;
- color: rgb(50, 50, 50);
-}
-
-.dash-debug-error-count {
- display: block;
- margin: 0 3px;
-}
-
-.dash-debug-disconnected {
- font-size: 14px;
- margin-left: 3px;
-}
-`, "",{"version":3,"sources":["webpack://./src/components/error/menu/DebugMenu.css"],"names":[],"mappings":"AAAA;IACI,gBAAgB;IAChB,eAAe;IACf,YAAY;IACZ,WAAW;IACX,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,cAAc;IACd,yBAAyB;IACzB,mBAAmB;IACnB,WAAW;IACX,YAAY;IACZ,eAAe;AACnB;AACA;IACI,0BAA0B;AAC9B;;AAEA;IACI,yBAAyB;AAC7B;;AAEA;IACI,WAAW;IACX,YAAY;AAChB;;AAEA;IACI,gBAAgB;IAChB,sBAAsB;IACtB,eAAe;IACf,YAAY;IACZ,WAAW;IACX,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,cAAc;IACd,YAAY;IACZ,mBAAmB;IACnB,yBAAyB;IACzB,sBAAsB;IACtB;6CACyC;AAC7C;AACA;IACI,YAAY;IACZ,WAAW;IACX,YAAY;IACZ,WAAW;IACX,UAAU;AACd;;AAEA;IACI,aAAa;IACb,WAAW;IACX,YAAY;AAChB;;AAEA;IACI,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,WAAW;AACf;;AAEA;IACI,kBAAkB;IAClB,yBAAyB;IACzB,mBAAmB;IACnB,WAAW;IACX,YAAY;IACZ,eAAe;IACf,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,iCAAiC;IACjC,WAAW;IACX,eAAe;AACnB;AACA;IACI,yBAAyB;AAC7B;AACA;IACI,yBAAyB;AAC7B;AACA;IACI,yBAAyB;AAC7B;;AAEA;IACI,eAAe;AACnB;;AAEA;IACI,kBAAkB;IAClB,oBAAoB;IACpB,kBAAkB;IAClB,sBAAsB;IACtB,YAAY;IACZ,SAAS;IACT,kBAAkB;IAClB,YAAY;IACZ,YAAY;IACZ,kBAAkB;IAClB,oCAAoC;IACpC,WAAW;IACX,kBAAkB;IAClB,eAAe;IACf,gBAAgB;AACpB;AACA;IACI,mBAAmB;AACvB;AACA;IACI,gCAAgC;AACpC;AACA;IACI,wBAAwB;AAC5B;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,2BAA2B;AAC/B;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,0EAA0E;AAC9E;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,8BAA8B;AAClC;;AAEA;IACI,aAAa;IACb,mBAAmB;IACnB,eAAe;AACnB;;AAEA;IACI,aAAa;IACb,eAAe;IACf,YAAY;IACZ,WAAW;IACX,cAAc;IACd,eAAe;IACf;6CACyC;IACzC,mBAAmB;IACnB,uBAAuB;IACvB,YAAY;IACZ,sBAAsB;AAC1B;;AAEA;IACI,cAAc;IACd,aAAa;AACjB;;AAEA;IACI,eAAe;IACf,gBAAgB;AACpB","sourcesContent":[".dash-debug-menu {\n transition: 0.3s;\n position: fixed;\n bottom: 35px;\n right: 35px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10001;\n background-color: #119dff;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n cursor: pointer;\n}\n.dash-debug-menu--open {\n transform: rotate(-180deg);\n}\n\n.dash-debug-menu:hover {\n background-color: #108de4;\n}\n\n.dash-debug-menu__icon {\n width: auto;\n height: 24px;\n}\n\n.dash-debug-menu__outer {\n transition: 0.3s;\n box-sizing: border-box;\n position: fixed;\n bottom: 27px;\n right: 27px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10000;\n height: 80px;\n border-radius: 40px;\n padding: 5px 78px 5px 5px;\n background-color: #fff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n}\n.dash-debug-menu__outer--closed {\n height: 60px;\n width: 60px;\n bottom: 37px;\n right: 37px;\n padding: 0;\n}\n\n.dash-debug-menu__content {\n display: flex;\n width: 100%;\n height: 100%;\n}\n\n.dash-debug-menu__button-container {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n width: 74px;\n}\n\n.dash-debug-menu__button {\n position: relative;\n background-color: #B9C2CE;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n font-size: 10px;\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n transition: background-color 0.2s;\n color: #fff;\n cursor: pointer;\n}\n.dash-debug-menu__button:hover {\n background-color: #a1a9b5;\n}\n.dash-debug-menu__button--enabled {\n background-color: #00CC96;\n}\n.dash-debug-menu__button.dash-debug-menu__button--enabled:hover {\n background-color: #03bb8a;\n}\n\n.dash-debug-menu__button-label {\n cursor: inherit;\n}\n\n.dash-debug-menu__button::before {\n visibility: hidden;\n pointer-events: none;\n position: absolute;\n box-sizing: border-box;\n bottom: 110%;\n left: 50%;\n margin-left: -60px;\n padding: 7px;\n width: 120px;\n border-radius: 3px;\n background-color: rgba(68,68,68,0.7);\n color: #fff;\n text-align: center;\n font-size: 10px;\n line-height: 1.2;\n}\n.dash-debug-menu__button:hover::before {\n visibility: visible;\n}\n.dash-debug-menu__button--callbacks::before {\n content: \"Toggle Callback Graph\";\n}\n.dash-debug-menu__button--errors::before {\n content: \"Toggle Errors\";\n}\n.dash-debug-menu__button--available,\n.dash-debug-menu__button--available:hover {\n background-color: #00CC96;\n cursor: default;\n}\n.dash-debug-menu__button--available::before {\n content: \"Server Available\";\n}\n.dash-debug-menu__button--unavailable,\n.dash-debug-menu__button--unavailable:hover {\n background-color: #F1564E;\n cursor: default;\n}\n.dash-debug-menu__button--unavailable::before {\n content: \"Server Unavailable. Check if the process has halted or crashed.\";\n}\n.dash-debug-menu__button--cold,\n.dash-debug-menu__button--cold:hover {\n background-color: #FDDA68;\n cursor: default;\n}\n.dash-debug-menu__button--cold::before {\n content: \"Hot Reload Disabled\";\n}\n\n.dash-debug-alert {\n display: flex;\n align-items: center;\n font-size: 10px;\n}\n\n.dash-debug-alert-label {\n display: flex;\n position: fixed;\n bottom: 81px;\n right: 29px;\n z-index: 10002;\n cursor: pointer;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 32px;\n background-color: white;\n padding: 4px;\n color: rgb(50, 50, 50);\n}\n\n.dash-debug-error-count {\n display: block;\n margin: 0 3px;\n}\n\n.dash-debug-disconnected {\n font-size: 14px;\n margin-left: 3px;\n}\n"],"sourceRoot":""}]);
+___CSS_LOADER_EXPORT___.push([module.id, ".dash-debug-menu {\n transition: 0.3s;\n position: fixed;\n bottom: 35px;\n right: 35px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10001;\n background-color: #119dff;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n cursor: pointer;\n}\n.dash-debug-menu--open {\n transform: rotate(-180deg);\n}\n\n.dash-debug-menu:hover {\n background-color: #108de4;\n}\n\n.dash-debug-menu__icon {\n width: auto;\n height: 24px;\n}\n\n.dash-debug-menu__outer {\n transition: 0.3s;\n box-sizing: border-box;\n position: fixed;\n bottom: 27px;\n right: 27px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10000;\n height: 80px;\n border-radius: 40px;\n padding: 5px 78px 5px 5px;\n background-color: #fff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n}\n.dash-debug-menu__outer--closed {\n height: 60px;\n width: 60px;\n bottom: 37px;\n right: 37px;\n padding: 0;\n}\n\n.dash-debug-menu__content {\n display: flex;\n width: 100%;\n height: 100%;\n}\n\n.dash-debug-menu__button-container {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n width: 74px;\n}\n\n.dash-debug-menu__button {\n position: relative;\n background-color: #B9C2CE;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n font-size: 10px;\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n transition: background-color 0.2s;\n color: #fff;\n cursor: pointer;\n}\n.dash-debug-menu__button:hover {\n background-color: #a1a9b5;\n}\n.dash-debug-menu__button--enabled {\n background-color: #00CC96;\n}\n.dash-debug-menu__button.dash-debug-menu__button--enabled:hover {\n background-color: #03bb8a;\n}\n\n.dash-debug-menu__button-label {\n cursor: inherit;\n}\n\n.dash-debug-menu__button::before {\n visibility: hidden;\n pointer-events: none;\n position: absolute;\n box-sizing: border-box;\n bottom: 110%;\n left: 50%;\n margin-left: -60px;\n padding: 7px;\n width: 120px;\n border-radius: 3px;\n background-color: rgba(68,68,68,0.7);\n color: #fff;\n text-align: center;\n font-size: 10px;\n line-height: 1.2;\n}\n.dash-debug-menu__button:hover::before {\n visibility: visible;\n}\n.dash-debug-menu__button--callbacks::before {\n content: \"Toggle Callback Graph\";\n}\n.dash-debug-menu__button--errors::before {\n content: \"Toggle Errors\";\n}\n.dash-debug-menu__button--available,\n.dash-debug-menu__button--available:hover {\n background-color: #00CC96;\n cursor: default;\n}\n.dash-debug-menu__button--available::before {\n content: \"Server Available\";\n}\n.dash-debug-menu__button--unavailable,\n.dash-debug-menu__button--unavailable:hover {\n background-color: #F1564E;\n cursor: default;\n}\n.dash-debug-menu__button--unavailable::before {\n content: \"Server Unavailable. Check if the process has halted or crashed.\";\n}\n.dash-debug-menu__button--cold,\n.dash-debug-menu__button--cold:hover {\n background-color: #FDDA68;\n cursor: default;\n}\n.dash-debug-menu__button--cold::before {\n content: \"Hot Reload Disabled\";\n}\n\n.dash-debug-alert {\n display: flex;\n align-items: center;\n font-size: 10px;\n}\n\n.dash-debug-alert-label {\n display: flex;\n position: fixed;\n bottom: 81px;\n right: 29px;\n z-index: 10002;\n cursor: pointer;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 32px;\n background-color: white;\n padding: 4px;\n color: rgb(50, 50, 50);\n}\n\n.dash-debug-error-count {\n display: block;\n margin: 0 3px;\n}\n\n.dash-debug-disconnected {\n font-size: 14px;\n margin-left: 3px;\n}\n", "",{"version":3,"sources":["webpack://./src/components/error/menu/DebugMenu.css"],"names":[],"mappings":"AAAA;IACI,gBAAgB;IAChB,eAAe;IACf,YAAY;IACZ,WAAW;IACX,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,cAAc;IACd,yBAAyB;IACzB,mBAAmB;IACnB,WAAW;IACX,YAAY;IACZ,eAAe;AACnB;AACA;IACI,0BAA0B;AAC9B;;AAEA;IACI,yBAAyB;AAC7B;;AAEA;IACI,WAAW;IACX,YAAY;AAChB;;AAEA;IACI,gBAAgB;IAChB,sBAAsB;IACtB,eAAe;IACf,YAAY;IACZ,WAAW;IACX,aAAa;IACb,uBAAuB;IACvB,mBAAmB;IACnB,cAAc;IACd,YAAY;IACZ,mBAAmB;IACnB,yBAAyB;IACzB,sBAAsB;IACtB;6CACyC;AAC7C;AACA;IACI,YAAY;IACZ,WAAW;IACX,YAAY;IACZ,WAAW;IACX,UAAU;AACd;;AAEA;IACI,aAAa;IACb,WAAW;IACX,YAAY;AAChB;;AAEA;IACI,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,WAAW;AACf;;AAEA;IACI,kBAAkB;IAClB,yBAAyB;IACzB,mBAAmB;IACnB,WAAW;IACX,YAAY;IACZ,eAAe;IACf,aAAa;IACb,sBAAsB;IACtB,uBAAuB;IACvB,mBAAmB;IACnB,iCAAiC;IACjC,WAAW;IACX,eAAe;AACnB;AACA;IACI,yBAAyB;AAC7B;AACA;IACI,yBAAyB;AAC7B;AACA;IACI,yBAAyB;AAC7B;;AAEA;IACI,eAAe;AACnB;;AAEA;IACI,kBAAkB;IAClB,oBAAoB;IACpB,kBAAkB;IAClB,sBAAsB;IACtB,YAAY;IACZ,SAAS;IACT,kBAAkB;IAClB,YAAY;IACZ,YAAY;IACZ,kBAAkB;IAClB,oCAAoC;IACpC,WAAW;IACX,kBAAkB;IAClB,eAAe;IACf,gBAAgB;AACpB;AACA;IACI,mBAAmB;AACvB;AACA;IACI,gCAAgC;AACpC;AACA;IACI,wBAAwB;AAC5B;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,2BAA2B;AAC/B;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,0EAA0E;AAC9E;AACA;;IAEI,yBAAyB;IACzB,eAAe;AACnB;AACA;IACI,8BAA8B;AAClC;;AAEA;IACI,aAAa;IACb,mBAAmB;IACnB,eAAe;AACnB;;AAEA;IACI,aAAa;IACb,eAAe;IACf,YAAY;IACZ,WAAW;IACX,cAAc;IACd,eAAe;IACf;6CACyC;IACzC,mBAAmB;IACnB,uBAAuB;IACvB,YAAY;IACZ,sBAAsB;AAC1B;;AAEA;IACI,cAAc;IACd,aAAa;AACjB;;AAEA;IACI,eAAe;IACf,gBAAgB;AACpB","sourcesContent":[".dash-debug-menu {\n transition: 0.3s;\n position: fixed;\n bottom: 35px;\n right: 35px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10001;\n background-color: #119dff;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n cursor: pointer;\n}\n.dash-debug-menu--open {\n transform: rotate(-180deg);\n}\n\n.dash-debug-menu:hover {\n background-color: #108de4;\n}\n\n.dash-debug-menu__icon {\n width: auto;\n height: 24px;\n}\n\n.dash-debug-menu__outer {\n transition: 0.3s;\n box-sizing: border-box;\n position: fixed;\n bottom: 27px;\n right: 27px;\n display: flex;\n justify-content: center;\n align-items: center;\n z-index: 10000;\n height: 80px;\n border-radius: 40px;\n padding: 5px 78px 5px 5px;\n background-color: #fff;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n}\n.dash-debug-menu__outer--closed {\n height: 60px;\n width: 60px;\n bottom: 37px;\n right: 37px;\n padding: 0;\n}\n\n.dash-debug-menu__content {\n display: flex;\n width: 100%;\n height: 100%;\n}\n\n.dash-debug-menu__button-container {\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n width: 74px;\n}\n\n.dash-debug-menu__button {\n position: relative;\n background-color: #B9C2CE;\n border-radius: 100%;\n width: 64px;\n height: 64px;\n font-size: 10px;\n display: flex;\n flex-direction: column;\n justify-content: center;\n align-items: center;\n transition: background-color 0.2s;\n color: #fff;\n cursor: pointer;\n}\n.dash-debug-menu__button:hover {\n background-color: #a1a9b5;\n}\n.dash-debug-menu__button--enabled {\n background-color: #00CC96;\n}\n.dash-debug-menu__button.dash-debug-menu__button--enabled:hover {\n background-color: #03bb8a;\n}\n\n.dash-debug-menu__button-label {\n cursor: inherit;\n}\n\n.dash-debug-menu__button::before {\n visibility: hidden;\n pointer-events: none;\n position: absolute;\n box-sizing: border-box;\n bottom: 110%;\n left: 50%;\n margin-left: -60px;\n padding: 7px;\n width: 120px;\n border-radius: 3px;\n background-color: rgba(68,68,68,0.7);\n color: #fff;\n text-align: center;\n font-size: 10px;\n line-height: 1.2;\n}\n.dash-debug-menu__button:hover::before {\n visibility: visible;\n}\n.dash-debug-menu__button--callbacks::before {\n content: \"Toggle Callback Graph\";\n}\n.dash-debug-menu__button--errors::before {\n content: \"Toggle Errors\";\n}\n.dash-debug-menu__button--available,\n.dash-debug-menu__button--available:hover {\n background-color: #00CC96;\n cursor: default;\n}\n.dash-debug-menu__button--available::before {\n content: \"Server Available\";\n}\n.dash-debug-menu__button--unavailable,\n.dash-debug-menu__button--unavailable:hover {\n background-color: #F1564E;\n cursor: default;\n}\n.dash-debug-menu__button--unavailable::before {\n content: \"Server Unavailable. Check if the process has halted or crashed.\";\n}\n.dash-debug-menu__button--cold,\n.dash-debug-menu__button--cold:hover {\n background-color: #FDDA68;\n cursor: default;\n}\n.dash-debug-menu__button--cold::before {\n content: \"Hot Reload Disabled\";\n}\n\n.dash-debug-alert {\n display: flex;\n align-items: center;\n font-size: 10px;\n}\n\n.dash-debug-alert-label {\n display: flex;\n position: fixed;\n bottom: 81px;\n right: 29px;\n z-index: 10002;\n cursor: pointer;\n box-shadow: 0px 0px 1px rgba(0, 0, 0, 0.25),\n 0px 1px 3px rgba(162, 177, 198, 0.32);\n border-radius: 32px;\n background-color: white;\n padding: 4px;\n color: rgb(50, 50, 50);\n}\n\n.dash-debug-error-count {\n display: block;\n margin: 0 3px;\n}\n\n.dash-debug-disconnected {\n font-size: 14px;\n margin-left: 3px;\n}\n"],"sourceRoot":""}]);
// Exports
/* harmony default export */ __webpack_exports__["default"] = (___CSS_LOADER_EXPORT___);
@@ -21046,46438 +20545,33220 @@ module.exports = __WEBPACK_EXTERNAL_MODULE__4__;
/***/ }),
-/***/ "./node_modules/cytoscape/dist/cytoscape.cjs.js":
-/*!******************************************************!*\
- !*** ./node_modules/cytoscape/dist/cytoscape.cjs.js ***!
- \******************************************************/
+/***/ "./node_modules/dagre/index.js":
+/*!*************************************!*\
+ !*** ./node_modules/dagre/index.js ***!
+ \*************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-/**
- * Copyright (c) 2016-2023, The Cytoscape Consortium.
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy of
- * this software and associated documentation files (the “Software”), to deal in
- * the Software without restriction, including without limitation the rights to
- * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is furnished to do
- * so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
+/*
+Copyright (c) 2012-2014 Chris Pettitt
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+*/
+module.exports = {
+ graphlib: __webpack_require__(/*! ./lib/graphlib */ "./node_modules/dagre/lib/graphlib.js"),
+ layout: __webpack_require__(/*! ./lib/layout */ "./node_modules/dagre/lib/layout.js"),
+ debug: __webpack_require__(/*! ./lib/debug */ "./node_modules/dagre/lib/debug.js"),
+ util: {
+ time: (__webpack_require__(/*! ./lib/util */ "./node_modules/dagre/lib/util.js").time),
+ notime: (__webpack_require__(/*! ./lib/util */ "./node_modules/dagre/lib/util.js").notime)
+ },
+ version: __webpack_require__(/*! ./lib/version */ "./node_modules/dagre/lib/version.js")
+};
-var debounce = __webpack_require__(/*! lodash/debounce */ "./node_modules/lodash/debounce.js");
-var Heap = __webpack_require__(/*! heap */ "./node_modules/heap/index.js");
-var get = __webpack_require__(/*! lodash/get */ "./node_modules/lodash/get.js");
-var set = __webpack_require__(/*! lodash/set */ "./node_modules/lodash/set.js");
-var toPath = __webpack_require__(/*! lodash/toPath */ "./node_modules/lodash/toPath.js");
-function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }
+/***/ }),
-var debounce__default = /*#__PURE__*/_interopDefaultLegacy(debounce);
-var Heap__default = /*#__PURE__*/_interopDefaultLegacy(Heap);
-var get__default = /*#__PURE__*/_interopDefaultLegacy(get);
-var set__default = /*#__PURE__*/_interopDefaultLegacy(set);
-var toPath__default = /*#__PURE__*/_interopDefaultLegacy(toPath);
+/***/ "./node_modules/dagre/lib/acyclic.js":
+/*!*******************************************!*\
+ !*** ./node_modules/dagre/lib/acyclic.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function _typeof(obj) {
- "@babel/helpers - typeof";
+"use strict";
- return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
- return typeof obj;
- } : function (obj) {
- return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
- }, _typeof(obj);
-}
-function _classCallCheck(instance, Constructor) {
- if (!(instance instanceof Constructor)) {
- throw new TypeError("Cannot call a class as a 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);
- }
-}
-function _createClass(Constructor, protoProps, staticProps) {
- if (protoProps) _defineProperties(Constructor.prototype, protoProps);
- if (staticProps) _defineProperties(Constructor, staticProps);
- Object.defineProperty(Constructor, "prototype", {
- writable: false
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var greedyFAS = __webpack_require__(/*! ./greedy-fas */ "./node_modules/dagre/lib/greedy-fas.js");
+
+module.exports = {
+ run: run,
+ undo: undo
+};
+
+function run(g) {
+ var fas = (g.graph().acyclicer === "greedy"
+ ? greedyFAS(g, weightFn(g))
+ : dfsFAS(g));
+ _.forEach(fas, function(e) {
+ var label = g.edge(e);
+ g.removeEdge(e);
+ label.forwardName = e.name;
+ label.reversed = true;
+ g.setEdge(e.w, e.v, label, _.uniqueId("rev"));
});
- return Constructor;
+
+ function weightFn(g) {
+ return function(e) {
+ return g.edge(e).weight;
+ };
+ }
}
-function _defineProperty(obj, key, value) {
- if (key in obj) {
- Object.defineProperty(obj, key, {
- value: value,
- enumerable: true,
- configurable: true,
- writable: true
+
+function dfsFAS(g) {
+ var fas = [];
+ var stack = {};
+ var visited = {};
+
+ function dfs(v) {
+ if (_.has(visited, v)) {
+ return;
+ }
+ visited[v] = true;
+ stack[v] = true;
+ _.forEach(g.outEdges(v), function(e) {
+ if (_.has(stack, e.w)) {
+ fas.push(e);
+ } else {
+ dfs(e.w);
+ }
});
- } else {
- obj[key] = value;
+ delete stack[v];
}
- return obj;
-}
-function _slicedToArray(arr, i) {
- return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
+
+ _.forEach(g.nodes(), dfs);
+ return fas;
}
-function _arrayWithHoles(arr) {
- if (Array.isArray(arr)) return arr;
+
+function undo(g) {
+ _.forEach(g.edges(), function(e) {
+ var label = g.edge(e);
+ if (label.reversed) {
+ g.removeEdge(e);
+
+ var forwardName = label.forwardName;
+ delete label.reversed;
+ delete label.forwardName;
+ g.setEdge(e.w, e.v, label, forwardName);
+ }
+ });
}
-function _iterableToArrayLimit(arr, i) {
- var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
- if (_i == null) return;
- var _arr = [];
- var _n = true;
- var _d = false;
- var _s, _e;
- try {
- for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) {
- _arr.push(_s.value);
- if (i && _arr.length === i) break;
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/add-border-segments.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/dagre/lib/add-border-segments.js ***!
+ \*******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
+
+module.exports = addBorderSegments;
+
+function addBorderSegments(g) {
+ function dfs(v) {
+ var children = g.children(v);
+ var node = g.node(v);
+ if (children.length) {
+ _.forEach(children, dfs);
}
- } catch (err) {
- _d = true;
- _e = err;
- } finally {
- try {
- if (!_n && _i["return"] != null) _i["return"]();
- } finally {
- if (_d) throw _e;
+
+ if (_.has(node, "minRank")) {
+ node.borderLeft = [];
+ node.borderRight = [];
+ for (var rank = node.minRank, maxRank = node.maxRank + 1;
+ rank < maxRank;
+ ++rank) {
+ addBorderNode(g, "borderLeft", "_bl", v, node, rank);
+ addBorderNode(g, "borderRight", "_br", v, node, rank);
+ }
}
}
- return _arr;
-}
-function _unsupportedIterableToArray(o, minLen) {
- if (!o) return;
- if (typeof o === "string") return _arrayLikeToArray(o, minLen);
- var n = Object.prototype.toString.call(o).slice(8, -1);
- if (n === "Object" && o.constructor) n = o.constructor.name;
- if (n === "Map" || n === "Set") return Array.from(o);
- if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
-}
-function _arrayLikeToArray(arr, len) {
- if (len == null || len > arr.length) len = arr.length;
- for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
- return arr2;
+
+ _.forEach(g.children(), dfs);
}
-function _nonIterableRest() {
- throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+
+function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
+ var label = { width: 0, height: 0, rank: rank, borderType: prop };
+ var prev = sgNode[prop][rank - 1];
+ var curr = util.addDummyNode(g, "border", label, prefix);
+ sgNode[prop][rank] = curr;
+ g.setParent(curr, sg);
+ if (prev) {
+ g.setEdge(prev, curr, { weight: 1 });
+ }
}
-var _window = typeof window === 'undefined' ? null : window; // eslint-disable-line no-undef
-var navigator = _window ? _window.navigator : null;
-_window ? _window.document : null;
-var typeofstr = _typeof('');
-var typeofobj = _typeof({});
-var typeoffn = _typeof(function () {});
-var typeofhtmlele = typeof HTMLElement === "undefined" ? "undefined" : _typeof(HTMLElement);
-var instanceStr = function instanceStr(obj) {
- return obj && obj.instanceString && fn$6(obj.instanceString) ? obj.instanceString() : null;
-};
+/***/ }),
-var string = function string(obj) {
- return obj != null && _typeof(obj) == typeofstr;
-};
-var fn$6 = function fn(obj) {
- return obj != null && _typeof(obj) === typeoffn;
-};
-var array = function array(obj) {
- return !elementOrCollection(obj) && (Array.isArray ? Array.isArray(obj) : obj != null && obj instanceof Array);
-};
-var plainObject = function plainObject(obj) {
- return obj != null && _typeof(obj) === typeofobj && !array(obj) && obj.constructor === Object;
-};
-var object = function object(obj) {
- return obj != null && _typeof(obj) === typeofobj;
-};
-var number$1 = function number(obj) {
- return obj != null && _typeof(obj) === _typeof(1) && !isNaN(obj);
-};
-var integer = function integer(obj) {
- return number$1(obj) && Math.floor(obj) === obj;
-};
-var htmlElement = function htmlElement(obj) {
- if ('undefined' === typeofhtmlele) {
- return undefined;
- } else {
- return null != obj && obj instanceof HTMLElement;
- }
-};
-var elementOrCollection = function elementOrCollection(obj) {
- return element(obj) || collection(obj);
-};
-var element = function element(obj) {
- return instanceStr(obj) === 'collection' && obj._private.single;
-};
-var collection = function collection(obj) {
- return instanceStr(obj) === 'collection' && !obj._private.single;
-};
-var core = function core(obj) {
- return instanceStr(obj) === 'core';
-};
-var stylesheet = function stylesheet(obj) {
- return instanceStr(obj) === 'stylesheet';
-};
-var event = function event(obj) {
- return instanceStr(obj) === 'event';
-};
-var emptyString = function emptyString(obj) {
- if (obj === undefined || obj === null) {
- // null is empty
- return true;
- } else if (obj === '' || obj.match(/^\s+$/)) {
- return true; // empty string is empty
- }
+/***/ "./node_modules/dagre/lib/coordinate-system.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/dagre/lib/coordinate-system.js ***!
+ \*****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- return false; // otherwise, we don't know what we've got
+"use strict";
+
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+
+module.exports = {
+ adjust: adjust,
+ undo: undo
};
-var domElement = function domElement(obj) {
- if (typeof HTMLElement === 'undefined') {
- return false; // we're not in a browser so it doesn't matter
- } else {
- return obj instanceof HTMLElement;
+
+function adjust(g) {
+ var rankDir = g.graph().rankdir.toLowerCase();
+ if (rankDir === "lr" || rankDir === "rl") {
+ swapWidthHeight(g);
}
-};
-var boundingBox = function boundingBox(obj) {
- return plainObject(obj) && number$1(obj.x1) && number$1(obj.x2) && number$1(obj.y1) && number$1(obj.y2);
-};
-var promise = function promise(obj) {
- return object(obj) && fn$6(obj.then);
-};
-var ms = function ms() {
- return navigator && navigator.userAgent.match(/msie|trident|edge/i);
-}; // probably a better way to detect this...
+}
-var memoize = function memoize(fn, keyFn) {
- if (!keyFn) {
- keyFn = function keyFn() {
- if (arguments.length === 1) {
- return arguments[0];
- } else if (arguments.length === 0) {
- return 'undefined';
- }
- var args = [];
- for (var i = 0; i < arguments.length; i++) {
- args.push(arguments[i]);
- }
- return args.join('$');
- };
+function undo(g) {
+ var rankDir = g.graph().rankdir.toLowerCase();
+ if (rankDir === "bt" || rankDir === "rl") {
+ reverseY(g);
}
- var memoizedFn = function memoizedFn() {
- var self = this;
- var args = arguments;
- var ret;
- var k = keyFn.apply(self, args);
- var cache = memoizedFn.cache;
- if (!(ret = cache[k])) {
- ret = cache[k] = fn.apply(self, args);
- }
- return ret;
- };
- memoizedFn.cache = {};
- return memoizedFn;
-};
-var camel2dash = memoize(function (str) {
- return str.replace(/([A-Z])/g, function (v) {
- return '-' + v.toLowerCase();
- });
-});
-var dash2camel = memoize(function (str) {
- return str.replace(/(-\w)/g, function (v) {
- return v[1].toUpperCase();
- });
-});
-var prependCamel = memoize(function (prefix, str) {
- return prefix + str[0].toUpperCase() + str.substring(1);
-}, function (prefix, str) {
- return prefix + '$' + str;
-});
-var capitalize = function capitalize(str) {
- if (emptyString(str)) {
- return str;
+ if (rankDir === "lr" || rankDir === "rl") {
+ swapXY(g);
+ swapWidthHeight(g);
}
- return str.charAt(0).toUpperCase() + str.substring(1);
-};
+}
-var number = '(?:[-+]?(?:(?:\\d+|\\d*\\.\\d+)(?:[Ee][+-]?\\d+)?))';
-var rgba = 'rgb[a]?\\((' + number + '[%]?)\\s*,\\s*(' + number + '[%]?)\\s*,\\s*(' + number + '[%]?)(?:\\s*,\\s*(' + number + '))?\\)';
-var rgbaNoBackRefs = 'rgb[a]?\\((?:' + number + '[%]?)\\s*,\\s*(?:' + number + '[%]?)\\s*,\\s*(?:' + number + '[%]?)(?:\\s*,\\s*(?:' + number + '))?\\)';
-var hsla = 'hsl[a]?\\((' + number + ')\\s*,\\s*(' + number + '[%])\\s*,\\s*(' + number + '[%])(?:\\s*,\\s*(' + number + '))?\\)';
-var hslaNoBackRefs = 'hsl[a]?\\((?:' + number + ')\\s*,\\s*(?:' + number + '[%])\\s*,\\s*(?:' + number + '[%])(?:\\s*,\\s*(?:' + number + '))?\\)';
-var hex3 = '\\#[0-9a-fA-F]{3}';
-var hex6 = '\\#[0-9a-fA-F]{6}';
+function swapWidthHeight(g) {
+ _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });
+ _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });
+}
-var ascending = function ascending(a, b) {
- if (a < b) {
- return -1;
- } else if (a > b) {
- return 1;
- } else {
- return 0;
- }
-};
-var descending = function descending(a, b) {
- return -1 * ascending(a, b);
-};
+function swapWidthHeightOne(attrs) {
+ var w = attrs.width;
+ attrs.width = attrs.height;
+ attrs.height = w;
+}
-var extend = Object.assign != null ? Object.assign.bind(Object) : function (tgt) {
- var args = arguments;
- for (var i = 1; i < args.length; i++) {
- var obj = args[i];
- if (obj == null) {
- continue;
+function reverseY(g) {
+ _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });
+
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ _.forEach(edge.points, reverseYOne);
+ if (_.has(edge, "y")) {
+ reverseYOne(edge);
}
- var keys = Object.keys(obj);
- for (var j = 0; j < keys.length; j++) {
- var k = keys[j];
- tgt[k] = obj[k];
+ });
+}
+
+function reverseYOne(attrs) {
+ attrs.y = -attrs.y;
+}
+
+function swapXY(g) {
+ _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });
+
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ _.forEach(edge.points, swapXYOne);
+ if (_.has(edge, "x")) {
+ swapXYOne(edge);
}
+ });
+}
+
+function swapXYOne(attrs) {
+ var x = attrs.x;
+ attrs.x = attrs.y;
+ attrs.y = x;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/data/list.js":
+/*!*********************************************!*\
+ !*** ./node_modules/dagre/lib/data/list.js ***!
+ \*********************************************/
+/***/ (function(module) {
+
+/*
+ * Simple doubly linked list implementation derived from Cormen, et al.,
+ * "Introduction to Algorithms".
+ */
+
+module.exports = List;
+
+function List() {
+ var sentinel = {};
+ sentinel._next = sentinel._prev = sentinel;
+ this._sentinel = sentinel;
+}
+
+List.prototype.dequeue = function() {
+ var sentinel = this._sentinel;
+ var entry = sentinel._prev;
+ if (entry !== sentinel) {
+ unlink(entry);
+ return entry;
}
- return tgt;
};
-// get [r, g, b] from #abc or #aabbcc
-var hex2tuple = function hex2tuple(hex) {
- if (!(hex.length === 4 || hex.length === 7) || hex[0] !== '#') {
- return;
+List.prototype.enqueue = function(entry) {
+ var sentinel = this._sentinel;
+ if (entry._prev && entry._next) {
+ unlink(entry);
}
- var shortHex = hex.length === 4;
- var r, g, b;
- var base = 16;
- if (shortHex) {
- r = parseInt(hex[1] + hex[1], base);
- g = parseInt(hex[2] + hex[2], base);
- b = parseInt(hex[3] + hex[3], base);
- } else {
- r = parseInt(hex[1] + hex[2], base);
- g = parseInt(hex[3] + hex[4], base);
- b = parseInt(hex[5] + hex[6], base);
+ entry._next = sentinel._next;
+ sentinel._next._prev = entry;
+ sentinel._next = entry;
+ entry._prev = sentinel;
+};
+
+List.prototype.toString = function() {
+ var strs = [];
+ var sentinel = this._sentinel;
+ var curr = sentinel._prev;
+ while (curr !== sentinel) {
+ strs.push(JSON.stringify(curr, filterOutLinks));
+ curr = curr._prev;
}
- return [r, g, b];
+ return "[" + strs.join(", ") + "]";
};
-// get [r, g, b, a] from hsl(0, 0, 0) or hsla(0, 0, 0, 0)
-var hsl2tuple = function hsl2tuple(hsl) {
- var ret;
- var h, s, l, a, r, g, b;
- function hue2rgb(p, q, t) {
- if (t < 0) t += 1;
- if (t > 1) t -= 1;
- if (t < 1 / 6) return p + (q - p) * 6 * t;
- if (t < 1 / 2) return q;
- if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;
- return p;
+function unlink(entry) {
+ entry._prev._next = entry._next;
+ entry._next._prev = entry._prev;
+ delete entry._next;
+ delete entry._prev;
+}
+
+function filterOutLinks(k, v) {
+ if (k !== "_next" && k !== "_prev") {
+ return v;
}
- var m = new RegExp('^' + hsla + '$').exec(hsl);
- if (m) {
- // get hue
- h = parseInt(m[1]);
- if (h < 0) {
- h = (360 - -1 * h % 360) % 360;
- } else if (h > 360) {
- h = h % 360;
- }
- h /= 360; // normalise on [0, 1]
+}
- s = parseFloat(m[2]);
- if (s < 0 || s > 100) {
- return;
- } // saturation is [0, 100]
- s = s / 100; // normalise on [0, 1]
- l = parseFloat(m[3]);
- if (l < 0 || l > 100) {
- return;
- } // lightness is [0, 100]
- l = l / 100; // normalise on [0, 1]
+/***/ }),
- a = m[4];
- if (a !== undefined) {
- a = parseFloat(a);
- if (a < 0 || a > 1) {
- return;
- } // alpha is [0, 1]
- }
+/***/ "./node_modules/dagre/lib/debug.js":
+/*!*****************************************!*\
+ !*** ./node_modules/dagre/lib/debug.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // now, convert to rgb
- // code from http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript
- if (s === 0) {
- r = g = b = Math.round(l * 255); // achromatic
- } else {
- var q = l < 0.5 ? l * (1 + s) : l + s - l * s;
- var p = 2 * l - q;
- r = Math.round(255 * hue2rgb(p, q, h + 1 / 3));
- g = Math.round(255 * hue2rgb(p, q, h));
- b = Math.round(255 * hue2rgb(p, q, h - 1 / 3));
- }
- ret = [r, g, b, a];
- }
- return ret;
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
+var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+
+module.exports = {
+ debugOrdering: debugOrdering
};
-// get [r, g, b, a] from rgb(0, 0, 0) or rgba(0, 0, 0, 0)
-var rgb2tuple = function rgb2tuple(rgb) {
- var ret;
- var m = new RegExp('^' + rgba + '$').exec(rgb);
- if (m) {
- ret = [];
- var isPct = [];
- for (var i = 1; i <= 3; i++) {
- var channel = m[i];
- if (channel[channel.length - 1] === '%') {
- isPct[i] = true;
- }
- channel = parseFloat(channel);
- if (isPct[i]) {
- channel = channel / 100 * 255; // normalise to [0, 255]
- }
+/* istanbul ignore next */
+function debugOrdering(g) {
+ var layerMatrix = util.buildLayerMatrix(g);
- if (channel < 0 || channel > 255) {
- return;
- } // invalid channel value
+ var h = new Graph({ compound: true, multigraph: true }).setGraph({});
- ret.push(Math.floor(channel));
- }
- var atLeastOneIsPct = isPct[1] || isPct[2] || isPct[3];
- var allArePct = isPct[1] && isPct[2] && isPct[3];
- if (atLeastOneIsPct && !allArePct) {
- return;
- } // must all be percent values if one is
+ _.forEach(g.nodes(), function(v) {
+ h.setNode(v, { label: v });
+ h.setParent(v, "layer" + g.node(v).rank);
+ });
- var alpha = m[4];
- if (alpha !== undefined) {
- alpha = parseFloat(alpha);
- if (alpha < 0 || alpha > 1) {
- return;
- } // invalid alpha value
+ _.forEach(g.edges(), function(e) {
+ h.setEdge(e.v, e.w, {}, e.name);
+ });
- ret.push(alpha);
- }
+ _.forEach(layerMatrix, function(layer, i) {
+ var layerV = "layer" + i;
+ h.setNode(layerV, { rank: "same" });
+ _.reduce(layer, function(u, v) {
+ h.setEdge(u, v, { style: "invis" });
+ return v;
+ });
+ });
+
+ return h;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/graphlib.js":
+/*!********************************************!*\
+ !*** ./node_modules/dagre/lib/graphlib.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+/* global window */
+
+var graphlib;
+
+if (true) {
+ try {
+ graphlib = __webpack_require__(/*! graphlib */ "./node_modules/graphlib/index.js");
+ } catch (e) {
+ // continue regardless of error
}
- return ret;
-};
-var colorname2tuple = function colorname2tuple(color) {
- return colors[color.toLowerCase()];
-};
-var color2tuple = function color2tuple(color) {
- return (array(color) ? color : null) || colorname2tuple(color) || hex2tuple(color) || rgb2tuple(color) || hsl2tuple(color);
-};
-var colors = {
- // special colour names
- transparent: [0, 0, 0, 0],
- // NB alpha === 0
+}
- // regular colours
- aliceblue: [240, 248, 255],
- antiquewhite: [250, 235, 215],
- aqua: [0, 255, 255],
- aquamarine: [127, 255, 212],
- azure: [240, 255, 255],
- beige: [245, 245, 220],
- bisque: [255, 228, 196],
- black: [0, 0, 0],
- blanchedalmond: [255, 235, 205],
- blue: [0, 0, 255],
- blueviolet: [138, 43, 226],
- brown: [165, 42, 42],
- burlywood: [222, 184, 135],
- cadetblue: [95, 158, 160],
- chartreuse: [127, 255, 0],
- chocolate: [210, 105, 30],
- coral: [255, 127, 80],
- cornflowerblue: [100, 149, 237],
- cornsilk: [255, 248, 220],
- crimson: [220, 20, 60],
- cyan: [0, 255, 255],
- darkblue: [0, 0, 139],
- darkcyan: [0, 139, 139],
- darkgoldenrod: [184, 134, 11],
- darkgray: [169, 169, 169],
- darkgreen: [0, 100, 0],
- darkgrey: [169, 169, 169],
- darkkhaki: [189, 183, 107],
- darkmagenta: [139, 0, 139],
- darkolivegreen: [85, 107, 47],
- darkorange: [255, 140, 0],
- darkorchid: [153, 50, 204],
- darkred: [139, 0, 0],
- darksalmon: [233, 150, 122],
- darkseagreen: [143, 188, 143],
- darkslateblue: [72, 61, 139],
- darkslategray: [47, 79, 79],
- darkslategrey: [47, 79, 79],
- darkturquoise: [0, 206, 209],
- darkviolet: [148, 0, 211],
- deeppink: [255, 20, 147],
- deepskyblue: [0, 191, 255],
- dimgray: [105, 105, 105],
- dimgrey: [105, 105, 105],
- dodgerblue: [30, 144, 255],
- firebrick: [178, 34, 34],
- floralwhite: [255, 250, 240],
- forestgreen: [34, 139, 34],
- fuchsia: [255, 0, 255],
- gainsboro: [220, 220, 220],
- ghostwhite: [248, 248, 255],
- gold: [255, 215, 0],
- goldenrod: [218, 165, 32],
- gray: [128, 128, 128],
- grey: [128, 128, 128],
- green: [0, 128, 0],
- greenyellow: [173, 255, 47],
- honeydew: [240, 255, 240],
- hotpink: [255, 105, 180],
- indianred: [205, 92, 92],
- indigo: [75, 0, 130],
- ivory: [255, 255, 240],
- khaki: [240, 230, 140],
- lavender: [230, 230, 250],
- lavenderblush: [255, 240, 245],
- lawngreen: [124, 252, 0],
- lemonchiffon: [255, 250, 205],
- lightblue: [173, 216, 230],
- lightcoral: [240, 128, 128],
- lightcyan: [224, 255, 255],
- lightgoldenrodyellow: [250, 250, 210],
- lightgray: [211, 211, 211],
- lightgreen: [144, 238, 144],
- lightgrey: [211, 211, 211],
- lightpink: [255, 182, 193],
- lightsalmon: [255, 160, 122],
- lightseagreen: [32, 178, 170],
- lightskyblue: [135, 206, 250],
- lightslategray: [119, 136, 153],
- lightslategrey: [119, 136, 153],
- lightsteelblue: [176, 196, 222],
- lightyellow: [255, 255, 224],
- lime: [0, 255, 0],
- limegreen: [50, 205, 50],
- linen: [250, 240, 230],
- magenta: [255, 0, 255],
- maroon: [128, 0, 0],
- mediumaquamarine: [102, 205, 170],
- mediumblue: [0, 0, 205],
- mediumorchid: [186, 85, 211],
- mediumpurple: [147, 112, 219],
- mediumseagreen: [60, 179, 113],
- mediumslateblue: [123, 104, 238],
- mediumspringgreen: [0, 250, 154],
- mediumturquoise: [72, 209, 204],
- mediumvioletred: [199, 21, 133],
- midnightblue: [25, 25, 112],
- mintcream: [245, 255, 250],
- mistyrose: [255, 228, 225],
- moccasin: [255, 228, 181],
- navajowhite: [255, 222, 173],
- navy: [0, 0, 128],
- oldlace: [253, 245, 230],
- olive: [128, 128, 0],
- olivedrab: [107, 142, 35],
- orange: [255, 165, 0],
- orangered: [255, 69, 0],
- orchid: [218, 112, 214],
- palegoldenrod: [238, 232, 170],
- palegreen: [152, 251, 152],
- paleturquoise: [175, 238, 238],
- palevioletred: [219, 112, 147],
- papayawhip: [255, 239, 213],
- peachpuff: [255, 218, 185],
- peru: [205, 133, 63],
- pink: [255, 192, 203],
- plum: [221, 160, 221],
- powderblue: [176, 224, 230],
- purple: [128, 0, 128],
- red: [255, 0, 0],
- rosybrown: [188, 143, 143],
- royalblue: [65, 105, 225],
- saddlebrown: [139, 69, 19],
- salmon: [250, 128, 114],
- sandybrown: [244, 164, 96],
- seagreen: [46, 139, 87],
- seashell: [255, 245, 238],
- sienna: [160, 82, 45],
- silver: [192, 192, 192],
- skyblue: [135, 206, 235],
- slateblue: [106, 90, 205],
- slategray: [112, 128, 144],
- slategrey: [112, 128, 144],
- snow: [255, 250, 250],
- springgreen: [0, 255, 127],
- steelblue: [70, 130, 180],
- tan: [210, 180, 140],
- teal: [0, 128, 128],
- thistle: [216, 191, 216],
- tomato: [255, 99, 71],
- turquoise: [64, 224, 208],
- violet: [238, 130, 238],
- wheat: [245, 222, 179],
- white: [255, 255, 255],
- whitesmoke: [245, 245, 245],
- yellow: [255, 255, 0],
- yellowgreen: [154, 205, 50]
-};
+if (!graphlib) {
+ graphlib = window.graphlib;
+}
-// sets the value in a map (map may not be built)
-var setMap = function setMap(options) {
- var obj = options.map;
- var keys = options.keys;
- var l = keys.length;
- for (var i = 0; i < l; i++) {
- var key = keys[i];
- if (plainObject(key)) {
- throw Error('Tried to set map with object key');
- }
- if (i < keys.length - 1) {
- // extend the map if necessary
- if (obj[key] == null) {
- obj[key] = {};
- }
- obj = obj[key];
- } else {
- // set the value
- obj[key] = options.value;
- }
+module.exports = graphlib;
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/greedy-fas.js":
+/*!**********************************************!*\
+ !*** ./node_modules/dagre/lib/greedy-fas.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+var List = __webpack_require__(/*! ./data/list */ "./node_modules/dagre/lib/data/list.js");
+
+/*
+ * A greedy heuristic for finding a feedback arc set for a graph. A feedback
+ * arc set is a set of edges that can be removed to make a graph acyclic.
+ * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
+ * effective heuristic for the feedback arc set problem." This implementation
+ * adjusts that from the paper to allow for weighted edges.
+ */
+module.exports = greedyFAS;
+
+var DEFAULT_WEIGHT_FN = _.constant(1);
+
+function greedyFAS(g, weightFn) {
+ if (g.nodeCount() <= 1) {
+ return [];
}
-};
+ var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
+ var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
-// gets the value in a map even if it's not built in places
-var getMap = function getMap(options) {
- var obj = options.map;
- var keys = options.keys;
- var l = keys.length;
- for (var i = 0; i < l; i++) {
- var key = keys[i];
- if (plainObject(key)) {
- throw Error('Tried to get map with object key');
- }
- obj = obj[key];
- if (obj == null) {
- return obj;
+ // Expand multi-edges
+ return _.flatten(_.map(results, function(e) {
+ return g.outEdges(e.v, e.w);
+ }), true);
+}
+
+function doGreedyFAS(g, buckets, zeroIdx) {
+ var results = [];
+ var sources = buckets[buckets.length - 1];
+ var sinks = buckets[0];
+
+ var entry;
+ while (g.nodeCount()) {
+ while ((entry = sinks.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
+ while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
+ if (g.nodeCount()) {
+ for (var i = buckets.length - 2; i > 0; --i) {
+ entry = buckets[i].dequeue();
+ if (entry) {
+ results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
+ break;
+ }
+ }
}
}
- return obj;
-};
-var performance = _window ? _window.performance : null;
-var pnow = performance && performance.now ? function () {
- return performance.now();
-} : function () {
- return Date.now();
-};
-var raf = function () {
- if (_window) {
- if (_window.requestAnimationFrame) {
- return function (fn) {
- _window.requestAnimationFrame(fn);
- };
- } else if (_window.mozRequestAnimationFrame) {
- return function (fn) {
- _window.mozRequestAnimationFrame(fn);
- };
- } else if (_window.webkitRequestAnimationFrame) {
- return function (fn) {
- _window.webkitRequestAnimationFrame(fn);
- };
- } else if (_window.msRequestAnimationFrame) {
- return function (fn) {
- _window.msRequestAnimationFrame(fn);
- };
- }
- }
- return function (fn) {
- if (fn) {
- setTimeout(function () {
- fn(pnow());
- }, 1000 / 60);
- }
- };
-}();
-var requestAnimationFrame = function requestAnimationFrame(fn) {
- return raf(fn);
-};
-var performanceNow = pnow;
+ return results;
+}
-var DEFAULT_HASH_SEED = 9261;
-var K = 65599; // 37 also works pretty well
-var DEFAULT_HASH_SEED_ALT = 5381;
-var hashIterableInts = function hashIterableInts(iterator) {
- var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED;
- // sdbm/string-hash
- var hash = seed;
- var entry;
- for (;;) {
- entry = iterator.next();
- if (entry.done) {
- break;
- }
- hash = hash * K + entry.value | 0;
- }
- return hash;
-};
-var hashInt = function hashInt(num) {
- var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED;
- // sdbm/string-hash
- return seed * K + num | 0;
-};
-var hashIntAlt = function hashIntAlt(num) {
- var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED_ALT;
- // djb2/string-hash
- return (seed << 5) + seed + num | 0;
-};
-var combineHashes = function combineHashes(hash1, hash2) {
- return hash1 * 0x200000 + hash2;
-};
-var combineHashesArray = function combineHashesArray(hashes) {
- return hashes[0] * 0x200000 + hashes[1];
-};
-var hashArrays = function hashArrays(hashes1, hashes2) {
- return [hashInt(hashes1[0], hashes2[0]), hashIntAlt(hashes1[1], hashes2[1])];
-};
-var hashIntsArray = function hashIntsArray(ints, seed) {
- var entry = {
- value: 0,
- done: false
- };
- var i = 0;
- var length = ints.length;
- var iterator = {
- next: function next() {
- if (i < length) {
- entry.value = ints[i++];
- } else {
- entry.done = true;
- }
- return entry;
- }
- };
- return hashIterableInts(iterator, seed);
-};
-var hashString = function hashString(str, seed) {
- var entry = {
- value: 0,
- done: false
- };
- var i = 0;
- var length = str.length;
- var iterator = {
- next: function next() {
- if (i < length) {
- entry.value = str.charCodeAt(i++);
- } else {
- entry.done = true;
- }
- return entry;
- }
- };
- return hashIterableInts(iterator, seed);
-};
-var hashStrings = function hashStrings() {
- return hashStringsArray(arguments);
-};
-var hashStringsArray = function hashStringsArray(strs) {
- var hash;
- for (var i = 0; i < strs.length; i++) {
- var str = strs[i];
- if (i === 0) {
- hash = hashString(str);
- } else {
- hash = hashString(str, hash);
- }
- }
- return hash;
-};
+function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
+ var results = collectPredecessors ? [] : undefined;
-/*global console */
-var warningsEnabled = true;
-var warnSupported = console.warn != null; // eslint-disable-line no-console
-var traceSupported = console.trace != null; // eslint-disable-line no-console
+ _.forEach(g.inEdges(entry.v), function(edge) {
+ var weight = g.edge(edge);
+ var uEntry = g.node(edge.v);
-var MAX_INT$1 = Number.MAX_SAFE_INTEGER || 9007199254740991;
-var trueify = function trueify() {
- return true;
-};
-var falsify = function falsify() {
- return false;
-};
-var zeroify = function zeroify() {
- return 0;
-};
-var noop$1 = function noop() {};
-var error = function error(msg) {
- throw new Error(msg);
-};
-var warnings = function warnings(enabled) {
- if (enabled !== undefined) {
- warningsEnabled = !!enabled;
- } else {
- return warningsEnabled;
- }
-};
-var warn = function warn(msg) {
- /* eslint-disable no-console */
- if (!warnings()) {
- return;
- }
- if (warnSupported) {
- console.warn(msg);
- } else {
- console.log(msg);
- if (traceSupported) {
- console.trace();
+ if (collectPredecessors) {
+ results.push({ v: edge.v, w: edge.w });
}
- }
-}; /* eslint-enable */
-var clone = function clone(obj) {
- return extend({}, obj);
-};
+ uEntry.out -= weight;
+ assignBucket(buckets, zeroIdx, uEntry);
+ });
-// gets a shallow copy of the argument
-var copy = function copy(obj) {
- if (obj == null) {
- return obj;
- }
- if (array(obj)) {
- return obj.slice();
- } else if (plainObject(obj)) {
- return clone(obj);
+ _.forEach(g.outEdges(entry.v), function(edge) {
+ var weight = g.edge(edge);
+ var w = edge.w;
+ var wEntry = g.node(w);
+ wEntry["in"] -= weight;
+ assignBucket(buckets, zeroIdx, wEntry);
+ });
+
+ g.removeNode(entry.v);
+
+ return results;
+}
+
+function buildState(g, weightFn) {
+ var fasGraph = new Graph();
+ var maxIn = 0;
+ var maxOut = 0;
+
+ _.forEach(g.nodes(), function(v) {
+ fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
+ });
+
+ // Aggregate weights on nodes, but also sum the weights across multi-edges
+ // into a single edge for the fasGraph.
+ _.forEach(g.edges(), function(e) {
+ var prevWeight = fasGraph.edge(e.v, e.w) || 0;
+ var weight = weightFn(e);
+ var edgeWeight = prevWeight + weight;
+ fasGraph.setEdge(e.v, e.w, edgeWeight);
+ maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
+ maxIn = Math.max(maxIn, fasGraph.node(e.w)["in"] += weight);
+ });
+
+ var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });
+ var zeroIdx = maxIn + 1;
+
+ _.forEach(fasGraph.nodes(), function(v) {
+ assignBucket(buckets, zeroIdx, fasGraph.node(v));
+ });
+
+ return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
+}
+
+function assignBucket(buckets, zeroIdx, entry) {
+ if (!entry.out) {
+ buckets[0].enqueue(entry);
+ } else if (!entry["in"]) {
+ buckets[buckets.length - 1].enqueue(entry);
} else {
- return obj;
- }
-};
-var copyArray = function copyArray(arr) {
- return arr.slice();
-};
-var uuid = function uuid(a, b /* placeholders */) {
- for (
- // loop :)
- b = a = '';
- // b - result , a - numeric letiable
- a++ < 36;
- //
- b += a * 51 & 52 // if "a" is not 9 or 14 or 19 or 24
- ?
- // return a random number or 4
- (a ^ 15 // if "a" is not 15
- ?
- // generate a random number from 0 to 15
- 8 ^ Math.random() * (a ^ 20 ? 16 : 4) // unless "a" is 20, in which case a random number from 8 to 11
- : 4 // otherwise 4
- ).toString(16) : '-' // in other cases (if "a" is 9,14,19,24) insert "-"
- ) {
- }
- return b;
-};
-var _staticEmptyObject = {};
-var staticEmptyObject = function staticEmptyObject() {
- return _staticEmptyObject;
-};
-var defaults$g = function defaults(_defaults) {
- var keys = Object.keys(_defaults);
- return function (opts) {
- var filledOpts = {};
- for (var i = 0; i < keys.length; i++) {
- var key = keys[i];
- var optVal = opts == null ? undefined : opts[key];
- filledOpts[key] = optVal === undefined ? _defaults[key] : optVal;
- }
- return filledOpts;
- };
-};
-var removeFromArray = function removeFromArray(arr, ele, oneCopy) {
- for (var i = arr.length - 1; i >= 0; i--) {
- if (arr[i] === ele) {
- arr.splice(i, 1);
- if (oneCopy) {
- break;
- }
- }
- }
-};
-var clearArray = function clearArray(arr) {
- arr.splice(0, arr.length);
-};
-var push = function push(arr, otherArr) {
- for (var i = 0; i < otherArr.length; i++) {
- var el = otherArr[i];
- arr.push(el);
- }
-};
-var getPrefixedProperty = function getPrefixedProperty(obj, propName, prefix) {
- if (prefix) {
- propName = prependCamel(prefix, propName); // e.g. (labelWidth, source) => sourceLabelWidth
+ buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
}
+}
- return obj[propName];
-};
-var setPrefixedProperty = function setPrefixedProperty(obj, propName, prefix, value) {
- if (prefix) {
- propName = prependCamel(prefix, propName); // e.g. (labelWidth, source) => sourceLabelWidth
- }
- obj[propName] = value;
-};
+/***/ }),
-/* global Map */
-var ObjectMap = /*#__PURE__*/function () {
- function ObjectMap() {
- _classCallCheck(this, ObjectMap);
- this._obj = {};
- }
- _createClass(ObjectMap, [{
- key: "set",
- value: function set(key, val) {
- this._obj[key] = val;
- return this;
- }
- }, {
- key: "delete",
- value: function _delete(key) {
- this._obj[key] = undefined;
- return this;
- }
- }, {
- key: "clear",
- value: function clear() {
- this._obj = {};
- }
- }, {
- key: "has",
- value: function has(key) {
- return this._obj[key] !== undefined;
- }
- }, {
- key: "get",
- value: function get(key) {
- return this._obj[key];
- }
- }]);
- return ObjectMap;
-}();
-var Map$1 = typeof Map !== 'undefined' ? Map : ObjectMap;
+/***/ "./node_modules/dagre/lib/layout.js":
+/*!******************************************!*\
+ !*** ./node_modules/dagre/lib/layout.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/* global Set */
+"use strict";
-var undef = "undefined" ;
-var ObjectSet = /*#__PURE__*/function () {
- function ObjectSet(arrayOrObjectSet) {
- _classCallCheck(this, ObjectSet);
- this._obj = Object.create(null);
- this.size = 0;
- if (arrayOrObjectSet != null) {
- var arr;
- if (arrayOrObjectSet.instanceString != null && arrayOrObjectSet.instanceString() === this.instanceString()) {
- arr = arrayOrObjectSet.toArray();
- } else {
- arr = arrayOrObjectSet;
- }
- for (var i = 0; i < arr.length; i++) {
- this.add(arr[i]);
- }
- }
- }
- _createClass(ObjectSet, [{
- key: "instanceString",
- value: function instanceString() {
- return 'set';
- }
- }, {
- key: "add",
- value: function add(val) {
- var o = this._obj;
- if (o[val] !== 1) {
- o[val] = 1;
- this.size++;
- }
- }
- }, {
- key: "delete",
- value: function _delete(val) {
- var o = this._obj;
- if (o[val] === 1) {
- o[val] = 0;
- this.size--;
- }
- }
- }, {
- key: "clear",
- value: function clear() {
- this._obj = Object.create(null);
- }
- }, {
- key: "has",
- value: function has(val) {
- return this._obj[val] === 1;
- }
- }, {
- key: "toArray",
- value: function toArray() {
- var _this = this;
- return Object.keys(this._obj).filter(function (key) {
- return _this.has(key);
- });
- }
- }, {
- key: "forEach",
- value: function forEach(callback, thisArg) {
- return this.toArray().forEach(callback, thisArg);
- }
- }]);
- return ObjectSet;
-}();
-var Set$1 = (typeof Set === "undefined" ? "undefined" : _typeof(Set)) !== undef ? Set : ObjectSet;
-// represents a node or an edge
-var Element = function Element(cy, params) {
- var restore = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
- if (cy === undefined || params === undefined || !core(cy)) {
- error('An element must have a core reference and parameters set');
- return;
- }
- var group = params.group;
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var acyclic = __webpack_require__(/*! ./acyclic */ "./node_modules/dagre/lib/acyclic.js");
+var normalize = __webpack_require__(/*! ./normalize */ "./node_modules/dagre/lib/normalize.js");
+var rank = __webpack_require__(/*! ./rank */ "./node_modules/dagre/lib/rank/index.js");
+var normalizeRanks = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js").normalizeRanks);
+var parentDummyChains = __webpack_require__(/*! ./parent-dummy-chains */ "./node_modules/dagre/lib/parent-dummy-chains.js");
+var removeEmptyRanks = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js").removeEmptyRanks);
+var nestingGraph = __webpack_require__(/*! ./nesting-graph */ "./node_modules/dagre/lib/nesting-graph.js");
+var addBorderSegments = __webpack_require__(/*! ./add-border-segments */ "./node_modules/dagre/lib/add-border-segments.js");
+var coordinateSystem = __webpack_require__(/*! ./coordinate-system */ "./node_modules/dagre/lib/coordinate-system.js");
+var order = __webpack_require__(/*! ./order */ "./node_modules/dagre/lib/order/index.js");
+var position = __webpack_require__(/*! ./position */ "./node_modules/dagre/lib/position/index.js");
+var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
+var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
- // try to automatically infer the group if unspecified
- if (group == null) {
- if (params.data && params.data.source != null && params.data.target != null) {
- group = 'edges';
- } else {
- group = 'nodes';
- }
- }
+module.exports = layout;
- // validate group
- if (group !== 'nodes' && group !== 'edges') {
- error('An element must be of type `nodes` or `edges`; you specified `' + group + '`');
- return;
- }
+function layout(g, opts) {
+ var time = opts && opts.debugTiming ? util.time : util.notime;
+ time("layout", function() {
+ var layoutGraph =
+ time(" buildLayoutGraph", function() { return buildLayoutGraph(g); });
+ time(" runLayout", function() { runLayout(layoutGraph, time); });
+ time(" updateInputGraph", function() { updateInputGraph(g, layoutGraph); });
+ });
+}
- // make the element array-like, just like a collection
- this.length = 1;
- this[0] = this;
+function runLayout(g, time) {
+ time(" makeSpaceForEdgeLabels", function() { makeSpaceForEdgeLabels(g); });
+ time(" removeSelfEdges", function() { removeSelfEdges(g); });
+ time(" acyclic", function() { acyclic.run(g); });
+ time(" nestingGraph.run", function() { nestingGraph.run(g); });
+ time(" rank", function() { rank(util.asNonCompoundGraph(g)); });
+ time(" injectEdgeLabelProxies", function() { injectEdgeLabelProxies(g); });
+ time(" removeEmptyRanks", function() { removeEmptyRanks(g); });
+ time(" nestingGraph.cleanup", function() { nestingGraph.cleanup(g); });
+ time(" normalizeRanks", function() { normalizeRanks(g); });
+ time(" assignRankMinMax", function() { assignRankMinMax(g); });
+ time(" removeEdgeLabelProxies", function() { removeEdgeLabelProxies(g); });
+ time(" normalize.run", function() { normalize.run(g); });
+ time(" parentDummyChains", function() { parentDummyChains(g); });
+ time(" addBorderSegments", function() { addBorderSegments(g); });
+ time(" order", function() { order(g); });
+ time(" insertSelfEdges", function() { insertSelfEdges(g); });
+ time(" adjustCoordinateSystem", function() { coordinateSystem.adjust(g); });
+ time(" position", function() { position(g); });
+ time(" positionSelfEdges", function() { positionSelfEdges(g); });
+ time(" removeBorderNodes", function() { removeBorderNodes(g); });
+ time(" normalize.undo", function() { normalize.undo(g); });
+ time(" fixupEdgeLabelCoords", function() { fixupEdgeLabelCoords(g); });
+ time(" undoCoordinateSystem", function() { coordinateSystem.undo(g); });
+ time(" translateGraph", function() { translateGraph(g); });
+ time(" assignNodeIntersects", function() { assignNodeIntersects(g); });
+ time(" reversePoints", function() { reversePointsForReversedEdges(g); });
+ time(" acyclic.undo", function() { acyclic.undo(g); });
+}
- // NOTE: when something is added here, add also to ele.json()
- var _p = this._private = {
- cy: cy,
- single: true,
- // indicates this is an element
- data: params.data || {},
- // data object
- position: params.position || {
- x: 0,
- y: 0
- },
- // (x, y) position pair
- autoWidth: undefined,
- // width and height of nodes calculated by the renderer when set to special 'auto' value
- autoHeight: undefined,
- autoPadding: undefined,
- compoundBoundsClean: false,
- // whether the compound dimensions need to be recalculated the next time dimensions are read
- listeners: [],
- // array of bound listeners
- group: group,
- // string; 'nodes' or 'edges'
- style: {},
- // properties as set by the style
- rstyle: {},
- // properties for style sent from the renderer to the core
- styleCxts: [],
- // applied style contexts from the styler
- styleKeys: {},
- // per-group keys of style property values
- removed: true,
- // whether it's inside the vis; true if removed (set true here since we call restore)
- selected: params.selected ? true : false,
- // whether it's selected
- selectable: params.selectable === undefined ? true : params.selectable ? true : false,
- // whether it's selectable
- locked: params.locked ? true : false,
- // whether the element is locked (cannot be moved)
- grabbed: false,
- // whether the element is grabbed by the mouse; renderer sets this privately
- grabbable: params.grabbable === undefined ? true : params.grabbable ? true : false,
- // whether the element can be grabbed
- pannable: params.pannable === undefined ? group === 'edges' ? true : false : params.pannable ? true : false,
- // whether the element has passthrough panning enabled
- active: false,
- // whether the element is active from user interaction
- classes: new Set$1(),
- // map ( className => true )
- animation: {
- // object for currently-running animations
- current: [],
- queue: []
- },
- rscratch: {},
- // object in which the renderer can store information
- scratch: params.scratch || {},
- // scratch objects
- edges: [],
- // array of connected edges
- children: [],
- // array of children
- parent: params.parent && params.parent.isNode() ? params.parent : null,
- // parent ref
- traversalCache: {},
- // cache of output of traversal functions
- backgrounding: false,
- // whether background images are loading
- bbCache: null,
- // cache of the current bounding box
- bbCacheShift: {
- x: 0,
- y: 0
- },
- // shift applied to cached bb to be applied on next get
- bodyBounds: null,
- // bounds cache of element body, w/o overlay
- overlayBounds: null,
- // bounds cache of element body, including overlay
- labelBounds: {
- // bounds cache of labels
- all: null,
- source: null,
- target: null,
- main: null
- },
- arrowBounds: {
- // bounds cache of edge arrows
- source: null,
- target: null,
- 'mid-source': null,
- 'mid-target': null
- }
- };
- if (_p.position.x == null) {
- _p.position.x = 0;
- }
- if (_p.position.y == null) {
- _p.position.y = 0;
- }
+/*
+ * Copies final layout information from the layout graph back to the input
+ * graph. This process only copies whitelisted attributes from the layout graph
+ * to the input graph, so it serves as a good place to determine what
+ * attributes can influence layout.
+ */
+function updateInputGraph(inputGraph, layoutGraph) {
+ _.forEach(inputGraph.nodes(), function(v) {
+ var inputLabel = inputGraph.node(v);
+ var layoutLabel = layoutGraph.node(v);
- // renderedPosition overrides if specified
- if (params.renderedPosition) {
- var rpos = params.renderedPosition;
- var pan = cy.pan();
- var zoom = cy.zoom();
- _p.position = {
- x: (rpos.x - pan.x) / zoom,
- y: (rpos.y - pan.y) / zoom
- };
- }
- var classes = [];
- if (array(params.classes)) {
- classes = params.classes;
- } else if (string(params.classes)) {
- classes = params.classes.split(/\s+/);
- }
- for (var i = 0, l = classes.length; i < l; i++) {
- var cls = classes[i];
- if (!cls || cls === '') {
- continue;
+ if (inputLabel) {
+ inputLabel.x = layoutLabel.x;
+ inputLabel.y = layoutLabel.y;
+
+ if (layoutGraph.children(v).length) {
+ inputLabel.width = layoutLabel.width;
+ inputLabel.height = layoutLabel.height;
+ }
}
- _p.classes.add(cls);
- }
- this.createEmitter();
- var bypass = params.style || params.css;
- if (bypass) {
- warn('Setting a `style` bypass at element creation should be done only when absolutely necessary. Try to use the stylesheet instead.');
- this.style(bypass);
- }
- if (restore === undefined || restore) {
- this.restore();
- }
-};
+ });
-var defineSearch = function defineSearch(params) {
- params = {
- bfs: params.bfs || !params.dfs,
- dfs: params.dfs || !params.bfs
- };
+ _.forEach(inputGraph.edges(), function(e) {
+ var inputLabel = inputGraph.edge(e);
+ var layoutLabel = layoutGraph.edge(e);
- // from pseudocode on wikipedia
- return function searchFn(roots, fn, directed) {
- var options;
- if (plainObject(roots) && !elementOrCollection(roots)) {
- options = roots;
- roots = options.roots || options.root;
- fn = options.visit;
- directed = options.directed;
+ inputLabel.points = layoutLabel.points;
+ if (_.has(layoutLabel, "x")) {
+ inputLabel.x = layoutLabel.x;
+ inputLabel.y = layoutLabel.y;
}
- directed = arguments.length === 2 && !fn$6(fn) ? fn : directed;
- fn = fn$6(fn) ? fn : function () {};
- var cy = this._private.cy;
- var v = roots = string(roots) ? this.filter(roots) : roots;
- var Q = [];
- var connectedNodes = [];
- var connectedBy = {};
- var id2depth = {};
- var V = {};
- var j = 0;
- var found;
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
+ });
- // enqueue v
- for (var i = 0; i < v.length; i++) {
- var vi = v[i];
- var viId = vi.id();
- if (vi.isNode()) {
- Q.unshift(vi);
- if (params.bfs) {
- V[viId] = true;
- connectedNodes.push(vi);
- }
- id2depth[viId] = 0;
- }
- }
- var _loop = function _loop() {
- var v = params.bfs ? Q.shift() : Q.pop();
- var vId = v.id();
- if (params.dfs) {
- if (V[vId]) {
- return "continue";
- }
- V[vId] = true;
- connectedNodes.push(v);
- }
- var depth = id2depth[vId];
- var prevEdge = connectedBy[vId];
- var src = prevEdge != null ? prevEdge.source() : null;
- var tgt = prevEdge != null ? prevEdge.target() : null;
- var prevNode = prevEdge == null ? undefined : v.same(src) ? tgt[0] : src[0];
- var ret = void 0;
- ret = fn(v, prevEdge, prevNode, j++, depth);
- if (ret === true) {
- found = v;
- return "break";
- }
- if (ret === false) {
- return "break";
- }
- var vwEdges = v.connectedEdges().filter(function (e) {
- return (!directed || e.source().same(v)) && edges.has(e);
- });
- for (var _i2 = 0; _i2 < vwEdges.length; _i2++) {
- var e = vwEdges[_i2];
- var w = e.connectedNodes().filter(function (n) {
- return !n.same(v) && nodes.has(n);
- });
- var wId = w.id();
- if (w.length !== 0 && !V[wId]) {
- w = w[0];
- Q.push(w);
- if (params.bfs) {
- V[wId] = true;
- connectedNodes.push(w);
- }
- connectedBy[wId] = e;
- id2depth[wId] = id2depth[vId] + 1;
- }
- }
- };
- while (Q.length !== 0) {
- var _ret = _loop();
- if (_ret === "continue") continue;
- if (_ret === "break") break;
- }
- var connectedEles = cy.collection();
- for (var _i = 0; _i < connectedNodes.length; _i++) {
- var node = connectedNodes[_i];
- var edge = connectedBy[node.id()];
- if (edge != null) {
- connectedEles.push(edge);
- }
- connectedEles.push(node);
- }
- return {
- path: cy.collection(connectedEles),
- found: cy.collection(found)
- };
- };
-};
+ inputGraph.graph().width = layoutGraph.graph().width;
+ inputGraph.graph().height = layoutGraph.graph().height;
+}
-// search, spanning trees, etc
-var elesfn$v = {
- breadthFirstSearch: defineSearch({
- bfs: true
- }),
- depthFirstSearch: defineSearch({
- dfs: true
- })
+var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
+var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
+var nodeNumAttrs = ["width", "height"];
+var nodeDefaults = { width: 0, height: 0 };
+var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
+var edgeDefaults = {
+ minlen: 1, weight: 1, width: 0, height: 0,
+ labeloffset: 10, labelpos: "r"
};
+var edgeAttrs = ["labelpos"];
-// nice, short mathematical alias
-elesfn$v.bfs = elesfn$v.breadthFirstSearch;
-elesfn$v.dfs = elesfn$v.depthFirstSearch;
+/*
+ * Constructs a new graph from the input graph, which can be used for layout.
+ * This process copies only whitelisted attributes from the input graph to the
+ * layout graph. Thus this function serves as a good place to determine what
+ * attributes can influence layout.
+ */
+function buildLayoutGraph(inputGraph) {
+ var g = new Graph({ multigraph: true, compound: true });
+ var graph = canonicalize(inputGraph.graph());
-var dijkstraDefaults = defaults$g({
- root: null,
- weight: function weight(edge) {
- return 1;
- },
- directed: false
-});
-var elesfn$u = {
- dijkstra: function dijkstra(options) {
- if (!plainObject(options)) {
- var args = arguments;
- options = {
- root: args[0],
- weight: args[1],
- directed: args[2]
- };
- }
- var _dijkstraDefaults = dijkstraDefaults(options),
- root = _dijkstraDefaults.root,
- weight = _dijkstraDefaults.weight,
- directed = _dijkstraDefaults.directed;
- var eles = this;
- var weightFn = weight;
- var source = string(root) ? this.filter(root)[0] : root[0];
- var dist = {};
- var prev = {};
- var knownDist = {};
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
- edges.unmergeBy(function (ele) {
- return ele.isLoop();
- });
- var getDist = function getDist(node) {
- return dist[node.id()];
- };
- var setDist = function setDist(node, d) {
- dist[node.id()] = d;
- Q.updateItem(node);
- };
- var Q = new Heap__default["default"](function (a, b) {
- return getDist(a) - getDist(b);
- });
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- dist[node.id()] = node.same(source) ? 0 : Infinity;
- Q.push(node);
- }
- var distBetween = function distBetween(u, v) {
- var uvs = (directed ? u.edgesTo(v) : u.edgesWith(v)).intersect(edges);
- var smallestDistance = Infinity;
- var smallestEdge;
- for (var _i = 0; _i < uvs.length; _i++) {
- var edge = uvs[_i];
- var _weight = weightFn(edge);
- if (_weight < smallestDistance || !smallestEdge) {
- smallestDistance = _weight;
- smallestEdge = edge;
- }
- }
- return {
- edge: smallestEdge,
- dist: smallestDistance
- };
- };
- while (Q.size() > 0) {
- var u = Q.pop();
- var smalletsDist = getDist(u);
- var uid = u.id();
- knownDist[uid] = smalletsDist;
- if (smalletsDist === Infinity) {
- continue;
- }
- var neighbors = u.neighborhood().intersect(nodes);
- for (var _i2 = 0; _i2 < neighbors.length; _i2++) {
- var v = neighbors[_i2];
- var vid = v.id();
- var vDist = distBetween(u, v);
- var alt = smalletsDist + vDist.dist;
- if (alt < getDist(v)) {
- setDist(v, alt);
- prev[vid] = {
- node: u,
- edge: vDist.edge
- };
- }
- } // for
- } // while
+ g.setGraph(_.merge({},
+ graphDefaults,
+ selectNumberAttrs(graph, graphNumAttrs),
+ _.pick(graph, graphAttrs)));
- return {
- distanceTo: function distanceTo(node) {
- var target = string(node) ? nodes.filter(node)[0] : node[0];
- return knownDist[target.id()];
- },
- pathTo: function pathTo(node) {
- var target = string(node) ? nodes.filter(node)[0] : node[0];
- var S = [];
- var u = target;
- var uid = u.id();
- if (target.length > 0) {
- S.unshift(target);
- while (prev[uid]) {
- var p = prev[uid];
- S.unshift(p.edge);
- S.unshift(p.node);
- u = p.node;
- uid = u.id();
- }
- }
- return eles.spawn(S);
- }
- };
- }
-};
+ _.forEach(inputGraph.nodes(), function(v) {
+ var node = canonicalize(inputGraph.node(v));
+ g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
+ g.setParent(v, inputGraph.parent(v));
+ });
-var elesfn$t = {
- // kruskal's algorithm (finds min spanning tree, assuming undirected graph)
- // implemented from pseudocode from wikipedia
- kruskal: function kruskal(weightFn) {
- weightFn = weightFn || function (edge) {
- return 1;
- };
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
- var numNodes = nodes.length;
- var forest = new Array(numNodes);
- var A = nodes; // assumes byGroup() creates new collections that can be safely mutated
+ _.forEach(inputGraph.edges(), function(e) {
+ var edge = canonicalize(inputGraph.edge(e));
+ g.setEdge(e, _.merge({},
+ edgeDefaults,
+ selectNumberAttrs(edge, edgeNumAttrs),
+ _.pick(edge, edgeAttrs)));
+ });
- var findSetIndex = function findSetIndex(ele) {
- for (var i = 0; i < forest.length; i++) {
- var eles = forest[i];
- if (eles.has(ele)) {
- return i;
- }
+ return g;
+}
+
+/*
+ * This idea comes from the Gansner paper: to account for edge labels in our
+ * layout we split each rank in half by doubling minlen and halving ranksep.
+ * Then we can place labels at these mid-points between nodes.
+ *
+ * We also add some minimal padding to the width to push the label for the edge
+ * away from the edge itself a bit.
+ */
+function makeSpaceForEdgeLabels(g) {
+ var graph = g.graph();
+ graph.ranksep /= 2;
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ edge.minlen *= 2;
+ if (edge.labelpos.toLowerCase() !== "c") {
+ if (graph.rankdir === "TB" || graph.rankdir === "BT") {
+ edge.width += edge.labeloffset;
+ } else {
+ edge.height += edge.labeloffset;
}
- };
+ }
+ });
+}
- // start with one forest per node
- for (var i = 0; i < numNodes; i++) {
- forest[i] = this.spawn(nodes[i]);
+/*
+ * Creates temporary dummy nodes that capture the rank in which each edge's
+ * label is going to, if it has one of non-zero width and height. We do this
+ * so that we can safely remove empty ranks while preserving balance for the
+ * label's position.
+ */
+function injectEdgeLabelProxies(g) {
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ if (edge.width && edge.height) {
+ var v = g.node(e.v);
+ var w = g.node(e.w);
+ var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };
+ util.addDummyNode(g, "edge-proxy", label, "_ep");
}
- var S = edges.sort(function (a, b) {
- return weightFn(a) - weightFn(b);
- });
- for (var _i = 0; _i < S.length; _i++) {
- var edge = S[_i];
- var u = edge.source()[0];
- var v = edge.target()[0];
- var setUIndex = findSetIndex(u);
- var setVIndex = findSetIndex(v);
- var setU = forest[setUIndex];
- var setV = forest[setVIndex];
- if (setUIndex !== setVIndex) {
- A.merge(edge);
+ });
+}
- // combine forests for u and v
- setU.merge(setV);
- forest.splice(setVIndex, 1);
- }
+function assignRankMinMax(g) {
+ var maxRank = 0;
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ if (node.borderTop) {
+ node.minRank = g.node(node.borderTop).rank;
+ node.maxRank = g.node(node.borderBottom).rank;
+ maxRank = _.max(maxRank, node.maxRank);
}
- return A;
- }
-};
+ });
+ g.graph().maxRank = maxRank;
+}
-var aStarDefaults = defaults$g({
- root: null,
- goal: null,
- weight: function weight(edge) {
- return 1;
- },
- heuristic: function heuristic(edge) {
- return 0;
- },
- directed: false
-});
-var elesfn$s = {
- // Implemented from pseudocode from wikipedia
- aStar: function aStar(options) {
- var cy = this.cy();
- var _aStarDefaults = aStarDefaults(options),
- root = _aStarDefaults.root,
- goal = _aStarDefaults.goal,
- heuristic = _aStarDefaults.heuristic,
- directed = _aStarDefaults.directed,
- weight = _aStarDefaults.weight;
- root = cy.collection(root)[0];
- goal = cy.collection(goal)[0];
- var sid = root.id();
- var tid = goal.id();
- var gScore = {};
- var fScore = {};
- var closedSetIds = {};
- var openSet = new Heap__default["default"](function (a, b) {
- return fScore[a.id()] - fScore[b.id()];
+function removeEdgeLabelProxies(g) {
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ if (node.dummy === "edge-proxy") {
+ g.edge(node.e).labelRank = node.rank;
+ g.removeNode(v);
+ }
+ });
+}
+
+function translateGraph(g) {
+ var minX = Number.POSITIVE_INFINITY;
+ var maxX = 0;
+ var minY = Number.POSITIVE_INFINITY;
+ var maxY = 0;
+ var graphLabel = g.graph();
+ var marginX = graphLabel.marginx || 0;
+ var marginY = graphLabel.marginy || 0;
+
+ function getExtremes(attrs) {
+ var x = attrs.x;
+ var y = attrs.y;
+ var w = attrs.width;
+ var h = attrs.height;
+ minX = Math.min(minX, x - w / 2);
+ maxX = Math.max(maxX, x + w / 2);
+ minY = Math.min(minY, y - h / 2);
+ maxY = Math.max(maxY, y + h / 2);
+ }
+
+ _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ if (_.has(edge, "x")) {
+ getExtremes(edge);
+ }
+ });
+
+ minX -= marginX;
+ minY -= marginY;
+
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ node.x -= minX;
+ node.y -= minY;
+ });
+
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ _.forEach(edge.points, function(p) {
+ p.x -= minX;
+ p.y -= minY;
});
- var openSetIds = new Set$1();
- var cameFrom = {};
- var cameFromEdge = {};
- var addToOpenSet = function addToOpenSet(ele, id) {
- openSet.push(ele);
- openSetIds.add(id);
- };
- var cMin, cMinId;
- var popFromOpenSet = function popFromOpenSet() {
- cMin = openSet.pop();
- cMinId = cMin.id();
- openSetIds["delete"](cMinId);
- };
- var isInOpenSet = function isInOpenSet(id) {
- return openSetIds.has(id);
- };
- addToOpenSet(root, sid);
- gScore[sid] = 0;
- fScore[sid] = heuristic(root);
+ if (_.has(edge, "x")) { edge.x -= minX; }
+ if (_.has(edge, "y")) { edge.y -= minY; }
+ });
- // Counter
- var steps = 0;
+ graphLabel.width = maxX - minX + marginX;
+ graphLabel.height = maxY - minY + marginY;
+}
- // Main loop
- while (openSet.size() > 0) {
- popFromOpenSet();
- steps++;
+function assignNodeIntersects(g) {
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ var nodeV = g.node(e.v);
+ var nodeW = g.node(e.w);
+ var p1, p2;
+ if (!edge.points) {
+ edge.points = [];
+ p1 = nodeW;
+ p2 = nodeV;
+ } else {
+ p1 = edge.points[0];
+ p2 = edge.points[edge.points.length - 1];
+ }
+ edge.points.unshift(util.intersectRect(nodeV, p1));
+ edge.points.push(util.intersectRect(nodeW, p2));
+ });
+}
- // If we've found our goal, then we are done
- if (cMinId === tid) {
- var path = [];
- var pathNode = goal;
- var pathNodeId = tid;
- var pathEdge = cameFromEdge[pathNodeId];
- for (;;) {
- path.unshift(pathNode);
- if (pathEdge != null) {
- path.unshift(pathEdge);
- }
- pathNode = cameFrom[pathNodeId];
- if (pathNode == null) {
- break;
- }
- pathNodeId = pathNode.id();
- pathEdge = cameFromEdge[pathNodeId];
- }
- return {
- found: true,
- distance: gScore[cMinId],
- path: this.spawn(path),
- steps: steps
- };
+function fixupEdgeLabelCoords(g) {
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ if (_.has(edge, "x")) {
+ if (edge.labelpos === "l" || edge.labelpos === "r") {
+ edge.width -= edge.labeloffset;
+ }
+ switch (edge.labelpos) {
+ case "l": edge.x -= edge.width / 2 + edge.labeloffset; break;
+ case "r": edge.x += edge.width / 2 + edge.labeloffset; break;
}
+ }
+ });
+}
- // Add cMin to processed nodes
- closedSetIds[cMinId] = true;
+function reversePointsForReversedEdges(g) {
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ if (edge.reversed) {
+ edge.points.reverse();
+ }
+ });
+}
- // Update scores for neighbors of cMin
- // Take into account if graph is directed or not
- var vwEdges = cMin._private.edges;
- for (var i = 0; i < vwEdges.length; i++) {
- var e = vwEdges[i];
+function removeBorderNodes(g) {
+ _.forEach(g.nodes(), function(v) {
+ if (g.children(v).length) {
+ var node = g.node(v);
+ var t = g.node(node.borderTop);
+ var b = g.node(node.borderBottom);
+ var l = g.node(_.last(node.borderLeft));
+ var r = g.node(_.last(node.borderRight));
- // edge must be in set of calling eles
- if (!this.hasElementWithId(e.id())) {
- continue;
- }
+ node.width = Math.abs(r.x - l.x);
+ node.height = Math.abs(b.y - t.y);
+ node.x = l.x + node.width / 2;
+ node.y = t.y + node.height / 2;
+ }
+ });
- // cMin must be the source of edge if directed
- if (directed && e.data('source') !== cMinId) {
- continue;
- }
- var wSrc = e.source();
- var wTgt = e.target();
- var w = wSrc.id() !== cMinId ? wSrc : wTgt;
- var wid = w.id();
+ _.forEach(g.nodes(), function(v) {
+ if (g.node(v).dummy === "border") {
+ g.removeNode(v);
+ }
+ });
+}
- // node must be in set of calling eles
- if (!this.hasElementWithId(wid)) {
- continue;
- }
+function removeSelfEdges(g) {
+ _.forEach(g.edges(), function(e) {
+ if (e.v === e.w) {
+ var node = g.node(e.v);
+ if (!node.selfEdges) {
+ node.selfEdges = [];
+ }
+ node.selfEdges.push({ e: e, label: g.edge(e) });
+ g.removeEdge(e);
+ }
+ });
+}
- // if node is in closedSet, ignore it
- if (closedSetIds[wid]) {
- continue;
- }
+function insertSelfEdges(g) {
+ var layers = util.buildLayerMatrix(g);
+ _.forEach(layers, function(layer) {
+ var orderShift = 0;
+ _.forEach(layer, function(v, i) {
+ var node = g.node(v);
+ node.order = i + orderShift;
+ _.forEach(node.selfEdges, function(selfEdge) {
+ util.addDummyNode(g, "selfedge", {
+ width: selfEdge.label.width,
+ height: selfEdge.label.height,
+ rank: node.rank,
+ order: i + (++orderShift),
+ e: selfEdge.e,
+ label: selfEdge.label
+ }, "_se");
+ });
+ delete node.selfEdges;
+ });
+ });
+}
- // New tentative score for node w
- var tempScore = gScore[cMinId] + weight(e);
+function positionSelfEdges(g) {
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ if (node.dummy === "selfedge") {
+ var selfNode = g.node(node.e.v);
+ var x = selfNode.x + selfNode.width / 2;
+ var y = selfNode.y;
+ var dx = node.x - x;
+ var dy = selfNode.height / 2;
+ g.setEdge(node.e, node.label);
+ g.removeNode(v);
+ node.label.points = [
+ { x: x + 2 * dx / 3, y: y - dy },
+ { x: x + 5 * dx / 6, y: y - dy },
+ { x: x + dx , y: y },
+ { x: x + 5 * dx / 6, y: y + dy },
+ { x: x + 2 * dx / 3, y: y + dy }
+ ];
+ node.label.x = node.x;
+ node.label.y = node.y;
+ }
+ });
+}
- // Update gScore for node w if:
- // w not present in openSet
- // OR
- // tentative gScore is less than previous value
+function selectNumberAttrs(obj, attrs) {
+ return _.mapValues(_.pick(obj, attrs), Number);
+}
- // w not in openSet
- if (!isInOpenSet(wid)) {
- gScore[wid] = tempScore;
- fScore[wid] = tempScore + heuristic(w);
- addToOpenSet(w, wid);
- cameFrom[wid] = cMin;
- cameFromEdge[wid] = e;
- continue;
- }
+function canonicalize(attrs) {
+ var newAttrs = {};
+ _.forEach(attrs, function(v, k) {
+ newAttrs[k.toLowerCase()] = v;
+ });
+ return newAttrs;
+}
- // w already in openSet, but with greater gScore
- if (tempScore < gScore[wid]) {
- gScore[wid] = tempScore;
- fScore[wid] = tempScore + heuristic(w);
- cameFrom[wid] = cMin;
- cameFromEdge[wid] = e;
- }
- } // End of neighbors update
- } // End of main loop
- // If we've reached here, then we've not reached our goal
- return {
- found: false,
- distance: undefined,
- path: undefined,
- steps: steps
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/lodash.js":
+/*!******************************************!*\
+ !*** ./node_modules/dagre/lib/lodash.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+/* global window */
+
+var lodash;
+
+if (true) {
+ try {
+ lodash = {
+ cloneDeep: __webpack_require__(/*! lodash/cloneDeep */ "./node_modules/lodash/cloneDeep.js"),
+ constant: __webpack_require__(/*! lodash/constant */ "./node_modules/lodash/constant.js"),
+ defaults: __webpack_require__(/*! lodash/defaults */ "./node_modules/lodash/defaults.js"),
+ each: __webpack_require__(/*! lodash/each */ "./node_modules/lodash/each.js"),
+ filter: __webpack_require__(/*! lodash/filter */ "./node_modules/lodash/filter.js"),
+ find: __webpack_require__(/*! lodash/find */ "./node_modules/lodash/find.js"),
+ flatten: __webpack_require__(/*! lodash/flatten */ "./node_modules/lodash/flatten.js"),
+ forEach: __webpack_require__(/*! lodash/forEach */ "./node_modules/lodash/forEach.js"),
+ forIn: __webpack_require__(/*! lodash/forIn */ "./node_modules/lodash/forIn.js"),
+ has: __webpack_require__(/*! lodash/has */ "./node_modules/lodash/has.js"),
+ isUndefined: __webpack_require__(/*! lodash/isUndefined */ "./node_modules/lodash/isUndefined.js"),
+ last: __webpack_require__(/*! lodash/last */ "./node_modules/lodash/last.js"),
+ map: __webpack_require__(/*! lodash/map */ "./node_modules/lodash/map.js"),
+ mapValues: __webpack_require__(/*! lodash/mapValues */ "./node_modules/lodash/mapValues.js"),
+ max: __webpack_require__(/*! lodash/max */ "./node_modules/lodash/max.js"),
+ merge: __webpack_require__(/*! lodash/merge */ "./node_modules/lodash/merge.js"),
+ min: __webpack_require__(/*! lodash/min */ "./node_modules/lodash/min.js"),
+ minBy: __webpack_require__(/*! lodash/minBy */ "./node_modules/lodash/minBy.js"),
+ now: __webpack_require__(/*! lodash/now */ "./node_modules/lodash/now.js"),
+ pick: __webpack_require__(/*! lodash/pick */ "./node_modules/lodash/pick.js"),
+ range: __webpack_require__(/*! lodash/range */ "./node_modules/lodash/range.js"),
+ reduce: __webpack_require__(/*! lodash/reduce */ "./node_modules/lodash/reduce.js"),
+ sortBy: __webpack_require__(/*! lodash/sortBy */ "./node_modules/lodash/sortBy.js"),
+ uniqueId: __webpack_require__(/*! lodash/uniqueId */ "./node_modules/lodash/uniqueId.js"),
+ values: __webpack_require__(/*! lodash/values */ "./node_modules/lodash/values.js"),
+ zipObject: __webpack_require__(/*! lodash/zipObject */ "./node_modules/lodash/zipObject.js"),
};
+ } catch (e) {
+ // continue regardless of error
}
-}; // elesfn
+}
-var floydWarshallDefaults = defaults$g({
- weight: function weight(edge) {
- return 1;
- },
- directed: false
-});
-var elesfn$r = {
- // Implemented from pseudocode from wikipedia
- floydWarshall: function floydWarshall(options) {
- var cy = this.cy();
- var _floydWarshallDefault = floydWarshallDefaults(options),
- weight = _floydWarshallDefault.weight,
- directed = _floydWarshallDefault.directed;
- var weightFn = weight;
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
- var N = nodes.length;
- var Nsq = N * N;
- var indexOf = function indexOf(node) {
- return nodes.indexOf(node);
- };
- var atIndex = function atIndex(i) {
- return nodes[i];
- };
+if (!lodash) {
+ lodash = window._;
+}
- // Initialize distance matrix
- var dist = new Array(Nsq);
- for (var n = 0; n < Nsq; n++) {
- var j = n % N;
- var i = (n - j) / N;
- if (i === j) {
- dist[n] = 0;
- } else {
- dist[n] = Infinity;
- }
- }
+module.exports = lodash;
- // Initialize matrix used for path reconstruction
- // Initialize distance matrix
- var next = new Array(Nsq);
- var edgeNext = new Array(Nsq);
- // Process edges
- for (var _i = 0; _i < edges.length; _i++) {
- var edge = edges[_i];
- var src = edge.source()[0];
- var tgt = edge.target()[0];
- if (src === tgt) {
- continue;
- } // exclude loops
+/***/ }),
- var s = indexOf(src);
- var t = indexOf(tgt);
- var st = s * N + t; // source to target index
- var _weight = weightFn(edge);
+/***/ "./node_modules/dagre/lib/nesting-graph.js":
+/*!*************************************************!*\
+ !*** ./node_modules/dagre/lib/nesting-graph.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Check if already process another edge between same 2 nodes
- if (dist[st] > _weight) {
- dist[st] = _weight;
- next[st] = t;
- edgeNext[st] = edge;
- }
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
- // If undirected graph, process 'reversed' edge
- if (!directed) {
- var ts = t * N + s; // target to source index
+module.exports = {
+ run: run,
+ cleanup: cleanup
+};
- if (!directed && dist[ts] > _weight) {
- dist[ts] = _weight;
- next[ts] = s;
- edgeNext[ts] = edge;
- }
- }
- }
+/*
+ * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
+ * adds appropriate edges to ensure that all cluster nodes are placed between
+ * these boundries, and ensures that the graph is connected.
+ *
+ * In addition we ensure, through the use of the minlen property, that nodes
+ * and subgraph border nodes to not end up on the same rank.
+ *
+ * Preconditions:
+ *
+ * 1. Input graph is a DAG
+ * 2. Nodes in the input graph has a minlen attribute
+ *
+ * Postconditions:
+ *
+ * 1. Input graph is connected.
+ * 2. Dummy nodes are added for the tops and bottoms of subgraphs.
+ * 3. The minlen attribute for nodes is adjusted to ensure nodes do not
+ * get placed on the same rank as subgraph border nodes.
+ *
+ * The nesting graph idea comes from Sander, "Layout of Compound Directed
+ * Graphs."
+ */
+function run(g) {
+ var root = util.addDummyNode(g, "root", {}, "_root");
+ var depths = treeDepths(g);
+ var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array
+ var nodeSep = 2 * height + 1;
- // Main loop
- for (var k = 0; k < N; k++) {
- for (var _i2 = 0; _i2 < N; _i2++) {
- var ik = _i2 * N + k;
- for (var _j = 0; _j < N; _j++) {
- var ij = _i2 * N + _j;
- var kj = k * N + _j;
- if (dist[ik] + dist[kj] < dist[ij]) {
- dist[ij] = dist[ik] + dist[kj];
- next[ij] = next[ik];
- }
- }
- }
+ g.graph().nestingRoot = root;
+
+ // Multiply minlen by nodeSep to align nodes on non-border ranks.
+ _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });
+
+ // Calculate a weight that is sufficient to keep subgraphs vertically compact
+ var weight = sumWeights(g) + 1;
+
+ // Create border nodes and link them up
+ _.forEach(g.children(), function(child) {
+ dfs(g, root, nodeSep, weight, height, depths, child);
+ });
+
+ // Save the multiplier for node layers for later removal of empty border
+ // layers.
+ g.graph().nodeRankFactor = nodeSep;
+}
+
+function dfs(g, root, nodeSep, weight, height, depths, v) {
+ var children = g.children(v);
+ if (!children.length) {
+ if (v !== root) {
+ g.setEdge(root, v, { weight: 0, minlen: nodeSep });
}
- var getArgEle = function getArgEle(ele) {
- return (string(ele) ? cy.filter(ele) : ele)[0];
- };
- var indexOfArgEle = function indexOfArgEle(ele) {
- return indexOf(getArgEle(ele));
- };
- var res = {
- distance: function distance(from, to) {
- var i = indexOfArgEle(from);
- var j = indexOfArgEle(to);
- return dist[i * N + j];
- },
- path: function path(from, to) {
- var i = indexOfArgEle(from);
- var j = indexOfArgEle(to);
- var fromNode = atIndex(i);
- if (i === j) {
- return fromNode.collection();
- }
- if (next[i * N + j] == null) {
- return cy.collection();
- }
- var path = cy.collection();
- var prev = i;
- var edge;
- path.merge(fromNode);
- while (i !== j) {
- prev = i;
- i = next[i * N + j];
- edge = edgeNext[prev * N + i];
- path.merge(edge);
- path.merge(atIndex(i));
- }
- return path;
- }
- };
- return res;
- } // floydWarshall
-}; // elesfn
+ return;
+ }
-var bellmanFordDefaults = defaults$g({
- weight: function weight(edge) {
- return 1;
- },
- directed: false,
- root: null
-});
-var elesfn$q = {
- // Implemented from pseudocode from wikipedia
- bellmanFord: function bellmanFord(options) {
- var _this = this;
- var _bellmanFordDefaults = bellmanFordDefaults(options),
- weight = _bellmanFordDefaults.weight,
- directed = _bellmanFordDefaults.directed,
- root = _bellmanFordDefaults.root;
- var weightFn = weight;
- var eles = this;
- var cy = this.cy();
- var _this$byGroup = this.byGroup(),
- edges = _this$byGroup.edges,
- nodes = _this$byGroup.nodes;
- var numNodes = nodes.length;
- var infoMap = new Map$1();
- var hasNegativeWeightCycle = false;
- var negativeWeightCycles = [];
- root = cy.collection(root)[0]; // in case selector passed
+ var top = util.addBorderNode(g, "_bt");
+ var bottom = util.addBorderNode(g, "_bb");
+ var label = g.node(v);
- edges.unmergeBy(function (edge) {
- return edge.isLoop();
- });
- var numEdges = edges.length;
- var getInfo = function getInfo(node) {
- var obj = infoMap.get(node.id());
- if (!obj) {
- obj = {};
- infoMap.set(node.id(), obj);
- }
- return obj;
- };
- var getNodeFromTo = function getNodeFromTo(to) {
- return (string(to) ? cy.$(to) : to)[0];
- };
- var distanceTo = function distanceTo(to) {
- return getInfo(getNodeFromTo(to)).dist;
- };
- var pathTo = function pathTo(to) {
- var thisStart = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : root;
- var end = getNodeFromTo(to);
- var path = [];
- var node = end;
- for (;;) {
- if (node == null) {
- return _this.spawn();
- }
- var _getInfo = getInfo(node),
- edge = _getInfo.edge,
- pred = _getInfo.pred;
- path.unshift(node[0]);
- if (node.same(thisStart) && path.length > 0) {
- break;
- }
- if (edge != null) {
- path.unshift(edge);
- }
- node = pred;
- }
- return eles.spawn(path);
- };
+ g.setParent(top, v);
+ label.borderTop = top;
+ g.setParent(bottom, v);
+ label.borderBottom = bottom;
- // Initializations { dist, pred, edge }
- for (var i = 0; i < numNodes; i++) {
- var node = nodes[i];
- var info = getInfo(node);
- if (node.same(root)) {
- info.dist = 0;
- } else {
- info.dist = Infinity;
- }
- info.pred = null;
- info.edge = null;
- }
+ _.forEach(children, function(child) {
+ dfs(g, root, nodeSep, weight, height, depths, child);
- // Edges relaxation
- var replacedEdge = false;
- var checkForEdgeReplacement = function checkForEdgeReplacement(node1, node2, edge, info1, info2, weight) {
- var dist = info1.dist + weight;
- if (dist < info2.dist && !edge.same(info1.edge)) {
- info2.dist = dist;
- info2.pred = node1;
- info2.edge = edge;
- replacedEdge = true;
- }
- };
- for (var _i = 1; _i < numNodes; _i++) {
- replacedEdge = false;
- for (var e = 0; e < numEdges; e++) {
- var edge = edges[e];
- var src = edge.source();
- var tgt = edge.target();
- var _weight = weightFn(edge);
- var srcInfo = getInfo(src);
- var tgtInfo = getInfo(tgt);
- checkForEdgeReplacement(src, tgt, edge, srcInfo, tgtInfo, _weight);
+ var childNode = g.node(child);
+ var childTop = childNode.borderTop ? childNode.borderTop : child;
+ var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
+ var thisWeight = childNode.borderTop ? weight : 2 * weight;
+ var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
- // If undirected graph, we need to take into account the 'reverse' edge
- if (!directed) {
- checkForEdgeReplacement(tgt, src, edge, tgtInfo, srcInfo, _weight);
- }
- }
- if (!replacedEdge) {
- break;
- }
- }
- if (replacedEdge) {
- // Check for negative weight cycles
- var negativeWeightCycleIds = [];
- for (var _e = 0; _e < numEdges; _e++) {
- var _edge = edges[_e];
- var _src = _edge.source();
- var _tgt = _edge.target();
- var _weight2 = weightFn(_edge);
- var srcDist = getInfo(_src).dist;
- var tgtDist = getInfo(_tgt).dist;
- if (srcDist + _weight2 < tgtDist || !directed && tgtDist + _weight2 < srcDist) {
- if (!hasNegativeWeightCycle) {
- warn('Graph contains a negative weight cycle for Bellman-Ford');
- hasNegativeWeightCycle = true;
- }
- if (options.findNegativeWeightCycles !== false) {
- var negativeNodes = [];
- if (srcDist + _weight2 < tgtDist) {
- negativeNodes.push(_src);
- }
- if (!directed && tgtDist + _weight2 < srcDist) {
- negativeNodes.push(_tgt);
- }
- var numNegativeNodes = negativeNodes.length;
- for (var n = 0; n < numNegativeNodes; n++) {
- var start = negativeNodes[n];
- var cycle = [start];
- cycle.push(getInfo(start).edge);
- var _node = getInfo(start).pred;
- while (cycle.indexOf(_node) === -1) {
- cycle.push(_node);
- cycle.push(getInfo(_node).edge);
- _node = getInfo(_node).pred;
- }
- cycle = cycle.slice(cycle.indexOf(_node));
- var smallestId = cycle[0].id();
- var smallestIndex = 0;
- for (var c = 2; c < cycle.length; c += 2) {
- if (cycle[c].id() < smallestId) {
- smallestId = cycle[c].id();
- smallestIndex = c;
- }
- }
- cycle = cycle.slice(smallestIndex).concat(cycle.slice(0, smallestIndex));
- cycle.push(cycle[0]);
- var cycleId = cycle.map(function (el) {
- return el.id();
- }).join(",");
- if (negativeWeightCycleIds.indexOf(cycleId) === -1) {
- negativeWeightCycles.push(eles.spawn(cycle));
- negativeWeightCycleIds.push(cycleId);
- }
- }
- } else {
- break;
- }
- }
- }
- }
- return {
- distanceTo: distanceTo,
- pathTo: pathTo,
- hasNegativeWeightCycle: hasNegativeWeightCycle,
- negativeWeightCycles: negativeWeightCycles
- };
- } // bellmanFord
-}; // elesfn
+ g.setEdge(top, childTop, {
+ weight: thisWeight,
+ minlen: minlen,
+ nestingEdge: true
+ });
-var sqrt2 = Math.sqrt(2);
+ g.setEdge(childBottom, bottom, {
+ weight: thisWeight,
+ minlen: minlen,
+ nestingEdge: true
+ });
+ });
-// Function which colapses 2 (meta) nodes into one
-// Updates the remaining edge lists
-// Receives as a paramater the edge which causes the collapse
-var collapse = function collapse(edgeIndex, nodeMap, remainingEdges) {
- if (remainingEdges.length === 0) {
- error("Karger-Stein must be run on a connected (sub)graph");
+ if (!g.parent(v)) {
+ g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
}
- var edgeInfo = remainingEdges[edgeIndex];
- var sourceIn = edgeInfo[1];
- var targetIn = edgeInfo[2];
- var partition1 = nodeMap[sourceIn];
- var partition2 = nodeMap[targetIn];
- var newEdges = remainingEdges; // re-use array
+}
- // Delete all edges between partition1 and partition2
- for (var i = newEdges.length - 1; i >= 0; i--) {
- var edge = newEdges[i];
- var src = edge[1];
- var tgt = edge[2];
- if (nodeMap[src] === partition1 && nodeMap[tgt] === partition2 || nodeMap[src] === partition2 && nodeMap[tgt] === partition1) {
- newEdges.splice(i, 1);
+function treeDepths(g) {
+ var depths = {};
+ function dfs(v, depth) {
+ var children = g.children(v);
+ if (children && children.length) {
+ _.forEach(children, function(child) {
+ dfs(child, depth + 1);
+ });
}
+ depths[v] = depth;
}
+ _.forEach(g.children(), function(v) { dfs(v, 1); });
+ return depths;
+}
- // All edges pointing to partition2 should now point to partition1
- for (var _i = 0; _i < newEdges.length; _i++) {
- var _edge = newEdges[_i];
- if (_edge[1] === partition2) {
- // Check source
- newEdges[_i] = _edge.slice(); // copy
- newEdges[_i][1] = partition1;
- } else if (_edge[2] === partition2) {
- // Check target
- newEdges[_i] = _edge.slice(); // copy
- newEdges[_i][2] = partition1;
- }
- }
+function sumWeights(g) {
+ return _.reduce(g.edges(), function(acc, e) {
+ return acc + g.edge(e).weight;
+ }, 0);
+}
- // Move all nodes from partition2 to partition1
- for (var _i2 = 0; _i2 < nodeMap.length; _i2++) {
- if (nodeMap[_i2] === partition2) {
- nodeMap[_i2] = partition1;
+function cleanup(g) {
+ var graphLabel = g.graph();
+ g.removeNode(graphLabel.nestingRoot);
+ delete graphLabel.nestingRoot;
+ _.forEach(g.edges(), function(e) {
+ var edge = g.edge(e);
+ if (edge.nestingEdge) {
+ g.removeEdge(e);
}
- }
- return newEdges;
-};
+ });
+}
-// Contracts a graph until we reach a certain number of meta nodes
-var contractUntil = function contractUntil(metaNodeMap, remainingEdges, size, sizeLimit) {
- while (size > sizeLimit) {
- // Choose an edge randomly
- var edgeIndex = Math.floor(Math.random() * remainingEdges.length);
- // Collapse graph based on edge
- remainingEdges = collapse(edgeIndex, metaNodeMap, remainingEdges);
- size--;
- }
- return remainingEdges;
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/normalize.js":
+/*!*********************************************!*\
+ !*** ./node_modules/dagre/lib/normalize.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+"use strict";
+
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
+
+module.exports = {
+ run: run,
+ undo: undo
};
-var elesfn$p = {
- // Computes the minimum cut of an undirected graph
- // Returns the correct answer with high probability
- kargerStein: function kargerStein() {
- var _this = this;
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
- edges.unmergeBy(function (edge) {
- return edge.isLoop();
- });
- var numNodes = nodes.length;
- var numEdges = edges.length;
- var numIter = Math.ceil(Math.pow(Math.log(numNodes) / Math.LN2, 2));
- var stopSize = Math.floor(numNodes / sqrt2);
- if (numNodes < 2) {
- error('At least 2 nodes are required for Karger-Stein algorithm');
- return undefined;
- }
- // Now store edge destination as indexes
- // Format for each edge (edge index, source node index, target node index)
- var edgeIndexes = [];
- for (var i = 0; i < numEdges; i++) {
- var e = edges[i];
- edgeIndexes.push([i, nodes.indexOf(e.source()), nodes.indexOf(e.target())]);
- }
+/*
+ * Breaks any long edges in the graph into short segments that span 1 layer
+ * each. This operation is undoable with the denormalize function.
+ *
+ * Pre-conditions:
+ *
+ * 1. The input graph is a DAG.
+ * 2. Each node in the graph has a "rank" property.
+ *
+ * Post-condition:
+ *
+ * 1. All edges in the graph have a length of 1.
+ * 2. Dummy nodes are added where edges have been split into segments.
+ * 3. The graph is augmented with a "dummyChains" attribute which contains
+ * the first dummy in each chain of dummy nodes produced.
+ */
+function run(g) {
+ g.graph().dummyChains = [];
+ _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });
+}
- // We will store the best cut found here
- var minCutSize = Infinity;
- var minCutEdgeIndexes = [];
- var minCutNodeMap = new Array(numNodes);
+function normalizeEdge(g, e) {
+ var v = e.v;
+ var vRank = g.node(v).rank;
+ var w = e.w;
+ var wRank = g.node(w).rank;
+ var name = e.name;
+ var edgeLabel = g.edge(e);
+ var labelRank = edgeLabel.labelRank;
- // Initial meta node partition
- var metaNodeMap = new Array(numNodes);
- var metaNodeMap2 = new Array(numNodes);
- var copyNodesMap = function copyNodesMap(from, to) {
- for (var _i3 = 0; _i3 < numNodes; _i3++) {
- to[_i3] = from[_i3];
- }
+ if (wRank === vRank + 1) return;
+
+ g.removeEdge(e);
+
+ var dummy, attrs, i;
+ for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
+ edgeLabel.points = [];
+ attrs = {
+ width: 0, height: 0,
+ edgeLabel: edgeLabel, edgeObj: e,
+ rank: vRank
};
+ dummy = util.addDummyNode(g, "edge", attrs, "_d");
+ if (vRank === labelRank) {
+ attrs.width = edgeLabel.width;
+ attrs.height = edgeLabel.height;
+ attrs.dummy = "edge-label";
+ attrs.labelpos = edgeLabel.labelpos;
+ }
+ g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
+ if (i === 0) {
+ g.graph().dummyChains.push(dummy);
+ }
+ v = dummy;
+ }
- // Main loop
- for (var iter = 0; iter <= numIter; iter++) {
- // Reset meta node partition
- for (var _i4 = 0; _i4 < numNodes; _i4++) {
- metaNodeMap[_i4] = _i4;
+ g.setEdge(v, w, { weight: edgeLabel.weight }, name);
+}
+
+function undo(g) {
+ _.forEach(g.graph().dummyChains, function(v) {
+ var node = g.node(v);
+ var origLabel = node.edgeLabel;
+ var w;
+ g.setEdge(node.edgeObj, origLabel);
+ while (node.dummy) {
+ w = g.successors(v)[0];
+ g.removeNode(v);
+ origLabel.points.push({ x: node.x, y: node.y });
+ if (node.dummy === "edge-label") {
+ origLabel.x = node.x;
+ origLabel.y = node.y;
+ origLabel.width = node.width;
+ origLabel.height = node.height;
}
+ v = w;
+ node = g.node(v);
+ }
+ });
+}
- // Contract until stop point (stopSize nodes)
- var edgesState = contractUntil(metaNodeMap, edgeIndexes.slice(), numNodes, stopSize);
- var edgesState2 = edgesState.slice(); // copy
- // Create a copy of the colapsed nodes state
- copyNodesMap(metaNodeMap, metaNodeMap2);
+/***/ }),
- // Run 2 iterations starting in the stop state
- var res1 = contractUntil(metaNodeMap, edgesState, stopSize, 2);
- var res2 = contractUntil(metaNodeMap2, edgesState2, stopSize, 2);
+/***/ "./node_modules/dagre/lib/order/add-subgraph-constraints.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/dagre/lib/order/add-subgraph-constraints.js ***!
+ \******************************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Is any of the 2 results the best cut so far?
- if (res1.length <= res2.length && res1.length < minCutSize) {
- minCutSize = res1.length;
- minCutEdgeIndexes = res1;
- copyNodesMap(metaNodeMap, minCutNodeMap);
- } else if (res2.length <= res1.length && res2.length < minCutSize) {
- minCutSize = res2.length;
- minCutEdgeIndexes = res2;
- copyNodesMap(metaNodeMap2, minCutNodeMap);
- }
- } // end of main loop
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
- // Construct result
- var cut = this.spawn(minCutEdgeIndexes.map(function (e) {
- return edges[e[0]];
- }));
- var partition1 = this.spawn();
- var partition2 = this.spawn();
+module.exports = addSubgraphConstraints;
- // traverse metaNodeMap for best cut
- var witnessNodePartition = minCutNodeMap[0];
- for (var _i5 = 0; _i5 < minCutNodeMap.length; _i5++) {
- var partitionId = minCutNodeMap[_i5];
- var node = nodes[_i5];
- if (partitionId === witnessNodePartition) {
- partition1.merge(node);
+function addSubgraphConstraints(g, cg, vs) {
+ var prev = {},
+ rootPrev;
+
+ _.forEach(vs, function(v) {
+ var child = g.parent(v),
+ parent,
+ prevChild;
+ while (child) {
+ parent = g.parent(child);
+ if (parent) {
+ prevChild = prev[parent];
+ prev[parent] = child;
} else {
- partition2.merge(node);
+ prevChild = rootPrev;
+ rootPrev = child;
+ }
+ if (prevChild && prevChild !== child) {
+ cg.setEdge(prevChild, child);
+ return;
}
+ child = parent;
}
+ });
- // construct components corresponding to each disjoint subset of nodes
- var constructComponent = function constructComponent(subset) {
- var component = _this.spawn();
- subset.forEach(function (node) {
- component.merge(node);
- node.connectedEdges().forEach(function (edge) {
- // ensure edge is within calling collection and edge is not in cut
- if (_this.contains(edge) && !cut.contains(edge)) {
- component.merge(edge);
- }
- });
+ /*
+ function dfs(v) {
+ var children = v ? g.children(v) : g.children();
+ if (children.length) {
+ var min = Number.POSITIVE_INFINITY,
+ subgraphs = [];
+ _.each(children, function(child) {
+ var childMin = dfs(child);
+ if (g.children(child).length) {
+ subgraphs.push({ v: child, order: childMin });
+ }
+ min = Math.min(min, childMin);
});
- return component;
- };
- var components = [constructComponent(partition1), constructComponent(partition2)];
- var ret = {
- cut: cut,
- components: components,
- // n.b. partitions are included to be compatible with the old api spec
- // (could be removed in a future major version)
- partition1: partition1,
- partition2: partition2
- };
- return ret;
- }
-}; // elesfn
-
-var copyPosition = function copyPosition(p) {
- return {
- x: p.x,
- y: p.y
- };
-};
-var modelToRenderedPosition = function modelToRenderedPosition(p, zoom, pan) {
- return {
- x: p.x * zoom + pan.x,
- y: p.y * zoom + pan.y
- };
-};
-var renderedToModelPosition = function renderedToModelPosition(p, zoom, pan) {
- return {
- x: (p.x - pan.x) / zoom,
- y: (p.y - pan.y) / zoom
- };
-};
-var array2point = function array2point(arr) {
- return {
- x: arr[0],
- y: arr[1]
- };
-};
-var min = function min(arr) {
- var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
- var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
- var min = Infinity;
- for (var i = begin; i < end; i++) {
- var val = arr[i];
- if (isFinite(val)) {
- min = Math.min(val, min);
- }
- }
- return min;
-};
-var max = function max(arr) {
- var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
- var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
- var max = -Infinity;
- for (var i = begin; i < end; i++) {
- var val = arr[i];
- if (isFinite(val)) {
- max = Math.max(val, max);
- }
- }
- return max;
-};
-var mean = function mean(arr) {
- var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
- var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
- var total = 0;
- var n = 0;
- for (var i = begin; i < end; i++) {
- var val = arr[i];
- if (isFinite(val)) {
- total += val;
- n++;
- }
- }
- return total / n;
-};
-var median = function median(arr) {
- var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
- var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
- var copy = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
- var sort = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
- var includeHoles = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : true;
- if (copy) {
- arr = arr.slice(begin, end);
- } else {
- if (end < arr.length) {
- arr.splice(end, arr.length - end);
- }
- if (begin > 0) {
- arr.splice(0, begin);
+ _.reduce(_.sortBy(subgraphs, "order"), function(prev, curr) {
+ cg.setEdge(prev.v, curr.v);
+ return curr;
+ });
+ return min;
}
+ return g.node(v).order;
}
+ dfs(undefined);
+ */
+}
- // all non finite (e.g. Infinity, NaN) elements must be -Infinity so they go to the start
- var off = 0; // offset from non-finite values
- for (var i = arr.length - 1; i >= 0; i--) {
- var v = arr[i];
- if (includeHoles) {
- if (!isFinite(v)) {
- arr[i] = -Infinity;
- off++;
- }
- } else {
- // just remove it if we don't want to consider holes
- arr.splice(i, 1);
- }
- }
- if (sort) {
- arr.sort(function (a, b) {
- return a - b;
- }); // requires copy = true if you don't want to change the orig
- }
- var len = arr.length;
- var mid = Math.floor(len / 2);
- if (len % 2 !== 0) {
- return arr[mid + 1 + off];
- } else {
- return (arr[mid - 1 + off] + arr[mid + off]) / 2;
- }
-};
-var deg2rad = function deg2rad(deg) {
- return Math.PI * deg / 180;
-};
-var getAngleFromDisp = function getAngleFromDisp(dispX, dispY) {
- return Math.atan2(dispY, dispX) - Math.PI / 2;
-};
-var log2 = Math.log2 || function (n) {
- return Math.log(n) / Math.log(2);
-};
-var signum = function signum(x) {
- if (x > 0) {
- return 1;
- } else if (x < 0) {
- return -1;
- } else {
- return 0;
- }
-};
-var dist = function dist(p1, p2) {
- return Math.sqrt(sqdist(p1, p2));
-};
-var sqdist = function sqdist(p1, p2) {
- var dx = p2.x - p1.x;
- var dy = p2.y - p1.y;
- return dx * dx + dy * dy;
-};
-var inPlaceSumNormalize = function inPlaceSumNormalize(v) {
- var length = v.length;
+/***/ }),
- // First, get sum of all elements
- var total = 0;
- for (var i = 0; i < length; i++) {
- total += v[i];
- }
+/***/ "./node_modules/dagre/lib/order/barycenter.js":
+/*!****************************************************!*\
+ !*** ./node_modules/dagre/lib/order/barycenter.js ***!
+ \****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Now, divide each by the sum of all elements
- for (var _i = 0; _i < length; _i++) {
- v[_i] = v[_i] / total;
- }
- return v;
-};
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-// from http://en.wikipedia.org/wiki/Bézier_curve#Quadratic_curves
-var qbezierAt = function qbezierAt(p0, p1, p2, t) {
- return (1 - t) * (1 - t) * p0 + 2 * (1 - t) * t * p1 + t * t * p2;
-};
-var qbezierPtAt = function qbezierPtAt(p0, p1, p2, t) {
- return {
- x: qbezierAt(p0.x, p1.x, p2.x, t),
- y: qbezierAt(p0.y, p1.y, p2.y, t)
- };
-};
-var lineAt = function lineAt(p0, p1, t, d) {
- var vec = {
- x: p1.x - p0.x,
- y: p1.y - p0.y
- };
- var vecDist = dist(p0, p1);
- var normVec = {
- x: vec.x / vecDist,
- y: vec.y / vecDist
- };
- t = t == null ? 0 : t;
- d = d != null ? d : t * vecDist;
- return {
- x: p0.x + normVec.x * d,
- y: p0.y + normVec.y * d
- };
-};
-var bound = function bound(min, val, max) {
- return Math.max(min, Math.min(max, val));
-};
+module.exports = barycenter;
+
+function barycenter(g, movable) {
+ return _.map(movable, function(v) {
+ var inV = g.inEdges(v);
+ if (!inV.length) {
+ return { v: v };
+ } else {
+ var result = _.reduce(inV, function(acc, e) {
+ var edge = g.edge(e),
+ nodeU = g.node(e.v);
+ return {
+ sum: acc.sum + (edge.weight * nodeU.order),
+ weight: acc.weight + edge.weight
+ };
+ }, { sum: 0, weight: 0 });
-// makes a full bb (x1, y1, x2, y2, w, h) from implicit params
-var makeBoundingBox = function makeBoundingBox(bb) {
- if (bb == null) {
- return {
- x1: Infinity,
- y1: Infinity,
- x2: -Infinity,
- y2: -Infinity,
- w: 0,
- h: 0
- };
- } else if (bb.x1 != null && bb.y1 != null) {
- if (bb.x2 != null && bb.y2 != null && bb.x2 >= bb.x1 && bb.y2 >= bb.y1) {
- return {
- x1: bb.x1,
- y1: bb.y1,
- x2: bb.x2,
- y2: bb.y2,
- w: bb.x2 - bb.x1,
- h: bb.y2 - bb.y1
- };
- } else if (bb.w != null && bb.h != null && bb.w >= 0 && bb.h >= 0) {
return {
- x1: bb.x1,
- y1: bb.y1,
- x2: bb.x1 + bb.w,
- y2: bb.y1 + bb.h,
- w: bb.w,
- h: bb.h
+ v: v,
+ barycenter: result.sum / result.weight,
+ weight: result.weight
};
}
- }
-};
-var copyBoundingBox = function copyBoundingBox(bb) {
- return {
- x1: bb.x1,
- x2: bb.x2,
- w: bb.w,
- y1: bb.y1,
- y2: bb.y2,
- h: bb.h
- };
-};
-var clearBoundingBox = function clearBoundingBox(bb) {
- bb.x1 = Infinity;
- bb.y1 = Infinity;
- bb.x2 = -Infinity;
- bb.y2 = -Infinity;
- bb.w = 0;
- bb.h = 0;
-};
-var updateBoundingBox = function updateBoundingBox(bb1, bb2) {
- // update bb1 with bb2 bounds
+ });
+}
- bb1.x1 = Math.min(bb1.x1, bb2.x1);
- bb1.x2 = Math.max(bb1.x2, bb2.x2);
- bb1.w = bb1.x2 - bb1.x1;
- bb1.y1 = Math.min(bb1.y1, bb2.y1);
- bb1.y2 = Math.max(bb1.y2, bb2.y2);
- bb1.h = bb1.y2 - bb1.y1;
-};
-var expandBoundingBoxByPoint = function expandBoundingBoxByPoint(bb, x, y) {
- bb.x1 = Math.min(bb.x1, x);
- bb.x2 = Math.max(bb.x2, x);
- bb.w = bb.x2 - bb.x1;
- bb.y1 = Math.min(bb.y1, y);
- bb.y2 = Math.max(bb.y2, y);
- bb.h = bb.y2 - bb.y1;
-};
-var expandBoundingBox = function expandBoundingBox(bb) {
- var padding = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
- bb.x1 -= padding;
- bb.x2 += padding;
- bb.y1 -= padding;
- bb.y2 += padding;
- bb.w = bb.x2 - bb.x1;
- bb.h = bb.y2 - bb.y1;
- return bb;
-};
-var expandBoundingBoxSides = function expandBoundingBoxSides(bb) {
- var padding = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [0];
- var top, right, bottom, left;
- if (padding.length === 1) {
- top = right = bottom = left = padding[0];
- } else if (padding.length === 2) {
- top = bottom = padding[0];
- left = right = padding[1];
- } else if (padding.length === 4) {
- var _padding = _slicedToArray(padding, 4);
- top = _padding[0];
- right = _padding[1];
- bottom = _padding[2];
- left = _padding[3];
- }
- bb.x1 -= left;
- bb.x2 += right;
- bb.y1 -= top;
- bb.y2 += bottom;
- bb.w = bb.x2 - bb.x1;
- bb.h = bb.y2 - bb.y1;
- return bb;
-};
-// assign the values of bb2 into bb1
-var assignBoundingBox = function assignBoundingBox(bb1, bb2) {
- bb1.x1 = bb2.x1;
- bb1.y1 = bb2.y1;
- bb1.x2 = bb2.x2;
- bb1.y2 = bb2.y2;
- bb1.w = bb1.x2 - bb1.x1;
- bb1.h = bb1.y2 - bb1.y1;
-};
-var boundingBoxesIntersect = function boundingBoxesIntersect(bb1, bb2) {
- // case: one bb to right of other
- if (bb1.x1 > bb2.x2) {
- return false;
- }
- if (bb2.x1 > bb1.x2) {
- return false;
- }
- // case: one bb to left of other
- if (bb1.x2 < bb2.x1) {
- return false;
- }
- if (bb2.x2 < bb1.x1) {
- return false;
- }
+/***/ }),
- // case: one bb above other
- if (bb1.y2 < bb2.y1) {
- return false;
- }
- if (bb2.y2 < bb1.y1) {
- return false;
- }
+/***/ "./node_modules/dagre/lib/order/build-layer-graph.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/dagre/lib/order/build-layer-graph.js ***!
+ \***********************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // case: one bb below other
- if (bb1.y1 > bb2.y2) {
- return false;
- }
- if (bb2.y1 > bb1.y2) {
- return false;
- }
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
- // otherwise, must have some overlap
- return true;
-};
-var inBoundingBox = function inBoundingBox(bb, x, y) {
- return bb.x1 <= x && x <= bb.x2 && bb.y1 <= y && y <= bb.y2;
-};
-var pointInBoundingBox = function pointInBoundingBox(bb, pt) {
- return inBoundingBox(bb, pt.x, pt.y);
-};
-var boundingBoxInBoundingBox = function boundingBoxInBoundingBox(bb1, bb2) {
- return inBoundingBox(bb1, bb2.x1, bb2.y1) && inBoundingBox(bb1, bb2.x2, bb2.y2);
-};
-var roundRectangleIntersectLine = function roundRectangleIntersectLine(x, y, nodeX, nodeY, width, height, padding) {
- var cornerRadius = getRoundRectangleRadius(width, height);
- var halfWidth = width / 2;
- var halfHeight = height / 2;
+module.exports = buildLayerGraph;
- // Check intersections with straight line segments
- var straightLineIntersections;
+/*
+ * Constructs a graph that can be used to sort a layer of nodes. The graph will
+ * contain all base and subgraph nodes from the request layer in their original
+ * hierarchy and any edges that are incident on these nodes and are of the type
+ * requested by the "relationship" parameter.
+ *
+ * Nodes from the requested rank that do not have parents are assigned a root
+ * node in the output graph, which is set in the root graph attribute. This
+ * makes it easy to walk the hierarchy of movable nodes during ordering.
+ *
+ * Pre-conditions:
+ *
+ * 1. Input graph is a DAG
+ * 2. Base nodes in the input graph have a rank attribute
+ * 3. Subgraph nodes in the input graph has minRank and maxRank attributes
+ * 4. Edges have an assigned weight
+ *
+ * Post-conditions:
+ *
+ * 1. Output graph has all nodes in the movable rank with preserved
+ * hierarchy.
+ * 2. Root nodes in the movable layer are made children of the node
+ * indicated by the root attribute of the graph.
+ * 3. Non-movable nodes incident on movable nodes, selected by the
+ * relationship parameter, are included in the graph (without hierarchy).
+ * 4. Edges incident on movable nodes, selected by the relationship
+ * parameter, are added to the output graph.
+ * 5. The weights for copied edges are aggregated as need, since the output
+ * graph is not a multi-graph.
+ */
+function buildLayerGraph(g, rank, relationship) {
+ var root = createRootNode(g),
+ result = new Graph({ compound: true }).setGraph({ root: root })
+ .setDefaultNodeLabel(function(v) { return g.node(v); });
- // Top segment, left to right
- {
- var topStartX = nodeX - halfWidth + cornerRadius - padding;
- var topStartY = nodeY - halfHeight - padding;
- var topEndX = nodeX + halfWidth - cornerRadius + padding;
- var topEndY = topStartY;
- straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, topStartX, topStartY, topEndX, topEndY, false);
- if (straightLineIntersections.length > 0) {
- return straightLineIntersections;
- }
- }
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v),
+ parent = g.parent(v);
- // Right segment, top to bottom
- {
- var rightStartX = nodeX + halfWidth + padding;
- var rightStartY = nodeY - halfHeight + cornerRadius - padding;
- var rightEndX = rightStartX;
- var rightEndY = nodeY + halfHeight - cornerRadius + padding;
- straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, rightStartX, rightStartY, rightEndX, rightEndY, false);
- if (straightLineIntersections.length > 0) {
- return straightLineIntersections;
- }
- }
+ if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {
+ result.setNode(v);
+ result.setParent(v, parent || root);
- // Bottom segment, left to right
- {
- var bottomStartX = nodeX - halfWidth + cornerRadius - padding;
- var bottomStartY = nodeY + halfHeight + padding;
- var bottomEndX = nodeX + halfWidth - cornerRadius + padding;
- var bottomEndY = bottomStartY;
- straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, bottomStartX, bottomStartY, bottomEndX, bottomEndY, false);
- if (straightLineIntersections.length > 0) {
- return straightLineIntersections;
- }
- }
+ // This assumes we have only short edges!
+ _.forEach(g[relationship](v), function(e) {
+ var u = e.v === v ? e.w : e.v,
+ edge = result.edge(u, v),
+ weight = !_.isUndefined(edge) ? edge.weight : 0;
+ result.setEdge(u, v, { weight: g.edge(e).weight + weight });
+ });
- // Left segment, top to bottom
- {
- var leftStartX = nodeX - halfWidth - padding;
- var leftStartY = nodeY - halfHeight + cornerRadius - padding;
- var leftEndX = leftStartX;
- var leftEndY = nodeY + halfHeight - cornerRadius + padding;
- straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, leftStartX, leftStartY, leftEndX, leftEndY, false);
- if (straightLineIntersections.length > 0) {
- return straightLineIntersections;
+ if (_.has(node, "minRank")) {
+ result.setNode(v, {
+ borderLeft: node.borderLeft[rank],
+ borderRight: node.borderRight[rank]
+ });
+ }
}
- }
-
- // Check intersections with arc segments
- var arcIntersections;
+ });
- // Top Left
- {
- var topLeftCenterX = nodeX - halfWidth + cornerRadius;
- var topLeftCenterY = nodeY - halfHeight + cornerRadius;
- arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, topLeftCenterX, topLeftCenterY, cornerRadius + padding);
+ return result;
+}
- // Ensure the intersection is on the desired quarter of the circle
- if (arcIntersections.length > 0 && arcIntersections[0] <= topLeftCenterX && arcIntersections[1] <= topLeftCenterY) {
- return [arcIntersections[0], arcIntersections[1]];
- }
- }
+function createRootNode(g) {
+ var v;
+ while (g.hasNode((v = _.uniqueId("_root"))));
+ return v;
+}
- // Top Right
- {
- var topRightCenterX = nodeX + halfWidth - cornerRadius;
- var topRightCenterY = nodeY - halfHeight + cornerRadius;
- arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, topRightCenterX, topRightCenterY, cornerRadius + padding);
- // Ensure the intersection is on the desired quarter of the circle
- if (arcIntersections.length > 0 && arcIntersections[0] >= topRightCenterX && arcIntersections[1] <= topRightCenterY) {
- return [arcIntersections[0], arcIntersections[1]];
- }
- }
+/***/ }),
- // Bottom Right
- {
- var bottomRightCenterX = nodeX + halfWidth - cornerRadius;
- var bottomRightCenterY = nodeY + halfHeight - cornerRadius;
- arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, bottomRightCenterX, bottomRightCenterY, cornerRadius + padding);
+/***/ "./node_modules/dagre/lib/order/cross-count.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/dagre/lib/order/cross-count.js ***!
+ \*****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Ensure the intersection is on the desired quarter of the circle
- if (arcIntersections.length > 0 && arcIntersections[0] >= bottomRightCenterX && arcIntersections[1] >= bottomRightCenterY) {
- return [arcIntersections[0], arcIntersections[1]];
- }
+"use strict";
+
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+
+module.exports = crossCount;
+
+/*
+ * A function that takes a layering (an array of layers, each with an array of
+ * ordererd nodes) and a graph and returns a weighted crossing count.
+ *
+ * Pre-conditions:
+ *
+ * 1. Input graph must be simple (not a multigraph), directed, and include
+ * only simple edges.
+ * 2. Edges in the input graph must have assigned weights.
+ *
+ * Post-conditions:
+ *
+ * 1. The graph and layering matrix are left unchanged.
+ *
+ * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
+ */
+function crossCount(g, layering) {
+ var cc = 0;
+ for (var i = 1; i < layering.length; ++i) {
+ cc += twoLayerCrossCount(g, layering[i-1], layering[i]);
}
+ return cc;
+}
- // Bottom Left
- {
- var bottomLeftCenterX = nodeX - halfWidth + cornerRadius;
- var bottomLeftCenterY = nodeY + halfHeight - cornerRadius;
- arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, bottomLeftCenterX, bottomLeftCenterY, cornerRadius + padding);
+function twoLayerCrossCount(g, northLayer, southLayer) {
+ // Sort all of the edges between the north and south layers by their position
+ // in the north layer and then the south. Map these edges to the position of
+ // their head in the south layer.
+ var southPos = _.zipObject(southLayer,
+ _.map(southLayer, function (v, i) { return i; }));
+ var southEntries = _.flatten(_.map(northLayer, function(v) {
+ return _.sortBy(_.map(g.outEdges(v), function(e) {
+ return { pos: southPos[e.w], weight: g.edge(e).weight };
+ }), "pos");
+ }), true);
- // Ensure the intersection is on the desired quarter of the circle
- if (arcIntersections.length > 0 && arcIntersections[0] <= bottomLeftCenterX && arcIntersections[1] >= bottomLeftCenterY) {
- return [arcIntersections[0], arcIntersections[1]];
+ // Build the accumulator tree
+ var firstIndex = 1;
+ while (firstIndex < southLayer.length) firstIndex <<= 1;
+ var treeSize = 2 * firstIndex - 1;
+ firstIndex -= 1;
+ var tree = _.map(new Array(treeSize), function() { return 0; });
+
+ // Calculate the weighted crossings
+ var cc = 0;
+ _.forEach(southEntries.forEach(function(entry) {
+ var index = entry.pos + firstIndex;
+ tree[index] += entry.weight;
+ var weightSum = 0;
+ while (index > 0) {
+ if (index % 2) {
+ weightSum += tree[index + 1];
+ }
+ index = (index - 1) >> 1;
+ tree[index] += entry.weight;
}
- }
- return []; // if nothing
-};
+ cc += entry.weight * weightSum;
+ }));
-var inLineVicinity = function inLineVicinity(x, y, lx1, ly1, lx2, ly2, tolerance) {
- var t = tolerance;
- var x1 = Math.min(lx1, lx2);
- var x2 = Math.max(lx1, lx2);
- var y1 = Math.min(ly1, ly2);
- var y2 = Math.max(ly1, ly2);
- return x1 - t <= x && x <= x2 + t && y1 - t <= y && y <= y2 + t;
-};
-var inBezierVicinity = function inBezierVicinity(x, y, x1, y1, x2, y2, x3, y3, tolerance) {
- var bb = {
- x1: Math.min(x1, x3, x2) - tolerance,
- x2: Math.max(x1, x3, x2) + tolerance,
- y1: Math.min(y1, y3, y2) - tolerance,
- y2: Math.max(y1, y3, y2) + tolerance
- };
+ return cc;
+}
- // if outside the rough bounding box for the bezier, then it can't be a hit
- if (x < bb.x1 || x > bb.x2 || y < bb.y1 || y > bb.y2) {
- // console.log('bezier out of rough bb')
- return false;
- } else {
- // console.log('do more expensive check');
- return true;
- }
-};
-var solveQuadratic = function solveQuadratic(a, b, c, val) {
- c -= val;
- var r = b * b - 4 * a * c;
- if (r < 0) {
- return [];
- }
- var sqrtR = Math.sqrt(r);
- var denom = 2 * a;
- var root1 = (-b + sqrtR) / denom;
- var root2 = (-b - sqrtR) / denom;
- return [root1, root2];
-};
-var solveCubic = function solveCubic(a, b, c, d, result) {
- // Solves a cubic function, returns root in form [r1, i1, r2, i2, r3, i3], where
- // r is the real component, i is the imaginary component
- // An implementation of the Cardano method from the year 1545
- // http://en.wikipedia.org/wiki/Cubic_function#The_nature_of_the_roots
+/***/ }),
- var epsilon = 0.00001;
+/***/ "./node_modules/dagre/lib/order/index.js":
+/*!***********************************************!*\
+ !*** ./node_modules/dagre/lib/order/index.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // avoid division by zero while keeping the overall expression close in value
- if (a === 0) {
- a = epsilon;
- }
- b /= a;
- c /= a;
- d /= a;
- var discriminant, q, r, dum1, s, t, term1, r13;
- q = (3.0 * c - b * b) / 9.0;
- r = -(27.0 * d) + b * (9.0 * c - 2.0 * (b * b));
- r /= 54.0;
- discriminant = q * q * q + r * r;
- result[1] = 0;
- term1 = b / 3.0;
- if (discriminant > 0) {
- s = r + Math.sqrt(discriminant);
- s = s < 0 ? -Math.pow(-s, 1.0 / 3.0) : Math.pow(s, 1.0 / 3.0);
- t = r - Math.sqrt(discriminant);
- t = t < 0 ? -Math.pow(-t, 1.0 / 3.0) : Math.pow(t, 1.0 / 3.0);
- result[0] = -term1 + s + t;
- term1 += (s + t) / 2.0;
- result[4] = result[2] = -term1;
- term1 = Math.sqrt(3.0) * (-t + s) / 2;
- result[3] = term1;
- result[5] = -term1;
- return;
- }
- result[5] = result[3] = 0;
- if (discriminant === 0) {
- r13 = r < 0 ? -Math.pow(-r, 1.0 / 3.0) : Math.pow(r, 1.0 / 3.0);
- result[0] = -term1 + 2.0 * r13;
- result[4] = result[2] = -(r13 + term1);
- return;
- }
- q = -q;
- dum1 = q * q * q;
- dum1 = Math.acos(r / Math.sqrt(dum1));
- r13 = 2.0 * Math.sqrt(q);
- result[0] = -term1 + r13 * Math.cos(dum1 / 3.0);
- result[2] = -term1 + r13 * Math.cos((dum1 + 2.0 * Math.PI) / 3.0);
- result[4] = -term1 + r13 * Math.cos((dum1 + 4.0 * Math.PI) / 3.0);
- return;
-};
-var sqdistToQuadraticBezier = function sqdistToQuadraticBezier(x, y, x1, y1, x2, y2, x3, y3) {
- // Find minimum distance by using the minimum of the distance
- // function between the given point and the curve
+"use strict";
- // This gives the coefficients of the resulting cubic equation
- // whose roots tell us where a possible minimum is
- // (Coefficients are divided by 4)
- var a = 1.0 * x1 * x1 - 4 * x1 * x2 + 2 * x1 * x3 + 4 * x2 * x2 - 4 * x2 * x3 + x3 * x3 + y1 * y1 - 4 * y1 * y2 + 2 * y1 * y3 + 4 * y2 * y2 - 4 * y2 * y3 + y3 * y3;
- var b = 1.0 * 9 * x1 * x2 - 3 * x1 * x1 - 3 * x1 * x3 - 6 * x2 * x2 + 3 * x2 * x3 + 9 * y1 * y2 - 3 * y1 * y1 - 3 * y1 * y3 - 6 * y2 * y2 + 3 * y2 * y3;
- var c = 1.0 * 3 * x1 * x1 - 6 * x1 * x2 + x1 * x3 - x1 * x + 2 * x2 * x2 + 2 * x2 * x - x3 * x + 3 * y1 * y1 - 6 * y1 * y2 + y1 * y3 - y1 * y + 2 * y2 * y2 + 2 * y2 * y - y3 * y;
- var d = 1.0 * x1 * x2 - x1 * x1 + x1 * x - x2 * x + y1 * y2 - y1 * y1 + y1 * y - y2 * y;
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var initOrder = __webpack_require__(/*! ./init-order */ "./node_modules/dagre/lib/order/init-order.js");
+var crossCount = __webpack_require__(/*! ./cross-count */ "./node_modules/dagre/lib/order/cross-count.js");
+var sortSubgraph = __webpack_require__(/*! ./sort-subgraph */ "./node_modules/dagre/lib/order/sort-subgraph.js");
+var buildLayerGraph = __webpack_require__(/*! ./build-layer-graph */ "./node_modules/dagre/lib/order/build-layer-graph.js");
+var addSubgraphConstraints = __webpack_require__(/*! ./add-subgraph-constraints */ "./node_modules/dagre/lib/order/add-subgraph-constraints.js");
+var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
- // debug("coefficients: " + a / a + ", " + b / a + ", " + c / a + ", " + d / a);
+module.exports = order;
- var roots = [];
+/*
+ * Applies heuristics to minimize edge crossings in the graph and sets the best
+ * order solution as an order attribute on each node.
+ *
+ * Pre-conditions:
+ *
+ * 1. Graph must be DAG
+ * 2. Graph nodes must be objects with a "rank" attribute
+ * 3. Graph edges must have the "weight" attribute
+ *
+ * Post-conditions:
+ *
+ * 1. Graph nodes will have an "order" attribute based on the results of the
+ * algorithm.
+ */
+function order(g) {
+ var maxRank = util.maxRank(g),
+ downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), "inEdges"),
+ upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), "outEdges");
- // Use the cubic solving algorithm
- solveCubic(a, b, c, d, roots);
- var zeroThreshold = 0.0000001;
- var params = [];
- for (var index = 0; index < 6; index += 2) {
- if (Math.abs(roots[index + 1]) < zeroThreshold && roots[index] >= 0 && roots[index] <= 1.0) {
- params.push(roots[index]);
- }
- }
- params.push(1.0);
- params.push(0.0);
- var minDistanceSquared = -1;
- var curX, curY, distSquared;
- for (var i = 0; i < params.length; i++) {
- curX = Math.pow(1.0 - params[i], 2.0) * x1 + 2.0 * (1 - params[i]) * params[i] * x2 + params[i] * params[i] * x3;
- curY = Math.pow(1 - params[i], 2.0) * y1 + 2 * (1.0 - params[i]) * params[i] * y2 + params[i] * params[i] * y3;
- distSquared = Math.pow(curX - x, 2) + Math.pow(curY - y, 2);
- // debug('distance for param ' + params[i] + ": " + Math.sqrt(distSquared));
- if (minDistanceSquared >= 0) {
- if (distSquared < minDistanceSquared) {
- minDistanceSquared = distSquared;
- }
- } else {
- minDistanceSquared = distSquared;
- }
- }
- return minDistanceSquared;
-};
-var sqdistToFiniteLine = function sqdistToFiniteLine(x, y, x1, y1, x2, y2) {
- var offset = [x - x1, y - y1];
- var line = [x2 - x1, y2 - y1];
- var lineSq = line[0] * line[0] + line[1] * line[1];
- var hypSq = offset[0] * offset[0] + offset[1] * offset[1];
- var dotProduct = offset[0] * line[0] + offset[1] * line[1];
- var adjSq = dotProduct * dotProduct / lineSq;
- if (dotProduct < 0) {
- return hypSq;
- }
- if (adjSq > lineSq) {
- return (x - x2) * (x - x2) + (y - y2) * (y - y2);
- }
- return hypSq - adjSq;
-};
-var pointInsidePolygonPoints = function pointInsidePolygonPoints(x, y, points) {
- var x1, y1, x2, y2;
- var y3;
+ var layering = initOrder(g);
+ assignOrder(g, layering);
- // Intersect with vertical line through (x, y)
- var up = 0;
- // let down = 0;
- for (var i = 0; i < points.length / 2; i++) {
- x1 = points[i * 2];
- y1 = points[i * 2 + 1];
- if (i + 1 < points.length / 2) {
- x2 = points[(i + 1) * 2];
- y2 = points[(i + 1) * 2 + 1];
- } else {
- x2 = points[(i + 1 - points.length / 2) * 2];
- y2 = points[(i + 1 - points.length / 2) * 2 + 1];
- }
- if (x1 == x && x2 == x) ; else if (x1 >= x && x >= x2 || x1 <= x && x <= x2) {
- y3 = (x - x1) / (x2 - x1) * (y2 - y1) + y1;
- if (y3 > y) {
- up++;
- }
+ var bestCC = Number.POSITIVE_INFINITY,
+ best;
- // if( y3 < y ){
- // down++;
- // }
- } else {
- continue;
- }
- }
- if (up % 2 === 0) {
- return false;
- } else {
- return true;
- }
-};
-var pointInsidePolygon = function pointInsidePolygon(x, y, basePoints, centerX, centerY, width, height, direction, padding) {
- var transformedPoints = new Array(basePoints.length);
+ for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
+ sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);
- // Gives negative angle
- var angle;
- if (direction[0] != null) {
- angle = Math.atan(direction[1] / direction[0]);
- if (direction[0] < 0) {
- angle = angle + Math.PI / 2;
- } else {
- angle = -angle - Math.PI / 2;
+ layering = util.buildLayerMatrix(g);
+ var cc = crossCount(g, layering);
+ if (cc < bestCC) {
+ lastBest = 0;
+ best = _.cloneDeep(layering);
+ bestCC = cc;
}
- } else {
- angle = direction;
}
- var cos = Math.cos(-angle);
- var sin = Math.sin(-angle);
- // console.log("base: " + basePoints);
- for (var i = 0; i < transformedPoints.length / 2; i++) {
- transformedPoints[i * 2] = width / 2 * (basePoints[i * 2] * cos - basePoints[i * 2 + 1] * sin);
- transformedPoints[i * 2 + 1] = height / 2 * (basePoints[i * 2 + 1] * cos + basePoints[i * 2] * sin);
- transformedPoints[i * 2] += centerX;
- transformedPoints[i * 2 + 1] += centerY;
- }
- var points;
- if (padding > 0) {
- var expandedLineSet = expandPolygon(transformedPoints, -padding);
- points = joinLines(expandedLineSet);
- } else {
- points = transformedPoints;
- }
- return pointInsidePolygonPoints(x, y, points);
-};
-var pointInsideRoundPolygon = function pointInsideRoundPolygon(x, y, basePoints, centerX, centerY, width, height) {
- var cutPolygonPoints = new Array(basePoints.length);
- var halfW = width / 2;
- var halfH = height / 2;
- var cornerRadius = getRoundPolygonRadius(width, height);
- var squaredCornerRadius = cornerRadius * cornerRadius;
- for (var i = 0; i < basePoints.length / 4; i++) {
- var sourceUv = void 0,
- destUv = void 0;
- if (i === 0) {
- sourceUv = basePoints.length - 2;
- } else {
- sourceUv = i * 4 - 2;
- }
- destUv = i * 4 + 2;
- var px = centerX + halfW * basePoints[i * 4];
- var py = centerY + halfH * basePoints[i * 4 + 1];
- var cosTheta = -basePoints[sourceUv] * basePoints[destUv] - basePoints[sourceUv + 1] * basePoints[destUv + 1];
- var offset = cornerRadius / Math.tan(Math.acos(cosTheta) / 2);
- var cp0x = px - offset * basePoints[sourceUv];
- var cp0y = py - offset * basePoints[sourceUv + 1];
- var cp1x = px + offset * basePoints[destUv];
- var cp1y = py + offset * basePoints[destUv + 1];
- cutPolygonPoints[i * 4] = cp0x;
- cutPolygonPoints[i * 4 + 1] = cp0y;
- cutPolygonPoints[i * 4 + 2] = cp1x;
- cutPolygonPoints[i * 4 + 3] = cp1y;
- var orthx = basePoints[sourceUv + 1];
- var orthy = -basePoints[sourceUv];
- var cosAlpha = orthx * basePoints[destUv] + orthy * basePoints[destUv + 1];
- if (cosAlpha < 0) {
- orthx *= -1;
- orthy *= -1;
- }
- var cx = cp0x + orthx * cornerRadius;
- var cy = cp0y + orthy * cornerRadius;
- var squaredDistance = Math.pow(cx - x, 2) + Math.pow(cy - y, 2);
- if (squaredDistance <= squaredCornerRadius) {
- return true;
- }
- }
- return pointInsidePolygonPoints(x, y, cutPolygonPoints);
-};
-var joinLines = function joinLines(lineSet) {
- var vertices = new Array(lineSet.length / 2);
- var currentLineStartX, currentLineStartY, currentLineEndX, currentLineEndY;
- var nextLineStartX, nextLineStartY, nextLineEndX, nextLineEndY;
- for (var i = 0; i < lineSet.length / 4; i++) {
- currentLineStartX = lineSet[i * 4];
- currentLineStartY = lineSet[i * 4 + 1];
- currentLineEndX = lineSet[i * 4 + 2];
- currentLineEndY = lineSet[i * 4 + 3];
- if (i < lineSet.length / 4 - 1) {
- nextLineStartX = lineSet[(i + 1) * 4];
- nextLineStartY = lineSet[(i + 1) * 4 + 1];
- nextLineEndX = lineSet[(i + 1) * 4 + 2];
- nextLineEndY = lineSet[(i + 1) * 4 + 3];
- } else {
- nextLineStartX = lineSet[0];
- nextLineStartY = lineSet[1];
- nextLineEndX = lineSet[2];
- nextLineEndY = lineSet[3];
- }
- var intersection = finiteLinesIntersect(currentLineStartX, currentLineStartY, currentLineEndX, currentLineEndY, nextLineStartX, nextLineStartY, nextLineEndX, nextLineEndY, true);
- vertices[i * 2] = intersection[0];
- vertices[i * 2 + 1] = intersection[1];
- }
- return vertices;
-};
-var expandPolygon = function expandPolygon(points, pad) {
- var expandedLineSet = new Array(points.length * 2);
- var currentPointX, currentPointY, nextPointX, nextPointY;
- for (var i = 0; i < points.length / 2; i++) {
- currentPointX = points[i * 2];
- currentPointY = points[i * 2 + 1];
- if (i < points.length / 2 - 1) {
- nextPointX = points[(i + 1) * 2];
- nextPointY = points[(i + 1) * 2 + 1];
- } else {
- nextPointX = points[0];
- nextPointY = points[1];
- }
+ assignOrder(g, best);
+}
- // Current line: [currentPointX, currentPointY] to [nextPointX, nextPointY]
+function buildLayerGraphs(g, ranks, relationship) {
+ return _.map(ranks, function(rank) {
+ return buildLayerGraph(g, rank, relationship);
+ });
+}
- // Assume CCW polygon winding
+function sweepLayerGraphs(layerGraphs, biasRight) {
+ var cg = new Graph();
+ _.forEach(layerGraphs, function(lg) {
+ var root = lg.graph().root;
+ var sorted = sortSubgraph(lg, root, cg, biasRight);
+ _.forEach(sorted.vs, function(v, i) {
+ lg.node(v).order = i;
+ });
+ addSubgraphConstraints(lg, cg, sorted.vs);
+ });
+}
- var offsetX = nextPointY - currentPointY;
- var offsetY = -(nextPointX - currentPointX);
+function assignOrder(g, layering) {
+ _.forEach(layering, function(layer) {
+ _.forEach(layer, function(v, i) {
+ g.node(v).order = i;
+ });
+ });
+}
- // Normalize
- var offsetLength = Math.sqrt(offsetX * offsetX + offsetY * offsetY);
- var normalizedOffsetX = offsetX / offsetLength;
- var normalizedOffsetY = offsetY / offsetLength;
- expandedLineSet[i * 4] = currentPointX + normalizedOffsetX * pad;
- expandedLineSet[i * 4 + 1] = currentPointY + normalizedOffsetY * pad;
- expandedLineSet[i * 4 + 2] = nextPointX + normalizedOffsetX * pad;
- expandedLineSet[i * 4 + 3] = nextPointY + normalizedOffsetY * pad;
- }
- return expandedLineSet;
-};
-var intersectLineEllipse = function intersectLineEllipse(x, y, centerX, centerY, ellipseWradius, ellipseHradius) {
- var dispX = centerX - x;
- var dispY = centerY - y;
- dispX /= ellipseWradius;
- dispY /= ellipseHradius;
- var len = Math.sqrt(dispX * dispX + dispY * dispY);
- var newLength = len - 1;
- if (newLength < 0) {
- return [];
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/order/init-order.js":
+/*!****************************************************!*\
+ !*** ./node_modules/dagre/lib/order/init-order.js ***!
+ \****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+"use strict";
+
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+
+module.exports = initOrder;
+
+/*
+ * Assigns an initial order value for each node by performing a DFS search
+ * starting from nodes in the first rank. Nodes are assigned an order in their
+ * rank as they are first visited.
+ *
+ * This approach comes from Gansner, et al., "A Technique for Drawing Directed
+ * Graphs."
+ *
+ * Returns a layering matrix with an array per layer and each layer sorted by
+ * the order of its nodes.
+ */
+function initOrder(g) {
+ var visited = {};
+ var simpleNodes = _.filter(g.nodes(), function(v) {
+ return !g.children(v).length;
+ });
+ var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));
+ var layers = _.map(_.range(maxRank + 1), function() { return []; });
+
+ function dfs(v) {
+ if (_.has(visited, v)) return;
+ visited[v] = true;
+ var node = g.node(v);
+ layers[node.rank].push(v);
+ _.forEach(g.successors(v), dfs);
}
- var lenProportion = newLength / len;
- return [(centerX - x) * lenProportion + x, (centerY - y) * lenProportion + y];
-};
-var checkInEllipse = function checkInEllipse(x, y, width, height, centerX, centerY, padding) {
- x -= centerX;
- y -= centerY;
- x /= width / 2 + padding;
- y /= height / 2 + padding;
- return x * x + y * y <= 1;
-};
-// Returns intersections of increasing distance from line's start point
-var intersectLineCircle = function intersectLineCircle(x1, y1, x2, y2, centerX, centerY, radius) {
- // Calculate d, direction vector of line
- var d = [x2 - x1, y2 - y1]; // Direction vector of line
- var f = [x1 - centerX, y1 - centerY];
- var a = d[0] * d[0] + d[1] * d[1];
- var b = 2 * (f[0] * d[0] + f[1] * d[1]);
- var c = f[0] * f[0] + f[1] * f[1] - radius * radius;
- var discriminant = b * b - 4 * a * c;
- if (discriminant < 0) {
- return [];
- }
- var t1 = (-b + Math.sqrt(discriminant)) / (2 * a);
- var t2 = (-b - Math.sqrt(discriminant)) / (2 * a);
- var tMin = Math.min(t1, t2);
- var tMax = Math.max(t1, t2);
- var inRangeParams = [];
- if (tMin >= 0 && tMin <= 1) {
- inRangeParams.push(tMin);
- }
- if (tMax >= 0 && tMax <= 1) {
- inRangeParams.push(tMax);
- }
- if (inRangeParams.length === 0) {
- return [];
- }
- var nearIntersectionX = inRangeParams[0] * d[0] + x1;
- var nearIntersectionY = inRangeParams[0] * d[1] + y1;
- if (inRangeParams.length > 1) {
- if (inRangeParams[0] == inRangeParams[1]) {
- return [nearIntersectionX, nearIntersectionY];
- } else {
- var farIntersectionX = inRangeParams[1] * d[0] + x1;
- var farIntersectionY = inRangeParams[1] * d[1] + y1;
- return [nearIntersectionX, nearIntersectionY, farIntersectionX, farIntersectionY];
+ var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });
+ _.forEach(orderedVs, dfs);
+
+ return layers;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/order/resolve-conflicts.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/dagre/lib/order/resolve-conflicts.js ***!
+ \***********************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+"use strict";
+
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+
+module.exports = resolveConflicts;
+
+/*
+ * Given a list of entries of the form {v, barycenter, weight} and a
+ * constraint graph this function will resolve any conflicts between the
+ * constraint graph and the barycenters for the entries. If the barycenters for
+ * an entry would violate a constraint in the constraint graph then we coalesce
+ * the nodes in the conflict into a new node that respects the contraint and
+ * aggregates barycenter and weight information.
+ *
+ * This implementation is based on the description in Forster, "A Fast and
+ * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
+ * differs in some specific details.
+ *
+ * Pre-conditions:
+ *
+ * 1. Each entry has the form {v, barycenter, weight}, or if the node has
+ * no barycenter, then {v}.
+ *
+ * Returns:
+ *
+ * A new list of entries of the form {vs, i, barycenter, weight}. The list
+ * `vs` may either be a singleton or it may be an aggregation of nodes
+ * ordered such that they do not violate constraints from the constraint
+ * graph. The property `i` is the lowest original index of any of the
+ * elements in `vs`.
+ */
+function resolveConflicts(entries, cg) {
+ var mappedEntries = {};
+ _.forEach(entries, function(entry, i) {
+ var tmp = mappedEntries[entry.v] = {
+ indegree: 0,
+ "in": [],
+ out: [],
+ vs: [entry.v],
+ i: i
+ };
+ if (!_.isUndefined(entry.barycenter)) {
+ tmp.barycenter = entry.barycenter;
+ tmp.weight = entry.weight;
}
- } else {
- return [nearIntersectionX, nearIntersectionY];
- }
-};
-var midOfThree = function midOfThree(a, b, c) {
- if (b <= a && a <= c || c <= a && a <= b) {
- return a;
- } else if (a <= b && b <= c || c <= b && b <= a) {
- return b;
- } else {
- return c;
- }
-};
+ });
-// (x1,y1)=>(x2,y2) intersect with (x3,y3)=>(x4,y4)
-var finiteLinesIntersect = function finiteLinesIntersect(x1, y1, x2, y2, x3, y3, x4, y4, infiniteLines) {
- var dx13 = x1 - x3;
- var dx21 = x2 - x1;
- var dx43 = x4 - x3;
- var dy13 = y1 - y3;
- var dy21 = y2 - y1;
- var dy43 = y4 - y3;
- var ua_t = dx43 * dy13 - dy43 * dx13;
- var ub_t = dx21 * dy13 - dy21 * dx13;
- var u_b = dy43 * dx21 - dx43 * dy21;
- if (u_b !== 0) {
- var ua = ua_t / u_b;
- var ub = ub_t / u_b;
- var flptThreshold = 0.001;
- var _min = 0 - flptThreshold;
- var _max = 1 + flptThreshold;
- if (_min <= ua && ua <= _max && _min <= ub && ub <= _max) {
- return [x1 + ua * dx21, y1 + ua * dy21];
- } else {
- if (!infiniteLines) {
- return [];
- } else {
- return [x1 + ua * dx21, y1 + ua * dy21];
- }
+ _.forEach(cg.edges(), function(e) {
+ var entryV = mappedEntries[e.v];
+ var entryW = mappedEntries[e.w];
+ if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {
+ entryW.indegree++;
+ entryV.out.push(mappedEntries[e.w]);
}
- } else {
- if (ua_t === 0 || ub_t === 0) {
- // Parallel, coincident lines. Check if overlap
+ });
- // Check endpoint of second line
- if (midOfThree(x1, x2, x4) === x4) {
- return [x4, y4];
- }
+ var sourceSet = _.filter(mappedEntries, function(entry) {
+ return !entry.indegree;
+ });
- // Check start point of second line
- if (midOfThree(x1, x2, x3) === x3) {
- return [x3, y3];
- }
+ return doResolveConflicts(sourceSet);
+}
- // Endpoint of first line
- if (midOfThree(x3, x4, x2) === x2) {
- return [x2, y2];
+function doResolveConflicts(sourceSet) {
+ var entries = [];
+
+ function handleIn(vEntry) {
+ return function(uEntry) {
+ if (uEntry.merged) {
+ return;
}
- return [];
- } else {
- // Parallel, non-coincident
- return [];
- }
+ if (_.isUndefined(uEntry.barycenter) ||
+ _.isUndefined(vEntry.barycenter) ||
+ uEntry.barycenter >= vEntry.barycenter) {
+ mergeEntries(vEntry, uEntry);
+ }
+ };
}
-};
-// math.polygonIntersectLine( x, y, basePoints, centerX, centerY, width, height, padding )
-// intersect a node polygon (pts transformed)
-//
-// math.polygonIntersectLine( x, y, basePoints, centerX, centerY )
-// intersect the points (no transform)
-var polygonIntersectLine = function polygonIntersectLine(x, y, basePoints, centerX, centerY, width, height, padding) {
- var intersections = [];
- var intersection;
- var transformedPoints = new Array(basePoints.length);
- var doTransform = true;
- if (width == null) {
- doTransform = false;
- }
- var points;
- if (doTransform) {
- for (var i = 0; i < transformedPoints.length / 2; i++) {
- transformedPoints[i * 2] = basePoints[i * 2] * width + centerX;
- transformedPoints[i * 2 + 1] = basePoints[i * 2 + 1] * height + centerY;
- }
- if (padding > 0) {
- var expandedLineSet = expandPolygon(transformedPoints, -padding);
- points = joinLines(expandedLineSet);
- } else {
- points = transformedPoints;
- }
- } else {
- points = basePoints;
- }
- var currentX, currentY, nextX, nextY;
- for (var _i2 = 0; _i2 < points.length / 2; _i2++) {
- currentX = points[_i2 * 2];
- currentY = points[_i2 * 2 + 1];
- if (_i2 < points.length / 2 - 1) {
- nextX = points[(_i2 + 1) * 2];
- nextY = points[(_i2 + 1) * 2 + 1];
- } else {
- nextX = points[0];
- nextY = points[1];
- }
- intersection = finiteLinesIntersect(x, y, centerX, centerY, currentX, currentY, nextX, nextY);
- if (intersection.length !== 0) {
- intersections.push(intersection[0], intersection[1]);
- }
- }
- return intersections;
-};
-var roundPolygonIntersectLine = function roundPolygonIntersectLine(x, y, basePoints, centerX, centerY, width, height, padding) {
- var intersections = [];
- var intersection;
- var lines = new Array(basePoints.length);
- var halfW = width / 2;
- var halfH = height / 2;
- var cornerRadius = getRoundPolygonRadius(width, height);
- for (var i = 0; i < basePoints.length / 4; i++) {
- var sourceUv = void 0,
- destUv = void 0;
- if (i === 0) {
- sourceUv = basePoints.length - 2;
- } else {
- sourceUv = i * 4 - 2;
- }
- destUv = i * 4 + 2;
- var px = centerX + halfW * basePoints[i * 4];
- var py = centerY + halfH * basePoints[i * 4 + 1];
- var cosTheta = -basePoints[sourceUv] * basePoints[destUv] - basePoints[sourceUv + 1] * basePoints[destUv + 1];
- var offset = cornerRadius / Math.tan(Math.acos(cosTheta) / 2);
- var cp0x = px - offset * basePoints[sourceUv];
- var cp0y = py - offset * basePoints[sourceUv + 1];
- var cp1x = px + offset * basePoints[destUv];
- var cp1y = py + offset * basePoints[destUv + 1];
- if (i === 0) {
- lines[basePoints.length - 2] = cp0x;
- lines[basePoints.length - 1] = cp0y;
- } else {
- lines[i * 4 - 2] = cp0x;
- lines[i * 4 - 1] = cp0y;
- }
- lines[i * 4] = cp1x;
- lines[i * 4 + 1] = cp1y;
- var orthx = basePoints[sourceUv + 1];
- var orthy = -basePoints[sourceUv];
- var cosAlpha = orthx * basePoints[destUv] + orthy * basePoints[destUv + 1];
- if (cosAlpha < 0) {
- orthx *= -1;
- orthy *= -1;
- }
- var cx = cp0x + orthx * cornerRadius;
- var cy = cp0y + orthy * cornerRadius;
- intersection = intersectLineCircle(x, y, centerX, centerY, cx, cy, cornerRadius);
- if (intersection.length !== 0) {
- intersections.push(intersection[0], intersection[1]);
- }
- }
- for (var _i3 = 0; _i3 < lines.length / 4; _i3++) {
- intersection = finiteLinesIntersect(x, y, centerX, centerY, lines[_i3 * 4], lines[_i3 * 4 + 1], lines[_i3 * 4 + 2], lines[_i3 * 4 + 3], false);
- if (intersection.length !== 0) {
- intersections.push(intersection[0], intersection[1]);
- }
- }
- if (intersections.length > 2) {
- var lowestIntersection = [intersections[0], intersections[1]];
- var lowestSquaredDistance = Math.pow(lowestIntersection[0] - x, 2) + Math.pow(lowestIntersection[1] - y, 2);
- for (var _i4 = 1; _i4 < intersections.length / 2; _i4++) {
- var squaredDistance = Math.pow(intersections[_i4 * 2] - x, 2) + Math.pow(intersections[_i4 * 2 + 1] - y, 2);
- if (squaredDistance <= lowestSquaredDistance) {
- lowestIntersection[0] = intersections[_i4 * 2];
- lowestIntersection[1] = intersections[_i4 * 2 + 1];
- lowestSquaredDistance = squaredDistance;
+ function handleOut(vEntry) {
+ return function(wEntry) {
+ wEntry["in"].push(vEntry);
+ if (--wEntry.indegree === 0) {
+ sourceSet.push(wEntry);
}
- }
- return lowestIntersection;
- }
- return intersections;
-};
-var shortenIntersection = function shortenIntersection(intersection, offset, amount) {
- var disp = [intersection[0] - offset[0], intersection[1] - offset[1]];
- var length = Math.sqrt(disp[0] * disp[0] + disp[1] * disp[1]);
- var lenRatio = (length - amount) / length;
- if (lenRatio < 0) {
- lenRatio = 0.00001;
- }
- return [offset[0] + lenRatio * disp[0], offset[1] + lenRatio * disp[1]];
-};
-var generateUnitNgonPointsFitToSquare = function generateUnitNgonPointsFitToSquare(sides, rotationRadians) {
- var points = generateUnitNgonPoints(sides, rotationRadians);
- points = fitPolygonToSquare(points);
- return points;
-};
-var fitPolygonToSquare = function fitPolygonToSquare(points) {
- var x, y;
- var sides = points.length / 2;
- var minX = Infinity,
- minY = Infinity,
- maxX = -Infinity,
- maxY = -Infinity;
- for (var i = 0; i < sides; i++) {
- x = points[2 * i];
- y = points[2 * i + 1];
- minX = Math.min(minX, x);
- maxX = Math.max(maxX, x);
- minY = Math.min(minY, y);
- maxY = Math.max(maxY, y);
+ };
}
- // stretch factors
- var sx = 2 / (maxX - minX);
- var sy = 2 / (maxY - minY);
- for (var _i5 = 0; _i5 < sides; _i5++) {
- x = points[2 * _i5] = points[2 * _i5] * sx;
- y = points[2 * _i5 + 1] = points[2 * _i5 + 1] * sy;
- minX = Math.min(minX, x);
- maxX = Math.max(maxX, x);
- minY = Math.min(minY, y);
- maxY = Math.max(maxY, y);
- }
- if (minY < -1) {
- for (var _i6 = 0; _i6 < sides; _i6++) {
- y = points[2 * _i6 + 1] = points[2 * _i6 + 1] + (-1 - minY);
- }
- }
- return points;
-};
-var generateUnitNgonPoints = function generateUnitNgonPoints(sides, rotationRadians) {
- var increment = 1.0 / sides * 2 * Math.PI;
- var startAngle = sides % 2 === 0 ? Math.PI / 2.0 + increment / 2.0 : Math.PI / 2.0;
- startAngle += rotationRadians;
- var points = new Array(sides * 2);
- var currentAngle;
- for (var i = 0; i < sides; i++) {
- currentAngle = i * increment + startAngle;
- points[2 * i] = Math.cos(currentAngle); // x
- points[2 * i + 1] = Math.sin(-currentAngle); // y
+ while (sourceSet.length) {
+ var entry = sourceSet.pop();
+ entries.push(entry);
+ _.forEach(entry["in"].reverse(), handleIn(entry));
+ _.forEach(entry.out, handleOut(entry));
}
- return points;
-};
+ return _.map(_.filter(entries, function(entry) { return !entry.merged; }),
+ function(entry) {
+ return _.pick(entry, ["vs", "i", "barycenter", "weight"]);
+ });
-// Set the default radius, unless half of width or height is smaller than default
-var getRoundRectangleRadius = function getRoundRectangleRadius(width, height) {
- return Math.min(width / 4, height / 4, 8);
-};
+}
-// Set the default radius
-var getRoundPolygonRadius = function getRoundPolygonRadius(width, height) {
- return Math.min(width / 10, height / 10, 8);
-};
-var getCutRectangleCornerLength = function getCutRectangleCornerLength() {
- return 8;
-};
-var bezierPtsToQuadCoeff = function bezierPtsToQuadCoeff(p0, p1, p2) {
- return [p0 - 2 * p1 + p2, 2 * (p1 - p0), p0];
-};
+function mergeEntries(target, source) {
+ var sum = 0;
+ var weight = 0;
-// get curve width, height, and control point position offsets as a percentage of node height / width
-var getBarrelCurveConstants = function getBarrelCurveConstants(width, height) {
- return {
- heightOffset: Math.min(15, 0.05 * height),
- widthOffset: Math.min(100, 0.25 * width),
- ctrlPtOffsetPct: 0.05
- };
-};
+ if (target.weight) {
+ sum += target.barycenter * target.weight;
+ weight += target.weight;
+ }
-var pageRankDefaults = defaults$g({
- dampingFactor: 0.8,
- precision: 0.000001,
- iterations: 200,
- weight: function weight(edge) {
- return 1;
+ if (source.weight) {
+ sum += source.barycenter * source.weight;
+ weight += source.weight;
}
-});
-var elesfn$o = {
- pageRank: function pageRank(options) {
- var _pageRankDefaults = pageRankDefaults(options),
- dampingFactor = _pageRankDefaults.dampingFactor,
- precision = _pageRankDefaults.precision,
- iterations = _pageRankDefaults.iterations,
- weight = _pageRankDefaults.weight;
- var cy = this._private.cy;
- var _this$byGroup = this.byGroup(),
- nodes = _this$byGroup.nodes,
- edges = _this$byGroup.edges;
- var numNodes = nodes.length;
- var numNodesSqd = numNodes * numNodes;
- var numEdges = edges.length;
- // Construct transposed adjacency matrix
- // First lets have a zeroed matrix of the right size
- // We'll also keep track of the sum of each column
- var matrix = new Array(numNodesSqd);
- var columnSum = new Array(numNodes);
- var additionalProb = (1 - dampingFactor) / numNodes;
+ target.vs = source.vs.concat(target.vs);
+ target.barycenter = sum / weight;
+ target.weight = weight;
+ target.i = Math.min(source.i, target.i);
+ source.merged = true;
+}
- // Create null matrix
- for (var i = 0; i < numNodes; i++) {
- for (var j = 0; j < numNodes; j++) {
- var n = i * numNodes + j;
- matrix[n] = 0;
- }
- columnSum[i] = 0;
- }
- // Now, process edges
- for (var _i = 0; _i < numEdges; _i++) {
- var edge = edges[_i];
- var srcId = edge.data('source');
- var tgtId = edge.data('target');
+/***/ }),
- // Don't include loops in the matrix
- if (srcId === tgtId) {
- continue;
- }
- var s = nodes.indexOfId(srcId);
- var t = nodes.indexOfId(tgtId);
- var w = weight(edge);
- var _n = t * numNodes + s;
+/***/ "./node_modules/dagre/lib/order/sort-subgraph.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/dagre/lib/order/sort-subgraph.js ***!
+ \*******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Update matrix
- matrix[_n] += w;
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var barycenter = __webpack_require__(/*! ./barycenter */ "./node_modules/dagre/lib/order/barycenter.js");
+var resolveConflicts = __webpack_require__(/*! ./resolve-conflicts */ "./node_modules/dagre/lib/order/resolve-conflicts.js");
+var sort = __webpack_require__(/*! ./sort */ "./node_modules/dagre/lib/order/sort.js");
- // Update column sum
- columnSum[s] += w;
- }
+module.exports = sortSubgraph;
- // Add additional probability based on damping factor
- // Also, take into account columns that have sum = 0
- var p = 1.0 / numNodes + additionalProb; // Shorthand
+function sortSubgraph(g, v, cg, biasRight) {
+ var movable = g.children(v);
+ var node = g.node(v);
+ var bl = node ? node.borderLeft : undefined;
+ var br = node ? node.borderRight: undefined;
+ var subgraphs = {};
- // Traverse matrix, column by column
- for (var _j = 0; _j < numNodes; _j++) {
- if (columnSum[_j] === 0) {
- // No 'links' out from node jth, assume equal probability for each possible node
- for (var _i2 = 0; _i2 < numNodes; _i2++) {
- var _n2 = _i2 * numNodes + _j;
- matrix[_n2] = p;
- }
- } else {
- // Node jth has outgoing link, compute normalized probabilities
- for (var _i3 = 0; _i3 < numNodes; _i3++) {
- var _n3 = _i3 * numNodes + _j;
- matrix[_n3] = matrix[_n3] / columnSum[_j] + additionalProb;
- }
+ if (bl) {
+ movable = _.filter(movable, function(w) {
+ return w !== bl && w !== br;
+ });
+ }
+
+ var barycenters = barycenter(g, movable);
+ _.forEach(barycenters, function(entry) {
+ if (g.children(entry.v).length) {
+ var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+ subgraphs[entry.v] = subgraphResult;
+ if (_.has(subgraphResult, "barycenter")) {
+ mergeBarycenters(entry, subgraphResult);
}
}
+ });
- // Compute dominant eigenvector using power method
- var eigenvector = new Array(numNodes);
- var temp = new Array(numNodes);
- var previous;
-
- // Start with a vector of all 1's
- // Also, initialize a null vector which will be used as shorthand
- for (var _i4 = 0; _i4 < numNodes; _i4++) {
- eigenvector[_i4] = 1;
- }
- for (var iter = 0; iter < iterations; iter++) {
- // Temp array with all 0's
- for (var _i5 = 0; _i5 < numNodes; _i5++) {
- temp[_i5] = 0;
- }
+ var entries = resolveConflicts(barycenters, cg);
+ expandSubgraphs(entries, subgraphs);
- // Multiply matrix with previous result
- for (var _i6 = 0; _i6 < numNodes; _i6++) {
- for (var _j2 = 0; _j2 < numNodes; _j2++) {
- var _n4 = _i6 * numNodes + _j2;
- temp[_i6] += matrix[_n4] * eigenvector[_j2];
- }
- }
- inPlaceSumNormalize(temp);
- previous = eigenvector;
- eigenvector = temp;
- temp = previous;
- var diff = 0;
- // Compute difference (squared module) of both vectors
- for (var _i7 = 0; _i7 < numNodes; _i7++) {
- var delta = previous[_i7] - eigenvector[_i7];
- diff += delta * delta;
- }
+ var result = sort(entries, biasRight);
- // If difference is less than the desired threshold, stop iterating
- if (diff < precision) {
- break;
+ if (bl) {
+ result.vs = _.flatten([bl, result.vs, br], true);
+ if (g.predecessors(bl).length) {
+ var blPred = g.node(g.predecessors(bl)[0]),
+ brPred = g.node(g.predecessors(br)[0]);
+ if (!_.has(result, "barycenter")) {
+ result.barycenter = 0;
+ result.weight = 0;
}
+ result.barycenter = (result.barycenter * result.weight +
+ blPred.order + brPred.order) / (result.weight + 2);
+ result.weight += 2;
}
+ }
- // Construct result
- var res = {
- rank: function rank(node) {
- node = cy.collection(node)[0];
- return eigenvector[nodes.indexOf(node)];
- }
- };
- return res;
- } // pageRank
-}; // elesfn
-
-var defaults$f = defaults$g({
- root: null,
- weight: function weight(edge) {
- return 1;
- },
- directed: false,
- alpha: 0
-});
-var elesfn$n = {
- degreeCentralityNormalized: function degreeCentralityNormalized(options) {
- options = defaults$f(options);
- var cy = this.cy();
- var nodes = this.nodes();
- var numNodes = nodes.length;
- if (!options.directed) {
- var degrees = {};
- var maxDegree = 0;
- for (var i = 0; i < numNodes; i++) {
- var node = nodes[i];
+ return result;
+}
- // add current node to the current options object and call degreeCentrality
- options.root = node;
- var currDegree = this.degreeCentrality(options);
- if (maxDegree < currDegree.degree) {
- maxDegree = currDegree.degree;
- }
- degrees[node.id()] = currDegree.degree;
+function expandSubgraphs(entries, subgraphs) {
+ _.forEach(entries, function(entry) {
+ entry.vs = _.flatten(entry.vs.map(function(v) {
+ if (subgraphs[v]) {
+ return subgraphs[v].vs;
}
- return {
- degree: function degree(node) {
- if (maxDegree === 0) {
- return 0;
- }
- if (string(node)) {
- // from is a selector string
- node = cy.filter(node);
- }
- return degrees[node.id()] / maxDegree;
- }
- };
- } else {
- var indegrees = {};
- var outdegrees = {};
- var maxIndegree = 0;
- var maxOutdegree = 0;
- for (var _i = 0; _i < numNodes; _i++) {
- var _node = nodes[_i];
- var id = _node.id();
+ return v;
+ }), true);
+ });
+}
- // add current node to the current options object and call degreeCentrality
- options.root = _node;
- var _currDegree = this.degreeCentrality(options);
- if (maxIndegree < _currDegree.indegree) maxIndegree = _currDegree.indegree;
- if (maxOutdegree < _currDegree.outdegree) maxOutdegree = _currDegree.outdegree;
- indegrees[id] = _currDegree.indegree;
- outdegrees[id] = _currDegree.outdegree;
- }
- return {
- indegree: function indegree(node) {
- if (maxIndegree == 0) {
- return 0;
- }
- if (string(node)) {
- // from is a selector string
- node = cy.filter(node);
- }
- return indegrees[node.id()] / maxIndegree;
- },
- outdegree: function outdegree(node) {
- if (maxOutdegree === 0) {
- return 0;
- }
- if (string(node)) {
- // from is a selector string
- node = cy.filter(node);
- }
- return outdegrees[node.id()] / maxOutdegree;
- }
- };
- }
- },
- // degreeCentralityNormalized
+function mergeBarycenters(target, other) {
+ if (!_.isUndefined(target.barycenter)) {
+ target.barycenter = (target.barycenter * target.weight +
+ other.barycenter * other.weight) /
+ (target.weight + other.weight);
+ target.weight += other.weight;
+ } else {
+ target.barycenter = other.barycenter;
+ target.weight = other.weight;
+ }
+}
- // Implemented from the algorithm in Opsahl's paper
- // "Node centrality in weighted networks: Generalizing degree and shortest paths"
- // check the heading 2 "Degree"
- degreeCentrality: function degreeCentrality(options) {
- options = defaults$f(options);
- var cy = this.cy();
- var callingEles = this;
- var _options = options,
- root = _options.root,
- weight = _options.weight,
- directed = _options.directed,
- alpha = _options.alpha;
- root = cy.collection(root)[0];
- if (!directed) {
- var connEdges = root.connectedEdges().intersection(callingEles);
- var k = connEdges.length;
- var s = 0;
- // Now, sum edge weights
- for (var i = 0; i < connEdges.length; i++) {
- s += weight(connEdges[i]);
- }
- return {
- degree: Math.pow(k, 1 - alpha) * Math.pow(s, alpha)
- };
- } else {
- var edges = root.connectedEdges();
- var incoming = edges.filter(function (edge) {
- return edge.target().same(root) && callingEles.has(edge);
- });
- var outgoing = edges.filter(function (edge) {
- return edge.source().same(root) && callingEles.has(edge);
- });
- var k_in = incoming.length;
- var k_out = outgoing.length;
- var s_in = 0;
- var s_out = 0;
+/***/ }),
- // Now, sum incoming edge weights
- for (var _i2 = 0; _i2 < incoming.length; _i2++) {
- s_in += weight(incoming[_i2]);
- }
+/***/ "./node_modules/dagre/lib/order/sort.js":
+/*!**********************************************!*\
+ !*** ./node_modules/dagre/lib/order/sort.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Now, sum outgoing edge weights
- for (var _i3 = 0; _i3 < outgoing.length; _i3++) {
- s_out += weight(outgoing[_i3]);
- }
- return {
- indegree: Math.pow(k_in, 1 - alpha) * Math.pow(s_in, alpha),
- outdegree: Math.pow(k_out, 1 - alpha) * Math.pow(s_out, alpha)
- };
- }
- } // degreeCentrality
-}; // elesfn
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
-// nice, short mathematical alias
-elesfn$n.dc = elesfn$n.degreeCentrality;
-elesfn$n.dcn = elesfn$n.degreeCentralityNormalised = elesfn$n.degreeCentralityNormalized;
+module.exports = sort;
-var defaults$e = defaults$g({
- harmonic: true,
- weight: function weight() {
- return 1;
- },
- directed: false,
- root: null
-});
-var elesfn$m = {
- closenessCentralityNormalized: function closenessCentralityNormalized(options) {
- var _defaults = defaults$e(options),
- harmonic = _defaults.harmonic,
- weight = _defaults.weight,
- directed = _defaults.directed;
- var cy = this.cy();
- var closenesses = {};
- var maxCloseness = 0;
- var nodes = this.nodes();
- var fw = this.floydWarshall({
- weight: weight,
- directed: directed
- });
+function sort(entries, biasRight) {
+ var parts = util.partition(entries, function(entry) {
+ return _.has(entry, "barycenter");
+ });
+ var sortable = parts.lhs,
+ unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),
+ vs = [],
+ sum = 0,
+ weight = 0,
+ vsIndex = 0;
- // Compute closeness for every node and find the maximum closeness
- for (var i = 0; i < nodes.length; i++) {
- var currCloseness = 0;
- var node_i = nodes[i];
- for (var j = 0; j < nodes.length; j++) {
- if (i !== j) {
- var d = fw.distance(node_i, nodes[j]);
- if (harmonic) {
- currCloseness += 1 / d;
- } else {
- currCloseness += d;
- }
- }
- }
- if (!harmonic) {
- currCloseness = 1 / currCloseness;
- }
- if (maxCloseness < currCloseness) {
- maxCloseness = currCloseness;
- }
- closenesses[node_i.id()] = currCloseness;
- }
- return {
- closeness: function closeness(node) {
- if (maxCloseness == 0) {
- return 0;
- }
- if (string(node)) {
- // from is a selector string
- node = cy.filter(node)[0].id();
- } else {
- // from is a node
- node = node.id();
- }
- return closenesses[node] / maxCloseness;
- }
- };
- },
- // Implemented from pseudocode from wikipedia
- closenessCentrality: function closenessCentrality(options) {
- var _defaults2 = defaults$e(options),
- root = _defaults2.root,
- weight = _defaults2.weight,
- directed = _defaults2.directed,
- harmonic = _defaults2.harmonic;
- root = this.filter(root)[0];
+ sortable.sort(compareWithBias(!!biasRight));
- // we need distance from this node to every other node
- var dijkstra = this.dijkstra({
- root: root,
- weight: weight,
- directed: directed
- });
- var totalDistance = 0;
- var nodes = this.nodes();
- for (var i = 0; i < nodes.length; i++) {
- var n = nodes[i];
- if (!n.same(root)) {
- var d = dijkstra.distanceTo(n);
- if (harmonic) {
- totalDistance += 1 / d;
- } else {
- totalDistance += d;
- }
- }
+ vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+
+ _.forEach(sortable, function (entry) {
+ vsIndex += entry.vs.length;
+ vs.push(entry.vs);
+ sum += entry.barycenter * entry.weight;
+ weight += entry.weight;
+ vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+ });
+
+ var result = { vs: _.flatten(vs, true) };
+ if (weight) {
+ result.barycenter = sum / weight;
+ result.weight = weight;
+ }
+ return result;
+}
+
+function consumeUnsortable(vs, unsortable, index) {
+ var last;
+ while (unsortable.length && (last = _.last(unsortable)).i <= index) {
+ unsortable.pop();
+ vs.push(last.vs);
+ index++;
+ }
+ return index;
+}
+
+function compareWithBias(bias) {
+ return function(entryV, entryW) {
+ if (entryV.barycenter < entryW.barycenter) {
+ return -1;
+ } else if (entryV.barycenter > entryW.barycenter) {
+ return 1;
}
- return harmonic ? totalDistance : 1 / totalDistance;
- } // closenessCentrality
-}; // elesfn
-// nice, short mathematical alias
-elesfn$m.cc = elesfn$m.closenessCentrality;
-elesfn$m.ccn = elesfn$m.closenessCentralityNormalised = elesfn$m.closenessCentralityNormalized;
+ return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+ };
+}
-var defaults$d = defaults$g({
- weight: null,
- directed: false
-});
-var elesfn$l = {
- // Implemented from the algorithm in the paper "On Variants of Shortest-Path Betweenness Centrality and their Generic Computation" by Ulrik Brandes
- betweennessCentrality: function betweennessCentrality(options) {
- var _defaults = defaults$d(options),
- directed = _defaults.directed,
- weight = _defaults.weight;
- var weighted = weight != null;
- var cy = this.cy();
- // starting
- var V = this.nodes();
- var A = {};
- var _C = {};
- var max = 0;
- var C = {
- set: function set(key, val) {
- _C[key] = val;
- if (val > max) {
- max = val;
- }
- },
- get: function get(key) {
- return _C[key];
- }
- };
+/***/ }),
- // A contains the neighborhoods of every node
- for (var i = 0; i < V.length; i++) {
- var v = V[i];
- var vid = v.id();
- if (directed) {
- A[vid] = v.outgoers().nodes(); // get outgoers of every node
- } else {
- A[vid] = v.openNeighborhood().nodes(); // get neighbors of every node
- }
+/***/ "./node_modules/dagre/lib/parent-dummy-chains.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/dagre/lib/parent-dummy-chains.js ***!
+ \*******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- C.set(vid, 0);
- }
- var _loop = function _loop(s) {
- var sid = V[s].id();
- var S = []; // stack
- var P = {};
- var g = {};
- var d = {};
- var Q = new Heap__default["default"](function (a, b) {
- return d[a] - d[b];
- }); // queue
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
- // init dictionaries
- for (var _i = 0; _i < V.length; _i++) {
- var _vid = V[_i].id();
- P[_vid] = [];
- g[_vid] = 0;
- d[_vid] = Infinity;
- }
- g[sid] = 1; // sigma
- d[sid] = 0; // distance to s
+module.exports = parentDummyChains;
- Q.push(sid);
- while (!Q.empty()) {
- var _v = Q.pop();
- S.push(_v);
- if (weighted) {
- for (var j = 0; j < A[_v].length; j++) {
- var w = A[_v][j];
- var vEle = cy.getElementById(_v);
- var edge = void 0;
- if (vEle.edgesTo(w).length > 0) {
- edge = vEle.edgesTo(w)[0];
- } else {
- edge = w.edgesTo(vEle)[0];
- }
- var edgeWeight = weight(edge);
- w = w.id();
- if (d[w] > d[_v] + edgeWeight) {
- d[w] = d[_v] + edgeWeight;
- if (Q.nodes.indexOf(w) < 0) {
- //if w is not in Q
- Q.push(w);
- } else {
- // update position if w is in Q
- Q.updateItem(w);
- }
- g[w] = 0;
- P[w] = [];
- }
- if (d[w] == d[_v] + edgeWeight) {
- g[w] = g[w] + g[_v];
- P[w].push(_v);
- }
- }
- } else {
- for (var _j = 0; _j < A[_v].length; _j++) {
- var _w = A[_v][_j].id();
- if (d[_w] == Infinity) {
- Q.push(_w);
- d[_w] = d[_v] + 1;
- }
- if (d[_w] == d[_v] + 1) {
- g[_w] = g[_w] + g[_v];
- P[_w].push(_v);
- }
- }
- }
- }
- var e = {};
- for (var _i2 = 0; _i2 < V.length; _i2++) {
- e[V[_i2].id()] = 0;
- }
- while (S.length > 0) {
- var _w2 = S.pop();
- for (var _j2 = 0; _j2 < P[_w2].length; _j2++) {
- var _v2 = P[_w2][_j2];
- e[_v2] = e[_v2] + g[_v2] / g[_w2] * (1 + e[_w2]);
+function parentDummyChains(g) {
+ var postorderNums = postorder(g);
+
+ _.forEach(g.graph().dummyChains, function(v) {
+ var node = g.node(v);
+ var edgeObj = node.edgeObj;
+ var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+ var path = pathData.path;
+ var lca = pathData.lca;
+ var pathIdx = 0;
+ var pathV = path[pathIdx];
+ var ascending = true;
+
+ while (v !== edgeObj.w) {
+ node = g.node(v);
+
+ if (ascending) {
+ while ((pathV = path[pathIdx]) !== lca &&
+ g.node(pathV).maxRank < node.rank) {
+ pathIdx++;
}
- if (_w2 != V[s].id()) {
- C.set(_w2, C.get(_w2) + e[_w2]);
+
+ if (pathV === lca) {
+ ascending = false;
}
}
- };
- for (var s = 0; s < V.length; s++) {
- _loop(s);
- }
- var ret = {
- betweenness: function betweenness(node) {
- var id = cy.collection(node).id();
- return C.get(id);
- },
- betweennessNormalized: function betweennessNormalized(node) {
- if (max == 0) {
- return 0;
+
+ if (!ascending) {
+ while (pathIdx < path.length - 1 &&
+ g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
+ pathIdx++;
}
- var id = cy.collection(node).id();
- return C.get(id) / max;
+ pathV = path[pathIdx];
}
- };
- // alias
- ret.betweennessNormalised = ret.betweennessNormalized;
- return ret;
- } // betweennessCentrality
-}; // elesfn
+ g.setParent(v, pathV);
+ v = g.successors(v)[0];
+ }
+ });
+}
-// nice, short mathematical alias
-elesfn$l.bc = elesfn$l.betweennessCentrality;
+// Find a path from v to w through the lowest common ancestor (LCA). Return the
+// full path and the LCA.
+function findPath(g, postorderNums, v, w) {
+ var vPath = [];
+ var wPath = [];
+ var low = Math.min(postorderNums[v].low, postorderNums[w].low);
+ var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+ var parent;
+ var lca;
-// Implemented by Zoe Xi @zoexi for GSOC 2016
+ // Traverse up from v to find the LCA
+ parent = v;
+ do {
+ parent = g.parent(parent);
+ vPath.push(parent);
+ } while (parent &&
+ (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
+ lca = parent;
-/* eslint-disable no-unused-vars */
-var defaults$c = defaults$g({
- expandFactor: 2,
- // affects time of computation and cluster granularity to some extent: M * M
- inflateFactor: 2,
- // affects cluster granularity (the greater the value, the more clusters): M(i,j) / E(j)
- multFactor: 1,
- // optional self loops for each node. Use a neutral value to improve cluster computations.
- maxIterations: 20,
- // maximum number of iterations of the MCL algorithm in a single run
- attributes: [
- // attributes/features used to group nodes, ie. similarity values between nodes
- function (edge) {
- return 1;
- }]
-});
-/* eslint-enable */
+ // Traverse from w to LCA
+ parent = w;
+ while ((parent = g.parent(parent)) !== lca) {
+ wPath.push(parent);
+ }
-var setOptions$3 = function setOptions(options) {
- return defaults$c(options);
-};
-/* eslint-enable */
+ return { path: vPath.concat(wPath.reverse()), lca: lca };
+}
-var getSimilarity$1 = function getSimilarity(edge, attributes) {
- var total = 0;
- for (var i = 0; i < attributes.length; i++) {
- total += attributes[i](edge);
- }
- return total;
-};
-var addLoops = function addLoops(M, n, val) {
- for (var i = 0; i < n; i++) {
- M[i * n + i] = val;
- }
-};
-var normalize = function normalize(M, n) {
- var sum;
- for (var col = 0; col < n; col++) {
- sum = 0;
- for (var row = 0; row < n; row++) {
- sum += M[row * n + col];
- }
- for (var _row = 0; _row < n; _row++) {
- M[_row * n + col] = M[_row * n + col] / sum;
- }
+function postorder(g) {
+ var result = {};
+ var lim = 0;
+
+ function dfs(v) {
+ var low = lim;
+ _.forEach(g.children(v), dfs);
+ result[v] = { low: low, lim: lim++ };
}
+ _.forEach(g.children(), dfs);
+
+ return result;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/dagre/lib/position/bk.js":
+/*!***********************************************!*\
+ !*** ./node_modules/dagre/lib/position/bk.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+"use strict";
+
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
+
+/*
+ * This module provides coordinate assignment based on Brandes and Köpf, "Fast
+ * and Simple Horizontal Coordinate Assignment."
+ */
+
+module.exports = {
+ positionX: positionX,
+ findType1Conflicts: findType1Conflicts,
+ findType2Conflicts: findType2Conflicts,
+ addConflict: addConflict,
+ hasConflict: hasConflict,
+ verticalAlignment: verticalAlignment,
+ horizontalCompaction: horizontalCompaction,
+ alignCoordinates: alignCoordinates,
+ findSmallestWidthAlignment: findSmallestWidthAlignment,
+ balance: balance
};
-// TODO: blocked matrix multiplication?
-var mmult = function mmult(A, B, n) {
- var C = new Array(n * n);
- for (var i = 0; i < n; i++) {
- for (var j = 0; j < n; j++) {
- C[i * n + j] = 0;
- }
- for (var k = 0; k < n; k++) {
- for (var _j = 0; _j < n; _j++) {
- C[i * n + _j] += A[i * n + k] * B[k * n + _j];
+/*
+ * Marks all edges in the graph with a type-1 conflict with the "type1Conflict"
+ * property. A type-1 conflict is one where a non-inner segment crosses an
+ * inner segment. An inner segment is an edge with both incident nodes marked
+ * with the "dummy" property.
+ *
+ * This algorithm scans layer by layer, starting with the second, for type-1
+ * conflicts between the current layer and the previous layer. For each layer
+ * it scans the nodes from left to right until it reaches one that is incident
+ * on an inner segment. It then scans predecessors to determine if they have
+ * edges that cross that inner segment. At the end a final scan is done for all
+ * nodes on the current rank to see if they cross the last visited inner
+ * segment.
+ *
+ * This algorithm (safely) assumes that a dummy node will only be incident on a
+ * single node in the layers being scanned.
+ */
+function findType1Conflicts(g, layering) {
+ var conflicts = {};
+
+ function visitLayer(prevLayer, layer) {
+ var
+ // last visited node in the previous layer that is incident on an inner
+ // segment.
+ k0 = 0,
+ // Tracks the last node in this layer scanned for crossings with a type-1
+ // segment.
+ scanPos = 0,
+ prevLayerLength = prevLayer.length,
+ lastNode = _.last(layer);
+
+ _.forEach(layer, function(v, i) {
+ var w = findOtherInnerSegmentNode(g, v),
+ k1 = w ? g.node(w).order : prevLayerLength;
+
+ if (w || v === lastNode) {
+ _.forEach(layer.slice(scanPos, i +1), function(scanNode) {
+ _.forEach(g.predecessors(scanNode), function(u) {
+ var uLabel = g.node(u),
+ uPos = uLabel.order;
+ if ((uPos < k0 || k1 < uPos) &&
+ !(uLabel.dummy && g.node(scanNode).dummy)) {
+ addConflict(conflicts, u, scanNode);
+ }
+ });
+ });
+ scanPos = i + 1;
+ k0 = k1;
}
- }
- }
- return C;
-};
-var expand = function expand(M, n, expandFactor /** power **/) {
- var _M = M.slice(0);
- for (var p = 1; p < expandFactor; p++) {
- M = mmult(M, _M, n);
- }
- return M;
-};
-var inflate = function inflate(M, n, inflateFactor /** r **/) {
- var _M = new Array(n * n);
+ });
- // M(i,j) ^ inflatePower
- for (var i = 0; i < n * n; i++) {
- _M[i] = Math.pow(M[i], inflateFactor);
- }
- normalize(_M, n);
- return _M;
-};
-var hasConverged = function hasConverged(M, _M, n2, roundFactor) {
- // Check that both matrices have the same elements (i,j)
- for (var i = 0; i < n2; i++) {
- var v1 = Math.round(M[i] * Math.pow(10, roundFactor)) / Math.pow(10, roundFactor); // truncate to 'roundFactor' decimal places
- var v2 = Math.round(_M[i] * Math.pow(10, roundFactor)) / Math.pow(10, roundFactor);
- if (v1 !== v2) {
- return false;
- }
+ return layer;
}
- return true;
-};
-var assign$2 = function assign(M, n, nodes, cy) {
- var clusters = [];
- for (var i = 0; i < n; i++) {
- var cluster = [];
- for (var j = 0; j < n; j++) {
- // Row-wise attractors and elements that they attract belong in same cluster
- if (Math.round(M[i * n + j] * 1000) / 1000 > 0) {
- cluster.push(nodes[j]);
+
+ _.reduce(layering, visitLayer);
+ return conflicts;
+}
+
+function findType2Conflicts(g, layering) {
+ var conflicts = {};
+
+ function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
+ var v;
+ _.forEach(_.range(southPos, southEnd), function(i) {
+ v = south[i];
+ if (g.node(v).dummy) {
+ _.forEach(g.predecessors(v), function(u) {
+ var uNode = g.node(u);
+ if (uNode.dummy &&
+ (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
+ addConflict(conflicts, u, v);
+ }
+ });
}
- }
- if (cluster.length !== 0) {
- clusters.push(cy.collection(cluster));
- }
- }
- return clusters;
-};
-var isDuplicate = function isDuplicate(c1, c2) {
- for (var i = 0; i < c1.length; i++) {
- if (!c2[i] || c1[i].id() !== c2[i].id()) {
- return false;
- }
+ });
}
- return true;
-};
-var removeDuplicates = function removeDuplicates(clusters) {
- for (var i = 0; i < clusters.length; i++) {
- for (var j = 0; j < clusters.length; j++) {
- if (i != j && isDuplicate(clusters[i], clusters[j])) {
- clusters.splice(j, 1);
+
+
+ function visitLayer(north, south) {
+ var prevNorthPos = -1,
+ nextNorthPos,
+ southPos = 0;
+
+ _.forEach(south, function(v, southLookahead) {
+ if (g.node(v).dummy === "border") {
+ var predecessors = g.predecessors(v);
+ if (predecessors.length) {
+ nextNorthPos = g.node(predecessors[0]).order;
+ scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
+ southPos = southLookahead;
+ prevNorthPos = nextNorthPos;
+ }
}
- }
+ scan(south, southPos, south.length, nextNorthPos, north.length);
+ });
+
+ return south;
}
- return clusters;
-};
-var markovClustering = function markovClustering(options) {
- var nodes = this.nodes();
- var edges = this.edges();
- var cy = this.cy();
- // Set parameters of algorithm:
- var opts = setOptions$3(options);
+ _.reduce(layering, visitLayer);
+ return conflicts;
+}
- // Map each node to its position in node array
- var id2position = {};
- for (var i = 0; i < nodes.length; i++) {
- id2position[nodes[i].id()] = i;
+function findOtherInnerSegmentNode(g, v) {
+ if (g.node(v).dummy) {
+ return _.find(g.predecessors(v), function(u) {
+ return g.node(u).dummy;
+ });
}
+}
- // Generate stochastic matrix M from input graph G (should be symmetric/undirected)
- var n = nodes.length,
- n2 = n * n;
- var M = new Array(n2),
- _M;
- for (var _i = 0; _i < n2; _i++) {
- M[_i] = 0;
+function addConflict(conflicts, v, w) {
+ if (v > w) {
+ var tmp = v;
+ v = w;
+ w = tmp;
}
- for (var e = 0; e < edges.length; e++) {
- var edge = edges[e];
- var _i2 = id2position[edge.source().id()];
- var j = id2position[edge.target().id()];
- var sim = getSimilarity$1(edge, opts.attributes);
- M[_i2 * n + j] += sim; // G should be symmetric and undirected
- M[j * n + _i2] += sim;
+
+ var conflictsV = conflicts[v];
+ if (!conflictsV) {
+ conflicts[v] = conflictsV = {};
}
+ conflictsV[w] = true;
+}
- // Begin Markov cluster algorithm
+function hasConflict(conflicts, v, w) {
+ if (v > w) {
+ var tmp = v;
+ v = w;
+ w = tmp;
+ }
+ return _.has(conflicts[v], w);
+}
- // Step 1: Add self loops to each node, ie. add multFactor to matrix diagonal
- addLoops(M, n, opts.multFactor);
+/*
+ * Try to align nodes into vertical "blocks" where possible. This algorithm
+ * attempts to align a node with one of its median neighbors. If the edge
+ * connecting a neighbor is a type-1 conflict then we ignore that possibility.
+ * If a previous node has already formed a block with a node after the node
+ * we're trying to form a block with, we also ignore that possibility - our
+ * blocks would be split in that scenario.
+ */
+function verticalAlignment(g, layering, conflicts, neighborFn) {
+ var root = {},
+ align = {},
+ pos = {};
- // Step 2: M = normalize( M );
- normalize(M, n);
- var isStillMoving = true;
- var iterations = 0;
- while (isStillMoving && iterations < opts.maxIterations) {
- isStillMoving = false;
+ // We cache the position here based on the layering because the graph and
+ // layering may be out of sync. The layering matrix is manipulated to
+ // generate different extreme alignments.
+ _.forEach(layering, function(layer) {
+ _.forEach(layer, function(v, order) {
+ root[v] = v;
+ align[v] = v;
+ pos[v] = order;
+ });
+ });
- // Step 3:
- _M = expand(M, n, opts.expandFactor);
+ _.forEach(layering, function(layer) {
+ var prevIdx = -1;
+ _.forEach(layer, function(v) {
+ var ws = neighborFn(v);
+ if (ws.length) {
+ ws = _.sortBy(ws, function(w) { return pos[w]; });
+ var mp = (ws.length - 1) / 2;
+ for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+ var w = ws[i];
+ if (align[v] === v &&
+ prevIdx < pos[w] &&
+ !hasConflict(conflicts, v, w)) {
+ align[w] = v;
+ align[v] = root[v] = root[w];
+ prevIdx = pos[w];
+ }
+ }
+ }
+ });
+ });
- // Step 4:
- M = inflate(_M, n, opts.inflateFactor);
+ return { root: root, align: align };
+}
- // Step 5: check to see if ~steady state has been reached
- if (!hasConverged(M, _M, n2, 4)) {
- isStillMoving = true;
+function horizontalCompaction(g, layering, root, align, reverseSep) {
+ // This portion of the algorithm differs from BK due to a number of problems.
+ // Instead of their algorithm we construct a new block graph and do two
+ // sweeps. The first sweep places blocks with the smallest possible
+ // coordinates. The second sweep removes unused space by moving blocks to the
+ // greatest coordinates without violating separation.
+ var xs = {},
+ blockG = buildBlockGraph(g, layering, root, reverseSep),
+ borderType = reverseSep ? "borderLeft" : "borderRight";
+
+ function iterate(setXsFunc, nextNodesFunc) {
+ var stack = blockG.nodes();
+ var elem = stack.pop();
+ var visited = {};
+ while (elem) {
+ if (visited[elem]) {
+ setXsFunc(elem);
+ } else {
+ visited[elem] = true;
+ stack.push(elem);
+ stack = stack.concat(nextNodesFunc(elem));
+ }
+
+ elem = stack.pop();
}
- iterations++;
}
- // Build clusters from matrix
- var clusters = assign$2(M, n, nodes, cy);
+ // First pass, assign smallest coordinates
+ function pass1(elem) {
+ xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {
+ return Math.max(acc, xs[e.v] + blockG.edge(e));
+ }, 0);
+ }
- // Remove duplicate clusters due to symmetry of graph and M matrix
- clusters = removeDuplicates(clusters);
- return clusters;
-};
-var markovClustering$1 = {
- markovClustering: markovClustering,
- mcl: markovClustering
-};
+ // Second pass, assign greatest coordinates
+ function pass2(elem) {
+ var min = blockG.outEdges(elem).reduce(function(acc, e) {
+ return Math.min(acc, xs[e.w] - blockG.edge(e));
+ }, Number.POSITIVE_INFINITY);
-// Common distance metrics for clustering algorithms
-var identity = function identity(x) {
- return x;
-};
-var absDiff = function absDiff(p, q) {
- return Math.abs(q - p);
-};
-var addAbsDiff = function addAbsDiff(total, p, q) {
- return total + absDiff(p, q);
-};
-var addSquaredDiff = function addSquaredDiff(total, p, q) {
- return total + Math.pow(q - p, 2);
-};
-var sqrt = function sqrt(x) {
- return Math.sqrt(x);
-};
-var maxAbsDiff = function maxAbsDiff(currentMax, p, q) {
- return Math.max(currentMax, absDiff(p, q));
-};
-var getDistance = function getDistance(length, getP, getQ, init, visit) {
- var post = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : identity;
- var ret = init;
- var p, q;
- for (var dim = 0; dim < length; dim++) {
- p = getP(dim);
- q = getQ(dim);
- ret = visit(ret, p, q);
- }
- return post(ret);
-};
-var distances = {
- euclidean: function euclidean(length, getP, getQ) {
- if (length >= 2) {
- return getDistance(length, getP, getQ, 0, addSquaredDiff, sqrt);
- } else {
- // for single attr case, more efficient to avoid sqrt
- return getDistance(length, getP, getQ, 0, addAbsDiff);
+ var node = g.node(elem);
+ if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
+ xs[elem] = Math.max(xs[elem], min);
}
- },
- squaredEuclidean: function squaredEuclidean(length, getP, getQ) {
- return getDistance(length, getP, getQ, 0, addSquaredDiff);
- },
- manhattan: function manhattan(length, getP, getQ) {
- return getDistance(length, getP, getQ, 0, addAbsDiff);
- },
- max: function max(length, getP, getQ) {
- return getDistance(length, getP, getQ, -Infinity, maxAbsDiff);
}
-};
-// in case the user accidentally doesn't use camel case
-distances['squared-euclidean'] = distances['squaredEuclidean'];
-distances['squaredeuclidean'] = distances['squaredEuclidean'];
-function clusteringDistance (method, length, getP, getQ, nodeP, nodeQ) {
- var impl;
- if (fn$6(method)) {
- impl = method;
- } else {
- impl = distances[method] || distances.euclidean;
- }
- if (length === 0 && fn$6(method)) {
- return impl(nodeP, nodeQ);
- } else {
- return impl(length, getP, getQ, nodeP, nodeQ);
- }
-}
+ iterate(pass1, blockG.predecessors.bind(blockG));
+ iterate(pass2, blockG.successors.bind(blockG));
-var defaults$b = defaults$g({
- k: 2,
- m: 2,
- sensitivityThreshold: 0.0001,
- distance: 'euclidean',
- maxIterations: 10,
- attributes: [],
- testMode: false,
- testCentroids: null
-});
-var setOptions$2 = function setOptions(options) {
- return defaults$b(options);
-};
+ // Assign x coordinates to all nodes
+ _.forEach(align, function(v) {
+ xs[v] = xs[root[v]];
+ });
-var getDist = function getDist(type, node, centroid, attributes, mode) {
- var noNodeP = mode !== 'kMedoids';
- var getP = noNodeP ? function (i) {
- return centroid[i];
- } : function (i) {
- return attributes[i](centroid);
- };
- var getQ = function getQ(i) {
- return attributes[i](node);
- };
- var nodeP = centroid;
- var nodeQ = node;
- return clusteringDistance(type, attributes.length, getP, getQ, nodeP, nodeQ);
-};
-var randomCentroids = function randomCentroids(nodes, k, attributes) {
- var ndim = attributes.length;
- var min = new Array(ndim);
- var max = new Array(ndim);
- var centroids = new Array(k);
- var centroid = null;
+ return xs;
+}
- // Find min, max values for each attribute dimension
- for (var i = 0; i < ndim; i++) {
- min[i] = nodes.min(attributes[i]).value;
- max[i] = nodes.max(attributes[i]).value;
- }
- // Build k centroids, each represented as an n-dim feature vector
- for (var c = 0; c < k; c++) {
- centroid = [];
- for (var _i = 0; _i < ndim; _i++) {
- centroid[_i] = Math.random() * (max[_i] - min[_i]) + min[_i]; // random initial value
- }
+function buildBlockGraph(g, layering, root, reverseSep) {
+ var blockGraph = new Graph(),
+ graphLabel = g.graph(),
+ sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
- centroids[c] = centroid;
- }
- return centroids;
-};
-var classify = function classify(node, centroids, distance, attributes, type) {
- var min = Infinity;
- var index = 0;
- for (var i = 0; i < centroids.length; i++) {
- var dist = getDist(distance, node, centroids[i], attributes, type);
- if (dist < min) {
- min = dist;
- index = i;
- }
- }
- return index;
-};
-var buildCluster = function buildCluster(centroid, nodes, assignment) {
- var cluster = [];
- var node = null;
- for (var n = 0; n < nodes.length; n++) {
- node = nodes[n];
- if (assignment[node.id()] === centroid) {
- //console.log("Node " + node.id() + " is associated with medoid #: " + m);
- cluster.push(node);
- }
- }
- return cluster;
-};
-var haveValuesConverged = function haveValuesConverged(v1, v2, sensitivityThreshold) {
- return Math.abs(v2 - v1) <= sensitivityThreshold;
-};
-var haveMatricesConverged = function haveMatricesConverged(v1, v2, sensitivityThreshold) {
- for (var i = 0; i < v1.length; i++) {
- for (var j = 0; j < v1[i].length; j++) {
- var diff = Math.abs(v1[i][j] - v2[i][j]);
- if (diff > sensitivityThreshold) {
- return false;
+ _.forEach(layering, function(layer) {
+ var u;
+ _.forEach(layer, function(v) {
+ var vRoot = root[v];
+ blockGraph.setNode(vRoot);
+ if (u) {
+ var uRoot = root[u],
+ prevMax = blockGraph.edge(uRoot, vRoot);
+ blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
}
- }
- }
- return true;
-};
-var seenBefore = function seenBefore(node, medoids, n) {
- for (var i = 0; i < n; i++) {
- if (node === medoids[i]) return true;
- }
- return false;
-};
-var randomMedoids = function randomMedoids(nodes, k) {
- var medoids = new Array(k);
+ u = v;
+ });
+ });
- // For small data sets, the probability of medoid conflict is greater,
- // so we need to check to see if we've already seen or chose this node before.
- if (nodes.length < 50) {
- // Randomly select k medoids from the n nodes
- for (var i = 0; i < k; i++) {
- var node = nodes[Math.floor(Math.random() * nodes.length)];
+ return blockGraph;
+}
- // If we've already chosen this node to be a medoid, don't choose it again (for small data sets).
- // Instead choose a different random node.
- while (seenBefore(node, medoids, i)) {
- node = nodes[Math.floor(Math.random() * nodes.length)];
- }
- medoids[i] = node;
- }
- } else {
- // Relatively large data set, so pretty safe to not check and just select random nodes
- for (var _i2 = 0; _i2 < k; _i2++) {
- medoids[_i2] = nodes[Math.floor(Math.random() * nodes.length)];
- }
- }
- return medoids;
-};
-var findCost = function findCost(potentialNewMedoid, cluster, attributes) {
- var cost = 0;
- for (var n = 0; n < cluster.length; n++) {
- cost += getDist('manhattan', cluster[n], potentialNewMedoid, attributes, 'kMedoids');
- }
- return cost;
-};
-var kMeans = function kMeans(options) {
- var cy = this.cy();
- var nodes = this.nodes();
- var node = null;
+/*
+ * Returns the alignment that has the smallest width of the given alignments.
+ */
+function findSmallestWidthAlignment(g, xss) {
+ return _.minBy(_.values(xss), function (xs) {
+ var max = Number.NEGATIVE_INFINITY;
+ var min = Number.POSITIVE_INFINITY;
- // Set parameters of algorithm: # of clusters, distance metric, etc.
- var opts = setOptions$2(options);
+ _.forIn(xs, function (x, v) {
+ var halfWidth = width(g, v) / 2;
- // Begin k-means algorithm
- var clusters = new Array(opts.k);
- var assignment = {};
- var centroids;
+ max = Math.max(x + halfWidth, max);
+ min = Math.min(x - halfWidth, min);
+ });
- // Step 1: Initialize centroid positions
- if (opts.testMode) {
- if (typeof opts.testCentroids === 'number') {
- // TODO: implement a seeded random number generator.
- opts.testCentroids;
- centroids = randomCentroids(nodes, opts.k, opts.attributes);
- } else if (_typeof(opts.testCentroids) === 'object') {
- centroids = opts.testCentroids;
- } else {
- centroids = randomCentroids(nodes, opts.k, opts.attributes);
- }
- } else {
- centroids = randomCentroids(nodes, opts.k, opts.attributes);
- }
- var isStillMoving = true;
- var iterations = 0;
- while (isStillMoving && iterations < opts.maxIterations) {
- // Step 2: Assign nodes to the nearest centroid
- for (var n = 0; n < nodes.length; n++) {
- node = nodes[n];
- // Determine which cluster this node belongs to: node id => cluster #
- assignment[node.id()] = classify(node, centroids, opts.distance, opts.attributes, 'kMeans');
- }
+ return max - min;
+ });
+}
- // Step 3: For each of the k clusters, update its centroid
- isStillMoving = false;
- for (var c = 0; c < opts.k; c++) {
- // Get all nodes that belong to this cluster
- var cluster = buildCluster(c, nodes, assignment);
- if (cluster.length === 0) {
- // If cluster is empty, break out early & move to next cluster
- continue;
- }
+/*
+ * Align the coordinates of each of the layout alignments such that
+ * left-biased alignments have their minimum coordinate at the same point as
+ * the minimum coordinate of the smallest width alignment and right-biased
+ * alignments have their maximum coordinate at the same point as the maximum
+ * coordinate of the smallest width alignment.
+ */
+function alignCoordinates(xss, alignTo) {
+ var alignToVals = _.values(alignTo),
+ alignToMin = _.min(alignToVals),
+ alignToMax = _.max(alignToVals);
- // Update centroids by calculating avg of all nodes within the cluster.
- var ndim = opts.attributes.length;
- var centroid = centroids[c]; // [ dim_1, dim_2, dim_3, ... , dim_n ]
- var newCentroid = new Array(ndim);
- var sum = new Array(ndim);
- for (var d = 0; d < ndim; d++) {
- sum[d] = 0.0;
- for (var i = 0; i < cluster.length; i++) {
- node = cluster[i];
- sum[d] += opts.attributes[d](node);
- }
- newCentroid[d] = sum[d] / cluster.length;
+ _.forEach(["u", "d"], function(vert) {
+ _.forEach(["l", "r"], function(horiz) {
+ var alignment = vert + horiz,
+ xs = xss[alignment],
+ delta;
+ if (xs === alignTo) return;
- // Check to see if algorithm has converged, i.e. when centroids no longer change
- if (!haveValuesConverged(newCentroid[d], centroid[d], opts.sensitivityThreshold)) {
- isStillMoving = true;
- }
- }
- centroids[c] = newCentroid;
- clusters[c] = cy.collection(cluster);
- }
- iterations++;
- }
- return clusters;
-};
-var kMedoids = function kMedoids(options) {
- var cy = this.cy();
- var nodes = this.nodes();
- var node = null;
- var opts = setOptions$2(options);
+ var xsVals = _.values(xs);
+ delta = horiz === "l" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);
- // Begin k-medoids algorithm
- var clusters = new Array(opts.k);
- var medoids;
- var assignment = {};
- var curCost;
- var minCosts = new Array(opts.k); // minimum cost configuration for each cluster
+ if (delta) {
+ xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });
+ }
+ });
+ });
+}
- // Step 1: Initialize k medoids
- if (opts.testMode) {
- if (typeof opts.testCentroids === 'number') ; else if (_typeof(opts.testCentroids) === 'object') {
- medoids = opts.testCentroids;
+function balance(xss, align) {
+ return _.mapValues(xss.ul, function(ignore, v) {
+ if (align) {
+ return xss[align.toLowerCase()][v];
} else {
- medoids = randomMedoids(nodes, opts.k);
- }
- } else {
- medoids = randomMedoids(nodes, opts.k);
- }
- var isStillMoving = true;
- var iterations = 0;
- while (isStillMoving && iterations < opts.maxIterations) {
- // Step 2: Assign nodes to the nearest medoid
- for (var n = 0; n < nodes.length; n++) {
- node = nodes[n];
- // Determine which cluster this node belongs to: node id => cluster #
- assignment[node.id()] = classify(node, medoids, opts.distance, opts.attributes, 'kMedoids');
+ var xs = _.sortBy(_.map(xss, v));
+ return (xs[1] + xs[2]) / 2;
}
- isStillMoving = false;
- // Step 3: For each medoid m, and for each node associated with mediod m,
- // select the node with the lowest configuration cost as new medoid.
- for (var m = 0; m < medoids.length; m++) {
- // Get all nodes that belong to this medoid
- var cluster = buildCluster(m, nodes, assignment);
- if (cluster.length === 0) {
- // If cluster is empty, break out early & move to next cluster
- continue;
+ });
+}
+
+function positionX(g) {
+ var layering = util.buildLayerMatrix(g);
+ var conflicts = _.merge(
+ findType1Conflicts(g, layering),
+ findType2Conflicts(g, layering));
+
+ var xss = {};
+ var adjustedLayering;
+ _.forEach(["u", "d"], function(vert) {
+ adjustedLayering = vert === "u" ? layering : _.values(layering).reverse();
+ _.forEach(["l", "r"], function(horiz) {
+ if (horiz === "r") {
+ adjustedLayering = _.map(adjustedLayering, function(inner) {
+ return _.values(inner).reverse();
+ });
}
- minCosts[m] = findCost(medoids[m], cluster, opts.attributes); // original cost
- // Select different medoid if its configuration has the lowest cost
- for (var _n = 0; _n < cluster.length; _n++) {
- curCost = findCost(cluster[_n], cluster, opts.attributes);
- if (curCost < minCosts[m]) {
- minCosts[m] = curCost;
- medoids[m] = cluster[_n];
- isStillMoving = true;
- }
+ var neighborFn = (vert === "u" ? g.predecessors : g.successors).bind(g);
+ var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+ var xs = horizontalCompaction(g, adjustedLayering,
+ align.root, align.align, horiz === "r");
+ if (horiz === "r") {
+ xs = _.mapValues(xs, function(x) { return -x; });
}
- clusters[m] = cy.collection(cluster);
- }
- iterations++;
- }
- return clusters;
-};
-var updateCentroids = function updateCentroids(centroids, nodes, U, weight, opts) {
- var numerator, denominator;
- for (var n = 0; n < nodes.length; n++) {
- for (var c = 0; c < centroids.length; c++) {
- weight[n][c] = Math.pow(U[n][c], opts.m);
- }
- }
- for (var _c = 0; _c < centroids.length; _c++) {
- for (var dim = 0; dim < opts.attributes.length; dim++) {
- numerator = 0;
- denominator = 0;
- for (var _n2 = 0; _n2 < nodes.length; _n2++) {
- numerator += weight[_n2][_c] * opts.attributes[dim](nodes[_n2]);
- denominator += weight[_n2][_c];
+ xss[vert + horiz] = xs;
+ });
+ });
+
+ var smallestWidth = findSmallestWidthAlignment(g, xss);
+ alignCoordinates(xss, smallestWidth);
+ return balance(xss, g.graph().align);
+}
+
+function sep(nodeSep, edgeSep, reverseSep) {
+ return function(g, v, w) {
+ var vLabel = g.node(v);
+ var wLabel = g.node(w);
+ var sum = 0;
+ var delta;
+
+ sum += vLabel.width / 2;
+ if (_.has(vLabel, "labelpos")) {
+ switch (vLabel.labelpos.toLowerCase()) {
+ case "l": delta = -vLabel.width / 2; break;
+ case "r": delta = vLabel.width / 2; break;
}
- centroids[_c][dim] = numerator / denominator;
}
- }
-};
-var updateMembership = function updateMembership(U, _U, centroids, nodes, opts) {
- // Save previous step
- for (var i = 0; i < U.length; i++) {
- _U[i] = U[i].slice();
- }
- var sum, numerator, denominator;
- var pow = 2 / (opts.m - 1);
- for (var c = 0; c < centroids.length; c++) {
- for (var n = 0; n < nodes.length; n++) {
- sum = 0;
- for (var k = 0; k < centroids.length; k++) {
- // against all other centroids
- numerator = getDist(opts.distance, nodes[n], centroids[c], opts.attributes, 'cmeans');
- denominator = getDist(opts.distance, nodes[n], centroids[k], opts.attributes, 'cmeans');
- sum += Math.pow(numerator / denominator, pow);
- }
- U[n][c] = 1 / sum;
+ if (delta) {
+ sum += reverseSep ? delta : -delta;
}
- }
-};
-var assign$1 = function assign(nodes, U, opts, cy) {
- var clusters = new Array(opts.k);
- for (var c = 0; c < clusters.length; c++) {
- clusters[c] = [];
- }
- var max;
- var index;
- for (var n = 0; n < U.length; n++) {
- // for each node (U is N x C matrix)
- max = -Infinity;
- index = -1;
- // Determine which cluster the node is most likely to belong in
- for (var _c2 = 0; _c2 < U[0].length; _c2++) {
- if (U[n][_c2] > max) {
- max = U[n][_c2];
- index = _c2;
+ delta = 0;
+
+ sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
+ sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
+
+ sum += wLabel.width / 2;
+ if (_.has(wLabel, "labelpos")) {
+ switch (wLabel.labelpos.toLowerCase()) {
+ case "l": delta = wLabel.width / 2; break;
+ case "r": delta = -wLabel.width / 2; break;
}
}
- clusters[index].push(nodes[n]);
- }
+ if (delta) {
+ sum += reverseSep ? delta : -delta;
+ }
+ delta = 0;
- // Turn every array into a collection of nodes
- for (var _c3 = 0; _c3 < clusters.length; _c3++) {
- clusters[_c3] = cy.collection(clusters[_c3]);
- }
- return clusters;
-};
-var fuzzyCMeans = function fuzzyCMeans(options) {
- var cy = this.cy();
- var nodes = this.nodes();
- var opts = setOptions$2(options);
+ return sum;
+ };
+}
- // Begin fuzzy c-means algorithm
- var clusters;
- var centroids;
- var U;
- var _U;
- var weight;
+function width(g, v) {
+ return g.node(v).width;
+}
- // Step 1: Initialize letiables.
- _U = new Array(nodes.length);
- for (var i = 0; i < nodes.length; i++) {
- // N x C matrix
- _U[i] = new Array(opts.k);
- }
- U = new Array(nodes.length);
- for (var _i3 = 0; _i3 < nodes.length; _i3++) {
- // N x C matrix
- U[_i3] = new Array(opts.k);
- }
- for (var _i4 = 0; _i4 < nodes.length; _i4++) {
- var total = 0;
- for (var j = 0; j < opts.k; j++) {
- U[_i4][j] = Math.random();
- total += U[_i4][j];
- }
- for (var _j = 0; _j < opts.k; _j++) {
- U[_i4][_j] = U[_i4][_j] / total;
- }
- }
- centroids = new Array(opts.k);
- for (var _i5 = 0; _i5 < opts.k; _i5++) {
- centroids[_i5] = new Array(opts.attributes.length);
- }
- weight = new Array(nodes.length);
- for (var _i6 = 0; _i6 < nodes.length; _i6++) {
- // N x C matrix
- weight[_i6] = new Array(opts.k);
- }
- // end init FCM
- var isStillMoving = true;
- var iterations = 0;
- while (isStillMoving && iterations < opts.maxIterations) {
- isStillMoving = false;
+/***/ }),
- // Step 2: Calculate the centroids for each step.
- updateCentroids(centroids, nodes, U, weight, opts);
+/***/ "./node_modules/dagre/lib/position/index.js":
+/*!**************************************************!*\
+ !*** ./node_modules/dagre/lib/position/index.js ***!
+ \**************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Step 3: Update the partition matrix U.
- updateMembership(U, _U, centroids, nodes, opts);
+"use strict";
- // Step 4: Check for convergence.
- if (!haveMatricesConverged(U, _U, opts.sensitivityThreshold)) {
- isStillMoving = true;
- }
- iterations++;
- }
- // Assign nodes to clusters with highest probability.
- clusters = assign$1(nodes, U, opts, cy);
- return {
- clusters: clusters,
- degreeOfMembership: U
- };
-};
-var kClustering = {
- kMeans: kMeans,
- kMedoids: kMedoids,
- fuzzyCMeans: fuzzyCMeans,
- fcm: fuzzyCMeans
-};
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
+var positionX = (__webpack_require__(/*! ./bk */ "./node_modules/dagre/lib/position/bk.js").positionX);
-// Implemented by Zoe Xi @zoexi for GSOC 2016
-var defaults$a = defaults$g({
- distance: 'euclidean',
- // distance metric to compare nodes
- linkage: 'min',
- // linkage criterion : how to determine the distance between clusters of nodes
- mode: 'threshold',
- // mode:'threshold' => clusters must be threshold distance apart
- threshold: Infinity,
- // the distance threshold
- // mode:'dendrogram' => the nodes are organised as leaves in a tree (siblings are close), merging makes clusters
- addDendrogram: false,
- // whether to add the dendrogram to the graph for viz
- dendrogramDepth: 0,
- // depth at which dendrogram branches are merged into the returned clusters
- attributes: [] // array of attr functions
-});
+module.exports = position;
-var linkageAliases = {
- 'single': 'min',
- 'complete': 'max'
-};
-var setOptions$1 = function setOptions(options) {
- var opts = defaults$a(options);
- var preferredAlias = linkageAliases[opts.linkage];
- if (preferredAlias != null) {
- opts.linkage = preferredAlias;
- }
- return opts;
-};
-var mergeClosest = function mergeClosest(clusters, index, dists, mins, opts) {
- // Find two closest clusters from cached mins
- var minKey = 0;
- var min = Infinity;
- var dist;
- var attrs = opts.attributes;
- var getDist = function getDist(n1, n2) {
- return clusteringDistance(opts.distance, attrs.length, function (i) {
- return attrs[i](n1);
- }, function (i) {
- return attrs[i](n2);
- }, n1, n2);
- };
- for (var i = 0; i < clusters.length; i++) {
- var key = clusters[i].key;
- var _dist = dists[key][mins[key]];
- if (_dist < min) {
- minKey = key;
- min = _dist;
- }
- }
- if (opts.mode === 'threshold' && min >= opts.threshold || opts.mode === 'dendrogram' && clusters.length === 1) {
- return false;
- }
- var c1 = index[minKey];
- var c2 = index[mins[minKey]];
- var merged;
-
- // Merge two closest clusters
- if (opts.mode === 'dendrogram') {
- merged = {
- left: c1,
- right: c2,
- key: c1.key
- };
- } else {
- merged = {
- value: c1.value.concat(c2.value),
- key: c1.key
- };
- }
- clusters[c1.index] = merged;
- clusters.splice(c2.index, 1);
- index[c1.key] = merged;
-
- // Update distances with new merged cluster
- for (var _i = 0; _i < clusters.length; _i++) {
- var cur = clusters[_i];
- if (c1.key === cur.key) {
- dist = Infinity;
- } else if (opts.linkage === 'min') {
- dist = dists[c1.key][cur.key];
- if (dists[c1.key][cur.key] > dists[c2.key][cur.key]) {
- dist = dists[c2.key][cur.key];
- }
- } else if (opts.linkage === 'max') {
- dist = dists[c1.key][cur.key];
- if (dists[c1.key][cur.key] < dists[c2.key][cur.key]) {
- dist = dists[c2.key][cur.key];
- }
- } else if (opts.linkage === 'mean') {
- dist = (dists[c1.key][cur.key] * c1.size + dists[c2.key][cur.key] * c2.size) / (c1.size + c2.size);
- } else {
- if (opts.mode === 'dendrogram') dist = getDist(cur.value, c1.value);else dist = getDist(cur.value[0], c1.value[0]);
- }
- dists[c1.key][cur.key] = dists[cur.key][c1.key] = dist; // distance matrix is symmetric
- }
+function position(g) {
+ g = util.asNonCompoundGraph(g);
- // Update cached mins
- for (var _i2 = 0; _i2 < clusters.length; _i2++) {
- var key1 = clusters[_i2].key;
- if (mins[key1] === c1.key || mins[key1] === c2.key) {
- var _min = key1;
- for (var j = 0; j < clusters.length; j++) {
- var key2 = clusters[j].key;
- if (dists[key1][key2] < dists[key1][_min]) {
- _min = key2;
- }
- }
- mins[key1] = _min;
- }
- clusters[_i2].index = _i2;
- }
+ positionY(g);
+ _.forEach(positionX(g), function(x, v) {
+ g.node(v).x = x;
+ });
+}
- // Clean up meta data used for clustering
- c1.key = c2.key = c1.index = c2.index = null;
- return true;
-};
-var getAllChildren = function getAllChildren(root, arr, cy) {
- if (!root) return;
- if (root.value) {
- arr.push(root.value);
- } else {
- if (root.left) getAllChildren(root.left, arr);
- if (root.right) getAllChildren(root.right, arr);
- }
-};
-var buildDendrogram = function buildDendrogram(root, cy) {
- if (!root) return '';
- if (root.left && root.right) {
- var leftStr = buildDendrogram(root.left, cy);
- var rightStr = buildDendrogram(root.right, cy);
- var node = cy.add({
- group: 'nodes',
- data: {
- id: leftStr + ',' + rightStr
- }
- });
- cy.add({
- group: 'edges',
- data: {
- source: leftStr,
- target: node.id()
- }
- });
- cy.add({
- group: 'edges',
- data: {
- source: rightStr,
- target: node.id()
- }
+function positionY(g) {
+ var layering = util.buildLayerMatrix(g);
+ var rankSep = g.graph().ranksep;
+ var prevY = 0;
+ _.forEach(layering, function(layer) {
+ var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));
+ _.forEach(layer, function(v) {
+ g.node(v).y = prevY + maxHeight / 2;
});
- return node.id();
- } else if (root.value) {
- return root.value.id();
- }
-};
-var buildClustersFromTree = function buildClustersFromTree(root, k, cy) {
- if (!root) return [];
- var left = [],
- right = [],
- leaves = [];
- if (k === 0) {
- // don't cut tree, simply return all nodes as 1 single cluster
- if (root.left) getAllChildren(root.left, left);
- if (root.right) getAllChildren(root.right, right);
- leaves = left.concat(right);
- return [cy.collection(leaves)];
- } else if (k === 1) {
- // cut at root
+ prevY += maxHeight + rankSep;
+ });
+}
- if (root.value) {
- // leaf node
- return [cy.collection(root.value)];
- } else {
- if (root.left) getAllChildren(root.left, left);
- if (root.right) getAllChildren(root.right, right);
- return [cy.collection(left), cy.collection(right)];
- }
- } else {
- if (root.value) {
- return [cy.collection(root.value)];
- } else {
- if (root.left) left = buildClustersFromTree(root.left, k - 1, cy);
- if (root.right) right = buildClustersFromTree(root.right, k - 1, cy);
- return left.concat(right);
- }
- }
-};
-var hierarchicalClustering = function hierarchicalClustering(options) {
- var cy = this.cy();
- var nodes = this.nodes();
- // Set parameters of algorithm: linkage type, distance metric, etc.
- var opts = setOptions$1(options);
- var attrs = opts.attributes;
- var getDist = function getDist(n1, n2) {
- return clusteringDistance(opts.distance, attrs.length, function (i) {
- return attrs[i](n1);
- }, function (i) {
- return attrs[i](n2);
- }, n1, n2);
- };
+/***/ }),
- // Begin hierarchical algorithm
- var clusters = [];
- var dists = []; // distances between each pair of clusters
- var mins = []; // closest cluster for each cluster
- var index = []; // hash of all clusters by key
+/***/ "./node_modules/dagre/lib/rank/feasible-tree.js":
+/*!******************************************************!*\
+ !*** ./node_modules/dagre/lib/rank/feasible-tree.js ***!
+ \******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // In agglomerative (bottom-up) clustering, each node starts as its own cluster
- for (var n = 0; n < nodes.length; n++) {
- var cluster = {
- value: opts.mode === 'dendrogram' ? nodes[n] : [nodes[n]],
- key: n,
- index: n
- };
- clusters[n] = cluster;
- index[n] = cluster;
- dists[n] = [];
- mins[n] = 0;
- }
+"use strict";
- // Calculate the distance between each pair of clusters
- for (var i = 0; i < clusters.length; i++) {
- for (var j = 0; j <= i; j++) {
- var dist = void 0;
- if (opts.mode === 'dendrogram') {
- // modes store cluster values differently
- dist = i === j ? Infinity : getDist(clusters[i].value, clusters[j].value);
- } else {
- dist = i === j ? Infinity : getDist(clusters[i].value[0], clusters[j].value[0]);
- }
- dists[i][j] = dist;
- dists[j][i] = dist;
- if (dist < dists[i][mins[i]]) {
- mins[i] = j; // Cache mins: closest cluster to cluster i is cluster j
- }
- }
- }
- // Find the closest pair of clusters and merge them into a single cluster.
- // Update distances between new cluster and each of the old clusters, and loop until threshold reached.
- var merged = mergeClosest(clusters, index, dists, mins, opts);
- while (merged) {
- merged = mergeClosest(clusters, index, dists, mins, opts);
- }
- var retClusters;
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+var slack = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").slack);
- // Dendrogram mode builds the hierarchy and adds intermediary nodes + edges
- // in addition to returning the clusters.
- if (opts.mode === 'dendrogram') {
- retClusters = buildClustersFromTree(clusters[0], opts.dendrogramDepth, cy);
- if (opts.addDendrogram) buildDendrogram(clusters[0], cy);
- } else {
- // Regular mode simply returns the clusters
+module.exports = feasibleTree;
- retClusters = new Array(clusters.length);
- clusters.forEach(function (cluster, i) {
- // Clean up meta data used for clustering
- cluster.key = cluster.index = null;
- retClusters[i] = cy.collection(cluster.value);
- });
- }
- return retClusters;
-};
-var hierarchicalClustering$1 = {
- hierarchicalClustering: hierarchicalClustering,
- hca: hierarchicalClustering
-};
+/*
+ * Constructs a spanning tree with tight edges and adjusted the input node's
+ * ranks to achieve this. A tight edge is one that is has a length that matches
+ * its "minlen" attribute.
+ *
+ * The basic structure for this function is derived from Gansner, et al., "A
+ * Technique for Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ * 1. Graph must be a DAG.
+ * 2. Graph must be connected.
+ * 3. Graph must have at least one node.
+ * 5. Graph nodes must have been previously assigned a "rank" property that
+ * respects the "minlen" property of incident edges.
+ * 6. Graph edges must have a "minlen" property.
+ *
+ * Post-conditions:
+ *
+ * - Graph nodes will have their rank adjusted to ensure that all edges are
+ * tight.
+ *
+ * Returns a tree (undirected graph) that is constructed using only "tight"
+ * edges.
+ */
+function feasibleTree(g) {
+ var t = new Graph({ directed: false });
-// Implemented by Zoe Xi @zoexi for GSOC 2016
-var defaults$9 = defaults$g({
- distance: 'euclidean',
- // distance metric to compare attributes between two nodes
- preference: 'median',
- // suitability of a data point to serve as an exemplar
- damping: 0.8,
- // damping factor between [0.5, 1)
- maxIterations: 1000,
- // max number of iterations to run
- minIterations: 100,
- // min number of iterations to run in order for clustering to stop
- attributes: [// functions to quantify the similarity between any two points
- // e.g. node => node.data('weight')
- ]
-});
-var setOptions = function setOptions(options) {
- var dmp = options.damping;
- var pref = options.preference;
- if (!(0.5 <= dmp && dmp < 1)) {
- error("Damping must range on [0.5, 1). Got: ".concat(dmp));
- }
- var validPrefs = ['median', 'mean', 'min', 'max'];
- if (!(validPrefs.some(function (v) {
- return v === pref;
- }) || number$1(pref))) {
- error("Preference must be one of [".concat(validPrefs.map(function (p) {
- return "'".concat(p, "'");
- }).join(', '), "] or a number. Got: ").concat(pref));
+ // Choose arbitrary node from which to start our tree
+ var start = g.nodes()[0];
+ var size = g.nodeCount();
+ t.setNode(start, {});
+
+ var edge, delta;
+ while (tightTree(t, g) < size) {
+ edge = findMinSlackEdge(t, g);
+ delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);
+ shiftRanks(t, g, delta);
}
- return defaults$9(options);
-};
-var getSimilarity = function getSimilarity(type, n1, n2, attributes) {
- var attr = function attr(n, i) {
- return attributes[i](n);
- };
+ return t;
+}
- // nb negative because similarity should have an inverse relationship to distance
- return -clusteringDistance(type, attributes.length, function (i) {
- return attr(n1, i);
- }, function (i) {
- return attr(n2, i);
- }, n1, n2);
-};
-var getPreference = function getPreference(S, preference) {
- // larger preference = greater # of clusters
- var p = null;
- if (preference === 'median') {
- p = median(S);
- } else if (preference === 'mean') {
- p = mean(S);
- } else if (preference === 'min') {
- p = min(S);
- } else if (preference === 'max') {
- p = max(S);
- } else {
- // Custom preference number, as set by user
- p = preference;
- }
- return p;
-};
-var findExemplars = function findExemplars(n, R, A) {
- var indices = [];
- for (var i = 0; i < n; i++) {
- if (R[i * n + i] + A[i * n + i] > 0) {
- indices.push(i);
- }
- }
- return indices;
-};
-var assignClusters = function assignClusters(n, S, exemplars) {
- var clusters = [];
- for (var i = 0; i < n; i++) {
- var index = -1;
- var max = -Infinity;
- for (var ei = 0; ei < exemplars.length; ei++) {
- var e = exemplars[ei];
- if (S[i * n + e] > max) {
- index = e;
- max = S[i * n + e];
- }
- }
- if (index > 0) {
- clusters.push(index);
- }
- }
- for (var _ei = 0; _ei < exemplars.length; _ei++) {
- clusters[exemplars[_ei]] = exemplars[_ei];
- }
- return clusters;
-};
-var assign = function assign(n, S, exemplars) {
- var clusters = assignClusters(n, S, exemplars);
- for (var ei = 0; ei < exemplars.length; ei++) {
- var ii = [];
- for (var c = 0; c < clusters.length; c++) {
- if (clusters[c] === exemplars[ei]) {
- ii.push(c);
- }
- }
- var maxI = -1;
- var maxSum = -Infinity;
- for (var i = 0; i < ii.length; i++) {
- var sum = 0;
- for (var j = 0; j < ii.length; j++) {
- sum += S[ii[j] * n + ii[i]];
- }
- if (sum > maxSum) {
- maxI = i;
- maxSum = sum;
+/*
+ * Finds a maximal tree of tight edges and returns the number of nodes in the
+ * tree.
+ */
+function tightTree(t, g) {
+ function dfs(v) {
+ _.forEach(g.nodeEdges(v), function(e) {
+ var edgeV = e.v,
+ w = (v === edgeV) ? e.w : edgeV;
+ if (!t.hasNode(w) && !slack(g, e)) {
+ t.setNode(w, {});
+ t.setEdge(v, w, {});
+ dfs(w);
}
- }
- exemplars[ei] = ii[maxI];
+ });
}
- clusters = assignClusters(n, S, exemplars);
- return clusters;
-};
-var affinityPropagation = function affinityPropagation(options) {
- var cy = this.cy();
- var nodes = this.nodes();
- var opts = setOptions(options);
- // Map each node to its position in node array
- var id2position = {};
- for (var i = 0; i < nodes.length; i++) {
- id2position[nodes[i].id()] = i;
- }
+ _.forEach(t.nodes(), dfs);
+ return t.nodeCount();
+}
- // Begin affinity propagation algorithm
+/*
+ * Finds the edge with the smallest slack that is incident on tree and returns
+ * it.
+ */
+function findMinSlackEdge(t, g) {
+ return _.minBy(g.edges(), function(e) {
+ if (t.hasNode(e.v) !== t.hasNode(e.w)) {
+ return slack(g, e);
+ }
+ });
+}
- var n; // number of data points
- var n2; // size of matrices
- var S; // similarity matrix (1D array)
- var p; // preference/suitability of a data point to serve as an exemplar
- var R; // responsibility matrix (1D array)
- var A; // availability matrix (1D array)
+function shiftRanks(t, g, delta) {
+ _.forEach(t.nodes(), function(v) {
+ g.node(v).rank += delta;
+ });
+}
- n = nodes.length;
- n2 = n * n;
- // Initialize and build S similarity matrix
- S = new Array(n2);
- for (var _i = 0; _i < n2; _i++) {
- S[_i] = -Infinity; // for cases where two data points shouldn't be linked together
- }
+/***/ }),
- for (var _i2 = 0; _i2 < n; _i2++) {
- for (var j = 0; j < n; j++) {
- if (_i2 !== j) {
- S[_i2 * n + j] = getSimilarity(opts.distance, nodes[_i2], nodes[j], opts.attributes);
- }
- }
- }
+/***/ "./node_modules/dagre/lib/rank/index.js":
+/*!**********************************************!*\
+ !*** ./node_modules/dagre/lib/rank/index.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Place preferences on the diagonal of S
- p = getPreference(S, opts.preference);
- for (var _i3 = 0; _i3 < n; _i3++) {
- S[_i3 * n + _i3] = p;
- }
+"use strict";
- // Initialize R responsibility matrix
- R = new Array(n2);
- for (var _i4 = 0; _i4 < n2; _i4++) {
- R[_i4] = 0.0;
- }
- // Initialize A availability matrix
- A = new Array(n2);
- for (var _i5 = 0; _i5 < n2; _i5++) {
- A[_i5] = 0.0;
- }
- var old = new Array(n);
- var Rp = new Array(n);
- var se = new Array(n);
- for (var _i6 = 0; _i6 < n; _i6++) {
- old[_i6] = 0.0;
- Rp[_i6] = 0.0;
- se[_i6] = 0;
- }
- var e = new Array(n * opts.minIterations);
- for (var _i7 = 0; _i7 < e.length; _i7++) {
- e[_i7] = 0;
- }
- var iter;
- for (iter = 0; iter < opts.maxIterations; iter++) {
- // main algorithmic loop
+var rankUtil = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js");
+var longestPath = rankUtil.longestPath;
+var feasibleTree = __webpack_require__(/*! ./feasible-tree */ "./node_modules/dagre/lib/rank/feasible-tree.js");
+var networkSimplex = __webpack_require__(/*! ./network-simplex */ "./node_modules/dagre/lib/rank/network-simplex.js");
- // Update R responsibility matrix
- for (var _i8 = 0; _i8 < n; _i8++) {
- var max = -Infinity,
- max2 = -Infinity,
- maxI = -1,
- AS = 0.0;
- for (var _j = 0; _j < n; _j++) {
- old[_j] = R[_i8 * n + _j];
- AS = A[_i8 * n + _j] + S[_i8 * n + _j];
- if (AS >= max) {
- max2 = max;
- max = AS;
- maxI = _j;
- } else if (AS > max2) {
- max2 = AS;
- }
- }
- for (var _j2 = 0; _j2 < n; _j2++) {
- R[_i8 * n + _j2] = (1 - opts.damping) * (S[_i8 * n + _j2] - max) + opts.damping * old[_j2];
- }
- R[_i8 * n + maxI] = (1 - opts.damping) * (S[_i8 * n + maxI] - max2) + opts.damping * old[maxI];
- }
-
- // Update A availability matrix
- for (var _i9 = 0; _i9 < n; _i9++) {
- var sum = 0;
- for (var _j3 = 0; _j3 < n; _j3++) {
- old[_j3] = A[_j3 * n + _i9];
- Rp[_j3] = Math.max(0, R[_j3 * n + _i9]);
- sum += Rp[_j3];
- }
- sum -= Rp[_i9];
- Rp[_i9] = R[_i9 * n + _i9];
- sum += Rp[_i9];
- for (var _j4 = 0; _j4 < n; _j4++) {
- A[_j4 * n + _i9] = (1 - opts.damping) * Math.min(0, sum - Rp[_j4]) + opts.damping * old[_j4];
- }
- A[_i9 * n + _i9] = (1 - opts.damping) * (sum - Rp[_i9]) + opts.damping * old[_i9];
- }
+module.exports = rank;
- // Check for convergence
- var K = 0;
- for (var _i10 = 0; _i10 < n; _i10++) {
- var E = A[_i10 * n + _i10] + R[_i10 * n + _i10] > 0 ? 1 : 0;
- e[iter % opts.minIterations * n + _i10] = E;
- K += E;
- }
- if (K > 0 && (iter >= opts.minIterations - 1 || iter == opts.maxIterations - 1)) {
- var _sum = 0;
- for (var _i11 = 0; _i11 < n; _i11++) {
- se[_i11] = 0;
- for (var _j5 = 0; _j5 < opts.minIterations; _j5++) {
- se[_i11] += e[_j5 * n + _i11];
- }
- if (se[_i11] === 0 || se[_i11] === opts.minIterations) {
- _sum++;
- }
- }
- if (_sum === n) {
- // then we have convergence
- break;
- }
- }
+/*
+ * Assigns a rank to each node in the input graph that respects the "minlen"
+ * constraint specified on edges between nodes.
+ *
+ * This basic structure is derived from Gansner, et al., "A Technique for
+ * Drawing Directed Graphs."
+ *
+ * Pre-conditions:
+ *
+ * 1. Graph must be a connected DAG
+ * 2. Graph nodes must be objects
+ * 3. Graph edges must have "weight" and "minlen" attributes
+ *
+ * Post-conditions:
+ *
+ * 1. Graph nodes will have a "rank" attribute based on the results of the
+ * algorithm. Ranks can start at any index (including negative), we'll
+ * fix them up later.
+ */
+function rank(g) {
+ switch(g.graph().ranker) {
+ case "network-simplex": networkSimplexRanker(g); break;
+ case "tight-tree": tightTreeRanker(g); break;
+ case "longest-path": longestPathRanker(g); break;
+ default: networkSimplexRanker(g);
}
+}
- // Identify exemplars (cluster centers)
- var exemplarsIndices = findExemplars(n, R, A);
+// A fast and simple ranker, but results are far from optimal.
+var longestPathRanker = longestPath;
- // Assign nodes to clusters
- var clusterIndices = assign(n, S, exemplarsIndices);
- var clusters = {};
- for (var c = 0; c < exemplarsIndices.length; c++) {
- clusters[exemplarsIndices[c]] = [];
- }
- for (var _i12 = 0; _i12 < nodes.length; _i12++) {
- var pos = id2position[nodes[_i12].id()];
- var clusterIndex = clusterIndices[pos];
- if (clusterIndex != null) {
- // the node may have not been assigned a cluster if no valid attributes were specified
- clusters[clusterIndex].push(nodes[_i12]);
- }
- }
- var retClusters = new Array(exemplarsIndices.length);
- for (var _c = 0; _c < exemplarsIndices.length; _c++) {
- retClusters[_c] = cy.collection(clusters[exemplarsIndices[_c]]);
- }
- return retClusters;
-};
-var affinityPropagation$1 = {
- affinityPropagation: affinityPropagation,
- ap: affinityPropagation
-};
+function tightTreeRanker(g) {
+ longestPath(g);
+ feasibleTree(g);
+}
-var hierholzerDefaults = defaults$g({
- root: undefined,
- directed: false
-});
-var elesfn$k = {
- hierholzer: function hierholzer(options) {
- if (!plainObject(options)) {
- var args = arguments;
- options = {
- root: args[0],
- directed: args[1]
- };
- }
- var _hierholzerDefaults = hierholzerDefaults(options),
- root = _hierholzerDefaults.root,
- directed = _hierholzerDefaults.directed;
- var eles = this;
- var dflag = false;
- var oddIn;
- var oddOut;
- var startVertex;
- if (root) startVertex = string(root) ? this.filter(root)[0].id() : root[0].id();
- var nodes = {};
- var edges = {};
- if (directed) {
- eles.forEach(function (ele) {
- var id = ele.id();
- if (ele.isNode()) {
- var ind = ele.indegree(true);
- var outd = ele.outdegree(true);
- var d1 = ind - outd;
- var d2 = outd - ind;
- if (d1 == 1) {
- if (oddIn) dflag = true;else oddIn = id;
- } else if (d2 == 1) {
- if (oddOut) dflag = true;else oddOut = id;
- } else if (d2 > 1 || d1 > 1) {
- dflag = true;
- }
- nodes[id] = [];
- ele.outgoers().forEach(function (e) {
- if (e.isEdge()) nodes[id].push(e.id());
- });
- } else {
- edges[id] = [undefined, ele.target().id()];
- }
- });
- } else {
- eles.forEach(function (ele) {
- var id = ele.id();
- if (ele.isNode()) {
- var d = ele.degree(true);
- if (d % 2) {
- if (!oddIn) oddIn = id;else if (!oddOut) oddOut = id;else dflag = true;
- }
- nodes[id] = [];
- ele.connectedEdges().forEach(function (e) {
- return nodes[id].push(e.id());
- });
- } else {
- edges[id] = [ele.source().id(), ele.target().id()];
- }
- });
- }
- var result = {
- found: false,
- trail: undefined
- };
- if (dflag) return result;else if (oddOut && oddIn) {
- if (directed) {
- if (startVertex && oddOut != startVertex) {
- return result;
- }
- startVertex = oddOut;
- } else {
- if (startVertex && oddOut != startVertex && oddIn != startVertex) {
- return result;
- } else if (!startVertex) {
- startVertex = oddOut;
- }
- }
- } else {
- if (!startVertex) startVertex = eles[0].id();
- }
- var walk = function walk(v) {
- var currentNode = v;
- var subtour = [v];
- var adj, adjTail, adjHead;
- while (nodes[currentNode].length) {
- adj = nodes[currentNode].shift();
- adjTail = edges[adj][0];
- adjHead = edges[adj][1];
- if (currentNode != adjHead) {
- nodes[adjHead] = nodes[adjHead].filter(function (e) {
- return e != adj;
- });
- currentNode = adjHead;
- } else if (!directed && currentNode != adjTail) {
- nodes[adjTail] = nodes[adjTail].filter(function (e) {
- return e != adj;
- });
- currentNode = adjTail;
- }
- subtour.unshift(adj);
- subtour.unshift(currentNode);
- }
- return subtour;
- };
- var trail = [];
- var subtour = [];
- subtour = walk(startVertex);
- while (subtour.length != 1) {
- if (nodes[subtour[0]].length == 0) {
- trail.unshift(eles.getElementById(subtour.shift()));
- trail.unshift(eles.getElementById(subtour.shift()));
- } else {
- subtour = walk(subtour.shift()).concat(subtour);
- }
- }
- trail.unshift(eles.getElementById(subtour.shift())); // final node
+function networkSimplexRanker(g) {
+ networkSimplex(g);
+}
- for (var d in nodes) {
- if (nodes[d].length) {
- return result;
- }
- }
- result.found = true;
- result.trail = this.spawn(trail, true);
- return result;
- }
-};
-var hopcroftTarjanBiconnected = function hopcroftTarjanBiconnected() {
- var eles = this;
- var nodes = {};
- var id = 0;
- var edgeCount = 0;
- var components = [];
- var stack = [];
- var visitedEdges = {};
- var buildComponent = function buildComponent(x, y) {
- var i = stack.length - 1;
- var cutset = [];
- var component = eles.spawn();
- while (stack[i].x != x || stack[i].y != y) {
- cutset.push(stack.pop().edge);
- i--;
- }
- cutset.push(stack.pop().edge);
- cutset.forEach(function (edge) {
- var connectedNodes = edge.connectedNodes().intersection(eles);
- component.merge(edge);
- connectedNodes.forEach(function (node) {
- var nodeId = node.id();
- var connectedEdges = node.connectedEdges().intersection(eles);
- component.merge(node);
- if (!nodes[nodeId].cutVertex) {
- component.merge(connectedEdges);
- } else {
- component.merge(connectedEdges.filter(function (edge) {
- return edge.isLoop();
- }));
- }
- });
- });
- components.push(component);
- };
- var biconnectedSearch = function biconnectedSearch(root, currentNode, parent) {
- if (root === parent) edgeCount += 1;
- nodes[currentNode] = {
- id: id,
- low: id++,
- cutVertex: false
- };
- var edges = eles.getElementById(currentNode).connectedEdges().intersection(eles);
- if (edges.size() === 0) {
- components.push(eles.spawn(eles.getElementById(currentNode)));
- } else {
- var sourceId, targetId, otherNodeId, edgeId;
- edges.forEach(function (edge) {
- sourceId = edge.source().id();
- targetId = edge.target().id();
- otherNodeId = sourceId === currentNode ? targetId : sourceId;
- if (otherNodeId !== parent) {
- edgeId = edge.id();
- if (!visitedEdges[edgeId]) {
- visitedEdges[edgeId] = true;
- stack.push({
- x: currentNode,
- y: otherNodeId,
- edge: edge
- });
- }
- if (!(otherNodeId in nodes)) {
- biconnectedSearch(root, otherNodeId, currentNode);
- nodes[currentNode].low = Math.min(nodes[currentNode].low, nodes[otherNodeId].low);
- if (nodes[currentNode].id <= nodes[otherNodeId].low) {
- nodes[currentNode].cutVertex = true;
- buildComponent(currentNode, otherNodeId);
- }
- } else {
- nodes[currentNode].low = Math.min(nodes[currentNode].low, nodes[otherNodeId].id);
- }
- }
- });
- }
- };
- eles.forEach(function (ele) {
- if (ele.isNode()) {
- var nodeId = ele.id();
- if (!(nodeId in nodes)) {
- edgeCount = 0;
- biconnectedSearch(nodeId, nodeId);
- nodes[nodeId].cutVertex = edgeCount > 1;
- }
- }
- });
- var cutVertices = Object.keys(nodes).filter(function (id) {
- return nodes[id].cutVertex;
- }).map(function (id) {
- return eles.getElementById(id);
- });
- return {
- cut: eles.spawn(cutVertices),
- components: components
- };
-};
-var hopcroftTarjanBiconnected$1 = {
- hopcroftTarjanBiconnected: hopcroftTarjanBiconnected,
- htbc: hopcroftTarjanBiconnected,
- htb: hopcroftTarjanBiconnected,
- hopcroftTarjanBiconnectedComponents: hopcroftTarjanBiconnected
-};
+/***/ }),
-var tarjanStronglyConnected = function tarjanStronglyConnected() {
- var eles = this;
- var nodes = {};
- var index = 0;
- var components = [];
- var stack = [];
- var cut = eles.spawn(eles);
- var stronglyConnectedSearch = function stronglyConnectedSearch(sourceNodeId) {
- stack.push(sourceNodeId);
- nodes[sourceNodeId] = {
- index: index,
- low: index++,
- explored: false
- };
- var connectedEdges = eles.getElementById(sourceNodeId).connectedEdges().intersection(eles);
- connectedEdges.forEach(function (edge) {
- var targetNodeId = edge.target().id();
- if (targetNodeId !== sourceNodeId) {
- if (!(targetNodeId in nodes)) {
- stronglyConnectedSearch(targetNodeId);
- }
- if (!nodes[targetNodeId].explored) {
- nodes[sourceNodeId].low = Math.min(nodes[sourceNodeId].low, nodes[targetNodeId].low);
- }
- }
- });
- if (nodes[sourceNodeId].index === nodes[sourceNodeId].low) {
- var componentNodes = eles.spawn();
- for (;;) {
- var nodeId = stack.pop();
- componentNodes.merge(eles.getElementById(nodeId));
- nodes[nodeId].low = nodes[sourceNodeId].index;
- nodes[nodeId].explored = true;
- if (nodeId === sourceNodeId) {
- break;
- }
- }
- var componentEdges = componentNodes.edgesWith(componentNodes);
- var component = componentNodes.merge(componentEdges);
- components.push(component);
- cut = cut.difference(component);
- }
- };
- eles.forEach(function (ele) {
- if (ele.isNode()) {
- var nodeId = ele.id();
- if (!(nodeId in nodes)) {
- stronglyConnectedSearch(nodeId);
- }
- }
- });
- return {
- cut: cut,
- components: components
- };
-};
-var tarjanStronglyConnected$1 = {
- tarjanStronglyConnected: tarjanStronglyConnected,
- tsc: tarjanStronglyConnected,
- tscc: tarjanStronglyConnected,
- tarjanStronglyConnectedComponents: tarjanStronglyConnected
-};
+/***/ "./node_modules/dagre/lib/rank/network-simplex.js":
+/*!********************************************************!*\
+ !*** ./node_modules/dagre/lib/rank/network-simplex.js ***!
+ \********************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var elesfn$j = {};
-[elesfn$v, elesfn$u, elesfn$t, elesfn$s, elesfn$r, elesfn$q, elesfn$p, elesfn$o, elesfn$n, elesfn$m, elesfn$l, markovClustering$1, kClustering, hierarchicalClustering$1, affinityPropagation$1, elesfn$k, hopcroftTarjanBiconnected$1, tarjanStronglyConnected$1].forEach(function (props) {
- extend(elesfn$j, props);
-});
+"use strict";
-/*!
-Embeddable Minimum Strictly-Compliant Promises/A+ 1.1.1 Thenable
-Copyright (c) 2013-2014 Ralf S. Engelschall (http://engelschall.com)
-Licensed under The MIT License (http://opensource.org/licenses/MIT)
-*/
-/* promise states [Promises/A+ 2.1] */
-var STATE_PENDING = 0; /* [Promises/A+ 2.1.1] */
-var STATE_FULFILLED = 1; /* [Promises/A+ 2.1.2] */
-var STATE_REJECTED = 2; /* [Promises/A+ 2.1.3] */
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var feasibleTree = __webpack_require__(/*! ./feasible-tree */ "./node_modules/dagre/lib/rank/feasible-tree.js");
+var slack = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").slack);
+var initRank = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").longestPath);
+var preorder = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").alg).preorder;
+var postorder = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").alg).postorder;
+var simplify = (__webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js").simplify);
-/* promise object constructor */
-var api = function api(executor) {
- /* optionally support non-constructor/plain-function call */
- if (!(this instanceof api)) return new api(executor);
+module.exports = networkSimplex;
- /* initialize object */
- this.id = 'Thenable/1.0.7';
- this.state = STATE_PENDING; /* initial state */
- this.fulfillValue = undefined; /* initial value */ /* [Promises/A+ 1.3, 2.1.2.2] */
- this.rejectReason = undefined; /* initial reason */ /* [Promises/A+ 1.5, 2.1.3.2] */
- this.onFulfilled = []; /* initial handlers */
- this.onRejected = []; /* initial handlers */
+// Expose some internals for testing purposes
+networkSimplex.initLowLimValues = initLowLimValues;
+networkSimplex.initCutValues = initCutValues;
+networkSimplex.calcCutValue = calcCutValue;
+networkSimplex.leaveEdge = leaveEdge;
+networkSimplex.enterEdge = enterEdge;
+networkSimplex.exchangeEdges = exchangeEdges;
- /* provide optional information-hiding proxy */
- this.proxy = {
- then: this.then.bind(this)
- };
+/*
+ * The network simplex algorithm assigns ranks to each node in the input graph
+ * and iteratively improves the ranking to reduce the length of edges.
+ *
+ * Preconditions:
+ *
+ * 1. The input graph must be a DAG.
+ * 2. All nodes in the graph must have an object value.
+ * 3. All edges in the graph must have "minlen" and "weight" attributes.
+ *
+ * Postconditions:
+ *
+ * 1. All nodes in the graph will have an assigned "rank" attribute that has
+ * been optimized by the network simplex algorithm. Ranks start at 0.
+ *
+ *
+ * A rough sketch of the algorithm is as follows:
+ *
+ * 1. Assign initial ranks to each node. We use the longest path algorithm,
+ * which assigns ranks to the lowest position possible. In general this
+ * leads to very wide bottom ranks and unnecessarily long edges.
+ * 2. Construct a feasible tight tree. A tight tree is one such that all
+ * edges in the tree have no slack (difference between length of edge
+ * and minlen for the edge). This by itself greatly improves the assigned
+ * rankings by shorting edges.
+ * 3. Iteratively find edges that have negative cut values. Generally a
+ * negative cut value indicates that the edge could be removed and a new
+ * tree edge could be added to produce a more compact graph.
+ *
+ * Much of the algorithms here are derived from Gansner, et al., "A Technique
+ * for Drawing Directed Graphs." The structure of the file roughly follows the
+ * structure of the overall algorithm.
+ */
+function networkSimplex(g) {
+ g = simplify(g);
+ initRank(g);
+ var t = feasibleTree(g);
+ initLowLimValues(t);
+ initCutValues(t, g);
- /* support optional executor function */
- if (typeof executor === 'function') executor.call(this, this.fulfill.bind(this), this.reject.bind(this));
-};
+ var e, f;
+ while ((e = leaveEdge(t))) {
+ f = enterEdge(t, g, e);
+ exchangeEdges(t, g, e, f);
+ }
+}
-/* promise API methods */
-api.prototype = {
- /* promise resolving methods */
- fulfill: function fulfill(value) {
- return deliver(this, STATE_FULFILLED, 'fulfillValue', value);
- },
- reject: function reject(value) {
- return deliver(this, STATE_REJECTED, 'rejectReason', value);
- },
- /* "The then Method" [Promises/A+ 1.1, 1.2, 2.2] */
- then: function then(onFulfilled, onRejected) {
- var curr = this;
- var next = new api(); /* [Promises/A+ 2.2.7] */
- curr.onFulfilled.push(resolver(onFulfilled, next, 'fulfill')); /* [Promises/A+ 2.2.2/2.2.6] */
- curr.onRejected.push(resolver(onRejected, next, 'reject')); /* [Promises/A+ 2.2.3/2.2.6] */
- execute(curr);
- return next.proxy; /* [Promises/A+ 2.2.7, 3.3] */
- }
-};
+/*
+ * Initializes cut values for all edges in the tree.
+ */
+function initCutValues(t, g) {
+ var vs = postorder(t, t.nodes());
+ vs = vs.slice(0, vs.length - 1);
+ _.forEach(vs, function(v) {
+ assignCutValue(t, g, v);
+ });
+}
-/* deliver an action */
-var deliver = function deliver(curr, state, name, value) {
- if (curr.state === STATE_PENDING) {
- curr.state = state; /* [Promises/A+ 2.1.2.1, 2.1.3.1] */
- curr[name] = value; /* [Promises/A+ 2.1.2.2, 2.1.3.2] */
- execute(curr);
- }
- return curr;
-};
+function assignCutValue(t, g, child) {
+ var childLab = t.node(child);
+ var parent = childLab.parent;
+ t.edge(child, parent).cutvalue = calcCutValue(t, g, child);
+}
-/* execute all handlers */
-var execute = function execute(curr) {
- if (curr.state === STATE_FULFILLED) execute_handlers(curr, 'onFulfilled', curr.fulfillValue);else if (curr.state === STATE_REJECTED) execute_handlers(curr, 'onRejected', curr.rejectReason);
-};
+/*
+ * Given the tight tree, its graph, and a child in the graph calculate and
+ * return the cut value for the edge between the child and its parent.
+ */
+function calcCutValue(t, g, child) {
+ var childLab = t.node(child);
+ var parent = childLab.parent;
+ // True if the child is on the tail end of the edge in the directed graph
+ var childIsTail = true;
+ // The graph's view of the tree edge we're inspecting
+ var graphEdge = g.edge(child, parent);
+ // The accumulated cut value for the edge between this node and its parent
+ var cutValue = 0;
-/* execute particular set of handlers */
-var execute_handlers = function execute_handlers(curr, name, value) {
- /* global setImmediate: true */
- /* global setTimeout: true */
+ if (!graphEdge) {
+ childIsTail = false;
+ graphEdge = g.edge(parent, child);
+ }
- /* short-circuit processing */
- if (curr[name].length === 0) return;
+ cutValue = graphEdge.weight;
- /* iterate over all handlers, exactly once */
- var handlers = curr[name];
- curr[name] = []; /* [Promises/A+ 2.2.2.3, 2.2.3.3] */
- var func = function func() {
- for (var i = 0; i < handlers.length; i++) {
- handlers[i](value);
- } /* [Promises/A+ 2.2.5] */
- };
+ _.forEach(g.nodeEdges(child), function(e) {
+ var isOutEdge = e.v === child,
+ other = isOutEdge ? e.w : e.v;
- /* execute procedure asynchronously */ /* [Promises/A+ 2.2.4, 3.1] */
- if (typeof setImmediate === 'function') setImmediate(func);else setTimeout(func, 0);
-};
+ if (other !== parent) {
+ var pointsToHead = isOutEdge === childIsTail,
+ otherWeight = g.edge(e).weight;
-/* generate a resolver function */
-var resolver = function resolver(cb, next, method) {
- return function (value) {
- if (typeof cb !== 'function') /* [Promises/A+ 2.2.1, 2.2.7.3, 2.2.7.4] */
- next[method].call(next, value); /* [Promises/A+ 2.2.7.3, 2.2.7.4] */else {
- var result;
- try {
- result = cb(value);
- } /* [Promises/A+ 2.2.2.1, 2.2.3.1, 2.2.5, 3.2] */ catch (e) {
- next.reject(e); /* [Promises/A+ 2.2.7.2] */
- return;
+ cutValue += pointsToHead ? otherWeight : -otherWeight;
+ if (isTreeEdge(t, child, other)) {
+ var otherCutValue = t.edge(child, other).cutvalue;
+ cutValue += pointsToHead ? -otherCutValue : otherCutValue;
}
- resolve(next, result); /* [Promises/A+ 2.2.7.1] */
}
- };
-};
+ });
-/* "Promise Resolution Procedure" */ /* [Promises/A+ 2.3] */
-var resolve = function resolve(promise, x) {
- /* sanity check arguments */ /* [Promises/A+ 2.3.1] */
- if (promise === x || promise.proxy === x) {
- promise.reject(new TypeError('cannot resolve promise with itself'));
- return;
- }
+ return cutValue;
+}
- /* surgically check for a "then" method
- (mainly to just call the "getter" of "then" only once) */
- var then;
- if (_typeof(x) === 'object' && x !== null || typeof x === 'function') {
- try {
- then = x.then;
- } /* [Promises/A+ 2.3.3.1, 3.5] */ catch (e) {
- promise.reject(e); /* [Promises/A+ 2.3.3.2] */
- return;
- }
+function initLowLimValues(tree, root) {
+ if (arguments.length < 2) {
+ root = tree.nodes()[0];
}
+ dfsAssignLowLim(tree, {}, 1, root);
+}
- /* handle own Thenables [Promises/A+ 2.3.2]
- and similar "thenables" [Promises/A+ 2.3.3] */
- if (typeof then === 'function') {
- var resolved = false;
- try {
- /* call retrieved "then" method */ /* [Promises/A+ 2.3.3.3] */
- then.call(x, /* resolvePromise */ /* [Promises/A+ 2.3.3.3.1] */
- function (y) {
- if (resolved) return;
- resolved = true; /* [Promises/A+ 2.3.3.3.3] */
- if (y === x) /* [Promises/A+ 3.6] */
- promise.reject(new TypeError('circular thenable chain'));else resolve(promise, y);
- }, /* rejectPromise */ /* [Promises/A+ 2.3.3.3.2] */
- function (r) {
- if (resolved) return;
- resolved = true; /* [Promises/A+ 2.3.3.3.3] */
- promise.reject(r);
- });
- } catch (e) {
- if (!resolved) /* [Promises/A+ 2.3.3.3.3] */
- promise.reject(e); /* [Promises/A+ 2.3.3.3.4] */
+function dfsAssignLowLim(tree, visited, nextLim, v, parent) {
+ var low = nextLim;
+ var label = tree.node(v);
+
+ visited[v] = true;
+ _.forEach(tree.neighbors(v), function(w) {
+ if (!_.has(visited, w)) {
+ nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);
}
+ });
- return;
+ label.low = low;
+ label.lim = nextLim++;
+ if (parent) {
+ label.parent = parent;
+ } else {
+ // TODO should be able to remove this when we incrementally update low lim
+ delete label.parent;
}
- /* handle other values */
- promise.fulfill(x); /* [Promises/A+ 2.3.4, 2.3.3.4] */
-};
+ return nextLim;
+}
-// so we always have Promise.all()
-api.all = function (ps) {
- return new api(function (resolveAll, rejectAll) {
- var vals = new Array(ps.length);
- var doneCount = 0;
- var fulfill = function fulfill(i, val) {
- vals[i] = val;
- doneCount++;
- if (doneCount === ps.length) {
- resolveAll(vals);
- }
- };
- for (var i = 0; i < ps.length; i++) {
- (function (i) {
- var p = ps[i];
- var isPromise = p != null && p.then != null;
- if (isPromise) {
- p.then(function (val) {
- fulfill(i, val);
- }, function (err) {
- rejectAll(err);
- });
- } else {
- var val = p;
- fulfill(i, val);
- }
- })(i);
- }
- });
-};
-api.resolve = function (val) {
- return new api(function (resolve, reject) {
- resolve(val);
- });
-};
-api.reject = function (val) {
- return new api(function (resolve, reject) {
- reject(val);
+function leaveEdge(tree) {
+ return _.find(tree.edges(), function(e) {
+ return tree.edge(e).cutvalue < 0;
});
-};
-var Promise$1 = typeof Promise !== 'undefined' ? Promise : api; // eslint-disable-line no-undef
+}
-var Animation = function Animation(target, opts, opts2) {
- var isCore = core(target);
- var isEle = !isCore;
- var _p = this._private = extend({
- duration: 1000
- }, opts, opts2);
- _p.target = target;
- _p.style = _p.style || _p.css;
- _p.started = false;
- _p.playing = false;
- _p.hooked = false;
- _p.applying = false;
- _p.progress = 0;
- _p.completes = [];
- _p.frames = [];
- if (_p.complete && fn$6(_p.complete)) {
- _p.completes.push(_p.complete);
- }
- if (isEle) {
- var pos = target.position();
- _p.startPosition = _p.startPosition || {
- x: pos.x,
- y: pos.y
- };
- _p.startStyle = _p.startStyle || target.cy().style().getAnimationStartStyle(target, _p.style);
+function enterEdge(t, g, edge) {
+ var v = edge.v;
+ var w = edge.w;
+
+ // For the rest of this function we assume that v is the tail and w is the
+ // head, so if we don't have this edge in the graph we should flip it to
+ // match the correct orientation.
+ if (!g.hasEdge(v, w)) {
+ v = edge.w;
+ w = edge.v;
}
- if (isCore) {
- var pan = target.pan();
- _p.startPan = {
- x: pan.x,
- y: pan.y
- };
- _p.startZoom = target.zoom();
+
+ var vLabel = t.node(v);
+ var wLabel = t.node(w);
+ var tailLabel = vLabel;
+ var flip = false;
+
+ // If the root is in the tail of the edge then we need to flip the logic that
+ // checks for the head and tail nodes in the candidates function below.
+ if (vLabel.lim > wLabel.lim) {
+ tailLabel = wLabel;
+ flip = true;
}
- // for future timeline/animations impl
- this.length = 1;
- this[0] = this;
-};
-var anifn = Animation.prototype;
-extend(anifn, {
- instanceString: function instanceString() {
- return 'animation';
- },
- hook: function hook() {
- var _p = this._private;
- if (!_p.hooked) {
- // add to target's animation queue
- var q;
- var tAni = _p.target._private.animation;
- if (_p.queue) {
- q = tAni.queue;
- } else {
- q = tAni.current;
- }
- q.push(this);
+ var candidates = _.filter(g.edges(), function(edge) {
+ return flip === isDescendant(t, t.node(edge.v), tailLabel) &&
+ flip !== isDescendant(t, t.node(edge.w), tailLabel);
+ });
- // add to the animation loop pool
- if (elementOrCollection(_p.target)) {
- _p.target.cy().addToAnimationPool(_p.target);
- }
- _p.hooked = true;
- }
- return this;
- },
- play: function play() {
- var _p = this._private;
+ return _.minBy(candidates, function(edge) { return slack(g, edge); });
+}
- // autorewind
- if (_p.progress === 1) {
- _p.progress = 0;
- }
- _p.playing = true;
- _p.started = false; // needs to be started by animation loop
- _p.stopped = false;
- this.hook();
+function exchangeEdges(t, g, e, f) {
+ var v = e.v;
+ var w = e.w;
+ t.removeEdge(v, w);
+ t.setEdge(f.v, f.w, {});
+ initLowLimValues(t);
+ initCutValues(t, g);
+ updateRanks(t, g);
+}
- // the animation loop will start the animation...
+function updateRanks(t, g) {
+ var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });
+ var vs = preorder(t, root);
+ vs = vs.slice(1);
+ _.forEach(vs, function(v) {
+ var parent = t.node(v).parent,
+ edge = g.edge(v, parent),
+ flipped = false;
- return this;
- },
- playing: function playing() {
- return this._private.playing;
- },
- apply: function apply() {
- var _p = this._private;
- _p.applying = true;
- _p.started = false; // needs to be started by animation loop
- _p.stopped = false;
- this.hook();
+ if (!edge) {
+ edge = g.edge(parent, v);
+ flipped = true;
+ }
- // the animation loop will apply the animation at this progress
+ g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);
+ });
+}
- return this;
- },
- applying: function applying() {
- return this._private.applying;
- },
- pause: function pause() {
- var _p = this._private;
- _p.playing = false;
- _p.started = false;
- return this;
- },
- stop: function stop() {
- var _p = this._private;
- _p.playing = false;
- _p.started = false;
- _p.stopped = true; // to be removed from animation queues
+/*
+ * Returns true if the edge is in the tree.
+ */
+function isTreeEdge(tree, u, v) {
+ return tree.hasEdge(u, v);
+}
- return this;
- },
- rewind: function rewind() {
- return this.progress(0);
- },
- fastforward: function fastforward() {
- return this.progress(1);
- },
- time: function time(t) {
- var _p = this._private;
- if (t === undefined) {
- return _p.progress * _p.duration;
- } else {
- return this.progress(t / _p.duration);
- }
- },
- progress: function progress(p) {
- var _p = this._private;
- var wasPlaying = _p.playing;
- if (p === undefined) {
- return _p.progress;
- } else {
- if (wasPlaying) {
- this.pause();
- }
- _p.progress = p;
- _p.started = false;
- if (wasPlaying) {
- this.play();
- }
- }
- return this;
- },
- completed: function completed() {
- return this._private.progress === 1;
- },
- reverse: function reverse() {
- var _p = this._private;
- var wasPlaying = _p.playing;
- if (wasPlaying) {
- this.pause();
- }
- _p.progress = 1 - _p.progress;
- _p.started = false;
- var swap = function swap(a, b) {
- var _pa = _p[a];
- if (_pa == null) {
- return;
- }
- _p[a] = _p[b];
- _p[b] = _pa;
- };
- swap('zoom', 'startZoom');
- swap('pan', 'startPan');
- swap('position', 'startPosition');
+/*
+ * Returns true if the specified node is descendant of the root node per the
+ * assigned low and lim attributes in the tree.
+ */
+function isDescendant(tree, vLabel, rootLabel) {
+ return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;
+}
- // swap styles
- if (_p.style) {
- for (var i = 0; i < _p.style.length; i++) {
- var prop = _p.style[i];
- var name = prop.name;
- var startStyleProp = _p.startStyle[name];
- _p.startStyle[name] = prop;
- _p.style[i] = startStyleProp;
- }
- }
- if (wasPlaying) {
- this.play();
- }
- return this;
- },
- promise: function promise(type) {
- var _p = this._private;
- var arr;
- switch (type) {
- case 'frame':
- arr = _p.frames;
- break;
- default:
- case 'complete':
- case 'completed':
- arr = _p.completes;
- }
- return new Promise$1(function (resolve, reject) {
- arr.push(function () {
- resolve();
- });
- });
- }
-});
-anifn.complete = anifn.completed;
-anifn.run = anifn.play;
-anifn.running = anifn.playing;
-var define$3 = {
- animated: function animated() {
- return function animatedImpl() {
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return false;
- }
- var ele = all[0];
- if (ele) {
- return ele._private.animation.current.length > 0;
- }
- };
- },
- // animated
+/***/ }),
- clearQueue: function clearQueue() {
- return function clearQueueImpl() {
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return this;
- }
- for (var i = 0; i < all.length; i++) {
- var ele = all[i];
- ele._private.animation.queue = [];
- }
- return this;
- };
- },
- // clearQueue
+/***/ "./node_modules/dagre/lib/rank/util.js":
+/*!*********************************************!*\
+ !*** ./node_modules/dagre/lib/rank/util.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- delay: function delay() {
- return function delayImpl(time, complete) {
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return this;
- }
- return this.animate({
- delay: time,
- duration: time,
- complete: complete
- });
- };
- },
- // delay
+"use strict";
- delayAnimation: function delayAnimation() {
- return function delayAnimationImpl(time, complete) {
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return this;
- }
- return this.animation({
- delay: time,
- duration: time,
- complete: complete
- });
- };
- },
- // delay
- animation: function animation() {
- return function animationImpl(properties, params) {
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var cy = this._private.cy || this;
- var isCore = !selfIsArrayLike;
- var isEles = !isCore;
- if (!cy.styleEnabled()) {
- return this;
- }
- var style = cy.style();
- properties = extend({}, properties, params);
- var propertiesEmpty = Object.keys(properties).length === 0;
- if (propertiesEmpty) {
- return new Animation(all[0], properties); // nothing to animate
- }
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
- if (properties.duration === undefined) {
- properties.duration = 400;
- }
- switch (properties.duration) {
- case 'slow':
- properties.duration = 600;
- break;
- case 'fast':
- properties.duration = 200;
- break;
- }
- if (isEles) {
- properties.style = style.getPropsList(properties.style || properties.css);
- properties.css = undefined;
- }
- if (isEles && properties.renderedPosition != null) {
- var rpos = properties.renderedPosition;
- var pan = cy.pan();
- var zoom = cy.zoom();
- properties.position = renderedToModelPosition(rpos, zoom, pan);
- }
+module.exports = {
+ longestPath: longestPath,
+ slack: slack
+};
- // override pan w/ panBy if set
- if (isCore && properties.panBy != null) {
- var panBy = properties.panBy;
- var cyPan = cy.pan();
- properties.pan = {
- x: cyPan.x + panBy.x,
- y: cyPan.y + panBy.y
- };
- }
+/*
+ * Initializes ranks for the input graph using the longest path algorithm. This
+ * algorithm scales well and is fast in practice, it yields rather poor
+ * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom
+ * ranks wide and leaving edges longer than necessary. However, due to its
+ * speed, this algorithm is good for getting an initial ranking that can be fed
+ * into other algorithms.
+ *
+ * This algorithm does not normalize layers because it will be used by other
+ * algorithms in most cases. If using this algorithm directly, be sure to
+ * run normalize at the end.
+ *
+ * Pre-conditions:
+ *
+ * 1. Input graph is a DAG.
+ * 2. Input graph node labels can be assigned properties.
+ *
+ * Post-conditions:
+ *
+ * 1. Each node will be assign an (unnormalized) "rank" property.
+ */
+function longestPath(g) {
+ var visited = {};
- // override pan w/ center if set
- var center = properties.center || properties.centre;
- if (isCore && center != null) {
- var centerPan = cy.getCenterPan(center.eles, properties.zoom);
- if (centerPan != null) {
- properties.pan = centerPan;
- }
- }
+ function dfs(v) {
+ var label = g.node(v);
+ if (_.has(visited, v)) {
+ return label.rank;
+ }
+ visited[v] = true;
- // override pan & zoom w/ fit if set
- if (isCore && properties.fit != null) {
- var fit = properties.fit;
- var fitVp = cy.getFitViewport(fit.eles || fit.boundingBox, fit.padding);
- if (fitVp != null) {
- properties.pan = fitVp.pan;
- properties.zoom = fitVp.zoom;
- }
- }
+ var rank = _.min(_.map(g.outEdges(v), function(e) {
+ return dfs(e.w) - g.edge(e).minlen;
+ }));
- // override zoom (& potentially pan) w/ zoom obj if set
- if (isCore && plainObject(properties.zoom)) {
- var vp = cy.getZoomedViewport(properties.zoom);
- if (vp != null) {
- if (vp.zoomed) {
- properties.zoom = vp.zoom;
- }
- if (vp.panned) {
- properties.pan = vp.pan;
- }
- } else {
- properties.zoom = null; // an inavalid zoom (e.g. no delta) gets automatically destroyed
- }
- }
+ if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
+ rank === undefined || // return value of _.map([]) for Lodash 4
+ rank === null) { // return value of _.map([null])
+ rank = 0;
+ }
- return new Animation(all[0], properties);
- };
- },
- // animate
+ return (label.rank = rank);
+ }
- animate: function animate() {
- return function animateImpl(properties, params) {
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return this;
- }
- if (params) {
- properties = extend({}, properties, params);
- }
+ _.forEach(g.sources(), dfs);
+}
- // manually hook and run the animation
- for (var i = 0; i < all.length; i++) {
- var ele = all[i];
- var queue = ele.animated() && (properties.queue === undefined || properties.queue);
- var ani = ele.animation(properties, queue ? {
- queue: true
- } : undefined);
- ani.play();
- }
- return this; // chaining
- };
- },
+/*
+ * Returns the amount of slack for the given edge. The slack is defined as the
+ * difference between the length of the edge and its minimum length.
+ */
+function slack(g, e) {
+ return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;
+}
- // animate
- stop: function stop() {
- return function stopImpl(clearQueue, jumpToEnd) {
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var cy = this._private.cy || this;
- if (!cy.styleEnabled()) {
- return this;
- }
- for (var i = 0; i < all.length; i++) {
- var ele = all[i];
- var _p = ele._private;
- var anis = _p.animation.current;
- for (var j = 0; j < anis.length; j++) {
- var ani = anis[j];
- var ani_p = ani._private;
- if (jumpToEnd) {
- // next iteration of the animation loop, the animation
- // will go straight to the end and be removed
- ani_p.duration = 0;
- }
- }
+/***/ }),
- // clear the queue of future animations
- if (clearQueue) {
- _p.animation.queue = [];
- }
- if (!jumpToEnd) {
- _p.animation.current = [];
- }
- }
+/***/ "./node_modules/dagre/lib/util.js":
+/*!****************************************!*\
+ !*** ./node_modules/dagre/lib/util.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // we have to notify (the animation loop doesn't do it for us on `stop`)
- cy.notify('draw');
- return this;
- };
- } // stop
-}; // define
+"use strict";
+/* eslint "no-console": off */
-var define$2 = {
- // access data field
- data: function data(params) {
- var defaults = {
- field: 'data',
- bindingEvent: 'data',
- allowBinding: false,
- allowSetting: false,
- allowGetting: false,
- settingEvent: 'data',
- settingTriggersEvent: false,
- triggerFnName: 'trigger',
- immutableKeys: {},
- // key => true if immutable
- updateStyle: false,
- beforeGet: function beforeGet(self) {},
- beforeSet: function beforeSet(self, obj) {},
- onSet: function onSet(self) {},
- canSet: function canSet(self) {
- return true;
- }
- };
- params = extend({}, defaults, params);
- return function dataImpl(name, value) {
- var p = params;
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- var single = selfIsArrayLike ? self[0] : self;
- // .data('foo', ...)
- if (string(name)) {
- // set or get property
- var isPathLike = name.indexOf('.') !== -1; // there might be a normal field with a dot
- var path = isPathLike && toPath__default["default"](name);
- // .data('foo')
- if (p.allowGetting && value === undefined) {
- // get
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
- var ret;
- if (single) {
- p.beforeGet(single);
+module.exports = {
+ addDummyNode: addDummyNode,
+ simplify: simplify,
+ asNonCompoundGraph: asNonCompoundGraph,
+ successorWeights: successorWeights,
+ predecessorWeights: predecessorWeights,
+ intersectRect: intersectRect,
+ buildLayerMatrix: buildLayerMatrix,
+ normalizeRanks: normalizeRanks,
+ removeEmptyRanks: removeEmptyRanks,
+ addBorderNode: addBorderNode,
+ maxRank: maxRank,
+ partition: partition,
+ time: time,
+ notime: notime
+};
- // check if it's path and a field with the same name doesn't exist
- if (path && single._private[p.field][name] === undefined) {
- ret = get__default["default"](single._private[p.field], path);
- } else {
- ret = single._private[p.field][name];
- }
- }
- return ret;
+/*
+ * Adds a dummy node to the graph and return v.
+ */
+function addDummyNode(g, type, attrs, name) {
+ var v;
+ do {
+ v = _.uniqueId(name);
+ } while (g.hasNode(v));
- // .data('foo', 'bar')
- } else if (p.allowSetting && value !== undefined) {
- // set
- var valid = !p.immutableKeys[name];
- if (valid) {
- var change = _defineProperty({}, name, value);
- p.beforeSet(self, change);
- for (var i = 0, l = all.length; i < l; i++) {
- var ele = all[i];
- if (p.canSet(ele)) {
- if (path && single._private[p.field][name] === undefined) {
- set__default["default"](ele._private[p.field], path, value);
- } else {
- ele._private[p.field][name] = value;
- }
- }
- }
+ attrs.dummy = type;
+ g.setNode(v, attrs);
+ return v;
+}
- // update mappers if asked
- if (p.updateStyle) {
- self.updateStyle();
- }
+/*
+ * Returns a new graph with only simple edges. Handles aggregation of data
+ * associated with multi-edges.
+ */
+function simplify(g) {
+ var simplified = new Graph().setGraph(g.graph());
+ _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });
+ _.forEach(g.edges(), function(e) {
+ var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };
+ var label = g.edge(e);
+ simplified.setEdge(e.v, e.w, {
+ weight: simpleLabel.weight + label.weight,
+ minlen: Math.max(simpleLabel.minlen, label.minlen)
+ });
+ });
+ return simplified;
+}
- // call onSet callback
- p.onSet(self);
- if (p.settingTriggersEvent) {
- self[p.triggerFnName](p.settingEvent);
- }
- }
- }
+function asNonCompoundGraph(g) {
+ var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());
+ _.forEach(g.nodes(), function(v) {
+ if (!g.children(v).length) {
+ simplified.setNode(v, g.node(v));
+ }
+ });
+ _.forEach(g.edges(), function(e) {
+ simplified.setEdge(e, g.edge(e));
+ });
+ return simplified;
+}
- // .data({ 'foo': 'bar' })
- } else if (p.allowSetting && plainObject(name)) {
- // extend
- var obj = name;
- var k, v;
- var keys = Object.keys(obj);
- p.beforeSet(self, obj);
- for (var _i = 0; _i < keys.length; _i++) {
- k = keys[_i];
- v = obj[k];
- var _valid = !p.immutableKeys[k];
- if (_valid) {
- for (var j = 0; j < all.length; j++) {
- var _ele = all[j];
- if (p.canSet(_ele)) {
- _ele._private[p.field][k] = v;
- }
- }
- }
- }
+function successorWeights(g) {
+ var weightMap = _.map(g.nodes(), function(v) {
+ var sucs = {};
+ _.forEach(g.outEdges(v), function(e) {
+ sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;
+ });
+ return sucs;
+ });
+ return _.zipObject(g.nodes(), weightMap);
+}
- // update mappers if asked
- if (p.updateStyle) {
- self.updateStyle();
- }
+function predecessorWeights(g) {
+ var weightMap = _.map(g.nodes(), function(v) {
+ var preds = {};
+ _.forEach(g.inEdges(v), function(e) {
+ preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;
+ });
+ return preds;
+ });
+ return _.zipObject(g.nodes(), weightMap);
+}
- // call onSet callback
- p.onSet(self);
- if (p.settingTriggersEvent) {
- self[p.triggerFnName](p.settingEvent);
- }
+/*
+ * Finds where a line starting at point ({x, y}) would intersect a rectangle
+ * ({x, y, width, height}) if it were pointing at the rectangle's center.
+ */
+function intersectRect(rect, point) {
+ var x = rect.x;
+ var y = rect.y;
- // .data(function(){ ... })
- } else if (p.allowBinding && fn$6(name)) {
- // bind to event
- var fn = name;
- self.on(p.bindingEvent, fn);
+ // Rectangle intersection algorithm from:
+ // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
+ var dx = point.x - x;
+ var dy = point.y - y;
+ var w = rect.width / 2;
+ var h = rect.height / 2;
- // .data()
- } else if (p.allowGetting && name === undefined) {
- // get whole object
- var _ret;
- if (single) {
- p.beforeGet(single);
- _ret = single._private[p.field];
- }
- return _ret;
- }
- return self; // maintain chainability
- }; // function
- },
+ if (!dx && !dy) {
+ throw new Error("Not possible to find intersection inside of the rectangle");
+ }
- // data
+ var sx, sy;
+ if (Math.abs(dy) * w > Math.abs(dx) * h) {
+ // Intersection is top or bottom of rect.
+ if (dy < 0) {
+ h = -h;
+ }
+ sx = h * dx / dy;
+ sy = h;
+ } else {
+ // Intersection is left or right of rect.
+ if (dx < 0) {
+ w = -w;
+ }
+ sx = w;
+ sy = w * dy / dx;
+ }
- // remove data field
- removeData: function removeData(params) {
- var defaults = {
- field: 'data',
- event: 'data',
- triggerFnName: 'trigger',
- triggerEvent: false,
- immutableKeys: {} // key => true if immutable
- };
+ return { x: x + sx, y: y + sy };
+}
- params = extend({}, defaults, params);
- return function removeDataImpl(names) {
- var p = params;
- var self = this;
- var selfIsArrayLike = self.length !== undefined;
- var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+/*
+ * Given a DAG with each node assigned "rank" and "order" properties, this
+ * function will produce a matrix with the ids of each node.
+ */
+function buildLayerMatrix(g) {
+ var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ var rank = node.rank;
+ if (!_.isUndefined(rank)) {
+ layering[rank][node.order] = v;
+ }
+ });
+ return layering;
+}
- // .removeData('foo bar')
- if (string(names)) {
- // then get the list of keys, and delete them
- var keys = names.split(/\s+/);
- var l = keys.length;
- for (var i = 0; i < l; i++) {
- // delete each non-empty key
- var key = keys[i];
- if (emptyString(key)) {
- continue;
- }
- var valid = !p.immutableKeys[key]; // not valid if immutable
- if (valid) {
- for (var i_a = 0, l_a = all.length; i_a < l_a; i_a++) {
- all[i_a]._private[p.field][key] = undefined;
- }
- }
- }
- if (p.triggerEvent) {
- self[p.triggerFnName](p.event);
- }
+/*
+ * Adjusts the ranks for all nodes in the graph such that all nodes v have
+ * rank(v) >= 0 and at least one node w has rank(w) = 0.
+ */
+function normalizeRanks(g) {
+ var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));
+ _.forEach(g.nodes(), function(v) {
+ var node = g.node(v);
+ if (_.has(node, "rank")) {
+ node.rank -= min;
+ }
+ });
+}
- // .removeData()
- } else if (names === undefined) {
- // then delete all keys
+function removeEmptyRanks(g) {
+ // Ranks may not start at 0, so we need to offset them
+ var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));
- for (var _i_a = 0, _l_a = all.length; _i_a < _l_a; _i_a++) {
- var _privateFields = all[_i_a]._private[p.field];
- var _keys = Object.keys(_privateFields);
- for (var _i2 = 0; _i2 < _keys.length; _i2++) {
- var _key = _keys[_i2];
- var validKeyToDelete = !p.immutableKeys[_key];
- if (validKeyToDelete) {
- _privateFields[_key] = undefined;
- }
- }
- }
- if (p.triggerEvent) {
- self[p.triggerFnName](p.event);
- }
- }
- return self; // maintain chaining
- }; // function
- } // removeData
-}; // define
+ var layers = [];
+ _.forEach(g.nodes(), function(v) {
+ var rank = g.node(v).rank - offset;
+ if (!layers[rank]) {
+ layers[rank] = [];
+ }
+ layers[rank].push(v);
+ });
-var define$1 = {
- eventAliasesOn: function eventAliasesOn(proto) {
- var p = proto;
- p.addListener = p.listen = p.bind = p.on;
- p.unlisten = p.unbind = p.off = p.removeListener;
- p.trigger = p.emit;
+ var delta = 0;
+ var nodeRankFactor = g.graph().nodeRankFactor;
+ _.forEach(layers, function(vs, i) {
+ if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {
+ --delta;
+ } else if (delta) {
+ _.forEach(vs, function(v) { g.node(v).rank += delta; });
+ }
+ });
+}
- // this is just a wrapper alias of .on()
- p.pon = p.promiseOn = function (events, selector) {
- var self = this;
- var args = Array.prototype.slice.call(arguments, 0);
- return new Promise$1(function (resolve, reject) {
- var callback = function callback(e) {
- self.off.apply(self, offArgs);
- resolve(e);
- };
- var onArgs = args.concat([callback]);
- var offArgs = onArgs.concat([]);
- self.on.apply(self, onArgs);
- });
- };
+function addBorderNode(g, prefix, rank, order) {
+ var node = {
+ width: 0,
+ height: 0
+ };
+ if (arguments.length >= 4) {
+ node.rank = rank;
+ node.order = order;
}
-}; // define
-
-// use this module to cherry pick functions into your prototype
-var define = {};
-[define$3, define$2, define$1].forEach(function (m) {
- extend(define, m);
-});
-
-var elesfn$i = {
- animate: define.animate(),
- animation: define.animation(),
- animated: define.animated(),
- clearQueue: define.clearQueue(),
- delay: define.delay(),
- delayAnimation: define.delayAnimation(),
- stop: define.stop()
-};
+ return addDummyNode(g, "border", node, prefix);
+}
-var elesfn$h = {
- classes: function classes(_classes) {
- var self = this;
- if (_classes === undefined) {
- var ret = [];
- self[0]._private.classes.forEach(function (cls) {
- return ret.push(cls);
- });
- return ret;
- } else if (!array(_classes)) {
- // extract classes from string
- _classes = (_classes || '').match(/\S+/g) || [];
+function maxRank(g) {
+ return _.max(_.map(g.nodes(), function(v) {
+ var rank = g.node(v).rank;
+ if (!_.isUndefined(rank)) {
+ return rank;
}
- var changed = [];
- var classesSet = new Set$1(_classes);
-
- // check and update each ele
- for (var j = 0; j < self.length; j++) {
- var ele = self[j];
- var _p = ele._private;
- var eleClasses = _p.classes;
- var changedEle = false;
-
- // check if ele has all of the passed classes
- for (var i = 0; i < _classes.length; i++) {
- var cls = _classes[i];
- var eleHasClass = eleClasses.has(cls);
- if (!eleHasClass) {
- changedEle = true;
- break;
- }
- }
+ }));
+}
- // check if ele has classes outside of those passed
- if (!changedEle) {
- changedEle = eleClasses.size !== _classes.length;
- }
- if (changedEle) {
- _p.classes = classesSet;
- changed.push(ele);
- }
+/*
+ * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
+ * function returns true for an entry it goes into `lhs`. Otherwise it goes
+ * into `rhs.
+ */
+function partition(collection, fn) {
+ var result = { lhs: [], rhs: [] };
+ _.forEach(collection, function(value) {
+ if (fn(value)) {
+ result.lhs.push(value);
+ } else {
+ result.rhs.push(value);
}
+ });
+ return result;
+}
- // trigger update style on those eles that had class changes
- if (changed.length > 0) {
- this.spawn(changed).updateStyle().emit('class');
- }
- return self;
- },
- addClass: function addClass(classes) {
- return this.toggleClass(classes, true);
- },
- hasClass: function hasClass(className) {
- var ele = this[0];
- return ele != null && ele._private.classes.has(className);
- },
- toggleClass: function toggleClass(classes, toggle) {
- if (!array(classes)) {
- // extract classes from string
- classes = classes.match(/\S+/g) || [];
- }
- var self = this;
- var toggleUndefd = toggle === undefined;
- var changed = []; // eles who had classes changed
+/*
+ * Returns a new function that wraps `fn` with a timer. The wrapper logs the
+ * time it takes to execute the function.
+ */
+function time(name, fn) {
+ var start = _.now();
+ try {
+ return fn();
+ } finally {
+ console.log(name + " time: " + (_.now() - start) + "ms");
+ }
+}
- for (var i = 0, il = self.length; i < il; i++) {
- var ele = self[i];
- var eleClasses = ele._private.classes;
- var changedEle = false;
- for (var j = 0; j < classes.length; j++) {
- var cls = classes[j];
- var hasClass = eleClasses.has(cls);
- var changedNow = false;
- if (toggle || toggleUndefd && !hasClass) {
- eleClasses.add(cls);
- changedNow = true;
- } else if (!toggle || toggleUndefd && hasClass) {
- eleClasses["delete"](cls);
- changedNow = true;
- }
- if (!changedEle && changedNow) {
- changed.push(ele);
- changedEle = true;
- }
- } // for j classes
- } // for i eles
+function notime(name, fn) {
+ return fn();
+}
- // trigger update style on those eles that had class changes
- if (changed.length > 0) {
- this.spawn(changed).updateStyle().emit('class');
- }
- return self;
- },
- removeClass: function removeClass(classes) {
- return this.toggleClass(classes, false);
- },
- flashClass: function flashClass(classes, duration) {
- var self = this;
- if (duration == null) {
- duration = 250;
- } else if (duration === 0) {
- return self; // nothing to do really
- }
- self.addClass(classes);
- setTimeout(function () {
- self.removeClass(classes);
- }, duration);
- return self;
- }
-};
-elesfn$h.className = elesfn$h.classNames = elesfn$h.classes;
+/***/ }),
-// tokens in the query language
-var tokens = {
- metaChar: '[\\!\\"\\#\\$\\%\\&\\\'\\(\\)\\*\\+\\,\\.\\/\\:\\;\\<\\=\\>\\?\\@\\[\\]\\^\\`\\{\\|\\}\\~]',
- // chars we need to escape in let names, etc
- comparatorOp: '=|\\!=|>|>=|<|<=|\\$=|\\^=|\\*=',
- // binary comparison op (used in data selectors)
- boolOp: '\\?|\\!|\\^',
- // boolean (unary) operators (used in data selectors)
- string: '"(?:\\\\"|[^"])*"' + '|' + "'(?:\\\\'|[^'])*'",
- // string literals (used in data selectors) -- doublequotes | singlequotes
- number: number,
- // number literal (used in data selectors) --- e.g. 0.1234, 1234, 12e123
- meta: 'degree|indegree|outdegree',
- // allowed metadata fields (i.e. allowed functions to use from Collection)
- separator: '\\s*,\\s*',
- // queries are separated by commas, e.g. edge[foo = 'bar'], node.someClass
- descendant: '\\s+',
- child: '\\s+>\\s+',
- subject: '\\$',
- group: 'node|edge|\\*',
- directedEdge: '\\s+->\\s+',
- undirectedEdge: '\\s+<->\\s+'
-};
-tokens.variable = '(?:[\\w-.]|(?:\\\\' + tokens.metaChar + '))+'; // a variable name can have letters, numbers, dashes, and periods
-tokens.className = '(?:[\\w-]|(?:\\\\' + tokens.metaChar + '))+'; // a class name has the same rules as a variable except it can't have a '.' in the name
-tokens.value = tokens.string + '|' + tokens.number; // a value literal, either a string or number
-tokens.id = tokens.variable; // an element id (follows variable conventions)
+/***/ "./node_modules/dagre/lib/version.js":
+/*!*******************************************!*\
+ !*** ./node_modules/dagre/lib/version.js ***!
+ \*******************************************/
+/***/ (function(module) {
-(function () {
- var ops, op, i;
+module.exports = "0.8.5";
- // add @ variants to comparatorOp
- ops = tokens.comparatorOp.split('|');
- for (i = 0; i < ops.length; i++) {
- op = ops[i];
- tokens.comparatorOp += '|@' + op;
- }
- // add ! variants to comparatorOp
- ops = tokens.comparatorOp.split('|');
- for (i = 0; i < ops.length; i++) {
- op = ops[i];
- if (op.indexOf('!') >= 0) {
- continue;
- } // skip ops that explicitly contain !
- if (op === '=') {
- continue;
- } // skip = b/c != is explicitly defined
+/***/ }),
- tokens.comparatorOp += '|\\!' + op;
- }
-})();
+/***/ "./node_modules/dependency-graph/lib/dep_graph.js":
+/*!********************************************************!*\
+ !*** ./node_modules/dependency-graph/lib/dep_graph.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack_module, exports) {
/**
- * Make a new query object
+ * A simple dependency graph
+ */
+
+/**
+ * Helper for creating a Topological Sort using Depth-First-Search on a set of edges.
*
- * @prop type {Type} The type enum (int) of the query
- * @prop checks List of checks to make against an ele to test for a match
+ * Detects cycles and throws an Error if one is detected (unless the "circular"
+ * parameter is "true" in which case it ignores them).
+ *
+ * @param edges The set of edges to DFS through
+ * @param leavesOnly Whether to only return "leaf" nodes (ones who have no edges)
+ * @param result An array in which the results will be populated
+ * @param circular A boolean to allow circular dependencies
*/
-var newQuery = function newQuery() {
- return {
- checks: []
+function createDFS(edges, leavesOnly, result, circular) {
+ var visited = {};
+ return function (start) {
+ if (visited[start]) {
+ return;
+ }
+ var inCurrentPath = {};
+ var currentPath = [];
+ var todo = []; // used as a stack
+ todo.push({ node: start, processed: false });
+ while (todo.length > 0) {
+ var current = todo[todo.length - 1]; // peek at the todo stack
+ var processed = current.processed;
+ var node = current.node;
+ if (!processed) {
+ // Haven't visited edges yet (visiting phase)
+ if (visited[node]) {
+ todo.pop();
+ continue;
+ } else if (inCurrentPath[node]) {
+ // It's not a DAG
+ if (circular) {
+ todo.pop();
+ // If we're tolerating cycles, don't revisit the node
+ continue;
+ }
+ currentPath.push(node);
+ throw new DepGraphCycleError(currentPath);
+ }
+
+ inCurrentPath[node] = true;
+ currentPath.push(node);
+ var nodeEdges = edges[node];
+ // (push edges onto the todo stack in reverse order to be order-compatible with the old DFS implementation)
+ for (var i = nodeEdges.length - 1; i >= 0; i--) {
+ todo.push({ node: nodeEdges[i], processed: false });
+ }
+ current.processed = true;
+ } else {
+ // Have visited edges (stack unrolling phase)
+ todo.pop();
+ currentPath.pop();
+ inCurrentPath[node] = false;
+ visited[node] = true;
+ if (!leavesOnly || edges[node].length === 0) {
+ result.push(node);
+ }
+ }
+ }
};
-};
+}
/**
- * A check type enum-like object. Uses integer values for fast match() lookup.
- * The ordering does not matter as long as the ints are unique.
+ * Simple Dependency Graph
*/
-var Type = {
- /** E.g. node */
- GROUP: 0,
- /** A collection of elements */
- COLLECTION: 1,
- /** A filter(ele) function */
- FILTER: 2,
- /** E.g. [foo > 1] */
- DATA_COMPARE: 3,
- /** E.g. [foo] */
- DATA_EXIST: 4,
- /** E.g. [?foo] */
- DATA_BOOL: 5,
- /** E.g. [[degree > 2]] */
- META_COMPARE: 6,
- /** E.g. :selected */
- STATE: 7,
- /** E.g. #foo */
- ID: 8,
- /** E.g. .foo */
- CLASS: 9,
- /** E.g. #foo <-> #bar */
- UNDIRECTED_EDGE: 10,
- /** E.g. #foo -> #bar */
- DIRECTED_EDGE: 11,
- /** E.g. $#foo -> #bar */
- NODE_SOURCE: 12,
- /** E.g. #foo -> $#bar */
- NODE_TARGET: 13,
- /** E.g. $#foo <-> #bar */
- NODE_NEIGHBOR: 14,
- /** E.g. #foo > #bar */
- CHILD: 15,
- /** E.g. #foo #bar */
- DESCENDANT: 16,
- /** E.g. $#foo > #bar */
- PARENT: 17,
- /** E.g. $#foo #bar */
- ANCESTOR: 18,
- /** E.g. #foo > $bar > #baz */
- COMPOUND_SPLIT: 19,
- /** Always matches, useful placeholder for subject in `COMPOUND_SPLIT` */
- TRUE: 20
-};
-
-var stateSelectors = [{
- selector: ':selected',
- matches: function matches(ele) {
- return ele.selected();
- }
-}, {
- selector: ':unselected',
- matches: function matches(ele) {
- return !ele.selected();
- }
-}, {
- selector: ':selectable',
- matches: function matches(ele) {
- return ele.selectable();
- }
-}, {
- selector: ':unselectable',
- matches: function matches(ele) {
- return !ele.selectable();
- }
-}, {
- selector: ':locked',
- matches: function matches(ele) {
- return ele.locked();
- }
-}, {
- selector: ':unlocked',
- matches: function matches(ele) {
- return !ele.locked();
- }
-}, {
- selector: ':visible',
- matches: function matches(ele) {
- return ele.visible();
- }
-}, {
- selector: ':hidden',
- matches: function matches(ele) {
- return !ele.visible();
- }
-}, {
- selector: ':transparent',
- matches: function matches(ele) {
- return ele.transparent();
- }
-}, {
- selector: ':grabbed',
- matches: function matches(ele) {
- return ele.grabbed();
- }
-}, {
- selector: ':free',
- matches: function matches(ele) {
- return !ele.grabbed();
- }
-}, {
- selector: ':removed',
- matches: function matches(ele) {
- return ele.removed();
- }
-}, {
- selector: ':inside',
- matches: function matches(ele) {
- return !ele.removed();
- }
-}, {
- selector: ':grabbable',
- matches: function matches(ele) {
- return ele.grabbable();
- }
-}, {
- selector: ':ungrabbable',
- matches: function matches(ele) {
- return !ele.grabbable();
- }
-}, {
- selector: ':animated',
- matches: function matches(ele) {
- return ele.animated();
- }
-}, {
- selector: ':unanimated',
- matches: function matches(ele) {
- return !ele.animated();
- }
-}, {
- selector: ':parent',
- matches: function matches(ele) {
- return ele.isParent();
- }
-}, {
- selector: ':childless',
- matches: function matches(ele) {
- return ele.isChildless();
- }
-}, {
- selector: ':child',
- matches: function matches(ele) {
- return ele.isChild();
- }
-}, {
- selector: ':orphan',
- matches: function matches(ele) {
- return ele.isOrphan();
- }
-}, {
- selector: ':nonorphan',
- matches: function matches(ele) {
- return ele.isChild();
- }
-}, {
- selector: ':compound',
- matches: function matches(ele) {
- if (ele.isNode()) {
- return ele.isParent();
+var DepGraph = (exports.DepGraph = function DepGraph(opts) {
+ this.nodes = {}; // Node -> Node/Data (treated like a Set)
+ this.outgoingEdges = {}; // Node -> [Dependency Node]
+ this.incomingEdges = {}; // Node -> [Dependant Node]
+ this.circular = opts && !!opts.circular; // Allows circular deps
+});
+DepGraph.prototype = {
+ /**
+ * The number of nodes in the graph.
+ */
+ size: function () {
+ return Object.keys(this.nodes).length;
+ },
+ /**
+ * Add a node to the dependency graph. If a node already exists, this method will do nothing.
+ */
+ addNode: function (node, data) {
+ if (!this.hasNode(node)) {
+ // Checking the arguments length allows the user to add a node with undefined data
+ if (arguments.length === 2) {
+ this.nodes[node] = data;
+ } else {
+ this.nodes[node] = node;
+ }
+ this.outgoingEdges[node] = [];
+ this.incomingEdges[node] = [];
+ }
+ },
+ /**
+ * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.
+ */
+ removeNode: function (node) {
+ if (this.hasNode(node)) {
+ delete this.nodes[node];
+ delete this.outgoingEdges[node];
+ delete this.incomingEdges[node];
+ [this.incomingEdges, this.outgoingEdges].forEach(function (edgeList) {
+ Object.keys(edgeList).forEach(function (key) {
+ var idx = edgeList[key].indexOf(node);
+ if (idx >= 0) {
+ edgeList[key].splice(idx, 1);
+ }
+ }, this);
+ });
+ }
+ },
+ /**
+ * Check if a node exists in the graph
+ */
+ hasNode: function (node) {
+ return this.nodes.hasOwnProperty(node);
+ },
+ /**
+ * Get the data associated with a node name
+ */
+ getNodeData: function (node) {
+ if (this.hasNode(node)) {
+ return this.nodes[node];
} else {
- return ele.source().isParent() || ele.target().isParent();
+ throw new Error("Node does not exist: " + node);
+ }
+ },
+ /**
+ * Set the associated data for a given node name. If the node does not exist, this method will throw an error
+ */
+ setNodeData: function (node, data) {
+ if (this.hasNode(node)) {
+ this.nodes[node] = data;
+ } else {
+ throw new Error("Node does not exist: " + node);
+ }
+ },
+ /**
+ * Add a dependency between two nodes. If either of the nodes does not exist,
+ * an Error will be thrown.
+ */
+ addDependency: function (from, to) {
+ if (!this.hasNode(from)) {
+ throw new Error("Node does not exist: " + from);
+ }
+ if (!this.hasNode(to)) {
+ throw new Error("Node does not exist: " + to);
+ }
+ if (this.outgoingEdges[from].indexOf(to) === -1) {
+ this.outgoingEdges[from].push(to);
+ }
+ if (this.incomingEdges[to].indexOf(from) === -1) {
+ this.incomingEdges[to].push(from);
+ }
+ return true;
+ },
+ /**
+ * Remove a dependency between two nodes.
+ */
+ removeDependency: function (from, to) {
+ var idx;
+ if (this.hasNode(from)) {
+ idx = this.outgoingEdges[from].indexOf(to);
+ if (idx >= 0) {
+ this.outgoingEdges[from].splice(idx, 1);
+ }
}
- }
-}, {
- selector: ':loop',
- matches: function matches(ele) {
- return ele.isLoop();
- }
-}, {
- selector: ':simple',
- matches: function matches(ele) {
- return ele.isSimple();
- }
-}, {
- selector: ':active',
- matches: function matches(ele) {
- return ele.active();
- }
-}, {
- selector: ':inactive',
- matches: function matches(ele) {
- return !ele.active();
- }
-}, {
- selector: ':backgrounding',
- matches: function matches(ele) {
- return ele.backgrounding();
- }
-}, {
- selector: ':nonbackgrounding',
- matches: function matches(ele) {
- return !ele.backgrounding();
- }
-}].sort(function (a, b) {
- // n.b. selectors that are starting substrings of others must have the longer ones first
- return descending(a.selector, b.selector);
-});
-var lookup = function () {
- var selToFn = {};
- var s;
- for (var i = 0; i < stateSelectors.length; i++) {
- s = stateSelectors[i];
- selToFn[s.selector] = s.matches;
- }
- return selToFn;
-}();
-var stateSelectorMatches = function stateSelectorMatches(sel, ele) {
- return lookup[sel](ele);
-};
-var stateSelectorRegex = '(' + stateSelectors.map(function (s) {
- return s.selector;
-}).join('|') + ')';
-
-// when a token like a variable has escaped meta characters, we need to clean the backslashes out
-// so that values get compared properly in Selector.filter()
-var cleanMetaChars = function cleanMetaChars(str) {
- return str.replace(new RegExp('\\\\(' + tokens.metaChar + ')', 'g'), function (match, $1) {
- return $1;
- });
-};
-var replaceLastQuery = function replaceLastQuery(selector, examiningQuery, replacementQuery) {
- selector[selector.length - 1] = replacementQuery;
-};
-// NOTE: add new expression syntax here to have it recognised by the parser;
-// - a query contains all adjacent (i.e. no separator in between) expressions;
-// - the current query is stored in selector[i]
-// - you need to check the query objects in match() for it actually filter properly, but that's pretty straight forward
-var exprs = [{
- name: 'group',
- // just used for identifying when debugging
- query: true,
- regex: '(' + tokens.group + ')',
- populate: function populate(selector, query, _ref) {
- var _ref2 = _slicedToArray(_ref, 1),
- group = _ref2[0];
- query.checks.push({
- type: Type.GROUP,
- value: group === '*' ? group : group + 's'
- });
- }
-}, {
- name: 'state',
- query: true,
- regex: stateSelectorRegex,
- populate: function populate(selector, query, _ref3) {
- var _ref4 = _slicedToArray(_ref3, 1),
- state = _ref4[0];
- query.checks.push({
- type: Type.STATE,
- value: state
- });
- }
-}, {
- name: 'id',
- query: true,
- regex: '\\#(' + tokens.id + ')',
- populate: function populate(selector, query, _ref5) {
- var _ref6 = _slicedToArray(_ref5, 1),
- id = _ref6[0];
- query.checks.push({
- type: Type.ID,
- value: cleanMetaChars(id)
- });
- }
-}, {
- name: 'className',
- query: true,
- regex: '\\.(' + tokens.className + ')',
- populate: function populate(selector, query, _ref7) {
- var _ref8 = _slicedToArray(_ref7, 1),
- className = _ref8[0];
- query.checks.push({
- type: Type.CLASS,
- value: cleanMetaChars(className)
- });
- }
-}, {
- name: 'dataExists',
- query: true,
- regex: '\\[\\s*(' + tokens.variable + ')\\s*\\]',
- populate: function populate(selector, query, _ref9) {
- var _ref10 = _slicedToArray(_ref9, 1),
- variable = _ref10[0];
- query.checks.push({
- type: Type.DATA_EXIST,
- field: cleanMetaChars(variable)
+ if (this.hasNode(to)) {
+ idx = this.incomingEdges[to].indexOf(from);
+ if (idx >= 0) {
+ this.incomingEdges[to].splice(idx, 1);
+ }
+ }
+ },
+ /**
+ * Return a clone of the dependency graph. If any custom data is attached
+ * to the nodes, it will only be shallow copied.
+ */
+ clone: function () {
+ var source = this;
+ var result = new DepGraph();
+ var keys = Object.keys(source.nodes);
+ keys.forEach(function (n) {
+ result.nodes[n] = source.nodes[n];
+ result.outgoingEdges[n] = source.outgoingEdges[n].slice(0);
+ result.incomingEdges[n] = source.incomingEdges[n].slice(0);
});
- }
-}, {
- name: 'dataCompare',
- query: true,
- regex: '\\[\\s*(' + tokens.variable + ')\\s*(' + tokens.comparatorOp + ')\\s*(' + tokens.value + ')\\s*\\]',
- populate: function populate(selector, query, _ref11) {
- var _ref12 = _slicedToArray(_ref11, 3),
- variable = _ref12[0],
- comparatorOp = _ref12[1],
- value = _ref12[2];
- var valueIsString = new RegExp('^' + tokens.string + '$').exec(value) != null;
- if (valueIsString) {
- value = value.substring(1, value.length - 1);
+ return result;
+ },
+ /**
+ * Get an array containing the direct dependencies of the specified node.
+ *
+ * Throws an Error if the specified node does not exist.
+ */
+ directDependenciesOf: function (node) {
+ if (this.hasNode(node)) {
+ return this.outgoingEdges[node].slice(0);
} else {
- value = parseFloat(value);
+ throw new Error("Node does not exist: " + node);
}
- query.checks.push({
- type: Type.DATA_COMPARE,
- field: cleanMetaChars(variable),
- operator: comparatorOp,
- value: value
- });
- }
-}, {
- name: 'dataBool',
- query: true,
- regex: '\\[\\s*(' + tokens.boolOp + ')\\s*(' + tokens.variable + ')\\s*\\]',
- populate: function populate(selector, query, _ref13) {
- var _ref14 = _slicedToArray(_ref13, 2),
- boolOp = _ref14[0],
- variable = _ref14[1];
- query.checks.push({
- type: Type.DATA_BOOL,
- field: cleanMetaChars(variable),
- operator: boolOp
- });
- }
-}, {
- name: 'metaCompare',
- query: true,
- regex: '\\[\\[\\s*(' + tokens.meta + ')\\s*(' + tokens.comparatorOp + ')\\s*(' + tokens.number + ')\\s*\\]\\]',
- populate: function populate(selector, query, _ref15) {
- var _ref16 = _slicedToArray(_ref15, 3),
- meta = _ref16[0],
- comparatorOp = _ref16[1],
- number = _ref16[2];
- query.checks.push({
- type: Type.META_COMPARE,
- field: cleanMetaChars(meta),
- operator: comparatorOp,
- value: parseFloat(number)
- });
- }
-}, {
- name: 'nextQuery',
- separator: true,
- regex: tokens.separator,
- populate: function populate(selector, query) {
- var currentSubject = selector.currentSubject;
- var edgeCount = selector.edgeCount;
- var compoundCount = selector.compoundCount;
- var lastQ = selector[selector.length - 1];
- if (currentSubject != null) {
- lastQ.subject = currentSubject;
- selector.currentSubject = null;
+ },
+ /**
+ * Get an array containing the nodes that directly depend on the specified node.
+ *
+ * Throws an Error if the specified node does not exist.
+ */
+ directDependantsOf: function (node) {
+ if (this.hasNode(node)) {
+ return this.incomingEdges[node].slice(0);
+ } else {
+ throw new Error("Node does not exist: " + node);
}
- lastQ.edgeCount = edgeCount;
- lastQ.compoundCount = compoundCount;
- selector.edgeCount = 0;
- selector.compoundCount = 0;
-
- // go on to next query
- var nextQuery = selector[selector.length++] = newQuery();
- return nextQuery; // this is the new query to be filled by the following exprs
- }
-}, {
- name: 'directedEdge',
- separator: true,
- regex: tokens.directedEdge,
- populate: function populate(selector, query) {
- if (selector.currentSubject == null) {
- // undirected edge
- var edgeQuery = newQuery();
- var source = query;
- var target = newQuery();
- edgeQuery.checks.push({
- type: Type.DIRECTED_EDGE,
- source: source,
- target: target
- });
-
- // the query in the selector should be the edge rather than the source
- replaceLastQuery(selector, query, edgeQuery);
- selector.edgeCount++;
-
- // we're now populating the target query with expressions that follow
- return target;
+ },
+ /**
+ * Get an array containing the nodes that the specified node depends on (transitively).
+ *
+ * Throws an Error if the graph has a cycle, or the specified node does not exist.
+ *
+ * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned
+ * in the array.
+ */
+ dependenciesOf: function (node, leavesOnly) {
+ if (this.hasNode(node)) {
+ var result = [];
+ var DFS = createDFS(
+ this.outgoingEdges,
+ leavesOnly,
+ result,
+ this.circular
+ );
+ DFS(node);
+ var idx = result.indexOf(node);
+ if (idx >= 0) {
+ result.splice(idx, 1);
+ }
+ return result;
} else {
- // source/target
- var srcTgtQ = newQuery();
- var _source = query;
- var _target = newQuery();
- srcTgtQ.checks.push({
- type: Type.NODE_SOURCE,
- source: _source,
- target: _target
- });
-
- // the query in the selector should be the neighbourhood rather than the node
- replaceLastQuery(selector, query, srcTgtQ);
- selector.edgeCount++;
- return _target; // now populating the target with the following expressions
+ throw new Error("Node does not exist: " + node);
}
- }
-}, {
- name: 'undirectedEdge',
- separator: true,
- regex: tokens.undirectedEdge,
- populate: function populate(selector, query) {
- if (selector.currentSubject == null) {
- // undirected edge
- var edgeQuery = newQuery();
- var source = query;
- var target = newQuery();
- edgeQuery.checks.push({
- type: Type.UNDIRECTED_EDGE,
- nodes: [source, target]
- });
-
- // the query in the selector should be the edge rather than the source
- replaceLastQuery(selector, query, edgeQuery);
- selector.edgeCount++;
-
- // we're now populating the target query with expressions that follow
- return target;
+ },
+ /**
+ * get an array containing the nodes that depend on the specified node (transitively).
+ *
+ * Throws an Error if the graph has a cycle, or the specified node does not exist.
+ *
+ * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.
+ */
+ dependantsOf: function (node, leavesOnly) {
+ if (this.hasNode(node)) {
+ var result = [];
+ var DFS = createDFS(
+ this.incomingEdges,
+ leavesOnly,
+ result,
+ this.circular
+ );
+ DFS(node);
+ var idx = result.indexOf(node);
+ if (idx >= 0) {
+ result.splice(idx, 1);
+ }
+ return result;
} else {
- // neighbourhood
- var nhoodQ = newQuery();
- var node = query;
- var neighbor = newQuery();
- nhoodQ.checks.push({
- type: Type.NODE_NEIGHBOR,
- node: node,
- neighbor: neighbor
- });
-
- // the query in the selector should be the neighbourhood rather than the node
- replaceLastQuery(selector, query, nhoodQ);
- return neighbor; // now populating the neighbor with following expressions
+ throw new Error("Node does not exist: " + node);
}
- }
-}, {
- name: 'child',
- separator: true,
- regex: tokens.child,
- populate: function populate(selector, query) {
- if (selector.currentSubject == null) {
- // default: child query
- var parentChildQuery = newQuery();
- var child = newQuery();
- var parent = selector[selector.length - 1];
- parentChildQuery.checks.push({
- type: Type.CHILD,
- parent: parent,
- child: child
- });
-
- // the query in the selector should be the '>' itself
- replaceLastQuery(selector, query, parentChildQuery);
- selector.compoundCount++;
-
- // we're now populating the child query with expressions that follow
- return child;
- } else if (selector.currentSubject === query) {
- // compound split query
- var compound = newQuery();
- var left = selector[selector.length - 1];
- var right = newQuery();
- var subject = newQuery();
- var _child = newQuery();
- var _parent = newQuery();
-
- // set up the root compound q
- compound.checks.push({
- type: Type.COMPOUND_SPLIT,
- left: left,
- right: right,
- subject: subject
- });
-
- // populate the subject and replace the q at the old spot (within left) with TRUE
- subject.checks = query.checks; // take the checks from the left
- query.checks = [{
- type: Type.TRUE
- }]; // checks under left refs the subject implicitly
-
- // set up the right q
- _parent.checks.push({
- type: Type.TRUE
- }); // parent implicitly refs the subject
- right.checks.push({
- type: Type.PARENT,
- // type is swapped on right side queries
- parent: _parent,
- child: _child // empty for now
- });
-
- replaceLastQuery(selector, left, compound);
-
- // update the ref since we moved things around for `query`
- selector.currentSubject = subject;
- selector.compoundCount++;
- return _child; // now populating the right side's child
+ },
+ /**
+ * Construct the overall processing order for the dependency graph.
+ *
+ * Throws an Error if the graph has a cycle.
+ *
+ * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.
+ */
+ overallOrder: function (leavesOnly) {
+ var self = this;
+ var result = [];
+ var keys = Object.keys(this.nodes);
+ if (keys.length === 0) {
+ return result; // Empty graph
} else {
- // parent query
- // info for parent query
- var _parent2 = newQuery();
- var _child2 = newQuery();
- var pcQChecks = [{
- type: Type.PARENT,
- parent: _parent2,
- child: _child2
- }];
+ if (!this.circular) {
+ // Look for cycles - we run the DFS starting at all the nodes in case there
+ // are several disconnected subgraphs inside this dependency graph.
+ var CycleDFS = createDFS(this.outgoingEdges, false, [], this.circular);
+ keys.forEach(function (n) {
+ CycleDFS(n);
+ });
+ }
- // the parent-child query takes the place of the query previously being populated
- _parent2.checks = query.checks; // the previous query contains the checks for the parent
- query.checks = pcQChecks; // pc query takes over
+ var DFS = createDFS(
+ this.outgoingEdges,
+ leavesOnly,
+ result,
+ this.circular
+ );
+ // Find all potential starting points (nodes with nothing depending on them) an
+ // run a DFS starting at these points to get the order
+ keys
+ .filter(function (node) {
+ return self.incomingEdges[node].length === 0;
+ })
+ .forEach(function (n) {
+ DFS(n);
+ });
- selector.compoundCount++;
- return _child2; // we're now populating the child
+ // If we're allowing cycles - we need to run the DFS against any remaining
+ // nodes that did not end up in the initial result (as they are part of a
+ // subgraph that does not have a clear starting point)
+ if (this.circular) {
+ keys
+ .filter(function (node) {
+ return result.indexOf(node) === -1;
+ })
+ .forEach(function (n) {
+ DFS(n);
+ });
+ }
+
+ return result;
}
+ },
+ /**
+ * Get an array of nodes that have no dependants (i.e. nothing depends on them).
+ */
+ entryNodes: function () {
+ var self = this;
+ return Object.keys(this.nodes).filter(function (node) {
+ return self.incomingEdges[node].length === 0;
+ });
}
-}, {
- name: 'descendant',
- separator: true,
- regex: tokens.descendant,
- populate: function populate(selector, query) {
- if (selector.currentSubject == null) {
- // default: descendant query
- var ancChQuery = newQuery();
- var descendant = newQuery();
- var ancestor = selector[selector.length - 1];
- ancChQuery.checks.push({
- type: Type.DESCENDANT,
- ancestor: ancestor,
- descendant: descendant
- });
+};
- // the query in the selector should be the '>' itself
- replaceLastQuery(selector, query, ancChQuery);
- selector.compoundCount++;
+// Create some aliases
+DepGraph.prototype.directDependentsOf = DepGraph.prototype.directDependantsOf;
+DepGraph.prototype.dependentsOf = DepGraph.prototype.dependantsOf;
- // we're now populating the descendant query with expressions that follow
- return descendant;
- } else if (selector.currentSubject === query) {
- // compound split query
- var compound = newQuery();
- var left = selector[selector.length - 1];
- var right = newQuery();
- var subject = newQuery();
- var _descendant = newQuery();
- var _ancestor = newQuery();
+/**
+ * Cycle error, including the path of the cycle.
+ */
+var DepGraphCycleError = (exports.DepGraphCycleError = function (cyclePath) {
+ var message = "Dependency Cycle Found: " + cyclePath.join(" -> ");
+ var instance = new Error(message);
+ instance.cyclePath = cyclePath;
+ Object.setPrototypeOf(instance, Object.getPrototypeOf(this));
+ if (Error.captureStackTrace) {
+ Error.captureStackTrace(instance, DepGraphCycleError);
+ }
+ return instance;
+});
+DepGraphCycleError.prototype = Object.create(Error.prototype, {
+ constructor: {
+ value: Error,
+ enumerable: false,
+ writable: true,
+ configurable: true
+ }
+});
+Object.setPrototypeOf(DepGraphCycleError, Error);
- // set up the root compound q
- compound.checks.push({
- type: Type.COMPOUND_SPLIT,
- left: left,
- right: right,
- subject: subject
- });
- // populate the subject and replace the q at the old spot (within left) with TRUE
- subject.checks = query.checks; // take the checks from the left
- query.checks = [{
- type: Type.TRUE
- }]; // checks under left refs the subject implicitly
+/***/ }),
- // set up the right q
- _ancestor.checks.push({
- type: Type.TRUE
- }); // ancestor implicitly refs the subject
- right.checks.push({
- type: Type.ANCESTOR,
- // type is swapped on right side queries
- ancestor: _ancestor,
- descendant: _descendant // empty for now
- });
+/***/ "./node_modules/fast-isnumeric/index.js":
+/*!**********************************************!*\
+ !*** ./node_modules/fast-isnumeric/index.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- replaceLastQuery(selector, left, compound);
+"use strict";
+/**
+ * inspired by is-number <https://github.com/jonschlinkert/is-number>
+ * but significantly simplified and sped up by ignoring number and string constructors
+ * ie these return false:
+ * new Number(1)
+ * new String('1')
+ */
- // update the ref since we moved things around for `query`
- selector.currentSubject = subject;
- selector.compoundCount++;
- return _descendant; // now populating the right side's descendant
- } else {
- // ancestor query
- // info for parent query
- var _ancestor2 = newQuery();
- var _descendant2 = newQuery();
- var adQChecks = [{
- type: Type.ANCESTOR,
- ancestor: _ancestor2,
- descendant: _descendant2
- }];
- // the parent-child query takes the place of the query previously being populated
- _ancestor2.checks = query.checks; // the previous query contains the checks for the parent
- query.checks = adQChecks; // pc query takes over
- selector.compoundCount++;
- return _descendant2; // we're now populating the child
- }
- }
-}, {
- name: 'subject',
- modifier: true,
- regex: tokens.subject,
- populate: function populate(selector, query) {
- if (selector.currentSubject != null && selector.currentSubject !== query) {
- warn('Redefinition of subject in selector `' + selector.toString() + '`');
- return false;
+var allBlankCharCodes = __webpack_require__(/*! is-string-blank */ "./node_modules/is-string-blank/index.js");
+
+module.exports = function(n) {
+ var type = typeof n;
+ if(type === 'string') {
+ var original = n;
+ n = +n;
+ // whitespace strings cast to zero - filter them out
+ if(n===0 && allBlankCharCodes(original)) return false;
}
- selector.currentSubject = query;
- var topQ = selector[selector.length - 1];
- var topChk = topQ.checks[0];
- var topType = topChk == null ? null : topChk.type;
- if (topType === Type.DIRECTED_EDGE) {
- // directed edge with subject on the target
+ else if(type !== 'number') return false;
- // change to target node check
- topChk.type = Type.NODE_TARGET;
- } else if (topType === Type.UNDIRECTED_EDGE) {
- // undirected edge with subject on the second node
+ return n - n < 1;
+};
- // change to neighbor check
- topChk.type = Type.NODE_NEIGHBOR;
- topChk.node = topChk.nodes[1]; // second node is subject
- topChk.neighbor = topChk.nodes[0];
- // clean up unused fields for new type
- topChk.nodes = null;
- }
- }
-}];
-exprs.forEach(function (e) {
- return e.regexObj = new RegExp('^' + e.regex);
-});
+/***/ }),
+
+/***/ "./node_modules/graphlib/index.js":
+/*!****************************************!*\
+ !*** ./node_modules/graphlib/index.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
/**
- * Of all the expressions, find the first match in the remaining text.
- * @param {string} remaining The remaining text to parse
- * @returns The matched expression and the newly remaining text `{ expr, match, name, remaining }`
+ * Copyright (c) 2014, Chris Pettitt
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice, this
+ * list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ * this list of conditions and the following disclaimer in the documentation
+ * and/or other materials provided with the distribution.
+ *
+ * 3. Neither the name of the copyright holder nor the names of its contributors
+ * may be used to endorse or promote products derived from this software without
+ * specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
-var consumeExpr = function consumeExpr(remaining) {
- var expr;
- var match;
- var name;
- for (var j = 0; j < exprs.length; j++) {
- var e = exprs[j];
- var n = e.name;
- var m = remaining.match(e.regexObj);
- if (m != null) {
- match = m;
- expr = e;
- name = n;
- var consumed = m[0];
- remaining = remaining.substring(consumed.length);
- break; // we've consumed one expr, so we can return now
- }
- }
- return {
- expr: expr,
- match: match,
- name: name,
- remaining: remaining
- };
-};
+var lib = __webpack_require__(/*! ./lib */ "./node_modules/graphlib/lib/index.js");
-/**
- * Consume all the leading whitespace
- * @param {string} remaining The text to consume
- * @returns The text with the leading whitespace removed
- */
-var consumeWhitespace = function consumeWhitespace(remaining) {
- var match = remaining.match(/^\s+/);
- if (match) {
- var consumed = match[0];
- remaining = remaining.substring(consumed.length);
- }
- return remaining;
+module.exports = {
+ Graph: lib.Graph,
+ json: __webpack_require__(/*! ./lib/json */ "./node_modules/graphlib/lib/json.js"),
+ alg: __webpack_require__(/*! ./lib/alg */ "./node_modules/graphlib/lib/alg/index.js"),
+ version: lib.version
};
-/**
- * Parse the string and store the parsed representation in the Selector.
- * @param {string} selector The selector string
- * @returns `true` if the selector was successfully parsed, `false` otherwise
- */
-var parse = function parse(selector) {
- var self = this;
- var remaining = self.inputText = selector;
- var currentQuery = self[0] = newQuery();
- self.length = 1;
- remaining = consumeWhitespace(remaining); // get rid of leading whitespace
- for (;;) {
- var exprInfo = consumeExpr(remaining);
- if (exprInfo.expr == null) {
- warn('The selector `' + selector + '`is invalid');
- return false;
- } else {
- var args = exprInfo.match.slice(1);
+/***/ }),
- // let the token populate the selector object in currentQuery
- var ret = exprInfo.expr.populate(self, currentQuery, args);
- if (ret === false) {
- return false; // exit if population failed
- } else if (ret != null) {
- currentQuery = ret; // change the current query to be filled if the expr specifies
- }
- }
+/***/ "./node_modules/graphlib/lib/alg/components.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/components.js ***!
+ \*****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- remaining = exprInfo.remaining;
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
- // we're done when there's nothing left to parse
- if (remaining.match(/^\s*$/)) {
- break;
- }
- }
- var lastQ = self[self.length - 1];
- if (self.currentSubject != null) {
- lastQ.subject = self.currentSubject;
+module.exports = components;
+
+function components(g) {
+ var visited = {};
+ var cmpts = [];
+ var cmpt;
+
+ function dfs(v) {
+ if (_.has(visited, v)) return;
+ visited[v] = true;
+ cmpt.push(v);
+ _.each(g.successors(v), dfs);
+ _.each(g.predecessors(v), dfs);
}
- lastQ.edgeCount = self.edgeCount;
- lastQ.compoundCount = self.compoundCount;
- for (var i = 0; i < self.length; i++) {
- var q = self[i];
- // in future, this could potentially be allowed if there were operator precedence and detection of invalid combinations
- if (q.compoundCount > 0 && q.edgeCount > 0) {
- warn('The selector `' + selector + '` is invalid because it uses both a compound selector and an edge selector');
- return false;
- }
- if (q.edgeCount > 1) {
- warn('The selector `' + selector + '` is invalid because it uses multiple edge selectors');
- return false;
- } else if (q.edgeCount === 1) {
- warn('The selector `' + selector + '` is deprecated. Edge selectors do not take effect on changes to source and target nodes after an edge is added, for performance reasons. Use a class or data selector on edges instead, updating the class or data of an edge when your app detects a change in source or target nodes.');
+ _.each(g.nodes(), function(v) {
+ cmpt = [];
+ dfs(v);
+ if (cmpt.length) {
+ cmpts.push(cmpt);
}
- }
- return true; // success
-};
+ });
-/**
- * Get the selector represented as a string. This value uses default formatting,
- * so things like spacing may differ from the input text passed to the constructor.
- * @returns {string} The selector string
+ return cmpts;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/dfs.js":
+/*!**********************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/dfs.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = dfs;
+
+/*
+ * A helper that preforms a pre- or post-order traversal on the input graph
+ * and returns the nodes in the order they were visited. If the graph is
+ * undirected then this algorithm will navigate using neighbors. If the graph
+ * is directed then this algorithm will navigate using successors.
+ *
+ * Order must be one of "pre" or "post".
*/
-var toString = function toString() {
- if (this.toStringCache != null) {
- return this.toStringCache;
+function dfs(g, vs, order) {
+ if (!_.isArray(vs)) {
+ vs = [vs];
}
- var clean = function clean(obj) {
- if (obj == null) {
- return '';
- } else {
- return obj;
- }
- };
- var cleanVal = function cleanVal(val) {
- if (string(val)) {
- return '"' + val + '"';
- } else {
- return clean(val);
+
+ var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
+
+ var acc = [];
+ var visited = {};
+ _.each(vs, function(v) {
+ if (!g.hasNode(v)) {
+ throw new Error("Graph does not have node: " + v);
}
- };
- var space = function space(val) {
- return ' ' + val + ' ';
- };
- var checkToString = function checkToString(check, subject) {
- var type = check.type,
- value = check.value;
- switch (type) {
- case Type.GROUP:
- {
- var group = clean(value);
- return group.substring(0, group.length - 1);
- }
- case Type.DATA_COMPARE:
- {
- var field = check.field,
- operator = check.operator;
- return '[' + field + space(clean(operator)) + cleanVal(value) + ']';
- }
- case Type.DATA_BOOL:
- {
- var _operator = check.operator,
- _field = check.field;
- return '[' + clean(_operator) + _field + ']';
- }
- case Type.DATA_EXIST:
- {
- var _field2 = check.field;
- return '[' + _field2 + ']';
- }
- case Type.META_COMPARE:
- {
- var _operator2 = check.operator,
- _field3 = check.field;
- return '[[' + _field3 + space(clean(_operator2)) + cleanVal(value) + ']]';
- }
- case Type.STATE:
- {
- return value;
- }
- case Type.ID:
- {
- return '#' + value;
- }
- case Type.CLASS:
- {
- return '.' + value;
- }
- case Type.PARENT:
- case Type.CHILD:
- {
- return queryToString(check.parent, subject) + space('>') + queryToString(check.child, subject);
- }
- case Type.ANCESTOR:
- case Type.DESCENDANT:
- {
- return queryToString(check.ancestor, subject) + ' ' + queryToString(check.descendant, subject);
- }
- case Type.COMPOUND_SPLIT:
- {
- var lhs = queryToString(check.left, subject);
- var sub = queryToString(check.subject, subject);
- var rhs = queryToString(check.right, subject);
- return lhs + (lhs.length > 0 ? ' ' : '') + sub + rhs;
- }
- case Type.TRUE:
- {
- return '';
- }
- }
- };
- var queryToString = function queryToString(query, subject) {
- return query.checks.reduce(function (str, chk, i) {
- return str + (subject === query && i === 0 ? '$' : '') + checkToString(chk, subject);
- }, '');
- };
- var str = '';
- for (var i = 0; i < this.length; i++) {
- var query = this[i];
- str += queryToString(query, query.subject);
- if (this.length > 1 && i < this.length - 1) {
- str += ', ';
- }
- }
- this.toStringCache = str;
- return str;
-};
-var parse$1 = {
- parse: parse,
- toString: toString
-};
-var valCmp = function valCmp(fieldVal, operator, value) {
- var matches;
- var isFieldStr = string(fieldVal);
- var isFieldNum = number$1(fieldVal);
- var isValStr = string(value);
- var fieldStr, valStr;
- var caseInsensitive = false;
- var notExpr = false;
- var isIneqCmp = false;
- if (operator.indexOf('!') >= 0) {
- operator = operator.replace('!', '');
- notExpr = true;
- }
- if (operator.indexOf('@') >= 0) {
- operator = operator.replace('@', '');
- caseInsensitive = true;
- }
- if (isFieldStr || isValStr || caseInsensitive) {
- fieldStr = !isFieldStr && !isFieldNum ? '' : '' + fieldVal;
- valStr = '' + value;
- }
+ doDfs(g, v, order === "post", visited, navigation, acc);
+ });
+ return acc;
+}
- // if we're doing a case insensitive comparison, then we're using a STRING comparison
- // even if we're comparing numbers
- if (caseInsensitive) {
- fieldVal = fieldStr = fieldStr.toLowerCase();
- value = valStr = valStr.toLowerCase();
- }
- switch (operator) {
- case '*=':
- matches = fieldStr.indexOf(valStr) >= 0;
- break;
- case '$=':
- matches = fieldStr.indexOf(valStr, fieldStr.length - valStr.length) >= 0;
- break;
- case '^=':
- matches = fieldStr.indexOf(valStr) === 0;
- break;
- case '=':
- matches = fieldVal === value;
- break;
- case '>':
- isIneqCmp = true;
- matches = fieldVal > value;
- break;
- case '>=':
- isIneqCmp = true;
- matches = fieldVal >= value;
- break;
- case '<':
- isIneqCmp = true;
- matches = fieldVal < value;
- break;
- case '<=':
- isIneqCmp = true;
- matches = fieldVal <= value;
- break;
- default:
- matches = false;
- break;
- }
+function doDfs(g, v, postorder, visited, navigation, acc) {
+ if (!_.has(visited, v)) {
+ visited[v] = true;
- // apply the not op, but null vals for inequalities should always stay non-matching
- if (notExpr && (fieldVal != null || !isIneqCmp)) {
- matches = !matches;
- }
- return matches;
-};
-var boolCmp = function boolCmp(fieldVal, operator) {
- switch (operator) {
- case '?':
- return fieldVal ? true : false;
- case '!':
- return fieldVal ? false : true;
- case '^':
- return fieldVal === undefined;
+ if (!postorder) { acc.push(v); }
+ _.each(navigation(v), function(w) {
+ doDfs(g, w, postorder, visited, navigation, acc);
+ });
+ if (postorder) { acc.push(v); }
}
-};
-var existCmp = function existCmp(fieldVal) {
- return fieldVal !== undefined;
-};
-var data$1 = function data(ele, field) {
- return ele.data(field);
-};
-var meta = function meta(ele, field) {
- return ele[field]();
-};
+}
-/** A lookup of `match(check, ele)` functions by `Type` int */
-var match = [];
-/**
- * Returns whether the query matches for the element
- * @param query The `{ type, value, ... }` query object
- * @param ele The element to compare against
-*/
-var matches$1 = function matches(query, ele) {
- return query.checks.every(function (chk) {
- return match[chk.type](chk, ele);
- });
-};
-match[Type.GROUP] = function (check, ele) {
- var group = check.value;
- return group === '*' || group === ele.group();
-};
-match[Type.STATE] = function (check, ele) {
- var stateSelector = check.value;
- return stateSelectorMatches(stateSelector, ele);
-};
-match[Type.ID] = function (check, ele) {
- var id = check.value;
- return ele.id() === id;
-};
-match[Type.CLASS] = function (check, ele) {
- var cls = check.value;
- return ele.hasClass(cls);
-};
-match[Type.META_COMPARE] = function (check, ele) {
- var field = check.field,
- operator = check.operator,
- value = check.value;
- return valCmp(meta(ele, field), operator, value);
-};
-match[Type.DATA_COMPARE] = function (check, ele) {
- var field = check.field,
- operator = check.operator,
- value = check.value;
- return valCmp(data$1(ele, field), operator, value);
-};
-match[Type.DATA_BOOL] = function (check, ele) {
- var field = check.field,
- operator = check.operator;
- return boolCmp(data$1(ele, field), operator);
-};
-match[Type.DATA_EXIST] = function (check, ele) {
- var field = check.field;
- check.operator;
- return existCmp(data$1(ele, field));
-};
-match[Type.UNDIRECTED_EDGE] = function (check, ele) {
- var qA = check.nodes[0];
- var qB = check.nodes[1];
- var src = ele.source();
- var tgt = ele.target();
- return matches$1(qA, src) && matches$1(qB, tgt) || matches$1(qB, src) && matches$1(qA, tgt);
-};
-match[Type.NODE_NEIGHBOR] = function (check, ele) {
- return matches$1(check.node, ele) && ele.neighborhood().some(function (n) {
- return n.isNode() && matches$1(check.neighbor, n);
- });
-};
-match[Type.DIRECTED_EDGE] = function (check, ele) {
- return matches$1(check.source, ele.source()) && matches$1(check.target, ele.target());
-};
-match[Type.NODE_SOURCE] = function (check, ele) {
- return matches$1(check.source, ele) && ele.outgoers().some(function (n) {
- return n.isNode() && matches$1(check.target, n);
- });
-};
-match[Type.NODE_TARGET] = function (check, ele) {
- return matches$1(check.target, ele) && ele.incomers().some(function (n) {
- return n.isNode() && matches$1(check.source, n);
- });
-};
-match[Type.CHILD] = function (check, ele) {
- return matches$1(check.child, ele) && matches$1(check.parent, ele.parent());
-};
-match[Type.PARENT] = function (check, ele) {
- return matches$1(check.parent, ele) && ele.children().some(function (c) {
- return matches$1(check.child, c);
- });
-};
-match[Type.DESCENDANT] = function (check, ele) {
- return matches$1(check.descendant, ele) && ele.ancestors().some(function (a) {
- return matches$1(check.ancestor, a);
- });
-};
-match[Type.ANCESTOR] = function (check, ele) {
- return matches$1(check.ancestor, ele) && ele.descendants().some(function (d) {
- return matches$1(check.descendant, d);
- });
-};
-match[Type.COMPOUND_SPLIT] = function (check, ele) {
- return matches$1(check.subject, ele) && matches$1(check.left, ele) && matches$1(check.right, ele);
-};
-match[Type.TRUE] = function () {
- return true;
-};
-match[Type.COLLECTION] = function (check, ele) {
- var collection = check.value;
- return collection.has(ele);
-};
-match[Type.FILTER] = function (check, ele) {
- var filter = check.value;
- return filter(ele);
-};
+/***/ }),
-// filter an existing collection
-var filter = function filter(collection) {
- var self = this;
+/***/ "./node_modules/graphlib/lib/alg/dijkstra-all.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/dijkstra-all.js ***!
+ \*******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // for 1 id #foo queries, just get the element
- if (self.length === 1 && self[0].checks.length === 1 && self[0].checks[0].type === Type.ID) {
- return collection.getElementById(self[0].checks[0].value).collection();
- }
- var selectorFunction = function selectorFunction(element) {
- for (var j = 0; j < self.length; j++) {
- var query = self[j];
- if (matches$1(query, element)) {
- return true;
- }
- }
- return false;
- };
- if (self.text() == null) {
- selectorFunction = function selectorFunction() {
- return true;
- };
- }
- return collection.filter(selectorFunction);
-}; // filter
+var dijkstra = __webpack_require__(/*! ./dijkstra */ "./node_modules/graphlib/lib/alg/dijkstra.js");
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
-// does selector match a single element?
-var matches = function matches(ele) {
- var self = this;
- for (var j = 0; j < self.length; j++) {
- var query = self[j];
- if (matches$1(query, ele)) {
- return true;
- }
- }
- return false;
-}; // matches
+module.exports = dijkstraAll;
-var matching = {
- matches: matches,
- filter: filter
-};
+function dijkstraAll(g, weightFunc, edgeFunc) {
+ return _.transform(g.nodes(), function(acc, v) {
+ acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
+ }, {});
+}
-var Selector = function Selector(selector) {
- this.inputText = selector;
- this.currentSubject = null;
- this.compoundCount = 0;
- this.edgeCount = 0;
- this.length = 0;
- if (selector == null || string(selector) && selector.match(/^\s*$/)) ; else if (elementOrCollection(selector)) {
- this.addQuery({
- checks: [{
- type: Type.COLLECTION,
- value: selector.collection()
- }]
- });
- } else if (fn$6(selector)) {
- this.addQuery({
- checks: [{
- type: Type.FILTER,
- value: selector
- }]
- });
- } else if (string(selector)) {
- if (!this.parse(selector)) {
- this.invalid = true;
- }
- } else {
- error('A selector must be created from a string; found ');
- }
-};
-var selfn = Selector.prototype;
-[parse$1, matching].forEach(function (p) {
- return extend(selfn, p);
-});
-selfn.text = function () {
- return this.inputText;
-};
-selfn.size = function () {
- return this.length;
-};
-selfn.eq = function (i) {
- return this[i];
-};
-selfn.sameText = function (otherSel) {
- return !this.invalid && !otherSel.invalid && this.text() === otherSel.text();
-};
-selfn.addQuery = function (q) {
- this[this.length++] = q;
-};
-selfn.selector = selfn.toString;
-var elesfn$g = {
- allAre: function allAre(selector) {
- var selObj = new Selector(selector);
- return this.every(function (ele) {
- return selObj.matches(ele);
- });
- },
- is: function is(selector) {
- var selObj = new Selector(selector);
- return this.some(function (ele) {
- return selObj.matches(ele);
- });
- },
- some: function some(fn, thisArg) {
- for (var i = 0; i < this.length; i++) {
- var ret = !thisArg ? fn(this[i], i, this) : fn.apply(thisArg, [this[i], i, this]);
- if (ret) {
- return true;
- }
- }
- return false;
- },
- every: function every(fn, thisArg) {
- for (var i = 0; i < this.length; i++) {
- var ret = !thisArg ? fn(this[i], i, this) : fn.apply(thisArg, [this[i], i, this]);
- if (!ret) {
- return false;
- }
- }
- return true;
- },
- same: function same(collection) {
- // cheap collection ref check
- if (this === collection) {
- return true;
- }
- collection = this.cy().collection(collection);
- var thisLength = this.length;
- var collectionLength = collection.length;
+/***/ }),
- // cheap length check
- if (thisLength !== collectionLength) {
- return false;
- }
+/***/ "./node_modules/graphlib/lib/alg/dijkstra.js":
+/*!***************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/dijkstra.js ***!
+ \***************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // cheap element ref check
- if (thisLength === 1) {
- return this[0] === collection[0];
- }
- return this.every(function (ele) {
- return collection.hasElementWithId(ele.id());
- });
- },
- anySame: function anySame(collection) {
- collection = this.cy().collection(collection);
- return this.some(function (ele) {
- return collection.hasElementWithId(ele.id());
- });
- },
- allAreNeighbors: function allAreNeighbors(collection) {
- collection = this.cy().collection(collection);
- var nhood = this.neighborhood();
- return collection.every(function (ele) {
- return nhood.hasElementWithId(ele.id());
- });
- },
- contains: function contains(collection) {
- collection = this.cy().collection(collection);
- var self = this;
- return collection.every(function (ele) {
- return self.hasElementWithId(ele.id());
- });
- }
-};
-elesfn$g.allAreNeighbours = elesfn$g.allAreNeighbors;
-elesfn$g.has = elesfn$g.contains;
-elesfn$g.equal = elesfn$g.equals = elesfn$g.same;
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var PriorityQueue = __webpack_require__(/*! ../data/priority-queue */ "./node_modules/graphlib/lib/data/priority-queue.js");
-var cache = function cache(fn, name) {
- return function traversalCache(arg1, arg2, arg3, arg4) {
- var selectorOrEles = arg1;
- var eles = this;
- var key;
- if (selectorOrEles == null) {
- key = '';
- } else if (elementOrCollection(selectorOrEles) && selectorOrEles.length === 1) {
- key = selectorOrEles.id();
+module.exports = dijkstra;
+
+var DEFAULT_WEIGHT_FUNC = _.constant(1);
+
+function dijkstra(g, source, weightFn, edgeFn) {
+ return runDijkstra(g, String(source),
+ weightFn || DEFAULT_WEIGHT_FUNC,
+ edgeFn || function(v) { return g.outEdges(v); });
+}
+
+function runDijkstra(g, source, weightFn, edgeFn) {
+ var results = {};
+ var pq = new PriorityQueue();
+ var v, vEntry;
+
+ var updateNeighbors = function(edge) {
+ var w = edge.v !== v ? edge.v : edge.w;
+ var wEntry = results[w];
+ var weight = weightFn(edge);
+ var distance = vEntry.distance + weight;
+
+ if (weight < 0) {
+ throw new Error("dijkstra does not allow negative edge weights. " +
+ "Bad edge: " + edge + " Weight: " + weight);
}
- if (eles.length === 1 && key) {
- var _p = eles[0]._private;
- var tch = _p.traversalCache = _p.traversalCache || {};
- var ch = tch[name] = tch[name] || [];
- var hash = hashString(key);
- var cacheHit = ch[hash];
- if (cacheHit) {
- return cacheHit;
- } else {
- return ch[hash] = fn.call(eles, arg1, arg2, arg3, arg4);
- }
- } else {
- return fn.call(eles, arg1, arg2, arg3, arg4);
+
+ if (distance < wEntry.distance) {
+ wEntry.distance = distance;
+ wEntry.predecessor = v;
+ pq.decrease(w, distance);
}
};
-};
-var elesfn$f = {
- parent: function parent(selector) {
- var parents = [];
+ g.nodes().forEach(function(v) {
+ var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
+ results[v] = { distance: distance };
+ pq.add(v, distance);
+ });
- // optimisation for single ele call
- if (this.length === 1) {
- var parent = this[0]._private.parent;
- if (parent) {
- return parent;
- }
- }
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var _parent = ele._private.parent;
- if (_parent) {
- parents.push(_parent);
- }
- }
- return this.spawn(parents, true).filter(selector);
- },
- parents: function parents(selector) {
- var parents = [];
- var eles = this.parent();
- while (eles.nonempty()) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- parents.push(ele);
- }
- eles = eles.parent();
- }
- return this.spawn(parents, true).filter(selector);
- },
- commonAncestors: function commonAncestors(selector) {
- var ancestors;
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var parents = ele.parents();
- ancestors = ancestors || parents;
- ancestors = ancestors.intersect(parents); // current list must be common with current ele parents set
+ while (pq.size() > 0) {
+ v = pq.removeMin();
+ vEntry = results[v];
+ if (vEntry.distance === Number.POSITIVE_INFINITY) {
+ break;
}
- return ancestors.filter(selector);
- },
- orphans: function orphans(selector) {
- return this.stdFilter(function (ele) {
- return ele.isOrphan();
- }).filter(selector);
- },
- nonorphans: function nonorphans(selector) {
- return this.stdFilter(function (ele) {
- return ele.isChild();
- }).filter(selector);
- },
- children: cache(function (selector) {
- var children = [];
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var eleChildren = ele._private.children;
- for (var j = 0; j < eleChildren.length; j++) {
- children.push(eleChildren[j]);
+ edgeFn(v).forEach(updateNeighbors);
+ }
+
+ return results;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/find-cycles.js":
+/*!******************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/find-cycles.js ***!
+ \******************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var tarjan = __webpack_require__(/*! ./tarjan */ "./node_modules/graphlib/lib/alg/tarjan.js");
+
+module.exports = findCycles;
+
+function findCycles(g) {
+ return _.filter(tarjan(g), function(cmpt) {
+ return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));
+ });
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/floyd-warshall.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/floyd-warshall.js ***!
+ \*********************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = floydWarshall;
+
+var DEFAULT_WEIGHT_FUNC = _.constant(1);
+
+function floydWarshall(g, weightFn, edgeFn) {
+ return runFloydWarshall(g,
+ weightFn || DEFAULT_WEIGHT_FUNC,
+ edgeFn || function(v) { return g.outEdges(v); });
+}
+
+function runFloydWarshall(g, weightFn, edgeFn) {
+ var results = {};
+ var nodes = g.nodes();
+
+ nodes.forEach(function(v) {
+ results[v] = {};
+ results[v][v] = { distance: 0 };
+ nodes.forEach(function(w) {
+ if (v !== w) {
+ results[v][w] = { distance: Number.POSITIVE_INFINITY };
}
- }
- return this.spawn(children, true).filter(selector);
- }, 'children'),
- siblings: function siblings(selector) {
- return this.parent().children().not(this).filter(selector);
- },
- isParent: function isParent() {
- var ele = this[0];
- if (ele) {
- return ele.isNode() && ele._private.children.length !== 0;
- }
- },
- isChildless: function isChildless() {
- var ele = this[0];
- if (ele) {
- return ele.isNode() && ele._private.children.length === 0;
- }
- },
- isChild: function isChild() {
- var ele = this[0];
- if (ele) {
- return ele.isNode() && ele._private.parent != null;
- }
- },
- isOrphan: function isOrphan() {
- var ele = this[0];
- if (ele) {
- return ele.isNode() && ele._private.parent == null;
- }
- },
- descendants: function descendants(selector) {
- var elements = [];
- function add(eles) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- elements.push(ele);
- if (ele.children().nonempty()) {
- add(ele.children());
+ });
+ edgeFn(v).forEach(function(edge) {
+ var w = edge.v === v ? edge.w : edge.v;
+ var d = weightFn(edge);
+ results[v][w] = { distance: d, predecessor: v };
+ });
+ });
+
+ nodes.forEach(function(k) {
+ var rowK = results[k];
+ nodes.forEach(function(i) {
+ var rowI = results[i];
+ nodes.forEach(function(j) {
+ var ik = rowI[k];
+ var kj = rowK[j];
+ var ij = rowI[j];
+ var altDistance = ik.distance + kj.distance;
+ if (altDistance < ij.distance) {
+ ij.distance = altDistance;
+ ij.predecessor = kj.predecessor;
}
- }
+ });
+ });
+ });
+
+ return results;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/index.js":
+/*!************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/index.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+module.exports = {
+ components: __webpack_require__(/*! ./components */ "./node_modules/graphlib/lib/alg/components.js"),
+ dijkstra: __webpack_require__(/*! ./dijkstra */ "./node_modules/graphlib/lib/alg/dijkstra.js"),
+ dijkstraAll: __webpack_require__(/*! ./dijkstra-all */ "./node_modules/graphlib/lib/alg/dijkstra-all.js"),
+ findCycles: __webpack_require__(/*! ./find-cycles */ "./node_modules/graphlib/lib/alg/find-cycles.js"),
+ floydWarshall: __webpack_require__(/*! ./floyd-warshall */ "./node_modules/graphlib/lib/alg/floyd-warshall.js"),
+ isAcyclic: __webpack_require__(/*! ./is-acyclic */ "./node_modules/graphlib/lib/alg/is-acyclic.js"),
+ postorder: __webpack_require__(/*! ./postorder */ "./node_modules/graphlib/lib/alg/postorder.js"),
+ preorder: __webpack_require__(/*! ./preorder */ "./node_modules/graphlib/lib/alg/preorder.js"),
+ prim: __webpack_require__(/*! ./prim */ "./node_modules/graphlib/lib/alg/prim.js"),
+ tarjan: __webpack_require__(/*! ./tarjan */ "./node_modules/graphlib/lib/alg/tarjan.js"),
+ topsort: __webpack_require__(/*! ./topsort */ "./node_modules/graphlib/lib/alg/topsort.js")
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/is-acyclic.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/is-acyclic.js ***!
+ \*****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var topsort = __webpack_require__(/*! ./topsort */ "./node_modules/graphlib/lib/alg/topsort.js");
+
+module.exports = isAcyclic;
+
+function isAcyclic(g) {
+ try {
+ topsort(g);
+ } catch (e) {
+ if (e instanceof topsort.CycleException) {
+ return false;
}
- add(this.children());
- return this.spawn(elements, true).filter(selector);
+ throw e;
}
-};
-function forEachCompound(eles, fn, includeSelf, recursiveStep) {
- var q = [];
- var did = new Set$1();
- var cy = eles.cy();
- var hasCompounds = cy.hasCompoundNodes();
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- if (includeSelf) {
- q.push(ele);
- } else if (hasCompounds) {
- recursiveStep(q, did, ele);
+ return true;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/postorder.js":
+/*!****************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/postorder.js ***!
+ \****************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var dfs = __webpack_require__(/*! ./dfs */ "./node_modules/graphlib/lib/alg/dfs.js");
+
+module.exports = postorder;
+
+function postorder(g, vs) {
+ return dfs(g, vs, "post");
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/preorder.js":
+/*!***************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/preorder.js ***!
+ \***************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var dfs = __webpack_require__(/*! ./dfs */ "./node_modules/graphlib/lib/alg/dfs.js");
+
+module.exports = preorder;
+
+function preorder(g, vs) {
+ return dfs(g, vs, "pre");
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/prim.js":
+/*!***********************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/prim.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var Graph = __webpack_require__(/*! ../graph */ "./node_modules/graphlib/lib/graph.js");
+var PriorityQueue = __webpack_require__(/*! ../data/priority-queue */ "./node_modules/graphlib/lib/data/priority-queue.js");
+
+module.exports = prim;
+
+function prim(g, weightFunc) {
+ var result = new Graph();
+ var parents = {};
+ var pq = new PriorityQueue();
+ var v;
+
+ function updateNeighbors(edge) {
+ var w = edge.v === v ? edge.w : edge.v;
+ var pri = pq.priority(w);
+ if (pri !== undefined) {
+ var edgeWeight = weightFunc(edge);
+ if (edgeWeight < pri) {
+ parents[w] = v;
+ pq.decrease(w, edgeWeight);
+ }
}
}
- while (q.length > 0) {
- var _ele = q.shift();
- fn(_ele);
- did.add(_ele.id());
- if (hasCompounds) {
- recursiveStep(q, did, _ele);
+
+ if (g.nodeCount() === 0) {
+ return result;
+ }
+
+ _.each(g.nodes(), function(v) {
+ pq.add(v, Number.POSITIVE_INFINITY);
+ result.setNode(v);
+ });
+
+ // Start from an arbitrary node
+ pq.decrease(g.nodes()[0], 0);
+
+ var init = false;
+ while (pq.size() > 0) {
+ v = pq.removeMin();
+ if (_.has(parents, v)) {
+ result.setEdge(v, parents[v]);
+ } else if (init) {
+ throw new Error("Input graph is not connected: " + g);
+ } else {
+ init = true;
}
+
+ g.nodeEdges(v).forEach(updateNeighbors);
}
- return eles;
+
+ return result;
}
-function addChildren(q, did, ele) {
- if (ele.isParent()) {
- var children = ele._private.children;
- for (var i = 0; i < children.length; i++) {
- var child = children[i];
- if (!did.has(child.id())) {
- q.push(child);
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/tarjan.js":
+/*!*************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/tarjan.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = tarjan;
+
+function tarjan(g) {
+ var index = 0;
+ var stack = [];
+ var visited = {}; // node id -> { onStack, lowlink, index }
+ var results = [];
+
+ function dfs(v) {
+ var entry = visited[v] = {
+ onStack: true,
+ lowlink: index,
+ index: index++
+ };
+ stack.push(v);
+
+ g.successors(v).forEach(function(w) {
+ if (!_.has(visited, w)) {
+ dfs(w);
+ entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);
+ } else if (visited[w].onStack) {
+ entry.lowlink = Math.min(entry.lowlink, visited[w].index);
}
+ });
+
+ if (entry.lowlink === entry.index) {
+ var cmpt = [];
+ var w;
+ do {
+ w = stack.pop();
+ visited[w].onStack = false;
+ cmpt.push(w);
+ } while (v !== w);
+ results.push(cmpt);
}
}
+
+ g.nodes().forEach(function(v) {
+ if (!_.has(visited, v)) {
+ dfs(v);
+ }
+ });
+
+ return results;
}
-// very efficient version of eles.add( eles.descendants() ).forEach()
-// for internal use
-elesfn$f.forEachDown = function (fn) {
- var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- return forEachCompound(this, fn, includeSelf, addChildren);
-};
-function addParent(q, did, ele) {
- if (ele.isChild()) {
- var parent = ele._private.parent;
- if (!did.has(parent.id())) {
- q.push(parent);
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/alg/topsort.js":
+/*!**************************************************!*\
+ !*** ./node_modules/graphlib/lib/alg/topsort.js ***!
+ \**************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = topsort;
+topsort.CycleException = CycleException;
+
+function topsort(g) {
+ var visited = {};
+ var stack = {};
+ var results = [];
+
+ function visit(node) {
+ if (_.has(stack, node)) {
+ throw new CycleException();
+ }
+
+ if (!_.has(visited, node)) {
+ stack[node] = true;
+ visited[node] = true;
+ _.each(g.predecessors(node), visit);
+ delete stack[node];
+ results.push(node);
}
}
+
+ _.each(g.sinks(), visit);
+
+ if (_.size(visited) !== g.nodeCount()) {
+ throw new CycleException();
+ }
+
+ return results;
}
-elesfn$f.forEachUp = function (fn) {
- var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- return forEachCompound(this, fn, includeSelf, addParent);
-};
-function addParentAndChildren(q, did, ele) {
- addParent(q, did, ele);
- addChildren(q, did, ele);
+
+function CycleException() {}
+CycleException.prototype = new Error(); // must be an instance of Error to pass testing
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/data/priority-queue.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/graphlib/lib/data/priority-queue.js ***!
+ \**********************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = PriorityQueue;
+
+/**
+ * A min-priority queue data structure. This algorithm is derived from Cormen,
+ * et al., "Introduction to Algorithms". The basic idea of a min-priority
+ * queue is that you can efficiently (in O(1) time) get the smallest key in
+ * the queue. Adding and removing elements takes O(log n) time. A key can
+ * have its priority decreased in O(log n) time.
+ */
+function PriorityQueue() {
+ this._arr = [];
+ this._keyIndices = {};
}
-elesfn$f.forEachUpAndDown = function (fn) {
- var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- return forEachCompound(this, fn, includeSelf, addParentAndChildren);
+
+/**
+ * Returns the number of elements in the queue. Takes `O(1)` time.
+ */
+PriorityQueue.prototype.size = function() {
+ return this._arr.length;
};
-// aliases
-elesfn$f.ancestors = elesfn$f.parents;
+/**
+ * Returns the keys that are in the queue. Takes `O(n)` time.
+ */
+PriorityQueue.prototype.keys = function() {
+ return this._arr.map(function(x) { return x.key; });
+};
-var fn$5, elesfn$e;
-fn$5 = elesfn$e = {
- data: define.data({
- field: 'data',
- bindingEvent: 'data',
- allowBinding: true,
- allowSetting: true,
- settingEvent: 'data',
- settingTriggersEvent: true,
- triggerFnName: 'trigger',
- allowGetting: true,
- immutableKeys: {
- 'id': true,
- 'source': true,
- 'target': true,
- 'parent': true
- },
- updateStyle: true
- }),
- removeData: define.removeData({
- field: 'data',
- event: 'data',
- triggerFnName: 'trigger',
- triggerEvent: true,
- immutableKeys: {
- 'id': true,
- 'source': true,
- 'target': true,
- 'parent': true
- },
- updateStyle: true
- }),
- scratch: define.data({
- field: 'scratch',
- bindingEvent: 'scratch',
- allowBinding: true,
- allowSetting: true,
- settingEvent: 'scratch',
- settingTriggersEvent: true,
- triggerFnName: 'trigger',
- allowGetting: true,
- updateStyle: true
- }),
- removeScratch: define.removeData({
- field: 'scratch',
- event: 'scratch',
- triggerFnName: 'trigger',
- triggerEvent: true,
- updateStyle: true
- }),
- rscratch: define.data({
- field: 'rscratch',
- allowBinding: false,
- allowSetting: true,
- settingTriggersEvent: false,
- allowGetting: true
- }),
- removeRscratch: define.removeData({
- field: 'rscratch',
- triggerEvent: false
- }),
- id: function id() {
- var ele = this[0];
- if (ele) {
- return ele._private.data.id;
- }
+/**
+ * Returns `true` if **key** is in the queue and `false` if not.
+ */
+PriorityQueue.prototype.has = function(key) {
+ return _.has(this._keyIndices, key);
+};
+
+/**
+ * Returns the priority for **key**. If **key** is not present in the queue
+ * then this function returns `undefined`. Takes `O(1)` time.
+ *
+ * @param {Object} key
+ */
+PriorityQueue.prototype.priority = function(key) {
+ var index = this._keyIndices[key];
+ if (index !== undefined) {
+ return this._arr[index].priority;
}
};
-// aliases
-fn$5.attr = fn$5.data;
-fn$5.removeAttr = fn$5.removeData;
-var data = elesfn$e;
+/**
+ * Returns the key for the minimum element in this queue. If the queue is
+ * empty this function throws an Error. Takes `O(1)` time.
+ */
+PriorityQueue.prototype.min = function() {
+ if (this.size() === 0) {
+ throw new Error("Queue underflow");
+ }
+ return this._arr[0].key;
+};
-var elesfn$d = {};
-function defineDegreeFunction(callback) {
- return function (includeLoops) {
- var self = this;
- if (includeLoops === undefined) {
- includeLoops = true;
+/**
+ * Inserts a new key into the priority queue. If the key already exists in
+ * the queue this function returns `false`; otherwise it will return `true`.
+ * Takes `O(n)` time.
+ *
+ * @param {Object} key the key to add
+ * @param {Number} priority the initial priority for the key
+ */
+PriorityQueue.prototype.add = function(key, priority) {
+ var keyIndices = this._keyIndices;
+ key = String(key);
+ if (!_.has(keyIndices, key)) {
+ var arr = this._arr;
+ var index = arr.length;
+ keyIndices[key] = index;
+ arr.push({key: key, priority: priority});
+ this._decrease(index);
+ return true;
+ }
+ return false;
+};
+
+/**
+ * Removes and returns the smallest key in the queue. Takes `O(log n)` time.
+ */
+PriorityQueue.prototype.removeMin = function() {
+ this._swap(0, this._arr.length - 1);
+ var min = this._arr.pop();
+ delete this._keyIndices[min.key];
+ this._heapify(0);
+ return min.key;
+};
+
+/**
+ * Decreases the priority for **key** to **priority**. If the new priority is
+ * greater than the previous priority, this function will throw an Error.
+ *
+ * @param {Object} key the key for which to raise priority
+ * @param {Number} priority the new priority for the key
+ */
+PriorityQueue.prototype.decrease = function(key, priority) {
+ var index = this._keyIndices[key];
+ if (priority > this._arr[index].priority) {
+ throw new Error("New priority is greater than current priority. " +
+ "Key: " + key + " Old: " + this._arr[index].priority + " New: " + priority);
+ }
+ this._arr[index].priority = priority;
+ this._decrease(index);
+};
+
+PriorityQueue.prototype._heapify = function(i) {
+ var arr = this._arr;
+ var l = 2 * i;
+ var r = l + 1;
+ var largest = i;
+ if (l < arr.length) {
+ largest = arr[l].priority < arr[largest].priority ? l : largest;
+ if (r < arr.length) {
+ largest = arr[r].priority < arr[largest].priority ? r : largest;
}
- if (self.length === 0) {
- return;
+ if (largest !== i) {
+ this._swap(i, largest);
+ this._heapify(largest);
}
- if (self.isNode() && !self.removed()) {
- var degree = 0;
- var node = self[0];
- var connectedEdges = node._private.edges;
- for (var i = 0; i < connectedEdges.length; i++) {
- var edge = connectedEdges[i];
- if (!includeLoops && edge.isLoop()) {
- continue;
- }
- degree += callback(node, edge);
- }
- return degree;
- } else {
- return;
+ }
+};
+
+PriorityQueue.prototype._decrease = function(index) {
+ var arr = this._arr;
+ var priority = arr[index].priority;
+ var parent;
+ while (index !== 0) {
+ parent = index >> 1;
+ if (arr[parent].priority < priority) {
+ break;
}
- };
+ this._swap(index, parent);
+ index = parent;
+ }
+};
+
+PriorityQueue.prototype._swap = function(i, j) {
+ var arr = this._arr;
+ var keyIndices = this._keyIndices;
+ var origArrI = arr[i];
+ var origArrJ = arr[j];
+ arr[i] = origArrJ;
+ arr[j] = origArrI;
+ keyIndices[origArrJ.key] = i;
+ keyIndices[origArrI.key] = j;
+};
+
+
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/graph.js":
+/*!********************************************!*\
+ !*** ./node_modules/graphlib/lib/graph.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+"use strict";
+
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/graphlib/lib/lodash.js");
+
+module.exports = Graph;
+
+var DEFAULT_EDGE_NAME = "\x00";
+var GRAPH_NODE = "\x00";
+var EDGE_KEY_DELIM = "\x01";
+
+// Implementation notes:
+//
+// * Node id query functions should return string ids for the nodes
+// * Edge id query functions should return an "edgeObj", edge object, that is
+// composed of enough information to uniquely identify an edge: {v, w, name}.
+// * Internally we use an "edgeId", a stringified form of the edgeObj, to
+// reference edges. This is because we need a performant way to look these
+// edges up and, object properties, which have string keys, are the closest
+// we're going to get to a performant hashtable in JavaScript.
+
+function Graph(opts) {
+ this._isDirected = _.has(opts, "directed") ? opts.directed : true;
+ this._isMultigraph = _.has(opts, "multigraph") ? opts.multigraph : false;
+ this._isCompound = _.has(opts, "compound") ? opts.compound : false;
+
+ // Label for the graph itself
+ this._label = undefined;
+
+ // Defaults to be set when creating a new node
+ this._defaultNodeLabelFn = _.constant(undefined);
+
+ // Defaults to be set when creating a new edge
+ this._defaultEdgeLabelFn = _.constant(undefined);
+
+ // v -> label
+ this._nodes = {};
+
+ if (this._isCompound) {
+ // v -> parent
+ this._parent = {};
+
+ // v -> children
+ this._children = {};
+ this._children[GRAPH_NODE] = {};
+ }
+
+ // v -> edgeObj
+ this._in = {};
+
+ // u -> v -> Number
+ this._preds = {};
+
+ // v -> edgeObj
+ this._out = {};
+
+ // v -> w -> Number
+ this._sucs = {};
+
+ // e -> edgeObj
+ this._edgeObjs = {};
+
+ // e -> label
+ this._edgeLabels = {};
}
-extend(elesfn$d, {
- degree: defineDegreeFunction(function (node, edge) {
- if (edge.source().same(edge.target())) {
- return 2;
+
+/* Number of nodes in the graph. Should only be changed by the implementation. */
+Graph.prototype._nodeCount = 0;
+
+/* Number of edges in the graph. Should only be changed by the implementation. */
+Graph.prototype._edgeCount = 0;
+
+
+/* === Graph functions ========= */
+
+Graph.prototype.isDirected = function() {
+ return this._isDirected;
+};
+
+Graph.prototype.isMultigraph = function() {
+ return this._isMultigraph;
+};
+
+Graph.prototype.isCompound = function() {
+ return this._isCompound;
+};
+
+Graph.prototype.setGraph = function(label) {
+ this._label = label;
+ return this;
+};
+
+Graph.prototype.graph = function() {
+ return this._label;
+};
+
+
+/* === Node functions ========== */
+
+Graph.prototype.setDefaultNodeLabel = function(newDefault) {
+ if (!_.isFunction(newDefault)) {
+ newDefault = _.constant(newDefault);
+ }
+ this._defaultNodeLabelFn = newDefault;
+ return this;
+};
+
+Graph.prototype.nodeCount = function() {
+ return this._nodeCount;
+};
+
+Graph.prototype.nodes = function() {
+ return _.keys(this._nodes);
+};
+
+Graph.prototype.sources = function() {
+ var self = this;
+ return _.filter(this.nodes(), function(v) {
+ return _.isEmpty(self._in[v]);
+ });
+};
+
+Graph.prototype.sinks = function() {
+ var self = this;
+ return _.filter(this.nodes(), function(v) {
+ return _.isEmpty(self._out[v]);
+ });
+};
+
+Graph.prototype.setNodes = function(vs, value) {
+ var args = arguments;
+ var self = this;
+ _.each(vs, function(v) {
+ if (args.length > 1) {
+ self.setNode(v, value);
} else {
- return 1;
+ self.setNode(v);
}
- }),
- indegree: defineDegreeFunction(function (node, edge) {
- if (edge.target().same(node)) {
- return 1;
- } else {
- return 0;
+ });
+ return this;
+};
+
+Graph.prototype.setNode = function(v, value) {
+ if (_.has(this._nodes, v)) {
+ if (arguments.length > 1) {
+ this._nodes[v] = value;
}
- }),
- outdegree: defineDegreeFunction(function (node, edge) {
- if (edge.source().same(node)) {
- return 1;
- } else {
- return 0;
+ return this;
+ }
+
+ this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
+ if (this._isCompound) {
+ this._parent[v] = GRAPH_NODE;
+ this._children[v] = {};
+ this._children[GRAPH_NODE][v] = true;
+ }
+ this._in[v] = {};
+ this._preds[v] = {};
+ this._out[v] = {};
+ this._sucs[v] = {};
+ ++this._nodeCount;
+ return this;
+};
+
+Graph.prototype.node = function(v) {
+ return this._nodes[v];
+};
+
+Graph.prototype.hasNode = function(v) {
+ return _.has(this._nodes, v);
+};
+
+Graph.prototype.removeNode = function(v) {
+ var self = this;
+ if (_.has(this._nodes, v)) {
+ var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };
+ delete this._nodes[v];
+ if (this._isCompound) {
+ this._removeFromParentsChildList(v);
+ delete this._parent[v];
+ _.each(this.children(v), function(child) {
+ self.setParent(child);
+ });
+ delete this._children[v];
}
- })
-});
-function defineDegreeBoundsFunction(degreeFn, callback) {
- return function (includeLoops) {
- var ret;
- var nodes = this.nodes();
- for (var i = 0; i < nodes.length; i++) {
- var ele = nodes[i];
- var degree = ele[degreeFn](includeLoops);
- if (degree !== undefined && (ret === undefined || callback(degree, ret))) {
- ret = degree;
+ _.each(_.keys(this._in[v]), removeEdge);
+ delete this._in[v];
+ delete this._preds[v];
+ _.each(_.keys(this._out[v]), removeEdge);
+ delete this._out[v];
+ delete this._sucs[v];
+ --this._nodeCount;
+ }
+ return this;
+};
+
+Graph.prototype.setParent = function(v, parent) {
+ if (!this._isCompound) {
+ throw new Error("Cannot set parent in a non-compound graph");
+ }
+
+ if (_.isUndefined(parent)) {
+ parent = GRAPH_NODE;
+ } else {
+ // Coerce parent to string
+ parent += "";
+ for (var ancestor = parent;
+ !_.isUndefined(ancestor);
+ ancestor = this.parent(ancestor)) {
+ if (ancestor === v) {
+ throw new Error("Setting " + parent+ " as parent of " + v +
+ " would create a cycle");
}
}
- return ret;
- };
-}
-extend(elesfn$d, {
- minDegree: defineDegreeBoundsFunction('degree', function (degree, min) {
- return degree < min;
- }),
- maxDegree: defineDegreeBoundsFunction('degree', function (degree, max) {
- return degree > max;
- }),
- minIndegree: defineDegreeBoundsFunction('indegree', function (degree, min) {
- return degree < min;
- }),
- maxIndegree: defineDegreeBoundsFunction('indegree', function (degree, max) {
- return degree > max;
- }),
- minOutdegree: defineDegreeBoundsFunction('outdegree', function (degree, min) {
- return degree < min;
- }),
- maxOutdegree: defineDegreeBoundsFunction('outdegree', function (degree, max) {
- return degree > max;
- })
-});
-extend(elesfn$d, {
- totalDegree: function totalDegree(includeLoops) {
- var total = 0;
- var nodes = this.nodes();
- for (var i = 0; i < nodes.length; i++) {
- total += nodes[i].degree(includeLoops);
+
+ this.setNode(parent);
+ }
+
+ this.setNode(v);
+ this._removeFromParentsChildList(v);
+ this._parent[v] = parent;
+ this._children[parent][v] = true;
+ return this;
+};
+
+Graph.prototype._removeFromParentsChildList = function(v) {
+ delete this._children[this._parent[v]][v];
+};
+
+Graph.prototype.parent = function(v) {
+ if (this._isCompound) {
+ var parent = this._parent[v];
+ if (parent !== GRAPH_NODE) {
+ return parent;
}
- return total;
}
-});
+};
-var fn$4, elesfn$c;
-var beforePositionSet = function beforePositionSet(eles, newPos, silent) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- if (!ele.locked()) {
- var oldPos = ele._private.position;
- var delta = {
- x: newPos.x != null ? newPos.x - oldPos.x : 0,
- y: newPos.y != null ? newPos.y - oldPos.y : 0
- };
- if (ele.isParent() && !(delta.x === 0 && delta.y === 0)) {
- ele.children().shift(delta, silent);
- }
- ele.dirtyBoundingBoxCache();
+Graph.prototype.children = function(v) {
+ if (_.isUndefined(v)) {
+ v = GRAPH_NODE;
+ }
+
+ if (this._isCompound) {
+ var children = this._children[v];
+ if (children) {
+ return _.keys(children);
}
+ } else if (v === GRAPH_NODE) {
+ return this.nodes();
+ } else if (this.hasNode(v)) {
+ return [];
}
};
-var positionDef = {
- field: 'position',
- bindingEvent: 'position',
- allowBinding: true,
- allowSetting: true,
- settingEvent: 'position',
- settingTriggersEvent: true,
- triggerFnName: 'emitAndNotify',
- allowGetting: true,
- validKeys: ['x', 'y'],
- beforeGet: function beforeGet(ele) {
- ele.updateCompoundBounds();
- },
- beforeSet: function beforeSet(eles, newPos) {
- beforePositionSet(eles, newPos, false);
- },
- onSet: function onSet(eles) {
- eles.dirtyCompoundBoundsCache();
- },
- canSet: function canSet(ele) {
- return !ele.locked();
+
+Graph.prototype.predecessors = function(v) {
+ var predsV = this._preds[v];
+ if (predsV) {
+ return _.keys(predsV);
}
};
-fn$4 = elesfn$c = {
- position: define.data(positionDef),
- // position but no notification to renderer
- silentPosition: define.data(extend({}, positionDef, {
- allowBinding: false,
- allowSetting: true,
- settingTriggersEvent: false,
- allowGetting: false,
- beforeSet: function beforeSet(eles, newPos) {
- beforePositionSet(eles, newPos, true);
- },
- onSet: function onSet(eles) {
- eles.dirtyCompoundBoundsCache();
- }
- })),
- positions: function positions(pos, silent) {
- if (plainObject(pos)) {
- if (silent) {
- this.silentPosition(pos);
- } else {
- this.position(pos);
- }
- } else if (fn$6(pos)) {
- var _fn = pos;
- var cy = this.cy();
- cy.startBatch();
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var _pos = void 0;
- if (_pos = _fn(ele, i)) {
- if (silent) {
- ele.silentPosition(_pos);
- } else {
- ele.position(_pos);
- }
- }
- }
- cy.endBatch();
- }
- return this; // chaining
- },
- silentPositions: function silentPositions(pos) {
- return this.positions(pos, true);
- },
- shift: function shift(dim, val, silent) {
- var delta;
- if (plainObject(dim)) {
- delta = {
- x: number$1(dim.x) ? dim.x : 0,
- y: number$1(dim.y) ? dim.y : 0
- };
- silent = val;
- } else if (string(dim) && number$1(val)) {
- delta = {
- x: 0,
- y: 0
- };
- delta[dim] = val;
- }
- if (delta != null) {
- var cy = this.cy();
- cy.startBatch();
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
+Graph.prototype.successors = function(v) {
+ var sucsV = this._sucs[v];
+ if (sucsV) {
+ return _.keys(sucsV);
+ }
+};
- // exclude any node that is a descendant of the calling collection
- if (cy.hasCompoundNodes() && ele.isChild() && ele.ancestors().anySame(this)) {
- continue;
- }
- var pos = ele.position();
- var newPos = {
- x: pos.x + delta.x,
- y: pos.y + delta.y
- };
- if (silent) {
- ele.silentPosition(newPos);
- } else {
- ele.position(newPos);
- }
- }
- cy.endBatch();
+Graph.prototype.neighbors = function(v) {
+ var preds = this.predecessors(v);
+ if (preds) {
+ return _.union(preds, this.successors(v));
+ }
+};
+
+Graph.prototype.isLeaf = function (v) {
+ var neighbors;
+ if (this.isDirected()) {
+ neighbors = this.successors(v);
+ } else {
+ neighbors = this.neighbors(v);
+ }
+ return neighbors.length === 0;
+};
+
+Graph.prototype.filterNodes = function(filter) {
+ var copy = new this.constructor({
+ directed: this._isDirected,
+ multigraph: this._isMultigraph,
+ compound: this._isCompound
+ });
+
+ copy.setGraph(this.graph());
+
+ var self = this;
+ _.each(this._nodes, function(value, v) {
+ if (filter(v)) {
+ copy.setNode(v, value);
}
- return this;
- },
- silentShift: function silentShift(dim, val) {
- if (plainObject(dim)) {
- this.shift(dim, true);
- } else if (string(dim) && number$1(val)) {
- this.shift(dim, val, true);
+ });
+
+ _.each(this._edgeObjs, function(e) {
+ if (copy.hasNode(e.v) && copy.hasNode(e.w)) {
+ copy.setEdge(e, self.edge(e));
}
- return this;
- },
- // get/set the rendered (i.e. on screen) positon of the element
- renderedPosition: function renderedPosition(dim, val) {
- var ele = this[0];
- var cy = this.cy();
- var zoom = cy.zoom();
- var pan = cy.pan();
- var rpos = plainObject(dim) ? dim : undefined;
- var setting = rpos !== undefined || val !== undefined && string(dim);
- if (ele && ele.isNode()) {
- // must have an element and must be a node to return position
- if (setting) {
- for (var i = 0; i < this.length; i++) {
- var _ele = this[i];
- if (val !== undefined) {
- // set one dimension
- _ele.position(dim, (val - pan[dim]) / zoom);
- } else if (rpos !== undefined) {
- // set whole position
- _ele.position(renderedToModelPosition(rpos, zoom, pan));
- }
- }
- } else {
- // getting
- var pos = ele.position();
- rpos = modelToRenderedPosition(pos, zoom, pan);
- if (dim === undefined) {
- // then return the whole rendered position
- return rpos;
- } else {
- // then return the specified dimension
- return rpos[dim];
- }
- }
- } else if (!setting) {
- return undefined; // for empty collection case
+ });
+
+ var parents = {};
+ function findParent(v) {
+ var parent = self.parent(v);
+ if (parent === undefined || copy.hasNode(parent)) {
+ parents[v] = parent;
+ return parent;
+ } else if (parent in parents) {
+ return parents[parent];
+ } else {
+ return findParent(parent);
}
+ }
- return this; // chaining
- },
+ if (this._isCompound) {
+ _.each(copy.nodes(), function(v) {
+ copy.setParent(v, findParent(v));
+ });
+ }
- // get/set the position relative to the parent
- relativePosition: function relativePosition(dim, val) {
- var ele = this[0];
- var cy = this.cy();
- var ppos = plainObject(dim) ? dim : undefined;
- var setting = ppos !== undefined || val !== undefined && string(dim);
- var hasCompoundNodes = cy.hasCompoundNodes();
- if (ele && ele.isNode()) {
- // must have an element and must be a node to return position
- if (setting) {
- for (var i = 0; i < this.length; i++) {
- var _ele2 = this[i];
- var parent = hasCompoundNodes ? _ele2.parent() : null;
- var hasParent = parent && parent.length > 0;
- var relativeToParent = hasParent;
- if (hasParent) {
- parent = parent[0];
- }
- var origin = relativeToParent ? parent.position() : {
- x: 0,
- y: 0
- };
- if (val !== undefined) {
- // set one dimension
- _ele2.position(dim, val + origin[dim]);
- } else if (ppos !== undefined) {
- // set whole position
- _ele2.position({
- x: ppos.x + origin.x,
- y: ppos.y + origin.y
- });
- }
- }
- } else {
- // getting
- var pos = ele.position();
- var _parent = hasCompoundNodes ? ele.parent() : null;
- var _hasParent = _parent && _parent.length > 0;
- var _relativeToParent = _hasParent;
- if (_hasParent) {
- _parent = _parent[0];
- }
- var _origin = _relativeToParent ? _parent.position() : {
- x: 0,
- y: 0
- };
- ppos = {
- x: pos.x - _origin.x,
- y: pos.y - _origin.y
- };
- if (dim === undefined) {
- // then return the whole rendered position
- return ppos;
- } else {
- // then return the specified dimension
- return ppos[dim];
- }
- }
- } else if (!setting) {
- return undefined; // for empty collection case
- }
+ return copy;
+};
- return this; // chaining
+/* === Edge functions ========== */
+
+Graph.prototype.setDefaultEdgeLabel = function(newDefault) {
+ if (!_.isFunction(newDefault)) {
+ newDefault = _.constant(newDefault);
}
+ this._defaultEdgeLabelFn = newDefault;
+ return this;
};
-// aliases
-fn$4.modelPosition = fn$4.point = fn$4.position;
-fn$4.modelPositions = fn$4.points = fn$4.positions;
-fn$4.renderedPoint = fn$4.renderedPosition;
-fn$4.relativePoint = fn$4.relativePosition;
-var position = elesfn$c;
+Graph.prototype.edgeCount = function() {
+ return this._edgeCount;
+};
-var fn$3, elesfn$b;
-fn$3 = elesfn$b = {};
-elesfn$b.renderedBoundingBox = function (options) {
- var bb = this.boundingBox(options);
- var cy = this.cy();
- var zoom = cy.zoom();
- var pan = cy.pan();
- var x1 = bb.x1 * zoom + pan.x;
- var x2 = bb.x2 * zoom + pan.x;
- var y1 = bb.y1 * zoom + pan.y;
- var y2 = bb.y2 * zoom + pan.y;
- return {
- x1: x1,
- x2: x2,
- y1: y1,
- y2: y2,
- w: x2 - x1,
- h: y2 - y1
- };
+Graph.prototype.edges = function() {
+ return _.values(this._edgeObjs);
};
-elesfn$b.dirtyCompoundBoundsCache = function () {
- var silent = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
- var cy = this.cy();
- if (!cy.styleEnabled() || !cy.hasCompoundNodes()) {
- return this;
- }
- this.forEachUp(function (ele) {
- if (ele.isParent()) {
- var _p = ele._private;
- _p.compoundBoundsClean = false;
- _p.bbCache = null;
- if (!silent) {
- ele.emitAndNotify('bounds');
- }
+
+Graph.prototype.setPath = function(vs, value) {
+ var self = this;
+ var args = arguments;
+ _.reduce(vs, function(v, w) {
+ if (args.length > 1) {
+ self.setEdge(v, w, value);
+ } else {
+ self.setEdge(v, w);
}
+ return w;
});
return this;
};
-elesfn$b.updateCompoundBounds = function () {
- var force = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
- var cy = this.cy();
- // not possible to do on non-compound graphs or with the style disabled
- if (!cy.styleEnabled() || !cy.hasCompoundNodes()) {
- return this;
+/*
+ * setEdge(v, w, [value, [name]])
+ * setEdge({ v, w, [name] }, [value])
+ */
+Graph.prototype.setEdge = function() {
+ var v, w, name, value;
+ var valueSpecified = false;
+ var arg0 = arguments[0];
+
+ if (typeof arg0 === "object" && arg0 !== null && "v" in arg0) {
+ v = arg0.v;
+ w = arg0.w;
+ name = arg0.name;
+ if (arguments.length === 2) {
+ value = arguments[1];
+ valueSpecified = true;
+ }
+ } else {
+ v = arg0;
+ w = arguments[1];
+ name = arguments[3];
+ if (arguments.length > 2) {
+ value = arguments[2];
+ valueSpecified = true;
+ }
}
- // save cycles when batching -- but bounds will be stale (or not exist yet)
- if (!force && cy.batching()) {
- return this;
+ v = "" + v;
+ w = "" + w;
+ if (!_.isUndefined(name)) {
+ name = "" + name;
}
- function update(parent) {
- if (!parent.isParent()) {
- return;
- }
- var _p = parent._private;
- var children = parent.children();
- var includeLabels = parent.pstyle('compound-sizing-wrt-labels').value === 'include';
- var min = {
- width: {
- val: parent.pstyle('min-width').pfValue,
- left: parent.pstyle('min-width-bias-left'),
- right: parent.pstyle('min-width-bias-right')
- },
- height: {
- val: parent.pstyle('min-height').pfValue,
- top: parent.pstyle('min-height-bias-top'),
- bottom: parent.pstyle('min-height-bias-bottom')
- }
- };
- var bb = children.boundingBox({
- includeLabels: includeLabels,
- includeOverlays: false,
- // updating the compound bounds happens outside of the regular
- // cache cycle (i.e. before fired events)
- useCache: false
- });
- var pos = _p.position;
- // if children take up zero area then keep position and fall back on stylesheet w/h
- if (bb.w === 0 || bb.h === 0) {
- bb = {
- w: parent.pstyle('width').pfValue,
- h: parent.pstyle('height').pfValue
- };
- bb.x1 = pos.x - bb.w / 2;
- bb.x2 = pos.x + bb.w / 2;
- bb.y1 = pos.y - bb.h / 2;
- bb.y2 = pos.y + bb.h / 2;
- }
- function computeBiasValues(propDiff, propBias, propBiasComplement) {
- var biasDiff = 0;
- var biasComplementDiff = 0;
- var biasTotal = propBias + propBiasComplement;
- if (propDiff > 0 && biasTotal > 0) {
- biasDiff = propBias / biasTotal * propDiff;
- biasComplementDiff = propBiasComplement / biasTotal * propDiff;
- }
- return {
- biasDiff: biasDiff,
- biasComplementDiff: biasComplementDiff
- };
- }
- function computePaddingValues(width, height, paddingObject, relativeTo) {
- // Assuming percentage is number from 0 to 1
- if (paddingObject.units === '%') {
- switch (relativeTo) {
- case 'width':
- return width > 0 ? paddingObject.pfValue * width : 0;
- case 'height':
- return height > 0 ? paddingObject.pfValue * height : 0;
- case 'average':
- return width > 0 && height > 0 ? paddingObject.pfValue * (width + height) / 2 : 0;
- case 'min':
- return width > 0 && height > 0 ? width > height ? paddingObject.pfValue * height : paddingObject.pfValue * width : 0;
- case 'max':
- return width > 0 && height > 0 ? width > height ? paddingObject.pfValue * width : paddingObject.pfValue * height : 0;
- default:
- return 0;
- }
- } else if (paddingObject.units === 'px') {
- return paddingObject.pfValue;
- } else {
- return 0;
- }
- }
- var leftVal = min.width.left.value;
- if (min.width.left.units === 'px' && min.width.val > 0) {
- leftVal = leftVal * 100 / min.width.val;
- }
- var rightVal = min.width.right.value;
- if (min.width.right.units === 'px' && min.width.val > 0) {
- rightVal = rightVal * 100 / min.width.val;
- }
- var topVal = min.height.top.value;
- if (min.height.top.units === 'px' && min.height.val > 0) {
- topVal = topVal * 100 / min.height.val;
- }
- var bottomVal = min.height.bottom.value;
- if (min.height.bottom.units === 'px' && min.height.val > 0) {
- bottomVal = bottomVal * 100 / min.height.val;
+ var e = edgeArgsToId(this._isDirected, v, w, name);
+ if (_.has(this._edgeLabels, e)) {
+ if (valueSpecified) {
+ this._edgeLabels[e] = value;
}
- var widthBiasDiffs = computeBiasValues(min.width.val - bb.w, leftVal, rightVal);
- var diffLeft = widthBiasDiffs.biasDiff;
- var diffRight = widthBiasDiffs.biasComplementDiff;
- var heightBiasDiffs = computeBiasValues(min.height.val - bb.h, topVal, bottomVal);
- var diffTop = heightBiasDiffs.biasDiff;
- var diffBottom = heightBiasDiffs.biasComplementDiff;
- _p.autoPadding = computePaddingValues(bb.w, bb.h, parent.pstyle('padding'), parent.pstyle('padding-relative-to').value);
- _p.autoWidth = Math.max(bb.w, min.width.val);
- pos.x = (-diffLeft + bb.x1 + bb.x2 + diffRight) / 2;
- _p.autoHeight = Math.max(bb.h, min.height.val);
- pos.y = (-diffTop + bb.y1 + bb.y2 + diffBottom) / 2;
+ return this;
}
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var _p = ele._private;
- if (!_p.compoundBoundsClean || force) {
- update(ele);
- if (!cy.batching()) {
- _p.compoundBoundsClean = true;
- }
- }
+
+ if (!_.isUndefined(name) && !this._isMultigraph) {
+ throw new Error("Cannot set a named edge when isMultigraph = false");
}
+
+ // It didn't exist, so we need to create it.
+ // First ensure the nodes exist.
+ this.setNode(v);
+ this.setNode(w);
+
+ this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);
+
+ var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
+ // Ensure we add undirected edges in a consistent way.
+ v = edgeObj.v;
+ w = edgeObj.w;
+
+ Object.freeze(edgeObj);
+ this._edgeObjs[e] = edgeObj;
+ incrementOrInitEntry(this._preds[w], v);
+ incrementOrInitEntry(this._sucs[v], w);
+ this._in[w][e] = edgeObj;
+ this._out[v][e] = edgeObj;
+ this._edgeCount++;
return this;
};
-var noninf = function noninf(x) {
- if (x === Infinity || x === -Infinity) {
- return 0;
- }
- return x;
+
+Graph.prototype.edge = function(v, w, name) {
+ var e = (arguments.length === 1
+ ? edgeObjToId(this._isDirected, arguments[0])
+ : edgeArgsToId(this._isDirected, v, w, name));
+ return this._edgeLabels[e];
};
-var updateBounds = function updateBounds(b, x1, y1, x2, y2) {
- // don't update with zero area boxes
- if (x2 - x1 === 0 || y2 - y1 === 0) {
- return;
+
+Graph.prototype.hasEdge = function(v, w, name) {
+ var e = (arguments.length === 1
+ ? edgeObjToId(this._isDirected, arguments[0])
+ : edgeArgsToId(this._isDirected, v, w, name));
+ return _.has(this._edgeLabels, e);
+};
+
+Graph.prototype.removeEdge = function(v, w, name) {
+ var e = (arguments.length === 1
+ ? edgeObjToId(this._isDirected, arguments[0])
+ : edgeArgsToId(this._isDirected, v, w, name));
+ var edge = this._edgeObjs[e];
+ if (edge) {
+ v = edge.v;
+ w = edge.w;
+ delete this._edgeLabels[e];
+ delete this._edgeObjs[e];
+ decrementOrRemoveEntry(this._preds[w], v);
+ decrementOrRemoveEntry(this._sucs[v], w);
+ delete this._in[w][e];
+ delete this._out[v][e];
+ this._edgeCount--;
}
+ return this;
+};
- // don't update with null dim
- if (x1 == null || y1 == null || x2 == null || y2 == null) {
- return;
+Graph.prototype.inEdges = function(v, u) {
+ var inV = this._in[v];
+ if (inV) {
+ var edges = _.values(inV);
+ if (!u) {
+ return edges;
+ }
+ return _.filter(edges, function(edge) { return edge.v === u; });
}
- b.x1 = x1 < b.x1 ? x1 : b.x1;
- b.x2 = x2 > b.x2 ? x2 : b.x2;
- b.y1 = y1 < b.y1 ? y1 : b.y1;
- b.y2 = y2 > b.y2 ? y2 : b.y2;
- b.w = b.x2 - b.x1;
- b.h = b.y2 - b.y1;
};
-var updateBoundsFromBox = function updateBoundsFromBox(b, b2) {
- if (b2 == null) {
- return b;
+
+Graph.prototype.outEdges = function(v, w) {
+ var outV = this._out[v];
+ if (outV) {
+ var edges = _.values(outV);
+ if (!w) {
+ return edges;
+ }
+ return _.filter(edges, function(edge) { return edge.w === w; });
}
- return updateBounds(b, b2.x1, b2.y1, b2.x2, b2.y2);
};
-var prefixedProperty = function prefixedProperty(obj, field, prefix) {
- return getPrefixedProperty(obj, field, prefix);
+
+Graph.prototype.nodeEdges = function(v, w) {
+ var inEdges = this.inEdges(v, w);
+ if (inEdges) {
+ return inEdges.concat(this.outEdges(v, w));
+ }
};
-var updateBoundsFromArrow = function updateBoundsFromArrow(bounds, ele, prefix) {
- if (ele.cy().headless()) {
- return;
+
+function incrementOrInitEntry(map, k) {
+ if (map[k]) {
+ map[k]++;
+ } else {
+ map[k] = 1;
}
- var _p = ele._private;
- var rstyle = _p.rstyle;
- var halfArW = rstyle.arrowWidth / 2;
- var arrowType = ele.pstyle(prefix + '-arrow-shape').value;
- var x;
- var y;
- if (arrowType !== 'none') {
- if (prefix === 'source') {
- x = rstyle.srcX;
- y = rstyle.srcY;
- } else if (prefix === 'target') {
- x = rstyle.tgtX;
- y = rstyle.tgtY;
- } else {
- x = rstyle.midX;
- y = rstyle.midY;
- }
+}
- // always store the individual arrow bounds
- var bbs = _p.arrowBounds = _p.arrowBounds || {};
- var bb = bbs[prefix] = bbs[prefix] || {};
- bb.x1 = x - halfArW;
- bb.y1 = y - halfArW;
- bb.x2 = x + halfArW;
- bb.y2 = y + halfArW;
- bb.w = bb.x2 - bb.x1;
- bb.h = bb.y2 - bb.y1;
- expandBoundingBox(bb, 1);
- updateBounds(bounds, bb.x1, bb.y1, bb.x2, bb.y2);
+function decrementOrRemoveEntry(map, k) {
+ if (!--map[k]) { delete map[k]; }
+}
+
+function edgeArgsToId(isDirected, v_, w_, name) {
+ var v = "" + v_;
+ var w = "" + w_;
+ if (!isDirected && v > w) {
+ var tmp = v;
+ v = w;
+ w = tmp;
}
-};
-var updateBoundsFromLabel = function updateBoundsFromLabel(bounds, ele, prefix) {
- if (ele.cy().headless()) {
- return;
+ return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +
+ (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);
+}
+
+function edgeArgsToObj(isDirected, v_, w_, name) {
+ var v = "" + v_;
+ var w = "" + w_;
+ if (!isDirected && v > w) {
+ var tmp = v;
+ v = w;
+ w = tmp;
}
- var prefixDash;
- if (prefix) {
- prefixDash = prefix + '-';
- } else {
- prefixDash = '';
+ var edgeObj = { v: v, w: w };
+ if (name) {
+ edgeObj.name = name;
}
- var _p = ele._private;
- var rstyle = _p.rstyle;
- var label = ele.pstyle(prefixDash + 'label').strValue;
- if (label) {
- var halign = ele.pstyle('text-halign');
- var valign = ele.pstyle('text-valign');
- var labelWidth = prefixedProperty(rstyle, 'labelWidth', prefix);
- var labelHeight = prefixedProperty(rstyle, 'labelHeight', prefix);
- var labelX = prefixedProperty(rstyle, 'labelX', prefix);
- var labelY = prefixedProperty(rstyle, 'labelY', prefix);
- var marginX = ele.pstyle(prefixDash + 'text-margin-x').pfValue;
- var marginY = ele.pstyle(prefixDash + 'text-margin-y').pfValue;
- var isEdge = ele.isEdge();
- var rotation = ele.pstyle(prefixDash + 'text-rotation');
- var outlineWidth = ele.pstyle('text-outline-width').pfValue;
- var borderWidth = ele.pstyle('text-border-width').pfValue;
- var halfBorderWidth = borderWidth / 2;
- var padding = ele.pstyle('text-background-padding').pfValue;
- var marginOfError = 2; // expand to work around browser dimension inaccuracies
+ return edgeObj;
+}
- var lh = labelHeight;
- var lw = labelWidth;
- var lw_2 = lw / 2;
- var lh_2 = lh / 2;
- var lx1, lx2, ly1, ly2;
- if (isEdge) {
- lx1 = labelX - lw_2;
- lx2 = labelX + lw_2;
- ly1 = labelY - lh_2;
- ly2 = labelY + lh_2;
- } else {
- switch (halign.value) {
- case 'left':
- lx1 = labelX - lw;
- lx2 = labelX;
- break;
- case 'center':
- lx1 = labelX - lw_2;
- lx2 = labelX + lw_2;
- break;
- case 'right':
- lx1 = labelX;
- lx2 = labelX + lw;
- break;
- }
- switch (valign.value) {
- case 'top':
- ly1 = labelY - lh;
- ly2 = labelY;
- break;
- case 'center':
- ly1 = labelY - lh_2;
- ly2 = labelY + lh_2;
- break;
- case 'bottom':
- ly1 = labelY;
- ly2 = labelY + lh;
- break;
- }
- }
+function edgeObjToId(isDirected, edgeObj) {
+ return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
+}
- // shift by margin and expand by outline and border
- lx1 += marginX - Math.max(outlineWidth, halfBorderWidth) - padding - marginOfError;
- lx2 += marginX + Math.max(outlineWidth, halfBorderWidth) + padding + marginOfError;
- ly1 += marginY - Math.max(outlineWidth, halfBorderWidth) - padding - marginOfError;
- ly2 += marginY + Math.max(outlineWidth, halfBorderWidth) + padding + marginOfError;
- // always store the unrotated label bounds separately
- var bbPrefix = prefix || 'main';
- var bbs = _p.labelBounds;
- var bb = bbs[bbPrefix] = bbs[bbPrefix] || {};
- bb.x1 = lx1;
- bb.y1 = ly1;
- bb.x2 = lx2;
- bb.y2 = ly2;
- bb.w = lx2 - lx1;
- bb.h = ly2 - ly1;
- var isAutorotate = isEdge && rotation.strValue === 'autorotate';
- var isPfValue = rotation.pfValue != null && rotation.pfValue !== 0;
- if (isAutorotate || isPfValue) {
- var theta = isAutorotate ? prefixedProperty(_p.rstyle, 'labelAngle', prefix) : rotation.pfValue;
- var cos = Math.cos(theta);
- var sin = Math.sin(theta);
+/***/ }),
- // rotation point (default value for center-center)
- var xo = (lx1 + lx2) / 2;
- var yo = (ly1 + ly2) / 2;
- if (!isEdge) {
- switch (halign.value) {
- case 'left':
- xo = lx2;
- break;
- case 'right':
- xo = lx1;
- break;
- }
- switch (valign.value) {
- case 'top':
- yo = ly2;
- break;
- case 'bottom':
- yo = ly1;
- break;
- }
- }
- var rotate = function rotate(x, y) {
- x = x - xo;
- y = y - yo;
- return {
- x: x * cos - y * sin + xo,
- y: x * sin + y * cos + yo
- };
- };
- var px1y1 = rotate(lx1, ly1);
- var px1y2 = rotate(lx1, ly2);
- var px2y1 = rotate(lx2, ly1);
- var px2y2 = rotate(lx2, ly2);
- lx1 = Math.min(px1y1.x, px1y2.x, px2y1.x, px2y2.x);
- lx2 = Math.max(px1y1.x, px1y2.x, px2y1.x, px2y2.x);
- ly1 = Math.min(px1y1.y, px1y2.y, px2y1.y, px2y2.y);
- ly2 = Math.max(px1y1.y, px1y2.y, px2y1.y, px2y2.y);
- }
- var bbPrefixRot = bbPrefix + 'Rot';
- var bbRot = bbs[bbPrefixRot] = bbs[bbPrefixRot] || {};
- bbRot.x1 = lx1;
- bbRot.y1 = ly1;
- bbRot.x2 = lx2;
- bbRot.y2 = ly2;
- bbRot.w = lx2 - lx1;
- bbRot.h = ly2 - ly1;
- updateBounds(bounds, lx1, ly1, lx2, ly2);
- updateBounds(_p.labelBounds.all, lx1, ly1, lx2, ly2);
- }
- return bounds;
+/***/ "./node_modules/graphlib/lib/index.js":
+/*!********************************************!*\
+ !*** ./node_modules/graphlib/lib/index.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+// Includes only the "core" of graphlib
+module.exports = {
+ Graph: __webpack_require__(/*! ./graph */ "./node_modules/graphlib/lib/graph.js"),
+ version: __webpack_require__(/*! ./version */ "./node_modules/graphlib/lib/version.js")
};
-// get the bounding box of the elements (in raw model position)
-var boundingBoxImpl = function boundingBoxImpl(ele, options) {
- var cy = ele._private.cy;
- var styleEnabled = cy.styleEnabled();
- var headless = cy.headless();
- var bounds = makeBoundingBox();
- var _p = ele._private;
- var isNode = ele.isNode();
- var isEdge = ele.isEdge();
- var ex1, ex2, ey1, ey2; // extrema of body / lines
- var x, y; // node pos
- var rstyle = _p.rstyle;
- var manualExpansion = isNode && styleEnabled ? ele.pstyle('bounds-expansion').pfValue : [0];
- // must use `display` prop only, as reading `compound.width()` causes recursion
- // (other factors like width values will be considered later in this function anyway)
- var isDisplayed = function isDisplayed(ele) {
- return ele.pstyle('display').value !== 'none';
+/***/ }),
+
+/***/ "./node_modules/graphlib/lib/json.js":
+/*!*******************************************!*\
+ !*** ./node_modules/graphlib/lib/json.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var _ = __webpack_require__(/*! ./lodash */ "./node_modules/graphlib/lib/lodash.js");
+var Graph = __webpack_require__(/*! ./graph */ "./node_modules/graphlib/lib/graph.js");
+
+module.exports = {
+ write: write,
+ read: read
+};
+
+function write(g) {
+ var json = {
+ options: {
+ directed: g.isDirected(),
+ multigraph: g.isMultigraph(),
+ compound: g.isCompound()
+ },
+ nodes: writeNodes(g),
+ edges: writeEdges(g)
};
- var displayed = !styleEnabled || isDisplayed(ele)
+ if (!_.isUndefined(g.graph())) {
+ json.value = _.clone(g.graph());
+ }
+ return json;
+}
- // must take into account connected nodes b/c of implicit edge hiding on display:none node
- && (!isEdge || isDisplayed(ele.source()) && isDisplayed(ele.target()));
- if (displayed) {
- // displayed suffices, since we will find zero area eles anyway
- var overlayOpacity = 0;
- var overlayPadding = 0;
- if (styleEnabled && options.includeOverlays) {
- overlayOpacity = ele.pstyle('overlay-opacity').value;
- if (overlayOpacity !== 0) {
- overlayPadding = ele.pstyle('overlay-padding').value;
- }
+function writeNodes(g) {
+ return _.map(g.nodes(), function(v) {
+ var nodeValue = g.node(v);
+ var parent = g.parent(v);
+ var node = { v: v };
+ if (!_.isUndefined(nodeValue)) {
+ node.value = nodeValue;
}
- var underlayOpacity = 0;
- var underlayPadding = 0;
- if (styleEnabled && options.includeUnderlays) {
- underlayOpacity = ele.pstyle('underlay-opacity').value;
- if (underlayOpacity !== 0) {
- underlayPadding = ele.pstyle('underlay-padding').value;
- }
+ if (!_.isUndefined(parent)) {
+ node.parent = parent;
}
- var padding = Math.max(overlayPadding, underlayPadding);
- var w = 0;
- var wHalf = 0;
- if (styleEnabled) {
- w = ele.pstyle('width').pfValue;
- wHalf = w / 2;
+ return node;
+ });
+}
+
+function writeEdges(g) {
+ return _.map(g.edges(), function(e) {
+ var edgeValue = g.edge(e);
+ var edge = { v: e.v, w: e.w };
+ if (!_.isUndefined(e.name)) {
+ edge.name = e.name;
}
- if (isNode && options.includeNodes) {
- var pos = ele.position();
- x = pos.x;
- y = pos.y;
- var _w = ele.outerWidth();
- var halfW = _w / 2;
- var h = ele.outerHeight();
- var halfH = h / 2;
+ if (!_.isUndefined(edgeValue)) {
+ edge.value = edgeValue;
+ }
+ return edge;
+ });
+}
- // handle node dimensions
- /////////////////////////
+function read(json) {
+ var g = new Graph(json.options).setGraph(json.value);
+ _.each(json.nodes, function(entry) {
+ g.setNode(entry.v, entry.value);
+ if (entry.parent) {
+ g.setParent(entry.v, entry.parent);
+ }
+ });
+ _.each(json.edges, function(entry) {
+ g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);
+ });
+ return g;
+}
- ex1 = x - halfW;
- ex2 = x + halfW;
- ey1 = y - halfH;
- ey2 = y + halfH;
- updateBounds(bounds, ex1, ey1, ex2, ey2);
- } else if (isEdge && options.includeEdges) {
- if (styleEnabled && !headless) {
- var curveStyle = ele.pstyle('curve-style').strValue;
- // handle edge dimensions (rough box estimate)
- //////////////////////////////////////////////
+/***/ }),
- ex1 = Math.min(rstyle.srcX, rstyle.midX, rstyle.tgtX);
- ex2 = Math.max(rstyle.srcX, rstyle.midX, rstyle.tgtX);
- ey1 = Math.min(rstyle.srcY, rstyle.midY, rstyle.tgtY);
- ey2 = Math.max(rstyle.srcY, rstyle.midY, rstyle.tgtY);
+/***/ "./node_modules/graphlib/lib/lodash.js":
+/*!*********************************************!*\
+ !*** ./node_modules/graphlib/lib/lodash.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // take into account edge width
- ex1 -= wHalf;
- ex2 += wHalf;
- ey1 -= wHalf;
- ey2 += wHalf;
- updateBounds(bounds, ex1, ey1, ex2, ey2);
+/* global window */
- // precise edges
- ////////////////
+var lodash;
- if (curveStyle === 'haystack') {
- var hpts = rstyle.haystackPts;
- if (hpts && hpts.length === 2) {
- ex1 = hpts[0].x;
- ey1 = hpts[0].y;
- ex2 = hpts[1].x;
- ey2 = hpts[1].y;
- if (ex1 > ex2) {
- var temp = ex1;
- ex1 = ex2;
- ex2 = temp;
- }
- if (ey1 > ey2) {
- var _temp = ey1;
- ey1 = ey2;
- ey2 = _temp;
- }
- updateBounds(bounds, ex1 - wHalf, ey1 - wHalf, ex2 + wHalf, ey2 + wHalf);
- }
- } else if (curveStyle === 'bezier' || curveStyle === 'unbundled-bezier' || curveStyle === 'segments' || curveStyle === 'taxi') {
- var pts;
- switch (curveStyle) {
- case 'bezier':
- case 'unbundled-bezier':
- pts = rstyle.bezierPts;
- break;
- case 'segments':
- case 'taxi':
- pts = rstyle.linePts;
- break;
- }
- if (pts != null) {
- for (var j = 0; j < pts.length; j++) {
- var pt = pts[j];
- ex1 = pt.x - wHalf;
- ex2 = pt.x + wHalf;
- ey1 = pt.y - wHalf;
- ey2 = pt.y + wHalf;
- updateBounds(bounds, ex1, ey1, ex2, ey2);
- }
- }
- } // bezier-like or segment-like edge
- } else {
- // headless or style disabled
+if (true) {
+ try {
+ lodash = {
+ clone: __webpack_require__(/*! lodash/clone */ "./node_modules/lodash/clone.js"),
+ constant: __webpack_require__(/*! lodash/constant */ "./node_modules/lodash/constant.js"),
+ each: __webpack_require__(/*! lodash/each */ "./node_modules/lodash/each.js"),
+ filter: __webpack_require__(/*! lodash/filter */ "./node_modules/lodash/filter.js"),
+ has: __webpack_require__(/*! lodash/has */ "./node_modules/lodash/has.js"),
+ isArray: __webpack_require__(/*! lodash/isArray */ "./node_modules/lodash/isArray.js"),
+ isEmpty: __webpack_require__(/*! lodash/isEmpty */ "./node_modules/lodash/isEmpty.js"),
+ isFunction: __webpack_require__(/*! lodash/isFunction */ "./node_modules/lodash/isFunction.js"),
+ isUndefined: __webpack_require__(/*! lodash/isUndefined */ "./node_modules/lodash/isUndefined.js"),
+ keys: __webpack_require__(/*! lodash/keys */ "./node_modules/lodash/keys.js"),
+ map: __webpack_require__(/*! lodash/map */ "./node_modules/lodash/map.js"),
+ reduce: __webpack_require__(/*! lodash/reduce */ "./node_modules/lodash/reduce.js"),
+ size: __webpack_require__(/*! lodash/size */ "./node_modules/lodash/size.js"),
+ transform: __webpack_require__(/*! lodash/transform */ "./node_modules/lodash/transform.js"),
+ union: __webpack_require__(/*! lodash/union */ "./node_modules/lodash/union.js"),
+ values: __webpack_require__(/*! lodash/values */ "./node_modules/lodash/values.js")
+ };
+ } catch (e) {
+ // continue regardless of error
+ }
+}
- // fallback on source and target positions
- //////////////////////////////////////////
-
- var n1 = ele.source();
- var n1pos = n1.position();
- var n2 = ele.target();
- var n2pos = n2.position();
- ex1 = n1pos.x;
- ex2 = n2pos.x;
- ey1 = n1pos.y;
- ey2 = n2pos.y;
- if (ex1 > ex2) {
- var _temp2 = ex1;
- ex1 = ex2;
- ex2 = _temp2;
- }
- if (ey1 > ey2) {
- var _temp3 = ey1;
- ey1 = ey2;
- ey2 = _temp3;
- }
-
- // take into account edge width
- ex1 -= wHalf;
- ex2 += wHalf;
- ey1 -= wHalf;
- ey2 += wHalf;
- updateBounds(bounds, ex1, ey1, ex2, ey2);
- } // headless or style disabled
- } // edges
+if (!lodash) {
+ lodash = window._;
+}
- // handle edge arrow size
- /////////////////////////
+module.exports = lodash;
- if (styleEnabled && options.includeEdges && isEdge) {
- updateBoundsFromArrow(bounds, ele, 'mid-source');
- updateBoundsFromArrow(bounds, ele, 'mid-target');
- updateBoundsFromArrow(bounds, ele, 'source');
- updateBoundsFromArrow(bounds, ele, 'target');
- }
- // ghost
- ////////
+/***/ }),
- if (styleEnabled) {
- var ghost = ele.pstyle('ghost').value === 'yes';
- if (ghost) {
- var gx = ele.pstyle('ghost-offset-x').pfValue;
- var gy = ele.pstyle('ghost-offset-y').pfValue;
- updateBounds(bounds, bounds.x1 + gx, bounds.y1 + gy, bounds.x2 + gx, bounds.y2 + gy);
- }
- }
+/***/ "./node_modules/graphlib/lib/version.js":
+/*!**********************************************!*\
+ !*** ./node_modules/graphlib/lib/version.js ***!
+ \**********************************************/
+/***/ (function(module) {
- // always store the body bounds separately from the labels
- var bbBody = _p.bodyBounds = _p.bodyBounds || {};
- assignBoundingBox(bbBody, bounds);
- expandBoundingBoxSides(bbBody, manualExpansion);
- expandBoundingBox(bbBody, 1); // expand to work around browser dimension inaccuracies
+module.exports = '2.1.8';
- // overlay
- //////////
- if (styleEnabled) {
- ex1 = bounds.x1;
- ex2 = bounds.x2;
- ey1 = bounds.y1;
- ey2 = bounds.y2;
- updateBounds(bounds, ex1 - padding, ey1 - padding, ex2 + padding, ey2 + padding);
- }
+/***/ }),
- // always store the body bounds separately from the labels
- var bbOverlay = _p.overlayBounds = _p.overlayBounds || {};
- assignBoundingBox(bbOverlay, bounds);
- expandBoundingBoxSides(bbOverlay, manualExpansion);
- expandBoundingBox(bbOverlay, 1); // expand to work around browser dimension inaccuracies
+/***/ "./node_modules/hoist-non-react-statics/dist/hoist-non-react-statics.cjs.js":
+/*!**********************************************************************************!*\
+ !*** ./node_modules/hoist-non-react-statics/dist/hoist-non-react-statics.cjs.js ***!
+ \**********************************************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // handle label dimensions
- //////////////////////////
+"use strict";
- var bbLabels = _p.labelBounds = _p.labelBounds || {};
- if (bbLabels.all != null) {
- clearBoundingBox(bbLabels.all);
- } else {
- bbLabels.all = makeBoundingBox();
- }
- if (styleEnabled && options.includeLabels) {
- if (options.includeMainLabels) {
- updateBoundsFromLabel(bounds, ele, null);
- }
- if (isEdge) {
- if (options.includeSourceLabels) {
- updateBoundsFromLabel(bounds, ele, 'source');
- }
- if (options.includeTargetLabels) {
- updateBoundsFromLabel(bounds, ele, 'target');
- }
- }
- } // style enabled for labels
- } // if displayed
- bounds.x1 = noninf(bounds.x1);
- bounds.y1 = noninf(bounds.y1);
- bounds.x2 = noninf(bounds.x2);
- bounds.y2 = noninf(bounds.y2);
- bounds.w = noninf(bounds.x2 - bounds.x1);
- bounds.h = noninf(bounds.y2 - bounds.y1);
- if (bounds.w > 0 && bounds.h > 0 && displayed) {
- expandBoundingBoxSides(bounds, manualExpansion);
+var reactIs = __webpack_require__(/*! react-is */ "./node_modules/react-is/index.js");
- // expand bounds by 1 because antialiasing can increase the visual/effective size by 1 on all sides
- expandBoundingBox(bounds, 1);
- }
- return bounds;
+/**
+ * Copyright 2015, Yahoo! Inc.
+ * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.
+ */
+var REACT_STATICS = {
+ childContextTypes: true,
+ contextType: true,
+ contextTypes: true,
+ defaultProps: true,
+ displayName: true,
+ getDefaultProps: true,
+ getDerivedStateFromError: true,
+ getDerivedStateFromProps: true,
+ mixins: true,
+ propTypes: true,
+ type: true
};
-var getKey = function getKey(opts) {
- var i = 0;
- var tf = function tf(val) {
- return (val ? 1 : 0) << i++;
- };
- var key = 0;
- key += tf(opts.incudeNodes);
- key += tf(opts.includeEdges);
- key += tf(opts.includeLabels);
- key += tf(opts.includeMainLabels);
- key += tf(opts.includeSourceLabels);
- key += tf(opts.includeTargetLabels);
- key += tf(opts.includeOverlays);
- return key;
+var KNOWN_STATICS = {
+ name: true,
+ length: true,
+ prototype: true,
+ caller: true,
+ callee: true,
+ arguments: true,
+ arity: true
};
-var getBoundingBoxPosKey = function getBoundingBoxPosKey(ele) {
- if (ele.isEdge()) {
- var p1 = ele.source().position();
- var p2 = ele.target().position();
- var r = function r(x) {
- return Math.round(x);
- };
- return hashIntsArray([r(p1.x), r(p1.y), r(p2.x), r(p2.y)]);
- } else {
- return 0;
- }
+var FORWARD_REF_STATICS = {
+ '$$typeof': true,
+ render: true,
+ defaultProps: true,
+ displayName: true,
+ propTypes: true
};
-var cachedBoundingBoxImpl = function cachedBoundingBoxImpl(ele, opts) {
- var _p = ele._private;
- var bb;
- var isEdge = ele.isEdge();
- var key = opts == null ? defBbOptsKey : getKey(opts);
- var usingDefOpts = key === defBbOptsKey;
- var currPosKey = getBoundingBoxPosKey(ele);
- var isPosKeySame = _p.bbCachePosKey === currPosKey;
- var useCache = opts.useCache && isPosKeySame;
- var isDirty = function isDirty(ele) {
- return ele._private.bbCache == null || ele._private.styleDirty;
- };
- var needRecalc = !useCache || isDirty(ele) || isEdge && isDirty(ele.source()) || isDirty(ele.target());
- if (needRecalc) {
- if (!isPosKeySame) {
- ele.recalculateRenderedStyle(useCache);
- }
- bb = boundingBoxImpl(ele, defBbOpts);
- _p.bbCache = bb;
- _p.bbCachePosKey = currPosKey;
- } else {
- bb = _p.bbCache;
- }
+var MEMO_STATICS = {
+ '$$typeof': true,
+ compare: true,
+ defaultProps: true,
+ displayName: true,
+ propTypes: true,
+ type: true
+};
+var TYPE_STATICS = {};
+TYPE_STATICS[reactIs.ForwardRef] = FORWARD_REF_STATICS;
+TYPE_STATICS[reactIs.Memo] = MEMO_STATICS;
- // not using def opts => need to build up bb from combination of sub bbs
- if (!usingDefOpts) {
- var isNode = ele.isNode();
- bb = makeBoundingBox();
- if (opts.includeNodes && isNode || opts.includeEdges && !isNode) {
- if (opts.includeOverlays) {
- updateBoundsFromBox(bb, _p.overlayBounds);
- } else {
- updateBoundsFromBox(bb, _p.bodyBounds);
- }
- }
- if (opts.includeLabels) {
- if (opts.includeMainLabels && (!isEdge || opts.includeSourceLabels && opts.includeTargetLabels)) {
- updateBoundsFromBox(bb, _p.labelBounds.all);
- } else {
- if (opts.includeMainLabels) {
- updateBoundsFromBox(bb, _p.labelBounds.mainRot);
- }
- if (opts.includeSourceLabels) {
- updateBoundsFromBox(bb, _p.labelBounds.sourceRot);
- }
- if (opts.includeTargetLabels) {
- updateBoundsFromBox(bb, _p.labelBounds.targetRot);
- }
+function getStatics(component) {
+ // React v16.11 and below
+ if (reactIs.isMemo(component)) {
+ return MEMO_STATICS;
+ } // React v16.12 and above
+
+
+ return TYPE_STATICS[component['$$typeof']] || REACT_STATICS;
+}
+
+var defineProperty = Object.defineProperty;
+var getOwnPropertyNames = Object.getOwnPropertyNames;
+var getOwnPropertySymbols = Object.getOwnPropertySymbols;
+var getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;
+var getPrototypeOf = Object.getPrototypeOf;
+var objectPrototype = Object.prototype;
+function hoistNonReactStatics(targetComponent, sourceComponent, blacklist) {
+ if (typeof sourceComponent !== 'string') {
+ // don't hoist over string (html) components
+ if (objectPrototype) {
+ var inheritedComponent = getPrototypeOf(sourceComponent);
+
+ if (inheritedComponent && inheritedComponent !== objectPrototype) {
+ hoistNonReactStatics(targetComponent, inheritedComponent, blacklist);
}
}
- bb.w = bb.x2 - bb.x1;
- bb.h = bb.y2 - bb.y1;
- }
- return bb;
-};
-var defBbOpts = {
- includeNodes: true,
- includeEdges: true,
- includeLabels: true,
- includeMainLabels: true,
- includeSourceLabels: true,
- includeTargetLabels: true,
- includeOverlays: true,
- includeUnderlays: true,
- useCache: true
-};
-var defBbOptsKey = getKey(defBbOpts);
-var filledBbOpts = defaults$g(defBbOpts);
-elesfn$b.boundingBox = function (options) {
- var bounds;
- // the main usecase is ele.boundingBox() for a single element with no/def options
- // specified s.t. the cache is used, so check for this case to make it faster by
- // avoiding the overhead of the rest of the function
- if (this.length === 1 && this[0]._private.bbCache != null && !this[0]._private.styleDirty && (options === undefined || options.useCache === undefined || options.useCache === true)) {
- if (options === undefined) {
- options = defBbOpts;
- } else {
- options = filledBbOpts(options);
+ var keys = getOwnPropertyNames(sourceComponent);
+
+ if (getOwnPropertySymbols) {
+ keys = keys.concat(getOwnPropertySymbols(sourceComponent));
}
- bounds = cachedBoundingBoxImpl(this[0], options);
- } else {
- bounds = makeBoundingBox();
- options = options || defBbOpts;
- var opts = filledBbOpts(options);
- var eles = this;
- var cy = eles.cy();
- var styleEnabled = cy.styleEnabled();
- if (styleEnabled) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var _p = ele._private;
- var currPosKey = getBoundingBoxPosKey(ele);
- var isPosKeySame = _p.bbCachePosKey === currPosKey;
- var useCache = opts.useCache && isPosKeySame && !_p.styleDirty;
- ele.recalculateRenderedStyle(useCache);
+
+ var targetStatics = getStatics(targetComponent);
+ var sourceStatics = getStatics(sourceComponent);
+
+ for (var i = 0; i < keys.length; ++i) {
+ var key = keys[i];
+
+ if (!KNOWN_STATICS[key] && !(blacklist && blacklist[key]) && !(sourceStatics && sourceStatics[key]) && !(targetStatics && targetStatics[key])) {
+ var descriptor = getOwnPropertyDescriptor(sourceComponent, key);
+
+ try {
+ // Avoid failures from read-only properties
+ defineProperty(targetComponent, key, descriptor);
+ } catch (e) {}
}
}
- this.updateCompoundBounds(!options.useCache);
- for (var _i = 0; _i < eles.length; _i++) {
- var _ele = eles[_i];
- updateBoundsFromBox(bounds, cachedBoundingBoxImpl(_ele, opts));
+ }
+
+ return targetComponent;
+}
+
+module.exports = hoistNonReactStatics;
+
+
+/***/ }),
+
+/***/ "./node_modules/invariant/browser.js":
+/*!*******************************************!*\
+ !*** ./node_modules/invariant/browser.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+
+
+
+/**
+ * Use invariant() to assert state which your program assumes to be true.
+ *
+ * Provide sprintf-style format (only %s is supported) and arguments
+ * to provide information about what broke and what you were
+ * expecting.
+ *
+ * The invariant message will be stripped in production, but the invariant
+ * will remain to ensure logic does not differ in production.
+ */
+
+var invariant = function(condition, format, a, b, c, d, e, f) {
+ if (true) {
+ if (format === undefined) {
+ throw new Error('invariant requires an error message argument');
}
}
- bounds.x1 = noninf(bounds.x1);
- bounds.y1 = noninf(bounds.y1);
- bounds.x2 = noninf(bounds.x2);
- bounds.y2 = noninf(bounds.y2);
- bounds.w = noninf(bounds.x2 - bounds.x1);
- bounds.h = noninf(bounds.y2 - bounds.y1);
- return bounds;
-};
-elesfn$b.dirtyBoundingBoxCache = function () {
- for (var i = 0; i < this.length; i++) {
- var _p = this[i]._private;
- _p.bbCache = null;
- _p.bbCachePosKey = null;
- _p.bodyBounds = null;
- _p.overlayBounds = null;
- _p.labelBounds.all = null;
- _p.labelBounds.source = null;
- _p.labelBounds.target = null;
- _p.labelBounds.main = null;
- _p.labelBounds.sourceRot = null;
- _p.labelBounds.targetRot = null;
- _p.labelBounds.mainRot = null;
- _p.arrowBounds.source = null;
- _p.arrowBounds.target = null;
- _p.arrowBounds['mid-source'] = null;
- _p.arrowBounds['mid-target'] = null;
+
+ if (!condition) {
+ var error;
+ if (format === undefined) {
+ error = new Error(
+ 'Minified exception occurred; use the non-minified dev environment ' +
+ 'for the full error message and additional helpful warnings.'
+ );
+ } else {
+ var args = [a, b, c, d, e, f];
+ var argIndex = 0;
+ error = new Error(
+ format.replace(/%s/g, function() { return args[argIndex++]; })
+ );
+ error.name = 'Invariant Violation';
+ }
+
+ error.framesToPop = 1; // we don't care about invariant's own frame
+ throw error;
}
- this.emitAndNotify('bounds');
- return this;
};
-// private helper to get bounding box for custom node positions
-// - good for perf in certain cases but currently requires dirtying the rendered style
-// - would be better to not modify the nodes but the nodes are read directly everywhere in the renderer...
-// - try to use for only things like discrete layouts where the node position would change anyway
-elesfn$b.boundingBoxAt = function (fn) {
- var nodes = this.nodes();
- var cy = this.cy();
- var hasCompoundNodes = cy.hasCompoundNodes();
- var parents = cy.collection();
- if (hasCompoundNodes) {
- parents = nodes.filter(function (node) {
- return node.isParent();
- });
- nodes = nodes.not(parents);
- }
- if (plainObject(fn)) {
- var obj = fn;
- fn = function fn() {
- return obj;
- };
- }
- var storeOldPos = function storeOldPos(node, i) {
- return node._private.bbAtOldPos = fn(node, i);
- };
- var getOldPos = function getOldPos(node) {
- return node._private.bbAtOldPos;
- };
- cy.startBatch();
- nodes.forEach(storeOldPos).silentPositions(fn);
- if (hasCompoundNodes) {
- parents.dirtyCompoundBoundsCache();
- parents.dirtyBoundingBoxCache();
- parents.updateCompoundBounds(true); // force update b/c we're inside a batch cycle
- }
+module.exports = invariant;
- var bb = copyBoundingBox(this.boundingBox({
- useCache: false
- }));
- nodes.silentPositions(getOldPos);
- if (hasCompoundNodes) {
- parents.dirtyCompoundBoundsCache();
- parents.dirtyBoundingBoxCache();
- parents.updateCompoundBounds(true); // force update b/c we're inside a batch cycle
- }
- cy.endBatch();
- return bb;
-};
-fn$3.boundingbox = fn$3.bb = fn$3.boundingBox;
-fn$3.renderedBoundingbox = fn$3.renderedBoundingBox;
-var bounds = elesfn$b;
+/***/ }),
-var fn$2, elesfn$a;
-fn$2 = elesfn$a = {};
-var defineDimFns = function defineDimFns(opts) {
- opts.uppercaseName = capitalize(opts.name);
- opts.autoName = 'auto' + opts.uppercaseName;
- opts.labelName = 'label' + opts.uppercaseName;
- opts.outerName = 'outer' + opts.uppercaseName;
- opts.uppercaseOuterName = capitalize(opts.outerName);
- fn$2[opts.name] = function dimImpl() {
- var ele = this[0];
- var _p = ele._private;
- var cy = _p.cy;
- var styleEnabled = cy._private.styleEnabled;
- if (ele) {
- if (styleEnabled) {
- if (ele.isParent()) {
- ele.updateCompoundBounds();
- return _p[opts.autoName] || 0;
- }
- var d = ele.pstyle(opts.name);
- switch (d.strValue) {
- case 'label':
- ele.recalculateRenderedStyle();
- return _p.rstyle[opts.labelName] || 0;
- default:
- return d.pfValue;
- }
- } else {
- return 1;
- }
- }
- };
- fn$2['outer' + opts.uppercaseName] = function outerDimImpl() {
- var ele = this[0];
- var _p = ele._private;
- var cy = _p.cy;
- var styleEnabled = cy._private.styleEnabled;
- if (ele) {
- if (styleEnabled) {
- var dim = ele[opts.name]();
- var border = ele.pstyle('border-width').pfValue; // n.b. 1/2 each side
- var padding = 2 * ele.padding();
- return dim + border + padding;
- } else {
- return 1;
- }
- }
- };
- fn$2['rendered' + opts.uppercaseName] = function renderedDimImpl() {
- var ele = this[0];
- if (ele) {
- var d = ele[opts.name]();
- return d * this.cy().zoom();
- }
- };
- fn$2['rendered' + opts.uppercaseOuterName] = function renderedOuterDimImpl() {
- var ele = this[0];
- if (ele) {
- var od = ele[opts.outerName]();
- return od * this.cy().zoom();
- }
- };
-};
-defineDimFns({
- name: 'width'
-});
-defineDimFns({
- name: 'height'
-});
-elesfn$a.padding = function () {
- var ele = this[0];
- var _p = ele._private;
- if (ele.isParent()) {
- ele.updateCompoundBounds();
- if (_p.autoPadding !== undefined) {
- return _p.autoPadding;
- } else {
- return ele.pstyle('padding').pfValue;
- }
- } else {
- return ele.pstyle('padding').pfValue;
- }
-};
-elesfn$a.paddedHeight = function () {
- var ele = this[0];
- return ele.height() + 2 * ele.padding();
-};
-elesfn$a.paddedWidth = function () {
- var ele = this[0];
- return ele.width() + 2 * ele.padding();
-};
-var widthHeight = elesfn$a;
+/***/ "./node_modules/is-string-blank/index.js":
+/*!***********************************************!*\
+ !*** ./node_modules/is-string-blank/index.js ***!
+ \***********************************************/
+/***/ (function(module) {
-var ifEdge = function ifEdge(ele, getValue) {
- if (ele.isEdge()) {
- return getValue(ele);
- }
-};
-var ifEdgeRenderedPosition = function ifEdgeRenderedPosition(ele, getPoint) {
- if (ele.isEdge()) {
- var cy = ele.cy();
- return modelToRenderedPosition(getPoint(ele), cy.zoom(), cy.pan());
- }
+"use strict";
+
+
+/**
+ * Is this string all whitespace?
+ * This solution kind of makes my brain hurt, but it's significantly faster
+ * than !str.trim() or any other solution I could find.
+ *
+ * whitespace codes from: http://en.wikipedia.org/wiki/Whitespace_character
+ * and verified with:
+ *
+ * for(var i = 0; i < 65536; i++) {
+ * var s = String.fromCharCode(i);
+ * if(+s===0 && !s.trim()) console.log(i, s);
+ * }
+ *
+ * which counts a couple of these as *not* whitespace, but finds nothing else
+ * that *is* whitespace. Note that charCodeAt stops at 16 bits, but it appears
+ * that there are no whitespace characters above this, and code points above
+ * this do not map onto white space characters.
+ */
+
+module.exports = function(str){
+ var l = str.length,
+ a;
+ for(var i = 0; i < l; i++) {
+ a = str.charCodeAt(i);
+ if((a < 9 || a > 13) && (a !== 32) && (a !== 133) && (a !== 160) &&
+ (a !== 5760) && (a !== 6158) && (a < 8192 || a > 8205) &&
+ (a !== 8232) && (a !== 8233) && (a !== 8239) && (a !== 8287) &&
+ (a !== 8288) && (a !== 12288) && (a !== 65279)) {
+ return false;
+ }
+ }
+ return true;
+}
+
+
+/***/ }),
+
+/***/ "./node_modules/layout-base/layout-base.js":
+/*!*************************************************!*\
+ !*** ./node_modules/layout-base/layout-base.js ***!
+ \*************************************************/
+/***/ (function(module) {
+
+(function webpackUniversalModuleDefinition(root, factory) {
+ if(true)
+ module.exports = factory();
+ else {}
+})(this, function() {
+return /******/ (function(modules) { // webpackBootstrap
+/******/ // The module cache
+/******/ var installedModules = {};
+/******/
+/******/ // The require function
+/******/ function __nested_webpack_require_543__(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, __nested_webpack_require_543__);
+/******/
+/******/ // Flag the module as loaded
+/******/ module.l = true;
+/******/
+/******/ // Return the exports of the module
+/******/ return module.exports;
+/******/ }
+/******/
+/******/
+/******/ // expose the modules object (__webpack_modules__)
+/******/ __nested_webpack_require_543__.m = modules;
+/******/
+/******/ // expose the module cache
+/******/ __nested_webpack_require_543__.c = installedModules;
+/******/
+/******/ // identity function for calling harmony imports with the correct context
+/******/ __nested_webpack_require_543__.i = function(value) { return value; };
+/******/
+/******/ // define getter function for harmony exports
+/******/ __nested_webpack_require_543__.d = function(exports, name, getter) {
+/******/ if(!__nested_webpack_require_543__.o(exports, name)) {
+/******/ Object.defineProperty(exports, name, {
+/******/ configurable: false,
+/******/ enumerable: true,
+/******/ get: getter
+/******/ });
+/******/ }
+/******/ };
+/******/
+/******/ // getDefaultExport function for compatibility with non-harmony modules
+/******/ __nested_webpack_require_543__.n = function(module) {
+/******/ var getter = module && module.__esModule ?
+/******/ function getDefault() { return module['default']; } :
+/******/ function getModuleExports() { return module; };
+/******/ __nested_webpack_require_543__.d(getter, 'a', getter);
+/******/ return getter;
+/******/ };
+/******/
+/******/ // Object.prototype.hasOwnProperty.call
+/******/ __nested_webpack_require_543__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
+/******/
+/******/ // __webpack_public_path__
+/******/ __nested_webpack_require_543__.p = "";
+/******/
+/******/ // Load entry module and return exports
+/******/ return __nested_webpack_require_543__(__nested_webpack_require_543__.s = 28);
+/******/ })
+/************************************************************************/
+/******/ ([
+/* 0 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function LayoutConstants() {}
+
+/**
+ * Layout Quality: 0:draft, 1:default, 2:proof
+ */
+LayoutConstants.QUALITY = 1;
+
+/**
+ * Default parameters
+ */
+LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED = false;
+LayoutConstants.DEFAULT_INCREMENTAL = false;
+LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT = true;
+LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT = false;
+LayoutConstants.DEFAULT_ANIMATION_PERIOD = 50;
+LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES = false;
+
+// -----------------------------------------------------------------------------
+// Section: General other constants
+// -----------------------------------------------------------------------------
+/*
+ * Margins of a graph to be applied on bouding rectangle of its contents. We
+ * assume margins on all four sides to be uniform.
+ */
+LayoutConstants.DEFAULT_GRAPH_MARGIN = 15;
+
+/*
+ * Whether to consider labels in node dimensions or not
+ */
+LayoutConstants.NODE_DIMENSIONS_INCLUDE_LABELS = false;
+
+/*
+ * Default dimension of a non-compound node.
+ */
+LayoutConstants.SIMPLE_NODE_SIZE = 40;
+
+/*
+ * Default dimension of a non-compound node.
+ */
+LayoutConstants.SIMPLE_NODE_HALF_SIZE = LayoutConstants.SIMPLE_NODE_SIZE / 2;
+
+/*
+ * Empty compound node size. When a compound node is empty, its both
+ * dimensions should be of this value.
+ */
+LayoutConstants.EMPTY_COMPOUND_NODE_SIZE = 40;
+
+/*
+ * Minimum length that an edge should take during layout
+ */
+LayoutConstants.MIN_EDGE_LENGTH = 1;
+
+/*
+ * World boundaries that layout operates on
+ */
+LayoutConstants.WORLD_BOUNDARY = 1000000;
+
+/*
+ * World boundaries that random positioning can be performed with
+ */
+LayoutConstants.INITIAL_WORLD_BOUNDARY = LayoutConstants.WORLD_BOUNDARY / 1000;
+
+/*
+ * Coordinates of the world center
+ */
+LayoutConstants.WORLD_CENTER_X = 1200;
+LayoutConstants.WORLD_CENTER_Y = 900;
+
+module.exports = LayoutConstants;
+
+/***/ }),
+/* 1 */
+/***/ (function(module, exports, __nested_webpack_require_4947__) {
+
+"use strict";
+
+
+var LGraphObject = __nested_webpack_require_4947__(2);
+var IGeometry = __nested_webpack_require_4947__(8);
+var IMath = __nested_webpack_require_4947__(9);
+
+function LEdge(source, target, vEdge) {
+ LGraphObject.call(this, vEdge);
+
+ this.isOverlapingSourceAndTarget = false;
+ this.vGraphObject = vEdge;
+ this.bendpoints = [];
+ this.source = source;
+ this.target = target;
+}
+
+LEdge.prototype = Object.create(LGraphObject.prototype);
+
+for (var prop in LGraphObject) {
+ LEdge[prop] = LGraphObject[prop];
+}
+
+LEdge.prototype.getSource = function () {
+ return this.source;
};
-var ifEdgeRenderedPositions = function ifEdgeRenderedPositions(ele, getPoints) {
- if (ele.isEdge()) {
- var cy = ele.cy();
- var pan = cy.pan();
- var zoom = cy.zoom();
- return getPoints(ele).map(function (p) {
- return modelToRenderedPosition(p, zoom, pan);
- });
- }
+
+LEdge.prototype.getTarget = function () {
+ return this.target;
};
-var controlPoints = function controlPoints(ele) {
- return ele.renderer().getControlPoints(ele);
+
+LEdge.prototype.isInterGraph = function () {
+ return this.isInterGraph;
};
-var segmentPoints = function segmentPoints(ele) {
- return ele.renderer().getSegmentPoints(ele);
+
+LEdge.prototype.getLength = function () {
+ return this.length;
};
-var sourceEndpoint = function sourceEndpoint(ele) {
- return ele.renderer().getSourceEndpoint(ele);
+
+LEdge.prototype.isOverlapingSourceAndTarget = function () {
+ return this.isOverlapingSourceAndTarget;
};
-var targetEndpoint = function targetEndpoint(ele) {
- return ele.renderer().getTargetEndpoint(ele);
+
+LEdge.prototype.getBendpoints = function () {
+ return this.bendpoints;
};
-var midpoint = function midpoint(ele) {
- return ele.renderer().getEdgeMidpoint(ele);
+
+LEdge.prototype.getLca = function () {
+ return this.lca;
};
-var pts = {
- controlPoints: {
- get: controlPoints,
- mult: true
- },
- segmentPoints: {
- get: segmentPoints,
- mult: true
- },
- sourceEndpoint: {
- get: sourceEndpoint
- },
- targetEndpoint: {
- get: targetEndpoint
- },
- midpoint: {
- get: midpoint
- }
+
+LEdge.prototype.getSourceInLca = function () {
+ return this.sourceInLca;
};
-var renderedName = function renderedName(name) {
- return 'rendered' + name[0].toUpperCase() + name.substr(1);
+
+LEdge.prototype.getTargetInLca = function () {
+ return this.targetInLca;
};
-var edgePoints = Object.keys(pts).reduce(function (obj, name) {
- var spec = pts[name];
- var rName = renderedName(name);
- obj[name] = function () {
- return ifEdge(this, spec.get);
- };
- if (spec.mult) {
- obj[rName] = function () {
- return ifEdgeRenderedPositions(this, spec.get);
- };
+
+LEdge.prototype.getOtherEnd = function (node) {
+ if (this.source === node) {
+ return this.target;
+ } else if (this.target === node) {
+ return this.source;
} else {
- obj[rName] = function () {
- return ifEdgeRenderedPosition(this, spec.get);
- };
+ throw "Node is not incident with this edge";
}
- return obj;
-}, {});
+};
-var dimensions = extend({}, position, bounds, widthHeight, edgePoints);
+LEdge.prototype.getOtherEndInGraph = function (node, graph) {
+ var otherEnd = this.getOtherEnd(node);
+ var root = graph.getGraphManager().getRoot();
-/*!
-Event object based on jQuery events, MIT license
+ while (true) {
+ if (otherEnd.getOwner() == graph) {
+ return otherEnd;
+ }
-https://jquery.org/license/
-https://tldrlegal.com/license/mit-license
-https://github.com/jquery/jquery/blob/master/src/event.js
-*/
+ if (otherEnd.getOwner() == root) {
+ break;
+ }
-var Event = function Event(src, props) {
- this.recycle(src, props);
+ otherEnd = otherEnd.getOwner().getParent();
+ }
+
+ return null;
};
-function returnFalse() {
- return false;
-}
-function returnTrue() {
- return true;
-}
-// http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
-Event.prototype = {
- instanceString: function instanceString() {
- return 'event';
- },
- recycle: function recycle(src, props) {
- this.isImmediatePropagationStopped = this.isPropagationStopped = this.isDefaultPrevented = returnFalse;
- if (src != null && src.preventDefault) {
- // Browser Event object
- this.type = src.type;
+LEdge.prototype.updateLength = function () {
+ var clipPointCoordinates = new Array(4);
- // Events bubbling up the document may have been marked as prevented
- // by a handler lower down the tree; reflect the correct value.
- this.isDefaultPrevented = src.defaultPrevented ? returnTrue : returnFalse;
- } else if (src != null && src.type) {
- // Plain object containing all event details
- props = src;
- } else {
- // Event string
- this.type = src;
- }
+ this.isOverlapingSourceAndTarget = IGeometry.getIntersection(this.target.getRect(), this.source.getRect(), clipPointCoordinates);
- // Put explicitly provided properties onto the event object
- if (props != null) {
- // more efficient to manually copy fields we use
- this.originalEvent = props.originalEvent;
- this.type = props.type != null ? props.type : this.type;
- this.cy = props.cy;
- this.target = props.target;
- this.position = props.position;
- this.renderedPosition = props.renderedPosition;
- this.namespace = props.namespace;
- this.layout = props.layout;
- }
- if (this.cy != null && this.position != null && this.renderedPosition == null) {
- // create a rendered position based on the passed position
- var pos = this.position;
- var zoom = this.cy.zoom();
- var pan = this.cy.pan();
- this.renderedPosition = {
- x: pos.x * zoom + pan.x,
- y: pos.y * zoom + pan.y
- };
- }
+ if (!this.isOverlapingSourceAndTarget) {
+ this.lengthX = clipPointCoordinates[0] - clipPointCoordinates[2];
+ this.lengthY = clipPointCoordinates[1] - clipPointCoordinates[3];
- // Create a timestamp if incoming event doesn't have one
- this.timeStamp = src && src.timeStamp || Date.now();
- },
- preventDefault: function preventDefault() {
- this.isDefaultPrevented = returnTrue;
- var e = this.originalEvent;
- if (!e) {
- return;
+ if (Math.abs(this.lengthX) < 1.0) {
+ this.lengthX = IMath.sign(this.lengthX);
}
- // if preventDefault exists run it on the original event
- if (e.preventDefault) {
- e.preventDefault();
- }
- },
- stopPropagation: function stopPropagation() {
- this.isPropagationStopped = returnTrue;
- var e = this.originalEvent;
- if (!e) {
- return;
+ if (Math.abs(this.lengthY) < 1.0) {
+ this.lengthY = IMath.sign(this.lengthY);
}
- // if stopPropagation exists run it on the original event
- if (e.stopPropagation) {
- e.stopPropagation();
- }
- },
- stopImmediatePropagation: function stopImmediatePropagation() {
- this.isImmediatePropagationStopped = returnTrue;
- this.stopPropagation();
- },
- isDefaultPrevented: returnFalse,
- isPropagationStopped: returnFalse,
- isImmediatePropagationStopped: returnFalse
+ this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
+ }
};
-var eventRegex = /^([^.]+)(\.(?:[^.]+))?$/; // regex for matching event strings (e.g. "click.namespace")
-var universalNamespace = '.*'; // matches as if no namespace specified and prevents users from unbinding accidentally
+LEdge.prototype.updateLengthSimple = function () {
+ this.lengthX = this.target.getCenterX() - this.source.getCenterX();
+ this.lengthY = this.target.getCenterY() - this.source.getCenterY();
-var defaults$8 = {
- qualifierCompare: function qualifierCompare(q1, q2) {
- return q1 === q2;
- },
- eventMatches: function eventMatches( /*context, listener, eventObj*/
- ) {
- return true;
- },
- addEventFields: function addEventFields( /*context, evt*/
- ) {},
- callbackContext: function callbackContext(context /*, listener, eventObj*/) {
- return context;
- },
- beforeEmit: function beforeEmit( /* context, listener, eventObj */
- ) {},
- afterEmit: function afterEmit( /* context, listener, eventObj */
- ) {},
- bubble: function bubble( /*context*/
- ) {
- return false;
- },
- parent: function parent( /*context*/
- ) {
- return null;
- },
- context: null
-};
-var defaultsKeys = Object.keys(defaults$8);
-var emptyOpts = {};
-function Emitter() {
- var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : emptyOpts;
- var context = arguments.length > 1 ? arguments[1] : undefined;
- // micro-optimisation vs Object.assign() -- reduces Element instantiation time
- for (var i = 0; i < defaultsKeys.length; i++) {
- var key = defaultsKeys[i];
- this[key] = opts[key] || defaults$8[key];
- }
- this.context = context || this.context;
- this.listeners = [];
- this.emitting = 0;
-}
-var p = Emitter.prototype;
-var forEachEvent = function forEachEvent(self, handler, events, qualifier, callback, conf, confOverrides) {
- if (fn$6(qualifier)) {
- callback = qualifier;
- qualifier = null;
+ if (Math.abs(this.lengthX) < 1.0) {
+ this.lengthX = IMath.sign(this.lengthX);
}
- if (confOverrides) {
- if (conf == null) {
- conf = confOverrides;
- } else {
- conf = extend({}, conf, confOverrides);
- }
+
+ if (Math.abs(this.lengthY) < 1.0) {
+ this.lengthY = IMath.sign(this.lengthY);
}
- var eventList = array(events) ? events : events.split(/\s+/);
- for (var i = 0; i < eventList.length; i++) {
- var evt = eventList[i];
- if (emptyString(evt)) {
- continue;
- }
- var match = evt.match(eventRegex); // type[.namespace]
- if (match) {
- var type = match[1];
- var namespace = match[2] ? match[2] : null;
- var ret = handler(self, evt, type, namespace, qualifier, callback, conf);
- if (ret === false) {
- break;
- } // allow exiting early
- }
+ this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
+};
+
+module.exports = LEdge;
+
+/***/ }),
+/* 2 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function LGraphObject(vGraphObject) {
+ this.vGraphObject = vGraphObject;
+}
+
+module.exports = LGraphObject;
+
+/***/ }),
+/* 3 */
+/***/ (function(module, exports, __nested_webpack_require_8167__) {
+
+"use strict";
+
+
+var LGraphObject = __nested_webpack_require_8167__(2);
+var Integer = __nested_webpack_require_8167__(10);
+var RectangleD = __nested_webpack_require_8167__(13);
+var LayoutConstants = __nested_webpack_require_8167__(0);
+var RandomSeed = __nested_webpack_require_8167__(16);
+var PointD = __nested_webpack_require_8167__(5);
+
+function LNode(gm, loc, size, vNode) {
+ //Alternative constructor 1 : LNode(LGraphManager gm, Point loc, Dimension size, Object vNode)
+ if (size == null && vNode == null) {
+ vNode = loc;
}
+
+ LGraphObject.call(this, vNode);
+
+ //Alternative constructor 2 : LNode(Layout layout, Object vNode)
+ if (gm.graphManager != null) gm = gm.graphManager;
+
+ this.estimatedSize = Integer.MIN_VALUE;
+ this.inclusionTreeDepth = Integer.MAX_VALUE;
+ this.vGraphObject = vNode;
+ this.edges = [];
+ this.graphManager = gm;
+
+ if (size != null && loc != null) this.rect = new RectangleD(loc.x, loc.y, size.width, size.height);else this.rect = new RectangleD();
+}
+
+LNode.prototype = Object.create(LGraphObject.prototype);
+for (var prop in LGraphObject) {
+ LNode[prop] = LGraphObject[prop];
+}
+
+LNode.prototype.getEdges = function () {
+ return this.edges;
};
-var makeEventObj = function makeEventObj(self, obj) {
- self.addEventFields(self.context, obj);
- return new Event(obj.type, obj);
+LNode.prototype.getChild = function () {
+ return this.child;
};
-var forEachEventObj = function forEachEventObj(self, handler, events) {
- if (event(events)) {
- handler(self, events);
- return;
- } else if (plainObject(events)) {
- handler(self, makeEventObj(self, events));
- return;
- }
- var eventList = array(events) ? events : events.split(/\s+/);
- for (var i = 0; i < eventList.length; i++) {
- var evt = eventList[i];
- if (emptyString(evt)) {
- continue;
- }
- var match = evt.match(eventRegex); // type[.namespace]
- if (match) {
- var type = match[1];
- var namespace = match[2] ? match[2] : null;
- var eventObj = makeEventObj(self, {
- type: type,
- namespace: namespace,
- target: self.context
- });
- handler(self, eventObj);
- }
- }
+LNode.prototype.getOwner = function () {
+ // if (this.owner != null) {
+ // if (!(this.owner == null || this.owner.getNodes().indexOf(this) > -1)) {
+ // throw "assert failed";
+ // }
+ // }
+
+ return this.owner;
};
-p.on = p.addListener = function (events, qualifier, callback, conf, confOverrides) {
- forEachEvent(this, function (self, event, type, namespace, qualifier, callback, conf) {
- if (fn$6(callback)) {
- self.listeners.push({
- event: event,
- // full event string
- callback: callback,
- // callback to run
- type: type,
- // the event type (e.g. 'click')
- namespace: namespace,
- // the event namespace (e.g. ".foo")
- qualifier: qualifier,
- // a restriction on whether to match this emitter
- conf: conf // additional configuration
- });
- }
- }, events, qualifier, callback, conf, confOverrides);
- return this;
+
+LNode.prototype.getWidth = function () {
+ return this.rect.width;
};
-p.one = function (events, qualifier, callback, conf) {
- return this.on(events, qualifier, callback, conf, {
- one: true
- });
+
+LNode.prototype.setWidth = function (width) {
+ this.rect.width = width;
};
-p.removeListener = p.off = function (events, qualifier, callback, conf) {
- var _this = this;
- if (this.emitting !== 0) {
- this.listeners = copyArray(this.listeners);
- }
- var listeners = this.listeners;
- var _loop = function _loop(i) {
- var listener = listeners[i];
- forEachEvent(_this, function (self, event, type, namespace, qualifier, callback /*, conf*/) {
- if ((listener.type === type || events === '*') && (!namespace && listener.namespace !== '.*' || listener.namespace === namespace) && (!qualifier || self.qualifierCompare(listener.qualifier, qualifier)) && (!callback || listener.callback === callback)) {
- listeners.splice(i, 1);
- return false;
- }
- }, events, qualifier, callback, conf);
- };
- for (var i = listeners.length - 1; i >= 0; i--) {
- _loop(i);
- }
- return this;
+
+LNode.prototype.getHeight = function () {
+ return this.rect.height;
};
-p.removeAllListeners = function () {
- return this.removeListener('*');
+
+LNode.prototype.setHeight = function (height) {
+ this.rect.height = height;
};
-p.emit = p.trigger = function (events, extraParams, manualCallback) {
- var listeners = this.listeners;
- var numListenersBeforeEmit = listeners.length;
- this.emitting++;
- if (!array(extraParams)) {
- extraParams = [extraParams];
- }
- forEachEventObj(this, function (self, eventObj) {
- if (manualCallback != null) {
- listeners = [{
- event: eventObj.event,
- type: eventObj.type,
- namespace: eventObj.namespace,
- callback: manualCallback
- }];
- numListenersBeforeEmit = listeners.length;
+
+LNode.prototype.getCenterX = function () {
+ return this.rect.x + this.rect.width / 2;
+};
+
+LNode.prototype.getCenterY = function () {
+ return this.rect.y + this.rect.height / 2;
+};
+
+LNode.prototype.getCenter = function () {
+ return new PointD(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
+};
+
+LNode.prototype.getLocation = function () {
+ return new PointD(this.rect.x, this.rect.y);
+};
+
+LNode.prototype.getRect = function () {
+ return this.rect;
+};
+
+LNode.prototype.getDiagonal = function () {
+ return Math.sqrt(this.rect.width * this.rect.width + this.rect.height * this.rect.height);
+};
+
+/**
+ * This method returns half the diagonal length of this node.
+ */
+LNode.prototype.getHalfTheDiagonal = function () {
+ return Math.sqrt(this.rect.height * this.rect.height + this.rect.width * this.rect.width) / 2;
+};
+
+LNode.prototype.setRect = function (upperLeft, dimension) {
+ this.rect.x = upperLeft.x;
+ this.rect.y = upperLeft.y;
+ this.rect.width = dimension.width;
+ this.rect.height = dimension.height;
+};
+
+LNode.prototype.setCenter = function (cx, cy) {
+ this.rect.x = cx - this.rect.width / 2;
+ this.rect.y = cy - this.rect.height / 2;
+};
+
+LNode.prototype.setLocation = function (x, y) {
+ this.rect.x = x;
+ this.rect.y = y;
+};
+
+LNode.prototype.moveBy = function (dx, dy) {
+ this.rect.x += dx;
+ this.rect.y += dy;
+};
+
+LNode.prototype.getEdgeListToNode = function (to) {
+ var edgeList = [];
+ var edge;
+ var self = this;
+
+ self.edges.forEach(function (edge) {
+
+ if (edge.target == to) {
+ if (edge.source != self) throw "Incorrect edge source!";
+
+ edgeList.push(edge);
}
- var _loop2 = function _loop2(i) {
- var listener = listeners[i];
- if (listener.type === eventObj.type && (!listener.namespace || listener.namespace === eventObj.namespace || listener.namespace === universalNamespace) && self.eventMatches(self.context, listener, eventObj)) {
- var args = [eventObj];
- if (extraParams != null) {
- push(args, extraParams);
- }
- self.beforeEmit(self.context, listener, eventObj);
- if (listener.conf && listener.conf.one) {
- self.listeners = self.listeners.filter(function (l) {
- return l !== listener;
- });
- }
- var context = self.callbackContext(self.context, listener, eventObj);
- var ret = listener.callback.apply(context, args);
- self.afterEmit(self.context, listener, eventObj);
- if (ret === false) {
- eventObj.stopPropagation();
- eventObj.preventDefault();
- }
- } // if listener matches
- };
- for (var i = 0; i < numListenersBeforeEmit; i++) {
- _loop2(i);
- } // for listener
+ });
- if (self.bubble(self.context) && !eventObj.isPropagationStopped()) {
- self.parent(self.context).emit(eventObj, extraParams);
+ return edgeList;
+};
+
+LNode.prototype.getEdgesBetween = function (other) {
+ var edgeList = [];
+ var edge;
+
+ var self = this;
+ self.edges.forEach(function (edge) {
+
+ if (!(edge.source == self || edge.target == self)) throw "Incorrect edge source and/or target";
+
+ if (edge.target == other || edge.source == other) {
+ edgeList.push(edge);
}
- }, events);
- this.emitting--;
- return this;
+ });
+
+ return edgeList;
};
-var emitterOptions$1 = {
- qualifierCompare: function qualifierCompare(selector1, selector2) {
- if (selector1 == null || selector2 == null) {
- return selector1 == null && selector2 == null;
+LNode.prototype.getNeighborsList = function () {
+ var neighbors = new Set();
+
+ var self = this;
+ self.edges.forEach(function (edge) {
+
+ if (edge.source == self) {
+ neighbors.add(edge.target);
} else {
- return selector1.sameText(selector2);
- }
- },
- eventMatches: function eventMatches(ele, listener, eventObj) {
- var selector = listener.qualifier;
- if (selector != null) {
- return ele !== eventObj.target && element(eventObj.target) && selector.matches(eventObj.target);
+ if (edge.target != self) {
+ throw "Incorrect incidency!";
+ }
+
+ neighbors.add(edge.source);
}
- return true;
- },
- addEventFields: function addEventFields(ele, evt) {
- evt.cy = ele.cy();
- evt.target = ele;
- },
- callbackContext: function callbackContext(ele, listener, eventObj) {
- return listener.qualifier != null ? eventObj.target : ele;
- },
- beforeEmit: function beforeEmit(context, listener /*, eventObj*/) {
- if (listener.conf && listener.conf.once) {
- listener.conf.onceCollection.removeListener(listener.event, listener.qualifier, listener.callback);
+ });
+
+ return neighbors;
+};
+
+LNode.prototype.withChildren = function () {
+ var withNeighborsList = new Set();
+ var childNode;
+ var children;
+
+ withNeighborsList.add(this);
+
+ if (this.child != null) {
+ var nodes = this.child.getNodes();
+ for (var i = 0; i < nodes.length; i++) {
+ childNode = nodes[i];
+ children = childNode.withChildren();
+ children.forEach(function (node) {
+ withNeighborsList.add(node);
+ });
}
- },
- bubble: function bubble() {
- return true;
- },
- parent: function parent(ele) {
- return ele.isChild() ? ele.parent() : ele.cy();
}
+
+ return withNeighborsList;
};
-var argSelector$1 = function argSelector(arg) {
- if (string(arg)) {
- return new Selector(arg);
+
+LNode.prototype.getNoOfChildren = function () {
+ var noOfChildren = 0;
+ var childNode;
+
+ if (this.child == null) {
+ noOfChildren = 1;
} else {
- return arg;
+ var nodes = this.child.getNodes();
+ for (var i = 0; i < nodes.length; i++) {
+ childNode = nodes[i];
+
+ noOfChildren += childNode.getNoOfChildren();
+ }
+ }
+
+ if (noOfChildren == 0) {
+ noOfChildren = 1;
}
+ return noOfChildren;
};
-var elesfn$9 = {
- createEmitter: function createEmitter() {
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var _p = ele._private;
- if (!_p.emitter) {
- _p.emitter = new Emitter(emitterOptions$1, ele);
- }
- }
- return this;
- },
- emitter: function emitter() {
- return this._private.emitter;
- },
- on: function on(events, selector, callback) {
- var argSel = argSelector$1(selector);
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().on(events, argSel, callback);
- }
- return this;
- },
- removeListener: function removeListener(events, selector, callback) {
- var argSel = argSelector$1(selector);
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().removeListener(events, argSel, callback);
- }
- return this;
- },
- removeAllListeners: function removeAllListeners() {
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().removeAllListeners();
- }
- return this;
- },
- one: function one(events, selector, callback) {
- var argSel = argSelector$1(selector);
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().one(events, argSel, callback);
- }
- return this;
- },
- once: function once(events, selector, callback) {
- var argSel = argSelector$1(selector);
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().on(events, argSel, callback, {
- once: true,
- onceCollection: this
- });
- }
- },
- emit: function emit(events, extraParams) {
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- ele.emitter().emit(events, extraParams);
- }
- return this;
- },
- emitAndNotify: function emitAndNotify(event, extraParams) {
- // for internal use only
- if (this.length === 0) {
- return;
- } // empty collections don't need to notify anything
- // notify renderer
- this.cy().notify(event, this);
- this.emit(event, extraParams);
- return this;
+LNode.prototype.getEstimatedSize = function () {
+ if (this.estimatedSize == Integer.MIN_VALUE) {
+ throw "assert failed";
}
+ return this.estimatedSize;
};
-define.eventAliasesOn(elesfn$9);
-var elesfn$8 = {
- nodes: function nodes(selector) {
- return this.filter(function (ele) {
- return ele.isNode();
- }).filter(selector);
- },
- edges: function edges(selector) {
- return this.filter(function (ele) {
- return ele.isEdge();
- }).filter(selector);
- },
- // internal helper to get nodes and edges as separate collections with single iteration over elements
- byGroup: function byGroup() {
- var nodes = this.spawn();
- var edges = this.spawn();
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- if (ele.isNode()) {
- nodes.push(ele);
- } else {
- edges.push(ele);
- }
- }
- return {
- nodes: nodes,
- edges: edges
- };
- },
- filter: function filter(_filter, thisArg) {
- if (_filter === undefined) {
- // check this first b/c it's the most common/performant case
- return this;
- } else if (string(_filter) || elementOrCollection(_filter)) {
- return new Selector(_filter).filter(this);
- } else if (fn$6(_filter)) {
- var filterEles = this.spawn();
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var include = thisArg ? _filter.apply(thisArg, [ele, i, eles]) : _filter(ele, i, eles);
- if (include) {
- filterEles.push(ele);
- }
- }
- return filterEles;
- }
- return this.spawn(); // if not handled by above, give 'em an empty collection
- },
+LNode.prototype.calcEstimatedSize = function () {
+ if (this.child == null) {
+ return this.estimatedSize = (this.rect.width + this.rect.height) / 2;
+ } else {
+ this.estimatedSize = this.child.calcEstimatedSize();
+ this.rect.width = this.estimatedSize;
+ this.rect.height = this.estimatedSize;
- not: function not(toRemove) {
- if (!toRemove) {
- return this;
- } else {
- if (string(toRemove)) {
- toRemove = this.filter(toRemove);
- }
- var elements = this.spawn();
- for (var i = 0; i < this.length; i++) {
- var element = this[i];
- var remove = toRemove.has(element);
- if (!remove) {
- elements.push(element);
- }
- }
- return elements;
- }
- },
- absoluteComplement: function absoluteComplement() {
- var cy = this.cy();
- return cy.mutableElements().not(this);
- },
- intersect: function intersect(other) {
- // if a selector is specified, then filter by it instead
- if (string(other)) {
- var selector = other;
- return this.filter(selector);
- }
- var elements = this.spawn();
- var col1 = this;
- var col2 = other;
- var col1Smaller = this.length < other.length;
- var colS = col1Smaller ? col1 : col2;
- var colL = col1Smaller ? col2 : col1;
- for (var i = 0; i < colS.length; i++) {
- var ele = colS[i];
- if (colL.has(ele)) {
- elements.push(ele);
- }
- }
- return elements;
- },
- xor: function xor(other) {
- var cy = this._private.cy;
- if (string(other)) {
- other = cy.$(other);
- }
- var elements = this.spawn();
- var col1 = this;
- var col2 = other;
- var add = function add(col, other) {
- for (var i = 0; i < col.length; i++) {
- var ele = col[i];
- var id = ele._private.data.id;
- var inOther = other.hasElementWithId(id);
- if (!inOther) {
- elements.push(ele);
- }
- }
- };
- add(col1, col2);
- add(col2, col1);
- return elements;
- },
- diff: function diff(other) {
- var cy = this._private.cy;
- if (string(other)) {
- other = cy.$(other);
- }
- var left = this.spawn();
- var right = this.spawn();
- var both = this.spawn();
- var col1 = this;
- var col2 = other;
- var add = function add(col, other, retEles) {
- for (var i = 0; i < col.length; i++) {
- var ele = col[i];
- var id = ele._private.data.id;
- var inOther = other.hasElementWithId(id);
- if (inOther) {
- both.merge(ele);
- } else {
- retEles.push(ele);
- }
- }
- };
- add(col1, col2, left);
- add(col2, col1, right);
- return {
- left: left,
- right: right,
- both: both
- };
- },
- add: function add(toAdd) {
- var cy = this._private.cy;
- if (!toAdd) {
- return this;
- }
- if (string(toAdd)) {
- var selector = toAdd;
- toAdd = cy.mutableElements().filter(selector);
- }
- var elements = this.spawnSelf();
- for (var i = 0; i < toAdd.length; i++) {
- var ele = toAdd[i];
- var add = !this.has(ele);
- if (add) {
- elements.push(ele);
- }
- }
- return elements;
- },
- // in place merge on calling collection
- merge: function merge(toAdd) {
- var _p = this._private;
- var cy = _p.cy;
- if (!toAdd) {
- return this;
- }
- if (toAdd && string(toAdd)) {
- var selector = toAdd;
- toAdd = cy.mutableElements().filter(selector);
- }
- var map = _p.map;
- for (var i = 0; i < toAdd.length; i++) {
- var toAddEle = toAdd[i];
- var id = toAddEle._private.data.id;
- var add = !map.has(id);
- if (add) {
- var index = this.length++;
- this[index] = toAddEle;
- map.set(id, {
- ele: toAddEle,
- index: index
- });
- }
- }
- return this; // chaining
- },
+ return this.estimatedSize;
+ }
+};
- unmergeAt: function unmergeAt(i) {
- var ele = this[i];
- var id = ele.id();
- var _p = this._private;
- var map = _p.map;
+LNode.prototype.scatter = function () {
+ var randomCenterX;
+ var randomCenterY;
- // remove ele
- this[i] = undefined;
- map["delete"](id);
- var unmergedLastEle = i === this.length - 1;
+ var minX = -LayoutConstants.INITIAL_WORLD_BOUNDARY;
+ var maxX = LayoutConstants.INITIAL_WORLD_BOUNDARY;
+ randomCenterX = LayoutConstants.WORLD_CENTER_X + RandomSeed.nextDouble() * (maxX - minX) + minX;
- // replace empty spot with last ele in collection
- if (this.length > 1 && !unmergedLastEle) {
- var lastEleI = this.length - 1;
- var lastEle = this[lastEleI];
- var lastEleId = lastEle._private.data.id;
- this[lastEleI] = undefined;
- this[i] = lastEle;
- map.set(lastEleId, {
- ele: lastEle,
- index: i
- });
- }
+ var minY = -LayoutConstants.INITIAL_WORLD_BOUNDARY;
+ var maxY = LayoutConstants.INITIAL_WORLD_BOUNDARY;
+ randomCenterY = LayoutConstants.WORLD_CENTER_Y + RandomSeed.nextDouble() * (maxY - minY) + minY;
- // the collection is now 1 ele smaller
- this.length--;
- return this;
- },
- // remove single ele in place in calling collection
- unmergeOne: function unmergeOne(ele) {
- ele = ele[0];
- var _p = this._private;
- var id = ele._private.data.id;
- var map = _p.map;
- var entry = map.get(id);
- if (!entry) {
- return this; // no need to remove
- }
+ this.rect.x = randomCenterX;
+ this.rect.y = randomCenterY;
+};
- var i = entry.index;
- this.unmergeAt(i);
- return this;
- },
- // remove eles in place on calling collection
- unmerge: function unmerge(toRemove) {
- var cy = this._private.cy;
- if (!toRemove) {
- return this;
- }
- if (toRemove && string(toRemove)) {
- var selector = toRemove;
- toRemove = cy.mutableElements().filter(selector);
- }
- for (var i = 0; i < toRemove.length; i++) {
- this.unmergeOne(toRemove[i]);
- }
- return this; // chaining
- },
+LNode.prototype.updateBounds = function () {
+ if (this.getChild() == null) {
+ throw "assert failed";
+ }
+ if (this.getChild().getNodes().length != 0) {
+ // wrap the children nodes by re-arranging the boundaries
+ var childGraph = this.getChild();
+ childGraph.updateBounds(true);
- unmergeBy: function unmergeBy(toRmFn) {
- for (var i = this.length - 1; i >= 0; i--) {
- var ele = this[i];
- if (toRmFn(ele)) {
- this.unmergeAt(i);
- }
- }
- return this;
- },
- map: function map(mapFn, thisArg) {
- var arr = [];
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var ret = thisArg ? mapFn.apply(thisArg, [ele, i, eles]) : mapFn(ele, i, eles);
- arr.push(ret);
- }
- return arr;
- },
- reduce: function reduce(fn, initialValue) {
- var val = initialValue;
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- val = fn(val, eles[i], i, eles);
- }
- return val;
- },
- max: function max(valFn, thisArg) {
- var max = -Infinity;
- var maxEle;
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var val = thisArg ? valFn.apply(thisArg, [ele, i, eles]) : valFn(ele, i, eles);
- if (val > max) {
- max = val;
- maxEle = ele;
+ this.rect.x = childGraph.getLeft();
+ this.rect.y = childGraph.getTop();
+
+ this.setWidth(childGraph.getRight() - childGraph.getLeft());
+ this.setHeight(childGraph.getBottom() - childGraph.getTop());
+
+ // Update compound bounds considering its label properties
+ if (LayoutConstants.NODE_DIMENSIONS_INCLUDE_LABELS) {
+
+ var width = childGraph.getRight() - childGraph.getLeft();
+ var height = childGraph.getBottom() - childGraph.getTop();
+
+ if (this.labelWidth) {
+ if (this.labelPosHorizontal == "left") {
+ this.rect.x -= this.labelWidth;
+ this.setWidth(width + this.labelWidth);
+ } else if (this.labelPosHorizontal == "center" && this.labelWidth > width) {
+ this.rect.x -= (this.labelWidth - width) / 2;
+ this.setWidth(this.labelWidth);
+ } else if (this.labelPosHorizontal == "right") {
+ this.setWidth(width + this.labelWidth);
+ }
}
- }
- return {
- value: max,
- ele: maxEle
- };
- },
- min: function min(valFn, thisArg) {
- var min = Infinity;
- var minEle;
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var val = thisArg ? valFn.apply(thisArg, [ele, i, eles]) : valFn(ele, i, eles);
- if (val < min) {
- min = val;
- minEle = ele;
+
+ if (this.labelHeight) {
+ if (this.labelPosVertical == "top") {
+ this.rect.y -= this.labelHeight;
+ this.setHeight(height + this.labelHeight);
+ } else if (this.labelPosVertical == "center" && this.labelHeight > height) {
+ this.rect.y -= (this.labelHeight - height) / 2;
+ this.setHeight(this.labelHeight);
+ } else if (this.labelPosVertical == "bottom") {
+ this.setHeight(height + this.labelHeight);
+ }
}
}
- return {
- value: min,
- ele: minEle
- };
}
};
-// aliases
-var fn$1 = elesfn$8;
-fn$1['u'] = fn$1['|'] = fn$1['+'] = fn$1.union = fn$1.or = fn$1.add;
-fn$1['\\'] = fn$1['!'] = fn$1['-'] = fn$1.difference = fn$1.relativeComplement = fn$1.subtract = fn$1.not;
-fn$1['n'] = fn$1['&'] = fn$1['.'] = fn$1.and = fn$1.intersection = fn$1.intersect;
-fn$1['^'] = fn$1['(+)'] = fn$1['(-)'] = fn$1.symmetricDifference = fn$1.symdiff = fn$1.xor;
-fn$1.fnFilter = fn$1.filterFn = fn$1.stdFilter = fn$1.filter;
-fn$1.complement = fn$1.abscomp = fn$1.absoluteComplement;
-
-var elesfn$7 = {
- isNode: function isNode() {
- return this.group() === 'nodes';
- },
- isEdge: function isEdge() {
- return this.group() === 'edges';
- },
- isLoop: function isLoop() {
- return this.isEdge() && this.source()[0] === this.target()[0];
- },
- isSimple: function isSimple() {
- return this.isEdge() && this.source()[0] !== this.target()[0];
- },
- group: function group() {
- var ele = this[0];
- if (ele) {
- return ele._private.group;
- }
+LNode.prototype.getInclusionTreeDepth = function () {
+ if (this.inclusionTreeDepth == Integer.MAX_VALUE) {
+ throw "assert failed";
}
+ return this.inclusionTreeDepth;
};
-/**
- * Elements are drawn in a specific order based on compound depth (low to high), the element type (nodes above edges),
- * and z-index (low to high). These styles affect how this applies:
- *
- * z-compound-depth: May be `bottom | orphan | auto | top`. The first drawn is `bottom`, then `orphan` which is the
- * same depth as the root of the compound graph, followed by the default value `auto` which draws in order from
- * root to leaves of the compound graph. The last drawn is `top`.
- * z-index-compare: May be `auto | manual`. The default value is `auto` which always draws edges under nodes.
- * `manual` ignores this convention and draws based on the `z-index` value setting.
- * z-index: An integer value that affects the relative draw order of elements. In general, an element with a higher
- * `z-index` will be drawn on top of an element with a lower `z-index`.
- */
-var zIndexSort = function zIndexSort(a, b) {
- var cy = a.cy();
- var hasCompoundNodes = cy.hasCompoundNodes();
- function getDepth(ele) {
- var style = ele.pstyle('z-compound-depth');
- if (style.value === 'auto') {
- return hasCompoundNodes ? ele.zDepth() : 0;
- } else if (style.value === 'bottom') {
- return -1;
- } else if (style.value === 'top') {
- return MAX_INT$1;
- }
- // 'orphan'
- return 0;
- }
- var depthDiff = getDepth(a) - getDepth(b);
- if (depthDiff !== 0) {
- return depthDiff;
- }
- function getEleDepth(ele) {
- var style = ele.pstyle('z-index-compare');
- if (style.value === 'auto') {
- return ele.isNode() ? 1 : 0;
- }
- // 'manual'
- return 0;
+LNode.prototype.transform = function (trans) {
+ var left = this.rect.x;
+
+ if (left > LayoutConstants.WORLD_BOUNDARY) {
+ left = LayoutConstants.WORLD_BOUNDARY;
+ } else if (left < -LayoutConstants.WORLD_BOUNDARY) {
+ left = -LayoutConstants.WORLD_BOUNDARY;
}
- var eleDiff = getEleDepth(a) - getEleDepth(b);
- if (eleDiff !== 0) {
- return eleDiff;
+
+ var top = this.rect.y;
+
+ if (top > LayoutConstants.WORLD_BOUNDARY) {
+ top = LayoutConstants.WORLD_BOUNDARY;
+ } else if (top < -LayoutConstants.WORLD_BOUNDARY) {
+ top = -LayoutConstants.WORLD_BOUNDARY;
}
- var zDiff = a.pstyle('z-index').value - b.pstyle('z-index').value;
- if (zDiff !== 0) {
- return zDiff;
+
+ var leftTop = new PointD(left, top);
+ var vLeftTop = trans.inverseTransformPoint(leftTop);
+
+ this.setLocation(vLeftTop.x, vLeftTop.y);
+};
+
+LNode.prototype.getLeft = function () {
+ return this.rect.x;
+};
+
+LNode.prototype.getRight = function () {
+ return this.rect.x + this.rect.width;
+};
+
+LNode.prototype.getTop = function () {
+ return this.rect.y;
+};
+
+LNode.prototype.getBottom = function () {
+ return this.rect.y + this.rect.height;
+};
+
+LNode.prototype.getParent = function () {
+ if (this.owner == null) {
+ return null;
}
- // compare indices in the core (order added to graph w/ last on top)
- return a.poolIndex() - b.poolIndex();
+
+ return this.owner.getParent();
};
-var elesfn$6 = {
- forEach: function forEach(fn, thisArg) {
- if (fn$6(fn)) {
- var N = this.length;
- for (var i = 0; i < N; i++) {
- var ele = this[i];
- var ret = thisArg ? fn.apply(thisArg, [ele, i, this]) : fn(ele, i, this);
- if (ret === false) {
- break;
- } // exit each early on return false
- }
- }
+module.exports = LNode;
- return this;
- },
- toArray: function toArray() {
- var array = [];
- for (var i = 0; i < this.length; i++) {
- array.push(this[i]);
- }
- return array;
- },
- slice: function slice(start, end) {
- var array = [];
- var thisSize = this.length;
- if (end == null) {
- end = thisSize;
- }
- if (start == null) {
- start = 0;
- }
- if (start < 0) {
- start = thisSize + start;
- }
- if (end < 0) {
- end = thisSize + end;
- }
- for (var i = start; i >= 0 && i < end && i < thisSize; i++) {
- array.push(this[i]);
- }
- return this.spawn(array);
- },
- size: function size() {
- return this.length;
- },
- eq: function eq(i) {
- return this[i] || this.spawn();
- },
- first: function first() {
- return this[0] || this.spawn();
- },
- last: function last() {
- return this[this.length - 1] || this.spawn();
- },
- empty: function empty() {
- return this.length === 0;
- },
- nonempty: function nonempty() {
- return !this.empty();
- },
- sort: function sort(sortFn) {
- if (!fn$6(sortFn)) {
- return this;
- }
- var sorted = this.toArray().sort(sortFn);
- return this.spawn(sorted);
- },
- sortByZIndex: function sortByZIndex() {
- return this.sort(zIndexSort);
- },
- zDepth: function zDepth() {
- var ele = this[0];
- if (!ele) {
- return undefined;
- }
+/***/ }),
+/* 4 */
+/***/ (function(module, exports, __nested_webpack_require_17290__) {
- // let cy = ele.cy();
- var _p = ele._private;
- var group = _p.group;
- if (group === 'nodes') {
- var depth = _p.data.parent ? ele.parents().size() : 0;
- if (!ele.isParent()) {
- return MAX_INT$1 - 1; // childless nodes always on top
- }
+"use strict";
- return depth;
- } else {
- var src = _p.source;
- var tgt = _p.target;
- var srcDepth = src.zDepth();
- var tgtDepth = tgt.zDepth();
- return Math.max(srcDepth, tgtDepth, 0); // depth of deepest parent
- }
+
+var LayoutConstants = __nested_webpack_require_17290__(0);
+
+function FDLayoutConstants() {}
+
+//FDLayoutConstants inherits static props in LayoutConstants
+for (var prop in LayoutConstants) {
+ FDLayoutConstants[prop] = LayoutConstants[prop];
+}
+
+FDLayoutConstants.MAX_ITERATIONS = 2500;
+
+FDLayoutConstants.DEFAULT_EDGE_LENGTH = 50;
+FDLayoutConstants.DEFAULT_SPRING_STRENGTH = 0.45;
+FDLayoutConstants.DEFAULT_REPULSION_STRENGTH = 4500.0;
+FDLayoutConstants.DEFAULT_GRAVITY_STRENGTH = 0.4;
+FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1.0;
+FDLayoutConstants.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8;
+FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5;
+FDLayoutConstants.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = true;
+FDLayoutConstants.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = true;
+FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL = 0.3;
+FDLayoutConstants.COOLING_ADAPTATION_FACTOR = 0.33;
+FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT = 1000;
+FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT = 5000;
+FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100.0;
+FDLayoutConstants.MAX_NODE_DISPLACEMENT = FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3;
+FDLayoutConstants.MIN_REPULSION_DIST = FDLayoutConstants.DEFAULT_EDGE_LENGTH / 10.0;
+FDLayoutConstants.CONVERGENCE_CHECK_PERIOD = 100;
+FDLayoutConstants.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = 0.1;
+FDLayoutConstants.MIN_EDGE_LENGTH = 1;
+FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD = 10;
+
+module.exports = FDLayoutConstants;
+
+/***/ }),
+/* 5 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function PointD(x, y) {
+ if (x == null && y == null) {
+ this.x = 0;
+ this.y = 0;
+ } else {
+ this.x = x;
+ this.y = y;
}
+}
+
+PointD.prototype.getX = function () {
+ return this.x;
};
-elesfn$6.each = elesfn$6.forEach;
-var defineSymbolIterator = function defineSymbolIterator() {
- var typeofUndef = "undefined" ;
- var isIteratorSupported = (typeof Symbol === "undefined" ? "undefined" : _typeof(Symbol)) != typeofUndef && _typeof(Symbol.iterator) != typeofUndef; // eslint-disable-line no-undef
+PointD.prototype.getY = function () {
+ return this.y;
+};
- if (isIteratorSupported) {
- elesfn$6[Symbol.iterator] = function () {
- var _this = this;
- // eslint-disable-line no-undef
- var entry = {
- value: undefined,
- done: false
- };
- var i = 0;
- var length = this.length;
- return _defineProperty({
- next: function next() {
- if (i < length) {
- entry.value = _this[i++];
- } else {
- entry.value = undefined;
- entry.done = true;
- }
- return entry;
- }
- }, Symbol.iterator, function () {
- // eslint-disable-line no-undef
- return this;
- });
- };
- }
+PointD.prototype.setX = function (x) {
+ this.x = x;
};
-defineSymbolIterator();
-var getLayoutDimensionOptions = defaults$g({
- nodeDimensionsIncludeLabels: false
-});
-var elesfn$5 = {
- // Calculates and returns node dimensions { x, y } based on options given
- layoutDimensions: function layoutDimensions(options) {
- options = getLayoutDimensionOptions(options);
- var dims;
- if (!this.takesUpSpace()) {
- dims = {
- w: 0,
- h: 0
- };
- } else if (options.nodeDimensionsIncludeLabels) {
- var bbDim = this.boundingBox();
- dims = {
- w: bbDim.w,
- h: bbDim.h
- };
- } else {
- dims = {
- w: this.outerWidth(),
- h: this.outerHeight()
- };
- }
+PointD.prototype.setY = function (y) {
+ this.y = y;
+};
- // sanitise the dimensions for external layouts (avoid division by zero)
- if (dims.w === 0 || dims.h === 0) {
- dims.w = dims.h = 1;
- }
- return dims;
- },
- // using standard layout options, apply position function (w/ or w/o animation)
- layoutPositions: function layoutPositions(layout, options, fn) {
- var nodes = this.nodes().filter(function (n) {
- return !n.isParent();
- });
- var cy = this.cy();
- var layoutEles = options.eles; // nodes & edges
- var getMemoizeKey = function getMemoizeKey(node) {
- return node.id();
- };
- var fnMem = memoize(fn, getMemoizeKey); // memoized version of position function
+PointD.prototype.getDifference = function (pt) {
+ return new DimensionD(this.x - pt.x, this.y - pt.y);
+};
- layout.emit({
- type: 'layoutstart',
- layout: layout
- });
- layout.animations = [];
- var calculateSpacing = function calculateSpacing(spacing, nodesBb, pos) {
- var center = {
- x: nodesBb.x1 + nodesBb.w / 2,
- y: nodesBb.y1 + nodesBb.h / 2
- };
- var spacingVector = {
- // scale from center of bounding box (not necessarily 0,0)
- x: (pos.x - center.x) * spacing,
- y: (pos.y - center.y) * spacing
- };
- return {
- x: center.x + spacingVector.x,
- y: center.y + spacingVector.y
- };
- };
- var useSpacingFactor = options.spacingFactor && options.spacingFactor !== 1;
- var spacingBb = function spacingBb() {
- if (!useSpacingFactor) {
- return null;
- }
- var bb = makeBoundingBox();
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- var pos = fnMem(node, i);
- expandBoundingBoxByPoint(bb, pos.x, pos.y);
- }
- return bb;
- };
- var bb = spacingBb();
- var getFinalPos = memoize(function (node, i) {
- var newPos = fnMem(node, i);
- if (useSpacingFactor) {
- var spacing = Math.abs(options.spacingFactor);
- newPos = calculateSpacing(spacing, bb, newPos);
- }
- if (options.transform != null) {
- newPos = options.transform(node, newPos);
- }
- return newPos;
- }, getMemoizeKey);
- if (options.animate) {
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- var newPos = getFinalPos(node, i);
- var animateNode = options.animateFilter == null || options.animateFilter(node, i);
- if (animateNode) {
- var ani = node.animation({
- position: newPos,
- duration: options.animationDuration,
- easing: options.animationEasing
- });
- layout.animations.push(ani);
- } else {
- node.position(newPos);
- }
- }
- if (options.fit) {
- var fitAni = cy.animation({
- fit: {
- boundingBox: layoutEles.boundingBoxAt(getFinalPos),
- padding: options.padding
- },
- duration: options.animationDuration,
- easing: options.animationEasing
- });
- layout.animations.push(fitAni);
- } else if (options.zoom !== undefined && options.pan !== undefined) {
- var zoomPanAni = cy.animation({
- zoom: options.zoom,
- pan: options.pan,
- duration: options.animationDuration,
- easing: options.animationEasing
- });
- layout.animations.push(zoomPanAni);
- }
- layout.animations.forEach(function (ani) {
- return ani.play();
- });
- layout.one('layoutready', options.ready);
- layout.emit({
- type: 'layoutready',
- layout: layout
- });
- Promise$1.all(layout.animations.map(function (ani) {
- return ani.promise();
- })).then(function () {
- layout.one('layoutstop', options.stop);
- layout.emit({
- type: 'layoutstop',
- layout: layout
- });
- });
- } else {
- nodes.positions(getFinalPos);
- if (options.fit) {
- cy.fit(options.eles, options.padding);
- }
- if (options.zoom != null) {
- cy.zoom(options.zoom);
- }
- if (options.pan) {
- cy.pan(options.pan);
- }
- layout.one('layoutready', options.ready);
- layout.emit({
- type: 'layoutready',
- layout: layout
- });
- layout.one('layoutstop', options.stop);
- layout.emit({
- type: 'layoutstop',
- layout: layout
- });
- }
- return this; // chaining
- },
+PointD.prototype.getCopy = function () {
+ return new PointD(this.x, this.y);
+};
- layout: function layout(options) {
- var cy = this.cy();
- return cy.makeLayout(extend({}, options, {
- eles: this
- }));
- }
+PointD.prototype.translate = function (dim) {
+ this.x += dim.width;
+ this.y += dim.height;
+ return this;
};
-// aliases:
-elesfn$5.createLayout = elesfn$5.makeLayout = elesfn$5.layout;
+module.exports = PointD;
-function styleCache(key, fn, ele) {
- var _p = ele._private;
- var cache = _p.styleCache = _p.styleCache || [];
- var val;
- if ((val = cache[key]) != null) {
- return val;
- } else {
- val = cache[key] = fn(ele);
- return val;
+/***/ }),
+/* 6 */
+/***/ (function(module, exports, __nested_webpack_require_19670__) {
+
+"use strict";
+
+
+var LGraphObject = __nested_webpack_require_19670__(2);
+var Integer = __nested_webpack_require_19670__(10);
+var LayoutConstants = __nested_webpack_require_19670__(0);
+var LGraphManager = __nested_webpack_require_19670__(7);
+var LNode = __nested_webpack_require_19670__(3);
+var LEdge = __nested_webpack_require_19670__(1);
+var RectangleD = __nested_webpack_require_19670__(13);
+var Point = __nested_webpack_require_19670__(12);
+var LinkedList = __nested_webpack_require_19670__(11);
+
+function LGraph(parent, obj2, vGraph) {
+ LGraphObject.call(this, vGraph);
+ this.estimatedSize = Integer.MIN_VALUE;
+ this.margin = LayoutConstants.DEFAULT_GRAPH_MARGIN;
+ this.edges = [];
+ this.nodes = [];
+ this.isConnected = false;
+ this.parent = parent;
+
+ if (obj2 != null && obj2 instanceof LGraphManager) {
+ this.graphManager = obj2;
+ } else if (obj2 != null && obj2 instanceof Layout) {
+ this.graphManager = obj2.graphManager;
}
}
-function cacheStyleFunction(key, fn) {
- key = hashString(key);
- return function cachedStyleFunction(ele) {
- return styleCache(key, fn, ele);
- };
-}
-function cachePrototypeStyleFunction(key, fn) {
- key = hashString(key);
- var selfFn = function selfFn(ele) {
- return fn.call(ele);
- };
- return function cachedPrototypeStyleFunction() {
- var ele = this[0];
- if (ele) {
- return styleCache(key, selfFn, ele);
- }
- };
+
+LGraph.prototype = Object.create(LGraphObject.prototype);
+for (var prop in LGraphObject) {
+ LGraph[prop] = LGraphObject[prop];
}
-var elesfn$4 = {
- recalculateRenderedStyle: function recalculateRenderedStyle(useCache) {
- var cy = this.cy();
- var renderer = cy.renderer();
- var styleEnabled = cy.styleEnabled();
- if (renderer && styleEnabled) {
- renderer.recalculateRenderedStyle(this, useCache);
+
+LGraph.prototype.getNodes = function () {
+ return this.nodes;
+};
+
+LGraph.prototype.getEdges = function () {
+ return this.edges;
+};
+
+LGraph.prototype.getGraphManager = function () {
+ return this.graphManager;
+};
+
+LGraph.prototype.getParent = function () {
+ return this.parent;
+};
+
+LGraph.prototype.getLeft = function () {
+ return this.left;
+};
+
+LGraph.prototype.getRight = function () {
+ return this.right;
+};
+
+LGraph.prototype.getTop = function () {
+ return this.top;
+};
+
+LGraph.prototype.getBottom = function () {
+ return this.bottom;
+};
+
+LGraph.prototype.isConnected = function () {
+ return this.isConnected;
+};
+
+LGraph.prototype.add = function (obj1, sourceNode, targetNode) {
+ if (sourceNode == null && targetNode == null) {
+ var newNode = obj1;
+ if (this.graphManager == null) {
+ throw "Graph has no graph mgr!";
}
- return this;
- },
- dirtyStyleCache: function dirtyStyleCache() {
- var cy = this.cy();
- var dirty = function dirty(ele) {
- return ele._private.styleCache = null;
- };
- if (cy.hasCompoundNodes()) {
- var eles;
- eles = this.spawnSelf().merge(this.descendants()).merge(this.parents());
- eles.merge(eles.connectedEdges());
- eles.forEach(dirty);
- } else {
- this.forEach(function (ele) {
- dirty(ele);
- ele.connectedEdges().forEach(dirty);
- });
+ if (this.getNodes().indexOf(newNode) > -1) {
+ throw "Node already in graph!";
}
- return this;
- },
- // fully updates (recalculates) the style for the elements
- updateStyle: function updateStyle(notifyRenderer) {
- var cy = this._private.cy;
- if (!cy.styleEnabled()) {
- return this;
+ newNode.owner = this;
+ this.getNodes().push(newNode);
+
+ return newNode;
+ } else {
+ var newEdge = obj1;
+ if (!(this.getNodes().indexOf(sourceNode) > -1 && this.getNodes().indexOf(targetNode) > -1)) {
+ throw "Source or target not in graph!";
}
- if (cy.batching()) {
- var bEles = cy._private.batchStyleEles;
- bEles.merge(this);
- return this; // chaining and exit early when batching
+
+ if (!(sourceNode.owner == targetNode.owner && sourceNode.owner == this)) {
+ throw "Both owners must be this graph!";
}
- var hasCompounds = cy.hasCompoundNodes();
- var updatedEles = this;
- notifyRenderer = notifyRenderer || notifyRenderer === undefined ? true : false;
- if (hasCompounds) {
- // then add everything up and down for compound selector checks
- updatedEles = this.spawnSelf().merge(this.descendants()).merge(this.parents());
+ if (sourceNode.owner != targetNode.owner) {
+ return null;
}
- // let changedEles = style.apply( updatedEles );
- var changedEles = updatedEles;
- if (notifyRenderer) {
- changedEles.emitAndNotify('style'); // let renderer know we changed style
- } else {
- changedEles.emit('style'); // just fire the event
+ // set source and target
+ newEdge.source = sourceNode;
+ newEdge.target = targetNode;
+
+ // set as intra-graph edge
+ newEdge.isInterGraph = false;
+
+ // add to graph edge list
+ this.getEdges().push(newEdge);
+
+ // add to incidency lists
+ sourceNode.edges.push(newEdge);
+
+ if (targetNode != sourceNode) {
+ targetNode.edges.push(newEdge);
}
- updatedEles.forEach(function (ele) {
- return ele._private.styleDirty = true;
- });
- return this; // chaining
- },
+ return newEdge;
+ }
+};
- // private: clears dirty flag and recalculates style
- cleanStyle: function cleanStyle() {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return;
+LGraph.prototype.remove = function (obj) {
+ var node = obj;
+ if (obj instanceof LNode) {
+ if (node == null) {
+ throw "Node is null!";
}
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- if (ele._private.styleDirty) {
- // n.b. this flag should be set before apply() to avoid potential infinite recursion
- ele._private.styleDirty = false;
- cy.style().apply(ele);
- }
+ if (!(node.owner != null && node.owner == this)) {
+ throw "Owner graph is invalid!";
}
- },
- // get the internal parsed style object for the specified property
- parsedStyle: function parsedStyle(property) {
- var includeNonDefault = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- var ele = this[0];
- var cy = ele.cy();
- if (!cy.styleEnabled()) {
- return;
+ if (this.graphManager == null) {
+ throw "Owner graph manager is invalid!";
}
- if (ele) {
- this.cleanStyle();
- var overriddenStyle = ele._private.style[property];
- if (overriddenStyle != null) {
- return overriddenStyle;
- } else if (includeNonDefault) {
- return cy.style().getDefaultProperty(property);
+ // remove incident edges first (make a copy to do it safely)
+ var edgesToBeRemoved = node.edges.slice();
+ var edge;
+ var s = edgesToBeRemoved.length;
+ for (var i = 0; i < s; i++) {
+ edge = edgesToBeRemoved[i];
+
+ if (edge.isInterGraph) {
+ this.graphManager.remove(edge);
} else {
- return null;
+ edge.source.owner.remove(edge);
}
}
- },
- numericStyle: function numericStyle(property) {
- var ele = this[0];
- if (!ele.cy().styleEnabled()) {
- return;
- }
- if (ele) {
- var pstyle = ele.pstyle(property);
- return pstyle.pfValue !== undefined ? pstyle.pfValue : pstyle.value;
+
+ // now the node itself
+ var index = this.nodes.indexOf(node);
+ if (index == -1) {
+ throw "Node not in owner node list!";
}
- },
- numericStyleUnits: function numericStyleUnits(property) {
- var ele = this[0];
- if (!ele.cy().styleEnabled()) {
- return;
+
+ this.nodes.splice(index, 1);
+ } else if (obj instanceof LEdge) {
+ var edge = obj;
+ if (edge == null) {
+ throw "Edge is null!";
}
- if (ele) {
- return ele.pstyle(property).units;
+ if (!(edge.source != null && edge.target != null)) {
+ throw "Source and/or target is null!";
}
- },
- // get the specified css property as a rendered value (i.e. on-screen value)
- // or get the whole rendered style if no property specified (NB doesn't allow setting)
- renderedStyle: function renderedStyle(property) {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return this;
+ if (!(edge.source.owner != null && edge.target.owner != null && edge.source.owner == this && edge.target.owner == this)) {
+ throw "Source and/or target owner is invalid!";
}
- var ele = this[0];
- if (ele) {
- return cy.style().getRenderedStyle(ele, property);
+
+ var sourceIndex = edge.source.edges.indexOf(edge);
+ var targetIndex = edge.target.edges.indexOf(edge);
+ if (!(sourceIndex > -1 && targetIndex > -1)) {
+ throw "Source and/or target doesn't know this edge!";
}
- },
- // read the calculated css style of the element or override the style (via a bypass)
- style: function style(name, value) {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return this;
+
+ edge.source.edges.splice(sourceIndex, 1);
+
+ if (edge.target != edge.source) {
+ edge.target.edges.splice(targetIndex, 1);
}
- var updateTransitions = false;
- var style = cy.style();
- if (plainObject(name)) {
- // then extend the bypass
- var props = name;
- style.applyBypass(this, props, updateTransitions);
- this.emitAndNotify('style'); // let the renderer know we've updated style
- } else if (string(name)) {
- if (value === undefined) {
- // then get the property from the style
- var ele = this[0];
- if (ele) {
- return style.getStylePropertyValue(ele, name);
- } else {
- // empty collection => can't get any value
- return;
- }
- } else {
- // then set the bypass with the property value
- style.applyBypass(this, name, value, updateTransitions);
- this.emitAndNotify('style'); // let the renderer know we've updated style
- }
- } else if (name === undefined) {
- var _ele = this[0];
- if (_ele) {
- return style.getRawStyle(_ele);
- } else {
- // empty collection => can't get any value
- return;
- }
+
+ var index = edge.source.owner.getEdges().indexOf(edge);
+ if (index == -1) {
+ throw "Not in owner's edge list!";
}
- return this; // chaining
- },
- removeStyle: function removeStyle(names) {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return this;
+ edge.source.owner.getEdges().splice(index, 1);
+ }
+};
+
+LGraph.prototype.updateLeftTop = function () {
+ var top = Integer.MAX_VALUE;
+ var left = Integer.MAX_VALUE;
+ var nodeTop;
+ var nodeLeft;
+ var margin;
+
+ var nodes = this.getNodes();
+ var s = nodes.length;
+
+ for (var i = 0; i < s; i++) {
+ var lNode = nodes[i];
+ nodeTop = lNode.getTop();
+ nodeLeft = lNode.getLeft();
+
+ if (top > nodeTop) {
+ top = nodeTop;
}
- var updateTransitions = false;
- var style = cy.style();
- var eles = this;
- if (names === undefined) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- style.removeAllBypasses(ele, updateTransitions);
- }
- } else {
- names = names.split(/\s+/);
- for (var _i = 0; _i < eles.length; _i++) {
- var _ele2 = eles[_i];
- style.removeBypasses(_ele2, names, updateTransitions);
- }
+
+ if (left > nodeLeft) {
+ left = nodeLeft;
}
- this.emitAndNotify('style'); // let the renderer know we've updated style
+ }
- return this; // chaining
- },
+ // Do we have any nodes in this graph?
+ if (top == Integer.MAX_VALUE) {
+ return null;
+ }
- show: function show() {
- this.css('display', 'element');
- return this; // chaining
- },
+ if (nodes[0].getParent().paddingLeft != undefined) {
+ margin = nodes[0].getParent().paddingLeft;
+ } else {
+ margin = this.margin;
+ }
- hide: function hide() {
- this.css('display', 'none');
- return this; // chaining
- },
+ this.left = left - margin;
+ this.top = top - margin;
- effectiveOpacity: function effectiveOpacity() {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return 1;
+ // Apply the margins and return the result
+ return new Point(this.left, this.top);
+};
+
+LGraph.prototype.updateBounds = function (recursive) {
+ // calculate bounds
+ var left = Integer.MAX_VALUE;
+ var right = -Integer.MAX_VALUE;
+ var top = Integer.MAX_VALUE;
+ var bottom = -Integer.MAX_VALUE;
+ var nodeLeft;
+ var nodeRight;
+ var nodeTop;
+ var nodeBottom;
+ var margin;
+
+ var nodes = this.nodes;
+ var s = nodes.length;
+ for (var i = 0; i < s; i++) {
+ var lNode = nodes[i];
+
+ if (recursive && lNode.child != null) {
+ lNode.updateBounds();
}
- var hasCompoundNodes = cy.hasCompoundNodes();
- var ele = this[0];
- if (ele) {
- var _p = ele._private;
- var parentOpacity = ele.pstyle('opacity').value;
- if (!hasCompoundNodes) {
- return parentOpacity;
- }
- var parents = !_p.data.parent ? null : ele.parents();
- if (parents) {
- for (var i = 0; i < parents.length; i++) {
- var parent = parents[i];
- var opacity = parent.pstyle('opacity').value;
- parentOpacity = opacity * parentOpacity;
- }
- }
- return parentOpacity;
+ nodeLeft = lNode.getLeft();
+ nodeRight = lNode.getRight();
+ nodeTop = lNode.getTop();
+ nodeBottom = lNode.getBottom();
+
+ if (left > nodeLeft) {
+ left = nodeLeft;
}
- },
- transparent: function transparent() {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return false;
+
+ if (right < nodeRight) {
+ right = nodeRight;
}
- var ele = this[0];
- var hasCompoundNodes = ele.cy().hasCompoundNodes();
- if (ele) {
- if (!hasCompoundNodes) {
- return ele.pstyle('opacity').value === 0;
- } else {
- return ele.effectiveOpacity() === 0;
- }
+
+ if (top > nodeTop) {
+ top = nodeTop;
}
- },
- backgrounding: function backgrounding() {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return false;
+
+ if (bottom < nodeBottom) {
+ bottom = nodeBottom;
}
- var ele = this[0];
- return ele._private.backgrounding ? true : false;
}
+
+ var boundingRect = new RectangleD(left, top, right - left, bottom - top);
+ if (left == Integer.MAX_VALUE) {
+ this.left = this.parent.getLeft();
+ this.right = this.parent.getRight();
+ this.top = this.parent.getTop();
+ this.bottom = this.parent.getBottom();
+ }
+
+ if (nodes[0].getParent().paddingLeft != undefined) {
+ margin = nodes[0].getParent().paddingLeft;
+ } else {
+ margin = this.margin;
+ }
+
+ this.left = boundingRect.x - margin;
+ this.right = boundingRect.x + boundingRect.width + margin;
+ this.top = boundingRect.y - margin;
+ this.bottom = boundingRect.y + boundingRect.height + margin;
};
-function checkCompound(ele, parentOk) {
- var _p = ele._private;
- var parents = _p.data.parent ? ele.parents() : null;
- if (parents) {
- for (var i = 0; i < parents.length; i++) {
- var parent = parents[i];
- if (!parentOk(parent)) {
- return false;
- }
+
+LGraph.calculateBounds = function (nodes) {
+ var left = Integer.MAX_VALUE;
+ var right = -Integer.MAX_VALUE;
+ var top = Integer.MAX_VALUE;
+ var bottom = -Integer.MAX_VALUE;
+ var nodeLeft;
+ var nodeRight;
+ var nodeTop;
+ var nodeBottom;
+
+ var s = nodes.length;
+
+ for (var i = 0; i < s; i++) {
+ var lNode = nodes[i];
+ nodeLeft = lNode.getLeft();
+ nodeRight = lNode.getRight();
+ nodeTop = lNode.getTop();
+ nodeBottom = lNode.getBottom();
+
+ if (left > nodeLeft) {
+ left = nodeLeft;
}
- }
- return true;
-}
-function defineDerivedStateFunction(specs) {
- var ok = specs.ok;
- var edgeOkViaNode = specs.edgeOkViaNode || specs.ok;
- var parentOk = specs.parentOk || specs.ok;
- return function () {
- var cy = this.cy();
- if (!cy.styleEnabled()) {
- return true;
+
+ if (right < nodeRight) {
+ right = nodeRight;
}
- var ele = this[0];
- var hasCompoundNodes = cy.hasCompoundNodes();
- if (ele) {
- var _p = ele._private;
- if (!ok(ele)) {
- return false;
- }
- if (ele.isNode()) {
- return !hasCompoundNodes || checkCompound(ele, parentOk);
- } else {
- var src = _p.source;
- var tgt = _p.target;
- return edgeOkViaNode(src) && (!hasCompoundNodes || checkCompound(src, edgeOkViaNode)) && (src === tgt || edgeOkViaNode(tgt) && (!hasCompoundNodes || checkCompound(tgt, edgeOkViaNode)));
- }
+
+ if (top > nodeTop) {
+ top = nodeTop;
+ }
+
+ if (bottom < nodeBottom) {
+ bottom = nodeBottom;
}
- };
-}
-var eleTakesUpSpace = cacheStyleFunction('eleTakesUpSpace', function (ele) {
- return ele.pstyle('display').value === 'element' && ele.width() !== 0 && (ele.isNode() ? ele.height() !== 0 : true);
-});
-elesfn$4.takesUpSpace = cachePrototypeStyleFunction('takesUpSpace', defineDerivedStateFunction({
- ok: eleTakesUpSpace
-}));
-var eleInteractive = cacheStyleFunction('eleInteractive', function (ele) {
- return ele.pstyle('events').value === 'yes' && ele.pstyle('visibility').value === 'visible' && eleTakesUpSpace(ele);
-});
-var parentInteractive = cacheStyleFunction('parentInteractive', function (parent) {
- return parent.pstyle('visibility').value === 'visible' && eleTakesUpSpace(parent);
-});
-elesfn$4.interactive = cachePrototypeStyleFunction('interactive', defineDerivedStateFunction({
- ok: eleInteractive,
- parentOk: parentInteractive,
- edgeOkViaNode: eleTakesUpSpace
-}));
-elesfn$4.noninteractive = function () {
- var ele = this[0];
- if (ele) {
- return !ele.interactive();
}
+
+ var boundingRect = new RectangleD(left, top, right - left, bottom - top);
+
+ return boundingRect;
};
-var eleVisible = cacheStyleFunction('eleVisible', function (ele) {
- return ele.pstyle('visibility').value === 'visible' && ele.pstyle('opacity').pfValue !== 0 && eleTakesUpSpace(ele);
-});
-var edgeVisibleViaNode = eleTakesUpSpace;
-elesfn$4.visible = cachePrototypeStyleFunction('visible', defineDerivedStateFunction({
- ok: eleVisible,
- edgeOkViaNode: edgeVisibleViaNode
-}));
-elesfn$4.hidden = function () {
- var ele = this[0];
- if (ele) {
- return !ele.visible();
+
+LGraph.prototype.getInclusionTreeDepth = function () {
+ if (this == this.graphManager.getRoot()) {
+ return 1;
+ } else {
+ return this.parent.getInclusionTreeDepth();
}
};
-elesfn$4.isBundledBezier = cachePrototypeStyleFunction('isBundledBezier', function () {
- if (!this.cy().styleEnabled()) {
- return false;
+
+LGraph.prototype.getEstimatedSize = function () {
+ if (this.estimatedSize == Integer.MIN_VALUE) {
+ throw "assert failed";
}
- return !this.removed() && this.pstyle('curve-style').value === 'bezier' && this.takesUpSpace();
-});
-elesfn$4.bypass = elesfn$4.css = elesfn$4.style;
-elesfn$4.renderedCss = elesfn$4.renderedStyle;
-elesfn$4.removeBypass = elesfn$4.removeCss = elesfn$4.removeStyle;
-elesfn$4.pstyle = elesfn$4.parsedStyle;
+ return this.estimatedSize;
+};
-var elesfn$3 = {};
-function defineSwitchFunction(params) {
- return function () {
- var args = arguments;
- var changedEles = [];
+LGraph.prototype.calcEstimatedSize = function () {
+ var size = 0;
+ var nodes = this.nodes;
+ var s = nodes.length;
- // e.g. cy.nodes().select( data, handler )
- if (args.length === 2) {
- var data = args[0];
- var handler = args[1];
- this.on(params.event, data, handler);
- }
+ for (var i = 0; i < s; i++) {
+ var lNode = nodes[i];
+ size += lNode.calcEstimatedSize();
+ }
- // e.g. cy.nodes().select( handler )
- else if (args.length === 1 && fn$6(args[0])) {
- var _handler = args[0];
- this.on(params.event, _handler);
- }
+ if (size == 0) {
+ this.estimatedSize = LayoutConstants.EMPTY_COMPOUND_NODE_SIZE;
+ } else {
+ this.estimatedSize = size / Math.sqrt(this.nodes.length);
+ }
- // e.g. cy.nodes().select()
- // e.g. (private) cy.nodes().select(['tapselect'])
- else if (args.length === 0 || args.length === 1 && array(args[0])) {
- var addlEvents = args.length === 1 ? args[0] : null;
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var able = !params.ableField || ele._private[params.ableField];
- var changed = ele._private[params.field] != params.value;
- if (params.overrideAble) {
- var overrideAble = params.overrideAble(ele);
- if (overrideAble !== undefined) {
- able = overrideAble;
- if (!overrideAble) {
- return this;
- } // to save cycles assume not able for all on override
- }
- }
+ return this.estimatedSize;
+};
- if (able) {
- ele._private[params.field] = params.value;
- if (changed) {
- changedEles.push(ele);
- }
- }
- }
- var changedColl = this.spawn(changedEles);
- changedColl.updateStyle(); // change of state => possible change of style
- changedColl.emit(params.event);
- if (addlEvents) {
- changedColl.emit(addlEvents);
+LGraph.prototype.updateConnected = function () {
+ var self = this;
+ if (this.nodes.length == 0) {
+ this.isConnected = true;
+ return;
+ }
+
+ var queue = new LinkedList();
+ var visited = new Set();
+ var currentNode = this.nodes[0];
+ var neighborEdges;
+ var currentNeighbor;
+ var childrenOfNode = currentNode.withChildren();
+ childrenOfNode.forEach(function (node) {
+ queue.push(node);
+ visited.add(node);
+ });
+
+ while (queue.length !== 0) {
+ currentNode = queue.shift();
+
+ // Traverse all neighbors of this node
+ neighborEdges = currentNode.getEdges();
+ var size = neighborEdges.length;
+ for (var i = 0; i < size; i++) {
+ var neighborEdge = neighborEdges[i];
+ currentNeighbor = neighborEdge.getOtherEndInGraph(currentNode, this);
+
+ // Add unvisited neighbors to the list to visit
+ if (currentNeighbor != null && !visited.has(currentNeighbor)) {
+ var childrenOfNeighbor = currentNeighbor.withChildren();
+
+ childrenOfNeighbor.forEach(function (node) {
+ queue.push(node);
+ visited.add(node);
+ });
}
}
- return this;
- };
-}
-function defineSwitchSet(params) {
- elesfn$3[params.field] = function () {
- var ele = this[0];
- if (ele) {
- if (params.overrideField) {
- var val = params.overrideField(ele);
- if (val !== undefined) {
- return val;
- }
- }
- return ele._private[params.field];
- }
- };
- elesfn$3[params.on] = defineSwitchFunction({
- event: params.on,
- field: params.field,
- ableField: params.ableField,
- overrideAble: params.overrideAble,
- value: true
- });
- elesfn$3[params.off] = defineSwitchFunction({
- event: params.off,
- field: params.field,
- ableField: params.ableField,
- overrideAble: params.overrideAble,
- value: false
- });
-}
-defineSwitchSet({
- field: 'locked',
- overrideField: function overrideField(ele) {
- return ele.cy().autolock() ? true : undefined;
- },
- on: 'lock',
- off: 'unlock'
-});
-defineSwitchSet({
- field: 'grabbable',
- overrideField: function overrideField(ele) {
- return ele.cy().autoungrabify() || ele.pannable() ? false : undefined;
- },
- on: 'grabify',
- off: 'ungrabify'
-});
-defineSwitchSet({
- field: 'selected',
- ableField: 'selectable',
- overrideAble: function overrideAble(ele) {
- return ele.cy().autounselectify() ? false : undefined;
- },
- on: 'select',
- off: 'unselect'
-});
-defineSwitchSet({
- field: 'selectable',
- overrideField: function overrideField(ele) {
- return ele.cy().autounselectify() ? false : undefined;
- },
- on: 'selectify',
- off: 'unselectify'
-});
-elesfn$3.deselect = elesfn$3.unselect;
-elesfn$3.grabbed = function () {
- var ele = this[0];
- if (ele) {
- return ele._private.grabbed;
- }
-};
-defineSwitchSet({
- field: 'active',
- on: 'activate',
- off: 'unactivate'
-});
-defineSwitchSet({
- field: 'pannable',
- on: 'panify',
- off: 'unpanify'
-});
-elesfn$3.inactive = function () {
- var ele = this[0];
- if (ele) {
- return !ele._private.active;
}
-};
-
-var elesfn$2 = {};
-// DAG functions
-////////////////
+ this.isConnected = false;
-var defineDagExtremity = function defineDagExtremity(params) {
- return function dagExtremityImpl(selector) {
- var eles = this;
- var ret = [];
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- if (!ele.isNode()) {
- continue;
- }
- var disqualified = false;
- var edges = ele.connectedEdges();
- for (var j = 0; j < edges.length; j++) {
- var edge = edges[j];
- var src = edge.source();
- var tgt = edge.target();
- if (params.noIncomingEdges && tgt === ele && src !== ele || params.noOutgoingEdges && src === ele && tgt !== ele) {
- disqualified = true;
- break;
- }
- }
- if (!disqualified) {
- ret.push(ele);
- }
- }
- return this.spawn(ret, true).filter(selector);
- };
-};
-var defineDagOneHop = function defineDagOneHop(params) {
- return function (selector) {
- var eles = this;
- var oEles = [];
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- if (!ele.isNode()) {
- continue;
- }
- var edges = ele.connectedEdges();
- for (var j = 0; j < edges.length; j++) {
- var edge = edges[j];
- var src = edge.source();
- var tgt = edge.target();
- if (params.outgoing && src === ele) {
- oEles.push(edge);
- oEles.push(tgt);
- } else if (params.incoming && tgt === ele) {
- oEles.push(edge);
- oEles.push(src);
- }
- }
- }
- return this.spawn(oEles, true).filter(selector);
- };
-};
-var defineDagAllHops = function defineDagAllHops(params) {
- return function (selector) {
- var eles = this;
- var sEles = [];
- var sElesIds = {};
- for (;;) {
- var next = params.outgoing ? eles.outgoers() : eles.incomers();
- if (next.length === 0) {
- break;
- } // done if none left
+ if (visited.size >= this.nodes.length) {
+ var noOfVisitedInThisGraph = 0;
- var newNext = false;
- for (var i = 0; i < next.length; i++) {
- var n = next[i];
- var nid = n.id();
- if (!sElesIds[nid]) {
- sElesIds[nid] = true;
- sEles.push(n);
- newNext = true;
- }
+ visited.forEach(function (visitedNode) {
+ if (visitedNode.owner == self) {
+ noOfVisitedInThisGraph++;
}
- if (!newNext) {
- break;
- } // done if touched all outgoers already
+ });
- eles = next;
+ if (noOfVisitedInThisGraph == this.nodes.length) {
+ this.isConnected = true;
}
- return this.spawn(sEles, true).filter(selector);
- };
-};
-elesfn$2.clearTraversalCache = function () {
- for (var i = 0; i < this.length; i++) {
- this[i]._private.traversalCache = null;
}
};
-extend(elesfn$2, {
- // get the root nodes in the DAG
- roots: defineDagExtremity({
- noIncomingEdges: true
- }),
- // get the leaf nodes in the DAG
- leaves: defineDagExtremity({
- noOutgoingEdges: true
- }),
- // normally called children in graph theory
- // these nodes =edges=> outgoing nodes
- outgoers: cache(defineDagOneHop({
- outgoing: true
- }), 'outgoers'),
- // aka DAG descendants
- successors: defineDagAllHops({
- outgoing: true
- }),
- // normally called parents in graph theory
- // these nodes <=edges= incoming nodes
- incomers: cache(defineDagOneHop({
- incoming: true
- }), 'incomers'),
- // aka DAG ancestors
- predecessors: defineDagAllHops({
- incoming: true
- })
-});
-// Neighbourhood functions
-//////////////////////////
+module.exports = LGraph;
-extend(elesfn$2, {
- neighborhood: cache(function (selector) {
- var elements = [];
- var nodes = this.nodes();
- for (var i = 0; i < nodes.length; i++) {
- // for all nodes
- var node = nodes[i];
- var connectedEdges = node.connectedEdges();
+/***/ }),
+/* 7 */
+/***/ (function(module, exports, __nested_webpack_require_29738__) {
- // for each connected edge, add the edge and the other node
- for (var j = 0; j < connectedEdges.length; j++) {
- var edge = connectedEdges[j];
- var src = edge.source();
- var tgt = edge.target();
- var otherNode = node === src ? tgt : src;
+"use strict";
- // need check in case of loop
- if (otherNode.length > 0) {
- elements.push(otherNode[0]); // add node 1 hop away
- }
- // add connected edge
- elements.push(edge[0]);
- }
- }
- return this.spawn(elements, true).filter(selector);
- }, 'neighborhood'),
- closedNeighborhood: function closedNeighborhood(selector) {
- return this.neighborhood().add(this).filter(selector);
- },
- openNeighborhood: function openNeighborhood(selector) {
- return this.neighborhood(selector);
- }
-});
+var LGraph;
+var LEdge = __nested_webpack_require_29738__(1);
-// aliases
-elesfn$2.neighbourhood = elesfn$2.neighborhood;
-elesfn$2.closedNeighbourhood = elesfn$2.closedNeighborhood;
-elesfn$2.openNeighbourhood = elesfn$2.openNeighborhood;
+function LGraphManager(layout) {
+ LGraph = __nested_webpack_require_29738__(6); // It may be better to initilize this out of this function but it gives an error (Right-hand side of 'instanceof' is not callable) now.
+ this.layout = layout;
-// Edge functions
-/////////////////
+ this.graphs = [];
+ this.edges = [];
+}
-extend(elesfn$2, {
- source: cache(function sourceImpl(selector) {
- var ele = this[0];
- var src;
- if (ele) {
- src = ele._private.source || ele.cy().collection();
+LGraphManager.prototype.addRoot = function () {
+ var ngraph = this.layout.newGraph();
+ var nnode = this.layout.newNode(null);
+ var root = this.add(ngraph, nnode);
+ this.setRootGraph(root);
+ return this.rootGraph;
+};
+
+LGraphManager.prototype.add = function (newGraph, parentNode, newEdge, sourceNode, targetNode) {
+ //there are just 2 parameters are passed then it adds an LGraph else it adds an LEdge
+ if (newEdge == null && sourceNode == null && targetNode == null) {
+ if (newGraph == null) {
+ throw "Graph is null!";
}
- return src && selector ? src.filter(selector) : src;
- }, 'source'),
- target: cache(function targetImpl(selector) {
- var ele = this[0];
- var tgt;
- if (ele) {
- tgt = ele._private.target || ele.cy().collection();
+ if (parentNode == null) {
+ throw "Parent node is null!";
}
- return tgt && selector ? tgt.filter(selector) : tgt;
- }, 'target'),
- sources: defineSourceFunction({
- attr: 'source'
- }),
- targets: defineSourceFunction({
- attr: 'target'
- })
-});
-function defineSourceFunction(params) {
- return function sourceImpl(selector) {
- var sources = [];
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var src = ele._private[params.attr];
- if (src) {
- sources.push(src);
- }
+ if (this.graphs.indexOf(newGraph) > -1) {
+ throw "Graph already in this graph mgr!";
}
- return this.spawn(sources, true).filter(selector);
- };
-}
-extend(elesfn$2, {
- edgesWith: cache(defineEdgesWithFunction(), 'edgesWith'),
- edgesTo: cache(defineEdgesWithFunction({
- thisIsSrc: true
- }), 'edgesTo')
-});
-function defineEdgesWithFunction(params) {
- return function edgesWithImpl(otherNodes) {
- var elements = [];
- var cy = this._private.cy;
- var p = params || {};
- // get elements if a selector is specified
- if (string(otherNodes)) {
- otherNodes = cy.$(otherNodes);
+ this.graphs.push(newGraph);
+
+ if (newGraph.parent != null) {
+ throw "Already has a parent!";
}
- for (var h = 0; h < otherNodes.length; h++) {
- var edges = otherNodes[h]._private.edges;
- for (var i = 0; i < edges.length; i++) {
- var edge = edges[i];
- var edgeData = edge._private.data;
- var thisToOther = this.hasElementWithId(edgeData.source) && otherNodes.hasElementWithId(edgeData.target);
- var otherToThis = otherNodes.hasElementWithId(edgeData.source) && this.hasElementWithId(edgeData.target);
- var edgeConnectsThisAndOther = thisToOther || otherToThis;
- if (!edgeConnectsThisAndOther) {
- continue;
- }
- if (p.thisIsSrc || p.thisIsTgt) {
- if (p.thisIsSrc && !thisToOther) {
- continue;
- }
- if (p.thisIsTgt && !otherToThis) {
- continue;
- }
- }
- elements.push(edge);
- }
+ if (parentNode.child != null) {
+ throw "Already has a child!";
}
- return this.spawn(elements, true);
- };
-}
-extend(elesfn$2, {
- connectedEdges: cache(function (selector) {
- var retEles = [];
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var node = eles[i];
- if (!node.isNode()) {
- continue;
+
+ newGraph.parent = parentNode;
+ parentNode.child = newGraph;
+
+ return newGraph;
+ } else {
+ //change the order of the parameters
+ targetNode = newEdge;
+ sourceNode = parentNode;
+ newEdge = newGraph;
+ var sourceGraph = sourceNode.getOwner();
+ var targetGraph = targetNode.getOwner();
+
+ if (!(sourceGraph != null && sourceGraph.getGraphManager() == this)) {
+ throw "Source not in this graph mgr!";
+ }
+ if (!(targetGraph != null && targetGraph.getGraphManager() == this)) {
+ throw "Target not in this graph mgr!";
+ }
+
+ if (sourceGraph == targetGraph) {
+ newEdge.isInterGraph = false;
+ return sourceGraph.add(newEdge, sourceNode, targetNode);
+ } else {
+ newEdge.isInterGraph = true;
+
+ // set source and target
+ newEdge.source = sourceNode;
+ newEdge.target = targetNode;
+
+ // add edge to inter-graph edge list
+ if (this.edges.indexOf(newEdge) > -1) {
+ throw "Edge already in inter-graph edge list!";
}
- var edges = node._private.edges;
- for (var j = 0; j < edges.length; j++) {
- var edge = edges[j];
- retEles.push(edge);
+
+ this.edges.push(newEdge);
+
+ // add edge to source and target incidency lists
+ if (!(newEdge.source != null && newEdge.target != null)) {
+ throw "Edge source and/or target is null!";
}
- }
- return this.spawn(retEles, true).filter(selector);
- }, 'connectedEdges'),
- connectedNodes: cache(function (selector) {
- var retEles = [];
- var eles = this;
- for (var i = 0; i < eles.length; i++) {
- var edge = eles[i];
- if (!edge.isEdge()) {
- continue;
+
+ if (!(newEdge.source.edges.indexOf(newEdge) == -1 && newEdge.target.edges.indexOf(newEdge) == -1)) {
+ throw "Edge already in source and/or target incidency list!";
}
- retEles.push(edge.source()[0]);
- retEles.push(edge.target()[0]);
+
+ newEdge.source.edges.push(newEdge);
+ newEdge.target.edges.push(newEdge);
+
+ return newEdge;
}
- return this.spawn(retEles, true).filter(selector);
- }, 'connectedNodes'),
- parallelEdges: cache(defineParallelEdgesFunction(), 'parallelEdges'),
- codirectedEdges: cache(defineParallelEdgesFunction({
- codirected: true
- }), 'codirectedEdges')
-});
-function defineParallelEdgesFunction(params) {
- var defaults = {
- codirected: false
- };
- params = extend({}, defaults, params);
- return function parallelEdgesImpl(selector) {
- // micro-optimised for renderer
- var elements = [];
- var edges = this.edges();
- var p = params;
+ }
+};
- // look at all the edges in the collection
- for (var i = 0; i < edges.length; i++) {
- var edge1 = edges[i];
- var edge1_p = edge1._private;
- var src1 = edge1_p.source;
- var srcid1 = src1._private.data.id;
- var tgtid1 = edge1_p.data.target;
- var srcEdges1 = src1._private.edges;
+LGraphManager.prototype.remove = function (lObj) {
+ if (lObj instanceof LGraph) {
+ var graph = lObj;
+ if (graph.getGraphManager() != this) {
+ throw "Graph not in this graph mgr";
+ }
+ if (!(graph == this.rootGraph || graph.parent != null && graph.parent.graphManager == this)) {
+ throw "Invalid parent node!";
+ }
- // look at edges connected to the src node of this edge
- for (var j = 0; j < srcEdges1.length; j++) {
- var edge2 = srcEdges1[j];
- var edge2data = edge2._private.data;
- var tgtid2 = edge2data.target;
- var srcid2 = edge2data.source;
- var codirected = tgtid2 === tgtid1 && srcid2 === srcid1;
- var oppdirected = srcid1 === tgtid2 && tgtid1 === srcid2;
- if (p.codirected && codirected || !p.codirected && (codirected || oppdirected)) {
- elements.push(edge2);
- }
- }
+ // first the edges (make a copy to do it safely)
+ var edgesToBeRemoved = [];
+
+ edgesToBeRemoved = edgesToBeRemoved.concat(graph.getEdges());
+
+ var edge;
+ var s = edgesToBeRemoved.length;
+ for (var i = 0; i < s; i++) {
+ edge = edgesToBeRemoved[i];
+ graph.remove(edge);
}
- return this.spawn(elements, true).filter(selector);
- };
-}
-// Misc functions
-/////////////////
+ // then the nodes (make a copy to do it safely)
+ var nodesToBeRemoved = [];
-extend(elesfn$2, {
- components: function components(root) {
- var self = this;
- var cy = self.cy();
- var visited = cy.collection();
- var unvisited = root == null ? self.nodes() : root.nodes();
- var components = [];
- if (root != null && unvisited.empty()) {
- // root may contain only edges
- unvisited = root.sources(); // doesn't matter which node to use (undirected), so just use the source sides
+ nodesToBeRemoved = nodesToBeRemoved.concat(graph.getNodes());
+
+ var node;
+ s = nodesToBeRemoved.length;
+ for (var i = 0; i < s; i++) {
+ node = nodesToBeRemoved[i];
+ graph.remove(node);
}
- var visitInComponent = function visitInComponent(node, component) {
- visited.merge(node);
- unvisited.unmerge(node);
- component.merge(node);
- };
- if (unvisited.empty()) {
- return self.spawn();
+ // check if graph is the root
+ if (graph == this.rootGraph) {
+ this.setRootGraph(null);
}
- var _loop = function _loop() {
- // each iteration yields a component
- var cmpt = cy.collection();
- components.push(cmpt);
- var root = unvisited[0];
- visitInComponent(root, cmpt);
- self.bfs({
- directed: false,
- roots: root,
- visit: function visit(v) {
- return visitInComponent(v, cmpt);
- }
- });
- cmpt.forEach(function (node) {
- node.connectedEdges().forEach(function (e) {
- // connectedEdges() usually cached
- if (self.has(e) && cmpt.has(e.source()) && cmpt.has(e.target())) {
- // has() is cheap
- cmpt.merge(e); // forEach() only considers nodes -- sets N at call time
- }
- });
- });
- };
- do {
- _loop();
- } while (unvisited.length > 0);
- return components;
- },
- component: function component() {
- var ele = this[0];
- return ele.cy().mutableElements().components(ele)[0];
- }
-});
-elesfn$2.componentsOf = elesfn$2.components;
-// represents a set of nodes, edges, or both together
-var Collection = function Collection(cy, elements) {
- var unique = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
- var removed = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
- if (cy === undefined) {
- error('A collection must have a reference to the core');
- return;
- }
- var map = new Map$1();
- var createdElements = false;
- if (!elements) {
- elements = [];
- } else if (elements.length > 0 && plainObject(elements[0]) && !element(elements[0])) {
- createdElements = true;
+ // now remove the graph itself
+ var index = this.graphs.indexOf(graph);
+ this.graphs.splice(index, 1);
- // make elements from json and restore all at once later
- var eles = [];
- var elesIds = new Set$1();
- for (var i = 0, l = elements.length; i < l; i++) {
- var json = elements[i];
- if (json.data == null) {
- json.data = {};
- }
- var _data = json.data;
+ // also reset the parent of the graph
+ graph.parent = null;
+ } else if (lObj instanceof LEdge) {
+ edge = lObj;
+ if (edge == null) {
+ throw "Edge is null!";
+ }
+ if (!edge.isInterGraph) {
+ throw "Not an inter-graph edge!";
+ }
+ if (!(edge.source != null && edge.target != null)) {
+ throw "Source and/or target is null!";
+ }
- // make sure newly created elements have valid ids
- if (_data.id == null) {
- _data.id = uuid();
- } else if (cy.hasElementWithId(_data.id) || elesIds.has(_data.id)) {
- continue; // can't create element if prior id already exists
- }
+ // remove edge from source and target nodes' incidency lists
- var ele = new Element(cy, json, false);
- eles.push(ele);
- elesIds.add(_data.id);
- }
- elements = eles;
- }
- this.length = 0;
- for (var _i = 0, _l = elements.length; _i < _l; _i++) {
- var element$1 = elements[_i][0]; // [0] in case elements is an array of collections, rather than array of elements
- if (element$1 == null) {
- continue;
+ if (!(edge.source.edges.indexOf(edge) != -1 && edge.target.edges.indexOf(edge) != -1)) {
+ throw "Source and/or target doesn't know this edge!";
}
- var id = element$1._private.data.id;
- if (!unique || !map.has(id)) {
- if (unique) {
- map.set(id, {
- index: this.length,
- ele: element$1
- });
- }
- this[this.length] = element$1;
- this.length++;
+
+ var index = edge.source.edges.indexOf(edge);
+ edge.source.edges.splice(index, 1);
+ index = edge.target.edges.indexOf(edge);
+ edge.target.edges.splice(index, 1);
+
+ // remove edge from owner graph manager's inter-graph edge list
+
+ if (!(edge.source.owner != null && edge.source.owner.getGraphManager() != null)) {
+ throw "Edge owner graph or owner graph manager is null!";
}
- }
- this._private = {
- eles: this,
- cy: cy,
- get map() {
- if (this.lazyMap == null) {
- this.rebuildMap();
- }
- return this.lazyMap;
- },
- set map(m) {
- this.lazyMap = m;
- },
- rebuildMap: function rebuildMap() {
- var m = this.lazyMap = new Map$1();
- var eles = this.eles;
- for (var _i2 = 0; _i2 < eles.length; _i2++) {
- var _ele = eles[_i2];
- m.set(_ele.id(), {
- index: _i2,
- ele: _ele
- });
- }
+ if (edge.source.owner.getGraphManager().edges.indexOf(edge) == -1) {
+ throw "Not in owner graph manager's edge list!";
}
- };
- if (unique) {
- this._private.map = map;
- }
- // restore the elements if we created them from json
- if (createdElements && !removed) {
- this.restore();
+ var index = edge.source.owner.getGraphManager().edges.indexOf(edge);
+ edge.source.owner.getGraphManager().edges.splice(index, 1);
}
};
-// Functions
-////////////////////////////////////////////////////////////////////////////////////////////////////
-
-// keep the prototypes in sync (an element has the same functions as a collection)
-// and use elefn and elesfn as shorthands to the prototypes
-var elesfn$1 = Element.prototype = Collection.prototype = Object.create(Array.prototype);
-elesfn$1.instanceString = function () {
- return 'collection';
+LGraphManager.prototype.updateBounds = function () {
+ this.rootGraph.updateBounds(true);
};
-elesfn$1.spawn = function (eles, unique) {
- return new Collection(this.cy(), eles, unique);
+
+LGraphManager.prototype.getGraphs = function () {
+ return this.graphs;
};
-elesfn$1.spawnSelf = function () {
- return this.spawn(this);
+
+LGraphManager.prototype.getAllNodes = function () {
+ if (this.allNodes == null) {
+ var nodeList = [];
+ var graphs = this.getGraphs();
+ var s = graphs.length;
+ for (var i = 0; i < s; i++) {
+ nodeList = nodeList.concat(graphs[i].getNodes());
+ }
+ this.allNodes = nodeList;
+ }
+ return this.allNodes;
};
-elesfn$1.cy = function () {
- return this._private.cy;
+
+LGraphManager.prototype.resetAllNodes = function () {
+ this.allNodes = null;
};
-elesfn$1.renderer = function () {
- return this._private.cy.renderer();
+
+LGraphManager.prototype.resetAllEdges = function () {
+ this.allEdges = null;
};
-elesfn$1.element = function () {
- return this[0];
+
+LGraphManager.prototype.resetAllNodesToApplyGravitation = function () {
+ this.allNodesToApplyGravitation = null;
};
-elesfn$1.collection = function () {
- if (collection(this)) {
- return this;
- } else {
- // an element
- return new Collection(this._private.cy, [this]);
+
+LGraphManager.prototype.getAllEdges = function () {
+ if (this.allEdges == null) {
+ var edgeList = [];
+ var graphs = this.getGraphs();
+ var s = graphs.length;
+ for (var i = 0; i < graphs.length; i++) {
+ edgeList = edgeList.concat(graphs[i].getEdges());
+ }
+
+ edgeList = edgeList.concat(this.edges);
+
+ this.allEdges = edgeList;
}
+ return this.allEdges;
};
-elesfn$1.unique = function () {
- return new Collection(this._private.cy, this, true);
-};
-elesfn$1.hasElementWithId = function (id) {
- id = '' + id; // id must be string
- return this._private.map.has(id);
+LGraphManager.prototype.getAllNodesToApplyGravitation = function () {
+ return this.allNodesToApplyGravitation;
};
-elesfn$1.getElementById = function (id) {
- id = '' + id; // id must be string
- var cy = this._private.cy;
- var entry = this._private.map.get(id);
- return entry ? entry.ele : new Collection(cy); // get ele or empty collection
+LGraphManager.prototype.setAllNodesToApplyGravitation = function (nodeList) {
+ if (this.allNodesToApplyGravitation != null) {
+ throw "assert failed";
+ }
+
+ this.allNodesToApplyGravitation = nodeList;
};
-elesfn$1.$id = elesfn$1.getElementById;
-elesfn$1.poolIndex = function () {
- var cy = this._private.cy;
- var eles = cy._private.elements;
- var id = this[0]._private.data.id;
- return eles._private.map.get(id).index;
+LGraphManager.prototype.getRoot = function () {
+ return this.rootGraph;
};
-elesfn$1.indexOf = function (ele) {
- var id = ele[0]._private.data.id;
- return this._private.map.get(id).index;
+
+LGraphManager.prototype.setRootGraph = function (graph) {
+ if (graph.getGraphManager() != this) {
+ throw "Root not in this graph mgr!";
+ }
+
+ this.rootGraph = graph;
+ // root graph must have a root node associated with it for convenience
+ if (graph.parent == null) {
+ graph.parent = this.layout.newNode("Root node");
+ }
};
-elesfn$1.indexOfId = function (id) {
- id = '' + id; // id must be string
- return this._private.map.get(id).index;
+LGraphManager.prototype.getLayout = function () {
+ return this.layout;
};
-elesfn$1.json = function (obj) {
- var ele = this.element();
- var cy = this.cy();
- if (ele == null && obj) {
- return this;
- } // can't set to no eles
- if (ele == null) {
- return undefined;
- } // can't get from no eles
+LGraphManager.prototype.isOneAncestorOfOther = function (firstNode, secondNode) {
+ if (!(firstNode != null && secondNode != null)) {
+ throw "assert failed";
+ }
- var p = ele._private;
- if (plainObject(obj)) {
- // set
+ if (firstNode == secondNode) {
+ return true;
+ }
+ // Is second node an ancestor of the first one?
+ var ownerGraph = firstNode.getOwner();
+ var parentNode;
- cy.startBatch();
- if (obj.data) {
- ele.data(obj.data);
- var _data2 = p.data;
- if (ele.isEdge()) {
- // source and target are immutable via data()
- var move = false;
- var spec = {};
- var src = obj.data.source;
- var tgt = obj.data.target;
- if (src != null && src != _data2.source) {
- spec.source = '' + src; // id must be string
- move = true;
- }
- if (tgt != null && tgt != _data2.target) {
- spec.target = '' + tgt; // id must be string
- move = true;
- }
- if (move) {
- ele = ele.move(spec);
- }
- } else {
- // parent is immutable via data()
- var newParentValSpecd = ('parent' in obj.data);
- var parent = obj.data.parent;
- if (newParentValSpecd && (parent != null || _data2.parent != null) && parent != _data2.parent) {
- if (parent === undefined) {
- // can't set undefined imperatively, so use null
- parent = null;
- }
- if (parent != null) {
- parent = '' + parent; // id must be string
- }
+ do {
+ parentNode = ownerGraph.getParent();
- ele = ele.move({
- parent: parent
- });
- }
- }
- }
- if (obj.position) {
- ele.position(obj.position);
+ if (parentNode == null) {
+ break;
}
- // ignore group -- immutable
+ if (parentNode == secondNode) {
+ return true;
+ }
- var checkSwitch = function checkSwitch(k, trueFnName, falseFnName) {
- var obj_k = obj[k];
- if (obj_k != null && obj_k !== p[k]) {
- if (obj_k) {
- ele[trueFnName]();
- } else {
- ele[falseFnName]();
- }
- }
- };
- checkSwitch('removed', 'remove', 'restore');
- checkSwitch('selected', 'select', 'unselect');
- checkSwitch('selectable', 'selectify', 'unselectify');
- checkSwitch('locked', 'lock', 'unlock');
- checkSwitch('grabbable', 'grabify', 'ungrabify');
- checkSwitch('pannable', 'panify', 'unpanify');
- if (obj.classes != null) {
- ele.classes(obj.classes);
+ ownerGraph = parentNode.getOwner();
+ if (ownerGraph == null) {
+ break;
}
- cy.endBatch();
- return this;
- } else if (obj === undefined) {
- // get
+ } while (true);
+ // Is first node an ancestor of the second one?
+ ownerGraph = secondNode.getOwner();
- var json = {
- data: copy(p.data),
- position: copy(p.position),
- group: p.group,
- removed: p.removed,
- selected: p.selected,
- selectable: p.selectable,
- locked: p.locked,
- grabbable: p.grabbable,
- pannable: p.pannable,
- classes: null
- };
- json.classes = '';
- var i = 0;
- p.classes.forEach(function (cls) {
- return json.classes += i++ === 0 ? cls : ' ' + cls;
- });
- return json;
- }
-};
-elesfn$1.jsons = function () {
- var jsons = [];
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var json = ele.json();
- jsons.push(json);
- }
- return jsons;
-};
-elesfn$1.clone = function () {
- var cy = this.cy();
- var elesArr = [];
- for (var i = 0; i < this.length; i++) {
- var ele = this[i];
- var json = ele.json();
- var clone = new Element(cy, json, false); // NB no restore
+ do {
+ parentNode = ownerGraph.getParent();
- elesArr.push(clone);
- }
- return new Collection(cy, elesArr);
-};
-elesfn$1.copy = elesfn$1.clone;
-elesfn$1.restore = function () {
- var notifyRenderer = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
- var addToPool = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- var self = this;
- var cy = self.cy();
- var cy_p = cy._private;
+ if (parentNode == null) {
+ break;
+ }
- // create arrays of nodes and edges, since we need to
- // restore the nodes first
- var nodes = [];
- var edges = [];
- var elements;
- for (var _i3 = 0, l = self.length; _i3 < l; _i3++) {
- var ele = self[_i3];
- if (addToPool && !ele.removed()) {
- // don't need to handle this ele
- continue;
+ if (parentNode == firstNode) {
+ return true;
}
- // keep nodes first in the array and edges after
- if (ele.isNode()) {
- // put to front of array if node
- nodes.push(ele);
- } else {
- // put to end of array if edge
- edges.push(ele);
+ ownerGraph = parentNode.getOwner();
+ if (ownerGraph == null) {
+ break;
}
- }
- elements = nodes.concat(edges);
- var i;
- var removeFromElements = function removeFromElements() {
- elements.splice(i, 1);
- i--;
- };
+ } while (true);
- // now, restore each element
- for (i = 0; i < elements.length; i++) {
- var _ele2 = elements[i];
- var _private = _ele2._private;
- var _data3 = _private.data;
+ return false;
+};
- // the traversal cache should start fresh when ele is added
- _ele2.clearTraversalCache();
+LGraphManager.prototype.calcLowestCommonAncestors = function () {
+ var edge;
+ var sourceNode;
+ var targetNode;
+ var sourceAncestorGraph;
+ var targetAncestorGraph;
- // set id and validate
- if (!addToPool && !_private.removed) ; else if (_data3.id === undefined) {
- _data3.id = uuid();
- } else if (number$1(_data3.id)) {
- _data3.id = '' + _data3.id; // now it's a string
- } else if (emptyString(_data3.id) || !string(_data3.id)) {
- error('Can not create element with invalid string ID `' + _data3.id + '`');
+ var edges = this.getAllEdges();
+ var s = edges.length;
+ for (var i = 0; i < s; i++) {
+ edge = edges[i];
- // can't create element if it has empty string as id or non-string id
- removeFromElements();
- continue;
- } else if (cy.hasElementWithId(_data3.id)) {
- error('Can not create second element with ID `' + _data3.id + '`');
+ sourceNode = edge.source;
+ targetNode = edge.target;
+ edge.lca = null;
+ edge.sourceInLca = sourceNode;
+ edge.targetInLca = targetNode;
- // can't create element if one already has that id
- removeFromElements();
+ if (sourceNode == targetNode) {
+ edge.lca = sourceNode.getOwner();
continue;
}
- var id = _data3.id; // id is finalised, now let's keep a ref
- if (_ele2.isNode()) {
- // extra checks for nodes
- var pos = _private.position;
+ sourceAncestorGraph = sourceNode.getOwner();
- // make sure the nodes have a defined position
+ while (edge.lca == null) {
+ edge.targetInLca = targetNode;
+ targetAncestorGraph = targetNode.getOwner();
- if (pos.x == null) {
- pos.x = 0;
- }
- if (pos.y == null) {
- pos.y = 0;
- }
- }
- if (_ele2.isEdge()) {
- // extra checks for edges
+ while (edge.lca == null) {
+ if (targetAncestorGraph == sourceAncestorGraph) {
+ edge.lca = targetAncestorGraph;
+ break;
+ }
- var edge = _ele2;
- var fields = ['source', 'target'];
- var fieldsLength = fields.length;
- var badSourceOrTarget = false;
- for (var j = 0; j < fieldsLength; j++) {
- var field = fields[j];
- var val = _data3[field];
- if (number$1(val)) {
- val = _data3[field] = '' + _data3[field]; // now string
+ if (targetAncestorGraph == this.rootGraph) {
+ break;
}
- if (val == null || val === '') {
- // can't create if source or target is not defined properly
- error('Can not create edge `' + id + '` with unspecified ' + field);
- badSourceOrTarget = true;
- } else if (!cy.hasElementWithId(val)) {
- // can't create edge if one of its nodes doesn't exist
- error('Can not create edge `' + id + '` with nonexistant ' + field + ' `' + val + '`');
- badSourceOrTarget = true;
+ if (edge.lca != null) {
+ throw "assert failed";
}
+ edge.targetInLca = targetAncestorGraph.getParent();
+ targetAncestorGraph = edge.targetInLca.getOwner();
}
- if (badSourceOrTarget) {
- removeFromElements();
- continue;
- } // can't create this
- var src = cy.getElementById(_data3.source);
- var tgt = cy.getElementById(_data3.target);
-
- // only one edge in node if loop
- if (src.same(tgt)) {
- src._private.edges.push(edge);
- } else {
- src._private.edges.push(edge);
- tgt._private.edges.push(edge);
+ if (sourceAncestorGraph == this.rootGraph) {
+ break;
}
- edge._private.source = src;
- edge._private.target = tgt;
- } // if is edge
-
- // create mock ids / indexes maps for element so it can be used like collections
- _private.map = new Map$1();
- _private.map.set(id, {
- ele: _ele2,
- index: 0
- });
- _private.removed = false;
- if (addToPool) {
- cy.addToPool(_ele2);
- }
- } // for each element
-
- // do compound node sanity checks
- for (var _i4 = 0; _i4 < nodes.length; _i4++) {
- // each node
- var node = nodes[_i4];
- var _data4 = node._private.data;
- if (number$1(_data4.parent)) {
- // then automake string
- _data4.parent = '' + _data4.parent;
- }
- var parentId = _data4.parent;
- var specifiedParent = parentId != null;
- if (specifiedParent || node._private.parent) {
- var parent = node._private.parent ? cy.collection().merge(node._private.parent) : cy.getElementById(parentId);
- if (parent.empty()) {
- // non-existant parent; just remove it
- _data4.parent = undefined;
- } else if (parent[0].removed()) {
- warn('Node added with missing parent, reference to parent removed');
- _data4.parent = undefined;
- node._private.parent = null;
- } else {
- var selfAsParent = false;
- var ancestor = parent;
- while (!ancestor.empty()) {
- if (node.same(ancestor)) {
- // mark self as parent and remove from data
- selfAsParent = true;
- _data4.parent = undefined; // remove parent reference
-
- // exit or we loop forever
- break;
- }
- ancestor = ancestor.parent();
- }
- if (!selfAsParent) {
- // connect with children
- parent[0]._private.children.push(node);
- node._private.parent = parent[0];
-
- // let the core know we have a compound graph
- cy_p.hasCompoundNodes = true;
- }
- } // else
- } // if specified parent
- } // for each node
- if (elements.length > 0) {
- var restored = elements.length === self.length ? self : new Collection(cy, elements);
- for (var _i5 = 0; _i5 < restored.length; _i5++) {
- var _ele3 = restored[_i5];
- if (_ele3.isNode()) {
- continue;
+ if (edge.lca == null) {
+ edge.sourceInLca = sourceAncestorGraph.getParent();
+ sourceAncestorGraph = edge.sourceInLca.getOwner();
}
-
- // adding an edge invalidates the traversal caches for the parallel edges
- _ele3.parallelEdges().clearTraversalCache();
-
- // adding an edge invalidates the traversal cache for the connected nodes
- _ele3.source().clearTraversalCache();
- _ele3.target().clearTraversalCache();
- }
- var toUpdateStyle;
- if (cy_p.hasCompoundNodes) {
- toUpdateStyle = cy.collection().merge(restored).merge(restored.connectedNodes()).merge(restored.parent());
- } else {
- toUpdateStyle = restored;
}
- toUpdateStyle.dirtyCompoundBoundsCache().dirtyBoundingBoxCache().updateStyle(notifyRenderer);
- if (notifyRenderer) {
- restored.emitAndNotify('add');
- } else if (addToPool) {
- restored.emit('add');
+
+ if (edge.lca == null) {
+ throw "assert failed";
}
}
- return self; // chainability
-};
-
-elesfn$1.removed = function () {
- var ele = this[0];
- return ele && ele._private.removed;
-};
-elesfn$1.inside = function () {
- var ele = this[0];
- return ele && !ele._private.removed;
};
-elesfn$1.remove = function () {
- var notifyRenderer = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
- var removeFromPool = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- var self = this;
- var elesToRemove = [];
- var elesToRemoveIds = {};
- var cy = self._private.cy;
- // add connected edges
- function addConnectedEdges(node) {
- var edges = node._private.edges;
- for (var i = 0; i < edges.length; i++) {
- add(edges[i]);
- }
+LGraphManager.prototype.calcLowestCommonAncestor = function (firstNode, secondNode) {
+ if (firstNode == secondNode) {
+ return firstNode.getOwner();
}
+ var firstOwnerGraph = firstNode.getOwner();
- // add descendant nodes
- function addChildren(node) {
- var children = node._private.children;
- for (var i = 0; i < children.length; i++) {
- add(children[i]);
- }
- }
- function add(ele) {
- var alreadyAdded = elesToRemoveIds[ele.id()];
- if (removeFromPool && ele.removed() || alreadyAdded) {
- return;
- } else {
- elesToRemoveIds[ele.id()] = true;
+ do {
+ if (firstOwnerGraph == null) {
+ break;
}
- if (ele.isNode()) {
- elesToRemove.push(ele); // nodes are removed last
+ var secondOwnerGraph = secondNode.getOwner();
- addConnectedEdges(ele);
- addChildren(ele);
- } else {
- elesToRemove.unshift(ele); // edges are removed first
- }
- }
+ do {
+ if (secondOwnerGraph == null) {
+ break;
+ }
- // make the list of elements to remove
- // (may be removing more than specified due to connected edges etc)
+ if (secondOwnerGraph == firstOwnerGraph) {
+ return secondOwnerGraph;
+ }
+ secondOwnerGraph = secondOwnerGraph.getParent().getOwner();
+ } while (true);
- for (var i = 0, l = self.length; i < l; i++) {
- var ele = self[i];
- add(ele);
- }
- function removeEdgeRef(node, edge) {
- var connectedEdges = node._private.edges;
- removeFromArray(connectedEdges, edge);
+ firstOwnerGraph = firstOwnerGraph.getParent().getOwner();
+ } while (true);
- // removing an edges invalidates the traversal cache for its nodes
- node.clearTraversalCache();
- }
- function removeParallelRef(pllEdge) {
- // removing an edge invalidates the traversal caches for the parallel edges
- pllEdge.clearTraversalCache();
+ return firstOwnerGraph;
+};
+
+LGraphManager.prototype.calcInclusionTreeDepths = function (graph, depth) {
+ if (graph == null && depth == null) {
+ graph = this.rootGraph;
+ depth = 1;
}
- var alteredParents = [];
- alteredParents.ids = {};
- function removeChildRef(parent, ele) {
- ele = ele[0];
- parent = parent[0];
- var children = parent._private.children;
- var pid = parent.id();
- removeFromArray(children, ele); // remove parent => child ref
+ var node;
- ele._private.parent = null; // remove child => parent ref
+ var nodes = graph.getNodes();
+ var s = nodes.length;
+ for (var i = 0; i < s; i++) {
+ node = nodes[i];
+ node.inclusionTreeDepth = depth;
- if (!alteredParents.ids[pid]) {
- alteredParents.ids[pid] = true;
- alteredParents.push(parent);
+ if (node.child != null) {
+ this.calcInclusionTreeDepths(node.child, depth + 1);
}
}
- self.dirtyCompoundBoundsCache();
- if (removeFromPool) {
- cy.removeFromPool(elesToRemove); // remove from core pool
- }
+};
- for (var _i6 = 0; _i6 < elesToRemove.length; _i6++) {
- var _ele4 = elesToRemove[_i6];
- if (_ele4.isEdge()) {
- // remove references to this edge in its connected nodes
- var src = _ele4.source()[0];
- var tgt = _ele4.target()[0];
- removeEdgeRef(src, _ele4);
- removeEdgeRef(tgt, _ele4);
- var pllEdges = _ele4.parallelEdges();
- for (var j = 0; j < pllEdges.length; j++) {
- var pllEdge = pllEdges[j];
- removeParallelRef(pllEdge);
- if (pllEdge.isBundledBezier()) {
- pllEdge.dirtyBoundingBoxCache();
- }
- }
- } else {
- // remove reference to parent
- var parent = _ele4.parent();
- if (parent.length !== 0) {
- removeChildRef(parent, _ele4);
- }
- }
- if (removeFromPool) {
- // mark as removed
- _ele4._private.removed = true;
- }
- }
+LGraphManager.prototype.includesInvalidEdge = function () {
+ var edge;
+ var edgesToRemove = [];
- // check to see if we have a compound graph or not
- var elesStillInside = cy._private.elements;
- cy._private.hasCompoundNodes = false;
- for (var _i7 = 0; _i7 < elesStillInside.length; _i7++) {
- var _ele5 = elesStillInside[_i7];
- if (_ele5.isParent()) {
- cy._private.hasCompoundNodes = true;
- break;
- }
- }
- var removedElements = new Collection(this.cy(), elesToRemove);
- if (removedElements.size() > 0) {
- // must manually notify since trigger won't do this automatically once removed
+ var s = this.edges.length;
+ for (var i = 0; i < s; i++) {
+ edge = this.edges[i];
- if (notifyRenderer) {
- removedElements.emitAndNotify('remove');
- } else if (removeFromPool) {
- removedElements.emit('remove');
+ if (this.isOneAncestorOfOther(edge.source, edge.target)) {
+ edgesToRemove.push(edge);
}
}
- // the parents who were modified by the removal need their style updated
- for (var _i8 = 0; _i8 < alteredParents.length; _i8++) {
- var _ele6 = alteredParents[_i8];
- if (!removeFromPool || !_ele6.removed()) {
- _ele6.updateStyle();
- }
+ // Remove invalid edges from graph manager
+ for (var i = 0; i < edgesToRemove.length; i++) {
+ this.remove(edgesToRemove[i]);
}
- return removedElements;
-};
-elesfn$1.move = function (struct) {
- var cy = this._private.cy;
- var eles = this;
- // just clean up refs, caches, etc. in the same way as when removing and then restoring
- // (our calls to remove/restore do not remove from the graph or make events)
- var notifyRenderer = false;
- var modifyPool = false;
- var toString = function toString(id) {
- return id == null ? id : '' + id;
- }; // id must be string
+ // Invalid edges are cleared, so return false
+ return false;
+};
- if (struct.source !== undefined || struct.target !== undefined) {
- var srcId = toString(struct.source);
- var tgtId = toString(struct.target);
- var srcExists = srcId != null && cy.hasElementWithId(srcId);
- var tgtExists = tgtId != null && cy.hasElementWithId(tgtId);
- if (srcExists || tgtExists) {
- cy.batch(function () {
- // avoid duplicate style updates
- eles.remove(notifyRenderer, modifyPool); // clean up refs etc.
- eles.emitAndNotify('moveout');
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var _data5 = ele._private.data;
- if (ele.isEdge()) {
- if (srcExists) {
- _data5.source = srcId;
- }
- if (tgtExists) {
- _data5.target = tgtId;
- }
- }
- }
- eles.restore(notifyRenderer, modifyPool); // make new refs, style, etc.
- });
+module.exports = LGraphManager;
- eles.emitAndNotify('move');
- }
- } else if (struct.parent !== undefined) {
- // move node to new parent
- var parentId = toString(struct.parent);
- var parentExists = parentId === null || cy.hasElementWithId(parentId);
- if (parentExists) {
- var pidToAssign = parentId === null ? undefined : parentId;
- cy.batch(function () {
- // avoid duplicate style updates
- var updated = eles.remove(notifyRenderer, modifyPool); // clean up refs etc.
- updated.emitAndNotify('moveout');
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var _data6 = ele._private.data;
- if (ele.isNode()) {
- _data6.parent = pidToAssign;
- }
- }
- updated.restore(notifyRenderer, modifyPool); // make new refs, style, etc.
- });
+/***/ }),
+/* 8 */
+/***/ (function(module, exports, __nested_webpack_require_41052__) {
- eles.emitAndNotify('move');
- }
- }
- return this;
-};
-[elesfn$j, elesfn$i, elesfn$h, elesfn$g, elesfn$f, data, elesfn$d, dimensions, elesfn$9, elesfn$8, elesfn$7, elesfn$6, elesfn$5, elesfn$4, elesfn$3, elesfn$2].forEach(function (props) {
- extend(elesfn$1, props);
-});
+"use strict";
-var corefn$9 = {
- add: function add(opts) {
- var elements;
- var cy = this;
- // add the elements
- if (elementOrCollection(opts)) {
- var eles = opts;
- if (eles._private.cy === cy) {
- // same instance => just restore
- elements = eles.restore();
- } else {
- // otherwise, copy from json
- var jsons = [];
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- jsons.push(ele.json());
- }
- elements = new Collection(cy, jsons);
- }
- }
+/**
+ * This class maintains a list of static geometry related utility methods.
+ *
+ *
+ * Copyright: i-Vis Research Group, Bilkent University, 2007 - present
+ */
- // specify an array of options
- else if (array(opts)) {
- var _jsons = opts;
- elements = new Collection(cy, _jsons);
- }
+var Point = __nested_webpack_require_41052__(12);
- // specify via opts.nodes and opts.edges
- else if (plainObject(opts) && (array(opts.nodes) || array(opts.edges))) {
- var elesByGroup = opts;
- var _jsons2 = [];
- var grs = ['nodes', 'edges'];
- for (var _i = 0, il = grs.length; _i < il; _i++) {
- var group = grs[_i];
- var elesArray = elesByGroup[group];
- if (array(elesArray)) {
- for (var j = 0, jl = elesArray.length; j < jl; j++) {
- var json = extend({
- group: group
- }, elesArray[j]);
- _jsons2.push(json);
- }
- }
- }
- elements = new Collection(cy, _jsons2);
- }
+function IGeometry() {}
- // specify options for one element
- else {
- var _json = opts;
- elements = new Element(cy, _json).collection();
- }
- return elements;
- },
- remove: function remove(collection) {
- if (elementOrCollection(collection)) ; else if (string(collection)) {
- var selector = collection;
- collection = this.$(selector);
- }
- return collection.remove();
+/**
+ * This method calculates *half* the amount in x and y directions of the two
+ * input rectangles needed to separate them keeping their respective
+ * positioning, and returns the result in the input array. An input
+ * separation buffer added to the amount in both directions. We assume that
+ * the two rectangles do intersect.
+ */
+IGeometry.calcSeparationAmount = function (rectA, rectB, overlapAmount, separationBuffer) {
+ if (!rectA.intersects(rectB)) {
+ throw "assert failed";
}
-};
-
-/* global Float32Array */
-/*! Bezier curve function generator. Copyright Gaetan Renaudeau. MIT License: http://en.wikipedia.org/wiki/MIT_License */
-function generateCubicBezier(mX1, mY1, mX2, mY2) {
- var NEWTON_ITERATIONS = 4,
- NEWTON_MIN_SLOPE = 0.001,
- SUBDIVISION_PRECISION = 0.0000001,
- SUBDIVISION_MAX_ITERATIONS = 10,
- kSplineTableSize = 11,
- kSampleStepSize = 1.0 / (kSplineTableSize - 1.0),
- float32ArraySupported = typeof Float32Array !== 'undefined';
+ var directions = new Array(2);
- /* Must contain four arguments. */
- if (arguments.length !== 4) {
- return false;
- }
+ this.decideDirectionsForOverlappingNodes(rectA, rectB, directions);
- /* Arguments must be numbers. */
- for (var i = 0; i < 4; ++i) {
- if (typeof arguments[i] !== "number" || isNaN(arguments[i]) || !isFinite(arguments[i])) {
- return false;
- }
- }
+ overlapAmount[0] = Math.min(rectA.getRight(), rectB.getRight()) - Math.max(rectA.x, rectB.x);
+ overlapAmount[1] = Math.min(rectA.getBottom(), rectB.getBottom()) - Math.max(rectA.y, rectB.y);
- /* X values must be in the [0, 1] range. */
- mX1 = Math.min(mX1, 1);
- mX2 = Math.min(mX2, 1);
- mX1 = Math.max(mX1, 0);
- mX2 = Math.max(mX2, 0);
- var mSampleValues = float32ArraySupported ? new Float32Array(kSplineTableSize) : new Array(kSplineTableSize);
- function A(aA1, aA2) {
- return 1.0 - 3.0 * aA2 + 3.0 * aA1;
- }
- function B(aA1, aA2) {
- return 3.0 * aA2 - 6.0 * aA1;
- }
- function C(aA1) {
- return 3.0 * aA1;
- }
- function calcBezier(aT, aA1, aA2) {
- return ((A(aA1, aA2) * aT + B(aA1, aA2)) * aT + C(aA1)) * aT;
+ // update the overlapping amounts for the following cases:
+ if (rectA.getX() <= rectB.getX() && rectA.getRight() >= rectB.getRight()) {
+ /* Case x.1:
+ *
+ * rectA
+ * | |
+ * | _________ |
+ * | | | |
+ * |________|_______|______|
+ * | |
+ * | |
+ * rectB
+ */
+ overlapAmount[0] += Math.min(rectB.getX() - rectA.getX(), rectA.getRight() - rectB.getRight());
+ } else if (rectB.getX() <= rectA.getX() && rectB.getRight() >= rectA.getRight()) {
+ /* Case x.2:
+ *
+ * rectB
+ * | |
+ * | _________ |
+ * | | | |
+ * |________|_______|______|
+ * | |
+ * | |
+ * rectA
+ */
+ overlapAmount[0] += Math.min(rectA.getX() - rectB.getX(), rectB.getRight() - rectA.getRight());
}
- function getSlope(aT, aA1, aA2) {
- return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1);
- }
- function newtonRaphsonIterate(aX, aGuessT) {
- for (var _i = 0; _i < NEWTON_ITERATIONS; ++_i) {
- var currentSlope = getSlope(aGuessT, mX1, mX2);
- if (currentSlope === 0.0) {
- return aGuessT;
- }
- var currentX = calcBezier(aGuessT, mX1, mX2) - aX;
- aGuessT -= currentX / currentSlope;
- }
- return aGuessT;
- }
- function calcSampleValues() {
- for (var _i2 = 0; _i2 < kSplineTableSize; ++_i2) {
- mSampleValues[_i2] = calcBezier(_i2 * kSampleStepSize, mX1, mX2);
- }
- }
- function binarySubdivide(aX, aA, aB) {
- var currentX,
- currentT,
- i = 0;
- do {
- currentT = aA + (aB - aA) / 2.0;
- currentX = calcBezier(currentT, mX1, mX2) - aX;
- if (currentX > 0.0) {
- aB = currentT;
- } else {
- aA = currentT;
- }
- } while (Math.abs(currentX) > SUBDIVISION_PRECISION && ++i < SUBDIVISION_MAX_ITERATIONS);
- return currentT;
- }
- function getTForX(aX) {
- var intervalStart = 0.0,
- currentSample = 1,
- lastSample = kSplineTableSize - 1;
- for (; currentSample !== lastSample && mSampleValues[currentSample] <= aX; ++currentSample) {
- intervalStart += kSampleStepSize;
- }
- --currentSample;
- var dist = (aX - mSampleValues[currentSample]) / (mSampleValues[currentSample + 1] - mSampleValues[currentSample]),
- guessForT = intervalStart + dist * kSampleStepSize,
- initialSlope = getSlope(guessForT, mX1, mX2);
- if (initialSlope >= NEWTON_MIN_SLOPE) {
- return newtonRaphsonIterate(aX, guessForT);
- } else if (initialSlope === 0.0) {
- return guessForT;
- } else {
- return binarySubdivide(aX, intervalStart, intervalStart + kSampleStepSize);
- }
- }
- var _precomputed = false;
- function precompute() {
- _precomputed = true;
- if (mX1 !== mY1 || mX2 !== mY2) {
- calcSampleValues();
- }
+ if (rectA.getY() <= rectB.getY() && rectA.getBottom() >= rectB.getBottom()) {
+ /* Case y.1:
+ * ________ rectA
+ * |
+ * |
+ * ______|____ rectB
+ * | |
+ * | |
+ * ______|____|
+ * |
+ * |
+ * |________
+ *
+ */
+ overlapAmount[1] += Math.min(rectB.getY() - rectA.getY(), rectA.getBottom() - rectB.getBottom());
+ } else if (rectB.getY() <= rectA.getY() && rectB.getBottom() >= rectA.getBottom()) {
+ /* Case y.2:
+ * ________ rectB
+ * |
+ * |
+ * ______|____ rectA
+ * | |
+ * | |
+ * ______|____|
+ * |
+ * |
+ * |________
+ *
+ */
+ overlapAmount[1] += Math.min(rectA.getY() - rectB.getY(), rectB.getBottom() - rectA.getBottom());
}
- var f = function f(aX) {
- if (!_precomputed) {
- precompute();
- }
- if (mX1 === mY1 && mX2 === mY2) {
- return aX;
- }
- if (aX === 0) {
- return 0;
- }
- if (aX === 1) {
- return 1;
- }
- return calcBezier(getTForX(aX), mY1, mY2);
- };
- f.getControlPoints = function () {
- return [{
- x: mX1,
- y: mY1
- }, {
- x: mX2,
- y: mY2
- }];
- };
- var str = "generateBezier(" + [mX1, mY1, mX2, mY2] + ")";
- f.toString = function () {
- return str;
- };
- return f;
-}
-/*! Runge-Kutta spring physics function generator. Adapted from Framer.js, copyright Koen Bok. MIT License: http://en.wikipedia.org/wiki/MIT_License */
-/* Given a tension, friction, and duration, a simulation at 60FPS will first run without a defined duration in order to calculate the full path. A second pass
- then adjusts the time delta -- using the relation between actual time and duration -- to calculate the path for the duration-constrained animation. */
-var generateSpringRK4 = function () {
- function springAccelerationForState(state) {
- return -state.tension * state.x - state.friction * state.v;
- }
- function springEvaluateStateWithDerivative(initialState, dt, derivative) {
- var state = {
- x: initialState.x + derivative.dx * dt,
- v: initialState.v + derivative.dv * dt,
- tension: initialState.tension,
- friction: initialState.friction
- };
- return {
- dx: state.v,
- dv: springAccelerationForState(state)
- };
- }
- function springIntegrateState(state, dt) {
- var a = {
- dx: state.v,
- dv: springAccelerationForState(state)
- },
- b = springEvaluateStateWithDerivative(state, dt * 0.5, a),
- c = springEvaluateStateWithDerivative(state, dt * 0.5, b),
- d = springEvaluateStateWithDerivative(state, dt, c),
- dxdt = 1.0 / 6.0 * (a.dx + 2.0 * (b.dx + c.dx) + d.dx),
- dvdt = 1.0 / 6.0 * (a.dv + 2.0 * (b.dv + c.dv) + d.dv);
- state.x = state.x + dxdt * dt;
- state.v = state.v + dvdt * dt;
- return state;
+ // find slope of the line passes two centers
+ var slope = Math.abs((rectB.getCenterY() - rectA.getCenterY()) / (rectB.getCenterX() - rectA.getCenterX()));
+ // if centers are overlapped
+ if (rectB.getCenterY() === rectA.getCenterY() && rectB.getCenterX() === rectA.getCenterX()) {
+ // assume the slope is 1 (45 degree)
+ slope = 1.0;
}
- return function springRK4Factory(tension, friction, duration) {
- var initState = {
- x: -1,
- v: 0,
- tension: null,
- friction: null
- },
- path = [0],
- time_lapsed = 0,
- tolerance = 1 / 10000,
- DT = 16 / 1000,
- have_duration,
- dt,
- last_state;
- tension = parseFloat(tension) || 500;
- friction = parseFloat(friction) || 20;
- duration = duration || null;
- initState.tension = tension;
- initState.friction = friction;
- have_duration = duration !== null;
-
- /* Calculate the actual time it takes for this animation to complete with the provided conditions. */
- if (have_duration) {
- /* Run the simulation without a duration. */
- time_lapsed = springRK4Factory(tension, friction);
- /* Compute the adjusted time delta. */
- dt = time_lapsed / duration * DT;
- } else {
- dt = DT;
- }
- for (;;) {
- /* Next/step function .*/
- last_state = springIntegrateState(last_state || initState, dt);
- /* Store the position. */
- path.push(1 + last_state.x);
- time_lapsed += 16;
- /* If the change threshold is reached, break. */
- if (!(Math.abs(last_state.x) > tolerance && Math.abs(last_state.v) > tolerance)) {
- break;
- }
- }
-
- /* If duration is not defined, return the actual time required for completing this animation. Otherwise, return a closure that holds the
- computed path and returns a snapshot of the position according to a given percentComplete. */
- return !have_duration ? time_lapsed : function (percentComplete) {
- return path[percentComplete * (path.length - 1) | 0];
- };
- };
-}();
-var cubicBezier = function cubicBezier(t1, p1, t2, p2) {
- var bezier = generateCubicBezier(t1, p1, t2, p2);
- return function (start, end, percent) {
- return start + (end - start) * bezier(percent);
- };
+ var moveByY = slope * overlapAmount[0];
+ var moveByX = overlapAmount[1] / slope;
+ if (overlapAmount[0] < moveByX) {
+ moveByX = overlapAmount[0];
+ } else {
+ moveByY = overlapAmount[1];
+ }
+ // return half the amount so that if each rectangle is moved by these
+ // amounts in opposite directions, overlap will be resolved
+ overlapAmount[0] = -1 * directions[0] * (moveByX / 2 + separationBuffer);
+ overlapAmount[1] = -1 * directions[1] * (moveByY / 2 + separationBuffer);
};
-var easings = {
- 'linear': function linear(start, end, percent) {
- return start + (end - start) * percent;
- },
- // default easings
- 'ease': cubicBezier(0.25, 0.1, 0.25, 1),
- 'ease-in': cubicBezier(0.42, 0, 1, 1),
- 'ease-out': cubicBezier(0, 0, 0.58, 1),
- 'ease-in-out': cubicBezier(0.42, 0, 0.58, 1),
- // sine
- 'ease-in-sine': cubicBezier(0.47, 0, 0.745, 0.715),
- 'ease-out-sine': cubicBezier(0.39, 0.575, 0.565, 1),
- 'ease-in-out-sine': cubicBezier(0.445, 0.05, 0.55, 0.95),
- // quad
- 'ease-in-quad': cubicBezier(0.55, 0.085, 0.68, 0.53),
- 'ease-out-quad': cubicBezier(0.25, 0.46, 0.45, 0.94),
- 'ease-in-out-quad': cubicBezier(0.455, 0.03, 0.515, 0.955),
- // cubic
- 'ease-in-cubic': cubicBezier(0.55, 0.055, 0.675, 0.19),
- 'ease-out-cubic': cubicBezier(0.215, 0.61, 0.355, 1),
- 'ease-in-out-cubic': cubicBezier(0.645, 0.045, 0.355, 1),
- // quart
- 'ease-in-quart': cubicBezier(0.895, 0.03, 0.685, 0.22),
- 'ease-out-quart': cubicBezier(0.165, 0.84, 0.44, 1),
- 'ease-in-out-quart': cubicBezier(0.77, 0, 0.175, 1),
- // quint
- 'ease-in-quint': cubicBezier(0.755, 0.05, 0.855, 0.06),
- 'ease-out-quint': cubicBezier(0.23, 1, 0.32, 1),
- 'ease-in-out-quint': cubicBezier(0.86, 0, 0.07, 1),
- // expo
- 'ease-in-expo': cubicBezier(0.95, 0.05, 0.795, 0.035),
- 'ease-out-expo': cubicBezier(0.19, 1, 0.22, 1),
- 'ease-in-out-expo': cubicBezier(1, 0, 0, 1),
- // circ
- 'ease-in-circ': cubicBezier(0.6, 0.04, 0.98, 0.335),
- 'ease-out-circ': cubicBezier(0.075, 0.82, 0.165, 1),
- 'ease-in-out-circ': cubicBezier(0.785, 0.135, 0.15, 0.86),
- // user param easings...
- 'spring': function spring(tension, friction, duration) {
- if (duration === 0) {
- // can't get a spring w/ duration 0
- return easings.linear; // duration 0 => jump to end so impl doesn't matter
- }
+/**
+ * This method decides the separation direction of overlapping nodes
+ *
+ * if directions[0] = -1, then rectA goes left
+ * if directions[0] = 1, then rectA goes right
+ * if directions[1] = -1, then rectA goes up
+ * if directions[1] = 1, then rectA goes down
+ */
+IGeometry.decideDirectionsForOverlappingNodes = function (rectA, rectB, directions) {
+ if (rectA.getCenterX() < rectB.getCenterX()) {
+ directions[0] = -1;
+ } else {
+ directions[0] = 1;
+ }
- var spring = generateSpringRK4(tension, friction, duration);
- return function (start, end, percent) {
- return start + (end - start) * spring(percent);
- };
- },
- 'cubic-bezier': cubicBezier
+ if (rectA.getCenterY() < rectB.getCenterY()) {
+ directions[1] = -1;
+ } else {
+ directions[1] = 1;
+ }
};
-function getEasedValue(type, start, end, percent, easingFn) {
- if (percent === 1) {
- return end;
- }
- if (start === end) {
- return end;
- }
- var val = easingFn(start, end, percent);
- if (type == null) {
- return val;
- }
- if (type.roundValue || type.color) {
- val = Math.round(val);
- }
- if (type.min !== undefined) {
- val = Math.max(val, type.min);
- }
- if (type.max !== undefined) {
- val = Math.min(val, type.max);
+/**
+ * This method calculates the intersection (clipping) points of the two
+ * input rectangles with line segment defined by the centers of these two
+ * rectangles. The clipping points are saved in the input double array and
+ * whether or not the two rectangles overlap is returned.
+ */
+IGeometry.getIntersection2 = function (rectA, rectB, result) {
+ //result[0-1] will contain clipPoint of rectA, result[2-3] will contain clipPoint of rectB
+ var p1x = rectA.getCenterX();
+ var p1y = rectA.getCenterY();
+ var p2x = rectB.getCenterX();
+ var p2y = rectB.getCenterY();
+
+ //if two rectangles intersect, then clipping points are centers
+ if (rectA.intersects(rectB)) {
+ result[0] = p1x;
+ result[1] = p1y;
+ result[2] = p2x;
+ result[3] = p2y;
+ return true;
}
- return val;
-}
-function getValue(prop, spec) {
- if (prop.pfValue != null || prop.value != null) {
- if (prop.pfValue != null && (spec == null || spec.type.units !== '%')) {
- return prop.pfValue;
+ //variables for rectA
+ var topLeftAx = rectA.getX();
+ var topLeftAy = rectA.getY();
+ var topRightAx = rectA.getRight();
+ var bottomLeftAx = rectA.getX();
+ var bottomLeftAy = rectA.getBottom();
+ var bottomRightAx = rectA.getRight();
+ var halfWidthA = rectA.getWidthHalf();
+ var halfHeightA = rectA.getHeightHalf();
+ //variables for rectB
+ var topLeftBx = rectB.getX();
+ var topLeftBy = rectB.getY();
+ var topRightBx = rectB.getRight();
+ var bottomLeftBx = rectB.getX();
+ var bottomLeftBy = rectB.getBottom();
+ var bottomRightBx = rectB.getRight();
+ var halfWidthB = rectB.getWidthHalf();
+ var halfHeightB = rectB.getHeightHalf();
+
+ //flag whether clipping points are found
+ var clipPointAFound = false;
+ var clipPointBFound = false;
+
+ // line is vertical
+ if (p1x === p2x) {
+ if (p1y > p2y) {
+ result[0] = p1x;
+ result[1] = topLeftAy;
+ result[2] = p2x;
+ result[3] = bottomLeftBy;
+ return false;
+ } else if (p1y < p2y) {
+ result[0] = p1x;
+ result[1] = bottomLeftAy;
+ result[2] = p2x;
+ result[3] = topLeftBy;
+ return false;
} else {
- return prop.value;
+ //not line, return null;
}
- } else {
- return prop;
- }
-}
-function ease(startProp, endProp, percent, easingFn, propSpec) {
- var type = propSpec != null ? propSpec.type : null;
- if (percent < 0) {
- percent = 0;
- } else if (percent > 1) {
- percent = 1;
}
- var start = getValue(startProp, propSpec);
- var end = getValue(endProp, propSpec);
- if (number$1(start) && number$1(end)) {
- return getEasedValue(type, start, end, percent, easingFn);
- } else if (array(start) && array(end)) {
- var easedArr = [];
- for (var i = 0; i < end.length; i++) {
- var si = start[i];
- var ei = end[i];
- if (si != null && ei != null) {
- var val = getEasedValue(type, si, ei, percent, easingFn);
- easedArr.push(val);
+ // line is horizontal
+ else if (p1y === p2y) {
+ if (p1x > p2x) {
+ result[0] = topLeftAx;
+ result[1] = p1y;
+ result[2] = topRightBx;
+ result[3] = p2y;
+ return false;
+ } else if (p1x < p2x) {
+ result[0] = topRightAx;
+ result[1] = p1y;
+ result[2] = topLeftBx;
+ result[3] = p2y;
+ return false;
} else {
- easedArr.push(ei);
+ //not valid line, return null;
}
- }
- return easedArr;
- }
- return undefined;
-}
-
-function step$1(self, ani, now, isCore) {
- var isEles = !isCore;
- var _p = self._private;
- var ani_p = ani._private;
- var pEasing = ani_p.easing;
- var startTime = ani_p.startTime;
- var cy = isCore ? self : self.cy();
- var style = cy.style();
- if (!ani_p.easingImpl) {
- if (pEasing == null) {
- // use default
- ani_p.easingImpl = easings['linear'];
} else {
- // then define w/ name
- var easingVals;
- if (string(pEasing)) {
- var easingProp = style.parse('transition-timing-function', pEasing);
- easingVals = easingProp.value;
- } else {
- // then assume preparsed array
- easingVals = pEasing;
- }
- var name, args;
- if (string(easingVals)) {
- name = easingVals;
- args = [];
- } else {
- name = easingVals[1];
- args = easingVals.slice(2).map(function (n) {
- return +n;
- });
- }
- if (args.length > 0) {
- // create with args
- if (name === 'spring') {
- args.push(ani_p.duration); // need duration to generate spring
- }
+ //slopes of rectA's and rectB's diagonals
+ var slopeA = rectA.height / rectA.width;
+ var slopeB = rectB.height / rectB.width;
- ani_p.easingImpl = easings[name].apply(null, args);
- } else {
- // static impl by name
- ani_p.easingImpl = easings[name];
+ //slope of line between center of rectA and center of rectB
+ var slopePrime = (p2y - p1y) / (p2x - p1x);
+ var cardinalDirectionA = void 0;
+ var cardinalDirectionB = void 0;
+ var tempPointAx = void 0;
+ var tempPointAy = void 0;
+ var tempPointBx = void 0;
+ var tempPointBy = void 0;
+
+ //determine whether clipping point is the corner of nodeA
+ if (-slopeA === slopePrime) {
+ if (p1x > p2x) {
+ result[0] = bottomLeftAx;
+ result[1] = bottomLeftAy;
+ clipPointAFound = true;
+ } else {
+ result[0] = topRightAx;
+ result[1] = topLeftAy;
+ clipPointAFound = true;
+ }
+ } else if (slopeA === slopePrime) {
+ if (p1x > p2x) {
+ result[0] = topLeftAx;
+ result[1] = topLeftAy;
+ clipPointAFound = true;
+ } else {
+ result[0] = bottomRightAx;
+ result[1] = bottomLeftAy;
+ clipPointAFound = true;
+ }
}
- }
- }
- var easing = ani_p.easingImpl;
- var percent;
- if (ani_p.duration === 0) {
- percent = 1;
- } else {
- percent = (now - startTime) / ani_p.duration;
- }
- if (ani_p.applying) {
- percent = ani_p.progress;
- }
- if (percent < 0) {
- percent = 0;
- } else if (percent > 1) {
- percent = 1;
- }
- if (ani_p.delay == null) {
- // then update
- var startPos = ani_p.startPosition;
- var endPos = ani_p.position;
- if (endPos && isEles && !self.locked()) {
- var newPos = {};
- if (valid(startPos.x, endPos.x)) {
- newPos.x = ease(startPos.x, endPos.x, percent, easing);
+ //determine whether clipping point is the corner of nodeB
+ if (-slopeB === slopePrime) {
+ if (p2x > p1x) {
+ result[2] = bottomLeftBx;
+ result[3] = bottomLeftBy;
+ clipPointBFound = true;
+ } else {
+ result[2] = topRightBx;
+ result[3] = topLeftBy;
+ clipPointBFound = true;
+ }
+ } else if (slopeB === slopePrime) {
+ if (p2x > p1x) {
+ result[2] = topLeftBx;
+ result[3] = topLeftBy;
+ clipPointBFound = true;
+ } else {
+ result[2] = bottomRightBx;
+ result[3] = bottomLeftBy;
+ clipPointBFound = true;
+ }
}
- if (valid(startPos.y, endPos.y)) {
- newPos.y = ease(startPos.y, endPos.y, percent, easing);
+
+ //if both clipping points are corners
+ if (clipPointAFound && clipPointBFound) {
+ return false;
}
- self.position(newPos);
- }
- var startPan = ani_p.startPan;
- var endPan = ani_p.pan;
- var pan = _p.pan;
- var animatingPan = endPan != null && isCore;
- if (animatingPan) {
- if (valid(startPan.x, endPan.x)) {
- pan.x = ease(startPan.x, endPan.x, percent, easing);
+
+ //determine Cardinal Direction of rectangles
+ if (p1x > p2x) {
+ if (p1y > p2y) {
+ cardinalDirectionA = this.getCardinalDirection(slopeA, slopePrime, 4);
+ cardinalDirectionB = this.getCardinalDirection(slopeB, slopePrime, 2);
+ } else {
+ cardinalDirectionA = this.getCardinalDirection(-slopeA, slopePrime, 3);
+ cardinalDirectionB = this.getCardinalDirection(-slopeB, slopePrime, 1);
+ }
+ } else {
+ if (p1y > p2y) {
+ cardinalDirectionA = this.getCardinalDirection(-slopeA, slopePrime, 1);
+ cardinalDirectionB = this.getCardinalDirection(-slopeB, slopePrime, 3);
+ } else {
+ cardinalDirectionA = this.getCardinalDirection(slopeA, slopePrime, 2);
+ cardinalDirectionB = this.getCardinalDirection(slopeB, slopePrime, 4);
+ }
}
- if (valid(startPan.y, endPan.y)) {
- pan.y = ease(startPan.y, endPan.y, percent, easing);
+ //calculate clipping Point if it is not found before
+ if (!clipPointAFound) {
+ switch (cardinalDirectionA) {
+ case 1:
+ tempPointAy = topLeftAy;
+ tempPointAx = p1x + -halfHeightA / slopePrime;
+ result[0] = tempPointAx;
+ result[1] = tempPointAy;
+ break;
+ case 2:
+ tempPointAx = bottomRightAx;
+ tempPointAy = p1y + halfWidthA * slopePrime;
+ result[0] = tempPointAx;
+ result[1] = tempPointAy;
+ break;
+ case 3:
+ tempPointAy = bottomLeftAy;
+ tempPointAx = p1x + halfHeightA / slopePrime;
+ result[0] = tempPointAx;
+ result[1] = tempPointAy;
+ break;
+ case 4:
+ tempPointAx = bottomLeftAx;
+ tempPointAy = p1y + -halfWidthA * slopePrime;
+ result[0] = tempPointAx;
+ result[1] = tempPointAy;
+ break;
+ }
}
- self.emit('pan');
- }
- var startZoom = ani_p.startZoom;
- var endZoom = ani_p.zoom;
- var animatingZoom = endZoom != null && isCore;
- if (animatingZoom) {
- if (valid(startZoom, endZoom)) {
- _p.zoom = bound(_p.minZoom, ease(startZoom, endZoom, percent, easing), _p.maxZoom);
+ if (!clipPointBFound) {
+ switch (cardinalDirectionB) {
+ case 1:
+ tempPointBy = topLeftBy;
+ tempPointBx = p2x + -halfHeightB / slopePrime;
+ result[2] = tempPointBx;
+ result[3] = tempPointBy;
+ break;
+ case 2:
+ tempPointBx = bottomRightBx;
+ tempPointBy = p2y + halfWidthB * slopePrime;
+ result[2] = tempPointBx;
+ result[3] = tempPointBy;
+ break;
+ case 3:
+ tempPointBy = bottomLeftBy;
+ tempPointBx = p2x + halfHeightB / slopePrime;
+ result[2] = tempPointBx;
+ result[3] = tempPointBy;
+ break;
+ case 4:
+ tempPointBx = bottomLeftBx;
+ tempPointBy = p2y + -halfWidthB * slopePrime;
+ result[2] = tempPointBx;
+ result[3] = tempPointBy;
+ break;
+ }
}
- self.emit('zoom');
- }
- if (animatingPan || animatingZoom) {
- self.emit('viewport');
}
- var props = ani_p.style;
- if (props && props.length > 0 && isEles) {
- for (var i = 0; i < props.length; i++) {
- var prop = props[i];
- var _name = prop.name;
- var end = prop;
- var start = ani_p.startStyle[_name];
- var propSpec = style.properties[start.name];
- var easedVal = ease(start, end, percent, easing, propSpec);
- style.overrideBypass(self, _name, easedVal);
- } // for props
+ return false;
+};
- self.emit('style');
- } // if
+/**
+ * This method returns in which cardinal direction does input point stays
+ * 1: North
+ * 2: East
+ * 3: South
+ * 4: West
+ */
+IGeometry.getCardinalDirection = function (slope, slopePrime, line) {
+ if (slope > slopePrime) {
+ return line;
+ } else {
+ return 1 + line % 4;
}
+};
- ani_p.progress = percent;
- return percent;
-}
-function valid(start, end) {
- if (start == null || end == null) {
- return false;
+/**
+ * This method calculates the intersection of the two lines defined by
+ * point pairs (s1,s2) and (f1,f2).
+ */
+IGeometry.getIntersection = function (s1, s2, f1, f2) {
+ if (f2 == null) {
+ return this.getIntersection2(s1, s2, f1);
}
- if (number$1(start) && number$1(end)) {
- return true;
- } else if (start && end) {
- return true;
+
+ var x1 = s1.x;
+ var y1 = s1.y;
+ var x2 = s2.x;
+ var y2 = s2.y;
+ var x3 = f1.x;
+ var y3 = f1.y;
+ var x4 = f2.x;
+ var y4 = f2.y;
+ var x = void 0,
+ y = void 0; // intersection point
+ var a1 = void 0,
+ a2 = void 0,
+ b1 = void 0,
+ b2 = void 0,
+ c1 = void 0,
+ c2 = void 0; // coefficients of line eqns.
+ var denom = void 0;
+
+ a1 = y2 - y1;
+ b1 = x1 - x2;
+ c1 = x2 * y1 - x1 * y2; // { a1*x + b1*y + c1 = 0 is line 1 }
+
+ a2 = y4 - y3;
+ b2 = x3 - x4;
+ c2 = x4 * y3 - x3 * y4; // { a2*x + b2*y + c2 = 0 is line 2 }
+
+ denom = a1 * b2 - a2 * b1;
+
+ if (denom === 0) {
+ return null;
}
- return false;
-}
-function startAnimation(self, ani, now, isCore) {
- var ani_p = ani._private;
- ani_p.started = true;
- ani_p.startTime = now - ani_p.progress * ani_p.duration;
-}
+ x = (b1 * c2 - b2 * c1) / denom;
+ y = (a2 * c1 - a1 * c2) / denom;
-function stepAll(now, cy) {
- var eles = cy._private.aniEles;
- var doneEles = [];
- function stepOne(ele, isCore) {
- var _p = ele._private;
- var current = _p.animation.current;
- var queue = _p.animation.queue;
- var ranAnis = false;
+ return new Point(x, y);
+};
- // if nothing currently animating, get something from the queue
- if (current.length === 0) {
- var next = queue.shift();
- if (next) {
- current.push(next);
- }
- }
- var callbacks = function callbacks(_callbacks) {
- for (var j = _callbacks.length - 1; j >= 0; j--) {
- var cb = _callbacks[j];
- cb();
- }
- _callbacks.splice(0, _callbacks.length);
- };
+/**
+ * This method finds and returns the angle of the vector from the + x-axis
+ * in clockwise direction (compatible w/ Java coordinate system!).
+ */
+IGeometry.angleOfVector = function (Cx, Cy, Nx, Ny) {
+ var C_angle = void 0;
- // step and remove if done
- for (var i = current.length - 1; i >= 0; i--) {
- var ani = current[i];
- var ani_p = ani._private;
- if (ani_p.stopped) {
- current.splice(i, 1);
- ani_p.hooked = false;
- ani_p.playing = false;
- ani_p.started = false;
- callbacks(ani_p.frames);
- continue;
- }
- if (!ani_p.playing && !ani_p.applying) {
- continue;
- }
+ if (Cx !== Nx) {
+ C_angle = Math.atan((Ny - Cy) / (Nx - Cx));
- // an apply() while playing shouldn't do anything
- if (ani_p.playing && ani_p.applying) {
- ani_p.applying = false;
- }
- if (!ani_p.started) {
- startAnimation(ele, ani, now);
- }
- step$1(ele, ani, now, isCore);
- if (ani_p.applying) {
- ani_p.applying = false;
- }
- callbacks(ani_p.frames);
- if (ani_p.step != null) {
- ani_p.step(now);
- }
- if (ani.completed()) {
- current.splice(i, 1);
- ani_p.hooked = false;
- ani_p.playing = false;
- ani_p.started = false;
- callbacks(ani_p.completes);
- }
- ranAnis = true;
- }
- if (!isCore && current.length === 0 && queue.length === 0) {
- doneEles.push(ele);
+ if (Nx < Cx) {
+ C_angle += Math.PI;
+ } else if (Ny < Cy) {
+ C_angle += this.TWO_PI;
}
- return ranAnis;
- } // stepElement
+ } else if (Ny < Cy) {
+ C_angle = this.ONE_AND_HALF_PI; // 270 degrees
+ } else {
+ C_angle = this.HALF_PI; // 90 degrees
+ }
- // handle all eles
- var ranEleAni = false;
- for (var e = 0; e < eles.length; e++) {
- var ele = eles[e];
- var handledThisEle = stepOne(ele);
- ranEleAni = ranEleAni || handledThisEle;
- } // each element
+ return C_angle;
+};
- var ranCoreAni = stepOne(cy, true);
+/**
+ * This method checks whether the given two line segments (one with point
+ * p1 and p2, the other with point p3 and p4) intersect at a point other
+ * than these points.
+ */
+IGeometry.doIntersect = function (p1, p2, p3, p4) {
+ var a = p1.x;
+ var b = p1.y;
+ var c = p2.x;
+ var d = p2.y;
+ var p = p3.x;
+ var q = p3.y;
+ var r = p4.x;
+ var s = p4.y;
+ var det = (c - a) * (s - q) - (r - p) * (d - b);
- // notify renderer
- if (ranEleAni || ranCoreAni) {
- if (eles.length > 0) {
- cy.notify('draw', eles);
- } else {
- cy.notify('draw');
- }
+ if (det === 0) {
+ return false;
+ } else {
+ var lambda = ((s - q) * (r - a) + (p - r) * (s - b)) / det;
+ var gamma = ((b - d) * (r - a) + (c - a) * (s - b)) / det;
+ return 0 < lambda && lambda < 1 && 0 < gamma && gamma < 1;
}
+};
- // remove elements from list of currently animating if its queues are empty
- eles.unmerge(doneEles);
- cy.emit('step');
-} // stepAll
+/**
+ * This method checks and calculates the intersection of
+ * a line segment and a circle.
+ */
+IGeometry.findCircleLineIntersections = function (Ex, Ey, Lx, Ly, Cx, Cy, r) {
-var corefn$8 = {
- // pull in animation functions
- animate: define.animate(),
- animation: define.animation(),
- animated: define.animated(),
- clearQueue: define.clearQueue(),
- delay: define.delay(),
- delayAnimation: define.delayAnimation(),
- stop: define.stop(),
- addToAnimationPool: function addToAnimationPool(eles) {
- var cy = this;
- if (!cy.styleEnabled()) {
- return;
- } // save cycles when no style used
+ // E is the starting point of the ray,
+ // L is the end point of the ray,
+ // C is the center of sphere you're testing against
+ // r is the radius of that sphere
- cy._private.aniEles.merge(eles);
- },
- stopAnimationLoop: function stopAnimationLoop() {
- this._private.animationsRunning = false;
- },
- startAnimationLoop: function startAnimationLoop() {
- var cy = this;
- cy._private.animationsRunning = true;
- if (!cy.styleEnabled()) {
- return;
- } // save cycles when no style used
+ // Compute:
+ // d = L - E ( Direction vector of ray, from start to end )
+ // f = E - C ( Vector from center sphere to ray start )
- // NB the animation loop will exec in headless environments if style enabled
- // and explicit cy.destroy() is necessary to stop the loop
+ // Then the intersection is found by..
+ // P = E + t * d
+ // This is a parametric equation:
+ // Px = Ex + tdx
+ // Py = Ey + tdy
- function headlessStep() {
- if (!cy._private.animationsRunning) {
- return;
- }
- requestAnimationFrame(function animationStep(now) {
- stepAll(now, cy);
- headlessStep();
- });
- }
- var renderer = cy.renderer();
- if (renderer && renderer.beforeRender) {
- // let the renderer schedule animations
- renderer.beforeRender(function rendererAnimationStep(willDraw, now) {
- stepAll(now, cy);
- }, renderer.beforeRenderPriorities.animations);
- } else {
- // manage the animation loop ourselves
- headlessStep(); // first call
- }
- }
-};
+ // get a, b, c values
+ var a = (Lx - Ex) * (Lx - Ex) + (Ly - Ey) * (Ly - Ey);
+ var b = 2 * ((Ex - Cx) * (Lx - Ex) + (Ey - Cy) * (Ly - Ey));
+ var c = (Ex - Cx) * (Ex - Cx) + (Ey - Cy) * (Ey - Cy) - r * r;
-var emitterOptions = {
- qualifierCompare: function qualifierCompare(selector1, selector2) {
- if (selector1 == null || selector2 == null) {
- return selector1 == null && selector2 == null;
- } else {
- return selector1.sameText(selector2);
+ // get discriminant
+ var disc = b * b - 4 * a * c;
+ if (disc >= 0) {
+ // insert into quadratic formula
+ var t1 = (-b + Math.sqrt(b * b - 4 * a * c)) / (2 * a);
+ var t2 = (-b - Math.sqrt(b * b - 4 * a * c)) / (2 * a);
+ var intersections = null;
+ if (t1 >= 0 && t1 <= 1) {
+ // t1 is the intersection, and it's closer than t2
+ // (since t1 uses -b - discriminant)
+ // Impale, Poke
+ return [t1];
}
- },
- eventMatches: function eventMatches(cy, listener, eventObj) {
- var selector = listener.qualifier;
- if (selector != null) {
- return cy !== eventObj.target && element(eventObj.target) && selector.matches(eventObj.target);
+
+ // here t1 didn't intersect so we are either started
+ // inside the sphere or completely past it
+ if (t2 >= 0 && t2 <= 1) {
+ // ExitWound
+ return [t2];
}
- return true;
- },
- addEventFields: function addEventFields(cy, evt) {
- evt.cy = cy;
- evt.target = cy;
- },
- callbackContext: function callbackContext(cy, listener, eventObj) {
- return listener.qualifier != null ? eventObj.target : cy;
- }
+
+ return intersections;
+ } else return null;
};
-var argSelector = function argSelector(arg) {
- if (string(arg)) {
- return new Selector(arg);
+
+// -----------------------------------------------------------------------------
+// Section: Class Constants
+// -----------------------------------------------------------------------------
+/**
+ * Some useful pre-calculated constants
+ */
+IGeometry.HALF_PI = 0.5 * Math.PI;
+IGeometry.ONE_AND_HALF_PI = 1.5 * Math.PI;
+IGeometry.TWO_PI = 2.0 * Math.PI;
+IGeometry.THREE_PI = 3.0 * Math.PI;
+
+module.exports = IGeometry;
+
+/***/ }),
+/* 9 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function IMath() {}
+
+/**
+ * This method returns the sign of the input value.
+ */
+IMath.sign = function (value) {
+ if (value > 0) {
+ return 1;
+ } else if (value < 0) {
+ return -1;
} else {
- return arg;
+ return 0;
}
};
-var elesfn = {
- createEmitter: function createEmitter() {
- var _p = this._private;
- if (!_p.emitter) {
- _p.emitter = new Emitter(emitterOptions, this);
- }
- return this;
- },
- emitter: function emitter() {
- return this._private.emitter;
- },
- on: function on(events, selector, callback) {
- this.emitter().on(events, argSelector(selector), callback);
- return this;
- },
- removeListener: function removeListener(events, selector, callback) {
- this.emitter().removeListener(events, argSelector(selector), callback);
- return this;
- },
- removeAllListeners: function removeAllListeners() {
- this.emitter().removeAllListeners();
- return this;
- },
- one: function one(events, selector, callback) {
- this.emitter().one(events, argSelector(selector), callback);
- return this;
- },
- once: function once(events, selector, callback) {
- this.emitter().one(events, argSelector(selector), callback);
- return this;
- },
- emit: function emit(events, extraParams) {
- this.emitter().emit(events, extraParams);
- return this;
- },
- emitAndNotify: function emitAndNotify(event, eles) {
- this.emit(event);
- this.notify(event, eles);
- return this;
- }
-};
-define.eventAliasesOn(elesfn);
-var corefn$7 = {
- png: function png(options) {
- var renderer = this._private.renderer;
- options = options || {};
- return renderer.png(options);
- },
- jpg: function jpg(options) {
- var renderer = this._private.renderer;
- options = options || {};
- options.bg = options.bg || '#fff';
- return renderer.jpg(options);
- }
+IMath.floor = function (value) {
+ return value < 0 ? Math.ceil(value) : Math.floor(value);
};
-corefn$7.jpeg = corefn$7.jpg;
-var corefn$6 = {
- layout: function layout(options) {
- var cy = this;
- if (options == null) {
- error('Layout options must be specified to make a layout');
- return;
- }
- if (options.name == null) {
- error('A `name` must be specified to make a layout');
- return;
- }
- var name = options.name;
- var Layout = cy.extension('layout', name);
- if (Layout == null) {
- error('No such layout `' + name + '` found. Did you forget to import it and `cytoscape.use()` it?');
- return;
- }
- var eles;
- if (string(options.eles)) {
- eles = cy.$(options.eles);
- } else {
- eles = options.eles != null ? options.eles : cy.$();
- }
- var layout = new Layout(extend({}, options, {
- cy: cy,
- eles: eles
- }));
- return layout;
- }
+IMath.ceil = function (value) {
+ return value < 0 ? Math.floor(value) : Math.ceil(value);
};
-corefn$6.createLayout = corefn$6.makeLayout = corefn$6.layout;
-var corefn$5 = {
- notify: function notify(eventName, eventEles) {
- var _p = this._private;
- if (this.batching()) {
- _p.batchNotifications = _p.batchNotifications || {};
- var eles = _p.batchNotifications[eventName] = _p.batchNotifications[eventName] || this.collection();
- if (eventEles != null) {
- eles.merge(eventEles);
- }
- return; // notifications are disabled during batching
- }
+module.exports = IMath;
- if (!_p.notificationsEnabled) {
- return;
- } // exit on disabled
+/***/ }),
+/* 10 */
+/***/ (function(module, exports, __webpack_require__) {
- var renderer = this.renderer();
+"use strict";
- // exit if destroy() called on core or renderer in between frames #1499 #1528
- if (this.destroyed() || !renderer) {
- return;
- }
- renderer.notify(eventName, eventEles);
- },
- notifications: function notifications(bool) {
- var p = this._private;
- if (bool === undefined) {
- return p.notificationsEnabled;
- } else {
- p.notificationsEnabled = bool ? true : false;
- }
- return this;
- },
- noNotifications: function noNotifications(callback) {
- this.notifications(false);
- callback();
- this.notifications(true);
- },
- batching: function batching() {
- return this._private.batchCount > 0;
- },
- startBatch: function startBatch() {
- var _p = this._private;
- if (_p.batchCount == null) {
- _p.batchCount = 0;
- }
- if (_p.batchCount === 0) {
- _p.batchStyleEles = this.collection();
- _p.batchNotifications = {};
- }
- _p.batchCount++;
- return this;
- },
- endBatch: function endBatch() {
- var _p = this._private;
- if (_p.batchCount === 0) {
- return this;
- }
- _p.batchCount--;
- if (_p.batchCount === 0) {
- // update style for dirty eles
- _p.batchStyleEles.updateStyle();
- var renderer = this.renderer();
- // notify the renderer of queued eles and event types
- Object.keys(_p.batchNotifications).forEach(function (eventName) {
- var eles = _p.batchNotifications[eventName];
- if (eles.empty()) {
- renderer.notify(eventName);
- } else {
- renderer.notify(eventName, eles);
- }
- });
- }
- return this;
- },
- batch: function batch(callback) {
- this.startBatch();
- callback();
- this.endBatch();
- return this;
- },
- // for backwards compatibility
- batchData: function batchData(map) {
- var cy = this;
- return this.batch(function () {
- var ids = Object.keys(map);
- for (var i = 0; i < ids.length; i++) {
- var id = ids[i];
- var data = map[id];
- var ele = cy.getElementById(id);
- ele.data(data);
- }
- });
- }
-};
+function Integer() {}
-var rendererDefaults = defaults$g({
- hideEdgesOnViewport: false,
- textureOnViewport: false,
- motionBlur: false,
- motionBlurOpacity: 0.05,
- pixelRatio: undefined,
- desktopTapThreshold: 4,
- touchTapThreshold: 8,
- wheelSensitivity: 1,
- debug: false,
- showFps: false
-});
-var corefn$4 = {
- renderTo: function renderTo(context, zoom, pan, pxRatio) {
- var r = this._private.renderer;
- r.renderTo(context, zoom, pan, pxRatio);
- return this;
- },
- renderer: function renderer() {
- return this._private.renderer;
- },
- forceRender: function forceRender() {
- this.notify('draw');
- return this;
- },
- resize: function resize() {
- this.invalidateSize();
- this.emitAndNotify('resize');
- return this;
- },
- initRenderer: function initRenderer(options) {
- var cy = this;
- var RendererProto = cy.extension('renderer', options.name);
- if (RendererProto == null) {
- error("Can not initialise: No such renderer `".concat(options.name, "` found. Did you forget to import it and `cytoscape.use()` it?"));
- return;
- }
- if (options.wheelSensitivity !== undefined) {
- warn("You have set a custom wheel sensitivity. This will make your app zoom unnaturally when using mainstream mice. You should change this value from the default only if you can guarantee that all your users will use the same hardware and OS configuration as your current machine.");
- }
- var rOpts = rendererDefaults(options);
- rOpts.cy = cy;
- cy._private.renderer = new RendererProto(rOpts);
- this.notify('init');
- },
- destroyRenderer: function destroyRenderer() {
- var cy = this;
- cy.notify('destroy'); // destroy the renderer
+Integer.MAX_VALUE = 2147483647;
+Integer.MIN_VALUE = -2147483648;
- var domEle = cy.container();
- if (domEle) {
- domEle._cyreg = null;
- while (domEle.childNodes.length > 0) {
- domEle.removeChild(domEle.childNodes[0]);
- }
- }
- cy._private.renderer = null; // to be extra safe, remove the ref
- cy.mutableElements().forEach(function (ele) {
- var _p = ele._private;
- _p.rscratch = {};
- _p.rstyle = {};
- _p.animation.current = [];
- _p.animation.queue = [];
- });
- },
- onRender: function onRender(fn) {
- return this.on('render', fn);
- },
- offRender: function offRender(fn) {
- return this.off('render', fn);
- }
-};
-corefn$4.invalidateDimensions = corefn$4.resize;
+module.exports = Integer;
-var corefn$3 = {
- // get a collection
- // - empty collection on no args
- // - collection of elements in the graph on selector arg
- // - guarantee a returned collection when elements or collection specified
- collection: function collection(eles, opts) {
- if (string(eles)) {
- return this.$(eles);
- } else if (elementOrCollection(eles)) {
- return eles.collection();
- } else if (array(eles)) {
- if (!opts) {
- opts = {};
- }
- return new Collection(this, eles, opts.unique, opts.removed);
- }
- return new Collection(this);
- },
- nodes: function nodes(selector) {
- var nodes = this.$(function (ele) {
- return ele.isNode();
- });
- if (selector) {
- return nodes.filter(selector);
- }
- return nodes;
- },
- edges: function edges(selector) {
- var edges = this.$(function (ele) {
- return ele.isEdge();
- });
- if (selector) {
- return edges.filter(selector);
- }
- return edges;
- },
- // search the graph like jQuery
- $: function $(selector) {
- var eles = this._private.elements;
- if (selector) {
- return eles.filter(selector);
- } else {
- return eles.spawnSelf();
- }
- },
- mutableElements: function mutableElements() {
- return this._private.elements;
- }
-};
+/***/ }),
+/* 11 */
+/***/ (function(module, exports, __webpack_require__) {
-// aliases
-corefn$3.elements = corefn$3.filter = corefn$3.$;
+"use strict";
-var styfn$8 = {};
-// keys for style blocks, e.g. ttfftt
-var TRUE = 't';
-var FALSE = 'f';
+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; }; }();
-// (potentially expensive calculation)
-// apply the style to the element based on
-// - its bypass
-// - what selectors match it
-styfn$8.apply = function (eles) {
- var self = this;
- var _p = self._private;
- var cy = _p.cy;
- var updatedEles = cy.collection();
- for (var ie = 0; ie < eles.length; ie++) {
- var ele = eles[ie];
- var cxtMeta = self.getContextMeta(ele);
- if (cxtMeta.empty) {
- continue;
- }
- var cxtStyle = self.getContextStyle(cxtMeta);
- var app = self.applyContextStyle(cxtMeta, cxtStyle, ele);
- if (ele._private.appliedInitStyle) {
- self.updateTransitions(ele, app.diffProps);
- } else {
- ele._private.appliedInitStyle = true;
- }
- var hintsDiff = self.updateStyleHints(ele);
- if (hintsDiff) {
- updatedEles.push(ele);
- }
- } // for elements
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
- return updatedEles;
+var nodeFrom = function nodeFrom(value) {
+ return { value: value, next: null, prev: null };
};
-styfn$8.getPropertiesDiff = function (oldCxtKey, newCxtKey) {
- var self = this;
- var cache = self._private.propDiffs = self._private.propDiffs || {};
- var dualCxtKey = oldCxtKey + '-' + newCxtKey;
- var cachedVal = cache[dualCxtKey];
- if (cachedVal) {
- return cachedVal;
- }
- var diffProps = [];
- var addedProp = {};
- for (var i = 0; i < self.length; i++) {
- var cxt = self[i];
- var oldHasCxt = oldCxtKey[i] === TRUE;
- var newHasCxt = newCxtKey[i] === TRUE;
- var cxtHasDiffed = oldHasCxt !== newHasCxt;
- var cxtHasMappedProps = cxt.mappedProperties.length > 0;
- if (cxtHasDiffed || newHasCxt && cxtHasMappedProps) {
- var props = void 0;
- if (cxtHasDiffed && cxtHasMappedProps) {
- props = cxt.properties; // suffices b/c mappedProperties is a subset of properties
- } else if (cxtHasDiffed) {
- props = cxt.properties; // need to check them all
- } else if (cxtHasMappedProps) {
- props = cxt.mappedProperties; // only need to check mapped
- }
- for (var j = 0; j < props.length; j++) {
- var prop = props[j];
- var name = prop.name;
+var add = function add(prev, node, next, list) {
+ if (prev !== null) {
+ prev.next = node;
+ } else {
+ list.head = node;
+ }
- // if a later context overrides this property, then the fact that this context has switched/diffed doesn't matter
- // (semi expensive check since it makes this function O(n^2) on context length, but worth it since overall result
- // is cached)
- var laterCxtOverrides = false;
- for (var k = i + 1; k < self.length; k++) {
- var laterCxt = self[k];
- var hasLaterCxt = newCxtKey[k] === TRUE;
- if (!hasLaterCxt) {
- continue;
- } // can't override unless the context is active
+ if (next !== null) {
+ next.prev = node;
+ } else {
+ list.tail = node;
+ }
- laterCxtOverrides = laterCxt.properties[prop.name] != null;
- if (laterCxtOverrides) {
- break;
- } // exit early as long as one later context overrides
- }
+ node.prev = prev;
+ node.next = next;
- if (!addedProp[name] && !laterCxtOverrides) {
- addedProp[name] = true;
- diffProps.push(name);
- }
- } // for props
- } // if
- } // for contexts
+ list.length++;
- cache[dualCxtKey] = diffProps;
- return diffProps;
+ return node;
};
-styfn$8.getContextMeta = function (ele) {
- var self = this;
- var cxtKey = '';
- var diffProps;
- var prevKey = ele._private.styleCxtKey || '';
- // get the cxt key
- for (var i = 0; i < self.length; i++) {
- var context = self[i];
- var contextSelectorMatches = context.selector && context.selector.matches(ele); // NB: context.selector may be null for 'core'
+var _remove = function _remove(node, list) {
+ var prev = node.prev,
+ next = node.next;
- if (contextSelectorMatches) {
- cxtKey += TRUE;
- } else {
- cxtKey += FALSE;
- }
- } // for context
- diffProps = self.getPropertiesDiff(prevKey, cxtKey);
- ele._private.styleCxtKey = cxtKey;
- return {
- key: cxtKey,
- diffPropNames: diffProps,
- empty: diffProps.length === 0
- };
+ if (prev !== null) {
+ prev.next = next;
+ } else {
+ list.head = next;
+ }
+
+ if (next !== null) {
+ next.prev = prev;
+ } else {
+ list.tail = prev;
+ }
+
+ node.prev = node.next = null;
+
+ list.length--;
+
+ return node;
};
-// gets a computed ele style object based on matched contexts
-styfn$8.getContextStyle = function (cxtMeta) {
- var cxtKey = cxtMeta.key;
- var self = this;
- var cxtStyles = this._private.contextStyles = this._private.contextStyles || {};
+var LinkedList = function () {
+ function LinkedList(vals) {
+ var _this = this;
- // if already computed style, returned cached copy
- if (cxtStyles[cxtKey]) {
- return cxtStyles[cxtKey];
- }
- var style = {
- _private: {
- key: cxtKey
- }
- };
- for (var i = 0; i < self.length; i++) {
- var cxt = self[i];
- var hasCxt = cxtKey[i] === TRUE;
- if (!hasCxt) {
- continue;
- }
- for (var j = 0; j < cxt.properties.length; j++) {
- var prop = cxt.properties[j];
- style[prop.name] = prop;
+ _classCallCheck(this, LinkedList);
+
+ this.length = 0;
+ this.head = null;
+ this.tail = null;
+
+ if (vals != null) {
+ vals.forEach(function (v) {
+ return _this.push(v);
+ });
}
}
- cxtStyles[cxtKey] = style;
- return style;
-};
-styfn$8.applyContextStyle = function (cxtMeta, cxtStyle, ele) {
- var self = this;
- var diffProps = cxtMeta.diffPropNames;
- var retDiffProps = {};
- var types = self.types;
- for (var i = 0; i < diffProps.length; i++) {
- var diffPropName = diffProps[i];
- var cxtProp = cxtStyle[diffPropName];
- var eleProp = ele.pstyle(diffPropName);
- if (!cxtProp) {
- // no context prop means delete
- if (!eleProp) {
- continue; // no existing prop means nothing needs to be removed
- // nb affects initial application on mapped values like control-point-distances
- } else if (eleProp.bypass) {
- cxtProp = {
- name: diffPropName,
- deleteBypassed: true
- };
- } else {
- cxtProp = {
- name: diffPropName,
- "delete": true
- };
- }
- }
- // save cycles when the context prop doesn't need to be applied
- if (eleProp === cxtProp) {
- continue;
+ _createClass(LinkedList, [{
+ key: "size",
+ value: function size() {
+ return this.length;
}
-
- // save cycles when a mapped context prop doesn't need to be applied
- if (cxtProp.mapped === types.fn // context prop is function mapper
- && eleProp != null // some props can be null even by default (e.g. a prop that overrides another one)
- && eleProp.mapping != null // ele prop is a concrete value from from a mapper
- && eleProp.mapping.value === cxtProp.value // the current prop on the ele is a flat prop value for the function mapper
- ) {
- // NB don't write to cxtProp, as it's shared among eles (stored in stylesheet)
- var mapping = eleProp.mapping; // can write to mapping, as it's a per-ele copy
- var fnValue = mapping.fnValue = cxtProp.value(ele); // temporarily cache the value in case of a miss
-
- if (fnValue === mapping.prevFnValue) {
- continue;
- }
+ }, {
+ key: "insertBefore",
+ value: function insertBefore(val, otherNode) {
+ return add(otherNode.prev, nodeFrom(val), otherNode, this);
}
- var retDiffProp = retDiffProps[diffPropName] = {
- prev: eleProp
- };
- self.applyParsedProperty(ele, cxtProp);
- retDiffProp.next = ele.pstyle(diffPropName);
- if (retDiffProp.next && retDiffProp.next.bypass) {
- retDiffProp.next = retDiffProp.next.bypassed;
+ }, {
+ key: "insertAfter",
+ value: function insertAfter(val, otherNode) {
+ return add(otherNode, nodeFrom(val), otherNode.next, this);
}
- }
- return {
- diffProps: retDiffProps
- };
-};
-styfn$8.updateStyleHints = function (ele) {
- var _p = ele._private;
- var self = this;
- var propNames = self.propertyGroupNames;
- var propGrKeys = self.propertyGroupKeys;
- var propHash = function propHash(ele, propNames, seedKey) {
- return self.getPropertiesHash(ele, propNames, seedKey);
- };
- var oldStyleKey = _p.styleKey;
- if (ele.removed()) {
- return false;
- }
- var isNode = _p.group === 'nodes';
-
- // get the style key hashes per prop group
- // but lazily -- only use non-default prop values to reduce the number of hashes
- //
-
- var overriddenStyles = ele._private.style;
- propNames = Object.keys(overriddenStyles);
- for (var i = 0; i < propGrKeys.length; i++) {
- var grKey = propGrKeys[i];
- _p.styleKeys[grKey] = [DEFAULT_HASH_SEED, DEFAULT_HASH_SEED_ALT];
- }
- var updateGrKey1 = function updateGrKey1(val, grKey) {
- return _p.styleKeys[grKey][0] = hashInt(val, _p.styleKeys[grKey][0]);
- };
- var updateGrKey2 = function updateGrKey2(val, grKey) {
- return _p.styleKeys[grKey][1] = hashIntAlt(val, _p.styleKeys[grKey][1]);
- };
- var updateGrKey = function updateGrKey(val, grKey) {
- updateGrKey1(val, grKey);
- updateGrKey2(val, grKey);
- };
- var updateGrKeyWStr = function updateGrKeyWStr(strVal, grKey) {
- for (var j = 0; j < strVal.length; j++) {
- var ch = strVal.charCodeAt(j);
- updateGrKey1(ch, grKey);
- updateGrKey2(ch, grKey);
+ }, {
+ key: "insertNodeBefore",
+ value: function insertNodeBefore(newNode, otherNode) {
+ return add(otherNode.prev, newNode, otherNode, this);
}
- };
-
- // - hashing works on 32 bit ints b/c we use bitwise ops
- // - small numbers get cut off (e.g. 0.123 is seen as 0 by the hashing function)
- // - raise up small numbers so more significant digits are seen by hashing
- // - make small numbers larger than a normal value to avoid collisions
- // - works in practice and it's relatively cheap
- var N = 2000000000;
- var cleanNum = function cleanNum(val) {
- return -128 < val && val < 128 && Math.floor(val) !== val ? N - (val * 1024 | 0) : val;
- };
- for (var _i = 0; _i < propNames.length; _i++) {
- var name = propNames[_i];
- var parsedProp = overriddenStyles[name];
- if (parsedProp == null) {
- continue;
+ }, {
+ key: "insertNodeAfter",
+ value: function insertNodeAfter(newNode, otherNode) {
+ return add(otherNode, newNode, otherNode.next, this);
}
- var propInfo = this.properties[name];
- var type = propInfo.type;
- var _grKey = propInfo.groupKey;
- var normalizedNumberVal = void 0;
- if (propInfo.hashOverride != null) {
- normalizedNumberVal = propInfo.hashOverride(ele, parsedProp);
- } else if (parsedProp.pfValue != null) {
- normalizedNumberVal = parsedProp.pfValue;
+ }, {
+ key: "push",
+ value: function push(val) {
+ return add(this.tail, nodeFrom(val), null, this);
}
-
- // might not be a number if it allows enums
- var numberVal = propInfo.enums == null ? parsedProp.value : null;
- var haveNormNum = normalizedNumberVal != null;
- var haveUnitedNum = numberVal != null;
- var haveNum = haveNormNum || haveUnitedNum;
- var units = parsedProp.units;
-
- // numbers are cheaper to hash than strings
- // 1 hash op vs n hash ops (for length n string)
- if (type.number && haveNum && !type.multiple) {
- var v = haveNormNum ? normalizedNumberVal : numberVal;
- updateGrKey(cleanNum(v), _grKey);
- if (!haveNormNum && units != null) {
- updateGrKeyWStr(units, _grKey);
+ }, {
+ key: "unshift",
+ value: function unshift(val) {
+ return add(null, nodeFrom(val), this.head, this);
+ }
+ }, {
+ key: "remove",
+ value: function remove(node) {
+ return _remove(node, this);
+ }
+ }, {
+ key: "pop",
+ value: function pop() {
+ return _remove(this.tail, this).value;
+ }
+ }, {
+ key: "popNode",
+ value: function popNode() {
+ return _remove(this.tail, this);
+ }
+ }, {
+ key: "shift",
+ value: function shift() {
+ return _remove(this.head, this).value;
+ }
+ }, {
+ key: "shiftNode",
+ value: function shiftNode() {
+ return _remove(this.head, this);
+ }
+ }, {
+ key: "get_object_at",
+ value: function get_object_at(index) {
+ if (index <= this.length()) {
+ var i = 1;
+ var current = this.head;
+ while (i < index) {
+ current = current.next;
+ i++;
+ }
+ return current.value;
}
- } else {
- updateGrKeyWStr(parsedProp.strValue, _grKey);
}
- }
+ }, {
+ key: "set_object_at",
+ value: function set_object_at(index, value) {
+ if (index <= this.length()) {
+ var i = 1;
+ var current = this.head;
+ while (i < index) {
+ current = current.next;
+ i++;
+ }
+ current.value = value;
+ }
+ }
+ }]);
- // overall style key
- //
+ return LinkedList;
+}();
- var hash = [DEFAULT_HASH_SEED, DEFAULT_HASH_SEED_ALT];
- for (var _i2 = 0; _i2 < propGrKeys.length; _i2++) {
- var _grKey2 = propGrKeys[_i2];
- var grHash = _p.styleKeys[_grKey2];
- hash[0] = hashInt(grHash[0], hash[0]);
- hash[1] = hashIntAlt(grHash[1], hash[1]);
- }
- _p.styleKey = combineHashes(hash[0], hash[1]);
+module.exports = LinkedList;
- // label dims
- //
+/***/ }),
+/* 12 */
+/***/ (function(module, exports, __webpack_require__) {
- var sk = _p.styleKeys;
- _p.labelDimsKey = combineHashesArray(sk.labelDimensions);
- var labelKeys = propHash(ele, ['label'], sk.labelDimensions);
- _p.labelKey = combineHashesArray(labelKeys);
- _p.labelStyleKey = combineHashesArray(hashArrays(sk.commonLabel, labelKeys));
- if (!isNode) {
- var sourceLabelKeys = propHash(ele, ['source-label'], sk.labelDimensions);
- _p.sourceLabelKey = combineHashesArray(sourceLabelKeys);
- _p.sourceLabelStyleKey = combineHashesArray(hashArrays(sk.commonLabel, sourceLabelKeys));
- var targetLabelKeys = propHash(ele, ['target-label'], sk.labelDimensions);
- _p.targetLabelKey = combineHashesArray(targetLabelKeys);
- _p.targetLabelStyleKey = combineHashesArray(hashArrays(sk.commonLabel, targetLabelKeys));
- }
+"use strict";
- // node
- //
- if (isNode) {
- var _p$styleKeys = _p.styleKeys,
- nodeBody = _p$styleKeys.nodeBody,
- nodeBorder = _p$styleKeys.nodeBorder,
- backgroundImage = _p$styleKeys.backgroundImage,
- compound = _p$styleKeys.compound,
- pie = _p$styleKeys.pie;
- var nodeKeys = [nodeBody, nodeBorder, backgroundImage, compound, pie].filter(function (k) {
- return k != null;
- }).reduce(hashArrays, [DEFAULT_HASH_SEED, DEFAULT_HASH_SEED_ALT]);
- _p.nodeKey = combineHashesArray(nodeKeys);
- _p.hasPie = pie != null && pie[0] !== DEFAULT_HASH_SEED && pie[1] !== DEFAULT_HASH_SEED_ALT;
+/*
+ *This class is the javascript implementation of the Point.java class in jdk
+ */
+function Point(x, y, p) {
+ this.x = null;
+ this.y = null;
+ if (x == null && y == null && p == null) {
+ this.x = 0;
+ this.y = 0;
+ } else if (typeof x == 'number' && typeof y == 'number' && p == null) {
+ this.x = x;
+ this.y = y;
+ } else if (x.constructor.name == 'Point' && y == null && p == null) {
+ p = x;
+ this.x = p.x;
+ this.y = p.y;
}
- return oldStyleKey !== _p.styleKey;
-};
-styfn$8.clearStyleHints = function (ele) {
- var _p = ele._private;
- _p.styleCxtKey = '';
- _p.styleKeys = {};
- _p.styleKey = null;
- _p.labelKey = null;
- _p.labelStyleKey = null;
- _p.sourceLabelKey = null;
- _p.sourceLabelStyleKey = null;
- _p.targetLabelKey = null;
- _p.targetLabelStyleKey = null;
- _p.nodeKey = null;
- _p.hasPie = null;
+}
+
+Point.prototype.getX = function () {
+ return this.x;
};
-// apply a property to the style (for internal use)
-// returns whether application was successful
-//
-// now, this function flattens the property, and here's how:
-//
-// for parsedProp:{ bypass: true, deleteBypass: true }
-// no property is generated, instead the bypass property in the
-// element's style is replaced by what's pointed to by the `bypassed`
-// field in the bypass property (i.e. restoring the property the
-// bypass was overriding)
-//
-// for parsedProp:{ mapped: truthy }
-// the generated flattenedProp:{ mapping: prop }
-//
-// for parsedProp:{ bypass: true }
-// the generated flattenedProp:{ bypassed: parsedProp }
-styfn$8.applyParsedProperty = function (ele, parsedProp) {
- var self = this;
- var prop = parsedProp;
- var style = ele._private.style;
- var flatProp;
- var types = self.types;
- var type = self.properties[prop.name].type;
- var propIsBypass = prop.bypass;
- var origProp = style[prop.name];
- var origPropIsBypass = origProp && origProp.bypass;
- var _p = ele._private;
- var flatPropMapping = 'mapping';
- var getVal = function getVal(p) {
- if (p == null) {
- return null;
- } else if (p.pfValue != null) {
- return p.pfValue;
- } else {
- return p.value;
- }
- };
- var checkTriggers = function checkTriggers() {
- var fromVal = getVal(origProp);
- var toVal = getVal(prop);
- self.checkTriggers(ele, prop.name, fromVal, toVal);
- };
- if (prop && prop.name.substr(0, 3) === 'pie') {
- warn('The pie style properties are deprecated. Create charts using background images instead.');
- }
+Point.prototype.getY = function () {
+ return this.y;
+};
- // edge sanity checks to prevent the client from making serious mistakes
- if (parsedProp.name === 'curve-style' && ele.isEdge() && (
- // loops must be bundled beziers
- parsedProp.value !== 'bezier' && ele.isLoop() ||
- // edges connected to compound nodes can not be haystacks
- parsedProp.value === 'haystack' && (ele.source().isParent() || ele.target().isParent()))) {
- prop = parsedProp = this.parse(parsedProp.name, 'bezier', propIsBypass);
- }
- if (prop["delete"]) {
- // delete the property and use the default value on falsey value
- style[prop.name] = undefined;
- checkTriggers();
- return true;
- }
- if (prop.deleteBypassed) {
- // delete the property that the
- if (!origProp) {
- checkTriggers();
- return true; // can't delete if no prop
- } else if (origProp.bypass) {
- // delete bypassed
- origProp.bypassed = undefined;
- checkTriggers();
- return true;
- } else {
- return false; // we're unsuccessful deleting the bypassed
- }
- }
+Point.prototype.getLocation = function () {
+ return new Point(this.x, this.y);
+};
- // check if we need to delete the current bypass
- if (prop.deleteBypass) {
- // then this property is just here to indicate we need to delete
- if (!origProp) {
- checkTriggers();
- return true; // property is already not defined
- } else if (origProp.bypass) {
- // then replace the bypass property with the original
- // because the bypassed property was already applied (and therefore parsed), we can just replace it (no reapplying necessary)
- style[prop.name] = origProp.bypassed;
- checkTriggers();
- return true;
+Point.prototype.setLocation = function (x, y, p) {
+ if (x.constructor.name == 'Point' && y == null && p == null) {
+ p = x;
+ this.setLocation(p.x, p.y);
+ } else if (typeof x == 'number' && typeof y == 'number' && p == null) {
+ //if both parameters are integer just move (x,y) location
+ if (parseInt(x) == x && parseInt(y) == y) {
+ this.move(x, y);
} else {
- return false; // we're unsuccessful deleting the bypass
+ this.x = Math.floor(x + 0.5);
+ this.y = Math.floor(y + 0.5);
}
}
+};
- var printMappingErr = function printMappingErr() {
- warn('Do not assign mappings to elements without corresponding data (i.e. ele `' + ele.id() + '` has no mapping for property `' + prop.name + '` with data field `' + prop.field + '`); try a `[' + prop.field + ']` selector to limit scope to elements with `' + prop.field + '` defined');
- };
+Point.prototype.move = function (x, y) {
+ this.x = x;
+ this.y = y;
+};
- // put the property in the style objects
- switch (prop.mapped) {
- // flatten the property if mapped
- case types.mapData:
- {
- // flatten the field (e.g. data.foo.bar)
- var fields = prop.field.split('.');
- var fieldVal = _p.data;
- for (var i = 0; i < fields.length && fieldVal; i++) {
- var field = fields[i];
- fieldVal = fieldVal[field];
- }
- if (fieldVal == null) {
- printMappingErr();
- return false;
- }
- var percent;
- if (!number$1(fieldVal)) {
- // then don't apply and fall back on the existing style
- warn('Do not use continuous mappers without specifying numeric data (i.e. `' + prop.field + ': ' + fieldVal + '` for `' + ele.id() + '` is non-numeric)');
- return false;
- } else {
- var fieldWidth = prop.fieldMax - prop.fieldMin;
- if (fieldWidth === 0) {
- // safety check -- not strictly necessary as no props of zero range should be passed here
- percent = 0;
- } else {
- percent = (fieldVal - prop.fieldMin) / fieldWidth;
- }
- }
+Point.prototype.translate = function (dx, dy) {
+ this.x += dx;
+ this.y += dy;
+};
- // make sure to bound percent value
- if (percent < 0) {
- percent = 0;
- } else if (percent > 1) {
- percent = 1;
- }
- if (type.color) {
- var r1 = prop.valueMin[0];
- var r2 = prop.valueMax[0];
- var g1 = prop.valueMin[1];
- var g2 = prop.valueMax[1];
- var b1 = prop.valueMin[2];
- var b2 = prop.valueMax[2];
- var a1 = prop.valueMin[3] == null ? 1 : prop.valueMin[3];
- var a2 = prop.valueMax[3] == null ? 1 : prop.valueMax[3];
- var clr = [Math.round(r1 + (r2 - r1) * percent), Math.round(g1 + (g2 - g1) * percent), Math.round(b1 + (b2 - b1) * percent), Math.round(a1 + (a2 - a1) * percent)];
- flatProp = {
- // colours are simple, so just create the flat property instead of expensive string parsing
- bypass: prop.bypass,
- // we're a bypass if the mapping property is a bypass
- name: prop.name,
- value: clr,
- strValue: 'rgb(' + clr[0] + ', ' + clr[1] + ', ' + clr[2] + ')'
- };
- } else if (type.number) {
- var calcValue = prop.valueMin + (prop.valueMax - prop.valueMin) * percent;
- flatProp = this.parse(prop.name, calcValue, prop.bypass, flatPropMapping);
- } else {
- return false; // can only map to colours and numbers
- }
+Point.prototype.equals = function (obj) {
+ if (obj.constructor.name == "Point") {
+ var pt = obj;
+ return this.x == pt.x && this.y == pt.y;
+ }
+ return this == obj;
+};
- if (!flatProp) {
- // if we can't flatten the property, then don't apply the property and fall back on the existing style
- printMappingErr();
- return false;
- }
- flatProp.mapping = prop; // keep a reference to the mapping
- prop = flatProp; // the flattened (mapped) property is the one we want
+Point.prototype.toString = function () {
+ return new Point().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
+};
- break;
- }
+module.exports = Point;
- // direct mapping
- case types.data:
- {
- // flatten the field (e.g. data.foo.bar)
- var _fields = prop.field.split('.');
- var _fieldVal = _p.data;
- for (var _i3 = 0; _i3 < _fields.length && _fieldVal; _i3++) {
- var _field = _fields[_i3];
- _fieldVal = _fieldVal[_field];
- }
- if (_fieldVal != null) {
- flatProp = this.parse(prop.name, _fieldVal, prop.bypass, flatPropMapping);
- }
- if (!flatProp) {
- // if we can't flatten the property, then don't apply and fall back on the existing style
- printMappingErr();
- return false;
- }
- flatProp.mapping = prop; // keep a reference to the mapping
- prop = flatProp; // the flattened (mapped) property is the one we want
+/***/ }),
+/* 13 */
+/***/ (function(module, exports, __webpack_require__) {
- break;
- }
- case types.fn:
- {
- var fn = prop.value;
- var fnRetVal = prop.fnValue != null ? prop.fnValue : fn(ele); // check for cached value before calling function
+"use strict";
- prop.prevFnValue = fnRetVal;
- if (fnRetVal == null) {
- warn('Custom function mappers may not return null (i.e. `' + prop.name + '` for ele `' + ele.id() + '` is null)');
- return false;
- }
- flatProp = this.parse(prop.name, fnRetVal, prop.bypass, flatPropMapping);
- if (!flatProp) {
- warn('Custom function mappers may not return invalid values for the property type (i.e. `' + prop.name + '` for ele `' + ele.id() + '` is invalid)');
- return false;
- }
- flatProp.mapping = copy(prop); // keep a reference to the mapping
- prop = flatProp; // the flattened (mapped) property is the one we want
- break;
- }
- case undefined:
- break;
- // just set the property
+function RectangleD(x, y, width, height) {
+ this.x = 0;
+ this.y = 0;
+ this.width = 0;
+ this.height = 0;
- default:
- return false;
- // not a valid mapping
+ if (x != null && y != null && width != null && height != null) {
+ this.x = x;
+ this.y = y;
+ this.width = width;
+ this.height = height;
}
+}
- // if the property is a bypass property, then link the resultant property to the original one
- if (propIsBypass) {
- if (origPropIsBypass) {
- // then this bypass overrides the existing one
- prop.bypassed = origProp.bypassed; // steal bypassed prop from old bypass
- } else {
- // then link the orig prop to the new bypass
- prop.bypassed = origProp;
- }
- style[prop.name] = prop; // and set
- } else {
- // prop is not bypass
- if (origPropIsBypass) {
- // then keep the orig prop (since it's a bypass) and link to the new prop
- origProp.bypassed = prop;
- } else {
- // then just replace the old prop with the new one
- style[prop.name] = prop;
- }
- }
- checkTriggers();
- return true;
+RectangleD.prototype.getX = function () {
+ return this.x;
};
-styfn$8.cleanElements = function (eles, keepBypasses) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- this.clearStyleHints(ele);
- ele.dirtyCompoundBoundsCache();
- ele.dirtyBoundingBoxCache();
- if (!keepBypasses) {
- ele._private.style = {};
- } else {
- var style = ele._private.style;
- var propNames = Object.keys(style);
- for (var j = 0; j < propNames.length; j++) {
- var propName = propNames[j];
- var eleProp = style[propName];
- if (eleProp != null) {
- if (eleProp.bypass) {
- eleProp.bypassed = null;
- } else {
- style[propName] = null;
- }
- }
- }
- }
- }
+
+RectangleD.prototype.setX = function (x) {
+ this.x = x;
};
-// updates the visual style for all elements (useful for manual style modification after init)
-styfn$8.update = function () {
- var cy = this._private.cy;
- var eles = cy.mutableElements();
- eles.updateStyle();
+RectangleD.prototype.getY = function () {
+ return this.y;
};
-// diffProps : { name => { prev, next } }
-styfn$8.updateTransitions = function (ele, diffProps) {
- var self = this;
- var _p = ele._private;
- var props = ele.pstyle('transition-property').value;
- var duration = ele.pstyle('transition-duration').pfValue;
- var delay = ele.pstyle('transition-delay').pfValue;
- if (props.length > 0 && duration > 0) {
- var style = {};
+RectangleD.prototype.setY = function (y) {
+ this.y = y;
+};
- // build up the style to animate towards
- var anyPrev = false;
- for (var i = 0; i < props.length; i++) {
- var prop = props[i];
- var styProp = ele.pstyle(prop);
- var diffProp = diffProps[prop];
- if (!diffProp) {
- continue;
- }
- var prevProp = diffProp.prev;
- var fromProp = prevProp;
- var toProp = diffProp.next != null ? diffProp.next : styProp;
- var diff = false;
- var initVal = void 0;
- var initDt = 0.000001; // delta time % value for initVal (allows animating out of init zero opacity)
+RectangleD.prototype.getWidth = function () {
+ return this.width;
+};
- if (!fromProp) {
- continue;
- }
+RectangleD.prototype.setWidth = function (width) {
+ this.width = width;
+};
- // consider px values
- if (number$1(fromProp.pfValue) && number$1(toProp.pfValue)) {
- diff = toProp.pfValue - fromProp.pfValue; // nonzero is truthy
- initVal = fromProp.pfValue + initDt * diff;
+RectangleD.prototype.getHeight = function () {
+ return this.height;
+};
- // consider numerical values
- } else if (number$1(fromProp.value) && number$1(toProp.value)) {
- diff = toProp.value - fromProp.value; // nonzero is truthy
- initVal = fromProp.value + initDt * diff;
+RectangleD.prototype.setHeight = function (height) {
+ this.height = height;
+};
- // consider colour values
- } else if (array(fromProp.value) && array(toProp.value)) {
- diff = fromProp.value[0] !== toProp.value[0] || fromProp.value[1] !== toProp.value[1] || fromProp.value[2] !== toProp.value[2];
- initVal = fromProp.strValue;
- }
+RectangleD.prototype.getRight = function () {
+ return this.x + this.width;
+};
- // the previous value is good for an animation only if it's different
- if (diff) {
- style[prop] = toProp.strValue; // to val
- this.applyBypass(ele, prop, initVal); // from val
- anyPrev = true;
- }
- } // end if props allow ani
+RectangleD.prototype.getBottom = function () {
+ return this.y + this.height;
+};
- // can't transition if there's nothing previous to transition from
- if (!anyPrev) {
- return;
- }
- _p.transitioning = true;
- new Promise$1(function (resolve) {
- if (delay > 0) {
- ele.delayAnimation(delay).play().promise().then(resolve);
- } else {
- resolve();
- }
- }).then(function () {
- return ele.animation({
- style: style,
- duration: duration,
- easing: ele.pstyle('transition-timing-function').value,
- queue: false
- }).play().promise();
- }).then(function () {
- // if( !isBypass ){
- self.removeBypasses(ele, props);
- ele.emitAndNotify('style');
- // }
+RectangleD.prototype.intersects = function (a) {
+ if (this.getRight() < a.x) {
+ return false;
+ }
- _p.transitioning = false;
- });
- } else if (_p.transitioning) {
- this.removeBypasses(ele, props);
- ele.emitAndNotify('style');
- _p.transitioning = false;
+ if (this.getBottom() < a.y) {
+ return false;
}
-};
-styfn$8.checkTrigger = function (ele, name, fromValue, toValue, getTrigger, onTrigger) {
- var prop = this.properties[name];
- var triggerCheck = getTrigger(prop);
- if (triggerCheck != null && triggerCheck(fromValue, toValue)) {
- onTrigger(prop);
+
+ if (a.getRight() < this.x) {
+ return false;
+ }
+
+ if (a.getBottom() < this.y) {
+ return false;
}
+
+ return true;
};
-styfn$8.checkZOrderTrigger = function (ele, name, fromValue, toValue) {
- var _this = this;
- this.checkTrigger(ele, name, fromValue, toValue, function (prop) {
- return prop.triggersZOrder;
- }, function () {
- _this._private.cy.notify('zorder', ele);
- });
+
+RectangleD.prototype.getCenterX = function () {
+ return this.x + this.width / 2;
};
-styfn$8.checkBoundsTrigger = function (ele, name, fromValue, toValue) {
- this.checkTrigger(ele, name, fromValue, toValue, function (prop) {
- return prop.triggersBounds;
- }, function (prop) {
- ele.dirtyCompoundBoundsCache();
- ele.dirtyBoundingBoxCache();
- // if the prop change makes the bb of pll bezier edges invalid,
- // then dirty the pll edge bb cache as well
- if (
- // only for beziers -- so performance of other edges isn't affected
- prop.triggersBoundsOfParallelBeziers && (name === 'curve-style' && (fromValue === 'bezier' || toValue === 'bezier') || name === 'display' && (fromValue === 'none' || toValue === 'none'))) {
- ele.parallelEdges().forEach(function (pllEdge) {
- if (pllEdge.isBundledBezier()) {
- pllEdge.dirtyBoundingBoxCache();
- }
- });
- }
- });
+RectangleD.prototype.getMinX = function () {
+ return this.getX();
};
-styfn$8.checkTriggers = function (ele, name, fromValue, toValue) {
- ele.dirtyStyleCache();
- this.checkZOrderTrigger(ele, name, fromValue, toValue);
- this.checkBoundsTrigger(ele, name, fromValue, toValue);
+
+RectangleD.prototype.getMaxX = function () {
+ return this.getX() + this.width;
};
-var styfn$7 = {};
+RectangleD.prototype.getCenterY = function () {
+ return this.y + this.height / 2;
+};
-// bypasses are applied to an existing style on an element, and just tacked on temporarily
-// returns true iff application was successful for at least 1 specified property
-styfn$7.applyBypass = function (eles, name, value, updateTransitions) {
- var self = this;
- var props = [];
- var isBypass = true;
+RectangleD.prototype.getMinY = function () {
+ return this.getY();
+};
- // put all the properties (can specify one or many) in an array after parsing them
- if (name === '*' || name === '**') {
- // apply to all property names
+RectangleD.prototype.getMaxY = function () {
+ return this.getY() + this.height;
+};
- if (value !== undefined) {
- for (var i = 0; i < self.properties.length; i++) {
- var prop = self.properties[i];
- var _name = prop.name;
- var parsedProp = this.parse(_name, value, true);
- if (parsedProp) {
- props.push(parsedProp);
- }
- }
- }
- } else if (string(name)) {
- // then parse the single property
- var _parsedProp = this.parse(name, value, true);
- if (_parsedProp) {
- props.push(_parsedProp);
- }
- } else if (plainObject(name)) {
- // then parse each property
- var specifiedProps = name;
- updateTransitions = value;
- var names = Object.keys(specifiedProps);
- for (var _i = 0; _i < names.length; _i++) {
- var _name2 = names[_i];
- var _value = specifiedProps[_name2];
- if (_value === undefined) {
- // try camel case name too
- _value = specifiedProps[dash2camel(_name2)];
- }
- if (_value !== undefined) {
- var _parsedProp2 = this.parse(_name2, _value, true);
- if (_parsedProp2) {
- props.push(_parsedProp2);
- }
- }
- }
- } else {
- // can't do anything without well defined properties
- return false;
- }
+RectangleD.prototype.getWidthHalf = function () {
+ return this.width / 2;
+};
- // we've failed if there are no valid properties
- if (props.length === 0) {
- return false;
- }
+RectangleD.prototype.getHeightHalf = function () {
+ return this.height / 2;
+};
- // now, apply the bypass properties on the elements
- var ret = false; // return true if at least one succesful bypass applied
- for (var _i2 = 0; _i2 < eles.length; _i2++) {
- // for each ele
- var ele = eles[_i2];
- var diffProps = {};
- var diffProp = void 0;
- for (var j = 0; j < props.length; j++) {
- // for each prop
- var _prop = props[j];
- if (updateTransitions) {
- var prevProp = ele.pstyle(_prop.name);
- diffProp = diffProps[_prop.name] = {
- prev: prevProp
- };
- }
- ret = this.applyParsedProperty(ele, copy(_prop)) || ret;
- if (updateTransitions) {
- diffProp.next = ele.pstyle(_prop.name);
- }
- } // for props
+module.exports = RectangleD;
- if (ret) {
- this.updateStyleHints(ele);
- }
- if (updateTransitions) {
- this.updateTransitions(ele, diffProps, isBypass);
- }
- } // for eles
+/***/ }),
+/* 14 */
+/***/ (function(module, exports, __webpack_require__) {
- return ret;
-};
+"use strict";
-// only useful in specific cases like animation
-styfn$7.overrideBypass = function (eles, name, value) {
- name = camel2dash(name);
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var prop = ele._private.style[name];
- var type = this.properties[name].type;
- var isColor = type.color;
- var isMulti = type.mutiple;
- var oldValue = !prop ? null : prop.pfValue != null ? prop.pfValue : prop.value;
- if (!prop || !prop.bypass) {
- // need a bypass if one doesn't exist
- this.applyBypass(ele, name, value);
- } else {
- prop.value = value;
- if (prop.pfValue != null) {
- prop.pfValue = value;
- }
- if (isColor) {
- prop.strValue = 'rgb(' + value.join(',') + ')';
- } else if (isMulti) {
- prop.strValue = value.join(' ');
- } else {
- prop.strValue = '' + value;
- }
- this.updateStyleHints(ele);
- }
- this.checkTriggers(ele, name, oldValue, value);
+
+var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; };
+
+function UniqueIDGeneretor() {}
+
+UniqueIDGeneretor.lastID = 0;
+
+UniqueIDGeneretor.createID = function (obj) {
+ if (UniqueIDGeneretor.isPrimitive(obj)) {
+ return obj;
+ }
+ if (obj.uniqueID != null) {
+ return obj.uniqueID;
}
+ obj.uniqueID = UniqueIDGeneretor.getString();
+ UniqueIDGeneretor.lastID++;
+ return obj.uniqueID;
};
-styfn$7.removeAllBypasses = function (eles, updateTransitions) {
- return this.removeBypasses(eles, this.propertyNames, updateTransitions);
+
+UniqueIDGeneretor.getString = function (id) {
+ if (id == null) id = UniqueIDGeneretor.lastID;
+ return "Object#" + id + "";
};
-styfn$7.removeBypasses = function (eles, props, updateTransitions) {
- var isBypass = true;
- for (var j = 0; j < eles.length; j++) {
- var ele = eles[j];
- var diffProps = {};
- for (var i = 0; i < props.length; i++) {
- var name = props[i];
- var prop = this.properties[name];
- var prevProp = ele.pstyle(prop.name);
- if (!prevProp || !prevProp.bypass) {
- // if a bypass doesn't exist for the prop, nothing needs to be removed
- continue;
- }
- var value = ''; // empty => remove bypass
- var parsedProp = this.parse(name, value, true);
- var diffProp = diffProps[prop.name] = {
- prev: prevProp
- };
- this.applyParsedProperty(ele, parsedProp);
- diffProp.next = ele.pstyle(prop.name);
- } // for props
- this.updateStyleHints(ele);
- if (updateTransitions) {
- this.updateTransitions(ele, diffProps, isBypass);
- }
- } // for eles
+UniqueIDGeneretor.isPrimitive = function (arg) {
+ var type = typeof arg === "undefined" ? "undefined" : _typeof(arg);
+ return arg == null || type != "object" && type != "function";
};
-var styfn$6 = {};
+module.exports = UniqueIDGeneretor;
-// gets what an em size corresponds to in pixels relative to a dom element
-styfn$6.getEmSizeInPixels = function () {
- var px = this.containerCss('font-size');
- if (px != null) {
- return parseFloat(px);
- } else {
- return 1; // for headless
+/***/ }),
+/* 15 */
+/***/ (function(module, exports, __nested_webpack_require_66321__) {
+
+"use strict";
+
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+var LayoutConstants = __nested_webpack_require_66321__(0);
+var LGraphManager = __nested_webpack_require_66321__(7);
+var LNode = __nested_webpack_require_66321__(3);
+var LEdge = __nested_webpack_require_66321__(1);
+var LGraph = __nested_webpack_require_66321__(6);
+var PointD = __nested_webpack_require_66321__(5);
+var Transform = __nested_webpack_require_66321__(17);
+var Emitter = __nested_webpack_require_66321__(29);
+
+function Layout(isRemoteUse) {
+ Emitter.call(this);
+
+ //Layout Quality: 0:draft, 1:default, 2:proof
+ this.layoutQuality = LayoutConstants.QUALITY;
+ //Whether layout should create bendpoints as needed or not
+ this.createBendsAsNeeded = LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED;
+ //Whether layout should be incremental or not
+ this.incremental = LayoutConstants.DEFAULT_INCREMENTAL;
+ //Whether we animate from before to after layout node positions
+ this.animationOnLayout = LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT;
+ //Whether we animate the layout process or not
+ this.animationDuringLayout = LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT;
+ //Number iterations that should be done between two successive animations
+ this.animationPeriod = LayoutConstants.DEFAULT_ANIMATION_PERIOD;
+ /**
+ * Whether or not leaf nodes (non-compound nodes) are of uniform sizes. When
+ * they are, both spring and repulsion forces between two leaf nodes can be
+ * calculated without the expensive clipping point calculations, resulting
+ * in major speed-up.
+ */
+ this.uniformLeafNodeSizes = LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES;
+ /**
+ * This is used for creation of bendpoints by using dummy nodes and edges.
+ * Maps an LEdge to its dummy bendpoint path.
+ */
+ this.edgeToDummyNodes = new Map();
+ this.graphManager = new LGraphManager(this);
+ this.isLayoutFinished = false;
+ this.isSubLayout = false;
+ this.isRemoteUse = false;
+
+ if (isRemoteUse != null) {
+ this.isRemoteUse = isRemoteUse;
}
+}
+
+Layout.RANDOM_SEED = 1;
+
+Layout.prototype = Object.create(Emitter.prototype);
+
+Layout.prototype.getGraphManager = function () {
+ return this.graphManager;
};
-// gets css property from the core container
-styfn$6.containerCss = function (propName) {
- var cy = this._private.cy;
- var domElement = cy.container();
- var containerWindow = cy.window();
- if (containerWindow && domElement && containerWindow.getComputedStyle) {
- return containerWindow.getComputedStyle(domElement).getPropertyValue(propName);
- }
+Layout.prototype.getAllNodes = function () {
+ return this.graphManager.getAllNodes();
};
-var styfn$5 = {};
+Layout.prototype.getAllEdges = function () {
+ return this.graphManager.getAllEdges();
+};
-// gets the rendered style for an element
-styfn$5.getRenderedStyle = function (ele, prop) {
- if (prop) {
- return this.getStylePropertyValue(ele, prop, true);
- } else {
- return this.getRawStyle(ele, true);
- }
+Layout.prototype.getAllNodesToApplyGravitation = function () {
+ return this.graphManager.getAllNodesToApplyGravitation();
};
-// gets the raw style for an element
-styfn$5.getRawStyle = function (ele, isRenderedVal) {
- var self = this;
- ele = ele[0]; // insure it's an element
+Layout.prototype.newGraphManager = function () {
+ var gm = new LGraphManager(this);
+ this.graphManager = gm;
+ return gm;
+};
- if (ele) {
- var rstyle = {};
- for (var i = 0; i < self.properties.length; i++) {
- var prop = self.properties[i];
- var val = self.getStylePropertyValue(ele, prop.name, isRenderedVal);
- if (val != null) {
- rstyle[prop.name] = val;
- rstyle[dash2camel(prop.name)] = val;
- }
- }
- return rstyle;
- }
+Layout.prototype.newGraph = function (vGraph) {
+ return new LGraph(null, this.graphManager, vGraph);
};
-styfn$5.getIndexedStyle = function (ele, property, subproperty, index) {
- var pstyle = ele.pstyle(property)[subproperty][index];
- return pstyle != null ? pstyle : ele.cy().style().getDefaultProperty(property)[subproperty][0];
+
+Layout.prototype.newNode = function (vNode) {
+ return new LNode(this.graphManager, vNode);
};
-styfn$5.getStylePropertyValue = function (ele, propName, isRenderedVal) {
- var self = this;
- ele = ele[0]; // insure it's an element
- if (ele) {
- var prop = self.properties[propName];
- if (prop.alias) {
- prop = prop.pointsTo;
- }
- var type = prop.type;
- var styleProp = ele.pstyle(prop.name);
- if (styleProp) {
- var value = styleProp.value,
- units = styleProp.units,
- strValue = styleProp.strValue;
- if (isRenderedVal && type.number && value != null && number$1(value)) {
- var zoom = ele.cy().zoom();
- var getRenderedValue = function getRenderedValue(val) {
- return val * zoom;
- };
- var getValueStringWithUnits = function getValueStringWithUnits(val, units) {
- return getRenderedValue(val) + units;
- };
- var isArrayValue = array(value);
- var haveUnits = isArrayValue ? units.every(function (u) {
- return u != null;
- }) : units != null;
- if (haveUnits) {
- if (isArrayValue) {
- return value.map(function (v, i) {
- return getValueStringWithUnits(v, units[i]);
- }).join(' ');
- } else {
- return getValueStringWithUnits(value, units);
- }
- } else {
- if (isArrayValue) {
- return value.map(function (v) {
- return string(v) ? v : '' + getRenderedValue(v);
- }).join(' ');
- } else {
- return '' + getRenderedValue(value);
- }
- }
- } else if (strValue != null) {
- return strValue;
- }
+Layout.prototype.newEdge = function (vEdge) {
+ return new LEdge(null, null, vEdge);
+};
+
+Layout.prototype.checkLayoutSuccess = function () {
+ return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
+};
+
+Layout.prototype.runLayout = function () {
+ this.isLayoutFinished = false;
+
+ if (this.tilingPreLayout) {
+ this.tilingPreLayout();
+ }
+
+ this.initParameters();
+ var isLayoutSuccessfull;
+
+ if (this.checkLayoutSuccess()) {
+ isLayoutSuccessfull = false;
+ } else {
+ isLayoutSuccessfull = this.layout();
+ }
+
+ if (LayoutConstants.ANIMATE === 'during') {
+ // If this is a 'during' layout animation. Layout is not finished yet.
+ // We need to perform these in index.js when layout is really finished.
+ return false;
+ }
+
+ if (isLayoutSuccessfull) {
+ if (!this.isSubLayout) {
+ this.doPostLayout();
}
- return null;
}
+
+ if (this.tilingPostLayout) {
+ this.tilingPostLayout();
+ }
+
+ this.isLayoutFinished = true;
+
+ return isLayoutSuccessfull;
};
-styfn$5.getAnimationStartStyle = function (ele, aniProps) {
- var rstyle = {};
- for (var i = 0; i < aniProps.length; i++) {
- var aniProp = aniProps[i];
- var name = aniProp.name;
- var styleProp = ele.pstyle(name);
- if (styleProp !== undefined) {
- // then make a prop of it
- if (plainObject(styleProp)) {
- styleProp = this.parse(name, styleProp.strValue);
- } else {
- styleProp = this.parse(name, styleProp);
- }
+
+/**
+ * This method performs the operations required after layout.
+ */
+Layout.prototype.doPostLayout = function () {
+ //assert !isSubLayout : "Should not be called on sub-layout!";
+ // Propagate geometric changes to v-level objects
+ if (!this.incremental) {
+ this.transform();
+ }
+ this.update();
+};
+
+/**
+ * This method updates the geometry of the target graph according to
+ * calculated layout.
+ */
+Layout.prototype.update2 = function () {
+ // update bend points
+ if (this.createBendsAsNeeded) {
+ this.createBendpointsFromDummyNodes();
+
+ // reset all edges, since the topology has changed
+ this.graphManager.resetAllEdges();
+ }
+
+ // perform edge, node and root updates if layout is not called
+ // remotely
+ if (!this.isRemoteUse) {
+ // update all edges
+ var edge;
+ var allEdges = this.graphManager.getAllEdges();
+ for (var i = 0; i < allEdges.length; i++) {
+ edge = allEdges[i];
+ // this.update(edge);
}
- if (styleProp) {
- rstyle[name] = styleProp;
+
+ // recursively update nodes
+ var node;
+ var nodes = this.graphManager.getRoot().getNodes();
+ for (var i = 0; i < nodes.length; i++) {
+ node = nodes[i];
+ // this.update(node);
}
+
+ // update root graph
+ this.update(this.graphManager.getRoot());
}
- return rstyle;
};
-styfn$5.getPropsList = function (propsObj) {
- var self = this;
- var rstyle = [];
- var style = propsObj;
- var props = self.properties;
- if (style) {
- var names = Object.keys(style);
- for (var i = 0; i < names.length; i++) {
- var name = names[i];
- var val = style[name];
- var prop = props[name] || props[camel2dash(name)];
- var styleProp = this.parse(prop.name, val);
- if (styleProp) {
- rstyle.push(styleProp);
+
+Layout.prototype.update = function (obj) {
+ if (obj == null) {
+ this.update2();
+ } else if (obj instanceof LNode) {
+ var node = obj;
+ if (node.getChild() != null) {
+ // since node is compound, recursively update child nodes
+ var nodes = node.getChild().getNodes();
+ for (var i = 0; i < nodes.length; i++) {
+ update(nodes[i]);
}
}
+
+ // if the l-level node is associated with a v-level graph object,
+ // then it is assumed that the v-level node implements the
+ // interface Updatable.
+ if (node.vGraphObject != null) {
+ // cast to Updatable without any type check
+ var vNode = node.vGraphObject;
+
+ // call the update method of the interface
+ vNode.update(node);
+ }
+ } else if (obj instanceof LEdge) {
+ var edge = obj;
+ // if the l-level edge is associated with a v-level graph object,
+ // then it is assumed that the v-level edge implements the
+ // interface Updatable.
+
+ if (edge.vGraphObject != null) {
+ // cast to Updatable without any type check
+ var vEdge = edge.vGraphObject;
+
+ // call the update method of the interface
+ vEdge.update(edge);
+ }
+ } else if (obj instanceof LGraph) {
+ var graph = obj;
+ // if the l-level graph is associated with a v-level graph object,
+ // then it is assumed that the v-level object implements the
+ // interface Updatable.
+
+ if (graph.vGraphObject != null) {
+ // cast to Updatable without any type check
+ var vGraph = graph.vGraphObject;
+
+ // call the update method of the interface
+ vGraph.update(graph);
+ }
}
- return rstyle;
};
-styfn$5.getNonDefaultPropertiesHash = function (ele, propNames, seed) {
- var hash = seed.slice();
- var name, val, strVal, chVal;
- var i, j;
- for (i = 0; i < propNames.length; i++) {
- name = propNames[i];
- val = ele.pstyle(name, false);
- if (val == null) {
- continue;
- } else if (val.pfValue != null) {
- hash[0] = hashInt(chVal, hash[0]);
- hash[1] = hashIntAlt(chVal, hash[1]);
- } else {
- strVal = val.strValue;
- for (j = 0; j < strVal.length; j++) {
- chVal = strVal.charCodeAt(j);
- hash[0] = hashInt(chVal, hash[0]);
- hash[1] = hashIntAlt(chVal, hash[1]);
- }
- }
+
+/**
+ * This method is used to set all layout parameters to default values
+ * determined at compile time.
+ */
+Layout.prototype.initParameters = function () {
+ if (!this.isSubLayout) {
+ this.layoutQuality = LayoutConstants.QUALITY;
+ this.animationDuringLayout = LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT;
+ this.animationPeriod = LayoutConstants.DEFAULT_ANIMATION_PERIOD;
+ this.animationOnLayout = LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT;
+ this.incremental = LayoutConstants.DEFAULT_INCREMENTAL;
+ this.createBendsAsNeeded = LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED;
+ this.uniformLeafNodeSizes = LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES;
+ }
+
+ if (this.animationDuringLayout) {
+ this.animationOnLayout = false;
}
- return hash;
};
-styfn$5.getPropertiesHash = styfn$5.getNonDefaultPropertiesHash;
-var styfn$4 = {};
-styfn$4.appendFromJson = function (json) {
- var style = this;
- for (var i = 0; i < json.length; i++) {
- var context = json[i];
- var selector = context.selector;
- var props = context.style || context.css;
- var names = Object.keys(props);
- style.selector(selector); // apply selector
+Layout.prototype.transform = function (newLeftTop) {
+ if (newLeftTop == undefined) {
+ this.transform(new PointD(0, 0));
+ } else {
+ // create a transformation object (from Eclipse to layout). When an
+ // inverse transform is applied, we get upper-left coordinate of the
+ // drawing or the root graph at given input coordinate (some margins
+ // already included in calculation of left-top).
- for (var j = 0; j < names.length; j++) {
- var name = names[j];
- var value = props[name];
- style.css(name, value); // apply property
+ var trans = new Transform();
+ var leftTop = this.graphManager.getRoot().updateLeftTop();
+
+ if (leftTop != null) {
+ trans.setWorldOrgX(newLeftTop.x);
+ trans.setWorldOrgY(newLeftTop.y);
+
+ trans.setDeviceOrgX(leftTop.x);
+ trans.setDeviceOrgY(leftTop.y);
+
+ var nodes = this.getAllNodes();
+ var node;
+
+ for (var i = 0; i < nodes.length; i++) {
+ node = nodes[i];
+ node.transform(trans);
+ }
}
}
-
- return style;
};
-// accessible cy.style() function
-styfn$4.fromJson = function (json) {
- var style = this;
- style.resetToDefault();
- style.appendFromJson(json);
- return style;
-};
+Layout.prototype.positionNodesRandomly = function (graph) {
-// get json from cy.style() api
-styfn$4.json = function () {
- var json = [];
- for (var i = this.defaultLength; i < this.length; i++) {
- var cxt = this[i];
- var selector = cxt.selector;
- var props = cxt.properties;
- var css = {};
- for (var j = 0; j < props.length; j++) {
- var prop = props[j];
- css[prop.name] = prop.strValue;
+ if (graph == undefined) {
+ //assert !this.incremental;
+ this.positionNodesRandomly(this.getGraphManager().getRoot());
+ this.getGraphManager().getRoot().updateBounds(true);
+ } else {
+ var lNode;
+ var childGraph;
+
+ var nodes = graph.getNodes();
+ for (var i = 0; i < nodes.length; i++) {
+ lNode = nodes[i];
+ childGraph = lNode.getChild();
+
+ if (childGraph == null) {
+ lNode.scatter();
+ } else if (childGraph.getNodes().length == 0) {
+ lNode.scatter();
+ } else {
+ this.positionNodesRandomly(childGraph);
+ lNode.updateBounds();
+ }
}
- json.push({
- selector: !selector ? 'core' : selector.toString(),
- style: css
- });
}
- return json;
};
-var styfn$3 = {};
-styfn$3.appendFromString = function (string) {
- var self = this;
- var style = this;
- var remaining = '' + string;
- var selAndBlockStr;
- var blockRem;
- var propAndValStr;
+/**
+ * This method returns a list of trees where each tree is represented as a
+ * list of l-nodes. The method returns a list of size 0 when:
+ * - The graph is not flat or
+ * - One of the component(s) of the graph is not a tree.
+ */
+Layout.prototype.getFlatForest = function () {
+ var flatForest = [];
+ var isForest = true;
- // remove comments from the style string
- remaining = remaining.replace(/[/][*](\s|.)+?[*][/]/g, '');
- function removeSelAndBlockFromRemaining() {
- // remove the parsed selector and block from the remaining text to parse
- if (remaining.length > selAndBlockStr.length) {
- remaining = remaining.substr(selAndBlockStr.length);
- } else {
- remaining = '';
+ // Quick reference for all nodes in the graph manager associated with
+ // this layout. The list should not be changed.
+ var allNodes = this.graphManager.getRoot().getNodes();
+
+ // First be sure that the graph is flat
+ var isFlat = true;
+
+ for (var i = 0; i < allNodes.length; i++) {
+ if (allNodes[i].getChild() != null) {
+ isFlat = false;
}
}
- function removePropAndValFromRem() {
- // remove the parsed property and value from the remaining block text to parse
- if (blockRem.length > propAndValStr.length) {
- blockRem = blockRem.substr(propAndValStr.length);
- } else {
- blockRem = '';
- }
+
+ // Return empty forest if the graph is not flat.
+ if (!isFlat) {
+ return flatForest;
}
- for (;;) {
- var nothingLeftToParse = remaining.match(/^\s*$/);
- if (nothingLeftToParse) {
- break;
- }
- var selAndBlock = remaining.match(/^\s*((?:.|\s)+?)\s*\{((?:.|\s)+?)\}/);
- if (!selAndBlock) {
- warn('Halting stylesheet parsing: String stylesheet contains more to parse but no selector and block found in: ' + remaining);
- break;
- }
- selAndBlockStr = selAndBlock[0];
- // parse the selector
- var selectorStr = selAndBlock[1];
- if (selectorStr !== 'core') {
- var selector = new Selector(selectorStr);
- if (selector.invalid) {
- warn('Skipping parsing of block: Invalid selector found in string stylesheet: ' + selectorStr);
+ // Run BFS for each component of the graph.
- // skip this selector and block
- removeSelAndBlockFromRemaining();
- continue;
- }
- }
+ var visited = new Set();
+ var toBeVisited = [];
+ var parents = new Map();
+ var unProcessedNodes = [];
- // parse the block of properties and values
- var blockStr = selAndBlock[2];
- var invalidBlock = false;
- blockRem = blockStr;
- var props = [];
- for (;;) {
- var _nothingLeftToParse = blockRem.match(/^\s*$/);
- if (_nothingLeftToParse) {
- break;
- }
- var propAndVal = blockRem.match(/^\s*(.+?)\s*:\s*(.+?)(?:\s*;|\s*$)/);
- if (!propAndVal) {
- warn('Skipping parsing of block: Invalid formatting of style property and value definitions found in:' + blockStr);
- invalidBlock = true;
- break;
- }
- propAndValStr = propAndVal[0];
- var propStr = propAndVal[1];
- var valStr = propAndVal[2];
- var prop = self.properties[propStr];
- if (!prop) {
- warn('Skipping property: Invalid property name in: ' + propAndValStr);
+ unProcessedNodes = unProcessedNodes.concat(allNodes);
- // skip this property in the block
- removePropAndValFromRem();
- continue;
- }
- var parsedProp = style.parse(propStr, valStr);
- if (!parsedProp) {
- warn('Skipping property: Invalid property definition in: ' + propAndValStr);
+ // Each iteration of this loop finds a component of the graph and
+ // decides whether it is a tree or not. If it is a tree, adds it to the
+ // forest and continued with the next component.
- // skip this property in the block
- removePropAndValFromRem();
- continue;
+ while (unProcessedNodes.length > 0 && isForest) {
+ toBeVisited.push(unProcessedNodes[0]);
+
+ // Start the BFS. Each iteration of this loop visits a node in a
+ // BFS manner.
+ while (toBeVisited.length > 0 && isForest) {
+ //pool operation
+ var currentNode = toBeVisited[0];
+ toBeVisited.splice(0, 1);
+ visited.add(currentNode);
+
+ // Traverse all neighbors of this node
+ var neighborEdges = currentNode.getEdges();
+
+ for (var i = 0; i < neighborEdges.length; i++) {
+ var currentNeighbor = neighborEdges[i].getOtherEnd(currentNode);
+
+ // If BFS is not growing from this neighbor.
+ if (parents.get(currentNode) != currentNeighbor) {
+ // We haven't previously visited this neighbor.
+ if (!visited.has(currentNeighbor)) {
+ toBeVisited.push(currentNeighbor);
+ parents.set(currentNeighbor, currentNode);
+ }
+ // Since we have previously visited this neighbor and
+ // this neighbor is not parent of currentNode, given
+ // graph contains a component that is not tree, hence
+ // it is not a forest.
+ else {
+ isForest = false;
+ break;
+ }
+ }
}
- props.push({
- name: propStr,
- val: valStr
- });
- removePropAndValFromRem();
- }
- if (invalidBlock) {
- removeSelAndBlockFromRemaining();
- break;
}
- // put the parsed block in the style
- style.selector(selectorStr);
- for (var i = 0; i < props.length; i++) {
- var _prop = props[i];
- style.css(_prop.name, _prop.val);
+ // The graph contains a component that is not a tree. Empty
+ // previously found trees. The method will end.
+ if (!isForest) {
+ flatForest = [];
}
- removeSelAndBlockFromRemaining();
- }
- return style;
-};
-styfn$3.fromString = function (string) {
- var style = this;
- style.resetToDefault();
- style.appendFromString(string);
- return style;
-};
-
-var styfn$2 = {};
-(function () {
- var number$1 = number;
- var rgba = rgbaNoBackRefs;
- var hsla = hslaNoBackRefs;
- var hex3$1 = hex3;
- var hex6$1 = hex6;
- var data = function data(prefix) {
- return '^' + prefix + '\\s*\\(\\s*([\\w\\.]+)\\s*\\)$';
- };
- var mapData = function mapData(prefix) {
- var mapArg = number$1 + '|\\w+|' + rgba + '|' + hsla + '|' + hex3$1 + '|' + hex6$1;
- return '^' + prefix + '\\s*\\(([\\w\\.]+)\\s*\\,\\s*(' + number$1 + ')\\s*\\,\\s*(' + number$1 + ')\\s*,\\s*(' + mapArg + ')\\s*\\,\\s*(' + mapArg + ')\\)$';
- };
- var urlRegexes = ['^url\\s*\\(\\s*[\'"]?(.+?)[\'"]?\\s*\\)$', '^(none)$', '^(.+)$'];
-
- // each visual style property has a type and needs to be validated according to it
- styfn$2.types = {
- time: {
- number: true,
- min: 0,
- units: 's|ms',
- implicitUnits: 'ms'
- },
- percent: {
- number: true,
- min: 0,
- max: 100,
- units: '%',
- implicitUnits: '%'
- },
- percentages: {
- number: true,
- min: 0,
- max: 100,
- units: '%',
- implicitUnits: '%',
- multiple: true
- },
- zeroOneNumber: {
- number: true,
- min: 0,
- max: 1,
- unitless: true
- },
- zeroOneNumbers: {
- number: true,
- min: 0,
- max: 1,
- unitless: true,
- multiple: true
- },
- nOneOneNumber: {
- number: true,
- min: -1,
- max: 1,
- unitless: true
- },
- nonNegativeInt: {
- number: true,
- min: 0,
- integer: true,
- unitless: true
- },
- nonNegativeNumber: {
- number: true,
- min: 0,
- unitless: true
- },
- position: {
- enums: ['parent', 'origin']
- },
- nodeSize: {
- number: true,
- min: 0,
- enums: ['label']
- },
- number: {
- number: true,
- unitless: true
- },
- numbers: {
- number: true,
- unitless: true,
- multiple: true
- },
- positiveNumber: {
- number: true,
- unitless: true,
- min: 0,
- strictMin: true
- },
- size: {
- number: true,
- min: 0
- },
- bidirectionalSize: {
- number: true
- },
- // allows negative
- bidirectionalSizeMaybePercent: {
- number: true,
- allowPercent: true
- },
- // allows negative
- bidirectionalSizes: {
- number: true,
- multiple: true
- },
- // allows negative
- sizeMaybePercent: {
- number: true,
- min: 0,
- allowPercent: true
- },
- axisDirection: {
- enums: ['horizontal', 'leftward', 'rightward', 'vertical', 'upward', 'downward', 'auto']
- },
- paddingRelativeTo: {
- enums: ['width', 'height', 'average', 'min', 'max']
- },
- bgWH: {
- number: true,
- min: 0,
- allowPercent: true,
- enums: ['auto'],
- multiple: true
- },
- bgPos: {
- number: true,
- allowPercent: true,
- multiple: true
- },
- bgRelativeTo: {
- enums: ['inner', 'include-padding'],
- multiple: true
- },
- bgRepeat: {
- enums: ['repeat', 'repeat-x', 'repeat-y', 'no-repeat'],
- multiple: true
- },
- bgFit: {
- enums: ['none', 'contain', 'cover'],
- multiple: true
- },
- bgCrossOrigin: {
- enums: ['anonymous', 'use-credentials', 'null'],
- multiple: true
- },
- bgClip: {
- enums: ['none', 'node'],
- multiple: true
- },
- bgContainment: {
- enums: ['inside', 'over'],
- multiple: true
- },
- color: {
- color: true
- },
- colors: {
- color: true,
- multiple: true
- },
- fill: {
- enums: ['solid', 'linear-gradient', 'radial-gradient']
- },
- bool: {
- enums: ['yes', 'no']
- },
- bools: {
- enums: ['yes', 'no'],
- multiple: true
- },
- lineStyle: {
- enums: ['solid', 'dotted', 'dashed']
- },
- lineCap: {
- enums: ['butt', 'round', 'square']
- },
- borderStyle: {
- enums: ['solid', 'dotted', 'dashed', 'double']
- },
- curveStyle: {
- enums: ['bezier', 'unbundled-bezier', 'haystack', 'segments', 'straight', 'straight-triangle', 'taxi']
- },
- fontFamily: {
- regex: '^([\\w- \\"]+(?:\\s*,\\s*[\\w- \\"]+)*)$'
- },
- fontStyle: {
- enums: ['italic', 'normal', 'oblique']
- },
- fontWeight: {
- enums: ['normal', 'bold', 'bolder', 'lighter', '100', '200', '300', '400', '500', '600', '800', '900', 100, 200, 300, 400, 500, 600, 700, 800, 900]
- },
- textDecoration: {
- enums: ['none', 'underline', 'overline', 'line-through']
- },
- textTransform: {
- enums: ['none', 'uppercase', 'lowercase']
- },
- textWrap: {
- enums: ['none', 'wrap', 'ellipsis']
- },
- textOverflowWrap: {
- enums: ['whitespace', 'anywhere']
- },
- textBackgroundShape: {
- enums: ['rectangle', 'roundrectangle', 'round-rectangle']
- },
- nodeShape: {
- enums: ['rectangle', 'roundrectangle', 'round-rectangle', 'cutrectangle', 'cut-rectangle', 'bottomroundrectangle', 'bottom-round-rectangle', 'barrel', 'ellipse', 'triangle', 'round-triangle', 'square', 'pentagon', 'round-pentagon', 'hexagon', 'round-hexagon', 'concavehexagon', 'concave-hexagon', 'heptagon', 'round-heptagon', 'octagon', 'round-octagon', 'tag', 'round-tag', 'star', 'diamond', 'round-diamond', 'vee', 'rhomboid', 'right-rhomboid', 'polygon']
- },
- overlayShape: {
- enums: ['roundrectangle', 'round-rectangle', 'ellipse']
- },
- compoundIncludeLabels: {
- enums: ['include', 'exclude']
- },
- arrowShape: {
- enums: ['tee', 'triangle', 'triangle-tee', 'circle-triangle', 'triangle-cross', 'triangle-backcurve', 'vee', 'square', 'circle', 'diamond', 'chevron', 'none']
- },
- arrowFill: {
- enums: ['filled', 'hollow']
- },
- display: {
- enums: ['element', 'none']
- },
- visibility: {
- enums: ['hidden', 'visible']
- },
- zCompoundDepth: {
- enums: ['bottom', 'orphan', 'auto', 'top']
- },
- zIndexCompare: {
- enums: ['auto', 'manual']
- },
- valign: {
- enums: ['top', 'center', 'bottom']
- },
- halign: {
- enums: ['left', 'center', 'right']
- },
- justification: {
- enums: ['left', 'center', 'right', 'auto']
- },
- text: {
- string: true
- },
- data: {
- mapping: true,
- regex: data('data')
- },
- layoutData: {
- mapping: true,
- regex: data('layoutData')
- },
- scratch: {
- mapping: true,
- regex: data('scratch')
- },
- mapData: {
- mapping: true,
- regex: mapData('mapData')
- },
- mapLayoutData: {
- mapping: true,
- regex: mapData('mapLayoutData')
- },
- mapScratch: {
- mapping: true,
- regex: mapData('mapScratch')
- },
- fn: {
- mapping: true,
- fn: true
- },
- url: {
- regexes: urlRegexes,
- singleRegexMatchValue: true
- },
- urls: {
- regexes: urlRegexes,
- singleRegexMatchValue: true,
- multiple: true
- },
- propList: {
- propList: true
- },
- angle: {
- number: true,
- units: 'deg|rad',
- implicitUnits: 'rad'
- },
- textRotation: {
- number: true,
- units: 'deg|rad',
- implicitUnits: 'rad',
- enums: ['none', 'autorotate']
- },
- polygonPointList: {
- number: true,
- multiple: true,
- evenMultiple: true,
- min: -1,
- max: 1,
- unitless: true
- },
- edgeDistances: {
- enums: ['intersection', 'node-position', 'endpoints']
- },
- edgeEndpoint: {
- number: true,
- multiple: true,
- units: '%|px|em|deg|rad',
- implicitUnits: 'px',
- enums: ['inside-to-node', 'outside-to-node', 'outside-to-node-or-label', 'outside-to-line', 'outside-to-line-or-label'],
- singleEnum: true,
- validate: function validate(valArr, unitsArr) {
- switch (valArr.length) {
- case 2:
- // can be % or px only
- return unitsArr[0] !== 'deg' && unitsArr[0] !== 'rad' && unitsArr[1] !== 'deg' && unitsArr[1] !== 'rad';
- case 1:
- // can be enum, deg, or rad only
- return string(valArr[0]) || unitsArr[0] === 'deg' || unitsArr[0] === 'rad';
- default:
- return false;
+ // Save currently visited nodes as a tree in our forest. Reset
+ // visited and parents lists. Continue with the next component of
+ // the graph, if any.
+ else {
+ var temp = [].concat(_toConsumableArray(visited));
+ flatForest.push(temp);
+ //flatForest = flatForest.concat(temp);
+ //unProcessedNodes.removeAll(visited);
+ for (var i = 0; i < temp.length; i++) {
+ var value = temp[i];
+ var index = unProcessedNodes.indexOf(value);
+ if (index > -1) {
+ unProcessedNodes.splice(index, 1);
+ }
}
+ visited = new Set();
+ parents = new Map();
}
- },
- easing: {
- regexes: ['^(spring)\\s*\\(\\s*(' + number$1 + ')\\s*,\\s*(' + number$1 + ')\\s*\\)$', '^(cubic-bezier)\\s*\\(\\s*(' + number$1 + ')\\s*,\\s*(' + number$1 + ')\\s*,\\s*(' + number$1 + ')\\s*,\\s*(' + number$1 + ')\\s*\\)$'],
- enums: ['linear', 'ease', 'ease-in', 'ease-out', 'ease-in-out', 'ease-in-sine', 'ease-out-sine', 'ease-in-out-sine', 'ease-in-quad', 'ease-out-quad', 'ease-in-out-quad', 'ease-in-cubic', 'ease-out-cubic', 'ease-in-out-cubic', 'ease-in-quart', 'ease-out-quart', 'ease-in-out-quart', 'ease-in-quint', 'ease-out-quint', 'ease-in-out-quint', 'ease-in-expo', 'ease-out-expo', 'ease-in-out-expo', 'ease-in-circ', 'ease-out-circ', 'ease-in-out-circ']
- },
- gradientDirection: {
- enums: ['to-bottom', 'to-top', 'to-left', 'to-right', 'to-bottom-right', 'to-bottom-left', 'to-top-right', 'to-top-left', 'to-right-bottom', 'to-left-bottom', 'to-right-top', 'to-left-top' // different order
- ]
- },
+ }
- boundsExpansion: {
- number: true,
- multiple: true,
- min: 0,
- validate: function validate(valArr) {
- var length = valArr.length;
- return length === 1 || length === 2 || length === 4;
- }
+ return flatForest;
+};
+
+/**
+ * This method creates dummy nodes (an l-level node with minimal dimensions)
+ * for the given edge (one per bendpoint). The existing l-level structure
+ * is updated accordingly.
+ */
+Layout.prototype.createDummyNodesForBendpoints = function (edge) {
+ var dummyNodes = [];
+ var prev = edge.source;
+
+ var graph = this.graphManager.calcLowestCommonAncestor(edge.source, edge.target);
+
+ for (var i = 0; i < edge.bendpoints.length; i++) {
+ // create new dummy node
+ var dummyNode = this.newNode(null);
+ dummyNode.setRect(new Point(0, 0), new Dimension(1, 1));
+
+ graph.add(dummyNode);
+
+ // create new dummy edge between prev and dummy node
+ var dummyEdge = this.newEdge(null);
+ this.graphManager.add(dummyEdge, prev, dummyNode);
+
+ dummyNodes.add(dummyNode);
+ prev = dummyNode;
+ }
+
+ var dummyEdge = this.newEdge(null);
+ this.graphManager.add(dummyEdge, prev, edge.target);
+
+ this.edgeToDummyNodes.set(edge, dummyNodes);
+
+ // remove real edge from graph manager if it is inter-graph
+ if (edge.isInterGraph()) {
+ this.graphManager.remove(edge);
+ }
+ // else, remove the edge from the current graph
+ else {
+ graph.remove(edge);
}
- };
- var diff = {
- zeroNonZero: function zeroNonZero(val1, val2) {
- if ((val1 == null || val2 == null) && val1 !== val2) {
- return true; // null cases could represent any value
- }
- if (val1 == 0 && val2 != 0) {
- return true;
- } else if (val1 != 0 && val2 == 0) {
- return true;
- } else {
- return false;
+
+ return dummyNodes;
+};
+
+/**
+ * This method creates bendpoints for edges from the dummy nodes
+ * at l-level.
+ */
+Layout.prototype.createBendpointsFromDummyNodes = function () {
+ var edges = [];
+ edges = edges.concat(this.graphManager.getAllEdges());
+ edges = [].concat(_toConsumableArray(this.edgeToDummyNodes.keys())).concat(edges);
+
+ for (var k = 0; k < edges.length; k++) {
+ var lEdge = edges[k];
+
+ if (lEdge.bendpoints.length > 0) {
+ var path = this.edgeToDummyNodes.get(lEdge);
+
+ for (var i = 0; i < path.length; i++) {
+ var dummyNode = path[i];
+ var p = new PointD(dummyNode.getCenterX(), dummyNode.getCenterY());
+
+ // update bendpoint's location according to dummy node
+ var ebp = lEdge.bendpoints.get(i);
+ ebp.x = p.x;
+ ebp.y = p.y;
+
+ // remove the dummy node, dummy edges incident with this
+ // dummy node is also removed (within the remove method)
+ dummyNode.getOwner().remove(dummyNode);
}
- },
- any: function any(val1, val2) {
- return val1 != val2;
- },
- emptyNonEmpty: function emptyNonEmpty(str1, str2) {
- var empty1 = emptyString(str1);
- var empty2 = emptyString(str2);
- return empty1 && !empty2 || !empty1 && empty2;
+
+ // add the real edge to graph
+ this.graphManager.add(lEdge, lEdge.source, lEdge.target);
}
- };
+ }
+};
- // define visual style properties
- //
- // - n.b. adding a new group of props may require updates to updateStyleHints()
- // - adding new props to an existing group gets handled automatically
+Layout.transform = function (sliderValue, defaultValue, minDiv, maxMul) {
+ if (minDiv != undefined && maxMul != undefined) {
+ var value = defaultValue;
- var t = styfn$2.types;
- var mainLabel = [{
- name: 'label',
- type: t.text,
- triggersBounds: diff.any,
- triggersZOrder: diff.emptyNonEmpty
- }, {
- name: 'text-rotation',
- type: t.textRotation,
- triggersBounds: diff.any
- }, {
- name: 'text-margin-x',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'text-margin-y',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }];
- var sourceLabel = [{
- name: 'source-label',
- type: t.text,
- triggersBounds: diff.any
- }, {
- name: 'source-text-rotation',
- type: t.textRotation,
- triggersBounds: diff.any
- }, {
- name: 'source-text-margin-x',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'source-text-margin-y',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'source-text-offset',
- type: t.size,
- triggersBounds: diff.any
- }];
- var targetLabel = [{
- name: 'target-label',
- type: t.text,
- triggersBounds: diff.any
- }, {
- name: 'target-text-rotation',
- type: t.textRotation,
- triggersBounds: diff.any
- }, {
- name: 'target-text-margin-x',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'target-text-margin-y',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'target-text-offset',
- type: t.size,
- triggersBounds: diff.any
- }];
- var labelDimensions = [{
- name: 'font-family',
- type: t.fontFamily,
- triggersBounds: diff.any
- }, {
- name: 'font-style',
- type: t.fontStyle,
- triggersBounds: diff.any
- }, {
- name: 'font-weight',
- type: t.fontWeight,
- triggersBounds: diff.any
- }, {
- name: 'font-size',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'text-transform',
- type: t.textTransform,
- triggersBounds: diff.any
- }, {
- name: 'text-wrap',
- type: t.textWrap,
- triggersBounds: diff.any
- }, {
- name: 'text-overflow-wrap',
- type: t.textOverflowWrap,
- triggersBounds: diff.any
- }, {
- name: 'text-max-width',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'text-outline-width',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'line-height',
- type: t.positiveNumber,
- triggersBounds: diff.any
- }];
- var commonLabel = [{
- name: 'text-valign',
- type: t.valign,
- triggersBounds: diff.any
- }, {
- name: 'text-halign',
- type: t.halign,
- triggersBounds: diff.any
- }, {
- name: 'color',
- type: t.color
- }, {
- name: 'text-outline-color',
- type: t.color
- }, {
- name: 'text-outline-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'text-background-color',
- type: t.color
- }, {
- name: 'text-background-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'text-background-padding',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'text-border-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'text-border-color',
- type: t.color
- }, {
- name: 'text-border-width',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'text-border-style',
- type: t.borderStyle,
- triggersBounds: diff.any
- }, {
- name: 'text-background-shape',
- type: t.textBackgroundShape,
- triggersBounds: diff.any
- }, {
- name: 'text-justification',
- type: t.justification
- }];
- var behavior = [{
- name: 'events',
- type: t.bool,
- triggersZOrder: diff.any
- }, {
- name: 'text-events',
- type: t.bool,
- triggersZOrder: diff.any
- }];
- var visibility = [{
- name: 'display',
- type: t.display,
- triggersZOrder: diff.any,
- triggersBounds: diff.any,
- triggersBoundsOfParallelBeziers: true
- }, {
- name: 'visibility',
- type: t.visibility,
- triggersZOrder: diff.any
- }, {
- name: 'opacity',
- type: t.zeroOneNumber,
- triggersZOrder: diff.zeroNonZero
- }, {
- name: 'text-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'min-zoomed-font-size',
- type: t.size
- }, {
- name: 'z-compound-depth',
- type: t.zCompoundDepth,
- triggersZOrder: diff.any
- }, {
- name: 'z-index-compare',
- type: t.zIndexCompare,
- triggersZOrder: diff.any
- }, {
- name: 'z-index',
- type: t.number,
- triggersZOrder: diff.any
- }];
- var overlay = [{
- name: 'overlay-padding',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'overlay-color',
- type: t.color
- }, {
- name: 'overlay-opacity',
- type: t.zeroOneNumber,
- triggersBounds: diff.zeroNonZero
- }, {
- name: 'overlay-shape',
- type: t.overlayShape,
- triggersBounds: diff.any
- }];
- var underlay = [{
- name: 'underlay-padding',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'underlay-color',
- type: t.color
- }, {
- name: 'underlay-opacity',
- type: t.zeroOneNumber,
- triggersBounds: diff.zeroNonZero
- }, {
- name: 'underlay-shape',
- type: t.overlayShape,
- triggersBounds: diff.any
- }];
- var transition = [{
- name: 'transition-property',
- type: t.propList
- }, {
- name: 'transition-duration',
- type: t.time
- }, {
- name: 'transition-delay',
- type: t.time
- }, {
- name: 'transition-timing-function',
- type: t.easing
- }];
- var nodeSizeHashOverride = function nodeSizeHashOverride(ele, parsedProp) {
- if (parsedProp.value === 'label') {
- return -ele.poolIndex(); // no hash key hits is using label size (hitrate for perf probably low anyway)
- } else {
- return parsedProp.pfValue;
- }
- };
- var nodeBody = [{
- name: 'height',
- type: t.nodeSize,
- triggersBounds: diff.any,
- hashOverride: nodeSizeHashOverride
- }, {
- name: 'width',
- type: t.nodeSize,
- triggersBounds: diff.any,
- hashOverride: nodeSizeHashOverride
- }, {
- name: 'shape',
- type: t.nodeShape,
- triggersBounds: diff.any
- }, {
- name: 'shape-polygon-points',
- type: t.polygonPointList,
- triggersBounds: diff.any
- }, {
- name: 'background-color',
- type: t.color
- }, {
- name: 'background-fill',
- type: t.fill
- }, {
- name: 'background-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'background-blacken',
- type: t.nOneOneNumber
- }, {
- name: 'background-gradient-stop-colors',
- type: t.colors
- }, {
- name: 'background-gradient-stop-positions',
- type: t.percentages
- }, {
- name: 'background-gradient-direction',
- type: t.gradientDirection
- }, {
- name: 'padding',
- type: t.sizeMaybePercent,
- triggersBounds: diff.any
- }, {
- name: 'padding-relative-to',
- type: t.paddingRelativeTo,
- triggersBounds: diff.any
- }, {
- name: 'bounds-expansion',
- type: t.boundsExpansion,
- triggersBounds: diff.any
- }];
- var nodeBorder = [{
- name: 'border-color',
- type: t.color
- }, {
- name: 'border-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'border-width',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'border-style',
- type: t.borderStyle
- }];
- var backgroundImage = [{
- name: 'background-image',
- type: t.urls
- }, {
- name: 'background-image-crossorigin',
- type: t.bgCrossOrigin
- }, {
- name: 'background-image-opacity',
- type: t.zeroOneNumbers
- }, {
- name: 'background-image-containment',
- type: t.bgContainment
- }, {
- name: 'background-image-smoothing',
- type: t.bools
- }, {
- name: 'background-position-x',
- type: t.bgPos
- }, {
- name: 'background-position-y',
- type: t.bgPos
- }, {
- name: 'background-width-relative-to',
- type: t.bgRelativeTo
- }, {
- name: 'background-height-relative-to',
- type: t.bgRelativeTo
- }, {
- name: 'background-repeat',
- type: t.bgRepeat
- }, {
- name: 'background-fit',
- type: t.bgFit
- }, {
- name: 'background-clip',
- type: t.bgClip
- }, {
- name: 'background-width',
- type: t.bgWH
- }, {
- name: 'background-height',
- type: t.bgWH
- }, {
- name: 'background-offset-x',
- type: t.bgPos
- }, {
- name: 'background-offset-y',
- type: t.bgPos
- }];
- var compound = [{
- name: 'position',
- type: t.position,
- triggersBounds: diff.any
- }, {
- name: 'compound-sizing-wrt-labels',
- type: t.compoundIncludeLabels,
- triggersBounds: diff.any
- }, {
- name: 'min-width',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'min-width-bias-left',
- type: t.sizeMaybePercent,
- triggersBounds: diff.any
- }, {
- name: 'min-width-bias-right',
- type: t.sizeMaybePercent,
- triggersBounds: diff.any
- }, {
- name: 'min-height',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'min-height-bias-top',
- type: t.sizeMaybePercent,
- triggersBounds: diff.any
- }, {
- name: 'min-height-bias-bottom',
- type: t.sizeMaybePercent,
- triggersBounds: diff.any
- }];
- var edgeLine = [{
- name: 'line-style',
- type: t.lineStyle
- }, {
- name: 'line-color',
- type: t.color
- }, {
- name: 'line-fill',
- type: t.fill
- }, {
- name: 'line-cap',
- type: t.lineCap
- }, {
- name: 'line-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'line-dash-pattern',
- type: t.numbers
- }, {
- name: 'line-dash-offset',
- type: t.number
- }, {
- name: 'line-gradient-stop-colors',
- type: t.colors
- }, {
- name: 'line-gradient-stop-positions',
- type: t.percentages
- }, {
- name: 'curve-style',
- type: t.curveStyle,
- triggersBounds: diff.any,
- triggersBoundsOfParallelBeziers: true
- }, {
- name: 'haystack-radius',
- type: t.zeroOneNumber,
- triggersBounds: diff.any
- }, {
- name: 'source-endpoint',
- type: t.edgeEndpoint,
- triggersBounds: diff.any
- }, {
- name: 'target-endpoint',
- type: t.edgeEndpoint,
- triggersBounds: diff.any
- }, {
- name: 'control-point-step-size',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'control-point-distances',
- type: t.bidirectionalSizes,
- triggersBounds: diff.any
- }, {
- name: 'control-point-weights',
- type: t.numbers,
- triggersBounds: diff.any
- }, {
- name: 'segment-distances',
- type: t.bidirectionalSizes,
- triggersBounds: diff.any
- }, {
- name: 'segment-weights',
- type: t.numbers,
- triggersBounds: diff.any
- }, {
- name: 'taxi-turn',
- type: t.bidirectionalSizeMaybePercent,
- triggersBounds: diff.any
- }, {
- name: 'taxi-turn-min-distance',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'taxi-direction',
- type: t.axisDirection,
- triggersBounds: diff.any
- }, {
- name: 'edge-distances',
- type: t.edgeDistances,
- triggersBounds: diff.any
- }, {
- name: 'arrow-scale',
- type: t.positiveNumber,
- triggersBounds: diff.any
- }, {
- name: 'loop-direction',
- type: t.angle,
- triggersBounds: diff.any
- }, {
- name: 'loop-sweep',
- type: t.angle,
- triggersBounds: diff.any
- }, {
- name: 'source-distance-from-node',
- type: t.size,
- triggersBounds: diff.any
- }, {
- name: 'target-distance-from-node',
- type: t.size,
- triggersBounds: diff.any
- }];
- var ghost = [{
- name: 'ghost',
- type: t.bool,
- triggersBounds: diff.any
- }, {
- name: 'ghost-offset-x',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'ghost-offset-y',
- type: t.bidirectionalSize,
- triggersBounds: diff.any
- }, {
- name: 'ghost-opacity',
- type: t.zeroOneNumber
- }];
- var core = [{
- name: 'selection-box-color',
- type: t.color
- }, {
- name: 'selection-box-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'selection-box-border-color',
- type: t.color
- }, {
- name: 'selection-box-border-width',
- type: t.size
- }, {
- name: 'active-bg-color',
- type: t.color
- }, {
- name: 'active-bg-opacity',
- type: t.zeroOneNumber
- }, {
- name: 'active-bg-size',
- type: t.size
- }, {
- name: 'outside-texture-bg-color',
- type: t.color
- }, {
- name: 'outside-texture-bg-opacity',
- type: t.zeroOneNumber
- }];
-
- // pie backgrounds for nodes
- var pie = [];
- styfn$2.pieBackgroundN = 16; // because the pie properties are numbered, give access to a constant N (for renderer use)
- pie.push({
- name: 'pie-size',
- type: t.sizeMaybePercent
- });
- for (var i = 1; i <= styfn$2.pieBackgroundN; i++) {
- pie.push({
- name: 'pie-' + i + '-background-color',
- type: t.color
- });
- pie.push({
- name: 'pie-' + i + '-background-size',
- type: t.percent
- });
- pie.push({
- name: 'pie-' + i + '-background-opacity',
- type: t.zeroOneNumber
- });
- }
-
- // edge arrows
- var edgeArrow = [];
- var arrowPrefixes = styfn$2.arrowPrefixes = ['source', 'mid-source', 'target', 'mid-target'];
- [{
- name: 'arrow-shape',
- type: t.arrowShape,
- triggersBounds: diff.any
- }, {
- name: 'arrow-color',
- type: t.color
- }, {
- name: 'arrow-fill',
- type: t.arrowFill
- }].forEach(function (prop) {
- arrowPrefixes.forEach(function (prefix) {
- var name = prefix + '-' + prop.name;
- var type = prop.type,
- triggersBounds = prop.triggersBounds;
- edgeArrow.push({
- name: name,
- type: type,
- triggersBounds: triggersBounds
- });
- });
- }, {});
- var props = styfn$2.properties = [].concat(behavior, transition, visibility, overlay, underlay, ghost, commonLabel, labelDimensions, mainLabel, sourceLabel, targetLabel, nodeBody, nodeBorder, backgroundImage, pie, compound, edgeLine, edgeArrow, core);
- var propGroups = styfn$2.propertyGroups = {
- // common to all eles
- behavior: behavior,
- transition: transition,
- visibility: visibility,
- overlay: overlay,
- underlay: underlay,
- ghost: ghost,
- // labels
- commonLabel: commonLabel,
- labelDimensions: labelDimensions,
- mainLabel: mainLabel,
- sourceLabel: sourceLabel,
- targetLabel: targetLabel,
- // node props
- nodeBody: nodeBody,
- nodeBorder: nodeBorder,
- backgroundImage: backgroundImage,
- pie: pie,
- compound: compound,
- // edge props
- edgeLine: edgeLine,
- edgeArrow: edgeArrow,
- core: core
- };
- var propGroupNames = styfn$2.propertyGroupNames = {};
- var propGroupKeys = styfn$2.propertyGroupKeys = Object.keys(propGroups);
- propGroupKeys.forEach(function (key) {
- propGroupNames[key] = propGroups[key].map(function (prop) {
- return prop.name;
- });
- propGroups[key].forEach(function (prop) {
- return prop.groupKey = key;
- });
- });
-
- // define aliases
- var aliases = styfn$2.aliases = [{
- name: 'content',
- pointsTo: 'label'
- }, {
- name: 'control-point-distance',
- pointsTo: 'control-point-distances'
- }, {
- name: 'control-point-weight',
- pointsTo: 'control-point-weights'
- }, {
- name: 'edge-text-rotation',
- pointsTo: 'text-rotation'
- }, {
- name: 'padding-left',
- pointsTo: 'padding'
- }, {
- name: 'padding-right',
- pointsTo: 'padding'
- }, {
- name: 'padding-top',
- pointsTo: 'padding'
- }, {
- name: 'padding-bottom',
- pointsTo: 'padding'
- }];
-
- // list of property names
- styfn$2.propertyNames = props.map(function (p) {
- return p.name;
- });
-
- // allow access of properties by name ( e.g. style.properties.height )
- for (var _i = 0; _i < props.length; _i++) {
- var prop = props[_i];
- props[prop.name] = prop; // allow lookup by name
- }
-
- // map aliases
- for (var _i2 = 0; _i2 < aliases.length; _i2++) {
- var alias = aliases[_i2];
- var pointsToProp = props[alias.pointsTo];
- var aliasProp = {
- name: alias.name,
- alias: true,
- pointsTo: pointsToProp
- };
-
- // add alias prop for parsing
- props.push(aliasProp);
- props[alias.name] = aliasProp; // allow lookup by name
- }
-})();
-
-styfn$2.getDefaultProperty = function (name) {
- return this.getDefaultProperties()[name];
-};
-styfn$2.getDefaultProperties = function () {
- var _p = this._private;
- if (_p.defaultProperties != null) {
- return _p.defaultProperties;
- }
- var rawProps = extend({
- // core props
- 'selection-box-color': '#ddd',
- 'selection-box-opacity': 0.65,
- 'selection-box-border-color': '#aaa',
- 'selection-box-border-width': 1,
- 'active-bg-color': 'black',
- 'active-bg-opacity': 0.15,
- 'active-bg-size': 30,
- 'outside-texture-bg-color': '#000',
- 'outside-texture-bg-opacity': 0.125,
- // common node/edge props
- 'events': 'yes',
- 'text-events': 'no',
- 'text-valign': 'top',
- 'text-halign': 'center',
- 'text-justification': 'auto',
- 'line-height': 1,
- 'color': '#000',
- 'text-outline-color': '#000',
- 'text-outline-width': 0,
- 'text-outline-opacity': 1,
- 'text-opacity': 1,
- 'text-decoration': 'none',
- 'text-transform': 'none',
- 'text-wrap': 'none',
- 'text-overflow-wrap': 'whitespace',
- 'text-max-width': 9999,
- 'text-background-color': '#000',
- 'text-background-opacity': 0,
- 'text-background-shape': 'rectangle',
- 'text-background-padding': 0,
- 'text-border-opacity': 0,
- 'text-border-width': 0,
- 'text-border-style': 'solid',
- 'text-border-color': '#000',
- 'font-family': 'Helvetica Neue, Helvetica, sans-serif',
- 'font-style': 'normal',
- 'font-weight': 'normal',
- 'font-size': 16,
- 'min-zoomed-font-size': 0,
- 'text-rotation': 'none',
- 'source-text-rotation': 'none',
- 'target-text-rotation': 'none',
- 'visibility': 'visible',
- 'display': 'element',
- 'opacity': 1,
- 'z-compound-depth': 'auto',
- 'z-index-compare': 'auto',
- 'z-index': 0,
- 'label': '',
- 'text-margin-x': 0,
- 'text-margin-y': 0,
- 'source-label': '',
- 'source-text-offset': 0,
- 'source-text-margin-x': 0,
- 'source-text-margin-y': 0,
- 'target-label': '',
- 'target-text-offset': 0,
- 'target-text-margin-x': 0,
- 'target-text-margin-y': 0,
- 'overlay-opacity': 0,
- 'overlay-color': '#000',
- 'overlay-padding': 10,
- 'overlay-shape': 'round-rectangle',
- 'underlay-opacity': 0,
- 'underlay-color': '#000',
- 'underlay-padding': 10,
- 'underlay-shape': 'round-rectangle',
- 'transition-property': 'none',
- 'transition-duration': 0,
- 'transition-delay': 0,
- 'transition-timing-function': 'linear',
- // node props
- 'background-blacken': 0,
- 'background-color': '#999',
- 'background-fill': 'solid',
- 'background-opacity': 1,
- 'background-image': 'none',
- 'background-image-crossorigin': 'anonymous',
- 'background-image-opacity': 1,
- 'background-image-containment': 'inside',
- 'background-image-smoothing': 'yes',
- 'background-position-x': '50%',
- 'background-position-y': '50%',
- 'background-offset-x': 0,
- 'background-offset-y': 0,
- 'background-width-relative-to': 'include-padding',
- 'background-height-relative-to': 'include-padding',
- 'background-repeat': 'no-repeat',
- 'background-fit': 'none',
- 'background-clip': 'node',
- 'background-width': 'auto',
- 'background-height': 'auto',
- 'border-color': '#000',
- 'border-opacity': 1,
- 'border-width': 0,
- 'border-style': 'solid',
- 'height': 30,
- 'width': 30,
- 'shape': 'ellipse',
- 'shape-polygon-points': '-1, -1, 1, -1, 1, 1, -1, 1',
- 'bounds-expansion': 0,
- // node gradient
- 'background-gradient-direction': 'to-bottom',
- 'background-gradient-stop-colors': '#999',
- 'background-gradient-stop-positions': '0%',
- // ghost props
- 'ghost': 'no',
- 'ghost-offset-y': 0,
- 'ghost-offset-x': 0,
- 'ghost-opacity': 0,
- // compound props
- 'padding': 0,
- 'padding-relative-to': 'width',
- 'position': 'origin',
- 'compound-sizing-wrt-labels': 'include',
- 'min-width': 0,
- 'min-width-bias-left': 0,
- 'min-width-bias-right': 0,
- 'min-height': 0,
- 'min-height-bias-top': 0,
- 'min-height-bias-bottom': 0
- }, {
- // node pie bg
- 'pie-size': '100%'
- }, [{
- name: 'pie-{{i}}-background-color',
- value: 'black'
- }, {
- name: 'pie-{{i}}-background-size',
- value: '0%'
- }, {
- name: 'pie-{{i}}-background-opacity',
- value: 1
- }].reduce(function (css, prop) {
- for (var i = 1; i <= styfn$2.pieBackgroundN; i++) {
- var name = prop.name.replace('{{i}}', i);
- var val = prop.value;
- css[name] = val;
- }
- return css;
- }, {}), {
- // edge props
- 'line-style': 'solid',
- 'line-color': '#999',
- 'line-fill': 'solid',
- 'line-cap': 'butt',
- 'line-opacity': 1,
- 'line-gradient-stop-colors': '#999',
- 'line-gradient-stop-positions': '0%',
- 'control-point-step-size': 40,
- 'control-point-weights': 0.5,
- 'segment-weights': 0.5,
- 'segment-distances': 20,
- 'taxi-turn': '50%',
- 'taxi-turn-min-distance': 10,
- 'taxi-direction': 'auto',
- 'edge-distances': 'intersection',
- 'curve-style': 'haystack',
- 'haystack-radius': 0,
- 'arrow-scale': 1,
- 'loop-direction': '-45deg',
- 'loop-sweep': '-90deg',
- 'source-distance-from-node': 0,
- 'target-distance-from-node': 0,
- 'source-endpoint': 'outside-to-node',
- 'target-endpoint': 'outside-to-node',
- 'line-dash-pattern': [6, 3],
- 'line-dash-offset': 0
- }, [{
- name: 'arrow-shape',
- value: 'none'
- }, {
- name: 'arrow-color',
- value: '#999'
- }, {
- name: 'arrow-fill',
- value: 'filled'
- }].reduce(function (css, prop) {
- styfn$2.arrowPrefixes.forEach(function (prefix) {
- var name = prefix + '-' + prop.name;
- var val = prop.value;
- css[name] = val;
- });
- return css;
- }, {}));
- var parsedProps = {};
- for (var i = 0; i < this.properties.length; i++) {
- var prop = this.properties[i];
- if (prop.pointsTo) {
- continue;
- }
- var name = prop.name;
- var val = rawProps[name];
- var parsedProp = this.parse(name, val);
- parsedProps[name] = parsedProp;
- }
- _p.defaultProperties = parsedProps;
- return _p.defaultProperties;
-};
-styfn$2.addDefaultStylesheet = function () {
- this.selector(':parent').css({
- 'shape': 'rectangle',
- 'padding': 10,
- 'background-color': '#eee',
- 'border-color': '#ccc',
- 'border-width': 1
- }).selector('edge').css({
- 'width': 3
- }).selector(':loop').css({
- 'curve-style': 'bezier'
- }).selector('edge:compound').css({
- 'curve-style': 'bezier',
- 'source-endpoint': 'outside-to-line',
- 'target-endpoint': 'outside-to-line'
- }).selector(':selected').css({
- 'background-color': '#0169D9',
- 'line-color': '#0169D9',
- 'source-arrow-color': '#0169D9',
- 'target-arrow-color': '#0169D9',
- 'mid-source-arrow-color': '#0169D9',
- 'mid-target-arrow-color': '#0169D9'
- }).selector(':parent:selected').css({
- 'background-color': '#CCE1F9',
- 'border-color': '#aec8e5'
- }).selector(':active').css({
- 'overlay-color': 'black',
- 'overlay-padding': 10,
- 'overlay-opacity': 0.25
- });
- this.defaultLength = this.length;
-};
-
-var styfn$1 = {};
-
-// a caching layer for property parsing
-styfn$1.parse = function (name, value, propIsBypass, propIsFlat) {
- var self = this;
-
- // function values can't be cached in all cases, and there isn't much benefit of caching them anyway
- if (fn$6(value)) {
- return self.parseImplWarn(name, value, propIsBypass, propIsFlat);
- }
- var flatKey = propIsFlat === 'mapping' || propIsFlat === true || propIsFlat === false || propIsFlat == null ? 'dontcare' : propIsFlat;
- var bypassKey = propIsBypass ? 't' : 'f';
- var valueKey = '' + value;
- var argHash = hashStrings(name, valueKey, bypassKey, flatKey);
- var propCache = self.propCache = self.propCache || [];
- var ret;
- if (!(ret = propCache[argHash])) {
- ret = propCache[argHash] = self.parseImplWarn(name, value, propIsBypass, propIsFlat);
- }
-
- // - bypasses can't be shared b/c the value can be changed by animations or otherwise overridden
- // - mappings can't be shared b/c mappings are per-element
- if (propIsBypass || propIsFlat === 'mapping') {
- // need a copy since props are mutated later in their lifecycles
- ret = copy(ret);
- if (ret) {
- ret.value = copy(ret.value); // because it could be an array, e.g. colour
- }
- }
-
- return ret;
-};
-styfn$1.parseImplWarn = function (name, value, propIsBypass, propIsFlat) {
- var prop = this.parseImpl(name, value, propIsBypass, propIsFlat);
- if (!prop && value != null) {
- warn("The style property `".concat(name, ": ").concat(value, "` is invalid"));
- }
- if (prop && (prop.name === 'width' || prop.name === 'height') && value === 'label') {
- warn('The style value of `label` is deprecated for `' + prop.name + '`');
- }
- return prop;
-};
-
-// parse a property; return null on invalid; return parsed property otherwise
-// fields :
-// - name : the name of the property
-// - value : the parsed, native-typed value of the property
-// - strValue : a string value that represents the property value in valid css
-// - bypass : true iff the property is a bypass property
-styfn$1.parseImpl = function (name, value, propIsBypass, propIsFlat) {
- var self = this;
- name = camel2dash(name); // make sure the property name is in dash form (e.g. 'property-name' not 'propertyName')
-
- var property = self.properties[name];
- var passedValue = value;
- var types = self.types;
- if (!property) {
- return null;
- } // return null on property of unknown name
- if (value === undefined) {
- return null;
- } // can't assign undefined
-
- // the property may be an alias
- if (property.alias) {
- property = property.pointsTo;
- name = property.name;
- }
- var valueIsString = string(value);
- if (valueIsString) {
- // trim the value to make parsing easier
- value = value.trim();
- }
- var type = property.type;
- if (!type) {
- return null;
- } // no type, no luck
-
- // check if bypass is null or empty string (i.e. indication to delete bypass property)
- if (propIsBypass && (value === '' || value === null)) {
- return {
- name: name,
- value: value,
- bypass: true,
- deleteBypass: true
- };
- }
-
- // check if value is a function used as a mapper
- if (fn$6(value)) {
- return {
- name: name,
- value: value,
- strValue: 'fn',
- mapped: types.fn,
- bypass: propIsBypass
- };
- }
-
- // check if value is mapped
- var data, mapData;
- if (!valueIsString || propIsFlat || value.length < 7 || value[1] !== 'a') ; else if (value.length >= 7 && value[0] === 'd' && (data = new RegExp(types.data.regex).exec(value))) {
- if (propIsBypass) {
- return false;
- } // mappers not allowed in bypass
-
- var mapped = types.data;
- return {
- name: name,
- value: data,
- strValue: '' + value,
- mapped: mapped,
- field: data[1],
- bypass: propIsBypass
- };
- } else if (value.length >= 10 && value[0] === 'm' && (mapData = new RegExp(types.mapData.regex).exec(value))) {
- if (propIsBypass) {
- return false;
- } // mappers not allowed in bypass
- if (type.multiple) {
- return false;
- } // impossible to map to num
-
- var _mapped = types.mapData;
-
- // we can map only if the type is a colour or a number
- if (!(type.color || type.number)) {
- return false;
- }
- var valueMin = this.parse(name, mapData[4]); // parse to validate
- if (!valueMin || valueMin.mapped) {
- return false;
- } // can't be invalid or mapped
-
- var valueMax = this.parse(name, mapData[5]); // parse to validate
- if (!valueMax || valueMax.mapped) {
- return false;
- } // can't be invalid or mapped
-
- // check if valueMin and valueMax are the same
- if (valueMin.pfValue === valueMax.pfValue || valueMin.strValue === valueMax.strValue) {
- warn('`' + name + ': ' + value + '` is not a valid mapper because the output range is zero; converting to `' + name + ': ' + valueMin.strValue + '`');
- return this.parse(name, valueMin.strValue); // can't make much of a mapper without a range
- } else if (type.color) {
- var c1 = valueMin.value;
- var c2 = valueMax.value;
- var same = c1[0] === c2[0] // red
- && c1[1] === c2[1] // green
- && c1[2] === c2[2] // blue
- && (
- // optional alpha
- c1[3] === c2[3] // same alpha outright
- || (c1[3] == null || c1[3] === 1 // full opacity for colour 1?
- ) && (c2[3] == null || c2[3] === 1) // full opacity for colour 2?
- );
-
- if (same) {
- return false;
- } // can't make a mapper without a range
- }
-
- return {
- name: name,
- value: mapData,
- strValue: '' + value,
- mapped: _mapped,
- field: mapData[1],
- fieldMin: parseFloat(mapData[2]),
- // min & max are numeric
- fieldMax: parseFloat(mapData[3]),
- valueMin: valueMin.value,
- valueMax: valueMax.value,
- bypass: propIsBypass
- };
- }
- if (type.multiple && propIsFlat !== 'multiple') {
- var vals;
- if (valueIsString) {
- vals = value.split(/\s+/);
- } else if (array(value)) {
- vals = value;
- } else {
- vals = [value];
- }
- if (type.evenMultiple && vals.length % 2 !== 0) {
- return null;
- }
- var valArr = [];
- var unitsArr = [];
- var pfValArr = [];
- var strVal = '';
- var hasEnum = false;
- for (var i = 0; i < vals.length; i++) {
- var p = self.parse(name, vals[i], propIsBypass, 'multiple');
- hasEnum = hasEnum || string(p.value);
- valArr.push(p.value);
- pfValArr.push(p.pfValue != null ? p.pfValue : p.value);
- unitsArr.push(p.units);
- strVal += (i > 0 ? ' ' : '') + p.strValue;
- }
- if (type.validate && !type.validate(valArr, unitsArr)) {
- return null;
- }
- if (type.singleEnum && hasEnum) {
- if (valArr.length === 1 && string(valArr[0])) {
- return {
- name: name,
- value: valArr[0],
- strValue: valArr[0],
- bypass: propIsBypass
- };
- } else {
- return null;
- }
- }
- return {
- name: name,
- value: valArr,
- pfValue: pfValArr,
- strValue: strVal,
- bypass: propIsBypass,
- units: unitsArr
- };
- }
-
- // several types also allow enums
- var checkEnums = function checkEnums() {
- for (var _i = 0; _i < type.enums.length; _i++) {
- var en = type.enums[_i];
- if (en === value) {
- return {
- name: name,
- value: value,
- strValue: '' + value,
- bypass: propIsBypass
- };
- }
- }
- return null;
- };
-
- // check the type and return the appropriate object
- if (type.number) {
- var units;
- var implicitUnits = 'px'; // not set => px
-
- if (type.units) {
- // use specified units if set
- units = type.units;
- }
- if (type.implicitUnits) {
- implicitUnits = type.implicitUnits;
- }
- if (!type.unitless) {
- if (valueIsString) {
- var unitsRegex = 'px|em' + (type.allowPercent ? '|\\%' : '');
- if (units) {
- unitsRegex = units;
- } // only allow explicit units if so set
- var match = value.match('^(' + number + ')(' + unitsRegex + ')?' + '$');
- if (match) {
- value = match[1];
- units = match[2] || implicitUnits;
- }
- } else if (!units || type.implicitUnits) {
- units = implicitUnits; // implicitly px if unspecified
- }
- }
-
- value = parseFloat(value);
-
- // if not a number and enums not allowed, then the value is invalid
- if (isNaN(value) && type.enums === undefined) {
- return null;
- }
-
- // check if this number type also accepts special keywords in place of numbers
- // (i.e. `left`, `auto`, etc)
- if (isNaN(value) && type.enums !== undefined) {
- value = passedValue;
- return checkEnums();
- }
-
- // check if value must be an integer
- if (type.integer && !integer(value)) {
- return null;
- }
-
- // check value is within range
- if (type.min !== undefined && (value < type.min || type.strictMin && value === type.min) || type.max !== undefined && (value > type.max || type.strictMax && value === type.max)) {
- return null;
- }
- var ret = {
- name: name,
- value: value,
- strValue: '' + value + (units ? units : ''),
- units: units,
- bypass: propIsBypass
- };
-
- // normalise value in pixels
- if (type.unitless || units !== 'px' && units !== 'em') {
- ret.pfValue = value;
- } else {
- ret.pfValue = units === 'px' || !units ? value : this.getEmSizeInPixels() * value;
- }
-
- // normalise value in ms
- if (units === 'ms' || units === 's') {
- ret.pfValue = units === 'ms' ? value : 1000 * value;
- }
-
- // normalise value in rad
- if (units === 'deg' || units === 'rad') {
- ret.pfValue = units === 'rad' ? value : deg2rad(value);
- }
-
- // normalize value in %
- if (units === '%') {
- ret.pfValue = value / 100;
- }
- return ret;
- } else if (type.propList) {
- var props = [];
- var propsStr = '' + value;
- if (propsStr === 'none') ; else {
- // go over each prop
-
- var propsSplit = propsStr.split(/\s*,\s*|\s+/);
- for (var _i2 = 0; _i2 < propsSplit.length; _i2++) {
- var propName = propsSplit[_i2].trim();
- if (self.properties[propName]) {
- props.push(propName);
- } else {
- warn('`' + propName + '` is not a valid property name');
- }
- }
- if (props.length === 0) {
- return null;
- }
- }
- return {
- name: name,
- value: props,
- strValue: props.length === 0 ? 'none' : props.join(' '),
- bypass: propIsBypass
- };
- } else if (type.color) {
- var tuple = color2tuple(value);
- if (!tuple) {
- return null;
- }
- return {
- name: name,
- value: tuple,
- pfValue: tuple,
- strValue: 'rgb(' + tuple[0] + ',' + tuple[1] + ',' + tuple[2] + ')',
- // n.b. no spaces b/c of multiple support
- bypass: propIsBypass
- };
- } else if (type.regex || type.regexes) {
- // first check enums
- if (type.enums) {
- var enumProp = checkEnums();
- if (enumProp) {
- return enumProp;
- }
- }
- var regexes = type.regexes ? type.regexes : [type.regex];
- for (var _i3 = 0; _i3 < regexes.length; _i3++) {
- var regex = new RegExp(regexes[_i3]); // make a regex from the type string
- var m = regex.exec(value);
- if (m) {
- // regex matches
- return {
- name: name,
- value: type.singleRegexMatchValue ? m[1] : m,
- strValue: '' + value,
- bypass: propIsBypass
- };
- }
- }
- return null; // didn't match any
- } else if (type.string) {
- // just return
- return {
- name: name,
- value: '' + value,
- strValue: '' + value,
- bypass: propIsBypass
- };
- } else if (type.enums) {
- // check enums last because it's a combo type in others
- return checkEnums();
- } else {
- return null; // not a type we can handle
- }
-};
-
-var Style = function Style(cy) {
- if (!(this instanceof Style)) {
- return new Style(cy);
- }
- if (!core(cy)) {
- error('A style must have a core reference');
- return;
- }
- this._private = {
- cy: cy,
- coreStyle: {}
- };
- this.length = 0;
- this.resetToDefault();
-};
-var styfn = Style.prototype;
-styfn.instanceString = function () {
- return 'style';
-};
-
-// remove all contexts
-styfn.clear = function () {
- var _p = this._private;
- var cy = _p.cy;
- var eles = cy.elements();
- for (var i = 0; i < this.length; i++) {
- this[i] = undefined;
- }
- this.length = 0;
- _p.contextStyles = {};
- _p.propDiffs = {};
- this.cleanElements(eles, true);
- eles.forEach(function (ele) {
- var ele_p = ele[0]._private;
- ele_p.styleDirty = true;
- ele_p.appliedInitStyle = false;
- });
- return this; // chaining
-};
-
-styfn.resetToDefault = function () {
- this.clear();
- this.addDefaultStylesheet();
- return this;
-};
-
-// builds a style object for the 'core' selector
-styfn.core = function (propName) {
- return this._private.coreStyle[propName] || this.getDefaultProperty(propName);
-};
-
-// create a new context from the specified selector string and switch to that context
-styfn.selector = function (selectorStr) {
- // 'core' is a special case and does not need a selector
- var selector = selectorStr === 'core' ? null : new Selector(selectorStr);
- var i = this.length++; // new context means new index
- this[i] = {
- selector: selector,
- properties: [],
- mappedProperties: [],
- index: i
- };
- return this; // chaining
-};
-
-// add one or many css rules to the current context
-styfn.css = function () {
- var self = this;
- var args = arguments;
- if (args.length === 1) {
- var map = args[0];
- for (var i = 0; i < self.properties.length; i++) {
- var prop = self.properties[i];
- var mapVal = map[prop.name];
- if (mapVal === undefined) {
- mapVal = map[dash2camel(prop.name)];
- }
- if (mapVal !== undefined) {
- this.cssRule(prop.name, mapVal);
- }
- }
- } else if (args.length === 2) {
- this.cssRule(args[0], args[1]);
- }
-
- // do nothing if args are invalid
-
- return this; // chaining
-};
-
-styfn.style = styfn.css;
-
-// add a single css rule to the current context
-styfn.cssRule = function (name, value) {
- // name-value pair
- var property = this.parse(name, value);
-
- // add property to current context if valid
- if (property) {
- var i = this.length - 1;
- this[i].properties.push(property);
- this[i].properties[property.name] = property; // allow access by name as well
-
- if (property.name.match(/pie-(\d+)-background-size/) && property.value) {
- this._private.hasPie = true;
- }
- if (property.mapped) {
- this[i].mappedProperties.push(property);
- }
-
- // add to core style if necessary
- var currentSelectorIsCore = !this[i].selector;
- if (currentSelectorIsCore) {
- this._private.coreStyle[property.name] = property;
- }
- }
- return this; // chaining
-};
-
-styfn.append = function (style) {
- if (stylesheet(style)) {
- style.appendToStyle(this);
- } else if (array(style)) {
- this.appendFromJson(style);
- } else if (string(style)) {
- this.appendFromString(style);
- } // you probably wouldn't want to append a Style, since you'd duplicate the default parts
-
- return this;
-};
-
-// static function
-Style.fromJson = function (cy, json) {
- var style = new Style(cy);
- style.fromJson(json);
- return style;
-};
-Style.fromString = function (cy, string) {
- return new Style(cy).fromString(string);
-};
-[styfn$8, styfn$7, styfn$6, styfn$5, styfn$4, styfn$3, styfn$2, styfn$1].forEach(function (props) {
- extend(styfn, props);
-});
-Style.types = styfn.types;
-Style.properties = styfn.properties;
-Style.propertyGroups = styfn.propertyGroups;
-Style.propertyGroupNames = styfn.propertyGroupNames;
-Style.propertyGroupKeys = styfn.propertyGroupKeys;
-
-var corefn$2 = {
- style: function style(newStyle) {
- if (newStyle) {
- var s = this.setStyle(newStyle);
- s.update();
- }
- return this._private.style;
- },
- setStyle: function setStyle(style) {
- var _p = this._private;
- if (stylesheet(style)) {
- _p.style = style.generateStyle(this);
- } else if (array(style)) {
- _p.style = Style.fromJson(this, style);
- } else if (string(style)) {
- _p.style = Style.fromString(this, style);
- } else {
- _p.style = Style(this);
- }
- return _p.style;
- },
- // e.g. cy.data() changed => recalc ele mappers
- updateStyle: function updateStyle() {
- this.mutableElements().updateStyle(); // just send to all eles
- }
-};
-
-var defaultSelectionType = 'single';
-var corefn$1 = {
- autolock: function autolock(bool) {
- if (bool !== undefined) {
- this._private.autolock = bool ? true : false;
- } else {
- return this._private.autolock;
- }
- return this; // chaining
- },
-
- autoungrabify: function autoungrabify(bool) {
- if (bool !== undefined) {
- this._private.autoungrabify = bool ? true : false;
- } else {
- return this._private.autoungrabify;
- }
- return this; // chaining
- },
-
- autounselectify: function autounselectify(bool) {
- if (bool !== undefined) {
- this._private.autounselectify = bool ? true : false;
- } else {
- return this._private.autounselectify;
- }
- return this; // chaining
- },
-
- selectionType: function selectionType(selType) {
- var _p = this._private;
- if (_p.selectionType == null) {
- _p.selectionType = defaultSelectionType;
- }
- if (selType !== undefined) {
- if (selType === 'additive' || selType === 'single') {
- _p.selectionType = selType;
- }
- } else {
- return _p.selectionType;
- }
- return this;
- },
- panningEnabled: function panningEnabled(bool) {
- if (bool !== undefined) {
- this._private.panningEnabled = bool ? true : false;
- } else {
- return this._private.panningEnabled;
- }
- return this; // chaining
- },
-
- userPanningEnabled: function userPanningEnabled(bool) {
- if (bool !== undefined) {
- this._private.userPanningEnabled = bool ? true : false;
- } else {
- return this._private.userPanningEnabled;
- }
- return this; // chaining
- },
-
- zoomingEnabled: function zoomingEnabled(bool) {
- if (bool !== undefined) {
- this._private.zoomingEnabled = bool ? true : false;
- } else {
- return this._private.zoomingEnabled;
- }
- return this; // chaining
- },
-
- userZoomingEnabled: function userZoomingEnabled(bool) {
- if (bool !== undefined) {
- this._private.userZoomingEnabled = bool ? true : false;
- } else {
- return this._private.userZoomingEnabled;
- }
- return this; // chaining
- },
-
- boxSelectionEnabled: function boxSelectionEnabled(bool) {
- if (bool !== undefined) {
- this._private.boxSelectionEnabled = bool ? true : false;
- } else {
- return this._private.boxSelectionEnabled;
- }
- return this; // chaining
- },
-
- pan: function pan() {
- var args = arguments;
- var pan = this._private.pan;
- var dim, val, dims, x, y;
- switch (args.length) {
- case 0:
- // .pan()
- return pan;
- case 1:
- if (string(args[0])) {
- // .pan('x')
- dim = args[0];
- return pan[dim];
- } else if (plainObject(args[0])) {
- // .pan({ x: 0, y: 100 })
- if (!this._private.panningEnabled) {
- return this;
- }
- dims = args[0];
- x = dims.x;
- y = dims.y;
- if (number$1(x)) {
- pan.x = x;
- }
- if (number$1(y)) {
- pan.y = y;
- }
- this.emit('pan viewport');
- }
- break;
- case 2:
- // .pan('x', 100)
- if (!this._private.panningEnabled) {
- return this;
- }
- dim = args[0];
- val = args[1];
- if ((dim === 'x' || dim === 'y') && number$1(val)) {
- pan[dim] = val;
- }
- this.emit('pan viewport');
- break;
- // invalid
- }
-
- this.notify('viewport');
- return this; // chaining
- },
-
- panBy: function panBy(arg0, arg1) {
- var args = arguments;
- var pan = this._private.pan;
- var dim, val, dims, x, y;
- if (!this._private.panningEnabled) {
- return this;
- }
- switch (args.length) {
- case 1:
- if (plainObject(arg0)) {
- // .panBy({ x: 0, y: 100 })
- dims = args[0];
- x = dims.x;
- y = dims.y;
- if (number$1(x)) {
- pan.x += x;
- }
- if (number$1(y)) {
- pan.y += y;
- }
- this.emit('pan viewport');
- }
- break;
- case 2:
- // .panBy('x', 100)
- dim = arg0;
- val = arg1;
- if ((dim === 'x' || dim === 'y') && number$1(val)) {
- pan[dim] += val;
- }
- this.emit('pan viewport');
- break;
- // invalid
- }
-
- this.notify('viewport');
- return this; // chaining
- },
-
- fit: function fit(elements, padding) {
- var viewportState = this.getFitViewport(elements, padding);
- if (viewportState) {
- var _p = this._private;
- _p.zoom = viewportState.zoom;
- _p.pan = viewportState.pan;
- this.emit('pan zoom viewport');
- this.notify('viewport');
- }
- return this; // chaining
- },
-
- getFitViewport: function getFitViewport(elements, padding) {
- if (number$1(elements) && padding === undefined) {
- // elements is optional
- padding = elements;
- elements = undefined;
- }
- if (!this._private.panningEnabled || !this._private.zoomingEnabled) {
- return;
- }
- var bb;
- if (string(elements)) {
- var sel = elements;
- elements = this.$(sel);
- } else if (boundingBox(elements)) {
- // assume bb
- var bbe = elements;
- bb = {
- x1: bbe.x1,
- y1: bbe.y1,
- x2: bbe.x2,
- y2: bbe.y2
- };
- bb.w = bb.x2 - bb.x1;
- bb.h = bb.y2 - bb.y1;
- } else if (!elementOrCollection(elements)) {
- elements = this.mutableElements();
- }
- if (elementOrCollection(elements) && elements.empty()) {
- return;
- } // can't fit to nothing
-
- bb = bb || elements.boundingBox();
- var w = this.width();
- var h = this.height();
- var zoom;
- padding = number$1(padding) ? padding : 0;
- if (!isNaN(w) && !isNaN(h) && w > 0 && h > 0 && !isNaN(bb.w) && !isNaN(bb.h) && bb.w > 0 && bb.h > 0) {
- zoom = Math.min((w - 2 * padding) / bb.w, (h - 2 * padding) / bb.h);
-
- // crop zoom
- zoom = zoom > this._private.maxZoom ? this._private.maxZoom : zoom;
- zoom = zoom < this._private.minZoom ? this._private.minZoom : zoom;
- var pan = {
- // now pan to middle
- x: (w - zoom * (bb.x1 + bb.x2)) / 2,
- y: (h - zoom * (bb.y1 + bb.y2)) / 2
- };
- return {
- zoom: zoom,
- pan: pan
- };
- }
- return;
- },
- zoomRange: function zoomRange(min, max) {
- var _p = this._private;
- if (max == null) {
- var opts = min;
- min = opts.min;
- max = opts.max;
- }
- if (number$1(min) && number$1(max) && min <= max) {
- _p.minZoom = min;
- _p.maxZoom = max;
- } else if (number$1(min) && max === undefined && min <= _p.maxZoom) {
- _p.minZoom = min;
- } else if (number$1(max) && min === undefined && max >= _p.minZoom) {
- _p.maxZoom = max;
- }
- return this;
- },
- minZoom: function minZoom(zoom) {
- if (zoom === undefined) {
- return this._private.minZoom;
- } else {
- return this.zoomRange({
- min: zoom
- });
- }
- },
- maxZoom: function maxZoom(zoom) {
- if (zoom === undefined) {
- return this._private.maxZoom;
- } else {
- return this.zoomRange({
- max: zoom
- });
- }
- },
- getZoomedViewport: function getZoomedViewport(params) {
- var _p = this._private;
- var currentPan = _p.pan;
- var currentZoom = _p.zoom;
- var pos; // in rendered px
- var zoom;
- var bail = false;
- if (!_p.zoomingEnabled) {
- // zooming disabled
- bail = true;
- }
- if (number$1(params)) {
- // then set the zoom
- zoom = params;
- } else if (plainObject(params)) {
- // then zoom about a point
- zoom = params.level;
- if (params.position != null) {
- pos = modelToRenderedPosition(params.position, currentZoom, currentPan);
- } else if (params.renderedPosition != null) {
- pos = params.renderedPosition;
- }
- if (pos != null && !_p.panningEnabled) {
- // panning disabled
- bail = true;
- }
- }
-
- // crop zoom
- zoom = zoom > _p.maxZoom ? _p.maxZoom : zoom;
- zoom = zoom < _p.minZoom ? _p.minZoom : zoom;
-
- // can't zoom with invalid params
- if (bail || !number$1(zoom) || zoom === currentZoom || pos != null && (!number$1(pos.x) || !number$1(pos.y))) {
- return null;
- }
- if (pos != null) {
- // set zoom about position
- var pan1 = currentPan;
- var zoom1 = currentZoom;
- var zoom2 = zoom;
- var pan2 = {
- x: -zoom2 / zoom1 * (pos.x - pan1.x) + pos.x,
- y: -zoom2 / zoom1 * (pos.y - pan1.y) + pos.y
- };
- return {
- zoomed: true,
- panned: true,
- zoom: zoom2,
- pan: pan2
- };
- } else {
- // just set the zoom
- return {
- zoomed: true,
- panned: false,
- zoom: zoom,
- pan: currentPan
- };
- }
- },
- zoom: function zoom(params) {
- if (params === undefined) {
- // get
- return this._private.zoom;
- } else {
- // set
- var vp = this.getZoomedViewport(params);
- var _p = this._private;
- if (vp == null || !vp.zoomed) {
- return this;
- }
- _p.zoom = vp.zoom;
- if (vp.panned) {
- _p.pan.x = vp.pan.x;
- _p.pan.y = vp.pan.y;
- }
- this.emit('zoom' + (vp.panned ? ' pan' : '') + ' viewport');
- this.notify('viewport');
- return this; // chaining
- }
- },
-
- viewport: function viewport(opts) {
- var _p = this._private;
- var zoomDefd = true;
- var panDefd = true;
- var events = []; // to trigger
- var zoomFailed = false;
- var panFailed = false;
- if (!opts) {
- return this;
- }
- if (!number$1(opts.zoom)) {
- zoomDefd = false;
- }
- if (!plainObject(opts.pan)) {
- panDefd = false;
- }
- if (!zoomDefd && !panDefd) {
- return this;
- }
- if (zoomDefd) {
- var z = opts.zoom;
- if (z < _p.minZoom || z > _p.maxZoom || !_p.zoomingEnabled) {
- zoomFailed = true;
- } else {
- _p.zoom = z;
- events.push('zoom');
- }
- }
- if (panDefd && (!zoomFailed || !opts.cancelOnFailedZoom) && _p.panningEnabled) {
- var p = opts.pan;
- if (number$1(p.x)) {
- _p.pan.x = p.x;
- panFailed = false;
- }
- if (number$1(p.y)) {
- _p.pan.y = p.y;
- panFailed = false;
- }
- if (!panFailed) {
- events.push('pan');
- }
- }
- if (events.length > 0) {
- events.push('viewport');
- this.emit(events.join(' '));
- this.notify('viewport');
- }
- return this; // chaining
- },
-
- center: function center(elements) {
- var pan = this.getCenterPan(elements);
- if (pan) {
- this._private.pan = pan;
- this.emit('pan viewport');
- this.notify('viewport');
- }
- return this; // chaining
- },
-
- getCenterPan: function getCenterPan(elements, zoom) {
- if (!this._private.panningEnabled) {
- return;
- }
- if (string(elements)) {
- var selector = elements;
- elements = this.mutableElements().filter(selector);
- } else if (!elementOrCollection(elements)) {
- elements = this.mutableElements();
- }
- if (elements.length === 0) {
- return;
- } // can't centre pan to nothing
-
- var bb = elements.boundingBox();
- var w = this.width();
- var h = this.height();
- zoom = zoom === undefined ? this._private.zoom : zoom;
- var pan = {
- // middle
- x: (w - zoom * (bb.x1 + bb.x2)) / 2,
- y: (h - zoom * (bb.y1 + bb.y2)) / 2
- };
- return pan;
- },
- reset: function reset() {
- if (!this._private.panningEnabled || !this._private.zoomingEnabled) {
- return this;
- }
- this.viewport({
- pan: {
- x: 0,
- y: 0
- },
- zoom: 1
- });
- return this; // chaining
- },
-
- invalidateSize: function invalidateSize() {
- this._private.sizeCache = null;
- },
- size: function size() {
- var _p = this._private;
- var container = _p.container;
- var cy = this;
- return _p.sizeCache = _p.sizeCache || (container ? function () {
- var style = cy.window().getComputedStyle(container);
- var val = function val(name) {
- return parseFloat(style.getPropertyValue(name));
- };
- return {
- width: container.clientWidth - val('padding-left') - val('padding-right'),
- height: container.clientHeight - val('padding-top') - val('padding-bottom')
- };
- }() : {
- // fallback if no container (not 0 b/c can be used for dividing etc)
- width: 1,
- height: 1
- });
- },
- width: function width() {
- return this.size().width;
- },
- height: function height() {
- return this.size().height;
- },
- extent: function extent() {
- var pan = this._private.pan;
- var zoom = this._private.zoom;
- var rb = this.renderedExtent();
- var b = {
- x1: (rb.x1 - pan.x) / zoom,
- x2: (rb.x2 - pan.x) / zoom,
- y1: (rb.y1 - pan.y) / zoom,
- y2: (rb.y2 - pan.y) / zoom
- };
- b.w = b.x2 - b.x1;
- b.h = b.y2 - b.y1;
- return b;
- },
- renderedExtent: function renderedExtent() {
- var width = this.width();
- var height = this.height();
- return {
- x1: 0,
- y1: 0,
- x2: width,
- y2: height,
- w: width,
- h: height
- };
- },
- multiClickDebounceTime: function multiClickDebounceTime(_int) {
- if (_int) this._private.multiClickDebounceTime = _int;else return this._private.multiClickDebounceTime;
- return this; // chaining
- }
-};
-
-// aliases
-corefn$1.centre = corefn$1.center;
-
-// backwards compatibility
-corefn$1.autolockNodes = corefn$1.autolock;
-corefn$1.autoungrabifyNodes = corefn$1.autoungrabify;
-
-var fn = {
- data: define.data({
- field: 'data',
- bindingEvent: 'data',
- allowBinding: true,
- allowSetting: true,
- settingEvent: 'data',
- settingTriggersEvent: true,
- triggerFnName: 'trigger',
- allowGetting: true,
- updateStyle: true
- }),
- removeData: define.removeData({
- field: 'data',
- event: 'data',
- triggerFnName: 'trigger',
- triggerEvent: true,
- updateStyle: true
- }),
- scratch: define.data({
- field: 'scratch',
- bindingEvent: 'scratch',
- allowBinding: true,
- allowSetting: true,
- settingEvent: 'scratch',
- settingTriggersEvent: true,
- triggerFnName: 'trigger',
- allowGetting: true,
- updateStyle: true
- }),
- removeScratch: define.removeData({
- field: 'scratch',
- event: 'scratch',
- triggerFnName: 'trigger',
- triggerEvent: true,
- updateStyle: true
- })
-};
-
-// aliases
-fn.attr = fn.data;
-fn.removeAttr = fn.removeData;
-
-var Core = function Core(opts) {
- var cy = this;
- opts = extend({}, opts);
- var container = opts.container;
-
- // allow for passing a wrapped jquery object
- // e.g. cytoscape({ container: $('#cy') })
- if (container && !htmlElement(container) && htmlElement(container[0])) {
- container = container[0];
- }
- var reg = container ? container._cyreg : null; // e.g. already registered some info (e.g. readies) via jquery
- reg = reg || {};
- if (reg && reg.cy) {
- reg.cy.destroy();
- reg = {}; // old instance => replace reg completely
- }
-
- var readies = reg.readies = reg.readies || [];
- if (container) {
- container._cyreg = reg;
- } // make sure container assoc'd reg points to this cy
- reg.cy = cy;
- var head = _window !== undefined && container !== undefined && !opts.headless;
- var options = opts;
- options.layout = extend({
- name: head ? 'grid' : 'null'
- }, options.layout);
- options.renderer = extend({
- name: head ? 'canvas' : 'null'
- }, options.renderer);
- var defVal = function defVal(def, val, altVal) {
- if (val !== undefined) {
- return val;
- } else if (altVal !== undefined) {
- return altVal;
- } else {
- return def;
- }
- };
- var _p = this._private = {
- container: container,
- // html dom ele container
- ready: false,
- // whether ready has been triggered
- options: options,
- // cached options
- elements: new Collection(this),
- // elements in the graph
- listeners: [],
- // list of listeners
- aniEles: new Collection(this),
- // elements being animated
- data: options.data || {},
- // data for the core
- scratch: {},
- // scratch object for core
- layout: null,
- renderer: null,
- destroyed: false,
- // whether destroy was called
- notificationsEnabled: true,
- // whether notifications are sent to the renderer
- minZoom: 1e-50,
- maxZoom: 1e50,
- zoomingEnabled: defVal(true, options.zoomingEnabled),
- userZoomingEnabled: defVal(true, options.userZoomingEnabled),
- panningEnabled: defVal(true, options.panningEnabled),
- userPanningEnabled: defVal(true, options.userPanningEnabled),
- boxSelectionEnabled: defVal(true, options.boxSelectionEnabled),
- autolock: defVal(false, options.autolock, options.autolockNodes),
- autoungrabify: defVal(false, options.autoungrabify, options.autoungrabifyNodes),
- autounselectify: defVal(false, options.autounselectify),
- styleEnabled: options.styleEnabled === undefined ? head : options.styleEnabled,
- zoom: number$1(options.zoom) ? options.zoom : 1,
- pan: {
- x: plainObject(options.pan) && number$1(options.pan.x) ? options.pan.x : 0,
- y: plainObject(options.pan) && number$1(options.pan.y) ? options.pan.y : 0
- },
- animation: {
- // object for currently-running animations
- current: [],
- queue: []
- },
- hasCompoundNodes: false,
- multiClickDebounceTime: defVal(250, options.multiClickDebounceTime)
- };
- this.createEmitter();
-
- // set selection type
- this.selectionType(options.selectionType);
-
- // init zoom bounds
- this.zoomRange({
- min: options.minZoom,
- max: options.maxZoom
- });
- var loadExtData = function loadExtData(extData, next) {
- var anyIsPromise = extData.some(promise);
- if (anyIsPromise) {
- return Promise$1.all(extData).then(next); // load all data asynchronously, then exec rest of init
- } else {
- next(extData); // exec synchronously for convenience
- }
- };
-
- // start with the default stylesheet so we have something before loading an external stylesheet
- if (_p.styleEnabled) {
- cy.setStyle([]);
- }
-
- // create the renderer
- var rendererOptions = extend({}, options, options.renderer); // allow rendering hints in top level options
- cy.initRenderer(rendererOptions);
- var setElesAndLayout = function setElesAndLayout(elements, onload, ondone) {
- cy.notifications(false);
-
- // remove old elements
- var oldEles = cy.mutableElements();
- if (oldEles.length > 0) {
- oldEles.remove();
- }
- if (elements != null) {
- if (plainObject(elements) || array(elements)) {
- cy.add(elements);
- }
- }
- cy.one('layoutready', function (e) {
- cy.notifications(true);
- cy.emit(e); // we missed this event by turning notifications off, so pass it on
-
- cy.one('load', onload);
- cy.emitAndNotify('load');
- }).one('layoutstop', function () {
- cy.one('done', ondone);
- cy.emit('done');
- });
- var layoutOpts = extend({}, cy._private.options.layout);
- layoutOpts.eles = cy.elements();
- cy.layout(layoutOpts).run();
- };
- loadExtData([options.style, options.elements], function (thens) {
- var initStyle = thens[0];
- var initEles = thens[1];
-
- // init style
- if (_p.styleEnabled) {
- cy.style().append(initStyle);
- }
-
- // initial load
- setElesAndLayout(initEles, function () {
- // onready
- cy.startAnimationLoop();
- _p.ready = true;
-
- // if a ready callback is specified as an option, the bind it
- if (fn$6(options.ready)) {
- cy.on('ready', options.ready);
- }
-
- // bind all the ready handlers registered before creating this instance
- for (var i = 0; i < readies.length; i++) {
- var fn = readies[i];
- cy.on('ready', fn);
- }
- if (reg) {
- reg.readies = [];
- } // clear b/c we've bound them all and don't want to keep it around in case a new core uses the same div etc
-
- cy.emit('ready');
- }, options.done);
- });
-};
-var corefn = Core.prototype; // short alias
-
-extend(corefn, {
- instanceString: function instanceString() {
- return 'core';
- },
- isReady: function isReady() {
- return this._private.ready;
- },
- destroyed: function destroyed() {
- return this._private.destroyed;
- },
- ready: function ready(fn) {
- if (this.isReady()) {
- this.emitter().emit('ready', [], fn); // just calls fn as though triggered via ready event
- } else {
- this.on('ready', fn);
- }
- return this;
- },
- destroy: function destroy() {
- var cy = this;
- if (cy.destroyed()) return;
- cy.stopAnimationLoop();
- cy.destroyRenderer();
- this.emit('destroy');
- cy._private.destroyed = true;
- return cy;
- },
- hasElementWithId: function hasElementWithId(id) {
- return this._private.elements.hasElementWithId(id);
- },
- getElementById: function getElementById(id) {
- return this._private.elements.getElementById(id);
- },
- hasCompoundNodes: function hasCompoundNodes() {
- return this._private.hasCompoundNodes;
- },
- headless: function headless() {
- return this._private.renderer.isHeadless();
- },
- styleEnabled: function styleEnabled() {
- return this._private.styleEnabled;
- },
- addToPool: function addToPool(eles) {
- this._private.elements.merge(eles);
- return this; // chaining
- },
-
- removeFromPool: function removeFromPool(eles) {
- this._private.elements.unmerge(eles);
- return this;
- },
- container: function container() {
- return this._private.container || null;
- },
- window: function window() {
- var container = this._private.container;
- if (container == null) return _window;
- var ownerDocument = this._private.container.ownerDocument;
- if (ownerDocument === undefined || ownerDocument == null) {
- return _window;
- }
- return ownerDocument.defaultView || _window;
- },
- mount: function mount(container) {
- if (container == null) {
- return;
- }
- var cy = this;
- var _p = cy._private;
- var options = _p.options;
- if (!htmlElement(container) && htmlElement(container[0])) {
- container = container[0];
- }
- cy.stopAnimationLoop();
- cy.destroyRenderer();
- _p.container = container;
- _p.styleEnabled = true;
- cy.invalidateSize();
- cy.initRenderer(extend({}, options, options.renderer, {
- // allow custom renderer name to be re-used, otherwise use canvas
- name: options.renderer.name === 'null' ? 'canvas' : options.renderer.name
- }));
- cy.startAnimationLoop();
- cy.style(options.style);
- cy.emit('mount');
- return cy;
- },
- unmount: function unmount() {
- var cy = this;
- cy.stopAnimationLoop();
- cy.destroyRenderer();
- cy.initRenderer({
- name: 'null'
- });
- cy.emit('unmount');
- return cy;
- },
- options: function options() {
- return copy(this._private.options);
- },
- json: function json(obj) {
- var cy = this;
- var _p = cy._private;
- var eles = cy.mutableElements();
- var getFreshRef = function getFreshRef(ele) {
- return cy.getElementById(ele.id());
- };
- if (plainObject(obj)) {
- // set
-
- cy.startBatch();
- if (obj.elements) {
- var idInJson = {};
- var updateEles = function updateEles(jsons, gr) {
- var toAdd = [];
- var toMod = [];
- for (var i = 0; i < jsons.length; i++) {
- var json = jsons[i];
- if (!json.data.id) {
- warn('cy.json() cannot handle elements without an ID attribute');
- continue;
- }
- var id = '' + json.data.id; // id must be string
- var ele = cy.getElementById(id);
- idInJson[id] = true;
- if (ele.length !== 0) {
- // existing element should be updated
- toMod.push({
- ele: ele,
- json: json
- });
- } else {
- // otherwise should be added
- if (gr) {
- json.group = gr;
- toAdd.push(json);
- } else {
- toAdd.push(json);
- }
- }
- }
- cy.add(toAdd);
- for (var _i = 0; _i < toMod.length; _i++) {
- var _toMod$_i = toMod[_i],
- _ele = _toMod$_i.ele,
- _json = _toMod$_i.json;
- _ele.json(_json);
- }
- };
- if (array(obj.elements)) {
- // elements: []
- updateEles(obj.elements);
- } else {
- // elements: { nodes: [], edges: [] }
- var grs = ['nodes', 'edges'];
- for (var i = 0; i < grs.length; i++) {
- var gr = grs[i];
- var elements = obj.elements[gr];
- if (array(elements)) {
- updateEles(elements, gr);
- }
- }
- }
- var parentsToRemove = cy.collection();
- eles.filter(function (ele) {
- return !idInJson[ele.id()];
- }).forEach(function (ele) {
- if (ele.isParent()) {
- parentsToRemove.merge(ele);
- } else {
- ele.remove();
- }
- });
-
- // so that children are not removed w/parent
- parentsToRemove.forEach(function (ele) {
- return ele.children().move({
- parent: null
- });
- });
-
- // intermediate parents may be moved by prior line, so make sure we remove by fresh refs
- parentsToRemove.forEach(function (ele) {
- return getFreshRef(ele).remove();
- });
- }
- if (obj.style) {
- cy.style(obj.style);
- }
- if (obj.zoom != null && obj.zoom !== _p.zoom) {
- cy.zoom(obj.zoom);
- }
- if (obj.pan) {
- if (obj.pan.x !== _p.pan.x || obj.pan.y !== _p.pan.y) {
- cy.pan(obj.pan);
- }
- }
- if (obj.data) {
- cy.data(obj.data);
- }
- var fields = ['minZoom', 'maxZoom', 'zoomingEnabled', 'userZoomingEnabled', 'panningEnabled', 'userPanningEnabled', 'boxSelectionEnabled', 'autolock', 'autoungrabify', 'autounselectify', 'multiClickDebounceTime'];
- for (var _i2 = 0; _i2 < fields.length; _i2++) {
- var f = fields[_i2];
- if (obj[f] != null) {
- cy[f](obj[f]);
- }
- }
- cy.endBatch();
- return this; // chaining
- } else {
- // get
- var flat = !!obj;
- var json = {};
- if (flat) {
- json.elements = this.elements().map(function (ele) {
- return ele.json();
- });
- } else {
- json.elements = {};
- eles.forEach(function (ele) {
- var group = ele.group();
- if (!json.elements[group]) {
- json.elements[group] = [];
- }
- json.elements[group].push(ele.json());
- });
- }
- if (this._private.styleEnabled) {
- json.style = cy.style().json();
- }
- json.data = copy(cy.data());
- var options = _p.options;
- json.zoomingEnabled = _p.zoomingEnabled;
- json.userZoomingEnabled = _p.userZoomingEnabled;
- json.zoom = _p.zoom;
- json.minZoom = _p.minZoom;
- json.maxZoom = _p.maxZoom;
- json.panningEnabled = _p.panningEnabled;
- json.userPanningEnabled = _p.userPanningEnabled;
- json.pan = copy(_p.pan);
- json.boxSelectionEnabled = _p.boxSelectionEnabled;
- json.renderer = copy(options.renderer);
- json.hideEdgesOnViewport = options.hideEdgesOnViewport;
- json.textureOnViewport = options.textureOnViewport;
- json.wheelSensitivity = options.wheelSensitivity;
- json.motionBlur = options.motionBlur;
- json.multiClickDebounceTime = options.multiClickDebounceTime;
- return json;
- }
- }
-});
-corefn.$id = corefn.getElementById;
-[corefn$9, corefn$8, elesfn, corefn$7, corefn$6, corefn$5, corefn$4, corefn$3, corefn$2, corefn$1, fn].forEach(function (props) {
- extend(corefn, props);
-});
-
-/* eslint-disable no-unused-vars */
-var defaults$7 = {
- fit: true,
- // whether to fit the viewport to the graph
- directed: false,
- // whether the tree is directed downwards (or edges can point in any direction if false)
- padding: 30,
- // padding on fit
- circle: false,
- // put depths in concentric circles if true, put depths top down if false
- grid: false,
- // whether to create an even grid into which the DAG is placed (circle:false only)
- spacingFactor: 1.75,
- // positive spacing factor, larger => more space between nodes (N.B. n/a if causes overlap)
- boundingBox: undefined,
- // constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- avoidOverlap: true,
- // prevents node overlap, may overflow boundingBox if not enough space
- nodeDimensionsIncludeLabels: false,
- // Excludes the label when calculating node bounding boxes for the layout algorithm
- roots: undefined,
- // the roots of the trees
- depthSort: undefined,
- // a sorting function to order nodes at equal depth. e.g. function(a, b){ return a.data('weight') - b.data('weight') }
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled,
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-var deprecatedOptionDefaults = {
- maximal: false,
- // whether to shift nodes down their natural BFS depths in order to avoid upwards edges (DAGS only); setting acyclic to true sets maximal to true also
- acyclic: false // whether the tree is acyclic and thus a node could be shifted (due to the maximal option) multiple times without causing an infinite loop; setting to true sets maximal to true also; if you are uncertain whether a tree is acyclic, set to false to avoid potential infinite loops
-};
-
-/* eslint-enable */
-
-var getInfo = function getInfo(ele) {
- return ele.scratch('breadthfirst');
-};
-var setInfo = function setInfo(ele, obj) {
- return ele.scratch('breadthfirst', obj);
-};
-function BreadthFirstLayout(options) {
- this.options = extend({}, defaults$7, deprecatedOptionDefaults, options);
-}
-BreadthFirstLayout.prototype.run = function () {
- var params = this.options;
- var options = params;
- var cy = params.cy;
- var eles = options.eles;
- var nodes = eles.nodes().filter(function (n) {
- return !n.isParent();
- });
- var graph = eles;
- var directed = options.directed;
- var maximal = options.acyclic || options.maximal || options.maximalAdjustments > 0; // maximalAdjustments for compat. w/ old code; also, setting acyclic to true sets maximal to true
-
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- var roots;
- if (elementOrCollection(options.roots)) {
- roots = options.roots;
- } else if (array(options.roots)) {
- var rootsArray = [];
- for (var i = 0; i < options.roots.length; i++) {
- var id = options.roots[i];
- var ele = cy.getElementById(id);
- rootsArray.push(ele);
- }
- roots = cy.collection(rootsArray);
- } else if (string(options.roots)) {
- roots = cy.$(options.roots);
- } else {
- if (directed) {
- roots = nodes.roots();
- } else {
- var components = eles.components();
- roots = cy.collection();
- var _loop = function _loop(_i) {
- var comp = components[_i];
- var maxDegree = comp.maxDegree(false);
- var compRoots = comp.filter(function (ele) {
- return ele.degree(false) === maxDegree;
- });
- roots = roots.add(compRoots);
- };
- for (var _i = 0; _i < components.length; _i++) {
- _loop(_i);
- }
- }
- }
- var depths = [];
- var foundByBfs = {};
- var addToDepth = function addToDepth(ele, d) {
- if (depths[d] == null) {
- depths[d] = [];
- }
- var i = depths[d].length;
- depths[d].push(ele);
- setInfo(ele, {
- index: i,
- depth: d
- });
- };
- var changeDepth = function changeDepth(ele, newDepth) {
- var _getInfo = getInfo(ele),
- depth = _getInfo.depth,
- index = _getInfo.index;
- depths[depth][index] = null;
- addToDepth(ele, newDepth);
- };
-
- // find the depths of the nodes
- graph.bfs({
- roots: roots,
- directed: options.directed,
- visit: function visit(node, edge, pNode, i, depth) {
- var ele = node[0];
- var id = ele.id();
- addToDepth(ele, depth);
- foundByBfs[id] = true;
- }
- });
-
- // check for nodes not found by bfs
- var orphanNodes = [];
- for (var _i2 = 0; _i2 < nodes.length; _i2++) {
- var _ele = nodes[_i2];
- if (foundByBfs[_ele.id()]) {
- continue;
- } else {
- orphanNodes.push(_ele);
- }
- }
-
- // assign the nodes a depth and index
-
- var assignDepthsAt = function assignDepthsAt(i) {
- var eles = depths[i];
- for (var j = 0; j < eles.length; j++) {
- var _ele2 = eles[j];
- if (_ele2 == null) {
- eles.splice(j, 1);
- j--;
- continue;
- }
- setInfo(_ele2, {
- depth: i,
- index: j
- });
- }
- };
- var assignDepths = function assignDepths() {
- for (var _i3 = 0; _i3 < depths.length; _i3++) {
- assignDepthsAt(_i3);
- }
- };
- var adjustMaximally = function adjustMaximally(ele, shifted) {
- var eInfo = getInfo(ele);
- var incomers = ele.incomers().filter(function (el) {
- return el.isNode() && eles.has(el);
- });
- var maxDepth = -1;
- var id = ele.id();
- for (var k = 0; k < incomers.length; k++) {
- var incmr = incomers[k];
- var iInfo = getInfo(incmr);
- maxDepth = Math.max(maxDepth, iInfo.depth);
- }
- if (eInfo.depth <= maxDepth) {
- if (!options.acyclic && shifted[id]) {
- return null;
- }
- var newDepth = maxDepth + 1;
- changeDepth(ele, newDepth);
- shifted[id] = newDepth;
- return true;
- }
- return false;
- };
-
- // for the directed case, try to make the edges all go down (i.e. depth i => depth i + 1)
- if (directed && maximal) {
- var Q = [];
- var shifted = {};
- var enqueue = function enqueue(n) {
- return Q.push(n);
- };
- var dequeue = function dequeue() {
- return Q.shift();
- };
- nodes.forEach(function (n) {
- return Q.push(n);
- });
- while (Q.length > 0) {
- var _ele3 = dequeue();
- var didShift = adjustMaximally(_ele3, shifted);
- if (didShift) {
- _ele3.outgoers().filter(function (el) {
- return el.isNode() && eles.has(el);
- }).forEach(enqueue);
- } else if (didShift === null) {
- warn('Detected double maximal shift for node `' + _ele3.id() + '`. Bailing maximal adjustment due to cycle. Use `options.maximal: true` only on DAGs.');
- break; // exit on failure
- }
- }
- }
-
- assignDepths(); // clear holes
-
- // find min distance we need to leave between nodes
- var minDistance = 0;
- if (options.avoidOverlap) {
- for (var _i4 = 0; _i4 < nodes.length; _i4++) {
- var n = nodes[_i4];
- var nbb = n.layoutDimensions(options);
- var w = nbb.w;
- var h = nbb.h;
- minDistance = Math.max(minDistance, w, h);
- }
- }
-
- // get the weighted percent for an element based on its connectivity to other levels
- var cachedWeightedPercent = {};
- var getWeightedPercent = function getWeightedPercent(ele) {
- if (cachedWeightedPercent[ele.id()]) {
- return cachedWeightedPercent[ele.id()];
- }
- var eleDepth = getInfo(ele).depth;
- var neighbors = ele.neighborhood();
- var percent = 0;
- var samples = 0;
- for (var _i5 = 0; _i5 < neighbors.length; _i5++) {
- var neighbor = neighbors[_i5];
- if (neighbor.isEdge() || neighbor.isParent() || !nodes.has(neighbor)) {
- continue;
- }
- var bf = getInfo(neighbor);
- if (bf == null) {
- continue;
- }
- var index = bf.index;
- var depth = bf.depth;
-
- // unassigned neighbours shouldn't affect the ordering
- if (index == null || depth == null) {
- continue;
- }
- var nDepth = depths[depth].length;
- if (depth < eleDepth) {
- // only get influenced by elements above
- percent += index / nDepth;
- samples++;
- }
- }
- samples = Math.max(1, samples);
- percent = percent / samples;
- if (samples === 0) {
- // put lone nodes at the start
- percent = 0;
- }
- cachedWeightedPercent[ele.id()] = percent;
- return percent;
- };
-
- // rearrange the indices in each depth level based on connectivity
-
- var sortFn = function sortFn(a, b) {
- var apct = getWeightedPercent(a);
- var bpct = getWeightedPercent(b);
- var diff = apct - bpct;
- if (diff === 0) {
- return ascending(a.id(), b.id()); // make sure sort doesn't have don't-care comparisons
- } else {
- return diff;
- }
- };
- if (options.depthSort !== undefined) {
- sortFn = options.depthSort;
- }
-
- // sort each level to make connected nodes closer
- for (var _i6 = 0; _i6 < depths.length; _i6++) {
- depths[_i6].sort(sortFn);
- assignDepthsAt(_i6);
- }
-
- // assign orphan nodes to a new top-level depth
- var orphanDepth = [];
- for (var _i7 = 0; _i7 < orphanNodes.length; _i7++) {
- orphanDepth.push(orphanNodes[_i7]);
- }
- depths.unshift(orphanDepth);
- assignDepths();
- var biggestDepthSize = 0;
- for (var _i8 = 0; _i8 < depths.length; _i8++) {
- biggestDepthSize = Math.max(depths[_i8].length, biggestDepthSize);
- }
- var center = {
- x: bb.x1 + bb.w / 2,
- y: bb.x1 + bb.h / 2
- };
- var maxDepthSize = depths.reduce(function (max, eles) {
- return Math.max(max, eles.length);
- }, 0);
- var getPosition = function getPosition(ele) {
- var _getInfo2 = getInfo(ele),
- depth = _getInfo2.depth,
- index = _getInfo2.index;
- var depthSize = depths[depth].length;
- var distanceX = Math.max(bb.w / ((options.grid ? maxDepthSize : depthSize) + 1), minDistance);
- var distanceY = Math.max(bb.h / (depths.length + 1), minDistance);
- var radiusStepSize = Math.min(bb.w / 2 / depths.length, bb.h / 2 / depths.length);
- radiusStepSize = Math.max(radiusStepSize, minDistance);
- if (!options.circle) {
- var epos = {
- x: center.x + (index + 1 - (depthSize + 1) / 2) * distanceX,
- y: (depth + 1) * distanceY
- };
- return epos;
- } else {
- var radius = radiusStepSize * depth + radiusStepSize - (depths.length > 0 && depths[0].length <= 3 ? radiusStepSize / 2 : 0);
- var theta = 2 * Math.PI / depths[depth].length * index;
- if (depth === 0 && depths[0].length === 1) {
- radius = 1;
- }
- return {
- x: center.x + radius * Math.cos(theta),
- y: center.y + radius * Math.sin(theta)
- };
- }
- };
- eles.nodes().layoutPositions(this, options, getPosition);
- return this; // chaining
-};
-
-var defaults$6 = {
- fit: true,
- // whether to fit the viewport to the graph
- padding: 30,
- // the padding on fit
- boundingBox: undefined,
- // constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- avoidOverlap: true,
- // prevents node overlap, may overflow boundingBox and radius if not enough space
- nodeDimensionsIncludeLabels: false,
- // Excludes the label when calculating node bounding boxes for the layout algorithm
- spacingFactor: undefined,
- // Applies a multiplicative factor (>0) to expand or compress the overall area that the nodes take up
- radius: undefined,
- // the radius of the circle
- startAngle: 3 / 2 * Math.PI,
- // where nodes start in radians
- sweep: undefined,
- // how many radians should be between the first and last node (defaults to full circle)
- clockwise: true,
- // whether the layout should go clockwise (true) or counterclockwise/anticlockwise (false)
- sort: undefined,
- // a sorting function to order the nodes; e.g. function(a, b){ return a.data('weight') - b.data('weight') }
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-function CircleLayout(options) {
- this.options = extend({}, defaults$6, options);
-}
-CircleLayout.prototype.run = function () {
- var params = this.options;
- var options = params;
- var cy = params.cy;
- var eles = options.eles;
- var clockwise = options.counterclockwise !== undefined ? !options.counterclockwise : options.clockwise;
- var nodes = eles.nodes().not(':parent');
- if (options.sort) {
- nodes = nodes.sort(options.sort);
- }
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- var center = {
- x: bb.x1 + bb.w / 2,
- y: bb.y1 + bb.h / 2
- };
- var sweep = options.sweep === undefined ? 2 * Math.PI - 2 * Math.PI / nodes.length : options.sweep;
- var dTheta = sweep / Math.max(1, nodes.length - 1);
- var r;
- var minDistance = 0;
- for (var i = 0; i < nodes.length; i++) {
- var n = nodes[i];
- var nbb = n.layoutDimensions(options);
- var w = nbb.w;
- var h = nbb.h;
- minDistance = Math.max(minDistance, w, h);
- }
- if (number$1(options.radius)) {
- r = options.radius;
- } else if (nodes.length <= 1) {
- r = 0;
- } else {
- r = Math.min(bb.h, bb.w) / 2 - minDistance;
- }
-
- // calculate the radius
- if (nodes.length > 1 && options.avoidOverlap) {
- // but only if more than one node (can't overlap)
- minDistance *= 1.75; // just to have some nice spacing
-
- var dcos = Math.cos(dTheta) - Math.cos(0);
- var dsin = Math.sin(dTheta) - Math.sin(0);
- var rMin = Math.sqrt(minDistance * minDistance / (dcos * dcos + dsin * dsin)); // s.t. no nodes overlapping
- r = Math.max(rMin, r);
- }
- var getPos = function getPos(ele, i) {
- var theta = options.startAngle + i * dTheta * (clockwise ? 1 : -1);
- var rx = r * Math.cos(theta);
- var ry = r * Math.sin(theta);
- var pos = {
- x: center.x + rx,
- y: center.y + ry
- };
- return pos;
- };
- eles.nodes().layoutPositions(this, options, getPos);
- return this; // chaining
-};
-
-var defaults$5 = {
- fit: true,
- // whether to fit the viewport to the graph
- padding: 30,
- // the padding on fit
- startAngle: 3 / 2 * Math.PI,
- // where nodes start in radians
- sweep: undefined,
- // how many radians should be between the first and last node (defaults to full circle)
- clockwise: true,
- // whether the layout should go clockwise (true) or counterclockwise/anticlockwise (false)
- equidistant: false,
- // whether levels have an equal radial distance betwen them, may cause bounding box overflow
- minNodeSpacing: 10,
- // min spacing between outside of nodes (used for radius adjustment)
- boundingBox: undefined,
- // constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- avoidOverlap: true,
- // prevents node overlap, may overflow boundingBox if not enough space
- nodeDimensionsIncludeLabels: false,
- // Excludes the label when calculating node bounding boxes for the layout algorithm
- height: undefined,
- // height of layout area (overrides container height)
- width: undefined,
- // width of layout area (overrides container width)
- spacingFactor: undefined,
- // Applies a multiplicative factor (>0) to expand or compress the overall area that the nodes take up
- concentric: function concentric(node) {
- // returns numeric value for each node, placing higher nodes in levels towards the centre
- return node.degree();
- },
- levelWidth: function levelWidth(nodes) {
- // the variation of concentric values in each level
- return nodes.maxDegree() / 4;
- },
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-function ConcentricLayout(options) {
- this.options = extend({}, defaults$5, options);
-}
-ConcentricLayout.prototype.run = function () {
- var params = this.options;
- var options = params;
- var clockwise = options.counterclockwise !== undefined ? !options.counterclockwise : options.clockwise;
- var cy = params.cy;
- var eles = options.eles;
- var nodes = eles.nodes().not(':parent');
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- var center = {
- x: bb.x1 + bb.w / 2,
- y: bb.y1 + bb.h / 2
- };
- var nodeValues = []; // { node, value }
- var maxNodeSize = 0;
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- var value = void 0;
-
- // calculate the node value
- value = options.concentric(node);
- nodeValues.push({
- value: value,
- node: node
- });
-
- // for style mapping
- node._private.scratch.concentric = value;
- }
-
- // in case we used the `concentric` in style
- nodes.updateStyle();
-
- // calculate max size now based on potentially updated mappers
- for (var _i = 0; _i < nodes.length; _i++) {
- var _node = nodes[_i];
- var nbb = _node.layoutDimensions(options);
- maxNodeSize = Math.max(maxNodeSize, nbb.w, nbb.h);
- }
-
- // sort node values in descreasing order
- nodeValues.sort(function (a, b) {
- return b.value - a.value;
- });
- var levelWidth = options.levelWidth(nodes);
-
- // put the values into levels
- var levels = [[]];
- var currentLevel = levels[0];
- for (var _i2 = 0; _i2 < nodeValues.length; _i2++) {
- var val = nodeValues[_i2];
- if (currentLevel.length > 0) {
- var diff = Math.abs(currentLevel[0].value - val.value);
- if (diff >= levelWidth) {
- currentLevel = [];
- levels.push(currentLevel);
- }
- }
- currentLevel.push(val);
- }
-
- // create positions from levels
-
- var minDist = maxNodeSize + options.minNodeSpacing; // min dist between nodes
-
- if (!options.avoidOverlap) {
- // then strictly constrain to bb
- var firstLvlHasMulti = levels.length > 0 && levels[0].length > 1;
- var maxR = Math.min(bb.w, bb.h) / 2 - minDist;
- var rStep = maxR / (levels.length + firstLvlHasMulti ? 1 : 0);
- minDist = Math.min(minDist, rStep);
- }
-
- // find the metrics for each level
- var r = 0;
- for (var _i3 = 0; _i3 < levels.length; _i3++) {
- var level = levels[_i3];
- var sweep = options.sweep === undefined ? 2 * Math.PI - 2 * Math.PI / level.length : options.sweep;
- var dTheta = level.dTheta = sweep / Math.max(1, level.length - 1);
-
- // calculate the radius
- if (level.length > 1 && options.avoidOverlap) {
- // but only if more than one node (can't overlap)
- var dcos = Math.cos(dTheta) - Math.cos(0);
- var dsin = Math.sin(dTheta) - Math.sin(0);
- var rMin = Math.sqrt(minDist * minDist / (dcos * dcos + dsin * dsin)); // s.t. no nodes overlapping
-
- r = Math.max(rMin, r);
- }
- level.r = r;
- r += minDist;
- }
- if (options.equidistant) {
- var rDeltaMax = 0;
- var _r = 0;
- for (var _i4 = 0; _i4 < levels.length; _i4++) {
- var _level = levels[_i4];
- var rDelta = _level.r - _r;
- rDeltaMax = Math.max(rDeltaMax, rDelta);
- }
- _r = 0;
- for (var _i5 = 0; _i5 < levels.length; _i5++) {
- var _level2 = levels[_i5];
- if (_i5 === 0) {
- _r = _level2.r;
- }
- _level2.r = _r;
- _r += rDeltaMax;
- }
- }
-
- // calculate the node positions
- var pos = {}; // id => position
- for (var _i6 = 0; _i6 < levels.length; _i6++) {
- var _level3 = levels[_i6];
- var _dTheta = _level3.dTheta;
- var _r2 = _level3.r;
- for (var j = 0; j < _level3.length; j++) {
- var _val = _level3[j];
- var theta = options.startAngle + (clockwise ? 1 : -1) * _dTheta * j;
- var p = {
- x: center.x + _r2 * Math.cos(theta),
- y: center.y + _r2 * Math.sin(theta)
- };
- pos[_val.node.id()] = p;
- }
- }
-
- // position the nodes
- eles.nodes().layoutPositions(this, options, function (ele) {
- var id = ele.id();
- return pos[id];
- });
- return this; // chaining
-};
-
-/*
-The CoSE layout was written by Gerardo Huck.
-https://www.linkedin.com/in/gerardohuck/
-
-Based on the following article:
-http://dl.acm.org/citation.cfm?id=1498047
-
-Modifications tracked on Github.
-*/
-var DEBUG;
-
-/**
- * @brief : default layout options
- */
-var defaults$4 = {
- // Called on `layoutready`
- ready: function ready() {},
- // Called on `layoutstop`
- stop: function stop() {},
- // Whether to animate while running the layout
- // true : Animate continuously as the layout is running
- // false : Just show the end result
- // 'end' : Animate with the end result, from the initial positions to the end positions
- animate: true,
- // Easing of the animation for animate:'end'
- animationEasing: undefined,
- // The duration of the animation for animate:'end'
- animationDuration: undefined,
- // A function that determines whether the node should be animated
- // All nodes animated by default on animate enabled
- // Non-animated nodes are positioned immediately when the layout starts
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // The layout animates only after this many milliseconds for animate:true
- // (prevents flashing on fast runs)
- animationThreshold: 250,
- // Number of iterations between consecutive screen positions update
- refresh: 20,
- // Whether to fit the network view after when done
- fit: true,
- // Padding on fit
- padding: 30,
- // Constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- boundingBox: undefined,
- // Excludes the label when calculating node bounding boxes for the layout algorithm
- nodeDimensionsIncludeLabels: false,
- // Randomize the initial positions of the nodes (true) or use existing positions (false)
- randomize: false,
- // Extra spacing between components in non-compound graphs
- componentSpacing: 40,
- // Node repulsion (non overlapping) multiplier
- nodeRepulsion: function nodeRepulsion(node) {
- return 2048;
- },
- // Node repulsion (overlapping) multiplier
- nodeOverlap: 4,
- // Ideal edge (non nested) length
- idealEdgeLength: function idealEdgeLength(edge) {
- return 32;
- },
- // Divisor to compute edge forces
- edgeElasticity: function edgeElasticity(edge) {
- return 32;
- },
- // Nesting factor (multiplier) to compute ideal edge length for nested edges
- nestingFactor: 1.2,
- // Gravity force (constant)
- gravity: 1,
- // Maximum number of iterations to perform
- numIter: 1000,
- // Initial temperature (maximum node displacement)
- initialTemp: 1000,
- // Cooling factor (how the temperature is reduced between consecutive iterations
- coolingFactor: 0.99,
- // Lower temperature threshold (below this point the layout will end)
- minTemp: 1.0
-};
-
-/**
- * @brief : constructor
- * @arg options : object containing layout options
- */
-function CoseLayout(options) {
- this.options = extend({}, defaults$4, options);
- this.options.layout = this;
-
- // Exclude any edge that has a source or target node that is not in the set of passed-in nodes
- var nodes = this.options.eles.nodes();
- var edges = this.options.eles.edges();
- var notEdges = edges.filter(function (e) {
- var sourceId = e.source().data('id');
- var targetId = e.target().data('id');
- var hasSource = nodes.some(function (n) {
- return n.data('id') === sourceId;
- });
- var hasTarget = nodes.some(function (n) {
- return n.data('id') === targetId;
- });
- return !hasSource || !hasTarget;
- });
- this.options.eles = this.options.eles.not(notEdges);
-}
-
-/**
- * @brief : runs the layout
- */
-CoseLayout.prototype.run = function () {
- var options = this.options;
- var cy = options.cy;
- var layout = this;
- layout.stopped = false;
- if (options.animate === true || options.animate === false) {
- layout.emit({
- type: 'layoutstart',
- layout: layout
- });
- }
-
- // Set DEBUG - Global variable
- if (true === options.debug) {
- DEBUG = true;
- } else {
- DEBUG = false;
- }
-
- // Initialize layout info
- var layoutInfo = createLayoutInfo(cy, layout, options);
-
- // Show LayoutInfo contents if debugging
- if (DEBUG) {
- printLayoutInfo(layoutInfo);
- }
-
- // If required, randomize node positions
- if (options.randomize) {
- randomizePositions(layoutInfo);
- }
- var startTime = performanceNow();
- var refresh = function refresh() {
- refreshPositions(layoutInfo, cy, options);
-
- // Fit the graph if necessary
- if (true === options.fit) {
- cy.fit(options.padding);
- }
- };
- var mainLoop = function mainLoop(i) {
- if (layout.stopped || i >= options.numIter) {
- // logDebug("Layout manually stopped. Stopping computation in step " + i);
- return false;
- }
-
- // Do one step in the phisical simulation
- step(layoutInfo, options);
-
- // Update temperature
- layoutInfo.temperature = layoutInfo.temperature * options.coolingFactor;
- // logDebug("New temperature: " + layoutInfo.temperature);
-
- if (layoutInfo.temperature < options.minTemp) {
- // logDebug("Temperature drop below minimum threshold. Stopping computation in step " + i);
- return false;
- }
- return true;
- };
- var done = function done() {
- if (options.animate === true || options.animate === false) {
- refresh();
-
- // Layout has finished
- layout.one('layoutstop', options.stop);
- layout.emit({
- type: 'layoutstop',
- layout: layout
- });
- } else {
- var nodes = options.eles.nodes();
- var getScaledPos = getScaleInBoundsFn(layoutInfo, options, nodes);
- nodes.layoutPositions(layout, options, getScaledPos);
- }
- };
- var i = 0;
- var loopRet = true;
- if (options.animate === true) {
- var frame = function frame() {
- var f = 0;
- while (loopRet && f < options.refresh) {
- loopRet = mainLoop(i);
- i++;
- f++;
- }
- if (!loopRet) {
- // it's done
- separateComponents(layoutInfo, options);
- done();
- } else {
- var now = performanceNow();
- if (now - startTime >= options.animationThreshold) {
- refresh();
- }
- requestAnimationFrame(frame);
- }
- };
- frame();
- } else {
- while (loopRet) {
- loopRet = mainLoop(i);
- i++;
- }
- separateComponents(layoutInfo, options);
- done();
- }
- return this; // chaining
-};
-
-/**
- * @brief : called on continuous layouts to stop them before they finish
- */
-CoseLayout.prototype.stop = function () {
- this.stopped = true;
- if (this.thread) {
- this.thread.stop();
- }
- this.emit('layoutstop');
- return this; // chaining
-};
-
-CoseLayout.prototype.destroy = function () {
- if (this.thread) {
- this.thread.stop();
- }
- return this; // chaining
-};
-
-/**
- * @brief : Creates an object which is contains all the data
- * used in the layout process
- * @arg cy : cytoscape.js object
- * @return : layoutInfo object initialized
- */
-var createLayoutInfo = function createLayoutInfo(cy, layout, options) {
- // Shortcut
- var edges = options.eles.edges();
- var nodes = options.eles.nodes();
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- var layoutInfo = {
- isCompound: cy.hasCompoundNodes(),
- layoutNodes: [],
- idToIndex: {},
- nodeSize: nodes.size(),
- graphSet: [],
- indexToGraph: [],
- layoutEdges: [],
- edgeSize: edges.size(),
- temperature: options.initialTemp,
- clientWidth: bb.w,
- clientHeight: bb.h,
- boundingBox: bb
- };
- var components = options.eles.components();
- var id2cmptId = {};
- for (var i = 0; i < components.length; i++) {
- var component = components[i];
- for (var j = 0; j < component.length; j++) {
- var node = component[j];
- id2cmptId[node.id()] = i;
- }
- }
-
- // Iterate over all nodes, creating layout nodes
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = nodes[i];
- var nbb = n.layoutDimensions(options);
- var tempNode = {};
- tempNode.isLocked = n.locked();
- tempNode.id = n.data('id');
- tempNode.parentId = n.data('parent');
- tempNode.cmptId = id2cmptId[n.id()];
- tempNode.children = [];
- tempNode.positionX = n.position('x');
- tempNode.positionY = n.position('y');
- tempNode.offsetX = 0;
- tempNode.offsetY = 0;
- tempNode.height = nbb.w;
- tempNode.width = nbb.h;
- tempNode.maxX = tempNode.positionX + tempNode.width / 2;
- tempNode.minX = tempNode.positionX - tempNode.width / 2;
- tempNode.maxY = tempNode.positionY + tempNode.height / 2;
- tempNode.minY = tempNode.positionY - tempNode.height / 2;
- tempNode.padLeft = parseFloat(n.style('padding'));
- tempNode.padRight = parseFloat(n.style('padding'));
- tempNode.padTop = parseFloat(n.style('padding'));
- tempNode.padBottom = parseFloat(n.style('padding'));
-
- // forces
- tempNode.nodeRepulsion = fn$6(options.nodeRepulsion) ? options.nodeRepulsion(n) : options.nodeRepulsion;
-
- // Add new node
- layoutInfo.layoutNodes.push(tempNode);
- // Add entry to id-index map
- layoutInfo.idToIndex[tempNode.id] = i;
- }
-
- // Inline implementation of a queue, used for traversing the graph in BFS order
- var queue = [];
- var start = 0; // Points to the start the queue
- var end = -1; // Points to the end of the queue
-
- var tempGraph = [];
-
- // Second pass to add child information and
- // initialize queue for hierarchical traversal
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = layoutInfo.layoutNodes[i];
- var p_id = n.parentId;
- // Check if node n has a parent node
- if (null != p_id) {
- // Add node Id to parent's list of children
- layoutInfo.layoutNodes[layoutInfo.idToIndex[p_id]].children.push(n.id);
- } else {
- // If a node doesn't have a parent, then it's in the root graph
- queue[++end] = n.id;
- tempGraph.push(n.id);
- }
- }
-
- // Add root graph to graphSet
- layoutInfo.graphSet.push(tempGraph);
-
- // Traverse the graph, level by level,
- while (start <= end) {
- // Get the node to visit and remove it from queue
- var node_id = queue[start++];
- var node_ix = layoutInfo.idToIndex[node_id];
- var node = layoutInfo.layoutNodes[node_ix];
- var children = node.children;
- if (children.length > 0) {
- // Add children nodes as a new graph to graph set
- layoutInfo.graphSet.push(children);
- // Add children to que queue to be visited
- for (var i = 0; i < children.length; i++) {
- queue[++end] = children[i];
- }
- }
- }
-
- // Create indexToGraph map
- for (var i = 0; i < layoutInfo.graphSet.length; i++) {
- var graph = layoutInfo.graphSet[i];
- for (var j = 0; j < graph.length; j++) {
- var index = layoutInfo.idToIndex[graph[j]];
- layoutInfo.indexToGraph[index] = i;
- }
- }
-
- // Iterate over all edges, creating Layout Edges
- for (var i = 0; i < layoutInfo.edgeSize; i++) {
- var e = edges[i];
- var tempEdge = {};
- tempEdge.id = e.data('id');
- tempEdge.sourceId = e.data('source');
- tempEdge.targetId = e.data('target');
-
- // Compute ideal length
- var idealLength = fn$6(options.idealEdgeLength) ? options.idealEdgeLength(e) : options.idealEdgeLength;
- var elasticity = fn$6(options.edgeElasticity) ? options.edgeElasticity(e) : options.edgeElasticity;
-
- // Check if it's an inter graph edge
- var sourceIx = layoutInfo.idToIndex[tempEdge.sourceId];
- var targetIx = layoutInfo.idToIndex[tempEdge.targetId];
- var sourceGraph = layoutInfo.indexToGraph[sourceIx];
- var targetGraph = layoutInfo.indexToGraph[targetIx];
- if (sourceGraph != targetGraph) {
- // Find lowest common graph ancestor
- var lca = findLCA(tempEdge.sourceId, tempEdge.targetId, layoutInfo);
-
- // Compute sum of node depths, relative to lca graph
- var lcaGraph = layoutInfo.graphSet[lca];
- var depth = 0;
-
- // Source depth
- var tempNode = layoutInfo.layoutNodes[sourceIx];
- while (-1 === lcaGraph.indexOf(tempNode.id)) {
- tempNode = layoutInfo.layoutNodes[layoutInfo.idToIndex[tempNode.parentId]];
- depth++;
- }
-
- // Target depth
- tempNode = layoutInfo.layoutNodes[targetIx];
- while (-1 === lcaGraph.indexOf(tempNode.id)) {
- tempNode = layoutInfo.layoutNodes[layoutInfo.idToIndex[tempNode.parentId]];
- depth++;
- }
-
- // logDebug('LCA of nodes ' + tempEdge.sourceId + ' and ' + tempEdge.targetId +
- // ". Index: " + lca + " Contents: " + lcaGraph.toString() +
- // ". Depth: " + depth);
-
- // Update idealLength
- idealLength *= depth * options.nestingFactor;
- }
- tempEdge.idealLength = idealLength;
- tempEdge.elasticity = elasticity;
- layoutInfo.layoutEdges.push(tempEdge);
- }
-
- // Finally, return layoutInfo object
- return layoutInfo;
-};
-
-/**
- * @brief : This function finds the index of the lowest common
- * graph ancestor between 2 nodes in the subtree
- * (from the graph hierarchy induced tree) whose
- * root is graphIx
- *
- * @arg node1: node1's ID
- * @arg node2: node2's ID
- * @arg layoutInfo: layoutInfo object
- *
- */
-var findLCA = function findLCA(node1, node2, layoutInfo) {
- // Find their common ancester, starting from the root graph
- var res = findLCA_aux(node1, node2, 0, layoutInfo);
- if (2 > res.count) {
- // If aux function couldn't find the common ancester,
- // then it is the root graph
- return 0;
- } else {
- return res.graph;
- }
-};
-
-/**
- * @brief : Auxiliary function used for LCA computation
- *
- * @arg node1 : node1's ID
- * @arg node2 : node2's ID
- * @arg graphIx : subgraph index
- * @arg layoutInfo : layoutInfo object
- *
- * @return : object of the form {count: X, graph: Y}, where:
- * X is the number of ancestors (max: 2) found in
- * graphIx (and it's subgraphs),
- * Y is the graph index of the lowest graph containing
- * all X nodes
- */
-var findLCA_aux = function findLCA_aux(node1, node2, graphIx, layoutInfo) {
- var graph = layoutInfo.graphSet[graphIx];
- // If both nodes belongs to graphIx
- if (-1 < graph.indexOf(node1) && -1 < graph.indexOf(node2)) {
- return {
- count: 2,
- graph: graphIx
- };
- }
-
- // Make recursive calls for all subgraphs
- var c = 0;
- for (var i = 0; i < graph.length; i++) {
- var nodeId = graph[i];
- var nodeIx = layoutInfo.idToIndex[nodeId];
- var children = layoutInfo.layoutNodes[nodeIx].children;
-
- // If the node has no child, skip it
- if (0 === children.length) {
- continue;
- }
- var childGraphIx = layoutInfo.indexToGraph[layoutInfo.idToIndex[children[0]]];
- var result = findLCA_aux(node1, node2, childGraphIx, layoutInfo);
- if (0 === result.count) {
- // Neither node1 nor node2 are present in this subgraph
- continue;
- } else if (1 === result.count) {
- // One of (node1, node2) is present in this subgraph
- c++;
- if (2 === c) {
- // We've already found both nodes, no need to keep searching
- break;
- }
- } else {
- // Both nodes are present in this subgraph
- return result;
- }
- }
- return {
- count: c,
- graph: graphIx
- };
-};
-
-/**
- * @brief: printsLayoutInfo into js console
- * Only used for debbuging
- */
-var printLayoutInfo;
-
-/**
- * @brief : Randomizes the position of all nodes
- */
-var randomizePositions = function randomizePositions(layoutInfo, cy) {
- var width = layoutInfo.clientWidth;
- var height = layoutInfo.clientHeight;
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = layoutInfo.layoutNodes[i];
-
- // No need to randomize compound nodes or locked nodes
- if (0 === n.children.length && !n.isLocked) {
- n.positionX = Math.random() * width;
- n.positionY = Math.random() * height;
- }
- }
-};
-var getScaleInBoundsFn = function getScaleInBoundsFn(layoutInfo, options, nodes) {
- var bb = layoutInfo.boundingBox;
- var coseBB = {
- x1: Infinity,
- x2: -Infinity,
- y1: Infinity,
- y2: -Infinity
- };
- if (options.boundingBox) {
- nodes.forEach(function (node) {
- var lnode = layoutInfo.layoutNodes[layoutInfo.idToIndex[node.data('id')]];
- coseBB.x1 = Math.min(coseBB.x1, lnode.positionX);
- coseBB.x2 = Math.max(coseBB.x2, lnode.positionX);
- coseBB.y1 = Math.min(coseBB.y1, lnode.positionY);
- coseBB.y2 = Math.max(coseBB.y2, lnode.positionY);
- });
- coseBB.w = coseBB.x2 - coseBB.x1;
- coseBB.h = coseBB.y2 - coseBB.y1;
- }
- return function (ele, i) {
- var lnode = layoutInfo.layoutNodes[layoutInfo.idToIndex[ele.data('id')]];
- if (options.boundingBox) {
- // then add extra bounding box constraint
- var pctX = (lnode.positionX - coseBB.x1) / coseBB.w;
- var pctY = (lnode.positionY - coseBB.y1) / coseBB.h;
- return {
- x: bb.x1 + pctX * bb.w,
- y: bb.y1 + pctY * bb.h
- };
- } else {
- return {
- x: lnode.positionX,
- y: lnode.positionY
- };
- }
- };
-};
-
-/**
- * @brief : Updates the positions of nodes in the network
- * @arg layoutInfo : LayoutInfo object
- * @arg cy : Cytoscape object
- * @arg options : Layout options
- */
-var refreshPositions = function refreshPositions(layoutInfo, cy, options) {
- // var s = 'Refreshing positions';
- // logDebug(s);
-
- var layout = options.layout;
- var nodes = options.eles.nodes();
- var getScaledPos = getScaleInBoundsFn(layoutInfo, options, nodes);
- nodes.positions(getScaledPos);
-
- // Trigger layoutReady only on first call
- if (true !== layoutInfo.ready) {
- // s = 'Triggering layoutready';
- // logDebug(s);
- layoutInfo.ready = true;
- layout.one('layoutready', options.ready);
- layout.emit({
- type: 'layoutready',
- layout: this
- });
- }
-};
-
-/**
- * @brief : Logs a debug message in JS console, if DEBUG is ON
- */
-// var logDebug = function(text) {
-// if (DEBUG) {
-// console.debug(text);
-// }
-// };
-
-/**
- * @brief : Performs one iteration of the physical simulation
- * @arg layoutInfo : LayoutInfo object already initialized
- * @arg cy : Cytoscape object
- * @arg options : Layout options
- */
-var step = function step(layoutInfo, options, _step) {
- // var s = "\n\n###############################";
- // s += "\nSTEP: " + step;
- // s += "\n###############################\n";
- // logDebug(s);
-
- // Calculate node repulsions
- calculateNodeForces(layoutInfo, options);
- // Calculate edge forces
- calculateEdgeForces(layoutInfo);
- // Calculate gravity forces
- calculateGravityForces(layoutInfo, options);
- // Propagate forces from parent to child
- propagateForces(layoutInfo);
- // Update positions based on calculated forces
- updatePositions(layoutInfo);
-};
-
-/**
- * @brief : Computes the node repulsion forces
- */
-var calculateNodeForces = function calculateNodeForces(layoutInfo, options) {
- // Go through each of the graphs in graphSet
- // Nodes only repel each other if they belong to the same graph
- // var s = 'calculateNodeForces';
- // logDebug(s);
- for (var i = 0; i < layoutInfo.graphSet.length; i++) {
- var graph = layoutInfo.graphSet[i];
- var numNodes = graph.length;
-
- // s = "Set: " + graph.toString();
- // logDebug(s);
-
- // Now get all the pairs of nodes
- // Only get each pair once, (A, B) = (B, A)
- for (var j = 0; j < numNodes; j++) {
- var node1 = layoutInfo.layoutNodes[layoutInfo.idToIndex[graph[j]]];
- for (var k = j + 1; k < numNodes; k++) {
- var node2 = layoutInfo.layoutNodes[layoutInfo.idToIndex[graph[k]]];
- nodeRepulsion(node1, node2, layoutInfo, options);
- }
- }
- }
-};
-var randomDistance = function randomDistance(max) {
- return -max + 2 * max * Math.random();
-};
-
-/**
- * @brief : Compute the node repulsion forces between a pair of nodes
- */
-var nodeRepulsion = function nodeRepulsion(node1, node2, layoutInfo, options) {
- // var s = "Node repulsion. Node1: " + node1.id + " Node2: " + node2.id;
-
- var cmptId1 = node1.cmptId;
- var cmptId2 = node2.cmptId;
- if (cmptId1 !== cmptId2 && !layoutInfo.isCompound) {
- return;
- }
-
- // Get direction of line connecting both node centers
- var directionX = node2.positionX - node1.positionX;
- var directionY = node2.positionY - node1.positionY;
- var maxRandDist = 1;
- // s += "\ndirectionX: " + directionX + ", directionY: " + directionY;
-
- // If both centers are the same, apply a random force
- if (0 === directionX && 0 === directionY) {
- directionX = randomDistance(maxRandDist);
- directionY = randomDistance(maxRandDist);
- }
- var overlap = nodesOverlap(node1, node2, directionX, directionY);
- if (overlap > 0) {
- // s += "\nNodes DO overlap.";
- // s += "\nOverlap: " + overlap;
- // If nodes overlap, repulsion force is proportional
- // to the overlap
- var force = options.nodeOverlap * overlap;
-
- // Compute the module and components of the force vector
- var distance = Math.sqrt(directionX * directionX + directionY * directionY);
- // s += "\nDistance: " + distance;
- var forceX = force * directionX / distance;
- var forceY = force * directionY / distance;
- } else {
- // s += "\nNodes do NOT overlap.";
- // If there's no overlap, force is inversely proportional
- // to squared distance
-
- // Get clipping points for both nodes
- var point1 = findClippingPoint(node1, directionX, directionY);
- var point2 = findClippingPoint(node2, -1 * directionX, -1 * directionY);
-
- // Use clipping points to compute distance
- var distanceX = point2.x - point1.x;
- var distanceY = point2.y - point1.y;
- var distanceSqr = distanceX * distanceX + distanceY * distanceY;
- var distance = Math.sqrt(distanceSqr);
- // s += "\nDistance: " + distance;
-
- // Compute the module and components of the force vector
- var force = (node1.nodeRepulsion + node2.nodeRepulsion) / distanceSqr;
- var forceX = force * distanceX / distance;
- var forceY = force * distanceY / distance;
- }
-
- // Apply force
- if (!node1.isLocked) {
- node1.offsetX -= forceX;
- node1.offsetY -= forceY;
- }
- if (!node2.isLocked) {
- node2.offsetX += forceX;
- node2.offsetY += forceY;
- }
-
- // s += "\nForceX: " + forceX + " ForceY: " + forceY;
- // logDebug(s);
-
- return;
-};
-
-/**
- * @brief : Determines whether two nodes overlap or not
- * @return : Amount of overlapping (0 => no overlap)
- */
-var nodesOverlap = function nodesOverlap(node1, node2, dX, dY) {
- if (dX > 0) {
- var overlapX = node1.maxX - node2.minX;
- } else {
- var overlapX = node2.maxX - node1.minX;
- }
- if (dY > 0) {
- var overlapY = node1.maxY - node2.minY;
- } else {
- var overlapY = node2.maxY - node1.minY;
- }
- if (overlapX >= 0 && overlapY >= 0) {
- return Math.sqrt(overlapX * overlapX + overlapY * overlapY);
- } else {
- return 0;
- }
-};
-
-/**
- * @brief : Finds the point in which an edge (direction dX, dY) intersects
- * the rectangular bounding box of it's source/target node
- */
-var findClippingPoint = function findClippingPoint(node, dX, dY) {
- // Shorcuts
- var X = node.positionX;
- var Y = node.positionY;
- var H = node.height || 1;
- var W = node.width || 1;
- var dirSlope = dY / dX;
- var nodeSlope = H / W;
-
- // var s = 'Computing clipping point of node ' + node.id +
- // " . Height: " + H + ", Width: " + W +
- // "\nDirection " + dX + ", " + dY;
- //
- // Compute intersection
- var res = {};
-
- // Case: Vertical direction (up)
- if (0 === dX && 0 < dY) {
- res.x = X;
- // s += "\nUp direction";
- res.y = Y + H / 2;
- return res;
- }
-
- // Case: Vertical direction (down)
- if (0 === dX && 0 > dY) {
- res.x = X;
- res.y = Y + H / 2;
- // s += "\nDown direction";
-
- return res;
- }
-
- // Case: Intersects the right border
- if (0 < dX && -1 * nodeSlope <= dirSlope && dirSlope <= nodeSlope) {
- res.x = X + W / 2;
- res.y = Y + W * dY / 2 / dX;
- // s += "\nRightborder";
-
- return res;
- }
-
- // Case: Intersects the left border
- if (0 > dX && -1 * nodeSlope <= dirSlope && dirSlope <= nodeSlope) {
- res.x = X - W / 2;
- res.y = Y - W * dY / 2 / dX;
- // s += "\nLeftborder";
-
- return res;
- }
-
- // Case: Intersects the top border
- if (0 < dY && (dirSlope <= -1 * nodeSlope || dirSlope >= nodeSlope)) {
- res.x = X + H * dX / 2 / dY;
- res.y = Y + H / 2;
- // s += "\nTop border";
-
- return res;
- }
-
- // Case: Intersects the bottom border
- if (0 > dY && (dirSlope <= -1 * nodeSlope || dirSlope >= nodeSlope)) {
- res.x = X - H * dX / 2 / dY;
- res.y = Y - H / 2;
- // s += "\nBottom border";
-
- return res;
- }
-
- // s += "\nClipping point found at " + res.x + ", " + res.y;
- // logDebug(s);
- return res;
-};
-
-/**
- * @brief : Calculates all edge forces
- */
-var calculateEdgeForces = function calculateEdgeForces(layoutInfo, options) {
- // Iterate over all edges
- for (var i = 0; i < layoutInfo.edgeSize; i++) {
- // Get edge, source & target nodes
- var edge = layoutInfo.layoutEdges[i];
- var sourceIx = layoutInfo.idToIndex[edge.sourceId];
- var source = layoutInfo.layoutNodes[sourceIx];
- var targetIx = layoutInfo.idToIndex[edge.targetId];
- var target = layoutInfo.layoutNodes[targetIx];
-
- // Get direction of line connecting both node centers
- var directionX = target.positionX - source.positionX;
- var directionY = target.positionY - source.positionY;
-
- // If both centers are the same, do nothing.
- // A random force has already been applied as node repulsion
- if (0 === directionX && 0 === directionY) {
- continue;
- }
-
- // Get clipping points for both nodes
- var point1 = findClippingPoint(source, directionX, directionY);
- var point2 = findClippingPoint(target, -1 * directionX, -1 * directionY);
- var lx = point2.x - point1.x;
- var ly = point2.y - point1.y;
- var l = Math.sqrt(lx * lx + ly * ly);
- var force = Math.pow(edge.idealLength - l, 2) / edge.elasticity;
- if (0 !== l) {
- var forceX = force * lx / l;
- var forceY = force * ly / l;
- } else {
- var forceX = 0;
- var forceY = 0;
- }
-
- // Add this force to target and source nodes
- if (!source.isLocked) {
- source.offsetX += forceX;
- source.offsetY += forceY;
- }
- if (!target.isLocked) {
- target.offsetX -= forceX;
- target.offsetY -= forceY;
- }
-
- // var s = 'Edge force between nodes ' + source.id + ' and ' + target.id;
- // s += "\nDistance: " + l + " Force: (" + forceX + ", " + forceY + ")";
- // logDebug(s);
- }
-};
-
-/**
- * @brief : Computes gravity forces for all nodes
- */
-var calculateGravityForces = function calculateGravityForces(layoutInfo, options) {
- if (options.gravity === 0) {
- return;
- }
- var distThreshold = 1;
-
- // var s = 'calculateGravityForces';
- // logDebug(s);
- for (var i = 0; i < layoutInfo.graphSet.length; i++) {
- var graph = layoutInfo.graphSet[i];
- var numNodes = graph.length;
-
- // s = "Set: " + graph.toString();
- // logDebug(s);
-
- // Compute graph center
- if (0 === i) {
- var centerX = layoutInfo.clientHeight / 2;
- var centerY = layoutInfo.clientWidth / 2;
- } else {
- // Get Parent node for this graph, and use its position as center
- var temp = layoutInfo.layoutNodes[layoutInfo.idToIndex[graph[0]]];
- var parent = layoutInfo.layoutNodes[layoutInfo.idToIndex[temp.parentId]];
- var centerX = parent.positionX;
- var centerY = parent.positionY;
- }
- // s = "Center found at: " + centerX + ", " + centerY;
- // logDebug(s);
-
- // Apply force to all nodes in graph
- for (var j = 0; j < numNodes; j++) {
- var node = layoutInfo.layoutNodes[layoutInfo.idToIndex[graph[j]]];
- // s = "Node: " + node.id;
-
- if (node.isLocked) {
- continue;
- }
- var dx = centerX - node.positionX;
- var dy = centerY - node.positionY;
- var d = Math.sqrt(dx * dx + dy * dy);
- if (d > distThreshold) {
- var fx = options.gravity * dx / d;
- var fy = options.gravity * dy / d;
- node.offsetX += fx;
- node.offsetY += fy;
- // s += ": Applied force: " + fx + ", " + fy;
- }
- // logDebug(s);
- }
- }
-};
-
-/**
- * @brief : This function propagates the existing offsets from
- * parent nodes to its descendents.
- * @arg layoutInfo : layoutInfo Object
- * @arg cy : cytoscape Object
- * @arg options : Layout options
- */
-var propagateForces = function propagateForces(layoutInfo, options) {
- // Inline implementation of a queue, used for traversing the graph in BFS order
- var queue = [];
- var start = 0; // Points to the start the queue
- var end = -1; // Points to the end of the queue
-
- // logDebug('propagateForces');
-
- // Start by visiting the nodes in the root graph
- queue.push.apply(queue, layoutInfo.graphSet[0]);
- end += layoutInfo.graphSet[0].length;
-
- // Traverse the graph, level by level,
- while (start <= end) {
- // Get the node to visit and remove it from queue
- var nodeId = queue[start++];
- var nodeIndex = layoutInfo.idToIndex[nodeId];
- var node = layoutInfo.layoutNodes[nodeIndex];
- var children = node.children;
-
- // We only need to process the node if it's compound
- if (0 < children.length && !node.isLocked) {
- var offX = node.offsetX;
- var offY = node.offsetY;
-
- // var s = "Propagating offset from parent node : " + node.id +
- // ". OffsetX: " + offX + ". OffsetY: " + offY;
- // s += "\n Children: " + children.toString();
- // logDebug(s);
-
- for (var i = 0; i < children.length; i++) {
- var childNode = layoutInfo.layoutNodes[layoutInfo.idToIndex[children[i]]];
- // Propagate offset
- childNode.offsetX += offX;
- childNode.offsetY += offY;
- // Add children to queue to be visited
- queue[++end] = children[i];
- }
-
- // Reset parent offsets
- node.offsetX = 0;
- node.offsetY = 0;
- }
- }
-};
-
-/**
- * @brief : Updates the layout model positions, based on
- * the accumulated forces
- */
-var updatePositions = function updatePositions(layoutInfo, options) {
- // var s = 'Updating positions';
- // logDebug(s);
-
- // Reset boundaries for compound nodes
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = layoutInfo.layoutNodes[i];
- if (0 < n.children.length) {
- // logDebug("Resetting boundaries of compound node: " + n.id);
- n.maxX = undefined;
- n.minX = undefined;
- n.maxY = undefined;
- n.minY = undefined;
- }
- }
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = layoutInfo.layoutNodes[i];
- if (0 < n.children.length || n.isLocked) {
- // No need to set compound or locked node position
- // logDebug("Skipping position update of node: " + n.id);
- continue;
- }
- // s = "Node: " + n.id + " Previous position: (" +
- // n.positionX + ", " + n.positionY + ").";
-
- // Limit displacement in order to improve stability
- var tempForce = limitForce(n.offsetX, n.offsetY, layoutInfo.temperature);
- n.positionX += tempForce.x;
- n.positionY += tempForce.y;
- n.offsetX = 0;
- n.offsetY = 0;
- n.minX = n.positionX - n.width;
- n.maxX = n.positionX + n.width;
- n.minY = n.positionY - n.height;
- n.maxY = n.positionY + n.height;
- // s += " New Position: (" + n.positionX + ", " + n.positionY + ").";
- // logDebug(s);
-
- // Update ancestry boudaries
- updateAncestryBoundaries(n, layoutInfo);
- }
-
- // Update size, position of compund nodes
- for (var i = 0; i < layoutInfo.nodeSize; i++) {
- var n = layoutInfo.layoutNodes[i];
- if (0 < n.children.length && !n.isLocked) {
- n.positionX = (n.maxX + n.minX) / 2;
- n.positionY = (n.maxY + n.minY) / 2;
- n.width = n.maxX - n.minX;
- n.height = n.maxY - n.minY;
- // s = "Updating position, size of compound node " + n.id;
- // s += "\nPositionX: " + n.positionX + ", PositionY: " + n.positionY;
- // s += "\nWidth: " + n.width + ", Height: " + n.height;
- // logDebug(s);
- }
- }
-};
-
-/**
- * @brief : Limits a force (forceX, forceY) to be not
- * greater (in modulo) than max.
- 8 Preserves force direction.
- */
-var limitForce = function limitForce(forceX, forceY, max) {
- // var s = "Limiting force: (" + forceX + ", " + forceY + "). Max: " + max;
- var force = Math.sqrt(forceX * forceX + forceY * forceY);
- if (force > max) {
- var res = {
- x: max * forceX / force,
- y: max * forceY / force
- };
- } else {
- var res = {
- x: forceX,
- y: forceY
- };
- }
-
- // s += ".\nResult: (" + res.x + ", " + res.y + ")";
- // logDebug(s);
-
- return res;
-};
-
-/**
- * @brief : Function used for keeping track of compound node
- * sizes, since they should bound all their subnodes.
- */
-var updateAncestryBoundaries = function updateAncestryBoundaries(node, layoutInfo) {
- // var s = "Propagating new position/size of node " + node.id;
- var parentId = node.parentId;
- if (null == parentId) {
- // If there's no parent, we are done
- // s += ". No parent node.";
- // logDebug(s);
- return;
- }
-
- // Get Parent Node
- var p = layoutInfo.layoutNodes[layoutInfo.idToIndex[parentId]];
- var flag = false;
-
- // MaxX
- if (null == p.maxX || node.maxX + p.padRight > p.maxX) {
- p.maxX = node.maxX + p.padRight;
- flag = true;
- // s += "\nNew maxX for parent node " + p.id + ": " + p.maxX;
- }
-
- // MinX
- if (null == p.minX || node.minX - p.padLeft < p.minX) {
- p.minX = node.minX - p.padLeft;
- flag = true;
- // s += "\nNew minX for parent node " + p.id + ": " + p.minX;
- }
-
- // MaxY
- if (null == p.maxY || node.maxY + p.padBottom > p.maxY) {
- p.maxY = node.maxY + p.padBottom;
- flag = true;
- // s += "\nNew maxY for parent node " + p.id + ": " + p.maxY;
- }
-
- // MinY
- if (null == p.minY || node.minY - p.padTop < p.minY) {
- p.minY = node.minY - p.padTop;
- flag = true;
- // s += "\nNew minY for parent node " + p.id + ": " + p.minY;
- }
-
- // If updated boundaries, propagate changes upward
- if (flag) {
- // logDebug(s);
- return updateAncestryBoundaries(p, layoutInfo);
- }
-
- // s += ". No changes in boundaries/position of parent node " + p.id;
- // logDebug(s);
- return;
-};
-var separateComponents = function separateComponents(layoutInfo, options) {
- var nodes = layoutInfo.layoutNodes;
- var components = [];
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- var cid = node.cmptId;
- var component = components[cid] = components[cid] || [];
- component.push(node);
- }
- var totalA = 0;
- for (var i = 0; i < components.length; i++) {
- var c = components[i];
- if (!c) {
- continue;
- }
- c.x1 = Infinity;
- c.x2 = -Infinity;
- c.y1 = Infinity;
- c.y2 = -Infinity;
- for (var j = 0; j < c.length; j++) {
- var n = c[j];
- c.x1 = Math.min(c.x1, n.positionX - n.width / 2);
- c.x2 = Math.max(c.x2, n.positionX + n.width / 2);
- c.y1 = Math.min(c.y1, n.positionY - n.height / 2);
- c.y2 = Math.max(c.y2, n.positionY + n.height / 2);
- }
- c.w = c.x2 - c.x1;
- c.h = c.y2 - c.y1;
- totalA += c.w * c.h;
- }
- components.sort(function (c1, c2) {
- return c2.w * c2.h - c1.w * c1.h;
- });
- var x = 0;
- var y = 0;
- var usedW = 0;
- var rowH = 0;
- var maxRowW = Math.sqrt(totalA) * layoutInfo.clientWidth / layoutInfo.clientHeight;
- for (var i = 0; i < components.length; i++) {
- var c = components[i];
- if (!c) {
- continue;
- }
- for (var j = 0; j < c.length; j++) {
- var n = c[j];
- if (!n.isLocked) {
- n.positionX += x - c.x1;
- n.positionY += y - c.y1;
- }
- }
- x += c.w + options.componentSpacing;
- usedW += c.w + options.componentSpacing;
- rowH = Math.max(rowH, c.h);
- if (usedW > maxRowW) {
- y += rowH + options.componentSpacing;
- x = 0;
- usedW = 0;
- rowH = 0;
- }
- }
-};
-
-var defaults$3 = {
- fit: true,
- // whether to fit the viewport to the graph
- padding: 30,
- // padding used on fit
- boundingBox: undefined,
- // constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- avoidOverlap: true,
- // prevents node overlap, may overflow boundingBox if not enough space
- avoidOverlapPadding: 10,
- // extra spacing around nodes when avoidOverlap: true
- nodeDimensionsIncludeLabels: false,
- // Excludes the label when calculating node bounding boxes for the layout algorithm
- spacingFactor: undefined,
- // Applies a multiplicative factor (>0) to expand or compress the overall area that the nodes take up
- condense: false,
- // uses all available space on false, uses minimal space on true
- rows: undefined,
- // force num of rows in the grid
- cols: undefined,
- // force num of columns in the grid
- position: function position(node) {},
- // returns { row, col } for element
- sort: undefined,
- // a sorting function to order the nodes; e.g. function(a, b){ return a.data('weight') - b.data('weight') }
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-function GridLayout(options) {
- this.options = extend({}, defaults$3, options);
-}
-GridLayout.prototype.run = function () {
- var params = this.options;
- var options = params;
- var cy = params.cy;
- var eles = options.eles;
- var nodes = eles.nodes().not(':parent');
- if (options.sort) {
- nodes = nodes.sort(options.sort);
- }
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- if (bb.h === 0 || bb.w === 0) {
- eles.nodes().layoutPositions(this, options, function (ele) {
- return {
- x: bb.x1,
- y: bb.y1
- };
- });
- } else {
- // width/height * splits^2 = cells where splits is number of times to split width
- var cells = nodes.size();
- var splits = Math.sqrt(cells * bb.h / bb.w);
- var rows = Math.round(splits);
- var cols = Math.round(bb.w / bb.h * splits);
- var small = function small(val) {
- if (val == null) {
- return Math.min(rows, cols);
- } else {
- var min = Math.min(rows, cols);
- if (min == rows) {
- rows = val;
- } else {
- cols = val;
- }
- }
- };
- var large = function large(val) {
- if (val == null) {
- return Math.max(rows, cols);
- } else {
- var max = Math.max(rows, cols);
- if (max == rows) {
- rows = val;
- } else {
- cols = val;
- }
- }
- };
- var oRows = options.rows;
- var oCols = options.cols != null ? options.cols : options.columns;
-
- // if rows or columns were set in options, use those values
- if (oRows != null && oCols != null) {
- rows = oRows;
- cols = oCols;
- } else if (oRows != null && oCols == null) {
- rows = oRows;
- cols = Math.ceil(cells / rows);
- } else if (oRows == null && oCols != null) {
- cols = oCols;
- rows = Math.ceil(cells / cols);
- }
-
- // otherwise use the automatic values and adjust accordingly
-
- // if rounding was up, see if we can reduce rows or columns
- else if (cols * rows > cells) {
- var sm = small();
- var lg = large();
-
- // reducing the small side takes away the most cells, so try it first
- if ((sm - 1) * lg >= cells) {
- small(sm - 1);
- } else if ((lg - 1) * sm >= cells) {
- large(lg - 1);
- }
- } else {
- // if rounding was too low, add rows or columns
- while (cols * rows < cells) {
- var _sm = small();
- var _lg = large();
-
- // try to add to larger side first (adds less in multiplication)
- if ((_lg + 1) * _sm >= cells) {
- large(_lg + 1);
- } else {
- small(_sm + 1);
- }
- }
- }
- var cellWidth = bb.w / cols;
- var cellHeight = bb.h / rows;
- if (options.condense) {
- cellWidth = 0;
- cellHeight = 0;
- }
- if (options.avoidOverlap) {
- for (var i = 0; i < nodes.length; i++) {
- var node = nodes[i];
- var pos = node._private.position;
- if (pos.x == null || pos.y == null) {
- // for bb
- pos.x = 0;
- pos.y = 0;
- }
- var nbb = node.layoutDimensions(options);
- var p = options.avoidOverlapPadding;
- var w = nbb.w + p;
- var h = nbb.h + p;
- cellWidth = Math.max(cellWidth, w);
- cellHeight = Math.max(cellHeight, h);
- }
- }
- var cellUsed = {}; // e.g. 'c-0-2' => true
-
- var used = function used(row, col) {
- return cellUsed['c-' + row + '-' + col] ? true : false;
- };
- var use = function use(row, col) {
- cellUsed['c-' + row + '-' + col] = true;
- };
-
- // to keep track of current cell position
- var row = 0;
- var col = 0;
- var moveToNextCell = function moveToNextCell() {
- col++;
- if (col >= cols) {
- col = 0;
- row++;
- }
- };
-
- // get a cache of all the manual positions
- var id2manPos = {};
- for (var _i = 0; _i < nodes.length; _i++) {
- var _node = nodes[_i];
- var rcPos = options.position(_node);
- if (rcPos && (rcPos.row !== undefined || rcPos.col !== undefined)) {
- // must have at least row or col def'd
- var _pos = {
- row: rcPos.row,
- col: rcPos.col
- };
- if (_pos.col === undefined) {
- // find unused col
- _pos.col = 0;
- while (used(_pos.row, _pos.col)) {
- _pos.col++;
- }
- } else if (_pos.row === undefined) {
- // find unused row
- _pos.row = 0;
- while (used(_pos.row, _pos.col)) {
- _pos.row++;
- }
- }
- id2manPos[_node.id()] = _pos;
- use(_pos.row, _pos.col);
- }
- }
- var getPos = function getPos(element, i) {
- var x, y;
- if (element.locked() || element.isParent()) {
- return false;
- }
-
- // see if we have a manual position set
- var rcPos = id2manPos[element.id()];
- if (rcPos) {
- x = rcPos.col * cellWidth + cellWidth / 2 + bb.x1;
- y = rcPos.row * cellHeight + cellHeight / 2 + bb.y1;
- } else {
- // otherwise set automatically
-
- while (used(row, col)) {
- moveToNextCell();
- }
- x = col * cellWidth + cellWidth / 2 + bb.x1;
- y = row * cellHeight + cellHeight / 2 + bb.y1;
- use(row, col);
- moveToNextCell();
- }
- return {
- x: x,
- y: y
- };
- };
- nodes.layoutPositions(this, options, getPos);
- }
- return this; // chaining
-};
-
-// default layout options
-var defaults$2 = {
- ready: function ready() {},
- // on layoutready
- stop: function stop() {} // on layoutstop
-};
-
-// constructor
-// options : object containing layout options
-function NullLayout(options) {
- this.options = extend({}, defaults$2, options);
-}
-
-// runs the layout
-NullLayout.prototype.run = function () {
- var options = this.options;
- var eles = options.eles; // elements to consider in the layout
- var layout = this;
-
- // cy is automatically populated for us in the constructor
- // (disable eslint for next line as this serves as example layout code to external developers)
- // eslint-disable-next-line no-unused-vars
- options.cy;
- layout.emit('layoutstart');
-
- // puts all nodes at (0, 0)
- // n.b. most layouts would use layoutPositions(), instead of positions() and manual events
- eles.nodes().positions(function () {
- return {
- x: 0,
- y: 0
- };
- });
-
- // trigger layoutready when each node has had its position set at least once
- layout.one('layoutready', options.ready);
- layout.emit('layoutready');
-
- // trigger layoutstop when the layout stops (e.g. finishes)
- layout.one('layoutstop', options.stop);
- layout.emit('layoutstop');
- return this; // chaining
-};
-
-// called on continuous layouts to stop them before they finish
-NullLayout.prototype.stop = function () {
- return this; // chaining
-};
-
-var defaults$1 = {
- positions: undefined,
- // map of (node id) => (position obj); or function(node){ return somPos; }
- zoom: undefined,
- // the zoom level to set (prob want fit = false if set)
- pan: undefined,
- // the pan level to set (prob want fit = false if set)
- fit: true,
- // whether to fit to viewport
- padding: 30,
- // padding on fit
- spacingFactor: undefined,
- // Applies a multiplicative factor (>0) to expand or compress the overall area that the nodes take up
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-function PresetLayout(options) {
- this.options = extend({}, defaults$1, options);
-}
-PresetLayout.prototype.run = function () {
- var options = this.options;
- var eles = options.eles;
- var nodes = eles.nodes();
- var posIsFn = fn$6(options.positions);
- function getPosition(node) {
- if (options.positions == null) {
- return copyPosition(node.position());
- }
- if (posIsFn) {
- return options.positions(node);
- }
- var pos = options.positions[node._private.data.id];
- if (pos == null) {
- return null;
- }
- return pos;
- }
- nodes.layoutPositions(this, options, function (node, i) {
- var position = getPosition(node);
- if (node.locked() || position == null) {
- return false;
- }
- return position;
- });
- return this; // chaining
-};
-
-var defaults = {
- fit: true,
- // whether to fit to viewport
- padding: 30,
- // fit padding
- boundingBox: undefined,
- // constrain layout bounds; { x1, y1, x2, y2 } or { x1, y1, w, h }
- animate: false,
- // whether to transition the node positions
- animationDuration: 500,
- // duration of animation in ms if enabled
- animationEasing: undefined,
- // easing of animation if enabled
- animateFilter: function animateFilter(node, i) {
- return true;
- },
- // a function that determines whether the node should be animated. All nodes animated by default on animate enabled. Non-animated nodes are positioned immediately when the layout starts
- ready: undefined,
- // callback on layoutready
- stop: undefined,
- // callback on layoutstop
- transform: function transform(node, position) {
- return position;
- } // transform a given node position. Useful for changing flow direction in discrete layouts
-};
-
-function RandomLayout(options) {
- this.options = extend({}, defaults, options);
-}
-RandomLayout.prototype.run = function () {
- var options = this.options;
- var cy = options.cy;
- var eles = options.eles;
- var bb = makeBoundingBox(options.boundingBox ? options.boundingBox : {
- x1: 0,
- y1: 0,
- w: cy.width(),
- h: cy.height()
- });
- var getPos = function getPos(node, i) {
- return {
- x: bb.x1 + Math.round(Math.random() * bb.w),
- y: bb.y1 + Math.round(Math.random() * bb.h)
- };
- };
- eles.nodes().layoutPositions(this, options, getPos);
- return this; // chaining
-};
-
-var layout = [{
- name: 'breadthfirst',
- impl: BreadthFirstLayout
-}, {
- name: 'circle',
- impl: CircleLayout
-}, {
- name: 'concentric',
- impl: ConcentricLayout
-}, {
- name: 'cose',
- impl: CoseLayout
-}, {
- name: 'grid',
- impl: GridLayout
-}, {
- name: 'null',
- impl: NullLayout
-}, {
- name: 'preset',
- impl: PresetLayout
-}, {
- name: 'random',
- impl: RandomLayout
-}];
-
-function NullRenderer(options) {
- this.options = options;
- this.notifications = 0; // for testing
-}
-
-var noop = function noop() {};
-var throwImgErr = function throwImgErr() {
- throw new Error('A headless instance can not render images');
-};
-NullRenderer.prototype = {
- recalculateRenderedStyle: noop,
- notify: function notify() {
- this.notifications++;
- },
- init: noop,
- isHeadless: function isHeadless() {
- return true;
- },
- png: throwImgErr,
- jpg: throwImgErr
-};
-
-var BRp$f = {};
-BRp$f.arrowShapeWidth = 0.3;
-BRp$f.registerArrowShapes = function () {
- var arrowShapes = this.arrowShapes = {};
- var renderer = this;
-
- // Contract for arrow shapes:
- // 0, 0 is arrow tip
- // (0, 1) is direction towards node
- // (1, 0) is right
- //
- // functional api:
- // collide: check x, y in shape
- // roughCollide: called before collide, no false negatives
- // draw: draw
- // spacing: dist(arrowTip, nodeBoundary)
- // gap: dist(edgeTip, nodeBoundary), edgeTip may != arrowTip
-
- var bbCollide = function bbCollide(x, y, size, angle, translation, edgeWidth, padding) {
- var x1 = translation.x - size / 2 - padding;
- var x2 = translation.x + size / 2 + padding;
- var y1 = translation.y - size / 2 - padding;
- var y2 = translation.y + size / 2 + padding;
- var inside = x1 <= x && x <= x2 && y1 <= y && y <= y2;
- return inside;
- };
- var transform = function transform(x, y, size, angle, translation) {
- var xRotated = x * Math.cos(angle) - y * Math.sin(angle);
- var yRotated = x * Math.sin(angle) + y * Math.cos(angle);
- var xScaled = xRotated * size;
- var yScaled = yRotated * size;
- var xTranslated = xScaled + translation.x;
- var yTranslated = yScaled + translation.y;
- return {
- x: xTranslated,
- y: yTranslated
- };
- };
- var transformPoints = function transformPoints(pts, size, angle, translation) {
- var retPts = [];
- for (var i = 0; i < pts.length; i += 2) {
- var x = pts[i];
- var y = pts[i + 1];
- retPts.push(transform(x, y, size, angle, translation));
- }
- return retPts;
- };
- var pointsToArr = function pointsToArr(pts) {
- var ret = [];
- for (var i = 0; i < pts.length; i++) {
- var p = pts[i];
- ret.push(p.x, p.y);
- }
- return ret;
- };
- var standardGap = function standardGap(edge) {
- return edge.pstyle('width').pfValue * edge.pstyle('arrow-scale').pfValue * 2;
- };
- var defineArrowShape = function defineArrowShape(name, defn) {
- if (string(defn)) {
- defn = arrowShapes[defn];
- }
- arrowShapes[name] = extend({
- name: name,
- points: [-0.15, -0.3, 0.15, -0.3, 0.15, 0.3, -0.15, 0.3],
- collide: function collide(x, y, size, angle, translation, padding) {
- var points = pointsToArr(transformPoints(this.points, size + 2 * padding, angle, translation));
- var inside = pointInsidePolygonPoints(x, y, points);
- return inside;
- },
- roughCollide: bbCollide,
- draw: function draw(context, size, angle, translation) {
- var points = transformPoints(this.points, size, angle, translation);
- renderer.arrowShapeImpl('polygon')(context, points);
- },
- spacing: function spacing(edge) {
- return 0;
- },
- gap: standardGap
- }, defn);
- };
- defineArrowShape('none', {
- collide: falsify,
- roughCollide: falsify,
- draw: noop$1,
- spacing: zeroify,
- gap: zeroify
- });
- defineArrowShape('triangle', {
- points: [-0.15, -0.3, 0, 0, 0.15, -0.3]
- });
- defineArrowShape('arrow', 'triangle');
- defineArrowShape('triangle-backcurve', {
- points: arrowShapes['triangle'].points,
- controlPoint: [0, -0.15],
- roughCollide: bbCollide,
- draw: function draw(context, size, angle, translation, edgeWidth) {
- var ptsTrans = transformPoints(this.points, size, angle, translation);
- var ctrlPt = this.controlPoint;
- var ctrlPtTrans = transform(ctrlPt[0], ctrlPt[1], size, angle, translation);
- renderer.arrowShapeImpl(this.name)(context, ptsTrans, ctrlPtTrans);
- },
- gap: function gap(edge) {
- return standardGap(edge) * 0.8;
- }
- });
- defineArrowShape('triangle-tee', {
- points: [0, 0, 0.15, -0.3, -0.15, -0.3, 0, 0],
- pointsTee: [-0.15, -0.4, -0.15, -0.5, 0.15, -0.5, 0.15, -0.4],
- collide: function collide(x, y, size, angle, translation, edgeWidth, padding) {
- var triPts = pointsToArr(transformPoints(this.points, size + 2 * padding, angle, translation));
- var teePts = pointsToArr(transformPoints(this.pointsTee, size + 2 * padding, angle, translation));
- var inside = pointInsidePolygonPoints(x, y, triPts) || pointInsidePolygonPoints(x, y, teePts);
- return inside;
- },
- draw: function draw(context, size, angle, translation, edgeWidth) {
- var triPts = transformPoints(this.points, size, angle, translation);
- var teePts = transformPoints(this.pointsTee, size, angle, translation);
- renderer.arrowShapeImpl(this.name)(context, triPts, teePts);
- }
- });
- defineArrowShape('circle-triangle', {
- radius: 0.15,
- pointsTr: [0, -0.15, 0.15, -0.45, -0.15, -0.45, 0, -0.15],
- collide: function collide(x, y, size, angle, translation, edgeWidth, padding) {
- var t = translation;
- var circleInside = Math.pow(t.x - x, 2) + Math.pow(t.y - y, 2) <= Math.pow((size + 2 * padding) * this.radius, 2);
- var triPts = pointsToArr(transformPoints(this.points, size + 2 * padding, angle, translation));
- return pointInsidePolygonPoints(x, y, triPts) || circleInside;
- },
- draw: function draw(context, size, angle, translation, edgeWidth) {
- var triPts = transformPoints(this.pointsTr, size, angle, translation);
- renderer.arrowShapeImpl(this.name)(context, triPts, translation.x, translation.y, this.radius * size);
- },
- spacing: function spacing(edge) {
- return renderer.getArrowWidth(edge.pstyle('width').pfValue, edge.pstyle('arrow-scale').value) * this.radius;
- }
- });
- defineArrowShape('triangle-cross', {
- points: [0, 0, 0.15, -0.3, -0.15, -0.3, 0, 0],
- baseCrossLinePts: [-0.15, -0.4,
- // first half of the rectangle
- -0.15, -0.4, 0.15, -0.4,
- // second half of the rectangle
- 0.15, -0.4],
- crossLinePts: function crossLinePts(size, edgeWidth) {
- // shift points so that the distance between the cross points matches edge width
- var p = this.baseCrossLinePts.slice();
- var shiftFactor = edgeWidth / size;
- var y0 = 3;
- var y1 = 5;
- p[y0] = p[y0] - shiftFactor;
- p[y1] = p[y1] - shiftFactor;
- return p;
- },
- collide: function collide(x, y, size, angle, translation, edgeWidth, padding) {
- var triPts = pointsToArr(transformPoints(this.points, size + 2 * padding, angle, translation));
- var teePts = pointsToArr(transformPoints(this.crossLinePts(size, edgeWidth), size + 2 * padding, angle, translation));
- var inside = pointInsidePolygonPoints(x, y, triPts) || pointInsidePolygonPoints(x, y, teePts);
- return inside;
- },
- draw: function draw(context, size, angle, translation, edgeWidth) {
- var triPts = transformPoints(this.points, size, angle, translation);
- var crossLinePts = transformPoints(this.crossLinePts(size, edgeWidth), size, angle, translation);
- renderer.arrowShapeImpl(this.name)(context, triPts, crossLinePts);
- }
- });
- defineArrowShape('vee', {
- points: [-0.15, -0.3, 0, 0, 0.15, -0.3, 0, -0.15],
- gap: function gap(edge) {
- return standardGap(edge) * 0.525;
- }
- });
- defineArrowShape('circle', {
- radius: 0.15,
- collide: function collide(x, y, size, angle, translation, edgeWidth, padding) {
- var t = translation;
- var inside = Math.pow(t.x - x, 2) + Math.pow(t.y - y, 2) <= Math.pow((size + 2 * padding) * this.radius, 2);
- return inside;
- },
- draw: function draw(context, size, angle, translation, edgeWidth) {
- renderer.arrowShapeImpl(this.name)(context, translation.x, translation.y, this.radius * size);
- },
- spacing: function spacing(edge) {
- return renderer.getArrowWidth(edge.pstyle('width').pfValue, edge.pstyle('arrow-scale').value) * this.radius;
- }
- });
- defineArrowShape('tee', {
- points: [-0.15, 0, -0.15, -0.1, 0.15, -0.1, 0.15, 0],
- spacing: function spacing(edge) {
- return 1;
- },
- gap: function gap(edge) {
- return 1;
- }
- });
- defineArrowShape('square', {
- points: [-0.15, 0.00, 0.15, 0.00, 0.15, -0.3, -0.15, -0.3]
- });
- defineArrowShape('diamond', {
- points: [-0.15, -0.15, 0, -0.3, 0.15, -0.15, 0, 0],
- gap: function gap(edge) {
- return edge.pstyle('width').pfValue * edge.pstyle('arrow-scale').value;
- }
- });
- defineArrowShape('chevron', {
- points: [0, 0, -0.15, -0.15, -0.1, -0.2, 0, -0.1, 0.1, -0.2, 0.15, -0.15],
- gap: function gap(edge) {
- return 0.95 * edge.pstyle('width').pfValue * edge.pstyle('arrow-scale').value;
- }
- });
-};
-
-var BRp$e = {};
-
-// Project mouse
-BRp$e.projectIntoViewport = function (clientX, clientY) {
- var cy = this.cy;
- var offsets = this.findContainerClientCoords();
- var offsetLeft = offsets[0];
- var offsetTop = offsets[1];
- var scale = offsets[4];
- var pan = cy.pan();
- var zoom = cy.zoom();
- var x = ((clientX - offsetLeft) / scale - pan.x) / zoom;
- var y = ((clientY - offsetTop) / scale - pan.y) / zoom;
- return [x, y];
-};
-BRp$e.findContainerClientCoords = function () {
- if (this.containerBB) {
- return this.containerBB;
- }
- var container = this.container;
- var rect = container.getBoundingClientRect();
- var style = this.cy.window().getComputedStyle(container);
- var styleValue = function styleValue(name) {
- return parseFloat(style.getPropertyValue(name));
- };
- var padding = {
- left: styleValue('padding-left'),
- right: styleValue('padding-right'),
- top: styleValue('padding-top'),
- bottom: styleValue('padding-bottom')
- };
- var border = {
- left: styleValue('border-left-width'),
- right: styleValue('border-right-width'),
- top: styleValue('border-top-width'),
- bottom: styleValue('border-bottom-width')
- };
- var clientWidth = container.clientWidth;
- var clientHeight = container.clientHeight;
- var paddingHor = padding.left + padding.right;
- var paddingVer = padding.top + padding.bottom;
- var borderHor = border.left + border.right;
- var scale = rect.width / (clientWidth + borderHor);
- var unscaledW = clientWidth - paddingHor;
- var unscaledH = clientHeight - paddingVer;
- var left = rect.left + padding.left + border.left;
- var top = rect.top + padding.top + border.top;
- return this.containerBB = [left, top, unscaledW, unscaledH, scale];
-};
-BRp$e.invalidateContainerClientCoordsCache = function () {
- this.containerBB = null;
-};
-BRp$e.findNearestElement = function (x, y, interactiveElementsOnly, isTouch) {
- return this.findNearestElements(x, y, interactiveElementsOnly, isTouch)[0];
-};
-BRp$e.findNearestElements = function (x, y, interactiveElementsOnly, isTouch) {
- var self = this;
- var r = this;
- var eles = r.getCachedZSortedEles();
- var near = []; // 1 node max, 1 edge max
- var zoom = r.cy.zoom();
- var hasCompounds = r.cy.hasCompoundNodes();
- var edgeThreshold = (isTouch ? 24 : 8) / zoom;
- var nodeThreshold = (isTouch ? 8 : 2) / zoom;
- var labelThreshold = (isTouch ? 8 : 2) / zoom;
- var minSqDist = Infinity;
- var nearEdge;
- var nearNode;
- if (interactiveElementsOnly) {
- eles = eles.interactive;
- }
- function addEle(ele, sqDist) {
- if (ele.isNode()) {
- if (nearNode) {
- return; // can't replace node
- } else {
- nearNode = ele;
- near.push(ele);
- }
- }
- if (ele.isEdge() && (sqDist == null || sqDist < minSqDist)) {
- if (nearEdge) {
- // then replace existing edge
- // can replace only if same z-index
- if (nearEdge.pstyle('z-compound-depth').value === ele.pstyle('z-compound-depth').value && nearEdge.pstyle('z-compound-depth').value === ele.pstyle('z-compound-depth').value) {
- for (var i = 0; i < near.length; i++) {
- if (near[i].isEdge()) {
- near[i] = ele;
- nearEdge = ele;
- minSqDist = sqDist != null ? sqDist : minSqDist;
- break;
- }
- }
- }
- } else {
- near.push(ele);
- nearEdge = ele;
- minSqDist = sqDist != null ? sqDist : minSqDist;
- }
- }
- }
- function checkNode(node) {
- var width = node.outerWidth() + 2 * nodeThreshold;
- var height = node.outerHeight() + 2 * nodeThreshold;
- var hw = width / 2;
- var hh = height / 2;
- var pos = node.position();
- if (pos.x - hw <= x && x <= pos.x + hw // bb check x
- && pos.y - hh <= y && y <= pos.y + hh // bb check y
- ) {
- var shape = r.nodeShapes[self.getNodeShape(node)];
- if (shape.checkPoint(x, y, 0, width, height, pos.x, pos.y)) {
- addEle(node, 0);
- return true;
- }
- }
- }
- function checkEdge(edge) {
- var _p = edge._private;
- var rs = _p.rscratch;
- var styleWidth = edge.pstyle('width').pfValue;
- var scale = edge.pstyle('arrow-scale').value;
- var width = styleWidth / 2 + edgeThreshold; // more like a distance radius from centre
- var widthSq = width * width;
- var width2 = width * 2;
- var src = _p.source;
- var tgt = _p.target;
- var sqDist;
- if (rs.edgeType === 'segments' || rs.edgeType === 'straight' || rs.edgeType === 'haystack') {
- var pts = rs.allpts;
- for (var i = 0; i + 3 < pts.length; i += 2) {
- if (inLineVicinity(x, y, pts[i], pts[i + 1], pts[i + 2], pts[i + 3], width2) && widthSq > (sqDist = sqdistToFiniteLine(x, y, pts[i], pts[i + 1], pts[i + 2], pts[i + 3]))) {
- addEle(edge, sqDist);
- return true;
- }
- }
- } else if (rs.edgeType === 'bezier' || rs.edgeType === 'multibezier' || rs.edgeType === 'self' || rs.edgeType === 'compound') {
- var pts = rs.allpts;
- for (var i = 0; i + 5 < rs.allpts.length; i += 4) {
- if (inBezierVicinity(x, y, pts[i], pts[i + 1], pts[i + 2], pts[i + 3], pts[i + 4], pts[i + 5], width2) && widthSq > (sqDist = sqdistToQuadraticBezier(x, y, pts[i], pts[i + 1], pts[i + 2], pts[i + 3], pts[i + 4], pts[i + 5]))) {
- addEle(edge, sqDist);
- return true;
- }
- }
- }
-
- // if we're close to the edge but didn't hit it, maybe we hit its arrows
-
- var src = src || _p.source;
- var tgt = tgt || _p.target;
- var arSize = self.getArrowWidth(styleWidth, scale);
- var arrows = [{
- name: 'source',
- x: rs.arrowStartX,
- y: rs.arrowStartY,
- angle: rs.srcArrowAngle
- }, {
- name: 'target',
- x: rs.arrowEndX,
- y: rs.arrowEndY,
- angle: rs.tgtArrowAngle
- }, {
- name: 'mid-source',
- x: rs.midX,
- y: rs.midY,
- angle: rs.midsrcArrowAngle
- }, {
- name: 'mid-target',
- x: rs.midX,
- y: rs.midY,
- angle: rs.midtgtArrowAngle
- }];
- for (var i = 0; i < arrows.length; i++) {
- var ar = arrows[i];
- var shape = r.arrowShapes[edge.pstyle(ar.name + '-arrow-shape').value];
- var edgeWidth = edge.pstyle('width').pfValue;
- if (shape.roughCollide(x, y, arSize, ar.angle, {
- x: ar.x,
- y: ar.y
- }, edgeWidth, edgeThreshold) && shape.collide(x, y, arSize, ar.angle, {
- x: ar.x,
- y: ar.y
- }, edgeWidth, edgeThreshold)) {
- addEle(edge);
- return true;
- }
- }
-
- // for compound graphs, hitting edge may actually want a connected node instead (b/c edge may have greater z-index precedence)
- if (hasCompounds && near.length > 0) {
- checkNode(src);
- checkNode(tgt);
- }
- }
- function preprop(obj, name, pre) {
- return getPrefixedProperty(obj, name, pre);
- }
- function checkLabel(ele, prefix) {
- var _p = ele._private;
- var th = labelThreshold;
- var prefixDash;
- if (prefix) {
- prefixDash = prefix + '-';
- } else {
- prefixDash = '';
- }
- ele.boundingBox();
- var bb = _p.labelBounds[prefix || 'main'];
- var text = ele.pstyle(prefixDash + 'label').value;
- var eventsEnabled = ele.pstyle('text-events').strValue === 'yes';
- if (!eventsEnabled || !text) {
- return;
- }
- var lx = preprop(_p.rscratch, 'labelX', prefix);
- var ly = preprop(_p.rscratch, 'labelY', prefix);
- var theta = preprop(_p.rscratch, 'labelAngle', prefix);
- var ox = ele.pstyle(prefixDash + 'text-margin-x').pfValue;
- var oy = ele.pstyle(prefixDash + 'text-margin-y').pfValue;
- var lx1 = bb.x1 - th - ox; // (-ox, -oy) as bb already includes margin
- var lx2 = bb.x2 + th - ox; // and rotation is about (lx, ly)
- var ly1 = bb.y1 - th - oy;
- var ly2 = bb.y2 + th - oy;
- if (theta) {
- var cos = Math.cos(theta);
- var sin = Math.sin(theta);
- var rotate = function rotate(x, y) {
- x = x - lx;
- y = y - ly;
- return {
- x: x * cos - y * sin + lx,
- y: x * sin + y * cos + ly
- };
- };
- var px1y1 = rotate(lx1, ly1);
- var px1y2 = rotate(lx1, ly2);
- var px2y1 = rotate(lx2, ly1);
- var px2y2 = rotate(lx2, ly2);
- var points = [
- // with the margin added after the rotation is applied
- px1y1.x + ox, px1y1.y + oy, px2y1.x + ox, px2y1.y + oy, px2y2.x + ox, px2y2.y + oy, px1y2.x + ox, px1y2.y + oy];
- if (pointInsidePolygonPoints(x, y, points)) {
- addEle(ele);
- return true;
- }
- } else {
- // do a cheaper bb check
- if (inBoundingBox(bb, x, y)) {
- addEle(ele);
- return true;
- }
- }
- }
- for (var i = eles.length - 1; i >= 0; i--) {
- // reverse order for precedence
- var ele = eles[i];
- if (ele.isNode()) {
- checkNode(ele) || checkLabel(ele);
- } else {
- // then edge
- checkEdge(ele) || checkLabel(ele) || checkLabel(ele, 'source') || checkLabel(ele, 'target');
- }
- }
- return near;
-};
-
-// 'Give me everything from this box'
-BRp$e.getAllInBox = function (x1, y1, x2, y2) {
- var eles = this.getCachedZSortedEles().interactive;
- var box = [];
- var x1c = Math.min(x1, x2);
- var x2c = Math.max(x1, x2);
- var y1c = Math.min(y1, y2);
- var y2c = Math.max(y1, y2);
- x1 = x1c;
- x2 = x2c;
- y1 = y1c;
- y2 = y2c;
- var boxBb = makeBoundingBox({
- x1: x1,
- y1: y1,
- x2: x2,
- y2: y2
- });
- for (var e = 0; e < eles.length; e++) {
- var ele = eles[e];
- if (ele.isNode()) {
- var node = ele;
- var nodeBb = node.boundingBox({
- includeNodes: true,
- includeEdges: false,
- includeLabels: false
- });
- if (boundingBoxesIntersect(boxBb, nodeBb) && !boundingBoxInBoundingBox(nodeBb, boxBb)) {
- box.push(node);
- }
- } else {
- var edge = ele;
- var _p = edge._private;
- var rs = _p.rscratch;
- if (rs.startX != null && rs.startY != null && !inBoundingBox(boxBb, rs.startX, rs.startY)) {
- continue;
- }
- if (rs.endX != null && rs.endY != null && !inBoundingBox(boxBb, rs.endX, rs.endY)) {
- continue;
- }
- if (rs.edgeType === 'bezier' || rs.edgeType === 'multibezier' || rs.edgeType === 'self' || rs.edgeType === 'compound' || rs.edgeType === 'segments' || rs.edgeType === 'haystack') {
- var pts = _p.rstyle.bezierPts || _p.rstyle.linePts || _p.rstyle.haystackPts;
- var allInside = true;
- for (var i = 0; i < pts.length; i++) {
- if (!pointInBoundingBox(boxBb, pts[i])) {
- allInside = false;
- break;
- }
- }
- if (allInside) {
- box.push(edge);
- }
- } else if (rs.edgeType === 'haystack' || rs.edgeType === 'straight') {
- box.push(edge);
- }
- }
- }
- return box;
-};
-
-var BRp$d = {};
-BRp$d.calculateArrowAngles = function (edge) {
- var rs = edge._private.rscratch;
- var isHaystack = rs.edgeType === 'haystack';
- var isBezier = rs.edgeType === 'bezier';
- var isMultibezier = rs.edgeType === 'multibezier';
- var isSegments = rs.edgeType === 'segments';
- var isCompound = rs.edgeType === 'compound';
- var isSelf = rs.edgeType === 'self';
-
- // Displacement gives direction for arrowhead orientation
- var dispX, dispY;
- var startX, startY, endX, endY, midX, midY;
- if (isHaystack) {
- startX = rs.haystackPts[0];
- startY = rs.haystackPts[1];
- endX = rs.haystackPts[2];
- endY = rs.haystackPts[3];
- } else {
- startX = rs.arrowStartX;
- startY = rs.arrowStartY;
- endX = rs.arrowEndX;
- endY = rs.arrowEndY;
- }
- midX = rs.midX;
- midY = rs.midY;
-
- // source
- //
-
- if (isSegments) {
- dispX = startX - rs.segpts[0];
- dispY = startY - rs.segpts[1];
- } else if (isMultibezier || isCompound || isSelf || isBezier) {
- var pts = rs.allpts;
- var bX = qbezierAt(pts[0], pts[2], pts[4], 0.1);
- var bY = qbezierAt(pts[1], pts[3], pts[5], 0.1);
- dispX = startX - bX;
- dispY = startY - bY;
- } else {
- dispX = startX - midX;
- dispY = startY - midY;
- }
- rs.srcArrowAngle = getAngleFromDisp(dispX, dispY);
-
- // mid target
- //
-
- var midX = rs.midX;
- var midY = rs.midY;
- if (isHaystack) {
- midX = (startX + endX) / 2;
- midY = (startY + endY) / 2;
- }
- dispX = endX - startX;
- dispY = endY - startY;
- if (isSegments) {
- var pts = rs.allpts;
- if (pts.length / 2 % 2 === 0) {
- var i2 = pts.length / 2;
- var i1 = i2 - 2;
- dispX = pts[i2] - pts[i1];
- dispY = pts[i2 + 1] - pts[i1 + 1];
- } else {
- var i2 = pts.length / 2 - 1;
- var i1 = i2 - 2;
- var i3 = i2 + 2;
- dispX = pts[i2] - pts[i1];
- dispY = pts[i2 + 1] - pts[i1 + 1];
- }
- } else if (isMultibezier || isCompound || isSelf) {
- var pts = rs.allpts;
- var cpts = rs.ctrlpts;
- var bp0x, bp0y;
- var bp1x, bp1y;
- if (cpts.length / 2 % 2 === 0) {
- var p0 = pts.length / 2 - 1; // startpt
- var ic = p0 + 2;
- var p1 = ic + 2;
- bp0x = qbezierAt(pts[p0], pts[ic], pts[p1], 0.0);
- bp0y = qbezierAt(pts[p0 + 1], pts[ic + 1], pts[p1 + 1], 0.0);
- bp1x = qbezierAt(pts[p0], pts[ic], pts[p1], 0.0001);
- bp1y = qbezierAt(pts[p0 + 1], pts[ic + 1], pts[p1 + 1], 0.0001);
- } else {
- var ic = pts.length / 2 - 1; // ctrpt
- var p0 = ic - 2; // startpt
- var p1 = ic + 2; // endpt
-
- bp0x = qbezierAt(pts[p0], pts[ic], pts[p1], 0.4999);
- bp0y = qbezierAt(pts[p0 + 1], pts[ic + 1], pts[p1 + 1], 0.4999);
- bp1x = qbezierAt(pts[p0], pts[ic], pts[p1], 0.5);
- bp1y = qbezierAt(pts[p0 + 1], pts[ic + 1], pts[p1 + 1], 0.5);
- }
- dispX = bp1x - bp0x;
- dispY = bp1y - bp0y;
- }
- rs.midtgtArrowAngle = getAngleFromDisp(dispX, dispY);
- rs.midDispX = dispX;
- rs.midDispY = dispY;
-
- // mid source
- //
-
- dispX *= -1;
- dispY *= -1;
- if (isSegments) {
- var pts = rs.allpts;
- if (pts.length / 2 % 2 === 0) ; else {
- var i2 = pts.length / 2 - 1;
- var i3 = i2 + 2;
- dispX = -(pts[i3] - pts[i2]);
- dispY = -(pts[i3 + 1] - pts[i2 + 1]);
- }
- }
- rs.midsrcArrowAngle = getAngleFromDisp(dispX, dispY);
-
- // target
- //
-
- if (isSegments) {
- dispX = endX - rs.segpts[rs.segpts.length - 2];
- dispY = endY - rs.segpts[rs.segpts.length - 1];
- } else if (isMultibezier || isCompound || isSelf || isBezier) {
- var pts = rs.allpts;
- var l = pts.length;
- var bX = qbezierAt(pts[l - 6], pts[l - 4], pts[l - 2], 0.9);
- var bY = qbezierAt(pts[l - 5], pts[l - 3], pts[l - 1], 0.9);
- dispX = endX - bX;
- dispY = endY - bY;
- } else {
- dispX = endX - midX;
- dispY = endY - midY;
- }
- rs.tgtArrowAngle = getAngleFromDisp(dispX, dispY);
-};
-BRp$d.getArrowWidth = BRp$d.getArrowHeight = function (edgeWidth, scale) {
- var cache = this.arrowWidthCache = this.arrowWidthCache || {};
- var cachedVal = cache[edgeWidth + ', ' + scale];
- if (cachedVal) {
- return cachedVal;
- }
- cachedVal = Math.max(Math.pow(edgeWidth * 13.37, 0.9), 29) * scale;
- cache[edgeWidth + ', ' + scale] = cachedVal;
- return cachedVal;
-};
-
-var BRp$c = {};
-BRp$c.findMidptPtsEtc = function (edge, pairInfo) {
- var posPts = pairInfo.posPts,
- intersectionPts = pairInfo.intersectionPts,
- vectorNormInverse = pairInfo.vectorNormInverse;
- var midptPts;
-
- // n.b. assumes all edges in bezier bundle have same endpoints specified
- var srcManEndpt = edge.pstyle('source-endpoint');
- var tgtManEndpt = edge.pstyle('target-endpoint');
- var haveManualEndPts = srcManEndpt.units != null && tgtManEndpt.units != null;
- var recalcVectorNormInverse = function recalcVectorNormInverse(x1, y1, x2, y2) {
- var dy = y2 - y1;
- var dx = x2 - x1;
- var l = Math.sqrt(dx * dx + dy * dy);
- return {
- x: -dy / l,
- y: dx / l
- };
- };
- var edgeDistances = edge.pstyle('edge-distances').value;
- switch (edgeDistances) {
- case 'node-position':
- midptPts = posPts;
- break;
- case 'intersection':
- midptPts = intersectionPts;
- break;
- case 'endpoints':
- {
- if (haveManualEndPts) {
- var _this$manualEndptToPx = this.manualEndptToPx(edge.source()[0], srcManEndpt),
- _this$manualEndptToPx2 = _slicedToArray(_this$manualEndptToPx, 2),
- x1 = _this$manualEndptToPx2[0],
- y1 = _this$manualEndptToPx2[1];
- var _this$manualEndptToPx3 = this.manualEndptToPx(edge.target()[0], tgtManEndpt),
- _this$manualEndptToPx4 = _slicedToArray(_this$manualEndptToPx3, 2),
- x2 = _this$manualEndptToPx4[0],
- y2 = _this$manualEndptToPx4[1];
- var endPts = {
- x1: x1,
- y1: y1,
- x2: x2,
- y2: y2
- };
- vectorNormInverse = recalcVectorNormInverse(x1, y1, x2, y2);
- midptPts = endPts;
- } else {
- warn("Edge ".concat(edge.id(), " has edge-distances:endpoints specified without manual endpoints specified via source-endpoint and target-endpoint. Falling back on edge-distances:intersection (default)."));
- midptPts = intersectionPts; // back to default
- }
-
- break;
- }
- }
- return {
- midptPts: midptPts,
- vectorNormInverse: vectorNormInverse
- };
-};
-BRp$c.findHaystackPoints = function (edges) {
- for (var i = 0; i < edges.length; i++) {
- var edge = edges[i];
- var _p = edge._private;
- var rs = _p.rscratch;
- if (!rs.haystack) {
- var angle = Math.random() * 2 * Math.PI;
- rs.source = {
- x: Math.cos(angle),
- y: Math.sin(angle)
- };
- angle = Math.random() * 2 * Math.PI;
- rs.target = {
- x: Math.cos(angle),
- y: Math.sin(angle)
- };
- }
- var src = _p.source;
- var tgt = _p.target;
- var srcPos = src.position();
- var tgtPos = tgt.position();
- var srcW = src.width();
- var tgtW = tgt.width();
- var srcH = src.height();
- var tgtH = tgt.height();
- var radius = edge.pstyle('haystack-radius').value;
- var halfRadius = radius / 2; // b/c have to half width/height
-
- rs.haystackPts = rs.allpts = [rs.source.x * srcW * halfRadius + srcPos.x, rs.source.y * srcH * halfRadius + srcPos.y, rs.target.x * tgtW * halfRadius + tgtPos.x, rs.target.y * tgtH * halfRadius + tgtPos.y];
- rs.midX = (rs.allpts[0] + rs.allpts[2]) / 2;
- rs.midY = (rs.allpts[1] + rs.allpts[3]) / 2;
-
- // always override as haystack in case set to different type previously
- rs.edgeType = 'haystack';
- rs.haystack = true;
- this.storeEdgeProjections(edge);
- this.calculateArrowAngles(edge);
- this.recalculateEdgeLabelProjections(edge);
- this.calculateLabelAngles(edge);
- }
-};
-BRp$c.findSegmentsPoints = function (edge, pairInfo) {
- // Segments (multiple straight lines)
-
- var rs = edge._private.rscratch;
- var segmentWs = edge.pstyle('segment-weights');
- var segmentDs = edge.pstyle('segment-distances');
- var segmentsN = Math.min(segmentWs.pfValue.length, segmentDs.pfValue.length);
- rs.edgeType = 'segments';
- rs.segpts = [];
- for (var s = 0; s < segmentsN; s++) {
- var w = segmentWs.pfValue[s];
- var d = segmentDs.pfValue[s];
- var w1 = 1 - w;
- var w2 = w;
- var _this$findMidptPtsEtc = this.findMidptPtsEtc(edge, pairInfo),
- midptPts = _this$findMidptPtsEtc.midptPts,
- vectorNormInverse = _this$findMidptPtsEtc.vectorNormInverse;
- var adjustedMidpt = {
- x: midptPts.x1 * w1 + midptPts.x2 * w2,
- y: midptPts.y1 * w1 + midptPts.y2 * w2
- };
- rs.segpts.push(adjustedMidpt.x + vectorNormInverse.x * d, adjustedMidpt.y + vectorNormInverse.y * d);
- }
-};
-BRp$c.findLoopPoints = function (edge, pairInfo, i, edgeIsUnbundled) {
- // Self-edge
-
- var rs = edge._private.rscratch;
- var dirCounts = pairInfo.dirCounts,
- srcPos = pairInfo.srcPos;
- var ctrlptDists = edge.pstyle('control-point-distances');
- var ctrlptDist = ctrlptDists ? ctrlptDists.pfValue[0] : undefined;
- var loopDir = edge.pstyle('loop-direction').pfValue;
- var loopSwp = edge.pstyle('loop-sweep').pfValue;
- var stepSize = edge.pstyle('control-point-step-size').pfValue;
- rs.edgeType = 'self';
- var j = i;
- var loopDist = stepSize;
- if (edgeIsUnbundled) {
- j = 0;
- loopDist = ctrlptDist;
- }
- var loopAngle = loopDir - Math.PI / 2;
- var outAngle = loopAngle - loopSwp / 2;
- var inAngle = loopAngle + loopSwp / 2;
-
- // increase by step size for overlapping loops, keyed on direction and sweep values
- var dc = String(loopDir + '_' + loopSwp);
- j = dirCounts[dc] === undefined ? dirCounts[dc] = 0 : ++dirCounts[dc];
- rs.ctrlpts = [srcPos.x + Math.cos(outAngle) * 1.4 * loopDist * (j / 3 + 1), srcPos.y + Math.sin(outAngle) * 1.4 * loopDist * (j / 3 + 1), srcPos.x + Math.cos(inAngle) * 1.4 * loopDist * (j / 3 + 1), srcPos.y + Math.sin(inAngle) * 1.4 * loopDist * (j / 3 + 1)];
-};
-BRp$c.findCompoundLoopPoints = function (edge, pairInfo, i, edgeIsUnbundled) {
- // Compound edge
-
- var rs = edge._private.rscratch;
- rs.edgeType = 'compound';
- var srcPos = pairInfo.srcPos,
- tgtPos = pairInfo.tgtPos,
- srcW = pairInfo.srcW,
- srcH = pairInfo.srcH,
- tgtW = pairInfo.tgtW,
- tgtH = pairInfo.tgtH;
- var stepSize = edge.pstyle('control-point-step-size').pfValue;
- var ctrlptDists = edge.pstyle('control-point-distances');
- var ctrlptDist = ctrlptDists ? ctrlptDists.pfValue[0] : undefined;
- var j = i;
- var loopDist = stepSize;
- if (edgeIsUnbundled) {
- j = 0;
- loopDist = ctrlptDist;
- }
- var loopW = 50;
- var loopaPos = {
- x: srcPos.x - srcW / 2,
- y: srcPos.y - srcH / 2
- };
- var loopbPos = {
- x: tgtPos.x - tgtW / 2,
- y: tgtPos.y - tgtH / 2
- };
- var loopPos = {
- x: Math.min(loopaPos.x, loopbPos.x),
- y: Math.min(loopaPos.y, loopbPos.y)
- };
-
- // avoids cases with impossible beziers
- var minCompoundStretch = 0.5;
- var compoundStretchA = Math.max(minCompoundStretch, Math.log(srcW * 0.01));
- var compoundStretchB = Math.max(minCompoundStretch, Math.log(tgtW * 0.01));
- rs.ctrlpts = [loopPos.x, loopPos.y - (1 + Math.pow(loopW, 1.12) / 100) * loopDist * (j / 3 + 1) * compoundStretchA, loopPos.x - (1 + Math.pow(loopW, 1.12) / 100) * loopDist * (j / 3 + 1) * compoundStretchB, loopPos.y];
-};
-BRp$c.findStraightEdgePoints = function (edge) {
- // Straight edge within bundle
-
- edge._private.rscratch.edgeType = 'straight';
-};
-BRp$c.findBezierPoints = function (edge, pairInfo, i, edgeIsUnbundled, edgeIsSwapped) {
- var rs = edge._private.rscratch;
- var stepSize = edge.pstyle('control-point-step-size').pfValue;
- var ctrlptDists = edge.pstyle('control-point-distances');
- var ctrlptWs = edge.pstyle('control-point-weights');
- var bezierN = ctrlptDists && ctrlptWs ? Math.min(ctrlptDists.value.length, ctrlptWs.value.length) : 1;
- var ctrlptDist = ctrlptDists ? ctrlptDists.pfValue[0] : undefined;
- var ctrlptWeight = ctrlptWs.value[0];
-
- // (Multi)bezier
-
- var multi = edgeIsUnbundled;
- rs.edgeType = multi ? 'multibezier' : 'bezier';
- rs.ctrlpts = [];
- for (var b = 0; b < bezierN; b++) {
- var normctrlptDist = (0.5 - pairInfo.eles.length / 2 + i) * stepSize * (edgeIsSwapped ? -1 : 1);
- var manctrlptDist = void 0;
- var sign = signum(normctrlptDist);
- if (multi) {
- ctrlptDist = ctrlptDists ? ctrlptDists.pfValue[b] : stepSize; // fall back on step size
- ctrlptWeight = ctrlptWs.value[b];
- }
- if (edgeIsUnbundled) {
- // multi or single unbundled
- manctrlptDist = ctrlptDist;
- } else {
- manctrlptDist = ctrlptDist !== undefined ? sign * ctrlptDist : undefined;
- }
- var distanceFromMidpoint = manctrlptDist !== undefined ? manctrlptDist : normctrlptDist;
- var w1 = 1 - ctrlptWeight;
- var w2 = ctrlptWeight;
- var _this$findMidptPtsEtc2 = this.findMidptPtsEtc(edge, pairInfo),
- midptPts = _this$findMidptPtsEtc2.midptPts,
- vectorNormInverse = _this$findMidptPtsEtc2.vectorNormInverse;
- var adjustedMidpt = {
- x: midptPts.x1 * w1 + midptPts.x2 * w2,
- y: midptPts.y1 * w1 + midptPts.y2 * w2
- };
- rs.ctrlpts.push(adjustedMidpt.x + vectorNormInverse.x * distanceFromMidpoint, adjustedMidpt.y + vectorNormInverse.y * distanceFromMidpoint);
- }
-};
-BRp$c.findTaxiPoints = function (edge, pairInfo) {
- // Taxicab geometry with two turns maximum
-
- var rs = edge._private.rscratch;
- rs.edgeType = 'segments';
- var VERTICAL = 'vertical';
- var HORIZONTAL = 'horizontal';
- var LEFTWARD = 'leftward';
- var RIGHTWARD = 'rightward';
- var DOWNWARD = 'downward';
- var UPWARD = 'upward';
- var AUTO = 'auto';
- var posPts = pairInfo.posPts,
- srcW = pairInfo.srcW,
- srcH = pairInfo.srcH,
- tgtW = pairInfo.tgtW,
- tgtH = pairInfo.tgtH;
- var edgeDistances = edge.pstyle('edge-distances').value;
- var dIncludesNodeBody = edgeDistances !== 'node-position';
- var taxiDir = edge.pstyle('taxi-direction').value;
- var rawTaxiDir = taxiDir; // unprocessed value
- var taxiTurn = edge.pstyle('taxi-turn');
- var turnIsPercent = taxiTurn.units === '%';
- var taxiTurnPfVal = taxiTurn.pfValue;
- var turnIsNegative = taxiTurnPfVal < 0; // i.e. from target side
- var minD = edge.pstyle('taxi-turn-min-distance').pfValue;
- var dw = dIncludesNodeBody ? (srcW + tgtW) / 2 : 0;
- var dh = dIncludesNodeBody ? (srcH + tgtH) / 2 : 0;
- var pdx = posPts.x2 - posPts.x1;
- var pdy = posPts.y2 - posPts.y1;
-
- // take away the effective w/h from the magnitude of the delta value
- var subDWH = function subDWH(dxy, dwh) {
- if (dxy > 0) {
- return Math.max(dxy - dwh, 0);
- } else {
- return Math.min(dxy + dwh, 0);
- }
- };
- var dx = subDWH(pdx, dw);
- var dy = subDWH(pdy, dh);
- var isExplicitDir = false;
- if (rawTaxiDir === AUTO) {
- taxiDir = Math.abs(dx) > Math.abs(dy) ? HORIZONTAL : VERTICAL;
- } else if (rawTaxiDir === UPWARD || rawTaxiDir === DOWNWARD) {
- taxiDir = VERTICAL;
- isExplicitDir = true;
- } else if (rawTaxiDir === LEFTWARD || rawTaxiDir === RIGHTWARD) {
- taxiDir = HORIZONTAL;
- isExplicitDir = true;
- }
- var isVert = taxiDir === VERTICAL;
- var l = isVert ? dy : dx;
- var pl = isVert ? pdy : pdx;
- var sgnL = signum(pl);
- var forcedDir = false;
- if (!(isExplicitDir && (turnIsPercent || turnIsNegative)) // forcing in this case would cause weird growing in the opposite direction
- && (rawTaxiDir === DOWNWARD && pl < 0 || rawTaxiDir === UPWARD && pl > 0 || rawTaxiDir === LEFTWARD && pl > 0 || rawTaxiDir === RIGHTWARD && pl < 0)) {
- sgnL *= -1;
- l = sgnL * Math.abs(l);
- forcedDir = true;
- }
- var d;
- if (turnIsPercent) {
- var p = taxiTurnPfVal < 0 ? 1 + taxiTurnPfVal : taxiTurnPfVal;
- d = p * l;
- } else {
- var k = taxiTurnPfVal < 0 ? l : 0;
- d = k + taxiTurnPfVal * sgnL;
- }
- var getIsTooClose = function getIsTooClose(d) {
- return Math.abs(d) < minD || Math.abs(d) >= Math.abs(l);
- };
- var isTooCloseSrc = getIsTooClose(d);
- var isTooCloseTgt = getIsTooClose(Math.abs(l) - Math.abs(d));
- var isTooClose = isTooCloseSrc || isTooCloseTgt;
- if (isTooClose && !forcedDir) {
- // non-ideal routing
- if (isVert) {
- // vertical fallbacks
- var lShapeInsideSrc = Math.abs(pl) <= srcH / 2;
- var lShapeInsideTgt = Math.abs(pdx) <= tgtW / 2;
- if (lShapeInsideSrc) {
- // horizontal Z-shape (direction not respected)
- var x = (posPts.x1 + posPts.x2) / 2;
- var y1 = posPts.y1,
- y2 = posPts.y2;
- rs.segpts = [x, y1, x, y2];
- } else if (lShapeInsideTgt) {
- // vertical Z-shape (distance not respected)
- var y = (posPts.y1 + posPts.y2) / 2;
- var x1 = posPts.x1,
- x2 = posPts.x2;
- rs.segpts = [x1, y, x2, y];
- } else {
- // L-shape fallback (turn distance not respected, but works well with tree siblings)
- rs.segpts = [posPts.x1, posPts.y2];
- }
- } else {
- // horizontal fallbacks
- var _lShapeInsideSrc = Math.abs(pl) <= srcW / 2;
- var _lShapeInsideTgt = Math.abs(pdy) <= tgtH / 2;
- if (_lShapeInsideSrc) {
- // vertical Z-shape (direction not respected)
- var _y = (posPts.y1 + posPts.y2) / 2;
- var _x = posPts.x1,
- _x2 = posPts.x2;
- rs.segpts = [_x, _y, _x2, _y];
- } else if (_lShapeInsideTgt) {
- // horizontal Z-shape (turn distance not respected)
- var _x3 = (posPts.x1 + posPts.x2) / 2;
- var _y2 = posPts.y1,
- _y3 = posPts.y2;
- rs.segpts = [_x3, _y2, _x3, _y3];
- } else {
- // L-shape (turn distance not respected, but works well for tree siblings)
- rs.segpts = [posPts.x2, posPts.y1];
- }
- }
- } else {
- // ideal routing
- if (isVert) {
- var _y4 = posPts.y1 + d + (dIncludesNodeBody ? srcH / 2 * sgnL : 0);
- var _x4 = posPts.x1,
- _x5 = posPts.x2;
- rs.segpts = [_x4, _y4, _x5, _y4];
- } else {
- // horizontal
- var _x6 = posPts.x1 + d + (dIncludesNodeBody ? srcW / 2 * sgnL : 0);
- var _y5 = posPts.y1,
- _y6 = posPts.y2;
- rs.segpts = [_x6, _y5, _x6, _y6];
- }
- }
-};
-BRp$c.tryToCorrectInvalidPoints = function (edge, pairInfo) {
- var rs = edge._private.rscratch;
-
- // can only correct beziers for now...
- if (rs.edgeType === 'bezier') {
- var srcPos = pairInfo.srcPos,
- tgtPos = pairInfo.tgtPos,
- srcW = pairInfo.srcW,
- srcH = pairInfo.srcH,
- tgtW = pairInfo.tgtW,
- tgtH = pairInfo.tgtH,
- srcShape = pairInfo.srcShape,
- tgtShape = pairInfo.tgtShape;
- var badStart = !number$1(rs.startX) || !number$1(rs.startY);
- var badAStart = !number$1(rs.arrowStartX) || !number$1(rs.arrowStartY);
- var badEnd = !number$1(rs.endX) || !number$1(rs.endY);
- var badAEnd = !number$1(rs.arrowEndX) || !number$1(rs.arrowEndY);
- var minCpADistFactor = 3;
- var arrowW = this.getArrowWidth(edge.pstyle('width').pfValue, edge.pstyle('arrow-scale').value) * this.arrowShapeWidth;
- var minCpADist = minCpADistFactor * arrowW;
- var startACpDist = dist({
- x: rs.ctrlpts[0],
- y: rs.ctrlpts[1]
- }, {
- x: rs.startX,
- y: rs.startY
- });
- var closeStartACp = startACpDist < minCpADist;
- var endACpDist = dist({
- x: rs.ctrlpts[0],
- y: rs.ctrlpts[1]
- }, {
- x: rs.endX,
- y: rs.endY
- });
- var closeEndACp = endACpDist < minCpADist;
- var overlapping = false;
- if (badStart || badAStart || closeStartACp) {
- overlapping = true;
-
- // project control point along line from src centre to outside the src shape
- // (otherwise intersection will yield nothing)
- var cpD = {
- // delta
- x: rs.ctrlpts[0] - srcPos.x,
- y: rs.ctrlpts[1] - srcPos.y
- };
- var cpL = Math.sqrt(cpD.x * cpD.x + cpD.y * cpD.y); // length of line
- var cpM = {
- // normalised delta
- x: cpD.x / cpL,
- y: cpD.y / cpL
- };
- var radius = Math.max(srcW, srcH);
- var cpProj = {
- // *2 radius guarantees outside shape
- x: rs.ctrlpts[0] + cpM.x * 2 * radius,
- y: rs.ctrlpts[1] + cpM.y * 2 * radius
- };
- var srcCtrlPtIntn = srcShape.intersectLine(srcPos.x, srcPos.y, srcW, srcH, cpProj.x, cpProj.y, 0);
- if (closeStartACp) {
- rs.ctrlpts[0] = rs.ctrlpts[0] + cpM.x * (minCpADist - startACpDist);
- rs.ctrlpts[1] = rs.ctrlpts[1] + cpM.y * (minCpADist - startACpDist);
- } else {
- rs.ctrlpts[0] = srcCtrlPtIntn[0] + cpM.x * minCpADist;
- rs.ctrlpts[1] = srcCtrlPtIntn[1] + cpM.y * minCpADist;
- }
- }
- if (badEnd || badAEnd || closeEndACp) {
- overlapping = true;
-
- // project control point along line from tgt centre to outside the tgt shape
- // (otherwise intersection will yield nothing)
- var _cpD = {
- // delta
- x: rs.ctrlpts[0] - tgtPos.x,
- y: rs.ctrlpts[1] - tgtPos.y
- };
- var _cpL = Math.sqrt(_cpD.x * _cpD.x + _cpD.y * _cpD.y); // length of line
- var _cpM = {
- // normalised delta
- x: _cpD.x / _cpL,
- y: _cpD.y / _cpL
- };
- var _radius = Math.max(srcW, srcH);
- var _cpProj = {
- // *2 radius guarantees outside shape
- x: rs.ctrlpts[0] + _cpM.x * 2 * _radius,
- y: rs.ctrlpts[1] + _cpM.y * 2 * _radius
- };
- var tgtCtrlPtIntn = tgtShape.intersectLine(tgtPos.x, tgtPos.y, tgtW, tgtH, _cpProj.x, _cpProj.y, 0);
- if (closeEndACp) {
- rs.ctrlpts[0] = rs.ctrlpts[0] + _cpM.x * (minCpADist - endACpDist);
- rs.ctrlpts[1] = rs.ctrlpts[1] + _cpM.y * (minCpADist - endACpDist);
- } else {
- rs.ctrlpts[0] = tgtCtrlPtIntn[0] + _cpM.x * minCpADist;
- rs.ctrlpts[1] = tgtCtrlPtIntn[1] + _cpM.y * minCpADist;
- }
- }
- if (overlapping) {
- // recalc endpts
- this.findEndpoints(edge);
- }
- }
-};
-BRp$c.storeAllpts = function (edge) {
- var rs = edge._private.rscratch;
- if (rs.edgeType === 'multibezier' || rs.edgeType === 'bezier' || rs.edgeType === 'self' || rs.edgeType === 'compound') {
- rs.allpts = [];
- rs.allpts.push(rs.startX, rs.startY);
- for (var b = 0; b + 1 < rs.ctrlpts.length; b += 2) {
- // ctrl pt itself
- rs.allpts.push(rs.ctrlpts[b], rs.ctrlpts[b + 1]);
-
- // the midpt between ctrlpts as intermediate destination pts
- if (b + 3 < rs.ctrlpts.length) {
- rs.allpts.push((rs.ctrlpts[b] + rs.ctrlpts[b + 2]) / 2, (rs.ctrlpts[b + 1] + rs.ctrlpts[b + 3]) / 2);
- }
- }
- rs.allpts.push(rs.endX, rs.endY);
- var m, mt;
- if (rs.ctrlpts.length / 2 % 2 === 0) {
- m = rs.allpts.length / 2 - 1;
- rs.midX = rs.allpts[m];
- rs.midY = rs.allpts[m + 1];
+ if (sliderValue <= 50) {
+ var minValue = defaultValue / minDiv;
+ value -= (defaultValue - minValue) / 50 * (50 - sliderValue);
} else {
- m = rs.allpts.length / 2 - 3;
- mt = 0.5;
- rs.midX = qbezierAt(rs.allpts[m], rs.allpts[m + 2], rs.allpts[m + 4], mt);
- rs.midY = qbezierAt(rs.allpts[m + 1], rs.allpts[m + 3], rs.allpts[m + 5], mt);
+ var maxValue = defaultValue * maxMul;
+ value += (maxValue - defaultValue) / 50 * (sliderValue - 50);
}
- } else if (rs.edgeType === 'straight') {
- // need to calc these after endpts
- rs.allpts = [rs.startX, rs.startY, rs.endX, rs.endY];
- // default midpt for labels etc
- rs.midX = (rs.startX + rs.endX + rs.arrowStartX + rs.arrowEndX) / 4;
- rs.midY = (rs.startY + rs.endY + rs.arrowStartY + rs.arrowEndY) / 4;
- } else if (rs.edgeType === 'segments') {
- rs.allpts = [];
- rs.allpts.push(rs.startX, rs.startY);
- rs.allpts.push.apply(rs.allpts, rs.segpts);
- rs.allpts.push(rs.endX, rs.endY);
- if (rs.segpts.length % 4 === 0) {
- var i2 = rs.segpts.length / 2;
- var i1 = i2 - 2;
- rs.midX = (rs.segpts[i1] + rs.segpts[i2]) / 2;
- rs.midY = (rs.segpts[i1 + 1] + rs.segpts[i2 + 1]) / 2;
- } else {
- var _i = rs.segpts.length / 2 - 1;
- rs.midX = rs.segpts[_i];
- rs.midY = rs.segpts[_i + 1];
- }
- }
-};
-BRp$c.checkForInvalidEdgeWarning = function (edge) {
- var rs = edge[0]._private.rscratch;
- if (rs.nodesOverlap || number$1(rs.startX) && number$1(rs.startY) && number$1(rs.endX) && number$1(rs.endY)) {
- rs.loggedErr = false;
+ return value;
} else {
- if (!rs.loggedErr) {
- rs.loggedErr = true;
- warn('Edge `' + edge.id() + '` has invalid endpoints and so it is impossible to draw. Adjust your edge style (e.g. control points) accordingly or use an alternative edge type. This is expected behaviour when the source node and the target node overlap.');
+ var a, b;
+
+ if (sliderValue <= 50) {
+ a = 9.0 * defaultValue / 500.0;
+ b = defaultValue / 10.0;
+ } else {
+ a = 9.0 * defaultValue / 50.0;
+ b = -8 * defaultValue;
}
+
+ return a * sliderValue + b;
}
};
-BRp$c.findEdgeControlPoints = function (edges) {
- var _this = this;
- if (!edges || edges.length === 0) {
- return;
- }
- var r = this;
- var cy = r.cy;
- var hasCompounds = cy.hasCompoundNodes();
- var hashTable = {
- map: new Map$1(),
- get: function get(pairId) {
- var map2 = this.map.get(pairId[0]);
- if (map2 != null) {
- return map2.get(pairId[1]);
- } else {
- return null;
- }
- },
- set: function set(pairId, val) {
- var map2 = this.map.get(pairId[0]);
- if (map2 == null) {
- map2 = new Map$1();
- this.map.set(pairId[0], map2);
- }
- map2.set(pairId[1], val);
- }
- };
- var pairIds = [];
- var haystackEdges = [];
- // create a table of edge (src, tgt) => list of edges between them
- for (var i = 0; i < edges.length; i++) {
- var edge = edges[i];
- var _p = edge._private;
- var curveStyle = edge.pstyle('curve-style').value;
+/**
+ * This method finds and returns the center of the given nodes, assuming
+ * that the given nodes form a tree in themselves.
+ */
+Layout.findCenterOfTree = function (nodes) {
+ var list = [];
+ list = list.concat(nodes);
- // ignore edges who are not to be displayed
- // they shouldn't take up space
- if (edge.removed() || !edge.takesUpSpace()) {
- continue;
- }
- if (curveStyle === 'haystack') {
- haystackEdges.push(edge);
- continue;
- }
- var edgeIsUnbundled = curveStyle === 'unbundled-bezier' || curveStyle === 'segments' || curveStyle === 'straight' || curveStyle === 'straight-triangle' || curveStyle === 'taxi';
- var edgeIsBezier = curveStyle === 'unbundled-bezier' || curveStyle === 'bezier';
- var src = _p.source;
- var tgt = _p.target;
- var srcIndex = src.poolIndex();
- var tgtIndex = tgt.poolIndex();
- var pairId = [srcIndex, tgtIndex].sort();
- var tableEntry = hashTable.get(pairId);
- if (tableEntry == null) {
- tableEntry = {
- eles: []
- };
- hashTable.set(pairId, tableEntry);
- pairIds.push(pairId);
- }
- tableEntry.eles.push(edge);
- if (edgeIsUnbundled) {
- tableEntry.hasUnbundled = true;
- }
- if (edgeIsBezier) {
- tableEntry.hasBezier = true;
- }
- }
+ var removedNodes = [];
+ var remainingDegrees = new Map();
+ var foundCenter = false;
+ var centerNode = null;
- // for each pair (src, tgt), create the ctrl pts
- // Nested for loop is OK; total number of iterations for both loops = edgeCount
- var _loop = function _loop(p) {
- var pairId = pairIds[p];
- var pairInfo = hashTable.get(pairId);
- var swappedpairInfo = void 0;
- if (!pairInfo.hasUnbundled) {
- var pllEdges = pairInfo.eles[0].parallelEdges().filter(function (e) {
- return e.isBundledBezier();
- });
- clearArray(pairInfo.eles);
- pllEdges.forEach(function (edge) {
- return pairInfo.eles.push(edge);
- });
+ if (list.length == 1 || list.length == 2) {
+ foundCenter = true;
+ centerNode = list[0];
+ }
- // for each pair id, the edges should be sorted by index
- pairInfo.eles.sort(function (edge1, edge2) {
- return edge1.poolIndex() - edge2.poolIndex();
- });
- }
- var firstEdge = pairInfo.eles[0];
- var src = firstEdge.source();
- var tgt = firstEdge.target();
+ for (var i = 0; i < list.length; i++) {
+ var node = list[i];
+ var degree = node.getNeighborsList().size;
+ remainingDegrees.set(node, node.getNeighborsList().size);
- // make sure src/tgt distinction is consistent w.r.t. pairId
- if (src.poolIndex() > tgt.poolIndex()) {
- var temp = src;
- src = tgt;
- tgt = temp;
+ if (degree == 1) {
+ removedNodes.push(node);
}
- var srcPos = pairInfo.srcPos = src.position();
- var tgtPos = pairInfo.tgtPos = tgt.position();
- var srcW = pairInfo.srcW = src.outerWidth();
- var srcH = pairInfo.srcH = src.outerHeight();
- var tgtW = pairInfo.tgtW = tgt.outerWidth();
- var tgtH = pairInfo.tgtH = tgt.outerHeight();
- var srcShape = pairInfo.srcShape = r.nodeShapes[_this.getNodeShape(src)];
- var tgtShape = pairInfo.tgtShape = r.nodeShapes[_this.getNodeShape(tgt)];
- pairInfo.dirCounts = {
- 'north': 0,
- 'west': 0,
- 'south': 0,
- 'east': 0,
- 'northwest': 0,
- 'southwest': 0,
- 'northeast': 0,
- 'southeast': 0
- };
- for (var _i2 = 0; _i2 < pairInfo.eles.length; _i2++) {
- var _edge = pairInfo.eles[_i2];
- var rs = _edge[0]._private.rscratch;
- var _curveStyle = _edge.pstyle('curve-style').value;
- var _edgeIsUnbundled = _curveStyle === 'unbundled-bezier' || _curveStyle === 'segments' || _curveStyle === 'taxi';
-
- // whether the normalised pair order is the reverse of the edge's src-tgt order
- var edgeIsSwapped = !src.same(_edge.source());
- if (!pairInfo.calculatedIntersection && src !== tgt && (pairInfo.hasBezier || pairInfo.hasUnbundled)) {
- pairInfo.calculatedIntersection = true;
-
- // pt outside src shape to calc distance/displacement from src to tgt
- var srcOutside = srcShape.intersectLine(srcPos.x, srcPos.y, srcW, srcH, tgtPos.x, tgtPos.y, 0);
- var srcIntn = pairInfo.srcIntn = srcOutside;
-
- // pt outside tgt shape to calc distance/displacement from src to tgt
- var tgtOutside = tgtShape.intersectLine(tgtPos.x, tgtPos.y, tgtW, tgtH, srcPos.x, srcPos.y, 0);
- var tgtIntn = pairInfo.tgtIntn = tgtOutside;
- var intersectionPts = pairInfo.intersectionPts = {
- x1: srcOutside[0],
- x2: tgtOutside[0],
- y1: srcOutside[1],
- y2: tgtOutside[1]
- };
- var posPts = pairInfo.posPts = {
- x1: srcPos.x,
- x2: tgtPos.x,
- y1: srcPos.y,
- y2: tgtPos.y
- };
- var dy = tgtOutside[1] - srcOutside[1];
- var dx = tgtOutside[0] - srcOutside[0];
- var l = Math.sqrt(dx * dx + dy * dy);
- var vector = pairInfo.vector = {
- x: dx,
- y: dy
- };
- var vectorNorm = pairInfo.vectorNorm = {
- x: vector.x / l,
- y: vector.y / l
- };
- var vectorNormInverse = {
- x: -vectorNorm.y,
- y: vectorNorm.x
- };
-
- // if node shapes overlap, then no ctrl pts to draw
- pairInfo.nodesOverlap = !number$1(l) || tgtShape.checkPoint(srcOutside[0], srcOutside[1], 0, tgtW, tgtH, tgtPos.x, tgtPos.y) || srcShape.checkPoint(tgtOutside[0], tgtOutside[1], 0, srcW, srcH, srcPos.x, srcPos.y);
- pairInfo.vectorNormInverse = vectorNormInverse;
- swappedpairInfo = {
- nodesOverlap: pairInfo.nodesOverlap,
- dirCounts: pairInfo.dirCounts,
- calculatedIntersection: true,
- hasBezier: pairInfo.hasBezier,
- hasUnbundled: pairInfo.hasUnbundled,
- eles: pairInfo.eles,
- srcPos: tgtPos,
- tgtPos: srcPos,
- srcW: tgtW,
- srcH: tgtH,
- tgtW: srcW,
- tgtH: srcH,
- srcIntn: tgtIntn,
- tgtIntn: srcIntn,
- srcShape: tgtShape,
- tgtShape: srcShape,
- posPts: {
- x1: posPts.x2,
- y1: posPts.y2,
- x2: posPts.x1,
- y2: posPts.y1
- },
- intersectionPts: {
- x1: intersectionPts.x2,
- y1: intersectionPts.y2,
- x2: intersectionPts.x1,
- y2: intersectionPts.y1
- },
- vector: {
- x: -vector.x,
- y: -vector.y
- },
- vectorNorm: {
- x: -vectorNorm.x,
- y: -vectorNorm.y
- },
- vectorNormInverse: {
- x: -vectorNormInverse.x,
- y: -vectorNormInverse.y
- }
- };
- }
- var passedPairInfo = edgeIsSwapped ? swappedpairInfo : pairInfo;
- rs.nodesOverlap = passedPairInfo.nodesOverlap;
- rs.srcIntn = passedPairInfo.srcIntn;
- rs.tgtIntn = passedPairInfo.tgtIntn;
- if (hasCompounds && (src.isParent() || src.isChild() || tgt.isParent() || tgt.isChild()) && (src.parents().anySame(tgt) || tgt.parents().anySame(src) || src.same(tgt) && src.isParent())) {
- _this.findCompoundLoopPoints(_edge, passedPairInfo, _i2, _edgeIsUnbundled);
- } else if (src === tgt) {
- _this.findLoopPoints(_edge, passedPairInfo, _i2, _edgeIsUnbundled);
- } else if (_curveStyle === 'segments') {
- _this.findSegmentsPoints(_edge, passedPairInfo);
- } else if (_curveStyle === 'taxi') {
- _this.findTaxiPoints(_edge, passedPairInfo);
- } else if (_curveStyle === 'straight' || !_edgeIsUnbundled && pairInfo.eles.length % 2 === 1 && _i2 === Math.floor(pairInfo.eles.length / 2)) {
- _this.findStraightEdgePoints(_edge);
- } else {
- _this.findBezierPoints(_edge, passedPairInfo, _i2, _edgeIsUnbundled, edgeIsSwapped);
- }
- _this.findEndpoints(_edge);
- _this.tryToCorrectInvalidPoints(_edge, passedPairInfo);
- _this.checkForInvalidEdgeWarning(_edge);
- _this.storeAllpts(_edge);
- _this.storeEdgeProjections(_edge);
- _this.calculateArrowAngles(_edge);
- _this.recalculateEdgeLabelProjections(_edge);
- _this.calculateLabelAngles(_edge);
- } // for pair edges
- };
- for (var p = 0; p < pairIds.length; p++) {
- _loop(p);
- } // for pair ids
-
- // haystacks avoid the expense of pairInfo stuff (intersections etc.)
- this.findHaystackPoints(haystackEdges);
-};
-function getPts(pts) {
- var retPts = [];
- if (pts == null) {
- return;
- }
- for (var i = 0; i < pts.length; i += 2) {
- var x = pts[i];
- var y = pts[i + 1];
- retPts.push({
- x: x,
- y: y
- });
- }
- return retPts;
-}
-BRp$c.getSegmentPoints = function (edge) {
- var rs = edge[0]._private.rscratch;
- var type = rs.edgeType;
- if (type === 'segments') {
- this.recalculateRenderedStyle(edge);
- return getPts(rs.segpts);
- }
-};
-BRp$c.getControlPoints = function (edge) {
- var rs = edge[0]._private.rscratch;
- var type = rs.edgeType;
- if (type === 'bezier' || type === 'multibezier' || type === 'self' || type === 'compound') {
- this.recalculateRenderedStyle(edge);
- return getPts(rs.ctrlpts);
}
-};
-BRp$c.getEdgeMidpoint = function (edge) {
- var rs = edge[0]._private.rscratch;
- this.recalculateRenderedStyle(edge);
- return {
- x: rs.midX,
- y: rs.midY
- };
-};
-var BRp$b = {};
-BRp$b.manualEndptToPx = function (node, prop) {
- var r = this;
- var npos = node.position();
- var w = node.outerWidth();
- var h = node.outerHeight();
- if (prop.value.length === 2) {
- var p = [prop.pfValue[0], prop.pfValue[1]];
- if (prop.units[0] === '%') {
- p[0] = p[0] * w;
- }
- if (prop.units[1] === '%') {
- p[1] = p[1] * h;
- }
- p[0] += npos.x;
- p[1] += npos.y;
- return p;
- } else {
- var angle = prop.pfValue[0];
- angle = -Math.PI / 2 + angle; // start at 12 o'clock
+ var tempList = [];
+ tempList = tempList.concat(removedNodes);
- var l = 2 * Math.max(w, h);
- var _p = [npos.x + Math.cos(angle) * l, npos.y + Math.sin(angle) * l];
- return r.nodeShapes[this.getNodeShape(node)].intersectLine(npos.x, npos.y, w, h, _p[0], _p[1], 0);
- }
-};
-BRp$b.findEndpoints = function (edge) {
- var r = this;
- var intersect;
- var source = edge.source()[0];
- var target = edge.target()[0];
- var srcPos = source.position();
- var tgtPos = target.position();
- var tgtArShape = edge.pstyle('target-arrow-shape').value;
- var srcArShape = edge.pstyle('source-arrow-shape').value;
- var tgtDist = edge.pstyle('target-distance-from-node').pfValue;
- var srcDist = edge.pstyle('source-distance-from-node').pfValue;
- var curveStyle = edge.pstyle('curve-style').value;
- var rs = edge._private.rscratch;
- var et = rs.edgeType;
- var taxi = curveStyle === 'taxi';
- var self = et === 'self' || et === 'compound';
- var bezier = et === 'bezier' || et === 'multibezier' || self;
- var multi = et !== 'bezier';
- var lines = et === 'straight' || et === 'segments';
- var segments = et === 'segments';
- var hasEndpts = bezier || multi || lines;
- var overrideEndpts = self || taxi;
- var srcManEndpt = edge.pstyle('source-endpoint');
- var srcManEndptVal = overrideEndpts ? 'outside-to-node' : srcManEndpt.value;
- var tgtManEndpt = edge.pstyle('target-endpoint');
- var tgtManEndptVal = overrideEndpts ? 'outside-to-node' : tgtManEndpt.value;
- rs.srcManEndpt = srcManEndpt;
- rs.tgtManEndpt = tgtManEndpt;
- var p1; // last known point of edge on target side
- var p2; // last known point of edge on source side
+ while (!foundCenter) {
+ var tempList2 = [];
+ tempList2 = tempList2.concat(tempList);
+ tempList = [];
- var p1_i; // point to intersect with target shape
- var p2_i; // point to intersect with source shape
+ for (var i = 0; i < list.length; i++) {
+ var node = list[i];
- if (bezier) {
- var cpStart = [rs.ctrlpts[0], rs.ctrlpts[1]];
- var cpEnd = multi ? [rs.ctrlpts[rs.ctrlpts.length - 2], rs.ctrlpts[rs.ctrlpts.length - 1]] : cpStart;
- p1 = cpEnd;
- p2 = cpStart;
- } else if (lines) {
- var srcArrowFromPt = !segments ? [tgtPos.x, tgtPos.y] : rs.segpts.slice(0, 2);
- var tgtArrowFromPt = !segments ? [srcPos.x, srcPos.y] : rs.segpts.slice(rs.segpts.length - 2);
- p1 = tgtArrowFromPt;
- p2 = srcArrowFromPt;
- }
- if (tgtManEndptVal === 'inside-to-node') {
- intersect = [tgtPos.x, tgtPos.y];
- } else if (tgtManEndpt.units) {
- intersect = this.manualEndptToPx(target, tgtManEndpt);
- } else if (tgtManEndptVal === 'outside-to-line') {
- intersect = rs.tgtIntn; // use cached value from ctrlpt calc
- } else {
- if (tgtManEndptVal === 'outside-to-node' || tgtManEndptVal === 'outside-to-node-or-label') {
- p1_i = p1;
- } else if (tgtManEndptVal === 'outside-to-line' || tgtManEndptVal === 'outside-to-line-or-label') {
- p1_i = [srcPos.x, srcPos.y];
- }
- intersect = r.nodeShapes[this.getNodeShape(target)].intersectLine(tgtPos.x, tgtPos.y, target.outerWidth(), target.outerHeight(), p1_i[0], p1_i[1], 0);
- if (tgtManEndptVal === 'outside-to-node-or-label' || tgtManEndptVal === 'outside-to-line-or-label') {
- var trs = target._private.rscratch;
- var lw = trs.labelWidth;
- var lh = trs.labelHeight;
- var lx = trs.labelX;
- var ly = trs.labelY;
- var lw2 = lw / 2;
- var lh2 = lh / 2;
- var va = target.pstyle('text-valign').value;
- if (va === 'top') {
- ly -= lh2;
- } else if (va === 'bottom') {
- ly += lh2;
- }
- var ha = target.pstyle('text-halign').value;
- if (ha === 'left') {
- lx -= lw2;
- } else if (ha === 'right') {
- lx += lw2;
- }
- var labelIntersect = polygonIntersectLine(p1_i[0], p1_i[1], [lx - lw2, ly - lh2, lx + lw2, ly - lh2, lx + lw2, ly + lh2, lx - lw2, ly + lh2], tgtPos.x, tgtPos.y);
- if (labelIntersect.length > 0) {
- var refPt = srcPos;
- var intSqdist = sqdist(refPt, array2point(intersect));
- var labIntSqdist = sqdist(refPt, array2point(labelIntersect));
- var minSqDist = intSqdist;
- if (labIntSqdist < intSqdist) {
- intersect = labelIntersect;
- minSqDist = labIntSqdist;
- }
- if (labelIntersect.length > 2) {
- var labInt2SqDist = sqdist(refPt, {
- x: labelIntersect[2],
- y: labelIntersect[3]
- });
- if (labInt2SqDist < minSqDist) {
- intersect = [labelIntersect[2], labelIntersect[3]];
- }
- }
- }
- }
- }
- var arrowEnd = shortenIntersection(intersect, p1, r.arrowShapes[tgtArShape].spacing(edge) + tgtDist);
- var edgeEnd = shortenIntersection(intersect, p1, r.arrowShapes[tgtArShape].gap(edge) + tgtDist);
- rs.endX = edgeEnd[0];
- rs.endY = edgeEnd[1];
- rs.arrowEndX = arrowEnd[0];
- rs.arrowEndY = arrowEnd[1];
- if (srcManEndptVal === 'inside-to-node') {
- intersect = [srcPos.x, srcPos.y];
- } else if (srcManEndpt.units) {
- intersect = this.manualEndptToPx(source, srcManEndpt);
- } else if (srcManEndptVal === 'outside-to-line') {
- intersect = rs.srcIntn; // use cached value from ctrlpt calc
- } else {
- if (srcManEndptVal === 'outside-to-node' || srcManEndptVal === 'outside-to-node-or-label') {
- p2_i = p2;
- } else if (srcManEndptVal === 'outside-to-line' || srcManEndptVal === 'outside-to-line-or-label') {
- p2_i = [tgtPos.x, tgtPos.y];
- }
- intersect = r.nodeShapes[this.getNodeShape(source)].intersectLine(srcPos.x, srcPos.y, source.outerWidth(), source.outerHeight(), p2_i[0], p2_i[1], 0);
- if (srcManEndptVal === 'outside-to-node-or-label' || srcManEndptVal === 'outside-to-line-or-label') {
- var srs = source._private.rscratch;
- var _lw = srs.labelWidth;
- var _lh = srs.labelHeight;
- var _lx = srs.labelX;
- var _ly = srs.labelY;
- var _lw2 = _lw / 2;
- var _lh2 = _lh / 2;
- var _va = source.pstyle('text-valign').value;
- if (_va === 'top') {
- _ly -= _lh2;
- } else if (_va === 'bottom') {
- _ly += _lh2;
- }
- var _ha = source.pstyle('text-halign').value;
- if (_ha === 'left') {
- _lx -= _lw2;
- } else if (_ha === 'right') {
- _lx += _lw2;
+ var index = list.indexOf(node);
+ if (index >= 0) {
+ list.splice(index, 1);
}
- var _labelIntersect = polygonIntersectLine(p2_i[0], p2_i[1], [_lx - _lw2, _ly - _lh2, _lx + _lw2, _ly - _lh2, _lx + _lw2, _ly + _lh2, _lx - _lw2, _ly + _lh2], srcPos.x, srcPos.y);
- if (_labelIntersect.length > 0) {
- var _refPt = tgtPos;
- var _intSqdist = sqdist(_refPt, array2point(intersect));
- var _labIntSqdist = sqdist(_refPt, array2point(_labelIntersect));
- var _minSqDist = _intSqdist;
- if (_labIntSqdist < _intSqdist) {
- intersect = [_labelIntersect[0], _labelIntersect[1]];
- _minSqDist = _labIntSqdist;
- }
- if (_labelIntersect.length > 2) {
- var _labInt2SqDist = sqdist(_refPt, {
- x: _labelIntersect[2],
- y: _labelIntersect[3]
- });
- if (_labInt2SqDist < _minSqDist) {
- intersect = [_labelIntersect[2], _labelIntersect[3]];
+
+ var neighbours = node.getNeighborsList();
+
+ neighbours.forEach(function (neighbour) {
+ if (removedNodes.indexOf(neighbour) < 0) {
+ var otherDegree = remainingDegrees.get(neighbour);
+ var newDegree = otherDegree - 1;
+
+ if (newDegree == 1) {
+ tempList.push(neighbour);
}
+
+ remainingDegrees.set(neighbour, newDegree);
}
- }
+ });
}
- }
- var arrowStart = shortenIntersection(intersect, p2, r.arrowShapes[srcArShape].spacing(edge) + srcDist);
- var edgeStart = shortenIntersection(intersect, p2, r.arrowShapes[srcArShape].gap(edge) + srcDist);
- rs.startX = edgeStart[0];
- rs.startY = edgeStart[1];
- rs.arrowStartX = arrowStart[0];
- rs.arrowStartY = arrowStart[1];
- if (hasEndpts) {
- if (!number$1(rs.startX) || !number$1(rs.startY) || !number$1(rs.endX) || !number$1(rs.endY)) {
- rs.badLine = true;
- } else {
- rs.badLine = false;
+
+ removedNodes = removedNodes.concat(tempList);
+
+ if (list.length == 1 || list.length == 2) {
+ foundCenter = true;
+ centerNode = list[0];
}
}
+
+ return centerNode;
};
-BRp$b.getSourceEndpoint = function (edge) {
- var rs = edge[0]._private.rscratch;
- this.recalculateRenderedStyle(edge);
- switch (rs.edgeType) {
- case 'haystack':
- return {
- x: rs.haystackPts[0],
- y: rs.haystackPts[1]
- };
- default:
- return {
- x: rs.arrowStartX,
- y: rs.arrowStartY
- };
- }
+
+/**
+ * During the coarsening process, this layout may be referenced by two graph managers
+ * this setter function grants access to change the currently being used graph manager
+ */
+Layout.prototype.setGraphManager = function (gm) {
+ this.graphManager = gm;
};
-BRp$b.getTargetEndpoint = function (edge) {
- var rs = edge[0]._private.rscratch;
- this.recalculateRenderedStyle(edge);
- switch (rs.edgeType) {
- case 'haystack':
- return {
- x: rs.haystackPts[2],
- y: rs.haystackPts[3]
- };
- default:
- return {
- x: rs.arrowEndX,
- y: rs.arrowEndY
- };
- }
+
+module.exports = Layout;
+
+/***/ }),
+/* 16 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function RandomSeed() {}
+// adapted from: https://stackoverflow.com/a/19303725
+RandomSeed.seed = 1;
+RandomSeed.x = 0;
+
+RandomSeed.nextDouble = function () {
+ RandomSeed.x = Math.sin(RandomSeed.seed++) * 10000;
+ return RandomSeed.x - Math.floor(RandomSeed.x);
};
-var BRp$a = {};
-function pushBezierPts(r, edge, pts) {
- var qbezierAt$1 = function qbezierAt$1(p1, p2, p3, t) {
- return qbezierAt(p1, p2, p3, t);
- };
- var _p = edge._private;
- var bpts = _p.rstyle.bezierPts;
- for (var i = 0; i < r.bezierProjPcts.length; i++) {
- var p = r.bezierProjPcts[i];
- bpts.push({
- x: qbezierAt$1(pts[0], pts[2], pts[4], p),
- y: qbezierAt$1(pts[1], pts[3], pts[5], p)
- });
- }
+module.exports = RandomSeed;
+
+/***/ }),
+/* 17 */
+/***/ (function(module, exports, __nested_webpack_require_84109__) {
+
+"use strict";
+
+
+var PointD = __nested_webpack_require_84109__(5);
+
+function Transform(x, y) {
+ this.lworldOrgX = 0.0;
+ this.lworldOrgY = 0.0;
+ this.ldeviceOrgX = 0.0;
+ this.ldeviceOrgY = 0.0;
+ this.lworldExtX = 1.0;
+ this.lworldExtY = 1.0;
+ this.ldeviceExtX = 1.0;
+ this.ldeviceExtY = 1.0;
}
-BRp$a.storeEdgeProjections = function (edge) {
- var _p = edge._private;
- var rs = _p.rscratch;
- var et = rs.edgeType;
- // clear the cached points state
- _p.rstyle.bezierPts = null;
- _p.rstyle.linePts = null;
- _p.rstyle.haystackPts = null;
- if (et === 'multibezier' || et === 'bezier' || et === 'self' || et === 'compound') {
- _p.rstyle.bezierPts = [];
- for (var i = 0; i + 5 < rs.allpts.length; i += 4) {
- pushBezierPts(this, edge, rs.allpts.slice(i, i + 6));
- }
- } else if (et === 'segments') {
- var lpts = _p.rstyle.linePts = [];
- for (var i = 0; i + 1 < rs.allpts.length; i += 2) {
- lpts.push({
- x: rs.allpts[i],
- y: rs.allpts[i + 1]
- });
- }
- } else if (et === 'haystack') {
- var hpts = rs.haystackPts;
- _p.rstyle.haystackPts = [{
- x: hpts[0],
- y: hpts[1]
- }, {
- x: hpts[2],
- y: hpts[3]
- }];
- }
- _p.rstyle.arrowWidth = this.getArrowWidth(edge.pstyle('width').pfValue, edge.pstyle('arrow-scale').value) * this.arrowShapeWidth;
+Transform.prototype.getWorldOrgX = function () {
+ return this.lworldOrgX;
};
-BRp$a.recalculateEdgeProjections = function (edges) {
- this.findEdgeControlPoints(edges);
+
+Transform.prototype.setWorldOrgX = function (wox) {
+ this.lworldOrgX = wox;
};
-/* global document */
+Transform.prototype.getWorldOrgY = function () {
+ return this.lworldOrgY;
+};
-var BRp$9 = {};
-BRp$9.recalculateNodeLabelProjection = function (node) {
- var content = node.pstyle('label').strValue;
- if (emptyString(content)) {
- return;
- }
- var textX, textY;
- var _p = node._private;
- var nodeWidth = node.width();
- var nodeHeight = node.height();
- var padding = node.padding();
- var nodePos = node.position();
- var textHalign = node.pstyle('text-halign').strValue;
- var textValign = node.pstyle('text-valign').strValue;
- var rs = _p.rscratch;
- var rstyle = _p.rstyle;
- switch (textHalign) {
- case 'left':
- textX = nodePos.x - nodeWidth / 2 - padding;
- break;
- case 'right':
- textX = nodePos.x + nodeWidth / 2 + padding;
- break;
- default:
- // e.g. center
- textX = nodePos.x;
- }
- switch (textValign) {
- case 'top':
- textY = nodePos.y - nodeHeight / 2 - padding;
- break;
- case 'bottom':
- textY = nodePos.y + nodeHeight / 2 + padding;
- break;
- default:
- // e.g. middle
- textY = nodePos.y;
- }
- rs.labelX = textX;
- rs.labelY = textY;
- rstyle.labelX = textX;
- rstyle.labelY = textY;
- this.calculateLabelAngles(node);
- this.applyLabelDimensions(node);
+Transform.prototype.setWorldOrgY = function (woy) {
+ this.lworldOrgY = woy;
};
-var lineAngleFromDelta = function lineAngleFromDelta(dx, dy) {
- var angle = Math.atan(dy / dx);
- if (dx === 0 && angle < 0) {
- angle = angle * -1;
- }
- return angle;
+
+Transform.prototype.getWorldExtX = function () {
+ return this.lworldExtX;
};
-var lineAngle = function lineAngle(p0, p1) {
- var dx = p1.x - p0.x;
- var dy = p1.y - p0.y;
- return lineAngleFromDelta(dx, dy);
+
+Transform.prototype.setWorldExtX = function (wex) {
+ this.lworldExtX = wex;
};
-var bezierAngle = function bezierAngle(p0, p1, p2, t) {
- var t0 = bound(0, t - 0.001, 1);
- var t1 = bound(0, t + 0.001, 1);
- var lp0 = qbezierPtAt(p0, p1, p2, t0);
- var lp1 = qbezierPtAt(p0, p1, p2, t1);
- return lineAngle(lp0, lp1);
+
+Transform.prototype.getWorldExtY = function () {
+ return this.lworldExtY;
};
-BRp$9.recalculateEdgeLabelProjections = function (edge) {
- var p;
- var _p = edge._private;
- var rs = _p.rscratch;
- var r = this;
- var content = {
- mid: edge.pstyle('label').strValue,
- source: edge.pstyle('source-label').strValue,
- target: edge.pstyle('target-label').strValue
- };
- if (content.mid || content.source || content.target) ; else {
- return; // no labels => no calcs
- }
- // add center point to style so bounding box calculations can use it
- //
- p = {
- x: rs.midX,
- y: rs.midY
- };
- var setRs = function setRs(propName, prefix, value) {
- setPrefixedProperty(_p.rscratch, propName, prefix, value);
- setPrefixedProperty(_p.rstyle, propName, prefix, value);
- };
- setRs('labelX', null, p.x);
- setRs('labelY', null, p.y);
- var midAngle = lineAngleFromDelta(rs.midDispX, rs.midDispY);
- setRs('labelAutoAngle', null, midAngle);
- var createControlPointInfo = function createControlPointInfo() {
- if (createControlPointInfo.cache) {
- return createControlPointInfo.cache;
- } // use cache so only 1x per edge
+Transform.prototype.setWorldExtY = function (wey) {
+ this.lworldExtY = wey;
+};
- var ctrlpts = [];
+/* Device related */
- // store each ctrlpt info init
- for (var i = 0; i + 5 < rs.allpts.length; i += 4) {
- var p0 = {
- x: rs.allpts[i],
- y: rs.allpts[i + 1]
- };
- var p1 = {
- x: rs.allpts[i + 2],
- y: rs.allpts[i + 3]
- }; // ctrlpt
- var p2 = {
- x: rs.allpts[i + 4],
- y: rs.allpts[i + 5]
- };
- ctrlpts.push({
- p0: p0,
- p1: p1,
- p2: p2,
- startDist: 0,
- length: 0,
- segments: []
- });
- }
- var bpts = _p.rstyle.bezierPts;
- var nProjs = r.bezierProjPcts.length;
- function addSegment(cp, p0, p1, t0, t1) {
- var length = dist(p0, p1);
- var prevSegment = cp.segments[cp.segments.length - 1];
- var segment = {
- p0: p0,
- p1: p1,
- t0: t0,
- t1: t1,
- startDist: prevSegment ? prevSegment.startDist + prevSegment.length : 0,
- length: length
- };
- cp.segments.push(segment);
- cp.length += length;
- }
+Transform.prototype.getDeviceOrgX = function () {
+ return this.ldeviceOrgX;
+};
- // update each ctrlpt with segment info
- for (var _i = 0; _i < ctrlpts.length; _i++) {
- var cp = ctrlpts[_i];
- var prevCp = ctrlpts[_i - 1];
- if (prevCp) {
- cp.startDist = prevCp.startDist + prevCp.length;
- }
- addSegment(cp, cp.p0, bpts[_i * nProjs], 0, r.bezierProjPcts[0]); // first
+Transform.prototype.setDeviceOrgX = function (dox) {
+ this.ldeviceOrgX = dox;
+};
- for (var j = 0; j < nProjs - 1; j++) {
- addSegment(cp, bpts[_i * nProjs + j], bpts[_i * nProjs + j + 1], r.bezierProjPcts[j], r.bezierProjPcts[j + 1]);
- }
- addSegment(cp, bpts[_i * nProjs + nProjs - 1], cp.p2, r.bezierProjPcts[nProjs - 1], 1); // last
- }
+Transform.prototype.getDeviceOrgY = function () {
+ return this.ldeviceOrgY;
+};
- return createControlPointInfo.cache = ctrlpts;
- };
- var calculateEndProjection = function calculateEndProjection(prefix) {
- var angle;
- var isSrc = prefix === 'source';
- if (!content[prefix]) {
- return;
- }
- var offset = edge.pstyle(prefix + '-text-offset').pfValue;
- switch (rs.edgeType) {
- case 'self':
- case 'compound':
- case 'bezier':
- case 'multibezier':
- {
- var cps = createControlPointInfo();
- var selected;
- var startDist = 0;
- var totalDist = 0;
+Transform.prototype.setDeviceOrgY = function (doy) {
+ this.ldeviceOrgY = doy;
+};
- // find the segment we're on
- for (var i = 0; i < cps.length; i++) {
- var _cp = cps[isSrc ? i : cps.length - 1 - i];
- for (var j = 0; j < _cp.segments.length; j++) {
- var _seg = _cp.segments[isSrc ? j : _cp.segments.length - 1 - j];
- var lastSeg = i === cps.length - 1 && j === _cp.segments.length - 1;
- startDist = totalDist;
- totalDist += _seg.length;
- if (totalDist >= offset || lastSeg) {
- selected = {
- cp: _cp,
- segment: _seg
- };
- break;
- }
- }
- if (selected) {
- break;
- }
- }
- var cp = selected.cp;
- var seg = selected.segment;
- var tSegment = (offset - startDist) / seg.length;
- var segDt = seg.t1 - seg.t0;
- var t = isSrc ? seg.t0 + segDt * tSegment : seg.t1 - segDt * tSegment;
- t = bound(0, t, 1);
- p = qbezierPtAt(cp.p0, cp.p1, cp.p2, t);
- angle = bezierAngle(cp.p0, cp.p1, cp.p2, t);
- break;
- }
- case 'straight':
- case 'segments':
- case 'haystack':
- {
- var d = 0,
- di,
- d0;
- var p0, p1;
- var l = rs.allpts.length;
- for (var _i2 = 0; _i2 + 3 < l; _i2 += 2) {
- if (isSrc) {
- p0 = {
- x: rs.allpts[_i2],
- y: rs.allpts[_i2 + 1]
- };
- p1 = {
- x: rs.allpts[_i2 + 2],
- y: rs.allpts[_i2 + 3]
- };
- } else {
- p0 = {
- x: rs.allpts[l - 2 - _i2],
- y: rs.allpts[l - 1 - _i2]
- };
- p1 = {
- x: rs.allpts[l - 4 - _i2],
- y: rs.allpts[l - 3 - _i2]
- };
- }
- di = dist(p0, p1);
- d0 = d;
- d += di;
- if (d >= offset) {
- break;
- }
- }
- var pD = offset - d0;
- var _t = pD / di;
- _t = bound(0, _t, 1);
- p = lineAt(p0, p1, _t);
- angle = lineAngle(p0, p1);
- break;
- }
- }
- setRs('labelX', prefix, p.x);
- setRs('labelY', prefix, p.y);
- setRs('labelAutoAngle', prefix, angle);
- };
- calculateEndProjection('source');
- calculateEndProjection('target');
- this.applyLabelDimensions(edge);
+Transform.prototype.getDeviceExtX = function () {
+ return this.ldeviceExtX;
};
-BRp$9.applyLabelDimensions = function (ele) {
- this.applyPrefixedLabelDimensions(ele);
- if (ele.isEdge()) {
- this.applyPrefixedLabelDimensions(ele, 'source');
- this.applyPrefixedLabelDimensions(ele, 'target');
- }
+
+Transform.prototype.setDeviceExtX = function (dex) {
+ this.ldeviceExtX = dex;
};
-BRp$9.applyPrefixedLabelDimensions = function (ele, prefix) {
- var _p = ele._private;
- var text = this.getLabelText(ele, prefix);
- var labelDims = this.calculateLabelDimensions(ele, text);
- var lineHeight = ele.pstyle('line-height').pfValue;
- var textWrap = ele.pstyle('text-wrap').strValue;
- var lines = getPrefixedProperty(_p.rscratch, 'labelWrapCachedLines', prefix) || [];
- var numLines = textWrap !== 'wrap' ? 1 : Math.max(lines.length, 1);
- var normPerLineHeight = labelDims.height / numLines;
- var labelLineHeight = normPerLineHeight * lineHeight;
- var width = labelDims.width;
- var height = labelDims.height + (numLines - 1) * (lineHeight - 1) * normPerLineHeight;
- setPrefixedProperty(_p.rstyle, 'labelWidth', prefix, width);
- setPrefixedProperty(_p.rscratch, 'labelWidth', prefix, width);
- setPrefixedProperty(_p.rstyle, 'labelHeight', prefix, height);
- setPrefixedProperty(_p.rscratch, 'labelHeight', prefix, height);
- setPrefixedProperty(_p.rscratch, 'labelLineHeight', prefix, labelLineHeight);
+
+Transform.prototype.getDeviceExtY = function () {
+ return this.ldeviceExtY;
+};
+
+Transform.prototype.setDeviceExtY = function (dey) {
+ this.ldeviceExtY = dey;
+};
+
+Transform.prototype.transformX = function (x) {
+ var xDevice = 0.0;
+ var worldExtX = this.lworldExtX;
+ if (worldExtX != 0.0) {
+ xDevice = this.ldeviceOrgX + (x - this.lworldOrgX) * this.ldeviceExtX / worldExtX;
+ }
+
+ return xDevice;
};
-BRp$9.getLabelText = function (ele, prefix) {
- var _p = ele._private;
- var pfd = prefix ? prefix + '-' : '';
- var text = ele.pstyle(pfd + 'label').strValue;
- var textTransform = ele.pstyle('text-transform').value;
- var rscratch = function rscratch(propName, value) {
- if (value) {
- setPrefixedProperty(_p.rscratch, propName, prefix, value);
- return value;
- } else {
- return getPrefixedProperty(_p.rscratch, propName, prefix);
- }
- };
- // for empty text, skip all processing
- if (!text) {
- return '';
+Transform.prototype.transformY = function (y) {
+ var yDevice = 0.0;
+ var worldExtY = this.lworldExtY;
+ if (worldExtY != 0.0) {
+ yDevice = this.ldeviceOrgY + (y - this.lworldOrgY) * this.ldeviceExtY / worldExtY;
}
- if (textTransform == 'none') ; else if (textTransform == 'uppercase') {
- text = text.toUpperCase();
- } else if (textTransform == 'lowercase') {
- text = text.toLowerCase();
+
+ return yDevice;
+};
+
+Transform.prototype.inverseTransformX = function (x) {
+ var xWorld = 0.0;
+ var deviceExtX = this.ldeviceExtX;
+ if (deviceExtX != 0.0) {
+ xWorld = this.lworldOrgX + (x - this.ldeviceOrgX) * this.lworldExtX / deviceExtX;
}
- var wrapStyle = ele.pstyle('text-wrap').value;
- if (wrapStyle === 'wrap') {
- var labelKey = rscratch('labelKey');
- // save recalc if the label is the same as before
- if (labelKey != null && rscratch('labelWrapKey') === labelKey) {
- return rscratch('labelWrapCachedText');
- }
- var zwsp = "\u200B";
- var lines = text.split('\n');
- var maxW = ele.pstyle('text-max-width').pfValue;
- var overflow = ele.pstyle('text-overflow-wrap').value;
- var overflowAny = overflow === 'anywhere';
- var wrappedLines = [];
- var wordsRegex = /[\s\u200b]+/;
- var wordSeparator = overflowAny ? '' : ' ';
- for (var l = 0; l < lines.length; l++) {
- var line = lines[l];
- var lineDims = this.calculateLabelDimensions(ele, line);
- var lineW = lineDims.width;
- if (overflowAny) {
- var processedLine = line.split('').join(zwsp);
- line = processedLine;
- }
- if (lineW > maxW) {
- // line is too long
- var words = line.split(wordsRegex);
- var subline = '';
- for (var w = 0; w < words.length; w++) {
- var word = words[w];
- var testLine = subline.length === 0 ? word : subline + wordSeparator + word;
- var testDims = this.calculateLabelDimensions(ele, testLine);
- var testW = testDims.width;
- if (testW <= maxW) {
- // word fits on current line
- subline += word + wordSeparator;
- } else {
- // word starts new line
- if (subline) {
- wrappedLines.push(subline);
- }
- subline = word + wordSeparator;
- }
- }
+ return xWorld;
+};
- // if there's remaining text, put it in a wrapped line
- if (!subline.match(/^[\s\u200b]+$/)) {
- wrappedLines.push(subline);
- }
- } else {
- // line is already short enough
- wrappedLines.push(line);
- }
- } // for
+Transform.prototype.inverseTransformY = function (y) {
+ var yWorld = 0.0;
+ var deviceExtY = this.ldeviceExtY;
+ if (deviceExtY != 0.0) {
+ yWorld = this.lworldOrgY + (y - this.ldeviceOrgY) * this.lworldExtY / deviceExtY;
+ }
+ return yWorld;
+};
- rscratch('labelWrapCachedLines', wrappedLines);
- text = rscratch('labelWrapCachedText', wrappedLines.join('\n'));
- rscratch('labelWrapKey', labelKey);
- } else if (wrapStyle === 'ellipsis') {
- var _maxW = ele.pstyle('text-max-width').pfValue;
- var ellipsized = '';
- var ellipsis = "\u2026";
- var incLastCh = false;
- if (this.calculateLabelDimensions(ele, text).width < _maxW) {
- // the label already fits
- return text;
- }
- for (var i = 0; i < text.length; i++) {
- var widthWithNextCh = this.calculateLabelDimensions(ele, ellipsized + text[i] + ellipsis).width;
- if (widthWithNextCh > _maxW) {
- break;
- }
- ellipsized += text[i];
- if (i === text.length - 1) {
- incLastCh = true;
- }
- }
- if (!incLastCh) {
- ellipsized += ellipsis;
- }
- return ellipsized;
- } // if ellipsize
+Transform.prototype.inverseTransformPoint = function (inPoint) {
+ var outPoint = new PointD(this.inverseTransformX(inPoint.x), this.inverseTransformY(inPoint.y));
+ return outPoint;
+};
- return text;
+module.exports = Transform;
+
+/***/ }),
+/* 18 */
+/***/ (function(module, exports, __nested_webpack_require_86996__) {
+
+"use strict";
+
+
+function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+
+var Layout = __nested_webpack_require_86996__(15);
+var FDLayoutConstants = __nested_webpack_require_86996__(4);
+var LayoutConstants = __nested_webpack_require_86996__(0);
+var IGeometry = __nested_webpack_require_86996__(8);
+var IMath = __nested_webpack_require_86996__(9);
+
+function FDLayout() {
+ Layout.call(this);
+
+ this.useSmartIdealEdgeLengthCalculation = FDLayoutConstants.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION;
+ this.gravityConstant = FDLayoutConstants.DEFAULT_GRAVITY_STRENGTH;
+ this.compoundGravityConstant = FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_STRENGTH;
+ this.gravityRangeFactor = FDLayoutConstants.DEFAULT_GRAVITY_RANGE_FACTOR;
+ this.compoundGravityRangeFactor = FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR;
+ this.displacementThresholdPerNode = 3.0 * FDLayoutConstants.DEFAULT_EDGE_LENGTH / 100;
+ this.coolingFactor = FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+ this.initialCoolingFactor = FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL;
+ this.totalDisplacement = 0.0;
+ this.oldTotalDisplacement = 0.0;
+ this.maxIterations = FDLayoutConstants.MAX_ITERATIONS;
+}
+
+FDLayout.prototype = Object.create(Layout.prototype);
+
+for (var prop in Layout) {
+ FDLayout[prop] = Layout[prop];
+}
+
+FDLayout.prototype.initParameters = function () {
+ Layout.prototype.initParameters.call(this, arguments);
+
+ this.totalIterations = 0;
+ this.notAnimatedIterations = 0;
+
+ this.useFRGridVariant = FDLayoutConstants.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION;
+
+ this.grid = [];
};
-BRp$9.getLabelJustification = function (ele) {
- var justification = ele.pstyle('text-justification').strValue;
- var textHalign = ele.pstyle('text-halign').strValue;
- if (justification === 'auto') {
- if (ele.isNode()) {
- switch (textHalign) {
- case 'left':
- return 'right';
- case 'right':
- return 'left';
- default:
- return 'center';
+
+FDLayout.prototype.calcIdealEdgeLengths = function () {
+ var edge;
+ var originalIdealLength;
+ var lcaDepth;
+ var source;
+ var target;
+ var sizeOfSourceInLca;
+ var sizeOfTargetInLca;
+
+ var allEdges = this.getGraphManager().getAllEdges();
+ for (var i = 0; i < allEdges.length; i++) {
+ edge = allEdges[i];
+
+ originalIdealLength = edge.idealLength;
+
+ if (edge.isInterGraph) {
+ source = edge.getSource();
+ target = edge.getTarget();
+
+ sizeOfSourceInLca = edge.getSourceInLca().getEstimatedSize();
+ sizeOfTargetInLca = edge.getTargetInLca().getEstimatedSize();
+
+ if (this.useSmartIdealEdgeLengthCalculation) {
+ edge.idealLength += sizeOfSourceInLca + sizeOfTargetInLca - 2 * LayoutConstants.SIMPLE_NODE_SIZE;
}
- } else {
- return 'center';
+
+ lcaDepth = edge.getLca().getInclusionTreeDepth();
+
+ edge.idealLength += originalIdealLength * FDLayoutConstants.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (source.getInclusionTreeDepth() + target.getInclusionTreeDepth() - 2 * lcaDepth);
}
- } else {
- return justification;
}
};
-BRp$9.calculateLabelDimensions = function (ele, text) {
- var r = this;
- var cacheKey = hashString(text, ele._private.labelDimsKey);
- var cache = r.labelDimCache || (r.labelDimCache = []);
- var existingVal = cache[cacheKey];
- if (existingVal != null) {
- return existingVal;
- }
- var padding = 0; // add padding around text dims, as the measurement isn't that accurate
- var fStyle = ele.pstyle('font-style').strValue;
- var size = ele.pstyle('font-size').pfValue;
- var family = ele.pstyle('font-family').strValue;
- var weight = ele.pstyle('font-weight').strValue;
- var canvas = this.labelCalcCanvas;
- var c2d = this.labelCalcCanvasContext;
- if (!canvas) {
- canvas = this.labelCalcCanvas = document.createElement('canvas');
- c2d = this.labelCalcCanvasContext = canvas.getContext('2d');
- var ds = canvas.style;
- ds.position = 'absolute';
- ds.left = '-9999px';
- ds.top = '-9999px';
- ds.zIndex = '-1';
- ds.visibility = 'hidden';
- ds.pointerEvents = 'none';
+
+FDLayout.prototype.initSpringEmbedder = function () {
+
+ var s = this.getAllNodes().length;
+ if (this.incremental) {
+ if (s > FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) {
+ this.coolingFactor = Math.max(this.coolingFactor * FDLayoutConstants.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (s - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) / (FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - FDLayoutConstants.COOLING_ADAPTATION_FACTOR));
+ }
+ this.maxNodeDisplacement = FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL;
+ } else {
+ if (s > FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) {
+ this.coolingFactor = Math.max(FDLayoutConstants.COOLING_ADAPTATION_FACTOR, 1.0 - (s - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) / (FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) * (1 - FDLayoutConstants.COOLING_ADAPTATION_FACTOR));
+ } else {
+ this.coolingFactor = 1.0;
+ }
+ this.initialCoolingFactor = this.coolingFactor;
+ this.maxNodeDisplacement = FDLayoutConstants.MAX_NODE_DISPLACEMENT;
}
- c2d.font = "".concat(fStyle, " ").concat(weight, " ").concat(size, "px ").concat(family);
- var width = 0;
- var height = 0;
- var lines = text.split('\n');
- for (var i = 0; i < lines.length; i++) {
- var line = lines[i];
- var metrics = c2d.measureText(line);
- var w = Math.ceil(metrics.width);
- var h = size;
- width = Math.max(w, width);
- height += h;
+
+ this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations);
+
+ // Reassign this attribute by using new constant value
+ this.displacementThresholdPerNode = 3.0 * FDLayoutConstants.DEFAULT_EDGE_LENGTH / 100;
+ this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length;
+
+ this.repulsionRange = this.calcRepulsionRange();
+};
+
+FDLayout.prototype.calcSpringForces = function () {
+ var lEdges = this.getAllEdges();
+ var edge;
+
+ for (var i = 0; i < lEdges.length; i++) {
+ edge = lEdges[i];
+
+ this.calcSpringForce(edge, edge.idealLength);
}
- width += padding;
- height += padding;
- return cache[cacheKey] = {
- width: width,
- height: height
- };
};
-BRp$9.calculateLabelAngle = function (ele, prefix) {
- var _p = ele._private;
- var rs = _p.rscratch;
- var isEdge = ele.isEdge();
- var prefixDash = prefix ? prefix + '-' : '';
- var rot = ele.pstyle(prefixDash + 'text-rotation');
- var rotStr = rot.strValue;
- if (rotStr === 'none') {
- return 0;
- } else if (isEdge && rotStr === 'autorotate') {
- return rs.labelAutoAngle;
- } else if (rotStr === 'autorotate') {
- return 0;
+
+FDLayout.prototype.calcRepulsionForces = function () {
+ var gridUpdateAllowed = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
+ var forceToNodeSurroundingUpdate = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+
+ var i, j;
+ var nodeA, nodeB;
+ var lNodes = this.getAllNodes();
+ var processedNodeSet;
+
+ if (this.useFRGridVariant) {
+ if (this.totalIterations % FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD == 1 && gridUpdateAllowed) {
+ this.updateGrid();
+ }
+
+ processedNodeSet = new Set();
+
+ // calculate repulsion forces between each nodes and its surrounding
+ for (i = 0; i < lNodes.length; i++) {
+ nodeA = lNodes[i];
+ this.calculateRepulsionForceOfANode(nodeA, processedNodeSet, gridUpdateAllowed, forceToNodeSurroundingUpdate);
+ processedNodeSet.add(nodeA);
+ }
} else {
- return rot.pfValue;
+ for (i = 0; i < lNodes.length; i++) {
+ nodeA = lNodes[i];
+
+ for (j = i + 1; j < lNodes.length; j++) {
+ nodeB = lNodes[j];
+
+ // If both nodes are not members of the same graph, skip.
+ if (nodeA.getOwner() != nodeB.getOwner()) {
+ continue;
+ }
+
+ this.calcRepulsionForce(nodeA, nodeB);
+ }
+ }
}
};
-BRp$9.calculateLabelAngles = function (ele) {
- var r = this;
- var isEdge = ele.isEdge();
- var _p = ele._private;
- var rs = _p.rscratch;
- rs.labelAngle = r.calculateLabelAngle(ele);
- if (isEdge) {
- rs.sourceLabelAngle = r.calculateLabelAngle(ele, 'source');
- rs.targetLabelAngle = r.calculateLabelAngle(ele, 'target');
+
+FDLayout.prototype.calcGravitationalForces = function () {
+ var node;
+ var lNodes = this.getAllNodesToApplyGravitation();
+
+ for (var i = 0; i < lNodes.length; i++) {
+ node = lNodes[i];
+ this.calcGravitationalForce(node);
}
};
-var BRp$8 = {};
-var TOO_SMALL_CUT_RECT = 28;
-var warnedCutRect = false;
-BRp$8.getNodeShape = function (node) {
- var r = this;
- var shape = node.pstyle('shape').value;
- if (shape === 'cutrectangle' && (node.width() < TOO_SMALL_CUT_RECT || node.height() < TOO_SMALL_CUT_RECT)) {
- if (!warnedCutRect) {
- warn('The `cutrectangle` node shape can not be used at small sizes so `rectangle` is used instead');
- warnedCutRect = true;
- }
- return 'rectangle';
+FDLayout.prototype.moveNodes = function () {
+ var lNodes = this.getAllNodes();
+ var node;
+
+ for (var i = 0; i < lNodes.length; i++) {
+ node = lNodes[i];
+ node.move();
}
- if (node.isParent()) {
- if (shape === 'rectangle' || shape === 'roundrectangle' || shape === 'round-rectangle' || shape === 'cutrectangle' || shape === 'cut-rectangle' || shape === 'barrel') {
- return shape;
- } else {
- return 'rectangle';
+};
+
+FDLayout.prototype.calcSpringForce = function (edge, idealLength) {
+ var sourceNode = edge.getSource();
+ var targetNode = edge.getTarget();
+
+ var length;
+ var springForce;
+ var springForceX;
+ var springForceY;
+
+ // Update edge length
+ if (this.uniformLeafNodeSizes && sourceNode.getChild() == null && targetNode.getChild() == null) {
+ edge.updateLengthSimple();
+ } else {
+ edge.updateLength();
+
+ if (edge.isOverlapingSourceAndTarget) {
+ return;
}
}
- if (shape === 'polygon') {
- var points = node.pstyle('shape-polygon-points').value;
- return r.nodeShapes.makePolygon(points).name;
- }
- return shape;
+
+ length = edge.getLength();
+
+ if (length == 0) return;
+
+ // Calculate spring forces
+ springForce = edge.edgeElasticity * (length - idealLength);
+
+ // Project force onto x and y axes
+ springForceX = springForce * (edge.lengthX / length);
+ springForceY = springForce * (edge.lengthY / length);
+
+ // Apply forces on the end nodes
+ sourceNode.springForceX += springForceX;
+ sourceNode.springForceY += springForceY;
+ targetNode.springForceX -= springForceX;
+ targetNode.springForceY -= springForceY;
};
-var BRp$7 = {};
-BRp$7.registerCalculationListeners = function () {
- var cy = this.cy;
- var elesToUpdate = cy.collection();
- var r = this;
- var enqueue = function enqueue(eles) {
- var dirtyStyleCaches = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- elesToUpdate.merge(eles);
- if (dirtyStyleCaches) {
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var _p = ele._private;
- var rstyle = _p.rstyle;
- rstyle.clean = false;
- rstyle.cleanConnected = false;
+FDLayout.prototype.calcRepulsionForce = function (nodeA, nodeB) {
+ var rectA = nodeA.getRect();
+ var rectB = nodeB.getRect();
+ var overlapAmount = new Array(2);
+ var clipPoints = new Array(4);
+ var distanceX;
+ var distanceY;
+ var distanceSquared;
+ var distance;
+ var repulsionForce;
+ var repulsionForceX;
+ var repulsionForceY;
+
+ if (rectA.intersects(rectB)) // two nodes overlap
+ {
+ // calculate separation amount in x and y directions
+ IGeometry.calcSeparationAmount(rectA, rectB, overlapAmount, FDLayoutConstants.DEFAULT_EDGE_LENGTH / 2.0);
+
+ repulsionForceX = 2 * overlapAmount[0];
+ repulsionForceY = 2 * overlapAmount[1];
+
+ var childrenConstant = nodeA.noOfChildren * nodeB.noOfChildren / (nodeA.noOfChildren + nodeB.noOfChildren);
+
+ // Apply forces on the two nodes
+ nodeA.repulsionForceX -= childrenConstant * repulsionForceX;
+ nodeA.repulsionForceY -= childrenConstant * repulsionForceY;
+ nodeB.repulsionForceX += childrenConstant * repulsionForceX;
+ nodeB.repulsionForceY += childrenConstant * repulsionForceY;
+ } else // no overlap
+ {
+ // calculate distance
+
+ if (this.uniformLeafNodeSizes && nodeA.getChild() == null && nodeB.getChild() == null) // simply base repulsion on distance of node centers
+ {
+ distanceX = rectB.getCenterX() - rectA.getCenterX();
+ distanceY = rectB.getCenterY() - rectA.getCenterY();
+ } else // use clipping points
+ {
+ IGeometry.getIntersection(rectA, rectB, clipPoints);
+
+ distanceX = clipPoints[2] - clipPoints[0];
+ distanceY = clipPoints[3] - clipPoints[1];
+ }
+
+ // No repulsion range. FR grid variant should take care of this.
+ if (Math.abs(distanceX) < FDLayoutConstants.MIN_REPULSION_DIST) {
+ distanceX = IMath.sign(distanceX) * FDLayoutConstants.MIN_REPULSION_DIST;
}
+
+ if (Math.abs(distanceY) < FDLayoutConstants.MIN_REPULSION_DIST) {
+ distanceY = IMath.sign(distanceY) * FDLayoutConstants.MIN_REPULSION_DIST;
+ }
+
+ distanceSquared = distanceX * distanceX + distanceY * distanceY;
+ distance = Math.sqrt(distanceSquared);
+
+ // Here we use half of the nodes' repulsion values for backward compatibility
+ repulsionForce = (nodeA.nodeRepulsion / 2 + nodeB.nodeRepulsion / 2) * nodeA.noOfChildren * nodeB.noOfChildren / distanceSquared;
+
+ // Project force onto x and y axes
+ repulsionForceX = repulsionForce * distanceX / distance;
+ repulsionForceY = repulsionForce * distanceY / distance;
+
+ // Apply forces on the two nodes
+ nodeA.repulsionForceX -= repulsionForceX;
+ nodeA.repulsionForceY -= repulsionForceY;
+ nodeB.repulsionForceX += repulsionForceX;
+ nodeB.repulsionForceY += repulsionForceY;
}
- };
- r.binder(cy).on('bounds.* dirty.*', function onDirtyBounds(e) {
- var ele = e.target;
- enqueue(ele);
- }).on('style.* background.*', function onDirtyStyle(e) {
- var ele = e.target;
- enqueue(ele, false);
- });
- var updateEleCalcs = function updateEleCalcs(willDraw) {
- if (willDraw) {
- var fns = r.onUpdateEleCalcsFns;
+};
- // because we need to have up-to-date style (e.g. stylesheet mappers)
- // before calculating rendered style (and pstyle might not be called yet)
- elesToUpdate.cleanStyle();
- for (var i = 0; i < elesToUpdate.length; i++) {
- var ele = elesToUpdate[i];
- var rstyle = ele._private.rstyle;
- if (ele.isNode() && !rstyle.cleanConnected) {
- enqueue(ele.connectedEdges());
- rstyle.cleanConnected = true;
- }
+FDLayout.prototype.calcGravitationalForce = function (node) {
+ var ownerGraph;
+ var ownerCenterX;
+ var ownerCenterY;
+ var distanceX;
+ var distanceY;
+ var absDistanceX;
+ var absDistanceY;
+ var estimatedSize;
+ ownerGraph = node.getOwner();
+
+ ownerCenterX = (ownerGraph.getRight() + ownerGraph.getLeft()) / 2;
+ ownerCenterY = (ownerGraph.getTop() + ownerGraph.getBottom()) / 2;
+ distanceX = node.getCenterX() - ownerCenterX;
+ distanceY = node.getCenterY() - ownerCenterY;
+ absDistanceX = Math.abs(distanceX) + node.getWidth() / 2;
+ absDistanceY = Math.abs(distanceY) + node.getHeight() / 2;
+
+ if (node.getOwner() == this.graphManager.getRoot()) // in the root graph
+ {
+ estimatedSize = ownerGraph.getEstimatedSize() * this.gravityRangeFactor;
+
+ if (absDistanceX > estimatedSize || absDistanceY > estimatedSize) {
+ node.gravitationForceX = -this.gravityConstant * distanceX;
+ node.gravitationForceY = -this.gravityConstant * distanceY;
}
- if (fns) {
- for (var _i = 0; _i < fns.length; _i++) {
- var fn = fns[_i];
- fn(willDraw, elesToUpdate);
- }
+ } else // inside a compound
+ {
+ estimatedSize = ownerGraph.getEstimatedSize() * this.compoundGravityRangeFactor;
+
+ if (absDistanceX > estimatedSize || absDistanceY > estimatedSize) {
+ node.gravitationForceX = -this.gravityConstant * distanceX * this.compoundGravityConstant;
+ node.gravitationForceY = -this.gravityConstant * distanceY * this.compoundGravityConstant;
}
- r.recalculateRenderedStyle(elesToUpdate);
- elesToUpdate = cy.collection();
}
- };
- r.flushRenderedStyleQueue = function () {
- updateEleCalcs(true);
- };
- r.beforeRender(updateEleCalcs, r.beforeRenderPriorities.eleCalcs);
-};
-BRp$7.onUpdateEleCalcs = function (fn) {
- var fns = this.onUpdateEleCalcsFns = this.onUpdateEleCalcsFns || [];
- fns.push(fn);
};
-BRp$7.recalculateRenderedStyle = function (eles, useCache) {
- var isCleanConnected = function isCleanConnected(ele) {
- return ele._private.rstyle.cleanConnected;
- };
- var edges = [];
- var nodes = [];
- // the renderer can't be used for calcs when destroyed, e.g. ele.boundingBox()
- if (this.destroyed) {
- return;
- }
+FDLayout.prototype.isConverged = function () {
+ var converged;
+ var oscilating = false;
- // use cache by default for perf
- if (useCache === undefined) {
- useCache = true;
+ if (this.totalIterations > this.maxIterations / 3) {
+ oscilating = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2;
}
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var _p = ele._private;
- var rstyle = _p.rstyle;
- // an edge may be implicitly dirty b/c of one of its connected nodes
- // (and a request for recalc may come in between frames)
- if (ele.isEdge() && (!isCleanConnected(ele.source()) || !isCleanConnected(ele.target()))) {
- rstyle.clean = false;
- }
+ converged = this.totalDisplacement < this.totalDisplacementThreshold;
- // only update if dirty and in graph
- if (useCache && rstyle.clean || ele.removed()) {
- continue;
- }
+ this.oldTotalDisplacement = this.totalDisplacement;
- // only update if not display: none
- if (ele.pstyle('display').value === 'none') {
- continue;
- }
- if (_p.group === 'nodes') {
- nodes.push(ele);
+ return converged || oscilating;
+};
+
+FDLayout.prototype.animate = function () {
+ if (this.animationDuringLayout && !this.isSubLayout) {
+ if (this.notAnimatedIterations == this.animationPeriod) {
+ this.update();
+ this.notAnimatedIterations = 0;
} else {
- // edges
- edges.push(ele);
+ this.notAnimatedIterations++;
}
- rstyle.clean = true;
- }
-
- // update node data from projections
- for (var _i2 = 0; _i2 < nodes.length; _i2++) {
- var _ele = nodes[_i2];
- var _p2 = _ele._private;
- var _rstyle = _p2.rstyle;
- var pos = _ele.position();
- this.recalculateNodeLabelProjection(_ele);
- _rstyle.nodeX = pos.x;
- _rstyle.nodeY = pos.y;
- _rstyle.nodeW = _ele.pstyle('width').pfValue;
- _rstyle.nodeH = _ele.pstyle('height').pfValue;
}
- this.recalculateEdgeProjections(edges);
+};
- // update edge data from projections
- for (var _i3 = 0; _i3 < edges.length; _i3++) {
- var _ele2 = edges[_i3];
- var _p3 = _ele2._private;
- var _rstyle2 = _p3.rstyle;
- var rs = _p3.rscratch;
+//This method calculates the number of children (weight) for all nodes
+FDLayout.prototype.calcNoOfChildrenForAllNodes = function () {
+ var node;
+ var allNodes = this.graphManager.getAllNodes();
- // update rstyle positions
- _rstyle2.srcX = rs.arrowStartX;
- _rstyle2.srcY = rs.arrowStartY;
- _rstyle2.tgtX = rs.arrowEndX;
- _rstyle2.tgtY = rs.arrowEndY;
- _rstyle2.midX = rs.midX;
- _rstyle2.midY = rs.midY;
- _rstyle2.labelAngle = rs.labelAngle;
- _rstyle2.sourceLabelAngle = rs.sourceLabelAngle;
- _rstyle2.targetLabelAngle = rs.targetLabelAngle;
+ for (var i = 0; i < allNodes.length; i++) {
+ node = allNodes[i];
+ node.noOfChildren = node.getNoOfChildren();
}
};
-var BRp$6 = {};
-BRp$6.updateCachedGrabbedEles = function () {
- var eles = this.cachedZSortedEles;
- if (!eles) {
- // just let this be recalculated on the next z sort tick
- return;
+// -----------------------------------------------------------------------------
+// Section: FR-Grid Variant Repulsion Force Calculation
+// -----------------------------------------------------------------------------
+
+FDLayout.prototype.calcGrid = function (graph) {
+
+ var sizeX = 0;
+ var sizeY = 0;
+
+ sizeX = parseInt(Math.ceil((graph.getRight() - graph.getLeft()) / this.repulsionRange));
+ sizeY = parseInt(Math.ceil((graph.getBottom() - graph.getTop()) / this.repulsionRange));
+
+ var grid = new Array(sizeX);
+
+ for (var i = 0; i < sizeX; i++) {
+ grid[i] = new Array(sizeY);
}
- eles.drag = [];
- eles.nondrag = [];
- var grabTargets = [];
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var rs = ele._private.rscratch;
- if (ele.grabbed() && !ele.isParent()) {
- grabTargets.push(ele);
- } else if (rs.inDragLayer) {
- eles.drag.push(ele);
- } else {
- eles.nondrag.push(ele);
+
+ for (var i = 0; i < sizeX; i++) {
+ for (var j = 0; j < sizeY; j++) {
+ grid[i][j] = new Array();
}
}
- // put the grab target nodes last so it's on top of its neighbourhood
- for (var i = 0; i < grabTargets.length; i++) {
- var ele = grabTargets[i];
- eles.drag.push(ele);
- }
-};
-BRp$6.invalidateCachedZSortedEles = function () {
- this.cachedZSortedEles = null;
-};
-BRp$6.getCachedZSortedEles = function (forceRecalc) {
- if (forceRecalc || !this.cachedZSortedEles) {
- var eles = this.cy.mutableElements().toArray();
- eles.sort(zIndexSort);
- eles.interactive = eles.filter(function (ele) {
- return ele.interactive();
- });
- this.cachedZSortedEles = eles;
- this.updateCachedGrabbedEles();
- } else {
- eles = this.cachedZSortedEles;
- }
- return eles;
+ return grid;
};
-var BRp$5 = {};
-[BRp$e, BRp$d, BRp$c, BRp$b, BRp$a, BRp$9, BRp$8, BRp$7, BRp$6].forEach(function (props) {
- extend(BRp$5, props);
-});
+FDLayout.prototype.addNodeToGrid = function (v, left, top) {
-var BRp$4 = {};
-BRp$4.getCachedImage = function (url, crossOrigin, onLoad) {
- var r = this;
- var imageCache = r.imageCache = r.imageCache || {};
- var cache = imageCache[url];
- if (cache) {
- if (!cache.image.complete) {
- cache.image.addEventListener('load', onLoad);
- }
- return cache.image;
- } else {
- cache = imageCache[url] = imageCache[url] || {};
- var image = cache.image = new Image(); // eslint-disable-line no-undef
+ var startX = 0;
+ var finishX = 0;
+ var startY = 0;
+ var finishY = 0;
- image.addEventListener('load', onLoad);
- image.addEventListener('error', function () {
- image.error = true;
- });
+ startX = parseInt(Math.floor((v.getRect().x - left) / this.repulsionRange));
+ finishX = parseInt(Math.floor((v.getRect().width + v.getRect().x - left) / this.repulsionRange));
+ startY = parseInt(Math.floor((v.getRect().y - top) / this.repulsionRange));
+ finishY = parseInt(Math.floor((v.getRect().height + v.getRect().y - top) / this.repulsionRange));
- // #1582 safari doesn't load data uris with crossOrigin properly
- // https://bugs.webkit.org/show_bug.cgi?id=123978
- var dataUriPrefix = 'data:';
- var isDataUri = url.substring(0, dataUriPrefix.length).toLowerCase() === dataUriPrefix;
- if (!isDataUri) {
- // if crossorigin is 'null'(stringified), then manually set it to null
- crossOrigin = crossOrigin === 'null' ? null : crossOrigin;
- image.crossOrigin = crossOrigin; // prevent tainted canvas
+ for (var i = startX; i <= finishX; i++) {
+ for (var j = startY; j <= finishY; j++) {
+ this.grid[i][j].push(v);
+ v.setGridCoordinates(startX, finishX, startY, finishY);
}
-
- image.src = url;
- return image;
}
};
-var BRp$3 = {};
+FDLayout.prototype.updateGrid = function () {
+ var i;
+ var nodeA;
+ var lNodes = this.getAllNodes();
-/* global document, window, ResizeObserver, MutationObserver */
+ this.grid = this.calcGrid(this.graphManager.getRoot());
-BRp$3.registerBinding = function (target, event, handler, useCapture) {
- // eslint-disable-line no-unused-vars
- var args = Array.prototype.slice.apply(arguments, [1]); // copy
- var b = this.binder(target);
- return b.on.apply(b, args);
+ // put all nodes to proper grid cells
+ for (i = 0; i < lNodes.length; i++) {
+ nodeA = lNodes[i];
+ this.addNodeToGrid(nodeA, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
+ }
};
-BRp$3.binder = function (tgt) {
- var r = this;
- var containerWindow = r.cy.window();
- var tgtIsDom = tgt === containerWindow || tgt === containerWindow.document || tgt === containerWindow.document.body || domElement(tgt);
- if (r.supportsPassiveEvents == null) {
- // from https://github.com/WICG/EventListenerOptions/blob/gh-pages/explainer.md#feature-detection
- var supportsPassive = false;
- try {
- var opts = Object.defineProperty({}, 'passive', {
- get: function get() {
- supportsPassive = true;
- return true;
+
+FDLayout.prototype.calculateRepulsionForceOfANode = function (nodeA, processedNodeSet, gridUpdateAllowed, forceToNodeSurroundingUpdate) {
+
+ if (this.totalIterations % FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD == 1 && gridUpdateAllowed || forceToNodeSurroundingUpdate) {
+ var surrounding = new Set();
+ nodeA.surrounding = new Array();
+ var nodeB;
+ var grid = this.grid;
+
+ for (var i = nodeA.startX - 1; i < nodeA.finishX + 2; i++) {
+ for (var j = nodeA.startY - 1; j < nodeA.finishY + 2; j++) {
+ if (!(i < 0 || j < 0 || i >= grid.length || j >= grid[0].length)) {
+ for (var k = 0; k < grid[i][j].length; k++) {
+ nodeB = grid[i][j][k];
+
+ // If both nodes are not members of the same graph,
+ // or both nodes are the same, skip.
+ if (nodeA.getOwner() != nodeB.getOwner() || nodeA == nodeB) {
+ continue;
+ }
+
+ // check if the repulsion force between
+ // nodeA and nodeB has already been calculated
+ if (!processedNodeSet.has(nodeB) && !surrounding.has(nodeB)) {
+ var distanceX = Math.abs(nodeA.getCenterX() - nodeB.getCenterX()) - (nodeA.getWidth() / 2 + nodeB.getWidth() / 2);
+ var distanceY = Math.abs(nodeA.getCenterY() - nodeB.getCenterY()) - (nodeA.getHeight() / 2 + nodeB.getHeight() / 2);
+
+ // if the distance between nodeA and nodeB
+ // is less then calculation range
+ if (distanceX <= this.repulsionRange && distanceY <= this.repulsionRange) {
+ //then add nodeB to surrounding of nodeA
+ surrounding.add(nodeB);
+ }
+ }
+ }
}
- });
- containerWindow.addEventListener('test', null, opts);
- } catch (err) {
- // not supported
+ }
}
- r.supportsPassiveEvents = supportsPassive;
+
+ nodeA.surrounding = [].concat(_toConsumableArray(surrounding));
+ }
+ for (i = 0; i < nodeA.surrounding.length; i++) {
+ this.calcRepulsionForce(nodeA, nodeA.surrounding[i]);
}
- var on = function on(event, handler, useCapture) {
- var args = Array.prototype.slice.call(arguments);
- if (tgtIsDom && r.supportsPassiveEvents) {
- // replace useCapture w/ opts obj
- args[2] = {
- capture: useCapture != null ? useCapture : false,
- passive: false,
- once: false
- };
- }
- r.bindings.push({
- target: tgt,
- args: args
- });
- (tgt.addEventListener || tgt.on).apply(tgt, args);
- return this;
- };
- return {
- on: on,
- addEventListener: on,
- addListener: on,
- bind: on
- };
};
-BRp$3.nodeIsDraggable = function (node) {
- return node && node.isNode() && !node.locked() && node.grabbable();
+
+FDLayout.prototype.calcRepulsionRange = function () {
+ return 0.0;
};
-BRp$3.nodeIsGrabbable = function (node) {
- return this.nodeIsDraggable(node) && node.interactive();
+
+module.exports = FDLayout;
+
+/***/ }),
+/* 19 */
+/***/ (function(module, exports, __nested_webpack_require_103214__) {
+
+"use strict";
+
+
+var LEdge = __nested_webpack_require_103214__(1);
+var FDLayoutConstants = __nested_webpack_require_103214__(4);
+
+function FDLayoutEdge(source, target, vEdge) {
+ LEdge.call(this, source, target, vEdge);
+
+ // Ideal length and elasticity value for this edge
+ this.idealLength = FDLayoutConstants.DEFAULT_EDGE_LENGTH;
+ this.edgeElasticity = FDLayoutConstants.DEFAULT_SPRING_STRENGTH;
+}
+
+FDLayoutEdge.prototype = Object.create(LEdge.prototype);
+
+for (var prop in LEdge) {
+ FDLayoutEdge[prop] = LEdge[prop];
+}
+
+module.exports = FDLayoutEdge;
+
+/***/ }),
+/* 20 */
+/***/ (function(module, exports, __nested_webpack_require_103820__) {
+
+"use strict";
+
+
+var LNode = __nested_webpack_require_103820__(3);
+var FDLayoutConstants = __nested_webpack_require_103820__(4);
+
+function FDLayoutNode(gm, loc, size, vNode) {
+ // alternative constructor is handled inside LNode
+ LNode.call(this, gm, loc, size, vNode);
+
+ // Repulsion value of this node
+ this.nodeRepulsion = FDLayoutConstants.DEFAULT_REPULSION_STRENGTH;
+
+ //Spring, repulsion and gravitational forces acting on this node
+ this.springForceX = 0;
+ this.springForceY = 0;
+ this.repulsionForceX = 0;
+ this.repulsionForceY = 0;
+ this.gravitationForceX = 0;
+ this.gravitationForceY = 0;
+ //Amount by which this node is to be moved in this iteration
+ this.displacementX = 0;
+ this.displacementY = 0;
+
+ //Start and finish grid coordinates that this node is fallen into
+ this.startX = 0;
+ this.finishX = 0;
+ this.startY = 0;
+ this.finishY = 0;
+
+ //Geometric neighbors of this node
+ this.surrounding = [];
+}
+
+FDLayoutNode.prototype = Object.create(LNode.prototype);
+
+for (var prop in LNode) {
+ FDLayoutNode[prop] = LNode[prop];
+}
+
+FDLayoutNode.prototype.setGridCoordinates = function (_startX, _finishX, _startY, _finishY) {
+ this.startX = _startX;
+ this.finishX = _finishX;
+ this.startY = _startY;
+ this.finishY = _finishY;
};
-BRp$3.load = function () {
- var r = this;
- var containerWindow = r.cy.window();
- var isSelected = function isSelected(ele) {
- return ele.selected();
- };
- var triggerEvents = function triggerEvents(target, names, e, position) {
- if (target == null) {
- target = r.cy;
- }
- for (var i = 0; i < names.length; i++) {
- var name = names[i];
- target.emit({
- originalEvent: e,
- type: name,
- position: position
- });
- }
- };
- var isMultSelKeyDown = function isMultSelKeyDown(e) {
- return e.shiftKey || e.metaKey || e.ctrlKey; // maybe e.altKey
- };
- var allowPanningPassthrough = function allowPanningPassthrough(down, downs) {
- var allowPassthrough = true;
- if (r.cy.hasCompoundNodes() && down && down.pannable()) {
- // a grabbable compound node below the ele => no passthrough panning
- for (var i = 0; downs && i < downs.length; i++) {
- var down = downs[i];
+module.exports = FDLayoutNode;
- //if any parent node in event hierarchy isn't pannable, reject passthrough
- if (down.isNode() && down.isParent() && !down.pannable()) {
- allowPassthrough = false;
- break;
- }
- }
- } else {
- allowPassthrough = true;
- }
- return allowPassthrough;
- };
- var setGrabbed = function setGrabbed(ele) {
- ele[0]._private.grabbed = true;
- };
- var setFreed = function setFreed(ele) {
- ele[0]._private.grabbed = false;
- };
- var setInDragLayer = function setInDragLayer(ele) {
- ele[0]._private.rscratch.inDragLayer = true;
- };
- var setOutDragLayer = function setOutDragLayer(ele) {
- ele[0]._private.rscratch.inDragLayer = false;
- };
- var setGrabTarget = function setGrabTarget(ele) {
- ele[0]._private.rscratch.isGrabTarget = true;
- };
- var removeGrabTarget = function removeGrabTarget(ele) {
- ele[0]._private.rscratch.isGrabTarget = false;
- };
- var addToDragList = function addToDragList(ele, opts) {
- var list = opts.addToList;
- var listHasEle = list.has(ele);
- if (!listHasEle && ele.grabbable() && !ele.locked()) {
- list.merge(ele);
- setGrabbed(ele);
- }
- };
+/***/ }),
+/* 21 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+function DimensionD(width, height) {
+ this.width = 0;
+ this.height = 0;
+ if (width !== null && height !== null) {
+ this.height = height;
+ this.width = width;
+ }
+}
- // helper function to determine which child nodes and inner edges
- // of a compound node to be dragged as well as the grabbed and selected nodes
- var addDescendantsToDrag = function addDescendantsToDrag(node, opts) {
- if (!node.cy().hasCompoundNodes()) {
- return;
- }
- if (opts.inDragLayer == null && opts.addToList == null) {
- return;
- } // nothing to do
+DimensionD.prototype.getWidth = function () {
+ return this.width;
+};
- var innerNodes = node.descendants();
- if (opts.inDragLayer) {
- innerNodes.forEach(setInDragLayer);
- innerNodes.connectedEdges().forEach(setInDragLayer);
- }
- if (opts.addToList) {
- addToDragList(innerNodes, opts);
- }
- };
+DimensionD.prototype.setWidth = function (width) {
+ this.width = width;
+};
- // adds the given nodes and its neighbourhood to the drag layer
- var addNodesToDrag = function addNodesToDrag(nodes, opts) {
- opts = opts || {};
- var hasCompoundNodes = nodes.cy().hasCompoundNodes();
- if (opts.inDragLayer) {
- nodes.forEach(setInDragLayer);
- nodes.neighborhood().stdFilter(function (ele) {
- return !hasCompoundNodes || ele.isEdge();
- }).forEach(setInDragLayer);
- }
- if (opts.addToList) {
- nodes.forEach(function (ele) {
- addToDragList(ele, opts);
- });
- }
- addDescendantsToDrag(nodes, opts); // always add to drag
+DimensionD.prototype.getHeight = function () {
+ return this.height;
+};
- // also add nodes and edges related to the topmost ancestor
- updateAncestorsInDragLayer(nodes, {
- inDragLayer: opts.inDragLayer
- });
- r.updateCachedGrabbedEles();
- };
- var addNodeToDrag = addNodesToDrag;
- var freeDraggedElements = function freeDraggedElements(grabbedEles) {
- if (!grabbedEles) {
- return;
- }
+DimensionD.prototype.setHeight = function (height) {
+ this.height = height;
+};
- // just go over all elements rather than doing a bunch of (possibly expensive) traversals
- r.getCachedZSortedEles().forEach(function (ele) {
- setFreed(ele);
- setOutDragLayer(ele);
- removeGrabTarget(ele);
- });
- r.updateCachedGrabbedEles();
- };
+module.exports = DimensionD;
- // helper function to determine which ancestor nodes and edges should go
- // to the drag layer (or should be removed from drag layer).
- var updateAncestorsInDragLayer = function updateAncestorsInDragLayer(node, opts) {
- if (opts.inDragLayer == null && opts.addToList == null) {
- return;
- } // nothing to do
+/***/ }),
+/* 22 */
+/***/ (function(module, exports, __nested_webpack_require_105759__) {
- if (!node.cy().hasCompoundNodes()) {
- return;
- }
+"use strict";
- // find top-level parent
- var parent = node.ancestors().orphans();
- // no parent node: no nodes to add to the drag layer
- if (parent.same(node)) {
- return;
- }
- var nodes = parent.descendants().spawnSelf().merge(parent).unmerge(node).unmerge(node.descendants());
- var edges = nodes.connectedEdges();
- if (opts.inDragLayer) {
- edges.forEach(setInDragLayer);
- nodes.forEach(setInDragLayer);
- }
- if (opts.addToList) {
- nodes.forEach(function (ele) {
- addToDragList(ele, opts);
- });
- }
- };
- var blurActiveDomElement = function blurActiveDomElement() {
- if (document.activeElement != null && document.activeElement.blur != null) {
- document.activeElement.blur();
- }
- };
- var haveMutationsApi = typeof MutationObserver !== 'undefined';
- var haveResizeObserverApi = typeof ResizeObserver !== 'undefined';
+var UniqueIDGeneretor = __nested_webpack_require_105759__(14);
- // watch for when the cy container is removed from the dom
- if (haveMutationsApi) {
- r.removeObserver = new MutationObserver(function (mutns) {
- // eslint-disable-line no-undef
- for (var i = 0; i < mutns.length; i++) {
- var mutn = mutns[i];
- var rNodes = mutn.removedNodes;
- if (rNodes) {
- for (var j = 0; j < rNodes.length; j++) {
- var rNode = rNodes[j];
- if (rNode === r.container) {
- r.destroy();
- break;
- }
- }
- }
- }
- });
- if (r.container.parentNode) {
- r.removeObserver.observe(r.container.parentNode, {
- childList: true
- });
- }
- } else {
- r.registerBinding(r.container, 'DOMNodeRemoved', function (e) {
- // eslint-disable-line no-unused-vars
- r.destroy();
- });
- }
- var onResize = debounce__default["default"](function () {
- r.cy.resize();
- }, 100);
- if (haveMutationsApi) {
- r.styleObserver = new MutationObserver(onResize); // eslint-disable-line no-undef
+function HashMap() {
+ this.map = {};
+ this.keys = [];
+}
- r.styleObserver.observe(r.container, {
- attributes: true
- });
+HashMap.prototype.put = function (key, value) {
+ var theId = UniqueIDGeneretor.createID(key);
+ if (!this.contains(theId)) {
+ this.map[theId] = value;
+ this.keys.push(key);
}
+};
- // auto resize
- r.registerBinding(containerWindow, 'resize', onResize); // eslint-disable-line no-undef
+HashMap.prototype.contains = function (key) {
+ var theId = UniqueIDGeneretor.createID(key);
+ return this.map[key] != null;
+};
- if (haveResizeObserverApi) {
- r.resizeObserver = new ResizeObserver(onResize); // eslint-disable-line no-undef
+HashMap.prototype.get = function (key) {
+ var theId = UniqueIDGeneretor.createID(key);
+ return this.map[theId];
+};
- r.resizeObserver.observe(r.container);
- }
- var forEachUp = function forEachUp(domEle, fn) {
- while (domEle != null) {
- fn(domEle);
- domEle = domEle.parentNode;
- }
- };
- var invalidateCoords = function invalidateCoords() {
- r.invalidateContainerClientCoordsCache();
- };
- forEachUp(r.container, function (domEle) {
- r.registerBinding(domEle, 'transitionend', invalidateCoords);
- r.registerBinding(domEle, 'animationend', invalidateCoords);
- r.registerBinding(domEle, 'scroll', invalidateCoords);
- });
+HashMap.prototype.keySet = function () {
+ return this.keys;
+};
- // stop right click menu from appearing on cy
- r.registerBinding(r.container, 'contextmenu', function (e) {
- e.preventDefault();
- });
- var inBoxSelection = function inBoxSelection() {
- return r.selection[4] !== 0;
- };
- var eventInContainer = function eventInContainer(e) {
- // save cycles if mouse events aren't to be captured
- var containerPageCoords = r.findContainerClientCoords();
- var x = containerPageCoords[0];
- var y = containerPageCoords[1];
- var width = containerPageCoords[2];
- var height = containerPageCoords[3];
- var positions = e.touches ? e.touches : [e];
- var atLeastOnePosInside = false;
- for (var i = 0; i < positions.length; i++) {
- var p = positions[i];
- if (x <= p.clientX && p.clientX <= x + width && y <= p.clientY && p.clientY <= y + height) {
- atLeastOnePosInside = true;
- break;
- }
- }
- if (!atLeastOnePosInside) {
- return false;
- }
- var container = r.container;
- var target = e.target;
- var tParent = target.parentNode;
- var containerIsTarget = false;
- while (tParent) {
- if (tParent === container) {
- containerIsTarget = true;
- break;
- }
- tParent = tParent.parentNode;
- }
- if (!containerIsTarget) {
- return false;
- } // if target is outisde cy container, then this event is not for us
+module.exports = HashMap;
- return true;
- };
+/***/ }),
+/* 23 */
+/***/ (function(module, exports, __nested_webpack_require_106487__) {
- // Primary key
- r.registerBinding(r.container, 'mousedown', function mousedownHandler(e) {
- if (!eventInContainer(e)) {
- return;
- }
- e.preventDefault();
- blurActiveDomElement();
- r.hoverData.capture = true;
- r.hoverData.which = e.which;
- var cy = r.cy;
- var gpos = [e.clientX, e.clientY];
- var pos = r.projectIntoViewport(gpos[0], gpos[1]);
- var select = r.selection;
- var nears = r.findNearestElements(pos[0], pos[1], true, false);
- var near = nears[0];
- var draggedElements = r.dragData.possibleDragElements;
- r.hoverData.mdownPos = pos;
- r.hoverData.mdownGPos = gpos;
- var checkForTaphold = function checkForTaphold() {
- r.hoverData.tapholdCancelled = false;
- clearTimeout(r.hoverData.tapholdTimeout);
- r.hoverData.tapholdTimeout = setTimeout(function () {
- if (r.hoverData.tapholdCancelled) {
- return;
- } else {
- var ele = r.hoverData.down;
- if (ele) {
- ele.emit({
- originalEvent: e,
- type: 'taphold',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- } else {
- cy.emit({
- originalEvent: e,
- type: 'taphold',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }
- }
- }, r.tapholdDuration);
- };
+"use strict";
- // Right click button
- if (e.which == 3) {
- r.hoverData.cxtStarted = true;
- var cxtEvt = {
- originalEvent: e,
- type: 'cxttapstart',
- position: {
- x: pos[0],
- y: pos[1]
- }
- };
- if (near) {
- near.activate();
- near.emit(cxtEvt);
- r.hoverData.down = near;
- } else {
- cy.emit(cxtEvt);
- }
- r.hoverData.downTime = new Date().getTime();
- r.hoverData.cxtDragged = false;
- // Primary button
- } else if (e.which == 1) {
- if (near) {
- near.activate();
- }
+var UniqueIDGeneretor = __nested_webpack_require_106487__(14);
- // Element dragging
- {
- // If something is under the cursor and it is draggable, prepare to grab it
- if (near != null) {
- if (r.nodeIsGrabbable(near)) {
- var makeEvent = function makeEvent(type) {
- return {
- originalEvent: e,
- type: type,
- position: {
- x: pos[0],
- y: pos[1]
- }
- };
- };
- var triggerGrab = function triggerGrab(ele) {
- ele.emit(makeEvent('grab'));
- };
- setGrabTarget(near);
- if (!near.selected()) {
- draggedElements = r.dragData.possibleDragElements = cy.collection();
- addNodeToDrag(near, {
- addToList: draggedElements
- });
- near.emit(makeEvent('grabon')).emit(makeEvent('grab'));
- } else {
- draggedElements = r.dragData.possibleDragElements = cy.collection();
- var selectedNodes = cy.$(function (ele) {
- return ele.isNode() && ele.selected() && r.nodeIsGrabbable(ele);
- });
- addNodesToDrag(selectedNodes, {
- addToList: draggedElements
- });
- near.emit(makeEvent('grabon'));
- selectedNodes.forEach(triggerGrab);
- }
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- }
- }
- r.hoverData.down = near;
- r.hoverData.downs = nears;
- r.hoverData.downTime = new Date().getTime();
- }
- triggerEvents(near, ['mousedown', 'tapstart', 'vmousedown'], e, {
- x: pos[0],
- y: pos[1]
- });
- if (near == null) {
- select[4] = 1;
- r.data.bgActivePosistion = {
- x: pos[0],
- y: pos[1]
- };
- r.redrawHint('select', true);
- r.redraw();
- } else if (near.pannable()) {
- select[4] = 1; // for future pan
- }
+function HashSet() {
+ this.set = {};
+}
+;
- checkForTaphold();
- }
+HashSet.prototype.add = function (obj) {
+ var theId = UniqueIDGeneretor.createID(obj);
+ if (!this.contains(theId)) this.set[theId] = obj;
+};
- // Initialize selection box coordinates
- select[0] = select[2] = pos[0];
- select[1] = select[3] = pos[1];
- }, false);
- r.registerBinding(containerWindow, 'mousemove', function mousemoveHandler(e) {
- // eslint-disable-line no-undef
- var capture = r.hoverData.capture;
- if (!capture && !eventInContainer(e)) {
- return;
- }
- var preventDefault = false;
- var cy = r.cy;
- var zoom = cy.zoom();
- var gpos = [e.clientX, e.clientY];
- var pos = r.projectIntoViewport(gpos[0], gpos[1]);
- var mdownPos = r.hoverData.mdownPos;
- var mdownGPos = r.hoverData.mdownGPos;
- var select = r.selection;
- var near = null;
- if (!r.hoverData.draggingEles && !r.hoverData.dragging && !r.hoverData.selecting) {
- near = r.findNearestElement(pos[0], pos[1], true, false);
- }
- var last = r.hoverData.last;
- var down = r.hoverData.down;
- var disp = [pos[0] - select[2], pos[1] - select[3]];
- var draggedElements = r.dragData.possibleDragElements;
- var isOverThresholdDrag;
- if (mdownGPos) {
- var dx = gpos[0] - mdownGPos[0];
- var dx2 = dx * dx;
- var dy = gpos[1] - mdownGPos[1];
- var dy2 = dy * dy;
- var dist2 = dx2 + dy2;
- r.hoverData.isOverThresholdDrag = isOverThresholdDrag = dist2 >= r.desktopTapThreshold2;
- }
- var multSelKeyDown = isMultSelKeyDown(e);
- if (isOverThresholdDrag) {
- r.hoverData.tapholdCancelled = true;
- }
- var updateDragDelta = function updateDragDelta() {
- var dragDelta = r.hoverData.dragDelta = r.hoverData.dragDelta || [];
- if (dragDelta.length === 0) {
- dragDelta.push(disp[0]);
- dragDelta.push(disp[1]);
- } else {
- dragDelta[0] += disp[0];
- dragDelta[1] += disp[1];
- }
- };
- preventDefault = true;
- triggerEvents(near, ['mousemove', 'vmousemove', 'tapdrag'], e, {
- x: pos[0],
- y: pos[1]
- });
- var goIntoBoxMode = function goIntoBoxMode() {
- r.data.bgActivePosistion = undefined;
- if (!r.hoverData.selecting) {
- cy.emit({
- originalEvent: e,
- type: 'boxstart',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }
- select[4] = 1;
- r.hoverData.selecting = true;
- r.redrawHint('select', true);
- r.redraw();
- };
+HashSet.prototype.remove = function (obj) {
+ delete this.set[UniqueIDGeneretor.createID(obj)];
+};
- // trigger context drag if rmouse down
- if (r.hoverData.which === 3) {
- // but only if over threshold
- if (isOverThresholdDrag) {
- var cxtEvt = {
- originalEvent: e,
- type: 'cxtdrag',
- position: {
- x: pos[0],
- y: pos[1]
- }
- };
- if (down) {
- down.emit(cxtEvt);
- } else {
- cy.emit(cxtEvt);
- }
- r.hoverData.cxtDragged = true;
- if (!r.hoverData.cxtOver || near !== r.hoverData.cxtOver) {
- if (r.hoverData.cxtOver) {
- r.hoverData.cxtOver.emit({
- originalEvent: e,
- type: 'cxtdragout',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }
- r.hoverData.cxtOver = near;
- if (near) {
- near.emit({
- originalEvent: e,
- type: 'cxtdragover',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }
- }
- }
+HashSet.prototype.clear = function () {
+ this.set = {};
+};
+
+HashSet.prototype.contains = function (obj) {
+ return this.set[UniqueIDGeneretor.createID(obj)] == obj;
+};
+
+HashSet.prototype.isEmpty = function () {
+ return this.size() === 0;
+};
+
+HashSet.prototype.size = function () {
+ return Object.keys(this.set).length;
+};
+
+//concats this.set to the given list
+HashSet.prototype.addAllTo = function (list) {
+ var keys = Object.keys(this.set);
+ var length = keys.length;
+ for (var i = 0; i < length; i++) {
+ list.push(this.set[keys[i]]);
+ }
+};
- // Check if we are drag panning the entire graph
- } else if (r.hoverData.dragging) {
- preventDefault = true;
- if (cy.panningEnabled() && cy.userPanningEnabled()) {
- var deltaP;
- if (r.hoverData.justStartedPan) {
- var mdPos = r.hoverData.mdownPos;
- deltaP = {
- x: (pos[0] - mdPos[0]) * zoom,
- y: (pos[1] - mdPos[1]) * zoom
- };
- r.hoverData.justStartedPan = false;
- } else {
- deltaP = {
- x: disp[0] * zoom,
- y: disp[1] * zoom
- };
- }
- cy.panBy(deltaP);
- cy.emit('dragpan');
- r.hoverData.dragged = true;
- }
+HashSet.prototype.size = function () {
+ return Object.keys(this.set).length;
+};
- // Needs reproject due to pan changing viewport
- pos = r.projectIntoViewport(e.clientX, e.clientY);
+HashSet.prototype.addAll = function (list) {
+ var s = list.length;
+ for (var i = 0; i < s; i++) {
+ var v = list[i];
+ this.add(v);
+ }
+};
- // Checks primary button down & out of time & mouse not moved much
- } else if (select[4] == 1 && (down == null || down.pannable())) {
- if (isOverThresholdDrag) {
- if (!r.hoverData.dragging && cy.boxSelectionEnabled() && (multSelKeyDown || !cy.panningEnabled() || !cy.userPanningEnabled())) {
- goIntoBoxMode();
- } else if (!r.hoverData.selecting && cy.panningEnabled() && cy.userPanningEnabled()) {
- var allowPassthrough = allowPanningPassthrough(down, r.hoverData.downs);
- if (allowPassthrough) {
- r.hoverData.dragging = true;
- r.hoverData.justStartedPan = true;
- select[4] = 0;
- r.data.bgActivePosistion = array2point(mdownPos);
- r.redrawHint('select', true);
- r.redraw();
- }
- }
- if (down && down.pannable() && down.active()) {
- down.unactivate();
- }
- }
- } else {
- if (down && down.pannable() && down.active()) {
- down.unactivate();
- }
- if ((!down || !down.grabbed()) && near != last) {
- if (last) {
- triggerEvents(last, ['mouseout', 'tapdragout'], e, {
- x: pos[0],
- y: pos[1]
- });
- }
- if (near) {
- triggerEvents(near, ['mouseover', 'tapdragover'], e, {
- x: pos[0],
- y: pos[1]
- });
- }
- r.hoverData.last = near;
- }
- if (down) {
- if (isOverThresholdDrag) {
- // then we can take action
+module.exports = HashSet;
- if (cy.boxSelectionEnabled() && multSelKeyDown) {
- // then selection overrides
- if (down && down.grabbed()) {
- freeDraggedElements(draggedElements);
- down.emit('freeon');
- draggedElements.emit('free');
- if (r.dragData.didDrag) {
- down.emit('dragfreeon');
- draggedElements.emit('dragfree');
- }
- }
- goIntoBoxMode();
- } else if (down && down.grabbed() && r.nodeIsDraggable(down)) {
- // drag node
- var justStartedDrag = !r.dragData.didDrag;
- if (justStartedDrag) {
- r.redrawHint('eles', true);
- }
- r.dragData.didDrag = true; // indicate that we actually did drag the node
+/***/ }),
+/* 24 */
+/***/ (function(module, exports, __webpack_require__) {
- // now, add the elements to the drag layer if not done already
- if (!r.hoverData.draggingEles) {
- addNodesToDrag(draggedElements, {
- inDragLayer: true
- });
- }
- var totalShift = {
- x: 0,
- y: 0
- };
- if (number$1(disp[0]) && number$1(disp[1])) {
- totalShift.x += disp[0];
- totalShift.y += disp[1];
- if (justStartedDrag) {
- var dragDelta = r.hoverData.dragDelta;
- if (dragDelta && number$1(dragDelta[0]) && number$1(dragDelta[1])) {
- totalShift.x += dragDelta[0];
- totalShift.y += dragDelta[1];
- }
- }
- }
- r.hoverData.draggingEles = true;
- draggedElements.silentShift(totalShift).emit('position drag');
- r.redrawHint('drag', true);
- r.redraw();
- }
- } else {
- // otherwise save drag delta for when we actually start dragging so the relative grab pos is constant
- updateDragDelta();
- }
- }
+"use strict";
- // prevent the dragging from triggering text selection on the page
- preventDefault = true;
- }
- select[2] = pos[0];
- select[3] = pos[1];
- if (preventDefault) {
- if (e.stopPropagation) e.stopPropagation();
- if (e.preventDefault) e.preventDefault();
- return false;
- }
- }, false);
- var clickTimeout, didDoubleClick, prevClickTimeStamp;
- r.registerBinding(containerWindow, 'mouseup', function mouseupHandler(e) {
- // eslint-disable-line no-undef
- var capture = r.hoverData.capture;
- if (!capture) {
- return;
- }
- r.hoverData.capture = false;
- var cy = r.cy;
- var pos = r.projectIntoViewport(e.clientX, e.clientY);
- var select = r.selection;
- var near = r.findNearestElement(pos[0], pos[1], true, false);
- var draggedElements = r.dragData.possibleDragElements;
- var down = r.hoverData.down;
- var multSelKeyDown = isMultSelKeyDown(e);
- if (r.data.bgActivePosistion) {
- r.redrawHint('select', true);
- r.redraw();
+
+// Some matrix (1d and 2d array) operations
+function Matrix() {}
+
+/**
+ * matrix multiplication
+ * array1, array2 and result are 2d arrays
+ */
+Matrix.multMat = function (array1, array2) {
+ var result = [];
+
+ for (var i = 0; i < array1.length; i++) {
+ result[i] = [];
+ for (var j = 0; j < array2[0].length; j++) {
+ result[i][j] = 0;
+ for (var k = 0; k < array1[0].length; k++) {
+ result[i][j] += array1[i][k] * array2[k][j];
+ }
}
- r.hoverData.tapholdCancelled = true;
- r.data.bgActivePosistion = undefined; // not active bg now
+ }
+ return result;
+};
- if (down) {
- down.unactivate();
+/**
+ * matrix transpose
+ * array and result are 2d arrays
+ */
+Matrix.transpose = function (array) {
+ var result = [];
+
+ for (var i = 0; i < array[0].length; i++) {
+ result[i] = [];
+ for (var j = 0; j < array.length; j++) {
+ result[i][j] = array[j][i];
}
- if (r.hoverData.which === 3) {
- var cxtEvt = {
- originalEvent: e,
- type: 'cxttapend',
- position: {
- x: pos[0],
- y: pos[1]
- }
- };
- if (down) {
- down.emit(cxtEvt);
- } else {
- cy.emit(cxtEvt);
- }
- if (!r.hoverData.cxtDragged) {
- var cxtTap = {
- originalEvent: e,
- type: 'cxttap',
- position: {
- x: pos[0],
- y: pos[1]
- }
- };
- if (down) {
- down.emit(cxtTap);
- } else {
- cy.emit(cxtTap);
- }
- }
- r.hoverData.cxtDragged = false;
- r.hoverData.which = null;
- } else if (r.hoverData.which === 1) {
- triggerEvents(near, ['mouseup', 'tapend', 'vmouseup'], e, {
- x: pos[0],
- y: pos[1]
- });
- if (!r.dragData.didDrag &&
- // didn't move a node around
- !r.hoverData.dragged &&
- // didn't pan
- !r.hoverData.selecting &&
- // not box selection
- !r.hoverData.isOverThresholdDrag // didn't move too much
- ) {
- triggerEvents(down, ["click", "tap", "vclick"], e, {
- x: pos[0],
- y: pos[1]
- });
- didDoubleClick = false;
- if (e.timeStamp - prevClickTimeStamp <= cy.multiClickDebounceTime()) {
- clickTimeout && clearTimeout(clickTimeout);
- didDoubleClick = true;
- prevClickTimeStamp = null;
- triggerEvents(down, ["dblclick", "dbltap", "vdblclick"], e, {
- x: pos[0],
- y: pos[1]
- });
- } else {
- clickTimeout = setTimeout(function () {
- if (didDoubleClick) return;
- triggerEvents(down, ["oneclick", "onetap", "voneclick"], e, {
- x: pos[0],
- y: pos[1]
- });
- }, cy.multiClickDebounceTime());
- prevClickTimeStamp = e.timeStamp;
- }
- }
+ }
- // Deselect all elements if nothing is currently under the mouse cursor and we aren't dragging something
- if (down == null // not mousedown on node
- && !r.dragData.didDrag // didn't move the node around
- && !r.hoverData.selecting // not box selection
- && !r.hoverData.dragged // didn't pan
- && !isMultSelKeyDown(e)) {
- cy.$(isSelected).unselect(['tapunselect']);
- if (draggedElements.length > 0) {
- r.redrawHint('eles', true);
- }
- r.dragData.possibleDragElements = draggedElements = cy.collection();
- }
+ return result;
+};
- // Single selection
- if (near == down && !r.dragData.didDrag && !r.hoverData.selecting) {
- if (near != null && near._private.selectable) {
- if (r.hoverData.dragging) ; else if (cy.selectionType() === 'additive' || multSelKeyDown) {
- if (near.selected()) {
- near.unselect(['tapunselect']);
- } else {
- near.select(['tapselect']);
- }
- } else {
- if (!multSelKeyDown) {
- cy.$(isSelected).unmerge(near).unselect(['tapunselect']);
- near.select(['tapselect']);
- }
- }
- r.redrawHint('eles', true);
- }
- }
- if (r.hoverData.selecting) {
- var box = cy.collection(r.getAllInBox(select[0], select[1], select[2], select[3]));
- r.redrawHint('select', true);
- if (box.length > 0) {
- r.redrawHint('eles', true);
- }
- cy.emit({
- type: 'boxend',
- originalEvent: e,
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- var eleWouldBeSelected = function eleWouldBeSelected(ele) {
- return ele.selectable() && !ele.selected();
- };
- if (cy.selectionType() === 'additive') {
- box.emit('box').stdFilter(eleWouldBeSelected).select().emit('boxselect');
- } else {
- if (!multSelKeyDown) {
- cy.$(isSelected).unmerge(box).unselect();
- }
- box.emit('box').stdFilter(eleWouldBeSelected).select().emit('boxselect');
- }
+/**
+ * multiply array with constant
+ * array and result are 1d arrays
+ */
+Matrix.multCons = function (array, constant) {
+ var result = [];
- // always need redraw in case eles unselectable
- r.redraw();
- }
+ for (var i = 0; i < array.length; i++) {
+ result[i] = array[i] * constant;
+ }
- // Cancel drag pan
- if (r.hoverData.dragging) {
- r.hoverData.dragging = false;
- r.redrawHint('select', true);
- r.redrawHint('eles', true);
- r.redraw();
- }
- if (!select[4]) {
- r.redrawHint('drag', true);
- r.redrawHint('eles', true);
- var downWasGrabbed = down && down.grabbed();
- freeDraggedElements(draggedElements);
- if (downWasGrabbed) {
- down.emit('freeon');
- draggedElements.emit('free');
- if (r.dragData.didDrag) {
- down.emit('dragfreeon');
- draggedElements.emit('dragfree');
- }
- }
- }
- } // else not right mouse
+ return result;
+};
- select[4] = 0;
- r.hoverData.down = null;
- r.hoverData.cxtStarted = false;
- r.hoverData.draggingEles = false;
- r.hoverData.selecting = false;
- r.hoverData.isOverThresholdDrag = false;
- r.dragData.didDrag = false;
- r.hoverData.dragged = false;
- r.hoverData.dragDelta = [];
- r.hoverData.mdownPos = null;
- r.hoverData.mdownGPos = null;
- }, false);
- var wheelHandler = function wheelHandler(e) {
- if (r.scrollingPage) {
- return;
- } // while scrolling, ignore wheel-to-zoom
+/**
+ * substract two arrays
+ * array1, array2 and result are 1d arrays
+ */
+Matrix.minusOp = function (array1, array2) {
+ var result = [];
- var cy = r.cy;
- var zoom = cy.zoom();
- var pan = cy.pan();
- var pos = r.projectIntoViewport(e.clientX, e.clientY);
- var rpos = [pos[0] * zoom + pan.x, pos[1] * zoom + pan.y];
- if (r.hoverData.draggingEles || r.hoverData.dragging || r.hoverData.cxtStarted || inBoxSelection()) {
- // if pan dragging or cxt dragging, wheel movements make no zoom
- e.preventDefault();
- return;
+ for (var i = 0; i < array1.length; i++) {
+ result[i] = array1[i] - array2[i];
+ }
+
+ return result;
+};
+
+/**
+ * dot product of two arrays with same size
+ * array1 and array2 are 1d arrays
+ */
+Matrix.dotProduct = function (array1, array2) {
+ var product = 0;
+
+ for (var i = 0; i < array1.length; i++) {
+ product += array1[i] * array2[i];
+ }
+
+ return product;
+};
+
+/**
+ * magnitude of an array
+ * array is 1d array
+ */
+Matrix.mag = function (array) {
+ return Math.sqrt(this.dotProduct(array, array));
+};
+
+/**
+ * normalization of an array
+ * array and result are 1d array
+ */
+Matrix.normalize = function (array) {
+ var result = [];
+ var magnitude = this.mag(array);
+
+ for (var i = 0; i < array.length; i++) {
+ result[i] = array[i] / magnitude;
+ }
+
+ return result;
+};
+
+/**
+ * multiply an array with centering matrix
+ * array and result are 1d array
+ */
+Matrix.multGamma = function (array) {
+ var result = [];
+ var sum = 0;
+
+ for (var i = 0; i < array.length; i++) {
+ sum += array[i];
+ }
+
+ sum *= -1 / array.length;
+
+ for (var _i = 0; _i < array.length; _i++) {
+ result[_i] = sum + array[_i];
+ }
+ return result;
+};
+
+/**
+ * a special matrix multiplication
+ * result = 0.5 * C * INV * C^T * array
+ * array and result are 1d, C and INV are 2d arrays
+ */
+Matrix.multL = function (array, C, INV) {
+ var result = [];
+ var temp1 = [];
+ var temp2 = [];
+
+ // multiply by C^T
+ for (var i = 0; i < C[0].length; i++) {
+ var sum = 0;
+ for (var j = 0; j < C.length; j++) {
+ sum += -0.5 * C[j][i] * array[j];
}
- if (cy.panningEnabled() && cy.userPanningEnabled() && cy.zoomingEnabled() && cy.userZoomingEnabled()) {
- e.preventDefault();
- r.data.wheelZooming = true;
- clearTimeout(r.data.wheelTimeout);
- r.data.wheelTimeout = setTimeout(function () {
- r.data.wheelZooming = false;
- r.redrawHint('eles', true);
- r.redraw();
- }, 150);
- var diff;
- if (e.deltaY != null) {
- diff = e.deltaY / -250;
- } else if (e.wheelDeltaY != null) {
- diff = e.wheelDeltaY / 1000;
- } else {
- diff = e.wheelDelta / 1000;
- }
- diff = diff * r.wheelSensitivity;
- var needsWheelFix = e.deltaMode === 1;
- if (needsWheelFix) {
- // fixes slow wheel events on ff/linux and ff/windows
- diff *= 33;
- }
- var newZoom = cy.zoom() * Math.pow(10, diff);
- if (e.type === 'gesturechange') {
- newZoom = r.gestureStartZoom * e.scale;
- }
- cy.zoom({
- level: newZoom,
- renderedPosition: {
- x: rpos[0],
- y: rpos[1]
- }
- });
- cy.emit(e.type === 'gesturechange' ? 'pinchzoom' : 'scrollzoom');
+ temp1[i] = sum;
+ }
+ // multiply the result by INV
+ for (var _i2 = 0; _i2 < INV.length; _i2++) {
+ var _sum = 0;
+ for (var _j = 0; _j < INV.length; _j++) {
+ _sum += INV[_i2][_j] * temp1[_j];
}
- };
+ temp2[_i2] = _sum;
+ }
+ // multiply the result by C
+ for (var _i3 = 0; _i3 < C.length; _i3++) {
+ var _sum2 = 0;
+ for (var _j2 = 0; _j2 < C[0].length; _j2++) {
+ _sum2 += C[_i3][_j2] * temp2[_j2];
+ }
+ result[_i3] = _sum2;
+ }
- // Functions to help with whether mouse wheel should trigger zooming
- // --
- r.registerBinding(r.container, 'wheel', wheelHandler, true);
+ return result;
+};
- // disable nonstandard wheel events
- // r.registerBinding(r.container, 'mousewheel', wheelHandler, true);
- // r.registerBinding(r.container, 'DOMMouseScroll', wheelHandler, true);
- // r.registerBinding(r.container, 'MozMousePixelScroll', wheelHandler, true); // older firefox
+module.exports = Matrix;
- r.registerBinding(containerWindow, 'scroll', function scrollHandler(e) {
- // eslint-disable-line no-unused-vars
- r.scrollingPage = true;
- clearTimeout(r.scrollingPageTimeout);
- r.scrollingPageTimeout = setTimeout(function () {
- r.scrollingPage = false;
- }, 250);
- }, true);
+/***/ }),
+/* 25 */
+/***/ (function(module, exports, __nested_webpack_require_111039__) {
- // desktop safari pinch to zoom start
- r.registerBinding(r.container, 'gesturestart', function gestureStartHandler(e) {
- r.gestureStartZoom = r.cy.zoom();
- if (!r.hasTouchStarted) {
- // don't affect touch devices like iphone
- e.preventDefault();
- }
- }, true);
- r.registerBinding(r.container, 'gesturechange', function (e) {
- if (!r.hasTouchStarted) {
- // don't affect touch devices like iphone
- wheelHandler(e);
- }
- }, true);
+"use strict";
- // Functions to help with handling mouseout/mouseover on the Cytoscape container
- // Handle mouseout on Cytoscape container
- r.registerBinding(r.container, 'mouseout', function mouseOutHandler(e) {
- var pos = r.projectIntoViewport(e.clientX, e.clientY);
- r.cy.emit({
- originalEvent: e,
- type: 'mouseout',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }, false);
- r.registerBinding(r.container, 'mouseover', function mouseOverHandler(e) {
- var pos = r.projectIntoViewport(e.clientX, e.clientY);
- r.cy.emit({
- originalEvent: e,
- type: 'mouseover',
- position: {
- x: pos[0],
- y: pos[1]
- }
- });
- }, false);
- var f1x1, f1y1, f2x1, f2y1; // starting points for pinch-to-zoom
- var distance1, distance1Sq; // initial distance between finger 1 and finger 2 for pinch-to-zoom
- var center1, modelCenter1; // center point on start pinch to zoom
- var offsetLeft, offsetTop;
- var containerWidth, containerHeight;
- var twoFingersStartInside;
- var distance = function distance(x1, y1, x2, y2) {
- return Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
- };
- var distanceSq = function distanceSq(x1, y1, x2, y2) {
- return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
- };
- var touchstartHandler;
- r.registerBinding(r.container, 'touchstart', touchstartHandler = function touchstartHandler(e) {
- r.hasTouchStarted = true;
- if (!eventInContainer(e)) {
- return;
- }
- blurActiveDomElement();
- r.touchData.capture = true;
- r.data.bgActivePosistion = undefined;
- var cy = r.cy;
- var now = r.touchData.now;
- var earlier = r.touchData.earlier;
- if (e.touches[0]) {
- var pos = r.projectIntoViewport(e.touches[0].clientX, e.touches[0].clientY);
- now[0] = pos[0];
- now[1] = pos[1];
- }
- if (e.touches[1]) {
- var pos = r.projectIntoViewport(e.touches[1].clientX, e.touches[1].clientY);
- now[2] = pos[0];
- now[3] = pos[1];
- }
- if (e.touches[2]) {
- var pos = r.projectIntoViewport(e.touches[2].clientX, e.touches[2].clientY);
- now[4] = pos[0];
- now[5] = pos[1];
- }
- // record starting points for pinch-to-zoom
- if (e.touches[1]) {
- r.touchData.singleTouchMoved = true;
- freeDraggedElements(r.dragData.touchDragEles);
- var offsets = r.findContainerClientCoords();
- offsetLeft = offsets[0];
- offsetTop = offsets[1];
- containerWidth = offsets[2];
- containerHeight = offsets[3];
- f1x1 = e.touches[0].clientX - offsetLeft;
- f1y1 = e.touches[0].clientY - offsetTop;
- f2x1 = e.touches[1].clientX - offsetLeft;
- f2y1 = e.touches[1].clientY - offsetTop;
- twoFingersStartInside = 0 <= f1x1 && f1x1 <= containerWidth && 0 <= f2x1 && f2x1 <= containerWidth && 0 <= f1y1 && f1y1 <= containerHeight && 0 <= f2y1 && f2y1 <= containerHeight;
- var pan = cy.pan();
- var zoom = cy.zoom();
- distance1 = distance(f1x1, f1y1, f2x1, f2y1);
- distance1Sq = distanceSq(f1x1, f1y1, f2x1, f2y1);
- center1 = [(f1x1 + f2x1) / 2, (f1y1 + f2y1) / 2];
- modelCenter1 = [(center1[0] - pan.x) / zoom, (center1[1] - pan.y) / zoom];
+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; }; }();
- // consider context tap
- var cxtDistThreshold = 200;
- var cxtDistThresholdSq = cxtDistThreshold * cxtDistThreshold;
- if (distance1Sq < cxtDistThresholdSq && !e.touches[2]) {
- var near1 = r.findNearestElement(now[0], now[1], true, true);
- var near2 = r.findNearestElement(now[2], now[3], true, true);
- if (near1 && near1.isNode()) {
- near1.activate().emit({
- originalEvent: e,
- type: 'cxttapstart',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- r.touchData.start = near1;
- } else if (near2 && near2.isNode()) {
- near2.activate().emit({
- originalEvent: e,
- type: 'cxttapstart',
- position: {
- x: now[0],
- y: now[1]
+function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+
+/**
+ * A classic Quicksort algorithm with Hoare's partition
+ * - Works also on LinkedList objects
+ *
+ * Copyright: i-Vis Research Group, Bilkent University, 2007 - present
+ */
+
+var LinkedList = __nested_webpack_require_111039__(11);
+
+var Quicksort = function () {
+ function Quicksort(A, compareFunction) {
+ _classCallCheck(this, Quicksort);
+
+ if (compareFunction !== null || compareFunction !== undefined) this.compareFunction = this._defaultCompareFunction;
+
+ var length = void 0;
+ if (A instanceof LinkedList) length = A.size();else length = A.length;
+
+ this._quicksort(A, 0, length - 1);
+ }
+
+ _createClass(Quicksort, [{
+ key: '_quicksort',
+ value: function _quicksort(A, p, r) {
+ if (p < r) {
+ var q = this._partition(A, p, r);
+ this._quicksort(A, p, q);
+ this._quicksort(A, q + 1, r);
}
- });
- r.touchData.start = near2;
- } else {
- cy.emit({
- originalEvent: e,
- type: 'cxttapstart',
- position: {
- x: now[0],
- y: now[1]
+ }
+ }, {
+ key: '_partition',
+ value: function _partition(A, p, r) {
+ var x = this._get(A, p);
+ var i = p;
+ var j = r;
+ while (true) {
+ while (this.compareFunction(x, this._get(A, j))) {
+ j--;
+ }while (this.compareFunction(this._get(A, i), x)) {
+ i++;
+ }if (i < j) {
+ this._swap(A, i, j);
+ i++;
+ j--;
+ } else return j;
}
- });
}
- if (r.touchData.start) {
- r.touchData.start._private.grabbed = false;
+ }, {
+ key: '_get',
+ value: function _get(object, index) {
+ if (object instanceof LinkedList) return object.get_object_at(index);else return object[index];
}
- r.touchData.cxt = true;
- r.touchData.cxtDragged = false;
- r.data.bgActivePosistion = undefined;
- r.redraw();
- return;
- }
- }
- if (e.touches[2]) {
- // ignore
+ }, {
+ key: '_set',
+ value: function _set(object, index, value) {
+ if (object instanceof LinkedList) object.set_object_at(index, value);else object[index] = value;
+ }
+ }, {
+ key: '_swap',
+ value: function _swap(A, i, j) {
+ var temp = this._get(A, i);
+ this._set(A, i, this._get(A, j));
+ this._set(A, j, temp);
+ }
+ }, {
+ key: '_defaultCompareFunction',
+ value: function _defaultCompareFunction(a, b) {
+ return b > a;
+ }
+ }]);
- // safari on ios pans the page otherwise (normally you should be able to preventdefault on touchmove...)
- if (cy.boxSelectionEnabled()) {
- e.preventDefault();
- }
- } else if (e.touches[1]) ; else if (e.touches[0]) {
- var nears = r.findNearestElements(now[0], now[1], true, true);
- var near = nears[0];
- if (near != null) {
- near.activate();
- r.touchData.start = near;
- r.touchData.starts = nears;
- if (r.nodeIsGrabbable(near)) {
- var draggedEles = r.dragData.touchDragEles = cy.collection();
- var selectedNodes = null;
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- if (near.selected()) {
- // reset drag elements, since near will be added again
+ return Quicksort;
+}();
- selectedNodes = cy.$(function (ele) {
- return ele.selected() && r.nodeIsGrabbable(ele);
- });
- addNodesToDrag(selectedNodes, {
- addToList: draggedEles
- });
- } else {
- addNodeToDrag(near, {
- addToList: draggedEles
- });
- }
- setGrabTarget(near);
- var makeEvent = function makeEvent(type) {
- return {
- originalEvent: e,
- type: type,
- position: {
- x: now[0],
- y: now[1]
- }
- };
- };
- near.emit(makeEvent('grabon'));
- if (selectedNodes) {
- selectedNodes.forEach(function (n) {
- n.emit(makeEvent('grab'));
- });
- } else {
- near.emit(makeEvent('grab'));
- }
- }
- }
- triggerEvents(near, ['touchstart', 'tapstart', 'vmousedown'], e, {
- x: now[0],
- y: now[1]
- });
- if (near == null) {
- r.data.bgActivePosistion = {
- x: pos[0],
- y: pos[1]
- };
- r.redrawHint('select', true);
- r.redraw();
- }
+module.exports = Quicksort;
- // Tap, taphold
- // -----
+/***/ }),
+/* 26 */
+/***/ (function(module, exports, __webpack_require__) {
- r.touchData.singleTouchMoved = false;
- r.touchData.singleTouchStartTime = +new Date();
- clearTimeout(r.touchData.tapholdTimeout);
- r.touchData.tapholdTimeout = setTimeout(function () {
- if (r.touchData.singleTouchMoved === false && !r.pinching // if pinching, then taphold unselect shouldn't take effect
- && !r.touchData.selecting // box selection shouldn't allow taphold through
- ) {
- triggerEvents(r.touchData.start, ['taphold'], e, {
- x: now[0],
- y: now[1]
- });
- }
- }, r.tapholdDuration);
- }
- if (e.touches.length >= 1) {
- var sPos = r.touchData.startPosition = [null, null, null, null, null, null];
- for (var i = 0; i < now.length; i++) {
- sPos[i] = earlier[i] = now[i];
- }
- var touch0 = e.touches[0];
- r.touchData.startGPosition = [touch0.clientX, touch0.clientY];
- }
- }, false);
- var touchmoveHandler;
- r.registerBinding(window, 'touchmove', touchmoveHandler = function touchmoveHandler(e) {
- // eslint-disable-line no-undef
- var capture = r.touchData.capture;
- if (!capture && !eventInContainer(e)) {
- return;
- }
- var select = r.selection;
- var cy = r.cy;
- var now = r.touchData.now;
- var earlier = r.touchData.earlier;
- var zoom = cy.zoom();
- if (e.touches[0]) {
- var pos = r.projectIntoViewport(e.touches[0].clientX, e.touches[0].clientY);
- now[0] = pos[0];
- now[1] = pos[1];
- }
- if (e.touches[1]) {
- var pos = r.projectIntoViewport(e.touches[1].clientX, e.touches[1].clientY);
- now[2] = pos[0];
- now[3] = pos[1];
- }
- if (e.touches[2]) {
- var pos = r.projectIntoViewport(e.touches[2].clientX, e.touches[2].clientY);
- now[4] = pos[0];
- now[5] = pos[1];
- }
- var startGPos = r.touchData.startGPosition;
- var isOverThresholdDrag;
- if (capture && e.touches[0] && startGPos) {
- var disp = [];
- for (var j = 0; j < now.length; j++) {
- disp[j] = now[j] - earlier[j];
- }
- var dx = e.touches[0].clientX - startGPos[0];
- var dx2 = dx * dx;
- var dy = e.touches[0].clientY - startGPos[1];
- var dy2 = dy * dy;
- var dist2 = dx2 + dy2;
- isOverThresholdDrag = dist2 >= r.touchTapThreshold2;
- }
+"use strict";
- // context swipe cancelling
- if (capture && r.touchData.cxt) {
- e.preventDefault();
- var f1x2 = e.touches[0].clientX - offsetLeft,
- f1y2 = e.touches[0].clientY - offsetTop;
- var f2x2 = e.touches[1].clientX - offsetLeft,
- f2y2 = e.touches[1].clientY - offsetTop;
- // var distance2 = distance( f1x2, f1y2, f2x2, f2y2 );
- var distance2Sq = distanceSq(f1x2, f1y2, f2x2, f2y2);
- var factorSq = distance2Sq / distance1Sq;
- var distThreshold = 150;
- var distThresholdSq = distThreshold * distThreshold;
- var factorThreshold = 1.5;
- var factorThresholdSq = factorThreshold * factorThreshold;
- // cancel ctx gestures if the distance b/t the fingers increases
- if (factorSq >= factorThresholdSq || distance2Sq >= distThresholdSq) {
- r.touchData.cxt = false;
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- var cxtEvt = {
- originalEvent: e,
- type: 'cxttapend',
- position: {
- x: now[0],
- y: now[1]
- }
- };
- if (r.touchData.start) {
- r.touchData.start.unactivate().emit(cxtEvt);
- r.touchData.start = null;
- } else {
- cy.emit(cxtEvt);
- }
- }
- }
+// Singular Value Decomposition implementation
+function SVD() {};
+
+/* Below singular value decomposition (svd) code including hypot function is adopted from https://github.com/dragonfly-ai/JamaJS
+ Some changes are applied to make the code compatible with the fcose code and to make it independent from Jama.
+ Input matrix is changed to a 2D array instead of Jama matrix. Matrix dimensions are taken according to 2D array instead of using Jama functions.
+ An object that includes singular value components is created for return.
+ The types of input parameters of the hypot function are removed.
+ let is used instead of var for the variable initialization.
+*/
+/*
+ Apache License
+ Version 2.0, January 2004
+ http://www.apache.org/licenses/
+
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+ 1. Definitions.
+
+ "License" shall mean the terms and conditions for use, reproduction,
+ and distribution as defined by Sections 1 through 9 of this document.
+
+ "Licensor" shall mean the copyright owner or entity authorized by
+ the copyright owner that is granting the License.
+
+ "Legal Entity" shall mean the union of the acting entity and all
+ other entities that control, are controlled by, or are under common
+ control with that entity. For the purposes of this definition,
+ "control" means (i) the power, direct or indirect, to cause the
+ direction or management of such entity, whether by contract or
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ outstanding shares, or (iii) beneficial ownership of such entity.
+
+ "You" (or "Your") shall mean an individual or Legal Entity
+ exercising permissions granted by this License.
+
+ "Source" form shall mean the preferred form for making modifications,
+ including but not limited to software source code, documentation
+ source, and configuration files.
+
+ "Object" form shall mean any form resulting from mechanical
+ transformation or translation of a Source form, including but
+ not limited to compiled object code, generated documentation,
+ and conversions to other media types.
+
+ "Work" shall mean the work of authorship, whether in Source or
+ Object form, made available under the License, as indicated by a
+ copyright notice that is included in or attached to the work
+ (an example is provided in the Appendix below).
+
+ "Derivative Works" shall mean any work, whether in Source or Object
+ form, that is based on (or derived from) the Work and for which the
+ editorial revisions, annotations, elaborations, or other modifications
+ represent, as a whole, an original work of authorship. For the purposes
+ of this License, Derivative Works shall not include works that remain
+ separable from, or merely link (or bind by name) to the interfaces of,
+ the Work and Derivative Works thereof.
+
+ "Contribution" shall mean any work of authorship, including
+ the original version of the Work and any modifications or additions
+ to that Work or Derivative Works thereof, that is intentionally
+ submitted to Licensor for inclusion in the Work by the copyright owner
+ or by an individual or Legal Entity authorized to submit on behalf of
+ the copyright owner. For the purposes of this definition, "submitted"
+ means any form of electronic, verbal, or written communication sent
+ to the Licensor or its representatives, including but not limited to
+ communication on electronic mailing lists, source code control systems,
+ and issue tracking systems that are managed by, or on behalf of, the
+ Licensor for the purpose of discussing and improving the Work, but
+ excluding communication that is conspicuously marked or otherwise
+ designated in writing by the copyright owner as "Not a Contribution."
+
+ "Contributor" shall mean Licensor and any individual or Legal Entity
+ on behalf of whom a Contribution has been received by Licensor and
+ subsequently incorporated within the Work.
+
+ 2. Grant of Copyright License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ copyright license to reproduce, prepare Derivative Works of,
+ publicly display, publicly perform, sublicense, and distribute the
+ Work and such Derivative Works in Source or Object form.
+
+ 3. Grant of Patent License. Subject to the terms and conditions of
+ this License, each Contributor hereby grants to You a perpetual,
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ (except as stated in this section) patent license to make, have made,
+ use, offer to sell, sell, import, and otherwise transfer the Work,
+ where such license applies only to those patent claims licensable
+ by such Contributor that are necessarily infringed by their
+ Contribution(s) alone or by combination of their Contribution(s)
+ with the Work to which such Contribution(s) was submitted. If You
+ institute patent litigation against any entity (including a
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
+ or a Contribution incorporated within the Work constitutes direct
+ or contributory patent infringement, then any patent licenses
+ granted to You under this License for that Work shall terminate
+ as of the date such litigation is filed.
+
+ 4. Redistribution. You may reproduce and distribute copies of the
+ Work or Derivative Works thereof in any medium, with or without
+ modifications, and in Source or Object form, provided that You
+ meet the following conditions:
+
+ (a) You must give any other recipients of the Work or
+ Derivative Works a copy of this License; and
+
+ (b) You must cause any modified files to carry prominent notices
+ stating that You changed the files; and
+
+ (c) You must retain, in the Source form of any Derivative Works
+ that You distribute, all copyright, patent, trademark, and
+ attribution notices from the Source form of the Work,
+ excluding those notices that do not pertain to any part of
+ the Derivative Works; and
+
+ (d) If the Work includes a "NOTICE" text file as part of its
+ distribution, then any Derivative Works that You distribute must
+ include a readable copy of the attribution notices contained
+ within such NOTICE file, excluding those notices that do not
+ pertain to any part of the Derivative Works, in at least one
+ of the following places: within a NOTICE text file distributed
+ as part of the Derivative Works; within the Source form or
+ documentation, if provided along with the Derivative Works; or,
+ within a display generated by the Derivative Works, if and
+ wherever such third-party notices normally appear. The contents
+ of the NOTICE file are for informational purposes only and
+ do not modify the License. You may add Your own attribution
+ notices within Derivative Works that You distribute, alongside
+ or as an addendum to the NOTICE text from the Work, provided
+ that such additional attribution notices cannot be construed
+ as modifying the License.
- // context swipe
- if (capture && r.touchData.cxt) {
- var cxtEvt = {
- originalEvent: e,
- type: 'cxtdrag',
- position: {
- x: now[0],
- y: now[1]
- }
- };
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- if (r.touchData.start) {
- r.touchData.start.emit(cxtEvt);
- } else {
- cy.emit(cxtEvt);
- }
- if (r.touchData.start) {
- r.touchData.start._private.grabbed = false;
- }
- r.touchData.cxtDragged = true;
- var near = r.findNearestElement(now[0], now[1], true, true);
- if (!r.touchData.cxtOver || near !== r.touchData.cxtOver) {
- if (r.touchData.cxtOver) {
- r.touchData.cxtOver.emit({
- originalEvent: e,
- type: 'cxtdragout',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- }
- r.touchData.cxtOver = near;
- if (near) {
- near.emit({
- originalEvent: e,
- type: 'cxtdragover',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- }
- }
+ You may add Your own copyright statement to Your modifications and
+ may provide additional or different license terms and conditions
+ for use, reproduction, or distribution of Your modifications, or
+ for any such Derivative Works as a whole, provided Your use,
+ reproduction, and distribution of the Work otherwise complies with
+ the conditions stated in this License.
- // box selection
- } else if (capture && e.touches[2] && cy.boxSelectionEnabled()) {
- e.preventDefault();
- r.data.bgActivePosistion = undefined;
- this.lastThreeTouch = +new Date();
- if (!r.touchData.selecting) {
- cy.emit({
- originalEvent: e,
- type: 'boxstart',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- }
- r.touchData.selecting = true;
- r.touchData.didSelect = true;
- select[4] = 1;
- if (!select || select.length === 0 || select[0] === undefined) {
- select[0] = (now[0] + now[2] + now[4]) / 3;
- select[1] = (now[1] + now[3] + now[5]) / 3;
- select[2] = (now[0] + now[2] + now[4]) / 3 + 1;
- select[3] = (now[1] + now[3] + now[5]) / 3 + 1;
- } else {
- select[2] = (now[0] + now[2] + now[4]) / 3;
- select[3] = (now[1] + now[3] + now[5]) / 3;
- }
- r.redrawHint('select', true);
- r.redraw();
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
+ any Contribution intentionally submitted for inclusion in the Work
+ by You to the Licensor shall be under the terms and conditions of
+ this License, without any additional terms or conditions.
+ Notwithstanding the above, nothing herein shall supersede or modify
+ the terms of any separate license agreement you may have executed
+ with Licensor regarding such Contributions.
- // pinch to zoom
- } else if (capture && e.touches[1] && !r.touchData.didSelect // don't allow box selection to degrade to pinch-to-zoom
- && cy.zoomingEnabled() && cy.panningEnabled() && cy.userZoomingEnabled() && cy.userPanningEnabled()) {
- // two fingers => pinch to zoom
- e.preventDefault();
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- var draggedEles = r.dragData.touchDragEles;
- if (draggedEles) {
- r.redrawHint('drag', true);
- for (var i = 0; i < draggedEles.length; i++) {
- var de_p = draggedEles[i]._private;
- de_p.grabbed = false;
- de_p.rscratch.inDragLayer = false;
- }
- }
- var _start = r.touchData.start;
+ 6. Trademarks. This License does not grant permission to use the trade
+ names, trademarks, service marks, or product names of the Licensor,
+ except as required for reasonable and customary use in describing the
+ origin of the Work and reproducing the content of the NOTICE file.
- // (x2, y2) for fingers 1 and 2
- var f1x2 = e.touches[0].clientX - offsetLeft,
- f1y2 = e.touches[0].clientY - offsetTop;
- var f2x2 = e.touches[1].clientX - offsetLeft,
- f2y2 = e.touches[1].clientY - offsetTop;
- var distance2 = distance(f1x2, f1y2, f2x2, f2y2);
- // var distance2Sq = distanceSq( f1x2, f1y2, f2x2, f2y2 );
- // var factor = Math.sqrt( distance2Sq ) / Math.sqrt( distance1Sq );
- var factor = distance2 / distance1;
- if (twoFingersStartInside) {
- // delta finger1
- var df1x = f1x2 - f1x1;
- var df1y = f1y2 - f1y1;
+ 7. Disclaimer of Warranty. Unless required by applicable law or
+ agreed to in writing, Licensor provides the Work (and each
+ Contributor provides its Contributions) on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ implied, including, without limitation, any warranties or conditions
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ PARTICULAR PURPOSE. You are solely responsible for determining the
+ appropriateness of using or redistributing the Work and assume any
+ risks associated with Your exercise of permissions under this License.
- // delta finger 2
- var df2x = f2x2 - f2x1;
- var df2y = f2y2 - f2y1;
+ 8. Limitation of Liability. In no event and under no legal theory,
+ whether in tort (including negligence), contract, or otherwise,
+ unless required by applicable law (such as deliberate and grossly
+ negligent acts) or agreed to in writing, shall any Contributor be
+ liable to You for damages, including any direct, indirect, special,
+ incidental, or consequential damages of any character arising as a
+ result of this License or out of the use or inability to use the
+ Work (including but not limited to damages for loss of goodwill,
+ work stoppage, computer failure or malfunction, or any and all
+ other commercial damages or losses), even if such Contributor
+ has been advised of the possibility of such damages.
- // translation is the normalised vector of the two fingers movement
- // i.e. so pinching cancels out and moving together pans
- var tx = (df1x + df2x) / 2;
- var ty = (df1y + df2y) / 2;
+ 9. Accepting Warranty or Additional Liability. While redistributing
+ the Work or Derivative Works thereof, You may choose to offer,
+ and charge a fee for, acceptance of support, warranty, indemnity,
+ or other liability obligations and/or rights consistent with this
+ License. However, in accepting such obligations, You may act only
+ on Your own behalf and on Your sole responsibility, not on behalf
+ of any other Contributor, and only if You agree to indemnify,
+ defend, and hold each Contributor harmless for any liability
+ incurred by, or claims asserted against, such Contributor by reason
+ of your accepting any such warranty or additional liability.
- // now calculate the zoom
- var zoom1 = cy.zoom();
- var zoom2 = zoom1 * factor;
- var pan1 = cy.pan();
+ END OF TERMS AND CONDITIONS
- // the model center point converted to the current rendered pos
- var ctrx = modelCenter1[0] * zoom1 + pan1.x;
- var ctry = modelCenter1[1] * zoom1 + pan1.y;
- var pan2 = {
- x: -zoom2 / zoom1 * (ctrx - pan1.x - tx) + ctrx,
- y: -zoom2 / zoom1 * (ctry - pan1.y - ty) + ctry
- };
+ APPENDIX: How to apply the Apache License to your work.
- // remove dragged eles
- if (_start && _start.active()) {
- var draggedEles = r.dragData.touchDragEles;
- freeDraggedElements(draggedEles);
- r.redrawHint('drag', true);
- r.redrawHint('eles', true);
- _start.unactivate().emit('freeon');
- draggedEles.emit('free');
- if (r.dragData.didDrag) {
- _start.emit('dragfreeon');
- draggedEles.emit('dragfree');
- }
- }
- cy.viewport({
- zoom: zoom2,
- pan: pan2,
- cancelOnFailedZoom: true
- });
- cy.emit('pinchzoom');
- distance1 = distance2;
- f1x1 = f1x2;
- f1y1 = f1y2;
- f2x1 = f2x2;
- f2y1 = f2y2;
- r.pinching = true;
- }
+ To apply the Apache License to your work, attach the following
+ boilerplate notice, with the fields enclosed by brackets "{}"
+ replaced with your own identifying information. (Don't include
+ the brackets!) The text should be enclosed in the appropriate
+ comment syntax for the file format. We also recommend that a
+ file or class name and description of purpose be included on the
+ same "printed page" as the copyright notice for easier
+ identification within third-party archives.
- // Re-project
- if (e.touches[0]) {
- var pos = r.projectIntoViewport(e.touches[0].clientX, e.touches[0].clientY);
- now[0] = pos[0];
- now[1] = pos[1];
- }
- if (e.touches[1]) {
- var pos = r.projectIntoViewport(e.touches[1].clientX, e.touches[1].clientY);
- now[2] = pos[0];
- now[3] = pos[1];
- }
- if (e.touches[2]) {
- var pos = r.projectIntoViewport(e.touches[2].clientX, e.touches[2].clientY);
- now[4] = pos[0];
- now[5] = pos[1];
- }
- } else if (e.touches[0] && !r.touchData.didSelect // don't allow box selection to degrade to single finger events like panning
- ) {
- var start = r.touchData.start;
- var last = r.touchData.last;
- var near;
- if (!r.hoverData.draggingEles && !r.swipePanning) {
- near = r.findNearestElement(now[0], now[1], true, true);
- }
- if (capture && start != null) {
- e.preventDefault();
- }
+ Copyright {yyyy} {name of copyright owner}
- // dragging nodes
- if (capture && start != null && r.nodeIsDraggable(start)) {
- if (isOverThresholdDrag) {
- // then dragging can happen
- var draggedEles = r.dragData.touchDragEles;
- var justStartedDrag = !r.dragData.didDrag;
- if (justStartedDrag) {
- addNodesToDrag(draggedEles, {
- inDragLayer: true
- });
- }
- r.dragData.didDrag = true;
- var totalShift = {
- x: 0,
- y: 0
- };
- if (number$1(disp[0]) && number$1(disp[1])) {
- totalShift.x += disp[0];
- totalShift.y += disp[1];
- if (justStartedDrag) {
- r.redrawHint('eles', true);
- var dragDelta = r.touchData.dragDelta;
- if (dragDelta && number$1(dragDelta[0]) && number$1(dragDelta[1])) {
- totalShift.x += dragDelta[0];
- totalShift.y += dragDelta[1];
- }
- }
- }
- r.hoverData.draggingEles = true;
- draggedEles.silentShift(totalShift).emit('position drag');
- r.redrawHint('drag', true);
- if (r.touchData.startPosition[0] == earlier[0] && r.touchData.startPosition[1] == earlier[1]) {
- r.redrawHint('eles', true);
- }
- r.redraw();
- } else {
- // otherwise keep track of drag delta for later
- var dragDelta = r.touchData.dragDelta = r.touchData.dragDelta || [];
- if (dragDelta.length === 0) {
- dragDelta.push(disp[0]);
- dragDelta.push(disp[1]);
- } else {
- dragDelta[0] += disp[0];
- dragDelta[1] += disp[1];
- }
- }
- }
+ Licensed under the Apache License, Version 2.0 (the "License");
+ you may not use this file except in compliance with the License.
+ You may obtain a copy of the License at
- // touchmove
- {
- triggerEvents(start || near, ['touchmove', 'tapdrag', 'vmousemove'], e, {
- x: now[0],
- y: now[1]
- });
- if ((!start || !start.grabbed()) && near != last) {
- if (last) {
- last.emit({
- originalEvent: e,
- type: 'tapdragout',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- }
- if (near) {
- near.emit({
- originalEvent: e,
- type: 'tapdragover',
- position: {
- x: now[0],
- y: now[1]
- }
- });
- }
- }
- r.touchData.last = near;
- }
+ http://www.apache.org/licenses/LICENSE-2.0
- // check to cancel taphold
- if (capture) {
- for (var i = 0; i < now.length; i++) {
- if (now[i] && r.touchData.startPosition[i] && isOverThresholdDrag) {
- r.touchData.singleTouchMoved = true;
- }
+ Unless required by applicable law or agreed to in writing, software
+ distributed under the License is distributed on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ See the License for the specific language governing permissions and
+ limitations under the License.
+*/
+
+SVD.svd = function (A) {
+ this.U = null;
+ this.V = null;
+ this.s = null;
+ this.m = 0;
+ this.n = 0;
+ this.m = A.length;
+ this.n = A[0].length;
+ var nu = Math.min(this.m, this.n);
+ this.s = function (s) {
+ var a = [];
+ while (s-- > 0) {
+ a.push(0);
+ }return a;
+ }(Math.min(this.m + 1, this.n));
+ this.U = function (dims) {
+ var allocate = function allocate(dims) {
+ if (dims.length == 0) {
+ return 0;
+ } else {
+ var array = [];
+ for (var i = 0; i < dims[0]; i++) {
+ array.push(allocate(dims.slice(1)));
}
+ return array;
}
-
- // panning
- if (capture && (start == null || start.pannable()) && cy.panningEnabled() && cy.userPanningEnabled()) {
- var allowPassthrough = allowPanningPassthrough(start, r.touchData.starts);
- if (allowPassthrough) {
- e.preventDefault();
- if (!r.data.bgActivePosistion) {
- r.data.bgActivePosistion = array2point(r.touchData.startPosition);
- }
- if (r.swipePanning) {
- cy.panBy({
- x: disp[0] * zoom,
- y: disp[1] * zoom
- });
- cy.emit('dragpan');
- } else if (isOverThresholdDrag) {
- r.swipePanning = true;
- cy.panBy({
- x: dx * zoom,
- y: dy * zoom
- });
- cy.emit('dragpan');
- if (start) {
- start.unactivate();
- r.redrawHint('select', true);
- r.touchData.start = null;
- }
- }
+ };
+ return allocate(dims);
+ }([this.m, nu]);
+ this.V = function (dims) {
+ var allocate = function allocate(dims) {
+ if (dims.length == 0) {
+ return 0;
+ } else {
+ var array = [];
+ for (var i = 0; i < dims[0]; i++) {
+ array.push(allocate(dims.slice(1)));
}
-
- // Re-project
- var pos = r.projectIntoViewport(e.touches[0].clientX, e.touches[0].clientY);
- now[0] = pos[0];
- now[1] = pos[1];
+ return array;
}
- }
- for (var j = 0; j < now.length; j++) {
- earlier[j] = now[j];
- }
-
- // the active bg indicator should be removed when making a swipe that is neither for dragging nodes or panning
- if (capture && e.touches.length > 0 && !r.hoverData.draggingEles && !r.swipePanning && r.data.bgActivePosistion != null) {
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- r.redraw();
- }
- }, false);
- var touchcancelHandler;
- r.registerBinding(containerWindow, 'touchcancel', touchcancelHandler = function touchcancelHandler(e) {
- // eslint-disable-line no-unused-vars
- var start = r.touchData.start;
- r.touchData.capture = false;
- if (start) {
- start.unactivate();
- }
- });
- var touchendHandler, didDoubleTouch, touchTimeout, prevTouchTimeStamp;
- r.registerBinding(containerWindow, 'touchend', touchendHandler = function touchendHandler(e) {
- // eslint-disable-line no-unused-vars
- var start = r.touchData.start;
- var capture = r.touchData.capture;
- if (capture) {
- if (e.touches.length === 0) {
- r.touchData.capture = false;
+ };
+ return allocate(dims);
+ }([this.n, this.n]);
+ var e = function (s) {
+ var a = [];
+ while (s-- > 0) {
+ a.push(0);
+ }return a;
+ }(this.n);
+ var work = function (s) {
+ var a = [];
+ while (s-- > 0) {
+ a.push(0);
+ }return a;
+ }(this.m);
+ var wantu = true;
+ var wantv = true;
+ var nct = Math.min(this.m - 1, this.n);
+ var nrt = Math.max(0, Math.min(this.n - 2, this.m));
+ for (var k = 0; k < Math.max(nct, nrt); k++) {
+ if (k < nct) {
+ this.s[k] = 0;
+ for (var i = k; i < this.m; i++) {
+ this.s[k] = SVD.hypot(this.s[k], A[i][k]);
}
- e.preventDefault();
- } else {
- return;
- }
- var select = r.selection;
- r.swipePanning = false;
- r.hoverData.draggingEles = false;
- var cy = r.cy;
- var zoom = cy.zoom();
- var now = r.touchData.now;
- var earlier = r.touchData.earlier;
- if (e.touches[0]) {
- var pos = r.projectIntoViewport(e.touches[0].clientX, e.touches[0].clientY);
- now[0] = pos[0];
- now[1] = pos[1];
- }
- if (e.touches[1]) {
- var pos = r.projectIntoViewport(e.touches[1].clientX, e.touches[1].clientY);
- now[2] = pos[0];
- now[3] = pos[1];
+ ;
+ if (this.s[k] !== 0.0) {
+ if (A[k][k] < 0.0) {
+ this.s[k] = -this.s[k];
+ }
+ for (var _i = k; _i < this.m; _i++) {
+ A[_i][k] /= this.s[k];
+ }
+ ;
+ A[k][k] += 1.0;
+ }
+ this.s[k] = -this.s[k];
}
- if (e.touches[2]) {
- var pos = r.projectIntoViewport(e.touches[2].clientX, e.touches[2].clientY);
- now[4] = pos[0];
- now[5] = pos[1];
+ for (var j = k + 1; j < this.n; j++) {
+ if (function (lhs, rhs) {
+ return lhs && rhs;
+ }(k < nct, this.s[k] !== 0.0)) {
+ var t = 0;
+ for (var _i2 = k; _i2 < this.m; _i2++) {
+ t += A[_i2][k] * A[_i2][j];
+ }
+ ;
+ t = -t / A[k][k];
+ for (var _i3 = k; _i3 < this.m; _i3++) {
+ A[_i3][j] += t * A[_i3][k];
+ }
+ ;
+ }
+ e[j] = A[k][j];
}
- if (start) {
- start.unactivate();
+ ;
+ if (function (lhs, rhs) {
+ return lhs && rhs;
+ }(wantu, k < nct)) {
+ for (var _i4 = k; _i4 < this.m; _i4++) {
+ this.U[_i4][k] = A[_i4][k];
+ }
+ ;
}
- var ctxTapend;
- if (r.touchData.cxt) {
- ctxTapend = {
- originalEvent: e,
- type: 'cxttapend',
- position: {
- x: now[0],
- y: now[1]
+ if (k < nrt) {
+ e[k] = 0;
+ for (var _i5 = k + 1; _i5 < this.n; _i5++) {
+ e[k] = SVD.hypot(e[k], e[_i5]);
+ }
+ ;
+ if (e[k] !== 0.0) {
+ if (e[k + 1] < 0.0) {
+ e[k] = -e[k];
}
- };
- if (start) {
- start.emit(ctxTapend);
- } else {
- cy.emit(ctxTapend);
+ for (var _i6 = k + 1; _i6 < this.n; _i6++) {
+ e[_i6] /= e[k];
+ }
+ ;
+ e[k + 1] += 1.0;
}
- if (!r.touchData.cxtDragged) {
- var ctxTap = {
- originalEvent: e,
- type: 'cxttap',
- position: {
- x: now[0],
- y: now[1]
+ e[k] = -e[k];
+ if (function (lhs, rhs) {
+ return lhs && rhs;
+ }(k + 1 < this.m, e[k] !== 0.0)) {
+ for (var _i7 = k + 1; _i7 < this.m; _i7++) {
+ work[_i7] = 0.0;
+ }
+ ;
+ for (var _j = k + 1; _j < this.n; _j++) {
+ for (var _i8 = k + 1; _i8 < this.m; _i8++) {
+ work[_i8] += e[_j] * A[_i8][_j];
}
- };
- if (start) {
- start.emit(ctxTap);
- } else {
- cy.emit(ctxTap);
+ ;
+ }
+ ;
+ for (var _j2 = k + 1; _j2 < this.n; _j2++) {
+ var _t = -e[_j2] / e[k + 1];
+ for (var _i9 = k + 1; _i9 < this.m; _i9++) {
+ A[_i9][_j2] += _t * work[_i9];
+ }
+ ;
}
+ ;
}
- if (r.touchData.start) {
- r.touchData.start._private.grabbed = false;
+ if (wantv) {
+ for (var _i10 = k + 1; _i10 < this.n; _i10++) {
+ this.V[_i10][k] = e[_i10];
+ };
}
- r.touchData.cxt = false;
- r.touchData.start = null;
- r.redraw();
- return;
}
-
- // no more box selection if we don't have three fingers
- if (!e.touches[2] && cy.boxSelectionEnabled() && r.touchData.selecting) {
- r.touchData.selecting = false;
- var box = cy.collection(r.getAllInBox(select[0], select[1], select[2], select[3]));
- select[0] = undefined;
- select[1] = undefined;
- select[2] = undefined;
- select[3] = undefined;
- select[4] = 0;
- r.redrawHint('select', true);
- cy.emit({
- type: 'boxend',
- originalEvent: e,
- position: {
- x: now[0],
- y: now[1]
- }
- });
- var eleWouldBeSelected = function eleWouldBeSelected(ele) {
- return ele.selectable() && !ele.selected();
+ };
+ var p = Math.min(this.n, this.m + 1);
+ if (nct < this.n) {
+ this.s[nct] = A[nct][nct];
+ }
+ if (this.m < p) {
+ this.s[p - 1] = 0.0;
+ }
+ if (nrt + 1 < p) {
+ e[nrt] = A[nrt][p - 1];
+ }
+ e[p - 1] = 0.0;
+ if (wantu) {
+ for (var _j3 = nct; _j3 < nu; _j3++) {
+ for (var _i11 = 0; _i11 < this.m; _i11++) {
+ this.U[_i11][_j3] = 0.0;
+ }
+ ;
+ this.U[_j3][_j3] = 1.0;
+ };
+ for (var _k = nct - 1; _k >= 0; _k--) {
+ if (this.s[_k] !== 0.0) {
+ for (var _j4 = _k + 1; _j4 < nu; _j4++) {
+ var _t2 = 0;
+ for (var _i12 = _k; _i12 < this.m; _i12++) {
+ _t2 += this.U[_i12][_k] * this.U[_i12][_j4];
+ };
+ _t2 = -_t2 / this.U[_k][_k];
+ for (var _i13 = _k; _i13 < this.m; _i13++) {
+ this.U[_i13][_j4] += _t2 * this.U[_i13][_k];
+ };
+ };
+ for (var _i14 = _k; _i14 < this.m; _i14++) {
+ this.U[_i14][_k] = -this.U[_i14][_k];
+ };
+ this.U[_k][_k] = 1.0 + this.U[_k][_k];
+ for (var _i15 = 0; _i15 < _k - 1; _i15++) {
+ this.U[_i15][_k] = 0.0;
+ };
+ } else {
+ for (var _i16 = 0; _i16 < this.m; _i16++) {
+ this.U[_i16][_k] = 0.0;
+ };
+ this.U[_k][_k] = 1.0;
+ }
+ };
+ }
+ if (wantv) {
+ for (var _k2 = this.n - 1; _k2 >= 0; _k2--) {
+ if (function (lhs, rhs) {
+ return lhs && rhs;
+ }(_k2 < nrt, e[_k2] !== 0.0)) {
+ for (var _j5 = _k2 + 1; _j5 < nu; _j5++) {
+ var _t3 = 0;
+ for (var _i17 = _k2 + 1; _i17 < this.n; _i17++) {
+ _t3 += this.V[_i17][_k2] * this.V[_i17][_j5];
+ };
+ _t3 = -_t3 / this.V[_k2 + 1][_k2];
+ for (var _i18 = _k2 + 1; _i18 < this.n; _i18++) {
+ this.V[_i18][_j5] += _t3 * this.V[_i18][_k2];
+ };
+ };
+ }
+ for (var _i19 = 0; _i19 < this.n; _i19++) {
+ this.V[_i19][_k2] = 0.0;
};
- box.emit('box').stdFilter(eleWouldBeSelected).select().emit('boxselect');
- if (box.nonempty()) {
- r.redrawHint('eles', true);
+ this.V[_k2][_k2] = 1.0;
+ };
+ }
+ var pp = p - 1;
+ var iter = 0;
+ var eps = Math.pow(2.0, -52.0);
+ var tiny = Math.pow(2.0, -966.0);
+ while (p > 0) {
+ var _k3 = void 0;
+ var kase = void 0;
+ for (_k3 = p - 2; _k3 >= -1; _k3--) {
+ if (_k3 === -1) {
+ break;
}
- r.redraw();
- }
- if (start != null) {
- start.unactivate();
- }
- if (e.touches[2]) {
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- } else if (e.touches[1]) ; else if (e.touches[0]) ; else if (!e.touches[0]) {
- r.data.bgActivePosistion = undefined;
- r.redrawHint('select', true);
- var draggedEles = r.dragData.touchDragEles;
- if (start != null) {
- var startWasGrabbed = start._private.grabbed;
- freeDraggedElements(draggedEles);
- r.redrawHint('drag', true);
- r.redrawHint('eles', true);
- if (startWasGrabbed) {
- start.emit('freeon');
- draggedEles.emit('free');
- if (r.dragData.didDrag) {
- start.emit('dragfreeon');
- draggedEles.emit('dragfree');
- }
+ if (Math.abs(e[_k3]) <= tiny + eps * (Math.abs(this.s[_k3]) + Math.abs(this.s[_k3 + 1]))) {
+ e[_k3] = 0.0;
+ break;
+ }
+ };
+ if (_k3 === p - 2) {
+ kase = 4;
+ } else {
+ var ks = void 0;
+ for (ks = p - 1; ks >= _k3; ks--) {
+ if (ks === _k3) {
+ break;
}
- triggerEvents(start, ['touchend', 'tapend', 'vmouseup', 'tapdragout'], e, {
- x: now[0],
- y: now[1]
- });
- start.unactivate();
- r.touchData.start = null;
+ var _t4 = (ks !== p ? Math.abs(e[ks]) : 0.0) + (ks !== _k3 + 1 ? Math.abs(e[ks - 1]) : 0.0);
+ if (Math.abs(this.s[ks]) <= tiny + eps * _t4) {
+ this.s[ks] = 0.0;
+ break;
+ }
+ };
+ if (ks === _k3) {
+ kase = 3;
+ } else if (ks === p - 1) {
+ kase = 1;
} else {
- var near = r.findNearestElement(now[0], now[1], true, true);
- triggerEvents(near, ['touchend', 'tapend', 'vmouseup', 'tapdragout'], e, {
- x: now[0],
- y: now[1]
- });
+ kase = 2;
+ _k3 = ks;
}
- var dx = r.touchData.startPosition[0] - now[0];
- var dx2 = dx * dx;
- var dy = r.touchData.startPosition[1] - now[1];
- var dy2 = dy * dy;
- var dist2 = dx2 + dy2;
- var rdist2 = dist2 * zoom * zoom;
+ }
+ _k3++;
+ switch (kase) {
+ case 1:
+ {
+ var f = e[p - 2];
+ e[p - 2] = 0.0;
+ for (var _j6 = p - 2; _j6 >= _k3; _j6--) {
+ var _t5 = SVD.hypot(this.s[_j6], f);
+ var cs = this.s[_j6] / _t5;
+ var sn = f / _t5;
+ this.s[_j6] = _t5;
+ if (_j6 !== _k3) {
+ f = -sn * e[_j6 - 1];
+ e[_j6 - 1] = cs * e[_j6 - 1];
+ }
+ if (wantv) {
+ for (var _i20 = 0; _i20 < this.n; _i20++) {
+ _t5 = cs * this.V[_i20][_j6] + sn * this.V[_i20][p - 1];
+ this.V[_i20][p - 1] = -sn * this.V[_i20][_j6] + cs * this.V[_i20][p - 1];
+ this.V[_i20][_j6] = _t5;
+ };
+ }
+ };
+ };
+ break;
+ case 2:
+ {
+ var _f = e[_k3 - 1];
+ e[_k3 - 1] = 0.0;
+ for (var _j7 = _k3; _j7 < p; _j7++) {
+ var _t6 = SVD.hypot(this.s[_j7], _f);
+ var _cs = this.s[_j7] / _t6;
+ var _sn = _f / _t6;
+ this.s[_j7] = _t6;
+ _f = -_sn * e[_j7];
+ e[_j7] = _cs * e[_j7];
+ if (wantu) {
+ for (var _i21 = 0; _i21 < this.m; _i21++) {
+ _t6 = _cs * this.U[_i21][_j7] + _sn * this.U[_i21][_k3 - 1];
+ this.U[_i21][_k3 - 1] = -_sn * this.U[_i21][_j7] + _cs * this.U[_i21][_k3 - 1];
+ this.U[_i21][_j7] = _t6;
+ };
+ }
+ };
+ };
+ break;
+ case 3:
+ {
+ var scale = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[p - 1]), Math.abs(this.s[p - 2])), Math.abs(e[p - 2])), Math.abs(this.s[_k3])), Math.abs(e[_k3]));
+ var sp = this.s[p - 1] / scale;
+ var spm1 = this.s[p - 2] / scale;
+ var epm1 = e[p - 2] / scale;
+ var sk = this.s[_k3] / scale;
+ var ek = e[_k3] / scale;
+ var b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2.0;
+ var c = sp * epm1 * (sp * epm1);
+ var shift = 0.0;
+ if (function (lhs, rhs) {
+ return lhs || rhs;
+ }(b !== 0.0, c !== 0.0)) {
+ shift = Math.sqrt(b * b + c);
+ if (b < 0.0) {
+ shift = -shift;
+ }
+ shift = c / (b + shift);
+ }
+ var _f2 = (sk + sp) * (sk - sp) + shift;
+ var g = sk * ek;
+ for (var _j8 = _k3; _j8 < p - 1; _j8++) {
+ var _t7 = SVD.hypot(_f2, g);
+ var _cs2 = _f2 / _t7;
+ var _sn2 = g / _t7;
+ if (_j8 !== _k3) {
+ e[_j8 - 1] = _t7;
+ }
+ _f2 = _cs2 * this.s[_j8] + _sn2 * e[_j8];
+ e[_j8] = _cs2 * e[_j8] - _sn2 * this.s[_j8];
+ g = _sn2 * this.s[_j8 + 1];
+ this.s[_j8 + 1] = _cs2 * this.s[_j8 + 1];
+ if (wantv) {
+ for (var _i22 = 0; _i22 < this.n; _i22++) {
+ _t7 = _cs2 * this.V[_i22][_j8] + _sn2 * this.V[_i22][_j8 + 1];
+ this.V[_i22][_j8 + 1] = -_sn2 * this.V[_i22][_j8] + _cs2 * this.V[_i22][_j8 + 1];
+ this.V[_i22][_j8] = _t7;
+ };
+ }
+ _t7 = SVD.hypot(_f2, g);
+ _cs2 = _f2 / _t7;
+ _sn2 = g / _t7;
+ this.s[_j8] = _t7;
+ _f2 = _cs2 * e[_j8] + _sn2 * this.s[_j8 + 1];
+ this.s[_j8 + 1] = -_sn2 * e[_j8] + _cs2 * this.s[_j8 + 1];
+ g = _sn2 * e[_j8 + 1];
+ e[_j8 + 1] = _cs2 * e[_j8 + 1];
+ if (wantu && _j8 < this.m - 1) {
+ for (var _i23 = 0; _i23 < this.m; _i23++) {
+ _t7 = _cs2 * this.U[_i23][_j8] + _sn2 * this.U[_i23][_j8 + 1];
+ this.U[_i23][_j8 + 1] = -_sn2 * this.U[_i23][_j8] + _cs2 * this.U[_i23][_j8 + 1];
+ this.U[_i23][_j8] = _t7;
+ };
+ }
+ };
+ e[p - 2] = _f2;
+ iter = iter + 1;
+ };
+ break;
+ case 4:
+ {
+ if (this.s[_k3] <= 0.0) {
+ this.s[_k3] = this.s[_k3] < 0.0 ? -this.s[_k3] : 0.0;
+ if (wantv) {
+ for (var _i24 = 0; _i24 <= pp; _i24++) {
+ this.V[_i24][_k3] = -this.V[_i24][_k3];
+ };
+ }
+ }
+ while (_k3 < pp) {
+ if (this.s[_k3] >= this.s[_k3 + 1]) {
+ break;
+ }
+ var _t8 = this.s[_k3];
+ this.s[_k3] = this.s[_k3 + 1];
+ this.s[_k3 + 1] = _t8;
+ if (wantv && _k3 < this.n - 1) {
+ for (var _i25 = 0; _i25 < this.n; _i25++) {
+ _t8 = this.V[_i25][_k3 + 1];
+ this.V[_i25][_k3 + 1] = this.V[_i25][_k3];
+ this.V[_i25][_k3] = _t8;
+ };
+ }
+ if (wantu && _k3 < this.m - 1) {
+ for (var _i26 = 0; _i26 < this.m; _i26++) {
+ _t8 = this.U[_i26][_k3 + 1];
+ this.U[_i26][_k3 + 1] = this.U[_i26][_k3];
+ this.U[_i26][_k3] = _t8;
+ };
+ }
+ _k3++;
+ };
+ iter = 0;
+ p--;
+ };
+ break;
+ }
+ };
+ var result = { U: this.U, V: this.V, S: this.s };
+ return result;
+};
- // Tap event, roughly same as mouse click event for touch
- if (!r.touchData.singleTouchMoved) {
- if (!start) {
- cy.$(':selected').unselect(['tapunselect']);
- }
- triggerEvents(start, ['tap', 'vclick'], e, {
- x: now[0],
- y: now[1]
- });
- didDoubleTouch = false;
- if (e.timeStamp - prevTouchTimeStamp <= cy.multiClickDebounceTime()) {
- touchTimeout && clearTimeout(touchTimeout);
- didDoubleTouch = true;
- prevTouchTimeStamp = null;
- triggerEvents(start, ['dbltap', 'vdblclick'], e, {
- x: now[0],
- y: now[1]
- });
- } else {
- touchTimeout = setTimeout(function () {
- if (didDoubleTouch) return;
- triggerEvents(start, ['onetap', 'voneclick'], e, {
- x: now[0],
- y: now[1]
- });
- }, cy.multiClickDebounceTime());
- prevTouchTimeStamp = e.timeStamp;
+// sqrt(a^2 + b^2) without under/overflow.
+SVD.hypot = function (a, b) {
+ var r = void 0;
+ if (Math.abs(a) > Math.abs(b)) {
+ r = b / a;
+ r = Math.abs(a) * Math.sqrt(1 + r * r);
+ } else if (b != 0) {
+ r = a / b;
+ r = Math.abs(b) * Math.sqrt(1 + r * r);
+ } else {
+ r = 0.0;
+ }
+ return r;
+};
+
+module.exports = SVD;
+
+/***/ }),
+/* 27 */
+/***/ (function(module, exports, __webpack_require__) {
+
+"use strict";
+
+
+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"); } }
+
+/**
+ * Needleman-Wunsch algorithm is an procedure to compute the optimal global alignment of two string
+ * sequences by S.B.Needleman and C.D.Wunsch (1970).
+ *
+ * Aside from the inputs, you can assign the scores for,
+ * - Match: The two characters at the current index are same.
+ * - Mismatch: The two characters at the current index are different.
+ * - Insertion/Deletion(gaps): The best alignment involves one letter aligning to a gap in the other string.
+ */
+
+var NeedlemanWunsch = function () {
+ function NeedlemanWunsch(sequence1, sequence2) {
+ var match_score = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
+ var mismatch_penalty = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : -1;
+ var gap_penalty = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : -1;
+
+ _classCallCheck(this, NeedlemanWunsch);
+
+ this.sequence1 = sequence1;
+ this.sequence2 = sequence2;
+ this.match_score = match_score;
+ this.mismatch_penalty = mismatch_penalty;
+ this.gap_penalty = gap_penalty;
+
+ // Just the remove redundancy
+ this.iMax = sequence1.length + 1;
+ this.jMax = sequence2.length + 1;
+
+ // Grid matrix of scores
+ this.grid = new Array(this.iMax);
+ for (var i = 0; i < this.iMax; i++) {
+ this.grid[i] = new Array(this.jMax);
+
+ for (var j = 0; j < this.jMax; j++) {
+ this.grid[i][j] = 0;
+ }
}
- }
- // Prepare to select the currently touched node, only if it hasn't been dragged past a certain distance
- if (start != null && !r.dragData.didDrag // didn't drag nodes around
- && start._private.selectable && rdist2 < r.touchTapThreshold2 && !r.pinching // pinch to zoom should not affect selection
- ) {
- if (cy.selectionType() === 'single') {
- cy.$(isSelected).unmerge(start).unselect(['tapunselect']);
- start.select(['tapselect']);
- } else {
- if (start.selected()) {
- start.unselect(['tapunselect']);
- } else {
- start.select(['tapselect']);
- }
+ // Traceback matrix (2D array, each cell is an array of boolean values for [`Diag`, `Up`, `Left`] positions)
+ this.tracebackGrid = new Array(this.iMax);
+ for (var _i = 0; _i < this.iMax; _i++) {
+ this.tracebackGrid[_i] = new Array(this.jMax);
+
+ for (var _j = 0; _j < this.jMax; _j++) {
+ this.tracebackGrid[_i][_j] = [null, null, null];
+ }
}
- r.redrawHint('eles', true);
- }
- r.touchData.singleTouchMoved = true;
- }
- for (var j = 0; j < now.length; j++) {
- earlier[j] = now[j];
- }
- r.dragData.didDrag = false; // reset for next touchstart
- if (e.touches.length === 0) {
- r.touchData.dragDelta = [];
- r.touchData.startPosition = [null, null, null, null, null, null];
- r.touchData.startGPosition = null;
- r.touchData.didSelect = false;
- }
- if (e.touches.length < 2) {
- if (e.touches.length === 1) {
- // the old start global pos'n may not be the same finger that remains
- r.touchData.startGPosition = [e.touches[0].clientX, e.touches[0].clientY];
- }
- r.pinching = false;
- r.redrawHint('eles', true);
- r.redraw();
- }
+ // The aligned sequences (return multiple possibilities)
+ this.alignments = [];
- //r.redraw();
- }, false);
+ // Final alignment score
+ this.score = -1;
- // fallback compatibility layer for ms pointer events
- if (typeof TouchEvent === 'undefined') {
- var pointers = [];
- var makeTouch = function makeTouch(e) {
- return {
- clientX: e.clientX,
- clientY: e.clientY,
- force: 1,
- identifier: e.pointerId,
- pageX: e.pageX,
- pageY: e.pageY,
- radiusX: e.width / 2,
- radiusY: e.height / 2,
- screenX: e.screenX,
- screenY: e.screenY,
- target: e.target
- };
- };
- var makePointer = function makePointer(e) {
- return {
- event: e,
- touch: makeTouch(e)
- };
- };
- var addPointer = function addPointer(e) {
- pointers.push(makePointer(e));
- };
- var removePointer = function removePointer(e) {
- for (var i = 0; i < pointers.length; i++) {
- var p = pointers[i];
- if (p.event.pointerId === e.pointerId) {
- pointers.splice(i, 1);
- return;
- }
- }
- };
- var updatePointer = function updatePointer(e) {
- var p = pointers.filter(function (p) {
- return p.event.pointerId === e.pointerId;
- })[0];
- p.event = e;
- p.touch = makeTouch(e);
- };
- var addTouchesToEvent = function addTouchesToEvent(e) {
- e.touches = pointers.map(function (p) {
- return p.touch;
- });
- };
- var pointerIsMouse = function pointerIsMouse(e) {
- return e.pointerType === 'mouse' || e.pointerType === 4;
- };
- r.registerBinding(r.container, 'pointerdown', function (e) {
- if (pointerIsMouse(e)) {
- return;
- } // mouse already handled
+ // Calculate scores and tracebacks
+ this.computeGrids();
+ }
- e.preventDefault();
- addPointer(e);
- addTouchesToEvent(e);
- touchstartHandler(e);
- });
- r.registerBinding(r.container, 'pointerup', function (e) {
- if (pointerIsMouse(e)) {
- return;
- } // mouse already handled
+ _createClass(NeedlemanWunsch, [{
+ key: "getScore",
+ value: function getScore() {
+ return this.score;
+ }
+ }, {
+ key: "getAlignments",
+ value: function getAlignments() {
+ return this.alignments;
+ }
- removePointer(e);
- addTouchesToEvent(e);
- touchendHandler(e);
- });
- r.registerBinding(r.container, 'pointercancel', function (e) {
- if (pointerIsMouse(e)) {
- return;
- } // mouse already handled
+ // Main dynamic programming procedure
- removePointer(e);
- addTouchesToEvent(e);
- touchcancelHandler(e);
- });
- r.registerBinding(r.container, 'pointermove', function (e) {
- if (pointerIsMouse(e)) {
- return;
- } // mouse already handled
+ }, {
+ key: "computeGrids",
+ value: function computeGrids() {
+ // Fill in the first row
+ for (var j = 1; j < this.jMax; j++) {
+ this.grid[0][j] = this.grid[0][j - 1] + this.gap_penalty;
+ this.tracebackGrid[0][j] = [false, false, true];
+ }
- e.preventDefault();
- updatePointer(e);
- addTouchesToEvent(e);
- touchmoveHandler(e);
- });
- }
-};
+ // Fill in the first column
+ for (var i = 1; i < this.iMax; i++) {
+ this.grid[i][0] = this.grid[i - 1][0] + this.gap_penalty;
+ this.tracebackGrid[i][0] = [false, true, false];
+ }
-var BRp$2 = {};
-BRp$2.generatePolygon = function (name, points) {
- return this.nodeShapes[name] = {
- renderer: this,
- name: name,
- points: points,
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl('polygon', context, centerX, centerY, width, height, this.points);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- return polygonIntersectLine(x, y, this.points, nodeX, nodeY, width / 2, height / 2, padding);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- return pointInsidePolygon(x, y, this.points, centerX, centerY, width, height, [0, -1], padding);
- }
- };
-};
-BRp$2.generateEllipse = function () {
- return this.nodeShapes['ellipse'] = {
- renderer: this,
- name: 'ellipse',
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl(this.name, context, centerX, centerY, width, height);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- return intersectLineEllipse(x, y, nodeX, nodeY, width / 2 + padding, height / 2 + padding);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- return checkInEllipse(x, y, width, height, centerX, centerY, padding);
- }
- };
-};
-BRp$2.generateRoundPolygon = function (name, points) {
- // Pre-compute control points
- // Since these points depend on the radius length (which in turns depend on the width/height of the node) we will only pre-compute
- // the unit vectors.
- // For simplicity the layout will be:
- // [ p0, UnitVectorP0P1, p1, UniVectorP1P2, ..., pn, UnitVectorPnP0 ]
- var allPoints = new Array(points.length * 2);
- for (var i = 0; i < points.length / 2; i++) {
- var sourceIndex = i * 2;
- var destIndex = void 0;
- if (i < points.length / 2 - 1) {
- destIndex = (i + 1) * 2;
- } else {
- destIndex = 0;
- }
- allPoints[i * 4] = points[sourceIndex];
- allPoints[i * 4 + 1] = points[sourceIndex + 1];
- var xDest = points[destIndex] - points[sourceIndex];
- var yDest = points[destIndex + 1] - points[sourceIndex + 1];
- var norm = Math.sqrt(xDest * xDest + yDest * yDest);
- allPoints[i * 4 + 2] = xDest / norm;
- allPoints[i * 4 + 3] = yDest / norm;
- }
- return this.nodeShapes[name] = {
- renderer: this,
- name: name,
- points: allPoints,
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl('round-polygon', context, centerX, centerY, width, height, this.points);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- return roundPolygonIntersectLine(x, y, this.points, nodeX, nodeY, width, height);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- return pointInsideRoundPolygon(x, y, this.points, centerX, centerY, width, height);
- }
- };
-};
-BRp$2.generateRoundRectangle = function () {
- return this.nodeShapes['round-rectangle'] = this.nodeShapes['roundrectangle'] = {
- renderer: this,
- name: 'round-rectangle',
- points: generateUnitNgonPointsFitToSquare(4, 0),
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl(this.name, context, centerX, centerY, width, height);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- return roundRectangleIntersectLine(x, y, nodeX, nodeY, width, height, padding);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- var cornerRadius = getRoundRectangleRadius(width, height);
- var diam = cornerRadius * 2;
+ // Fill the rest of the grid
+ for (var _i2 = 1; _i2 < this.iMax; _i2++) {
+ for (var _j2 = 1; _j2 < this.jMax; _j2++) {
+ // Find the max score(s) among [`Diag`, `Up`, `Left`]
+ var diag = void 0;
+ if (this.sequence1[_i2 - 1] === this.sequence2[_j2 - 1]) diag = this.grid[_i2 - 1][_j2 - 1] + this.match_score;else diag = this.grid[_i2 - 1][_j2 - 1] + this.mismatch_penalty;
- // Check hBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width, height - diam, [0, -1], padding)) {
- return true;
- }
+ var up = this.grid[_i2 - 1][_j2] + this.gap_penalty;
+ var left = this.grid[_i2][_j2 - 1] + this.gap_penalty;
- // Check vBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width - diam, height, [0, -1], padding)) {
- return true;
- }
+ // If there exists multiple max values, capture them for multiple paths
+ var maxOf = [diag, up, left];
+ var indices = this.arrayAllMaxIndexes(maxOf);
- // Check top left quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX - width / 2 + cornerRadius, centerY - height / 2 + cornerRadius, padding)) {
- return true;
- }
+ // Update Grids
+ this.grid[_i2][_j2] = maxOf[indices[0]];
+ this.tracebackGrid[_i2][_j2] = [indices.includes(0), indices.includes(1), indices.includes(2)];
+ }
+ }
- // Check top right quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX + width / 2 - cornerRadius, centerY - height / 2 + cornerRadius, padding)) {
- return true;
- }
+ // Update alignment score
+ this.score = this.grid[this.iMax - 1][this.jMax - 1];
+ }
- // Check bottom right quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX + width / 2 - cornerRadius, centerY + height / 2 - cornerRadius, padding)) {
- return true;
- }
+ // Gets all possible valid sequence combinations
- // Check bottom left quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX - width / 2 + cornerRadius, centerY + height / 2 - cornerRadius, padding)) {
- return true;
- }
- return false;
- }
- };
-};
-BRp$2.generateCutRectangle = function () {
- return this.nodeShapes['cut-rectangle'] = this.nodeShapes['cutrectangle'] = {
- renderer: this,
- name: 'cut-rectangle',
- cornerLength: getCutRectangleCornerLength(),
- points: generateUnitNgonPointsFitToSquare(4, 0),
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl(this.name, context, centerX, centerY, width, height);
- },
- generateCutTrianglePts: function generateCutTrianglePts(width, height, centerX, centerY) {
- var cl = this.cornerLength;
- var hh = height / 2;
- var hw = width / 2;
- var xBegin = centerX - hw;
- var xEnd = centerX + hw;
- var yBegin = centerY - hh;
- var yEnd = centerY + hh;
+ }, {
+ key: "alignmentTraceback",
+ value: function alignmentTraceback() {
+ var inProcessAlignments = [];
- // points are in clockwise order, inner (imaginary) triangle pt on [4, 5]
- return {
- topLeft: [xBegin, yBegin + cl, xBegin + cl, yBegin, xBegin + cl, yBegin + cl],
- topRight: [xEnd - cl, yBegin, xEnd, yBegin + cl, xEnd - cl, yBegin + cl],
- bottomRight: [xEnd, yEnd - cl, xEnd - cl, yEnd, xEnd - cl, yEnd - cl],
- bottomLeft: [xBegin + cl, yEnd, xBegin, yEnd - cl, xBegin + cl, yEnd - cl]
- };
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- var cPts = this.generateCutTrianglePts(width + 2 * padding, height + 2 * padding, nodeX, nodeY);
- var pts = [].concat.apply([], [cPts.topLeft.splice(0, 4), cPts.topRight.splice(0, 4), cPts.bottomRight.splice(0, 4), cPts.bottomLeft.splice(0, 4)]);
- return polygonIntersectLine(x, y, pts, nodeX, nodeY);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- // Check hBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width, height - 2 * this.cornerLength, [0, -1], padding)) {
- return true;
- }
+ inProcessAlignments.push({ pos: [this.sequence1.length, this.sequence2.length],
+ seq1: "",
+ seq2: ""
+ });
- // Check vBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width - 2 * this.cornerLength, height, [0, -1], padding)) {
- return true;
- }
- var cutTrianglePts = this.generateCutTrianglePts(width, height, centerX, centerY);
- return pointInsidePolygonPoints(x, y, cutTrianglePts.topLeft) || pointInsidePolygonPoints(x, y, cutTrianglePts.topRight) || pointInsidePolygonPoints(x, y, cutTrianglePts.bottomRight) || pointInsidePolygonPoints(x, y, cutTrianglePts.bottomLeft);
- }
- };
-};
-BRp$2.generateBarrel = function () {
- return this.nodeShapes['barrel'] = {
- renderer: this,
- name: 'barrel',
- points: generateUnitNgonPointsFitToSquare(4, 0),
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl(this.name, context, centerX, centerY, width, height);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- // use two fixed t values for the bezier curve approximation
+ while (inProcessAlignments[0]) {
+ var current = inProcessAlignments[0];
+ var directions = this.tracebackGrid[current.pos[0]][current.pos[1]];
- var t0 = 0.15;
- var t1 = 0.5;
- var t2 = 0.85;
- var bPts = this.generateBarrelBezierPts(width + 2 * padding, height + 2 * padding, nodeX, nodeY);
- var approximateBarrelCurvePts = function approximateBarrelCurvePts(pts) {
- // approximate curve pts based on the two t values
- var m0 = qbezierPtAt({
- x: pts[0],
- y: pts[1]
- }, {
- x: pts[2],
- y: pts[3]
- }, {
- x: pts[4],
- y: pts[5]
- }, t0);
- var m1 = qbezierPtAt({
- x: pts[0],
- y: pts[1]
- }, {
- x: pts[2],
- y: pts[3]
- }, {
- x: pts[4],
- y: pts[5]
- }, t1);
- var m2 = qbezierPtAt({
- x: pts[0],
- y: pts[1]
- }, {
- x: pts[2],
- y: pts[3]
- }, {
- x: pts[4],
- y: pts[5]
- }, t2);
- return [pts[0], pts[1], m0.x, m0.y, m1.x, m1.y, m2.x, m2.y, pts[4], pts[5]];
- };
- var pts = [].concat(approximateBarrelCurvePts(bPts.topLeft), approximateBarrelCurvePts(bPts.topRight), approximateBarrelCurvePts(bPts.bottomRight), approximateBarrelCurvePts(bPts.bottomLeft));
- return polygonIntersectLine(x, y, pts, nodeX, nodeY);
- },
- generateBarrelBezierPts: function generateBarrelBezierPts(width, height, centerX, centerY) {
- var hh = height / 2;
- var hw = width / 2;
- var xBegin = centerX - hw;
- var xEnd = centerX + hw;
- var yBegin = centerY - hh;
- var yEnd = centerY + hh;
- var curveConstants = getBarrelCurveConstants(width, height);
- var hOffset = curveConstants.heightOffset;
- var wOffset = curveConstants.widthOffset;
- var ctrlPtXOffset = curveConstants.ctrlPtOffsetPct * width;
+ if (directions[0]) {
+ inProcessAlignments.push({ pos: [current.pos[0] - 1, current.pos[1] - 1],
+ seq1: this.sequence1[current.pos[0] - 1] + current.seq1,
+ seq2: this.sequence2[current.pos[1] - 1] + current.seq2
+ });
+ }
+ if (directions[1]) {
+ inProcessAlignments.push({ pos: [current.pos[0] - 1, current.pos[1]],
+ seq1: this.sequence1[current.pos[0] - 1] + current.seq1,
+ seq2: '-' + current.seq2
+ });
+ }
+ if (directions[2]) {
+ inProcessAlignments.push({ pos: [current.pos[0], current.pos[1] - 1],
+ seq1: '-' + current.seq1,
+ seq2: this.sequence2[current.pos[1] - 1] + current.seq2
+ });
+ }
- // points are in clockwise order, inner (imaginary) control pt on [4, 5]
- var pts = {
- topLeft: [xBegin, yBegin + hOffset, xBegin + ctrlPtXOffset, yBegin, xBegin + wOffset, yBegin],
- topRight: [xEnd - wOffset, yBegin, xEnd - ctrlPtXOffset, yBegin, xEnd, yBegin + hOffset],
- bottomRight: [xEnd, yEnd - hOffset, xEnd - ctrlPtXOffset, yEnd, xEnd - wOffset, yEnd],
- bottomLeft: [xBegin + wOffset, yEnd, xBegin + ctrlPtXOffset, yEnd, xBegin, yEnd - hOffset]
- };
- pts.topLeft.isTop = true;
- pts.topRight.isTop = true;
- pts.bottomLeft.isBottom = true;
- pts.bottomRight.isBottom = true;
- return pts;
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- var curveConstants = getBarrelCurveConstants(width, height);
- var hOffset = curveConstants.heightOffset;
- var wOffset = curveConstants.widthOffset;
+ if (current.pos[0] === 0 && current.pos[1] === 0) this.alignments.push({ sequence1: current.seq1,
+ sequence2: current.seq2
+ });
- // Check hBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width, height - 2 * hOffset, [0, -1], padding)) {
- return true;
- }
+ inProcessAlignments.shift();
+ }
- // Check vBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width - 2 * wOffset, height, [0, -1], padding)) {
- return true;
- }
- var barrelCurvePts = this.generateBarrelBezierPts(width, height, centerX, centerY);
- var getCurveT = function getCurveT(x, y, curvePts) {
- var x0 = curvePts[4];
- var x1 = curvePts[2];
- var x2 = curvePts[0];
- var y0 = curvePts[5];
- // var y1 = curvePts[ 3 ];
- var y2 = curvePts[1];
- var xMin = Math.min(x0, x2);
- var xMax = Math.max(x0, x2);
- var yMin = Math.min(y0, y2);
- var yMax = Math.max(y0, y2);
- if (xMin <= x && x <= xMax && yMin <= y && y <= yMax) {
- var coeff = bezierPtsToQuadCoeff(x0, x1, x2);
- var roots = solveQuadratic(coeff[0], coeff[1], coeff[2], x);
- var validRoots = roots.filter(function (r) {
- return 0 <= r && r <= 1;
- });
- if (validRoots.length > 0) {
- return validRoots[0];
- }
- }
- return null;
- };
- var curveRegions = Object.keys(barrelCurvePts);
- for (var i = 0; i < curveRegions.length; i++) {
- var corner = curveRegions[i];
- var cornerPts = barrelCurvePts[corner];
- var t = getCurveT(x, y, cornerPts);
- if (t == null) {
- continue;
+ return this.alignments;
}
- var y0 = cornerPts[5];
- var y1 = cornerPts[3];
- var y2 = cornerPts[1];
- var bezY = qbezierAt(y0, y1, y2, t);
- if (cornerPts.isTop && bezY <= y) {
- return true;
+
+ // Helper Functions
+
+ }, {
+ key: "getAllIndexes",
+ value: function getAllIndexes(arr, val) {
+ var indexes = [],
+ i = -1;
+ while ((i = arr.indexOf(val, i + 1)) !== -1) {
+ indexes.push(i);
+ }
+ return indexes;
}
- if (cornerPts.isBottom && y <= bezY) {
- return true;
+ }, {
+ key: "arrayAllMaxIndexes",
+ value: function arrayAllMaxIndexes(array) {
+ return this.getAllIndexes(array, Math.max.apply(null, array));
}
- }
- return false;
- }
- };
-};
-BRp$2.generateBottomRoundrectangle = function () {
- return this.nodeShapes['bottom-round-rectangle'] = this.nodeShapes['bottomroundrectangle'] = {
- renderer: this,
- name: 'bottom-round-rectangle',
- points: generateUnitNgonPointsFitToSquare(4, 0),
- draw: function draw(context, centerX, centerY, width, height) {
- this.renderer.nodeShapeImpl(this.name, context, centerX, centerY, width, height);
- },
- intersectLine: function intersectLine(nodeX, nodeY, width, height, x, y, padding) {
- var topStartX = nodeX - (width / 2 + padding);
- var topStartY = nodeY - (height / 2 + padding);
- var topEndY = topStartY;
- var topEndX = nodeX + (width / 2 + padding);
- var topIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, topStartX, topStartY, topEndX, topEndY, false);
- if (topIntersections.length > 0) {
- return topIntersections;
- }
- return roundRectangleIntersectLine(x, y, nodeX, nodeY, width, height, padding);
- },
- checkPoint: function checkPoint(x, y, padding, width, height, centerX, centerY) {
- var cornerRadius = getRoundRectangleRadius(width, height);
- var diam = 2 * cornerRadius;
-
- // Check hBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width, height - diam, [0, -1], padding)) {
- return true;
- }
+ }]);
- // Check vBox
- if (pointInsidePolygon(x, y, this.points, centerX, centerY, width - diam, height, [0, -1], padding)) {
- return true;
- }
+ return NeedlemanWunsch;
+}();
- // check non-rounded top side
- var outerWidth = width / 2 + 2 * padding;
- var outerHeight = height / 2 + 2 * padding;
- var points = [centerX - outerWidth, centerY - outerHeight, centerX - outerWidth, centerY, centerX + outerWidth, centerY, centerX + outerWidth, centerY - outerHeight];
- if (pointInsidePolygonPoints(x, y, points)) {
- return true;
- }
+module.exports = NeedlemanWunsch;
- // Check bottom right quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX + width / 2 - cornerRadius, centerY + height / 2 - cornerRadius, padding)) {
- return true;
- }
+/***/ }),
+/* 28 */
+/***/ (function(module, exports, __nested_webpack_require_145732__) {
- // Check bottom left quarter circle
- if (checkInEllipse(x, y, diam, diam, centerX - width / 2 + cornerRadius, centerY + height / 2 - cornerRadius, padding)) {
- return true;
- }
- return false;
- }
- };
+"use strict";
+
+
+var layoutBase = function layoutBase() {
+ return;
};
-BRp$2.registerNodeShapes = function () {
- var nodeShapes = this.nodeShapes = {};
- var renderer = this;
- this.generateEllipse();
- this.generatePolygon('triangle', generateUnitNgonPointsFitToSquare(3, 0));
- this.generateRoundPolygon('round-triangle', generateUnitNgonPointsFitToSquare(3, 0));
- this.generatePolygon('rectangle', generateUnitNgonPointsFitToSquare(4, 0));
- nodeShapes['square'] = nodeShapes['rectangle'];
- this.generateRoundRectangle();
- this.generateCutRectangle();
- this.generateBarrel();
- this.generateBottomRoundrectangle();
- {
- var diamondPoints = [0, 1, 1, 0, 0, -1, -1, 0];
- this.generatePolygon('diamond', diamondPoints);
- this.generateRoundPolygon('round-diamond', diamondPoints);
- }
- this.generatePolygon('pentagon', generateUnitNgonPointsFitToSquare(5, 0));
- this.generateRoundPolygon('round-pentagon', generateUnitNgonPointsFitToSquare(5, 0));
- this.generatePolygon('hexagon', generateUnitNgonPointsFitToSquare(6, 0));
- this.generateRoundPolygon('round-hexagon', generateUnitNgonPointsFitToSquare(6, 0));
- this.generatePolygon('heptagon', generateUnitNgonPointsFitToSquare(7, 0));
- this.generateRoundPolygon('round-heptagon', generateUnitNgonPointsFitToSquare(7, 0));
- this.generatePolygon('octagon', generateUnitNgonPointsFitToSquare(8, 0));
- this.generateRoundPolygon('round-octagon', generateUnitNgonPointsFitToSquare(8, 0));
- var star5Points = new Array(20);
- {
- var outerPoints = generateUnitNgonPoints(5, 0);
- var innerPoints = generateUnitNgonPoints(5, Math.PI / 5);
- // Outer radius is 1; inner radius of star is smaller
- var innerRadius = 0.5 * (3 - Math.sqrt(5));
- innerRadius *= 1.57;
- for (var i = 0; i < innerPoints.length / 2; i++) {
- innerPoints[i * 2] *= innerRadius;
- innerPoints[i * 2 + 1] *= innerRadius;
- }
- for (var i = 0; i < 20 / 4; i++) {
- star5Points[i * 4] = outerPoints[i * 2];
- star5Points[i * 4 + 1] = outerPoints[i * 2 + 1];
- star5Points[i * 4 + 2] = innerPoints[i * 2];
- star5Points[i * 4 + 3] = innerPoints[i * 2 + 1];
- }
- }
- star5Points = fitPolygonToSquare(star5Points);
- this.generatePolygon('star', star5Points);
- this.generatePolygon('vee', [-1, -1, 0, -0.333, 1, -1, 0, 1]);
- this.generatePolygon('rhomboid', [-1, -1, 0.333, -1, 1, 1, -0.333, 1]);
- this.generatePolygon('right-rhomboid', [-0.333, -1, 1, -1, 0.333, 1, -1, 1]);
- this.nodeShapes['concavehexagon'] = this.generatePolygon('concave-hexagon', [-1, -0.95, -0.75, 0, -1, 0.95, 1, 0.95, 0.75, 0, 1, -0.95]);
- {
- var tagPoints = [-1, -1, 0.25, -1, 1, 0, 0.25, 1, -1, 1];
- this.generatePolygon('tag', tagPoints);
- this.generateRoundPolygon('round-tag', tagPoints);
- }
- nodeShapes.makePolygon = function (points) {
- // use caching on user-specified polygons so they are as fast as native shapes
+layoutBase.FDLayout = __nested_webpack_require_145732__(18);
+layoutBase.FDLayoutConstants = __nested_webpack_require_145732__(4);
+layoutBase.FDLayoutEdge = __nested_webpack_require_145732__(19);
+layoutBase.FDLayoutNode = __nested_webpack_require_145732__(20);
+layoutBase.DimensionD = __nested_webpack_require_145732__(21);
+layoutBase.HashMap = __nested_webpack_require_145732__(22);
+layoutBase.HashSet = __nested_webpack_require_145732__(23);
+layoutBase.IGeometry = __nested_webpack_require_145732__(8);
+layoutBase.IMath = __nested_webpack_require_145732__(9);
+layoutBase.Integer = __nested_webpack_require_145732__(10);
+layoutBase.Point = __nested_webpack_require_145732__(12);
+layoutBase.PointD = __nested_webpack_require_145732__(5);
+layoutBase.RandomSeed = __nested_webpack_require_145732__(16);
+layoutBase.RectangleD = __nested_webpack_require_145732__(13);
+layoutBase.Transform = __nested_webpack_require_145732__(17);
+layoutBase.UniqueIDGeneretor = __nested_webpack_require_145732__(14);
+layoutBase.Quicksort = __nested_webpack_require_145732__(25);
+layoutBase.LinkedList = __nested_webpack_require_145732__(11);
+layoutBase.LGraphObject = __nested_webpack_require_145732__(2);
+layoutBase.LGraph = __nested_webpack_require_145732__(6);
+layoutBase.LEdge = __nested_webpack_require_145732__(1);
+layoutBase.LGraphManager = __nested_webpack_require_145732__(7);
+layoutBase.LNode = __nested_webpack_require_145732__(3);
+layoutBase.Layout = __nested_webpack_require_145732__(15);
+layoutBase.LayoutConstants = __nested_webpack_require_145732__(0);
+layoutBase.NeedlemanWunsch = __nested_webpack_require_145732__(27);
+layoutBase.Matrix = __nested_webpack_require_145732__(24);
+layoutBase.SVD = __nested_webpack_require_145732__(26);
- var key = points.join('$');
- var name = 'polygon-' + key;
- var shape;
- if (shape = this[name]) {
- // got cached shape
- return shape;
- }
+module.exports = layoutBase;
- // create and cache new shape
- return renderer.generatePolygon(name, points);
- };
-};
+/***/ }),
+/* 29 */
+/***/ (function(module, exports, __webpack_require__) {
-var BRp$1 = {};
-BRp$1.timeToRender = function () {
- return this.redrawTotalTime / this.redrawCount;
-};
-BRp$1.redraw = function (options) {
- options = options || staticEmptyObject();
- var r = this;
- if (r.averageRedrawTime === undefined) {
- r.averageRedrawTime = 0;
- }
- if (r.lastRedrawTime === undefined) {
- r.lastRedrawTime = 0;
- }
- if (r.lastDrawTime === undefined) {
- r.lastDrawTime = 0;
- }
- r.requestedFrame = true;
- r.renderOptions = options;
-};
-BRp$1.beforeRender = function (fn, priority) {
- // the renderer can't add tick callbacks when destroyed
- if (this.destroyed) {
- return;
- }
- if (priority == null) {
- error('Priority is not optional for beforeRender');
- }
- var cbs = this.beforeRenderCallbacks;
- cbs.push({
- fn: fn,
- priority: priority
- });
+"use strict";
- // higher priority callbacks executed first
- cbs.sort(function (a, b) {
- return b.priority - a.priority;
+
+function Emitter() {
+ this.listeners = [];
+}
+
+var p = Emitter.prototype;
+
+p.addListener = function (event, callback) {
+ this.listeners.push({
+ event: event,
+ callback: callback
});
};
-var beforeRenderCallbacks = function beforeRenderCallbacks(r, willDraw, startTime) {
- var cbs = r.beforeRenderCallbacks;
- for (var i = 0; i < cbs.length; i++) {
- cbs[i].fn(willDraw, startTime);
+
+p.removeListener = function (event, callback) {
+ for (var i = this.listeners.length; i >= 0; i--) {
+ var l = this.listeners[i];
+
+ if (l.event === event && l.callback === callback) {
+ this.listeners.splice(i, 1);
+ }
}
};
-BRp$1.startRenderLoop = function () {
- var r = this;
- var cy = r.cy;
- if (r.renderLoopStarted) {
- return;
- } else {
- r.renderLoopStarted = true;
- }
- var renderFn = function renderFn(requestTime) {
- if (r.destroyed) {
- return;
- }
- if (cy.batching()) ; else if (r.requestedFrame && !r.skipFrame) {
- beforeRenderCallbacks(r, true, requestTime);
- var startTime = performanceNow();
- r.render(r.renderOptions);
- var endTime = r.lastDrawTime = performanceNow();
- if (r.averageRedrawTime === undefined) {
- r.averageRedrawTime = endTime - startTime;
- }
- if (r.redrawCount === undefined) {
- r.redrawCount = 0;
- }
- r.redrawCount++;
- if (r.redrawTotalTime === undefined) {
- r.redrawTotalTime = 0;
- }
- var duration = endTime - startTime;
- r.redrawTotalTime += duration;
- r.lastRedrawTime = duration;
- // use a weighted average with a bias from the previous average so we don't spike so easily
- r.averageRedrawTime = r.averageRedrawTime / 2 + duration / 2;
- r.requestedFrame = false;
- } else {
- beforeRenderCallbacks(r, false, requestTime);
+p.emit = function (event, data) {
+ for (var i = 0; i < this.listeners.length; i++) {
+ var l = this.listeners[i];
+
+ if (event === l.event) {
+ l.callback(data);
}
- r.skipFrame = false;
- requestAnimationFrame(renderFn);
- };
- requestAnimationFrame(renderFn);
+ }
};
-var BaseRenderer = function BaseRenderer(options) {
- this.init(options);
-};
-var BR = BaseRenderer;
-var BRp = BR.prototype;
-BRp.clientFunctions = ['redrawHint', 'render', 'renderTo', 'matchCanvasSize', 'nodeShapeImpl', 'arrowShapeImpl'];
-BRp.init = function (options) {
- var r = this;
- r.options = options;
- r.cy = options.cy;
- var ctr = r.container = options.cy.container();
- var containerWindow = r.cy.window();
+module.exports = Emitter;
- // prepend a stylesheet in the head such that
- if (containerWindow) {
- var document = containerWindow.document;
- var head = document.head;
- var stylesheetId = '__________cytoscape_stylesheet';
- var className = '__________cytoscape_container';
- var stylesheetAlreadyExists = document.getElementById(stylesheetId) != null;
- if (ctr.className.indexOf(className) < 0) {
- ctr.className = (ctr.className || '') + ' ' + className;
- }
- if (!stylesheetAlreadyExists) {
- var stylesheet = document.createElement('style');
- stylesheet.id = stylesheetId;
- stylesheet.textContent = '.' + className + ' { position: relative; }';
- head.insertBefore(stylesheet, head.children[0]); // first so lowest priority
- }
+/***/ })
+/******/ ]);
+});
- var computedStyle = containerWindow.getComputedStyle(ctr);
- var position = computedStyle.getPropertyValue('position');
- if (position === 'static') {
- warn('A Cytoscape container has style position:static and so can not use UI extensions properly');
- }
- }
- r.selection = [undefined, undefined, undefined, undefined, 0]; // Coordinates for selection box, plus enabled flag
+/***/ }),
- r.bezierProjPcts = [0.05, 0.225, 0.4, 0.5, 0.6, 0.775, 0.95];
+/***/ "./node_modules/lodash.curry/index.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash.curry/index.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- //--Pointer-related data
- r.hoverData = {
- down: null,
- last: null,
- downTime: null,
- triggerMode: null,
- dragging: false,
- initialPan: [null, null],
- capture: false
- };
- r.dragData = {
- possibleDragElements: []
- };
- r.touchData = {
- start: null,
- capture: false,
- // These 3 fields related to tap, taphold events
- startPosition: [null, null, null, null, null, null],
- singleTouchStartTime: null,
- singleTouchMoved: true,
- now: [null, null, null, null, null, null],
- earlier: [null, null, null, null, null, null]
- };
- r.redraws = 0;
- r.showFps = options.showFps;
- r.debug = options.debug;
- r.hideEdgesOnViewport = options.hideEdgesOnViewport;
- r.textureOnViewport = options.textureOnViewport;
- r.wheelSensitivity = options.wheelSensitivity;
- r.motionBlurEnabled = options.motionBlur; // on by default
- r.forcedPixelRatio = number$1(options.pixelRatio) ? options.pixelRatio : null;
- r.motionBlur = options.motionBlur; // for initial kick off
- r.motionBlurOpacity = options.motionBlurOpacity;
- r.motionBlurTransparency = 1 - r.motionBlurOpacity;
- r.motionBlurPxRatio = 1;
- r.mbPxRBlurry = 1; //0.8;
- r.minMbLowQualFrames = 4;
- r.fullQualityMb = false;
- r.clearedForMotionBlur = [];
- r.desktopTapThreshold = options.desktopTapThreshold;
- r.desktopTapThreshold2 = options.desktopTapThreshold * options.desktopTapThreshold;
- r.touchTapThreshold = options.touchTapThreshold;
- r.touchTapThreshold2 = options.touchTapThreshold * options.touchTapThreshold;
- r.tapholdDuration = 500;
- r.bindings = [];
- r.beforeRenderCallbacks = [];
- r.beforeRenderPriorities = {
- // higher priority execs before lower one
- animations: 400,
- eleCalcs: 300,
- eleTxrDeq: 200,
- lyrTxrDeq: 150,
- lyrTxrSkip: 100
- };
- r.registerNodeShapes();
- r.registerArrowShapes();
- r.registerCalculationListeners();
-};
-BRp.notify = function (eventName, eles) {
- var r = this;
- var cy = r.cy;
+/**
+ * lodash (Custom Build) <https://lodash.com/>
+ * Build: `lodash modularize exports="npm" -o ./`
+ * Copyright jQuery Foundation and other contributors <https://jquery.org/>
+ * 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
+ */
- // the renderer can't be notified after it's destroyed
- if (this.destroyed) {
- return;
- }
- if (eventName === 'init') {
- r.load();
- return;
- }
- if (eventName === 'destroy') {
- r.destroy();
- return;
- }
- if (eventName === 'add' || eventName === 'remove' || eventName === 'move' && cy.hasCompoundNodes() || eventName === 'load' || eventName === 'zorder' || eventName === 'mount') {
- r.invalidateCachedZSortedEles();
- }
- if (eventName === 'viewport') {
- r.redrawHint('select', true);
- }
- if (eventName === 'load' || eventName === 'resize' || eventName === 'mount') {
- r.invalidateContainerClientCoordsCache();
- r.matchCanvasSize(r.container);
- }
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- this.startRenderLoop();
- this.redraw();
-};
-BRp.destroy = function () {
- var r = this;
- r.destroyed = true;
- r.cy.stopAnimationLoop();
- for (var i = 0; i < r.bindings.length; i++) {
- var binding = r.bindings[i];
- var b = binding;
- var tgt = b.target;
- (tgt.off || tgt.removeEventListener).apply(tgt, b.args);
+/** Used as the `TypeError` message for "Functions" methods. */
+var FUNC_ERROR_TEXT = 'Expected a function';
+
+/** Used as the internal argument placeholder. */
+var PLACEHOLDER = '__lodash_placeholder__';
+
+/** Used to compose bitmasks for function metadata. */
+var BIND_FLAG = 1,
+ BIND_KEY_FLAG = 2,
+ CURRY_BOUND_FLAG = 4,
+ CURRY_FLAG = 8,
+ CURRY_RIGHT_FLAG = 16,
+ PARTIAL_FLAG = 32,
+ PARTIAL_RIGHT_FLAG = 64,
+ ARY_FLAG = 128,
+ REARG_FLAG = 256,
+ FLIP_FLAG = 512;
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0,
+ MAX_SAFE_INTEGER = 9007199254740991,
+ MAX_INTEGER = 1.7976931348623157e+308,
+ NAN = 0 / 0;
+
+/** Used to associate wrap methods with their bit flags. */
+var wrapFlags = [
+ ['ary', ARY_FLAG],
+ ['bind', BIND_FLAG],
+ ['bindKey', BIND_KEY_FLAG],
+ ['curry', CURRY_FLAG],
+ ['curryRight', CURRY_RIGHT_FLAG],
+ ['flip', FLIP_FLAG],
+ ['partial', PARTIAL_FLAG],
+ ['partialRight', PARTIAL_RIGHT_FLAG],
+ ['rearg', REARG_FLAG]
+];
+
+/** `Object#toString` result references. */
+var funcTag = '[object Function]',
+ genTag = '[object GeneratorFunction]',
+ symbolTag = '[object Symbol]';
+
+/**
+ * Used to match `RegExp`
+ * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+ */
+var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
+
+/** Used to match leading and trailing whitespace. */
+var reTrim = /^\s+|\s+$/g;
+
+/** Used to match wrap detail comments. */
+var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,
+ reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/,
+ reSplitDetails = /,? & /;
+
+/** 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*)$/;
+
+/** Built-in method references without a dependency on `root`. */
+var freeParseInt = parseInt;
+
+/** Detect free variable `global` from Node.js. */
+var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g && __webpack_require__.g.Object === Object && __webpack_require__.g;
+
+/** 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')();
+
+/**
+ * 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]);
}
- r.bindings = [];
- r.beforeRenderCallbacks = [];
- r.onUpdateEleCalcsFns = [];
- if (r.removeObserver) {
- r.removeObserver.disconnect();
+ return func.apply(thisArg, args);
+}
+
+/**
+ * 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 ? array.length : 0;
+
+ while (++index < length) {
+ if (iteratee(array[index], index, array) === false) {
+ break;
+ }
}
- if (r.styleObserver) {
- r.styleObserver.disconnect();
+ return array;
+}
+
+/**
+ * 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 ? array.length : 0;
+ return !!length && baseIndexOf(array, value, 0) > -1;
+}
+
+/**
+ * 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;
+ }
}
- if (r.resizeObserver) {
- r.resizeObserver.disconnect();
+ 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) {
+ if (value !== value) {
+ return baseFindIndex(array, baseIsNaN, fromIndex);
}
- if (r.labelCalcDiv) {
- try {
- document.body.removeChild(r.labelCalcDiv); // eslint-disable-line no-undef
- } catch (e) {
- // ie10 issue #1014
+ var index = fromIndex - 1,
+ length = array.length;
+
+ while (++index < length) {
+ if (array[index] === value) {
+ return index;
}
}
-};
-BRp.isHeadless = function () {
- return false;
-};
-[BRp$f, BRp$5, BRp$4, BRp$3, BRp$2, BRp$1].forEach(function (props) {
- extend(BRp, props);
-});
+ return -1;
+}
-var fullFpsTime = 1000 / 60; // assume 60 frames per second
+/**
+ * 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;
+}
-var defs = {
- setupDequeueing: function setupDequeueing(opts) {
- return function setupDequeueingImpl() {
- var self = this;
- var r = this.renderer;
- if (self.dequeueingSetup) {
- return;
- } else {
- self.dequeueingSetup = true;
- }
- var queueRedraw = debounce__default["default"](function () {
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- r.redraw();
- }, opts.deqRedrawThreshold);
- var dequeue = function dequeue(willDraw, frameStartTime) {
- var startTime = performanceNow();
- var avgRenderTime = r.averageRedrawTime;
- var renderTime = r.lastRedrawTime;
- var deqd = [];
- var extent = r.cy.extent();
- var pixelRatio = r.getPixelRatio();
+/**
+ * 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;
- // if we aren't in a tick that causes a draw, then the rendered style
- // queue won't automatically be flushed before dequeueing starts
- if (!willDraw) {
- r.flushRenderedStyleQueue();
- }
- while (true) {
- // eslint-disable-line no-constant-condition
- var now = performanceNow();
- var duration = now - startTime;
- var frameDuration = now - frameStartTime;
- if (renderTime < fullFpsTime) {
- // if we're rendering faster than the ideal fps, then do dequeueing
- // during all of the remaining frame time
+ while (length--) {
+ if (array[length] === placeholder) {
+ result++;
+ }
+ }
+ return result;
+}
- var timeAvailable = fullFpsTime - (willDraw ? avgRenderTime : 0);
- if (frameDuration >= opts.deqFastCost * timeAvailable) {
- break;
- }
- } else {
- if (willDraw) {
- if (duration >= opts.deqCost * renderTime || duration >= opts.deqAvgCost * avgRenderTime) {
- break;
- }
- } else if (frameDuration >= opts.deqNoDrawCost * fullFpsTime) {
- break;
- }
- }
- var thisDeqd = opts.deq(self, pixelRatio, extent);
- if (thisDeqd.length > 0) {
- for (var i = 0; i < thisDeqd.length; i++) {
- deqd.push(thisDeqd[i]);
- }
- } else {
- break;
- }
- }
+/**
+ * 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];
+}
- // callbacks on dequeue
- if (deqd.length > 0) {
- opts.onDeqd(self, deqd);
- if (!willDraw && opts.shouldRedraw(self, deqd, pixelRatio, extent)) {
- queueRedraw();
- }
- }
- };
- var priority = opts.priority || noop$1;
- r.beforeRender(dequeue, priority(self));
- };
+/**
+ * Checks if `value` is a host object in IE < 9.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
+ */
+function isHostObject(value) {
+ // Many host objects are `Object` objects that can coerce to strings
+ // despite having improperly defined `toString` methods.
+ var result = false;
+ if (value != null && typeof value.toString != 'function') {
+ try {
+ result = !!(value + '');
+ } catch (e) {}
}
-};
+ return result;
+}
-// Allows lookups for (ele, lvl) => cache.
-// Uses keys so elements may share the same cache.
-var ElementTextureCacheLookup = /*#__PURE__*/function () {
- function ElementTextureCacheLookup(getKey) {
- var doesEleInvalidateKey = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : falsify;
- _classCallCheck(this, ElementTextureCacheLookup);
- this.idsByKey = new Map$1();
- this.keyForId = new Map$1();
- this.cachesByLvl = new Map$1();
- this.lvls = [];
- this.getKey = getKey;
- this.doesEleInvalidateKey = doesEleInvalidateKey;
- }
- _createClass(ElementTextureCacheLookup, [{
- key: "getIdsFor",
- value: function getIdsFor(key) {
- if (key == null) {
- error("Can not get id list for null key");
- }
- var idsByKey = this.idsByKey;
- var ids = this.idsByKey.get(key);
- if (!ids) {
- ids = new Set$1();
- idsByKey.set(key, ids);
- }
- return ids;
- }
- }, {
- key: "addIdForKey",
- value: function addIdForKey(key, id) {
- if (key != null) {
- this.getIdsFor(key).add(id);
- }
- }
- }, {
- key: "deleteIdForKey",
- value: function deleteIdForKey(key, id) {
- if (key != null) {
- this.getIdsFor(key)["delete"](id);
- }
- }
- }, {
- key: "getNumberOfIdsForKey",
- value: function getNumberOfIdsForKey(key) {
- if (key == null) {
- return 0;
- } else {
- return this.getIdsFor(key).size;
- }
- }
- }, {
- key: "updateKeyMappingFor",
- value: function updateKeyMappingFor(ele) {
- var id = ele.id();
- var prevKey = this.keyForId.get(id);
- var currKey = this.getKey(ele);
- this.deleteIdForKey(prevKey, id);
- this.addIdForKey(currKey, id);
- this.keyForId.set(id, currKey);
- }
- }, {
- key: "deleteKeyMappingFor",
- value: function deleteKeyMappingFor(ele) {
- var id = ele.id();
- var prevKey = this.keyForId.get(id);
- this.deleteIdForKey(prevKey, id);
- this.keyForId["delete"](id);
- }
- }, {
- key: "keyHasChangedFor",
- value: function keyHasChangedFor(ele) {
- var id = ele.id();
- var prevKey = this.keyForId.get(id);
- var newKey = this.getKey(ele);
- return prevKey !== newKey;
- }
- }, {
- key: "isInvalid",
- value: function isInvalid(ele) {
- return this.keyHasChangedFor(ele) || this.doesEleInvalidateKey(ele);
- }
- }, {
- key: "getCachesAt",
- value: function getCachesAt(lvl) {
- var cachesByLvl = this.cachesByLvl,
- lvls = this.lvls;
- var caches = cachesByLvl.get(lvl);
- if (!caches) {
- caches = new Map$1();
- cachesByLvl.set(lvl, caches);
- lvls.push(lvl);
- }
- return caches;
- }
- }, {
- key: "getCache",
- value: function getCache(key, lvl) {
- return this.getCachesAt(lvl).get(key);
- }
- }, {
- key: "get",
- value: function get(ele, lvl) {
- var key = this.getKey(ele);
- var cache = this.getCache(key, lvl);
+/**
+ * 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 = [];
- // getting for an element may need to add to the id list b/c eles can share keys
- if (cache != null) {
- this.updateKeyMappingFor(ele);
- }
- return cache;
- }
- }, {
- key: "getForCachedKey",
- value: function getForCachedKey(ele, lvl) {
- var key = this.keyForId.get(ele.id()); // n.b. use cached key, not newly computed key
- var cache = this.getCache(key, lvl);
- return cache;
- }
- }, {
- key: "hasCache",
- value: function hasCache(key, lvl) {
- return this.getCachesAt(lvl).has(key);
- }
- }, {
- key: "has",
- value: function has(ele, lvl) {
- var key = this.getKey(ele);
- return this.hasCache(key, lvl);
- }
- }, {
- key: "setCache",
- value: function setCache(key, lvl, cache) {
- cache.key = key;
- this.getCachesAt(lvl).set(key, cache);
- }
- }, {
- key: "set",
- value: function set(ele, lvl, cache) {
- var key = this.getKey(ele);
- this.setCache(key, lvl, cache);
- this.updateKeyMappingFor(ele);
- }
- }, {
- key: "deleteCache",
- value: function deleteCache(key, lvl) {
- this.getCachesAt(lvl)["delete"](key);
- }
- }, {
- key: "delete",
- value: function _delete(ele, lvl) {
- var key = this.getKey(ele);
- this.deleteCache(key, lvl);
- }
- }, {
- key: "invalidateKey",
- value: function invalidateKey(key) {
- var _this = this;
- this.lvls.forEach(function (lvl) {
- return _this.deleteCache(key, lvl);
- });
+ while (++index < length) {
+ var value = array[index];
+ if (value === placeholder || value === PLACEHOLDER) {
+ array[index] = PLACEHOLDER;
+ result[resIndex++] = index;
}
+ }
+ return result;
+}
- // returns true if no other eles reference the invalidated cache (n.b. other eles may need the cache with the same key)
- }, {
- key: "invalidate",
- value: function invalidate(ele) {
- var id = ele.id();
- var key = this.keyForId.get(id); // n.b. use stored key rather than current (potential key)
+/** Used for built-in method references. */
+var funcProto = Function.prototype,
+ objectProto = Object.prototype;
- this.deleteKeyMappingFor(ele);
- var entireKeyInvalidated = this.doesEleInvalidateKey(ele);
- if (entireKeyInvalidated) {
- // clear mapping for current key
- this.invalidateKey(key);
- }
- return entireKeyInvalidated || this.getNumberOfIdsForKey(key) === 0;
- }
- }]);
- return ElementTextureCacheLookup;
-}();
+/** Used to detect overreaching core-js shims. */
+var coreJsData = root['__core-js_shared__'];
-var minTxrH = 25; // the size of the texture cache for small height eles (special case)
-var txrStepH = 50; // the min size of the regular cache, and the size it increases with each step up
-var minLvl$1 = -4; // when scaling smaller than that we don't need to re-render
-var maxLvl$1 = 3; // when larger than this scale just render directly (caching is not helpful)
-var maxZoom$1 = 7.99; // beyond this zoom level, layered textures are not used
-var eleTxrSpacing = 8; // spacing between elements on textures to avoid blitting overlaps
-var defTxrWidth = 1024; // default/minimum texture width
-var maxTxrW = 1024; // the maximum width of a texture
-var maxTxrH = 1024; // the maximum height of a texture
-var minUtility = 0.2; // if usage of texture is less than this, it is retired
-var maxFullness = 0.8; // fullness of texture after which queue removal is checked
-var maxFullnessChecks = 10; // dequeued after this many checks
-var deqCost$1 = 0.15; // % of add'l rendering cost allowed for dequeuing ele caches each frame
-var deqAvgCost$1 = 0.1; // % of add'l rendering cost compared to average overall redraw time
-var deqNoDrawCost$1 = 0.9; // % of avg frame time that can be used for dequeueing when not drawing
-var deqFastCost$1 = 0.9; // % of frame time to be used when >60fps
-var deqRedrawThreshold$1 = 100; // time to batch redraws together from dequeueing to allow more dequeueing calcs to happen in the meanwhile
-var maxDeqSize$1 = 1; // number of eles to dequeue and render at higher texture in each batch
+/** 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) : '';
+}());
-var getTxrReasons = {
- dequeue: 'dequeue',
- downscale: 'downscale',
- highQuality: 'highQuality'
-};
-var initDefaults = defaults$g({
- getKey: null,
- doesEleInvalidateKey: falsify,
- drawElement: null,
- getBoundingBox: null,
- getRotationPoint: null,
- getRotationOffset: null,
- isVisible: trueify,
- allowEdgeTxrCaching: true,
- allowParentTxrCaching: true
-});
-var ElementTextureCache = function ElementTextureCache(renderer, initOptions) {
- var self = this;
- self.renderer = renderer;
- self.onDequeues = [];
- var opts = initDefaults(initOptions);
- extend(self, opts);
- self.lookup = new ElementTextureCacheLookup(opts.getKey, opts.doesEleInvalidateKey);
- self.setupDequeueing();
-};
-var ETCp = ElementTextureCache.prototype;
-ETCp.reasons = getTxrReasons;
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
-// the list of textures in which new subtextures for elements can be placed
-ETCp.getTextureQueue = function (txrH) {
- var self = this;
- self.eleImgCaches = self.eleImgCaches || {};
- return self.eleImgCaches[txrH] = self.eleImgCaches[txrH] || [];
-};
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
-// the list of usused textures which can be recycled (in use in texture queue)
-ETCp.getRetiredTextureQueue = function (txrH) {
- var self = this;
- var rtxtrQs = self.eleImgCaches.retired = self.eleImgCaches.retired || {};
- var rtxtrQ = rtxtrQs[txrH] = rtxtrQs[txrH] || [];
- return rtxtrQ;
-};
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var objectToString = objectProto.toString;
-// queue of element draw requests at different scale levels
-ETCp.getElementQueue = function () {
- var self = this;
- var q = self.eleCacheQueue = self.eleCacheQueue || new Heap__default["default"](function (a, b) {
- return b.reqs - a.reqs;
- });
- return q;
-};
+/** Used to detect if a method is native. */
+var reIsNative = RegExp('^' +
+ funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
+ .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+);
-// queue of element draw requests at different scale levels (element id lookup)
-ETCp.getElementKeyToQueue = function () {
- var self = this;
- var k2q = self.eleKeyToCacheQueue = self.eleKeyToCacheQueue || {};
- return k2q;
-};
-ETCp.getElement = function (ele, bb, pxRatio, lvl, reason) {
- var self = this;
- var r = this.renderer;
- var zoom = r.cy.zoom();
- var lookup = this.lookup;
- if (!bb || bb.w === 0 || bb.h === 0 || isNaN(bb.w) || isNaN(bb.h) || !ele.visible() || ele.removed()) {
- return null;
- }
- if (!self.allowEdgeTxrCaching && ele.isEdge() || !self.allowParentTxrCaching && ele.isParent()) {
- return null;
+/** Built-in value references. */
+var objectCreate = Object.create;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max,
+ nativeMin = Math.min;
+
+/* Used to set `toString` methods. */
+var defineProperty = (function() {
+ var func = getNative(Object, 'defineProperty'),
+ name = getNative.name;
+
+ return (name && name.length > 2) ? func : undefined;
+}());
+
+/**
+ * The base implementation of `_.create` without support for assigning
+ * properties to the created object.
+ *
+ * @private
+ * @param {Object} prototype The object to inherit from.
+ * @returns {Object} Returns the new object.
+ */
+function baseCreate(proto) {
+ return isObject(proto) ? objectCreate(proto) : {};
+}
+
+/**
+ * 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;
}
- if (lvl == null) {
- lvl = Math.ceil(log2(zoom * pxRatio));
+ var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;
+ return pattern.test(toSource(value));
+}
+
+/**
+ * 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];
}
- if (lvl < minLvl$1) {
- lvl = minLvl$1;
- } else if (zoom >= maxZoom$1 || lvl > maxLvl$1) {
- return null;
+ while (++argsIndex < holdersLength) {
+ if (isUncurried || argsIndex < argsLength) {
+ result[holders[argsIndex]] = args[argsIndex];
+ }
}
- var scale = Math.pow(2, lvl);
- var eleScaledH = bb.h * scale;
- var eleScaledW = bb.w * scale;
- var scaledLabelShown = r.eleTextBiggerThanMin(ele, scale);
- if (!this.isVisible(ele, scaledLabelShown)) {
- return null;
+ while (rangeLength--) {
+ result[leftIndex++] = args[argsIndex++];
}
- var eleCache = lookup.get(ele, lvl);
+ return result;
+}
- // if this get was on an unused/invalidated cache, then restore the texture usage metric
- if (eleCache && eleCache.invalidated) {
- eleCache.invalidated = false;
- eleCache.texture.invalidatedWidth -= eleCache.width;
+/**
+ * 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];
}
- if (eleCache) {
- return eleCache;
+ var offset = argsIndex;
+ while (++rightIndex < rightLength) {
+ result[offset + rightIndex] = partials[rightIndex];
}
- var txrH; // which texture height this ele belongs to
+ while (++holdersIndex < holdersLength) {
+ if (isUncurried || argsIndex < argsLength) {
+ result[offset + holders[holdersIndex]] = args[argsIndex++];
+ }
+ }
+ return result;
+}
- if (eleScaledH <= minTxrH) {
- txrH = minTxrH;
- } else if (eleScaledH <= txrStepH) {
- txrH = txrStepH;
- } else {
- txrH = Math.ceil(eleScaledH / txrStepH) * txrStepH;
+/**
+ * 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];
}
- if (eleScaledH > maxTxrH || eleScaledW > maxTxrW) {
- return null; // caching large elements is not efficient
+ return array;
+}
+
+/**
+ * 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 & 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;
+}
- var txrQ = self.getTextureQueue(txrH);
+/**
+ * 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);
- // first try the second last one in case it has space at the end
- var txr = txrQ[txrQ.length - 2];
- var addNewTxr = function addNewTxr() {
- return self.recycleTexture(txrH, eleScaledW) || self.addTexture(txrH, eleScaledW);
+ // Mimic the constructor's `return` behavior.
+ // See https://es5.github.io/#x13.2.2 for more details.
+ return isObject(result) ? result : thisBinding;
};
+}
- // try the last one if there is no second last one
- if (!txr) {
- txr = txrQ[txrQ.length - 1];
- }
+/**
+ * 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);
- // if the last one doesn't exist, we need a first one
- if (!txr) {
- txr = addNewTxr();
- }
+ function wrapper() {
+ var length = arguments.length,
+ args = Array(length),
+ index = length,
+ placeholder = getHolder(wrapper);
- // if there's no room in the current texture, we need a new one
- if (txr.width - txr.usedWidth < eleScaledW) {
- txr = addNewTxr();
- }
- var scalableFrom = function scalableFrom(otherCache) {
- return otherCache && otherCache.scaledLabelShown === scaledLabelShown;
- };
- var deqing = reason && reason === getTxrReasons.dequeue;
- var highQualityReq = reason && reason === getTxrReasons.highQuality;
- var downscaleReq = reason && reason === getTxrReasons.downscale;
- var higherCache; // the nearest cache with a higher level
- for (var l = lvl + 1; l <= maxLvl$1; l++) {
- var c = lookup.get(ele, l);
- if (c) {
- higherCache = c;
- break;
+ 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);
}
- var oneUpCache = higherCache && higherCache.level === lvl + 1 ? higherCache : null;
- var downscale = function downscale() {
- txr.context.drawImage(oneUpCache.texture.canvas, oneUpCache.x, 0, oneUpCache.width, oneUpCache.height, txr.usedWidth, 0, eleScaledW, eleScaledH);
- };
+ return wrapper;
+}
- // reset ele area in texture
- txr.context.setTransform(1, 0, 0, 1, 0, 0);
- txr.context.clearRect(txr.usedWidth, 0, eleScaledW, txrH);
- if (scalableFrom(oneUpCache)) {
- // then we can relatively cheaply rescale the existing image w/o rerendering
- downscale();
- } else if (scalableFrom(higherCache)) {
- // then use the higher cache for now and queue the next level down
- // to cheaply scale towards the smaller level
+/**
+ * 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 & ARY_FLAG,
+ isBind = bitmask & BIND_FLAG,
+ isBindKey = bitmask & BIND_KEY_FLAG,
+ isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG),
+ isFlip = bitmask & FLIP_FLAG,
+ Ctor = isBindKey ? undefined : createCtor(func);
- if (highQualityReq) {
- for (var _l = higherCache.level; _l > lvl; _l--) {
- oneUpCache = self.getElement(ele, bb, pxRatio, _l, getTxrReasons.downscale);
- }
- downscale();
- } else {
- self.queueElement(ele, higherCache.level - 1);
- return higherCache;
+ function wrapper() {
+ var length = arguments.length,
+ args = Array(length),
+ index = length;
+
+ while (index--) {
+ args[index] = arguments[index];
}
- } else {
- var lowerCache; // the nearest cache with a lower level
- if (!deqing && !highQualityReq && !downscaleReq) {
- for (var _l2 = lvl - 1; _l2 >= minLvl$1; _l2--) {
- var _c = lookup.get(ele, _l2);
- if (_c) {
- lowerCache = _c;
- break;
- }
- }
+ if (isCurried) {
+ var placeholder = getHolder(wrapper),
+ holdersCount = countHolders(args, placeholder);
}
- if (scalableFrom(lowerCache)) {
- // then use the lower quality cache for now and queue the better one for later
+ 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;
- self.queueElement(ele, lvl);
- return lowerCache;
+ length = args.length;
+ if (argPos) {
+ args = reorder(args, argPos);
+ } else if (isFlip && length > 1) {
+ args.reverse();
}
- txr.context.translate(txr.usedWidth, 0);
- txr.context.scale(scale, scale);
- this.drawElement(txr.context, ele, bb, scaledLabelShown, false);
- txr.context.scale(1 / scale, 1 / scale);
- txr.context.translate(-txr.usedWidth, 0);
- }
- eleCache = {
- x: txr.usedWidth,
- texture: txr,
- level: lvl,
- scale: scale,
- width: eleScaledW,
- height: eleScaledH,
- scaledLabelShown: scaledLabelShown
- };
- txr.usedWidth += Math.ceil(eleScaledW + eleTxrSpacing);
- txr.eleCaches.push(eleCache);
- lookup.set(ele, lvl, eleCache);
- self.checkTextureFullness(txr);
- return eleCache;
-};
-ETCp.invalidateElements = function (eles) {
- for (var i = 0; i < eles.length; i++) {
- this.invalidateElement(eles[i]);
- }
-};
-ETCp.invalidateElement = function (ele) {
- var self = this;
- var lookup = self.lookup;
- var caches = [];
- var invalid = lookup.isInvalid(ele);
- if (!invalid) {
- return; // override the invalidation request if the element key has not changed
+ 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;
+}
- for (var lvl = minLvl$1; lvl <= maxLvl$1; lvl++) {
- var cache = lookup.getForCachedKey(ele, lvl);
- if (cache) {
- caches.push(cache);
+/**
+ * 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 & 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);
}
- var noOtherElesUseCache = lookup.invalidate(ele);
- if (noOtherElesUseCache) {
- for (var i = 0; i < caches.length; i++) {
- var _cache = caches[i];
- var txr = _cache.texture;
+ return wrapper;
+}
- // remove space from the texture it belongs to
- txr.invalidatedWidth += _cache.width;
+/**
+ * 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 & CURRY_FLAG,
+ newHolders = isCurry ? holders : undefined,
+ newHoldersRight = isCurry ? undefined : holders,
+ newPartials = isCurry ? partials : undefined,
+ newPartialsRight = isCurry ? undefined : partials;
- // mark the cache as invalidated
- _cache.invalidated = true;
+ bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
+ bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);
- // retire the texture if its utility is low
- self.checkTextureUtility(txr);
- }
+ if (!(bitmask & CURRY_BOUND_FLAG)) {
+ bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
}
- // remove from queue since the old req was for the old state
- self.removeFromQueue(ele);
-};
-ETCp.checkTextureUtility = function (txr) {
- // invalidate all entries in the cache if the cache size is small
- if (txr.invalidatedWidth >= minUtility * txr.width) {
- this.retireTexture(txr);
+ var result = wrapFunc(func, bitmask, thisArg, newPartials, newHolders, newPartialsRight, newHoldersRight, argPos, ary, arity);
+ result.placeholder = placeholder;
+ return setWrapToString(result, func, bitmask);
+}
+
+/**
+ * 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.
+ * The bitmask may be composed of the following 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 & BIND_KEY_FLAG;
+ if (!isBindKey && typeof func != 'function') {
+ throw new TypeError(FUNC_ERROR_TEXT);
}
-};
-ETCp.checkTextureFullness = function (txr) {
- // if texture has been mostly filled and passed over several times, remove
- // it from the queue so we don't need to waste time looking at it to put new things
+ var length = partials ? partials.length : 0;
+ if (!length) {
+ bitmask &= ~(PARTIAL_FLAG | 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 & PARTIAL_RIGHT_FLAG) {
+ var partialsRight = partials,
+ holdersRight = holders;
+
+ partials = holders = undefined;
+ }
+
+ var newData = [
+ func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
+ argPos, ary, arity
+ ];
- var self = this;
- var txrQ = self.getTextureQueue(txr.height);
- if (txr.usedWidth / txr.width > maxFullness && txr.fullnessChecks >= maxFullnessChecks) {
- removeFromArray(txrQ, txr);
+ func = newData[0];
+ bitmask = newData[1];
+ thisArg = newData[2];
+ partials = newData[3];
+ holders = newData[4];
+ arity = newData[9] = newData[9] == null
+ ? (isBindKey ? 0 : func.length)
+ : nativeMax(newData[9] - length, 0);
+
+ if (!arity && bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG)) {
+ bitmask &= ~(CURRY_FLAG | CURRY_RIGHT_FLAG);
+ }
+ if (!bitmask || bitmask == BIND_FLAG) {
+ var result = createBind(func, bitmask, thisArg);
+ } else if (bitmask == CURRY_FLAG || bitmask == CURRY_RIGHT_FLAG) {
+ result = createCurry(func, bitmask, arity);
+ } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !holders.length) {
+ result = createPartial(func, bitmask, thisArg, partials);
} else {
- txr.fullnessChecks++;
+ result = createHybrid.apply(undefined, newData);
}
-};
-ETCp.retireTexture = function (txr) {
- var self = this;
- var txrH = txr.height;
- var txrQ = self.getTextureQueue(txrH);
- var lookup = this.lookup;
+ return setWrapToString(result, func, bitmask);
+}
- // retire the texture from the active / searchable queue:
+/**
+ * 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 = func;
+ return object.placeholder;
+}
- removeFromArray(txrQ, txr);
- txr.retired = true;
+/**
+ * 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;
+}
- // remove the refs from the eles to the caches:
+/**
+ * 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) : [];
+}
- var eleCaches = txr.eleCaches;
- for (var i = 0; i < eleCaches.length; i++) {
- var eleCache = eleCaches[i];
- lookup.deleteCache(eleCache.key, eleCache.level);
- }
- clearArray(eleCaches);
+/**
+ * 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,
+ lastIndex = length - 1;
- // add the texture to a retired queue so it can be recycled in future:
+ details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];
+ details = details.join(length > 2 ? ', ' : ' ');
+ return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n');
+}
- var rtxtrQ = self.getRetiredTextureQueue(txrH);
- rtxtrQ.push(txr);
-};
-ETCp.addTexture = function (txrH, minW) {
- var self = this;
- var txrQ = self.getTextureQueue(txrH);
- var txr = {};
- txrQ.push(txr);
- txr.eleCaches = [];
- txr.height = txrH;
- txr.width = Math.max(defTxrWidth, minW);
- txr.usedWidth = 0;
- txr.invalidatedWidth = 0;
- txr.fullnessChecks = 0;
- txr.canvas = self.renderer.makeOffscreenCanvas(txr.width, txr.height);
- txr.context = txr.canvas.getContext('2d');
- return txr;
-};
-ETCp.recycleTexture = function (txrH, minW) {
- var self = this;
- var txrQ = self.getTextureQueue(txrH);
- var rtxtrQ = self.getRetiredTextureQueue(txrH);
- for (var i = 0; i < rtxtrQ.length; i++) {
- var txr = rtxtrQ[i];
- if (txr.width >= minW) {
- txr.retired = false;
- txr.usedWidth = 0;
- txr.invalidatedWidth = 0;
- txr.fullnessChecks = 0;
- clearArray(txr.eleCaches);
- txr.context.setTransform(1, 0, 0, 1, 0, 0);
- txr.context.clearRect(0, 0, txr.width, txr.height);
- removeFromArray(rtxtrQ, txr);
- txrQ.push(txr);
- return txr;
- }
- }
-};
-ETCp.queueElement = function (ele, lvl) {
- var self = this;
- var q = self.getElementQueue();
- var k2q = self.getElementKeyToQueue();
- var key = this.getKey(ele);
- var existingReq = k2q[key];
- if (existingReq) {
- // use the max lvl b/c in between lvls are cheap to make
- existingReq.level = Math.max(existingReq.level, lvl);
- existingReq.eles.merge(ele);
- existingReq.reqs++;
- q.updateItem(existingReq);
- } else {
- var req = {
- eles: ele.spawn().merge(ele),
- level: lvl,
- reqs: 1,
- key: key
- };
- q.push(req);
- k2q[key] = req;
- }
-};
-ETCp.dequeue = function (pxRatio /*, extent*/) {
- var self = this;
- var q = self.getElementQueue();
- var k2q = self.getElementKeyToQueue();
- var dequeued = [];
- var lookup = self.lookup;
- for (var i = 0; i < maxDeqSize$1; i++) {
- if (q.size() > 0) {
- var req = q.pop();
- var key = req.key;
- var ele = req.eles[0]; // all eles have the same key
- var cacheExists = lookup.hasCache(ele, req.level);
+/**
+ * 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);
+}
- // clear out the key to req lookup
- k2q[key] = null;
+/**
+ * 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);
+}
- // dequeueing isn't necessary with an existing cache
- if (cacheExists) {
- continue;
- }
- dequeued.push(req);
- var bb = self.getBoundingBox(ele);
- self.getElement(ele, bb, pxRatio, req.level, getTxrReasons.dequeue);
- } else {
- break;
- }
+/**
+ * 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 dequeued;
+ return array;
+}
+
+/**
+ * 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`.
+ */
+var setWrapToString = !defineProperty ? identity : function(wrapper, reference, bitmask) {
+ var source = (reference + '');
+ return defineProperty(wrapper, 'toString', {
+ 'configurable': true,
+ 'enumerable': false,
+ 'value': constant(insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)))
+ });
};
-ETCp.removeFromQueue = function (ele) {
- var self = this;
- var q = self.getElementQueue();
- var k2q = self.getElementKeyToQueue();
- var key = this.getKey(ele);
- var req = k2q[key];
- if (req != null) {
- if (req.eles.length === 1) {
- // remove if last ele in the req
- // bring to front of queue
- req.reqs = MAX_INT$1;
- q.updateItem(req);
- q.pop(); // remove from queue
- k2q[key] = null; // remove from lookup map
- } else {
- // otherwise just remove ele from req
- req.eles.unmerge(ele);
- }
+/**
+ * Converts `func` to its source code.
+ *
+ * @private
+ * @param {Function} func The function to process.
+ * @returns {string} Returns the source code.
+ */
+function toSource(func) {
+ if (func != null) {
+ try {
+ return funcToString.call(func);
+ } catch (e) {}
+ try {
+ return (func + '');
+ } catch (e) {}
}
-};
-ETCp.onDequeue = function (fn) {
- this.onDequeues.push(fn);
-};
-ETCp.offDequeue = function (fn) {
- removeFromArray(this.onDequeues, fn);
-};
-ETCp.setupDequeueing = defs.setupDequeueing({
- deqRedrawThreshold: deqRedrawThreshold$1,
- deqCost: deqCost$1,
- deqAvgCost: deqAvgCost$1,
- deqNoDrawCost: deqNoDrawCost$1,
- deqFastCost: deqFastCost$1,
- deq: function deq(self, pxRatio, extent) {
- return self.dequeue(pxRatio, extent);
- },
- onDeqd: function onDeqd(self, deqd) {
- for (var i = 0; i < self.onDequeues.length; i++) {
- var fn = self.onDequeues[i];
- fn(deqd);
- }
- },
- shouldRedraw: function shouldRedraw(self, deqd, pxRatio, extent) {
- for (var i = 0; i < deqd.length; i++) {
- var eles = deqd[i].eles;
- for (var j = 0; j < eles.length; j++) {
- var bb = eles[j].boundingBox();
- if (boundingBoxesIntersect(bb, extent)) {
- return true;
- }
- }
+ 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 false;
- },
- priority: function priority(self) {
- return self.renderer.beforeRenderPriorities.eleTxrDeq;
- }
-});
+ });
+ return details.sort();
+}
-var defNumLayers = 1; // default number of layers to use
-var minLvl = -4; // when scaling smaller than that we don't need to re-render
-var maxLvl = 2; // when larger than this scale just render directly (caching is not helpful)
-var maxZoom = 3.99; // beyond this zoom level, layered textures are not used
-var deqRedrawThreshold = 50; // time to batch redraws together from dequeueing to allow more dequeueing calcs to happen in the meanwhile
-var refineEleDebounceTime = 50; // time to debounce sharper ele texture updates
-var deqCost = 0.15; // % of add'l rendering cost allowed for dequeuing ele caches each frame
-var deqAvgCost = 0.1; // % of add'l rendering cost compared to average overall redraw time
-var deqNoDrawCost = 0.9; // % of avg frame time that can be used for dequeueing when not drawing
-var deqFastCost = 0.9; // % of frame time to be used when >60fps
-var maxDeqSize = 1; // number of eles to dequeue and render at higher texture in each batch
-var invalidThreshold = 250; // time threshold for disabling b/c of invalidations
-var maxLayerArea = 4000 * 4000; // layers can't be bigger than this
-var useHighQualityEleTxrReqs = true; // whether to use high quality ele txr requests (generally faster and cheaper in the longterm)
+/**
+ * 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, CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
+ result.placeholder = curry.placeholder;
+ return result;
+}
-// var log = function(){ console.log.apply( console, arguments ); };
+/**
+ * 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) {
+ // The use of `Object#toString` avoids issues with the `typeof` operator
+ // in Safari 8-9 which returns 'object' for typed array and other constructors.
+ var tag = isObject(value) ? objectToString.call(value) : '';
+ return tag == funcTag || tag == genTag;
+}
-var LayeredTextureCache = function LayeredTextureCache(renderer) {
- var self = this;
- var r = self.renderer = renderer;
- var cy = r.cy;
- self.layersByLevel = {}; // e.g. 2 => [ layer1, layer2, ..., layerN ]
+/**
+ * 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 && (type == 'object' || type == 'function');
+}
- self.firstGet = true;
- self.lastInvalidationTime = performanceNow() - 2 * invalidThreshold;
- self.skipping = false;
- self.eleTxrDeqs = cy.collection();
- self.scheduleElementRefinement = debounce__default["default"](function () {
- self.refineElementTextures(self.eleTxrDeqs);
- self.eleTxrDeqs.unmerge(self.eleTxrDeqs);
- }, refineEleDebounceTime);
- r.beforeRender(function (willDraw, now) {
- if (now - self.lastInvalidationTime <= invalidThreshold) {
- self.skipping = true;
- } else {
- self.skipping = false;
- }
- }, r.beforeRenderPriorities.lyrTxrSkip);
- var qSort = function qSort(a, b) {
- return b.reqs - a.reqs;
- };
- self.layersQueue = new Heap__default["default"](qSort);
- self.setupDequeueing();
-};
-var LTCp = LayeredTextureCache.prototype;
-var layerIdPool = 0;
-var MAX_INT = Math.pow(2, 53) - 1;
-LTCp.makeLayer = function (bb, lvl) {
- var scale = Math.pow(2, lvl);
- var w = Math.ceil(bb.w * scale);
- var h = Math.ceil(bb.h * scale);
- var canvas = this.renderer.makeOffscreenCanvas(w, h);
- var layer = {
- id: layerIdPool = ++layerIdPool % MAX_INT,
- bb: bb,
- level: lvl,
- width: w,
- height: h,
- canvas: canvas,
- context: canvas.getContext('2d'),
- eles: [],
- elesQueue: [],
- reqs: 0
- };
+/**
+ * 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 && typeof value == 'object';
+}
- // log('make layer %s with w %s and h %s and lvl %s', layer.id, layer.width, layer.height, layer.level);
+/**
+ * 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) && objectToString.call(value) == symbolTag);
+}
- var cxt = layer.context;
- var dx = -layer.bb.x1;
- var dy = -layer.bb.y1;
+/**
+ * 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;
+}
- // do the transform on creation to save cycles (it's the same for all eles)
- cxt.scale(scale, scale);
- cxt.translate(dx, dy);
- return layer;
-};
-LTCp.getLayers = function (eles, pxRatio, lvl) {
- var self = this;
- var r = self.renderer;
- var cy = r.cy;
- var zoom = cy.zoom();
- var firstGet = self.firstGet;
- self.firstGet = false;
+/**
+ * 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;
- // log('--\nget layers with %s eles', eles.length);
- //log eles.map(function(ele){ return ele.id() }) );
+ return result === result ? (remainder ? result - remainder : result) : 0;
+}
- if (lvl == null) {
- lvl = Math.ceil(log2(zoom * pxRatio));
- if (lvl < minLvl) {
- lvl = minLvl;
- } else if (zoom >= maxZoom || lvl > maxLvl) {
- return null;
- }
+/**
+ * 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;
}
- self.validateLayersElesOrdering(lvl, eles);
- var layersByLvl = self.layersByLevel;
- var scale = Math.pow(2, lvl);
- var layers = layersByLvl[lvl] = layersByLvl[lvl] || [];
- var bb;
- var lvlComplete = self.levelIsComplete(lvl, eles);
- var tmpLayers;
- var checkTempLevels = function checkTempLevels() {
- var canUseAsTmpLvl = function canUseAsTmpLvl(l) {
- self.validateLayersElesOrdering(l, eles);
- if (self.levelIsComplete(l, eles)) {
- tmpLayers = layersByLvl[l];
- return true;
- }
- };
- var checkLvls = function checkLvls(dir) {
- if (tmpLayers) {
- return;
- }
- for (var l = lvl + dir; minLvl <= l && l <= maxLvl; l += dir) {
- if (canUseAsTmpLvl(l)) {
- break;
- }
- }
- };
- checkLvls(+1);
- checkLvls(-1);
-
- // remove the invalid layers; they will be replaced as needed later in this function
- for (var i = layers.length - 1; i >= 0; i--) {
- var layer = layers[i];
- if (layer.invalid) {
- removeFromArray(layers, layer);
- }
- }
- };
- if (!lvlComplete) {
- // if the current level is incomplete, then use the closest, best quality layerset temporarily
- // and later queue the current layerset so we can get the proper quality level soon
-
- checkTempLevels();
- } else {
- // log('level complete, using existing layers\n--');
- return layers;
+ if (isSymbol(value)) {
+ return NAN;
}
- var getBb = function getBb() {
- if (!bb) {
- bb = makeBoundingBox();
- for (var i = 0; i < eles.length; i++) {
- updateBoundingBox(bb, eles[i].boundingBox());
- }
- }
- return bb;
- };
- var makeLayer = function makeLayer(opts) {
- opts = opts || {};
- var after = opts.after;
- getBb();
- var area = bb.w * scale * (bb.h * scale);
- if (area > maxLayerArea) {
- return null;
- }
- var layer = self.makeLayer(bb, lvl);
- if (after != null) {
- var index = layers.indexOf(after) + 1;
- layers.splice(index, 0, layer);
- } else if (opts.insert === undefined || opts.insert) {
- // no after specified => first layer made so put at start
- layers.unshift(layer);
- }
-
- // if( tmpLayers ){
- //self.queueLayer( layer );
- // }
+ 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);
+}
- return layer;
+/**
+ * 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;
};
- if (self.skipping && !firstGet) {
- // log('skip layers');
- return null;
- }
+}
- // log('do layers');
+/**
+ * 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;
+}
- var layer = null;
- var maxElesPerLayer = eles.length / defNumLayers;
- var allowLazyQueueing = !firstGet;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- var rs = ele._private.rscratch;
- var caches = rs.imgLayerCaches = rs.imgLayerCaches || {};
+// Assign default placeholders.
+curry.placeholder = {};
- // log('look at ele', ele.id());
+module.exports = curry;
- var existingLayer = caches[lvl];
- if (existingLayer) {
- // reuse layer for later eles
- // log('reuse layer for', ele.id());
- layer = existingLayer;
- continue;
- }
- if (!layer || layer.eles.length >= maxElesPerLayer || !boundingBoxInBoundingBox(layer.bb, ele.boundingBox())) {
- // log('make new layer for ele %s', ele.id());
- layer = makeLayer({
- insert: true,
- after: layer
- });
+/***/ }),
- // if now layer can be built then we can't use layers at this level
- if (!layer) {
- return null;
- }
+/***/ "./node_modules/lodash/_DataView.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_DataView.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // log('new layer with id %s', layer.id);
- }
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
+ root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
- if (tmpLayers || allowLazyQueueing) {
- // log('queue ele %s in layer %s', ele.id(), layer.id);
- self.queueLayer(layer, ele);
- } else {
- // log('draw ele %s in layer %s', ele.id(), layer.id);
- self.drawEleInLayer(layer, ele, lvl, pxRatio);
- }
- layer.eles.push(ele);
- caches[lvl] = layer;
- }
+/* Built-in method references that are verified to be native. */
+var DataView = getNative(root, 'DataView');
- // log('--');
+module.exports = DataView;
- if (tmpLayers) {
- // then we only queued the current layerset and can't draw it yet
- return tmpLayers;
- }
- if (allowLazyQueueing) {
- // log('lazy queue level', lvl);
- return null;
- }
- return layers;
-};
-// a layer may want to use an ele cache of a higher level to avoid blurriness
-// so the layer level might not equal the ele level
-LTCp.getEleLevelForLayerLevel = function (lvl, pxRatio) {
- return lvl;
-};
-LTCp.drawEleInLayer = function (layer, ele, lvl, pxRatio) {
- var self = this;
- var r = this.renderer;
- var context = layer.context;
- var bb = ele.boundingBox();
- if (bb.w === 0 || bb.h === 0 || !ele.visible()) {
- return;
- }
- lvl = self.getEleLevelForLayerLevel(lvl, pxRatio);
- {
- r.setImgSmoothing(context, false);
- }
- {
- r.drawCachedElement(context, ele, null, null, lvl, useHighQualityEleTxrReqs);
- }
- {
- r.setImgSmoothing(context, true);
- }
-};
-LTCp.levelIsComplete = function (lvl, eles) {
- var self = this;
- var layers = self.layersByLevel[lvl];
- if (!layers || layers.length === 0) {
- return false;
- }
- var numElesInLayers = 0;
- for (var i = 0; i < layers.length; i++) {
- var layer = layers[i];
+/***/ }),
- // if there are any eles needed to be drawn yet, the level is not complete
- if (layer.reqs > 0) {
- return false;
- }
+/***/ "./node_modules/lodash/_Hash.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/_Hash.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // if the layer is invalid, the level is not complete
- if (layer.invalid) {
- return false;
- }
- numElesInLayers += layer.eles.length;
- }
+var hashClear = __webpack_require__(/*! ./_hashClear */ "./node_modules/lodash/_hashClear.js"),
+ hashDelete = __webpack_require__(/*! ./_hashDelete */ "./node_modules/lodash/_hashDelete.js"),
+ hashGet = __webpack_require__(/*! ./_hashGet */ "./node_modules/lodash/_hashGet.js"),
+ hashHas = __webpack_require__(/*! ./_hashHas */ "./node_modules/lodash/_hashHas.js"),
+ hashSet = __webpack_require__(/*! ./_hashSet */ "./node_modules/lodash/_hashSet.js");
- // we should have exactly the number of eles passed in to be complete
- if (numElesInLayers !== eles.length) {
- return false;
- }
- return true;
-};
-LTCp.validateLayersElesOrdering = function (lvl, eles) {
- var layers = this.layersByLevel[lvl];
- if (!layers) {
- return;
- }
+/**
+ * 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;
- // if in a layer the eles are not in the same order, then the layer is invalid
- // (i.e. there is an ele in between the eles in the layer)
+ this.clear();
+ while (++index < length) {
+ var entry = entries[index];
+ this.set(entry[0], entry[1]);
+ }
+}
- for (var i = 0; i < layers.length; i++) {
- var layer = layers[i];
- var offset = -1;
+// Add methods to `Hash`.
+Hash.prototype.clear = hashClear;
+Hash.prototype['delete'] = hashDelete;
+Hash.prototype.get = hashGet;
+Hash.prototype.has = hashHas;
+Hash.prototype.set = hashSet;
- // find the offset
- for (var j = 0; j < eles.length; j++) {
- if (layer.eles[0] === eles[j]) {
- offset = j;
- break;
- }
- }
- if (offset < 0) {
- // then the layer has nonexistent elements and is invalid
- this.invalidateLayer(layer);
- continue;
- }
+module.exports = Hash;
- // the eles in the layer must be in the same continuous order, else the layer is invalid
- var o = offset;
- for (var j = 0; j < layer.eles.length; j++) {
- if (layer.eles[j] !== eles[o + j]) {
- // log('invalidate based on ordering', layer.id);
+/***/ }),
- this.invalidateLayer(layer);
- break;
- }
- }
- }
-};
-LTCp.updateElementsInLayers = function (eles, update) {
- var self = this;
- var isEles = element(eles[0]);
+/***/ "./node_modules/lodash/_ListCache.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_ListCache.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // collect udpated elements (cascaded from the layers) and update each
- // layer itself along the way
- for (var i = 0; i < eles.length; i++) {
- var req = isEles ? null : eles[i];
- var ele = isEles ? eles[i] : eles[i].ele;
- var rs = ele._private.rscratch;
- var caches = rs.imgLayerCaches = rs.imgLayerCaches || {};
- for (var l = minLvl; l <= maxLvl; l++) {
- var layer = caches[l];
- if (!layer) {
- continue;
- }
+var listCacheClear = __webpack_require__(/*! ./_listCacheClear */ "./node_modules/lodash/_listCacheClear.js"),
+ listCacheDelete = __webpack_require__(/*! ./_listCacheDelete */ "./node_modules/lodash/_listCacheDelete.js"),
+ listCacheGet = __webpack_require__(/*! ./_listCacheGet */ "./node_modules/lodash/_listCacheGet.js"),
+ listCacheHas = __webpack_require__(/*! ./_listCacheHas */ "./node_modules/lodash/_listCacheHas.js"),
+ listCacheSet = __webpack_require__(/*! ./_listCacheSet */ "./node_modules/lodash/_listCacheSet.js");
- // if update is a request from the ele cache, then it affects only
- // the matching level
- if (req && self.getEleLevelForLayerLevel(layer.level) !== req.level) {
- continue;
- }
- update(layer, ele, req);
- }
- }
-};
-LTCp.haveLayers = function () {
- var self = this;
- var haveLayers = false;
- for (var l = minLvl; l <= maxLvl; l++) {
- var layers = self.layersByLevel[l];
- if (layers && layers.length > 0) {
- haveLayers = true;
- break;
- }
- }
- return haveLayers;
-};
-LTCp.invalidateElements = function (eles) {
- var self = this;
- if (eles.length === 0) {
- return;
+/**
+ * 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]);
}
- self.lastInvalidationTime = performanceNow();
+}
- // log('update invalidate layer time from eles');
+// Add methods to `ListCache`.
+ListCache.prototype.clear = listCacheClear;
+ListCache.prototype['delete'] = listCacheDelete;
+ListCache.prototype.get = listCacheGet;
+ListCache.prototype.has = listCacheHas;
+ListCache.prototype.set = listCacheSet;
- if (eles.length === 0 || !self.haveLayers()) {
- return;
- }
- self.updateElementsInLayers(eles, function invalAssocLayers(layer, ele, req) {
- self.invalidateLayer(layer);
- });
-};
-LTCp.invalidateLayer = function (layer) {
- // log('update invalidate layer time');
+module.exports = ListCache;
- this.lastInvalidationTime = performanceNow();
- if (layer.invalid) {
- return;
- } // save cycles
- var lvl = layer.level;
- var eles = layer.eles;
- var layers = this.layersByLevel[lvl];
+/***/ }),
- // log('invalidate layer', layer.id );
+/***/ "./node_modules/lodash/_Map.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/_Map.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- removeFromArray(layers, layer);
- // layer.eles = [];
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
+ root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
- layer.elesQueue = [];
- layer.invalid = true;
- if (layer.replacement) {
- layer.replacement.invalid = true;
- }
- for (var i = 0; i < eles.length; i++) {
- var caches = eles[i]._private.rscratch.imgLayerCaches;
- if (caches) {
- caches[lvl] = null;
- }
- }
-};
-LTCp.refineElementTextures = function (eles) {
- var self = this;
+/* Built-in method references that are verified to be native. */
+var Map = getNative(root, 'Map');
- // log('refine', eles.length);
+module.exports = Map;
- self.updateElementsInLayers(eles, function refineEachEle(layer, ele, req) {
- var rLyr = layer.replacement;
- if (!rLyr) {
- rLyr = layer.replacement = self.makeLayer(layer.bb, layer.level);
- rLyr.replaces = layer;
- rLyr.eles = layer.eles;
- // log('make replacement layer %s for %s with level %s', rLyr.id, layer.id, rLyr.level);
- }
+/***/ }),
- if (!rLyr.reqs) {
- for (var i = 0; i < rLyr.eles.length; i++) {
- self.queueLayer(rLyr, rLyr.eles[i]);
- }
+/***/ "./node_modules/lodash/_MapCache.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_MapCache.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // log('queue replacement layer refinement', rLyr.id);
- }
- });
-};
+var mapCacheClear = __webpack_require__(/*! ./_mapCacheClear */ "./node_modules/lodash/_mapCacheClear.js"),
+ mapCacheDelete = __webpack_require__(/*! ./_mapCacheDelete */ "./node_modules/lodash/_mapCacheDelete.js"),
+ mapCacheGet = __webpack_require__(/*! ./_mapCacheGet */ "./node_modules/lodash/_mapCacheGet.js"),
+ mapCacheHas = __webpack_require__(/*! ./_mapCacheHas */ "./node_modules/lodash/_mapCacheHas.js"),
+ mapCacheSet = __webpack_require__(/*! ./_mapCacheSet */ "./node_modules/lodash/_mapCacheSet.js");
-LTCp.enqueueElementRefinement = function (ele) {
- this.eleTxrDeqs.merge(ele);
- this.scheduleElementRefinement();
-};
-LTCp.queueLayer = function (layer, ele) {
- var self = this;
- var q = self.layersQueue;
- var elesQ = layer.elesQueue;
- var hasId = elesQ.hasId = elesQ.hasId || {};
+/**
+ * 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;
- // if a layer is going to be replaced, queuing is a waste of time
- if (layer.replacement) {
- return;
- }
- if (ele) {
- if (hasId[ele.id()]) {
- return;
- }
- elesQ.push(ele);
- hasId[ele.id()] = true;
- }
- if (layer.reqs) {
- layer.reqs++;
- q.updateItem(layer);
- } else {
- layer.reqs = 1;
- q.push(layer);
+ this.clear();
+ while (++index < length) {
+ var entry = entries[index];
+ this.set(entry[0], entry[1]);
}
-};
-LTCp.dequeue = function (pxRatio) {
- var self = this;
- var q = self.layersQueue;
- var deqd = [];
- var eleDeqs = 0;
- while (eleDeqs < maxDeqSize) {
- if (q.size() === 0) {
- break;
- }
- var layer = q.peek();
+}
- // if a layer has been or will be replaced, then don't waste time with it
- if (layer.replacement) {
- // log('layer %s in queue skipped b/c it already has a replacement', layer.id);
- q.pop();
- continue;
- }
+// Add methods to `MapCache`.
+MapCache.prototype.clear = mapCacheClear;
+MapCache.prototype['delete'] = mapCacheDelete;
+MapCache.prototype.get = mapCacheGet;
+MapCache.prototype.has = mapCacheHas;
+MapCache.prototype.set = mapCacheSet;
- // if this is a replacement layer that has been superceded, then forget it
- if (layer.replaces && layer !== layer.replaces.replacement) {
- // log('layer is no longer the most uptodate replacement; dequeued', layer.id)
- q.pop();
- continue;
- }
- if (layer.invalid) {
- // log('replacement layer %s is invalid; dequeued', layer.id);
- q.pop();
- continue;
- }
- var ele = layer.elesQueue.shift();
- if (ele) {
- // log('dequeue layer %s', layer.id);
+module.exports = MapCache;
- self.drawEleInLayer(layer, ele, layer.level, pxRatio);
- eleDeqs++;
- }
- if (deqd.length === 0) {
- // we need only one entry in deqd to queue redrawing etc
- deqd.push(true);
- }
- // if the layer has all its eles done, then remove from the queue
- if (layer.elesQueue.length === 0) {
- q.pop();
- layer.reqs = 0;
+/***/ }),
- // log('dequeue of layer %s complete', layer.id);
+/***/ "./node_modules/lodash/_Promise.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_Promise.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // when a replacement layer is dequeued, it replaces the old layer in the level
- if (layer.replaces) {
- self.applyLayerReplacement(layer);
- }
- self.requestRedraw();
- }
- }
- return deqd;
-};
-LTCp.applyLayerReplacement = function (layer) {
- var self = this;
- var layersInLevel = self.layersByLevel[layer.level];
- var replaced = layer.replaces;
- var index = layersInLevel.indexOf(replaced);
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
+ root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
- // if the replaced layer is not in the active list for the level, then replacing
- // refs would be a mistake (i.e. overwriting the true active layer)
- if (index < 0 || replaced.invalid) {
- // log('replacement layer would have no effect', layer.id);
- return;
- }
- layersInLevel[index] = layer; // replace level ref
+/* Built-in method references that are verified to be native. */
+var Promise = getNative(root, 'Promise');
- // replace refs in eles
- for (var i = 0; i < layer.eles.length; i++) {
- var _p = layer.eles[i]._private;
- var cache = _p.imgLayerCaches = _p.imgLayerCaches || {};
- if (cache) {
- cache[layer.level] = layer;
- }
- }
+module.exports = Promise;
- // log('apply replacement layer %s over %s', layer.id, replaced.id);
- self.requestRedraw();
-};
-LTCp.requestRedraw = debounce__default["default"](function () {
- var r = this.renderer;
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- r.redraw();
-}, 100);
-LTCp.setupDequeueing = defs.setupDequeueing({
- deqRedrawThreshold: deqRedrawThreshold,
- deqCost: deqCost,
- deqAvgCost: deqAvgCost,
- deqNoDrawCost: deqNoDrawCost,
- deqFastCost: deqFastCost,
- deq: function deq(self, pxRatio) {
- return self.dequeue(pxRatio);
- },
- onDeqd: noop$1,
- shouldRedraw: trueify,
- priority: function priority(self) {
- return self.renderer.beforeRenderPriorities.lyrTxrDeq;
- }
-});
+/***/ }),
-var CRp$a = {};
-var impl;
-function polygon(context, points) {
- for (var i = 0; i < points.length; i++) {
- var pt = points[i];
- context.lineTo(pt.x, pt.y);
- }
-}
-function triangleBackcurve(context, points, controlPoint) {
- var firstPt;
- for (var i = 0; i < points.length; i++) {
- var pt = points[i];
- if (i === 0) {
- firstPt = pt;
- }
- context.lineTo(pt.x, pt.y);
- }
- context.quadraticCurveTo(controlPoint.x, controlPoint.y, firstPt.x, firstPt.y);
-}
-function triangleTee(context, trianglePoints, teePoints) {
- if (context.beginPath) {
- context.beginPath();
- }
- var triPts = trianglePoints;
- for (var i = 0; i < triPts.length; i++) {
- var pt = triPts[i];
- context.lineTo(pt.x, pt.y);
- }
- var teePts = teePoints;
- var firstTeePt = teePoints[0];
- context.moveTo(firstTeePt.x, firstTeePt.y);
- for (var i = 1; i < teePts.length; i++) {
- var pt = teePts[i];
- context.lineTo(pt.x, pt.y);
- }
- if (context.closePath) {
- context.closePath();
- }
-}
-function circleTriangle(context, trianglePoints, rx, ry, r) {
- if (context.beginPath) {
- context.beginPath();
- }
- context.arc(rx, ry, r, 0, Math.PI * 2, false);
- var triPts = trianglePoints;
- var firstTrPt = triPts[0];
- context.moveTo(firstTrPt.x, firstTrPt.y);
- for (var i = 0; i < triPts.length; i++) {
- var pt = triPts[i];
- context.lineTo(pt.x, pt.y);
- }
- if (context.closePath) {
- context.closePath();
- }
-}
-function circle(context, rx, ry, r) {
- context.arc(rx, ry, r, 0, Math.PI * 2, false);
-}
-CRp$a.arrowShapeImpl = function (name) {
- return (impl || (impl = {
- 'polygon': polygon,
- 'triangle-backcurve': triangleBackcurve,
- 'triangle-tee': triangleTee,
- 'circle-triangle': circleTriangle,
- 'triangle-cross': triangleTee,
- 'circle': circle
- }))[name];
-};
+/***/ "./node_modules/lodash/_Set.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/_Set.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var CRp$9 = {};
-CRp$9.drawElement = function (context, ele, shiftToOriginWithBb, showLabel, showOverlay, showOpacity) {
- var r = this;
- if (ele.isNode()) {
- r.drawNode(context, ele, shiftToOriginWithBb, showLabel, showOverlay, showOpacity);
- } else {
- r.drawEdge(context, ele, shiftToOriginWithBb, showLabel, showOverlay, showOpacity);
- }
-};
-CRp$9.drawElementOverlay = function (context, ele) {
- var r = this;
- if (ele.isNode()) {
- r.drawNodeOverlay(context, ele);
- } else {
- r.drawEdgeOverlay(context, ele);
- }
-};
-CRp$9.drawElementUnderlay = function (context, ele) {
- var r = this;
- if (ele.isNode()) {
- r.drawNodeUnderlay(context, ele);
- } else {
- r.drawEdgeUnderlay(context, ele);
- }
-};
-CRp$9.drawCachedElementPortion = function (context, ele, eleTxrCache, pxRatio, lvl, reason, getRotation, getOpacity) {
- var r = this;
- var bb = eleTxrCache.getBoundingBox(ele);
- if (bb.w === 0 || bb.h === 0) {
- return;
- } // ignore zero size case
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
+ root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
- var eleCache = eleTxrCache.getElement(ele, bb, pxRatio, lvl, reason);
- if (eleCache != null) {
- var opacity = getOpacity(r, ele);
- if (opacity === 0) {
- return;
- }
- var theta = getRotation(r, ele);
- var x1 = bb.x1,
- y1 = bb.y1,
- w = bb.w,
- h = bb.h;
- var x, y, sx, sy, smooth;
- if (theta !== 0) {
- var rotPt = eleTxrCache.getRotationPoint(ele);
- sx = rotPt.x;
- sy = rotPt.y;
- context.translate(sx, sy);
- context.rotate(theta);
- smooth = r.getImgSmoothing(context);
- if (!smooth) {
- r.setImgSmoothing(context, true);
- }
- var off = eleTxrCache.getRotationOffset(ele);
- x = off.x;
- y = off.y;
- } else {
- x = x1;
- y = y1;
- }
- var oldGlobalAlpha;
- if (opacity !== 1) {
- oldGlobalAlpha = context.globalAlpha;
- context.globalAlpha = oldGlobalAlpha * opacity;
- }
- context.drawImage(eleCache.texture.canvas, eleCache.x, 0, eleCache.width, eleCache.height, x, y, w, h);
- if (opacity !== 1) {
- context.globalAlpha = oldGlobalAlpha;
- }
- if (theta !== 0) {
- context.rotate(-theta);
- context.translate(-sx, -sy);
- if (!smooth) {
- r.setImgSmoothing(context, false);
- }
- }
- } else {
- eleTxrCache.drawElement(context, ele); // direct draw fallback
- }
-};
+/* Built-in method references that are verified to be native. */
+var Set = getNative(root, 'Set');
-var getZeroRotation = function getZeroRotation() {
- return 0;
-};
-var getLabelRotation = function getLabelRotation(r, ele) {
- return r.getTextAngle(ele, null);
-};
-var getSourceLabelRotation = function getSourceLabelRotation(r, ele) {
- return r.getTextAngle(ele, 'source');
-};
-var getTargetLabelRotation = function getTargetLabelRotation(r, ele) {
- return r.getTextAngle(ele, 'target');
-};
-var getOpacity = function getOpacity(r, ele) {
- return ele.effectiveOpacity();
-};
-var getTextOpacity = function getTextOpacity(e, ele) {
- return ele.pstyle('text-opacity').pfValue * ele.effectiveOpacity();
-};
-CRp$9.drawCachedElement = function (context, ele, pxRatio, extent, lvl, requestHighQuality) {
- var r = this;
- var _r$data = r.data,
- eleTxrCache = _r$data.eleTxrCache,
- lblTxrCache = _r$data.lblTxrCache,
- slbTxrCache = _r$data.slbTxrCache,
- tlbTxrCache = _r$data.tlbTxrCache;
- var bb = ele.boundingBox();
- var reason = requestHighQuality === true ? eleTxrCache.reasons.highQuality : null;
- if (bb.w === 0 || bb.h === 0 || !ele.visible()) {
- return;
- }
- if (!extent || boundingBoxesIntersect(bb, extent)) {
- var isEdge = ele.isEdge();
- var badLine = ele.element()._private.rscratch.badLine;
- r.drawElementUnderlay(context, ele);
- r.drawCachedElementPortion(context, ele, eleTxrCache, pxRatio, lvl, reason, getZeroRotation, getOpacity);
- if (!isEdge || !badLine) {
- r.drawCachedElementPortion(context, ele, lblTxrCache, pxRatio, lvl, reason, getLabelRotation, getTextOpacity);
- }
- if (isEdge && !badLine) {
- r.drawCachedElementPortion(context, ele, slbTxrCache, pxRatio, lvl, reason, getSourceLabelRotation, getTextOpacity);
- r.drawCachedElementPortion(context, ele, tlbTxrCache, pxRatio, lvl, reason, getTargetLabelRotation, getTextOpacity);
- }
- r.drawElementOverlay(context, ele);
- }
-};
-CRp$9.drawElements = function (context, eles) {
- var r = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- r.drawElement(context, ele);
- }
-};
-CRp$9.drawCachedElements = function (context, eles, pxRatio, extent) {
- var r = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- r.drawCachedElement(context, ele, pxRatio, extent);
- }
-};
-CRp$9.drawCachedNodes = function (context, eles, pxRatio, extent) {
- var r = this;
- for (var i = 0; i < eles.length; i++) {
- var ele = eles[i];
- if (!ele.isNode()) {
- continue;
- }
- r.drawCachedElement(context, ele, pxRatio, extent);
- }
-};
-CRp$9.drawLayeredElements = function (context, eles, pxRatio, extent) {
- var r = this;
- var layers = r.data.lyrTxrCache.getLayers(eles, pxRatio);
- if (layers) {
- for (var i = 0; i < layers.length; i++) {
- var layer = layers[i];
- var bb = layer.bb;
- if (bb.w === 0 || bb.h === 0) {
- continue;
- }
- context.drawImage(layer.canvas, bb.x1, bb.y1, bb.w, bb.h);
- }
- } else {
- // fall back on plain caching if no layers
- r.drawCachedElements(context, eles, pxRatio, extent);
- }
-};
+module.exports = Set;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_SetCache.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_SetCache.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js"),
+ setCacheAdd = __webpack_require__(/*! ./_setCacheAdd */ "./node_modules/lodash/_setCacheAdd.js"),
+ setCacheHas = __webpack_require__(/*! ./_setCacheHas */ "./node_modules/lodash/_setCacheHas.js");
+
+/**
+ *
+ * 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;
-/* global Path2D */
-var CRp$8 = {};
-CRp$8.drawEdge = function (context, edge, shiftToOriginWithBb) {
- var drawLabel = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
- var shouldDrawOverlay = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
- var shouldDrawOpacity = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : true;
- var r = this;
- var rs = edge._private.rscratch;
- if (shouldDrawOpacity && !edge.visible()) {
- return;
+ this.__data__ = new MapCache;
+ while (++index < length) {
+ this.add(values[index]);
}
+}
- // if bezier ctrl pts can not be calculated, then die
- if (rs.badLine || rs.allpts == null || isNaN(rs.allpts[0])) {
- // isNaN in case edge is impossible and browser bugs (e.g. safari)
- return;
- }
- var bb;
- if (shiftToOriginWithBb) {
- bb = shiftToOriginWithBb;
- context.translate(-bb.x1, -bb.y1);
+// Add methods to `SetCache`.
+SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+SetCache.prototype.has = setCacheHas;
+
+module.exports = SetCache;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_Stack.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/_Stack.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
+ stackClear = __webpack_require__(/*! ./_stackClear */ "./node_modules/lodash/_stackClear.js"),
+ stackDelete = __webpack_require__(/*! ./_stackDelete */ "./node_modules/lodash/_stackDelete.js"),
+ stackGet = __webpack_require__(/*! ./_stackGet */ "./node_modules/lodash/_stackGet.js"),
+ stackHas = __webpack_require__(/*! ./_stackHas */ "./node_modules/lodash/_stackHas.js"),
+ stackSet = __webpack_require__(/*! ./_stackSet */ "./node_modules/lodash/_stackSet.js");
+
+/**
+ * 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;
+}
+
+// Add methods to `Stack`.
+Stack.prototype.clear = stackClear;
+Stack.prototype['delete'] = stackDelete;
+Stack.prototype.get = stackGet;
+Stack.prototype.has = stackHas;
+Stack.prototype.set = stackSet;
+
+module.exports = Stack;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_Symbol.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/_Symbol.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+
+/** Built-in value references. */
+var Symbol = root.Symbol;
+
+module.exports = Symbol;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_Uint8Array.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_Uint8Array.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+
+/** Built-in value references. */
+var Uint8Array = root.Uint8Array;
+
+module.exports = Uint8Array;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_WeakMap.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_WeakMap.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
+ root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+
+/* Built-in method references that are verified to be native. */
+var WeakMap = getNative(root, 'WeakMap');
+
+module.exports = WeakMap;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_apply.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/_apply.js ***!
+ \***************************************/
+/***/ (function(module) {
+
+/**
+ * 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]);
}
- var opacity = shouldDrawOpacity ? edge.pstyle('opacity').value : 1;
- var lineOpacity = shouldDrawOpacity ? edge.pstyle('line-opacity').value : 1;
- var curveStyle = edge.pstyle('curve-style').value;
- var lineStyle = edge.pstyle('line-style').value;
- var edgeWidth = edge.pstyle('width').pfValue;
- var lineCap = edge.pstyle('line-cap').value;
- var effectiveLineOpacity = opacity * lineOpacity;
- // separate arrow opacity would require arrow-opacity property
- var effectiveArrowOpacity = opacity * lineOpacity;
- var drawLine = function drawLine() {
- var strokeOpacity = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : effectiveLineOpacity;
- if (curveStyle === 'straight-triangle') {
- r.eleStrokeStyle(context, edge, strokeOpacity);
- r.drawEdgeTrianglePath(edge, context, rs.allpts);
- } else {
- context.lineWidth = edgeWidth;
- context.lineCap = lineCap;
- r.eleStrokeStyle(context, edge, strokeOpacity);
- r.drawEdgePath(edge, context, rs.allpts, lineStyle);
- context.lineCap = 'butt'; // reset for other drawing functions
- }
- };
+ return func.apply(thisArg, args);
+}
- var drawOverlay = function drawOverlay() {
- if (!shouldDrawOverlay) {
- return;
- }
- r.drawEdgeOverlay(context, edge);
- };
- var drawUnderlay = function drawUnderlay() {
- if (!shouldDrawOverlay) {
- return;
+module.exports = apply;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayEach.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_arrayEach.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
- r.drawEdgeUnderlay(context, edge);
- };
- var drawArrows = function drawArrows() {
- var arrowOpacity = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : effectiveArrowOpacity;
- r.drawArrowheads(context, edge, arrowOpacity);
- };
- var drawText = function drawText() {
- r.drawElementText(context, edge, null, drawLabel);
- };
- context.lineJoin = 'round';
- var ghost = edge.pstyle('ghost').value === 'yes';
- if (ghost) {
- var gx = edge.pstyle('ghost-offset-x').pfValue;
- var gy = edge.pstyle('ghost-offset-y').pfValue;
- var ghostOpacity = edge.pstyle('ghost-opacity').value;
- var effectiveGhostOpacity = effectiveLineOpacity * ghostOpacity;
- context.translate(gx, gy);
- drawLine(effectiveGhostOpacity);
- drawArrows(effectiveGhostOpacity);
- context.translate(-gx, -gy);
- }
- drawUnderlay();
- drawLine();
- drawArrows();
- drawOverlay();
- drawText();
- if (shiftToOriginWithBb) {
- context.translate(bb.x1, bb.y1);
- }
-};
-var drawEdgeOverlayUnderlay = function drawEdgeOverlayUnderlay(overlayOrUnderlay) {
- if (!['overlay', 'underlay'].includes(overlayOrUnderlay)) {
- throw new Error('Invalid state');
}
- return function (context, edge) {
- if (!edge.visible()) {
- return;
- }
- var opacity = edge.pstyle("".concat(overlayOrUnderlay, "-opacity")).value;
- if (opacity === 0) {
- return;
- }
- var r = this;
- var usePaths = r.usePaths();
- var rs = edge._private.rscratch;
- var padding = edge.pstyle("".concat(overlayOrUnderlay, "-padding")).pfValue;
- var width = 2 * padding;
- var color = edge.pstyle("".concat(overlayOrUnderlay, "-color")).value;
- context.lineWidth = width;
- if (rs.edgeType === 'self' && !usePaths) {
- context.lineCap = 'butt';
- } else {
- context.lineCap = 'round';
- }
- r.colorStrokeStyle(context, color[0], color[1], color[2], opacity);
- r.drawEdgePath(edge, context, rs.allpts, 'solid');
- };
-};
-CRp$8.drawEdgeOverlay = drawEdgeOverlayUnderlay('overlay');
-CRp$8.drawEdgeUnderlay = drawEdgeOverlayUnderlay('underlay');
-CRp$8.drawEdgePath = function (edge, context, pts, type) {
- var rs = edge._private.rscratch;
- var canvasCxt = context;
- var path;
- var pathCacheHit = false;
- var usePaths = this.usePaths();
- var lineDashPattern = edge.pstyle('line-dash-pattern').pfValue;
- var lineDashOffset = edge.pstyle('line-dash-offset').pfValue;
- if (usePaths) {
- var pathCacheKey = pts.join('$');
- var keyMatches = rs.pathCacheKey && rs.pathCacheKey === pathCacheKey;
- if (keyMatches) {
- path = context = rs.pathCache;
- pathCacheHit = true;
- } else {
- path = context = new Path2D();
- rs.pathCacheKey = pathCacheKey;
- rs.pathCache = path;
+ return array;
+}
+
+module.exports = arrayEach;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayFilter.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_arrayFilter.js ***!
+ \*********************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
}
- if (canvasCxt.setLineDash) {
- // for very outofdate browsers
- switch (type) {
- case 'dotted':
- canvasCxt.setLineDash([1, 1]);
- break;
- case 'dashed':
- canvasCxt.setLineDash(lineDashPattern);
- canvasCxt.lineDashOffset = lineDashOffset;
- break;
- case 'solid':
- canvasCxt.setLineDash([]);
- break;
+ return result;
+}
+
+module.exports = arrayFilter;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayIncludes.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_arrayIncludes.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseIndexOf = __webpack_require__(/*! ./_baseIndexOf */ "./node_modules/lodash/_baseIndexOf.js");
+
+/**
+ * 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;
+}
+
+module.exports = arrayIncludes;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayIncludesWith.js":
+/*!***************************************************!*\
+ !*** ./node_modules/lodash/_arrayIncludesWith.js ***!
+ \***************************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
}
- if (!pathCacheHit && !rs.badLine) {
- if (context.beginPath) {
- context.beginPath();
- }
- context.moveTo(pts[0], pts[1]);
- switch (rs.edgeType) {
- case 'bezier':
- case 'self':
- case 'compound':
- case 'multibezier':
- for (var i = 2; i + 3 < pts.length; i += 4) {
- context.quadraticCurveTo(pts[i], pts[i + 1], pts[i + 2], pts[i + 3]);
- }
- break;
- case 'straight':
- case 'segments':
- case 'haystack':
- for (var _i = 2; _i + 1 < pts.length; _i += 2) {
- context.lineTo(pts[_i], pts[_i + 1]);
- }
- break;
+ return false;
+}
+
+module.exports = arrayIncludesWith;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayLikeKeys.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_arrayLikeKeys.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseTimes = __webpack_require__(/*! ./_baseTimes */ "./node_modules/lodash/_baseTimes.js"),
+ isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
+ isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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);
}
}
- context = canvasCxt;
- if (usePaths) {
- context.stroke(path);
- } else {
- context.stroke();
- }
+ return result;
+}
- // reset any line dashes
- if (context.setLineDash) {
- // for very outofdate browsers
- context.setLineDash([]);
- }
-};
-CRp$8.drawEdgeTrianglePath = function (edge, context, pts) {
- // use line stroke style for triangle fill style
- context.fillStyle = context.strokeStyle;
- var edgeWidth = edge.pstyle('width').pfValue;
- for (var i = 0; i + 1 < pts.length; i += 2) {
- var vector = [pts[i + 2] - pts[i], pts[i + 3] - pts[i + 1]];
- var length = Math.sqrt(vector[0] * vector[0] + vector[1] * vector[1]);
- var normal = [vector[1] / length, -vector[0] / length];
- var triangleHead = [normal[0] * edgeWidth / 2, normal[1] * edgeWidth / 2];
- context.beginPath();
- context.moveTo(pts[i] - triangleHead[0], pts[i + 1] - triangleHead[1]);
- context.lineTo(pts[i] + triangleHead[0], pts[i + 1] + triangleHead[1]);
- context.lineTo(pts[i + 2], pts[i + 3]);
- context.closePath();
- context.fill();
- }
-};
-CRp$8.drawArrowheads = function (context, edge, opacity) {
- var rs = edge._private.rscratch;
- var isHaystack = rs.edgeType === 'haystack';
- if (!isHaystack) {
- this.drawArrowhead(context, edge, 'source', rs.arrowStartX, rs.arrowStartY, rs.srcArrowAngle, opacity);
- }
- this.drawArrowhead(context, edge, 'mid-target', rs.midX, rs.midY, rs.midtgtArrowAngle, opacity);
- this.drawArrowhead(context, edge, 'mid-source', rs.midX, rs.midY, rs.midsrcArrowAngle, opacity);
- if (!isHaystack) {
- this.drawArrowhead(context, edge, 'target', rs.arrowEndX, rs.arrowEndY, rs.tgtArrowAngle, opacity);
+module.exports = arrayLikeKeys;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayMap.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_arrayMap.js ***!
+ \******************************************/
+/***/ (function(module) {
+
+/**
+ * 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);
}
-};
-CRp$8.drawArrowhead = function (context, edge, prefix, x, y, angle, opacity) {
- if (isNaN(x) || x == null || isNaN(y) || y == null || isNaN(angle) || angle == null) {
- return;
+ return result;
+}
+
+module.exports = arrayMap;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayPush.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_arrayPush.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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];
}
- var self = this;
- var arrowShape = edge.pstyle(prefix + '-arrow-shape').value;
- if (arrowShape === 'none') {
- return;
+ return array;
+}
+
+module.exports = arrayPush;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arrayReduce.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_arrayReduce.js ***!
+ \*********************************************/
+/***/ (function(module) {
+
+/**
+ * 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];
}
- var arrowClearFill = edge.pstyle(prefix + '-arrow-fill').value === 'hollow' ? 'both' : 'filled';
- var arrowFill = edge.pstyle(prefix + '-arrow-fill').value;
- var edgeWidth = edge.pstyle('width').pfValue;
- var edgeOpacity = edge.pstyle('opacity').value;
- if (opacity === undefined) {
- opacity = edgeOpacity;
+ while (++index < length) {
+ accumulator = iteratee(accumulator, array[index], index, array);
}
- var gco = context.globalCompositeOperation;
- if (opacity !== 1 || arrowFill === 'hollow') {
- // then extra clear is needed
- context.globalCompositeOperation = 'destination-out';
- self.colorFillStyle(context, 255, 255, 255, 1);
- self.colorStrokeStyle(context, 255, 255, 255, 1);
- self.drawArrowShape(edge, context, arrowClearFill, edgeWidth, arrowShape, x, y, angle);
- context.globalCompositeOperation = gco;
- } // otherwise, the opaque arrow clears it for free :)
+ return accumulator;
+}
- var color = edge.pstyle(prefix + '-arrow-color').value;
- self.colorFillStyle(context, color[0], color[1], color[2], opacity);
- self.colorStrokeStyle(context, color[0], color[1], color[2], opacity);
- self.drawArrowShape(edge, context, arrowFill, edgeWidth, arrowShape, x, y, angle);
-};
-CRp$8.drawArrowShape = function (edge, context, fill, edgeWidth, shape, x, y, angle) {
- var r = this;
- var usePaths = this.usePaths() && shape !== 'triangle-cross';
- var pathCacheHit = false;
- var path;
- var canvasContext = context;
- var translation = {
- x: x,
- y: y
- };
- var scale = edge.pstyle('arrow-scale').value;
- var size = this.getArrowWidth(edgeWidth, scale);
- var shapeImpl = r.arrowShapes[shape];
- if (usePaths) {
- var cache = r.arrowPathCache = r.arrowPathCache || [];
- var key = hashString(shape);
- var cachedPath = cache[key];
- if (cachedPath != null) {
- path = context = cachedPath;
- pathCacheHit = true;
- } else {
- path = context = new Path2D();
- cache[key] = path;
- }
- }
- if (!pathCacheHit) {
- if (context.beginPath) {
- context.beginPath();
- }
- if (usePaths) {
- // store in the path cache with values easily manipulated later
- shapeImpl.draw(context, 1, 0, {
- x: 0,
- y: 0
- }, 1);
- } else {
- shapeImpl.draw(context, size, angle, translation, edgeWidth);
- }
- if (context.closePath) {
- context.closePath();
+module.exports = arrayReduce;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_arraySome.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_arraySome.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
}
- context = canvasContext;
- if (usePaths) {
- // set transform to arrow position/orientation
- context.translate(x, y);
- context.rotate(angle);
- context.scale(size, size);
+ return false;
+}
+
+module.exports = arraySome;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_asciiSize.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_asciiSize.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseProperty = __webpack_require__(/*! ./_baseProperty */ "./node_modules/lodash/_baseProperty.js");
+
+/**
+ * Gets the size of an ASCII `string`.
+ *
+ * @private
+ * @param {string} string The string inspect.
+ * @returns {number} Returns the string size.
+ */
+var asciiSize = baseProperty('length');
+
+module.exports = asciiSize;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_assignMergeValue.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/_assignMergeValue.js ***!
+ \**************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
+ eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
+
+/**
+ * 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);
}
- if (fill === 'filled' || fill === 'both') {
- if (usePaths) {
- context.fill(path);
- } else {
- context.fill();
- }
+}
+
+module.exports = assignMergeValue;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_assignValue.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_assignValue.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
+ eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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);
}
- if (fill === 'hollow' || fill === 'both') {
- context.lineWidth = (shapeImpl.matchEdgeWidth ? edgeWidth : 1) / (usePaths ? size : 1);
- context.lineJoin = 'miter';
- if (usePaths) {
- context.stroke(path);
- } else {
- context.stroke();
+}
+
+module.exports = assignValue;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_assocIndexOf.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_assocIndexOf.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
+
+/**
+ * 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;
}
}
- if (usePaths) {
- // reset transform by applying inverse
- context.scale(1 / size, 1 / size);
- context.rotate(-angle);
- context.translate(-x, -y);
- }
-};
+ return -1;
+}
-var CRp$7 = {};
-CRp$7.safeDrawImage = function (context, img, ix, iy, iw, ih, x, y, w, h) {
- // detect problematic cases for old browsers with bad images (cheaper than try-catch)
- if (iw <= 0 || ih <= 0 || w <= 0 || h <= 0) {
- return;
- }
- try {
- context.drawImage(img, ix, iy, iw, ih, x, y, w, h);
- } catch (e) {
- warn(e);
+module.exports = assocIndexOf;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseAssign.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseAssign.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
+
+/**
+ * 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);
+}
+
+module.exports = baseAssign;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseAssignIn.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseAssignIn.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
+
+/**
+ * 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);
+}
+
+module.exports = baseAssignIn;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseAssignValue.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_baseAssignValue.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var defineProperty = __webpack_require__(/*! ./_defineProperty */ "./node_modules/lodash/_defineProperty.js");
+
+/**
+ * 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;
}
-};
-CRp$7.drawInscribedImage = function (context, img, node, index, nodeOpacity) {
- var r = this;
- var pos = node.position();
- var nodeX = pos.x;
- var nodeY = pos.y;
- var styleObj = node.cy().style();
- var getIndexedStyle = styleObj.getIndexedStyle.bind(styleObj);
- var fit = getIndexedStyle(node, 'background-fit', 'value', index);
- var repeat = getIndexedStyle(node, 'background-repeat', 'value', index);
- var nodeW = node.width();
- var nodeH = node.height();
- var paddingX2 = node.padding() * 2;
- var nodeTW = nodeW + (getIndexedStyle(node, 'background-width-relative-to', 'value', index) === 'inner' ? 0 : paddingX2);
- var nodeTH = nodeH + (getIndexedStyle(node, 'background-height-relative-to', 'value', index) === 'inner' ? 0 : paddingX2);
- var rs = node._private.rscratch;
- var clip = getIndexedStyle(node, 'background-clip', 'value', index);
- var shouldClip = clip === 'node';
- var imgOpacity = getIndexedStyle(node, 'background-image-opacity', 'value', index) * nodeOpacity;
- var smooth = getIndexedStyle(node, 'background-image-smoothing', 'value', index);
- var imgW = img.width || img.cachedW;
- var imgH = img.height || img.cachedH;
+}
+
+module.exports = baseAssignValue;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseClone.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseClone.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
+ arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
+ assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
+ baseAssign = __webpack_require__(/*! ./_baseAssign */ "./node_modules/lodash/_baseAssign.js"),
+ baseAssignIn = __webpack_require__(/*! ./_baseAssignIn */ "./node_modules/lodash/_baseAssignIn.js"),
+ cloneBuffer = __webpack_require__(/*! ./_cloneBuffer */ "./node_modules/lodash/_cloneBuffer.js"),
+ copyArray = __webpack_require__(/*! ./_copyArray */ "./node_modules/lodash/_copyArray.js"),
+ copySymbols = __webpack_require__(/*! ./_copySymbols */ "./node_modules/lodash/_copySymbols.js"),
+ copySymbolsIn = __webpack_require__(/*! ./_copySymbolsIn */ "./node_modules/lodash/_copySymbolsIn.js"),
+ getAllKeys = __webpack_require__(/*! ./_getAllKeys */ "./node_modules/lodash/_getAllKeys.js"),
+ getAllKeysIn = __webpack_require__(/*! ./_getAllKeysIn */ "./node_modules/lodash/_getAllKeysIn.js"),
+ getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ initCloneArray = __webpack_require__(/*! ./_initCloneArray */ "./node_modules/lodash/_initCloneArray.js"),
+ initCloneByTag = __webpack_require__(/*! ./_initCloneByTag */ "./node_modules/lodash/_initCloneByTag.js"),
+ initCloneObject = __webpack_require__(/*! ./_initCloneObject */ "./node_modules/lodash/_initCloneObject.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isMap = __webpack_require__(/*! ./isMap */ "./node_modules/lodash/isMap.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ isSet = __webpack_require__(/*! ./isSet */ "./node_modules/lodash/isSet.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
+
+/** Used to compose bitmasks for cloning. */
+var CLONE_DEEP_FLAG = 1,
+ CLONE_FLAT_FLAG = 2,
+ CLONE_SYMBOLS_FLAG = 4;
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+ arrayTag = '[object Array]',
+ boolTag = '[object Boolean]',
+ dateTag = '[object Date]',
+ errorTag = '[object Error]',
+ funcTag = '[object Function]',
+ genTag = '[object GeneratorFunction]',
+ mapTag = '[object Map]',
+ numberTag = '[object Number]',
+ objectTag = '[object Object]',
+ regexpTag = '[object RegExp]',
+ setTag = '[object Set]',
+ stringTag = '[object String]',
+ symbolTag = '[object Symbol]',
+ weakMapTag = '[object WeakMap]';
+
+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 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;
- // workaround for broken browsers like ie
- if (null == imgW || null == imgH) {
- document.body.appendChild(img); // eslint-disable-line no-undef
+/**
+ * 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;
- imgW = img.cachedW = img.width || img.offsetWidth;
- imgH = img.cachedH = img.height || img.offsetHeight;
- document.body.removeChild(img); // eslint-disable-line no-undef
+ 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;
- var w = imgW;
- var h = imgH;
- if (getIndexedStyle(node, 'background-width', 'value', index) !== 'auto') {
- if (getIndexedStyle(node, 'background-width', 'units', index) === '%') {
- w = getIndexedStyle(node, 'background-width', 'pfValue', index) * nodeTW;
- } else {
- w = getIndexedStyle(node, 'background-width', 'pfValue', index);
+ if (isBuffer(value)) {
+ return cloneBuffer(value, isDeep);
}
- }
- if (getIndexedStyle(node, 'background-height', 'value', index) !== 'auto') {
- if (getIndexedStyle(node, 'background-height', 'units', index) === '%') {
- h = getIndexedStyle(node, 'background-height', 'pfValue', index) * nodeTH;
+ 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 {
- h = getIndexedStyle(node, 'background-height', 'pfValue', index);
+ if (!cloneableTags[tag]) {
+ return object ? value : {};
+ }
+ result = initCloneByTag(value, tag, isDeep);
}
}
- if (w === 0 || h === 0) {
- return; // no point in drawing empty image (and chrome is broken in this case)
+ // 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);
- if (fit === 'contain') {
- var scale = Math.min(nodeTW / w, nodeTH / h);
- w *= scale;
- h *= scale;
- } else if (fit === 'cover') {
- var scale = Math.max(nodeTW / w, nodeTH / h);
- w *= scale;
- h *= scale;
- }
- var x = nodeX - nodeTW / 2; // left
- var posXUnits = getIndexedStyle(node, 'background-position-x', 'units', index);
- var posXPfVal = getIndexedStyle(node, 'background-position-x', 'pfValue', index);
- if (posXUnits === '%') {
- x += (nodeTW - w) * posXPfVal;
- } else {
- x += posXPfVal;
- }
- var offXUnits = getIndexedStyle(node, 'background-offset-x', 'units', index);
- var offXPfVal = getIndexedStyle(node, 'background-offset-x', 'pfValue', index);
- if (offXUnits === '%') {
- x += (nodeTW - w) * offXPfVal;
- } else {
- x += offXPfVal;
- }
- var y = nodeY - nodeTH / 2; // top
- var posYUnits = getIndexedStyle(node, 'background-position-y', 'units', index);
- var posYPfVal = getIndexedStyle(node, 'background-position-y', 'pfValue', index);
- if (posYUnits === '%') {
- y += (nodeTH - h) * posYPfVal;
- } else {
- y += posYPfVal;
- }
- var offYUnits = getIndexedStyle(node, 'background-offset-y', 'units', index);
- var offYPfVal = getIndexedStyle(node, 'background-offset-y', 'pfValue', index);
- if (offYUnits === '%') {
- y += (nodeTH - h) * offYPfVal;
- } else {
- y += offYPfVal;
- }
- if (rs.pathCache) {
- x -= nodeX;
- y -= nodeY;
- nodeX = 0;
- nodeY = 0;
- }
- var gAlpha = context.globalAlpha;
- context.globalAlpha = imgOpacity;
- var smoothingEnabled = r.getImgSmoothing(context);
- var isSmoothingSwitched = false;
- if (smooth === 'no' && smoothingEnabled) {
- r.setImgSmoothing(context, false);
- isSmoothingSwitched = true;
- } else if (smooth === 'yes' && !smoothingEnabled) {
- r.setImgSmoothing(context, true);
- isSmoothingSwitched = true;
- }
- if (repeat === 'no-repeat') {
- if (shouldClip) {
- context.save();
- if (rs.pathCache) {
- context.clip(rs.pathCache);
- } else {
- r.nodeShapes[r.getNodeShape(node)].draw(context, nodeX, nodeY, nodeTW, nodeTH);
- context.clip();
- }
- }
- r.safeDrawImage(context, img, 0, 0, imgW, imgH, x, y, w, h);
- if (shouldClip) {
- context.restore();
- }
- } else {
- var pattern = context.createPattern(img, repeat);
- context.fillStyle = pattern;
- r.nodeShapes[r.getNodeShape(node)].draw(context, nodeX, nodeY, nodeTW, nodeTH);
- context.translate(x, y);
- context.fill();
- context.translate(-x, -y);
- }
- context.globalAlpha = gAlpha;
- if (isSmoothingSwitched) {
- r.setImgSmoothing(context, smoothingEnabled);
+ if (isSet(value)) {
+ value.forEach(function(subValue) {
+ result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
+ });
+ } else if (isMap(value)) {
+ value.forEach(function(subValue, key) {
+ result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
+ });
}
-};
-var CRp$6 = {};
-CRp$6.eleTextBiggerThanMin = function (ele, scale) {
- if (!scale) {
- var zoom = ele.cy().zoom();
- var pxRatio = this.getPixelRatio();
- var lvl = Math.ceil(log2(zoom * pxRatio)); // the effective texture level
+ var keysFunc = isFull
+ ? (isFlat ? getAllKeysIn : getAllKeys)
+ : (isFlat ? keysIn : keys);
- scale = Math.pow(2, lvl);
- }
- var computedSize = ele.pstyle('font-size').pfValue * scale;
- var minSize = ele.pstyle('min-zoomed-font-size').pfValue;
- if (computedSize < minSize) {
- return false;
- }
- return true;
-};
-CRp$6.drawElementText = function (context, ele, shiftToOriginWithBb, force, prefix) {
- var useEleOpacity = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : true;
- var r = this;
- if (force == null) {
- if (useEleOpacity && !r.eleTextBiggerThanMin(ele)) {
- return;
- }
- } else if (force === false) {
- return;
- }
- if (ele.isNode()) {
- var label = ele.pstyle('label');
- if (!label || !label.value) {
- return;
- }
- var justification = r.getLabelJustification(ele);
- context.textAlign = justification;
- context.textBaseline = 'bottom';
- } else {
- var badLine = ele.element()._private.rscratch.badLine;
- var _label = ele.pstyle('label');
- var srcLabel = ele.pstyle('source-label');
- var tgtLabel = ele.pstyle('target-label');
- if (badLine || (!_label || !_label.value) && (!srcLabel || !srcLabel.value) && (!tgtLabel || !tgtLabel.value)) {
- return;
+ var props = isArr ? undefined : keysFunc(value);
+ arrayEach(props || value, function(subValue, key) {
+ if (props) {
+ key = subValue;
+ subValue = value[key];
}
- context.textAlign = 'center';
- context.textBaseline = 'bottom';
- }
- var applyRotation = !shiftToOriginWithBb;
- var bb;
- if (shiftToOriginWithBb) {
- bb = shiftToOriginWithBb;
- context.translate(-bb.x1, -bb.y1);
- }
- if (prefix == null) {
- r.drawText(context, ele, null, applyRotation, useEleOpacity);
- if (ele.isEdge()) {
- r.drawText(context, ele, 'source', applyRotation, useEleOpacity);
- r.drawText(context, ele, 'target', applyRotation, useEleOpacity);
+ // Recursively populate clone (susceptible to call stack limits).
+ assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
+ });
+ return result;
+}
+
+module.exports = baseClone;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseCreate.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseCreate.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
+
+/** Built-in value references. */
+var objectCreate = Object.create;
+
+/**
+ * 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 {};
}
- } else {
- r.drawText(context, ele, prefix, applyRotation, useEleOpacity);
- }
- if (shiftToOriginWithBb) {
- context.translate(bb.x1, bb.y1);
- }
-};
-CRp$6.getFontCache = function (context) {
- var cache;
- this.fontCaches = this.fontCaches || [];
- for (var i = 0; i < this.fontCaches.length; i++) {
- cache = this.fontCaches[i];
- if (cache.context === context) {
- return cache;
+ if (objectCreate) {
+ return objectCreate(proto);
}
- }
- cache = {
- context: context
+ object.prototype = proto;
+ var result = new object;
+ object.prototype = undefined;
+ return result;
};
- this.fontCaches.push(cache);
- return cache;
-};
+}());
-// set up canvas context with font
-// returns transformed text string
-CRp$6.setupTextStyle = function (context, ele) {
- var useEleOpacity = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
- // Font style
- var labelStyle = ele.pstyle('font-style').strValue;
- var labelSize = ele.pstyle('font-size').pfValue + 'px';
- var labelFamily = ele.pstyle('font-family').strValue;
- var labelWeight = ele.pstyle('font-weight').strValue;
- var opacity = useEleOpacity ? ele.effectiveOpacity() * ele.pstyle('text-opacity').value : 1;
- var outlineOpacity = ele.pstyle('text-outline-opacity').value * opacity;
- var color = ele.pstyle('color').value;
- var outlineColor = ele.pstyle('text-outline-color').value;
- context.font = labelStyle + ' ' + labelWeight + ' ' + labelSize + ' ' + labelFamily;
- context.lineJoin = 'round'; // so text outlines aren't jagged
+module.exports = baseCreate;
- this.colorFillStyle(context, color[0], color[1], color[2], opacity);
- this.colorStrokeStyle(context, outlineColor[0], outlineColor[1], outlineColor[2], outlineOpacity);
-};
-// TODO ensure re-used
-function roundRect(ctx, x, y, width, height) {
- var radius = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : 5;
- ctx.beginPath();
- ctx.moveTo(x + radius, y);
- ctx.lineTo(x + width - radius, y);
- ctx.quadraticCurveTo(x + width, y, x + width, y + radius);
- ctx.lineTo(x + width, y + height - radius);
- ctx.quadraticCurveTo(x + width, y + height, x + width - radius, y + height);
- ctx.lineTo(x + radius, y + height);
- ctx.quadraticCurveTo(x, y + height, x, y + height - radius);
- ctx.lineTo(x, y + radius);
- ctx.quadraticCurveTo(x, y, x + radius, y);
- ctx.closePath();
- ctx.fill();
-}
-CRp$6.getTextAngle = function (ele, prefix) {
- var theta;
- var _p = ele._private;
- var rscratch = _p.rscratch;
- var pdash = prefix ? prefix + '-' : '';
- var rotation = ele.pstyle(pdash + 'text-rotation');
- var textAngle = getPrefixedProperty(rscratch, 'labelAngle', prefix);
- if (rotation.strValue === 'autorotate') {
- theta = ele.isEdge() ? textAngle : 0;
- } else if (rotation.strValue === 'none') {
- theta = 0;
- } else {
- theta = rotation.pfValue;
- }
- return theta;
-};
-CRp$6.drawText = function (context, ele, prefix) {
- var applyRotation = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
- var useEleOpacity = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
- var _p = ele._private;
- var rscratch = _p.rscratch;
- var parentOpacity = useEleOpacity ? ele.effectiveOpacity() : 1;
- if (useEleOpacity && (parentOpacity === 0 || ele.pstyle('text-opacity').value === 0)) {
- return;
- }
+/***/ }),
- // use 'main' as an alias for the main label (i.e. null prefix)
- if (prefix === 'main') {
- prefix = null;
- }
- var textX = getPrefixedProperty(rscratch, 'labelX', prefix);
- var textY = getPrefixedProperty(rscratch, 'labelY', prefix);
- var orgTextX, orgTextY; // used for rotation
- var text = this.getLabelText(ele, prefix);
- if (text != null && text !== '' && !isNaN(textX) && !isNaN(textY)) {
- this.setupTextStyle(context, ele, useEleOpacity);
- var pdash = prefix ? prefix + '-' : '';
- var textW = getPrefixedProperty(rscratch, 'labelWidth', prefix);
- var textH = getPrefixedProperty(rscratch, 'labelHeight', prefix);
- var marginX = ele.pstyle(pdash + 'text-margin-x').pfValue;
- var marginY = ele.pstyle(pdash + 'text-margin-y').pfValue;
- var isEdge = ele.isEdge();
- var halign = ele.pstyle('text-halign').value;
- var valign = ele.pstyle('text-valign').value;
- if (isEdge) {
- halign = 'center';
- valign = 'center';
- }
- textX += marginX;
- textY += marginY;
- var theta;
- if (!applyRotation) {
- theta = 0;
- } else {
- theta = this.getTextAngle(ele, prefix);
- }
- if (theta !== 0) {
- orgTextX = textX;
- orgTextY = textY;
- context.translate(orgTextX, orgTextY);
- context.rotate(theta);
- textX = 0;
- textY = 0;
- }
- switch (valign) {
- case 'top':
- break;
- case 'center':
- textY += textH / 2;
- break;
- case 'bottom':
- textY += textH;
- break;
- }
- var backgroundOpacity = ele.pstyle('text-background-opacity').value;
- var borderOpacity = ele.pstyle('text-border-opacity').value;
- var textBorderWidth = ele.pstyle('text-border-width').pfValue;
- var backgroundPadding = ele.pstyle('text-background-padding').pfValue;
- if (backgroundOpacity > 0 || textBorderWidth > 0 && borderOpacity > 0) {
- var bgX = textX - backgroundPadding;
- switch (halign) {
- case 'left':
- bgX -= textW;
- break;
- case 'center':
- bgX -= textW / 2;
- break;
- }
- var bgY = textY - textH - backgroundPadding;
- var bgW = textW + 2 * backgroundPadding;
- var bgH = textH + 2 * backgroundPadding;
- if (backgroundOpacity > 0) {
- var textFill = context.fillStyle;
- var textBackgroundColor = ele.pstyle('text-background-color').value;
- context.fillStyle = 'rgba(' + textBackgroundColor[0] + ',' + textBackgroundColor[1] + ',' + textBackgroundColor[2] + ',' + backgroundOpacity * parentOpacity + ')';
- var styleShape = ele.pstyle('text-background-shape').strValue;
- if (styleShape.indexOf('round') === 0) {
- roundRect(context, bgX, bgY, bgW, bgH, 2);
- } else {
- context.fillRect(bgX, bgY, bgW, bgH);
- }
- context.fillStyle = textFill;
- }
- if (textBorderWidth > 0 && borderOpacity > 0) {
- var textStroke = context.strokeStyle;
- var textLineWidth = context.lineWidth;
- var textBorderColor = ele.pstyle('text-border-color').value;
- var textBorderStyle = ele.pstyle('text-border-style').value;
- context.strokeStyle = 'rgba(' + textBorderColor[0] + ',' + textBorderColor[1] + ',' + textBorderColor[2] + ',' + borderOpacity * parentOpacity + ')';
- context.lineWidth = textBorderWidth;
- if (context.setLineDash) {
- // for very outofdate browsers
- switch (textBorderStyle) {
- case 'dotted':
- context.setLineDash([1, 1]);
- break;
- case 'dashed':
- context.setLineDash([4, 2]);
- break;
- case 'double':
- context.lineWidth = textBorderWidth / 4; // 50% reserved for white between the two borders
- context.setLineDash([]);
- break;
- case 'solid':
- context.setLineDash([]);
- break;
- }
- }
- context.strokeRect(bgX, bgY, bgW, bgH);
- if (textBorderStyle === 'double') {
- var whiteWidth = textBorderWidth / 2;
- context.strokeRect(bgX + whiteWidth, bgY + whiteWidth, bgW - whiteWidth * 2, bgH - whiteWidth * 2);
- }
- if (context.setLineDash) {
- // for very outofdate browsers
- context.setLineDash([]);
- }
- context.lineWidth = textLineWidth;
- context.strokeStyle = textStroke;
- }
- }
- var lineWidth = 2 * ele.pstyle('text-outline-width').pfValue; // *2 b/c the stroke is drawn centred on the middle
+/***/ "./node_modules/lodash/_baseEach.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_baseEach.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
+ createBaseEach = __webpack_require__(/*! ./_createBaseEach */ "./node_modules/lodash/_createBaseEach.js");
+
+/**
+ * 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);
+
+module.exports = baseEach;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseExtremum.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseExtremum.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+
+/**
+ * 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;
- if (lineWidth > 0) {
- context.lineWidth = lineWidth;
- }
- if (ele.pstyle('text-wrap').value === 'wrap') {
- var lines = getPrefixedProperty(rscratch, 'labelWrapCachedLines', prefix);
- var lineHeight = getPrefixedProperty(rscratch, 'labelLineHeight', prefix);
- var halfTextW = textW / 2;
- var justification = this.getLabelJustification(ele);
- if (justification === 'auto') ; else if (halign === 'left') {
- // auto justification : right
- if (justification === 'left') {
- textX += -textW;
- } else if (justification === 'center') {
- textX += -halfTextW;
- } // else same as auto
- } else if (halign === 'center') {
- // auto justfication : center
- if (justification === 'left') {
- textX += -halfTextW;
- } else if (justification === 'right') {
- textX += halfTextW;
- } // else same as auto
- } else if (halign === 'right') {
- // auto justification : left
- if (justification === 'center') {
- textX += halfTextW;
- } else if (justification === 'right') {
- textX += textW;
- } // else same as auto
- }
+ while (++index < length) {
+ var value = array[index],
+ current = iteratee(value);
- switch (valign) {
- case 'top':
- textY -= (lines.length - 1) * lineHeight;
- break;
- case 'center':
- case 'bottom':
- textY -= (lines.length - 1) * lineHeight;
- break;
- }
- for (var l = 0; l < lines.length; l++) {
- if (lineWidth > 0) {
- context.strokeText(lines[l], textX, textY);
- }
- context.fillText(lines[l], textX, textY);
- textY += lineHeight;
- }
- } else {
- if (lineWidth > 0) {
- context.strokeText(text, textX, textY);
- }
- context.fillText(text, textX, textY);
- }
- if (theta !== 0) {
- context.rotate(-theta);
- context.translate(-orgTextX, -orgTextY);
+ if (current != null && (computed === undefined
+ ? (current === current && !isSymbol(current))
+ : comparator(current, computed)
+ )) {
+ var computed = current,
+ result = value;
}
}
-};
-
-/* global Path2D */
-var CRp$5 = {};
-CRp$5.drawNode = function (context, node, shiftToOriginWithBb) {
- var drawLabel = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
- var shouldDrawOverlay = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
- var shouldDrawOpacity = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : true;
- var r = this;
- var nodeWidth, nodeHeight;
- var _p = node._private;
- var rs = _p.rscratch;
- var pos = node.position();
- if (!number$1(pos.x) || !number$1(pos.y)) {
- return; // can't draw node with undefined position
- }
+ return result;
+}
- if (shouldDrawOpacity && !node.visible()) {
- return;
- }
- var eleOpacity = shouldDrawOpacity ? node.effectiveOpacity() : 1;
- var usePaths = r.usePaths();
- var path;
- var pathCacheHit = false;
- var padding = node.padding();
- nodeWidth = node.width() + 2 * padding;
- nodeHeight = node.height() + 2 * padding;
+module.exports = baseExtremum;
- //
- // setup shift
- var bb;
- if (shiftToOriginWithBb) {
- bb = shiftToOriginWithBb;
- context.translate(-bb.x1, -bb.y1);
- }
+/***/ }),
- //
- // load bg image
+/***/ "./node_modules/lodash/_baseFilter.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseFilter.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var bgImgProp = node.pstyle('background-image');
- var urls = bgImgProp.value;
- var urlDefined = new Array(urls.length);
- var image = new Array(urls.length);
- var numImages = 0;
- for (var i = 0; i < urls.length; i++) {
- var url = urls[i];
- var defd = urlDefined[i] = url != null && url !== 'none';
- if (defd) {
- var bgImgCrossOrigin = node.cy().style().getIndexedStyle(node, 'background-image-crossorigin', 'value', i);
- numImages++;
+var baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js");
- // get image, and if not loaded then ask to redraw when later loaded
- image[i] = r.getCachedImage(url, bgImgCrossOrigin, function () {
- _p.backgroundTimestamp = Date.now();
- node.emitAndNotify('background');
- });
+/**
+ * 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;
+}
- //
- // setup styles
+module.exports = baseFilter;
- var darkness = node.pstyle('background-blacken').value;
- var borderWidth = node.pstyle('border-width').pfValue;
- var bgOpacity = node.pstyle('background-opacity').value * eleOpacity;
- var borderColor = node.pstyle('border-color').value;
- var borderStyle = node.pstyle('border-style').value;
- var borderOpacity = node.pstyle('border-opacity').value * eleOpacity;
- context.lineJoin = 'miter'; // so borders are square with the node shape
- var setupShapeColor = function setupShapeColor() {
- var bgOpy = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : bgOpacity;
- r.eleFillStyle(context, node, bgOpy);
- };
- var setupBorderColor = function setupBorderColor() {
- var bdrOpy = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : borderOpacity;
- r.colorStrokeStyle(context, borderColor[0], borderColor[1], borderColor[2], bdrOpy);
- };
+/***/ }),
- //
- // setup shape
+/***/ "./node_modules/lodash/_baseFindIndex.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_baseFindIndex.js ***!
+ \***********************************************/
+/***/ (function(module) {
- var styleShape = node.pstyle('shape').strValue;
- var shapePts = node.pstyle('shape-polygon-points').pfValue;
- if (usePaths) {
- context.translate(pos.x, pos.y);
- var pathCache = r.nodePathCache = r.nodePathCache || [];
- var key = hashStrings(styleShape === 'polygon' ? styleShape + ',' + shapePts.join(',') : styleShape, '' + nodeHeight, '' + nodeWidth);
- var cachedPath = pathCache[key];
- if (cachedPath != null) {
- path = cachedPath;
- pathCacheHit = true;
- rs.pathCache = path;
- } else {
- path = new Path2D();
- pathCache[key] = rs.pathCache = path;
+/**
+ * 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;
}
}
- var drawShape = function drawShape() {
- if (!pathCacheHit) {
- var npos = pos;
- if (usePaths) {
- npos = {
- x: 0,
- y: 0
- };
- }
- r.nodeShapes[r.getNodeShape(node)].draw(path || context, npos.x, npos.y, nodeWidth, nodeHeight);
- }
- if (usePaths) {
- context.fill(path);
- } else {
- context.fill();
- }
- };
- var drawImages = function drawImages() {
- var nodeOpacity = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : eleOpacity;
- var inside = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
- var prevBging = _p.backgrounding;
- var totalCompleted = 0;
- for (var _i = 0; _i < image.length; _i++) {
- var bgContainment = node.cy().style().getIndexedStyle(node, 'background-image-containment', 'value', _i);
- if (inside && bgContainment === 'over' || !inside && bgContainment === 'inside') {
- totalCompleted++;
- continue;
- }
- if (urlDefined[_i] && image[_i].complete && !image[_i].error) {
- totalCompleted++;
- r.drawInscribedImage(context, image[_i], node, _i, nodeOpacity);
- }
- }
- _p.backgrounding = !(totalCompleted === numImages);
- if (prevBging !== _p.backgrounding) {
- // update style b/c :backgrounding state changed
- node.updateStyle(false);
- }
- };
- var drawPie = function drawPie() {
- var redrawShape = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
- var pieOpacity = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : eleOpacity;
- if (r.hasPie(node)) {
- r.drawPie(context, node, pieOpacity);
+ return -1;
+}
- // redraw/restore path if steps after pie need it
- if (redrawShape) {
- if (!usePaths) {
- r.nodeShapes[r.getNodeShape(node)].draw(context, pos.x, pos.y, nodeWidth, nodeHeight);
- }
- }
- }
- };
- var darken = function darken() {
- var darkenOpacity = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : eleOpacity;
- var opacity = (darkness > 0 ? darkness : -darkness) * darkenOpacity;
- var c = darkness > 0 ? 0 : 255;
- if (darkness !== 0) {
- r.colorFillStyle(context, c, c, c, opacity);
- if (usePaths) {
- context.fill(path);
- } else {
- context.fill();
- }
- }
- };
- var drawBorder = function drawBorder() {
- if (borderWidth > 0) {
- context.lineWidth = borderWidth;
- context.lineCap = 'butt';
- if (context.setLineDash) {
- // for very outofdate browsers
- switch (borderStyle) {
- case 'dotted':
- context.setLineDash([1, 1]);
- break;
- case 'dashed':
- context.setLineDash([4, 2]);
- break;
- case 'solid':
- case 'double':
- context.setLineDash([]);
- break;
- }
- }
- if (usePaths) {
- context.stroke(path);
- } else {
- context.stroke();
- }
- if (borderStyle === 'double') {
- context.lineWidth = borderWidth / 3;
- var gco = context.globalCompositeOperation;
- context.globalCompositeOperation = 'destination-out';
- if (usePaths) {
- context.stroke(path);
- } else {
- context.stroke();
- }
- context.globalCompositeOperation = gco;
- }
+module.exports = baseFindIndex;
- // reset in case we changed the border style
- if (context.setLineDash) {
- // for very outofdate browsers
- context.setLineDash([]);
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseFlatten.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseFlatten.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
+ isFlattenable = __webpack_require__(/*! ./_isFlattenable */ "./node_modules/lodash/_isFlattenable.js");
+
+/**
+ * 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;
}
- };
- var drawOverlay = function drawOverlay() {
- if (shouldDrawOverlay) {
- r.drawNodeOverlay(context, node, pos, nodeWidth, nodeHeight);
- }
- };
- var drawUnderlay = function drawUnderlay() {
- if (shouldDrawOverlay) {
- r.drawNodeUnderlay(context, node, pos, nodeWidth, nodeHeight);
- }
- };
- var drawText = function drawText() {
- r.drawElementText(context, node, null, drawLabel);
- };
- var ghost = node.pstyle('ghost').value === 'yes';
- if (ghost) {
- var gx = node.pstyle('ghost-offset-x').pfValue;
- var gy = node.pstyle('ghost-offset-y').pfValue;
- var ghostOpacity = node.pstyle('ghost-opacity').value;
- var effGhostOpacity = ghostOpacity * eleOpacity;
- context.translate(gx, gy);
- setupShapeColor(ghostOpacity * bgOpacity);
- drawShape();
- drawImages(effGhostOpacity, true);
- setupBorderColor(ghostOpacity * borderOpacity);
- drawBorder();
- drawPie(darkness !== 0 || borderWidth !== 0);
- drawImages(effGhostOpacity, false);
- darken(effGhostOpacity);
- context.translate(-gx, -gy);
- }
- if (usePaths) {
- context.translate(-pos.x, -pos.y);
- }
- drawUnderlay();
- if (usePaths) {
- context.translate(pos.x, pos.y);
}
- setupShapeColor();
- drawShape();
- drawImages(eleOpacity, true);
- setupBorderColor();
- drawBorder();
- drawPie(darkness !== 0 || borderWidth !== 0);
- drawImages(eleOpacity, false);
- darken();
- if (usePaths) {
- context.translate(-pos.x, -pos.y);
+ return result;
+}
+
+module.exports = baseFlatten;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseFor.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_baseFor.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var createBaseFor = __webpack_require__(/*! ./_createBaseFor */ "./node_modules/lodash/_createBaseFor.js");
+
+/**
+ * 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();
+
+module.exports = baseFor;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseForOwn.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseForOwn.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
+
+/**
+ * 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);
+}
+
+module.exports = baseForOwn;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseGet.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_baseGet.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
+ toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
+
+/**
+ * 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++])];
}
- drawText();
- drawOverlay();
+ return (index && index == length) ? object : undefined;
+}
+
+module.exports = baseGet;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseGetAllKeys.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_baseGetAllKeys.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+
+/**
+ * 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));
+}
+
+module.exports = baseGetAllKeys;
- //
- // clean up shift
- if (shiftToOriginWithBb) {
- context.translate(bb.x1, bb.y1);
- }
-};
-var drawNodeOverlayUnderlay = function drawNodeOverlayUnderlay(overlayOrUnderlay) {
- if (!['overlay', 'underlay'].includes(overlayOrUnderlay)) {
- throw new Error('Invalid state');
- }
- return function (context, node, pos, nodeWidth, nodeHeight) {
- var r = this;
- if (!node.visible()) {
- return;
- }
- var padding = node.pstyle("".concat(overlayOrUnderlay, "-padding")).pfValue;
- var opacity = node.pstyle("".concat(overlayOrUnderlay, "-opacity")).value;
- var color = node.pstyle("".concat(overlayOrUnderlay, "-color")).value;
- var shape = node.pstyle("".concat(overlayOrUnderlay, "-shape")).value;
- if (opacity > 0) {
- pos = pos || node.position();
- if (nodeWidth == null || nodeHeight == null) {
- var _padding = node.padding();
- nodeWidth = node.width() + 2 * _padding;
- nodeHeight = node.height() + 2 * _padding;
- }
- r.colorFillStyle(context, color[0], color[1], color[2], opacity);
- r.nodeShapes[shape].draw(context, pos.x, pos.y, nodeWidth + padding * 2, nodeHeight + padding * 2);
- context.fill();
- }
- };
-};
-CRp$5.drawNodeOverlay = drawNodeOverlayUnderlay('overlay');
-CRp$5.drawNodeUnderlay = drawNodeOverlayUnderlay('underlay');
+/***/ }),
-// does the node have at least one pie piece?
-CRp$5.hasPie = function (node) {
- node = node[0]; // ensure ele ref
+/***/ "./node_modules/lodash/_baseGetTag.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseGetTag.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- return node._private.hasPie;
-};
-CRp$5.drawPie = function (context, node, nodeOpacity, pos) {
- node = node[0]; // ensure ele ref
- pos = pos || node.position();
- var cyStyle = node.cy().style();
- var pieSize = node.pstyle('pie-size');
- var x = pos.x;
- var y = pos.y;
- var nodeW = node.width();
- var nodeH = node.height();
- var radius = Math.min(nodeW, nodeH) / 2; // must fit in node
- var lastPercent = 0; // what % to continue drawing pie slices from on [0, 1]
- var usePaths = this.usePaths();
- if (usePaths) {
- x = 0;
- y = 0;
- }
- if (pieSize.units === '%') {
- radius = radius * pieSize.pfValue;
- } else if (pieSize.pfValue !== undefined) {
- radius = pieSize.pfValue / 2;
- }
- for (var i = 1; i <= cyStyle.pieBackgroundN; i++) {
- // 1..N
- var size = node.pstyle('pie-' + i + '-background-size').value;
- var color = node.pstyle('pie-' + i + '-background-color').value;
- var opacity = node.pstyle('pie-' + i + '-background-opacity').value * nodeOpacity;
- var percent = size / 100; // map integer range [0, 100] to [0, 1]
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
+ getRawTag = __webpack_require__(/*! ./_getRawTag */ "./node_modules/lodash/_getRawTag.js"),
+ objectToString = __webpack_require__(/*! ./_objectToString */ "./node_modules/lodash/_objectToString.js");
- // percent can't push beyond 1
- if (percent + lastPercent > 1) {
- percent = 1 - lastPercent;
- }
- var angleStart = 1.5 * Math.PI + 2 * Math.PI * lastPercent; // start at 12 o'clock and go clockwise
- var angleDelta = 2 * Math.PI * percent;
- var angleEnd = angleStart + angleDelta;
+/** `Object#toString` result references. */
+var nullTag = '[object Null]',
+ undefinedTag = '[object Undefined]';
- // ignore if
- // - zero size
- // - we're already beyond the full circle
- // - adding the current slice would go beyond the full circle
- if (size === 0 || lastPercent >= 1 || lastPercent + percent > 1) {
- continue;
- }
- context.beginPath();
- context.moveTo(x, y);
- context.arc(x, y, radius, angleStart, angleEnd);
- context.closePath();
- this.colorFillStyle(context, color[0], color[1], color[2], opacity);
- context.fill();
- lastPercent += percent;
+/** Built-in value references. */
+var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
+
+/**
+ * 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);
+}
-var CRp$4 = {};
-var motionBlurDelay = 100;
+module.exports = baseGetTag;
-// var isFirefox = typeof InstallTrigger !== 'undefined';
-CRp$4.getPixelRatio = function () {
- var context = this.data.contexts[0];
- if (this.forcedPixelRatio != null) {
- return this.forcedPixelRatio;
- }
- var backingStore = context.backingStorePixelRatio || context.webkitBackingStorePixelRatio || context.mozBackingStorePixelRatio || context.msBackingStorePixelRatio || context.oBackingStorePixelRatio || context.backingStorePixelRatio || 1;
- return (window.devicePixelRatio || 1) / backingStore; // eslint-disable-line no-undef
-};
+/***/ }),
-CRp$4.paintCache = function (context) {
- var caches = this.paintCaches = this.paintCaches || [];
- var needToCreateCache = true;
- var cache;
- for (var i = 0; i < caches.length; i++) {
- cache = caches[i];
- if (cache.context === context) {
- needToCreateCache = false;
- break;
- }
- }
- if (needToCreateCache) {
- cache = {
- context: context
- };
- caches.push(cache);
- }
- return cache;
-};
-CRp$4.createGradientStyleFor = function (context, shapeStyleName, ele, fill, opacity) {
- var gradientStyle;
- var usePaths = this.usePaths();
- var colors = ele.pstyle(shapeStyleName + '-gradient-stop-colors').value,
- positions = ele.pstyle(shapeStyleName + '-gradient-stop-positions').pfValue;
- if (fill === 'radial-gradient') {
- if (ele.isEdge()) {
- var start = ele.sourceEndpoint(),
- end = ele.targetEndpoint(),
- mid = ele.midpoint();
- var d1 = dist(start, mid);
- var d2 = dist(end, mid);
- gradientStyle = context.createRadialGradient(mid.x, mid.y, 0, mid.x, mid.y, Math.max(d1, d2));
- } else {
- var pos = usePaths ? {
- x: 0,
- y: 0
- } : ele.position(),
- width = ele.paddedWidth(),
- height = ele.paddedHeight();
- gradientStyle = context.createRadialGradient(pos.x, pos.y, 0, pos.x, pos.y, Math.max(width, height));
- }
- } else {
- if (ele.isEdge()) {
- var _start = ele.sourceEndpoint(),
- _end = ele.targetEndpoint();
- gradientStyle = context.createLinearGradient(_start.x, _start.y, _end.x, _end.y);
- } else {
- var _pos = usePaths ? {
- x: 0,
- y: 0
- } : ele.position(),
- _width = ele.paddedWidth(),
- _height = ele.paddedHeight(),
- halfWidth = _width / 2,
- halfHeight = _height / 2;
- var direction = ele.pstyle('background-gradient-direction').value;
- switch (direction) {
- case 'to-bottom':
- gradientStyle = context.createLinearGradient(_pos.x, _pos.y - halfHeight, _pos.x, _pos.y + halfHeight);
- break;
- case 'to-top':
- gradientStyle = context.createLinearGradient(_pos.x, _pos.y + halfHeight, _pos.x, _pos.y - halfHeight);
- break;
- case 'to-left':
- gradientStyle = context.createLinearGradient(_pos.x + halfWidth, _pos.y, _pos.x - halfWidth, _pos.y);
- break;
- case 'to-right':
- gradientStyle = context.createLinearGradient(_pos.x - halfWidth, _pos.y, _pos.x + halfWidth, _pos.y);
- break;
- case 'to-bottom-right':
- case 'to-right-bottom':
- gradientStyle = context.createLinearGradient(_pos.x - halfWidth, _pos.y - halfHeight, _pos.x + halfWidth, _pos.y + halfHeight);
- break;
- case 'to-top-right':
- case 'to-right-top':
- gradientStyle = context.createLinearGradient(_pos.x - halfWidth, _pos.y + halfHeight, _pos.x + halfWidth, _pos.y - halfHeight);
- break;
- case 'to-bottom-left':
- case 'to-left-bottom':
- gradientStyle = context.createLinearGradient(_pos.x + halfWidth, _pos.y - halfHeight, _pos.x - halfWidth, _pos.y + halfHeight);
- break;
- case 'to-top-left':
- case 'to-left-top':
- gradientStyle = context.createLinearGradient(_pos.x + halfWidth, _pos.y + halfHeight, _pos.x - halfWidth, _pos.y - halfHeight);
- break;
- }
- }
- }
- if (!gradientStyle) return null; // invalid gradient style
+/***/ "./node_modules/lodash/_baseGt.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/_baseGt.js ***!
+ \****************************************/
+/***/ (function(module) {
- var hasPositions = positions.length === colors.length;
- var length = colors.length;
- for (var i = 0; i < length; i++) {
- gradientStyle.addColorStop(hasPositions ? positions[i] : i / (length - 1), 'rgba(' + colors[i][0] + ',' + colors[i][1] + ',' + colors[i][2] + ',' + opacity + ')');
- }
- return gradientStyle;
-};
-CRp$4.gradientFillStyle = function (context, ele, fill, opacity) {
- var gradientStyle = this.createGradientStyleFor(context, 'background', ele, fill, opacity);
- if (!gradientStyle) return null; // error
- context.fillStyle = gradientStyle;
-};
-CRp$4.colorFillStyle = function (context, r, g, b, a) {
- context.fillStyle = 'rgba(' + r + ',' + g + ',' + b + ',' + a + ')';
- // turn off for now, seems context does its own caching
+/**
+ * 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;
+}
- // var cache = this.paintCache(context);
+module.exports = baseGt;
- // var fillStyle = 'rgba(' + r + ',' + g + ',' + b + ',' + a + ')';
- // if( cache.fillStyle !== fillStyle ){
- // context.fillStyle = cache.fillStyle = fillStyle;
- // }
-};
+/***/ }),
-CRp$4.eleFillStyle = function (context, ele, opacity) {
- var backgroundFill = ele.pstyle('background-fill').value;
- if (backgroundFill === 'linear-gradient' || backgroundFill === 'radial-gradient') {
- this.gradientFillStyle(context, ele, backgroundFill, opacity);
- } else {
- var backgroundColor = ele.pstyle('background-color').value;
- this.colorFillStyle(context, backgroundColor[0], backgroundColor[1], backgroundColor[2], opacity);
- }
-};
-CRp$4.gradientStrokeStyle = function (context, ele, fill, opacity) {
- var gradientStyle = this.createGradientStyleFor(context, 'line', ele, fill, opacity);
- if (!gradientStyle) return null; // error
- context.strokeStyle = gradientStyle;
-};
-CRp$4.colorStrokeStyle = function (context, r, g, b, a) {
- context.strokeStyle = 'rgba(' + r + ',' + g + ',' + b + ',' + a + ')';
- // turn off for now, seems context does its own caching
+/***/ "./node_modules/lodash/_baseHas.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_baseHas.js ***!
+ \*****************************************/
+/***/ (function(module) {
- // var cache = this.paintCache(context);
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
- // var strokeStyle = 'rgba(' + r + ',' + g + ',' + b + ',' + a + ')';
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
- // if( cache.strokeStyle !== strokeStyle ){
- // context.strokeStyle = cache.strokeStyle = strokeStyle;
- // }
-};
+/**
+ * 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);
+}
-CRp$4.eleStrokeStyle = function (context, ele, opacity) {
- var lineFill = ele.pstyle('line-fill').value;
- if (lineFill === 'linear-gradient' || lineFill === 'radial-gradient') {
- this.gradientStrokeStyle(context, ele, lineFill, opacity);
- } else {
- var lineColor = ele.pstyle('line-color').value;
- this.colorStrokeStyle(context, lineColor[0], lineColor[1], lineColor[2], opacity);
- }
-};
+module.exports = baseHas;
-// Resize canvas
-CRp$4.matchCanvasSize = function (container) {
- var r = this;
- var data = r.data;
- var bb = r.findContainerClientCoords();
- var width = bb[2];
- var height = bb[3];
- var pixelRatio = r.getPixelRatio();
- var mbPxRatio = r.motionBlurPxRatio;
- if (container === r.data.bufferCanvases[r.MOTIONBLUR_BUFFER_NODE] || container === r.data.bufferCanvases[r.MOTIONBLUR_BUFFER_DRAG]) {
- pixelRatio = mbPxRatio;
- }
- var canvasWidth = width * pixelRatio;
- var canvasHeight = height * pixelRatio;
- var canvas;
- if (canvasWidth === r.canvasWidth && canvasHeight === r.canvasHeight) {
- return; // save cycles if same
- }
- r.fontCaches = null; // resizing resets the style
+/***/ }),
- var canvasContainer = data.canvasContainer;
- canvasContainer.style.width = width + 'px';
- canvasContainer.style.height = height + 'px';
- for (var i = 0; i < r.CANVAS_LAYERS; i++) {
- canvas = data.canvases[i];
- canvas.width = canvasWidth;
- canvas.height = canvasHeight;
- canvas.style.width = width + 'px';
- canvas.style.height = height + 'px';
- }
- for (var i = 0; i < r.BUFFER_COUNT; i++) {
- canvas = data.bufferCanvases[i];
- canvas.width = canvasWidth;
- canvas.height = canvasHeight;
- canvas.style.width = width + 'px';
- canvas.style.height = height + 'px';
- }
- r.textureMult = 1;
- if (pixelRatio <= 1) {
- canvas = data.bufferCanvases[r.TEXTURE_BUFFER];
- r.textureMult = 2;
- canvas.width = canvasWidth * r.textureMult;
- canvas.height = canvasHeight * r.textureMult;
- }
- r.canvasWidth = canvasWidth;
- r.canvasHeight = canvasHeight;
-};
-CRp$4.renderTo = function (cxt, zoom, pan, pxRatio) {
- this.render({
- forcedContext: cxt,
- forcedZoom: zoom,
- forcedPan: pan,
- drawAllLayers: true,
- forcedPxRatio: pxRatio
- });
-};
-CRp$4.render = function (options) {
- options = options || staticEmptyObject();
- var forcedContext = options.forcedContext;
- var drawAllLayers = options.drawAllLayers;
- var drawOnlyNodeLayer = options.drawOnlyNodeLayer;
- var forcedZoom = options.forcedZoom;
- var forcedPan = options.forcedPan;
- var r = this;
- var pixelRatio = options.forcedPxRatio === undefined ? this.getPixelRatio() : options.forcedPxRatio;
- var cy = r.cy;
- var data = r.data;
- var needDraw = data.canvasNeedsRedraw;
- var textureDraw = r.textureOnViewport && !forcedContext && (r.pinching || r.hoverData.dragging || r.swipePanning || r.data.wheelZooming);
- var motionBlur = options.motionBlur !== undefined ? options.motionBlur : r.motionBlur;
- var mbPxRatio = r.motionBlurPxRatio;
- var hasCompoundNodes = cy.hasCompoundNodes();
- var inNodeDragGesture = r.hoverData.draggingEles;
- var inBoxSelection = r.hoverData.selecting || r.touchData.selecting ? true : false;
- motionBlur = motionBlur && !forcedContext && r.motionBlurEnabled && !inBoxSelection;
- var motionBlurFadeEffect = motionBlur;
- if (!forcedContext) {
- if (r.prevPxRatio !== pixelRatio) {
- r.invalidateContainerClientCoordsCache();
- r.matchCanvasSize(r.container);
- r.redrawHint('eles', true);
- r.redrawHint('drag', true);
- }
- r.prevPxRatio = pixelRatio;
- }
- if (!forcedContext && r.motionBlurTimeout) {
- clearTimeout(r.motionBlurTimeout);
- }
- if (motionBlur) {
- if (r.mbFrames == null) {
- r.mbFrames = 0;
- }
- r.mbFrames++;
- if (r.mbFrames < 3) {
- // need several frames before even high quality motionblur
- motionBlurFadeEffect = false;
- }
+/***/ "./node_modules/lodash/_baseHasIn.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseHasIn.js ***!
+ \*******************************************/
+/***/ (function(module) {
- // go to lower quality blurry frames when several m/b frames have been rendered (avoids flashing)
- if (r.mbFrames > r.minMbLowQualFrames) {
- //r.fullQualityMb = false;
- r.motionBlurPxRatio = r.mbPxRBlurry;
- }
- }
- if (r.clearingMotionBlur) {
- r.motionBlurPxRatio = 1;
- }
+/**
+ * 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);
+}
- // b/c drawToContext() may be async w.r.t. redraw(), keep track of last texture frame
- // because a rogue async texture frame would clear needDraw
- if (r.textureDrawLastFrame && !textureDraw) {
- needDraw[r.NODE] = true;
- needDraw[r.SELECT_BOX] = true;
- }
- var style = cy.style();
- var zoom = cy.zoom();
- var effectiveZoom = forcedZoom !== undefined ? forcedZoom : zoom;
- var pan = cy.pan();
- var effectivePan = {
- x: pan.x,
- y: pan.y
- };
- var vp = {
- zoom: zoom,
- pan: {
- x: pan.x,
- y: pan.y
- }
- };
- var prevVp = r.prevViewport;
- var viewportIsDiff = prevVp === undefined || vp.zoom !== prevVp.zoom || vp.pan.x !== prevVp.pan.x || vp.pan.y !== prevVp.pan.y;
+module.exports = baseHasIn;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIndexOf.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseIndexOf.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseFindIndex = __webpack_require__(/*! ./_baseFindIndex */ "./node_modules/lodash/_baseFindIndex.js"),
+ baseIsNaN = __webpack_require__(/*! ./_baseIsNaN */ "./node_modules/lodash/_baseIsNaN.js"),
+ strictIndexOf = __webpack_require__(/*! ./_strictIndexOf */ "./node_modules/lodash/_strictIndexOf.js");
+
+/**
+ * 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);
+}
+
+module.exports = baseIndexOf;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIsArguments.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_baseIsArguments.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]';
+
+/**
+ * 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;
+}
- // we want the low quality motionblur only when the viewport is being manipulated etc (where it's not noticed)
- if (!viewportIsDiff && !(inNodeDragGesture && !hasCompoundNodes)) {
- r.motionBlurPxRatio = 1;
- }
- if (forcedPan) {
- effectivePan = forcedPan;
- }
+module.exports = baseIsArguments;
- // apply pixel ratio
- effectiveZoom *= pixelRatio;
- effectivePan.x *= pixelRatio;
- effectivePan.y *= pixelRatio;
- var eles = r.getCachedZSortedEles();
- function mbclear(context, x, y, w, h) {
- var gco = context.globalCompositeOperation;
- context.globalCompositeOperation = 'destination-out';
- r.colorFillStyle(context, 255, 255, 255, r.motionBlurTransparency);
- context.fillRect(x, y, w, h);
- context.globalCompositeOperation = gco;
- }
- function setContextTransform(context, clear) {
- var ePan, eZoom, w, h;
- if (!r.clearingMotionBlur && (context === data.bufferContexts[r.MOTIONBLUR_BUFFER_NODE] || context === data.bufferContexts[r.MOTIONBLUR_BUFFER_DRAG])) {
- ePan = {
- x: pan.x * mbPxRatio,
- y: pan.y * mbPxRatio
- };
- eZoom = zoom * mbPxRatio;
- w = r.canvasWidth * mbPxRatio;
- h = r.canvasHeight * mbPxRatio;
- } else {
- ePan = effectivePan;
- eZoom = effectiveZoom;
- w = r.canvasWidth;
- h = r.canvasHeight;
- }
- context.setTransform(1, 0, 0, 1, 0, 0);
- if (clear === 'motionBlur') {
- mbclear(context, 0, 0, w, h);
- } else if (!forcedContext && (clear === undefined || clear)) {
- context.clearRect(0, 0, w, h);
- }
- if (!drawAllLayers) {
- context.translate(ePan.x, ePan.y);
- context.scale(eZoom, eZoom);
- }
- if (forcedPan) {
- context.translate(forcedPan.x, forcedPan.y);
- }
- if (forcedZoom) {
- context.scale(forcedZoom, forcedZoom);
- }
- }
- if (!textureDraw) {
- r.textureDrawLastFrame = false;
- }
- if (textureDraw) {
- r.textureDrawLastFrame = true;
- if (!r.textureCache) {
- r.textureCache = {};
- r.textureCache.bb = cy.mutableElements().boundingBox();
- r.textureCache.texture = r.data.bufferCanvases[r.TEXTURE_BUFFER];
- var cxt = r.data.bufferContexts[r.TEXTURE_BUFFER];
- cxt.setTransform(1, 0, 0, 1, 0, 0);
- cxt.clearRect(0, 0, r.canvasWidth * r.textureMult, r.canvasHeight * r.textureMult);
- r.render({
- forcedContext: cxt,
- drawOnlyNodeLayer: true,
- forcedPxRatio: pixelRatio * r.textureMult
- });
- var vp = r.textureCache.viewport = {
- zoom: cy.zoom(),
- pan: cy.pan(),
- width: r.canvasWidth,
- height: r.canvasHeight
- };
- vp.mpan = {
- x: (0 - vp.pan.x) / vp.zoom,
- y: (0 - vp.pan.y) / vp.zoom
- };
- }
- needDraw[r.DRAG] = false;
- needDraw[r.NODE] = false;
- var context = data.contexts[r.NODE];
- var texture = r.textureCache.texture;
- var vp = r.textureCache.viewport;
- context.setTransform(1, 0, 0, 1, 0, 0);
- if (motionBlur) {
- mbclear(context, 0, 0, vp.width, vp.height);
- } else {
- context.clearRect(0, 0, vp.width, vp.height);
- }
- var outsideBgColor = style.core('outside-texture-bg-color').value;
- var outsideBgOpacity = style.core('outside-texture-bg-opacity').value;
- r.colorFillStyle(context, outsideBgColor[0], outsideBgColor[1], outsideBgColor[2], outsideBgOpacity);
- context.fillRect(0, 0, vp.width, vp.height);
- var zoom = cy.zoom();
- setContextTransform(context, false);
- context.clearRect(vp.mpan.x, vp.mpan.y, vp.width / vp.zoom / pixelRatio, vp.height / vp.zoom / pixelRatio);
- context.drawImage(texture, vp.mpan.x, vp.mpan.y, vp.width / vp.zoom / pixelRatio, vp.height / vp.zoom / pixelRatio);
- } else if (r.textureOnViewport && !forcedContext) {
- // clear the cache since we don't need it
- r.textureCache = null;
- }
- var extent = cy.extent();
- var vpManip = r.pinching || r.hoverData.dragging || r.swipePanning || r.data.wheelZooming || r.hoverData.draggingEles || r.cy.animated();
- var hideEdges = r.hideEdgesOnViewport && vpManip;
- var needMbClear = [];
- needMbClear[r.NODE] = !needDraw[r.NODE] && motionBlur && !r.clearedForMotionBlur[r.NODE] || r.clearingMotionBlur;
- if (needMbClear[r.NODE]) {
- r.clearedForMotionBlur[r.NODE] = true;
- }
- needMbClear[r.DRAG] = !needDraw[r.DRAG] && motionBlur && !r.clearedForMotionBlur[r.DRAG] || r.clearingMotionBlur;
- if (needMbClear[r.DRAG]) {
- r.clearedForMotionBlur[r.DRAG] = true;
- }
- if (needDraw[r.NODE] || drawAllLayers || drawOnlyNodeLayer || needMbClear[r.NODE]) {
- var useBuffer = motionBlur && !needMbClear[r.NODE] && mbPxRatio !== 1;
- var context = forcedContext || (useBuffer ? r.data.bufferContexts[r.MOTIONBLUR_BUFFER_NODE] : data.contexts[r.NODE]);
- var clear = motionBlur && !useBuffer ? 'motionBlur' : undefined;
- setContextTransform(context, clear);
- if (hideEdges) {
- r.drawCachedNodes(context, eles.nondrag, pixelRatio, extent);
- } else {
- r.drawLayeredElements(context, eles.nondrag, pixelRatio, extent);
- }
- if (r.debug) {
- r.drawDebugPoints(context, eles.nondrag);
- }
- if (!drawAllLayers && !motionBlur) {
- needDraw[r.NODE] = false;
- }
- }
- if (!drawOnlyNodeLayer && (needDraw[r.DRAG] || drawAllLayers || needMbClear[r.DRAG])) {
- var useBuffer = motionBlur && !needMbClear[r.DRAG] && mbPxRatio !== 1;
- var context = forcedContext || (useBuffer ? r.data.bufferContexts[r.MOTIONBLUR_BUFFER_DRAG] : data.contexts[r.DRAG]);
- setContextTransform(context, motionBlur && !useBuffer ? 'motionBlur' : undefined);
- if (hideEdges) {
- r.drawCachedNodes(context, eles.drag, pixelRatio, extent);
- } else {
- r.drawCachedElements(context, eles.drag, pixelRatio, extent);
- }
- if (r.debug) {
- r.drawDebugPoints(context, eles.drag);
- }
- if (!drawAllLayers && !motionBlur) {
- needDraw[r.DRAG] = false;
- }
- }
- if (r.showFps || !drawOnlyNodeLayer && needDraw[r.SELECT_BOX] && !drawAllLayers) {
- var context = forcedContext || data.contexts[r.SELECT_BOX];
- setContextTransform(context);
- if (r.selection[4] == 1 && (r.hoverData.selecting || r.touchData.selecting)) {
- var zoom = r.cy.zoom();
- var borderWidth = style.core('selection-box-border-width').value / zoom;
- context.lineWidth = borderWidth;
- context.fillStyle = 'rgba(' + style.core('selection-box-color').value[0] + ',' + style.core('selection-box-color').value[1] + ',' + style.core('selection-box-color').value[2] + ',' + style.core('selection-box-opacity').value + ')';
- context.fillRect(r.selection[0], r.selection[1], r.selection[2] - r.selection[0], r.selection[3] - r.selection[1]);
- if (borderWidth > 0) {
- context.strokeStyle = 'rgba(' + style.core('selection-box-border-color').value[0] + ',' + style.core('selection-box-border-color').value[1] + ',' + style.core('selection-box-border-color').value[2] + ',' + style.core('selection-box-opacity').value + ')';
- context.strokeRect(r.selection[0], r.selection[1], r.selection[2] - r.selection[0], r.selection[3] - r.selection[1]);
- }
- }
- if (data.bgActivePosistion && !r.hoverData.selecting) {
- var zoom = r.cy.zoom();
- var pos = data.bgActivePosistion;
- context.fillStyle = 'rgba(' + style.core('active-bg-color').value[0] + ',' + style.core('active-bg-color').value[1] + ',' + style.core('active-bg-color').value[2] + ',' + style.core('active-bg-opacity').value + ')';
- context.beginPath();
- context.arc(pos.x, pos.y, style.core('active-bg-size').pfValue / zoom, 0, 2 * Math.PI);
- context.fill();
- }
- var timeToRender = r.lastRedrawTime;
- if (r.showFps && timeToRender) {
- timeToRender = Math.round(timeToRender);
- var fps = Math.round(1000 / timeToRender);
- context.setTransform(1, 0, 0, 1, 0, 0);
- context.fillStyle = 'rgba(255, 0, 0, 0.75)';
- context.strokeStyle = 'rgba(255, 0, 0, 0.75)';
- context.lineWidth = 1;
- context.fillText('1 frame = ' + timeToRender + ' ms = ' + fps + ' fps', 0, 20);
- var maxFps = 60;
- context.strokeRect(0, 30, 250, 20);
- context.fillRect(0, 30, 250 * Math.min(fps / maxFps, 1), 20);
- }
- if (!drawAllLayers) {
- needDraw[r.SELECT_BOX] = false;
- }
- }
+/***/ }),
- // motionblur: blit rendered blurry frames
- if (motionBlur && mbPxRatio !== 1) {
- var cxtNode = data.contexts[r.NODE];
- var txtNode = r.data.bufferCanvases[r.MOTIONBLUR_BUFFER_NODE];
- var cxtDrag = data.contexts[r.DRAG];
- var txtDrag = r.data.bufferCanvases[r.MOTIONBLUR_BUFFER_DRAG];
- var drawMotionBlur = function drawMotionBlur(cxt, txt, needClear) {
- cxt.setTransform(1, 0, 0, 1, 0, 0);
- if (needClear || !motionBlurFadeEffect) {
- cxt.clearRect(0, 0, r.canvasWidth, r.canvasHeight);
- } else {
- mbclear(cxt, 0, 0, r.canvasWidth, r.canvasHeight);
- }
- var pxr = mbPxRatio;
- cxt.drawImage(txt,
- // img
- 0, 0,
- // sx, sy
- r.canvasWidth * pxr, r.canvasHeight * pxr,
- // sw, sh
- 0, 0,
- // x, y
- r.canvasWidth, r.canvasHeight // w, h
- );
- };
+/***/ "./node_modules/lodash/_baseIsEqual.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseIsEqual.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (needDraw[r.NODE] || needMbClear[r.NODE]) {
- drawMotionBlur(cxtNode, txtNode, needMbClear[r.NODE]);
- needDraw[r.NODE] = false;
- }
- if (needDraw[r.DRAG] || needMbClear[r.DRAG]) {
- drawMotionBlur(cxtDrag, txtDrag, needMbClear[r.DRAG]);
- needDraw[r.DRAG] = false;
- }
- }
- r.prevViewport = vp;
- if (r.clearingMotionBlur) {
- r.clearingMotionBlur = false;
- r.motionBlurCleared = true;
- r.motionBlur = true;
- }
- if (motionBlur) {
- r.motionBlurTimeout = setTimeout(function () {
- r.motionBlurTimeout = null;
- r.clearedForMotionBlur[r.NODE] = false;
- r.clearedForMotionBlur[r.DRAG] = false;
- r.motionBlur = false;
- r.clearingMotionBlur = !textureDraw;
- r.mbFrames = 0;
- needDraw[r.NODE] = true;
- needDraw[r.DRAG] = true;
- r.redraw();
- }, motionBlurDelay);
+var baseIsEqualDeep = __webpack_require__(/*! ./_baseIsEqualDeep */ "./node_modules/lodash/_baseIsEqualDeep.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+
+/**
+ * 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 (!forcedContext) {
- cy.emit('render');
+ if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
+ return value !== value && other !== other;
}
-};
+ return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+}
-var CRp$3 = {};
+module.exports = baseIsEqual;
-// @O Polygon drawing
-CRp$3.drawPolygonPath = function (context, x, y, width, height, points) {
- var halfW = width / 2;
- var halfH = height / 2;
- if (context.beginPath) {
- context.beginPath();
- }
- context.moveTo(x + halfW * points[0], y + halfH * points[1]);
- for (var i = 1; i < points.length / 2; i++) {
- context.lineTo(x + halfW * points[i * 2], y + halfH * points[i * 2 + 1]);
- }
- context.closePath();
-};
-CRp$3.drawRoundPolygonPath = function (context, x, y, width, height, points) {
- var halfW = width / 2;
- var halfH = height / 2;
- var cornerRadius = getRoundPolygonRadius(width, height);
- if (context.beginPath) {
- context.beginPath();
- }
- for (var _i = 0; _i < points.length / 4; _i++) {
- var sourceUv = void 0,
- destUv = void 0;
- if (_i === 0) {
- sourceUv = points.length - 2;
- } else {
- sourceUv = _i * 4 - 2;
- }
- destUv = _i * 4 + 2;
- var px = x + halfW * points[_i * 4];
- var py = y + halfH * points[_i * 4 + 1];
- var cosTheta = -points[sourceUv] * points[destUv] - points[sourceUv + 1] * points[destUv + 1];
- var offset = cornerRadius / Math.tan(Math.acos(cosTheta) / 2);
- var cp0x = px - offset * points[sourceUv];
- var cp0y = py - offset * points[sourceUv + 1];
- var cp1x = px + offset * points[destUv];
- var cp1y = py + offset * points[destUv + 1];
- if (_i === 0) {
- context.moveTo(cp0x, cp0y);
- } else {
- context.lineTo(cp0x, cp0y);
- }
- context.arcTo(px, py, cp1x, cp1y, cornerRadius);
- }
- context.closePath();
-};
-// Round rectangle drawing
-CRp$3.drawRoundRectanglePath = function (context, x, y, width, height) {
- var halfWidth = width / 2;
- var halfHeight = height / 2;
- var cornerRadius = getRoundRectangleRadius(width, height);
- if (context.beginPath) {
- context.beginPath();
- }
+/***/ }),
- // Start at top middle
- context.moveTo(x, y - halfHeight);
- // Arc from middle top to right side
- context.arcTo(x + halfWidth, y - halfHeight, x + halfWidth, y, cornerRadius);
- // Arc from right side to bottom
- context.arcTo(x + halfWidth, y + halfHeight, x, y + halfHeight, cornerRadius);
- // Arc from bottom to left side
- context.arcTo(x - halfWidth, y + halfHeight, x - halfWidth, y, cornerRadius);
- // Arc from left side to topBorder
- context.arcTo(x - halfWidth, y - halfHeight, x, y - halfHeight, cornerRadius);
- // Join line
- context.lineTo(x, y - halfHeight);
- context.closePath();
-};
-CRp$3.drawBottomRoundRectanglePath = function (context, x, y, width, height) {
- var halfWidth = width / 2;
- var halfHeight = height / 2;
- var cornerRadius = getRoundRectangleRadius(width, height);
- if (context.beginPath) {
- context.beginPath();
- }
+/***/ "./node_modules/lodash/_baseIsEqualDeep.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_baseIsEqualDeep.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Start at top middle
- context.moveTo(x, y - halfHeight);
- context.lineTo(x + halfWidth, y - halfHeight);
- context.lineTo(x + halfWidth, y);
- context.arcTo(x + halfWidth, y + halfHeight, x, y + halfHeight, cornerRadius);
- context.arcTo(x - halfWidth, y + halfHeight, x - halfWidth, y, cornerRadius);
- context.lineTo(x - halfWidth, y - halfHeight);
- context.lineTo(x, y - halfHeight);
- context.closePath();
-};
-CRp$3.drawCutRectanglePath = function (context, x, y, width, height) {
- var halfWidth = width / 2;
- var halfHeight = height / 2;
- var cornerLength = getCutRectangleCornerLength();
- if (context.beginPath) {
- context.beginPath();
- }
- context.moveTo(x - halfWidth + cornerLength, y - halfHeight);
- context.lineTo(x + halfWidth - cornerLength, y - halfHeight);
- context.lineTo(x + halfWidth, y - halfHeight + cornerLength);
- context.lineTo(x + halfWidth, y + halfHeight - cornerLength);
- context.lineTo(x + halfWidth - cornerLength, y + halfHeight);
- context.lineTo(x - halfWidth + cornerLength, y + halfHeight);
- context.lineTo(x - halfWidth, y + halfHeight - cornerLength);
- context.lineTo(x - halfWidth, y - halfHeight + cornerLength);
- context.closePath();
-};
-CRp$3.drawBarrelPath = function (context, x, y, width, height) {
- var halfWidth = width / 2;
- var halfHeight = height / 2;
- var xBegin = x - halfWidth;
- var xEnd = x + halfWidth;
- var yBegin = y - halfHeight;
- var yEnd = y + halfHeight;
- var barrelCurveConstants = getBarrelCurveConstants(width, height);
- var wOffset = barrelCurveConstants.widthOffset;
- var hOffset = barrelCurveConstants.heightOffset;
- var ctrlPtXOffset = barrelCurveConstants.ctrlPtOffsetPct * wOffset;
- if (context.beginPath) {
- context.beginPath();
- }
- context.moveTo(xBegin, yBegin + hOffset);
- context.lineTo(xBegin, yEnd - hOffset);
- context.quadraticCurveTo(xBegin + ctrlPtXOffset, yEnd, xBegin + wOffset, yEnd);
- context.lineTo(xEnd - wOffset, yEnd);
- context.quadraticCurveTo(xEnd - ctrlPtXOffset, yEnd, xEnd, yEnd - hOffset);
- context.lineTo(xEnd, yBegin + hOffset);
- context.quadraticCurveTo(xEnd - ctrlPtXOffset, yBegin, xEnd - wOffset, yBegin);
- context.lineTo(xBegin + wOffset, yBegin);
- context.quadraticCurveTo(xBegin + ctrlPtXOffset, yBegin, xBegin, yBegin + hOffset);
- context.closePath();
-};
-var sin0 = Math.sin(0);
-var cos0 = Math.cos(0);
-var sin = {};
-var cos = {};
-var ellipseStepSize = Math.PI / 40;
-for (var i = 0 * Math.PI; i < 2 * Math.PI; i += ellipseStepSize) {
- sin[i] = Math.sin(i);
- cos[i] = Math.cos(i);
-}
-CRp$3.drawEllipsePath = function (context, centerX, centerY, width, height) {
- if (context.beginPath) {
- context.beginPath();
- }
- if (context.ellipse) {
- context.ellipse(centerX, centerY, width / 2, height / 2, 0, 0, 2 * Math.PI);
- } else {
- var xPos, yPos;
- var rw = width / 2;
- var rh = height / 2;
- for (var i = 0 * Math.PI; i < 2 * Math.PI; i += ellipseStepSize) {
- xPos = centerX - rw * sin[i] * sin0 + rw * cos[i] * cos0;
- yPos = centerY + rh * cos[i] * sin0 + rh * sin[i] * cos0;
- if (i === 0) {
- context.moveTo(xPos, yPos);
- } else {
- context.lineTo(xPos, yPos);
- }
- }
- }
- context.closePath();
-};
+var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
+ equalArrays = __webpack_require__(/*! ./_equalArrays */ "./node_modules/lodash/_equalArrays.js"),
+ equalByTag = __webpack_require__(/*! ./_equalByTag */ "./node_modules/lodash/_equalByTag.js"),
+ equalObjects = __webpack_require__(/*! ./_equalObjects */ "./node_modules/lodash/_equalObjects.js"),
+ getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
-/* global atob, ArrayBuffer, Uint8Array, Blob */
-var CRp$2 = {};
-CRp$2.createBuffer = function (w, h) {
- var buffer = document.createElement('canvas'); // eslint-disable-line no-undef
- buffer.width = w;
- buffer.height = h;
- return [buffer, buffer.getContext('2d')];
-};
-CRp$2.bufferCanvasImage = function (options) {
- var cy = this.cy;
- var eles = cy.mutableElements();
- var bb = eles.boundingBox();
- var ctrRect = this.findContainerClientCoords();
- var width = options.full ? Math.ceil(bb.w) : ctrRect[2];
- var height = options.full ? Math.ceil(bb.h) : ctrRect[3];
- var specdMaxDims = number$1(options.maxWidth) || number$1(options.maxHeight);
- var pxRatio = this.getPixelRatio();
- var scale = 1;
- if (options.scale !== undefined) {
- width *= options.scale;
- height *= options.scale;
- scale = options.scale;
- } else if (specdMaxDims) {
- var maxScaleW = Infinity;
- var maxScaleH = Infinity;
- if (number$1(options.maxWidth)) {
- maxScaleW = scale * options.maxWidth / width;
- }
- if (number$1(options.maxHeight)) {
- maxScaleH = scale * options.maxHeight / height;
- }
- scale = Math.min(maxScaleW, maxScaleH);
- width *= scale;
- height *= scale;
- }
- if (!specdMaxDims) {
- width *= pxRatio;
- height *= pxRatio;
- scale *= pxRatio;
- }
- var buffCanvas = document.createElement('canvas'); // eslint-disable-line no-undef
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1;
- buffCanvas.width = width;
- buffCanvas.height = height;
- buffCanvas.style.width = width + 'px';
- buffCanvas.style.height = height + 'px';
- var buffCxt = buffCanvas.getContext('2d');
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+ arrayTag = '[object Array]',
+ objectTag = '[object Object]';
- // Rasterize the layers, but only if container has nonzero size
- if (width > 0 && height > 0) {
- buffCxt.clearRect(0, 0, width, height);
- buffCxt.globalCompositeOperation = 'source-over';
- var zsortedEles = this.getCachedZSortedEles();
- if (options.full) {
- // draw the full bounds of the graph
- buffCxt.translate(-bb.x1 * scale, -bb.y1 * scale);
- buffCxt.scale(scale, scale);
- this.drawElements(buffCxt, zsortedEles);
- buffCxt.scale(1 / scale, 1 / scale);
- buffCxt.translate(bb.x1 * scale, bb.y1 * scale);
- } else {
- // draw the current view
- var pan = cy.pan();
- var translation = {
- x: pan.x * scale,
- y: pan.y * scale
- };
- scale *= cy.zoom();
- buffCxt.translate(translation.x, translation.y);
- buffCxt.scale(scale, scale);
- this.drawElements(buffCxt, zsortedEles);
- buffCxt.scale(1 / scale, 1 / scale);
- buffCxt.translate(-translation.x, -translation.y);
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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__');
- // need to fill bg at end like this in order to fill cleared transparent pixels in jpgs
- if (options.bg) {
- buffCxt.globalCompositeOperation = 'destination-over';
- buffCxt.fillStyle = options.bg;
- buffCxt.rect(0, 0, width, height);
- buffCxt.fill();
+ 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);
}
}
- return buffCanvas;
-};
-function b64ToBlob(b64, mimeType) {
- var bytes = atob(b64);
- var buff = new ArrayBuffer(bytes.length);
- var buffUint8 = new Uint8Array(buff);
- for (var i = 0; i < bytes.length; i++) {
- buffUint8[i] = bytes.charCodeAt(i);
+ if (!isSameTag) {
+ return false;
}
- return new Blob([buff], {
- type: mimeType
- });
-}
-function b64UriToB64(b64uri) {
- var i = b64uri.indexOf(',');
- return b64uri.substr(i + 1);
+ stack || (stack = new Stack);
+ return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
}
-function output(options, canvas, mimeType) {
- var getB64Uri = function getB64Uri() {
- return canvas.toDataURL(mimeType, options.quality);
- };
- switch (options.output) {
- case 'blob-promise':
- return new Promise$1(function (resolve, reject) {
- try {
- canvas.toBlob(function (blob) {
- if (blob != null) {
- resolve(blob);
- } else {
- reject(new Error('`canvas.toBlob()` sent a null value in its callback'));
- }
- }, mimeType, options.quality);
- } catch (err) {
- reject(err);
- }
- });
- case 'blob':
- return b64ToBlob(b64UriToB64(getB64Uri()), mimeType);
- case 'base64':
- return b64UriToB64(getB64Uri());
- case 'base64uri':
- default:
- return getB64Uri();
- }
+
+module.exports = baseIsEqualDeep;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIsMap.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseIsMap.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+
+/** `Object#toString` result references. */
+var mapTag = '[object Map]';
+
+/**
+ * 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;
}
-CRp$2.png = function (options) {
- return output(options, this.bufferCanvasImage(options), 'image/png');
-};
-CRp$2.jpg = function (options) {
- return output(options, this.bufferCanvasImage(options), 'image/jpeg');
-};
-var CRp$1 = {};
-CRp$1.nodeShapeImpl = function (name, context, centerX, centerY, width, height, points) {
- switch (name) {
- case 'ellipse':
- return this.drawEllipsePath(context, centerX, centerY, width, height);
- case 'polygon':
- return this.drawPolygonPath(context, centerX, centerY, width, height, points);
- case 'round-polygon':
- return this.drawRoundPolygonPath(context, centerX, centerY, width, height, points);
- case 'roundrectangle':
- case 'round-rectangle':
- return this.drawRoundRectanglePath(context, centerX, centerY, width, height);
- case 'cutrectangle':
- case 'cut-rectangle':
- return this.drawCutRectanglePath(context, centerX, centerY, width, height);
- case 'bottomroundrectangle':
- case 'bottom-round-rectangle':
- return this.drawBottomRoundRectanglePath(context, centerX, centerY, width, height);
- case 'barrel':
- return this.drawBarrelPath(context, centerX, centerY, width, height);
- }
-};
+module.exports = baseIsMap;
-var CR = CanvasRenderer;
-var CRp = CanvasRenderer.prototype;
-CRp.CANVAS_LAYERS = 3;
-//
-CRp.SELECT_BOX = 0;
-CRp.DRAG = 1;
-CRp.NODE = 2;
-CRp.BUFFER_COUNT = 3;
-//
-CRp.TEXTURE_BUFFER = 0;
-CRp.MOTIONBLUR_BUFFER_NODE = 1;
-CRp.MOTIONBLUR_BUFFER_DRAG = 2;
-function CanvasRenderer(options) {
- var r = this;
- r.data = {
- canvases: new Array(CRp.CANVAS_LAYERS),
- contexts: new Array(CRp.CANVAS_LAYERS),
- canvasNeedsRedraw: new Array(CRp.CANVAS_LAYERS),
- bufferCanvases: new Array(CRp.BUFFER_COUNT),
- bufferContexts: new Array(CRp.CANVAS_LAYERS)
- };
- var tapHlOffAttr = '-webkit-tap-highlight-color';
- var tapHlOffStyle = 'rgba(0,0,0,0)';
- r.data.canvasContainer = document.createElement('div'); // eslint-disable-line no-undef
- var containerStyle = r.data.canvasContainer.style;
- r.data.canvasContainer.style[tapHlOffAttr] = tapHlOffStyle;
- containerStyle.position = 'relative';
- containerStyle.zIndex = '0';
- containerStyle.overflow = 'hidden';
- var container = options.cy.container();
- container.appendChild(r.data.canvasContainer);
- container.style[tapHlOffAttr] = tapHlOffStyle;
- var styleMap = {
- '-webkit-user-select': 'none',
- '-moz-user-select': '-moz-none',
- 'user-select': 'none',
- '-webkit-tap-highlight-color': 'rgba(0,0,0,0)',
- 'outline-style': 'none'
- };
- if (ms()) {
- styleMap['-ms-touch-action'] = 'none';
- styleMap['touch-action'] = 'none';
- }
- for (var i = 0; i < CRp.CANVAS_LAYERS; i++) {
- var canvas = r.data.canvases[i] = document.createElement('canvas'); // eslint-disable-line no-undef
- r.data.contexts[i] = canvas.getContext('2d');
- Object.keys(styleMap).forEach(function (k) {
- canvas.style[k] = styleMap[k];
- });
- canvas.style.position = 'absolute';
- canvas.setAttribute('data-id', 'layer' + i);
- canvas.style.zIndex = String(CRp.CANVAS_LAYERS - i);
- r.data.canvasContainer.appendChild(canvas);
- r.data.canvasNeedsRedraw[i] = false;
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIsMatch.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseIsMatch.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
+ baseIsEqual = __webpack_require__(/*! ./_baseIsEqual */ "./node_modules/lodash/_baseIsEqual.js");
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1,
+ COMPARE_UNORDERED_FLAG = 2;
+
+/**
+ * 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;
}
- r.data.topCanvas = r.data.canvases[0];
- r.data.canvases[CRp.NODE].setAttribute('data-id', 'layer' + CRp.NODE + '-node');
- r.data.canvases[CRp.SELECT_BOX].setAttribute('data-id', 'layer' + CRp.SELECT_BOX + '-selectbox');
- r.data.canvases[CRp.DRAG].setAttribute('data-id', 'layer' + CRp.DRAG + '-drag');
- for (var i = 0; i < CRp.BUFFER_COUNT; i++) {
- r.data.bufferCanvases[i] = document.createElement('canvas'); // eslint-disable-line no-undef
- r.data.bufferContexts[i] = r.data.bufferCanvases[i].getContext('2d');
- r.data.bufferCanvases[i].style.position = 'absolute';
- r.data.bufferCanvases[i].setAttribute('data-id', 'buffer' + i);
- r.data.bufferCanvases[i].style.zIndex = String(-i - 1);
- r.data.bufferCanvases[i].style.visibility = 'hidden';
- //r.data.canvasContainer.appendChild(r.data.bufferCanvases[i]);
+ 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];
- r.pathsEnabled = true;
- var emptyBb = makeBoundingBox();
- var getBoxCenter = function getBoxCenter(bb) {
- return {
- x: (bb.x1 + bb.x2) / 2,
- y: (bb.y1 + bb.y2) / 2
- };
- };
- var getCenterOffset = function getCenterOffset(bb) {
- return {
- x: -bb.w / 2,
- y: -bb.h / 2
- };
- };
- var backgroundTimestampHasChanged = function backgroundTimestampHasChanged(ele) {
- var _p = ele[0]._private;
- var same = _p.oldBackgroundTimestamp === _p.backgroundTimestamp;
- return !same;
- };
- var getStyleKey = function getStyleKey(ele) {
- return ele[0]._private.nodeKey;
- };
- var getLabelKey = function getLabelKey(ele) {
- return ele[0]._private.labelStyleKey;
- };
- var getSourceLabelKey = function getSourceLabelKey(ele) {
- return ele[0]._private.sourceLabelStyleKey;
- };
- var getTargetLabelKey = function getTargetLabelKey(ele) {
- return ele[0]._private.targetLabelStyleKey;
- };
- var drawElement = function drawElement(context, ele, bb, scaledLabelShown, useEleOpacity) {
- return r.drawElement(context, ele, bb, false, false, useEleOpacity);
- };
- var drawLabel = function drawLabel(context, ele, bb, scaledLabelShown, useEleOpacity) {
- return r.drawElementText(context, ele, bb, scaledLabelShown, 'main', useEleOpacity);
- };
- var drawSourceLabel = function drawSourceLabel(context, ele, bb, scaledLabelShown, useEleOpacity) {
- return r.drawElementText(context, ele, bb, scaledLabelShown, 'source', useEleOpacity);
- };
- var drawTargetLabel = function drawTargetLabel(context, ele, bb, scaledLabelShown, useEleOpacity) {
- return r.drawElementText(context, ele, bb, scaledLabelShown, 'target', useEleOpacity);
- };
- var getElementBox = function getElementBox(ele) {
- ele.boundingBox();
- return ele[0]._private.bodyBounds;
- };
- var getLabelBox = function getLabelBox(ele) {
- ele.boundingBox();
- return ele[0]._private.labelBounds.main || emptyBb;
- };
- var getSourceLabelBox = function getSourceLabelBox(ele) {
- ele.boundingBox();
- return ele[0]._private.labelBounds.source || emptyBb;
- };
- var getTargetLabelBox = function getTargetLabelBox(ele) {
- ele.boundingBox();
- return ele[0]._private.labelBounds.target || emptyBb;
- };
- var isLabelVisibleAtScale = function isLabelVisibleAtScale(ele, scaledLabelShown) {
- return scaledLabelShown;
- };
- var getElementRotationPoint = function getElementRotationPoint(ele) {
- return getBoxCenter(getElementBox(ele));
- };
- var addTextMargin = function addTextMargin(prefix, pt, ele) {
- var pre = prefix ? prefix + '-' : '';
- return {
- x: pt.x + ele.pstyle(pre + 'text-margin-x').pfValue,
- y: pt.y + ele.pstyle(pre + 'text-margin-y').pfValue
- };
- };
- var getRsPt = function getRsPt(ele, x, y) {
- var rs = ele[0]._private.rscratch;
- return {
- x: rs[x],
- y: rs[y]
- };
- };
- var getLabelRotationPoint = function getLabelRotationPoint(ele) {
- return addTextMargin('', getRsPt(ele, 'labelX', 'labelY'), ele);
- };
- var getSourceLabelRotationPoint = function getSourceLabelRotationPoint(ele) {
- return addTextMargin('source', getRsPt(ele, 'sourceLabelX', 'sourceLabelY'), ele);
- };
- var getTargetLabelRotationPoint = function getTargetLabelRotationPoint(ele) {
- return addTextMargin('target', getRsPt(ele, 'targetLabelX', 'targetLabelY'), ele);
- };
- var getElementRotationOffset = function getElementRotationOffset(ele) {
- return getCenterOffset(getElementBox(ele));
- };
- var getSourceLabelRotationOffset = function getSourceLabelRotationOffset(ele) {
- return getCenterOffset(getSourceLabelBox(ele));
- };
- var getTargetLabelRotationOffset = function getTargetLabelRotationOffset(ele) {
- return getCenterOffset(getTargetLabelBox(ele));
- };
- var getLabelRotationOffset = function getLabelRotationOffset(ele) {
- var bb = getLabelBox(ele);
- var p = getCenterOffset(getLabelBox(ele));
- if (ele.isNode()) {
- switch (ele.pstyle('text-halign').value) {
- case 'left':
- p.x = -bb.w;
- break;
- case 'right':
- p.x = 0;
- break;
+ if (noCustomizer && data[2]) {
+ if (objValue === undefined && !(key in object)) {
+ return false;
}
- switch (ele.pstyle('text-valign').value) {
- case 'top':
- p.y = -bb.h;
- break;
- case 'bottom':
- p.y = 0;
- break;
+ } 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 p;
- };
- var eleTxrCache = r.data.eleTxrCache = new ElementTextureCache(r, {
- getKey: getStyleKey,
- doesEleInvalidateKey: backgroundTimestampHasChanged,
- drawElement: drawElement,
- getBoundingBox: getElementBox,
- getRotationPoint: getElementRotationPoint,
- getRotationOffset: getElementRotationOffset,
- allowEdgeTxrCaching: false,
- allowParentTxrCaching: false
- });
- var lblTxrCache = r.data.lblTxrCache = new ElementTextureCache(r, {
- getKey: getLabelKey,
- drawElement: drawLabel,
- getBoundingBox: getLabelBox,
- getRotationPoint: getLabelRotationPoint,
- getRotationOffset: getLabelRotationOffset,
- isVisible: isLabelVisibleAtScale
- });
- var slbTxrCache = r.data.slbTxrCache = new ElementTextureCache(r, {
- getKey: getSourceLabelKey,
- drawElement: drawSourceLabel,
- getBoundingBox: getSourceLabelBox,
- getRotationPoint: getSourceLabelRotationPoint,
- getRotationOffset: getSourceLabelRotationOffset,
- isVisible: isLabelVisibleAtScale
- });
- var tlbTxrCache = r.data.tlbTxrCache = new ElementTextureCache(r, {
- getKey: getTargetLabelKey,
- drawElement: drawTargetLabel,
- getBoundingBox: getTargetLabelBox,
- getRotationPoint: getTargetLabelRotationPoint,
- getRotationOffset: getTargetLabelRotationOffset,
- isVisible: isLabelVisibleAtScale
- });
- var lyrTxrCache = r.data.lyrTxrCache = new LayeredTextureCache(r);
- r.onUpdateEleCalcs(function invalidateTextureCaches(willDraw, eles) {
- // each cache should check for sub-key diff to see that the update affects that cache particularly
- eleTxrCache.invalidateElements(eles);
- lblTxrCache.invalidateElements(eles);
- slbTxrCache.invalidateElements(eles);
- tlbTxrCache.invalidateElements(eles);
+ }
+ return true;
+}
- // any change invalidates the layers
- lyrTxrCache.invalidateElements(eles);
+module.exports = baseIsMatch;
- // update the old bg timestamp so diffs can be done in the ele txr caches
- for (var _i = 0; _i < eles.length; _i++) {
- var _p = eles[_i]._private;
- _p.oldBackgroundTimestamp = _p.backgroundTimestamp;
- }
- });
- var refineInLayers = function refineInLayers(reqs) {
- for (var i = 0; i < reqs.length; i++) {
- lyrTxrCache.enqueueElementRefinement(reqs[i].ele);
- }
- };
- eleTxrCache.onDequeue(refineInLayers);
- lblTxrCache.onDequeue(refineInLayers);
- slbTxrCache.onDequeue(refineInLayers);
- tlbTxrCache.onDequeue(refineInLayers);
-}
-CRp.redrawHint = function (group, bool) {
- var r = this;
- switch (group) {
- case 'eles':
- r.data.canvasNeedsRedraw[CRp.NODE] = bool;
- break;
- case 'drag':
- r.data.canvasNeedsRedraw[CRp.DRAG] = bool;
- break;
- case 'select':
- r.data.canvasNeedsRedraw[CRp.SELECT_BOX] = bool;
- break;
- }
-};
-// whether to use Path2D caching for drawing
-var pathsImpld = typeof Path2D !== 'undefined';
-CRp.path2dEnabled = function (on) {
- if (on === undefined) {
- return this.pathsEnabled;
- }
- this.pathsEnabled = on ? true : false;
-};
-CRp.usePaths = function () {
- return pathsImpld && this.pathsEnabled;
-};
-CRp.setImgSmoothing = function (context, bool) {
- if (context.imageSmoothingEnabled != null) {
- context.imageSmoothingEnabled = bool;
- } else {
- context.webkitImageSmoothingEnabled = bool;
- context.mozImageSmoothingEnabled = bool;
- context.msImageSmoothingEnabled = bool;
- }
-};
-CRp.getImgSmoothing = function (context) {
- if (context.imageSmoothingEnabled != null) {
- return context.imageSmoothingEnabled;
- } else {
- return context.webkitImageSmoothingEnabled || context.mozImageSmoothingEnabled || context.msImageSmoothingEnabled;
- }
-};
-CRp.makeOffscreenCanvas = function (width, height) {
- var canvas;
- if ((typeof OffscreenCanvas === "undefined" ? "undefined" : _typeof(OffscreenCanvas)) !== ("undefined" )) {
- canvas = new OffscreenCanvas(width, height);
- } else {
- canvas = document.createElement('canvas'); // eslint-disable-line no-undef
- canvas.width = width;
- canvas.height = height;
- }
- return canvas;
-};
-[CRp$a, CRp$9, CRp$8, CRp$7, CRp$6, CRp$5, CRp$4, CRp$3, CRp$2, CRp$1].forEach(function (props) {
- extend(CRp, props);
-});
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIsNaN.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseIsNaN.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
+}
-var renderer = [{
- name: 'null',
- impl: NullRenderer
-}, {
- name: 'base',
- impl: BR
-}, {
- name: 'canvas',
- impl: CR
-}];
+module.exports = baseIsNaN;
-var incExts = [{
- type: 'layout',
- extensions: layout
-}, {
- type: 'renderer',
- extensions: renderer
-}];
-// registered extensions to cytoscape, indexed by name
-var extensions = {};
+/***/ }),
-// registered modules for extensions, indexed by name
-var modules = {};
-function setExtension(type, name, registrant) {
- var ext = registrant;
- var overrideErr = function overrideErr(field) {
- warn('Can not register `' + name + '` for `' + type + '` since `' + field + '` already exists in the prototype and can not be overridden');
- };
- if (type === 'core') {
- if (Core.prototype[name]) {
- return overrideErr(name);
- } else {
- Core.prototype[name] = registrant;
- }
- } else if (type === 'collection') {
- if (Collection.prototype[name]) {
- return overrideErr(name);
- } else {
- Collection.prototype[name] = registrant;
- }
- } else if (type === 'layout') {
- // fill in missing layout functions in the prototype
+/***/ "./node_modules/lodash/_baseIsNative.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseIsNative.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var Layout = function Layout(options) {
- this.options = options;
- registrant.call(this, options);
+var isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
+ isMasked = __webpack_require__(/*! ./_isMasked */ "./node_modules/lodash/_isMasked.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ toSource = __webpack_require__(/*! ./_toSource */ "./node_modules/lodash/_toSource.js");
- // make sure layout has _private for use w/ std apis like .on()
- if (!plainObject(this._private)) {
- this._private = {};
- }
- this._private.cy = options.cy;
- this._private.listeners = [];
- this.createEmitter();
- };
- var layoutProto = Layout.prototype = Object.create(registrant.prototype);
- var optLayoutFns = [];
- for (var i = 0; i < optLayoutFns.length; i++) {
- var fnName = optLayoutFns[i];
- layoutProto[fnName] = layoutProto[fnName] || function () {
- return this;
- };
- }
+/**
+ * Used to match `RegExp`
+ * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+ */
+var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
- // either .start() or .run() is defined, so autogen the other
- if (layoutProto.start && !layoutProto.run) {
- layoutProto.run = function () {
- this.start();
- return this;
- };
- } else if (!layoutProto.start && layoutProto.run) {
- layoutProto.start = function () {
- this.run();
- return this;
- };
- }
- var regStop = registrant.prototype.stop;
- layoutProto.stop = function () {
- var opts = this.options;
- if (opts && opts.animate) {
- var anis = this.animations;
- if (anis) {
- for (var _i = 0; _i < anis.length; _i++) {
- anis[_i].stop();
- }
- }
- }
- if (regStop) {
- regStop.call(this);
- } else {
- this.emit('layoutstop');
- }
- return this;
- };
- if (!layoutProto.destroy) {
- layoutProto.destroy = function () {
- return this;
- };
- }
- layoutProto.cy = function () {
- return this._private.cy;
- };
- var getCy = function getCy(layout) {
- return layout._private.cy;
- };
- var emitterOpts = {
- addEventFields: function addEventFields(layout, evt) {
- evt.layout = layout;
- evt.cy = getCy(layout);
- evt.target = layout;
- },
- bubble: function bubble() {
- return true;
- },
- parent: function parent(layout) {
- return getCy(layout);
- }
- };
- extend(layoutProto, {
- createEmitter: function createEmitter() {
- this._private.emitter = new Emitter(emitterOpts, this);
- return this;
- },
- emitter: function emitter() {
- return this._private.emitter;
- },
- on: function on(evt, cb) {
- this.emitter().on(evt, cb);
- return this;
- },
- one: function one(evt, cb) {
- this.emitter().one(evt, cb);
- return this;
- },
- once: function once(evt, cb) {
- this.emitter().one(evt, cb);
- return this;
- },
- removeListener: function removeListener(evt, cb) {
- this.emitter().removeListener(evt, cb);
- return this;
- },
- removeAllListeners: function removeAllListeners() {
- this.emitter().removeAllListeners();
- return this;
- },
- emit: function emit(evt, params) {
- this.emitter().emit(evt, params);
- return this;
- }
- });
- define.eventAliasesOn(layoutProto);
- ext = Layout; // replace with our wrapped layout
- } else if (type === 'renderer' && name !== 'null' && name !== 'base') {
- // user registered renderers inherit from base
+/** Used to detect host constructors (Safari). */
+var reIsHostCtor = /^\[object .+?Constructor\]$/;
- var BaseRenderer = getExtension('renderer', 'base');
- var bProto = BaseRenderer.prototype;
- var RegistrantRenderer = registrant;
- var rProto = registrant.prototype;
- var Renderer = function Renderer() {
- BaseRenderer.apply(this, arguments);
- RegistrantRenderer.apply(this, arguments);
- };
- var proto = Renderer.prototype;
- for (var pName in bProto) {
- var pVal = bProto[pName];
- var existsInR = rProto[pName] != null;
- if (existsInR) {
- return overrideErr(pName);
- }
- proto[pName] = pVal; // take impl from base
- }
+/** Used for built-in method references. */
+var funcProto = Function.prototype,
+ objectProto = Object.prototype;
- for (var _pName in rProto) {
- proto[_pName] = rProto[_pName]; // take impl from registrant
- }
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
- bProto.clientFunctions.forEach(function (name) {
- proto[name] = proto[name] || function () {
- error('Renderer does not implement `renderer.' + name + '()` on its prototype');
- };
- });
- ext = Renderer;
- } else if (type === '__proto__' || type === 'constructor' || type === 'prototype') {
- // to avoid potential prototype pollution
- return error(type + ' is an illegal type to be registered, possibly lead to prototype pollutions');
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/** Used to detect if a method is native. */
+var reIsNative = RegExp('^' +
+ funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
+ .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+);
+
+/**
+ * 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;
}
- return setMap({
- map: extensions,
- keys: [type, name],
- value: ext
- });
-}
-function getExtension(type, name) {
- return getMap({
- map: extensions,
- keys: [type, name]
- });
-}
-function setModule(type, name, moduleType, moduleName, registrant) {
- return setMap({
- map: modules,
- keys: [type, name, moduleType, moduleName],
- value: registrant
- });
+ var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
+ return pattern.test(toSource(value));
}
-function getModule(type, name, moduleType, moduleName) {
- return getMap({
- map: modules,
- keys: [type, name, moduleType, moduleName]
- });
+
+module.exports = baseIsNative;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseIsSet.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseIsSet.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+
+/** `Object#toString` result references. */
+var setTag = '[object Set]';
+
+/**
+ * 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;
}
-var extension = function extension() {
- // e.g. extension('renderer', 'svg')
- if (arguments.length === 2) {
- return getExtension.apply(null, arguments);
- }
- // e.g. extension('renderer', 'svg', { ... })
- else if (arguments.length === 3) {
- return setExtension.apply(null, arguments);
- }
+module.exports = baseIsSet;
- // e.g. extension('renderer', 'svg', 'nodeShape', 'ellipse')
- else if (arguments.length === 4) {
- return getModule.apply(null, arguments);
- }
- // e.g. extension('renderer', 'svg', 'nodeShape', 'ellipse', { ... })
- else if (arguments.length === 5) {
- return setModule.apply(null, arguments);
- } else {
- error('Invalid extension access syntax');
- }
-};
+/***/ }),
-// allows a core instance to access extensions internally
-Core.prototype.extension = extension;
+/***/ "./node_modules/lodash/_baseIsTypedArray.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/_baseIsTypedArray.js ***!
+ \**************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-// included extensions
-incExts.forEach(function (group) {
- group.extensions.forEach(function (ext) {
- setExtension(group.type, ext.name, ext.impl);
- });
-});
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
-// a dummy stylesheet object that doesn't need a reference to the core
-// (useful for init)
-var Stylesheet = function Stylesheet() {
- if (!(this instanceof Stylesheet)) {
- return new Stylesheet();
- }
- this.length = 0;
-};
-var sheetfn = Stylesheet.prototype;
-sheetfn.instanceString = function () {
- return 'stylesheet';
-};
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]',
+ arrayTag = '[object Array]',
+ boolTag = '[object Boolean]',
+ dateTag = '[object Date]',
+ errorTag = '[object Error]',
+ funcTag = '[object Function]',
+ mapTag = '[object Map]',
+ numberTag = '[object Number]',
+ objectTag = '[object Object]',
+ regexpTag = '[object RegExp]',
+ setTag = '[object Set]',
+ stringTag = '[object String]',
+ weakMapTag = '[object WeakMap]';
-// just store the selector to be parsed later
-sheetfn.selector = function (selector) {
- var i = this.length++;
- this[i] = {
- selector: selector,
- properties: []
- };
- return this; // chaining
-};
+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]';
-// just store the property to be parsed later
-sheetfn.css = function (name, value) {
- var i = this.length - 1;
- if (string(name)) {
- this[i].properties.push({
- name: name,
- value: value
- });
- } else if (plainObject(name)) {
- var map = name;
- var propNames = Object.keys(map);
- for (var j = 0; j < propNames.length; j++) {
- var key = propNames[j];
- var mapVal = map[key];
- if (mapVal == null) {
- continue;
- }
- var prop = Style.properties[key] || Style.properties[dash2camel(key)];
- if (prop == null) {
- continue;
- }
- var _name = prop.name;
- var _value = mapVal;
- this[i].properties.push({
- name: _name,
- value: _value
- });
- }
- }
- return this; // chaining
-};
+/** 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;
-sheetfn.style = sheetfn.css;
+/**
+ * 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)];
+}
-// generate a real style object from the dummy stylesheet
-sheetfn.generateStyle = function (cy) {
- var style = new Style(cy);
- return this.appendToStyle(style);
-};
+module.exports = baseIsTypedArray;
-// append a dummy stylesheet object on a real style object
-sheetfn.appendToStyle = function (style) {
- for (var i = 0; i < this.length; i++) {
- var context = this[i];
- var selector = context.selector;
- var props = context.properties;
- style.selector(selector); // apply selector
- for (var j = 0; j < props.length; j++) {
- var prop = props[j];
- style.css(prop.name, prop.value); // apply property
- }
- }
+/***/ }),
- return style;
-};
+/***/ "./node_modules/lodash/_baseIteratee.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseIteratee.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var version = "3.27.0";
+var baseMatches = __webpack_require__(/*! ./_baseMatches */ "./node_modules/lodash/_baseMatches.js"),
+ baseMatchesProperty = __webpack_require__(/*! ./_baseMatchesProperty */ "./node_modules/lodash/_baseMatchesProperty.js"),
+ identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ property = __webpack_require__(/*! ./property */ "./node_modules/lodash/property.js");
-var cytoscape = function cytoscape(options) {
- // if no options specified, use default
- if (options === undefined) {
- options = {};
+/**
+ * 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;
}
-
- // create instance
- if (plainObject(options)) {
- return new Core(options);
+ if (value == null) {
+ return identity;
}
-
- // allow for registration of extensions
- else if (string(options)) {
- return extension.apply(extension, arguments);
+ if (typeof value == 'object') {
+ return isArray(value)
+ ? baseMatchesProperty(value[0], value[1])
+ : baseMatches(value);
}
-};
+ return property(value);
+}
-// e.g. cytoscape.use( require('cytoscape-foo'), bar )
-cytoscape.use = function (ext) {
- var args = Array.prototype.slice.call(arguments, 1); // args to pass to ext
+module.exports = baseIteratee;
- args.unshift(cytoscape); // cytoscape is first arg to ext
- ext.apply(null, args);
- return this;
-};
-cytoscape.warnings = function (bool) {
- return warnings(bool);
-};
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseKeys.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_baseKeys.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
+ nativeKeys = __webpack_require__(/*! ./_nativeKeys */ "./node_modules/lodash/_nativeKeys.js");
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
-// replaced by build system
-cytoscape.version = version;
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
-// expose public apis (mostly for extensions)
-cytoscape.stylesheet = cytoscape.Stylesheet = Stylesheet;
+/**
+ * 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;
+}
-module.exports = cytoscape;
+module.exports = baseKeys;
/***/ }),
-/***/ "./node_modules/dagre/index.js":
-/*!*************************************!*\
- !*** ./node_modules/dagre/index.js ***!
- \*************************************/
+/***/ "./node_modules/lodash/_baseKeysIn.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseKeysIn.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/*
-Copyright (c) 2012-2014 Chris Pettitt
+var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
+ nativeKeysIn = __webpack_require__(/*! ./_nativeKeysIn */ "./node_modules/lodash/_nativeKeysIn.js");
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-*/
+/**
+ * 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 = [];
-module.exports = {
- graphlib: __webpack_require__(/*! ./lib/graphlib */ "./node_modules/dagre/lib/graphlib.js"),
+ for (var key in object) {
+ if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+ result.push(key);
+ }
+ }
+ return result;
+}
- layout: __webpack_require__(/*! ./lib/layout */ "./node_modules/dagre/lib/layout.js"),
- debug: __webpack_require__(/*! ./lib/debug */ "./node_modules/dagre/lib/debug.js"),
- util: {
- time: (__webpack_require__(/*! ./lib/util */ "./node_modules/dagre/lib/util.js").time),
- notime: (__webpack_require__(/*! ./lib/util */ "./node_modules/dagre/lib/util.js").notime)
- },
- version: __webpack_require__(/*! ./lib/version */ "./node_modules/dagre/lib/version.js")
-};
+module.exports = baseKeysIn;
/***/ }),
-/***/ "./node_modules/dagre/lib/acyclic.js":
-/*!*******************************************!*\
- !*** ./node_modules/dagre/lib/acyclic.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-"use strict";
-
-
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var greedyFAS = __webpack_require__(/*! ./greedy-fas */ "./node_modules/dagre/lib/greedy-fas.js");
+/***/ "./node_modules/lodash/_baseLt.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/_baseLt.js ***!
+ \****************************************/
+/***/ (function(module) {
-module.exports = {
- run: run,
- undo: undo
-};
+/**
+ * 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;
+}
-function run(g) {
- var fas = (g.graph().acyclicer === "greedy"
- ? greedyFAS(g, weightFn(g))
- : dfsFAS(g));
- _.forEach(fas, function(e) {
- var label = g.edge(e);
- g.removeEdge(e);
- label.forwardName = e.name;
- label.reversed = true;
- g.setEdge(e.w, e.v, label, _.uniqueId("rev"));
- });
+module.exports = baseLt;
- function weightFn(g) {
- return function(e) {
- return g.edge(e).weight;
- };
- }
-}
-function dfsFAS(g) {
- var fas = [];
- var stack = {};
- var visited = {};
+/***/ }),
- function dfs(v) {
- if (_.has(visited, v)) {
- return;
- }
- visited[v] = true;
- stack[v] = true;
- _.forEach(g.outEdges(v), function(e) {
- if (_.has(stack, e.w)) {
- fas.push(e);
- } else {
- dfs(e.w);
- }
- });
- delete stack[v];
- }
+/***/ "./node_modules/lodash/_baseMap.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_baseMap.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- _.forEach(g.nodes(), dfs);
- return fas;
-}
+var baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
-function undo(g) {
- _.forEach(g.edges(), function(e) {
- var label = g.edge(e);
- if (label.reversed) {
- g.removeEdge(e);
+/**
+ * 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) : [];
- var forwardName = label.forwardName;
- delete label.reversed;
- delete label.forwardName;
- g.setEdge(e.w, e.v, label, forwardName);
- }
+ baseEach(collection, function(value, key, collection) {
+ result[++index] = iteratee(value, key, collection);
});
+ return result;
}
+module.exports = baseMap;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/add-border-segments.js":
-/*!*******************************************************!*\
- !*** ./node_modules/dagre/lib/add-border-segments.js ***!
- \*******************************************************/
+/***/ "./node_modules/lodash/_baseMatches.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseMatches.js ***!
+ \*********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
-
-module.exports = addBorderSegments;
-
-function addBorderSegments(g) {
- function dfs(v) {
- var children = g.children(v);
- var node = g.node(v);
- if (children.length) {
- _.forEach(children, dfs);
- }
+var baseIsMatch = __webpack_require__(/*! ./_baseIsMatch */ "./node_modules/lodash/_baseIsMatch.js"),
+ getMatchData = __webpack_require__(/*! ./_getMatchData */ "./node_modules/lodash/_getMatchData.js"),
+ matchesStrictComparable = __webpack_require__(/*! ./_matchesStrictComparable */ "./node_modules/lodash/_matchesStrictComparable.js");
- if (_.has(node, "minRank")) {
- node.borderLeft = [];
- node.borderRight = [];
- for (var rank = node.minRank, maxRank = node.maxRank + 1;
- rank < maxRank;
- ++rank) {
- addBorderNode(g, "borderLeft", "_bl", v, node, rank);
- addBorderNode(g, "borderRight", "_br", v, node, rank);
- }
- }
+/**
+ * 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]);
}
-
- _.forEach(g.children(), dfs);
+ return function(object) {
+ return object === source || baseIsMatch(object, source, matchData);
+ };
}
-function addBorderNode(g, prop, prefix, sg, sgNode, rank) {
- var label = { width: 0, height: 0, rank: rank, borderType: prop };
- var prev = sgNode[prop][rank - 1];
- var curr = util.addDummyNode(g, "border", label, prefix);
- sgNode[prop][rank] = curr;
- g.setParent(curr, sg);
- if (prev) {
- g.setEdge(prev, curr, { weight: 1 });
- }
-}
+module.exports = baseMatches;
/***/ }),
-/***/ "./node_modules/dagre/lib/coordinate-system.js":
+/***/ "./node_modules/lodash/_baseMatchesProperty.js":
/*!*****************************************************!*\
- !*** ./node_modules/dagre/lib/coordinate-system.js ***!
+ !*** ./node_modules/lodash/_baseMatchesProperty.js ***!
\*****************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var baseIsEqual = __webpack_require__(/*! ./_baseIsEqual */ "./node_modules/lodash/_baseIsEqual.js"),
+ get = __webpack_require__(/*! ./get */ "./node_modules/lodash/get.js"),
+ hasIn = __webpack_require__(/*! ./hasIn */ "./node_modules/lodash/hasIn.js"),
+ isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
+ isStrictComparable = __webpack_require__(/*! ./_isStrictComparable */ "./node_modules/lodash/_isStrictComparable.js"),
+ matchesStrictComparable = __webpack_require__(/*! ./_matchesStrictComparable */ "./node_modules/lodash/_matchesStrictComparable.js"),
+ toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
-module.exports = {
- adjust: adjust,
- undo: undo
-};
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1,
+ COMPARE_UNORDERED_FLAG = 2;
-function adjust(g) {
- var rankDir = g.graph().rankdir.toLowerCase();
- if (rankDir === "lr" || rankDir === "rl") {
- swapWidthHeight(g);
+/**
+ * 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);
+ };
}
-function undo(g) {
- var rankDir = g.graph().rankdir.toLowerCase();
- if (rankDir === "bt" || rankDir === "rl") {
- reverseY(g);
- }
+module.exports = baseMatchesProperty;
- if (rankDir === "lr" || rankDir === "rl") {
- swapXY(g);
- swapWidthHeight(g);
- }
-}
-function swapWidthHeight(g) {
- _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });
- _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });
-}
+/***/ }),
-function swapWidthHeightOne(attrs) {
- var w = attrs.width;
- attrs.width = attrs.height;
- attrs.height = w;
-}
+/***/ "./node_modules/lodash/_baseMerge.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseMerge.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function reverseY(g) {
- _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });
+var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
+ assignMergeValue = __webpack_require__(/*! ./_assignMergeValue */ "./node_modules/lodash/_assignMergeValue.js"),
+ baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
+ baseMergeDeep = __webpack_require__(/*! ./_baseMergeDeep */ "./node_modules/lodash/_baseMergeDeep.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js"),
+ safeGet = __webpack_require__(/*! ./_safeGet */ "./node_modules/lodash/_safeGet.js");
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- _.forEach(edge.points, reverseYOne);
- if (_.has(edge, "y")) {
- reverseYOne(edge);
+/**
+ * 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) {
+ stack || (stack = new Stack);
+ if (isObject(srcValue)) {
+ baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
}
- });
-}
-
-function reverseYOne(attrs) {
- attrs.y = -attrs.y;
-}
-
-function swapXY(g) {
- _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });
+ else {
+ var newValue = customizer
+ ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)
+ : undefined;
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- _.forEach(edge.points, swapXYOne);
- if (_.has(edge, "x")) {
- swapXYOne(edge);
+ if (newValue === undefined) {
+ newValue = srcValue;
+ }
+ assignMergeValue(object, key, newValue);
}
- });
+ }, keysIn);
}
-function swapXYOne(attrs) {
- var x = attrs.x;
- attrs.x = attrs.y;
- attrs.y = x;
-}
+module.exports = baseMerge;
/***/ }),
-/***/ "./node_modules/dagre/lib/data/list.js":
-/*!*********************************************!*\
- !*** ./node_modules/dagre/lib/data/list.js ***!
- \*********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/lodash/_baseMergeDeep.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_baseMergeDeep.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/*
- * Simple doubly linked list implementation derived from Cormen, et al.,
- * "Introduction to Algorithms".
+var assignMergeValue = __webpack_require__(/*! ./_assignMergeValue */ "./node_modules/lodash/_assignMergeValue.js"),
+ cloneBuffer = __webpack_require__(/*! ./_cloneBuffer */ "./node_modules/lodash/_cloneBuffer.js"),
+ cloneTypedArray = __webpack_require__(/*! ./_cloneTypedArray */ "./node_modules/lodash/_cloneTypedArray.js"),
+ copyArray = __webpack_require__(/*! ./_copyArray */ "./node_modules/lodash/_copyArray.js"),
+ initCloneObject = __webpack_require__(/*! ./_initCloneObject */ "./node_modules/lodash/_initCloneObject.js"),
+ isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isArrayLikeObject = __webpack_require__(/*! ./isArrayLikeObject */ "./node_modules/lodash/isArrayLikeObject.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ isPlainObject = __webpack_require__(/*! ./isPlainObject */ "./node_modules/lodash/isPlainObject.js"),
+ isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js"),
+ safeGet = __webpack_require__(/*! ./_safeGet */ "./node_modules/lodash/_safeGet.js"),
+ toPlainObject = __webpack_require__(/*! ./toPlainObject */ "./node_modules/lodash/toPlainObject.js");
+
+/**
+ * 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 = safeGet(object, key),
+ srcValue = safeGet(source, key),
+ stacked = stack.get(srcValue);
-module.exports = List;
+ if (stacked) {
+ assignMergeValue(object, key, stacked);
+ return;
+ }
+ var newValue = customizer
+ ? customizer(objValue, srcValue, (key + ''), object, source, stack)
+ : undefined;
-function List() {
- var sentinel = {};
- sentinel._next = sentinel._prev = sentinel;
- this._sentinel = sentinel;
-}
+ var isCommon = newValue === undefined;
-List.prototype.dequeue = function() {
- var sentinel = this._sentinel;
- var entry = sentinel._prev;
- if (entry !== sentinel) {
- unlink(entry);
- return entry;
- }
-};
+ if (isCommon) {
+ var isArr = isArray(srcValue),
+ isBuff = !isArr && isBuffer(srcValue),
+ isTyped = !isArr && !isBuff && isTypedArray(srcValue);
-List.prototype.enqueue = function(entry) {
- var sentinel = this._sentinel;
- if (entry._prev && entry._next) {
- unlink(entry);
+ 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) || isFunction(objValue)) {
+ newValue = initCloneObject(srcValue);
+ }
+ }
+ else {
+ isCommon = false;
+ }
}
- entry._next = sentinel._next;
- sentinel._next._prev = entry;
- sentinel._next = entry;
- entry._prev = sentinel;
-};
-
-List.prototype.toString = function() {
- var strs = [];
- var sentinel = this._sentinel;
- var curr = sentinel._prev;
- while (curr !== sentinel) {
- strs.push(JSON.stringify(curr, filterOutLinks));
- curr = curr._prev;
+ 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);
}
- return "[" + strs.join(", ") + "]";
-};
-
-function unlink(entry) {
- entry._prev._next = entry._next;
- entry._next._prev = entry._prev;
- delete entry._next;
- delete entry._prev;
+ assignMergeValue(object, key, newValue);
}
-function filterOutLinks(k, v) {
- if (k !== "_next" && k !== "_prev") {
- return v;
- }
-}
+module.exports = baseMergeDeep;
/***/ }),
-/***/ "./node_modules/dagre/lib/debug.js":
-/*!*****************************************!*\
- !*** ./node_modules/dagre/lib/debug.js ***!
- \*****************************************/
+/***/ "./node_modules/lodash/_baseOrderBy.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_baseOrderBy.js ***!
+ \*********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
-var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-
-module.exports = {
- debugOrdering: debugOrdering
-};
-
-/* istanbul ignore next */
-function debugOrdering(g) {
- var layerMatrix = util.buildLayerMatrix(g);
-
- var h = new Graph({ compound: true, multigraph: true }).setGraph({});
+var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
+ baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ baseMap = __webpack_require__(/*! ./_baseMap */ "./node_modules/lodash/_baseMap.js"),
+ baseSortBy = __webpack_require__(/*! ./_baseSortBy */ "./node_modules/lodash/_baseSortBy.js"),
+ baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
+ compareMultiple = __webpack_require__(/*! ./_compareMultiple */ "./node_modules/lodash/_compareMultiple.js"),
+ identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
- _.forEach(g.nodes(), function(v) {
- h.setNode(v, { label: v });
- h.setParent(v, "layer" + g.node(v).rank);
- });
+/**
+ * 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) {
+ if (iteratees.length) {
+ iteratees = arrayMap(iteratees, function(iteratee) {
+ if (isArray(iteratee)) {
+ return function(value) {
+ return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
+ }
+ }
+ return iteratee;
+ });
+ } else {
+ iteratees = [identity];
+ }
- _.forEach(g.edges(), function(e) {
- h.setEdge(e.v, e.w, {}, e.name);
- });
+ var index = -1;
+ iteratees = arrayMap(iteratees, baseUnary(baseIteratee));
- _.forEach(layerMatrix, function(layer, i) {
- var layerV = "layer" + i;
- h.setNode(layerV, { rank: "same" });
- _.reduce(layer, function(u, v) {
- h.setEdge(u, v, { style: "invis" });
- return v;
+ 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 h;
+ return baseSortBy(result, function(object, other) {
+ return compareMultiple(object, other, orders);
+ });
}
+module.exports = baseOrderBy;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/graphlib.js":
-/*!********************************************!*\
- !*** ./node_modules/dagre/lib/graphlib.js ***!
- \********************************************/
+/***/ "./node_modules/lodash/_basePick.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_basePick.js ***!
+ \******************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/* global window */
-
-var graphlib;
-
-if (true) {
- try {
- graphlib = __webpack_require__(/*! graphlib */ "./node_modules/graphlib/index.js");
- } catch (e) {
- // continue regardless of error
- }
-}
+var basePickBy = __webpack_require__(/*! ./_basePickBy */ "./node_modules/lodash/_basePickBy.js"),
+ hasIn = __webpack_require__(/*! ./hasIn */ "./node_modules/lodash/hasIn.js");
-if (!graphlib) {
- graphlib = window.graphlib;
+/**
+ * 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);
+ });
}
-module.exports = graphlib;
+module.exports = basePick;
/***/ }),
-/***/ "./node_modules/dagre/lib/greedy-fas.js":
-/*!**********************************************!*\
- !*** ./node_modules/dagre/lib/greedy-fas.js ***!
- \**********************************************/
+/***/ "./node_modules/lodash/_basePickBy.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_basePickBy.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-var List = __webpack_require__(/*! ./data/list */ "./node_modules/dagre/lib/data/list.js");
+var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js"),
+ baseSet = __webpack_require__(/*! ./_baseSet */ "./node_modules/lodash/_baseSet.js"),
+ castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js");
-/*
- * A greedy heuristic for finding a feedback arc set for a graph. A feedback
- * arc set is a set of edges that can be removed to make a graph acyclic.
- * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, "A fast and
- * effective heuristic for the feedback arc set problem." This implementation
- * adjusts that from the paper to allow for weighted edges.
+/**
+ * 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.
*/
-module.exports = greedyFAS;
-
-var DEFAULT_WEIGHT_FN = _.constant(1);
-
-function greedyFAS(g, weightFn) {
- if (g.nodeCount() <= 1) {
- return [];
- }
- var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);
- var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);
-
- // Expand multi-edges
- return _.flatten(_.map(results, function(e) {
- return g.outEdges(e.v, e.w);
- }), true);
-}
+function basePickBy(object, paths, predicate) {
+ var index = -1,
+ length = paths.length,
+ result = {};
-function doGreedyFAS(g, buckets, zeroIdx) {
- var results = [];
- var sources = buckets[buckets.length - 1];
- var sinks = buckets[0];
+ while (++index < length) {
+ var path = paths[index],
+ value = baseGet(object, path);
- var entry;
- while (g.nodeCount()) {
- while ((entry = sinks.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
- while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }
- if (g.nodeCount()) {
- for (var i = buckets.length - 2; i > 0; --i) {
- entry = buckets[i].dequeue();
- if (entry) {
- results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));
- break;
- }
- }
+ if (predicate(value, path)) {
+ baseSet(result, castPath(path, object), value);
}
}
-
- return results;
-}
-
-function removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {
- var results = collectPredecessors ? [] : undefined;
-
- _.forEach(g.inEdges(entry.v), function(edge) {
- var weight = g.edge(edge);
- var uEntry = g.node(edge.v);
-
- if (collectPredecessors) {
- results.push({ v: edge.v, w: edge.w });
- }
-
- uEntry.out -= weight;
- assignBucket(buckets, zeroIdx, uEntry);
- });
-
- _.forEach(g.outEdges(entry.v), function(edge) {
- var weight = g.edge(edge);
- var w = edge.w;
- var wEntry = g.node(w);
- wEntry["in"] -= weight;
- assignBucket(buckets, zeroIdx, wEntry);
- });
-
- g.removeNode(entry.v);
-
- return results;
+ return result;
}
-function buildState(g, weightFn) {
- var fasGraph = new Graph();
- var maxIn = 0;
- var maxOut = 0;
-
- _.forEach(g.nodes(), function(v) {
- fasGraph.setNode(v, { v: v, "in": 0, out: 0 });
- });
+module.exports = basePickBy;
- // Aggregate weights on nodes, but also sum the weights across multi-edges
- // into a single edge for the fasGraph.
- _.forEach(g.edges(), function(e) {
- var prevWeight = fasGraph.edge(e.v, e.w) || 0;
- var weight = weightFn(e);
- var edgeWeight = prevWeight + weight;
- fasGraph.setEdge(e.v, e.w, edgeWeight);
- maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);
- maxIn = Math.max(maxIn, fasGraph.node(e.w)["in"] += weight);
- });
- var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });
- var zeroIdx = maxIn + 1;
+/***/ }),
- _.forEach(fasGraph.nodes(), function(v) {
- assignBucket(buckets, zeroIdx, fasGraph.node(v));
- });
+/***/ "./node_modules/lodash/_baseProperty.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseProperty.js ***!
+ \**********************************************/
+/***/ (function(module) {
- return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };
+/**
+ * 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];
+ };
}
-function assignBucket(buckets, zeroIdx, entry) {
- if (!entry.out) {
- buckets[0].enqueue(entry);
- } else if (!entry["in"]) {
- buckets[buckets.length - 1].enqueue(entry);
- } else {
- buckets[entry.out - entry["in"] + zeroIdx].enqueue(entry);
- }
-}
+module.exports = baseProperty;
/***/ }),
-/***/ "./node_modules/dagre/lib/layout.js":
-/*!******************************************!*\
- !*** ./node_modules/dagre/lib/layout.js ***!
- \******************************************/
+/***/ "./node_modules/lodash/_basePropertyDeep.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/_basePropertyDeep.js ***!
+ \**************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var acyclic = __webpack_require__(/*! ./acyclic */ "./node_modules/dagre/lib/acyclic.js");
-var normalize = __webpack_require__(/*! ./normalize */ "./node_modules/dagre/lib/normalize.js");
-var rank = __webpack_require__(/*! ./rank */ "./node_modules/dagre/lib/rank/index.js");
-var normalizeRanks = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js").normalizeRanks);
-var parentDummyChains = __webpack_require__(/*! ./parent-dummy-chains */ "./node_modules/dagre/lib/parent-dummy-chains.js");
-var removeEmptyRanks = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js").removeEmptyRanks);
-var nestingGraph = __webpack_require__(/*! ./nesting-graph */ "./node_modules/dagre/lib/nesting-graph.js");
-var addBorderSegments = __webpack_require__(/*! ./add-border-segments */ "./node_modules/dagre/lib/add-border-segments.js");
-var coordinateSystem = __webpack_require__(/*! ./coordinate-system */ "./node_modules/dagre/lib/coordinate-system.js");
-var order = __webpack_require__(/*! ./order */ "./node_modules/dagre/lib/order/index.js");
-var position = __webpack_require__(/*! ./position */ "./node_modules/dagre/lib/position/index.js");
-var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
-var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-
-module.exports = layout;
+var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js");
-function layout(g, opts) {
- var time = opts && opts.debugTiming ? util.time : util.notime;
- time("layout", function() {
- var layoutGraph =
- time(" buildLayoutGraph", function() { return buildLayoutGraph(g); });
- time(" runLayout", function() { runLayout(layoutGraph, time); });
- time(" updateInputGraph", function() { updateInputGraph(g, layoutGraph); });
- });
+/**
+ * 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);
+ };
}
-function runLayout(g, time) {
- time(" makeSpaceForEdgeLabels", function() { makeSpaceForEdgeLabels(g); });
- time(" removeSelfEdges", function() { removeSelfEdges(g); });
- time(" acyclic", function() { acyclic.run(g); });
- time(" nestingGraph.run", function() { nestingGraph.run(g); });
- time(" rank", function() { rank(util.asNonCompoundGraph(g)); });
- time(" injectEdgeLabelProxies", function() { injectEdgeLabelProxies(g); });
- time(" removeEmptyRanks", function() { removeEmptyRanks(g); });
- time(" nestingGraph.cleanup", function() { nestingGraph.cleanup(g); });
- time(" normalizeRanks", function() { normalizeRanks(g); });
- time(" assignRankMinMax", function() { assignRankMinMax(g); });
- time(" removeEdgeLabelProxies", function() { removeEdgeLabelProxies(g); });
- time(" normalize.run", function() { normalize.run(g); });
- time(" parentDummyChains", function() { parentDummyChains(g); });
- time(" addBorderSegments", function() { addBorderSegments(g); });
- time(" order", function() { order(g); });
- time(" insertSelfEdges", function() { insertSelfEdges(g); });
- time(" adjustCoordinateSystem", function() { coordinateSystem.adjust(g); });
- time(" position", function() { position(g); });
- time(" positionSelfEdges", function() { positionSelfEdges(g); });
- time(" removeBorderNodes", function() { removeBorderNodes(g); });
- time(" normalize.undo", function() { normalize.undo(g); });
- time(" fixupEdgeLabelCoords", function() { fixupEdgeLabelCoords(g); });
- time(" undoCoordinateSystem", function() { coordinateSystem.undo(g); });
- time(" translateGraph", function() { translateGraph(g); });
- time(" assignNodeIntersects", function() { assignNodeIntersects(g); });
- time(" reversePoints", function() { reversePointsForReversedEdges(g); });
- time(" acyclic.undo", function() { acyclic.undo(g); });
-}
+module.exports = basePropertyDeep;
-/*
- * Copies final layout information from the layout graph back to the input
- * graph. This process only copies whitelisted attributes from the layout graph
- * to the input graph, so it serves as a good place to determine what
- * attributes can influence layout.
- */
-function updateInputGraph(inputGraph, layoutGraph) {
- _.forEach(inputGraph.nodes(), function(v) {
- var inputLabel = inputGraph.node(v);
- var layoutLabel = layoutGraph.node(v);
- if (inputLabel) {
- inputLabel.x = layoutLabel.x;
- inputLabel.y = layoutLabel.y;
+/***/ }),
- if (layoutGraph.children(v).length) {
- inputLabel.width = layoutLabel.width;
- inputLabel.height = layoutLabel.height;
- }
- }
- });
+/***/ "./node_modules/lodash/_baseRange.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseRange.js ***!
+ \*******************************************/
+/***/ (function(module) {
- _.forEach(inputGraph.edges(), function(e) {
- var inputLabel = inputGraph.edge(e);
- var layoutLabel = layoutGraph.edge(e);
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeCeil = Math.ceil,
+ nativeMax = Math.max;
- inputLabel.points = layoutLabel.points;
- if (_.has(layoutLabel, "x")) {
- inputLabel.x = layoutLabel.x;
- inputLabel.y = layoutLabel.y;
- }
- });
+/**
+ * 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);
- inputGraph.graph().width = layoutGraph.graph().width;
- inputGraph.graph().height = layoutGraph.graph().height;
+ while (length--) {
+ result[fromRight ? length : ++index] = start;
+ start += step;
+ }
+ return result;
}
-var graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
-var graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
-var graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
-var nodeNumAttrs = ["width", "height"];
-var nodeDefaults = { width: 0, height: 0 };
-var edgeNumAttrs = ["minlen", "weight", "width", "height", "labeloffset"];
-var edgeDefaults = {
- minlen: 1, weight: 1, width: 0, height: 0,
- labeloffset: 10, labelpos: "r"
-};
-var edgeAttrs = ["labelpos"];
-
-/*
- * Constructs a new graph from the input graph, which can be used for layout.
- * This process copies only whitelisted attributes from the input graph to the
- * layout graph. Thus this function serves as a good place to determine what
- * attributes can influence layout.
- */
-function buildLayoutGraph(inputGraph) {
- var g = new Graph({ multigraph: true, compound: true });
- var graph = canonicalize(inputGraph.graph());
-
- g.setGraph(_.merge({},
- graphDefaults,
- selectNumberAttrs(graph, graphNumAttrs),
- _.pick(graph, graphAttrs)));
+module.exports = baseRange;
- _.forEach(inputGraph.nodes(), function(v) {
- var node = canonicalize(inputGraph.node(v));
- g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));
- g.setParent(v, inputGraph.parent(v));
- });
- _.forEach(inputGraph.edges(), function(e) {
- var edge = canonicalize(inputGraph.edge(e));
- g.setEdge(e, _.merge({},
- edgeDefaults,
- selectNumberAttrs(edge, edgeNumAttrs),
- _.pick(edge, edgeAttrs)));
- });
+/***/ }),
- return g;
-}
+/***/ "./node_modules/lodash/_baseReduce.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseReduce.js ***!
+ \********************************************/
+/***/ (function(module) {
-/*
- * This idea comes from the Gansner paper: to account for edge labels in our
- * layout we split each rank in half by doubling minlen and halving ranksep.
- * Then we can place labels at these mid-points between nodes.
+/**
+ * The base implementation of `_.reduce` and `_.reduceRight`, without support
+ * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
*
- * We also add some minimal padding to the width to push the label for the edge
- * away from the edge itself a bit.
- */
-function makeSpaceForEdgeLabels(g) {
- var graph = g.graph();
- graph.ranksep /= 2;
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- edge.minlen *= 2;
- if (edge.labelpos.toLowerCase() !== "c") {
- if (graph.rankdir === "TB" || graph.rankdir === "BT") {
- edge.width += edge.labeloffset;
- } else {
- edge.height += edge.labeloffset;
- }
- }
- });
-}
-
-/*
- * Creates temporary dummy nodes that capture the rank in which each edge's
- * label is going to, if it has one of non-zero width and height. We do this
- * so that we can safely remove empty ranks while preserving balance for the
- * label's position.
- */
-function injectEdgeLabelProxies(g) {
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- if (edge.width && edge.height) {
- var v = g.node(e.v);
- var w = g.node(e.w);
- var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };
- util.addDummyNode(g, "edge-proxy", label, "_ep");
- }
+ * @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;
}
-function assignRankMinMax(g) {
- var maxRank = 0;
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- if (node.borderTop) {
- node.minRank = g.node(node.borderTop).rank;
- node.maxRank = g.node(node.borderBottom).rank;
- maxRank = _.max(maxRank, node.maxRank);
- }
- });
- g.graph().maxRank = maxRank;
-}
+module.exports = baseReduce;
-function removeEdgeLabelProxies(g) {
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- if (node.dummy === "edge-proxy") {
- g.edge(node.e).labelRank = node.rank;
- g.removeNode(v);
- }
- });
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseRest.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_baseRest.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
+ overRest = __webpack_require__(/*! ./_overRest */ "./node_modules/lodash/_overRest.js"),
+ setToString = __webpack_require__(/*! ./_setToString */ "./node_modules/lodash/_setToString.js");
+
+/**
+ * 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 + '');
}
-function translateGraph(g) {
- var minX = Number.POSITIVE_INFINITY;
- var maxX = 0;
- var minY = Number.POSITIVE_INFINITY;
- var maxY = 0;
- var graphLabel = g.graph();
- var marginX = graphLabel.marginx || 0;
- var marginY = graphLabel.marginy || 0;
+module.exports = baseRest;
- function getExtremes(attrs) {
- var x = attrs.x;
- var y = attrs.y;
- var w = attrs.width;
- var h = attrs.height;
- minX = Math.min(minX, x - w / 2);
- maxX = Math.max(maxX, x + w / 2);
- minY = Math.min(minY, y - h / 2);
- maxY = Math.max(maxY, y + h / 2);
- }
- _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- if (_.has(edge, "x")) {
- getExtremes(edge);
- }
- });
+/***/ }),
- minX -= marginX;
- minY -= marginY;
+/***/ "./node_modules/lodash/_baseSet.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_baseSet.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- node.x -= minX;
- node.y -= minY;
- });
+var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
+ castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
+ isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- _.forEach(edge.points, function(p) {
- p.x -= minX;
- p.y -= minY;
- });
- if (_.has(edge, "x")) { edge.x -= minX; }
- if (_.has(edge, "y")) { edge.y -= minY; }
- });
+/**
+ * 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);
- graphLabel.width = maxX - minX + marginX;
- graphLabel.height = maxY - minY + marginY;
-}
+ var index = -1,
+ length = path.length,
+ lastIndex = length - 1,
+ nested = object;
-function assignNodeIntersects(g) {
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- var nodeV = g.node(e.v);
- var nodeW = g.node(e.w);
- var p1, p2;
- if (!edge.points) {
- edge.points = [];
- p1 = nodeW;
- p2 = nodeV;
- } else {
- p1 = edge.points[0];
- p2 = edge.points[edge.points.length - 1];
+ while (nested != null && ++index < length) {
+ var key = toKey(path[index]),
+ newValue = value;
+
+ if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
+ return object;
}
- edge.points.unshift(util.intersectRect(nodeV, p1));
- edge.points.push(util.intersectRect(nodeW, p2));
- });
-}
-function fixupEdgeLabelCoords(g) {
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- if (_.has(edge, "x")) {
- if (edge.labelpos === "l" || edge.labelpos === "r") {
- edge.width -= edge.labeloffset;
- }
- switch (edge.labelpos) {
- case "l": edge.x -= edge.width / 2 + edge.labeloffset; break;
- case "r": edge.x += edge.width / 2 + edge.labeloffset; break;
+ 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;
}
-function reversePointsForReversedEdges(g) {
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- if (edge.reversed) {
- edge.points.reverse();
- }
- });
-}
+module.exports = baseSet;
-function removeBorderNodes(g) {
- _.forEach(g.nodes(), function(v) {
- if (g.children(v).length) {
- var node = g.node(v);
- var t = g.node(node.borderTop);
- var b = g.node(node.borderBottom);
- var l = g.node(_.last(node.borderLeft));
- var r = g.node(_.last(node.borderRight));
- node.width = Math.abs(r.x - l.x);
- node.height = Math.abs(b.y - t.y);
- node.x = l.x + node.width / 2;
- node.y = t.y + node.height / 2;
- }
- });
+/***/ }),
- _.forEach(g.nodes(), function(v) {
- if (g.node(v).dummy === "border") {
- g.removeNode(v);
- }
- });
-}
+/***/ "./node_modules/lodash/_baseSetToString.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_baseSetToString.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function removeSelfEdges(g) {
- _.forEach(g.edges(), function(e) {
- if (e.v === e.w) {
- var node = g.node(e.v);
- if (!node.selfEdges) {
- node.selfEdges = [];
- }
- node.selfEdges.push({ e: e, label: g.edge(e) });
- g.removeEdge(e);
- }
- });
-}
+var constant = __webpack_require__(/*! ./constant */ "./node_modules/lodash/constant.js"),
+ defineProperty = __webpack_require__(/*! ./_defineProperty */ "./node_modules/lodash/_defineProperty.js"),
+ identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
-function insertSelfEdges(g) {
- var layers = util.buildLayerMatrix(g);
- _.forEach(layers, function(layer) {
- var orderShift = 0;
- _.forEach(layer, function(v, i) {
- var node = g.node(v);
- node.order = i + orderShift;
- _.forEach(node.selfEdges, function(selfEdge) {
- util.addDummyNode(g, "selfedge", {
- width: selfEdge.label.width,
- height: selfEdge.label.height,
- rank: node.rank,
- order: i + (++orderShift),
- e: selfEdge.e,
- label: selfEdge.label
- }, "_se");
- });
- delete node.selfEdges;
- });
+/**
+ * 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
});
-}
+};
-function positionSelfEdges(g) {
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- if (node.dummy === "selfedge") {
- var selfNode = g.node(node.e.v);
- var x = selfNode.x + selfNode.width / 2;
- var y = selfNode.y;
- var dx = node.x - x;
- var dy = selfNode.height / 2;
- g.setEdge(node.e, node.label);
- g.removeNode(v);
- node.label.points = [
- { x: x + 2 * dx / 3, y: y - dy },
- { x: x + 5 * dx / 6, y: y - dy },
- { x: x + dx , y: y },
- { x: x + 5 * dx / 6, y: y + dy },
- { x: x + 2 * dx / 3, y: y + dy }
- ];
- node.label.x = node.x;
- node.label.y = node.y;
- }
- });
-}
+module.exports = baseSetToString;
-function selectNumberAttrs(obj, attrs) {
- return _.mapValues(_.pick(obj, attrs), Number);
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseSortBy.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseSortBy.js ***!
+ \********************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
-function canonicalize(attrs) {
- var newAttrs = {};
- _.forEach(attrs, function(v, k) {
- newAttrs[k.toLowerCase()] = v;
- });
- return newAttrs;
+module.exports = baseSortBy;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_baseTimes.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseTimes.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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;
}
+module.exports = baseTimes;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/lodash.js":
-/*!******************************************!*\
- !*** ./node_modules/dagre/lib/lodash.js ***!
- \******************************************/
+/***/ "./node_modules/lodash/_baseToString.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_baseToString.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/* global window */
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
+ arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
-var lodash;
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
-if (true) {
- try {
- lodash = {
- cloneDeep: __webpack_require__(/*! lodash/cloneDeep */ "./node_modules/lodash/cloneDeep.js"),
- constant: __webpack_require__(/*! lodash/constant */ "./node_modules/lodash/constant.js"),
- defaults: __webpack_require__(/*! lodash/defaults */ "./node_modules/lodash/defaults.js"),
- each: __webpack_require__(/*! lodash/each */ "./node_modules/lodash/each.js"),
- filter: __webpack_require__(/*! lodash/filter */ "./node_modules/lodash/filter.js"),
- find: __webpack_require__(/*! lodash/find */ "./node_modules/lodash/find.js"),
- flatten: __webpack_require__(/*! lodash/flatten */ "./node_modules/lodash/flatten.js"),
- forEach: __webpack_require__(/*! lodash/forEach */ "./node_modules/lodash/forEach.js"),
- forIn: __webpack_require__(/*! lodash/forIn */ "./node_modules/lodash/forIn.js"),
- has: __webpack_require__(/*! lodash/has */ "./node_modules/lodash/has.js"),
- isUndefined: __webpack_require__(/*! lodash/isUndefined */ "./node_modules/lodash/isUndefined.js"),
- last: __webpack_require__(/*! lodash/last */ "./node_modules/lodash/last.js"),
- map: __webpack_require__(/*! lodash/map */ "./node_modules/lodash/map.js"),
- mapValues: __webpack_require__(/*! lodash/mapValues */ "./node_modules/lodash/mapValues.js"),
- max: __webpack_require__(/*! lodash/max */ "./node_modules/lodash/max.js"),
- merge: __webpack_require__(/*! lodash/merge */ "./node_modules/lodash/merge.js"),
- min: __webpack_require__(/*! lodash/min */ "./node_modules/lodash/min.js"),
- minBy: __webpack_require__(/*! lodash/minBy */ "./node_modules/lodash/minBy.js"),
- now: __webpack_require__(/*! lodash/now */ "./node_modules/lodash/now.js"),
- pick: __webpack_require__(/*! lodash/pick */ "./node_modules/lodash/pick.js"),
- range: __webpack_require__(/*! lodash/range */ "./node_modules/lodash/range.js"),
- reduce: __webpack_require__(/*! lodash/reduce */ "./node_modules/lodash/reduce.js"),
- sortBy: __webpack_require__(/*! lodash/sortBy */ "./node_modules/lodash/sortBy.js"),
- uniqueId: __webpack_require__(/*! lodash/uniqueId */ "./node_modules/lodash/uniqueId.js"),
- values: __webpack_require__(/*! lodash/values */ "./node_modules/lodash/values.js"),
- zipObject: __webpack_require__(/*! lodash/zipObject */ "./node_modules/lodash/zipObject.js"),
- };
- } catch (e) {
- // continue regardless of error
- }
-}
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = Symbol ? Symbol.prototype : undefined,
+ symbolToString = symbolProto ? symbolProto.toString : undefined;
-if (!lodash) {
- lodash = window._;
+/**
+ * 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;
}
-module.exports = lodash;
+module.exports = baseToString;
/***/ }),
-/***/ "./node_modules/dagre/lib/nesting-graph.js":
-/*!*************************************************!*\
- !*** ./node_modules/dagre/lib/nesting-graph.js ***!
- \*************************************************/
+/***/ "./node_modules/lodash/_baseTrim.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_baseTrim.js ***!
+ \******************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
+var trimmedEndIndex = __webpack_require__(/*! ./_trimmedEndIndex */ "./node_modules/lodash/_trimmedEndIndex.js");
-module.exports = {
- run: run,
- cleanup: cleanup
-};
+/** Used to match leading whitespace. */
+var reTrimStart = /^\s+/;
-/*
- * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
- * adds appropriate edges to ensure that all cluster nodes are placed between
- * these boundries, and ensures that the graph is connected.
- *
- * In addition we ensure, through the use of the minlen property, that nodes
- * and subgraph border nodes to not end up on the same rank.
- *
- * Preconditions:
- *
- * 1. Input graph is a DAG
- * 2. Nodes in the input graph has a minlen attribute
- *
- * Postconditions:
- *
- * 1. Input graph is connected.
- * 2. Dummy nodes are added for the tops and bottoms of subgraphs.
- * 3. The minlen attribute for nodes is adjusted to ensure nodes do not
- * get placed on the same rank as subgraph border nodes.
+/**
+ * The base implementation of `_.trim`.
*
- * The nesting graph idea comes from Sander, "Layout of Compound Directed
- * Graphs."
+ * @private
+ * @param {string} string The string to trim.
+ * @returns {string} Returns the trimmed string.
*/
-function run(g) {
- var root = util.addDummyNode(g, "root", {}, "_root");
- var depths = treeDepths(g);
- var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array
- var nodeSep = 2 * height + 1;
+function baseTrim(string) {
+ return string
+ ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')
+ : string;
+}
- g.graph().nestingRoot = root;
+module.exports = baseTrim;
- // Multiply minlen by nodeSep to align nodes on non-border ranks.
- _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });
- // Calculate a weight that is sufficient to keep subgraphs vertically compact
- var weight = sumWeights(g) + 1;
+/***/ }),
- // Create border nodes and link them up
- _.forEach(g.children(), function(child) {
- dfs(g, root, nodeSep, weight, height, depths, child);
- });
+/***/ "./node_modules/lodash/_baseUnary.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_baseUnary.js ***!
+ \*******************************************/
+/***/ (function(module) {
- // Save the multiplier for node layers for later removal of empty border
- // layers.
- g.graph().nodeRankFactor = nodeSep;
+/**
+ * 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);
+ };
}
-function dfs(g, root, nodeSep, weight, height, depths, v) {
- var children = g.children(v);
- if (!children.length) {
- if (v !== root) {
- g.setEdge(root, v, { weight: 0, minlen: nodeSep });
- }
- return;
- }
+module.exports = baseUnary;
- var top = util.addBorderNode(g, "_bt");
- var bottom = util.addBorderNode(g, "_bb");
- var label = g.node(v);
- g.setParent(top, v);
- label.borderTop = top;
- g.setParent(bottom, v);
- label.borderBottom = bottom;
+/***/ }),
- _.forEach(children, function(child) {
- dfs(g, root, nodeSep, weight, height, depths, child);
+/***/ "./node_modules/lodash/_baseUniq.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_baseUniq.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var childNode = g.node(child);
- var childTop = childNode.borderTop ? childNode.borderTop : child;
- var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
- var thisWeight = childNode.borderTop ? weight : 2 * weight;
- var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+var SetCache = __webpack_require__(/*! ./_SetCache */ "./node_modules/lodash/_SetCache.js"),
+ arrayIncludes = __webpack_require__(/*! ./_arrayIncludes */ "./node_modules/lodash/_arrayIncludes.js"),
+ arrayIncludesWith = __webpack_require__(/*! ./_arrayIncludesWith */ "./node_modules/lodash/_arrayIncludesWith.js"),
+ cacheHas = __webpack_require__(/*! ./_cacheHas */ "./node_modules/lodash/_cacheHas.js"),
+ createSet = __webpack_require__(/*! ./_createSet */ "./node_modules/lodash/_createSet.js"),
+ setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
- g.setEdge(top, childTop, {
- weight: thisWeight,
- minlen: minlen,
- nestingEdge: true
- });
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
- g.setEdge(childBottom, bottom, {
- weight: thisWeight,
- minlen: minlen,
- nestingEdge: true
- });
- });
+/**
+ * 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 (!g.parent(v)) {
- g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
+ if (comparator) {
+ isCommon = false;
+ includes = arrayIncludesWith;
}
-}
-
-function treeDepths(g) {
- var depths = {};
- function dfs(v, depth) {
- var children = g.children(v);
- if (children && children.length) {
- _.forEach(children, function(child) {
- dfs(child, depth + 1);
- });
+ else if (length >= LARGE_ARRAY_SIZE) {
+ var set = iteratee ? null : createSet(array);
+ if (set) {
+ return setToArray(set);
}
- depths[v] = depth;
+ isCommon = false;
+ includes = cacheHas;
+ seen = new SetCache;
}
- _.forEach(g.children(), function(v) { dfs(v, 1); });
- return depths;
-}
-
-function sumWeights(g) {
- return _.reduce(g.edges(), function(acc, e) {
- return acc + g.edge(e).weight;
- }, 0);
-}
+ else {
+ seen = iteratee ? [] : result;
+ }
+ outer:
+ while (++index < length) {
+ var value = array[index],
+ computed = iteratee ? iteratee(value) : value;
-function cleanup(g) {
- var graphLabel = g.graph();
- g.removeNode(graphLabel.nestingRoot);
- delete graphLabel.nestingRoot;
- _.forEach(g.edges(), function(e) {
- var edge = g.edge(e);
- if (edge.nestingEdge) {
- g.removeEdge(e);
+ 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;
}
+module.exports = baseUniq;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/normalize.js":
-/*!*********************************************!*\
- !*** ./node_modules/dagre/lib/normalize.js ***!
- \*********************************************/
+/***/ "./node_modules/lodash/_baseValues.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_baseValues.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js");
+
+/**
+ * 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];
+ });
+}
+module.exports = baseValues;
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/util.js");
-module.exports = {
- run: run,
- undo: undo
-};
+/***/ }),
-/*
- * Breaks any long edges in the graph into short segments that span 1 layer
- * each. This operation is undoable with the denormalize function.
- *
- * Pre-conditions:
- *
- * 1. The input graph is a DAG.
- * 2. Each node in the graph has a "rank" property.
- *
- * Post-condition:
+/***/ "./node_modules/lodash/_baseZipObject.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_baseZipObject.js ***!
+ \***********************************************/
+/***/ (function(module) {
+
+/**
+ * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
*
- * 1. All edges in the graph have a length of 1.
- * 2. Dummy nodes are added where edges have been split into segments.
- * 3. The graph is augmented with a "dummyChains" attribute which contains
- * the first dummy in each chain of dummy nodes produced.
+ * @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 run(g) {
- g.graph().dummyChains = [];
- _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });
+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;
}
-function normalizeEdge(g, e) {
- var v = e.v;
- var vRank = g.node(v).rank;
- var w = e.w;
- var wRank = g.node(w).rank;
- var name = e.name;
- var edgeLabel = g.edge(e);
- var labelRank = edgeLabel.labelRank;
+module.exports = baseZipObject;
- if (wRank === vRank + 1) return;
- g.removeEdge(e);
+/***/ }),
- var dummy, attrs, i;
- for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
- edgeLabel.points = [];
- attrs = {
- width: 0, height: 0,
- edgeLabel: edgeLabel, edgeObj: e,
- rank: vRank
- };
- dummy = util.addDummyNode(g, "edge", attrs, "_d");
- if (vRank === labelRank) {
- attrs.width = edgeLabel.width;
- attrs.height = edgeLabel.height;
- attrs.dummy = "edge-label";
- attrs.labelpos = edgeLabel.labelpos;
- }
- g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
- if (i === 0) {
- g.graph().dummyChains.push(dummy);
- }
- v = dummy;
- }
+/***/ "./node_modules/lodash/_cacheHas.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_cacheHas.js ***!
+ \******************************************/
+/***/ (function(module) {
- g.setEdge(v, w, { weight: edgeLabel.weight }, name);
+/**
+ * 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);
}
-function undo(g) {
- _.forEach(g.graph().dummyChains, function(v) {
- var node = g.node(v);
- var origLabel = node.edgeLabel;
- var w;
- g.setEdge(node.edgeObj, origLabel);
- while (node.dummy) {
- w = g.successors(v)[0];
- g.removeNode(v);
- origLabel.points.push({ x: node.x, y: node.y });
- if (node.dummy === "edge-label") {
- origLabel.x = node.x;
- origLabel.y = node.y;
- origLabel.width = node.width;
- origLabel.height = node.height;
- }
- v = w;
- node = g.node(v);
- }
- });
-}
+module.exports = cacheHas;
/***/ }),
-/***/ "./node_modules/dagre/lib/order/add-subgraph-constraints.js":
-/*!******************************************************************!*\
- !*** ./node_modules/dagre/lib/order/add-subgraph-constraints.js ***!
- \******************************************************************/
+/***/ "./node_modules/lodash/_castFunction.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_castFunction.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
-module.exports = addSubgraphConstraints;
+/**
+ * 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;
+}
-function addSubgraphConstraints(g, cg, vs) {
- var prev = {},
- rootPrev;
+module.exports = castFunction;
- _.forEach(vs, function(v) {
- var child = g.parent(v),
- parent,
- prevChild;
- while (child) {
- parent = g.parent(child);
- if (parent) {
- prevChild = prev[parent];
- prev[parent] = child;
- } else {
- prevChild = rootPrev;
- rootPrev = child;
- }
- if (prevChild && prevChild !== child) {
- cg.setEdge(prevChild, child);
- return;
- }
- child = parent;
- }
- });
- /*
- function dfs(v) {
- var children = v ? g.children(v) : g.children();
- if (children.length) {
- var min = Number.POSITIVE_INFINITY,
- subgraphs = [];
- _.each(children, function(child) {
- var childMin = dfs(child);
- if (g.children(child).length) {
- subgraphs.push({ v: child, order: childMin });
- }
- min = Math.min(min, childMin);
- });
- _.reduce(_.sortBy(subgraphs, "order"), function(prev, curr) {
- cg.setEdge(prev.v, curr.v);
- return curr;
- });
- return min;
- }
- return g.node(v).order;
+/***/ }),
+
+/***/ "./node_modules/lodash/_castPath.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_castPath.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
+ stringToPath = __webpack_require__(/*! ./_stringToPath */ "./node_modules/lodash/_stringToPath.js"),
+ toString = __webpack_require__(/*! ./toString */ "./node_modules/lodash/toString.js");
+
+/**
+ * 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;
}
- dfs(undefined);
- */
+ return isKey(value, object) ? [value] : stringToPath(toString(value));
}
+module.exports = castPath;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/order/barycenter.js":
-/*!****************************************************!*\
- !*** ./node_modules/dagre/lib/order/barycenter.js ***!
- \****************************************************/
+/***/ "./node_modules/lodash/_cloneArrayBuffer.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/_cloneArrayBuffer.js ***!
+ \**************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-
-module.exports = barycenter;
-
-function barycenter(g, movable) {
- return _.map(movable, function(v) {
- var inV = g.inEdges(v);
- if (!inV.length) {
- return { v: v };
- } else {
- var result = _.reduce(inV, function(acc, e) {
- var edge = g.edge(e),
- nodeU = g.node(e.v);
- return {
- sum: acc.sum + (edge.weight * nodeU.order),
- weight: acc.weight + edge.weight
- };
- }, { sum: 0, weight: 0 });
+var Uint8Array = __webpack_require__(/*! ./_Uint8Array */ "./node_modules/lodash/_Uint8Array.js");
- return {
- v: v,
- barycenter: result.sum / result.weight,
- weight: result.weight
- };
- }
- });
+/**
+ * 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;
}
+module.exports = cloneArrayBuffer;
/***/ }),
-/***/ "./node_modules/dagre/lib/order/build-layer-graph.js":
-/*!***********************************************************!*\
- !*** ./node_modules/dagre/lib/order/build-layer-graph.js ***!
- \***********************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
+/***/ "./node_modules/lodash/_cloneBuffer.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_cloneBuffer.js ***!
+ \*********************************************/
+/***/ (function(module, exports, __webpack_require__) {
-module.exports = buildLayerGraph;
+/* module decorator */ module = __webpack_require__.nmd(module);
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
-/*
- * Constructs a graph that can be used to sort a layer of nodes. The graph will
- * contain all base and subgraph nodes from the request layer in their original
- * hierarchy and any edges that are incident on these nodes and are of the type
- * requested by the "relationship" parameter.
- *
- * Nodes from the requested rank that do not have parents are assigned a root
- * node in the output graph, which is set in the root graph attribute. This
- * makes it easy to walk the hierarchy of movable nodes during ordering.
- *
- * Pre-conditions:
- *
- * 1. Input graph is a DAG
- * 2. Base nodes in the input graph have a rank attribute
- * 3. Subgraph nodes in the input graph has minRank and maxRank attributes
- * 4. Edges have an assigned weight
- *
- * Post-conditions:
- *
- * 1. Output graph has all nodes in the movable rank with preserved
- * hierarchy.
- * 2. Root nodes in the movable layer are made children of the node
- * indicated by the root attribute of the graph.
- * 3. Non-movable nodes incident on movable nodes, selected by the
- * relationship parameter, are included in the graph (without hierarchy).
- * 4. Edges incident on movable nodes, selected by the relationship
- * parameter, are added to the output graph.
- * 5. The weights for copied edges are aggregated as need, since the output
- * graph is not a multi-graph.
- */
-function buildLayerGraph(g, rank, relationship) {
- var root = createRootNode(g),
- result = new Graph({ compound: true }).setGraph({ root: root })
- .setDefaultNodeLabel(function(v) { return g.node(v); });
+/** Detect free variable `exports`. */
+var freeExports = true && exports && !exports.nodeType && exports;
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v),
- parent = g.parent(v);
+/** Detect free variable `module`. */
+var freeModule = freeExports && "object" == 'object' && module && !module.nodeType && module;
- if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {
- result.setNode(v);
- result.setParent(v, parent || root);
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports = freeModule && freeModule.exports === freeExports;
- // This assumes we have only short edges!
- _.forEach(g[relationship](v), function(e) {
- var u = e.v === v ? e.w : e.v,
- edge = result.edge(u, v),
- weight = !_.isUndefined(edge) ? edge.weight : 0;
- result.setEdge(u, v, { weight: g.edge(e).weight + weight });
- });
+/** Built-in value references. */
+var Buffer = moduleExports ? root.Buffer : undefined,
+ allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;
- if (_.has(node, "minRank")) {
- result.setNode(v, {
- borderLeft: node.borderLeft[rank],
- borderRight: node.borderRight[rank]
- });
- }
- }
- });
+/**
+ * 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;
}
-function createRootNode(g) {
- var v;
- while (g.hasNode((v = _.uniqueId("_root"))));
- return v;
-}
+module.exports = cloneBuffer;
/***/ }),
-/***/ "./node_modules/dagre/lib/order/cross-count.js":
-/*!*****************************************************!*\
- !*** ./node_modules/dagre/lib/order/cross-count.js ***!
- \*****************************************************/
+/***/ "./node_modules/lodash/_cloneDataView.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_cloneDataView.js ***!
+ \***********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-
-module.exports = crossCount;
+var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js");
-/*
- * A function that takes a layering (an array of layers, each with an array of
- * ordererd nodes) and a graph and returns a weighted crossing count.
- *
- * Pre-conditions:
- *
- * 1. Input graph must be simple (not a multigraph), directed, and include
- * only simple edges.
- * 2. Edges in the input graph must have assigned weights.
- *
- * Post-conditions:
- *
- * 1. The graph and layering matrix are left unchanged.
+/**
+ * Creates a clone of `dataView`.
*
- * This algorithm is derived from Barth, et al., "Bilayer Cross Counting."
+ * @private
+ * @param {Object} dataView The data view to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the cloned data view.
*/
-function crossCount(g, layering) {
- var cc = 0;
- for (var i = 1; i < layering.length; ++i) {
- cc += twoLayerCrossCount(g, layering[i-1], layering[i]);
- }
- return cc;
+function cloneDataView(dataView, isDeep) {
+ var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
+ return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
}
-function twoLayerCrossCount(g, northLayer, southLayer) {
- // Sort all of the edges between the north and south layers by their position
- // in the north layer and then the south. Map these edges to the position of
- // their head in the south layer.
- var southPos = _.zipObject(southLayer,
- _.map(southLayer, function (v, i) { return i; }));
- var southEntries = _.flatten(_.map(northLayer, function(v) {
- return _.sortBy(_.map(g.outEdges(v), function(e) {
- return { pos: southPos[e.w], weight: g.edge(e).weight };
- }), "pos");
- }), true);
+module.exports = cloneDataView;
- // Build the accumulator tree
- var firstIndex = 1;
- while (firstIndex < southLayer.length) firstIndex <<= 1;
- var treeSize = 2 * firstIndex - 1;
- firstIndex -= 1;
- var tree = _.map(new Array(treeSize), function() { return 0; });
- // Calculate the weighted crossings
- var cc = 0;
- _.forEach(southEntries.forEach(function(entry) {
- var index = entry.pos + firstIndex;
- tree[index] += entry.weight;
- var weightSum = 0;
- while (index > 0) {
- if (index % 2) {
- weightSum += tree[index + 1];
- }
- index = (index - 1) >> 1;
- tree[index] += entry.weight;
- }
- cc += entry.weight * weightSum;
- }));
+/***/ }),
- return cc;
+/***/ "./node_modules/lodash/_cloneRegExp.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_cloneRegExp.js ***!
+ \*********************************************/
+/***/ (function(module) {
+
+/** Used to match `RegExp` flags from their coerced string values. */
+var reFlags = /\w*$/;
+
+/**
+ * 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;
}
+module.exports = cloneRegExp;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/order/index.js":
-/*!***********************************************!*\
- !*** ./node_modules/dagre/lib/order/index.js ***!
- \***********************************************/
+/***/ "./node_modules/lodash/_cloneSymbol.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_cloneSymbol.js ***!
+ \*********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var initOrder = __webpack_require__(/*! ./init-order */ "./node_modules/dagre/lib/order/init-order.js");
-var crossCount = __webpack_require__(/*! ./cross-count */ "./node_modules/dagre/lib/order/cross-count.js");
-var sortSubgraph = __webpack_require__(/*! ./sort-subgraph */ "./node_modules/dagre/lib/order/sort-subgraph.js");
-var buildLayerGraph = __webpack_require__(/*! ./build-layer-graph */ "./node_modules/dagre/lib/order/build-layer-graph.js");
-var addSubgraphConstraints = __webpack_require__(/*! ./add-subgraph-constraints */ "./node_modules/dagre/lib/order/add-subgraph-constraints.js");
-var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js");
-module.exports = order;
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = Symbol ? Symbol.prototype : undefined,
+ symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
-/*
- * Applies heuristics to minimize edge crossings in the graph and sets the best
- * order solution as an order attribute on each node.
- *
- * Pre-conditions:
- *
- * 1. Graph must be DAG
- * 2. Graph nodes must be objects with a "rank" attribute
- * 3. Graph edges must have the "weight" attribute
- *
- * Post-conditions:
+/**
+ * Creates a clone of the `symbol` object.
*
- * 1. Graph nodes will have an "order" attribute based on the results of the
- * algorithm.
+ * @private
+ * @param {Object} symbol The symbol object to clone.
+ * @returns {Object} Returns the cloned symbol object.
*/
-function order(g) {
- var maxRank = util.maxRank(g),
- downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), "inEdges"),
- upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), "outEdges");
-
- var layering = initOrder(g);
- assignOrder(g, layering);
+function cloneSymbol(symbol) {
+ return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
+}
- var bestCC = Number.POSITIVE_INFINITY,
- best;
+module.exports = cloneSymbol;
- for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {
- sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);
- layering = util.buildLayerMatrix(g);
- var cc = crossCount(g, layering);
- if (cc < bestCC) {
- lastBest = 0;
- best = _.cloneDeep(layering);
- bestCC = cc;
- }
- }
+/***/ }),
- assignOrder(g, best);
-}
+/***/ "./node_modules/lodash/_cloneTypedArray.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_cloneTypedArray.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function buildLayerGraphs(g, ranks, relationship) {
- return _.map(ranks, function(rank) {
- return buildLayerGraph(g, rank, relationship);
- });
-}
+var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js");
-function sweepLayerGraphs(layerGraphs, biasRight) {
- var cg = new Graph();
- _.forEach(layerGraphs, function(lg) {
- var root = lg.graph().root;
- var sorted = sortSubgraph(lg, root, cg, biasRight);
- _.forEach(sorted.vs, function(v, i) {
- lg.node(v).order = i;
- });
- addSubgraphConstraints(lg, cg, sorted.vs);
- });
+/**
+ * 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);
}
-function assignOrder(g, layering) {
- _.forEach(layering, function(layer) {
- _.forEach(layer, function(v, i) {
- g.node(v).order = i;
- });
- });
-}
+module.exports = cloneTypedArray;
/***/ }),
-/***/ "./node_modules/dagre/lib/order/init-order.js":
-/*!****************************************************!*\
- !*** ./node_modules/dagre/lib/order/init-order.js ***!
- \****************************************************/
+/***/ "./node_modules/lodash/_compareAscending.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/_compareAscending.js ***!
+ \**************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+/**
+ * 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 _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+ var othIsDefined = other !== undefined,
+ othIsNull = other === null,
+ othIsReflexive = other === other,
+ othIsSymbol = isSymbol(other);
-module.exports = initOrder;
+ 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;
+}
-/*
- * Assigns an initial order value for each node by performing a DFS search
- * starting from nodes in the first rank. Nodes are assigned an order in their
- * rank as they are first visited.
+module.exports = compareAscending;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_compareMultiple.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_compareMultiple.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var compareAscending = __webpack_require__(/*! ./_compareAscending */ "./node_modules/lodash/_compareAscending.js");
+
+/**
+ * Used by `_.orderBy` to compare multiple properties of a value to another
+ * and stable sort them.
*
- * This approach comes from Gansner, et al., "A Technique for Drawing Directed
- * Graphs."
+ * 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.
*
- * Returns a layering matrix with an array per layer and each layer sorted by
- * the order of its nodes.
+ * @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 initOrder(g) {
- var visited = {};
- var simpleNodes = _.filter(g.nodes(), function(v) {
- return !g.children(v).length;
- });
- var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));
- var layers = _.map(_.range(maxRank + 1), function() { return []; });
+function compareMultiple(object, other, orders) {
+ var index = -1,
+ objCriteria = object.criteria,
+ othCriteria = other.criteria,
+ length = objCriteria.length,
+ ordersLength = orders.length;
- function dfs(v) {
- if (_.has(visited, v)) return;
- visited[v] = true;
- var node = g.node(v);
- layers[node.rank].push(v);
- _.forEach(g.successors(v), dfs);
+ 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);
+ }
}
-
- var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });
- _.forEach(orderedVs, dfs);
-
- return layers;
+ // 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;
}
+module.exports = compareMultiple;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/order/resolve-conflicts.js":
-/*!***********************************************************!*\
- !*** ./node_modules/dagre/lib/order/resolve-conflicts.js ***!
- \***********************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/lodash/_copyArray.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_copyArray.js ***!
+ \*******************************************/
+/***/ (function(module) {
-"use strict";
+/**
+ * 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;
+}
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+module.exports = copyArray;
-module.exports = resolveConflicts;
-/*
- * Given a list of entries of the form {v, barycenter, weight} and a
- * constraint graph this function will resolve any conflicts between the
- * constraint graph and the barycenters for the entries. If the barycenters for
- * an entry would violate a constraint in the constraint graph then we coalesce
- * the nodes in the conflict into a new node that respects the contraint and
- * aggregates barycenter and weight information.
- *
- * This implementation is based on the description in Forster, "A Fast and
- * Simple Hueristic for Constrained Two-Level Crossing Reduction," thought it
- * differs in some specific details.
- *
- * Pre-conditions:
- *
- * 1. Each entry has the form {v, barycenter, weight}, or if the node has
- * no barycenter, then {v}.
- *
- * Returns:
+/***/ }),
+
+/***/ "./node_modules/lodash/_copyObject.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_copyObject.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
+ baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js");
+
+/**
+ * Copies properties of `source` to `object`.
*
- * A new list of entries of the form {vs, i, barycenter, weight}. The list
- * `vs` may either be a singleton or it may be an aggregation of nodes
- * ordered such that they do not violate constraints from the constraint
- * graph. The property `i` is the lowest original index of any of the
- * elements in `vs`.
+ * @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 resolveConflicts(entries, cg) {
- var mappedEntries = {};
- _.forEach(entries, function(entry, i) {
- var tmp = mappedEntries[entry.v] = {
- indegree: 0,
- "in": [],
- out: [],
- vs: [entry.v],
- i: i
- };
- if (!_.isUndefined(entry.barycenter)) {
- tmp.barycenter = entry.barycenter;
- tmp.weight = entry.weight;
- }
- });
+function copyObject(source, props, object, customizer) {
+ var isNew = !object;
+ object || (object = {});
- _.forEach(cg.edges(), function(e) {
- var entryV = mappedEntries[e.v];
- var entryW = mappedEntries[e.w];
- if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {
- entryW.indegree++;
- entryV.out.push(mappedEntries[e.w]);
- }
- });
+ var index = -1,
+ length = props.length;
- var sourceSet = _.filter(mappedEntries, function(entry) {
- return !entry.indegree;
- });
+ while (++index < length) {
+ var key = props[index];
- return doResolveConflicts(sourceSet);
+ 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;
}
-function doResolveConflicts(sourceSet) {
- var entries = [];
+module.exports = copyObject;
- function handleIn(vEntry) {
- return function(uEntry) {
- if (uEntry.merged) {
- return;
- }
- if (_.isUndefined(uEntry.barycenter) ||
- _.isUndefined(vEntry.barycenter) ||
- uEntry.barycenter >= vEntry.barycenter) {
- mergeEntries(vEntry, uEntry);
- }
- };
- }
- function handleOut(vEntry) {
- return function(wEntry) {
- wEntry["in"].push(vEntry);
- if (--wEntry.indegree === 0) {
- sourceSet.push(wEntry);
- }
- };
- }
+/***/ }),
- while (sourceSet.length) {
- var entry = sourceSet.pop();
- entries.push(entry);
- _.forEach(entry["in"].reverse(), handleIn(entry));
- _.forEach(entry.out, handleOut(entry));
- }
+/***/ "./node_modules/lodash/_copySymbols.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_copySymbols.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- return _.map(_.filter(entries, function(entry) { return !entry.merged; }),
- function(entry) {
- return _.pick(entry, ["vs", "i", "barycenter", "weight"]);
- });
+var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
+ getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js");
+/**
+ * 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);
}
-function mergeEntries(target, source) {
- var sum = 0;
- var weight = 0;
+module.exports = copySymbols;
- if (target.weight) {
- sum += target.barycenter * target.weight;
- weight += target.weight;
- }
- if (source.weight) {
- sum += source.barycenter * source.weight;
- weight += source.weight;
- }
+/***/ }),
- target.vs = source.vs.concat(target.vs);
- target.barycenter = sum / weight;
- target.weight = weight;
- target.i = Math.min(source.i, target.i);
- source.merged = true;
+/***/ "./node_modules/lodash/_copySymbolsIn.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_copySymbolsIn.js ***!
+ \***********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
+ getSymbolsIn = __webpack_require__(/*! ./_getSymbolsIn */ "./node_modules/lodash/_getSymbolsIn.js");
+
+/**
+ * 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);
}
+module.exports = copySymbolsIn;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/order/sort-subgraph.js":
-/*!*******************************************************!*\
- !*** ./node_modules/dagre/lib/order/sort-subgraph.js ***!
- \*******************************************************/
+/***/ "./node_modules/lodash/_coreJsData.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_coreJsData.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var barycenter = __webpack_require__(/*! ./barycenter */ "./node_modules/dagre/lib/order/barycenter.js");
-var resolveConflicts = __webpack_require__(/*! ./resolve-conflicts */ "./node_modules/dagre/lib/order/resolve-conflicts.js");
-var sort = __webpack_require__(/*! ./sort */ "./node_modules/dagre/lib/order/sort.js");
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
-module.exports = sortSubgraph;
+/** Used to detect overreaching core-js shims. */
+var coreJsData = root['__core-js_shared__'];
-function sortSubgraph(g, v, cg, biasRight) {
- var movable = g.children(v);
- var node = g.node(v);
- var bl = node ? node.borderLeft : undefined;
- var br = node ? node.borderRight: undefined;
- var subgraphs = {};
+module.exports = coreJsData;
- if (bl) {
- movable = _.filter(movable, function(w) {
- return w !== bl && w !== br;
- });
- }
- var barycenters = barycenter(g, movable);
- _.forEach(barycenters, function(entry) {
- if (g.children(entry.v).length) {
- var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
- subgraphs[entry.v] = subgraphResult;
- if (_.has(subgraphResult, "barycenter")) {
- mergeBarycenters(entry, subgraphResult);
+/***/ }),
+
+/***/ "./node_modules/lodash/_createAssigner.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_createAssigner.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
+ isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js");
+
+/**
+ * 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;
});
+}
- var entries = resolveConflicts(barycenters, cg);
- expandSubgraphs(entries, subgraphs);
+module.exports = createAssigner;
- var result = sort(entries, biasRight);
- if (bl) {
- result.vs = _.flatten([bl, result.vs, br], true);
- if (g.predecessors(bl).length) {
- var blPred = g.node(g.predecessors(bl)[0]),
- brPred = g.node(g.predecessors(br)[0]);
- if (!_.has(result, "barycenter")) {
- result.barycenter = 0;
- result.weight = 0;
- }
- result.barycenter = (result.barycenter * result.weight +
- blPred.order + brPred.order) / (result.weight + 2);
- result.weight += 2;
+/***/ }),
+
+/***/ "./node_modules/lodash/_createBaseEach.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_createBaseEach.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
+
+/**
+ * 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);
- return result;
+ while ((fromRight ? index-- : ++index < length)) {
+ if (iteratee(iterable[index], index, iterable) === false) {
+ break;
+ }
+ }
+ return collection;
+ };
}
-function expandSubgraphs(entries, subgraphs) {
- _.forEach(entries, function(entry) {
- entry.vs = _.flatten(entry.vs.map(function(v) {
- if (subgraphs[v]) {
- return subgraphs[v].vs;
+module.exports = createBaseEach;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_createBaseFor.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_createBaseFor.js ***!
+ \***********************************************/
+/***/ (function(module) {
+
+/**
+ * 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 v;
- }), true);
- });
+ }
+ return object;
+ };
}
-function mergeBarycenters(target, other) {
- if (!_.isUndefined(target.barycenter)) {
- target.barycenter = (target.barycenter * target.weight +
- other.barycenter * other.weight) /
- (target.weight + other.weight);
- target.weight += other.weight;
- } else {
- target.barycenter = other.barycenter;
- target.weight = other.weight;
- }
-}
+module.exports = createBaseFor;
/***/ }),
-/***/ "./node_modules/dagre/lib/order/sort.js":
-/*!**********************************************!*\
- !*** ./node_modules/dagre/lib/order/sort.js ***!
- \**********************************************/
+/***/ "./node_modules/lodash/_createFind.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_createFind.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
-
-module.exports = sort;
+var baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
-function sort(entries, biasRight) {
- var parts = util.partition(entries, function(entry) {
- return _.has(entry, "barycenter");
- });
- var sortable = parts.lhs,
- unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),
- vs = [],
- sum = 0,
- weight = 0,
- vsIndex = 0;
+/**
+ * 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 = baseIteratee(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;
+ };
+}
- sortable.sort(compareWithBias(!!biasRight));
+module.exports = createFind;
- vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
- _.forEach(sortable, function (entry) {
- vsIndex += entry.vs.length;
- vs.push(entry.vs);
- sum += entry.barycenter * entry.weight;
- weight += entry.weight;
- vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
- });
+/***/ }),
- var result = { vs: _.flatten(vs, true) };
- if (weight) {
- result.barycenter = sum / weight;
- result.weight = weight;
- }
- return result;
-}
+/***/ "./node_modules/lodash/_createRange.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_createRange.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function consumeUnsortable(vs, unsortable, index) {
- var last;
- while (unsortable.length && (last = _.last(unsortable)).i <= index) {
- unsortable.pop();
- vs.push(last.vs);
- index++;
- }
- return index;
-}
+var baseRange = __webpack_require__(/*! ./_baseRange */ "./node_modules/lodash/_baseRange.js"),
+ isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js"),
+ toFinite = __webpack_require__(/*! ./toFinite */ "./node_modules/lodash/toFinite.js");
-function compareWithBias(bias) {
- return function(entryV, entryW) {
- if (entryV.barycenter < entryW.barycenter) {
- return -1;
- } else if (entryV.barycenter > entryW.barycenter) {
- return 1;
+/**
+ * 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;
}
-
- return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+ // 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);
};
}
+module.exports = createRange;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/parent-dummy-chains.js":
-/*!*******************************************************!*\
- !*** ./node_modules/dagre/lib/parent-dummy-chains.js ***!
- \*******************************************************/
+/***/ "./node_modules/lodash/_createSet.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_createSet.js ***!
+ \*******************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
+var Set = __webpack_require__(/*! ./_Set */ "./node_modules/lodash/_Set.js"),
+ noop = __webpack_require__(/*! ./noop */ "./node_modules/lodash/noop.js"),
+ setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
-module.exports = parentDummyChains;
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
-function parentDummyChains(g) {
- var postorderNums = postorder(g);
+/**
+ * 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);
+};
- _.forEach(g.graph().dummyChains, function(v) {
- var node = g.node(v);
- var edgeObj = node.edgeObj;
- var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
- var path = pathData.path;
- var lca = pathData.lca;
- var pathIdx = 0;
- var pathV = path[pathIdx];
- var ascending = true;
+module.exports = createSet;
- while (v !== edgeObj.w) {
- node = g.node(v);
- if (ascending) {
- while ((pathV = path[pathIdx]) !== lca &&
- g.node(pathV).maxRank < node.rank) {
- pathIdx++;
- }
+/***/ }),
- if (pathV === lca) {
- ascending = false;
- }
- }
+/***/ "./node_modules/lodash/_defineProperty.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_defineProperty.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (!ascending) {
- while (pathIdx < path.length - 1 &&
- g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
- pathIdx++;
- }
- pathV = path[pathIdx];
- }
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js");
- g.setParent(v, pathV);
- v = g.successors(v)[0];
- }
- });
-}
+var defineProperty = (function() {
+ try {
+ var func = getNative(Object, 'defineProperty');
+ func({}, '', {});
+ return func;
+ } catch (e) {}
+}());
-// Find a path from v to w through the lowest common ancestor (LCA). Return the
-// full path and the LCA.
-function findPath(g, postorderNums, v, w) {
- var vPath = [];
- var wPath = [];
- var low = Math.min(postorderNums[v].low, postorderNums[w].low);
- var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
- var parent;
- var lca;
+module.exports = defineProperty;
- // Traverse up from v to find the LCA
- parent = v;
- do {
- parent = g.parent(parent);
- vPath.push(parent);
- } while (parent &&
- (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
- lca = parent;
- // Traverse from w to LCA
- parent = w;
- while ((parent = g.parent(parent)) !== lca) {
- wPath.push(parent);
+/***/ }),
+
+/***/ "./node_modules/lodash/_equalArrays.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_equalArrays.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var SetCache = __webpack_require__(/*! ./_SetCache */ "./node_modules/lodash/_SetCache.js"),
+ arraySome = __webpack_require__(/*! ./_arraySome */ "./node_modules/lodash/_arraySome.js"),
+ cacheHas = __webpack_require__(/*! ./_cacheHas */ "./node_modules/lodash/_cacheHas.js");
+
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1,
+ COMPARE_UNORDERED_FLAG = 2;
+
+/**
+ * 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;
+ }
+ // Check that cyclic values are equal.
+ var arrStacked = stack.get(array);
+ var othStacked = stack.get(other);
+ if (arrStacked && othStacked) {
+ return arrStacked == other && othStacked == array;
}
+ var index = -1,
+ result = true,
+ seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;
- return { path: vPath.concat(wPath.reverse()), lca: lca };
-}
+ stack.set(array, other);
+ stack.set(other, array);
-function postorder(g) {
- var result = {};
- var lim = 0;
+ // Ignore non-index properties.
+ while (++index < arrLength) {
+ var arrValue = array[index],
+ othValue = other[index];
- function dfs(v) {
- var low = lim;
- _.forEach(g.children(v), dfs);
- result[v] = { low: low, lim: lim++ };
+ 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;
+ }
}
- _.forEach(g.children(), dfs);
-
+ stack['delete'](array);
+ stack['delete'](other);
return result;
}
+module.exports = equalArrays;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/position/bk.js":
-/*!***********************************************!*\
- !*** ./node_modules/dagre/lib/position/bk.js ***!
- \***********************************************/
+/***/ "./node_modules/lodash/_equalByTag.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_equalByTag.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
+ Uint8Array = __webpack_require__(/*! ./_Uint8Array */ "./node_modules/lodash/_Uint8Array.js"),
+ eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
+ equalArrays = __webpack_require__(/*! ./_equalArrays */ "./node_modules/lodash/_equalArrays.js"),
+ mapToArray = __webpack_require__(/*! ./_mapToArray */ "./node_modules/lodash/_mapToArray.js"),
+ setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1,
+ COMPARE_UNORDERED_FLAG = 2;
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
+/** `Object#toString` result references. */
+var boolTag = '[object Boolean]',
+ dateTag = '[object Date]',
+ errorTag = '[object Error]',
+ mapTag = '[object Map]',
+ numberTag = '[object Number]',
+ regexpTag = '[object RegExp]',
+ setTag = '[object Set]',
+ stringTag = '[object String]',
+ symbolTag = '[object Symbol]';
-/*
- * This module provides coordinate assignment based on Brandes and Köpf, "Fast
- * and Simple Horizontal Coordinate Assignment."
- */
+var arrayBufferTag = '[object ArrayBuffer]',
+ dataViewTag = '[object DataView]';
-module.exports = {
- positionX: positionX,
- findType1Conflicts: findType1Conflicts,
- findType2Conflicts: findType2Conflicts,
- addConflict: addConflict,
- hasConflict: hasConflict,
- verticalAlignment: verticalAlignment,
- horizontalCompaction: horizontalCompaction,
- alignCoordinates: alignCoordinates,
- findSmallestWidthAlignment: findSmallestWidthAlignment,
- balance: balance
-};
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = Symbol ? Symbol.prototype : undefined,
+ symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
-/*
- * Marks all edges in the graph with a type-1 conflict with the "type1Conflict"
- * property. A type-1 conflict is one where a non-inner segment crosses an
- * inner segment. An inner segment is an edge with both incident nodes marked
- * with the "dummy" property.
+/**
+ * A specialized version of `baseIsEqualDeep` for comparing objects of
+ * the same `toStringTag`.
*
- * This algorithm scans layer by layer, starting with the second, for type-1
- * conflicts between the current layer and the previous layer. For each layer
- * it scans the nodes from left to right until it reaches one that is incident
- * on an inner segment. It then scans predecessors to determine if they have
- * edges that cross that inner segment. At the end a final scan is done for all
- * nodes on the current rank to see if they cross the last visited inner
- * segment.
+ * **Note:** This function only supports comparing values with tags of
+ * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
*
- * This algorithm (safely) assumes that a dummy node will only be incident on a
- * single node in the layers being scanned.
+ * @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 findType1Conflicts(g, layering) {
- var conflicts = {};
-
- function visitLayer(prevLayer, layer) {
- var
- // last visited node in the previous layer that is incident on an inner
- // segment.
- k0 = 0,
- // Tracks the last node in this layer scanned for crossings with a type-1
- // segment.
- scanPos = 0,
- prevLayerLength = prevLayer.length,
- lastNode = _.last(layer);
-
- _.forEach(layer, function(v, i) {
- var w = findOtherInnerSegmentNode(g, v),
- k1 = w ? g.node(w).order : prevLayerLength;
-
- if (w || v === lastNode) {
- _.forEach(layer.slice(scanPos, i +1), function(scanNode) {
- _.forEach(g.predecessors(scanNode), function(u) {
- var uLabel = g.node(u),
- uPos = uLabel.order;
- if ((uPos < k0 || k1 < uPos) &&
- !(uLabel.dummy && g.node(scanNode).dummy)) {
- addConflict(conflicts, u, scanNode);
- }
- });
- });
- scanPos = i + 1;
- k0 = k1;
+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;
- return layer;
- }
+ case arrayBufferTag:
+ if ((object.byteLength != other.byteLength) ||
+ !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
+ return false;
+ }
+ return true;
- _.reduce(layering, visitLayer);
- return conflicts;
-}
+ 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);
-function findType2Conflicts(g, layering) {
- var conflicts = {};
+ case errorTag:
+ return object.name == other.name && object.message == other.message;
- function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
- var v;
- _.forEach(_.range(southPos, southEnd), function(i) {
- v = south[i];
- if (g.node(v).dummy) {
- _.forEach(g.predecessors(v), function(u) {
- var uNode = g.node(u);
- if (uNode.dummy &&
- (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {
- addConflict(conflicts, u, v);
- }
- });
- }
- });
- }
+ 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;
- function visitLayer(north, south) {
- var prevNorthPos = -1,
- nextNorthPos,
- southPos = 0;
+ case setTag:
+ var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
+ convert || (convert = setToArray);
- _.forEach(south, function(v, southLookahead) {
- if (g.node(v).dummy === "border") {
- var predecessors = g.predecessors(v);
- if (predecessors.length) {
- nextNorthPos = g.node(predecessors[0]).order;
- scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);
- southPos = southLookahead;
- prevNorthPos = nextNorthPos;
- }
+ if (object.size != other.size && !isPartial) {
+ return false;
}
- scan(south, southPos, south.length, nextNorthPos, north.length);
- });
-
- return south;
- }
+ // Assume cyclic values are equal.
+ var stacked = stack.get(object);
+ if (stacked) {
+ return stacked == other;
+ }
+ bitmask |= COMPARE_UNORDERED_FLAG;
- _.reduce(layering, visitLayer);
- return conflicts;
-}
+ // 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;
-function findOtherInnerSegmentNode(g, v) {
- if (g.node(v).dummy) {
- return _.find(g.predecessors(v), function(u) {
- return g.node(u).dummy;
- });
+ case symbolTag:
+ if (symbolValueOf) {
+ return symbolValueOf.call(object) == symbolValueOf.call(other);
+ }
}
+ return false;
}
-function addConflict(conflicts, v, w) {
- if (v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
+module.exports = equalByTag;
- var conflictsV = conflicts[v];
- if (!conflictsV) {
- conflicts[v] = conflictsV = {};
- }
- conflictsV[w] = true;
-}
-function hasConflict(conflicts, v, w) {
- if (v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- return _.has(conflicts[v], w);
-}
+/***/ }),
-/*
- * Try to align nodes into vertical "blocks" where possible. This algorithm
- * attempts to align a node with one of its median neighbors. If the edge
- * connecting a neighbor is a type-1 conflict then we ignore that possibility.
- * If a previous node has already formed a block with a node after the node
- * we're trying to form a block with, we also ignore that possibility - our
- * blocks would be split in that scenario.
- */
-function verticalAlignment(g, layering, conflicts, neighborFn) {
- var root = {},
- align = {},
- pos = {};
+/***/ "./node_modules/lodash/_equalObjects.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_equalObjects.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // We cache the position here based on the layering because the graph and
- // layering may be out of sync. The layering matrix is manipulated to
- // generate different extreme alignments.
- _.forEach(layering, function(layer) {
- _.forEach(layer, function(v, order) {
- root[v] = v;
- align[v] = v;
- pos[v] = order;
- });
- });
+var getAllKeys = __webpack_require__(/*! ./_getAllKeys */ "./node_modules/lodash/_getAllKeys.js");
- _.forEach(layering, function(layer) {
- var prevIdx = -1;
- _.forEach(layer, function(v) {
- var ws = neighborFn(v);
- if (ws.length) {
- ws = _.sortBy(ws, function(w) { return pos[w]; });
- var mp = (ws.length - 1) / 2;
- for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
- var w = ws[i];
- if (align[v] === v &&
- prevIdx < pos[w] &&
- !hasConflict(conflicts, v, w)) {
- align[w] = v;
- align[v] = root[v] = root[w];
- prevIdx = pos[w];
- }
- }
- }
- });
- });
+/** Used to compose bitmasks for value comparisons. */
+var COMPARE_PARTIAL_FLAG = 1;
- return { root: root, align: align };
-}
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
-function horizontalCompaction(g, layering, root, align, reverseSep) {
- // This portion of the algorithm differs from BK due to a number of problems.
- // Instead of their algorithm we construct a new block graph and do two
- // sweeps. The first sweep places blocks with the smallest possible
- // coordinates. The second sweep removes unused space by moving blocks to the
- // greatest coordinates without violating separation.
- var xs = {},
- blockG = buildBlockGraph(g, layering, root, reverseSep),
- borderType = reverseSep ? "borderLeft" : "borderRight";
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
- function iterate(setXsFunc, nextNodesFunc) {
- var stack = blockG.nodes();
- var elem = stack.pop();
- var visited = {};
- while (elem) {
- if (visited[elem]) {
- setXsFunc(elem);
- } else {
- visited[elem] = true;
- stack.push(elem);
- stack = stack.concat(nextNodesFunc(elem));
- }
+/**
+ * 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;
- elem = stack.pop();
+ 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;
}
}
-
- // First pass, assign smallest coordinates
- function pass1(elem) {
- xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {
- return Math.max(acc, xs[e.v] + blockG.edge(e));
- }, 0);
+ // Check that cyclic values are equal.
+ var objStacked = stack.get(object);
+ var othStacked = stack.get(other);
+ if (objStacked && othStacked) {
+ return objStacked == other && othStacked == object;
}
+ var result = true;
+ stack.set(object, other);
+ stack.set(other, object);
- // Second pass, assign greatest coordinates
- function pass2(elem) {
- var min = blockG.outEdges(elem).reduce(function(acc, e) {
- return Math.min(acc, xs[e.w] - blockG.edge(e));
- }, Number.POSITIVE_INFINITY);
+ var skipCtor = isPartial;
+ while (++index < objLength) {
+ key = objProps[index];
+ var objValue = object[key],
+ othValue = other[key];
- var node = g.node(elem);
- if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {
- xs[elem] = Math.max(xs[elem], min);
+ if (customizer) {
+ var compared = isPartial
+ ? customizer(othValue, objValue, key, other, object, stack)
+ : customizer(objValue, othValue, key, object, other, stack);
}
- }
-
- iterate(pass1, blockG.predecessors.bind(blockG));
- iterate(pass2, blockG.successors.bind(blockG));
-
- // Assign x coordinates to all nodes
- _.forEach(align, function(v) {
- xs[v] = xs[root[v]];
- });
-
- return xs;
-}
-
-
-function buildBlockGraph(g, layering, root, reverseSep) {
- var blockGraph = new Graph(),
- graphLabel = g.graph(),
- sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);
-
- _.forEach(layering, function(layer) {
- var u;
- _.forEach(layer, function(v) {
- var vRoot = root[v];
- blockGraph.setNode(vRoot);
- if (u) {
- var uRoot = root[u],
- prevMax = blockGraph.edge(uRoot, vRoot);
- blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));
- }
- u = v;
- });
- });
-
- return blockGraph;
-}
-
-/*
- * Returns the alignment that has the smallest width of the given alignments.
- */
-function findSmallestWidthAlignment(g, xss) {
- return _.minBy(_.values(xss), function (xs) {
- var max = Number.NEGATIVE_INFINITY;
- var min = Number.POSITIVE_INFINITY;
-
- _.forIn(xs, function (x, v) {
- var halfWidth = width(g, v) / 2;
-
- max = Math.max(x + halfWidth, max);
- min = Math.min(x - halfWidth, min);
- });
-
- return max - min;
- });
-}
-
-/*
- * Align the coordinates of each of the layout alignments such that
- * left-biased alignments have their minimum coordinate at the same point as
- * the minimum coordinate of the smallest width alignment and right-biased
- * alignments have their maximum coordinate at the same point as the maximum
- * coordinate of the smallest width alignment.
- */
-function alignCoordinates(xss, alignTo) {
- var alignToVals = _.values(alignTo),
- alignToMin = _.min(alignToVals),
- alignToMax = _.max(alignToVals);
-
- _.forEach(["u", "d"], function(vert) {
- _.forEach(["l", "r"], function(horiz) {
- var alignment = vert + horiz,
- xs = xss[alignment],
- delta;
- if (xs === alignTo) return;
-
- var xsVals = _.values(xs);
- delta = horiz === "l" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);
-
- if (delta) {
- xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });
- }
- });
- });
-}
-
-function balance(xss, align) {
- return _.mapValues(xss.ul, function(ignore, v) {
- if (align) {
- return xss[align.toLowerCase()][v];
- } else {
- var xs = _.sortBy(_.map(xss, v));
- return (xs[1] + xs[2]) / 2;
+ // Recursively compare objects (susceptible to call stack limits).
+ if (!(compared === undefined
+ ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
+ : compared
+ )) {
+ result = false;
+ break;
}
- });
-}
-
-function positionX(g) {
- var layering = util.buildLayerMatrix(g);
- var conflicts = _.merge(
- findType1Conflicts(g, layering),
- findType2Conflicts(g, layering));
-
- var xss = {};
- var adjustedLayering;
- _.forEach(["u", "d"], function(vert) {
- adjustedLayering = vert === "u" ? layering : _.values(layering).reverse();
- _.forEach(["l", "r"], function(horiz) {
- if (horiz === "r") {
- adjustedLayering = _.map(adjustedLayering, function(inner) {
- return _.values(inner).reverse();
- });
- }
-
- var neighborFn = (vert === "u" ? g.predecessors : g.successors).bind(g);
- var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
- var xs = horizontalCompaction(g, adjustedLayering,
- align.root, align.align, horiz === "r");
- if (horiz === "r") {
- xs = _.mapValues(xs, function(x) { return -x; });
- }
- xss[vert + horiz] = xs;
- });
- });
+ skipCtor || (skipCtor = key == 'constructor');
+ }
+ if (result && !skipCtor) {
+ var objCtor = object.constructor,
+ othCtor = other.constructor;
- var smallestWidth = findSmallestWidthAlignment(g, xss);
- alignCoordinates(xss, smallestWidth);
- return balance(xss, g.graph().align);
+ // 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;
}
-function sep(nodeSep, edgeSep, reverseSep) {
- return function(g, v, w) {
- var vLabel = g.node(v);
- var wLabel = g.node(w);
- var sum = 0;
- var delta;
+module.exports = equalObjects;
- sum += vLabel.width / 2;
- if (_.has(vLabel, "labelpos")) {
- switch (vLabel.labelpos.toLowerCase()) {
- case "l": delta = -vLabel.width / 2; break;
- case "r": delta = vLabel.width / 2; break;
- }
- }
- if (delta) {
- sum += reverseSep ? delta : -delta;
- }
- delta = 0;
- sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;
- sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;
+/***/ }),
- sum += wLabel.width / 2;
- if (_.has(wLabel, "labelpos")) {
- switch (wLabel.labelpos.toLowerCase()) {
- case "l": delta = wLabel.width / 2; break;
- case "r": delta = -wLabel.width / 2; break;
- }
- }
- if (delta) {
- sum += reverseSep ? delta : -delta;
- }
- delta = 0;
+/***/ "./node_modules/lodash/_flatRest.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_flatRest.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- return sum;
- };
-}
+var flatten = __webpack_require__(/*! ./flatten */ "./node_modules/lodash/flatten.js"),
+ overRest = __webpack_require__(/*! ./_overRest */ "./node_modules/lodash/_overRest.js"),
+ setToString = __webpack_require__(/*! ./_setToString */ "./node_modules/lodash/_setToString.js");
-function width(g, v) {
- return g.node(v).width;
+/**
+ * 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 + '');
}
+module.exports = flatRest;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/position/index.js":
-/*!**************************************************!*\
- !*** ./node_modules/dagre/lib/position/index.js ***!
- \**************************************************/
+/***/ "./node_modules/lodash/_freeGlobal.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_freeGlobal.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+/** Detect free variable `global` from Node.js. */
+var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g && __webpack_require__.g.Object === Object && __webpack_require__.g;
+module.exports = freeGlobal;
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var util = __webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js");
-var positionX = (__webpack_require__(/*! ./bk */ "./node_modules/dagre/lib/position/bk.js").positionX);
-module.exports = position;
+/***/ }),
-function position(g) {
- g = util.asNonCompoundGraph(g);
+/***/ "./node_modules/lodash/_getAllKeys.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_getAllKeys.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- positionY(g);
- _.forEach(positionX(g), function(x, v) {
- g.node(v).x = x;
- });
-}
+var baseGetAllKeys = __webpack_require__(/*! ./_baseGetAllKeys */ "./node_modules/lodash/_baseGetAllKeys.js"),
+ getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
-function positionY(g) {
- var layering = util.buildLayerMatrix(g);
- var rankSep = g.graph().ranksep;
- var prevY = 0;
- _.forEach(layering, function(layer) {
- var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));
- _.forEach(layer, function(v) {
- g.node(v).y = prevY + maxHeight / 2;
- });
- prevY += maxHeight + rankSep;
- });
+/**
+ * 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);
}
+module.exports = getAllKeys;
/***/ }),
-/***/ "./node_modules/dagre/lib/rank/feasible-tree.js":
-/*!******************************************************!*\
- !*** ./node_modules/dagre/lib/rank/feasible-tree.js ***!
- \******************************************************/
+/***/ "./node_modules/lodash/_getAllKeysIn.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_getAllKeysIn.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var Graph = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-var slack = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").slack);
-
-module.exports = feasibleTree;
+var baseGetAllKeys = __webpack_require__(/*! ./_baseGetAllKeys */ "./node_modules/lodash/_baseGetAllKeys.js"),
+ getSymbolsIn = __webpack_require__(/*! ./_getSymbolsIn */ "./node_modules/lodash/_getSymbolsIn.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
-/*
- * Constructs a spanning tree with tight edges and adjusted the input node's
- * ranks to achieve this. A tight edge is one that is has a length that matches
- * its "minlen" attribute.
- *
- * The basic structure for this function is derived from Gansner, et al., "A
- * Technique for Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- * 1. Graph must be a DAG.
- * 2. Graph must be connected.
- * 3. Graph must have at least one node.
- * 5. Graph nodes must have been previously assigned a "rank" property that
- * respects the "minlen" property of incident edges.
- * 6. Graph edges must have a "minlen" property.
- *
- * Post-conditions:
- *
- * - Graph nodes will have their rank adjusted to ensure that all edges are
- * tight.
+/**
+ * Creates an array of own and inherited enumerable property names and
+ * symbols of `object`.
*
- * Returns a tree (undirected graph) that is constructed using only "tight"
- * edges.
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names and symbols.
*/
-function feasibleTree(g) {
- var t = new Graph({ directed: false });
+function getAllKeysIn(object) {
+ return baseGetAllKeys(object, keysIn, getSymbolsIn);
+}
- // Choose arbitrary node from which to start our tree
- var start = g.nodes()[0];
- var size = g.nodeCount();
- t.setNode(start, {});
+module.exports = getAllKeysIn;
- var edge, delta;
- while (tightTree(t, g) < size) {
- edge = findMinSlackEdge(t, g);
- delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);
- shiftRanks(t, g, delta);
- }
- return t;
-}
+/***/ }),
-/*
- * Finds a maximal tree of tight edges and returns the number of nodes in the
- * tree.
- */
-function tightTree(t, g) {
- function dfs(v) {
- _.forEach(g.nodeEdges(v), function(e) {
- var edgeV = e.v,
- w = (v === edgeV) ? e.w : edgeV;
- if (!t.hasNode(w) && !slack(g, e)) {
- t.setNode(w, {});
- t.setEdge(v, w, {});
- dfs(w);
- }
- });
- }
+/***/ "./node_modules/lodash/_getMapData.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_getMapData.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- _.forEach(t.nodes(), dfs);
- return t.nodeCount();
-}
+var isKeyable = __webpack_require__(/*! ./_isKeyable */ "./node_modules/lodash/_isKeyable.js");
-/*
- * Finds the edge with the smallest slack that is incident on tree and returns
- * it.
+/**
+ * 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 findMinSlackEdge(t, g) {
- return _.minBy(g.edges(), function(e) {
- if (t.hasNode(e.v) !== t.hasNode(e.w)) {
- return slack(g, e);
- }
- });
+function getMapData(map, key) {
+ var data = map.__data__;
+ return isKeyable(key)
+ ? data[typeof key == 'string' ? 'string' : 'hash']
+ : data.map;
}
-function shiftRanks(t, g, delta) {
- _.forEach(t.nodes(), function(v) {
- g.node(v).rank += delta;
- });
-}
+module.exports = getMapData;
/***/ }),
-/***/ "./node_modules/dagre/lib/rank/index.js":
+/***/ "./node_modules/lodash/_getMatchData.js":
/*!**********************************************!*\
- !*** ./node_modules/dagre/lib/rank/index.js ***!
+ !*** ./node_modules/lodash/_getMatchData.js ***!
\**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var rankUtil = __webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js");
-var longestPath = rankUtil.longestPath;
-var feasibleTree = __webpack_require__(/*! ./feasible-tree */ "./node_modules/dagre/lib/rank/feasible-tree.js");
-var networkSimplex = __webpack_require__(/*! ./network-simplex */ "./node_modules/dagre/lib/rank/network-simplex.js");
-
-module.exports = rank;
+var isStrictComparable = __webpack_require__(/*! ./_isStrictComparable */ "./node_modules/lodash/_isStrictComparable.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
-/*
- * Assigns a rank to each node in the input graph that respects the "minlen"
- * constraint specified on edges between nodes.
- *
- * This basic structure is derived from Gansner, et al., "A Technique for
- * Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- * 1. Graph must be a connected DAG
- * 2. Graph nodes must be objects
- * 3. Graph edges must have "weight" and "minlen" attributes
- *
- * Post-conditions:
+/**
+ * Gets the property names, values, and compare flags of `object`.
*
- * 1. Graph nodes will have a "rank" attribute based on the results of the
- * algorithm. Ranks can start at any index (including negative), we'll
- * fix them up later.
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the match data of `object`.
*/
-function rank(g) {
- switch(g.graph().ranker) {
- case "network-simplex": networkSimplexRanker(g); break;
- case "tight-tree": tightTreeRanker(g); break;
- case "longest-path": longestPathRanker(g); break;
- default: networkSimplexRanker(g);
- }
-}
+function getMatchData(object) {
+ var result = keys(object),
+ length = result.length;
-// A fast and simple ranker, but results are far from optimal.
-var longestPathRanker = longestPath;
+ while (length--) {
+ var key = result[length],
+ value = object[key];
-function tightTreeRanker(g) {
- longestPath(g);
- feasibleTree(g);
+ result[length] = [key, value, isStrictComparable(value)];
+ }
+ return result;
}
-function networkSimplexRanker(g) {
- networkSimplex(g);
-}
+module.exports = getMatchData;
/***/ }),
-/***/ "./node_modules/dagre/lib/rank/network-simplex.js":
-/*!********************************************************!*\
- !*** ./node_modules/dagre/lib/rank/network-simplex.js ***!
- \********************************************************/
+/***/ "./node_modules/lodash/_getNative.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_getNative.js ***!
+ \*******************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var baseIsNative = __webpack_require__(/*! ./_baseIsNative */ "./node_modules/lodash/_baseIsNative.js"),
+ getValue = __webpack_require__(/*! ./_getValue */ "./node_modules/lodash/_getValue.js");
+/**
+ * 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;
+}
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
-var feasibleTree = __webpack_require__(/*! ./feasible-tree */ "./node_modules/dagre/lib/rank/feasible-tree.js");
-var slack = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").slack);
-var initRank = (__webpack_require__(/*! ./util */ "./node_modules/dagre/lib/rank/util.js").longestPath);
-var preorder = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").alg).preorder;
-var postorder = (__webpack_require__(/*! ../graphlib */ "./node_modules/dagre/lib/graphlib.js").alg).postorder;
-var simplify = (__webpack_require__(/*! ../util */ "./node_modules/dagre/lib/util.js").simplify);
+module.exports = getNative;
-module.exports = networkSimplex;
-// Expose some internals for testing purposes
-networkSimplex.initLowLimValues = initLowLimValues;
-networkSimplex.initCutValues = initCutValues;
-networkSimplex.calcCutValue = calcCutValue;
-networkSimplex.leaveEdge = leaveEdge;
-networkSimplex.enterEdge = enterEdge;
-networkSimplex.exchangeEdges = exchangeEdges;
+/***/ }),
-/*
- * The network simplex algorithm assigns ranks to each node in the input graph
- * and iteratively improves the ranking to reduce the length of edges.
- *
- * Preconditions:
- *
- * 1. The input graph must be a DAG.
- * 2. All nodes in the graph must have an object value.
- * 3. All edges in the graph must have "minlen" and "weight" attributes.
- *
- * Postconditions:
- *
- * 1. All nodes in the graph will have an assigned "rank" attribute that has
- * been optimized by the network simplex algorithm. Ranks start at 0.
- *
- *
- * A rough sketch of the algorithm is as follows:
- *
- * 1. Assign initial ranks to each node. We use the longest path algorithm,
- * which assigns ranks to the lowest position possible. In general this
- * leads to very wide bottom ranks and unnecessarily long edges.
- * 2. Construct a feasible tight tree. A tight tree is one such that all
- * edges in the tree have no slack (difference between length of edge
- * and minlen for the edge). This by itself greatly improves the assigned
- * rankings by shorting edges.
- * 3. Iteratively find edges that have negative cut values. Generally a
- * negative cut value indicates that the edge could be removed and a new
- * tree edge could be added to produce a more compact graph.
- *
- * Much of the algorithms here are derived from Gansner, et al., "A Technique
- * for Drawing Directed Graphs." The structure of the file roughly follows the
- * structure of the overall algorithm.
- */
-function networkSimplex(g) {
- g = simplify(g);
- initRank(g);
- var t = feasibleTree(g);
- initLowLimValues(t);
- initCutValues(t, g);
+/***/ "./node_modules/lodash/_getPrototype.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_getPrototype.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var e, f;
- while ((e = leaveEdge(t))) {
- f = enterEdge(t, g, e);
- exchangeEdges(t, g, e, f);
- }
-}
+var overArg = __webpack_require__(/*! ./_overArg */ "./node_modules/lodash/_overArg.js");
-/*
- * Initializes cut values for all edges in the tree.
- */
-function initCutValues(t, g) {
- var vs = postorder(t, t.nodes());
- vs = vs.slice(0, vs.length - 1);
- _.forEach(vs, function(v) {
- assignCutValue(t, g, v);
- });
-}
+/** Built-in value references. */
+var getPrototype = overArg(Object.getPrototypeOf, Object);
-function assignCutValue(t, g, child) {
- var childLab = t.node(child);
- var parent = childLab.parent;
- t.edge(child, parent).cutvalue = calcCutValue(t, g, child);
-}
+module.exports = getPrototype;
-/*
- * Given the tight tree, its graph, and a child in the graph calculate and
- * return the cut value for the edge between the child and its parent.
- */
-function calcCutValue(t, g, child) {
- var childLab = t.node(child);
- var parent = childLab.parent;
- // True if the child is on the tail end of the edge in the directed graph
- var childIsTail = true;
- // The graph's view of the tree edge we're inspecting
- var graphEdge = g.edge(child, parent);
- // The accumulated cut value for the edge between this node and its parent
- var cutValue = 0;
- if (!graphEdge) {
- childIsTail = false;
- graphEdge = g.edge(parent, child);
- }
+/***/ }),
- cutValue = graphEdge.weight;
+/***/ "./node_modules/lodash/_getRawTag.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_getRawTag.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- _.forEach(g.nodeEdges(child), function(e) {
- var isOutEdge = e.v === child,
- other = isOutEdge ? e.w : e.v;
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js");
- if (other !== parent) {
- var pointsToHead = isOutEdge === childIsTail,
- otherWeight = g.edge(e).weight;
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
- cutValue += pointsToHead ? otherWeight : -otherWeight;
- if (isTreeEdge(t, child, other)) {
- var otherCutValue = t.edge(child, other).cutvalue;
- cutValue += pointsToHead ? -otherCutValue : otherCutValue;
- }
- }
- });
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
- return cutValue;
-}
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var nativeObjectToString = objectProto.toString;
-function initLowLimValues(tree, root) {
- if (arguments.length < 2) {
- root = tree.nodes()[0];
- }
- dfsAssignLowLim(tree, {}, 1, root);
-}
+/** Built-in value references. */
+var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
-function dfsAssignLowLim(tree, visited, nextLim, v, parent) {
- var low = nextLim;
- var label = tree.node(v);
+/**
+ * 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];
- visited[v] = true;
- _.forEach(tree.neighbors(v), function(w) {
- if (!_.has(visited, w)) {
- nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);
- }
- });
+ try {
+ value[symToStringTag] = undefined;
+ var unmasked = true;
+ } catch (e) {}
- label.low = low;
- label.lim = nextLim++;
- if (parent) {
- label.parent = parent;
- } else {
- // TODO should be able to remove this when we incrementally update low lim
- delete label.parent;
+ var result = nativeObjectToString.call(value);
+ if (unmasked) {
+ if (isOwn) {
+ value[symToStringTag] = tag;
+ } else {
+ delete value[symToStringTag];
+ }
}
-
- return nextLim;
+ return result;
}
-function leaveEdge(tree) {
- return _.find(tree.edges(), function(e) {
- return tree.edge(e).cutvalue < 0;
- });
-}
+module.exports = getRawTag;
-function enterEdge(t, g, edge) {
- var v = edge.v;
- var w = edge.w;
- // For the rest of this function we assume that v is the tail and w is the
- // head, so if we don't have this edge in the graph we should flip it to
- // match the correct orientation.
- if (!g.hasEdge(v, w)) {
- v = edge.w;
- w = edge.v;
- }
+/***/ }),
- var vLabel = t.node(v);
- var wLabel = t.node(w);
- var tailLabel = vLabel;
- var flip = false;
+/***/ "./node_modules/lodash/_getSymbols.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_getSymbols.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // If the root is in the tail of the edge then we need to flip the logic that
- // checks for the head and tail nodes in the candidates function below.
- if (vLabel.lim > wLabel.lim) {
- tailLabel = wLabel;
- flip = true;
- }
+var arrayFilter = __webpack_require__(/*! ./_arrayFilter */ "./node_modules/lodash/_arrayFilter.js"),
+ stubArray = __webpack_require__(/*! ./stubArray */ "./node_modules/lodash/stubArray.js");
- var candidates = _.filter(g.edges(), function(edge) {
- return flip === isDescendant(t, t.node(edge.v), tailLabel) &&
- flip !== isDescendant(t, t.node(edge.w), tailLabel);
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Built-in value references. */
+var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeGetSymbols = Object.getOwnPropertySymbols;
+
+/**
+ * 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);
});
+};
- return _.minBy(candidates, function(edge) { return slack(g, edge); });
-}
+module.exports = getSymbols;
-function exchangeEdges(t, g, e, f) {
- var v = e.v;
- var w = e.w;
- t.removeEdge(v, w);
- t.setEdge(f.v, f.w, {});
- initLowLimValues(t);
- initCutValues(t, g);
- updateRanks(t, g);
-}
-function updateRanks(t, g) {
- var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });
- var vs = preorder(t, root);
- vs = vs.slice(1);
- _.forEach(vs, function(v) {
- var parent = t.node(v).parent,
- edge = g.edge(v, parent),
- flipped = false;
+/***/ }),
- if (!edge) {
- edge = g.edge(parent, v);
- flipped = true;
- }
+/***/ "./node_modules/lodash/_getSymbolsIn.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_getSymbolsIn.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);
- });
-}
+var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
+ getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
+ getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js"),
+ stubArray = __webpack_require__(/*! ./stubArray */ "./node_modules/lodash/stubArray.js");
-/*
- * Returns true if the edge is in the tree.
- */
-function isTreeEdge(tree, u, v) {
- return tree.hasEdge(u, v);
-}
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeGetSymbols = Object.getOwnPropertySymbols;
-/*
- * Returns true if the specified node is descendant of the root node per the
- * assigned low and lim attributes in the tree.
+/**
+ * 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.
*/
-function isDescendant(tree, vLabel, rootLabel) {
- return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;
-}
+var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
+ var result = [];
+ while (object) {
+ arrayPush(result, getSymbols(object));
+ object = getPrototype(object);
+ }
+ return result;
+};
+
+module.exports = getSymbolsIn;
/***/ }),
-/***/ "./node_modules/dagre/lib/rank/util.js":
-/*!*********************************************!*\
- !*** ./node_modules/dagre/lib/rank/util.js ***!
- \*********************************************/
+/***/ "./node_modules/lodash/_getTag.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/_getTag.js ***!
+ \****************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var DataView = __webpack_require__(/*! ./_DataView */ "./node_modules/lodash/_DataView.js"),
+ Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js"),
+ Promise = __webpack_require__(/*! ./_Promise */ "./node_modules/lodash/_Promise.js"),
+ Set = __webpack_require__(/*! ./_Set */ "./node_modules/lodash/_Set.js"),
+ WeakMap = __webpack_require__(/*! ./_WeakMap */ "./node_modules/lodash/_WeakMap.js"),
+ baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ toSource = __webpack_require__(/*! ./_toSource */ "./node_modules/lodash/_toSource.js");
+/** `Object#toString` result references. */
+var mapTag = '[object Map]',
+ objectTag = '[object Object]',
+ promiseTag = '[object Promise]',
+ setTag = '[object Set]',
+ weakMapTag = '[object WeakMap]';
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/dagre/lib/lodash.js");
+var dataViewTag = '[object DataView]';
-module.exports = {
- longestPath: longestPath,
- slack: slack
-};
+/** Used to detect maps, sets, and weakmaps. */
+var dataViewCtorString = toSource(DataView),
+ mapCtorString = toSource(Map),
+ promiseCtorString = toSource(Promise),
+ setCtorString = toSource(Set),
+ weakMapCtorString = toSource(WeakMap);
-/*
- * Initializes ranks for the input graph using the longest path algorithm. This
- * algorithm scales well and is fast in practice, it yields rather poor
- * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom
- * ranks wide and leaving edges longer than necessary. However, due to its
- * speed, this algorithm is good for getting an initial ranking that can be fed
- * into other algorithms.
- *
- * This algorithm does not normalize layers because it will be used by other
- * algorithms in most cases. If using this algorithm directly, be sure to
- * run normalize at the end.
- *
- * Pre-conditions:
- *
- * 1. Input graph is a DAG.
- * 2. Input graph node labels can be assigned properties.
- *
- * Post-conditions:
+/**
+ * Gets the `toStringTag` of `value`.
*
- * 1. Each node will be assign an (unnormalized) "rank" property.
+ * @private
+ * @param {*} value The value to query.
+ * @returns {string} Returns the `toStringTag`.
*/
-function longestPath(g) {
- var visited = {};
+var getTag = baseGetTag;
- function dfs(v) {
- var label = g.node(v);
- if (_.has(visited, v)) {
- return label.rank;
+// 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;
+ }
}
- visited[v] = true;
+ return result;
+ };
+}
- var rank = _.min(_.map(g.outEdges(v), function(e) {
- return dfs(e.w) - g.edge(e).minlen;
- }));
+module.exports = getTag;
- if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3
- rank === undefined || // return value of _.map([]) for Lodash 4
- rank === null) { // return value of _.map([null])
- rank = 0;
- }
- return (label.rank = rank);
- }
+/***/ }),
- _.forEach(g.sources(), dfs);
-}
+/***/ "./node_modules/lodash/_getValue.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_getValue.js ***!
+ \******************************************/
+/***/ (function(module) {
-/*
- * Returns the amount of slack for the given edge. The slack is defined as the
- * difference between the length of the edge and its minimum length.
+/**
+ * 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 slack(g, e) {
- return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;
+function getValue(object, key) {
+ return object == null ? undefined : object[key];
}
+module.exports = getValue;
+
/***/ }),
-/***/ "./node_modules/dagre/lib/util.js":
-/*!****************************************!*\
- !*** ./node_modules/dagre/lib/util.js ***!
- \****************************************/
+/***/ "./node_modules/lodash/_hasPath.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_hasPath.js ***!
+ \*****************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-/* eslint "no-console": off */
-
-
-
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/dagre/lib/lodash.js");
-var Graph = (__webpack_require__(/*! ./graphlib */ "./node_modules/dagre/lib/graphlib.js").Graph);
-
-module.exports = {
- addDummyNode: addDummyNode,
- simplify: simplify,
- asNonCompoundGraph: asNonCompoundGraph,
- successorWeights: successorWeights,
- predecessorWeights: predecessorWeights,
- intersectRect: intersectRect,
- buildLayerMatrix: buildLayerMatrix,
- normalizeRanks: normalizeRanks,
- removeEmptyRanks: removeEmptyRanks,
- addBorderNode: addBorderNode,
- maxRank: maxRank,
- partition: partition,
- time: time,
- notime: notime
-};
+var castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
+ isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
+ isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js"),
+ toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
-/*
- * Adds a dummy node to the graph and return v.
+/**
+ * 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 addDummyNode(g, type, attrs, name) {
- var v;
- do {
- v = _.uniqueId(name);
- } while (g.hasNode(v));
-
- attrs.dummy = type;
- g.setNode(v, attrs);
- return v;
-}
+function hasPath(object, path, hasFunc) {
+ path = castPath(path, object);
-/*
- * Returns a new graph with only simple edges. Handles aggregation of data
- * associated with multi-edges.
- */
-function simplify(g) {
- var simplified = new Graph().setGraph(g.graph());
- _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });
- _.forEach(g.edges(), function(e) {
- var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };
- var label = g.edge(e);
- simplified.setEdge(e.v, e.w, {
- weight: simpleLabel.weight + label.weight,
- minlen: Math.max(simpleLabel.minlen, label.minlen)
- });
- });
- return simplified;
-}
+ var index = -1,
+ length = path.length,
+ result = false;
-function asNonCompoundGraph(g) {
- var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());
- _.forEach(g.nodes(), function(v) {
- if (!g.children(v).length) {
- simplified.setNode(v, g.node(v));
+ while (++index < length) {
+ var key = toKey(path[index]);
+ if (!(result = object != null && hasFunc(object, key))) {
+ break;
}
- });
- _.forEach(g.edges(), function(e) {
- simplified.setEdge(e, g.edge(e));
- });
- return simplified;
+ 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));
}
-function successorWeights(g) {
- var weightMap = _.map(g.nodes(), function(v) {
- var sucs = {};
- _.forEach(g.outEdges(v), function(e) {
- sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;
- });
- return sucs;
- });
- return _.zipObject(g.nodes(), weightMap);
-}
+module.exports = hasPath;
-function predecessorWeights(g) {
- var weightMap = _.map(g.nodes(), function(v) {
- var preds = {};
- _.forEach(g.inEdges(v), function(e) {
- preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;
- });
- return preds;
- });
- return _.zipObject(g.nodes(), weightMap);
-}
-/*
- * Finds where a line starting at point ({x, y}) would intersect a rectangle
- * ({x, y, width, height}) if it were pointing at the rectangle's center.
- */
-function intersectRect(rect, point) {
- var x = rect.x;
- var y = rect.y;
+/***/ }),
- // Rectangle intersection algorithm from:
- // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes
- var dx = point.x - x;
- var dy = point.y - y;
- var w = rect.width / 2;
- var h = rect.height / 2;
+/***/ "./node_modules/lodash/_hasUnicode.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_hasUnicode.js ***!
+ \********************************************/
+/***/ (function(module) {
- if (!dx && !dy) {
- throw new Error("Not possible to find intersection inside of the rectangle");
- }
+/** Used to compose unicode character classes. */
+var rsAstralRange = '\\ud800-\\udfff',
+ rsComboMarksRange = '\\u0300-\\u036f',
+ reComboHalfMarksRange = '\\ufe20-\\ufe2f',
+ rsComboSymbolsRange = '\\u20d0-\\u20ff',
+ rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
+ rsVarRange = '\\ufe0e\\ufe0f';
- var sx, sy;
- if (Math.abs(dy) * w > Math.abs(dx) * h) {
- // Intersection is top or bottom of rect.
- if (dy < 0) {
- h = -h;
- }
- sx = h * dx / dy;
- sy = h;
- } else {
- // Intersection is left or right of rect.
- if (dx < 0) {
- w = -w;
- }
- sx = w;
- sy = w * dy / dx;
- }
+/** Used to compose unicode capture groups. */
+var rsZWJ = '\\u200d';
- return { x: x + sx, y: y + sy };
-}
+/** 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 + ']');
-/*
- * Given a DAG with each node assigned "rank" and "order" properties, this
- * function will produce a matrix with the ids of each node.
+/**
+ * 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 buildLayerMatrix(g) {
- var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- var rank = node.rank;
- if (!_.isUndefined(rank)) {
- layering[rank][node.order] = v;
- }
- });
- return layering;
+function hasUnicode(string) {
+ return reHasUnicode.test(string);
}
-/*
- * Adjusts the ranks for all nodes in the graph such that all nodes v have
- * rank(v) >= 0 and at least one node w has rank(w) = 0.
- */
-function normalizeRanks(g) {
- var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));
- _.forEach(g.nodes(), function(v) {
- var node = g.node(v);
- if (_.has(node, "rank")) {
- node.rank -= min;
- }
- });
-}
+module.exports = hasUnicode;
-function removeEmptyRanks(g) {
- // Ranks may not start at 0, so we need to offset them
- var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));
- var layers = [];
- _.forEach(g.nodes(), function(v) {
- var rank = g.node(v).rank - offset;
- if (!layers[rank]) {
- layers[rank] = [];
- }
- layers[rank].push(v);
- });
+/***/ }),
- var delta = 0;
- var nodeRankFactor = g.graph().nodeRankFactor;
- _.forEach(layers, function(vs, i) {
- if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {
- --delta;
- } else if (delta) {
- _.forEach(vs, function(v) { g.node(v).rank += delta; });
- }
- });
-}
+/***/ "./node_modules/lodash/_hashClear.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_hashClear.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function addBorderNode(g, prefix, rank, order) {
- var node = {
- width: 0,
- height: 0
- };
- if (arguments.length >= 4) {
- node.rank = rank;
- node.order = order;
- }
- return addDummyNode(g, "border", node, prefix);
-}
+var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
-function maxRank(g) {
- return _.max(_.map(g.nodes(), function(v) {
- var rank = g.node(v).rank;
- if (!_.isUndefined(rank)) {
- return rank;
- }
- }));
+/**
+ * Removes all key-value entries from the hash.
+ *
+ * @private
+ * @name clear
+ * @memberOf Hash
+ */
+function hashClear() {
+ this.__data__ = nativeCreate ? nativeCreate(null) : {};
+ this.size = 0;
}
-/*
- * Partition a collection into two groups: `lhs` and `rhs`. If the supplied
- * function returns true for an entry it goes into `lhs`. Otherwise it goes
- * into `rhs.
+module.exports = hashClear;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_hashDelete.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_hashDelete.js ***!
+ \********************************************/
+/***/ (function(module) {
+
+/**
+ * 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 partition(collection, fn) {
- var result = { lhs: [], rhs: [] };
- _.forEach(collection, function(value) {
- if (fn(value)) {
- result.lhs.push(value);
- } else {
- result.rhs.push(value);
- }
- });
+function hashDelete(key) {
+ var result = this.has(key) && delete this.__data__[key];
+ this.size -= result ? 1 : 0;
return result;
}
-/*
- * Returns a new function that wraps `fn` with a timer. The wrapper logs the
- * time it takes to execute the function.
+module.exports = hashDelete;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_hashGet.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_hashGet.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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 time(name, fn) {
- var start = _.now();
- try {
- return fn();
- } finally {
- console.log(name + " time: " + (_.now() - start) + "ms");
+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;
}
-function notime(name, fn) {
- return fn();
-}
+module.exports = hashGet;
/***/ }),
-/***/ "./node_modules/dagre/lib/version.js":
-/*!*******************************************!*\
- !*** ./node_modules/dagre/lib/version.js ***!
- \*******************************************/
-/***/ (function(module) {
+/***/ "./node_modules/lodash/_hashHas.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_hashHas.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-module.exports = "0.8.5";
+var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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);
+}
+
+module.exports = hashHas;
/***/ }),
-/***/ "./node_modules/dependency-graph/lib/dep_graph.js":
-/*!********************************************************!*\
- !*** ./node_modules/dependency-graph/lib/dep_graph.js ***!
- \********************************************************/
-/***/ (function(__unused_webpack_module, exports) {
+/***/ "./node_modules/lodash/_hashSet.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_hashSet.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
/**
- * A simple dependency graph
+ * 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;
+}
+
+module.exports = hashSet;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_initCloneArray.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_initCloneArray.js ***!
+ \************************************************/
+/***/ (function(module) {
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * Helper for creating a Topological Sort using Depth-First-Search on a set of edges.
- *
- * Detects cycles and throws an Error if one is detected (unless the "circular"
- * parameter is "true" in which case it ignores them).
+ * Initializes an array clone.
*
- * @param edges The set of edges to DFS through
- * @param leavesOnly Whether to only return "leaf" nodes (ones who have no edges)
- * @param result An array in which the results will be populated
- * @param circular A boolean to allow circular dependencies
+ * @private
+ * @param {Array} array The array to clone.
+ * @returns {Array} Returns the initialized clone.
*/
-function createDFS(edges, leavesOnly, result, circular) {
- var visited = {};
- return function (start) {
- if (visited[start]) {
- return;
- }
- var inCurrentPath = {};
- var currentPath = [];
- var todo = []; // used as a stack
- todo.push({ node: start, processed: false });
- while (todo.length > 0) {
- var current = todo[todo.length - 1]; // peek at the todo stack
- var processed = current.processed;
- var node = current.node;
- if (!processed) {
- // Haven't visited edges yet (visiting phase)
- if (visited[node]) {
- todo.pop();
- continue;
- } else if (inCurrentPath[node]) {
- // It's not a DAG
- if (circular) {
- todo.pop();
- // If we're tolerating cycles, don't revisit the node
- continue;
- }
- currentPath.push(node);
- throw new DepGraphCycleError(currentPath);
- }
+function initCloneArray(array) {
+ var length = array.length,
+ result = new array.constructor(length);
- inCurrentPath[node] = true;
- currentPath.push(node);
- var nodeEdges = edges[node];
- // (push edges onto the todo stack in reverse order to be order-compatible with the old DFS implementation)
- for (var i = nodeEdges.length - 1; i >= 0; i--) {
- todo.push({ node: nodeEdges[i], processed: false });
- }
- current.processed = true;
- } else {
- // Have visited edges (stack unrolling phase)
- todo.pop();
- currentPath.pop();
- inCurrentPath[node] = false;
- visited[node] = true;
- if (!leavesOnly || edges[node].length === 0) {
- result.push(node);
- }
- }
- }
- };
+ // 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;
}
-/**
- * Simple Dependency Graph
- */
-var DepGraph = (exports.DepGraph = function DepGraph(opts) {
- this.nodes = {}; // Node -> Node/Data (treated like a Set)
- this.outgoingEdges = {}; // Node -> [Dependency Node]
- this.incomingEdges = {}; // Node -> [Dependant Node]
- this.circular = opts && !!opts.circular; // Allows circular deps
-});
-DepGraph.prototype = {
- /**
- * The number of nodes in the graph.
- */
- size: function () {
- return Object.keys(this.nodes).length;
- },
- /**
- * Add a node to the dependency graph. If a node already exists, this method will do nothing.
- */
- addNode: function (node, data) {
- if (!this.hasNode(node)) {
- // Checking the arguments length allows the user to add a node with undefined data
- if (arguments.length === 2) {
- this.nodes[node] = data;
- } else {
- this.nodes[node] = node;
- }
- this.outgoingEdges[node] = [];
- this.incomingEdges[node] = [];
- }
- },
- /**
- * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.
- */
- removeNode: function (node) {
- if (this.hasNode(node)) {
- delete this.nodes[node];
- delete this.outgoingEdges[node];
- delete this.incomingEdges[node];
- [this.incomingEdges, this.outgoingEdges].forEach(function (edgeList) {
- Object.keys(edgeList).forEach(function (key) {
- var idx = edgeList[key].indexOf(node);
- if (idx >= 0) {
- edgeList[key].splice(idx, 1);
- }
- }, this);
- });
- }
- },
- /**
- * Check if a node exists in the graph
- */
- hasNode: function (node) {
- return this.nodes.hasOwnProperty(node);
- },
- /**
- * Get the data associated with a node name
- */
- getNodeData: function (node) {
- if (this.hasNode(node)) {
- return this.nodes[node];
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * Set the associated data for a given node name. If the node does not exist, this method will throw an error
- */
- setNodeData: function (node, data) {
- if (this.hasNode(node)) {
- this.nodes[node] = data;
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * Add a dependency between two nodes. If either of the nodes does not exist,
- * an Error will be thrown.
- */
- addDependency: function (from, to) {
- if (!this.hasNode(from)) {
- throw new Error("Node does not exist: " + from);
- }
- if (!this.hasNode(to)) {
- throw new Error("Node does not exist: " + to);
- }
- if (this.outgoingEdges[from].indexOf(to) === -1) {
- this.outgoingEdges[from].push(to);
- }
- if (this.incomingEdges[to].indexOf(from) === -1) {
- this.incomingEdges[to].push(from);
- }
- return true;
- },
- /**
- * Remove a dependency between two nodes.
- */
- removeDependency: function (from, to) {
- var idx;
- if (this.hasNode(from)) {
- idx = this.outgoingEdges[from].indexOf(to);
- if (idx >= 0) {
- this.outgoingEdges[from].splice(idx, 1);
- }
- }
+module.exports = initCloneArray;
- if (this.hasNode(to)) {
- idx = this.incomingEdges[to].indexOf(from);
- if (idx >= 0) {
- this.incomingEdges[to].splice(idx, 1);
- }
- }
- },
- /**
- * Return a clone of the dependency graph. If any custom data is attached
- * to the nodes, it will only be shallow copied.
- */
- clone: function () {
- var source = this;
- var result = new DepGraph();
- var keys = Object.keys(source.nodes);
- keys.forEach(function (n) {
- result.nodes[n] = source.nodes[n];
- result.outgoingEdges[n] = source.outgoingEdges[n].slice(0);
- result.incomingEdges[n] = source.incomingEdges[n].slice(0);
- });
- return result;
- },
- /**
- * Get an array containing the direct dependencies of the specified node.
- *
- * Throws an Error if the specified node does not exist.
- */
- directDependenciesOf: function (node) {
- if (this.hasNode(node)) {
- return this.outgoingEdges[node].slice(0);
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * Get an array containing the nodes that directly depend on the specified node.
- *
- * Throws an Error if the specified node does not exist.
- */
- directDependantsOf: function (node) {
- if (this.hasNode(node)) {
- return this.incomingEdges[node].slice(0);
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * Get an array containing the nodes that the specified node depends on (transitively).
- *
- * Throws an Error if the graph has a cycle, or the specified node does not exist.
- *
- * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned
- * in the array.
- */
- dependenciesOf: function (node, leavesOnly) {
- if (this.hasNode(node)) {
- var result = [];
- var DFS = createDFS(
- this.outgoingEdges,
- leavesOnly,
- result,
- this.circular
- );
- DFS(node);
- var idx = result.indexOf(node);
- if (idx >= 0) {
- result.splice(idx, 1);
- }
- return result;
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * get an array containing the nodes that depend on the specified node (transitively).
- *
- * Throws an Error if the graph has a cycle, or the specified node does not exist.
- *
- * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.
- */
- dependantsOf: function (node, leavesOnly) {
- if (this.hasNode(node)) {
- var result = [];
- var DFS = createDFS(
- this.incomingEdges,
- leavesOnly,
- result,
- this.circular
- );
- DFS(node);
- var idx = result.indexOf(node);
- if (idx >= 0) {
- result.splice(idx, 1);
- }
- return result;
- } else {
- throw new Error("Node does not exist: " + node);
- }
- },
- /**
- * Construct the overall processing order for the dependency graph.
- *
- * Throws an Error if the graph has a cycle.
- *
- * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.
- */
- overallOrder: function (leavesOnly) {
- var self = this;
- var result = [];
- var keys = Object.keys(this.nodes);
- if (keys.length === 0) {
- return result; // Empty graph
- } else {
- if (!this.circular) {
- // Look for cycles - we run the DFS starting at all the nodes in case there
- // are several disconnected subgraphs inside this dependency graph.
- var CycleDFS = createDFS(this.outgoingEdges, false, [], this.circular);
- keys.forEach(function (n) {
- CycleDFS(n);
- });
- }
- var DFS = createDFS(
- this.outgoingEdges,
- leavesOnly,
- result,
- this.circular
- );
- // Find all potential starting points (nodes with nothing depending on them) an
- // run a DFS starting at these points to get the order
- keys
- .filter(function (node) {
- return self.incomingEdges[node].length === 0;
- })
- .forEach(function (n) {
- DFS(n);
- });
+/***/ }),
+
+/***/ "./node_modules/lodash/_initCloneByTag.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_initCloneByTag.js ***!
+ \************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js"),
+ cloneDataView = __webpack_require__(/*! ./_cloneDataView */ "./node_modules/lodash/_cloneDataView.js"),
+ cloneRegExp = __webpack_require__(/*! ./_cloneRegExp */ "./node_modules/lodash/_cloneRegExp.js"),
+ cloneSymbol = __webpack_require__(/*! ./_cloneSymbol */ "./node_modules/lodash/_cloneSymbol.js"),
+ cloneTypedArray = __webpack_require__(/*! ./_cloneTypedArray */ "./node_modules/lodash/_cloneTypedArray.js");
+
+/** `Object#toString` result references. */
+var boolTag = '[object Boolean]',
+ dateTag = '[object Date]',
+ mapTag = '[object Map]',
+ numberTag = '[object Number]',
+ regexpTag = '[object RegExp]',
+ setTag = '[object Set]',
+ stringTag = '[object String]',
+ symbolTag = '[object Symbol]';
+
+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]';
+
+/**
+ * Initializes an object clone based on its `toStringTag`.
+ *
+ * **Note:** This function only supports cloning values with tags of
+ * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @param {string} tag The `toStringTag` of the object to clone.
+ * @param {boolean} [isDeep] Specify a deep clone.
+ * @returns {Object} Returns the initialized clone.
+ */
+function initCloneByTag(object, tag, isDeep) {
+ var Ctor = object.constructor;
+ switch (tag) {
+ case arrayBufferTag:
+ return cloneArrayBuffer(object);
+
+ case boolTag:
+ case dateTag:
+ return new Ctor(+object);
- // If we're allowing cycles - we need to run the DFS against any remaining
- // nodes that did not end up in the initial result (as they are part of a
- // subgraph that does not have a clear starting point)
- if (this.circular) {
- keys
- .filter(function (node) {
- return result.indexOf(node) === -1;
- })
- .forEach(function (n) {
- DFS(n);
- });
- }
+ case dataViewTag:
+ return cloneDataView(object, isDeep);
- return result;
- }
- },
- /**
- * Get an array of nodes that have no dependants (i.e. nothing depends on them).
- */
- entryNodes: function () {
- var self = this;
- return Object.keys(this.nodes).filter(function (node) {
- return self.incomingEdges[node].length === 0;
- });
+ 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 new Ctor;
+
+ case numberTag:
+ case stringTag:
+ return new Ctor(object);
+
+ case regexpTag:
+ return cloneRegExp(object);
+
+ case setTag:
+ return new Ctor;
+
+ case symbolTag:
+ return cloneSymbol(object);
}
-};
+}
-// Create some aliases
-DepGraph.prototype.directDependentsOf = DepGraph.prototype.directDependantsOf;
-DepGraph.prototype.dependentsOf = DepGraph.prototype.dependantsOf;
+module.exports = initCloneByTag;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_initCloneObject.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_initCloneObject.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseCreate = __webpack_require__(/*! ./_baseCreate */ "./node_modules/lodash/_baseCreate.js"),
+ getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
+ isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js");
/**
- * Cycle error, including the path of the cycle.
+ * Initializes an object clone.
+ *
+ * @private
+ * @param {Object} object The object to clone.
+ * @returns {Object} Returns the initialized clone.
*/
-var DepGraphCycleError = (exports.DepGraphCycleError = function (cyclePath) {
- var message = "Dependency Cycle Found: " + cyclePath.join(" -> ");
- var instance = new Error(message);
- instance.cyclePath = cyclePath;
- Object.setPrototypeOf(instance, Object.getPrototypeOf(this));
- if (Error.captureStackTrace) {
- Error.captureStackTrace(instance, DepGraphCycleError);
- }
- return instance;
-});
-DepGraphCycleError.prototype = Object.create(Error.prototype, {
- constructor: {
- value: Error,
- enumerable: false,
- writable: true,
- configurable: true
- }
-});
-Object.setPrototypeOf(DepGraphCycleError, Error);
+function initCloneObject(object) {
+ return (typeof object.constructor == 'function' && !isPrototype(object))
+ ? baseCreate(getPrototype(object))
+ : {};
+}
+
+module.exports = initCloneObject;
/***/ }),
-/***/ "./node_modules/fast-isnumeric/index.js":
-/*!**********************************************!*\
- !*** ./node_modules/fast-isnumeric/index.js ***!
- \**********************************************/
+/***/ "./node_modules/lodash/_isFlattenable.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_isFlattenable.js ***!
+ \***********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
+var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
+ isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+
+/** Built-in value references. */
+var spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;
+
/**
- * inspired by is-number <https://github.com/jonschlinkert/is-number>
- * but significantly simplified and sped up by ignoring number and string constructors
- * ie these return false:
- * new Number(1)
- * new String('1')
+ * 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]);
+}
+module.exports = isFlattenable;
-var allBlankCharCodes = __webpack_require__(/*! is-string-blank */ "./node_modules/is-string-blank/index.js");
+/***/ }),
-module.exports = function(n) {
- var type = typeof n;
- if(type === 'string') {
- var original = n;
- n = +n;
- // whitespace strings cast to zero - filter them out
- if(n===0 && allBlankCharCodes(original)) return false;
- }
- else if(type !== 'number') return false;
+/***/ "./node_modules/lodash/_isIndex.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_isIndex.js ***!
+ \*****************************************/
+/***/ (function(module) {
- return n - n < 1;
-};
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
+
+/** Used to detect unsigned integer values. */
+var reIsUint = /^(?:0|[1-9]\d*)$/;
+
+/**
+ * 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) {
+ var type = typeof value;
+ length = length == null ? MAX_SAFE_INTEGER : length;
+
+ return !!length &&
+ (type == 'number' ||
+ (type != 'symbol' && reIsUint.test(value))) &&
+ (value > -1 && value % 1 == 0 && value < length);
+}
+
+module.exports = isIndex;
/***/ }),
-/***/ "./node_modules/graphlib/index.js":
-/*!****************************************!*\
- !*** ./node_modules/graphlib/index.js ***!
- \****************************************/
+/***/ "./node_modules/lodash/_isIterateeCall.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_isIterateeCall.js ***!
+ \************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
+ isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
+
/**
- * Copyright (c) 2014, Chris Pettitt
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions are met:
- *
- * 1. Redistributions of source code must retain the above copyright notice, this
- * list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright notice,
- * this list of conditions and the following disclaimer in the documentation
- * and/or other materials provided with the distribution.
+ * Checks if the given arguments are from an iteratee call.
*
- * 3. Neither the name of the copyright holder nor the names of its contributors
- * may be used to endorse or promote products derived from this software without
- * specific prior written permission.
+ * @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;
+}
+
+module.exports = isIterateeCall;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_isKey.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/_isKey.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+
+/** Used to match property names within property paths. */
+var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
+ reIsPlainProp = /^\w*$/;
+
+/**
+ * Checks if `value` is a property name and not a property path.
*
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
- * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
- * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
- * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ * @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));
+}
-var lib = __webpack_require__(/*! ./lib */ "./node_modules/graphlib/lib/index.js");
+module.exports = isKey;
-module.exports = {
- Graph: lib.Graph,
- json: __webpack_require__(/*! ./lib/json */ "./node_modules/graphlib/lib/json.js"),
- alg: __webpack_require__(/*! ./lib/alg */ "./node_modules/graphlib/lib/alg/index.js"),
- version: lib.version
-};
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_isKeyable.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/_isKeyable.js ***!
+ \*******************************************/
+/***/ (function(module) {
+
+/**
+ * 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);
+}
+
+module.exports = isKeyable;
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/components.js":
-/*!*****************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/components.js ***!
- \*****************************************************/
+/***/ "./node_modules/lodash/_isMasked.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_isMasked.js ***!
+ \******************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var coreJsData = __webpack_require__(/*! ./_coreJsData */ "./node_modules/lodash/_coreJsData.js");
-module.exports = components;
+/** 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) : '';
+}());
-function components(g) {
- var visited = {};
- var cmpts = [];
- var cmpt;
+/**
+ * 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);
+}
- function dfs(v) {
- if (_.has(visited, v)) return;
- visited[v] = true;
- cmpt.push(v);
- _.each(g.successors(v), dfs);
- _.each(g.predecessors(v), dfs);
- }
+module.exports = isMasked;
- _.each(g.nodes(), function(v) {
- cmpt = [];
- dfs(v);
- if (cmpt.length) {
- cmpts.push(cmpt);
- }
- });
- return cmpts;
+/***/ }),
+
+/***/ "./node_modules/lodash/_isPrototype.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_isPrototype.js ***!
+ \*********************************************/
+/***/ (function(module) {
+
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/**
+ * 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;
}
+module.exports = isPrototype;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/dfs.js":
-/*!**********************************************!*\
- !*** ./node_modules/graphlib/lib/alg/dfs.js ***!
- \**********************************************/
+/***/ "./node_modules/lodash/_isStrictComparable.js":
+/*!****************************************************!*\
+ !*** ./node_modules/lodash/_isStrictComparable.js ***!
+ \****************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
-
-module.exports = dfs;
+var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
-/*
- * A helper that preforms a pre- or post-order traversal on the input graph
- * and returns the nodes in the order they were visited. If the graph is
- * undirected then this algorithm will navigate using neighbors. If the graph
- * is directed then this algorithm will navigate using successors.
+/**
+ * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
*
- * Order must be one of "pre" or "post".
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` if suitable for strict
+ * equality comparisons, else `false`.
*/
-function dfs(g, vs, order) {
- if (!_.isArray(vs)) {
- vs = [vs];
- }
+function isStrictComparable(value) {
+ return value === value && !isObject(value);
+}
- var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);
+module.exports = isStrictComparable;
- var acc = [];
- var visited = {};
- _.each(vs, function(v) {
- if (!g.hasNode(v)) {
- throw new Error("Graph does not have node: " + v);
- }
- doDfs(g, v, order === "post", visited, navigation, acc);
- });
- return acc;
+/***/ }),
+
+/***/ "./node_modules/lodash/_listCacheClear.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_listCacheClear.js ***!
+ \************************************************/
+/***/ (function(module) {
+
+/**
+ * Removes all key-value entries from the list cache.
+ *
+ * @private
+ * @name clear
+ * @memberOf ListCache
+ */
+function listCacheClear() {
+ this.__data__ = [];
+ this.size = 0;
}
-function doDfs(g, v, postorder, visited, navigation, acc) {
- if (!_.has(visited, v)) {
- visited[v] = true;
+module.exports = listCacheClear;
- if (!postorder) { acc.push(v); }
- _.each(navigation(v), function(w) {
- doDfs(g, w, postorder, visited, navigation, acc);
- });
- if (postorder) { acc.push(v); }
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_listCacheDelete.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_listCacheDelete.js ***!
+ \*************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
+
+/** Used for built-in method references. */
+var arrayProto = Array.prototype;
+
+/** Built-in value references. */
+var splice = arrayProto.splice;
+
+/**
+ * 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;
}
+module.exports = listCacheDelete;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/dijkstra-all.js":
-/*!*******************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/dijkstra-all.js ***!
- \*******************************************************/
+/***/ "./node_modules/lodash/_listCacheGet.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_listCacheGet.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var dijkstra = __webpack_require__(/*! ./dijkstra */ "./node_modules/graphlib/lib/alg/dijkstra.js");
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
-module.exports = dijkstraAll;
+/**
+ * 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);
-function dijkstraAll(g, weightFunc, edgeFunc) {
- return _.transform(g.nodes(), function(acc, v) {
- acc[v] = dijkstra(g, v, weightFunc, edgeFunc);
- }, {});
+ return index < 0 ? undefined : data[index][1];
}
+module.exports = listCacheGet;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/dijkstra.js":
-/*!***************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/dijkstra.js ***!
- \***************************************************/
+/***/ "./node_modules/lodash/_listCacheHas.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_listCacheHas.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
-var PriorityQueue = __webpack_require__(/*! ../data/priority-queue */ "./node_modules/graphlib/lib/data/priority-queue.js");
-
-module.exports = dijkstra;
-
-var DEFAULT_WEIGHT_FUNC = _.constant(1);
+var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
-function dijkstra(g, source, weightFn, edgeFn) {
- return runDijkstra(g, String(source),
- weightFn || DEFAULT_WEIGHT_FUNC,
- edgeFn || function(v) { return g.outEdges(v); });
+/**
+ * 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;
}
-function runDijkstra(g, source, weightFn, edgeFn) {
- var results = {};
- var pq = new PriorityQueue();
- var v, vEntry;
+module.exports = listCacheHas;
- var updateNeighbors = function(edge) {
- var w = edge.v !== v ? edge.v : edge.w;
- var wEntry = results[w];
- var weight = weightFn(edge);
- var distance = vEntry.distance + weight;
- if (weight < 0) {
- throw new Error("dijkstra does not allow negative edge weights. " +
- "Bad edge: " + edge + " Weight: " + weight);
- }
+/***/ }),
- if (distance < wEntry.distance) {
- wEntry.distance = distance;
- wEntry.predecessor = v;
- pq.decrease(w, distance);
- }
- };
+/***/ "./node_modules/lodash/_listCacheSet.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_listCacheSet.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- g.nodes().forEach(function(v) {
- var distance = v === source ? 0 : Number.POSITIVE_INFINITY;
- results[v] = { distance: distance };
- pq.add(v, distance);
- });
+var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
- while (pq.size() > 0) {
- v = pq.removeMin();
- vEntry = results[v];
- if (vEntry.distance === Number.POSITIVE_INFINITY) {
- break;
- }
+/**
+ * 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);
- edgeFn(v).forEach(updateNeighbors);
+ if (index < 0) {
+ ++this.size;
+ data.push([key, value]);
+ } else {
+ data[index][1] = value;
}
-
- return results;
+ return this;
}
+module.exports = listCacheSet;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/find-cycles.js":
-/*!******************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/find-cycles.js ***!
- \******************************************************/
+/***/ "./node_modules/lodash/_mapCacheClear.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_mapCacheClear.js ***!
+ \***********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
-var tarjan = __webpack_require__(/*! ./tarjan */ "./node_modules/graphlib/lib/alg/tarjan.js");
-
-module.exports = findCycles;
+var Hash = __webpack_require__(/*! ./_Hash */ "./node_modules/lodash/_Hash.js"),
+ ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
+ Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js");
-function findCycles(g) {
- return _.filter(tarjan(g), function(cmpt) {
- return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));
- });
+/**
+ * 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
+ };
}
+module.exports = mapCacheClear;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/floyd-warshall.js":
-/*!*********************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/floyd-warshall.js ***!
- \*********************************************************/
+/***/ "./node_modules/lodash/_mapCacheDelete.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_mapCacheDelete.js ***!
+ \************************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
-module.exports = floydWarshall;
+/**
+ * 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;
+}
-var DEFAULT_WEIGHT_FUNC = _.constant(1);
+module.exports = mapCacheDelete;
-function floydWarshall(g, weightFn, edgeFn) {
- return runFloydWarshall(g,
- weightFn || DEFAULT_WEIGHT_FUNC,
- edgeFn || function(v) { return g.outEdges(v); });
-}
-function runFloydWarshall(g, weightFn, edgeFn) {
- var results = {};
- var nodes = g.nodes();
+/***/ }),
- nodes.forEach(function(v) {
- results[v] = {};
- results[v][v] = { distance: 0 };
- nodes.forEach(function(w) {
- if (v !== w) {
- results[v][w] = { distance: Number.POSITIVE_INFINITY };
- }
- });
- edgeFn(v).forEach(function(edge) {
- var w = edge.v === v ? edge.w : edge.v;
- var d = weightFn(edge);
- results[v][w] = { distance: d, predecessor: v };
- });
- });
+/***/ "./node_modules/lodash/_mapCacheGet.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_mapCacheGet.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- nodes.forEach(function(k) {
- var rowK = results[k];
- nodes.forEach(function(i) {
- var rowI = results[i];
- nodes.forEach(function(j) {
- var ik = rowI[k];
- var kj = rowK[j];
- var ij = rowI[j];
- var altDistance = ik.distance + kj.distance;
- if (altDistance < ij.distance) {
- ij.distance = altDistance;
- ij.predecessor = kj.predecessor;
- }
- });
- });
- });
+var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
- return results;
+/**
+ * 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);
}
+module.exports = mapCacheGet;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/index.js":
-/*!************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/index.js ***!
- \************************************************/
+/***/ "./node_modules/lodash/_mapCacheHas.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_mapCacheHas.js ***!
+ \*********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-module.exports = {
- components: __webpack_require__(/*! ./components */ "./node_modules/graphlib/lib/alg/components.js"),
- dijkstra: __webpack_require__(/*! ./dijkstra */ "./node_modules/graphlib/lib/alg/dijkstra.js"),
- dijkstraAll: __webpack_require__(/*! ./dijkstra-all */ "./node_modules/graphlib/lib/alg/dijkstra-all.js"),
- findCycles: __webpack_require__(/*! ./find-cycles */ "./node_modules/graphlib/lib/alg/find-cycles.js"),
- floydWarshall: __webpack_require__(/*! ./floyd-warshall */ "./node_modules/graphlib/lib/alg/floyd-warshall.js"),
- isAcyclic: __webpack_require__(/*! ./is-acyclic */ "./node_modules/graphlib/lib/alg/is-acyclic.js"),
- postorder: __webpack_require__(/*! ./postorder */ "./node_modules/graphlib/lib/alg/postorder.js"),
- preorder: __webpack_require__(/*! ./preorder */ "./node_modules/graphlib/lib/alg/preorder.js"),
- prim: __webpack_require__(/*! ./prim */ "./node_modules/graphlib/lib/alg/prim.js"),
- tarjan: __webpack_require__(/*! ./tarjan */ "./node_modules/graphlib/lib/alg/tarjan.js"),
- topsort: __webpack_require__(/*! ./topsort */ "./node_modules/graphlib/lib/alg/topsort.js")
-};
+var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
+
+/**
+ * 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);
+}
+
+module.exports = mapCacheHas;
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/is-acyclic.js":
-/*!*****************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/is-acyclic.js ***!
- \*****************************************************/
+/***/ "./node_modules/lodash/_mapCacheSet.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_mapCacheSet.js ***!
+ \*********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var topsort = __webpack_require__(/*! ./topsort */ "./node_modules/graphlib/lib/alg/topsort.js");
+var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
-module.exports = isAcyclic;
+/**
+ * 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;
-function isAcyclic(g) {
- try {
- topsort(g);
- } catch (e) {
- if (e instanceof topsort.CycleException) {
- return false;
- }
- throw e;
- }
- return true;
+ data.set(key, value);
+ this.size += data.size == size ? 0 : 1;
+ return this;
}
+module.exports = mapCacheSet;
-/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/postorder.js":
-/*!****************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/postorder.js ***!
- \****************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ }),
-var dfs = __webpack_require__(/*! ./dfs */ "./node_modules/graphlib/lib/alg/dfs.js");
+/***/ "./node_modules/lodash/_mapToArray.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_mapToArray.js ***!
+ \********************************************/
+/***/ (function(module) {
-module.exports = postorder;
+/**
+ * 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);
-function postorder(g, vs) {
- return dfs(g, vs, "post");
+ map.forEach(function(value, key) {
+ result[++index] = [key, value];
+ });
+ return result;
}
+module.exports = mapToArray;
-/***/ }),
-
-/***/ "./node_modules/graphlib/lib/alg/preorder.js":
-/*!***************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/preorder.js ***!
- \***************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var dfs = __webpack_require__(/*! ./dfs */ "./node_modules/graphlib/lib/alg/dfs.js");
+/***/ }),
-module.exports = preorder;
+/***/ "./node_modules/lodash/_matchesStrictComparable.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/lodash/_matchesStrictComparable.js ***!
+ \*********************************************************/
+/***/ (function(module) {
-function preorder(g, vs) {
- return dfs(g, vs, "pre");
+/**
+ * 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)));
+ };
}
+module.exports = matchesStrictComparable;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/prim.js":
+/***/ "./node_modules/lodash/_memoizeCapped.js":
/*!***********************************************!*\
- !*** ./node_modules/graphlib/lib/alg/prim.js ***!
+ !*** ./node_modules/lodash/_memoizeCapped.js ***!
\***********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
-var Graph = __webpack_require__(/*! ../graph */ "./node_modules/graphlib/lib/graph.js");
-var PriorityQueue = __webpack_require__(/*! ../data/priority-queue */ "./node_modules/graphlib/lib/data/priority-queue.js");
-
-module.exports = prim;
+var memoize = __webpack_require__(/*! ./memoize */ "./node_modules/lodash/memoize.js");
-function prim(g, weightFunc) {
- var result = new Graph();
- var parents = {};
- var pq = new PriorityQueue();
- var v;
+/** Used as the maximum memoize cache size. */
+var MAX_MEMOIZE_SIZE = 500;
- function updateNeighbors(edge) {
- var w = edge.v === v ? edge.w : edge.v;
- var pri = pq.priority(w);
- if (pri !== undefined) {
- var edgeWeight = weightFunc(edge);
- if (edgeWeight < pri) {
- parents[w] = v;
- pq.decrease(w, edgeWeight);
- }
+/**
+ * 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;
+ });
- if (g.nodeCount() === 0) {
- return result;
- }
+ var cache = result.cache;
+ return result;
+}
- _.each(g.nodes(), function(v) {
- pq.add(v, Number.POSITIVE_INFINITY);
- result.setNode(v);
- });
+module.exports = memoizeCapped;
- // Start from an arbitrary node
- pq.decrease(g.nodes()[0], 0);
- var init = false;
- while (pq.size() > 0) {
- v = pq.removeMin();
- if (_.has(parents, v)) {
- result.setEdge(v, parents[v]);
- } else if (init) {
- throw new Error("Input graph is not connected: " + g);
- } else {
- init = true;
- }
+/***/ }),
- g.nodeEdges(v).forEach(updateNeighbors);
- }
+/***/ "./node_modules/lodash/_nativeCreate.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_nativeCreate.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- return result;
-}
+var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js");
+
+/* Built-in method references that are verified to be native. */
+var nativeCreate = getNative(Object, 'create');
+
+module.exports = nativeCreate;
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/tarjan.js":
-/*!*************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/tarjan.js ***!
- \*************************************************/
+/***/ "./node_modules/lodash/_nativeKeys.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_nativeKeys.js ***!
+ \********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+var overArg = __webpack_require__(/*! ./_overArg */ "./node_modules/lodash/_overArg.js");
-module.exports = tarjan;
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeKeys = overArg(Object.keys, Object);
-function tarjan(g) {
- var index = 0;
- var stack = [];
- var visited = {}; // node id -> { onStack, lowlink, index }
- var results = [];
+module.exports = nativeKeys;
- function dfs(v) {
- var entry = visited[v] = {
- onStack: true,
- lowlink: index,
- index: index++
- };
- stack.push(v);
- g.successors(v).forEach(function(w) {
- if (!_.has(visited, w)) {
- dfs(w);
- entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);
- } else if (visited[w].onStack) {
- entry.lowlink = Math.min(entry.lowlink, visited[w].index);
- }
- });
+/***/ }),
- if (entry.lowlink === entry.index) {
- var cmpt = [];
- var w;
- do {
- w = stack.pop();
- visited[w].onStack = false;
- cmpt.push(w);
- } while (v !== w);
- results.push(cmpt);
- }
- }
+/***/ "./node_modules/lodash/_nativeKeysIn.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_nativeKeysIn.js ***!
+ \**********************************************/
+/***/ (function(module) {
- g.nodes().forEach(function(v) {
- if (!_.has(visited, v)) {
- dfs(v);
+/**
+ * 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 results;
+ }
+ return result;
}
+module.exports = nativeKeysIn;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/alg/topsort.js":
-/*!**************************************************!*\
- !*** ./node_modules/graphlib/lib/alg/topsort.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/lodash/_nodeUtil.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_nodeUtil.js ***!
+ \******************************************/
+/***/ (function(module, exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+/* module decorator */ module = __webpack_require__.nmd(module);
+var freeGlobal = __webpack_require__(/*! ./_freeGlobal */ "./node_modules/lodash/_freeGlobal.js");
-module.exports = topsort;
-topsort.CycleException = CycleException;
+/** Detect free variable `exports`. */
+var freeExports = true && exports && !exports.nodeType && exports;
-function topsort(g) {
- var visited = {};
- var stack = {};
- var results = [];
+/** Detect free variable `module`. */
+var freeModule = freeExports && "object" == 'object' && module && !module.nodeType && module;
- function visit(node) {
- if (_.has(stack, node)) {
- throw new CycleException();
- }
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports = freeModule && freeModule.exports === freeExports;
- if (!_.has(visited, node)) {
- stack[node] = true;
- visited[node] = true;
- _.each(g.predecessors(node), visit);
- delete stack[node];
- results.push(node);
- }
- }
+/** Detect free variable `process` from Node.js. */
+var freeProcess = moduleExports && freeGlobal.process;
- _.each(g.sinks(), visit);
+/** Used to access faster Node.js helpers. */
+var nodeUtil = (function() {
+ try {
+ // Use `util.types` for Node.js 10+.
+ var types = freeModule && freeModule.require && freeModule.require('util').types;
- if (_.size(visited) !== g.nodeCount()) {
- throw new CycleException();
- }
+ if (types) {
+ return types;
+ }
- return results;
-}
+ // Legacy `process.binding('util')` for Node.js < 10.
+ return freeProcess && freeProcess.binding && freeProcess.binding('util');
+ } catch (e) {}
+}());
-function CycleException() {}
-CycleException.prototype = new Error(); // must be an instance of Error to pass testing
+module.exports = nodeUtil;
-/***/ }),
-/***/ "./node_modules/graphlib/lib/data/priority-queue.js":
-/*!**********************************************************!*\
- !*** ./node_modules/graphlib/lib/data/priority-queue.js ***!
- \**********************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ }),
-var _ = __webpack_require__(/*! ../lodash */ "./node_modules/graphlib/lib/lodash.js");
+/***/ "./node_modules/lodash/_objectToString.js":
+/*!************************************************!*\
+ !*** ./node_modules/lodash/_objectToString.js ***!
+ \************************************************/
+/***/ (function(module) {
-module.exports = PriorityQueue;
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
/**
- * A min-priority queue data structure. This algorithm is derived from Cormen,
- * et al., "Introduction to Algorithms". The basic idea of a min-priority
- * queue is that you can efficiently (in O(1) time) get the smallest key in
- * the queue. Adding and removing elements takes O(log n) time. A key can
- * have its priority decreased in O(log n) time.
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
*/
-function PriorityQueue() {
- this._arr = [];
- this._keyIndices = {};
-}
+var nativeObjectToString = objectProto.toString;
/**
- * Returns the number of elements in the queue. Takes `O(1)` time.
+ * Converts `value` to a string using `Object.prototype.toString`.
+ *
+ * @private
+ * @param {*} value The value to convert.
+ * @returns {string} Returns the converted string.
*/
-PriorityQueue.prototype.size = function() {
- return this._arr.length;
-};
+function objectToString(value) {
+ return nativeObjectToString.call(value);
+}
-/**
- * Returns the keys that are in the queue. Takes `O(n)` time.
- */
-PriorityQueue.prototype.keys = function() {
- return this._arr.map(function(x) { return x.key; });
-};
+module.exports = objectToString;
-/**
- * Returns `true` if **key** is in the queue and `false` if not.
- */
-PriorityQueue.prototype.has = function(key) {
- return _.has(this._keyIndices, key);
-};
-/**
- * Returns the priority for **key**. If **key** is not present in the queue
- * then this function returns `undefined`. Takes `O(1)` time.
- *
- * @param {Object} key
- */
-PriorityQueue.prototype.priority = function(key) {
- var index = this._keyIndices[key];
- if (index !== undefined) {
- return this._arr[index].priority;
- }
-};
+/***/ }),
-/**
- * Returns the key for the minimum element in this queue. If the queue is
- * empty this function throws an Error. Takes `O(1)` time.
- */
-PriorityQueue.prototype.min = function() {
- if (this.size() === 0) {
- throw new Error("Queue underflow");
- }
- return this._arr[0].key;
-};
+/***/ "./node_modules/lodash/_overArg.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_overArg.js ***!
+ \*****************************************/
+/***/ (function(module) {
/**
- * Inserts a new key into the priority queue. If the key already exists in
- * the queue this function returns `false`; otherwise it will return `true`.
- * Takes `O(n)` time.
+ * Creates a unary function that invokes `func` with its argument transformed.
*
- * @param {Object} key the key to add
- * @param {Number} priority the initial priority for the key
+ * @private
+ * @param {Function} func The function to wrap.
+ * @param {Function} transform The argument transform.
+ * @returns {Function} Returns the new function.
*/
-PriorityQueue.prototype.add = function(key, priority) {
- var keyIndices = this._keyIndices;
- key = String(key);
- if (!_.has(keyIndices, key)) {
- var arr = this._arr;
- var index = arr.length;
- keyIndices[key] = index;
- arr.push({key: key, priority: priority});
- this._decrease(index);
- return true;
- }
- return false;
-};
+function overArg(func, transform) {
+ return function(arg) {
+ return func(transform(arg));
+ };
+}
-/**
- * Removes and returns the smallest key in the queue. Takes `O(log n)` time.
- */
-PriorityQueue.prototype.removeMin = function() {
- this._swap(0, this._arr.length - 1);
- var min = this._arr.pop();
- delete this._keyIndices[min.key];
- this._heapify(0);
- return min.key;
-};
+module.exports = overArg;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_overRest.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_overRest.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var apply = __webpack_require__(/*! ./_apply */ "./node_modules/lodash/_apply.js");
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max;
/**
- * Decreases the priority for **key** to **priority**. If the new priority is
- * greater than the previous priority, this function will throw an Error.
+ * A specialized version of `baseRest` which transforms the rest array.
*
- * @param {Object} key the key for which to raise priority
- * @param {Number} priority the new priority for the key
+ * @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.
*/
-PriorityQueue.prototype.decrease = function(key, priority) {
- var index = this._keyIndices[key];
- if (priority > this._arr[index].priority) {
- throw new Error("New priority is greater than current priority. " +
- "Key: " + key + " Old: " + this._arr[index].priority + " New: " + priority);
- }
- this._arr[index].priority = priority;
- this._decrease(index);
-};
+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);
-PriorityQueue.prototype._heapify = function(i) {
- var arr = this._arr;
- var l = 2 * i;
- var r = l + 1;
- var largest = i;
- if (l < arr.length) {
- largest = arr[l].priority < arr[largest].priority ? l : largest;
- if (r < arr.length) {
- largest = arr[r].priority < arr[largest].priority ? r : largest;
- }
- if (largest !== i) {
- this._swap(i, largest);
- this._heapify(largest);
+ while (++index < length) {
+ array[index] = args[start + index];
}
- }
-};
-
-PriorityQueue.prototype._decrease = function(index) {
- var arr = this._arr;
- var priority = arr[index].priority;
- var parent;
- while (index !== 0) {
- parent = index >> 1;
- if (arr[parent].priority < priority) {
- break;
+ index = -1;
+ var otherArgs = Array(start + 1);
+ while (++index < start) {
+ otherArgs[index] = args[index];
}
- this._swap(index, parent);
- index = parent;
- }
-};
+ otherArgs[start] = transform(array);
+ return apply(func, this, otherArgs);
+ };
+}
-PriorityQueue.prototype._swap = function(i, j) {
- var arr = this._arr;
- var keyIndices = this._keyIndices;
- var origArrI = arr[i];
- var origArrJ = arr[j];
- arr[i] = origArrJ;
- arr[j] = origArrI;
- keyIndices[origArrJ.key] = i;
- keyIndices[origArrI.key] = j;
-};
+module.exports = overRest;
/***/ }),
-/***/ "./node_modules/graphlib/lib/graph.js":
-/*!********************************************!*\
- !*** ./node_modules/graphlib/lib/graph.js ***!
- \********************************************/
+/***/ "./node_modules/lodash/_root.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/_root.js ***!
+ \**************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/graphlib/lib/lodash.js");
-
-module.exports = Graph;
-
-var DEFAULT_EDGE_NAME = "\x00";
-var GRAPH_NODE = "\x00";
-var EDGE_KEY_DELIM = "\x01";
-
-// Implementation notes:
-//
-// * Node id query functions should return string ids for the nodes
-// * Edge id query functions should return an "edgeObj", edge object, that is
-// composed of enough information to uniquely identify an edge: {v, w, name}.
-// * Internally we use an "edgeId", a stringified form of the edgeObj, to
-// reference edges. This is because we need a performant way to look these
-// edges up and, object properties, which have string keys, are the closest
-// we're going to get to a performant hashtable in JavaScript.
+var freeGlobal = __webpack_require__(/*! ./_freeGlobal */ "./node_modules/lodash/_freeGlobal.js");
-function Graph(opts) {
- this._isDirected = _.has(opts, "directed") ? opts.directed : true;
- this._isMultigraph = _.has(opts, "multigraph") ? opts.multigraph : false;
- this._isCompound = _.has(opts, "compound") ? opts.compound : false;
+/** Detect free variable `self`. */
+var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
- // Label for the graph itself
- this._label = undefined;
+/** Used as a reference to the global object. */
+var root = freeGlobal || freeSelf || Function('return this')();
- // Defaults to be set when creating a new node
- this._defaultNodeLabelFn = _.constant(undefined);
+module.exports = root;
- // Defaults to be set when creating a new edge
- this._defaultEdgeLabelFn = _.constant(undefined);
- // v -> label
- this._nodes = {};
+/***/ }),
- if (this._isCompound) {
- // v -> parent
- this._parent = {};
+/***/ "./node_modules/lodash/_safeGet.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/_safeGet.js ***!
+ \*****************************************/
+/***/ (function(module) {
- // v -> children
- this._children = {};
- this._children[GRAPH_NODE] = {};
+/**
+ * Gets the value at `key`, unless `key` is "__proto__" or "constructor".
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @param {string} key The key of the property to get.
+ * @returns {*} Returns the property value.
+ */
+function safeGet(object, key) {
+ if (key === 'constructor' && typeof object[key] === 'function') {
+ return;
}
- // v -> edgeObj
- this._in = {};
-
- // u -> v -> Number
- this._preds = {};
-
- // v -> edgeObj
- this._out = {};
-
- // v -> w -> Number
- this._sucs = {};
-
- // e -> edgeObj
- this._edgeObjs = {};
+ if (key == '__proto__') {
+ return;
+ }
- // e -> label
- this._edgeLabels = {};
+ return object[key];
}
-/* Number of nodes in the graph. Should only be changed by the implementation. */
-Graph.prototype._nodeCount = 0;
+module.exports = safeGet;
-/* Number of edges in the graph. Should only be changed by the implementation. */
-Graph.prototype._edgeCount = 0;
+/***/ }),
-/* === Graph functions ========= */
+/***/ "./node_modules/lodash/_setCacheAdd.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_setCacheAdd.js ***!
+ \*********************************************/
+/***/ (function(module) {
-Graph.prototype.isDirected = function() {
- return this._isDirected;
-};
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
-Graph.prototype.isMultigraph = function() {
- return this._isMultigraph;
-};
+/**
+ * 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;
+}
-Graph.prototype.isCompound = function() {
- return this._isCompound;
-};
+module.exports = setCacheAdd;
-Graph.prototype.setGraph = function(label) {
- this._label = label;
- return this;
-};
-Graph.prototype.graph = function() {
- return this._label;
-};
+/***/ }),
+/***/ "./node_modules/lodash/_setCacheHas.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_setCacheHas.js ***!
+ \*********************************************/
+/***/ (function(module) {
-/* === Node functions ========== */
+/**
+ * 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);
+}
-Graph.prototype.setDefaultNodeLabel = function(newDefault) {
- if (!_.isFunction(newDefault)) {
- newDefault = _.constant(newDefault);
- }
- this._defaultNodeLabelFn = newDefault;
- return this;
-};
+module.exports = setCacheHas;
-Graph.prototype.nodeCount = function() {
- return this._nodeCount;
-};
-Graph.prototype.nodes = function() {
- return _.keys(this._nodes);
-};
+/***/ }),
-Graph.prototype.sources = function() {
- var self = this;
- return _.filter(this.nodes(), function(v) {
- return _.isEmpty(self._in[v]);
- });
-};
+/***/ "./node_modules/lodash/_setToArray.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_setToArray.js ***!
+ \********************************************/
+/***/ (function(module) {
-Graph.prototype.sinks = function() {
- var self = this;
- return _.filter(this.nodes(), function(v) {
- return _.isEmpty(self._out[v]);
- });
-};
+/**
+ * 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);
-Graph.prototype.setNodes = function(vs, value) {
- var args = arguments;
- var self = this;
- _.each(vs, function(v) {
- if (args.length > 1) {
- self.setNode(v, value);
- } else {
- self.setNode(v);
- }
+ set.forEach(function(value) {
+ result[++index] = value;
});
- return this;
-};
-
-Graph.prototype.setNode = function(v, value) {
- if (_.has(this._nodes, v)) {
- if (arguments.length > 1) {
- this._nodes[v] = value;
- }
- return this;
- }
+ return result;
+}
- this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);
- if (this._isCompound) {
- this._parent[v] = GRAPH_NODE;
- this._children[v] = {};
- this._children[GRAPH_NODE][v] = true;
- }
- this._in[v] = {};
- this._preds[v] = {};
- this._out[v] = {};
- this._sucs[v] = {};
- ++this._nodeCount;
- return this;
-};
+module.exports = setToArray;
-Graph.prototype.node = function(v) {
- return this._nodes[v];
-};
-Graph.prototype.hasNode = function(v) {
- return _.has(this._nodes, v);
-};
+/***/ }),
-Graph.prototype.removeNode = function(v) {
- var self = this;
- if (_.has(this._nodes, v)) {
- var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };
- delete this._nodes[v];
- if (this._isCompound) {
- this._removeFromParentsChildList(v);
- delete this._parent[v];
- _.each(this.children(v), function(child) {
- self.setParent(child);
- });
- delete this._children[v];
- }
- _.each(_.keys(this._in[v]), removeEdge);
- delete this._in[v];
- delete this._preds[v];
- _.each(_.keys(this._out[v]), removeEdge);
- delete this._out[v];
- delete this._sucs[v];
- --this._nodeCount;
- }
- return this;
-};
+/***/ "./node_modules/lodash/_setToString.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_setToString.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-Graph.prototype.setParent = function(v, parent) {
- if (!this._isCompound) {
- throw new Error("Cannot set parent in a non-compound graph");
- }
+var baseSetToString = __webpack_require__(/*! ./_baseSetToString */ "./node_modules/lodash/_baseSetToString.js"),
+ shortOut = __webpack_require__(/*! ./_shortOut */ "./node_modules/lodash/_shortOut.js");
- if (_.isUndefined(parent)) {
- parent = GRAPH_NODE;
- } else {
- // Coerce parent to string
- parent += "";
- for (var ancestor = parent;
- !_.isUndefined(ancestor);
- ancestor = this.parent(ancestor)) {
- if (ancestor === v) {
- throw new Error("Setting " + parent+ " as parent of " + v +
- " would create a cycle");
- }
- }
+/**
+ * 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);
- this.setNode(parent);
- }
+module.exports = setToString;
- this.setNode(v);
- this._removeFromParentsChildList(v);
- this._parent[v] = parent;
- this._children[parent][v] = true;
- return this;
-};
-Graph.prototype._removeFromParentsChildList = function(v) {
- delete this._children[this._parent[v]][v];
-};
+/***/ }),
-Graph.prototype.parent = function(v) {
- if (this._isCompound) {
- var parent = this._parent[v];
- if (parent !== GRAPH_NODE) {
- return parent;
- }
- }
-};
+/***/ "./node_modules/lodash/_shortOut.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_shortOut.js ***!
+ \******************************************/
+/***/ (function(module) {
-Graph.prototype.children = function(v) {
- if (_.isUndefined(v)) {
- v = GRAPH_NODE;
- }
+/** Used to detect hot functions by number of calls within a span of milliseconds. */
+var HOT_COUNT = 800,
+ HOT_SPAN = 16;
- if (this._isCompound) {
- var children = this._children[v];
- if (children) {
- return _.keys(children);
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeNow = Date.now;
+
+/**
+ * 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;
}
- } else if (v === GRAPH_NODE) {
- return this.nodes();
- } else if (this.hasNode(v)) {
- return [];
- }
-};
+ return func.apply(undefined, arguments);
+ };
+}
-Graph.prototype.predecessors = function(v) {
- var predsV = this._preds[v];
- if (predsV) {
- return _.keys(predsV);
- }
-};
+module.exports = shortOut;
-Graph.prototype.successors = function(v) {
- var sucsV = this._sucs[v];
- if (sucsV) {
- return _.keys(sucsV);
- }
-};
-Graph.prototype.neighbors = function(v) {
- var preds = this.predecessors(v);
- if (preds) {
- return _.union(preds, this.successors(v));
- }
-};
+/***/ }),
-Graph.prototype.isLeaf = function (v) {
- var neighbors;
- if (this.isDirected()) {
- neighbors = this.successors(v);
- } else {
- neighbors = this.neighbors(v);
- }
- return neighbors.length === 0;
-};
+/***/ "./node_modules/lodash/_stackClear.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/_stackClear.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-Graph.prototype.filterNodes = function(filter) {
- var copy = new this.constructor({
- directed: this._isDirected,
- multigraph: this._isMultigraph,
- compound: this._isCompound
- });
+var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js");
- copy.setGraph(this.graph());
+/**
+ * Removes all key-value entries from the stack.
+ *
+ * @private
+ * @name clear
+ * @memberOf Stack
+ */
+function stackClear() {
+ this.__data__ = new ListCache;
+ this.size = 0;
+}
- var self = this;
- _.each(this._nodes, function(value, v) {
- if (filter(v)) {
- copy.setNode(v, value);
- }
- });
+module.exports = stackClear;
- _.each(this._edgeObjs, function(e) {
- if (copy.hasNode(e.v) && copy.hasNode(e.w)) {
- copy.setEdge(e, self.edge(e));
- }
- });
- var parents = {};
- function findParent(v) {
- var parent = self.parent(v);
- if (parent === undefined || copy.hasNode(parent)) {
- parents[v] = parent;
- return parent;
- } else if (parent in parents) {
- return parents[parent];
- } else {
- return findParent(parent);
- }
- }
+/***/ }),
- if (this._isCompound) {
- _.each(copy.nodes(), function(v) {
- copy.setParent(v, findParent(v));
- });
- }
+/***/ "./node_modules/lodash/_stackDelete.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_stackDelete.js ***!
+ \*********************************************/
+/***/ (function(module) {
- return copy;
-};
+/**
+ * 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);
-/* === Edge functions ========== */
+ this.size = data.size;
+ return result;
+}
-Graph.prototype.setDefaultEdgeLabel = function(newDefault) {
- if (!_.isFunction(newDefault)) {
- newDefault = _.constant(newDefault);
- }
- this._defaultEdgeLabelFn = newDefault;
- return this;
-};
+module.exports = stackDelete;
-Graph.prototype.edgeCount = function() {
- return this._edgeCount;
-};
-Graph.prototype.edges = function() {
- return _.values(this._edgeObjs);
-};
+/***/ }),
-Graph.prototype.setPath = function(vs, value) {
- var self = this;
- var args = arguments;
- _.reduce(vs, function(v, w) {
- if (args.length > 1) {
- self.setEdge(v, w, value);
- } else {
- self.setEdge(v, w);
- }
- return w;
- });
- return this;
-};
+/***/ "./node_modules/lodash/_stackGet.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_stackGet.js ***!
+ \******************************************/
+/***/ (function(module) {
-/*
- * setEdge(v, w, [value, [name]])
- * setEdge({ v, w, [name] }, [value])
+/**
+ * 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.
*/
-Graph.prototype.setEdge = function() {
- var v, w, name, value;
- var valueSpecified = false;
- var arg0 = arguments[0];
-
- if (typeof arg0 === "object" && arg0 !== null && "v" in arg0) {
- v = arg0.v;
- w = arg0.w;
- name = arg0.name;
- if (arguments.length === 2) {
- value = arguments[1];
- valueSpecified = true;
- }
- } else {
- v = arg0;
- w = arguments[1];
- name = arguments[3];
- if (arguments.length > 2) {
- value = arguments[2];
- valueSpecified = true;
- }
- }
+function stackGet(key) {
+ return this.__data__.get(key);
+}
- v = "" + v;
- w = "" + w;
- if (!_.isUndefined(name)) {
- name = "" + name;
- }
+module.exports = stackGet;
- var e = edgeArgsToId(this._isDirected, v, w, name);
- if (_.has(this._edgeLabels, e)) {
- if (valueSpecified) {
- this._edgeLabels[e] = value;
- }
- return this;
- }
- if (!_.isUndefined(name) && !this._isMultigraph) {
- throw new Error("Cannot set a named edge when isMultigraph = false");
- }
+/***/ }),
- // It didn't exist, so we need to create it.
- // First ensure the nodes exist.
- this.setNode(v);
- this.setNode(w);
+/***/ "./node_modules/lodash/_stackHas.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_stackHas.js ***!
+ \******************************************/
+/***/ (function(module) {
- this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);
+/**
+ * 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);
+}
- var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);
- // Ensure we add undirected edges in a consistent way.
- v = edgeObj.v;
- w = edgeObj.w;
+module.exports = stackHas;
- Object.freeze(edgeObj);
- this._edgeObjs[e] = edgeObj;
- incrementOrInitEntry(this._preds[w], v);
- incrementOrInitEntry(this._sucs[v], w);
- this._in[w][e] = edgeObj;
- this._out[v][e] = edgeObj;
- this._edgeCount++;
- return this;
-};
-Graph.prototype.edge = function(v, w, name) {
- var e = (arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name));
- return this._edgeLabels[e];
-};
+/***/ }),
-Graph.prototype.hasEdge = function(v, w, name) {
- var e = (arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name));
- return _.has(this._edgeLabels, e);
-};
+/***/ "./node_modules/lodash/_stackSet.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_stackSet.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-Graph.prototype.removeEdge = function(v, w, name) {
- var e = (arguments.length === 1
- ? edgeObjToId(this._isDirected, arguments[0])
- : edgeArgsToId(this._isDirected, v, w, name));
- var edge = this._edgeObjs[e];
- if (edge) {
- v = edge.v;
- w = edge.w;
- delete this._edgeLabels[e];
- delete this._edgeObjs[e];
- decrementOrRemoveEntry(this._preds[w], v);
- decrementOrRemoveEntry(this._sucs[v], w);
- delete this._in[w][e];
- delete this._out[v][e];
- this._edgeCount--;
- }
- return this;
-};
+var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
+ Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js"),
+ MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js");
-Graph.prototype.inEdges = function(v, u) {
- var inV = this._in[v];
- if (inV) {
- var edges = _.values(inV);
- if (!u) {
- return edges;
- }
- return _.filter(edges, function(edge) { return edge.v === u; });
- }
-};
+/** Used as the size to enable large array optimizations. */
+var LARGE_ARRAY_SIZE = 200;
-Graph.prototype.outEdges = function(v, w) {
- var outV = this._out[v];
- if (outV) {
- var edges = _.values(outV);
- if (!w) {
- return edges;
+/**
+ * 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;
}
- return _.filter(edges, function(edge) { return edge.w === w; });
+ data = this.__data__ = new MapCache(pairs);
}
-};
+ data.set(key, value);
+ this.size = data.size;
+ return this;
+}
-Graph.prototype.nodeEdges = function(v, w) {
- var inEdges = this.inEdges(v, w);
- if (inEdges) {
- return inEdges.concat(this.outEdges(v, w));
- }
-};
+module.exports = stackSet;
-function incrementOrInitEntry(map, k) {
- if (map[k]) {
- map[k]++;
- } else {
- map[k] = 1;
- }
-}
-function decrementOrRemoveEntry(map, k) {
- if (!--map[k]) { delete map[k]; }
-}
+/***/ }),
-function edgeArgsToId(isDirected, v_, w_, name) {
- var v = "" + v_;
- var w = "" + w_;
- if (!isDirected && v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +
- (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);
-}
+/***/ "./node_modules/lodash/_strictIndexOf.js":
+/*!***********************************************!*\
+ !*** ./node_modules/lodash/_strictIndexOf.js ***!
+ \***********************************************/
+/***/ (function(module) {
-function edgeArgsToObj(isDirected, v_, w_, name) {
- var v = "" + v_;
- var w = "" + w_;
- if (!isDirected && v > w) {
- var tmp = v;
- v = w;
- w = tmp;
- }
- var edgeObj = { v: v, w: w };
- if (name) {
- edgeObj.name = name;
+/**
+ * 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 edgeObj;
+ return -1;
}
-function edgeObjToId(isDirected, edgeObj) {
- return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);
-}
+module.exports = strictIndexOf;
/***/ }),
-/***/ "./node_modules/graphlib/lib/index.js":
+/***/ "./node_modules/lodash/_stringSize.js":
/*!********************************************!*\
- !*** ./node_modules/graphlib/lib/index.js ***!
+ !*** ./node_modules/lodash/_stringSize.js ***!
\********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-// Includes only the "core" of graphlib
-module.exports = {
- Graph: __webpack_require__(/*! ./graph */ "./node_modules/graphlib/lib/graph.js"),
- version: __webpack_require__(/*! ./version */ "./node_modules/graphlib/lib/version.js")
-};
+var asciiSize = __webpack_require__(/*! ./_asciiSize */ "./node_modules/lodash/_asciiSize.js"),
+ hasUnicode = __webpack_require__(/*! ./_hasUnicode */ "./node_modules/lodash/_hasUnicode.js"),
+ unicodeSize = __webpack_require__(/*! ./_unicodeSize */ "./node_modules/lodash/_unicodeSize.js");
+
+/**
+ * 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);
+}
+
+module.exports = stringSize;
/***/ }),
-/***/ "./node_modules/graphlib/lib/json.js":
-/*!*******************************************!*\
- !*** ./node_modules/graphlib/lib/json.js ***!
- \*******************************************/
+/***/ "./node_modules/lodash/_stringToPath.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/_stringToPath.js ***!
+ \**********************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var _ = __webpack_require__(/*! ./lodash */ "./node_modules/graphlib/lib/lodash.js");
-var Graph = __webpack_require__(/*! ./graph */ "./node_modules/graphlib/lib/graph.js");
+var memoizeCapped = __webpack_require__(/*! ./_memoizeCapped */ "./node_modules/lodash/_memoizeCapped.js");
-module.exports = {
- write: write,
- read: read
-};
+/** Used to match property names within property paths. */
+var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
-function write(g) {
- var json = {
- options: {
- directed: g.isDirected(),
- multigraph: g.isMultigraph(),
- compound: g.isCompound()
- },
- nodes: writeNodes(g),
- edges: writeEdges(g)
- };
- if (!_.isUndefined(g.graph())) {
- json.value = _.clone(g.graph());
- }
- return json;
-}
+/** Used to match backslashes in property paths. */
+var reEscapeChar = /\\(\\)?/g;
-function writeNodes(g) {
- return _.map(g.nodes(), function(v) {
- var nodeValue = g.node(v);
- var parent = g.parent(v);
- var node = { v: v };
- if (!_.isUndefined(nodeValue)) {
- node.value = nodeValue;
- }
- if (!_.isUndefined(parent)) {
- node.parent = parent;
- }
- return node;
+/**
+ * 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 (string.charCodeAt(0) === 46 /* . */) {
+ result.push('');
+ }
+ string.replace(rePropName, function(match, number, quote, subString) {
+ result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
});
-}
+ return result;
+});
-function writeEdges(g) {
- return _.map(g.edges(), function(e) {
- var edgeValue = g.edge(e);
- var edge = { v: e.v, w: e.w };
- if (!_.isUndefined(e.name)) {
- edge.name = e.name;
- }
- if (!_.isUndefined(edgeValue)) {
- edge.value = edgeValue;
- }
- return edge;
- });
-}
+module.exports = stringToPath;
-function read(json) {
- var g = new Graph(json.options).setGraph(json.value);
- _.each(json.nodes, function(entry) {
- g.setNode(entry.v, entry.value);
- if (entry.parent) {
- g.setParent(entry.v, entry.parent);
- }
- });
- _.each(json.edges, function(entry) {
- g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);
- });
- return g;
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_toKey.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/_toKey.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/**
+ * 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;
}
+module.exports = toKey;
+
/***/ }),
-/***/ "./node_modules/graphlib/lib/lodash.js":
-/*!*********************************************!*\
- !*** ./node_modules/graphlib/lib/lodash.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/lodash/_toSource.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/_toSource.js ***!
+ \******************************************/
+/***/ (function(module) {
-/* global window */
+/** Used for built-in method references. */
+var funcProto = Function.prototype;
-var lodash;
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
-if (true) {
- try {
- lodash = {
- clone: __webpack_require__(/*! lodash/clone */ "./node_modules/lodash/clone.js"),
- constant: __webpack_require__(/*! lodash/constant */ "./node_modules/lodash/constant.js"),
- each: __webpack_require__(/*! lodash/each */ "./node_modules/lodash/each.js"),
- filter: __webpack_require__(/*! lodash/filter */ "./node_modules/lodash/filter.js"),
- has: __webpack_require__(/*! lodash/has */ "./node_modules/lodash/has.js"),
- isArray: __webpack_require__(/*! lodash/isArray */ "./node_modules/lodash/isArray.js"),
- isEmpty: __webpack_require__(/*! lodash/isEmpty */ "./node_modules/lodash/isEmpty.js"),
- isFunction: __webpack_require__(/*! lodash/isFunction */ "./node_modules/lodash/isFunction.js"),
- isUndefined: __webpack_require__(/*! lodash/isUndefined */ "./node_modules/lodash/isUndefined.js"),
- keys: __webpack_require__(/*! lodash/keys */ "./node_modules/lodash/keys.js"),
- map: __webpack_require__(/*! lodash/map */ "./node_modules/lodash/map.js"),
- reduce: __webpack_require__(/*! lodash/reduce */ "./node_modules/lodash/reduce.js"),
- size: __webpack_require__(/*! lodash/size */ "./node_modules/lodash/size.js"),
- transform: __webpack_require__(/*! lodash/transform */ "./node_modules/lodash/transform.js"),
- union: __webpack_require__(/*! lodash/union */ "./node_modules/lodash/union.js"),
- values: __webpack_require__(/*! lodash/values */ "./node_modules/lodash/values.js")
- };
- } catch (e) {
- // continue regardless of error
+/**
+ * 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 '';
}
-if (!lodash) {
- lodash = window._;
+module.exports = toSource;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/_trimmedEndIndex.js":
+/*!*************************************************!*\
+ !*** ./node_modules/lodash/_trimmedEndIndex.js ***!
+ \*************************************************/
+/***/ (function(module) {
+
+/** Used to match a single whitespace character. */
+var reWhitespace = /\s/;
+
+/**
+ * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
+ * character of `string`.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the last non-whitespace character.
+ */
+function trimmedEndIndex(string) {
+ var index = string.length;
+
+ while (index-- && reWhitespace.test(string.charAt(index))) {}
+ return index;
}
-module.exports = lodash;
+module.exports = trimmedEndIndex;
/***/ }),
-/***/ "./node_modules/graphlib/lib/version.js":
-/*!**********************************************!*\
- !*** ./node_modules/graphlib/lib/version.js ***!
- \**********************************************/
+/***/ "./node_modules/lodash/_unicodeSize.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/_unicodeSize.js ***!
+ \*********************************************/
/***/ (function(module) {
-module.exports = '2.1.8';
+/** Used to compose unicode character classes. */
+var rsAstralRange = '\\ud800-\\udfff',
+ rsComboMarksRange = '\\u0300-\\u036f',
+ reComboHalfMarksRange = '\\ufe20-\\ufe2f',
+ rsComboSymbolsRange = '\\u20d0-\\u20ff',
+ rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
+ rsVarRange = '\\ufe0e\\ufe0f';
+
+/** Used to compose unicode capture groups. */
+var rsAstral = '[' + rsAstralRange + ']',
+ rsCombo = '[' + rsComboRange + ']',
+ rsFitz = '\\ud83c[\\udffb-\\udfff]',
+ rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
+ rsNonAstral = '[^' + rsAstralRange + ']',
+ rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
+ rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
+ rsZWJ = '\\u200d';
+
+/** Used to compose unicode regexes. */
+var reOptMod = rsModifier + '?',
+ rsOptVar = '[' + rsVarRange + ']?',
+ rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
+ rsSeq = rsOptVar + reOptMod + rsOptJoin,
+ rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+
+/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
+var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+
+/**
+ * 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;
+}
+
+module.exports = unicodeSize;
/***/ }),
-/***/ "./node_modules/heap/index.js":
-/*!************************************!*\
- !*** ./node_modules/heap/index.js ***!
- \************************************/
+/***/ "./node_modules/lodash/clone.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/clone.js ***!
+ \**************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-module.exports = __webpack_require__(/*! ./lib/heap */ "./node_modules/heap/lib/heap.js");
+var baseClone = __webpack_require__(/*! ./_baseClone */ "./node_modules/lodash/_baseClone.js");
+
+/** Used to compose bitmasks for cloning. */
+var CLONE_SYMBOLS_FLAG = 4;
+
+/**
+ * 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);
+}
+
+module.exports = clone;
/***/ }),
-/***/ "./node_modules/heap/lib/heap.js":
-/*!***************************************!*\
- !*** ./node_modules/heap/lib/heap.js ***!
- \***************************************/
-/***/ (function(module, exports) {
+/***/ "./node_modules/lodash/cloneDeep.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/cloneDeep.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_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;
+var baseClone = __webpack_require__(/*! ./_baseClone */ "./node_modules/lodash/_baseClone.js");
- floor = Math.floor, min = Math.min;
+/** Used to compose bitmasks for cloning. */
+var CLONE_DEEP_FLAG = 1,
+ CLONE_SYMBOLS_FLAG = 4;
+/**
+ * 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);
+}
- /*
- Default comparison function to be used
- */
+module.exports = cloneDeep;
- 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.
- */
+/***/ "./node_modules/lodash/constant.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/constant.js ***!
+ \*****************************************/
+/***/ (function(module) {
- 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);
+/**
+ * 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;
};
+}
+module.exports = constant;
- /*
- 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);
- };
+/***/ }),
+/***/ "./node_modules/lodash/defaults.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/defaults.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- /*
- Pop the smallest item off the heap, maintaining the heap invariant.
- */
+var baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
+ eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
+ isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
- 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;
- };
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * 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(object, sources) {
+ object = Object(object);
+ var index = -1;
+ var length = sources.length;
+ var guard = length > 2 ? sources[2] : undefined;
- /*
- 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)
- */
+ if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+ length = 1;
+ }
- heapreplace = function(array, item, cmp) {
- var returnitem;
- if (cmp == null) {
- cmp = defaultCmp;
+ while (++index < length) {
+ var source = sources[index];
+ var props = keysIn(source);
+ var propsIndex = -1;
+ var propsLength = props.length;
+
+ while (++propsIndex < propsLength) {
+ var key = props[propsIndex];
+ var value = object[key];
+
+ if (value === undefined ||
+ (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
+ object[key] = source[key];
+ }
}
- returnitem = array[0];
- array[0] = item;
- _siftup(array, 0, cmp);
- return returnitem;
- };
+ }
+ return object;
+});
- /*
- Fast version of a heappush followed by a heappop.
- */
+module.exports = defaults;
- 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.
- */
+/***/ "./node_modules/lodash/each.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/each.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- 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;
- };
+module.exports = __webpack_require__(/*! ./forEach */ "./node_modules/lodash/forEach.js");
- /*
- 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);
- };
+/***/ "./node_modules/lodash/eq.js":
+/*!***********************************!*\
+ !*** ./node_modules/lodash/eq.js ***!
+ \***********************************/
+/***/ (function(module) {
+/**
+ * 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);
+}
- /*
- Find the n largest elements in a dataset.
- */
+module.exports = eq;
- 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.
- */
+/***/ "./node_modules/lodash/filter.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/filter.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- 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;
- };
+var arrayFilter = __webpack_require__(/*! ./_arrayFilter */ "./node_modules/lodash/_arrayFilter.js"),
+ baseFilter = __webpack_require__(/*! ./_baseFilter */ "./node_modules/lodash/_baseFilter.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
- _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;
- };
+/**
+ * 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']
+ *
+ * // Combining several predicates using `_.overEvery` or `_.overSome`.
+ * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));
+ * // => objects for ['fred', 'barney']
+ */
+function filter(collection, predicate) {
+ var func = isArray(collection) ? arrayFilter : baseFilter;
+ return func(collection, baseIteratee(predicate, 3));
+}
- _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);
- };
+module.exports = filter;
- Heap = (function() {
- Heap.push = heappush;
- Heap.pop = heappop;
+/***/ }),
- Heap.replace = heapreplace;
+/***/ "./node_modules/lodash/find.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/find.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- Heap.pushpop = heappushpop;
+var createFind = __webpack_require__(/*! ./_createFind */ "./node_modules/lodash/_createFind.js"),
+ findIndex = __webpack_require__(/*! ./findIndex */ "./node_modules/lodash/findIndex.js");
- Heap.heapify = heapify;
+/**
+ * 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);
- Heap.updateItem = updateItem;
+module.exports = find;
- Heap.nlargest = nlargest;
- Heap.nsmallest = nsmallest;
+/***/ }),
- function Heap(cmp) {
- this.cmp = cmp != null ? cmp : defaultCmp;
- this.nodes = [];
- }
+/***/ "./node_modules/lodash/findIndex.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/findIndex.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- Heap.prototype.push = function(x) {
- return heappush(this.nodes, x, this.cmp);
- };
+var baseFindIndex = __webpack_require__(/*! ./_baseFindIndex */ "./node_modules/lodash/_baseFindIndex.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ toInteger = __webpack_require__(/*! ./toInteger */ "./node_modules/lodash/toInteger.js");
- Heap.prototype.pop = function() {
- return heappop(this.nodes, this.cmp);
- };
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max;
- Heap.prototype.peek = function() {
- return this.nodes[0];
- };
+/**
+ * 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, baseIteratee(predicate, 3), index);
+}
- Heap.prototype.contains = function(x) {
- return this.nodes.indexOf(x) !== -1;
- };
+module.exports = findIndex;
- 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);
- };
+/***/ "./node_modules/lodash/flatten.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/flatten.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- Heap.prototype.updateItem = function(x) {
- return updateItem(this.nodes, x, this.cmp);
- };
+var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js");
- Heap.prototype.clear = function() {
- return this.nodes = [];
- };
+/**
+ * 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) : [];
+}
- Heap.prototype.empty = function() {
- return this.nodes.length === 0;
- };
+module.exports = flatten;
- 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);
- };
+/***/ "./node_modules/lodash/forEach.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/forEach.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- Heap.prototype.insert = Heap.prototype.push;
+var arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
+ baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
+ castFunction = __webpack_require__(/*! ./_castFunction */ "./node_modules/lodash/_castFunction.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
- Heap.prototype.top = Heap.prototype.peek;
+/**
+ * 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, castFunction(iteratee));
+}
- Heap.prototype.front = Heap.prototype.peek;
+module.exports = forEach;
- Heap.prototype.has = Heap.prototype.contains;
- Heap.prototype.copy = Heap.prototype.clone;
+/***/ }),
- return Heap;
+/***/ "./node_modules/lodash/forIn.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/forIn.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- })();
+var baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
+ castFunction = __webpack_require__(/*! ./_castFunction */ "./node_modules/lodash/_castFunction.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
- (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 {}
- })(this, function() {
- return Heap;
- });
+/**
+ * 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, castFunction(iteratee), keysIn);
+}
-}).call(this);
+module.exports = forIn;
/***/ }),
-/***/ "./node_modules/hoist-non-react-statics/dist/hoist-non-react-statics.cjs.js":
-/*!**********************************************************************************!*\
- !*** ./node_modules/hoist-non-react-statics/dist/hoist-non-react-statics.cjs.js ***!
- \**********************************************************************************/
+/***/ "./node_modules/lodash/get.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/get.js ***!
+ \************************************/
/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-"use strict";
-
-
-var reactIs = __webpack_require__(/*! react-is */ "./node_modules/react-is/index.js");
+var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js");
/**
- * Copyright 2015, Yahoo! Inc.
- * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.
+ * 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'
*/
-var REACT_STATICS = {
- childContextTypes: true,
- contextType: true,
- contextTypes: true,
- defaultProps: true,
- displayName: true,
- getDefaultProps: true,
- getDerivedStateFromError: true,
- getDerivedStateFromProps: true,
- mixins: true,
- propTypes: true,
- type: true
-};
-var KNOWN_STATICS = {
- name: true,
- length: true,
- prototype: true,
- caller: true,
- callee: true,
- arguments: true,
- arity: true
-};
-var FORWARD_REF_STATICS = {
- '$$typeof': true,
- render: true,
- defaultProps: true,
- displayName: true,
- propTypes: true
-};
-var MEMO_STATICS = {
- '$$typeof': true,
- compare: true,
- defaultProps: true,
- displayName: true,
- propTypes: true,
- type: true
-};
-var TYPE_STATICS = {};
-TYPE_STATICS[reactIs.ForwardRef] = FORWARD_REF_STATICS;
-TYPE_STATICS[reactIs.Memo] = MEMO_STATICS;
-
-function getStatics(component) {
- // React v16.11 and below
- if (reactIs.isMemo(component)) {
- return MEMO_STATICS;
- } // React v16.12 and above
-
-
- return TYPE_STATICS[component['$$typeof']] || REACT_STATICS;
+function get(object, path, defaultValue) {
+ var result = object == null ? undefined : baseGet(object, path);
+ return result === undefined ? defaultValue : result;
}
-var defineProperty = Object.defineProperty;
-var getOwnPropertyNames = Object.getOwnPropertyNames;
-var getOwnPropertySymbols = Object.getOwnPropertySymbols;
-var getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor;
-var getPrototypeOf = Object.getPrototypeOf;
-var objectPrototype = Object.prototype;
-function hoistNonReactStatics(targetComponent, sourceComponent, blacklist) {
- if (typeof sourceComponent !== 'string') {
- // don't hoist over string (html) components
- if (objectPrototype) {
- var inheritedComponent = getPrototypeOf(sourceComponent);
-
- if (inheritedComponent && inheritedComponent !== objectPrototype) {
- hoistNonReactStatics(targetComponent, inheritedComponent, blacklist);
- }
- }
-
- var keys = getOwnPropertyNames(sourceComponent);
-
- if (getOwnPropertySymbols) {
- keys = keys.concat(getOwnPropertySymbols(sourceComponent));
- }
+module.exports = get;
- var targetStatics = getStatics(targetComponent);
- var sourceStatics = getStatics(sourceComponent);
- for (var i = 0; i < keys.length; ++i) {
- var key = keys[i];
+/***/ }),
- if (!KNOWN_STATICS[key] && !(blacklist && blacklist[key]) && !(sourceStatics && sourceStatics[key]) && !(targetStatics && targetStatics[key])) {
- var descriptor = getOwnPropertyDescriptor(sourceComponent, key);
+/***/ "./node_modules/lodash/has.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/has.js ***!
+ \************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- try {
- // Avoid failures from read-only properties
- defineProperty(targetComponent, key, descriptor);
- } catch (e) {}
- }
- }
- }
+var baseHas = __webpack_require__(/*! ./_baseHas */ "./node_modules/lodash/_baseHas.js"),
+ hasPath = __webpack_require__(/*! ./_hasPath */ "./node_modules/lodash/_hasPath.js");
- return targetComponent;
+/**
+ * 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);
}
-module.exports = hoistNonReactStatics;
+module.exports = has;
/***/ }),
-/***/ "./node_modules/invariant/browser.js":
-/*!*******************************************!*\
- !*** ./node_modules/invariant/browser.js ***!
- \*******************************************/
-/***/ (function(module) {
-
-"use strict";
-/**
- * Copyright (c) 2013-present, Facebook, Inc.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
+/***/ "./node_modules/lodash/hasIn.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/hasIn.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var baseHasIn = __webpack_require__(/*! ./_baseHasIn */ "./node_modules/lodash/_baseHasIn.js"),
+ hasPath = __webpack_require__(/*! ./_hasPath */ "./node_modules/lodash/_hasPath.js");
/**
- * Use invariant() to assert state which your program assumes to be true.
+ * Checks if `path` is a direct or inherited property of `object`.
*
- * Provide sprintf-style format (only %s is supported) and arguments
- * to provide information about what broke and what you were
- * expecting.
+ * @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
*
- * The invariant message will be stripped in production, but the invariant
- * will remain to ensure logic does not differ in production.
+ * 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);
+}
-var invariant = function(condition, format, a, b, c, d, e, f) {
- if (true) {
- if (format === undefined) {
- throw new Error('invariant requires an error message argument');
- }
- }
-
- if (!condition) {
- var error;
- if (format === undefined) {
- error = new Error(
- 'Minified exception occurred; use the non-minified dev environment ' +
- 'for the full error message and additional helpful warnings.'
- );
- } else {
- var args = [a, b, c, d, e, f];
- var argIndex = 0;
- error = new Error(
- format.replace(/%s/g, function() { return args[argIndex++]; })
- );
- error.name = 'Invariant Violation';
- }
-
- error.framesToPop = 1; // we don't care about invariant's own frame
- throw error;
- }
-};
-
-module.exports = invariant;
+module.exports = hasIn;
/***/ }),
-/***/ "./node_modules/is-string-blank/index.js":
-/*!***********************************************!*\
- !*** ./node_modules/is-string-blank/index.js ***!
- \***********************************************/
+/***/ "./node_modules/lodash/identity.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/identity.js ***!
+ \*****************************************/
/***/ (function(module) {
-"use strict";
-
-
-/**
- * Is this string all whitespace?
- * This solution kind of makes my brain hurt, but it's significantly faster
- * than !str.trim() or any other solution I could find.
- *
- * whitespace codes from: http://en.wikipedia.org/wiki/Whitespace_character
- * and verified with:
- *
- * for(var i = 0; i < 65536; i++) {
- * var s = String.fromCharCode(i);
- * if(+s===0 && !s.trim()) console.log(i, s);
- * }
- *
- * which counts a couple of these as *not* whitespace, but finds nothing else
- * that *is* whitespace. Note that charCodeAt stops at 16 bits, but it appears
- * that there are no whitespace characters above this, and code points above
- * this do not map onto white space characters.
- */
-
-module.exports = function(str){
- var l = str.length,
- a;
- for(var i = 0; i < l; i++) {
- a = str.charCodeAt(i);
- if((a < 9 || a > 13) && (a !== 32) && (a !== 133) && (a !== 160) &&
- (a !== 5760) && (a !== 6158) && (a < 8192 || a > 8205) &&
- (a !== 8232) && (a !== 8233) && (a !== 8239) && (a !== 8287) &&
- (a !== 8288) && (a !== 12288) && (a !== 65279)) {
- return false;
- }
- }
- return 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;
+}
-/***/ }),
+module.exports = identity;
-/***/ "./node_modules/layout-base/layout-base.js":
-/*!*************************************************!*\
- !*** ./node_modules/layout-base/layout-base.js ***!
- \*************************************************/
-/***/ (function(module) {
-(function webpackUniversalModuleDefinition(root, factory) {
- if(true)
- module.exports = factory();
- else {}
-})(this, function() {
-return /******/ (function(modules) { // webpackBootstrap
-/******/ // The module cache
-/******/ var installedModules = {};
-/******/
-/******/ // The require function
-/******/ function __nested_webpack_require_543__(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, __nested_webpack_require_543__);
-/******/
-/******/ // Flag the module as loaded
-/******/ module.l = true;
-/******/
-/******/ // Return the exports of the module
-/******/ return module.exports;
-/******/ }
-/******/
-/******/
-/******/ // expose the modules object (__webpack_modules__)
-/******/ __nested_webpack_require_543__.m = modules;
-/******/
-/******/ // expose the module cache
-/******/ __nested_webpack_require_543__.c = installedModules;
-/******/
-/******/ // identity function for calling harmony imports with the correct context
-/******/ __nested_webpack_require_543__.i = function(value) { return value; };
-/******/
-/******/ // define getter function for harmony exports
-/******/ __nested_webpack_require_543__.d = function(exports, name, getter) {
-/******/ if(!__nested_webpack_require_543__.o(exports, name)) {
-/******/ Object.defineProperty(exports, name, {
-/******/ configurable: false,
-/******/ enumerable: true,
-/******/ get: getter
-/******/ });
-/******/ }
-/******/ };
-/******/
-/******/ // getDefaultExport function for compatibility with non-harmony modules
-/******/ __nested_webpack_require_543__.n = function(module) {
-/******/ var getter = module && module.__esModule ?
-/******/ function getDefault() { return module['default']; } :
-/******/ function getModuleExports() { return module; };
-/******/ __nested_webpack_require_543__.d(getter, 'a', getter);
-/******/ return getter;
-/******/ };
-/******/
-/******/ // Object.prototype.hasOwnProperty.call
-/******/ __nested_webpack_require_543__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };
-/******/
-/******/ // __webpack_public_path__
-/******/ __nested_webpack_require_543__.p = "";
-/******/
-/******/ // Load entry module and return exports
-/******/ return __nested_webpack_require_543__(__nested_webpack_require_543__.s = 28);
-/******/ })
-/************************************************************************/
-/******/ ([
-/* 0 */
-/***/ (function(module, exports, __webpack_require__) {
+/***/ }),
-"use strict";
+/***/ "./node_modules/lodash/isArguments.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/isArguments.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var baseIsArguments = __webpack_require__(/*! ./_baseIsArguments */ "./node_modules/lodash/_baseIsArguments.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
-function LayoutConstants() {}
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
-/**
- * Layout Quality: 0:draft, 1:default, 2:proof
- */
-LayoutConstants.QUALITY = 1;
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
-/**
- * Default parameters
- */
-LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED = false;
-LayoutConstants.DEFAULT_INCREMENTAL = false;
-LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT = true;
-LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT = false;
-LayoutConstants.DEFAULT_ANIMATION_PERIOD = 50;
-LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES = false;
+/** Built-in value references. */
+var propertyIsEnumerable = objectProto.propertyIsEnumerable;
-// -----------------------------------------------------------------------------
-// Section: General other constants
-// -----------------------------------------------------------------------------
-/*
- * Margins of a graph to be applied on bouding rectangle of its contents. We
- * assume margins on all four sides to be uniform.
+/**
+ * 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
*/
-LayoutConstants.DEFAULT_GRAPH_MARGIN = 15;
+var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
+ return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&
+ !propertyIsEnumerable.call(value, 'callee');
+};
-/*
- * Whether to consider labels in node dimensions or not
- */
-LayoutConstants.NODE_DIMENSIONS_INCLUDE_LABELS = false;
+module.exports = isArguments;
-/*
- * Default dimension of a non-compound node.
- */
-LayoutConstants.SIMPLE_NODE_SIZE = 40;
-/*
- * Default dimension of a non-compound node.
- */
-LayoutConstants.SIMPLE_NODE_HALF_SIZE = LayoutConstants.SIMPLE_NODE_SIZE / 2;
+/***/ }),
-/*
- * Empty compound node size. When a compound node is empty, its both
- * dimensions should be of this value.
- */
-LayoutConstants.EMPTY_COMPOUND_NODE_SIZE = 40;
+/***/ "./node_modules/lodash/isArray.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/isArray.js ***!
+ \****************************************/
+/***/ (function(module) {
-/*
- * Minimum length that an edge should take during layout
+/**
+ * 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
*/
-LayoutConstants.MIN_EDGE_LENGTH = 1;
+var isArray = Array.isArray;
-/*
- * World boundaries that layout operates on
- */
-LayoutConstants.WORLD_BOUNDARY = 1000000;
+module.exports = isArray;
-/*
- * World boundaries that random positioning can be performed with
- */
-LayoutConstants.INITIAL_WORLD_BOUNDARY = LayoutConstants.WORLD_BOUNDARY / 1000;
-/*
- * Coordinates of the world center
- */
-LayoutConstants.WORLD_CENTER_X = 1200;
-LayoutConstants.WORLD_CENTER_Y = 900;
+/***/ }),
-module.exports = LayoutConstants;
+/***/ "./node_modules/lodash/isArrayLike.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/isArrayLike.js ***!
+ \********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-/***/ }),
-/* 1 */
-/***/ (function(module, exports, __nested_webpack_require_4947__) {
+var isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
+ isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js");
-"use strict";
+/**
+ * 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);
+}
+module.exports = isArrayLike;
-var LGraphObject = __nested_webpack_require_4947__(2);
-var IGeometry = __nested_webpack_require_4947__(8);
-var IMath = __nested_webpack_require_4947__(9);
-function LEdge(source, target, vEdge) {
- LGraphObject.call(this, vEdge);
+/***/ }),
- this.isOverlapingSourceAndTarget = false;
- this.vGraphObject = vEdge;
- this.bendpoints = [];
- this.source = source;
- this.target = target;
-}
+/***/ "./node_modules/lodash/isArrayLikeObject.js":
+/*!**************************************************!*\
+ !*** ./node_modules/lodash/isArrayLikeObject.js ***!
+ \**************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LEdge.prototype = Object.create(LGraphObject.prototype);
+var isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
-for (var prop in LGraphObject) {
- LEdge[prop] = LGraphObject[prop];
+/**
+ * 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);
}
-LEdge.prototype.getSource = function () {
- return this.source;
-};
+module.exports = isArrayLikeObject;
-LEdge.prototype.getTarget = function () {
- return this.target;
-};
-LEdge.prototype.isInterGraph = function () {
- return this.isInterGraph;
-};
+/***/ }),
-LEdge.prototype.getLength = function () {
- return this.length;
-};
+/***/ "./node_modules/lodash/isBuffer.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/isBuffer.js ***!
+ \*****************************************/
+/***/ (function(module, exports, __webpack_require__) {
-LEdge.prototype.isOverlapingSourceAndTarget = function () {
- return this.isOverlapingSourceAndTarget;
-};
+/* module decorator */ module = __webpack_require__.nmd(module);
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js"),
+ stubFalse = __webpack_require__(/*! ./stubFalse */ "./node_modules/lodash/stubFalse.js");
-LEdge.prototype.getBendpoints = function () {
- return this.bendpoints;
-};
+/** Detect free variable `exports`. */
+var freeExports = true && exports && !exports.nodeType && exports;
-LEdge.prototype.getLca = function () {
- return this.lca;
-};
+/** Detect free variable `module`. */
+var freeModule = freeExports && "object" == 'object' && module && !module.nodeType && module;
-LEdge.prototype.getSourceInLca = function () {
- return this.sourceInLca;
-};
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports = freeModule && freeModule.exports === freeExports;
-LEdge.prototype.getTargetInLca = function () {
- return this.targetInLca;
-};
+/** Built-in value references. */
+var Buffer = moduleExports ? root.Buffer : undefined;
-LEdge.prototype.getOtherEnd = function (node) {
- if (this.source === node) {
- return this.target;
- } else if (this.target === node) {
- return this.source;
- } else {
- throw "Node is not incident with this edge";
- }
-};
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;
-LEdge.prototype.getOtherEndInGraph = function (node, graph) {
- var otherEnd = this.getOtherEnd(node);
- var root = graph.getGraphManager().getRoot();
+/**
+ * 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;
- while (true) {
- if (otherEnd.getOwner() == graph) {
- return otherEnd;
- }
+module.exports = isBuffer;
- if (otherEnd.getOwner() == root) {
- break;
- }
- otherEnd = otherEnd.getOwner().getParent();
- }
+/***/ }),
- return null;
-};
+/***/ "./node_modules/lodash/isEmpty.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/isEmpty.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LEdge.prototype.updateLength = function () {
- var clipPointCoordinates = new Array(4);
+var baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
+ getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
+ isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
- this.isOverlapingSourceAndTarget = IGeometry.getIntersection(this.target.getRect(), this.source.getRect(), clipPointCoordinates);
+/** `Object#toString` result references. */
+var mapTag = '[object Map]',
+ setTag = '[object Set]';
- if (!this.isOverlapingSourceAndTarget) {
- this.lengthX = clipPointCoordinates[0] - clipPointCoordinates[2];
- this.lengthY = clipPointCoordinates[1] - clipPointCoordinates[3];
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
- if (Math.abs(this.lengthX) < 1.0) {
- this.lengthX = IMath.sign(this.lengthX);
- }
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
- if (Math.abs(this.lengthY) < 1.0) {
- this.lengthY = IMath.sign(this.lengthY);
+/**
+ * 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;
}
-
- this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
}
-};
+ return true;
+}
-LEdge.prototype.updateLengthSimple = function () {
- this.lengthX = this.target.getCenterX() - this.source.getCenterX();
- this.lengthY = this.target.getCenterY() - this.source.getCenterY();
+module.exports = isEmpty;
- if (Math.abs(this.lengthX) < 1.0) {
- this.lengthX = IMath.sign(this.lengthX);
- }
- if (Math.abs(this.lengthY) < 1.0) {
- this.lengthY = IMath.sign(this.lengthY);
+/***/ }),
+
+/***/ "./node_modules/lodash/isFunction.js":
+/*!*******************************************!*\
+ !*** ./node_modules/lodash/isFunction.js ***!
+ \*******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
+
+/** `Object#toString` result references. */
+var asyncTag = '[object AsyncFunction]',
+ funcTag = '[object Function]',
+ genTag = '[object GeneratorFunction]',
+ proxyTag = '[object Proxy]';
+
+/**
+ * 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;
+}
- this.length = Math.sqrt(this.lengthX * this.lengthX + this.lengthY * this.lengthY);
-};
+module.exports = isFunction;
-module.exports = LEdge;
/***/ }),
-/* 2 */
-/***/ (function(module, exports, __webpack_require__) {
-"use strict";
+/***/ "./node_modules/lodash/isLength.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/isLength.js ***!
+ \*****************************************/
+/***/ (function(module) {
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
-function LGraphObject(vGraphObject) {
- this.vGraphObject = vGraphObject;
+/**
+ * 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;
}
-module.exports = LGraphObject;
+module.exports = isLength;
+
/***/ }),
-/* 3 */
-/***/ (function(module, exports, __nested_webpack_require_8167__) {
-"use strict";
+/***/ "./node_modules/lodash/isMap.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/isMap.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseIsMap = __webpack_require__(/*! ./_baseIsMap */ "./node_modules/lodash/_baseIsMap.js"),
+ baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
+ nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
+/* Node.js helper references. */
+var nodeIsMap = nodeUtil && nodeUtil.isMap;
-var LGraphObject = __nested_webpack_require_8167__(2);
-var Integer = __nested_webpack_require_8167__(10);
-var RectangleD = __nested_webpack_require_8167__(13);
-var LayoutConstants = __nested_webpack_require_8167__(0);
-var RandomSeed = __nested_webpack_require_8167__(16);
-var PointD = __nested_webpack_require_8167__(5);
+/**
+ * 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;
-function LNode(gm, loc, size, vNode) {
- //Alternative constructor 1 : LNode(LGraphManager gm, Point loc, Dimension size, Object vNode)
- if (size == null && vNode == null) {
- vNode = loc;
- }
+module.exports = isMap;
- LGraphObject.call(this, vNode);
- //Alternative constructor 2 : LNode(Layout layout, Object vNode)
- if (gm.graphManager != null) gm = gm.graphManager;
+/***/ }),
- this.estimatedSize = Integer.MIN_VALUE;
- this.inclusionTreeDepth = Integer.MAX_VALUE;
- this.vGraphObject = vNode;
- this.edges = [];
- this.graphManager = gm;
+/***/ "./node_modules/lodash/isObject.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/isObject.js ***!
+ \*****************************************/
+/***/ (function(module) {
- if (size != null && loc != null) this.rect = new RectangleD(loc.x, loc.y, size.width, size.height);else this.rect = new RectangleD();
+/**
+ * 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');
}
-LNode.prototype = Object.create(LGraphObject.prototype);
-for (var prop in LGraphObject) {
- LNode[prop] = LGraphObject[prop];
-}
+module.exports = isObject;
-LNode.prototype.getEdges = function () {
- return this.edges;
-};
-LNode.prototype.getChild = function () {
- return this.child;
-};
+/***/ }),
-LNode.prototype.getOwner = function () {
- // if (this.owner != null) {
- // if (!(this.owner == null || this.owner.getNodes().indexOf(this) > -1)) {
- // throw "assert failed";
- // }
- // }
+/***/ "./node_modules/lodash/isObjectLike.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/isObjectLike.js ***!
+ \*********************************************/
+/***/ (function(module) {
- return this.owner;
-};
+/**
+ * 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';
+}
-LNode.prototype.getWidth = function () {
- return this.rect.width;
-};
+module.exports = isObjectLike;
-LNode.prototype.setWidth = function (width) {
- this.rect.width = width;
-};
-LNode.prototype.getHeight = function () {
- return this.rect.height;
-};
+/***/ }),
-LNode.prototype.setHeight = function (height) {
- this.rect.height = height;
-};
+/***/ "./node_modules/lodash/isPlainObject.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/isPlainObject.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LNode.prototype.getCenterX = function () {
- return this.rect.x + this.rect.width / 2;
-};
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
-LNode.prototype.getCenterY = function () {
- return this.rect.y + this.rect.height / 2;
-};
+/** `Object#toString` result references. */
+var objectTag = '[object Object]';
-LNode.prototype.getCenter = function () {
- return new PointD(this.rect.x + this.rect.width / 2, this.rect.y + this.rect.height / 2);
-};
+/** Used for built-in method references. */
+var funcProto = Function.prototype,
+ objectProto = Object.prototype;
-LNode.prototype.getLocation = function () {
- return new PointD(this.rect.x, this.rect.y);
-};
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
-LNode.prototype.getRect = function () {
- return this.rect;
-};
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
-LNode.prototype.getDiagonal = function () {
- return Math.sqrt(this.rect.width * this.rect.width + this.rect.height * this.rect.height);
-};
+/** Used to infer the `Object` constructor. */
+var objectCtorString = funcToString.call(Object);
/**
- * This method returns half the diagonal length of this node.
+ * 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
*/
-LNode.prototype.getHalfTheDiagonal = function () {
- return Math.sqrt(this.rect.height * this.rect.height + this.rect.width * this.rect.width) / 2;
-};
-
-LNode.prototype.setRect = function (upperLeft, dimension) {
- this.rect.x = upperLeft.x;
- this.rect.y = upperLeft.y;
- this.rect.width = dimension.width;
- this.rect.height = dimension.height;
-};
-
-LNode.prototype.setCenter = function (cx, cy) {
- this.rect.x = cx - this.rect.width / 2;
- this.rect.y = cy - this.rect.height / 2;
-};
-
-LNode.prototype.setLocation = function (x, y) {
- this.rect.x = x;
- this.rect.y = y;
-};
+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;
+}
-LNode.prototype.moveBy = function (dx, dy) {
- this.rect.x += dx;
- this.rect.y += dy;
-};
+module.exports = isPlainObject;
-LNode.prototype.getEdgeListToNode = function (to) {
- var edgeList = [];
- var edge;
- var self = this;
- self.edges.forEach(function (edge) {
+/***/ }),
- if (edge.target == to) {
- if (edge.source != self) throw "Incorrect edge source!";
+/***/ "./node_modules/lodash/isSet.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/isSet.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- edgeList.push(edge);
- }
- });
+var baseIsSet = __webpack_require__(/*! ./_baseIsSet */ "./node_modules/lodash/_baseIsSet.js"),
+ baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
+ nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
- return edgeList;
-};
+/* Node.js helper references. */
+var nodeIsSet = nodeUtil && nodeUtil.isSet;
-LNode.prototype.getEdgesBetween = function (other) {
- var edgeList = [];
- var edge;
+/**
+ * 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;
- var self = this;
- self.edges.forEach(function (edge) {
+module.exports = isSet;
- if (!(edge.source == self || edge.target == self)) throw "Incorrect edge source and/or target";
- if (edge.target == other || edge.source == other) {
- edgeList.push(edge);
- }
- });
+/***/ }),
- return edgeList;
-};
+/***/ "./node_modules/lodash/isString.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/isString.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LNode.prototype.getNeighborsList = function () {
- var neighbors = new Set();
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
- var self = this;
- self.edges.forEach(function (edge) {
+/** `Object#toString` result references. */
+var stringTag = '[object String]';
- if (edge.source == self) {
- neighbors.add(edge.target);
- } else {
- if (edge.target != self) {
- throw "Incorrect incidency!";
- }
+/**
+ * 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);
+}
- neighbors.add(edge.source);
- }
- });
+module.exports = isString;
- return neighbors;
-};
-LNode.prototype.withChildren = function () {
- var withNeighborsList = new Set();
- var childNode;
- var children;
+/***/ }),
- withNeighborsList.add(this);
+/***/ "./node_modules/lodash/isSymbol.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/isSymbol.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (this.child != null) {
- var nodes = this.child.getNodes();
- for (var i = 0; i < nodes.length; i++) {
- childNode = nodes[i];
- children = childNode.withChildren();
- children.forEach(function (node) {
- withNeighborsList.add(node);
- });
- }
- }
+var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
+ isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
- return withNeighborsList;
-};
+/** `Object#toString` result references. */
+var symbolTag = '[object Symbol]';
-LNode.prototype.getNoOfChildren = function () {
- var noOfChildren = 0;
- var childNode;
+/**
+ * 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);
+}
- if (this.child == null) {
- noOfChildren = 1;
- } else {
- var nodes = this.child.getNodes();
- for (var i = 0; i < nodes.length; i++) {
- childNode = nodes[i];
+module.exports = isSymbol;
- noOfChildren += childNode.getNoOfChildren();
- }
- }
- if (noOfChildren == 0) {
- noOfChildren = 1;
- }
- return noOfChildren;
-};
+/***/ }),
-LNode.prototype.getEstimatedSize = function () {
- if (this.estimatedSize == Integer.MIN_VALUE) {
- throw "assert failed";
- }
- return this.estimatedSize;
-};
+/***/ "./node_modules/lodash/isTypedArray.js":
+/*!*********************************************!*\
+ !*** ./node_modules/lodash/isTypedArray.js ***!
+ \*********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LNode.prototype.calcEstimatedSize = function () {
- if (this.child == null) {
- return this.estimatedSize = (this.rect.width + this.rect.height) / 2;
- } else {
- this.estimatedSize = this.child.calcEstimatedSize();
- this.rect.width = this.estimatedSize;
- this.rect.height = this.estimatedSize;
+var baseIsTypedArray = __webpack_require__(/*! ./_baseIsTypedArray */ "./node_modules/lodash/_baseIsTypedArray.js"),
+ baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
+ nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
- return this.estimatedSize;
- }
-};
+/* Node.js helper references. */
+var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
-LNode.prototype.scatter = function () {
- var randomCenterX;
- var randomCenterY;
+/**
+ * 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;
- var minX = -LayoutConstants.INITIAL_WORLD_BOUNDARY;
- var maxX = LayoutConstants.INITIAL_WORLD_BOUNDARY;
- randomCenterX = LayoutConstants.WORLD_CENTER_X + RandomSeed.nextDouble() * (maxX - minX) + minX;
+module.exports = isTypedArray;
- var minY = -LayoutConstants.INITIAL_WORLD_BOUNDARY;
- var maxY = LayoutConstants.INITIAL_WORLD_BOUNDARY;
- randomCenterY = LayoutConstants.WORLD_CENTER_Y + RandomSeed.nextDouble() * (maxY - minY) + minY;
- this.rect.x = randomCenterX;
- this.rect.y = randomCenterY;
-};
+/***/ }),
-LNode.prototype.updateBounds = function () {
- if (this.getChild() == null) {
- throw "assert failed";
- }
- if (this.getChild().getNodes().length != 0) {
- // wrap the children nodes by re-arranging the boundaries
- var childGraph = this.getChild();
- childGraph.updateBounds(true);
+/***/ "./node_modules/lodash/isUndefined.js":
+/*!********************************************!*\
+ !*** ./node_modules/lodash/isUndefined.js ***!
+ \********************************************/
+/***/ (function(module) {
- this.rect.x = childGraph.getLeft();
- this.rect.y = childGraph.getTop();
+/**
+ * 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;
+}
- this.setWidth(childGraph.getRight() - childGraph.getLeft());
- this.setHeight(childGraph.getBottom() - childGraph.getTop());
+module.exports = isUndefined;
- // Update compound bounds considering its label properties
- if (LayoutConstants.NODE_DIMENSIONS_INCLUDE_LABELS) {
- var width = childGraph.getRight() - childGraph.getLeft();
- var height = childGraph.getBottom() - childGraph.getTop();
+/***/ }),
- if (this.labelWidth) {
- if (this.labelPosHorizontal == "left") {
- this.rect.x -= this.labelWidth;
- this.setWidth(width + this.labelWidth);
- } else if (this.labelPosHorizontal == "center" && this.labelWidth > width) {
- this.rect.x -= (this.labelWidth - width) / 2;
- this.setWidth(this.labelWidth);
- } else if (this.labelPosHorizontal == "right") {
- this.setWidth(width + this.labelWidth);
- }
- }
+/***/ "./node_modules/lodash/keys.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/keys.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (this.labelHeight) {
- if (this.labelPosVertical == "top") {
- this.rect.y -= this.labelHeight;
- this.setHeight(height + this.labelHeight);
- } else if (this.labelPosVertical == "center" && this.labelHeight > height) {
- this.rect.y -= (this.labelHeight - height) / 2;
- this.setHeight(this.labelHeight);
- } else if (this.labelPosVertical == "bottom") {
- this.setHeight(height + this.labelHeight);
- }
- }
- }
- }
-};
+var arrayLikeKeys = __webpack_require__(/*! ./_arrayLikeKeys */ "./node_modules/lodash/_arrayLikeKeys.js"),
+ baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
-LNode.prototype.getInclusionTreeDepth = function () {
- if (this.inclusionTreeDepth == Integer.MAX_VALUE) {
- throw "assert failed";
- }
- return this.inclusionTreeDepth;
-};
+/**
+ * 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);
+}
-LNode.prototype.transform = function (trans) {
- var left = this.rect.x;
+module.exports = keys;
- if (left > LayoutConstants.WORLD_BOUNDARY) {
- left = LayoutConstants.WORLD_BOUNDARY;
- } else if (left < -LayoutConstants.WORLD_BOUNDARY) {
- left = -LayoutConstants.WORLD_BOUNDARY;
- }
- var top = this.rect.y;
+/***/ }),
- if (top > LayoutConstants.WORLD_BOUNDARY) {
- top = LayoutConstants.WORLD_BOUNDARY;
- } else if (top < -LayoutConstants.WORLD_BOUNDARY) {
- top = -LayoutConstants.WORLD_BOUNDARY;
- }
+/***/ "./node_modules/lodash/keysIn.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/keysIn.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var leftTop = new PointD(left, top);
- var vLeftTop = trans.inverseTransformPoint(leftTop);
+var arrayLikeKeys = __webpack_require__(/*! ./_arrayLikeKeys */ "./node_modules/lodash/_arrayLikeKeys.js"),
+ baseKeysIn = __webpack_require__(/*! ./_baseKeysIn */ "./node_modules/lodash/_baseKeysIn.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
- this.setLocation(vLeftTop.x, vLeftTop.y);
-};
+/**
+ * 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);
+}
-LNode.prototype.getLeft = function () {
- return this.rect.x;
-};
+module.exports = keysIn;
-LNode.prototype.getRight = function () {
- return this.rect.x + this.rect.width;
-};
-LNode.prototype.getTop = function () {
- return this.rect.y;
-};
+/***/ }),
-LNode.prototype.getBottom = function () {
- return this.rect.y + this.rect.height;
-};
+/***/ "./node_modules/lodash/last.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/last.js ***!
+ \*************************************/
+/***/ (function(module) {
-LNode.prototype.getParent = function () {
- if (this.owner == null) {
- return null;
- }
+/**
+ * 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;
+}
- return this.owner.getParent();
-};
+module.exports = last;
-module.exports = LNode;
/***/ }),
-/* 4 */
-/***/ (function(module, exports, __nested_webpack_require_17290__) {
-"use strict";
-
-
-var LayoutConstants = __nested_webpack_require_17290__(0);
+/***/ "./node_modules/lodash/map.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/map.js ***!
+ \************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-function FDLayoutConstants() {}
+var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ baseMap = __webpack_require__(/*! ./_baseMap */ "./node_modules/lodash/_baseMap.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
-//FDLayoutConstants inherits static props in LayoutConstants
-for (var prop in LayoutConstants) {
- FDLayoutConstants[prop] = LayoutConstants[prop];
+/**
+ * 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, baseIteratee(iteratee, 3));
}
-FDLayoutConstants.MAX_ITERATIONS = 2500;
-
-FDLayoutConstants.DEFAULT_EDGE_LENGTH = 50;
-FDLayoutConstants.DEFAULT_SPRING_STRENGTH = 0.45;
-FDLayoutConstants.DEFAULT_REPULSION_STRENGTH = 4500.0;
-FDLayoutConstants.DEFAULT_GRAVITY_STRENGTH = 0.4;
-FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_STRENGTH = 1.0;
-FDLayoutConstants.DEFAULT_GRAVITY_RANGE_FACTOR = 3.8;
-FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR = 1.5;
-FDLayoutConstants.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION = true;
-FDLayoutConstants.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION = true;
-FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL = 0.3;
-FDLayoutConstants.COOLING_ADAPTATION_FACTOR = 0.33;
-FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT = 1000;
-FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT = 5000;
-FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL = 100.0;
-FDLayoutConstants.MAX_NODE_DISPLACEMENT = FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL * 3;
-FDLayoutConstants.MIN_REPULSION_DIST = FDLayoutConstants.DEFAULT_EDGE_LENGTH / 10.0;
-FDLayoutConstants.CONVERGENCE_CHECK_PERIOD = 100;
-FDLayoutConstants.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR = 0.1;
-FDLayoutConstants.MIN_EDGE_LENGTH = 1;
-FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD = 10;
+module.exports = map;
-module.exports = FDLayoutConstants;
/***/ }),
-/* 5 */
-/***/ (function(module, exports, __webpack_require__) {
-"use strict";
+/***/ "./node_modules/lodash/mapValues.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/mapValues.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
+ baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js");
-function PointD(x, y) {
- if (x == null && y == null) {
- this.x = 0;
- this.y = 0;
- } else {
- this.x = x;
- this.y = y;
- }
+/**
+ * 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 = baseIteratee(iteratee, 3);
+
+ baseForOwn(object, function(value, key, object) {
+ baseAssignValue(result, key, iteratee(value, key, object));
+ });
+ return result;
}
-PointD.prototype.getX = function () {
- return this.x;
-};
+module.exports = mapValues;
-PointD.prototype.getY = function () {
- return this.y;
-};
-PointD.prototype.setX = function (x) {
- this.x = x;
-};
+/***/ }),
-PointD.prototype.setY = function (y) {
- this.y = y;
-};
+/***/ "./node_modules/lodash/max.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/max.js ***!
+ \************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-PointD.prototype.getDifference = function (pt) {
- return new DimensionD(this.x - pt.x, this.y - pt.y);
-};
+var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
+ baseGt = __webpack_require__(/*! ./_baseGt */ "./node_modules/lodash/_baseGt.js"),
+ identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
-PointD.prototype.getCopy = function () {
- return new PointD(this.x, this.y);
-};
+/**
+ * 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;
+}
-PointD.prototype.translate = function (dim) {
- this.x += dim.width;
- this.y += dim.height;
- return this;
-};
+module.exports = max;
-module.exports = PointD;
/***/ }),
-/* 6 */
-/***/ (function(module, exports, __nested_webpack_require_19670__) {
-
-"use strict";
+/***/ "./node_modules/lodash/memoize.js":
+/*!****************************************!*\
+ !*** ./node_modules/lodash/memoize.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var LGraphObject = __nested_webpack_require_19670__(2);
-var Integer = __nested_webpack_require_19670__(10);
-var LayoutConstants = __nested_webpack_require_19670__(0);
-var LGraphManager = __nested_webpack_require_19670__(7);
-var LNode = __nested_webpack_require_19670__(3);
-var LEdge = __nested_webpack_require_19670__(1);
-var RectangleD = __nested_webpack_require_19670__(13);
-var Point = __nested_webpack_require_19670__(12);
-var LinkedList = __nested_webpack_require_19670__(11);
+var MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js");
-function LGraph(parent, obj2, vGraph) {
- LGraphObject.call(this, vGraph);
- this.estimatedSize = Integer.MIN_VALUE;
- this.margin = LayoutConstants.DEFAULT_GRAPH_MARGIN;
- this.edges = [];
- this.nodes = [];
- this.isConnected = false;
- this.parent = parent;
+/** Error message constants. */
+var FUNC_ERROR_TEXT = 'Expected a function';
- if (obj2 != null && obj2 instanceof LGraphManager) {
- this.graphManager = obj2;
- } else if (obj2 != null && obj2 instanceof Layout) {
- this.graphManager = obj2.graphManager;
+/**
+ * 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;
-LGraph.prototype = Object.create(LGraphObject.prototype);
-for (var prop in LGraphObject) {
- LGraph[prop] = LGraphObject[prop];
+ 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;
}
-LGraph.prototype.getNodes = function () {
- return this.nodes;
-};
+// Expose `MapCache`.
+memoize.Cache = MapCache;
-LGraph.prototype.getEdges = function () {
- return this.edges;
-};
+module.exports = memoize;
-LGraph.prototype.getGraphManager = function () {
- return this.graphManager;
-};
-LGraph.prototype.getParent = function () {
- return this.parent;
-};
+/***/ }),
-LGraph.prototype.getLeft = function () {
- return this.left;
-};
+/***/ "./node_modules/lodash/merge.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/merge.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraph.prototype.getRight = function () {
- return this.right;
-};
+var baseMerge = __webpack_require__(/*! ./_baseMerge */ "./node_modules/lodash/_baseMerge.js"),
+ createAssigner = __webpack_require__(/*! ./_createAssigner */ "./node_modules/lodash/_createAssigner.js");
+
+/**
+ * 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);
+});
+
+module.exports = merge;
+
+
+/***/ }),
+
+/***/ "./node_modules/lodash/min.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/min.js ***!
+ \************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+
+var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
+ baseLt = __webpack_require__(/*! ./_baseLt */ "./node_modules/lodash/_baseLt.js"),
+ identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
+
+/**
+ * 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;
+}
+
+module.exports = min;
-LGraph.prototype.getTop = function () {
- return this.top;
-};
-LGraph.prototype.getBottom = function () {
- return this.bottom;
-};
+/***/ }),
-LGraph.prototype.isConnected = function () {
- return this.isConnected;
-};
+/***/ "./node_modules/lodash/minBy.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/minBy.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraph.prototype.add = function (obj1, sourceNode, targetNode) {
- if (sourceNode == null && targetNode == null) {
- var newNode = obj1;
- if (this.graphManager == null) {
- throw "Graph has no graph mgr!";
- }
- if (this.getNodes().indexOf(newNode) > -1) {
- throw "Node already in graph!";
- }
- newNode.owner = this;
- this.getNodes().push(newNode);
+var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ baseLt = __webpack_require__(/*! ./_baseLt */ "./node_modules/lodash/_baseLt.js");
- return newNode;
- } else {
- var newEdge = obj1;
- if (!(this.getNodes().indexOf(sourceNode) > -1 && this.getNodes().indexOf(targetNode) > -1)) {
- throw "Source or target not in graph!";
- }
+/**
+ * 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, baseIteratee(iteratee, 2), baseLt)
+ : undefined;
+}
- if (!(sourceNode.owner == targetNode.owner && sourceNode.owner == this)) {
- throw "Both owners must be this graph!";
- }
+module.exports = minBy;
- if (sourceNode.owner != targetNode.owner) {
- return null;
- }
- // set source and target
- newEdge.source = sourceNode;
- newEdge.target = targetNode;
+/***/ }),
- // set as intra-graph edge
- newEdge.isInterGraph = false;
+/***/ "./node_modules/lodash/noop.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/noop.js ***!
+ \*************************************/
+/***/ (function(module) {
- // add to graph edge list
- this.getEdges().push(newEdge);
+/**
+ * This method returns `undefined`.
+ *
+ * @static
+ * @memberOf _
+ * @since 2.3.0
+ * @category Util
+ * @example
+ *
+ * _.times(2, _.noop);
+ * // => [undefined, undefined]
+ */
+function noop() {
+ // No operation performed.
+}
- // add to incidency lists
- sourceNode.edges.push(newEdge);
+module.exports = noop;
- if (targetNode != sourceNode) {
- targetNode.edges.push(newEdge);
- }
- return newEdge;
- }
-};
+/***/ }),
-LGraph.prototype.remove = function (obj) {
- var node = obj;
- if (obj instanceof LNode) {
- if (node == null) {
- throw "Node is null!";
- }
- if (!(node.owner != null && node.owner == this)) {
- throw "Owner graph is invalid!";
- }
- if (this.graphManager == null) {
- throw "Owner graph manager is invalid!";
- }
- // remove incident edges first (make a copy to do it safely)
- var edgesToBeRemoved = node.edges.slice();
- var edge;
- var s = edgesToBeRemoved.length;
- for (var i = 0; i < s; i++) {
- edge = edgesToBeRemoved[i];
+/***/ "./node_modules/lodash/now.js":
+/*!************************************!*\
+ !*** ./node_modules/lodash/now.js ***!
+ \************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (edge.isInterGraph) {
- this.graphManager.remove(edge);
- } else {
- edge.source.owner.remove(edge);
- }
- }
+var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
- // now the node itself
- var index = this.nodes.indexOf(node);
- if (index == -1) {
- throw "Node not in owner node list!";
- }
+/**
+ * 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 = function() {
+ return root.Date.now();
+};
- this.nodes.splice(index, 1);
- } else if (obj instanceof LEdge) {
- var edge = obj;
- if (edge == null) {
- throw "Edge is null!";
- }
- if (!(edge.source != null && edge.target != null)) {
- throw "Source and/or target is null!";
- }
- if (!(edge.source.owner != null && edge.target.owner != null && edge.source.owner == this && edge.target.owner == this)) {
- throw "Source and/or target owner is invalid!";
- }
+module.exports = now;
- var sourceIndex = edge.source.edges.indexOf(edge);
- var targetIndex = edge.target.edges.indexOf(edge);
- if (!(sourceIndex > -1 && targetIndex > -1)) {
- throw "Source and/or target doesn't know this edge!";
- }
- edge.source.edges.splice(sourceIndex, 1);
+/***/ }),
- if (edge.target != edge.source) {
- edge.target.edges.splice(targetIndex, 1);
- }
+/***/ "./node_modules/lodash/pick.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/pick.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var index = edge.source.owner.getEdges().indexOf(edge);
- if (index == -1) {
- throw "Not in owner's edge list!";
- }
+var basePick = __webpack_require__(/*! ./_basePick */ "./node_modules/lodash/_basePick.js"),
+ flatRest = __webpack_require__(/*! ./_flatRest */ "./node_modules/lodash/_flatRest.js");
- edge.source.owner.getEdges().splice(index, 1);
- }
-};
+/**
+ * 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);
+});
-LGraph.prototype.updateLeftTop = function () {
- var top = Integer.MAX_VALUE;
- var left = Integer.MAX_VALUE;
- var nodeTop;
- var nodeLeft;
- var margin;
+module.exports = pick;
- var nodes = this.getNodes();
- var s = nodes.length;
- for (var i = 0; i < s; i++) {
- var lNode = nodes[i];
- nodeTop = lNode.getTop();
- nodeLeft = lNode.getLeft();
+/***/ }),
- if (top > nodeTop) {
- top = nodeTop;
- }
+/***/ "./node_modules/lodash/property.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/property.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (left > nodeLeft) {
- left = nodeLeft;
- }
- }
+var baseProperty = __webpack_require__(/*! ./_baseProperty */ "./node_modules/lodash/_baseProperty.js"),
+ basePropertyDeep = __webpack_require__(/*! ./_basePropertyDeep */ "./node_modules/lodash/_basePropertyDeep.js"),
+ isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
+ toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
- // Do we have any nodes in this graph?
- if (top == Integer.MAX_VALUE) {
- return null;
- }
+/**
+ * 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);
+}
- if (nodes[0].getParent().paddingLeft != undefined) {
- margin = nodes[0].getParent().paddingLeft;
- } else {
- margin = this.margin;
- }
+module.exports = property;
- this.left = left - margin;
- this.top = top - margin;
- // Apply the margins and return the result
- return new Point(this.left, this.top);
-};
+/***/ }),
-LGraph.prototype.updateBounds = function (recursive) {
- // calculate bounds
- var left = Integer.MAX_VALUE;
- var right = -Integer.MAX_VALUE;
- var top = Integer.MAX_VALUE;
- var bottom = -Integer.MAX_VALUE;
- var nodeLeft;
- var nodeRight;
- var nodeTop;
- var nodeBottom;
- var margin;
+/***/ "./node_modules/lodash/range.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/range.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var nodes = this.nodes;
- var s = nodes.length;
- for (var i = 0; i < s; i++) {
- var lNode = nodes[i];
+var createRange = __webpack_require__(/*! ./_createRange */ "./node_modules/lodash/_createRange.js");
- if (recursive && lNode.child != null) {
- lNode.updateBounds();
- }
- nodeLeft = lNode.getLeft();
- nodeRight = lNode.getRight();
- nodeTop = lNode.getTop();
- nodeBottom = lNode.getBottom();
+/**
+ * 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();
- if (left > nodeLeft) {
- left = nodeLeft;
- }
+module.exports = range;
- if (right < nodeRight) {
- right = nodeRight;
- }
- if (top > nodeTop) {
- top = nodeTop;
- }
+/***/ }),
- if (bottom < nodeBottom) {
- bottom = nodeBottom;
- }
- }
+/***/ "./node_modules/lodash/reduce.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/reduce.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var boundingRect = new RectangleD(left, top, right - left, bottom - top);
- if (left == Integer.MAX_VALUE) {
- this.left = this.parent.getLeft();
- this.right = this.parent.getRight();
- this.top = this.parent.getTop();
- this.bottom = this.parent.getBottom();
- }
+var arrayReduce = __webpack_require__(/*! ./_arrayReduce */ "./node_modules/lodash/_arrayReduce.js"),
+ baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ baseReduce = __webpack_require__(/*! ./_baseReduce */ "./node_modules/lodash/_baseReduce.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
- if (nodes[0].getParent().paddingLeft != undefined) {
- margin = nodes[0].getParent().paddingLeft;
- } else {
- margin = this.margin;
- }
+/**
+ * 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;
- this.left = boundingRect.x - margin;
- this.right = boundingRect.x + boundingRect.width + margin;
- this.top = boundingRect.y - margin;
- this.bottom = boundingRect.y + boundingRect.height + margin;
-};
+ return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);
+}
-LGraph.calculateBounds = function (nodes) {
- var left = Integer.MAX_VALUE;
- var right = -Integer.MAX_VALUE;
- var top = Integer.MAX_VALUE;
- var bottom = -Integer.MAX_VALUE;
- var nodeLeft;
- var nodeRight;
- var nodeTop;
- var nodeBottom;
+module.exports = reduce;
- var s = nodes.length;
- for (var i = 0; i < s; i++) {
- var lNode = nodes[i];
- nodeLeft = lNode.getLeft();
- nodeRight = lNode.getRight();
- nodeTop = lNode.getTop();
- nodeBottom = lNode.getBottom();
+/***/ }),
- if (left > nodeLeft) {
- left = nodeLeft;
- }
+/***/ "./node_modules/lodash/size.js":
+/*!*************************************!*\
+ !*** ./node_modules/lodash/size.js ***!
+ \*************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (right < nodeRight) {
- right = nodeRight;
- }
+var baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
+ getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
+ isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
+ isString = __webpack_require__(/*! ./isString */ "./node_modules/lodash/isString.js"),
+ stringSize = __webpack_require__(/*! ./_stringSize */ "./node_modules/lodash/_stringSize.js");
- if (top > nodeTop) {
- top = nodeTop;
- }
+/** `Object#toString` result references. */
+var mapTag = '[object Map]',
+ setTag = '[object Set]';
- if (bottom < nodeBottom) {
- bottom = nodeBottom;
- }
+/**
+ * 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;
+}
- var boundingRect = new RectangleD(left, top, right - left, bottom - top);
+module.exports = size;
- return boundingRect;
-};
-LGraph.prototype.getInclusionTreeDepth = function () {
- if (this == this.graphManager.getRoot()) {
- return 1;
- } else {
- return this.parent.getInclusionTreeDepth();
- }
-};
+/***/ }),
-LGraph.prototype.getEstimatedSize = function () {
- if (this.estimatedSize == Integer.MIN_VALUE) {
- throw "assert failed";
- }
- return this.estimatedSize;
-};
+/***/ "./node_modules/lodash/sortBy.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/sortBy.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraph.prototype.calcEstimatedSize = function () {
- var size = 0;
- var nodes = this.nodes;
- var s = nodes.length;
+var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js"),
+ baseOrderBy = __webpack_require__(/*! ./_baseOrderBy */ "./node_modules/lodash/_baseOrderBy.js"),
+ baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
+ isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js");
- for (var i = 0; i < s; i++) {
- var lNode = nodes[i];
- size += lNode.calcEstimatedSize();
+/**
+ * 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': 30 },
+ * { 'user': 'barney', 'age': 34 }
+ * ];
+ *
+ * _.sortBy(users, [function(o) { return o.user; }]);
+ * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]
+ *
+ * _.sortBy(users, ['user', 'age']);
+ * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]
+ */
+var sortBy = baseRest(function(collection, iteratees) {
+ if (collection == null) {
+ return [];
}
-
- if (size == 0) {
- this.estimatedSize = LayoutConstants.EMPTY_COMPOUND_NODE_SIZE;
- } else {
- this.estimatedSize = size / Math.sqrt(this.nodes.length);
+ 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), []);
+});
- return this.estimatedSize;
-};
+module.exports = sortBy;
-LGraph.prototype.updateConnected = function () {
- var self = this;
- if (this.nodes.length == 0) {
- this.isConnected = true;
- return;
- }
- var queue = new LinkedList();
- var visited = new Set();
- var currentNode = this.nodes[0];
- var neighborEdges;
- var currentNeighbor;
- var childrenOfNode = currentNode.withChildren();
- childrenOfNode.forEach(function (node) {
- queue.push(node);
- visited.add(node);
- });
+/***/ }),
- while (queue.length !== 0) {
- currentNode = queue.shift();
+/***/ "./node_modules/lodash/stubArray.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/stubArray.js ***!
+ \******************************************/
+/***/ (function(module) {
- // Traverse all neighbors of this node
- neighborEdges = currentNode.getEdges();
- var size = neighborEdges.length;
- for (var i = 0; i < size; i++) {
- var neighborEdge = neighborEdges[i];
- currentNeighbor = neighborEdge.getOtherEndInGraph(currentNode, this);
+/**
+ * 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 [];
+}
- // Add unvisited neighbors to the list to visit
- if (currentNeighbor != null && !visited.has(currentNeighbor)) {
- var childrenOfNeighbor = currentNeighbor.withChildren();
+module.exports = stubArray;
- childrenOfNeighbor.forEach(function (node) {
- queue.push(node);
- visited.add(node);
- });
- }
- }
- }
- this.isConnected = false;
+/***/ }),
- if (visited.size >= this.nodes.length) {
- var noOfVisitedInThisGraph = 0;
+/***/ "./node_modules/lodash/stubFalse.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/stubFalse.js ***!
+ \******************************************/
+/***/ (function(module) {
- visited.forEach(function (visitedNode) {
- if (visitedNode.owner == self) {
- noOfVisitedInThisGraph++;
- }
- });
+/**
+ * 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;
+}
- if (noOfVisitedInThisGraph == this.nodes.length) {
- this.isConnected = true;
- }
- }
-};
+module.exports = stubFalse;
-module.exports = LGraph;
/***/ }),
-/* 7 */
-/***/ (function(module, exports, __nested_webpack_require_29738__) {
-
-"use strict";
+/***/ "./node_modules/lodash/toFinite.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/toFinite.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var LGraph;
-var LEdge = __nested_webpack_require_29738__(1);
+var toNumber = __webpack_require__(/*! ./toNumber */ "./node_modules/lodash/toNumber.js");
-function LGraphManager(layout) {
- LGraph = __nested_webpack_require_29738__(6); // It may be better to initilize this out of this function but it gives an error (Right-hand side of 'instanceof' is not callable) now.
- this.layout = layout;
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0,
+ MAX_INTEGER = 1.7976931348623157e+308;
- this.graphs = [];
- this.edges = [];
+/**
+ * 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;
}
-LGraphManager.prototype.addRoot = function () {
- var ngraph = this.layout.newGraph();
- var nnode = this.layout.newNode(null);
- var root = this.add(ngraph, nnode);
- this.setRootGraph(root);
- return this.rootGraph;
-};
-
-LGraphManager.prototype.add = function (newGraph, parentNode, newEdge, sourceNode, targetNode) {
- //there are just 2 parameters are passed then it adds an LGraph else it adds an LEdge
- if (newEdge == null && sourceNode == null && targetNode == null) {
- if (newGraph == null) {
- throw "Graph is null!";
- }
- if (parentNode == null) {
- throw "Parent node is null!";
- }
- if (this.graphs.indexOf(newGraph) > -1) {
- throw "Graph already in this graph mgr!";
- }
-
- this.graphs.push(newGraph);
-
- if (newGraph.parent != null) {
- throw "Already has a parent!";
- }
- if (parentNode.child != null) {
- throw "Already has a child!";
- }
-
- newGraph.parent = parentNode;
- parentNode.child = newGraph;
-
- return newGraph;
- } else {
- //change the order of the parameters
- targetNode = newEdge;
- sourceNode = parentNode;
- newEdge = newGraph;
- var sourceGraph = sourceNode.getOwner();
- var targetGraph = targetNode.getOwner();
-
- if (!(sourceGraph != null && sourceGraph.getGraphManager() == this)) {
- throw "Source not in this graph mgr!";
- }
- if (!(targetGraph != null && targetGraph.getGraphManager() == this)) {
- throw "Target not in this graph mgr!";
- }
+module.exports = toFinite;
- if (sourceGraph == targetGraph) {
- newEdge.isInterGraph = false;
- return sourceGraph.add(newEdge, sourceNode, targetNode);
- } else {
- newEdge.isInterGraph = true;
- // set source and target
- newEdge.source = sourceNode;
- newEdge.target = targetNode;
+/***/ }),
- // add edge to inter-graph edge list
- if (this.edges.indexOf(newEdge) > -1) {
- throw "Edge already in inter-graph edge list!";
- }
+/***/ "./node_modules/lodash/toInteger.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/toInteger.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- this.edges.push(newEdge);
+var toFinite = __webpack_require__(/*! ./toFinite */ "./node_modules/lodash/toFinite.js");
- // add edge to source and target incidency lists
- if (!(newEdge.source != null && newEdge.target != null)) {
- throw "Edge source and/or target is null!";
- }
+/**
+ * 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;
- if (!(newEdge.source.edges.indexOf(newEdge) == -1 && newEdge.target.edges.indexOf(newEdge) == -1)) {
- throw "Edge already in source and/or target incidency list!";
- }
+ return result === result ? (remainder ? result - remainder : result) : 0;
+}
- newEdge.source.edges.push(newEdge);
- newEdge.target.edges.push(newEdge);
+module.exports = toInteger;
- return newEdge;
- }
- }
-};
-LGraphManager.prototype.remove = function (lObj) {
- if (lObj instanceof LGraph) {
- var graph = lObj;
- if (graph.getGraphManager() != this) {
- throw "Graph not in this graph mgr";
- }
- if (!(graph == this.rootGraph || graph.parent != null && graph.parent.graphManager == this)) {
- throw "Invalid parent node!";
- }
+/***/ }),
- // first the edges (make a copy to do it safely)
- var edgesToBeRemoved = [];
+/***/ "./node_modules/lodash/toNumber.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/toNumber.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- edgesToBeRemoved = edgesToBeRemoved.concat(graph.getEdges());
+var baseTrim = __webpack_require__(/*! ./_baseTrim */ "./node_modules/lodash/_baseTrim.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
- var edge;
- var s = edgesToBeRemoved.length;
- for (var i = 0; i < s; i++) {
- edge = edgesToBeRemoved[i];
- graph.remove(edge);
- }
+/** Used as references for various `Number` constants. */
+var NAN = 0 / 0;
- // then the nodes (make a copy to do it safely)
- var nodesToBeRemoved = [];
+/** Used to detect bad signed hexadecimal string values. */
+var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
- nodesToBeRemoved = nodesToBeRemoved.concat(graph.getNodes());
+/** Used to detect binary string values. */
+var reIsBinary = /^0b[01]+$/i;
- var node;
- s = nodesToBeRemoved.length;
- for (var i = 0; i < s; i++) {
- node = nodesToBeRemoved[i];
- graph.remove(node);
- }
+/** Used to detect octal string values. */
+var reIsOctal = /^0o[0-7]+$/i;
- // check if graph is the root
- if (graph == this.rootGraph) {
- this.setRootGraph(null);
- }
+/** Built-in method references without a dependency on `root`. */
+var freeParseInt = parseInt;
- // now remove the graph itself
- var index = this.graphs.indexOf(graph);
- this.graphs.splice(index, 1);
+/**
+ * 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 = baseTrim(value);
+ var isBinary = reIsBinary.test(value);
+ return (isBinary || reIsOctal.test(value))
+ ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
+ : (reIsBadHex.test(value) ? NAN : +value);
+}
- // also reset the parent of the graph
- graph.parent = null;
- } else if (lObj instanceof LEdge) {
- edge = lObj;
- if (edge == null) {
- throw "Edge is null!";
- }
- if (!edge.isInterGraph) {
- throw "Not an inter-graph edge!";
- }
- if (!(edge.source != null && edge.target != null)) {
- throw "Source and/or target is null!";
- }
+module.exports = toNumber;
- // remove edge from source and target nodes' incidency lists
- if (!(edge.source.edges.indexOf(edge) != -1 && edge.target.edges.indexOf(edge) != -1)) {
- throw "Source and/or target doesn't know this edge!";
- }
+/***/ }),
- var index = edge.source.edges.indexOf(edge);
- edge.source.edges.splice(index, 1);
- index = edge.target.edges.indexOf(edge);
- edge.target.edges.splice(index, 1);
+/***/ "./node_modules/lodash/toPlainObject.js":
+/*!**********************************************!*\
+ !*** ./node_modules/lodash/toPlainObject.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // remove edge from owner graph manager's inter-graph edge list
+var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
+ keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
- if (!(edge.source.owner != null && edge.source.owner.getGraphManager() != null)) {
- throw "Edge owner graph or owner graph manager is null!";
- }
- if (edge.source.owner.getGraphManager().edges.indexOf(edge) == -1) {
- throw "Not in owner graph manager's edge list!";
- }
+/**
+ * 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));
+}
- var index = edge.source.owner.getGraphManager().edges.indexOf(edge);
- edge.source.owner.getGraphManager().edges.splice(index, 1);
- }
-};
+module.exports = toPlainObject;
-LGraphManager.prototype.updateBounds = function () {
- this.rootGraph.updateBounds(true);
-};
-LGraphManager.prototype.getGraphs = function () {
- return this.graphs;
-};
+/***/ }),
-LGraphManager.prototype.getAllNodes = function () {
- if (this.allNodes == null) {
- var nodeList = [];
- var graphs = this.getGraphs();
- var s = graphs.length;
- for (var i = 0; i < s; i++) {
- nodeList = nodeList.concat(graphs[i].getNodes());
- }
- this.allNodes = nodeList;
- }
- return this.allNodes;
-};
+/***/ "./node_modules/lodash/toString.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/toString.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraphManager.prototype.resetAllNodes = function () {
- this.allNodes = null;
-};
+var baseToString = __webpack_require__(/*! ./_baseToString */ "./node_modules/lodash/_baseToString.js");
-LGraphManager.prototype.resetAllEdges = function () {
- this.allEdges = null;
-};
+/**
+ * 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);
+}
-LGraphManager.prototype.resetAllNodesToApplyGravitation = function () {
- this.allNodesToApplyGravitation = null;
-};
+module.exports = toString;
-LGraphManager.prototype.getAllEdges = function () {
- if (this.allEdges == null) {
- var edgeList = [];
- var graphs = this.getGraphs();
- var s = graphs.length;
- for (var i = 0; i < graphs.length; i++) {
- edgeList = edgeList.concat(graphs[i].getEdges());
- }
- edgeList = edgeList.concat(this.edges);
+/***/ }),
- this.allEdges = edgeList;
- }
- return this.allEdges;
-};
+/***/ "./node_modules/lodash/transform.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/transform.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraphManager.prototype.getAllNodesToApplyGravitation = function () {
- return this.allNodesToApplyGravitation;
-};
+var arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
+ baseCreate = __webpack_require__(/*! ./_baseCreate */ "./node_modules/lodash/_baseCreate.js"),
+ baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
+ baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
+ getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
+ isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
+ isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
+ isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
+ isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
+ isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
-LGraphManager.prototype.setAllNodesToApplyGravitation = function (nodeList) {
- if (this.allNodesToApplyGravitation != null) {
- throw "assert failed";
- }
+/**
+ * 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);
- this.allNodesToApplyGravitation = nodeList;
-};
+ iteratee = baseIteratee(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;
+}
-LGraphManager.prototype.getRoot = function () {
- return this.rootGraph;
-};
+module.exports = transform;
-LGraphManager.prototype.setRootGraph = function (graph) {
- if (graph.getGraphManager() != this) {
- throw "Root not in this graph mgr!";
- }
- this.rootGraph = graph;
- // root graph must have a root node associated with it for convenience
- if (graph.parent == null) {
- graph.parent = this.layout.newNode("Root node");
- }
-};
+/***/ }),
-LGraphManager.prototype.getLayout = function () {
- return this.layout;
-};
+/***/ "./node_modules/lodash/union.js":
+/*!**************************************!*\
+ !*** ./node_modules/lodash/union.js ***!
+ \**************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-LGraphManager.prototype.isOneAncestorOfOther = function (firstNode, secondNode) {
- if (!(firstNode != null && secondNode != null)) {
- throw "assert failed";
- }
+var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js"),
+ baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
+ baseUniq = __webpack_require__(/*! ./_baseUniq */ "./node_modules/lodash/_baseUniq.js"),
+ isArrayLikeObject = __webpack_require__(/*! ./isArrayLikeObject */ "./node_modules/lodash/isArrayLikeObject.js");
- if (firstNode == secondNode) {
- return true;
- }
- // Is second node an ancestor of the first one?
- var ownerGraph = firstNode.getOwner();
- var parentNode;
+/**
+ * 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));
+});
- do {
- parentNode = ownerGraph.getParent();
+module.exports = union;
- if (parentNode == null) {
- break;
- }
- if (parentNode == secondNode) {
- return true;
- }
+/***/ }),
- ownerGraph = parentNode.getOwner();
- if (ownerGraph == null) {
- break;
- }
- } while (true);
- // Is first node an ancestor of the second one?
- ownerGraph = secondNode.getOwner();
+/***/ "./node_modules/lodash/uniqueId.js":
+/*!*****************************************!*\
+ !*** ./node_modules/lodash/uniqueId.js ***!
+ \*****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- do {
- parentNode = ownerGraph.getParent();
+var toString = __webpack_require__(/*! ./toString */ "./node_modules/lodash/toString.js");
- if (parentNode == null) {
- break;
- }
+/** Used to generate unique IDs. */
+var idCounter = 0;
- if (parentNode == firstNode) {
- return true;
- }
+/**
+ * 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;
+}
- ownerGraph = parentNode.getOwner();
- if (ownerGraph == null) {
- break;
- }
- } while (true);
+module.exports = uniqueId;
- return false;
-};
-LGraphManager.prototype.calcLowestCommonAncestors = function () {
- var edge;
- var sourceNode;
- var targetNode;
- var sourceAncestorGraph;
- var targetAncestorGraph;
+/***/ }),
- var edges = this.getAllEdges();
- var s = edges.length;
- for (var i = 0; i < s; i++) {
- edge = edges[i];
+/***/ "./node_modules/lodash/values.js":
+/*!***************************************!*\
+ !*** ./node_modules/lodash/values.js ***!
+ \***************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- sourceNode = edge.source;
- targetNode = edge.target;
- edge.lca = null;
- edge.sourceInLca = sourceNode;
- edge.targetInLca = targetNode;
+var baseValues = __webpack_require__(/*! ./_baseValues */ "./node_modules/lodash/_baseValues.js"),
+ keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
- if (sourceNode == targetNode) {
- edge.lca = sourceNode.getOwner();
- continue;
- }
+/**
+ * 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));
+}
- sourceAncestorGraph = sourceNode.getOwner();
+module.exports = values;
- while (edge.lca == null) {
- edge.targetInLca = targetNode;
- targetAncestorGraph = targetNode.getOwner();
- while (edge.lca == null) {
- if (targetAncestorGraph == sourceAncestorGraph) {
- edge.lca = targetAncestorGraph;
- break;
- }
+/***/ }),
- if (targetAncestorGraph == this.rootGraph) {
- break;
- }
+/***/ "./node_modules/lodash/zipObject.js":
+/*!******************************************!*\
+ !*** ./node_modules/lodash/zipObject.js ***!
+ \******************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- if (edge.lca != null) {
- throw "assert failed";
- }
- edge.targetInLca = targetAncestorGraph.getParent();
- targetAncestorGraph = edge.targetInLca.getOwner();
- }
+var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
+ baseZipObject = __webpack_require__(/*! ./_baseZipObject */ "./node_modules/lodash/_baseZipObject.js");
- if (sourceAncestorGraph == this.rootGraph) {
- break;
- }
+/**
+ * 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);
+}
- if (edge.lca == null) {
- edge.sourceInLca = sourceAncestorGraph.getParent();
- sourceAncestorGraph = edge.sourceInLca.getOwner();
- }
- }
+module.exports = zipObject;
- if (edge.lca == null) {
- throw "assert failed";
- }
- }
-};
-LGraphManager.prototype.calcLowestCommonAncestor = function (firstNode, secondNode) {
- if (firstNode == secondNode) {
- return firstNode.getOwner();
- }
- var firstOwnerGraph = firstNode.getOwner();
+/***/ }),
- do {
- if (firstOwnerGraph == null) {
- break;
- }
- var secondOwnerGraph = secondNode.getOwner();
+/***/ "./node_modules/prop-types/lib/ReactPropTypesSecret.js":
+/*!*************************************************************!*\
+ !*** ./node_modules/prop-types/lib/ReactPropTypesSecret.js ***!
+ \*************************************************************/
+/***/ (function(module) {
- do {
- if (secondOwnerGraph == null) {
- break;
- }
+"use strict";
+/**
+ * Copyright (c) 2013-present, Facebook, Inc.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
- if (secondOwnerGraph == firstOwnerGraph) {
- return secondOwnerGraph;
- }
- secondOwnerGraph = secondOwnerGraph.getParent().getOwner();
- } while (true);
- firstOwnerGraph = firstOwnerGraph.getParent().getOwner();
- } while (true);
- return firstOwnerGraph;
-};
+var ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';
-LGraphManager.prototype.calcInclusionTreeDepths = function (graph, depth) {
- if (graph == null && depth == null) {
- graph = this.rootGraph;
- depth = 1;
- }
- var node;
+module.exports = ReactPropTypesSecret;
- var nodes = graph.getNodes();
- var s = nodes.length;
- for (var i = 0; i < s; i++) {
- node = nodes[i];
- node.inclusionTreeDepth = depth;
- if (node.child != null) {
- this.calcInclusionTreeDepths(node.child, depth + 1);
- }
- }
-};
+/***/ }),
-LGraphManager.prototype.includesInvalidEdge = function () {
- var edge;
- var edgesToRemove = [];
+/***/ "./node_modules/react-base16-styling/lib/esm/colorConverters.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/react-base16-styling/lib/esm/colorConverters.js ***!
+ \**********************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- var s = this.edges.length;
- for (var i = 0; i < s; i++) {
- edge = this.edges[i];
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ rgb2yuv: function() { return /* binding */ rgb2yuv; },
+/* harmony export */ yuv2rgb: function() { return /* binding */ yuv2rgb; }
+/* harmony export */ });
+function yuv2rgb(yuv) {
+ var y = yuv[0],
+ u = yuv[1],
+ v = yuv[2];
+ var r, g, b;
+ r = y * 1 + u * 0 + v * 1.13983;
+ g = y * 1 + u * -0.39465 + v * -0.5806;
+ b = y * 1 + u * 2.02311 + v * 0;
+ r = Math.min(Math.max(0, r), 1);
+ g = Math.min(Math.max(0, g), 1);
+ b = Math.min(Math.max(0, b), 1);
+ return [r * 255, g * 255, b * 255];
+}
+function rgb2yuv(rgb) {
+ var r = rgb[0] / 255,
+ g = rgb[1] / 255,
+ b = rgb[2] / 255;
+ var y = r * 0.299 + g * 0.587 + b * 0.114;
+ var u = r * -0.14713 + g * -0.28886 + b * 0.436;
+ var v = r * 0.615 + g * -0.51499 + b * -0.10001;
+ return [y, u, v];
+}
- if (this.isOneAncestorOfOther(edge.source, edge.target)) {
- edgesToRemove.push(edge);
- }
- }
+/***/ }),
- // Remove invalid edges from graph manager
- for (var i = 0; i < edgesToRemove.length; i++) {
- this.remove(edgesToRemove[i]);
- }
+/***/ "./node_modules/react-base16-styling/lib/esm/index.js":
+/*!************************************************************!*\
+ !*** ./node_modules/react-base16-styling/lib/esm/index.js ***!
+ \************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // Invalid edges are cleared, so return false
- return false;
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ createStyling: function() { return /* binding */ createStyling; },
+/* harmony export */ getBase16Theme: function() { return /* binding */ getBase16Theme; },
+/* harmony export */ invertBase16Theme: function() { return /* binding */ invertBase16Theme; },
+/* harmony export */ invertTheme: function() { return /* binding */ invertTheme; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/typeof */ "./node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/slicedToArray */ "./node_modules/@babel/runtime/helpers/esm/slicedToArray.js");
+/* harmony import */ var base16__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! base16 */ "./node_modules/base16/lib/index.js");
+/* harmony import */ var color__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! color */ "./node_modules/color/index.js");
+/* harmony import */ var color__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(color__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var lodash_curry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash.curry */ "./node_modules/lodash.curry/index.js");
+/* harmony import */ var lodash_curry__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(lodash_curry__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _colorConverters__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./colorConverters */ "./node_modules/react-base16-styling/lib/esm/colorConverters.js");
-module.exports = LGraphManager;
-/***/ }),
-/* 8 */
-/***/ (function(module, exports, __nested_webpack_require_41052__) {
-"use strict";
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-/**
- * This class maintains a list of static geometry related utility methods.
- *
- *
- * Copyright: i-Vis Research Group, Bilkent University, 2007 - present
- */
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-var Point = __nested_webpack_require_41052__(12);
-function IGeometry() {}
-/**
- * This method calculates *half* the amount in x and y directions of the two
- * input rectangles needed to separate them keeping their respective
- * positioning, and returns the result in the input array. An input
- * separation buffer added to the amount in both directions. We assume that
- * the two rectangles do intersect.
- */
-IGeometry.calcSeparationAmount = function (rectA, rectB, overlapAmount, separationBuffer) {
- if (!rectA.intersects(rectB)) {
- throw "assert failed";
- }
- var directions = new Array(2);
- this.decideDirectionsForOverlappingNodes(rectA, rectB, directions);
+var DEFAULT_BASE16 = base16__WEBPACK_IMPORTED_MODULE_3__["default"];
+var BASE16_KEYS = Object.keys(DEFAULT_BASE16); // we need a correcting factor, so that a dark, but not black background color
+// converts to bright enough inversed color
- overlapAmount[0] = Math.min(rectA.getRight(), rectB.getRight()) - Math.max(rectA.x, rectB.x);
- overlapAmount[1] = Math.min(rectA.getBottom(), rectB.getBottom()) - Math.max(rectA.y, rectB.y);
+var flip = function flip(x) {
+ return x < 0.25 ? 1 : x < 0.5 ? 0.9 - x : 1.1 - x;
+};
- // update the overlapping amounts for the following cases:
- if (rectA.getX() <= rectB.getX() && rectA.getRight() >= rectB.getRight()) {
- /* Case x.1:
- *
- * rectA
- * | |
- * | _________ |
- * | | | |
- * |________|_______|______|
- * | |
- * | |
- * rectB
- */
- overlapAmount[0] += Math.min(rectB.getX() - rectA.getX(), rectA.getRight() - rectB.getRight());
- } else if (rectB.getX() <= rectA.getX() && rectB.getRight() >= rectA.getRight()) {
- /* Case x.2:
- *
- * rectB
- * | |
- * | _________ |
- * | | | |
- * |________|_______|______|
- * | |
- * | |
- * rectA
- */
- overlapAmount[0] += Math.min(rectA.getX() - rectB.getX(), rectB.getRight() - rectA.getRight());
- }
- if (rectA.getY() <= rectB.getY() && rectA.getBottom() >= rectB.getBottom()) {
- /* Case y.1:
- * ________ rectA
- * |
- * |
- * ______|____ rectB
- * | |
- * | |
- * ______|____|
- * |
- * |
- * |________
- *
- */
- overlapAmount[1] += Math.min(rectB.getY() - rectA.getY(), rectA.getBottom() - rectB.getBottom());
- } else if (rectB.getY() <= rectA.getY() && rectB.getBottom() >= rectA.getBottom()) {
- /* Case y.2:
- * ________ rectB
- * |
- * |
- * ______|____ rectA
- * | |
- * | |
- * ______|____|
- * |
- * |
- * |________
- *
- */
- overlapAmount[1] += Math.min(rectA.getY() - rectB.getY(), rectB.getBottom() - rectA.getBottom());
- }
+var invertColor = function invertColor(hexString) {
+ var color = color__WEBPACK_IMPORTED_MODULE_4___default()(hexString);
- // find slope of the line passes two centers
- var slope = Math.abs((rectB.getCenterY() - rectA.getCenterY()) / (rectB.getCenterX() - rectA.getCenterX()));
- // if centers are overlapped
- if (rectB.getCenterY() === rectA.getCenterY() && rectB.getCenterX() === rectA.getCenterX()) {
- // assume the slope is 1 (45 degree)
- slope = 1.0;
- }
+ var _rgb2yuv = (0,_colorConverters__WEBPACK_IMPORTED_MODULE_6__.rgb2yuv)(color.array()),
+ _rgb2yuv2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__["default"])(_rgb2yuv, 3),
+ y = _rgb2yuv2[0],
+ u = _rgb2yuv2[1],
+ v = _rgb2yuv2[2];
- var moveByY = slope * overlapAmount[0];
- var moveByX = overlapAmount[1] / slope;
- if (overlapAmount[0] < moveByX) {
- moveByX = overlapAmount[0];
- } else {
- moveByY = overlapAmount[1];
- }
- // return half the amount so that if each rectangle is moved by these
- // amounts in opposite directions, overlap will be resolved
- overlapAmount[0] = -1 * directions[0] * (moveByX / 2 + separationBuffer);
- overlapAmount[1] = -1 * directions[1] * (moveByY / 2 + separationBuffer);
+ var flippedYuv = [flip(y), u, v];
+ var rgb = (0,_colorConverters__WEBPACK_IMPORTED_MODULE_6__.yuv2rgb)(flippedYuv);
+ return color__WEBPACK_IMPORTED_MODULE_4___default().rgb(rgb).hex();
};
-/**
- * This method decides the separation direction of overlapping nodes
- *
- * if directions[0] = -1, then rectA goes left
- * if directions[0] = 1, then rectA goes right
- * if directions[1] = -1, then rectA goes up
- * if directions[1] = 1, then rectA goes down
- */
-IGeometry.decideDirectionsForOverlappingNodes = function (rectA, rectB, directions) {
- if (rectA.getCenterX() < rectB.getCenterX()) {
- directions[0] = -1;
- } else {
- directions[0] = 1;
- }
-
- if (rectA.getCenterY() < rectB.getCenterY()) {
- directions[1] = -1;
- } else {
- directions[1] = 1;
- }
+var merger = function merger(styling) {
+ return function (prevStyling) {
+ return {
+ className: [prevStyling.className, styling.className].filter(Boolean).join(' '),
+ style: _objectSpread(_objectSpread({}, prevStyling.style || {}), styling.style || {})
+ };
+ };
};
-/**
- * This method calculates the intersection (clipping) points of the two
- * input rectangles with line segment defined by the centers of these two
- * rectangles. The clipping points are saved in the input double array and
- * whether or not the two rectangles overlap is returned.
- */
-IGeometry.getIntersection2 = function (rectA, rectB, result) {
- //result[0-1] will contain clipPoint of rectA, result[2-3] will contain clipPoint of rectB
- var p1x = rectA.getCenterX();
- var p1y = rectA.getCenterY();
- var p2x = rectB.getCenterX();
- var p2y = rectB.getCenterY();
-
- //if two rectangles intersect, then clipping points are centers
- if (rectA.intersects(rectB)) {
- result[0] = p1x;
- result[1] = p1y;
- result[2] = p2x;
- result[3] = p2y;
- return true;
+var mergeStyling = function mergeStyling(customStyling, defaultStyling) {
+ if (customStyling === undefined) {
+ return defaultStyling;
}
- //variables for rectA
- var topLeftAx = rectA.getX();
- var topLeftAy = rectA.getY();
- var topRightAx = rectA.getRight();
- var bottomLeftAx = rectA.getX();
- var bottomLeftAy = rectA.getBottom();
- var bottomRightAx = rectA.getRight();
- var halfWidthA = rectA.getWidthHalf();
- var halfHeightA = rectA.getHeightHalf();
- //variables for rectB
- var topLeftBx = rectB.getX();
- var topLeftBy = rectB.getY();
- var topRightBx = rectB.getRight();
- var bottomLeftBx = rectB.getX();
- var bottomLeftBy = rectB.getBottom();
- var bottomRightBx = rectB.getRight();
- var halfWidthB = rectB.getWidthHalf();
- var halfHeightB = rectB.getHeightHalf();
-
- //flag whether clipping points are found
- var clipPointAFound = false;
- var clipPointBFound = false;
- // line is vertical
- if (p1x === p2x) {
- if (p1y > p2y) {
- result[0] = p1x;
- result[1] = topLeftAy;
- result[2] = p2x;
- result[3] = bottomLeftBy;
- return false;
- } else if (p1y < p2y) {
- result[0] = p1x;
- result[1] = bottomLeftAy;
- result[2] = p2x;
- result[3] = topLeftBy;
- return false;
- } else {
- //not line, return null;
- }
+ if (defaultStyling === undefined) {
+ return customStyling;
}
- // line is horizontal
- else if (p1y === p2y) {
- if (p1x > p2x) {
- result[0] = topLeftAx;
- result[1] = p1y;
- result[2] = topRightBx;
- result[3] = p2y;
- return false;
- } else if (p1x < p2x) {
- result[0] = topRightAx;
- result[1] = p1y;
- result[2] = topLeftBx;
- result[3] = p2y;
- return false;
- } else {
- //not valid line, return null;
- }
- } else {
- //slopes of rectA's and rectB's diagonals
- var slopeA = rectA.height / rectA.width;
- var slopeB = rectB.height / rectB.width;
- //slope of line between center of rectA and center of rectB
- var slopePrime = (p2y - p1y) / (p2x - p1x);
- var cardinalDirectionA = void 0;
- var cardinalDirectionB = void 0;
- var tempPointAx = void 0;
- var tempPointAy = void 0;
- var tempPointBx = void 0;
- var tempPointBy = void 0;
+ var customType = (0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(customStyling);
- //determine whether clipping point is the corner of nodeA
- if (-slopeA === slopePrime) {
- if (p1x > p2x) {
- result[0] = bottomLeftAx;
- result[1] = bottomLeftAy;
- clipPointAFound = true;
- } else {
- result[0] = topRightAx;
- result[1] = topLeftAy;
- clipPointAFound = true;
- }
- } else if (slopeA === slopePrime) {
- if (p1x > p2x) {
- result[0] = topLeftAx;
- result[1] = topLeftAy;
- clipPointAFound = true;
- } else {
- result[0] = bottomRightAx;
- result[1] = bottomLeftAy;
- clipPointAFound = true;
- }
- }
+ var defaultType = (0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(defaultStyling);
- //determine whether clipping point is the corner of nodeB
- if (-slopeB === slopePrime) {
- if (p2x > p1x) {
- result[2] = bottomLeftBx;
- result[3] = bottomLeftBy;
- clipPointBFound = true;
- } else {
- result[2] = topRightBx;
- result[3] = topLeftBy;
- clipPointBFound = true;
- }
- } else if (slopeB === slopePrime) {
- if (p2x > p1x) {
- result[2] = topLeftBx;
- result[3] = topLeftBy;
- clipPointBFound = true;
- } else {
- result[2] = bottomRightBx;
- result[3] = bottomLeftBy;
- clipPointBFound = true;
- }
- }
+ switch (customType) {
+ case 'string':
+ switch (defaultType) {
+ case 'string':
+ return [defaultStyling, customStyling].filter(Boolean).join(' ');
- //if both clipping points are corners
- if (clipPointAFound && clipPointBFound) {
- return false;
- }
+ case 'object':
+ return merger({
+ className: customStyling,
+ style: defaultStyling
+ });
- //determine Cardinal Direction of rectangles
- if (p1x > p2x) {
- if (p1y > p2y) {
- cardinalDirectionA = this.getCardinalDirection(slopeA, slopePrime, 4);
- cardinalDirectionB = this.getCardinalDirection(slopeB, slopePrime, 2);
- } else {
- cardinalDirectionA = this.getCardinalDirection(-slopeA, slopePrime, 3);
- cardinalDirectionB = this.getCardinalDirection(-slopeB, slopePrime, 1);
- }
- } else {
- if (p1y > p2y) {
- cardinalDirectionA = this.getCardinalDirection(-slopeA, slopePrime, 1);
- cardinalDirectionB = this.getCardinalDirection(-slopeB, slopePrime, 3);
- } else {
- cardinalDirectionA = this.getCardinalDirection(slopeA, slopePrime, 2);
- cardinalDirectionB = this.getCardinalDirection(slopeB, slopePrime, 4);
- }
- }
- //calculate clipping Point if it is not found before
- if (!clipPointAFound) {
- switch (cardinalDirectionA) {
- case 1:
- tempPointAy = topLeftAy;
- tempPointAx = p1x + -halfHeightA / slopePrime;
- result[0] = tempPointAx;
- result[1] = tempPointAy;
- break;
- case 2:
- tempPointAx = bottomRightAx;
- tempPointAy = p1y + halfWidthA * slopePrime;
- result[0] = tempPointAx;
- result[1] = tempPointAy;
- break;
- case 3:
- tempPointAy = bottomLeftAy;
- tempPointAx = p1x + halfHeightA / slopePrime;
- result[0] = tempPointAx;
- result[1] = tempPointAy;
- break;
- case 4:
- tempPointAx = bottomLeftAx;
- tempPointAy = p1y + -halfWidthA * slopePrime;
- result[0] = tempPointAx;
- result[1] = tempPointAy;
- break;
- }
- }
- if (!clipPointBFound) {
- switch (cardinalDirectionB) {
- case 1:
- tempPointBy = topLeftBy;
- tempPointBx = p2x + -halfHeightB / slopePrime;
- result[2] = tempPointBx;
- result[3] = tempPointBy;
- break;
- case 2:
- tempPointBx = bottomRightBx;
- tempPointBy = p2y + halfWidthB * slopePrime;
- result[2] = tempPointBx;
- result[3] = tempPointBy;
- break;
- case 3:
- tempPointBy = bottomLeftBy;
- tempPointBx = p2x + halfHeightB / slopePrime;
- result[2] = tempPointBx;
- result[3] = tempPointBy;
- break;
- case 4:
- tempPointBx = bottomLeftBx;
- tempPointBy = p2y + -halfWidthB * slopePrime;
- result[2] = tempPointBx;
- result[3] = tempPointBy;
- break;
- }
+ case 'function':
+ return function (styling) {
+ for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+ args[_key - 1] = arguments[_key];
+ }
+
+ return merger({
+ className: customStyling
+ })(defaultStyling.apply(void 0, [styling].concat(args)));
+ };
}
- }
- return false;
-};
-/**
- * This method returns in which cardinal direction does input point stays
- * 1: North
- * 2: East
- * 3: South
- * 4: West
- */
-IGeometry.getCardinalDirection = function (slope, slopePrime, line) {
- if (slope > slopePrime) {
- return line;
- } else {
- return 1 + line % 4;
- }
-};
+ break;
-/**
- * This method calculates the intersection of the two lines defined by
- * point pairs (s1,s2) and (f1,f2).
- */
-IGeometry.getIntersection = function (s1, s2, f1, f2) {
- if (f2 == null) {
- return this.getIntersection2(s1, s2, f1);
- }
+ case 'object':
+ switch (defaultType) {
+ case 'string':
+ return merger({
+ className: defaultStyling,
+ style: customStyling
+ });
- var x1 = s1.x;
- var y1 = s1.y;
- var x2 = s2.x;
- var y2 = s2.y;
- var x3 = f1.x;
- var y3 = f1.y;
- var x4 = f2.x;
- var y4 = f2.y;
- var x = void 0,
- y = void 0; // intersection point
- var a1 = void 0,
- a2 = void 0,
- b1 = void 0,
- b2 = void 0,
- c1 = void 0,
- c2 = void 0; // coefficients of line eqns.
- var denom = void 0;
+ case 'object':
+ return _objectSpread(_objectSpread({}, defaultStyling), customStyling);
- a1 = y2 - y1;
- b1 = x1 - x2;
- c1 = x2 * y1 - x1 * y2; // { a1*x + b1*y + c1 = 0 is line 1 }
+ case 'function':
+ return function (styling) {
+ for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
+ args[_key2 - 1] = arguments[_key2];
+ }
- a2 = y4 - y3;
- b2 = x3 - x4;
- c2 = x4 * y3 - x3 * y4; // { a2*x + b2*y + c2 = 0 is line 2 }
+ return merger({
+ style: customStyling
+ })(defaultStyling.apply(void 0, [styling].concat(args)));
+ };
+ }
- denom = a1 * b2 - a2 * b1;
+ break;
- if (denom === 0) {
- return null;
- }
+ case 'function':
+ switch (defaultType) {
+ case 'string':
+ return function (styling) {
+ for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
+ args[_key3 - 1] = arguments[_key3];
+ }
- x = (b1 * c2 - b2 * c1) / denom;
- y = (a2 * c1 - a1 * c2) / denom;
+ return customStyling.apply(void 0, [merger(styling)({
+ className: defaultStyling
+ })].concat(args));
+ };
- return new Point(x, y);
-};
+ case 'object':
+ return function (styling) {
+ for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {
+ args[_key4 - 1] = arguments[_key4];
+ }
-/**
- * This method finds and returns the angle of the vector from the + x-axis
- * in clockwise direction (compatible w/ Java coordinate system!).
- */
-IGeometry.angleOfVector = function (Cx, Cy, Nx, Ny) {
- var C_angle = void 0;
+ return customStyling.apply(void 0, [merger(styling)({
+ style: defaultStyling
+ })].concat(args));
+ };
- if (Cx !== Nx) {
- C_angle = Math.atan((Ny - Cy) / (Nx - Cx));
+ case 'function':
+ return function (styling) {
+ for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {
+ args[_key5 - 1] = arguments[_key5];
+ }
- if (Nx < Cx) {
- C_angle += Math.PI;
- } else if (Ny < Cy) {
- C_angle += this.TWO_PI;
- }
- } else if (Ny < Cy) {
- C_angle = this.ONE_AND_HALF_PI; // 270 degrees
- } else {
- C_angle = this.HALF_PI; // 90 degrees
- }
+ return customStyling.apply(void 0, [defaultStyling.apply(void 0, [styling].concat(args))].concat(args));
+ };
+ }
- return C_angle;
+ }
};
-/**
- * This method checks whether the given two line segments (one with point
- * p1 and p2, the other with point p3 and p4) intersect at a point other
- * than these points.
- */
-IGeometry.doIntersect = function (p1, p2, p3, p4) {
- var a = p1.x;
- var b = p1.y;
- var c = p2.x;
- var d = p2.y;
- var p = p3.x;
- var q = p3.y;
- var r = p4.x;
- var s = p4.y;
- var det = (c - a) * (s - q) - (r - p) * (d - b);
+var mergeStylings = function mergeStylings(customStylings, defaultStylings) {
+ var keys = Object.keys(defaultStylings);
- if (det === 0) {
- return false;
- } else {
- var lambda = ((s - q) * (r - a) + (p - r) * (s - b)) / det;
- var gamma = ((b - d) * (r - a) + (c - a) * (s - b)) / det;
- return 0 < lambda && lambda < 1 && 0 < gamma && gamma < 1;
+ for (var key in customStylings) {
+ if (keys.indexOf(key) === -1) keys.push(key);
}
+
+ return keys.reduce(function (mergedStyling, key) {
+ return mergedStyling[key] = mergeStyling(customStylings[key], defaultStylings[key]), mergedStyling;
+ }, {});
};
-/**
- * This method checks and calculates the intersection of
- * a line segment and a circle.
- */
-IGeometry.findCircleLineIntersections = function (Ex, Ey, Lx, Ly, Cx, Cy, r) {
+var getStylingByKeys = function getStylingByKeys(mergedStyling, keys) {
+ for (var _len6 = arguments.length, args = new Array(_len6 > 2 ? _len6 - 2 : 0), _key6 = 2; _key6 < _len6; _key6++) {
+ args[_key6 - 2] = arguments[_key6];
+ }
- // E is the starting point of the ray,
- // L is the end point of the ray,
- // C is the center of sphere you're testing against
- // r is the radius of that sphere
+ if (keys === null) {
+ return mergedStyling;
+ }
- // Compute:
- // d = L - E ( Direction vector of ray, from start to end )
- // f = E - C ( Vector from center sphere to ray start )
+ if (!Array.isArray(keys)) {
+ keys = [keys];
+ }
- // Then the intersection is found by..
- // P = E + t * d
- // This is a parametric equation:
- // Px = Ex + tdx
- // Py = Ey + tdy
+ var styles = keys.map(function (key) {
+ return mergedStyling[key];
+ }).filter(Boolean);
+ var props = styles.reduce(function (obj, s) {
+ if (typeof s === 'string') {
+ obj.className = [obj.className, s].filter(Boolean).join(' ');
+ } else if ((0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(s) === 'object') {
+ obj.style = _objectSpread(_objectSpread({}, obj.style), s);
+ } else if (typeof s === 'function') {
+ obj = _objectSpread(_objectSpread({}, obj), s.apply(void 0, [obj].concat(args)));
+ }
- // get a, b, c values
- var a = (Lx - Ex) * (Lx - Ex) + (Ly - Ey) * (Ly - Ey);
- var b = 2 * ((Ex - Cx) * (Lx - Ex) + (Ey - Cy) * (Ly - Ey));
- var c = (Ex - Cx) * (Ex - Cx) + (Ey - Cy) * (Ey - Cy) - r * r;
+ return obj;
+ }, {
+ className: '',
+ style: {}
+ });
- // get discriminant
- var disc = b * b - 4 * a * c;
- if (disc >= 0) {
- // insert into quadratic formula
- var t1 = (-b + Math.sqrt(b * b - 4 * a * c)) / (2 * a);
- var t2 = (-b - Math.sqrt(b * b - 4 * a * c)) / (2 * a);
- var intersections = null;
- if (t1 >= 0 && t1 <= 1) {
- // t1 is the intersection, and it's closer than t2
- // (since t1 uses -b - discriminant)
- // Impale, Poke
- return [t1];
- }
+ if (!props.className) {
+ delete props.className;
+ }
- // here t1 didn't intersect so we are either started
- // inside the sphere or completely past it
- if (t2 >= 0 && t2 <= 1) {
- // ExitWound
- return [t2];
- }
+ if (Object.keys(props.style).length === 0) {
+ delete props.style;
+ }
- return intersections;
- } else return null;
+ return props;
};
-// -----------------------------------------------------------------------------
-// Section: Class Constants
-// -----------------------------------------------------------------------------
-/**
- * Some useful pre-calculated constants
- */
-IGeometry.HALF_PI = 0.5 * Math.PI;
-IGeometry.ONE_AND_HALF_PI = 1.5 * Math.PI;
-IGeometry.TWO_PI = 2.0 * Math.PI;
-IGeometry.THREE_PI = 3.0 * Math.PI;
+var invertBase16Theme = function invertBase16Theme(base16Theme) {
+ return Object.keys(base16Theme).reduce(function (t, key) {
+ return t[key] = /^base/.test(key) ? invertColor(base16Theme[key]) : key === 'scheme' ? base16Theme[key] + ':inverted' : base16Theme[key], t;
+ }, {});
+};
+var createStyling = lodash_curry__WEBPACK_IMPORTED_MODULE_5___default()(function (getStylingFromBase16) {
+ var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+ var themeOrStyling = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+ var _options$defaultBase = options.defaultBase16,
+ defaultBase16 = _options$defaultBase === void 0 ? DEFAULT_BASE16 : _options$defaultBase,
+ _options$base16Themes = options.base16Themes,
+ base16Themes = _options$base16Themes === void 0 ? null : _options$base16Themes;
+ var base16Theme = getBase16Theme(themeOrStyling, base16Themes);
-module.exports = IGeometry;
+ if (base16Theme) {
+ themeOrStyling = _objectSpread(_objectSpread({}, base16Theme), themeOrStyling);
+ }
-/***/ }),
-/* 9 */
-/***/ (function(module, exports, __webpack_require__) {
+ var theme = BASE16_KEYS.reduce(function (t, key) {
+ return t[key] = themeOrStyling[key] || defaultBase16[key], t;
+ }, {});
+ var customStyling = Object.keys(themeOrStyling).reduce(function (s, key) {
+ return BASE16_KEYS.indexOf(key) === -1 ? (s[key] = themeOrStyling[key], s) : s;
+ }, {});
+ var defaultStyling = getStylingFromBase16(theme);
+ var mergedStyling = mergeStylings(customStyling, defaultStyling);
-"use strict";
+ for (var _len7 = arguments.length, args = new Array(_len7 > 3 ? _len7 - 3 : 0), _key7 = 3; _key7 < _len7; _key7++) {
+ args[_key7 - 3] = arguments[_key7];
+ }
+ return lodash_curry__WEBPACK_IMPORTED_MODULE_5___default()(getStylingByKeys, 2).apply(void 0, [mergedStyling].concat(args));
+}, 3);
-function IMath() {}
+var isStylingConfig = function isStylingConfig(theme) {
+ return !!theme.extend;
+};
-/**
- * This method returns the sign of the input value.
- */
-IMath.sign = function (value) {
- if (value > 0) {
- return 1;
- } else if (value < 0) {
- return -1;
- } else {
- return 0;
+var getBase16Theme = function getBase16Theme(theme, base16Themes) {
+ if (theme && isStylingConfig(theme) && theme.extend) {
+ theme = theme.extend;
}
-};
-IMath.floor = function (value) {
- return value < 0 ? Math.ceil(value) : Math.floor(value);
-};
+ if (typeof theme === 'string') {
+ var _theme$split = theme.split(':'),
+ _theme$split2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__["default"])(_theme$split, 2),
+ _themeName = _theme$split2[0],
+ modifier = _theme$split2[1];
-IMath.ceil = function (value) {
- return value < 0 ? Math.floor(value) : Math.ceil(value);
-};
+ if (base16Themes) {
+ theme = base16Themes[_themeName];
+ } else {
+ theme = base16__WEBPACK_IMPORTED_MODULE_3__[_themeName];
+ }
-module.exports = IMath;
+ if (modifier === 'inverted') {
+ theme = invertBase16Theme(theme);
+ }
+ }
-/***/ }),
-/* 10 */
-/***/ (function(module, exports, __webpack_require__) {
+ return theme && Object.prototype.hasOwnProperty.call(theme, 'base00') ? theme : undefined;
+};
+var invertTheme = function invertTheme(theme) {
+ if (typeof theme === 'string') {
+ return "".concat(theme, ":inverted");
+ }
-"use strict";
+ if (theme && isStylingConfig(theme) && theme.extend) {
+ if (typeof theme.extend === 'string') {
+ return _objectSpread(_objectSpread({}, theme), {}, {
+ extend: "".concat(theme.extend, ":inverted")
+ });
+ }
+ return _objectSpread(_objectSpread({}, theme), {}, {
+ extend: invertBase16Theme(theme.extend)
+ });
+ }
-function Integer() {}
+ if (theme) {
+ return invertBase16Theme(theme);
+ }
-Integer.MAX_VALUE = 2147483647;
-Integer.MIN_VALUE = -2147483648;
+ return theme;
+};
-module.exports = Integer;
/***/ }),
-/* 11 */
-/***/ (function(module, exports, __webpack_require__) {
+
+/***/ "./node_modules/react-is/cjs/react-is.development.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/react-is/cjs/react-is.development.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack_module, exports) {
"use strict";
+/** @license React v16.13.1
+ * react-is.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
-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 nodeFrom = function nodeFrom(value) {
- return { value: value, next: null, prev: null };
-};
-var add = function add(prev, node, next, list) {
- if (prev !== null) {
- prev.next = node;
- } else {
- list.head = node;
- }
+if (true) {
+ (function() {
+'use strict';
- if (next !== null) {
- next.prev = node;
- } else {
- list.tail = node;
- }
+// The Symbol used to tag the ReactElement-like types. If there is no native Symbol
+// nor polyfill, then a plain number is used for performance.
+var hasSymbol = typeof Symbol === 'function' && Symbol.for;
+var REACT_ELEMENT_TYPE = hasSymbol ? Symbol.for('react.element') : 0xeac7;
+var REACT_PORTAL_TYPE = hasSymbol ? Symbol.for('react.portal') : 0xeaca;
+var REACT_FRAGMENT_TYPE = hasSymbol ? Symbol.for('react.fragment') : 0xeacb;
+var REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol.for('react.strict_mode') : 0xeacc;
+var REACT_PROFILER_TYPE = hasSymbol ? Symbol.for('react.profiler') : 0xead2;
+var REACT_PROVIDER_TYPE = hasSymbol ? Symbol.for('react.provider') : 0xeacd;
+var REACT_CONTEXT_TYPE = hasSymbol ? Symbol.for('react.context') : 0xeace; // TODO: We don't use AsyncMode or ConcurrentMode anymore. They were temporary
+// (unstable) APIs that have been removed. Can we remove the symbols?
- node.prev = prev;
- node.next = next;
+var REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol.for('react.async_mode') : 0xeacf;
+var REACT_CONCURRENT_MODE_TYPE = hasSymbol ? Symbol.for('react.concurrent_mode') : 0xeacf;
+var REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol.for('react.forward_ref') : 0xead0;
+var REACT_SUSPENSE_TYPE = hasSymbol ? Symbol.for('react.suspense') : 0xead1;
+var REACT_SUSPENSE_LIST_TYPE = hasSymbol ? Symbol.for('react.suspense_list') : 0xead8;
+var REACT_MEMO_TYPE = hasSymbol ? Symbol.for('react.memo') : 0xead3;
+var REACT_LAZY_TYPE = hasSymbol ? Symbol.for('react.lazy') : 0xead4;
+var REACT_BLOCK_TYPE = hasSymbol ? Symbol.for('react.block') : 0xead9;
+var REACT_FUNDAMENTAL_TYPE = hasSymbol ? Symbol.for('react.fundamental') : 0xead5;
+var REACT_RESPONDER_TYPE = hasSymbol ? Symbol.for('react.responder') : 0xead6;
+var REACT_SCOPE_TYPE = hasSymbol ? Symbol.for('react.scope') : 0xead7;
- list.length++;
+function isValidElementType(type) {
+ return typeof type === 'string' || typeof type === 'function' || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.
+ type === REACT_FRAGMENT_TYPE || type === REACT_CONCURRENT_MODE_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_FUNDAMENTAL_TYPE || type.$$typeof === REACT_RESPONDER_TYPE || type.$$typeof === REACT_SCOPE_TYPE || type.$$typeof === REACT_BLOCK_TYPE);
+}
- return node;
-};
+function typeOf(object) {
+ if (typeof object === 'object' && object !== null) {
+ var $$typeof = object.$$typeof;
-var _remove = function _remove(node, list) {
- var prev = node.prev,
- next = node.next;
+ switch ($$typeof) {
+ case REACT_ELEMENT_TYPE:
+ var type = object.type;
+ switch (type) {
+ case REACT_ASYNC_MODE_TYPE:
+ case REACT_CONCURRENT_MODE_TYPE:
+ case REACT_FRAGMENT_TYPE:
+ case REACT_PROFILER_TYPE:
+ case REACT_STRICT_MODE_TYPE:
+ case REACT_SUSPENSE_TYPE:
+ return type;
- if (prev !== null) {
- prev.next = next;
- } else {
- list.head = next;
- }
+ default:
+ var $$typeofType = type && type.$$typeof;
- if (next !== null) {
- next.prev = prev;
- } else {
- list.tail = prev;
- }
+ switch ($$typeofType) {
+ case REACT_CONTEXT_TYPE:
+ case REACT_FORWARD_REF_TYPE:
+ case REACT_LAZY_TYPE:
+ case REACT_MEMO_TYPE:
+ case REACT_PROVIDER_TYPE:
+ return $$typeofType;
- node.prev = node.next = null;
+ default:
+ return $$typeof;
+ }
- list.length--;
+ }
- return node;
-};
+ case REACT_PORTAL_TYPE:
+ return $$typeof;
+ }
+ }
-var LinkedList = function () {
- function LinkedList(vals) {
- var _this = this;
+ return undefined;
+} // AsyncMode is deprecated along with isAsyncMode
- _classCallCheck(this, LinkedList);
+var AsyncMode = REACT_ASYNC_MODE_TYPE;
+var ConcurrentMode = REACT_CONCURRENT_MODE_TYPE;
+var ContextConsumer = REACT_CONTEXT_TYPE;
+var ContextProvider = REACT_PROVIDER_TYPE;
+var Element = REACT_ELEMENT_TYPE;
+var ForwardRef = REACT_FORWARD_REF_TYPE;
+var Fragment = REACT_FRAGMENT_TYPE;
+var Lazy = REACT_LAZY_TYPE;
+var Memo = REACT_MEMO_TYPE;
+var Portal = REACT_PORTAL_TYPE;
+var Profiler = REACT_PROFILER_TYPE;
+var StrictMode = REACT_STRICT_MODE_TYPE;
+var Suspense = REACT_SUSPENSE_TYPE;
+var hasWarnedAboutDeprecatedIsAsyncMode = false; // AsyncMode should be deprecated
- this.length = 0;
- this.head = null;
- this.tail = null;
+function isAsyncMode(object) {
+ {
+ if (!hasWarnedAboutDeprecatedIsAsyncMode) {
+ hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint
- if (vals != null) {
- vals.forEach(function (v) {
- return _this.push(v);
- });
+ console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');
}
}
- _createClass(LinkedList, [{
- key: "size",
- value: function size() {
- return this.length;
- }
- }, {
- key: "insertBefore",
- value: function insertBefore(val, otherNode) {
- return add(otherNode.prev, nodeFrom(val), otherNode, this);
- }
- }, {
- key: "insertAfter",
- value: function insertAfter(val, otherNode) {
- return add(otherNode, nodeFrom(val), otherNode.next, this);
- }
- }, {
- key: "insertNodeBefore",
- value: function insertNodeBefore(newNode, otherNode) {
- return add(otherNode.prev, newNode, otherNode, this);
- }
- }, {
- key: "insertNodeAfter",
- value: function insertNodeAfter(newNode, otherNode) {
- return add(otherNode, newNode, otherNode.next, this);
- }
- }, {
- key: "push",
- value: function push(val) {
- return add(this.tail, nodeFrom(val), null, this);
- }
- }, {
- key: "unshift",
- value: function unshift(val) {
- return add(null, nodeFrom(val), this.head, this);
- }
- }, {
- key: "remove",
- value: function remove(node) {
- return _remove(node, this);
- }
- }, {
- key: "pop",
- value: function pop() {
- return _remove(this.tail, this).value;
- }
- }, {
- key: "popNode",
- value: function popNode() {
- return _remove(this.tail, this);
- }
- }, {
- key: "shift",
- value: function shift() {
- return _remove(this.head, this).value;
- }
- }, {
- key: "shiftNode",
- value: function shiftNode() {
- return _remove(this.head, this);
- }
- }, {
- key: "get_object_at",
- value: function get_object_at(index) {
- if (index <= this.length()) {
- var i = 1;
- var current = this.head;
- while (i < index) {
- current = current.next;
- i++;
- }
- return current.value;
- }
- }
- }, {
- key: "set_object_at",
- value: function set_object_at(index, value) {
- if (index <= this.length()) {
- var i = 1;
- var current = this.head;
- while (i < index) {
- current = current.next;
- i++;
- }
- current.value = value;
- }
- }
- }]);
+ return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;
+}
+function isConcurrentMode(object) {
+ return typeOf(object) === REACT_CONCURRENT_MODE_TYPE;
+}
+function isContextConsumer(object) {
+ return typeOf(object) === REACT_CONTEXT_TYPE;
+}
+function isContextProvider(object) {
+ return typeOf(object) === REACT_PROVIDER_TYPE;
+}
+function isElement(object) {
+ return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;
+}
+function isForwardRef(object) {
+ return typeOf(object) === REACT_FORWARD_REF_TYPE;
+}
+function isFragment(object) {
+ return typeOf(object) === REACT_FRAGMENT_TYPE;
+}
+function isLazy(object) {
+ return typeOf(object) === REACT_LAZY_TYPE;
+}
+function isMemo(object) {
+ return typeOf(object) === REACT_MEMO_TYPE;
+}
+function isPortal(object) {
+ return typeOf(object) === REACT_PORTAL_TYPE;
+}
+function isProfiler(object) {
+ return typeOf(object) === REACT_PROFILER_TYPE;
+}
+function isStrictMode(object) {
+ return typeOf(object) === REACT_STRICT_MODE_TYPE;
+}
+function isSuspense(object) {
+ return typeOf(object) === REACT_SUSPENSE_TYPE;
+}
- return LinkedList;
-}();
+exports.AsyncMode = AsyncMode;
+exports.ConcurrentMode = ConcurrentMode;
+exports.ContextConsumer = ContextConsumer;
+exports.ContextProvider = ContextProvider;
+exports.Element = Element;
+exports.ForwardRef = ForwardRef;
+exports.Fragment = Fragment;
+exports.Lazy = Lazy;
+exports.Memo = Memo;
+exports.Portal = Portal;
+exports.Profiler = Profiler;
+exports.StrictMode = StrictMode;
+exports.Suspense = Suspense;
+exports.isAsyncMode = isAsyncMode;
+exports.isConcurrentMode = isConcurrentMode;
+exports.isContextConsumer = isContextConsumer;
+exports.isContextProvider = isContextProvider;
+exports.isElement = isElement;
+exports.isForwardRef = isForwardRef;
+exports.isFragment = isFragment;
+exports.isLazy = isLazy;
+exports.isMemo = isMemo;
+exports.isPortal = isPortal;
+exports.isProfiler = isProfiler;
+exports.isStrictMode = isStrictMode;
+exports.isSuspense = isSuspense;
+exports.isValidElementType = isValidElementType;
+exports.typeOf = typeOf;
+ })();
+}
-module.exports = LinkedList;
/***/ }),
-/* 12 */
-/***/ (function(module, exports, __webpack_require__) {
+
+/***/ "./node_modules/react-is/index.js":
+/*!****************************************!*\
+ !*** ./node_modules/react-is/index.js ***!
+ \****************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
"use strict";
-/*
- *This class is the javascript implementation of the Point.java class in jdk
- */
-function Point(x, y, p) {
- this.x = null;
- this.y = null;
- if (x == null && y == null && p == null) {
- this.x = 0;
- this.y = 0;
- } else if (typeof x == 'number' && typeof y == 'number' && p == null) {
- this.x = x;
- this.y = y;
- } else if (x.constructor.name == 'Point' && y == null && p == null) {
- p = x;
- this.x = p.x;
- this.y = p.y;
- }
+if (false) {} else {
+ module.exports = __webpack_require__(/*! ./cjs/react-is.development.js */ "./node_modules/react-is/cjs/react-is.development.js");
}
-Point.prototype.getX = function () {
- return this.x;
-};
-Point.prototype.getY = function () {
- return this.y;
-};
+/***/ }),
-Point.prototype.getLocation = function () {
- return new Point(this.x, this.y);
-};
+/***/ "./node_modules/react-json-tree/lib/esm/ItemRange.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/ItemRange.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-Point.prototype.setLocation = function (x, y, p) {
- if (x.constructor.name == 'Point' && y == null && p == null) {
- p = x;
- this.setLocation(p.x, p.y);
- } else if (typeof x == 'number' && typeof y == 'number' && p == null) {
- //if both parameters are integer just move (x,y) location
- if (parseInt(x) == x && parseInt(y) == y) {
- this.move(x, y);
- } else {
- this.x = Math.floor(x + 0.5);
- this.y = Math.floor(y + 0.5);
- }
- }
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ ItemRange; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/assertThisInitialized */ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
+/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
+/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_8___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_8__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_9__);
+/* harmony import */ var _JSONArrow__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./JSONArrow */ "./node_modules/react-json-tree/lib/esm/JSONArrow.js");
-Point.prototype.move = function (x, y) {
- this.x = x;
- this.y = y;
-};
-Point.prototype.translate = function (dx, dy) {
- this.x += dx;
- this.y += dy;
-};
-Point.prototype.equals = function (obj) {
- if (obj.constructor.name == "Point") {
- var pt = obj;
- return this.x == pt.x && this.y == pt.y;
+
+
+
+
+
+
+function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__["default"])(this, result); }; }
+
+function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
+
+
+
+
+
+var ItemRange = /*#__PURE__*/function (_React$Component) {
+ (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__["default"])(ItemRange, _React$Component);
+
+ var _super = _createSuper(ItemRange);
+
+ function ItemRange(props) {
+ var _this;
+
+ (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_1__["default"])(this, ItemRange);
+
+ _this = _super.call(this, props);
+
+ (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])((0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__["default"])(_this), "handleClick", function () {
+ _this.setState({
+ expanded: !_this.state.expanded
+ });
+ });
+
+ _this.state = {
+ expanded: false
+ };
+ return _this;
}
- return this == obj;
-};
-Point.prototype.toString = function () {
- return new Point().constructor.name + "[x=" + this.x + ",y=" + this.y + "]";
-};
+ (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_2__["default"])(ItemRange, [{
+ key: "render",
+ value: function render() {
+ var _this$props = this.props,
+ styling = _this$props.styling,
+ from = _this$props.from,
+ to = _this$props.to,
+ renderChildNodes = _this$props.renderChildNodes,
+ nodeType = _this$props.nodeType;
+ return this.state.expanded ? /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement("div", styling('itemRange', this.state.expanded), renderChildNodes(this.props, from, to)) : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement("div", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, styling('itemRange', this.state.expanded), {
+ onClick: this.handleClick
+ }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement(_JSONArrow__WEBPACK_IMPORTED_MODULE_10__["default"], {
+ nodeType: nodeType,
+ styling: styling,
+ expanded: false,
+ onClick: this.handleClick,
+ arrowStyle: "double"
+ }), "".concat(from, " ... ").concat(to));
+ }
+ }]);
+
+ return ItemRange;
+}((react__WEBPACK_IMPORTED_MODULE_8___default().Component));
+
+(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(ItemRange, "propTypes", {
+ styling: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().func).isRequired,
+ from: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().number).isRequired,
+ to: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().number).isRequired,
+ renderChildNodes: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().func).isRequired,
+ nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().string).isRequired
+});
+
-module.exports = Point;
/***/ }),
-/* 13 */
-/***/ (function(module, exports, __webpack_require__) {
+
+/***/ "./node_modules/react-json-tree/lib/esm/JSONArrayNode.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONArrayNode.js ***!
+ \***************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
-function RectangleD(x, y, width, height) {
- this.x = 0;
- this.y = 0;
- this.width = 0;
- this.height = 0;
+var _excluded = ["data"];
- if (x != null && y != null && width != null && height != null) {
- this.x = x;
- this.y = y;
- this.width = width;
- this.height = height;
- }
+
+
+
+// Returns the "n Items" string for this node,
+// generating and caching it if it hasn't been created yet.
+function createItemString(data) {
+ return "".concat(data.length, " ").concat(data.length !== 1 ? 'items' : 'item');
}
-RectangleD.prototype.getX = function () {
- return this.x;
-};
+// Configures <JSONNestedNode> to render an Array
+var JSONArrayNode = function JSONArrayNode(_ref) {
+ var data = _ref.data,
+ props = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_ref, _excluded);
-RectangleD.prototype.setX = function (x) {
- this.x = x;
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_2___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
+ data: data,
+ nodeType: "Array",
+ nodeTypeIndicator: "[]",
+ createItemString: createItemString,
+ expandable: data.length > 0
+ }));
};
-RectangleD.prototype.getY = function () {
- return this.y;
+JSONArrayNode.propTypes = {
+ data: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().array)
};
+/* harmony default export */ __webpack_exports__["default"] = (JSONArrayNode);
-RectangleD.prototype.setY = function (y) {
- this.y = y;
-};
+/***/ }),
-RectangleD.prototype.getWidth = function () {
- return this.width;
-};
+/***/ "./node_modules/react-json-tree/lib/esm/JSONArrow.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONArrow.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-RectangleD.prototype.setWidth = function (width) {
- this.width = width;
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_2__);
-RectangleD.prototype.getHeight = function () {
- return this.height;
-};
-RectangleD.prototype.setHeight = function (height) {
- this.height = height;
-};
-RectangleD.prototype.getRight = function () {
- return this.x + this.width;
+
+var JSONArrow = function JSONArrow(_ref) {
+ var styling = _ref.styling,
+ arrowStyle = _ref.arrowStyle,
+ expanded = _ref.expanded,
+ nodeType = _ref.nodeType,
+ onClick = _ref.onClick;
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, styling('arrowContainer', arrowStyle), {
+ onClick: onClick
+ }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", styling(['arrow', 'arrowSign'], nodeType, expanded, arrowStyle), "\u25B6", arrowStyle === 'double' && /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", styling(['arrowSign', 'arrowSignInner']), "\u25B6")));
};
-RectangleD.prototype.getBottom = function () {
- return this.y + this.height;
+JSONArrow.propTypes = {
+ styling: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
+ arrowStyle: prop_types__WEBPACK_IMPORTED_MODULE_2___default().oneOf(['single', 'double']),
+ expanded: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().bool).isRequired,
+ nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().string).isRequired,
+ onClick: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired
+};
+JSONArrow.defaultProps = {
+ arrowStyle: 'single'
};
+/* harmony default export */ __webpack_exports__["default"] = (JSONArrow);
-RectangleD.prototype.intersects = function (a) {
- if (this.getRight() < a.x) {
- return false;
- }
+/***/ }),
- if (this.getBottom() < a.y) {
- return false;
- }
+/***/ "./node_modules/react-json-tree/lib/esm/JSONIterableNode.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONIterableNode.js ***!
+ \******************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- if (a.getRight() < this.x) {
- return false;
- }
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
- if (a.getBottom() < this.y) {
- return false;
- }
- return true;
-};
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-RectangleD.prototype.getCenterX = function () {
- return this.x + this.width / 2;
-};
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-RectangleD.prototype.getMinX = function () {
- return this.getX();
-};
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-RectangleD.prototype.getMaxX = function () {
- return this.getX() + this.width;
-};
-RectangleD.prototype.getCenterY = function () {
- return this.y + this.height / 2;
-};
-RectangleD.prototype.getMinY = function () {
- return this.getY();
-};
-RectangleD.prototype.getMaxY = function () {
- return this.getY() + this.height;
-};
+// Returns the "n Items" string for this node,
+// generating and caching it if it hasn't been created yet.
+function createItemString(data, limit) {
+ var count = 0;
+ var hasMore = false;
-RectangleD.prototype.getWidthHalf = function () {
- return this.width / 2;
-};
+ if (Number.isSafeInteger(data.size)) {
+ count = data.size;
+ } else {
+ // eslint-disable-next-line no-unused-vars
+ var _iterator = _createForOfIteratorHelper(data),
+ _step;
-RectangleD.prototype.getHeightHalf = function () {
- return this.height / 2;
+ try {
+ for (_iterator.s(); !(_step = _iterator.n()).done;) {
+ var entry = _step.value;
+
+ if (limit && count + 1 > limit) {
+ hasMore = true;
+ break;
+ }
+
+ count += 1;
+ }
+ } catch (err) {
+ _iterator.e(err);
+ } finally {
+ _iterator.f();
+ }
+ }
+
+ return "".concat(hasMore ? '>' : '').concat(count, " ").concat(count !== 1 ? 'entries' : 'entry');
+}
+
+// Configures <JSONNestedNode> to render an iterable
+var JSONIterableNode = function JSONIterableNode(_ref) {
+ var props = (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, _ref);
+
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_2__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
+ nodeType: "Iterable",
+ nodeTypeIndicator: "()",
+ createItemString: createItemString
+ }));
};
-module.exports = RectangleD;
+/* harmony default export */ __webpack_exports__["default"] = (JSONIterableNode);
/***/ }),
-/* 14 */
-/***/ (function(module, exports, __webpack_require__) {
+
+/***/ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONNestedNode.js ***!
+ \****************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ JSONNestedNode; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/assertThisInitialized */ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
+/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
+/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_9__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_10__);
+/* harmony import */ var _JSONArrow__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./JSONArrow */ "./node_modules/react-json-tree/lib/esm/JSONArrow.js");
+/* harmony import */ var _getCollectionEntries__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./getCollectionEntries */ "./node_modules/react-json-tree/lib/esm/getCollectionEntries.js");
+/* harmony import */ var _JSONNode__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./JSONNode */ "./node_modules/react-json-tree/lib/esm/JSONNode.js");
+/* harmony import */ var _ItemRange__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./ItemRange */ "./node_modules/react-json-tree/lib/esm/ItemRange.js");
-var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; };
-function UniqueIDGeneretor() {}
-UniqueIDGeneretor.lastID = 0;
-UniqueIDGeneretor.createID = function (obj) {
- if (UniqueIDGeneretor.isPrimitive(obj)) {
- return obj;
- }
- if (obj.uniqueID != null) {
- return obj.uniqueID;
- }
- obj.uniqueID = UniqueIDGeneretor.getString();
- UniqueIDGeneretor.lastID++;
- return obj.uniqueID;
-};
-UniqueIDGeneretor.getString = function (id) {
- if (id == null) id = UniqueIDGeneretor.lastID;
- return "Object#" + id + "";
-};
-UniqueIDGeneretor.isPrimitive = function (arg) {
- var type = typeof arg === "undefined" ? "undefined" : _typeof(arg);
- return arg == null || type != "object" && type != "function";
-};
-module.exports = UniqueIDGeneretor;
-/***/ }),
-/* 15 */
-/***/ (function(module, exports, __nested_webpack_require_66321__) {
-"use strict";
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
+function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_4__["default"])(this, result); }; }
-var LayoutConstants = __nested_webpack_require_66321__(0);
-var LGraphManager = __nested_webpack_require_66321__(7);
-var LNode = __nested_webpack_require_66321__(3);
-var LEdge = __nested_webpack_require_66321__(1);
-var LGraph = __nested_webpack_require_66321__(6);
-var PointD = __nested_webpack_require_66321__(5);
-var Transform = __nested_webpack_require_66321__(17);
-var Emitter = __nested_webpack_require_66321__(29);
+function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-function Layout(isRemoteUse) {
- Emitter.call(this);
- //Layout Quality: 0:draft, 1:default, 2:proof
- this.layoutQuality = LayoutConstants.QUALITY;
- //Whether layout should create bendpoints as needed or not
- this.createBendsAsNeeded = LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED;
- //Whether layout should be incremental or not
- this.incremental = LayoutConstants.DEFAULT_INCREMENTAL;
- //Whether we animate from before to after layout node positions
- this.animationOnLayout = LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT;
- //Whether we animate the layout process or not
- this.animationDuringLayout = LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT;
- //Number iterations that should be done between two successive animations
- this.animationPeriod = LayoutConstants.DEFAULT_ANIMATION_PERIOD;
- /**
- * Whether or not leaf nodes (non-compound nodes) are of uniform sizes. When
- * they are, both spring and repulsion forces between two leaf nodes can be
- * calculated without the expensive clipping point calculations, resulting
- * in major speed-up.
- */
- this.uniformLeafNodeSizes = LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES;
- /**
- * This is used for creation of bendpoints by using dummy nodes and edges.
- * Maps an LEdge to its dummy bendpoint path.
- */
- this.edgeToDummyNodes = new Map();
- this.graphManager = new LGraphManager(this);
- this.isLayoutFinished = false;
- this.isSubLayout = false;
- this.isRemoteUse = false;
- if (isRemoteUse != null) {
- this.isRemoteUse = isRemoteUse;
- }
+
+
+
+
+
+function isRange(rangeOrEntry) {
+ return rangeOrEntry.to !== undefined;
+}
+
+function renderChildNodes(props, from, to) {
+ var nodeType = props.nodeType,
+ data = props.data,
+ collectionLimit = props.collectionLimit,
+ circularCache = props.circularCache,
+ keyPath = props.keyPath,
+ postprocessValue = props.postprocessValue,
+ sortObjectKeys = props.sortObjectKeys;
+ var childNodes = [];
+ (0,_getCollectionEntries__WEBPACK_IMPORTED_MODULE_11__["default"])(nodeType, data, sortObjectKeys, collectionLimit, from, to).forEach(function (entry) {
+ if (isRange(entry)) {
+ childNodes.push( /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_ItemRange__WEBPACK_IMPORTED_MODULE_12__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, props, {
+ key: "ItemRange--".concat(entry.from, "-").concat(entry.to),
+ from: entry.from,
+ to: entry.to,
+ renderChildNodes: renderChildNodes
+ })));
+ } else {
+ var key = entry.key,
+ value = entry.value;
+ var isCircular = circularCache.indexOf(value) !== -1;
+ childNodes.push( /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONNode__WEBPACK_IMPORTED_MODULE_13__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, props, {
+ postprocessValue: postprocessValue,
+ collectionLimit: collectionLimit,
+ key: "Node--".concat(key),
+ keyPath: [key].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__["default"])(keyPath)),
+ value: postprocessValue(value),
+ circularCache: [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__["default"])(circularCache), [value]),
+ isCircular: isCircular,
+ hideRoot: false
+ })));
+ }
+ });
+ return childNodes;
+}
+
+function getStateFromProps(props) {
+ // calculate individual node expansion if necessary
+ var expanded = !props.isCircular ? props.shouldExpandNode(props.keyPath, props.data, props.level) : false;
+ return {
+ expanded: expanded
+ };
}
-Layout.RANDOM_SEED = 1;
+var JSONNestedNode = /*#__PURE__*/function (_React$Component) {
+ (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_3__["default"])(JSONNestedNode, _React$Component);
-Layout.prototype = Object.create(Emitter.prototype);
+ var _super = _createSuper(JSONNestedNode);
-Layout.prototype.getGraphManager = function () {
- return this.graphManager;
-};
+ function JSONNestedNode(props) {
+ var _this;
-Layout.prototype.getAllNodes = function () {
- return this.graphManager.getAllNodes();
-};
+ (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_0__["default"])(this, JSONNestedNode);
-Layout.prototype.getAllEdges = function () {
- return this.graphManager.getAllEdges();
-};
+ _this = _super.call(this, props);
-Layout.prototype.getAllNodesToApplyGravitation = function () {
- return this.graphManager.getAllNodesToApplyGravitation();
-};
+ (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])((0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_2__["default"])(_this), "handleClick", function () {
+ if (_this.props.expandable) {
+ _this.setState({
+ expanded: !_this.state.expanded
+ });
+ }
+ });
-Layout.prototype.newGraphManager = function () {
- var gm = new LGraphManager(this);
- this.graphManager = gm;
- return gm;
-};
+ _this.state = getStateFromProps(props);
+ return _this;
+ }
-Layout.prototype.newGraph = function (vGraph) {
- return new LGraph(null, this.graphManager, vGraph);
-};
+ (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_1__["default"])(JSONNestedNode, [{
+ key: "UNSAFE_componentWillReceiveProps",
+ value: function UNSAFE_componentWillReceiveProps(nextProps) {
+ var nextState = getStateFromProps(nextProps);
-Layout.prototype.newNode = function (vNode) {
- return new LNode(this.graphManager, vNode);
-};
+ if (getStateFromProps(this.props).expanded !== nextState.expanded) {
+ this.setState(nextState);
+ }
+ }
+ }, {
+ key: "shouldComponentUpdate",
+ value: function shouldComponentUpdate(nextProps, nextState) {
+ var _this2 = this;
-Layout.prototype.newEdge = function (vEdge) {
- return new LEdge(null, null, vEdge);
-};
+ return !!Object.keys(nextProps).find(function (key) {
+ return key !== 'circularCache' && (key === 'keyPath' ? nextProps[key].join('/') !== _this2.props[key].join('/') : nextProps[key] !== _this2.props[key]);
+ }) || nextState.expanded !== this.state.expanded;
+ }
+ }, {
+ key: "render",
+ value: function render() {
+ var _this$props = this.props,
+ getItemString = _this$props.getItemString,
+ nodeTypeIndicator = _this$props.nodeTypeIndicator,
+ nodeType = _this$props.nodeType,
+ data = _this$props.data,
+ hideRoot = _this$props.hideRoot,
+ createItemString = _this$props.createItemString,
+ styling = _this$props.styling,
+ collectionLimit = _this$props.collectionLimit,
+ keyPath = _this$props.keyPath,
+ labelRenderer = _this$props.labelRenderer,
+ expandable = _this$props.expandable;
+ var expanded = this.state.expanded;
+ var renderedChildren = expanded || hideRoot && this.props.level === 0 ? renderChildNodes(_objectSpread(_objectSpread({}, this.props), {}, {
+ level: this.props.level + 1
+ })) : null;
+ var itemType = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", styling('nestedNodeItemType', expanded), nodeTypeIndicator);
+ var renderedItemString = getItemString(nodeType, data, itemType, createItemString(data, collectionLimit), keyPath);
+ var stylingArgs = [keyPath, nodeType, expanded, expandable];
+ return hideRoot ? /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("li", styling.apply(void 0, ['rootNode'].concat(stylingArgs)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling.apply(void 0, ['rootNodeChildren'].concat(stylingArgs)), renderedChildren)) : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("li", styling.apply(void 0, ['nestedNode'].concat(stylingArgs)), expandable && /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONArrow__WEBPACK_IMPORTED_MODULE_14__["default"], {
+ styling: styling,
+ nodeType: nodeType,
+ expanded: expanded,
+ onClick: this.handleClick
+ }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("label", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, styling.apply(void 0, [['label', 'nestedNodeLabel']].concat(stylingArgs)), {
+ onClick: this.handleClick
+ }), labelRenderer.apply(void 0, stylingArgs)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, styling.apply(void 0, ['nestedNodeItemString'].concat(stylingArgs)), {
+ onClick: this.handleClick
+ }), renderedItemString), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling.apply(void 0, ['nestedNodeChildren'].concat(stylingArgs)), renderedChildren));
+ }
+ }]);
-Layout.prototype.checkLayoutSuccess = function () {
- return this.graphManager.getRoot() == null || this.graphManager.getRoot().getNodes().length == 0 || this.graphManager.includesInvalidEdge();
-};
+ return JSONNestedNode;
+}((react__WEBPACK_IMPORTED_MODULE_9___default().Component));
-Layout.prototype.runLayout = function () {
- this.isLayoutFinished = false;
+(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(JSONNestedNode, "propTypes", {
+ getItemString: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
+ nodeTypeIndicator: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
+ nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().string).isRequired,
+ data: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
+ hideRoot: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool).isRequired,
+ createItemString: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
+ styling: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
+ collectionLimit: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number),
+ keyPath: prop_types__WEBPACK_IMPORTED_MODULE_10___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number)])).isRequired,
+ labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
+ shouldExpandNode: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func),
+ level: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number).isRequired,
+ sortObjectKeys: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().func), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)]),
+ isCircular: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
+ expandable: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)
+});
- if (this.tilingPreLayout) {
- this.tilingPreLayout();
- }
+(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(JSONNestedNode, "defaultProps", {
+ data: [],
+ circularCache: [],
+ level: 0,
+ expandable: true
+});
- this.initParameters();
- var isLayoutSuccessfull;
- if (this.checkLayoutSuccess()) {
- isLayoutSuccessfull = false;
- } else {
- isLayoutSuccessfull = this.layout();
- }
- if (LayoutConstants.ANIMATE === 'during') {
- // If this is a 'during' layout animation. Layout is not finished yet.
- // We need to perform these in index.js when layout is really finished.
- return false;
- }
+/***/ }),
- if (isLayoutSuccessfull) {
- if (!this.isSubLayout) {
- this.doPostLayout();
- }
- }
+/***/ "./node_modules/react-json-tree/lib/esm/JSONNode.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONNode.js ***!
+ \**********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- if (this.tilingPostLayout) {
- this.tilingPostLayout();
- }
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _objType__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./objType */ "./node_modules/react-json-tree/lib/esm/objType.js");
+/* harmony import */ var _JSONObjectNode__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./JSONObjectNode */ "./node_modules/react-json-tree/lib/esm/JSONObjectNode.js");
+/* harmony import */ var _JSONArrayNode__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./JSONArrayNode */ "./node_modules/react-json-tree/lib/esm/JSONArrayNode.js");
+/* harmony import */ var _JSONIterableNode__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./JSONIterableNode */ "./node_modules/react-json-tree/lib/esm/JSONIterableNode.js");
+/* harmony import */ var _JSONValueNode__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./JSONValueNode */ "./node_modules/react-json-tree/lib/esm/JSONValueNode.js");
- this.isLayoutFinished = true;
- return isLayoutSuccessfull;
-};
-/**
- * This method performs the operations required after layout.
- */
-Layout.prototype.doPostLayout = function () {
- //assert !isSubLayout : "Should not be called on sub-layout!";
- // Propagate geometric changes to v-level objects
- if (!this.incremental) {
- this.transform();
- }
- this.update();
-};
+var _excluded = ["getItemString", "keyPath", "labelRenderer", "styling", "value", "valueRenderer", "isCustomNode"];
-/**
- * This method updates the geometry of the target graph according to
- * calculated layout.
- */
-Layout.prototype.update2 = function () {
- // update bend points
- if (this.createBendsAsNeeded) {
- this.createBendpointsFromDummyNodes();
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
- // reset all edges, since the topology has changed
- this.graphManager.resetAllEdges();
- }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
- // perform edge, node and root updates if layout is not called
- // remotely
- if (!this.isRemoteUse) {
- // update all edges
- var edge;
- var allEdges = this.graphManager.getAllEdges();
- for (var i = 0; i < allEdges.length; i++) {
- edge = allEdges[i];
- // this.update(edge);
- }
- // recursively update nodes
- var node;
- var nodes = this.graphManager.getRoot().getNodes();
- for (var i = 0; i < nodes.length; i++) {
- node = nodes[i];
- // this.update(node);
- }
- // update root graph
- this.update(this.graphManager.getRoot());
- }
-};
-Layout.prototype.update = function (obj) {
- if (obj == null) {
- this.update2();
- } else if (obj instanceof LNode) {
- var node = obj;
- if (node.getChild() != null) {
- // since node is compound, recursively update child nodes
- var nodes = node.getChild().getNodes();
- for (var i = 0; i < nodes.length; i++) {
- update(nodes[i]);
- }
- }
- // if the l-level node is associated with a v-level graph object,
- // then it is assumed that the v-level node implements the
- // interface Updatable.
- if (node.vGraphObject != null) {
- // cast to Updatable without any type check
- var vNode = node.vGraphObject;
- // call the update method of the interface
- vNode.update(node);
- }
- } else if (obj instanceof LEdge) {
- var edge = obj;
- // if the l-level edge is associated with a v-level graph object,
- // then it is assumed that the v-level edge implements the
- // interface Updatable.
- if (edge.vGraphObject != null) {
- // cast to Updatable without any type check
- var vEdge = edge.vGraphObject;
- // call the update method of the interface
- vEdge.update(edge);
- }
- } else if (obj instanceof LGraph) {
- var graph = obj;
- // if the l-level graph is associated with a v-level graph object,
- // then it is assumed that the v-level object implements the
- // interface Updatable.
- if (graph.vGraphObject != null) {
- // cast to Updatable without any type check
- var vGraph = graph.vGraphObject;
+var JSONNode = function JSONNode(_ref) {
+ var getItemString = _ref.getItemString,
+ keyPath = _ref.keyPath,
+ labelRenderer = _ref.labelRenderer,
+ styling = _ref.styling,
+ value = _ref.value,
+ valueRenderer = _ref.valueRenderer,
+ isCustomNode = _ref.isCustomNode,
+ rest = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_2__["default"])(_ref, _excluded);
- // call the update method of the interface
- vGraph.update(graph);
- }
- }
-};
+ var nodeType = isCustomNode(value) ? 'Custom' : (0,_objType__WEBPACK_IMPORTED_MODULE_5__["default"])(value);
+ var simpleNodeProps = {
+ getItemString: getItemString,
+ key: keyPath[0],
+ keyPath: keyPath,
+ labelRenderer: labelRenderer,
+ nodeType: nodeType,
+ styling: styling,
+ value: value,
+ valueRenderer: valueRenderer
+ };
-/**
- * This method is used to set all layout parameters to default values
- * determined at compile time.
- */
-Layout.prototype.initParameters = function () {
- if (!this.isSubLayout) {
- this.layoutQuality = LayoutConstants.QUALITY;
- this.animationDuringLayout = LayoutConstants.DEFAULT_ANIMATION_DURING_LAYOUT;
- this.animationPeriod = LayoutConstants.DEFAULT_ANIMATION_PERIOD;
- this.animationOnLayout = LayoutConstants.DEFAULT_ANIMATION_ON_LAYOUT;
- this.incremental = LayoutConstants.DEFAULT_INCREMENTAL;
- this.createBendsAsNeeded = LayoutConstants.DEFAULT_CREATE_BENDS_AS_NEEDED;
- this.uniformLeafNodeSizes = LayoutConstants.DEFAULT_UNIFORM_LEAF_NODE_SIZES;
- }
+ var nestedNodeProps = _objectSpread(_objectSpread(_objectSpread({}, rest), simpleNodeProps), {}, {
+ data: value,
+ isCustomNode: isCustomNode
+ });
- if (this.animationDuringLayout) {
- this.animationOnLayout = false;
- }
-};
+ switch (nodeType) {
+ case 'Object':
+ case 'Error':
+ case 'WeakMap':
+ case 'WeakSet':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONObjectNode__WEBPACK_IMPORTED_MODULE_6__["default"], nestedNodeProps);
-Layout.prototype.transform = function (newLeftTop) {
- if (newLeftTop == undefined) {
- this.transform(new PointD(0, 0));
- } else {
- // create a transformation object (from Eclipse to layout). When an
- // inverse transform is applied, we get upper-left coordinate of the
- // drawing or the root graph at given input coordinate (some margins
- // already included in calculation of left-top).
+ case 'Array':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONArrayNode__WEBPACK_IMPORTED_MODULE_7__["default"], nestedNodeProps);
- var trans = new Transform();
- var leftTop = this.graphManager.getRoot().updateLeftTop();
+ case 'Iterable':
+ case 'Map':
+ case 'Set':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONIterableNode__WEBPACK_IMPORTED_MODULE_8__["default"], nestedNodeProps);
- if (leftTop != null) {
- trans.setWorldOrgX(newLeftTop.x);
- trans.setWorldOrgY(newLeftTop.y);
+ case 'String':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter(raw) {
+ return "\"".concat(raw, "\"");
+ }
+ }));
- trans.setDeviceOrgX(leftTop.x);
- trans.setDeviceOrgY(leftTop.y);
+ case 'Number':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], simpleNodeProps);
- var nodes = this.getAllNodes();
- var node;
+ case 'Boolean':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter(raw) {
+ return raw ? 'true' : 'false';
+ }
+ }));
- for (var i = 0; i < nodes.length; i++) {
- node = nodes[i];
- node.transform(trans);
- }
- }
- }
-};
+ case 'Date':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter(raw) {
+ return raw.toISOString();
+ }
+ }));
-Layout.prototype.positionNodesRandomly = function (graph) {
+ case 'Null':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter() {
+ return 'null';
+ }
+ }));
- if (graph == undefined) {
- //assert !this.incremental;
- this.positionNodesRandomly(this.getGraphManager().getRoot());
- this.getGraphManager().getRoot().updateBounds(true);
- } else {
- var lNode;
- var childGraph;
+ case 'Undefined':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter() {
+ return 'undefined';
+ }
+ }));
- var nodes = graph.getNodes();
- for (var i = 0; i < nodes.length; i++) {
- lNode = nodes[i];
- childGraph = lNode.getChild();
+ case 'Function':
+ case 'Symbol':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter(raw) {
+ return raw.toString();
+ }
+ }));
- if (childGraph == null) {
- lNode.scatter();
- } else if (childGraph.getNodes().length == 0) {
- lNode.scatter();
- } else {
- this.positionNodesRandomly(childGraph);
- lNode.updateBounds();
- }
- }
+ case 'Custom':
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], simpleNodeProps);
+
+ default:
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
+ valueGetter: function valueGetter() {
+ return "<".concat(nodeType, ">");
+ }
+ }));
}
};
-/**
- * This method returns a list of trees where each tree is represented as a
- * list of l-nodes. The method returns a list of size 0 when:
- * - The graph is not flat or
- * - One of the component(s) of the graph is not a tree.
- */
-Layout.prototype.getFlatForest = function () {
- var flatForest = [];
- var isForest = true;
+JSONNode.propTypes = {
+ getItemString: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
+ keyPath: prop_types__WEBPACK_IMPORTED_MODULE_4___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_4___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_4___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_4___default().number)]).isRequired).isRequired,
+ labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
+ styling: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
+ value: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().any),
+ valueRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
+ isCustomNode: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired
+};
+/* harmony default export */ __webpack_exports__["default"] = (JSONNode);
- // Quick reference for all nodes in the graph manager associated with
- // this layout. The list should not be changed.
- var allNodes = this.graphManager.getRoot().getNodes();
+/***/ }),
- // First be sure that the graph is flat
- var isFlat = true;
+/***/ "./node_modules/react-json-tree/lib/esm/JSONObjectNode.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONObjectNode.js ***!
+ \****************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- for (var i = 0; i < allNodes.length; i++) {
- if (allNodes[i].getChild() != null) {
- isFlat = false;
- }
- }
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
- // Return empty forest if the graph is not flat.
- if (!isFlat) {
- return flatForest;
- }
- // Run BFS for each component of the graph.
+var _excluded = ["data"];
- var visited = new Set();
- var toBeVisited = [];
- var parents = new Map();
- var unProcessedNodes = [];
- unProcessedNodes = unProcessedNodes.concat(allNodes);
- // Each iteration of this loop finds a component of the graph and
- // decides whether it is a tree or not. If it is a tree, adds it to the
- // forest and continued with the next component.
- while (unProcessedNodes.length > 0 && isForest) {
- toBeVisited.push(unProcessedNodes[0]);
+// Returns the "n Items" string for this node,
+// generating and caching it if it hasn't been created yet.
+function createItemString(data) {
+ var len = Object.getOwnPropertyNames(data).length;
+ return "".concat(len, " ").concat(len !== 1 ? 'keys' : 'key');
+}
+
+// Configures <JSONNestedNode> to render an Object
+var JSONObjectNode = function JSONObjectNode(_ref) {
+ var data = _ref.data,
+ props = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_ref, _excluded);
+
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_2___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
+ data: data,
+ nodeType: "Object",
+ nodeTypeIndicator: props.nodeType === 'Error' ? 'Error()' : '{}',
+ createItemString: createItemString,
+ expandable: Object.getOwnPropertyNames(data).length > 0
+ }));
+};
+
+JSONObjectNode.propTypes = {
+ data: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().object),
+ nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().string).isRequired
+};
+/* harmony default export */ __webpack_exports__["default"] = (JSONObjectNode);
+
+/***/ }),
+
+/***/ "./node_modules/react-json-tree/lib/esm/JSONValueNode.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/JSONValueNode.js ***!
+ \***************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // Start the BFS. Each iteration of this loop visits a node in a
- // BFS manner.
- while (toBeVisited.length > 0 && isForest) {
- //pool operation
- var currentNode = toBeVisited[0];
- toBeVisited.splice(0, 1);
- visited.add(currentNode);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_2__);
- // Traverse all neighbors of this node
- var neighborEdges = currentNode.getEdges();
- for (var i = 0; i < neighborEdges.length; i++) {
- var currentNeighbor = neighborEdges[i].getOtherEnd(currentNode);
- // If BFS is not growing from this neighbor.
- if (parents.get(currentNode) != currentNeighbor) {
- // We haven't previously visited this neighbor.
- if (!visited.has(currentNeighbor)) {
- toBeVisited.push(currentNeighbor);
- parents.set(currentNeighbor, currentNode);
- }
- // Since we have previously visited this neighbor and
- // this neighbor is not parent of currentNode, given
- // graph contains a component that is not tree, hence
- // it is not a forest.
- else {
- isForest = false;
- break;
- }
- }
- }
- }
- // The graph contains a component that is not a tree. Empty
- // previously found trees. The method will end.
- if (!isForest) {
- flatForest = [];
- }
- // Save currently visited nodes as a tree in our forest. Reset
- // visited and parents lists. Continue with the next component of
- // the graph, if any.
- else {
- var temp = [].concat(_toConsumableArray(visited));
- flatForest.push(temp);
- //flatForest = flatForest.concat(temp);
- //unProcessedNodes.removeAll(visited);
- for (var i = 0; i < temp.length; i++) {
- var value = temp[i];
- var index = unProcessedNodes.indexOf(value);
- if (index > -1) {
- unProcessedNodes.splice(index, 1);
- }
- }
- visited = new Set();
- parents = new Map();
- }
- }
+var JSONValueNode = function JSONValueNode(_ref) {
+ var nodeType = _ref.nodeType,
+ styling = _ref.styling,
+ labelRenderer = _ref.labelRenderer,
+ keyPath = _ref.keyPath,
+ valueRenderer = _ref.valueRenderer,
+ value = _ref.value,
+ _ref$valueGetter = _ref.valueGetter,
+ valueGetter = _ref$valueGetter === void 0 ? function (value) {
+ return value;
+ } : _ref$valueGetter;
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("li", styling('value', nodeType, keyPath), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("label", styling(['label', 'valueLabel'], nodeType, keyPath), labelRenderer(keyPath, nodeType, false, false)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("span", styling('valueText', nodeType, keyPath), valueRenderer.apply(void 0, [valueGetter(value), value].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(keyPath)))));
+};
- return flatForest;
+JSONValueNode.propTypes = {
+ nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().string).isRequired,
+ styling: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
+ labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
+ keyPath: prop_types__WEBPACK_IMPORTED_MODULE_2___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_2___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_2___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_2___default().number)]).isRequired).isRequired,
+ valueRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
+ value: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().any),
+ valueGetter: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func)
};
+/* harmony default export */ __webpack_exports__["default"] = (JSONValueNode);
-/**
- * This method creates dummy nodes (an l-level node with minimal dimensions)
- * for the given edge (one per bendpoint). The existing l-level structure
- * is updated accordingly.
- */
-Layout.prototype.createDummyNodesForBendpoints = function (edge) {
- var dummyNodes = [];
- var prev = edge.source;
+/***/ }),
- var graph = this.graphManager.calcLowestCommonAncestor(edge.source, edge.target);
+/***/ "./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js":
+/*!************************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js ***!
+ \************************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- for (var i = 0; i < edge.bendpoints.length; i++) {
- // create new dummy node
- var dummyNode = this.newNode(null);
- dummyNode.setRect(new Point(0, 0), new Dimension(1, 1));
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var react_base16_styling__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react-base16-styling */ "./node_modules/react-base16-styling/lib/esm/index.js");
+/* harmony import */ var _themes_solarized__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./themes/solarized */ "./node_modules/react-json-tree/lib/esm/themes/solarized.js");
- graph.add(dummyNode);
- // create new dummy edge between prev and dummy node
- var dummyEdge = this.newEdge(null);
- this.graphManager.add(dummyEdge, prev, dummyNode);
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
- dummyNodes.add(dummyNode);
- prev = dummyNode;
- }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
- var dummyEdge = this.newEdge(null);
- this.graphManager.add(dummyEdge, prev, edge.target);
- this.edgeToDummyNodes.set(edge, dummyNodes);
- // remove real edge from graph manager if it is inter-graph
- if (edge.isInterGraph()) {
- this.graphManager.remove(edge);
- }
- // else, remove the edge from the current graph
- else {
- graph.remove(edge);
- }
- return dummyNodes;
+var colorMap = function colorMap(theme) {
+ return {
+ BACKGROUND_COLOR: theme.base00,
+ TEXT_COLOR: theme.base07,
+ STRING_COLOR: theme.base0B,
+ DATE_COLOR: theme.base0B,
+ NUMBER_COLOR: theme.base09,
+ BOOLEAN_COLOR: theme.base09,
+ NULL_COLOR: theme.base08,
+ UNDEFINED_COLOR: theme.base08,
+ FUNCTION_COLOR: theme.base08,
+ SYMBOL_COLOR: theme.base08,
+ LABEL_COLOR: theme.base0D,
+ ARROW_COLOR: theme.base0D,
+ ITEM_STRING_COLOR: theme.base0B,
+ ITEM_STRING_EXPANDED_COLOR: theme.base03
+ };
};
-/**
- * This method creates bendpoints for edges from the dummy nodes
- * at l-level.
- */
-Layout.prototype.createBendpointsFromDummyNodes = function () {
- var edges = [];
- edges = edges.concat(this.graphManager.getAllEdges());
- edges = [].concat(_toConsumableArray(this.edgeToDummyNodes.keys())).concat(edges);
-
- for (var k = 0; k < edges.length; k++) {
- var lEdge = edges[k];
+var valueColorMap = function valueColorMap(colors) {
+ return {
+ String: colors.STRING_COLOR,
+ Date: colors.DATE_COLOR,
+ Number: colors.NUMBER_COLOR,
+ Boolean: colors.BOOLEAN_COLOR,
+ Null: colors.NULL_COLOR,
+ Undefined: colors.UNDEFINED_COLOR,
+ Function: colors.FUNCTION_COLOR,
+ Symbol: colors.SYMBOL_COLOR
+ };
+};
- if (lEdge.bendpoints.length > 0) {
- var path = this.edgeToDummyNodes.get(lEdge);
+var getDefaultThemeStyling = function getDefaultThemeStyling(theme) {
+ var colors = colorMap(theme);
+ return {
+ tree: {
+ border: 0,
+ padding: 0,
+ marginTop: '0.5em',
+ marginBottom: '0.5em',
+ marginLeft: '0.125em',
+ marginRight: 0,
+ listStyle: 'none',
+ MozUserSelect: 'none',
+ WebkitUserSelect: 'none',
+ backgroundColor: colors.BACKGROUND_COLOR
+ },
+ value: function value(_ref, nodeType, keyPath) {
+ var style = _ref.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ paddingTop: '0.25em',
+ paddingRight: 0,
+ marginLeft: '0.875em',
+ WebkitUserSelect: 'text',
+ MozUserSelect: 'text',
+ wordWrap: 'break-word',
+ paddingLeft: keyPath.length > 1 ? '2.125em' : '1.25em',
+ textIndent: '-0.5em',
+ wordBreak: 'break-all'
+ })
+ };
+ },
+ label: {
+ display: 'inline-block',
+ color: colors.LABEL_COLOR
+ },
+ valueLabel: {
+ margin: '0 0.5em 0 0'
+ },
+ valueText: function valueText(_ref2, nodeType) {
+ var style = _ref2.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ color: valueColorMap(colors)[nodeType]
+ })
+ };
+ },
+ itemRange: function itemRange(styling, expanded) {
+ return {
+ style: {
+ paddingTop: expanded ? 0 : '0.25em',
+ cursor: 'pointer',
+ color: colors.LABEL_COLOR
+ }
+ };
+ },
+ arrow: function arrow(_ref3, nodeType, expanded) {
+ var style = _ref3.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ marginLeft: 0,
+ transition: '150ms',
+ WebkitTransition: '150ms',
+ MozTransition: '150ms',
+ WebkitTransform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
+ MozTransform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
+ transform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
+ transformOrigin: '45% 50%',
+ WebkitTransformOrigin: '45% 50%',
+ MozTransformOrigin: '45% 50%',
+ position: 'relative',
+ lineHeight: '1.1em',
+ fontSize: '0.75em'
+ })
+ };
+ },
+ arrowContainer: function arrowContainer(_ref4, arrowStyle) {
+ var style = _ref4.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ display: 'inline-block',
+ paddingRight: '0.5em',
+ paddingLeft: arrowStyle === 'double' ? '1em' : 0,
+ cursor: 'pointer'
+ })
+ };
+ },
+ arrowSign: {
+ color: colors.ARROW_COLOR
+ },
+ arrowSignInner: {
+ position: 'absolute',
+ top: 0,
+ left: '-0.4em'
+ },
+ nestedNode: function nestedNode(_ref5, keyPath, nodeType, expanded, expandable) {
+ var style = _ref5.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ position: 'relative',
+ paddingTop: '0.25em',
+ marginLeft: keyPath.length > 1 ? '0.875em' : 0,
+ paddingLeft: !expandable ? '1.125em' : 0
+ })
+ };
+ },
+ rootNode: {
+ padding: 0,
+ margin: 0
+ },
+ nestedNodeLabel: function nestedNodeLabel(_ref6, keyPath, nodeType, expanded, expandable) {
+ var style = _ref6.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ margin: 0,
+ padding: 0,
+ WebkitUserSelect: expandable ? 'inherit' : 'text',
+ MozUserSelect: expandable ? 'inherit' : 'text',
+ cursor: expandable ? 'pointer' : 'default'
+ })
+ };
+ },
+ nestedNodeItemString: function nestedNodeItemString(_ref7, keyPath, nodeType, expanded) {
+ var style = _ref7.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ paddingLeft: '0.5em',
+ cursor: 'default',
+ color: expanded ? colors.ITEM_STRING_EXPANDED_COLOR : colors.ITEM_STRING_COLOR
+ })
+ };
+ },
+ nestedNodeItemType: {
+ marginLeft: '0.3em',
+ marginRight: '0.3em'
+ },
+ nestedNodeChildren: function nestedNodeChildren(_ref8, nodeType, expanded) {
+ var style = _ref8.style;
+ return {
+ style: _objectSpread(_objectSpread({}, style), {}, {
+ padding: 0,
+ margin: 0,
+ listStyle: 'none',
+ display: expanded ? 'block' : 'none'
+ })
+ };
+ },
+ rootNodeChildren: {
+ padding: 0,
+ margin: 0,
+ listStyle: 'none'
+ }
+ };
+};
- for (var i = 0; i < path.length; i++) {
- var dummyNode = path[i];
- var p = new PointD(dummyNode.getCenterX(), dummyNode.getCenterY());
+var createStylingFromTheme = (0,react_base16_styling__WEBPACK_IMPORTED_MODULE_1__.createStyling)(getDefaultThemeStyling, {
+ defaultBase16: _themes_solarized__WEBPACK_IMPORTED_MODULE_2__["default"]
+});
+/* harmony default export */ __webpack_exports__["default"] = (createStylingFromTheme);
- // update bendpoint's location according to dummy node
- var ebp = lEdge.bendpoints.get(i);
- ebp.x = p.x;
- ebp.y = p.y;
+/***/ }),
- // remove the dummy node, dummy edges incident with this
- // dummy node is also removed (within the remove method)
- dummyNode.getOwner().remove(dummyNode);
- }
+/***/ "./node_modules/react-json-tree/lib/esm/getCollectionEntries.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/getCollectionEntries.js ***!
+ \**********************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // add the real edge to graph
- this.graphManager.add(lEdge, lEdge.source, lEdge.target);
- }
- }
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ getCollectionEntries; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
-Layout.transform = function (sliderValue, defaultValue, minDiv, maxMul) {
- if (minDiv != undefined && maxMul != undefined) {
- var value = defaultValue;
- if (sliderValue <= 50) {
- var minValue = defaultValue / minDiv;
- value -= (defaultValue - minValue) / 50 * (50 - sliderValue);
- } else {
- var maxValue = defaultValue * maxMul;
- value += (maxValue - defaultValue) / 50 * (sliderValue - 50);
- }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
- return value;
- } else {
- var a, b;
+function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
- if (sliderValue <= 50) {
- a = 9.0 * defaultValue / 500.0;
- b = defaultValue / 10.0;
- } else {
- a = 9.0 * defaultValue / 50.0;
- b = -8 * defaultValue;
- }
+function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
- return a * sliderValue + b;
+function getLength(type, collection) {
+ if (type === 'Object') {
+ // eslint-disable-next-line @typescript-eslint/ban-types
+ return Object.keys(collection).length;
+ } else if (type === 'Array') {
+ return collection.length;
}
-};
-/**
- * This method finds and returns the center of the given nodes, assuming
- * that the given nodes form a tree in themselves.
- */
-Layout.findCenterOfTree = function (nodes) {
- var list = [];
- list = list.concat(nodes);
+ return Infinity;
+}
- var removedNodes = [];
- var remainingDegrees = new Map();
- var foundCenter = false;
- var centerNode = null;
+function isIterableMap(collection) {
+ return typeof collection.set === 'function';
+}
- if (list.length == 1 || list.length == 2) {
- foundCenter = true;
- centerNode = list[0];
- }
+function getEntries(type, collection, sortObjectKeys) {
+ var from = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
+ var to = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : Infinity;
+ var res;
- for (var i = 0; i < list.length; i++) {
- var node = list[i];
- var degree = node.getNeighborsList().size;
- remainingDegrees.set(node, node.getNeighborsList().size);
+ if (type === 'Object') {
+ var keys = Object.getOwnPropertyNames(collection);
- if (degree == 1) {
- removedNodes.push(node);
+ if (sortObjectKeys) {
+ keys.sort(sortObjectKeys === true ? undefined : sortObjectKeys);
}
- }
-
- var tempList = [];
- tempList = tempList.concat(removedNodes);
-
- while (!foundCenter) {
- var tempList2 = [];
- tempList2 = tempList2.concat(tempList);
- tempList = [];
- for (var i = 0; i < list.length; i++) {
- var node = list[i];
+ keys = keys.slice(from, to + 1);
+ res = {
+ entries: keys.map(function (key) {
+ return {
+ key: key,
+ value: collection[key]
+ };
+ })
+ };
+ } else if (type === 'Array') {
+ res = {
+ entries: collection.slice(from, to + 1).map(function (val, idx) {
+ return {
+ key: idx + from,
+ value: val
+ };
+ })
+ };
+ } else {
+ var idx = 0;
+ var entries = [];
+ var done = true;
+ var isMap = isIterableMap(collection);
- var index = list.indexOf(node);
- if (index >= 0) {
- list.splice(index, 1);
- }
+ var _iterator = _createForOfIteratorHelper(collection),
+ _step;
- var neighbours = node.getNeighborsList();
+ try {
+ for (_iterator.s(); !(_step = _iterator.n()).done;) {
+ var item = _step.value;
- neighbours.forEach(function (neighbour) {
- if (removedNodes.indexOf(neighbour) < 0) {
- var otherDegree = remainingDegrees.get(neighbour);
- var newDegree = otherDegree - 1;
+ if (idx > to) {
+ done = false;
+ break;
+ }
- if (newDegree == 1) {
- tempList.push(neighbour);
+ if (from <= idx) {
+ if (isMap && Array.isArray(item)) {
+ if (typeof item[0] === 'string' || typeof item[0] === 'number') {
+ entries.push({
+ key: item[0],
+ value: item[1]
+ });
+ } else {
+ entries.push({
+ key: "[entry ".concat(idx, "]"),
+ value: {
+ '[key]': item[0],
+ '[value]': item[1]
+ }
+ });
+ }
+ } else {
+ entries.push({
+ key: idx,
+ value: item
+ });
}
-
- remainingDegrees.set(neighbour, newDegree);
}
- });
+
+ idx++;
+ }
+ } catch (err) {
+ _iterator.e(err);
+ } finally {
+ _iterator.f();
}
- removedNodes = removedNodes.concat(tempList);
-
- if (list.length == 1 || list.length == 2) {
- foundCenter = true;
- centerNode = list[0];
- }
+ res = {
+ hasMore: !done,
+ entries: entries
+ };
}
- return centerNode;
-};
-
-/**
- * During the coarsening process, this layout may be referenced by two graph managers
- * this setter function grants access to change the currently being used graph manager
- */
-Layout.prototype.setGraphManager = function (gm) {
- this.graphManager = gm;
-};
+ return res;
+}
-module.exports = Layout;
+function getRanges(from, to, limit) {
+ var ranges = [];
-/***/ }),
-/* 16 */
-/***/ (function(module, exports, __webpack_require__) {
+ while (to - from > limit * limit) {
+ limit = limit * limit;
+ }
-"use strict";
+ for (var i = from; i <= to; i += limit) {
+ ranges.push({
+ from: i,
+ to: Math.min(to, i + limit - 1)
+ });
+ }
+ return ranges;
+}
-function RandomSeed() {}
-// adapted from: https://stackoverflow.com/a/19303725
-RandomSeed.seed = 1;
-RandomSeed.x = 0;
+function getCollectionEntries(type, collection, sortObjectKeys, limit) {
+ var from = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+ var to = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : Infinity;
+ var getEntriesBound = getEntries.bind(null, type, collection, sortObjectKeys);
-RandomSeed.nextDouble = function () {
- RandomSeed.x = Math.sin(RandomSeed.seed++) * 10000;
- return RandomSeed.x - Math.floor(RandomSeed.x);
-};
+ if (!limit) {
+ return getEntriesBound().entries;
+ }
-module.exports = RandomSeed;
+ var isSubset = to < Infinity;
+ var length = Math.min(to - from, getLength(type, collection));
-/***/ }),
-/* 17 */
-/***/ (function(module, exports, __nested_webpack_require_84109__) {
+ if (type !== 'Iterable') {
+ if (length <= limit || limit < 7) {
+ return getEntriesBound(from, to).entries;
+ }
+ } else {
+ if (length <= limit && !isSubset) {
+ return getEntriesBound(from, to).entries;
+ }
+ }
-"use strict";
+ var limitedEntries;
+ if (type === 'Iterable') {
+ var _getEntriesBound = getEntriesBound(from, from + limit - 1),
+ hasMore = _getEntriesBound.hasMore,
+ entries = _getEntriesBound.entries;
-var PointD = __nested_webpack_require_84109__(5);
+ limitedEntries = hasMore ? [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(entries), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getRanges(from + limit, from + 2 * limit - 1, limit))) : entries;
+ } else {
+ limitedEntries = isSubset ? getRanges(from, to, limit) : [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getEntriesBound(0, limit - 5).entries), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getRanges(limit - 4, length - 5, limit)), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getEntriesBound(length - 4, length - 1).entries));
+ }
-function Transform(x, y) {
- this.lworldOrgX = 0.0;
- this.lworldOrgY = 0.0;
- this.ldeviceOrgX = 0.0;
- this.ldeviceOrgY = 0.0;
- this.lworldExtX = 1.0;
- this.lworldExtY = 1.0;
- this.ldeviceExtX = 1.0;
- this.ldeviceExtY = 1.0;
+ return limitedEntries;
}
-Transform.prototype.getWorldOrgX = function () {
- return this.lworldOrgX;
-};
+/***/ }),
-Transform.prototype.setWorldOrgX = function (wox) {
- this.lworldOrgX = wox;
-};
+/***/ "./node_modules/react-json-tree/lib/esm/index.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/index.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-Transform.prototype.getWorldOrgY = function () {
- return this.lworldOrgY;
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ JSONTree: function() { return /* binding */ JSONTree; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
+/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
+/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
+/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
+/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
+/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/slicedToArray */ "./node_modules/@babel/runtime/helpers/esm/slicedToArray.js");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! react */ "react");
+/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_9__);
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! prop-types */ "prop-types");
+/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_10__);
+/* harmony import */ var _JSONNode__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./JSONNode */ "./node_modules/react-json-tree/lib/esm/JSONNode.js");
+/* harmony import */ var _createStylingFromTheme__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./createStylingFromTheme */ "./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js");
+/* harmony import */ var react_base16_styling__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! react-base16-styling */ "./node_modules/react-base16-styling/lib/esm/index.js");
-Transform.prototype.setWorldOrgY = function (woy) {
- this.lworldOrgY = woy;
-};
-Transform.prototype.getWorldExtX = function () {
- return this.lworldExtX;
-};
-Transform.prototype.setWorldExtX = function (wex) {
- this.lworldExtX = wex;
-};
-Transform.prototype.getWorldExtY = function () {
- return this.lworldExtY;
-};
-Transform.prototype.setWorldExtY = function (wey) {
- this.lworldExtY = wey;
-};
-/* Device related */
-Transform.prototype.getDeviceOrgX = function () {
- return this.ldeviceOrgX;
-};
-Transform.prototype.setDeviceOrgX = function (dox) {
- this.ldeviceOrgX = dox;
-};
-Transform.prototype.getDeviceOrgY = function () {
- return this.ldeviceOrgY;
-};
+var _excluded = ["data", "keyPath", "postprocessValue", "hideRoot", "theme", "invertTheme"];
-Transform.prototype.setDeviceOrgY = function (doy) {
- this.ldeviceOrgY = doy;
-};
+function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__["default"])(this, result); }; }
-Transform.prototype.getDeviceExtX = function () {
- return this.ldeviceExtX;
-};
+function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-Transform.prototype.setDeviceExtX = function (dex) {
- this.ldeviceExtX = dex;
-};
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-Transform.prototype.getDeviceExtY = function () {
- return this.ldeviceExtY;
-};
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-Transform.prototype.setDeviceExtY = function (dey) {
- this.ldeviceExtY = dey;
-};
+// ES6 + inline style port of JSONViewer https://bitbucket.org/davevedder/react-json-viewer/
+// all credits and original code to the author
+// Dave Vedder <veddermatic@gmail.com> http://www.eskimospy.com/
+// port by Daniele Zannotti http://www.github.com/dzannotti <dzannotti@me.com>
-Transform.prototype.transformX = function (x) {
- var xDevice = 0.0;
- var worldExtX = this.lworldExtX;
- if (worldExtX != 0.0) {
- xDevice = this.ldeviceOrgX + (x - this.lworldOrgX) * this.ldeviceExtX / worldExtX;
- }
- return xDevice;
-};
-Transform.prototype.transformY = function (y) {
- var yDevice = 0.0;
- var worldExtY = this.lworldExtY;
- if (worldExtY != 0.0) {
- yDevice = this.ldeviceOrgY + (y - this.lworldOrgY) * this.ldeviceExtY / worldExtY;
- }
- return yDevice;
-};
-Transform.prototype.inverseTransformX = function (x) {
- var xWorld = 0.0;
- var deviceExtX = this.ldeviceExtX;
- if (deviceExtX != 0.0) {
- xWorld = this.lworldOrgX + (x - this.ldeviceOrgX) * this.lworldExtX / deviceExtX;
- }
- return xWorld;
+var identity = function identity(value) {
+ return value;
};
-Transform.prototype.inverseTransformY = function (y) {
- var yWorld = 0.0;
- var deviceExtY = this.ldeviceExtY;
- if (deviceExtY != 0.0) {
- yWorld = this.lworldOrgY + (y - this.ldeviceOrgY) * this.lworldExtY / deviceExtY;
- }
- return yWorld;
+var expandRootNode = function expandRootNode(keyPath, data, level) {
+ return level === 0;
};
-Transform.prototype.inverseTransformPoint = function (inPoint) {
- var outPoint = new PointD(this.inverseTransformX(inPoint.x), this.inverseTransformY(inPoint.y));
- return outPoint;
+var defaultItemString = function defaultItemString(type, data, itemType, itemString) {
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", null, itemType, " ", itemString);
};
-module.exports = Transform;
-
-/***/ }),
-/* 18 */
-/***/ (function(module, exports, __nested_webpack_require_86996__) {
-
-"use strict";
-
-
-function _toConsumableArray(arr) { if (Array.isArray(arr)) { for (var i = 0, arr2 = Array(arr.length); i < arr.length; i++) { arr2[i] = arr[i]; } return arr2; } else { return Array.from(arr); } }
-
-var Layout = __nested_webpack_require_86996__(15);
-var FDLayoutConstants = __nested_webpack_require_86996__(4);
-var LayoutConstants = __nested_webpack_require_86996__(0);
-var IGeometry = __nested_webpack_require_86996__(8);
-var IMath = __nested_webpack_require_86996__(9);
-
-function FDLayout() {
- Layout.call(this);
-
- this.useSmartIdealEdgeLengthCalculation = FDLayoutConstants.DEFAULT_USE_SMART_IDEAL_EDGE_LENGTH_CALCULATION;
- this.gravityConstant = FDLayoutConstants.DEFAULT_GRAVITY_STRENGTH;
- this.compoundGravityConstant = FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_STRENGTH;
- this.gravityRangeFactor = FDLayoutConstants.DEFAULT_GRAVITY_RANGE_FACTOR;
- this.compoundGravityRangeFactor = FDLayoutConstants.DEFAULT_COMPOUND_GRAVITY_RANGE_FACTOR;
- this.displacementThresholdPerNode = 3.0 * FDLayoutConstants.DEFAULT_EDGE_LENGTH / 100;
- this.coolingFactor = FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL;
- this.initialCoolingFactor = FDLayoutConstants.DEFAULT_COOLING_FACTOR_INCREMENTAL;
- this.totalDisplacement = 0.0;
- this.oldTotalDisplacement = 0.0;
- this.maxIterations = FDLayoutConstants.MAX_ITERATIONS;
-}
-
-FDLayout.prototype = Object.create(Layout.prototype);
-
-for (var prop in Layout) {
- FDLayout[prop] = Layout[prop];
-}
-
-FDLayout.prototype.initParameters = function () {
- Layout.prototype.initParameters.call(this, arguments);
-
- this.totalIterations = 0;
- this.notAnimatedIterations = 0;
-
- this.useFRGridVariant = FDLayoutConstants.DEFAULT_USE_SMART_REPULSION_RANGE_CALCULATION;
+var defaultLabelRenderer = function defaultLabelRenderer(_ref) {
+ var _ref2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_8__["default"])(_ref, 1),
+ label = _ref2[0];
- this.grid = [];
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", null, label, ":");
};
-FDLayout.prototype.calcIdealEdgeLengths = function () {
- var edge;
- var originalIdealLength;
- var lcaDepth;
- var source;
- var target;
- var sizeOfSourceInLca;
- var sizeOfTargetInLca;
-
- var allEdges = this.getGraphManager().getAllEdges();
- for (var i = 0; i < allEdges.length; i++) {
- edge = allEdges[i];
+var noCustomNode = function noCustomNode() {
+ return false;
+};
- originalIdealLength = edge.idealLength;
+function checkLegacyTheming(theme, props) {
+ var deprecatedStylingMethodsMap = {
+ getArrowStyle: 'arrow',
+ getListStyle: 'nestedNodeChildren',
+ getItemStringStyle: 'nestedNodeItemString',
+ getLabelStyle: 'label',
+ getValueStyle: 'valueText'
+ };
+ var deprecatedStylingMethods = Object.keys(deprecatedStylingMethodsMap).filter(function (name) {
+ return props[name];
+ });
- if (edge.isInterGraph) {
- source = edge.getSource();
- target = edge.getTarget();
+ if (deprecatedStylingMethods.length > 0) {
+ if (typeof theme === 'string') {
+ theme = {
+ extend: theme
+ };
+ } else {
+ theme = _objectSpread({}, theme);
+ }
- sizeOfSourceInLca = edge.getSourceInLca().getEstimatedSize();
- sizeOfTargetInLca = edge.getTargetInLca().getEstimatedSize();
+ deprecatedStylingMethods.forEach(function (name) {
+ // eslint-disable-next-line no-console
+ console.error("Styling method \"".concat(name, "\" is deprecated, use \"theme\" property instead"));
- if (this.useSmartIdealEdgeLengthCalculation) {
- edge.idealLength += sizeOfSourceInLca + sizeOfTargetInLca - 2 * LayoutConstants.SIMPLE_NODE_SIZE;
- }
+ theme[deprecatedStylingMethodsMap[name]] = function (_ref3) {
+ var style = _ref3.style;
- lcaDepth = edge.getLca().getInclusionTreeDepth();
+ for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+ args[_key - 1] = arguments[_key];
+ }
- edge.idealLength += originalIdealLength * FDLayoutConstants.PER_LEVEL_IDEAL_EDGE_LENGTH_FACTOR * (source.getInclusionTreeDepth() + target.getInclusionTreeDepth() - 2 * lcaDepth);
- }
+ return {
+ style: _objectSpread(_objectSpread({}, style), props[name].apply(props, args))
+ };
+ };
+ });
}
-};
-FDLayout.prototype.initSpringEmbedder = function () {
+ return theme;
+}
- var s = this.getAllNodes().length;
- if (this.incremental) {
- if (s > FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) {
- this.coolingFactor = Math.max(this.coolingFactor * FDLayoutConstants.COOLING_ADAPTATION_FACTOR, this.coolingFactor - (s - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) / (FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) * this.coolingFactor * (1 - FDLayoutConstants.COOLING_ADAPTATION_FACTOR));
- }
- this.maxNodeDisplacement = FDLayoutConstants.MAX_NODE_DISPLACEMENT_INCREMENTAL;
- } else {
- if (s > FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) {
- this.coolingFactor = Math.max(FDLayoutConstants.COOLING_ADAPTATION_FACTOR, 1.0 - (s - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) / (FDLayoutConstants.ADAPTATION_UPPER_NODE_LIMIT - FDLayoutConstants.ADAPTATION_LOWER_NODE_LIMIT) * (1 - FDLayoutConstants.COOLING_ADAPTATION_FACTOR));
- } else {
- this.coolingFactor = 1.0;
- }
- this.initialCoolingFactor = this.coolingFactor;
- this.maxNodeDisplacement = FDLayoutConstants.MAX_NODE_DISPLACEMENT;
+function getStateFromProps(props) {
+ var theme = checkLegacyTheming(props.theme, props);
+
+ if (props.invertTheme) {
+ theme = (0,react_base16_styling__WEBPACK_IMPORTED_MODULE_11__.invertTheme)(theme);
}
- this.maxIterations = Math.max(this.getAllNodes().length * 5, this.maxIterations);
+ return {
+ styling: (0,_createStylingFromTheme__WEBPACK_IMPORTED_MODULE_12__["default"])(theme)
+ };
+}
- // Reassign this attribute by using new constant value
- this.displacementThresholdPerNode = 3.0 * FDLayoutConstants.DEFAULT_EDGE_LENGTH / 100;
- this.totalDisplacementThreshold = this.displacementThresholdPerNode * this.getAllNodes().length;
+var JSONTree = /*#__PURE__*/function (_React$Component) {
+ (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__["default"])(JSONTree, _React$Component);
- this.repulsionRange = this.calcRepulsionRange();
-};
+ var _super = _createSuper(JSONTree);
-FDLayout.prototype.calcSpringForces = function () {
- var lEdges = this.getAllEdges();
- var edge;
+ function JSONTree(props) {
+ var _this;
- for (var i = 0; i < lEdges.length; i++) {
- edge = lEdges[i];
+ (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__["default"])(this, JSONTree);
- this.calcSpringForce(edge, edge.idealLength);
+ _this = _super.call(this, props);
+ _this.state = getStateFromProps(props);
+ return _this;
}
-};
-
-FDLayout.prototype.calcRepulsionForces = function () {
- var gridUpdateAllowed = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : true;
- var forceToNodeSurroundingUpdate = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
- var i, j;
- var nodeA, nodeB;
- var lNodes = this.getAllNodes();
- var processedNodeSet;
+ (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_3__["default"])(JSONTree, [{
+ key: "UNSAFE_componentWillReceiveProps",
+ value: function UNSAFE_componentWillReceiveProps(nextProps) {
+ var _this2 = this;
- if (this.useFRGridVariant) {
- if (this.totalIterations % FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD == 1 && gridUpdateAllowed) {
- this.updateGrid();
+ if (['theme', 'invertTheme'].find(function (k) {
+ return nextProps[k] !== _this2.props[k];
+ })) {
+ this.setState(getStateFromProps(nextProps));
+ }
}
+ }, {
+ key: "shouldComponentUpdate",
+ value: function shouldComponentUpdate(nextProps) {
+ var _this3 = this;
- processedNodeSet = new Set();
-
- // calculate repulsion forces between each nodes and its surrounding
- for (i = 0; i < lNodes.length; i++) {
- nodeA = lNodes[i];
- this.calculateRepulsionForceOfANode(nodeA, processedNodeSet, gridUpdateAllowed, forceToNodeSurroundingUpdate);
- processedNodeSet.add(nodeA);
+ return !!Object.keys(nextProps).find(function (k) {
+ return k === 'keyPath' ? nextProps[k].join('/') !== _this3.props[k].join('/') : nextProps[k] !== _this3.props[k];
+ });
}
- } else {
- for (i = 0; i < lNodes.length; i++) {
- nodeA = lNodes[i];
-
- for (j = i + 1; j < lNodes.length; j++) {
- nodeB = lNodes[j];
-
- // If both nodes are not members of the same graph, skip.
- if (nodeA.getOwner() != nodeB.getOwner()) {
- continue;
- }
+ }, {
+ key: "render",
+ value: function render() {
+ var _this$props = this.props,
+ value = _this$props.data,
+ keyPath = _this$props.keyPath,
+ postprocessValue = _this$props.postprocessValue,
+ hideRoot = _this$props.hideRoot,
+ theme = _this$props.theme,
+ _ = _this$props.invertTheme,
+ rest = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_this$props, _excluded);
- this.calcRepulsionForce(nodeA, nodeB);
- }
+ var styling = this.state.styling;
+ return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling('tree'), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONNode__WEBPACK_IMPORTED_MODULE_13__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, _objectSpread({
+ postprocessValue: postprocessValue,
+ hideRoot: hideRoot,
+ styling: styling
+ }, rest), {
+ keyPath: hideRoot ? [] : keyPath,
+ value: postprocessValue(value)
+ })));
}
- }
-};
-
-FDLayout.prototype.calcGravitationalForces = function () {
- var node;
- var lNodes = this.getAllNodesToApplyGravitation();
+ }]);
- for (var i = 0; i < lNodes.length; i++) {
- node = lNodes[i];
- this.calcGravitationalForce(node);
- }
-};
+ return JSONTree;
+}((react__WEBPACK_IMPORTED_MODULE_9___default().Component));
-FDLayout.prototype.moveNodes = function () {
- var lNodes = this.getAllNodes();
- var node;
+(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(JSONTree, "propTypes", {
+ data: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
+ hideRoot: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
+ theme: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().object), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().string)]),
+ invertTheme: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
+ keyPath: prop_types__WEBPACK_IMPORTED_MODULE_10___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number)])),
+ postprocessValue: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func),
+ sortObjectKeys: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().func), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)])
+});
- for (var i = 0; i < lNodes.length; i++) {
- node = lNodes[i];
- node.move();
- }
-};
+(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(JSONTree, "defaultProps", {
+ shouldExpandNode: expandRootNode,
+ hideRoot: false,
+ keyPath: ['root'],
+ getItemString: defaultItemString,
+ labelRenderer: defaultLabelRenderer,
+ valueRenderer: identity,
+ postprocessValue: identity,
+ isCustomNode: noCustomNode,
+ collectionLimit: 50,
+ invertTheme: true
+});
-FDLayout.prototype.calcSpringForce = function (edge, idealLength) {
- var sourceNode = edge.getSource();
- var targetNode = edge.getTarget();
+/***/ }),
- var length;
- var springForce;
- var springForceX;
- var springForceY;
+/***/ "./node_modules/react-json-tree/lib/esm/objType.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/objType.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // Update edge length
- if (this.uniformLeafNodeSizes && sourceNode.getChild() == null && targetNode.getChild() == null) {
- edge.updateLengthSimple();
- } else {
- edge.updateLength();
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ objType; }
+/* harmony export */ });
+function objType(obj) {
+ var type = Object.prototype.toString.call(obj).slice(8, -1);
- if (edge.isOverlapingSourceAndTarget) {
- return;
- }
+ if (type === 'Object' && typeof obj[Symbol.iterator] === 'function') {
+ return 'Iterable';
}
- length = edge.getLength();
+ if (type === 'Custom' && obj.constructor !== Object && obj instanceof Object) {
+ // For projects implementing objects overriding `.prototype[Symbol.toStringTag]`
+ return 'Object';
+ }
- if (length == 0) return;
+ return type;
+}
- // Calculate spring forces
- springForce = edge.edgeElasticity * (length - idealLength);
+/***/ }),
- // Project force onto x and y axes
- springForceX = springForce * (edge.lengthX / length);
- springForceY = springForce * (edge.lengthY / length);
+/***/ "./node_modules/react-json-tree/lib/esm/themes/solarized.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/react-json-tree/lib/esm/themes/solarized.js ***!
+ \******************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // Apply forces on the end nodes
- sourceNode.springForceX += springForceX;
- sourceNode.springForceY += springForceY;
- targetNode.springForceX -= springForceX;
- targetNode.springForceY -= springForceY;
-};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony default export */ __webpack_exports__["default"] = ({
+ scheme: 'solarized',
+ author: 'ethan schoonover (http://ethanschoonover.com/solarized)',
+ base00: '#002b36',
+ base01: '#073642',
+ base02: '#586e75',
+ base03: '#657b83',
+ base04: '#839496',
+ base05: '#93a1a1',
+ base06: '#eee8d5',
+ base07: '#fdf6e3',
+ base08: '#dc322f',
+ base09: '#cb4b16',
+ base0A: '#b58900',
+ base0B: '#859900',
+ base0C: '#2aa198',
+ base0D: '#268bd2',
+ base0E: '#6c71c4',
+ base0F: '#d33682'
+});
-FDLayout.prototype.calcRepulsionForce = function (nodeA, nodeB) {
- var rectA = nodeA.getRect();
- var rectB = nodeB.getRect();
- var overlapAmount = new Array(2);
- var clipPoints = new Array(4);
- var distanceX;
- var distanceY;
- var distanceSquared;
- var distance;
- var repulsionForce;
- var repulsionForceX;
- var repulsionForceY;
+/***/ }),
- if (rectA.intersects(rectB)) // two nodes overlap
- {
- // calculate separation amount in x and y directions
- IGeometry.calcSeparationAmount(rectA, rectB, overlapAmount, FDLayoutConstants.DEFAULT_EDGE_LENGTH / 2.0);
+/***/ "./node_modules/redux-actions/es/createAction.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/redux-actions/es/createAction.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- repulsionForceX = 2 * overlapAmount[0];
- repulsionForceY = 2 * overlapAmount[1];
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ createAction; }
+/* harmony export */ });
+/* harmony import */ var invariant__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! invariant */ "./node_modules/invariant/browser.js");
+/* harmony import */ var invariant__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(invariant__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _utils_isFunction__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./utils/isFunction */ "./node_modules/redux-actions/es/utils/isFunction.js");
+/* harmony import */ var _utils_identity__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils/identity */ "./node_modules/redux-actions/es/utils/identity.js");
+/* harmony import */ var _utils_isNull__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./utils/isNull */ "./node_modules/redux-actions/es/utils/isNull.js");
- var childrenConstant = nodeA.noOfChildren * nodeB.noOfChildren / (nodeA.noOfChildren + nodeB.noOfChildren);
- // Apply forces on the two nodes
- nodeA.repulsionForceX -= childrenConstant * repulsionForceX;
- nodeA.repulsionForceY -= childrenConstant * repulsionForceY;
- nodeB.repulsionForceX += childrenConstant * repulsionForceX;
- nodeB.repulsionForceY += childrenConstant * repulsionForceY;
- } else // no overlap
- {
- // calculate distance
- if (this.uniformLeafNodeSizes && nodeA.getChild() == null && nodeB.getChild() == null) // simply base repulsion on distance of node centers
- {
- distanceX = rectB.getCenterX() - rectA.getCenterX();
- distanceY = rectB.getCenterY() - rectA.getCenterY();
- } else // use clipping points
- {
- IGeometry.getIntersection(rectA, rectB, clipPoints);
- distanceX = clipPoints[2] - clipPoints[0];
- distanceY = clipPoints[3] - clipPoints[1];
- }
+function createAction(type, payloadCreator, metaCreator) {
+ if (payloadCreator === void 0) {
+ payloadCreator = _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"];
+ }
- // No repulsion range. FR grid variant should take care of this.
- if (Math.abs(distanceX) < FDLayoutConstants.MIN_REPULSION_DIST) {
- distanceX = IMath.sign(distanceX) * FDLayoutConstants.MIN_REPULSION_DIST;
- }
+ invariant__WEBPACK_IMPORTED_MODULE_0___default()((0,_utils_isFunction__WEBPACK_IMPORTED_MODULE_2__["default"])(payloadCreator) || (0,_utils_isNull__WEBPACK_IMPORTED_MODULE_3__["default"])(payloadCreator), 'Expected payloadCreator to be a function, undefined or null');
+ var finalPayloadCreator = (0,_utils_isNull__WEBPACK_IMPORTED_MODULE_3__["default"])(payloadCreator) || payloadCreator === _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"] ? _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"] : function (head) {
+ for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+ args[_key - 1] = arguments[_key];
+ }
- if (Math.abs(distanceY) < FDLayoutConstants.MIN_REPULSION_DIST) {
- distanceY = IMath.sign(distanceY) * FDLayoutConstants.MIN_REPULSION_DIST;
- }
+ return head instanceof Error ? head : payloadCreator.apply(void 0, [head].concat(args));
+ };
+ var hasMeta = (0,_utils_isFunction__WEBPACK_IMPORTED_MODULE_2__["default"])(metaCreator);
+ var typeString = type.toString();
- distanceSquared = distanceX * distanceX + distanceY * distanceY;
- distance = Math.sqrt(distanceSquared);
+ var actionCreator = function actionCreator() {
+ var payload = finalPayloadCreator.apply(void 0, arguments);
+ var action = {
+ type: type
+ };
- // Here we use half of the nodes' repulsion values for backward compatibility
- repulsionForce = (nodeA.nodeRepulsion / 2 + nodeB.nodeRepulsion / 2) * nodeA.noOfChildren * nodeB.noOfChildren / distanceSquared;
+ if (payload instanceof Error) {
+ action.error = true;
+ }
- // Project force onto x and y axes
- repulsionForceX = repulsionForce * distanceX / distance;
- repulsionForceY = repulsionForce * distanceY / distance;
+ if (payload !== undefined) {
+ action.payload = payload;
+ }
- // Apply forces on the two nodes
- nodeA.repulsionForceX -= repulsionForceX;
- nodeA.repulsionForceY -= repulsionForceY;
- nodeB.repulsionForceX += repulsionForceX;
- nodeB.repulsionForceY += repulsionForceY;
+ if (hasMeta) {
+ action.meta = metaCreator.apply(void 0, arguments);
}
-};
-FDLayout.prototype.calcGravitationalForce = function (node) {
- var ownerGraph;
- var ownerCenterX;
- var ownerCenterY;
- var distanceX;
- var distanceY;
- var absDistanceX;
- var absDistanceY;
- var estimatedSize;
- ownerGraph = node.getOwner();
+ return action;
+ };
- ownerCenterX = (ownerGraph.getRight() + ownerGraph.getLeft()) / 2;
- ownerCenterY = (ownerGraph.getTop() + ownerGraph.getBottom()) / 2;
- distanceX = node.getCenterX() - ownerCenterX;
- distanceY = node.getCenterY() - ownerCenterY;
- absDistanceX = Math.abs(distanceX) + node.getWidth() / 2;
- absDistanceY = Math.abs(distanceY) + node.getHeight() / 2;
+ actionCreator.toString = function () {
+ return typeString;
+ };
- if (node.getOwner() == this.graphManager.getRoot()) // in the root graph
- {
- estimatedSize = ownerGraph.getEstimatedSize() * this.gravityRangeFactor;
+ return actionCreator;
+}
- if (absDistanceX > estimatedSize || absDistanceY > estimatedSize) {
- node.gravitationForceX = -this.gravityConstant * distanceX;
- node.gravitationForceY = -this.gravityConstant * distanceY;
- }
- } else // inside a compound
- {
- estimatedSize = ownerGraph.getEstimatedSize() * this.compoundGravityRangeFactor;
+/***/ }),
- if (absDistanceX > estimatedSize || absDistanceY > estimatedSize) {
- node.gravitationForceX = -this.gravityConstant * distanceX * this.compoundGravityConstant;
- node.gravitationForceY = -this.gravityConstant * distanceY * this.compoundGravityConstant;
- }
- }
-};
+/***/ "./node_modules/redux-actions/es/utils/identity.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/redux-actions/es/utils/identity.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-FDLayout.prototype.isConverged = function () {
- var converged;
- var oscilating = false;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony default export */ __webpack_exports__["default"] = (function (value) {
+ return value;
+});
- if (this.totalIterations > this.maxIterations / 3) {
- oscilating = Math.abs(this.totalDisplacement - this.oldTotalDisplacement) < 2;
- }
+/***/ }),
- converged = this.totalDisplacement < this.totalDisplacementThreshold;
+/***/ "./node_modules/redux-actions/es/utils/isFunction.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/redux-actions/es/utils/isFunction.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- this.oldTotalDisplacement = this.totalDisplacement;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony default export */ __webpack_exports__["default"] = (function (value) {
+ return typeof value === 'function';
+});
- return converged || oscilating;
-};
+/***/ }),
-FDLayout.prototype.animate = function () {
- if (this.animationDuringLayout && !this.isSubLayout) {
- if (this.notAnimatedIterations == this.animationPeriod) {
- this.update();
- this.notAnimatedIterations = 0;
- } else {
- this.notAnimatedIterations++;
- }
- }
-};
+/***/ "./node_modules/redux-actions/es/utils/isNull.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/redux-actions/es/utils/isNull.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-//This method calculates the number of children (weight) for all nodes
-FDLayout.prototype.calcNoOfChildrenForAllNodes = function () {
- var node;
- var allNodes = this.graphManager.getAllNodes();
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony default export */ __webpack_exports__["default"] = (function (value) {
+ return value === null;
+});
- for (var i = 0; i < allNodes.length; i++) {
- node = allNodes[i];
- node.noOfChildren = node.getNoOfChildren();
- }
-};
+/***/ }),
-// -----------------------------------------------------------------------------
-// Section: FR-Grid Variant Repulsion Force Calculation
-// -----------------------------------------------------------------------------
+/***/ "./node_modules/redux-thunk/es/index.js":
+/*!**********************************************!*\
+ !*** ./node_modules/redux-thunk/es/index.js ***!
+ \**********************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-FDLayout.prototype.calcGrid = function (graph) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/** A function that accepts a potential "extra argument" value to be injected later,
+ * and returns an instance of the thunk middleware that uses that value
+ */
+function createThunkMiddleware(extraArgument) {
+ // Standard Redux middleware definition pattern:
+ // See: https://redux.js.org/tutorials/fundamentals/part-4-store#writing-custom-middleware
+ var middleware = function middleware(_ref) {
+ var dispatch = _ref.dispatch,
+ getState = _ref.getState;
+ return function (next) {
+ return function (action) {
+ // The thunk middleware looks for any functions that were passed to `store.dispatch`.
+ // If this "action" is really a function, call it and return the result.
+ if (typeof action === 'function') {
+ // Inject the store's `dispatch` and `getState` methods, as well as any "extra arg"
+ return action(dispatch, getState, extraArgument);
+ } // Otherwise, pass the action down the middleware chain as usual
- var sizeX = 0;
- var sizeY = 0;
- sizeX = parseInt(Math.ceil((graph.getRight() - graph.getLeft()) / this.repulsionRange));
- sizeY = parseInt(Math.ceil((graph.getBottom() - graph.getTop()) / this.repulsionRange));
+ return next(action);
+ };
+ };
+ };
- var grid = new Array(sizeX);
+ return middleware;
+}
- for (var i = 0; i < sizeX; i++) {
- grid[i] = new Array(sizeY);
- }
+var thunk = createThunkMiddleware(); // Attach the factory function so users can create a customized version
+// with whatever "extra arg" they want to inject into their thunks
- for (var i = 0; i < sizeX; i++) {
- for (var j = 0; j < sizeY; j++) {
- grid[i][j] = new Array();
- }
- }
+thunk.withExtraArgument = createThunkMiddleware;
+/* harmony default export */ __webpack_exports__["default"] = (thunk);
- return grid;
-};
+/***/ }),
-FDLayout.prototype.addNodeToGrid = function (v, left, top) {
+/***/ "./node_modules/redux/es/redux.js":
+/*!****************************************!*\
+ !*** ./node_modules/redux/es/redux.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- var startX = 0;
- var finishX = 0;
- var startY = 0;
- var finishY = 0;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ __DO_NOT_USE__ActionTypes: function() { return /* binding */ ActionTypes; },
+/* harmony export */ applyMiddleware: function() { return /* binding */ applyMiddleware; },
+/* harmony export */ bindActionCreators: function() { return /* binding */ bindActionCreators; },
+/* harmony export */ combineReducers: function() { return /* binding */ combineReducers; },
+/* harmony export */ compose: function() { return /* binding */ compose; },
+/* harmony export */ createStore: function() { return /* binding */ createStore; },
+/* harmony export */ legacy_createStore: function() { return /* binding */ legacy_createStore; }
+/* harmony export */ });
+/* harmony import */ var _babel_runtime_helpers_esm_objectSpread2__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/objectSpread2 */ "./node_modules/@babel/runtime/helpers/esm/objectSpread2.js");
- startX = parseInt(Math.floor((v.getRect().x - left) / this.repulsionRange));
- finishX = parseInt(Math.floor((v.getRect().width + v.getRect().x - left) / this.repulsionRange));
- startY = parseInt(Math.floor((v.getRect().y - top) / this.repulsionRange));
- finishY = parseInt(Math.floor((v.getRect().height + v.getRect().y - top) / this.repulsionRange));
- for (var i = startX; i <= finishX; i++) {
- for (var j = startY; j <= finishY; j++) {
- this.grid[i][j].push(v);
- v.setGridCoordinates(startX, finishX, startY, finishY);
- }
- }
-};
+/**
+ * Adapted from React: https://github.com/facebook/react/blob/master/packages/shared/formatProdErrorMessage.js
+ *
+ * Do not require this module directly! Use normal throw error calls. These messages will be replaced with error codes
+ * during build.
+ * @param {number} code
+ */
+function formatProdErrorMessage(code) {
+ return "Minified Redux error #" + code + "; visit https://redux.js.org/Errors?code=" + code + " for the full message or " + 'use the non-minified dev environment for full errors. ';
+}
-FDLayout.prototype.updateGrid = function () {
- var i;
- var nodeA;
- var lNodes = this.getAllNodes();
+// Inlined version of the `symbol-observable` polyfill
+var $$observable = (function () {
+ return typeof Symbol === 'function' && Symbol.observable || '@@observable';
+})();
- this.grid = this.calcGrid(this.graphManager.getRoot());
+/**
+ * These are private action types reserved by Redux.
+ * For any unknown actions, you must return the current state.
+ * If the current state is undefined, you must return the initial state.
+ * Do not reference these action types directly in your code.
+ */
+var randomString = function randomString() {
+ return Math.random().toString(36).substring(7).split('').join('.');
+};
- // put all nodes to proper grid cells
- for (i = 0; i < lNodes.length; i++) {
- nodeA = lNodes[i];
- this.addNodeToGrid(nodeA, this.graphManager.getRoot().getLeft(), this.graphManager.getRoot().getTop());
+var ActionTypes = {
+ INIT: "@@redux/INIT" + randomString(),
+ REPLACE: "@@redux/REPLACE" + randomString(),
+ PROBE_UNKNOWN_ACTION: function PROBE_UNKNOWN_ACTION() {
+ return "@@redux/PROBE_UNKNOWN_ACTION" + randomString();
}
};
-FDLayout.prototype.calculateRepulsionForceOfANode = function (nodeA, processedNodeSet, gridUpdateAllowed, forceToNodeSurroundingUpdate) {
-
- if (this.totalIterations % FDLayoutConstants.GRID_CALCULATION_CHECK_PERIOD == 1 && gridUpdateAllowed || forceToNodeSurroundingUpdate) {
- var surrounding = new Set();
- nodeA.surrounding = new Array();
- var nodeB;
- var grid = this.grid;
+/**
+ * @param {any} obj The object to inspect.
+ * @returns {boolean} True if the argument appears to be a plain object.
+ */
+function isPlainObject(obj) {
+ if (typeof obj !== 'object' || obj === null) return false;
+ var proto = obj;
- for (var i = nodeA.startX - 1; i < nodeA.finishX + 2; i++) {
- for (var j = nodeA.startY - 1; j < nodeA.finishY + 2; j++) {
- if (!(i < 0 || j < 0 || i >= grid.length || j >= grid[0].length)) {
- for (var k = 0; k < grid[i][j].length; k++) {
- nodeB = grid[i][j][k];
+ while (Object.getPrototypeOf(proto) !== null) {
+ proto = Object.getPrototypeOf(proto);
+ }
- // If both nodes are not members of the same graph,
- // or both nodes are the same, skip.
- if (nodeA.getOwner() != nodeB.getOwner() || nodeA == nodeB) {
- continue;
- }
+ return Object.getPrototypeOf(obj) === proto;
+}
- // check if the repulsion force between
- // nodeA and nodeB has already been calculated
- if (!processedNodeSet.has(nodeB) && !surrounding.has(nodeB)) {
- var distanceX = Math.abs(nodeA.getCenterX() - nodeB.getCenterX()) - (nodeA.getWidth() / 2 + nodeB.getWidth() / 2);
- var distanceY = Math.abs(nodeA.getCenterY() - nodeB.getCenterY()) - (nodeA.getHeight() / 2 + nodeB.getHeight() / 2);
+// Inlined / shortened version of `kindOf` from https://github.com/jonschlinkert/kind-of
+function miniKindOf(val) {
+ if (val === void 0) return 'undefined';
+ if (val === null) return 'null';
+ var type = typeof val;
- // if the distance between nodeA and nodeB
- // is less then calculation range
- if (distanceX <= this.repulsionRange && distanceY <= this.repulsionRange) {
- //then add nodeB to surrounding of nodeA
- surrounding.add(nodeB);
- }
- }
- }
- }
+ switch (type) {
+ case 'boolean':
+ case 'string':
+ case 'number':
+ case 'symbol':
+ case 'function':
+ {
+ return type;
}
- }
-
- nodeA.surrounding = [].concat(_toConsumableArray(surrounding));
- }
- for (i = 0; i < nodeA.surrounding.length; i++) {
- this.calcRepulsionForce(nodeA, nodeA.surrounding[i]);
}
-};
-
-FDLayout.prototype.calcRepulsionRange = function () {
- return 0.0;
-};
-module.exports = FDLayout;
+ if (Array.isArray(val)) return 'array';
+ if (isDate(val)) return 'date';
+ if (isError(val)) return 'error';
+ var constructorName = ctorName(val);
-/***/ }),
-/* 19 */
-/***/ (function(module, exports, __nested_webpack_require_103214__) {
+ switch (constructorName) {
+ case 'Symbol':
+ case 'Promise':
+ case 'WeakMap':
+ case 'WeakSet':
+ case 'Map':
+ case 'Set':
+ return constructorName;
+ } // other
-"use strict";
+ return type.slice(8, -1).toLowerCase().replace(/\s/g, '');
+}
-var LEdge = __nested_webpack_require_103214__(1);
-var FDLayoutConstants = __nested_webpack_require_103214__(4);
+function ctorName(val) {
+ return typeof val.constructor === 'function' ? val.constructor.name : null;
+}
-function FDLayoutEdge(source, target, vEdge) {
- LEdge.call(this, source, target, vEdge);
+function isError(val) {
+ return val instanceof Error || typeof val.message === 'string' && val.constructor && typeof val.constructor.stackTraceLimit === 'number';
+}
- // Ideal length and elasticity value for this edge
- this.idealLength = FDLayoutConstants.DEFAULT_EDGE_LENGTH;
- this.edgeElasticity = FDLayoutConstants.DEFAULT_SPRING_STRENGTH;
+function isDate(val) {
+ if (val instanceof Date) return true;
+ return typeof val.toDateString === 'function' && typeof val.getDate === 'function' && typeof val.setDate === 'function';
}
-FDLayoutEdge.prototype = Object.create(LEdge.prototype);
+function kindOf(val) {
+ var typeOfVal = typeof val;
-for (var prop in LEdge) {
- FDLayoutEdge[prop] = LEdge[prop];
+ if (true) {
+ typeOfVal = miniKindOf(val);
+ }
+
+ return typeOfVal;
}
-module.exports = FDLayoutEdge;
+/**
+ * @deprecated
+ *
+ * **We recommend using the `configureStore` method
+ * of the `@reduxjs/toolkit` package**, which replaces `createStore`.
+ *
+ * Redux Toolkit is our recommended approach for writing Redux logic today,
+ * including store setup, reducers, data fetching, and more.
+ *
+ * **For more details, please read this Redux docs page:**
+ * **https://redux.js.org/introduction/why-rtk-is-redux-today**
+ *
+ * `configureStore` from Redux Toolkit is an improved version of `createStore` that
+ * simplifies setup and helps avoid common bugs.
+ *
+ * You should not be using the `redux` core package by itself today, except for learning purposes.
+ * The `createStore` method from the core `redux` package will not be removed, but we encourage
+ * all users to migrate to using Redux Toolkit for all Redux code.
+ *
+ * If you want to use `createStore` without this visual deprecation warning, use
+ * the `legacy_createStore` import instead:
+ *
+ * `import { legacy_createStore as createStore} from 'redux'`
+ *
+ */
-/***/ }),
-/* 20 */
-/***/ (function(module, exports, __nested_webpack_require_103820__) {
+function createStore(reducer, preloadedState, enhancer) {
+ var _ref2;
-"use strict";
+ if (typeof preloadedState === 'function' && typeof enhancer === 'function' || typeof enhancer === 'function' && typeof arguments[3] === 'function') {
+ throw new Error( false ? 0 : 'It looks like you are passing several store enhancers to ' + 'createStore(). This is not supported. Instead, compose them ' + 'together to a single function. See https://redux.js.org/tutorials/fundamentals/part-4-store#creating-a-store-with-enhancers for an example.');
+ }
+ if (typeof preloadedState === 'function' && typeof enhancer === 'undefined') {
+ enhancer = preloadedState;
+ preloadedState = undefined;
+ }
-var LNode = __nested_webpack_require_103820__(3);
-var FDLayoutConstants = __nested_webpack_require_103820__(4);
+ if (typeof enhancer !== 'undefined') {
+ if (typeof enhancer !== 'function') {
+ throw new Error( false ? 0 : "Expected the enhancer to be a function. Instead, received: '" + kindOf(enhancer) + "'");
+ }
-function FDLayoutNode(gm, loc, size, vNode) {
- // alternative constructor is handled inside LNode
- LNode.call(this, gm, loc, size, vNode);
+ return enhancer(createStore)(reducer, preloadedState);
+ }
- // Repulsion value of this node
- this.nodeRepulsion = FDLayoutConstants.DEFAULT_REPULSION_STRENGTH;
+ if (typeof reducer !== 'function') {
+ throw new Error( false ? 0 : "Expected the root reducer to be a function. Instead, received: '" + kindOf(reducer) + "'");
+ }
- //Spring, repulsion and gravitational forces acting on this node
- this.springForceX = 0;
- this.springForceY = 0;
- this.repulsionForceX = 0;
- this.repulsionForceY = 0;
- this.gravitationForceX = 0;
- this.gravitationForceY = 0;
- //Amount by which this node is to be moved in this iteration
- this.displacementX = 0;
- this.displacementY = 0;
+ var currentReducer = reducer;
+ var currentState = preloadedState;
+ var currentListeners = [];
+ var nextListeners = currentListeners;
+ var isDispatching = false;
+ /**
+ * This makes a shallow copy of currentListeners so we can use
+ * nextListeners as a temporary list while dispatching.
+ *
+ * This prevents any bugs around consumers calling
+ * subscribe/unsubscribe in the middle of a dispatch.
+ */
- //Start and finish grid coordinates that this node is fallen into
- this.startX = 0;
- this.finishX = 0;
- this.startY = 0;
- this.finishY = 0;
+ function ensureCanMutateNextListeners() {
+ if (nextListeners === currentListeners) {
+ nextListeners = currentListeners.slice();
+ }
+ }
+ /**
+ * Reads the state tree managed by the store.
+ *
+ * @returns {any} The current state tree of your application.
+ */
- //Geometric neighbors of this node
- this.surrounding = [];
-}
-FDLayoutNode.prototype = Object.create(LNode.prototype);
+ function getState() {
+ if (isDispatching) {
+ throw new Error( false ? 0 : 'You may not call store.getState() while the reducer is executing. ' + 'The reducer has already received the state as an argument. ' + 'Pass it down from the top reducer instead of reading it from the store.');
+ }
-for (var prop in LNode) {
- FDLayoutNode[prop] = LNode[prop];
-}
+ return currentState;
+ }
+ /**
+ * Adds a change listener. It will be called any time an action is dispatched,
+ * and some part of the state tree may potentially have changed. You may then
+ * call `getState()` to read the current state tree inside the callback.
+ *
+ * You may call `dispatch()` from a change listener, with the following
+ * caveats:
+ *
+ * 1. The subscriptions are snapshotted just before every `dispatch()` call.
+ * If you subscribe or unsubscribe while the listeners are being invoked, this
+ * will not have any effect on the `dispatch()` that is currently in progress.
+ * However, the next `dispatch()` call, whether nested or not, will use a more
+ * recent snapshot of the subscription list.
+ *
+ * 2. The listener should not expect to see all state changes, as the state
+ * might have been updated multiple times during a nested `dispatch()` before
+ * the listener is called. It is, however, guaranteed that all subscribers
+ * registered before the `dispatch()` started will be called with the latest
+ * state by the time it exits.
+ *
+ * @param {Function} listener A callback to be invoked on every dispatch.
+ * @returns {Function} A function to remove this change listener.
+ */
-FDLayoutNode.prototype.setGridCoordinates = function (_startX, _finishX, _startY, _finishY) {
- this.startX = _startX;
- this.finishX = _finishX;
- this.startY = _startY;
- this.finishY = _finishY;
-};
-module.exports = FDLayoutNode;
+ function subscribe(listener) {
+ if (typeof listener !== 'function') {
+ throw new Error( false ? 0 : "Expected the listener to be a function. Instead, received: '" + kindOf(listener) + "'");
+ }
-/***/ }),
-/* 21 */
-/***/ (function(module, exports, __webpack_require__) {
+ if (isDispatching) {
+ throw new Error( false ? 0 : 'You may not call store.subscribe() while the reducer is executing. ' + 'If you would like to be notified after the store has been updated, subscribe from a ' + 'component and invoke store.getState() in the callback to access the latest state. ' + 'See https://redux.js.org/api/store#subscribelistener for more details.');
+ }
-"use strict";
+ var isSubscribed = true;
+ ensureCanMutateNextListeners();
+ nextListeners.push(listener);
+ return function unsubscribe() {
+ if (!isSubscribed) {
+ return;
+ }
+ if (isDispatching) {
+ throw new Error( false ? 0 : 'You may not unsubscribe from a store listener while the reducer is executing. ' + 'See https://redux.js.org/api/store#subscribelistener for more details.');
+ }
-function DimensionD(width, height) {
- this.width = 0;
- this.height = 0;
- if (width !== null && height !== null) {
- this.height = height;
- this.width = width;
+ isSubscribed = false;
+ ensureCanMutateNextListeners();
+ var index = nextListeners.indexOf(listener);
+ nextListeners.splice(index, 1);
+ currentListeners = null;
+ };
}
-}
-
-DimensionD.prototype.getWidth = function () {
- return this.width;
-};
+ /**
+ * Dispatches an action. It is the only way to trigger a state change.
+ *
+ * The `reducer` function, used to create the store, will be called with the
+ * current state tree and the given `action`. Its return value will
+ * be considered the **next** state of the tree, and the change listeners
+ * will be notified.
+ *
+ * The base implementation only supports plain object actions. If you want to
+ * dispatch a Promise, an Observable, a thunk, or something else, you need to
+ * wrap your store creating function into the corresponding middleware. For
+ * example, see the documentation for the `redux-thunk` package. Even the
+ * middleware will eventually dispatch plain object actions using this method.
+ *
+ * @param {Object} action A plain object representing “what changed”. It is
+ * a good idea to keep actions serializable so you can record and replay user
+ * sessions, or use the time travelling `redux-devtools`. An action must have
+ * a `type` property which may not be `undefined`. It is a good idea to use
+ * string constants for action types.
+ *
+ * @returns {Object} For convenience, the same action object you dispatched.
+ *
+ * Note that, if you use a custom middleware, it may wrap `dispatch()` to
+ * return something else (for example, a Promise you can await).
+ */
-DimensionD.prototype.setWidth = function (width) {
- this.width = width;
-};
-DimensionD.prototype.getHeight = function () {
- return this.height;
-};
+ function dispatch(action) {
+ if (!isPlainObject(action)) {
+ throw new Error( false ? 0 : "Actions must be plain objects. Instead, the actual type was: '" + kindOf(action) + "'. You may need to add middleware to your store setup to handle dispatching other values, such as 'redux-thunk' to handle dispatching functions. See https://redux.js.org/tutorials/fundamentals/part-4-store#middleware and https://redux.js.org/tutorials/fundamentals/part-6-async-logic#using-the-redux-thunk-middleware for examples.");
+ }
-DimensionD.prototype.setHeight = function (height) {
- this.height = height;
-};
+ if (typeof action.type === 'undefined') {
+ throw new Error( false ? 0 : 'Actions may not have an undefined "type" property. You may have misspelled an action type string constant.');
+ }
-module.exports = DimensionD;
+ if (isDispatching) {
+ throw new Error( false ? 0 : 'Reducers may not dispatch actions.');
+ }
-/***/ }),
-/* 22 */
-/***/ (function(module, exports, __nested_webpack_require_105759__) {
+ try {
+ isDispatching = true;
+ currentState = currentReducer(currentState, action);
+ } finally {
+ isDispatching = false;
+ }
-"use strict";
+ var listeners = currentListeners = nextListeners;
+ for (var i = 0; i < listeners.length; i++) {
+ var listener = listeners[i];
+ listener();
+ }
-var UniqueIDGeneretor = __nested_webpack_require_105759__(14);
+ return action;
+ }
+ /**
+ * Replaces the reducer currently used by the store to calculate the state.
+ *
+ * You might need this if your app implements code splitting and you want to
+ * load some of the reducers dynamically. You might also need this if you
+ * implement a hot reloading mechanism for Redux.
+ *
+ * @param {Function} nextReducer The reducer for the store to use instead.
+ * @returns {void}
+ */
-function HashMap() {
- this.map = {};
- this.keys = [];
-}
-HashMap.prototype.put = function (key, value) {
- var theId = UniqueIDGeneretor.createID(key);
- if (!this.contains(theId)) {
- this.map[theId] = value;
- this.keys.push(key);
- }
-};
+ function replaceReducer(nextReducer) {
+ if (typeof nextReducer !== 'function') {
+ throw new Error( false ? 0 : "Expected the nextReducer to be a function. Instead, received: '" + kindOf(nextReducer));
+ }
-HashMap.prototype.contains = function (key) {
- var theId = UniqueIDGeneretor.createID(key);
- return this.map[key] != null;
-};
+ currentReducer = nextReducer; // This action has a similiar effect to ActionTypes.INIT.
+ // Any reducers that existed in both the new and old rootReducer
+ // will receive the previous state. This effectively populates
+ // the new state tree with any relevant data from the old one.
-HashMap.prototype.get = function (key) {
- var theId = UniqueIDGeneretor.createID(key);
- return this.map[theId];
-};
+ dispatch({
+ type: ActionTypes.REPLACE
+ });
+ }
+ /**
+ * Interoperability point for observable/reactive libraries.
+ * @returns {observable} A minimal observable of state changes.
+ * For more information, see the observable proposal:
+ * https://github.com/tc39/proposal-observable
+ */
-HashMap.prototype.keySet = function () {
- return this.keys;
-};
-module.exports = HashMap;
+ function observable() {
+ var _ref;
-/***/ }),
-/* 23 */
-/***/ (function(module, exports, __nested_webpack_require_106487__) {
+ var outerSubscribe = subscribe;
+ return _ref = {
+ /**
+ * The minimal observable subscription method.
+ * @param {Object} observer Any object that can be used as an observer.
+ * The observer object should have a `next` method.
+ * @returns {subscription} An object with an `unsubscribe` method that can
+ * be used to unsubscribe the observable from the store, and prevent further
+ * emission of values from the observable.
+ */
+ subscribe: function subscribe(observer) {
+ if (typeof observer !== 'object' || observer === null) {
+ throw new Error( false ? 0 : "Expected the observer to be an object. Instead, received: '" + kindOf(observer) + "'");
+ }
-"use strict";
+ function observeState() {
+ if (observer.next) {
+ observer.next(getState());
+ }
+ }
+ observeState();
+ var unsubscribe = outerSubscribe(observeState);
+ return {
+ unsubscribe: unsubscribe
+ };
+ }
+ }, _ref[$$observable] = function () {
+ return this;
+ }, _ref;
+ } // When a store is created, an "INIT" action is dispatched so that every
+ // reducer returns their initial state. This effectively populates
+ // the initial state tree.
-var UniqueIDGeneretor = __nested_webpack_require_106487__(14);
-function HashSet() {
- this.set = {};
+ dispatch({
+ type: ActionTypes.INIT
+ });
+ return _ref2 = {
+ dispatch: dispatch,
+ subscribe: subscribe,
+ getState: getState,
+ replaceReducer: replaceReducer
+ }, _ref2[$$observable] = observable, _ref2;
}
-;
+/**
+ * Creates a Redux store that holds the state tree.
+ *
+ * **We recommend using `configureStore` from the
+ * `@reduxjs/toolkit` package**, which replaces `createStore`:
+ * **https://redux.js.org/introduction/why-rtk-is-redux-today**
+ *
+ * The only way to change the data in the store is to call `dispatch()` on it.
+ *
+ * There should only be a single store in your app. To specify how different
+ * parts of the state tree respond to actions, you may combine several reducers
+ * into a single reducer function by using `combineReducers`.
+ *
+ * @param {Function} reducer A function that returns the next state tree, given
+ * the current state tree and the action to handle.
+ *
+ * @param {any} [preloadedState] The initial state. You may optionally specify it
+ * to hydrate the state from the server in universal apps, or to restore a
+ * previously serialized user session.
+ * If you use `combineReducers` to produce the root reducer function, this must be
+ * an object with the same shape as `combineReducers` keys.
+ *
+ * @param {Function} [enhancer] The store enhancer. You may optionally specify it
+ * to enhance the store with third-party capabilities such as middleware,
+ * time travel, persistence, etc. The only store enhancer that ships with Redux
+ * is `applyMiddleware()`.
+ *
+ * @returns {Store} A Redux store that lets you read the state, dispatch actions
+ * and subscribe to changes.
+ */
-HashSet.prototype.add = function (obj) {
- var theId = UniqueIDGeneretor.createID(obj);
- if (!this.contains(theId)) this.set[theId] = obj;
-};
+var legacy_createStore = createStore;
-HashSet.prototype.remove = function (obj) {
- delete this.set[UniqueIDGeneretor.createID(obj)];
-};
+/**
+ * Prints a warning in the console if it exists.
+ *
+ * @param {String} message The warning message.
+ * @returns {void}
+ */
+function warning(message) {
+ /* eslint-disable no-console */
+ if (typeof console !== 'undefined' && typeof console.error === 'function') {
+ console.error(message);
+ }
+ /* eslint-enable no-console */
-HashSet.prototype.clear = function () {
- this.set = {};
-};
-HashSet.prototype.contains = function (obj) {
- return this.set[UniqueIDGeneretor.createID(obj)] == obj;
-};
+ try {
+ // This error was thrown as a convenience so that if you enable
+ // "break on all exceptions" in your console,
+ // it would pause the execution at this line.
+ throw new Error(message);
+ } catch (e) {} // eslint-disable-line no-empty
-HashSet.prototype.isEmpty = function () {
- return this.size() === 0;
-};
+}
-HashSet.prototype.size = function () {
- return Object.keys(this.set).length;
-};
+function getUnexpectedStateShapeWarningMessage(inputState, reducers, action, unexpectedKeyCache) {
+ var reducerKeys = Object.keys(reducers);
+ var argumentName = action && action.type === ActionTypes.INIT ? 'preloadedState argument passed to createStore' : 'previous state received by the reducer';
-//concats this.set to the given list
-HashSet.prototype.addAllTo = function (list) {
- var keys = Object.keys(this.set);
- var length = keys.length;
- for (var i = 0; i < length; i++) {
- list.push(this.set[keys[i]]);
+ if (reducerKeys.length === 0) {
+ return 'Store does not have a valid reducer. Make sure the argument passed ' + 'to combineReducers is an object whose values are reducers.';
}
-};
-
-HashSet.prototype.size = function () {
- return Object.keys(this.set).length;
-};
-HashSet.prototype.addAll = function (list) {
- var s = list.length;
- for (var i = 0; i < s; i++) {
- var v = list[i];
- this.add(v);
+ if (!isPlainObject(inputState)) {
+ return "The " + argumentName + " has unexpected type of \"" + kindOf(inputState) + "\". Expected argument to be an object with the following " + ("keys: \"" + reducerKeys.join('", "') + "\"");
}
-};
-
-module.exports = HashSet;
-/***/ }),
-/* 24 */
-/***/ (function(module, exports, __webpack_require__) {
+ var unexpectedKeys = Object.keys(inputState).filter(function (key) {
+ return !reducers.hasOwnProperty(key) && !unexpectedKeyCache[key];
+ });
+ unexpectedKeys.forEach(function (key) {
+ unexpectedKeyCache[key] = true;
+ });
+ if (action && action.type === ActionTypes.REPLACE) return;
-"use strict";
+ if (unexpectedKeys.length > 0) {
+ return "Unexpected " + (unexpectedKeys.length > 1 ? 'keys' : 'key') + " " + ("\"" + unexpectedKeys.join('", "') + "\" found in " + argumentName + ". ") + "Expected to find one of the known reducer keys instead: " + ("\"" + reducerKeys.join('", "') + "\". Unexpected keys will be ignored.");
+ }
+}
+function assertReducerShape(reducers) {
+ Object.keys(reducers).forEach(function (key) {
+ var reducer = reducers[key];
+ var initialState = reducer(undefined, {
+ type: ActionTypes.INIT
+ });
-// Some matrix (1d and 2d array) operations
-function Matrix() {}
+ if (typeof initialState === 'undefined') {
+ throw new Error( false ? 0 : "The slice reducer for key \"" + key + "\" returned undefined during initialization. " + "If the state passed to the reducer is undefined, you must " + "explicitly return the initial state. The initial state may " + "not be undefined. If you don't want to set a value for this reducer, " + "you can use null instead of undefined.");
+ }
+ if (typeof reducer(undefined, {
+ type: ActionTypes.PROBE_UNKNOWN_ACTION()
+ }) === 'undefined') {
+ throw new Error( false ? 0 : "The slice reducer for key \"" + key + "\" returned undefined when probed with a random type. " + ("Don't try to handle '" + ActionTypes.INIT + "' or other actions in \"redux/*\" ") + "namespace. They are considered private. Instead, you must return the " + "current state for any unknown actions, unless it is undefined, " + "in which case you must return the initial state, regardless of the " + "action type. The initial state may not be undefined, but can be null.");
+ }
+ });
+}
/**
- * matrix multiplication
- * array1, array2 and result are 2d arrays
+ * Turns an object whose values are different reducer functions, into a single
+ * reducer function. It will call every child reducer, and gather their results
+ * into a single state object, whose keys correspond to the keys of the passed
+ * reducer functions.
+ *
+ * @param {Object} reducers An object whose values correspond to different
+ * reducer functions that need to be combined into one. One handy way to obtain
+ * it is to use ES6 `import * as reducers` syntax. The reducers may never return
+ * undefined for any action. Instead, they should return their initial state
+ * if the state passed to them was undefined, and the current state for any
+ * unrecognized action.
+ *
+ * @returns {Function} A reducer function that invokes every reducer inside the
+ * passed object, and builds a state object with the same shape.
*/
-Matrix.multMat = function (array1, array2) {
- var result = [];
- for (var i = 0; i < array1.length; i++) {
- result[i] = [];
- for (var j = 0; j < array2[0].length; j++) {
- result[i][j] = 0;
- for (var k = 0; k < array1[0].length; k++) {
- result[i][j] += array1[i][k] * array2[k][j];
+
+function combineReducers(reducers) {
+ var reducerKeys = Object.keys(reducers);
+ var finalReducers = {};
+
+ for (var i = 0; i < reducerKeys.length; i++) {
+ var key = reducerKeys[i];
+
+ if (true) {
+ if (typeof reducers[key] === 'undefined') {
+ warning("No reducer provided for key \"" + key + "\"");
}
}
+
+ if (typeof reducers[key] === 'function') {
+ finalReducers[key] = reducers[key];
+ }
}
- return result;
-};
-/**
- * matrix transpose
- * array and result are 2d arrays
- */
-Matrix.transpose = function (array) {
- var result = [];
+ var finalReducerKeys = Object.keys(finalReducers); // This is used to make sure we don't warn about the same
+ // keys multiple times.
- for (var i = 0; i < array[0].length; i++) {
- result[i] = [];
- for (var j = 0; j < array.length; j++) {
- result[i][j] = array[j][i];
+ var unexpectedKeyCache;
+
+ if (true) {
+ unexpectedKeyCache = {};
+ }
+
+ var shapeAssertionError;
+
+ try {
+ assertReducerShape(finalReducers);
+ } catch (e) {
+ shapeAssertionError = e;
+ }
+
+ return function combination(state, action) {
+ if (state === void 0) {
+ state = {};
+ }
+
+ if (shapeAssertionError) {
+ throw shapeAssertionError;
}
- }
- return result;
-};
+ if (true) {
+ var warningMessage = getUnexpectedStateShapeWarningMessage(state, finalReducers, action, unexpectedKeyCache);
-/**
- * multiply array with constant
- * array and result are 1d arrays
- */
-Matrix.multCons = function (array, constant) {
- var result = [];
+ if (warningMessage) {
+ warning(warningMessage);
+ }
+ }
- for (var i = 0; i < array.length; i++) {
- result[i] = array[i] * constant;
- }
+ var hasChanged = false;
+ var nextState = {};
- return result;
-};
+ for (var _i = 0; _i < finalReducerKeys.length; _i++) {
+ var _key = finalReducerKeys[_i];
+ var reducer = finalReducers[_key];
+ var previousStateForKey = state[_key];
+ var nextStateForKey = reducer(previousStateForKey, action);
-/**
- * substract two arrays
- * array1, array2 and result are 1d arrays
- */
-Matrix.minusOp = function (array1, array2) {
- var result = [];
+ if (typeof nextStateForKey === 'undefined') {
+ var actionType = action && action.type;
+ throw new Error( false ? 0 : "When called with an action of type " + (actionType ? "\"" + String(actionType) + "\"" : '(unknown type)') + ", the slice reducer for key \"" + _key + "\" returned undefined. " + "To ignore an action, you must explicitly return the previous state. " + "If you want this reducer to hold no value, you can return null instead of undefined.");
+ }
- for (var i = 0; i < array1.length; i++) {
- result[i] = array1[i] - array2[i];
- }
+ nextState[_key] = nextStateForKey;
+ hasChanged = hasChanged || nextStateForKey !== previousStateForKey;
+ }
- return result;
-};
+ hasChanged = hasChanged || finalReducerKeys.length !== Object.keys(state).length;
+ return hasChanged ? nextState : state;
+ };
+}
+function bindActionCreator(actionCreator, dispatch) {
+ return function () {
+ return dispatch(actionCreator.apply(this, arguments));
+ };
+}
/**
- * dot product of two arrays with same size
- * array1 and array2 are 1d arrays
+ * Turns an object whose values are action creators, into an object with the
+ * same keys, but with every function wrapped into a `dispatch` call so they
+ * may be invoked directly. This is just a convenience method, as you can call
+ * `store.dispatch(MyActionCreators.doSomething())` yourself just fine.
+ *
+ * For convenience, you can also pass an action creator as the first argument,
+ * and get a dispatch wrapped function in return.
+ *
+ * @param {Function|Object} actionCreators An object whose values are action
+ * creator functions. One handy way to obtain it is to use ES6 `import * as`
+ * syntax. You may also pass a single function.
+ *
+ * @param {Function} dispatch The `dispatch` function available on your Redux
+ * store.
+ *
+ * @returns {Function|Object} The object mimicking the original object, but with
+ * every action creator wrapped into the `dispatch` call. If you passed a
+ * function as `actionCreators`, the return value will also be a single
+ * function.
*/
-Matrix.dotProduct = function (array1, array2) {
- var product = 0;
- for (var i = 0; i < array1.length; i++) {
- product += array1[i] * array2[i];
+
+function bindActionCreators(actionCreators, dispatch) {
+ if (typeof actionCreators === 'function') {
+ return bindActionCreator(actionCreators, dispatch);
}
- return product;
-};
+ if (typeof actionCreators !== 'object' || actionCreators === null) {
+ throw new Error( false ? 0 : "bindActionCreators expected an object or a function, but instead received: '" + kindOf(actionCreators) + "'. " + "Did you write \"import ActionCreators from\" instead of \"import * as ActionCreators from\"?");
+ }
-/**
- * magnitude of an array
- * array is 1d array
- */
-Matrix.mag = function (array) {
- return Math.sqrt(this.dotProduct(array, array));
-};
+ var boundActionCreators = {};
-/**
- * normalization of an array
- * array and result are 1d array
- */
-Matrix.normalize = function (array) {
- var result = [];
- var magnitude = this.mag(array);
+ for (var key in actionCreators) {
+ var actionCreator = actionCreators[key];
- for (var i = 0; i < array.length; i++) {
- result[i] = array[i] / magnitude;
+ if (typeof actionCreator === 'function') {
+ boundActionCreators[key] = bindActionCreator(actionCreator, dispatch);
+ }
}
- return result;
-};
+ return boundActionCreators;
+}
/**
- * multiply an array with centering matrix
- * array and result are 1d array
+ * Composes single-argument functions from right to left. The rightmost
+ * function can take multiple arguments as it provides the signature for
+ * the resulting composite function.
+ *
+ * @param {...Function} funcs The functions to compose.
+ * @returns {Function} A function obtained by composing the argument functions
+ * from right to left. For example, compose(f, g, h) is identical to doing
+ * (...args) => f(g(h(...args))).
*/
-Matrix.multGamma = function (array) {
- var result = [];
- var sum = 0;
-
- for (var i = 0; i < array.length; i++) {
- sum += array[i];
+function compose() {
+ for (var _len = arguments.length, funcs = new Array(_len), _key = 0; _key < _len; _key++) {
+ funcs[_key] = arguments[_key];
}
- sum *= -1 / array.length;
+ if (funcs.length === 0) {
+ return function (arg) {
+ return arg;
+ };
+ }
- for (var _i = 0; _i < array.length; _i++) {
- result[_i] = sum + array[_i];
+ if (funcs.length === 1) {
+ return funcs[0];
}
- return result;
-};
+
+ return funcs.reduce(function (a, b) {
+ return function () {
+ return a(b.apply(void 0, arguments));
+ };
+ });
+}
/**
- * a special matrix multiplication
- * result = 0.5 * C * INV * C^T * array
- * array and result are 1d, C and INV are 2d arrays
+ * Creates a store enhancer that applies middleware to the dispatch method
+ * of the Redux store. This is handy for a variety of tasks, such as expressing
+ * asynchronous actions in a concise manner, or logging every action payload.
+ *
+ * See `redux-thunk` package as an example of the Redux middleware.
+ *
+ * Because middleware is potentially asynchronous, this should be the first
+ * store enhancer in the composition chain.
+ *
+ * Note that each middleware will be given the `dispatch` and `getState` functions
+ * as named arguments.
+ *
+ * @param {...Function} middlewares The middleware chain to be applied.
+ * @returns {Function} A store enhancer applying the middleware.
*/
-Matrix.multL = function (array, C, INV) {
- var result = [];
- var temp1 = [];
- var temp2 = [];
- // multiply by C^T
- for (var i = 0; i < C[0].length; i++) {
- var sum = 0;
- for (var j = 0; j < C.length; j++) {
- sum += -0.5 * C[j][i] * array[j];
- }
- temp1[i] = sum;
- }
- // multiply the result by INV
- for (var _i2 = 0; _i2 < INV.length; _i2++) {
- var _sum = 0;
- for (var _j = 0; _j < INV.length; _j++) {
- _sum += INV[_i2][_j] * temp1[_j];
- }
- temp2[_i2] = _sum;
- }
- // multiply the result by C
- for (var _i3 = 0; _i3 < C.length; _i3++) {
- var _sum2 = 0;
- for (var _j2 = 0; _j2 < C[0].length; _j2++) {
- _sum2 += C[_i3][_j2] * temp2[_j2];
- }
- result[_i3] = _sum2;
+function applyMiddleware() {
+ for (var _len = arguments.length, middlewares = new Array(_len), _key = 0; _key < _len; _key++) {
+ middlewares[_key] = arguments[_key];
}
- return result;
-};
-
-module.exports = Matrix;
-
-/***/ }),
-/* 25 */
-/***/ (function(module, exports, __nested_webpack_require_111039__) {
-
-"use strict";
+ return function (createStore) {
+ return function () {
+ var store = createStore.apply(void 0, arguments);
+ var _dispatch = function dispatch() {
+ throw new Error( false ? 0 : 'Dispatching while constructing your middleware is not allowed. ' + 'Other middleware would not be applied to this dispatch.');
+ };
-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 middlewareAPI = {
+ getState: store.getState,
+ dispatch: function dispatch() {
+ return _dispatch.apply(void 0, arguments);
+ }
+ };
+ var chain = middlewares.map(function (middleware) {
+ return middleware(middlewareAPI);
+ });
+ _dispatch = compose.apply(void 0, chain)(store.dispatch);
+ return (0,_babel_runtime_helpers_esm_objectSpread2__WEBPACK_IMPORTED_MODULE_0__["default"])((0,_babel_runtime_helpers_esm_objectSpread2__WEBPACK_IMPORTED_MODULE_0__["default"])({}, store), {}, {
+ dispatch: _dispatch
+ });
+ };
+ };
+}
-function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
-/**
- * A classic Quicksort algorithm with Hoare's partition
- * - Works also on LinkedList objects
- *
- * Copyright: i-Vis Research Group, Bilkent University, 2007 - present
- */
-var LinkedList = __nested_webpack_require_111039__(11);
-var Quicksort = function () {
- function Quicksort(A, compareFunction) {
- _classCallCheck(this, Quicksort);
+/***/ }),
- if (compareFunction !== null || compareFunction !== undefined) this.compareFunction = this._defaultCompareFunction;
+/***/ "./node_modules/simple-swizzle/index.js":
+/*!**********************************************!*\
+ !*** ./node_modules/simple-swizzle/index.js ***!
+ \**********************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- var length = void 0;
- if (A instanceof LinkedList) length = A.size();else length = A.length;
+"use strict";
- this._quicksort(A, 0, length - 1);
- }
- _createClass(Quicksort, [{
- key: '_quicksort',
- value: function _quicksort(A, p, r) {
- if (p < r) {
- var q = this._partition(A, p, r);
- this._quicksort(A, p, q);
- this._quicksort(A, q + 1, r);
- }
- }
- }, {
- key: '_partition',
- value: function _partition(A, p, r) {
- var x = this._get(A, p);
- var i = p;
- var j = r;
- while (true) {
- while (this.compareFunction(x, this._get(A, j))) {
- j--;
- }while (this.compareFunction(this._get(A, i), x)) {
- i++;
- }if (i < j) {
- this._swap(A, i, j);
- i++;
- j--;
- } else return j;
- }
- }
- }, {
- key: '_get',
- value: function _get(object, index) {
- if (object instanceof LinkedList) return object.get_object_at(index);else return object[index];
- }
- }, {
- key: '_set',
- value: function _set(object, index, value) {
- if (object instanceof LinkedList) object.set_object_at(index, value);else object[index] = value;
- }
- }, {
- key: '_swap',
- value: function _swap(A, i, j) {
- var temp = this._get(A, i);
- this._set(A, i, this._get(A, j));
- this._set(A, j, temp);
- }
- }, {
- key: '_defaultCompareFunction',
- value: function _defaultCompareFunction(a, b) {
- return b > a;
- }
- }]);
+var isArrayish = __webpack_require__(/*! is-arrayish */ "./node_modules/simple-swizzle/node_modules/is-arrayish/index.js");
- return Quicksort;
-}();
+var concat = Array.prototype.concat;
+var slice = Array.prototype.slice;
-module.exports = Quicksort;
+var swizzle = module.exports = function swizzle(args) {
+ var results = [];
-/***/ }),
-/* 26 */
-/***/ (function(module, exports, __webpack_require__) {
+ for (var i = 0, len = args.length; i < len; i++) {
+ var arg = args[i];
-"use strict";
+ if (isArrayish(arg)) {
+ // http://jsperf.com/javascript-array-concat-vs-push/98
+ results = concat.call(results, slice.call(arg));
+ } else {
+ results.push(arg);
+ }
+ }
+ return results;
+};
-// Singular Value Decomposition implementation
-function SVD() {};
+swizzle.wrap = function (fn) {
+ return function () {
+ return fn(swizzle(arguments));
+ };
+};
-/* Below singular value decomposition (svd) code including hypot function is adopted from https://github.com/dragonfly-ai/JamaJS
- Some changes are applied to make the code compatible with the fcose code and to make it independent from Jama.
- Input matrix is changed to a 2D array instead of Jama matrix. Matrix dimensions are taken according to 2D array instead of using Jama functions.
- An object that includes singular value components is created for return.
- The types of input parameters of the hypot function are removed.
- let is used instead of var for the variable initialization.
-*/
-/*
- Apache License
- Version 2.0, January 2004
- http://www.apache.org/licenses/
- TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+/***/ }),
- 1. Definitions.
+/***/ "./node_modules/simple-swizzle/node_modules/is-arrayish/index.js":
+/*!***********************************************************************!*\
+ !*** ./node_modules/simple-swizzle/node_modules/is-arrayish/index.js ***!
+ \***********************************************************************/
+/***/ (function(module) {
- "License" shall mean the terms and conditions for use, reproduction,
- and distribution as defined by Sections 1 through 9 of this document.
+module.exports = function isArrayish(obj) {
+ if (!obj || typeof obj === 'string') {
+ return false;
+ }
- "Licensor" shall mean the copyright owner or entity authorized by
- the copyright owner that is granting the License.
+ return obj instanceof Array || Array.isArray(obj) ||
+ (obj.length >= 0 && (obj.splice instanceof Function ||
+ (Object.getOwnPropertyDescriptor(obj, (obj.length - 1)) && obj.constructor.name !== 'String')));
+};
- "Legal Entity" shall mean the union of the acting entity and all
- other entities that control, are controlled by, or are under common
- control with that entity. For the purposes of this definition,
- "control" means (i) the power, direct or indirect, to cause the
- direction or management of such entity, whether by contract or
- otherwise, or (ii) ownership of fifty percent (50%) or more of the
- outstanding shares, or (iii) beneficial ownership of such entity.
- "You" (or "Your") shall mean an individual or Legal Entity
- exercising permissions granted by this License.
+/***/ }),
- "Source" form shall mean the preferred form for making modifications,
- including but not limited to software source code, documentation
- source, and configuration files.
+/***/ "./src/components/core/Toolbar.css":
+/*!*****************************************!*\
+ !*** ./src/components/core/Toolbar.css ***!
+ \*****************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- "Object" form shall mean any form resulting from mechanical
- transformation or translation of a Source form, including but
- not limited to compiled object code, generated documentation,
- and conversions to other media types.
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_Toolbar_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../node_modules/css-loader/dist/cjs.js!./Toolbar.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/core/Toolbar.css");
- "Work" shall mean the work of authorship, whether in Source or
- Object form, made available under the License, as indicated by a
- copyright notice that is included in or attached to the work
- (an example is provided in the Appendix below).
+
+
+
+
+
+
+
+
+
- "Derivative Works" shall mean any work, whether in Source or Object
- form, that is based on (or derived from) the Work and for which the
- editorial revisions, annotations, elaborations, or other modifications
- represent, as a whole, an original work of authorship. For the purposes
- of this License, Derivative Works shall not include works that remain
- separable from, or merely link (or bind by name) to the interfaces of,
- the Work and Derivative Works thereof.
+var options = {};
- "Contribution" shall mean any work of authorship, including
- the original version of the Work and any modifications or additions
- to that Work or Derivative Works thereof, that is intentionally
- submitted to Licensor for inclusion in the Work by the copyright owner
- or by an individual or Legal Entity authorized to submit on behalf of
- the copyright owner. For the purposes of this definition, "submitted"
- means any form of electronic, verbal, or written communication sent
- to the Licensor or its representatives, including but not limited to
- communication on electronic mailing lists, source code control systems,
- and issue tracking systems that are managed by, or on behalf of, the
- Licensor for the purpose of discussing and improving the Work, but
- excluding communication that is conspicuously marked or otherwise
- designated in writing by the copyright owner as "Not a Contribution."
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
- "Contributor" shall mean Licensor and any individual or Legal Entity
- on behalf of whom a Contribution has been received by Licensor and
- subsequently incorporated within the Work.
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
- 2. Grant of Copyright License. Subject to the terms and conditions of
- this License, each Contributor hereby grants to You a perpetual,
- worldwide, non-exclusive, no-charge, royalty-free, irrevocable
- copyright license to reproduce, prepare Derivative Works of,
- publicly display, publicly perform, sublicense, and distribute the
- Work and such Derivative Works in Source or Object form.
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_Toolbar_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
- 3. Grant of Patent License. Subject to the terms and conditions of
- this License, each Contributor hereby grants to You a perpetual,
- worldwide, non-exclusive, no-charge, royalty-free, irrevocable
- (except as stated in this section) patent license to make, have made,
- use, offer to sell, sell, import, and otherwise transfer the Work,
- where such license applies only to those patent claims licensable
- by such Contributor that are necessarily infringed by their
- Contribution(s) alone or by combination of their Contribution(s)
- with the Work to which such Contribution(s) was submitted. If You
- institute patent litigation against any entity (including a
- cross-claim or counterclaim in a lawsuit) alleging that the Work
- or a Contribution incorporated within the Work constitutes direct
- or contributory patent infringement, then any patent licenses
- granted to You under this License for that Work shall terminate
- as of the date such litigation is filed.
- 4. Redistribution. You may reproduce and distribute copies of the
- Work or Derivative Works thereof in any medium, with or without
- modifications, and in Source or Object form, provided that You
- meet the following conditions:
- (a) You must give any other recipients of the Work or
- Derivative Works a copy of this License; and
- (b) You must cause any modified files to carry prominent notices
- stating that You changed the files; and
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_Toolbar_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_Toolbar_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_Toolbar_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
- (c) You must retain, in the Source form of any Derivative Works
- that You distribute, all copyright, patent, trademark, and
- attribution notices from the Source form of the Work,
- excluding those notices that do not pertain to any part of
- the Derivative Works; and
- (d) If the Work includes a "NOTICE" text file as part of its
- distribution, then any Derivative Works that You distribute must
- include a readable copy of the attribution notices contained
- within such NOTICE file, excluding those notices that do not
- pertain to any part of the Derivative Works, in at least one
- of the following places: within a NOTICE text file distributed
- as part of the Derivative Works; within the Source form or
- documentation, if provided along with the Derivative Works; or,
- within a display generated by the Derivative Works, if and
- wherever such third-party notices normally appear. The contents
- of the NOTICE file are for informational purposes only and
- do not modify the License. You may add Your own attribution
- notices within Derivative Works that You distribute, alongside
- or as an addendum to the NOTICE text from the Work, provided
- that such additional attribution notices cannot be construed
- as modifying the License.
+/***/ }),
- You may add Your own copyright statement to Your modifications and
- may provide additional or different license terms and conditions
- for use, reproduction, or distribution of Your modifications, or
- for any such Derivative Works as a whole, provided Your use,
- reproduction, and distribution of the Work otherwise complies with
- the conditions stated in this License.
+/***/ "./src/components/error/CallbackGraph/CallbackGraphContainer.css":
+/*!***********************************************************************!*\
+ !*** ./src/components/error/CallbackGraph/CallbackGraphContainer.css ***!
+ \***********************************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- 5. Submission of Contributions. Unless You explicitly state otherwise,
- any Contribution intentionally submitted for inclusion in the Work
- by You to the Licensor shall be under the terms and conditions of
- this License, without any additional terms or conditions.
- Notwithstanding the above, nothing herein shall supersede or modify
- the terms of any separate license agreement you may have executed
- with Licensor regarding such Contributions.
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_CallbackGraphContainer_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../../node_modules/css-loader/dist/cjs.js!./CallbackGraphContainer.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/error/CallbackGraph/CallbackGraphContainer.css");
- 6. Trademarks. This License does not grant permission to use the trade
- names, trademarks, service marks, or product names of the Licensor,
- except as required for reasonable and customary use in describing the
- origin of the Work and reproducing the content of the NOTICE file.
+
+
+
+
+
+
+
+
+
- 7. Disclaimer of Warranty. Unless required by applicable law or
- agreed to in writing, Licensor provides the Work (and each
- Contributor provides its Contributions) on an "AS IS" BASIS,
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
- implied, including, without limitation, any warranties or conditions
- of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
- PARTICULAR PURPOSE. You are solely responsible for determining the
- appropriateness of using or redistributing the Work and assume any
- risks associated with Your exercise of permissions under this License.
+var options = {};
- 8. Limitation of Liability. In no event and under no legal theory,
- whether in tort (including negligence), contract, or otherwise,
- unless required by applicable law (such as deliberate and grossly
- negligent acts) or agreed to in writing, shall any Contributor be
- liable to You for damages, including any direct, indirect, special,
- incidental, or consequential damages of any character arising as a
- result of this License or out of the use or inability to use the
- Work (including but not limited to damages for loss of goodwill,
- work stoppage, computer failure or malfunction, or any and all
- other commercial damages or losses), even if such Contributor
- has been advised of the possibility of such damages.
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
- 9. Accepting Warranty or Additional Liability. While redistributing
- the Work or Derivative Works thereof, You may choose to offer,
- and charge a fee for, acceptance of support, warranty, indemnity,
- or other liability obligations and/or rights consistent with this
- License. However, in accepting such obligations, You may act only
- on Your own behalf and on Your sole responsibility, not on behalf
- of any other Contributor, and only if You agree to indemnify,
- defend, and hold each Contributor harmless for any liability
- incurred by, or claims asserted against, such Contributor by reason
- of your accepting any such warranty or additional liability.
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
- END OF TERMS AND CONDITIONS
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_CallbackGraphContainer_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
- APPENDIX: How to apply the Apache License to your work.
- To apply the Apache License to your work, attach the following
- boilerplate notice, with the fields enclosed by brackets "{}"
- replaced with your own identifying information. (Don't include
- the brackets!) The text should be enclosed in the appropriate
- comment syntax for the file format. We also recommend that a
- file or class name and description of purpose be included on the
- same "printed page" as the copyright notice for easier
- identification within third-party archives.
- Copyright {yyyy} {name of copyright owner}
- Licensed under the Apache License, Version 2.0 (the "License");
- you may not use this file except in compliance with the License.
- You may obtain a copy of the License at
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_CallbackGraphContainer_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_CallbackGraphContainer_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_CallbackGraphContainer_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
- http://www.apache.org/licenses/LICENSE-2.0
- Unless required by applicable law or agreed to in writing, software
- distributed under the License is distributed on an "AS IS" BASIS,
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- See the License for the specific language governing permissions and
- limitations under the License.
-*/
+/***/ }),
-SVD.svd = function (A) {
- this.U = null;
- this.V = null;
- this.s = null;
- this.m = 0;
- this.n = 0;
- this.m = A.length;
- this.n = A[0].length;
- var nu = Math.min(this.m, this.n);
- this.s = function (s) {
- var a = [];
- while (s-- > 0) {
- a.push(0);
- }return a;
- }(Math.min(this.m + 1, this.n));
- this.U = function (dims) {
- var allocate = function allocate(dims) {
- if (dims.length == 0) {
- return 0;
- } else {
- var array = [];
- for (var i = 0; i < dims[0]; i++) {
- array.push(allocate(dims.slice(1)));
- }
- return array;
- }
- };
- return allocate(dims);
- }([this.m, nu]);
- this.V = function (dims) {
- var allocate = function allocate(dims) {
- if (dims.length == 0) {
- return 0;
- } else {
- var array = [];
- for (var i = 0; i < dims[0]; i++) {
- array.push(allocate(dims.slice(1)));
- }
- return array;
- }
- };
- return allocate(dims);
- }([this.n, this.n]);
- var e = function (s) {
- var a = [];
- while (s-- > 0) {
- a.push(0);
- }return a;
- }(this.n);
- var work = function (s) {
- var a = [];
- while (s-- > 0) {
- a.push(0);
- }return a;
- }(this.m);
- var wantu = true;
- var wantv = true;
- var nct = Math.min(this.m - 1, this.n);
- var nrt = Math.max(0, Math.min(this.n - 2, this.m));
- for (var k = 0; k < Math.max(nct, nrt); k++) {
- if (k < nct) {
- this.s[k] = 0;
- for (var i = k; i < this.m; i++) {
- this.s[k] = SVD.hypot(this.s[k], A[i][k]);
- }
- ;
- if (this.s[k] !== 0.0) {
- if (A[k][k] < 0.0) {
- this.s[k] = -this.s[k];
- }
- for (var _i = k; _i < this.m; _i++) {
- A[_i][k] /= this.s[k];
- }
- ;
- A[k][k] += 1.0;
- }
- this.s[k] = -this.s[k];
- }
- for (var j = k + 1; j < this.n; j++) {
- if (function (lhs, rhs) {
- return lhs && rhs;
- }(k < nct, this.s[k] !== 0.0)) {
- var t = 0;
- for (var _i2 = k; _i2 < this.m; _i2++) {
- t += A[_i2][k] * A[_i2][j];
- }
- ;
- t = -t / A[k][k];
- for (var _i3 = k; _i3 < this.m; _i3++) {
- A[_i3][j] += t * A[_i3][k];
- }
- ;
- }
- e[j] = A[k][j];
- }
- ;
- if (function (lhs, rhs) {
- return lhs && rhs;
- }(wantu, k < nct)) {
- for (var _i4 = k; _i4 < this.m; _i4++) {
- this.U[_i4][k] = A[_i4][k];
- }
- ;
- }
- if (k < nrt) {
- e[k] = 0;
- for (var _i5 = k + 1; _i5 < this.n; _i5++) {
- e[k] = SVD.hypot(e[k], e[_i5]);
- }
- ;
- if (e[k] !== 0.0) {
- if (e[k + 1] < 0.0) {
- e[k] = -e[k];
- }
- for (var _i6 = k + 1; _i6 < this.n; _i6++) {
- e[_i6] /= e[k];
- }
- ;
- e[k + 1] += 1.0;
- }
- e[k] = -e[k];
- if (function (lhs, rhs) {
- return lhs && rhs;
- }(k + 1 < this.m, e[k] !== 0.0)) {
- for (var _i7 = k + 1; _i7 < this.m; _i7++) {
- work[_i7] = 0.0;
- }
- ;
- for (var _j = k + 1; _j < this.n; _j++) {
- for (var _i8 = k + 1; _i8 < this.m; _i8++) {
- work[_i8] += e[_j] * A[_i8][_j];
- }
- ;
- }
- ;
- for (var _j2 = k + 1; _j2 < this.n; _j2++) {
- var _t = -e[_j2] / e[k + 1];
- for (var _i9 = k + 1; _i9 < this.m; _i9++) {
- A[_i9][_j2] += _t * work[_i9];
- }
- ;
- }
- ;
- }
- if (wantv) {
- for (var _i10 = k + 1; _i10 < this.n; _i10++) {
- this.V[_i10][k] = e[_i10];
- };
- }
- }
- };
- var p = Math.min(this.n, this.m + 1);
- if (nct < this.n) {
- this.s[nct] = A[nct][nct];
- }
- if (this.m < p) {
- this.s[p - 1] = 0.0;
- }
- if (nrt + 1 < p) {
- e[nrt] = A[nrt][p - 1];
- }
- e[p - 1] = 0.0;
- if (wantu) {
- for (var _j3 = nct; _j3 < nu; _j3++) {
- for (var _i11 = 0; _i11 < this.m; _i11++) {
- this.U[_i11][_j3] = 0.0;
- }
- ;
- this.U[_j3][_j3] = 1.0;
- };
- for (var _k = nct - 1; _k >= 0; _k--) {
- if (this.s[_k] !== 0.0) {
- for (var _j4 = _k + 1; _j4 < nu; _j4++) {
- var _t2 = 0;
- for (var _i12 = _k; _i12 < this.m; _i12++) {
- _t2 += this.U[_i12][_k] * this.U[_i12][_j4];
- };
- _t2 = -_t2 / this.U[_k][_k];
- for (var _i13 = _k; _i13 < this.m; _i13++) {
- this.U[_i13][_j4] += _t2 * this.U[_i13][_k];
- };
- };
- for (var _i14 = _k; _i14 < this.m; _i14++) {
- this.U[_i14][_k] = -this.U[_i14][_k];
- };
- this.U[_k][_k] = 1.0 + this.U[_k][_k];
- for (var _i15 = 0; _i15 < _k - 1; _i15++) {
- this.U[_i15][_k] = 0.0;
- };
- } else {
- for (var _i16 = 0; _i16 < this.m; _i16++) {
- this.U[_i16][_k] = 0.0;
- };
- this.U[_k][_k] = 1.0;
- }
- };
- }
- if (wantv) {
- for (var _k2 = this.n - 1; _k2 >= 0; _k2--) {
- if (function (lhs, rhs) {
- return lhs && rhs;
- }(_k2 < nrt, e[_k2] !== 0.0)) {
- for (var _j5 = _k2 + 1; _j5 < nu; _j5++) {
- var _t3 = 0;
- for (var _i17 = _k2 + 1; _i17 < this.n; _i17++) {
- _t3 += this.V[_i17][_k2] * this.V[_i17][_j5];
- };
- _t3 = -_t3 / this.V[_k2 + 1][_k2];
- for (var _i18 = _k2 + 1; _i18 < this.n; _i18++) {
- this.V[_i18][_j5] += _t3 * this.V[_i18][_k2];
- };
- };
- }
- for (var _i19 = 0; _i19 < this.n; _i19++) {
- this.V[_i19][_k2] = 0.0;
- };
- this.V[_k2][_k2] = 1.0;
- };
- }
- var pp = p - 1;
- var iter = 0;
- var eps = Math.pow(2.0, -52.0);
- var tiny = Math.pow(2.0, -966.0);
- while (p > 0) {
- var _k3 = void 0;
- var kase = void 0;
- for (_k3 = p - 2; _k3 >= -1; _k3--) {
- if (_k3 === -1) {
- break;
- }
- if (Math.abs(e[_k3]) <= tiny + eps * (Math.abs(this.s[_k3]) + Math.abs(this.s[_k3 + 1]))) {
- e[_k3] = 0.0;
- break;
- }
- };
- if (_k3 === p - 2) {
- kase = 4;
- } else {
- var ks = void 0;
- for (ks = p - 1; ks >= _k3; ks--) {
- if (ks === _k3) {
- break;
- }
- var _t4 = (ks !== p ? Math.abs(e[ks]) : 0.0) + (ks !== _k3 + 1 ? Math.abs(e[ks - 1]) : 0.0);
- if (Math.abs(this.s[ks]) <= tiny + eps * _t4) {
- this.s[ks] = 0.0;
- break;
- }
- };
- if (ks === _k3) {
- kase = 3;
- } else if (ks === p - 1) {
- kase = 1;
- } else {
- kase = 2;
- _k3 = ks;
- }
- }
- _k3++;
- switch (kase) {
- case 1:
- {
- var f = e[p - 2];
- e[p - 2] = 0.0;
- for (var _j6 = p - 2; _j6 >= _k3; _j6--) {
- var _t5 = SVD.hypot(this.s[_j6], f);
- var cs = this.s[_j6] / _t5;
- var sn = f / _t5;
- this.s[_j6] = _t5;
- if (_j6 !== _k3) {
- f = -sn * e[_j6 - 1];
- e[_j6 - 1] = cs * e[_j6 - 1];
- }
- if (wantv) {
- for (var _i20 = 0; _i20 < this.n; _i20++) {
- _t5 = cs * this.V[_i20][_j6] + sn * this.V[_i20][p - 1];
- this.V[_i20][p - 1] = -sn * this.V[_i20][_j6] + cs * this.V[_i20][p - 1];
- this.V[_i20][_j6] = _t5;
- };
- }
- };
- };
- break;
- case 2:
- {
- var _f = e[_k3 - 1];
- e[_k3 - 1] = 0.0;
- for (var _j7 = _k3; _j7 < p; _j7++) {
- var _t6 = SVD.hypot(this.s[_j7], _f);
- var _cs = this.s[_j7] / _t6;
- var _sn = _f / _t6;
- this.s[_j7] = _t6;
- _f = -_sn * e[_j7];
- e[_j7] = _cs * e[_j7];
- if (wantu) {
- for (var _i21 = 0; _i21 < this.m; _i21++) {
- _t6 = _cs * this.U[_i21][_j7] + _sn * this.U[_i21][_k3 - 1];
- this.U[_i21][_k3 - 1] = -_sn * this.U[_i21][_j7] + _cs * this.U[_i21][_k3 - 1];
- this.U[_i21][_j7] = _t6;
- };
- }
- };
- };
- break;
- case 3:
- {
- var scale = Math.max(Math.max(Math.max(Math.max(Math.abs(this.s[p - 1]), Math.abs(this.s[p - 2])), Math.abs(e[p - 2])), Math.abs(this.s[_k3])), Math.abs(e[_k3]));
- var sp = this.s[p - 1] / scale;
- var spm1 = this.s[p - 2] / scale;
- var epm1 = e[p - 2] / scale;
- var sk = this.s[_k3] / scale;
- var ek = e[_k3] / scale;
- var b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2.0;
- var c = sp * epm1 * (sp * epm1);
- var shift = 0.0;
- if (function (lhs, rhs) {
- return lhs || rhs;
- }(b !== 0.0, c !== 0.0)) {
- shift = Math.sqrt(b * b + c);
- if (b < 0.0) {
- shift = -shift;
- }
- shift = c / (b + shift);
- }
- var _f2 = (sk + sp) * (sk - sp) + shift;
- var g = sk * ek;
- for (var _j8 = _k3; _j8 < p - 1; _j8++) {
- var _t7 = SVD.hypot(_f2, g);
- var _cs2 = _f2 / _t7;
- var _sn2 = g / _t7;
- if (_j8 !== _k3) {
- e[_j8 - 1] = _t7;
- }
- _f2 = _cs2 * this.s[_j8] + _sn2 * e[_j8];
- e[_j8] = _cs2 * e[_j8] - _sn2 * this.s[_j8];
- g = _sn2 * this.s[_j8 + 1];
- this.s[_j8 + 1] = _cs2 * this.s[_j8 + 1];
- if (wantv) {
- for (var _i22 = 0; _i22 < this.n; _i22++) {
- _t7 = _cs2 * this.V[_i22][_j8] + _sn2 * this.V[_i22][_j8 + 1];
- this.V[_i22][_j8 + 1] = -_sn2 * this.V[_i22][_j8] + _cs2 * this.V[_i22][_j8 + 1];
- this.V[_i22][_j8] = _t7;
- };
- }
- _t7 = SVD.hypot(_f2, g);
- _cs2 = _f2 / _t7;
- _sn2 = g / _t7;
- this.s[_j8] = _t7;
- _f2 = _cs2 * e[_j8] + _sn2 * this.s[_j8 + 1];
- this.s[_j8 + 1] = -_sn2 * e[_j8] + _cs2 * this.s[_j8 + 1];
- g = _sn2 * e[_j8 + 1];
- e[_j8 + 1] = _cs2 * e[_j8 + 1];
- if (wantu && _j8 < this.m - 1) {
- for (var _i23 = 0; _i23 < this.m; _i23++) {
- _t7 = _cs2 * this.U[_i23][_j8] + _sn2 * this.U[_i23][_j8 + 1];
- this.U[_i23][_j8 + 1] = -_sn2 * this.U[_i23][_j8] + _cs2 * this.U[_i23][_j8 + 1];
- this.U[_i23][_j8] = _t7;
- };
- }
- };
- e[p - 2] = _f2;
- iter = iter + 1;
- };
- break;
- case 4:
- {
- if (this.s[_k3] <= 0.0) {
- this.s[_k3] = this.s[_k3] < 0.0 ? -this.s[_k3] : 0.0;
- if (wantv) {
- for (var _i24 = 0; _i24 <= pp; _i24++) {
- this.V[_i24][_k3] = -this.V[_i24][_k3];
- };
- }
- }
- while (_k3 < pp) {
- if (this.s[_k3] >= this.s[_k3 + 1]) {
- break;
- }
- var _t8 = this.s[_k3];
- this.s[_k3] = this.s[_k3 + 1];
- this.s[_k3 + 1] = _t8;
- if (wantv && _k3 < this.n - 1) {
- for (var _i25 = 0; _i25 < this.n; _i25++) {
- _t8 = this.V[_i25][_k3 + 1];
- this.V[_i25][_k3 + 1] = this.V[_i25][_k3];
- this.V[_i25][_k3] = _t8;
- };
- }
- if (wantu && _k3 < this.m - 1) {
- for (var _i26 = 0; _i26 < this.m; _i26++) {
- _t8 = this.U[_i26][_k3 + 1];
- this.U[_i26][_k3 + 1] = this.U[_i26][_k3];
- this.U[_i26][_k3] = _t8;
- };
- }
- _k3++;
- };
- iter = 0;
- p--;
- };
- break;
- }
- };
- var result = { U: this.U, V: this.V, S: this.s };
- return result;
-};
+/***/ "./src/components/error/FrontEnd/FrontEndError.css":
+/*!*********************************************************!*\
+ !*** ./src/components/error/FrontEnd/FrontEndError.css ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_FrontEndError_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../../node_modules/css-loader/dist/cjs.js!./FrontEndError.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/error/FrontEnd/FrontEndError.css");
+
+
+
+
+
+
+
+
+
+
+
+var options = {};
+
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
+
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
+
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_FrontEndError_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
-// sqrt(a^2 + b^2) without under/overflow.
-SVD.hypot = function (a, b) {
- var r = void 0;
- if (Math.abs(a) > Math.abs(b)) {
- r = b / a;
- r = Math.abs(a) * Math.sqrt(1 + r * r);
- } else if (b != 0) {
- r = a / b;
- r = Math.abs(b) * Math.sqrt(1 + r * r);
- } else {
- r = 0.0;
- }
- return r;
-};
-module.exports = SVD;
+
+
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_FrontEndError_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_FrontEndError_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_FrontEndError_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
+
/***/ }),
-/* 27 */
-/***/ (function(module, exports, __webpack_require__) {
+
+/***/ "./src/components/error/GlobalErrorOverlay.css":
+/*!*****************************************************!*\
+ !*** ./src/components/error/GlobalErrorOverlay.css ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_GlobalErrorOverlay_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../node_modules/css-loader/dist/cjs.js!./GlobalErrorOverlay.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/error/GlobalErrorOverlay.css");
+
+
+
+
+
+
+
+
+
-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 options = {};
-function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } }
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
-/**
- * Needleman-Wunsch algorithm is an procedure to compute the optimal global alignment of two string
- * sequences by S.B.Needleman and C.D.Wunsch (1970).
- *
- * Aside from the inputs, you can assign the scores for,
- * - Match: The two characters at the current index are same.
- * - Mismatch: The two characters at the current index are different.
- * - Insertion/Deletion(gaps): The best alignment involves one letter aligning to a gap in the other string.
- */
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
-var NeedlemanWunsch = function () {
- function NeedlemanWunsch(sequence1, sequence2) {
- var match_score = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 1;
- var mismatch_penalty = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : -1;
- var gap_penalty = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : -1;
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_GlobalErrorOverlay_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
- _classCallCheck(this, NeedlemanWunsch);
- this.sequence1 = sequence1;
- this.sequence2 = sequence2;
- this.match_score = match_score;
- this.mismatch_penalty = mismatch_penalty;
- this.gap_penalty = gap_penalty;
- // Just the remove redundancy
- this.iMax = sequence1.length + 1;
- this.jMax = sequence2.length + 1;
- // Grid matrix of scores
- this.grid = new Array(this.iMax);
- for (var i = 0; i < this.iMax; i++) {
- this.grid[i] = new Array(this.jMax);
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_GlobalErrorOverlay_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_GlobalErrorOverlay_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_GlobalErrorOverlay_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
- for (var j = 0; j < this.jMax; j++) {
- this.grid[i][j] = 0;
- }
- }
- // Traceback matrix (2D array, each cell is an array of boolean values for [`Diag`, `Up`, `Left`] positions)
- this.tracebackGrid = new Array(this.iMax);
- for (var _i = 0; _i < this.iMax; _i++) {
- this.tracebackGrid[_i] = new Array(this.jMax);
+/***/ }),
- for (var _j = 0; _j < this.jMax; _j++) {
- this.tracebackGrid[_i][_j] = [null, null, null];
- }
- }
+/***/ "./src/components/error/Percy.css":
+/*!****************************************!*\
+ !*** ./src/components/error/Percy.css ***!
+ \****************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
- // The aligned sequences (return multiple possibilities)
- this.alignments = [];
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_Percy_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../node_modules/css-loader/dist/cjs.js!./Percy.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/error/Percy.css");
- // Final alignment score
- this.score = -1;
+
+
+
+
+
+
+
+
+
- // Calculate scores and tracebacks
- this.computeGrids();
+var options = {};
+
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
+
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
+
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_Percy_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
+
+
+
+
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_Percy_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_Percy_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_Percy_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
+
+
+/***/ }),
+
+/***/ "./src/components/error/menu/DebugMenu.css":
+/*!*************************************************!*\
+ !*** ./src/components/error/menu/DebugMenu.css ***!
+ \*************************************************/
+/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js */ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleDomAPI.js */ "./node_modules/style-loader/dist/runtime/styleDomAPI.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertBySelector.js */ "./node_modules/style-loader/dist/runtime/insertBySelector.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js */ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/insertStyleElement.js */ "./node_modules/style-loader/dist/runtime/insertStyleElement.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4__);
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! !../../../../node_modules/style-loader/dist/runtime/styleTagTransform.js */ "./node_modules/style-loader/dist/runtime/styleTagTransform.js");
+/* harmony import */ var _node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5__);
+/* harmony import */ var _node_modules_css_loader_dist_cjs_js_DebugMenu_css__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! !!../../../../node_modules/css-loader/dist/cjs.js!./DebugMenu.css */ "./node_modules/css-loader/dist/cjs.js!./src/components/error/menu/DebugMenu.css");
+
+
+
+
+
+
+
+
+
+
+
+var options = {};
+
+options.styleTagTransform = (_node_modules_style_loader_dist_runtime_styleTagTransform_js__WEBPACK_IMPORTED_MODULE_5___default());
+options.setAttributes = (_node_modules_style_loader_dist_runtime_setAttributesWithoutAttributes_js__WEBPACK_IMPORTED_MODULE_3___default());
+
+ options.insert = _node_modules_style_loader_dist_runtime_insertBySelector_js__WEBPACK_IMPORTED_MODULE_2___default().bind(null, "head");
+
+options.domAPI = (_node_modules_style_loader_dist_runtime_styleDomAPI_js__WEBPACK_IMPORTED_MODULE_1___default());
+options.insertStyleElement = (_node_modules_style_loader_dist_runtime_insertStyleElement_js__WEBPACK_IMPORTED_MODULE_4___default());
+
+var update = _node_modules_style_loader_dist_runtime_injectStylesIntoStyleTag_js__WEBPACK_IMPORTED_MODULE_0___default()(_node_modules_css_loader_dist_cjs_js_DebugMenu_css__WEBPACK_IMPORTED_MODULE_6__["default"], options);
+
+
+
+
+ /* harmony default export */ __webpack_exports__["default"] = (_node_modules_css_loader_dist_cjs_js_DebugMenu_css__WEBPACK_IMPORTED_MODULE_6__["default"] && _node_modules_css_loader_dist_cjs_js_DebugMenu_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals ? _node_modules_css_loader_dist_cjs_js_DebugMenu_css__WEBPACK_IMPORTED_MODULE_6__["default"].locals : undefined);
+
+
+/***/ }),
+
+/***/ "./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js":
+/*!****************************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/injectStylesIntoStyleTag.js ***!
+ \****************************************************************************/
+/***/ (function(module) {
+
+"use strict";
+
+
+var stylesInDOM = [];
+function getIndexByIdentifier(identifier) {
+ var result = -1;
+ for (var i = 0; i < stylesInDOM.length; i++) {
+ if (stylesInDOM[i].identifier === identifier) {
+ result = i;
+ break;
+ }
+ }
+ return result;
+}
+function modulesToDom(list, options) {
+ var idCountMap = {};
+ var identifiers = [];
+ for (var i = 0; i < list.length; i++) {
+ var item = list[i];
+ var id = options.base ? item[0] + options.base : item[0];
+ var count = idCountMap[id] || 0;
+ var identifier = "".concat(id, " ").concat(count);
+ idCountMap[id] = count + 1;
+ var indexByIdentifier = getIndexByIdentifier(identifier);
+ var obj = {
+ css: item[1],
+ media: item[2],
+ sourceMap: item[3],
+ supports: item[4],
+ layer: item[5]
+ };
+ if (indexByIdentifier !== -1) {
+ stylesInDOM[indexByIdentifier].references++;
+ stylesInDOM[indexByIdentifier].updater(obj);
+ } else {
+ var updater = addElementStyle(obj, options);
+ options.byIndex = i;
+ stylesInDOM.splice(i, 0, {
+ identifier: identifier,
+ updater: updater,
+ references: 1
+ });
+ }
+ identifiers.push(identifier);
+ }
+ return identifiers;
+}
+function addElementStyle(obj, options) {
+ var api = options.domAPI(options);
+ api.update(obj);
+ var updater = function updater(newObj) {
+ if (newObj) {
+ if (newObj.css === obj.css && newObj.media === obj.media && newObj.sourceMap === obj.sourceMap && newObj.supports === obj.supports && newObj.layer === obj.layer) {
+ return;
+ }
+ api.update(obj = newObj);
+ } else {
+ api.remove();
+ }
+ };
+ return updater;
+}
+module.exports = function (list, options) {
+ options = options || {};
+ list = list || [];
+ var lastIdentifiers = modulesToDom(list, options);
+ return function update(newList) {
+ newList = newList || [];
+ for (var i = 0; i < lastIdentifiers.length; i++) {
+ var identifier = lastIdentifiers[i];
+ var index = getIndexByIdentifier(identifier);
+ stylesInDOM[index].references--;
+ }
+ var newLastIdentifiers = modulesToDom(newList, options);
+ for (var _i = 0; _i < lastIdentifiers.length; _i++) {
+ var _identifier = lastIdentifiers[_i];
+ var _index = getIndexByIdentifier(_identifier);
+ if (stylesInDOM[_index].references === 0) {
+ stylesInDOM[_index].updater();
+ stylesInDOM.splice(_index, 1);
+ }
}
+ lastIdentifiers = newLastIdentifiers;
+ };
+};
- _createClass(NeedlemanWunsch, [{
- key: "getScore",
- value: function getScore() {
- return this.score;
- }
- }, {
- key: "getAlignments",
- value: function getAlignments() {
- return this.alignments;
- }
+/***/ }),
- // Main dynamic programming procedure
+/***/ "./node_modules/style-loader/dist/runtime/insertBySelector.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/insertBySelector.js ***!
+ \********************************************************************/
+/***/ (function(module) {
- }, {
- key: "computeGrids",
- value: function computeGrids() {
- // Fill in the first row
- for (var j = 1; j < this.jMax; j++) {
- this.grid[0][j] = this.grid[0][j - 1] + this.gap_penalty;
- this.tracebackGrid[0][j] = [false, false, true];
- }
+"use strict";
- // Fill in the first column
- for (var i = 1; i < this.iMax; i++) {
- this.grid[i][0] = this.grid[i - 1][0] + this.gap_penalty;
- this.tracebackGrid[i][0] = [false, true, false];
- }
- // Fill the rest of the grid
- for (var _i2 = 1; _i2 < this.iMax; _i2++) {
- for (var _j2 = 1; _j2 < this.jMax; _j2++) {
- // Find the max score(s) among [`Diag`, `Up`, `Left`]
- var diag = void 0;
- if (this.sequence1[_i2 - 1] === this.sequence2[_j2 - 1]) diag = this.grid[_i2 - 1][_j2 - 1] + this.match_score;else diag = this.grid[_i2 - 1][_j2 - 1] + this.mismatch_penalty;
+var memo = {};
- var up = this.grid[_i2 - 1][_j2] + this.gap_penalty;
- var left = this.grid[_i2][_j2 - 1] + this.gap_penalty;
+/* istanbul ignore next */
+function getTarget(target) {
+ if (typeof memo[target] === "undefined") {
+ var styleTarget = document.querySelector(target);
- // If there exists multiple max values, capture them for multiple paths
- var maxOf = [diag, up, left];
- var indices = this.arrayAllMaxIndexes(maxOf);
+ // Special case to return head of iframe instead of iframe itself
+ if (window.HTMLIFrameElement && styleTarget instanceof window.HTMLIFrameElement) {
+ try {
+ // This will throw an exception if access to iframe is blocked
+ // due to cross-origin restrictions
+ styleTarget = styleTarget.contentDocument.head;
+ } catch (e) {
+ // istanbul ignore next
+ styleTarget = null;
+ }
+ }
+ memo[target] = styleTarget;
+ }
+ return memo[target];
+}
- // Update Grids
- this.grid[_i2][_j2] = maxOf[indices[0]];
- this.tracebackGrid[_i2][_j2] = [indices.includes(0), indices.includes(1), indices.includes(2)];
- }
- }
+/* istanbul ignore next */
+function insertBySelector(insert, style) {
+ var target = getTarget(insert);
+ if (!target) {
+ throw new Error("Couldn't find a style target. This probably means that the value for the 'insert' parameter is invalid.");
+ }
+ target.appendChild(style);
+}
+module.exports = insertBySelector;
- // Update alignment score
- this.score = this.grid[this.iMax - 1][this.jMax - 1];
- }
+/***/ }),
- // Gets all possible valid sequence combinations
+/***/ "./node_modules/style-loader/dist/runtime/insertStyleElement.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/insertStyleElement.js ***!
+ \**********************************************************************/
+/***/ (function(module) {
- }, {
- key: "alignmentTraceback",
- value: function alignmentTraceback() {
- var inProcessAlignments = [];
+"use strict";
- inProcessAlignments.push({ pos: [this.sequence1.length, this.sequence2.length],
- seq1: "",
- seq2: ""
- });
- while (inProcessAlignments[0]) {
- var current = inProcessAlignments[0];
- var directions = this.tracebackGrid[current.pos[0]][current.pos[1]];
+/* istanbul ignore next */
+function insertStyleElement(options) {
+ var element = document.createElement("style");
+ options.setAttributes(element, options.attributes);
+ options.insert(element, options.options);
+ return element;
+}
+module.exports = insertStyleElement;
- if (directions[0]) {
- inProcessAlignments.push({ pos: [current.pos[0] - 1, current.pos[1] - 1],
- seq1: this.sequence1[current.pos[0] - 1] + current.seq1,
- seq2: this.sequence2[current.pos[1] - 1] + current.seq2
- });
- }
- if (directions[1]) {
- inProcessAlignments.push({ pos: [current.pos[0] - 1, current.pos[1]],
- seq1: this.sequence1[current.pos[0] - 1] + current.seq1,
- seq2: '-' + current.seq2
- });
- }
- if (directions[2]) {
- inProcessAlignments.push({ pos: [current.pos[0], current.pos[1] - 1],
- seq1: '-' + current.seq1,
- seq2: this.sequence2[current.pos[1] - 1] + current.seq2
- });
- }
+/***/ }),
- if (current.pos[0] === 0 && current.pos[1] === 0) this.alignments.push({ sequence1: current.seq1,
- sequence2: current.seq2
- });
+/***/ "./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js":
+/*!**********************************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/setAttributesWithoutAttributes.js ***!
+ \**********************************************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- inProcessAlignments.shift();
- }
+"use strict";
+
+
+/* istanbul ignore next */
+function setAttributesWithoutAttributes(styleElement) {
+ var nonce = true ? __webpack_require__.nc : 0;
+ if (nonce) {
+ styleElement.setAttribute("nonce", nonce);
+ }
+}
+module.exports = setAttributesWithoutAttributes;
+
+/***/ }),
+
+/***/ "./node_modules/style-loader/dist/runtime/styleDomAPI.js":
+/*!***************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/styleDomAPI.js ***!
+ \***************************************************************/
+/***/ (function(module) {
+
+"use strict";
+
+
+/* istanbul ignore next */
+function apply(styleElement, options, obj) {
+ var css = "";
+ if (obj.supports) {
+ css += "@supports (".concat(obj.supports, ") {");
+ }
+ if (obj.media) {
+ css += "@media ".concat(obj.media, " {");
+ }
+ var needLayer = typeof obj.layer !== "undefined";
+ if (needLayer) {
+ css += "@layer".concat(obj.layer.length > 0 ? " ".concat(obj.layer) : "", " {");
+ }
+ css += obj.css;
+ if (needLayer) {
+ css += "}";
+ }
+ if (obj.media) {
+ css += "}";
+ }
+ if (obj.supports) {
+ css += "}";
+ }
+ var sourceMap = obj.sourceMap;
+ if (sourceMap && typeof btoa !== "undefined") {
+ css += "\n/*# sourceMappingURL=data:application/json;base64,".concat(btoa(unescape(encodeURIComponent(JSON.stringify(sourceMap)))), " */");
+ }
- return this.alignments;
- }
+ // For old IE
+ /* istanbul ignore if */
+ options.styleTagTransform(css, styleElement, options.options);
+}
+function removeStyleElement(styleElement) {
+ // istanbul ignore if
+ if (styleElement.parentNode === null) {
+ return false;
+ }
+ styleElement.parentNode.removeChild(styleElement);
+}
- // Helper Functions
+/* istanbul ignore next */
+function domAPI(options) {
+ if (typeof document === "undefined") {
+ return {
+ update: function update() {},
+ remove: function remove() {}
+ };
+ }
+ var styleElement = options.insertStyleElement(options);
+ return {
+ update: function update(obj) {
+ apply(styleElement, options, obj);
+ },
+ remove: function remove() {
+ removeStyleElement(styleElement);
+ }
+ };
+}
+module.exports = domAPI;
- }, {
- key: "getAllIndexes",
- value: function getAllIndexes(arr, val) {
- var indexes = [],
- i = -1;
- while ((i = arr.indexOf(val, i + 1)) !== -1) {
- indexes.push(i);
- }
- return indexes;
- }
- }, {
- key: "arrayAllMaxIndexes",
- value: function arrayAllMaxIndexes(array) {
- return this.getAllIndexes(array, Math.max.apply(null, array));
- }
- }]);
+/***/ }),
- return NeedlemanWunsch;
-}();
+/***/ "./node_modules/style-loader/dist/runtime/styleTagTransform.js":
+/*!*********************************************************************!*\
+ !*** ./node_modules/style-loader/dist/runtime/styleTagTransform.js ***!
+ \*********************************************************************/
+/***/ (function(module) {
-module.exports = NeedlemanWunsch;
+"use strict";
-/***/ }),
-/* 28 */
-/***/ (function(module, exports, __nested_webpack_require_145732__) {
-"use strict";
+/* istanbul ignore next */
+function styleTagTransform(css, styleElement) {
+ if (styleElement.styleSheet) {
+ styleElement.styleSheet.cssText = css;
+ } else {
+ while (styleElement.firstChild) {
+ styleElement.removeChild(styleElement.firstChild);
+ }
+ styleElement.appendChild(document.createTextNode(css));
+ }
+}
+module.exports = styleTagTransform;
+/***/ }),
-var layoutBase = function layoutBase() {
- return;
-};
+/***/ "./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim.development.js":
+/*!**********************************************************************************************!*\
+ !*** ./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim.development.js ***!
+ \**********************************************************************************************/
+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
-layoutBase.FDLayout = __nested_webpack_require_145732__(18);
-layoutBase.FDLayoutConstants = __nested_webpack_require_145732__(4);
-layoutBase.FDLayoutEdge = __nested_webpack_require_145732__(19);
-layoutBase.FDLayoutNode = __nested_webpack_require_145732__(20);
-layoutBase.DimensionD = __nested_webpack_require_145732__(21);
-layoutBase.HashMap = __nested_webpack_require_145732__(22);
-layoutBase.HashSet = __nested_webpack_require_145732__(23);
-layoutBase.IGeometry = __nested_webpack_require_145732__(8);
-layoutBase.IMath = __nested_webpack_require_145732__(9);
-layoutBase.Integer = __nested_webpack_require_145732__(10);
-layoutBase.Point = __nested_webpack_require_145732__(12);
-layoutBase.PointD = __nested_webpack_require_145732__(5);
-layoutBase.RandomSeed = __nested_webpack_require_145732__(16);
-layoutBase.RectangleD = __nested_webpack_require_145732__(13);
-layoutBase.Transform = __nested_webpack_require_145732__(17);
-layoutBase.UniqueIDGeneretor = __nested_webpack_require_145732__(14);
-layoutBase.Quicksort = __nested_webpack_require_145732__(25);
-layoutBase.LinkedList = __nested_webpack_require_145732__(11);
-layoutBase.LGraphObject = __nested_webpack_require_145732__(2);
-layoutBase.LGraph = __nested_webpack_require_145732__(6);
-layoutBase.LEdge = __nested_webpack_require_145732__(1);
-layoutBase.LGraphManager = __nested_webpack_require_145732__(7);
-layoutBase.LNode = __nested_webpack_require_145732__(3);
-layoutBase.Layout = __nested_webpack_require_145732__(15);
-layoutBase.LayoutConstants = __nested_webpack_require_145732__(0);
-layoutBase.NeedlemanWunsch = __nested_webpack_require_145732__(27);
-layoutBase.Matrix = __nested_webpack_require_145732__(24);
-layoutBase.SVD = __nested_webpack_require_145732__(26);
+"use strict";
+/**
+ * @license React
+ * use-sync-external-store-shim.development.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
-module.exports = layoutBase;
-/***/ }),
-/* 29 */
-/***/ (function(module, exports, __webpack_require__) {
-"use strict";
+if (true) {
+ (function() {
+ 'use strict';
-function Emitter() {
- this.listeners = [];
+/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
+if (
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart ===
+ 'function'
+) {
+ __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());
}
+ var React = __webpack_require__(/*! react */ "react");
-var p = Emitter.prototype;
-
-p.addListener = function (event, callback) {
- this.listeners.push({
- event: event,
- callback: callback
- });
-};
+var ReactSharedInternals = React.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;
-p.removeListener = function (event, callback) {
- for (var i = this.listeners.length; i >= 0; i--) {
- var l = this.listeners[i];
+function error(format) {
+ {
+ {
+ for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
+ args[_key2 - 1] = arguments[_key2];
+ }
- if (l.event === event && l.callback === callback) {
- this.listeners.splice(i, 1);
+ printWarning('error', format, args);
}
}
-};
+}
-p.emit = function (event, data) {
- for (var i = 0; i < this.listeners.length; i++) {
- var l = this.listeners[i];
+function printWarning(level, format, args) {
+ // When changing this logic, you might want to also
+ // update consoleWithStackDev.www.js as well.
+ {
+ var ReactDebugCurrentFrame = ReactSharedInternals.ReactDebugCurrentFrame;
+ var stack = ReactDebugCurrentFrame.getStackAddendum();
- if (event === l.event) {
- l.callback(data);
- }
- }
-};
+ if (stack !== '') {
+ format += '%s';
+ args = args.concat([stack]);
+ } // eslint-disable-next-line react-internal/safe-string-coercion
-module.exports = Emitter;
-/***/ })
-/******/ ]);
-});
+ var argsWithFormat = args.map(function (item) {
+ return String(item);
+ }); // Careful: RN currently depends on this prefix
-/***/ }),
+ argsWithFormat.unshift('Warning: ' + format); // We intentionally don't use spread (or .apply) directly because it
+ // breaks IE9: https://github.com/facebook/react/issues/13610
+ // eslint-disable-next-line react-internal/no-production-logging
-/***/ "./node_modules/lodash.curry/index.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash.curry/index.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ Function.prototype.apply.call(console[level], console, argsWithFormat);
+ }
+}
/**
- * lodash (Custom Build) <https://lodash.com/>
- * Build: `lodash modularize exports="npm" -o ./`
- * Copyright jQuery Foundation and other contributors <https://jquery.org/>
- * 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
+ * inlined Object.is polyfill to avoid requiring consumers ship their own
+ * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
*/
+function is(x, y) {
+ return x === y && (x !== 0 || 1 / x === 1 / y) || x !== x && y !== y // eslint-disable-line no-self-compare
+ ;
+}
-/** Used as the `TypeError` message for "Functions" methods. */
-var FUNC_ERROR_TEXT = 'Expected a function';
-
-/** Used as the internal argument placeholder. */
-var PLACEHOLDER = '__lodash_placeholder__';
+var objectIs = typeof Object.is === 'function' ? Object.is : is;
-/** Used to compose bitmasks for function metadata. */
-var BIND_FLAG = 1,
- BIND_KEY_FLAG = 2,
- CURRY_BOUND_FLAG = 4,
- CURRY_FLAG = 8,
- CURRY_RIGHT_FLAG = 16,
- PARTIAL_FLAG = 32,
- PARTIAL_RIGHT_FLAG = 64,
- ARY_FLAG = 128,
- REARG_FLAG = 256,
- FLIP_FLAG = 512;
+// dispatch for CommonJS interop named imports.
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0,
- MAX_SAFE_INTEGER = 9007199254740991,
- MAX_INTEGER = 1.7976931348623157e+308,
- NAN = 0 / 0;
+var useState = React.useState,
+ useEffect = React.useEffect,
+ useLayoutEffect = React.useLayoutEffect,
+ useDebugValue = React.useDebugValue;
+var didWarnOld18Alpha = false;
+var didWarnUncachedGetSnapshot = false; // Disclaimer: This shim breaks many of the rules of React, and only works
+// because of a very particular set of implementation details and assumptions
+// -- change any one of them and it will break. The most important assumption
+// is that updates are always synchronous, because concurrent rendering is
+// only available in versions of React that also have a built-in
+// useSyncExternalStore API. And we only use this shim when the built-in API
+// does not exist.
+//
+// Do not assume that the clever hacks used by this hook also work in general.
+// The point of this shim is to replace the need for hacks by other libraries.
-/** Used to associate wrap methods with their bit flags. */
-var wrapFlags = [
- ['ary', ARY_FLAG],
- ['bind', BIND_FLAG],
- ['bindKey', BIND_KEY_FLAG],
- ['curry', CURRY_FLAG],
- ['curryRight', CURRY_RIGHT_FLAG],
- ['flip', FLIP_FLAG],
- ['partial', PARTIAL_FLAG],
- ['partialRight', PARTIAL_RIGHT_FLAG],
- ['rearg', REARG_FLAG]
-];
+function useSyncExternalStore(subscribe, getSnapshot, // Note: The shim does not use getServerSnapshot, because pre-18 versions of
+// React do not expose a way to check if we're hydrating. So users of the shim
+// will need to track that themselves and return the correct value
+// from `getSnapshot`.
+getServerSnapshot) {
+ {
+ if (!didWarnOld18Alpha) {
+ if (React.startTransition !== undefined) {
+ didWarnOld18Alpha = true;
-/** `Object#toString` result references. */
-var funcTag = '[object Function]',
- genTag = '[object GeneratorFunction]',
- symbolTag = '[object Symbol]';
+ error('You are using an outdated, pre-release alpha of React 18 that ' + 'does not support useSyncExternalStore. The ' + 'use-sync-external-store shim will not work correctly. Upgrade ' + 'to a newer pre-release.');
+ }
+ }
+ } // Read the current snapshot from the store on every render. Again, this
+ // breaks the rules of React, and only works here because of specific
+ // implementation details, most importantly that updates are
+ // always synchronous.
-/**
- * Used to match `RegExp`
- * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
- */
-var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
-/** Used to match leading and trailing whitespace. */
-var reTrim = /^\s+|\s+$/g;
+ var value = getSnapshot();
-/** Used to match wrap detail comments. */
-var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,
- reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/,
- reSplitDetails = /,? & /;
+ {
+ if (!didWarnUncachedGetSnapshot) {
+ var cachedValue = getSnapshot();
-/** Used to detect bad signed hexadecimal string values. */
-var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+ if (!objectIs(value, cachedValue)) {
+ error('The result of getSnapshot should be cached to avoid an infinite loop');
-/** Used to detect binary string values. */
-var reIsBinary = /^0b[01]+$/i;
+ didWarnUncachedGetSnapshot = true;
+ }
+ }
+ } // Because updates are synchronous, we don't queue them. Instead we force a
+ // re-render whenever the subscribed state changes by updating an some
+ // arbitrary useState hook. Then, during render, we call getSnapshot to read
+ // the current value.
+ //
+ // Because we don't actually use the state returned by the useState hook, we
+ // can save a bit of memory by storing other stuff in that slot.
+ //
+ // To implement the early bailout, we need to track some things on a mutable
+ // object. Usually, we would put that in a useRef hook, but we can stash it in
+ // our useState hook instead.
+ //
+ // To force a re-render, we call forceUpdate({inst}). That works because the
+ // new object always fails an equality check.
-/** Used to detect host constructors (Safari). */
-var reIsHostCtor = /^\[object .+?Constructor\]$/;
-/** Used to detect octal string values. */
-var reIsOctal = /^0o[0-7]+$/i;
+ var _useState = useState({
+ inst: {
+ value: value,
+ getSnapshot: getSnapshot
+ }
+ }),
+ inst = _useState[0].inst,
+ forceUpdate = _useState[1]; // Track the latest getSnapshot function with a ref. This needs to be updated
+ // in the layout phase so we can access it during the tearing check that
+ // happens on subscribe.
-/** Used to detect unsigned integer values. */
-var reIsUint = /^(?:0|[1-9]\d*)$/;
-/** Built-in method references without a dependency on `root`. */
-var freeParseInt = parseInt;
+ useLayoutEffect(function () {
+ inst.value = value;
+ inst.getSnapshot = getSnapshot; // Whenever getSnapshot or subscribe changes, we need to check in the
+ // commit phase if there was an interleaved mutation. In concurrent mode
+ // this can happen all the time, but even in synchronous mode, an earlier
+ // effect may have mutated the store.
-/** Detect free variable `global` from Node.js. */
-var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g && __webpack_require__.g.Object === Object && __webpack_require__.g;
+ if (checkIfSnapshotChanged(inst)) {
+ // Force a re-render.
+ forceUpdate({
+ inst: inst
+ });
+ }
+ }, [subscribe, value, getSnapshot]);
+ useEffect(function () {
+ // Check for changes right before subscribing. Subsequent changes will be
+ // detected in the subscription handler.
+ if (checkIfSnapshotChanged(inst)) {
+ // Force a re-render.
+ forceUpdate({
+ inst: inst
+ });
+ }
-/** Detect free variable `self`. */
-var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
+ var handleStoreChange = function () {
+ // TODO: Because there is no cross-renderer API for batching updates, it's
+ // up to the consumer of this library to wrap their subscription event
+ // with unstable_batchedUpdates. Should we try to detect when this isn't
+ // the case and print a warning in development?
+ // The store changed. Check if the snapshot changed since the last time we
+ // read from the store.
+ if (checkIfSnapshotChanged(inst)) {
+ // Force a re-render.
+ forceUpdate({
+ inst: inst
+ });
+ }
+ }; // Subscribe to the store and return a clean-up function.
-/** Used as a reference to the global object. */
-var root = freeGlobal || freeSelf || Function('return this')();
-/**
- * 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);
+ return subscribe(handleStoreChange);
+ }, [subscribe]);
+ useDebugValue(value);
+ return value;
}
-/**
- * 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 ? array.length : 0;
+function checkIfSnapshotChanged(inst) {
+ var latestGetSnapshot = inst.getSnapshot;
+ var prevValue = inst.value;
- while (++index < length) {
- if (iteratee(array[index], index, array) === false) {
- break;
- }
+ try {
+ var nextValue = latestGetSnapshot();
+ return !objectIs(prevValue, nextValue);
+ } catch (error) {
+ return true;
}
- return array;
}
-/**
- * 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 ? array.length : 0;
- return !!length && baseIndexOf(array, value, 0) > -1;
+function useSyncExternalStore$1(subscribe, getSnapshot, getServerSnapshot) {
+ // Note: The shim does not use getServerSnapshot, because pre-18 versions of
+ // React do not expose a way to check if we're hydrating. So users of the shim
+ // will need to track that themselves and return the correct value
+ // from `getSnapshot`.
+ return getSnapshot();
}
-/**
- * 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;
-}
+var canUseDOM = !!(typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined');
-/**
- * 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) {
- if (value !== value) {
- return baseFindIndex(array, baseIsNaN, fromIndex);
- }
- var index = fromIndex - 1,
- length = array.length;
+var isServerEnvironment = !canUseDOM;
- while (++index < length) {
- if (array[index] === value) {
- return index;
- }
- }
- return -1;
-}
+var shim = isServerEnvironment ? useSyncExternalStore$1 : useSyncExternalStore;
+var useSyncExternalStore$2 = React.useSyncExternalStore !== undefined ? React.useSyncExternalStore : shim;
-/**
- * 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;
+exports.useSyncExternalStore = useSyncExternalStore$2;
+ /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
+if (
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop ===
+ 'function'
+) {
+ __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());
+}
+
+ })();
}
-/**
- * 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;
-}
+/***/ }),
+/***/ "./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim/with-selector.development.js":
+/*!************************************************************************************************************!*\
+ !*** ./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim/with-selector.development.js ***!
+ \************************************************************************************************************/
+/***/ (function(__unused_webpack_module, exports, __webpack_require__) {
+
+"use strict";
/**
- * Gets the value at `key` of `object`.
+ * @license React
+ * use-sync-external-store-shim/with-selector.development.js
*
- * @private
- * @param {Object} [object] The object to query.
- * @param {string} key The key of the property to get.
- * @returns {*} Returns the property value.
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
*/
-function getValue(object, key) {
- return object == null ? undefined : object[key];
+
+
+
+if (true) {
+ (function() {
+
+ 'use strict';
+
+/* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
+if (
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart ===
+ 'function'
+) {
+ __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(new Error());
}
+ var React = __webpack_require__(/*! react */ "react");
+var shim = __webpack_require__(/*! use-sync-external-store/shim */ "./node_modules/use-sync-external-store/shim/index.js");
/**
- * Checks if `value` is a host object in IE < 9.
- *
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a host object, else `false`.
+ * inlined Object.is polyfill to avoid requiring consumers ship their own
+ * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
*/
-function isHostObject(value) {
- // Many host objects are `Object` objects that can coerce to strings
- // despite having improperly defined `toString` methods.
- var result = false;
- if (value != null && typeof value.toString != 'function') {
- try {
- result = !!(value + '');
- } catch (e) {}
- }
- return result;
+function is(x, y) {
+ return x === y && (x !== 0 || 1 / x === 1 / y) || x !== x && y !== y // eslint-disable-line no-self-compare
+ ;
}
-/**
- * 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 = [];
+var objectIs = typeof Object.is === 'function' ? Object.is : is;
- while (++index < length) {
- var value = array[index];
- if (value === placeholder || value === PLACEHOLDER) {
- array[index] = PLACEHOLDER;
- result[resIndex++] = index;
- }
+var useSyncExternalStore = shim.useSyncExternalStore;
+
+// for CommonJS interop.
+
+var useRef = React.useRef,
+ useEffect = React.useEffect,
+ useMemo = React.useMemo,
+ useDebugValue = React.useDebugValue; // Same as useSyncExternalStore, but supports selector and isEqual arguments.
+
+function useSyncExternalStoreWithSelector(subscribe, getSnapshot, getServerSnapshot, selector, isEqual) {
+ // Use this to track the rendered snapshot.
+ var instRef = useRef(null);
+ var inst;
+
+ if (instRef.current === null) {
+ inst = {
+ hasValue: false,
+ value: null
+ };
+ instRef.current = inst;
+ } else {
+ inst = instRef.current;
}
- return result;
-}
-/** Used for built-in method references. */
-var funcProto = Function.prototype,
- objectProto = Object.prototype;
+ var _useMemo = useMemo(function () {
+ // Track the memoized state using closure variables that are local to this
+ // memoized instance of a getSnapshot function. Intentionally not using a
+ // useRef hook, because that state would be shared across all concurrent
+ // copies of the hook/component.
+ var hasMemo = false;
+ var memoizedSnapshot;
+ var memoizedSelection;
-/** Used to detect overreaching core-js shims. */
-var coreJsData = root['__core-js_shared__'];
+ var memoizedSelector = function (nextSnapshot) {
+ if (!hasMemo) {
+ // The first time the hook is called, there is no memoized result.
+ hasMemo = true;
+ memoizedSnapshot = nextSnapshot;
-/** 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) : '';
-}());
+ var _nextSelection = selector(nextSnapshot);
-/** Used to resolve the decompiled source of functions. */
-var funcToString = funcProto.toString;
+ if (isEqual !== undefined) {
+ // Even if the selector has changed, the currently rendered selection
+ // may be equal to the new selection. We should attempt to reuse the
+ // current value if possible, to preserve downstream memoizations.
+ if (inst.hasValue) {
+ var currentSelection = inst.value;
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+ if (isEqual(currentSelection, _nextSelection)) {
+ memoizedSelection = currentSelection;
+ return currentSelection;
+ }
+ }
+ }
-/**
- * Used to resolve the
- * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
- * of values.
- */
-var objectToString = objectProto.toString;
+ memoizedSelection = _nextSelection;
+ return _nextSelection;
+ } // We may be able to reuse the previous invocation's result.
-/** 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 objectCreate = Object.create;
+ // We may be able to reuse the previous invocation's result.
+ var prevSnapshot = memoizedSnapshot;
+ var prevSelection = memoizedSelection;
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeMax = Math.max,
- nativeMin = Math.min;
+ if (objectIs(prevSnapshot, nextSnapshot)) {
+ // The snapshot is the same as last time. Reuse the previous selection.
+ return prevSelection;
+ } // The snapshot has changed, so we need to compute a new selection.
-/* Used to set `toString` methods. */
-var defineProperty = (function() {
- var func = getNative(Object, 'defineProperty'),
- name = getNative.name;
- return (name && name.length > 2) ? func : undefined;
-}());
+ // The snapshot has changed, so we need to compute a new selection.
+ var nextSelection = selector(nextSnapshot); // If a custom isEqual function is provided, use that to check if the data
+ // has changed. If it hasn't, return the previous selection. That signals
+ // to React that the selections are conceptually equal, and we can bail
+ // out of rendering.
-/**
- * The base implementation of `_.create` without support for assigning
- * properties to the created object.
- *
- * @private
- * @param {Object} prototype The object to inherit from.
- * @returns {Object} Returns the new object.
- */
-function baseCreate(proto) {
- return isObject(proto) ? objectCreate(proto) : {};
+ // If a custom isEqual function is provided, use that to check if the data
+ // has changed. If it hasn't, return the previous selection. That signals
+ // to React that the selections are conceptually equal, and we can bail
+ // out of rendering.
+ if (isEqual !== undefined && isEqual(prevSelection, nextSelection)) {
+ return prevSelection;
+ }
+
+ memoizedSnapshot = nextSnapshot;
+ memoizedSelection = nextSelection;
+ return nextSelection;
+ }; // Assigning this to a constant so that Flow knows it can't change.
+
+
+ // Assigning this to a constant so that Flow knows it can't change.
+ var maybeGetServerSnapshot = getServerSnapshot === undefined ? null : getServerSnapshot;
+
+ var getSnapshotWithSelector = function () {
+ return memoizedSelector(getSnapshot());
+ };
+
+ var getServerSnapshotWithSelector = maybeGetServerSnapshot === null ? undefined : function () {
+ return memoizedSelector(maybeGetServerSnapshot());
+ };
+ return [getSnapshotWithSelector, getServerSnapshotWithSelector];
+ }, [getSnapshot, getServerSnapshot, selector, isEqual]),
+ getSelection = _useMemo[0],
+ getServerSelection = _useMemo[1];
+
+ var value = useSyncExternalStore(subscribe, getSelection, getServerSelection);
+ useEffect(function () {
+ inst.hasValue = true;
+ inst.value = value;
+ }, [value]);
+ useDebugValue(value);
+ return value;
}
-/**
- * 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) || isHostObject(value)) ? reIsNative : reIsHostCtor;
- return pattern.test(toSource(value));
+exports.useSyncExternalStoreWithSelector = useSyncExternalStoreWithSelector;
+ /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */
+if (
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ !== 'undefined' &&
+ typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop ===
+ 'function'
+) {
+ __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(new Error());
+}
+
+ })();
}
-/**
- * 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;
+/***/ "./node_modules/use-sync-external-store/shim/index.js":
+/*!************************************************************!*\
+ !*** ./node_modules/use-sync-external-store/shim/index.js ***!
+ \************************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- 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;
-}
+"use strict";
-/**
- * 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;
+if (false) {} else {
+ module.exports = __webpack_require__(/*! ../cjs/use-sync-external-store-shim.development.js */ "./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim.development.js");
}
-/**
- * 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 & 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 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);
+/***/ "./node_modules/use-sync-external-store/shim/with-selector.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/use-sync-external-store/shim/with-selector.js ***!
+ \********************************************************************/
+/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
- // Mimic the constructor's `return` behavior.
- // See https://es5.github.io/#x13.2.2 for more details.
- return isObject(result) ? result : thisBinding;
- };
+"use strict";
+
+
+if (false) {} else {
+ module.exports = __webpack_require__(/*! ../cjs/use-sync-external-store-shim/with-selector.development.js */ "./node_modules/use-sync-external-store/cjs/use-sync-external-store-shim/with-selector.development.js");
}
-/**
- * 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);
+/***/ "prop-types":
+/*!****************************!*\
+ !*** external "PropTypes" ***!
+ \****************************/
+/***/ (function(module) {
- 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;
+"use strict";
+module.exports = window["PropTypes"];
+
+/***/ }),
+
+/***/ "react":
+/*!************************!*\
+ !*** external "React" ***!
+ \************************/
+/***/ (function(module) {
+
+"use strict";
+module.exports = window["React"];
+
+/***/ }),
+
+/***/ "react-dom":
+/*!***************************!*\
+ !*** external "ReactDOM" ***!
+ \***************************/
+/***/ (function(module) {
+
+"use strict";
+module.exports = window["ReactDOM"];
+
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js":
+/*!*********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js ***!
+ \*********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arrayLikeToArray; }
+/* harmony export */ });
+function _arrayLikeToArray(arr, len) {
+ if (len == null || len > arr.length) len = arr.length;
+ for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
+ return arr2;
+}
+
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js ***!
+ \*******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arrayWithHoles; }
+/* harmony export */ });
+function _arrayWithHoles(arr) {
+ if (Array.isArray(arr)) return arr;
}
-/**
- * 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 & ARY_FLAG,
- isBind = bitmask & BIND_FLAG,
- isBindKey = bitmask & BIND_KEY_FLAG,
- isCurried = bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG),
- isFlip = bitmask & FLIP_FLAG,
- Ctor = isBindKey ? undefined : createCtor(func);
+/***/ }),
- function wrapper() {
- var length = arguments.length,
- args = Array(length),
- index = length;
+/***/ "./node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js ***!
+ \**********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arrayWithoutHoles; }
+/* harmony export */ });
+/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
- 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;
+function _arrayWithoutHoles(arr) {
+ if (Array.isArray(arr)) return (0,_arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__["default"])(arr);
}
-/**
- * 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 & 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;
+/***/ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js":
+/*!**************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js ***!
+ \**************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- while (++leftIndex < leftLength) {
- args[leftIndex] = partials[leftIndex];
- }
- while (argsLength--) {
- args[leftIndex++] = arguments[++argsIndex];
- }
- return apply(fn, isBind ? thisArg : this, args);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _assertThisInitialized; }
+/* harmony export */ });
+function _assertThisInitialized(self) {
+ if (self === void 0) {
+ throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
}
- return wrapper;
+ return self;
}
-/**
- * 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 & CURRY_FLAG,
- newHolders = isCurry ? holders : undefined,
- newHoldersRight = isCurry ? undefined : holders,
- newPartials = isCurry ? partials : undefined,
- newPartialsRight = isCurry ? undefined : partials;
+/***/ }),
- bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
- bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);
+/***/ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/classCallCheck.js ***!
+ \*******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- if (!(bitmask & CURRY_BOUND_FLAG)) {
- bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _classCallCheck; }
+/* harmony export */ });
+function _classCallCheck(instance, Constructor) {
+ if (!(instance instanceof Constructor)) {
+ throw new TypeError("Cannot call a class as a function");
}
-
- var result = wrapFunc(func, bitmask, thisArg, newPartials, newHolders, newPartialsRight, newHoldersRight, argPos, ary, arity);
- result.placeholder = placeholder;
- return setWrapToString(result, func, bitmask);
}
-/**
- * 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.
- * The bitmask may be composed of the following 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 & BIND_KEY_FLAG;
- if (!isBindKey && typeof func != 'function') {
- throw new TypeError(FUNC_ERROR_TEXT);
- }
- var length = partials ? partials.length : 0;
- if (!length) {
- bitmask &= ~(PARTIAL_FLAG | 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 & PARTIAL_RIGHT_FLAG) {
- var partialsRight = partials,
- holdersRight = holders;
+/***/ "./node_modules/@babel/runtime/helpers/esm/createClass.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/createClass.js ***!
+ \****************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- partials = holders = undefined;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _createClass; }
+/* harmony export */ });
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "./node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+
+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, (0,_toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__["default"])(descriptor.key), descriptor);
}
+}
+function _createClass(Constructor, protoProps, staticProps) {
+ if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+ if (staticProps) _defineProperties(Constructor, staticProps);
+ Object.defineProperty(Constructor, "prototype", {
+ writable: false
+ });
+ return Constructor;
+}
- var newData = [
- func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
- argPos, ary, arity
- ];
+/***/ }),
- func = newData[0];
- bitmask = newData[1];
- thisArg = newData[2];
- partials = newData[3];
- holders = newData[4];
- arity = newData[9] = newData[9] == null
- ? (isBindKey ? 0 : func.length)
- : nativeMax(newData[9] - length, 0);
+/***/ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/defineProperty.js ***!
+ \*******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- if (!arity && bitmask & (CURRY_FLAG | CURRY_RIGHT_FLAG)) {
- bitmask &= ~(CURRY_FLAG | CURRY_RIGHT_FLAG);
- }
- if (!bitmask || bitmask == BIND_FLAG) {
- var result = createBind(func, bitmask, thisArg);
- } else if (bitmask == CURRY_FLAG || bitmask == CURRY_RIGHT_FLAG) {
- result = createCurry(func, bitmask, arity);
- } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !holders.length) {
- result = createPartial(func, bitmask, thisArg, partials);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _defineProperty; }
+/* harmony export */ });
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "./node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+
+function _defineProperty(obj, key, value) {
+ key = (0,_toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__["default"])(key);
+ if (key in obj) {
+ Object.defineProperty(obj, key, {
+ value: value,
+ enumerable: true,
+ configurable: true,
+ writable: true
+ });
} else {
- result = createHybrid.apply(undefined, newData);
+ obj[key] = value;
}
- return setWrapToString(result, func, bitmask);
+ return obj;
}
-/**
- * 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 = func;
- return object.placeholder;
-}
+/***/ }),
-/**
- * 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;
-}
+/***/ "./node_modules/@babel/runtime/helpers/esm/extends.js":
+/*!************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/extends.js ***!
+ \************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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) : [];
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _extends; }
+/* harmony export */ });
+function _extends() {
+ _extends = Object.assign ? Object.assign.bind() : function (target) {
+ for (var i = 1; i < arguments.length; i++) {
+ var source = arguments[i];
+ for (var key in source) {
+ if (Object.prototype.hasOwnProperty.call(source, key)) {
+ target[key] = source[key];
+ }
+ }
+ }
+ return target;
+ };
+ return _extends.apply(this, arguments);
}
-/**
- * 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,
- lastIndex = length - 1;
+/***/ }),
- details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];
- details = details.join(length > 2 ? ', ' : ' ');
- return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n');
+/***/ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js ***!
+ \*******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _getPrototypeOf; }
+/* harmony export */ });
+function _getPrototypeOf(o) {
+ _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf.bind() : function _getPrototypeOf(o) {
+ return o.__proto__ || Object.getPrototypeOf(o);
+ };
+ return _getPrototypeOf(o);
}
-/**
- * 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);
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/inherits.js":
+/*!*************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/inherits.js ***!
+ \*************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _inherits; }
+/* harmony export */ });
+/* harmony import */ var _setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./setPrototypeOf.js */ "./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js");
+
+function _inherits(subClass, superClass) {
+ if (typeof superClass !== "function" && superClass !== null) {
+ throw new TypeError("Super expression must either be null or a function");
+ }
+ subClass.prototype = Object.create(superClass && superClass.prototype, {
+ constructor: {
+ value: subClass,
+ writable: true,
+ configurable: true
+ }
+ });
+ Object.defineProperty(subClass, "prototype", {
+ writable: false
+ });
+ if (superClass) (0,_setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__["default"])(subClass, superClass);
}
-/**
- * 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);
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/iterableToArray.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/iterableToArray.js ***!
+ \********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _iterableToArray; }
+/* harmony export */ });
+function _iterableToArray(iter) {
+ if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
}
-/**
- * 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;
+/***/ "./node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js":
+/*!*************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js ***!
+ \*************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _iterableToArrayLimit; }
+/* harmony export */ });
+function _iterableToArrayLimit(arr, i) {
+ var _i = null == arr ? null : "undefined" != typeof Symbol && arr[Symbol.iterator] || arr["@@iterator"];
+ if (null != _i) {
+ var _s,
+ _e,
+ _x,
+ _r,
+ _arr = [],
+ _n = !0,
+ _d = !1;
+ try {
+ if (_x = (_i = _i.call(arr)).next, 0 === i) {
+ if (Object(_i) !== _i) return;
+ _n = !1;
+ } else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0);
+ } catch (err) {
+ _d = !0, _e = err;
+ } finally {
+ try {
+ if (!_n && null != _i["return"] && (_r = _i["return"](), Object(_r) !== _r)) return;
+ } finally {
+ if (_d) throw _e;
+ }
+ }
+ return _arr;
}
- return array;
}
-/**
- * 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`.
- */
-var setWrapToString = !defineProperty ? identity : function(wrapper, reference, bitmask) {
- var source = (reference + '');
- return defineProperty(wrapper, 'toString', {
- 'configurable': true,
- 'enumerable': false,
- 'value': constant(insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)))
- });
-};
+/***/ }),
-/**
- * Converts `func` to its source code.
- *
- * @private
- * @param {Function} func The function to process.
- * @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 '';
-}
+/***/ "./node_modules/@babel/runtime/helpers/esm/nonIterableRest.js":
+/*!********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/nonIterableRest.js ***!
+ \********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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();
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _nonIterableRest; }
+/* harmony export */ });
+function _nonIterableRest() {
+ throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
}
-/**
- * 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, CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
- result.placeholder = curry.placeholder;
- return result;
-}
+/***/ }),
-/**
- * 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) {
- // The use of `Object#toString` avoids issues with the `typeof` operator
- // in Safari 8-9 which returns 'object' for typed array and other constructors.
- var tag = isObject(value) ? objectToString.call(value) : '';
- return tag == funcTag || tag == genTag;
-}
+/***/ "./node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js ***!
+ \**********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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 && (type == 'object' || type == 'function');
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _nonIterableSpread; }
+/* harmony export */ });
+function _nonIterableSpread() {
+ throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
}
-/**
- * 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 && typeof value == 'object';
-}
+/***/ }),
-/**
- * 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) && objectToString.call(value) == symbolTag);
-}
+/***/ "./node_modules/@babel/runtime/helpers/esm/objectSpread2.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/objectSpread2.js ***!
+ \******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _objectSpread2; }
+/* harmony export */ });
+/* harmony import */ var _defineProperty_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./defineProperty.js */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+
+function ownKeys(object, enumerableOnly) {
+ var keys = Object.keys(object);
+ if (Object.getOwnPropertySymbols) {
+ var symbols = Object.getOwnPropertySymbols(object);
+ enumerableOnly && (symbols = symbols.filter(function (sym) {
+ return Object.getOwnPropertyDescriptor(object, sym).enumerable;
+ })), keys.push.apply(keys, symbols);
}
- value = toNumber(value);
- if (value === INFINITY || value === -INFINITY) {
- var sign = (value < 0 ? -1 : 1);
- return sign * MAX_INTEGER;
+ return keys;
+}
+function _objectSpread2(target) {
+ for (var i = 1; i < arguments.length; i++) {
+ var source = null != arguments[i] ? arguments[i] : {};
+ i % 2 ? ownKeys(Object(source), !0).forEach(function (key) {
+ (0,_defineProperty_js__WEBPACK_IMPORTED_MODULE_0__["default"])(target, key, source[key]);
+ }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) {
+ Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key));
+ });
}
- return value === value ? value : 0;
+ return target;
}
-/**
- * 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;
-}
+/***/ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js":
+/*!****************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js ***!
+ \****************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _objectWithoutProperties; }
+/* harmony export */ });
+/* harmony import */ var _objectWithoutPropertiesLoose_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./objectWithoutPropertiesLoose.js */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js");
+
+function _objectWithoutProperties(source, excluded) {
+ if (source == null) return {};
+ var target = (0,_objectWithoutPropertiesLoose_js__WEBPACK_IMPORTED_MODULE_0__["default"])(source, excluded);
+ var key, i;
+ if (Object.getOwnPropertySymbols) {
+ var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
+ for (i = 0; i < sourceSymbolKeys.length; i++) {
+ key = sourceSymbolKeys[i];
+ if (excluded.indexOf(key) >= 0) continue;
+ if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
+ target[key] = source[key];
+ }
}
- if (isObject(value)) {
- var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
- value = isObject(other) ? (other + '') : other;
+ return target;
+}
+
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js":
+/*!*********************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/objectWithoutPropertiesLoose.js ***!
+ \*********************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _objectWithoutPropertiesLoose; }
+/* harmony export */ });
+function _objectWithoutPropertiesLoose(source, excluded) {
+ if (source == null) return {};
+ var target = {};
+ var sourceKeys = Object.keys(source);
+ var key, i;
+ for (i = 0; i < sourceKeys.length; i++) {
+ key = sourceKeys[i];
+ if (excluded.indexOf(key) >= 0) continue;
+ target[key] = source[key];
}
- if (typeof value != 'string') {
- return value === 0 ? value : +value;
+ return target;
+}
+
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js":
+/*!******************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js ***!
+ \******************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _possibleConstructorReturn; }
+/* harmony export */ });
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "./node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assertThisInitialized.js */ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+
+
+function _possibleConstructorReturn(self, call) {
+ if (call && ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(call) === "object" || typeof call === "function")) {
+ return call;
+ } else if (call !== void 0) {
+ throw new TypeError("Derived constructors may only return object or undefined");
}
- 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);
+ return (0,_assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__["default"])(self);
}
-/**
- * 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;
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js":
+/*!*******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js ***!
+ \*******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _setPrototypeOf; }
+/* harmony export */ });
+function _setPrototypeOf(o, p) {
+ _setPrototypeOf = Object.setPrototypeOf ? Object.setPrototypeOf.bind() : function _setPrototypeOf(o, p) {
+ o.__proto__ = p;
+ return o;
};
+ return _setPrototypeOf(o, p);
}
-/**
- * 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;
-}
+/***/ }),
+
+/***/ "./node_modules/@babel/runtime/helpers/esm/slicedToArray.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/slicedToArray.js ***!
+ \******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _slicedToArray; }
+/* harmony export */ });
+/* harmony import */ var _arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithHoles.js */ "./node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js");
+/* harmony import */ var _iterableToArrayLimit_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArrayLimit.js */ "./node_modules/@babel/runtime/helpers/esm/iterableToArrayLimit.js");
+/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
+/* harmony import */ var _nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableRest.js */ "./node_modules/@babel/runtime/helpers/esm/nonIterableRest.js");
+
-// Assign default placeholders.
-curry.placeholder = {};
-module.exports = curry;
+function _slicedToArray(arr, i) {
+ return (0,_arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__["default"])(arr) || (0,_iterableToArrayLimit_js__WEBPACK_IMPORTED_MODULE_1__["default"])(arr, i) || (0,_unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__["default"])(arr, i) || (0,_nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__["default"])();
+}
/***/ }),
-/***/ "./node_modules/lodash/_DataView.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_DataView.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js":
+/*!**********************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js ***!
+ \**********************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
- root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _toConsumableArray; }
+/* harmony export */ });
+/* harmony import */ var _arrayWithoutHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithoutHoles.js */ "./node_modules/@babel/runtime/helpers/esm/arrayWithoutHoles.js");
+/* harmony import */ var _iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArray.js */ "./node_modules/@babel/runtime/helpers/esm/iterableToArray.js");
+/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
+/* harmony import */ var _nonIterableSpread_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableSpread.js */ "./node_modules/@babel/runtime/helpers/esm/nonIterableSpread.js");
-/* Built-in method references that are verified to be native. */
-var DataView = getNative(root, 'DataView');
-module.exports = DataView;
-/***/ }),
+function _toConsumableArray(arr) {
+ return (0,_arrayWithoutHoles_js__WEBPACK_IMPORTED_MODULE_0__["default"])(arr) || (0,_iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(arr) || (0,_unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__["default"])(arr) || (0,_nonIterableSpread_js__WEBPACK_IMPORTED_MODULE_3__["default"])();
+}
-/***/ "./node_modules/lodash/_Hash.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/_Hash.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ }),
-var hashClear = __webpack_require__(/*! ./_hashClear */ "./node_modules/lodash/_hashClear.js"),
- hashDelete = __webpack_require__(/*! ./_hashDelete */ "./node_modules/lodash/_hashDelete.js"),
- hashGet = __webpack_require__(/*! ./_hashGet */ "./node_modules/lodash/_hashGet.js"),
- hashHas = __webpack_require__(/*! ./_hashHas */ "./node_modules/lodash/_hashHas.js"),
- hashSet = __webpack_require__(/*! ./_hashSet */ "./node_modules/lodash/_hashSet.js");
+/***/ "./node_modules/@babel/runtime/helpers/esm/toPrimitive.js":
+/*!****************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/toPrimitive.js ***!
+ \****************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _toPrimitive; }
+/* harmony export */ });
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "./node_modules/@babel/runtime/helpers/esm/typeof.js");
- this.clear();
- while (++index < length) {
- var entry = entries[index];
- this.set(entry[0], entry[1]);
+function _toPrimitive(input, hint) {
+ if ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(input) !== "object" || input === null) return input;
+ var prim = input[Symbol.toPrimitive];
+ if (prim !== undefined) {
+ var res = prim.call(input, hint || "default");
+ if ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(res) !== "object") return res;
+ throw new TypeError("@@toPrimitive must return a primitive value.");
}
+ return (hint === "string" ? String : Number)(input);
}
-// Add methods to `Hash`.
-Hash.prototype.clear = hashClear;
-Hash.prototype['delete'] = hashDelete;
-Hash.prototype.get = hashGet;
-Hash.prototype.has = hashHas;
-Hash.prototype.set = hashSet;
-
-module.exports = Hash;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_ListCache.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_ListCache.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/@babel/runtime/helpers/esm/toPropertyKey.js":
+/*!******************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/toPropertyKey.js ***!
+ \******************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var listCacheClear = __webpack_require__(/*! ./_listCacheClear */ "./node_modules/lodash/_listCacheClear.js"),
- listCacheDelete = __webpack_require__(/*! ./_listCacheDelete */ "./node_modules/lodash/_listCacheDelete.js"),
- listCacheGet = __webpack_require__(/*! ./_listCacheGet */ "./node_modules/lodash/_listCacheGet.js"),
- listCacheHas = __webpack_require__(/*! ./_listCacheHas */ "./node_modules/lodash/_listCacheHas.js"),
- listCacheSet = __webpack_require__(/*! ./_listCacheSet */ "./node_modules/lodash/_listCacheSet.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _toPropertyKey; }
+/* harmony export */ });
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "./node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toPrimitive.js */ "./node_modules/@babel/runtime/helpers/esm/toPrimitive.js");
-/**
- * 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]);
- }
+function _toPropertyKey(arg) {
+ var key = (0,_toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__["default"])(arg, "string");
+ return (0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(key) === "symbol" ? key : String(key);
}
-// Add methods to `ListCache`.
-ListCache.prototype.clear = listCacheClear;
-ListCache.prototype['delete'] = listCacheDelete;
-ListCache.prototype.get = listCacheGet;
-ListCache.prototype.has = listCacheHas;
-ListCache.prototype.set = listCacheSet;
+/***/ }),
-module.exports = ListCache;
+/***/ "./node_modules/@babel/runtime/helpers/esm/typeof.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/typeof.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _typeof; }
+/* harmony export */ });
+function _typeof(obj) {
+ "@babel/helpers - typeof";
+ return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+ return typeof obj;
+ } : function (obj) {
+ return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+ }, _typeof(obj);
+}
/***/ }),
-/***/ "./node_modules/lodash/_Map.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/_Map.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js":
+/*!*******************************************************************************!*\
+ !*** ./node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js ***!
+ \*******************************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
- root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _unsupportedIterableToArray; }
+/* harmony export */ });
+/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "./node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
-/* Built-in method references that are verified to be native. */
-var Map = getNative(root, 'Map');
+function _unsupportedIterableToArray(o, minLen) {
+ if (!o) return;
+ if (typeof o === "string") return (0,_arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__["default"])(o, minLen);
+ var n = Object.prototype.toString.call(o).slice(8, -1);
+ if (n === "Object" && o.constructor) n = o.constructor.name;
+ if (n === "Map" || n === "Set") return Array.from(o);
+ if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return (0,_arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__["default"])(o, minLen);
+}
-module.exports = Map;
+/***/ }),
+/***/ "./node_modules/ramda/es/addIndex.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/addIndex.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_concat_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_concat.js */ "./node_modules/ramda/es/internal/_concat.js");
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _curryN_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./curryN.js */ "./node_modules/ramda/es/curryN.js");
-/***/ "./node_modules/lodash/_MapCache.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_MapCache.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var mapCacheClear = __webpack_require__(/*! ./_mapCacheClear */ "./node_modules/lodash/_mapCacheClear.js"),
- mapCacheDelete = __webpack_require__(/*! ./_mapCacheDelete */ "./node_modules/lodash/_mapCacheDelete.js"),
- mapCacheGet = __webpack_require__(/*! ./_mapCacheGet */ "./node_modules/lodash/_mapCacheGet.js"),
- mapCacheHas = __webpack_require__(/*! ./_mapCacheHas */ "./node_modules/lodash/_mapCacheHas.js"),
- mapCacheSet = __webpack_require__(/*! ./_mapCacheSet */ "./node_modules/lodash/_mapCacheSet.js");
/**
- * Creates a map cache object to store key-value pairs.
+ * Creates a new list iteration function from an existing one by adding two new
+ * parameters to its callback function: the current index, and the entire list.
*
- * @private
- * @constructor
- * @param {Array} [entries] The key-value pairs to cache.
+ * This would turn, for instance, [`R.map`](#map) function into one that
+ * more closely resembles `Array.prototype.map`. Note that this will only work
+ * for functions in which the iteration callback function is the first
+ * parameter, and where the list is the last parameter. (This latter might be
+ * unimportant if the list parameter is not used.)
+ *
+ * @func
+ * @memberOf R
+ * @since v0.15.0
+ * @category Function
+ * @category List
+ * @sig (((a ...) -> b) ... -> [a] -> *) -> (((a ..., Int, [a]) -> b) ... -> [a] -> *)
+ * @param {Function} fn A list iteration function that does not pass index or list to its callback
+ * @return {Function} An altered list iteration function that passes (item, index, list) to its callback
+ * @example
+ *
+ * const mapIndexed = R.addIndex(R.map);
+ * mapIndexed((val, idx) => idx + '-' + val, ['f', 'o', 'o', 'b', 'a', 'r']);
+ * //=> ['0-f', '1-o', '2-o', '3-b', '4-a', '5-r']
*/
-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]);
- }
-}
-
-// Add methods to `MapCache`.
-MapCache.prototype.clear = mapCacheClear;
-MapCache.prototype['delete'] = mapCacheDelete;
-MapCache.prototype.get = mapCacheGet;
-MapCache.prototype.has = mapCacheHas;
-MapCache.prototype.set = mapCacheSet;
-
-module.exports = MapCache;
+var addIndex = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function addIndex(fn) {
+ return (0,_curryN_js__WEBPACK_IMPORTED_MODULE_1__["default"])(fn.length, function () {
+ var idx = 0;
+ var origFn = arguments[0];
+ var list = arguments[arguments.length - 1];
+ var args = Array.prototype.slice.call(arguments, 0);
+ args[0] = function () {
+ var result = origFn.apply(this, (0,_internal_concat_js__WEBPACK_IMPORTED_MODULE_2__["default"])(arguments, [idx, list]));
+ idx += 1;
+ return result;
+ };
+ return fn.apply(this, args);
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (addIndex);
/***/ }),
-/***/ "./node_modules/lodash/_Promise.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_Promise.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
- root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
-
-/* Built-in method references that are verified to be native. */
-var Promise = getNative(root, 'Promise');
-
-module.exports = Promise;
-
-
-/***/ }),
+/***/ "./node_modules/ramda/es/all.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/all.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ "./node_modules/lodash/_Set.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/_Set.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xall_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xall.js */ "./node_modules/ramda/es/internal/_xall.js");
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
- root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
-/* Built-in method references that are verified to be native. */
-var Set = getNative(root, 'Set');
-module.exports = Set;
+/**
+ * Returns `true` if all elements of the list match the predicate, `false` if
+ * there are any that don't.
+ *
+ * Dispatches to the `all` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig (a -> Boolean) -> [a] -> Boolean
+ * @param {Function} fn The predicate function.
+ * @param {Array} list The array to consider.
+ * @return {Boolean} `true` if the predicate is satisfied by every element, `false`
+ * otherwise.
+ * @see R.any, R.none, R.transduce
+ * @example
+ *
+ * const equals3 = R.equals(3);
+ * R.all(equals3)([3, 3, 3, 3]); //=> true
+ * R.all(equals3)([3, 3, 1, 3]); //=> false
+ */
+var all = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['all'], _internal_xall_js__WEBPACK_IMPORTED_MODULE_2__["default"], function all(fn, list) {
+ var idx = 0;
+ while (idx < list.length) {
+ if (!fn(list[idx])) {
+ return false;
+ }
+ idx += 1;
+ }
+ return true;
+}));
+/* harmony default export */ __webpack_exports__["default"] = (all);
/***/ }),
-/***/ "./node_modules/lodash/_SetCache.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_SetCache.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/always.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/always.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js"),
- setCacheAdd = __webpack_require__(/*! ./_setCacheAdd */ "./node_modules/lodash/_setCacheAdd.js"),
- setCacheHas = __webpack_require__(/*! ./_setCacheHas */ "./node_modules/lodash/_setCacheHas.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
/**
+ * Returns a function that always returns the given value. Note that for
+ * non-primitives the value returned is a reference to the original value.
*
- * Creates an array cache object to store unique values.
+ * This function is known as `const`, `constant`, or `K` (for K combinator) in
+ * other languages and libraries.
*
- * @private
- * @constructor
- * @param {Array} [values] The values to cache.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Function
+ * @sig a -> (* -> a)
+ * @param {*} val The value to wrap in a function
+ * @return {Function} A Function :: * -> val.
+ * @example
+ *
+ * const t = R.always('Tee');
+ * t(); //=> 'Tee'
*/
-function SetCache(values) {
- var index = -1,
- length = values == null ? 0 : values.length;
-
- this.__data__ = new MapCache;
- while (++index < length) {
- this.add(values[index]);
- }
-}
-// Add methods to `SetCache`.
-SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
-SetCache.prototype.has = setCacheHas;
+var always = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function always(val) {
+ return function () {
+ return val;
+ };
+});
+/* harmony default export */ __webpack_exports__["default"] = (always);
-module.exports = SetCache;
+/***/ }),
+/***/ "./node_modules/ramda/es/any.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/any.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xany_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xany.js */ "./node_modules/ramda/es/internal/_xany.js");
-/***/ "./node_modules/lodash/_Stack.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/_Stack.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
- stackClear = __webpack_require__(/*! ./_stackClear */ "./node_modules/lodash/_stackClear.js"),
- stackDelete = __webpack_require__(/*! ./_stackDelete */ "./node_modules/lodash/_stackDelete.js"),
- stackGet = __webpack_require__(/*! ./_stackGet */ "./node_modules/lodash/_stackGet.js"),
- stackHas = __webpack_require__(/*! ./_stackHas */ "./node_modules/lodash/_stackHas.js"),
- stackSet = __webpack_require__(/*! ./_stackSet */ "./node_modules/lodash/_stackSet.js");
/**
- * Creates a stack cache object to store key-value pairs.
+ * Returns `true` if at least one of the elements of the list match the predicate,
+ * `false` otherwise.
*
- * @private
- * @constructor
- * @param {Array} [entries] The key-value pairs to cache.
+ * Dispatches to the `any` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig (a -> Boolean) -> [a] -> Boolean
+ * @param {Function} fn The predicate function.
+ * @param {Array} list The array to consider.
+ * @return {Boolean} `true` if the predicate is satisfied by at least one element, `false`
+ * otherwise.
+ * @see R.all, R.none, R.transduce
+ * @example
+ *
+ * const lessThan0 = R.flip(R.lt)(0);
+ * const lessThan2 = R.flip(R.lt)(2);
+ * R.any(lessThan0)([1, 2]); //=> false
+ * R.any(lessThan2)([1, 2]); //=> true
*/
-function Stack(entries) {
- var data = this.__data__ = new ListCache(entries);
- this.size = data.size;
-}
-// Add methods to `Stack`.
-Stack.prototype.clear = stackClear;
-Stack.prototype['delete'] = stackDelete;
-Stack.prototype.get = stackGet;
-Stack.prototype.has = stackHas;
-Stack.prototype.set = stackSet;
+var any = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['any'], _internal_xany_js__WEBPACK_IMPORTED_MODULE_2__["default"], function any(fn, list) {
+ var idx = 0;
+ while (idx < list.length) {
+ if (fn(list[idx])) {
+ return true;
+ }
+ idx += 1;
+ }
+ return false;
+}));
+/* harmony default export */ __webpack_exports__["default"] = (any);
-module.exports = Stack;
+/***/ }),
+/***/ "./node_modules/ramda/es/ap.js":
+/*!*************************************!*\
+ !*** ./node_modules/ramda/es/ap.js ***!
+ \*************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_concat_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_concat.js */ "./node_modules/ramda/es/internal/_concat.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_reduce_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_reduce.js */ "./node_modules/ramda/es/internal/_reduce.js");
+/* harmony import */ var _map_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./map.js */ "./node_modules/ramda/es/map.js");
-/***/ "./node_modules/lodash/_Symbol.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/_Symbol.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
-/** Built-in value references. */
-var Symbol = root.Symbol;
-module.exports = Symbol;
+/**
+ * ap applies a list of functions to a list of values.
+ *
+ * Dispatches to the `ap` method of the first argument, if present. Also
+ * treats curried functions as applicatives.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.3.0
+ * @category Function
+ * @sig [a -> b] -> [a] -> [b]
+ * @sig Apply f => f (a -> b) -> f a -> f b
+ * @sig (r -> a -> b) -> (r -> a) -> (r -> b)
+ * @param {*} applyF
+ * @param {*} applyX
+ * @return {*}
+ * @example
+ *
+ * R.ap([R.multiply(2), R.add(3)], [1,2,3]); //=> [2, 4, 6, 4, 5, 6]
+ * R.ap([R.concat('tasty '), R.toUpper], ['pizza', 'salad']); //=> ["tasty pizza", "tasty salad", "PIZZA", "SALAD"]
+ *
+ * // R.ap can also be used as S combinator
+ * // when only two functions are passed
+ * R.ap(R.concat, R.toUpper)('Ramda') //=> 'RamdaRAMDA'
+ * @symb R.ap([f, g], [a, b]) = [f(a), f(b), g(a), g(b)]
+ */
+var ap = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function ap(applyF, applyX) {
+ return typeof applyX['fantasy-land/ap'] === 'function' ? applyX['fantasy-land/ap'](applyF) : typeof applyF.ap === 'function' ? applyF.ap(applyX) : typeof applyF === 'function' ? function (x) {
+ return applyF(x)(applyX(x));
+ } : (0,_internal_reduce_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (acc, f) {
+ return (0,_internal_concat_js__WEBPACK_IMPORTED_MODULE_2__["default"])(acc, (0,_map_js__WEBPACK_IMPORTED_MODULE_3__["default"])(f, applyX));
+ }, [], applyF);
+});
+/* harmony default export */ __webpack_exports__["default"] = (ap);
/***/ }),
-/***/ "./node_modules/lodash/_Uint8Array.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_Uint8Array.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/append.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/append.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_concat_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_concat.js */ "./node_modules/ramda/es/internal/_concat.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-/** Built-in value references. */
-var Uint8Array = root.Uint8Array;
-module.exports = Uint8Array;
+/**
+ * Returns a new list containing the contents of the given list, followed by
+ * the given element.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig a -> [a] -> [a]
+ * @param {*} el The element to add to the end of the new list.
+ * @param {Array} list The list of elements to add a new item to.
+ * list.
+ * @return {Array} A new list containing the elements of the old list followed by `el`.
+ * @see R.prepend
+ * @example
+ *
+ * R.append('tests', ['write', 'more']); //=> ['write', 'more', 'tests']
+ * R.append('tests', []); //=> ['tests']
+ * R.append(['tests'], ['write', 'more']); //=> ['write', 'more', ['tests']]
+ */
+var append = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function append(el, list) {
+ return (0,_internal_concat_js__WEBPACK_IMPORTED_MODULE_1__["default"])(list, [el]);
+});
+/* harmony default export */ __webpack_exports__["default"] = (append);
/***/ }),
-/***/ "./node_modules/lodash/_WeakMap.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_WeakMap.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/assoc.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/assoc.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js"),
- root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _assocPath_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assocPath.js */ "./node_modules/ramda/es/assocPath.js");
-/* Built-in method references that are verified to be native. */
-var WeakMap = getNative(root, 'WeakMap');
-module.exports = WeakMap;
+/**
+ * Makes a shallow clone of an object, setting or overriding the specified
+ * property with the given value. Note that this copies and flattens prototype
+ * properties onto the new object as well. All non-primitive properties are
+ * copied by reference.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.8.0
+ * @category Object
+ * @typedefn Idx = String | Int
+ * @sig Idx -> a -> {k: v} -> {k: v}
+ * @param {String|Number} prop The property name to set
+ * @param {*} val The new value
+ * @param {Object} obj The object to clone
+ * @return {Object} A new object equivalent to the original except for the changed property.
+ * @see R.dissoc, R.pick
+ * @example
+ *
+ * R.assoc('c', 3, {a: 1, b: 2}); //=> {a: 1, b: 2, c: 3}
+ */
+var assoc = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function assoc(prop, val, obj) {
+ return (0,_assocPath_js__WEBPACK_IMPORTED_MODULE_1__["default"])([prop], val, obj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (assoc);
/***/ }),
-/***/ "./node_modules/lodash/_apply.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/_apply.js ***!
- \***************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/assocPath.js":
+/*!********************************************!*\
+ !*** ./node_modules/ramda/es/assocPath.js ***!
+ \********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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);
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _internal_isInteger_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
+/* harmony import */ var _internal_assoc_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_assoc.js */ "./node_modules/ramda/es/internal/_assoc.js");
+/* harmony import */ var _isNil_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./isNil.js */ "./node_modules/ramda/es/isNil.js");
-module.exports = apply;
-/***/ }),
-/***/ "./node_modules/lodash/_arrayEach.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_arrayEach.js ***!
- \*******************************************/
-/***/ (function(module) {
/**
- * A specialized version of `_.forEach` for arrays without support for
- * iteratee shorthands.
+ * Makes a shallow clone of an object, setting or overriding the nodes required
+ * to create the given path, and placing the specific value at the tail end of
+ * that path. Note that this copies and flattens prototype properties onto the
+ * new object as well. All non-primitive properties are copied by reference.
*
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array} Returns `array`.
+ * @func
+ * @memberOf R
+ * @since v0.8.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig [Idx] -> a -> {a} -> {a}
+ * @param {Array} path the path to set
+ * @param {*} val The new value
+ * @param {Object} obj The object to clone
+ * @return {Object} A new object equivalent to the original except along the specified path.
+ * @see R.dissocPath
+ * @example
+ *
+ * R.assocPath(['a', 'b', 'c'], 42, {a: {b: {c: 0}}}); //=> {a: {b: {c: 42}}}
+ *
+ * // Any missing or non-object keys in path will be overridden
+ * R.assocPath(['a', 'b', 'c'], 42, {a: 5}); //=> {a: {b: {c: 42}}}
*/
-function arrayEach(array, iteratee) {
- var index = -1,
- length = array == null ? 0 : array.length;
- while (++index < length) {
- if (iteratee(array[index], index, array) === false) {
- break;
- }
+var assocPath = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function assocPath(path, val, obj) {
+ if (path.length === 0) {
+ return val;
}
- return array;
-}
+ var idx = path[0];
+ if (path.length > 1) {
+ var nextObj = !(0,_isNil_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj) && (0,_internal_has_js__WEBPACK_IMPORTED_MODULE_2__["default"])(idx, obj) && typeof obj[idx] === 'object' ? obj[idx] : (0,_internal_isInteger_js__WEBPACK_IMPORTED_MODULE_3__["default"])(path[1]) ? [] : {};
+ val = assocPath(Array.prototype.slice.call(path, 1), val, nextObj);
+ }
+ return (0,_internal_assoc_js__WEBPACK_IMPORTED_MODULE_4__["default"])(idx, val, obj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (assocPath);
-module.exports = arrayEach;
+/***/ }),
+/***/ "./node_modules/ramda/es/bind.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/bind.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_arity.js */ "./node_modules/ramda/es/internal/_arity.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-/***/ "./node_modules/lodash/_arrayFilter.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_arrayFilter.js ***!
- \*********************************************/
-/***/ (function(module) {
/**
- * A specialized version of `_.filter` for arrays without support for
- * iteratee shorthands.
+ * Creates a function that is bound to a context.
+ * Note: `R.bind` does not provide the additional argument-binding capabilities of
+ * [Function.prototype.bind](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function/bind).
*
- * @private
- * @param {Array} [array] The array to iterate over.
- * @param {Function} predicate The function invoked per iteration.
- * @returns {Array} Returns the new filtered array.
+ * @func
+ * @memberOf R
+ * @since v0.6.0
+ * @category Function
+ * @category Object
+ * @sig (* -> *) -> {*} -> (* -> *)
+ * @param {Function} fn The function to bind to context
+ * @param {Object} thisObj The context to bind `fn` to
+ * @return {Function} A function that will execute in the context of `thisObj`.
+ * @see R.partial
+ * @example
+ *
+ * const log = R.bind(console.log, console);
+ * R.pipe(R.assoc('a', 2), R.tap(log), R.assoc('a', 3))({a: 1}); //=> {a: 3}
+ * // logs {a: 2}
+ * @symb R.bind(f, o)(a, b) = f.call(o, a, b)
*/
-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;
-}
-
-module.exports = arrayFilter;
+var bind = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function bind(fn, thisObj) {
+ return (0,_internal_arity_js__WEBPACK_IMPORTED_MODULE_1__["default"])(fn.length, function () {
+ return fn.apply(thisObj, arguments);
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (bind);
/***/ }),
-/***/ "./node_modules/lodash/_arrayIncludes.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_arrayIncludes.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/clone.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/clone.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_clone_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_clone.js */ "./node_modules/ramda/es/internal/_clone.js");
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
-var baseIndexOf = __webpack_require__(/*! ./_baseIndexOf */ "./node_modules/lodash/_baseIndexOf.js");
/**
- * A specialized version of `_.includes` for arrays without support for
- * specifying an index to search from.
+ * Creates a deep copy of the source that can be used in place of the source
+ * object without retaining any references to it.
+ * The source object may contain (nested) `Array`s and `Object`s,
+ * `Number`s, `String`s, `Boolean`s and `Date`s.
+ * `Function`s are assigned by reference rather than copied.
*
- * @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`.
+ * Dispatches to a `clone` method if present.
+ *
+ * Note that if the source object has multiple nodes that share a reference,
+ * the returned object will have the same structure, but the references will
+ * be pointed to the location within the cloned value.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig {*} -> {*}
+ * @param {*} value The object or array to clone
+ * @return {*} A deeply cloned copy of `val`
+ * @example
+ *
+ * const objects = [{}, {}, {}];
+ * const objectsClone = R.clone(objects);
+ * objects === objectsClone; //=> false
+ * objects[0] === objectsClone[0]; //=> false
*/
-function arrayIncludes(array, value) {
- var length = array == null ? 0 : array.length;
- return !!length && baseIndexOf(array, value, 0) > -1;
-}
-
-module.exports = arrayIncludes;
+var clone = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function clone(value) {
+ return value != null && typeof value.clone === 'function' ? value.clone() : (0,_internal_clone_js__WEBPACK_IMPORTED_MODULE_1__["default"])(value, true);
+});
+/* harmony default export */ __webpack_exports__["default"] = (clone);
/***/ }),
-/***/ "./node_modules/lodash/_arrayIncludesWith.js":
-/*!***************************************************!*\
- !*** ./node_modules/lodash/_arrayIncludesWith.js ***!
- \***************************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/comparator.js":
+/*!*********************************************!*\
+ !*** ./node_modules/ramda/es/comparator.js ***!
+ \*********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
/**
- * This function is like `arrayIncludes` except that it accepts a comparator.
+ * Makes a comparator function out of a function that reports whether the first
+ * element is less than the second.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Function
+ * @sig ((a, b) -> Boolean) -> ((a, b) -> Number)
+ * @param {Function} pred A predicate function of arity two which will return `true` if the first argument
+ * is less than the second, `false` otherwise
+ * @return {Function} A Function :: a -> b -> Int that returns `-1` if a < b, `1` if b < a, otherwise `0`
+ * @example
+ *
+ * const byAge = R.comparator((a, b) => a.age < b.age);
+ * const people = [
+ * { name: 'Emma', age: 70 },
+ * { name: 'Peter', age: 78 },
+ * { name: 'Mikhail', age: 62 },
+ * ];
+ * const peopleByIncreasingAge = R.sort(byAge, people);
+ * //=> [{ name: 'Mikhail', age: 62 },{ name: 'Emma', age: 70 }, { name: 'Peter', age: 78 }]
*/
-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;
-}
+var comparator = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function comparator(pred) {
+ return function (a, b) {
+ return pred(a, b) ? -1 : pred(b, a) ? 1 : 0;
+ };
+});
+/* harmony default export */ __webpack_exports__["default"] = (comparator);
-module.exports = arrayIncludesWith;
+/***/ }),
+/***/ "./node_modules/ramda/es/concat.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/concat.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _internal_isFunction_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_isFunction.js */ "./node_modules/ramda/es/internal/_isFunction.js");
+/* harmony import */ var _internal_isString_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_isString.js */ "./node_modules/ramda/es/internal/_isString.js");
+/* harmony import */ var _toString_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./toString.js */ "./node_modules/ramda/es/toString.js");
-/***/ "./node_modules/lodash/_arrayLikeKeys.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_arrayLikeKeys.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseTimes = __webpack_require__(/*! ./_baseTimes */ "./node_modules/lodash/_baseTimes.js"),
- isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
- isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * Creates an array of the enumerable property names of the array-like `value`.
+ * Returns the result of concatenating the given lists or strings.
*
- * @private
- * @param {*} value The value to query.
- * @param {boolean} inherited Specify returning inherited property names.
- * @returns {Array} Returns the array of property names.
+ * Note: `R.concat` expects both arguments to be of the same type,
+ * unlike the native `Array.prototype.concat` method. It will throw
+ * an error if you `concat` an Array with a non-Array value.
+ *
+ * Dispatches to the `concat` method of the first argument, if present.
+ * Can also concatenate two members of a [fantasy-land
+ * compatible semigroup](https://github.com/fantasyland/fantasy-land#semigroup).
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig [a] -> [a] -> [a]
+ * @sig String -> String -> String
+ * @param {Array|String} firstList The first list
+ * @param {Array|String} secondList The second list
+ * @return {Array|String} A list consisting of the elements of `firstList` followed by the elements of
+ * `secondList`.
+ *
+ * @example
+ *
+ * R.concat('ABC', 'DEF'); // 'ABCDEF'
+ * R.concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]
+ * R.concat([], []); //=> []
*/
-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);
+var concat = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function concat(a, b) {
+ if ((0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(a)) {
+ if ((0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(b)) {
+ return a.concat(b);
}
+ throw new TypeError((0,_toString_js__WEBPACK_IMPORTED_MODULE_2__["default"])(b) + ' is not an array');
}
- return result;
-}
-
-module.exports = arrayLikeKeys;
-
+ if ((0,_internal_isString_js__WEBPACK_IMPORTED_MODULE_3__["default"])(a)) {
+ if ((0,_internal_isString_js__WEBPACK_IMPORTED_MODULE_3__["default"])(b)) {
+ return a + b;
+ }
+ throw new TypeError((0,_toString_js__WEBPACK_IMPORTED_MODULE_2__["default"])(b) + ' is not a string');
+ }
+ if (a != null && (0,_internal_isFunction_js__WEBPACK_IMPORTED_MODULE_4__["default"])(a['fantasy-land/concat'])) {
+ return a['fantasy-land/concat'](b);
+ }
+ if (a != null && (0,_internal_isFunction_js__WEBPACK_IMPORTED_MODULE_4__["default"])(a.concat)) {
+ return a.concat(b);
+ }
+ throw new TypeError((0,_toString_js__WEBPACK_IMPORTED_MODULE_2__["default"])(a) + ' does not have a method named "concat" or "fantasy-land/concat"');
+});
+/* harmony default export */ __webpack_exports__["default"] = (concat);
/***/ }),
-/***/ "./node_modules/lodash/_arrayMap.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_arrayMap.js ***!
- \******************************************/
-/***/ (function(module) {
-
-/**
- * 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);
+/***/ "./node_modules/ramda/es/converge.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/converge.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_map_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./internal/_map.js */ "./node_modules/ramda/es/internal/_map.js");
+/* harmony import */ var _curryN_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./curryN.js */ "./node_modules/ramda/es/curryN.js");
+/* harmony import */ var _max_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./max.js */ "./node_modules/ramda/es/max.js");
+/* harmony import */ var _pluck_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./pluck.js */ "./node_modules/ramda/es/pluck.js");
+/* harmony import */ var _reduce_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./reduce.js */ "./node_modules/ramda/es/reduce.js");
- while (++index < length) {
- result[index] = iteratee(array[index], index, array);
- }
- return result;
-}
-module.exports = arrayMap;
-/***/ }),
-/***/ "./node_modules/lodash/_arrayPush.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_arrayPush.js ***!
- \*******************************************/
-/***/ (function(module) {
/**
- * Appends the elements of `values` to `array`.
+ * Accepts a converging function and a list of branching functions and returns
+ * a new function. The arity of the new function is the same as the arity of
+ * the longest branching function. When invoked, this new function is applied
+ * to some arguments, and each branching function is applied to those same
+ * arguments. The results of each branching function are passed as arguments
+ * to the converging function to produce the return value.
*
- * @private
- * @param {Array} array The array to modify.
- * @param {Array} values The values to append.
- * @returns {Array} Returns `array`.
+ * @func
+ * @memberOf R
+ * @since v0.4.2
+ * @category Function
+ * @sig ((x1, x2, ...) -> z) -> [((a, b, ...) -> x1), ((a, b, ...) -> x2), ...] -> (a -> b -> ... -> z)
+ * @param {Function} after A function. `after` will be invoked with the return values of
+ * `fn1` and `fn2` as its arguments.
+ * @param {Array} functions A list of functions.
+ * @return {Function} A new function.
+ * @see R.useWith
+ * @example
+ *
+ * const average = R.converge(R.divide, [R.sum, R.length])
+ * average([1, 2, 3, 4, 5, 6, 7]) //=> 4
+ *
+ * const strangeConcat = R.converge(R.concat, [R.toUpper, R.toLower])
+ * strangeConcat("Yodel") //=> "YODELyodel"
+ *
+ * @symb R.converge(f, [g, h])(a, b) = f(g(a, b), h(a, b))
*/
-function arrayPush(array, values) {
- var index = -1,
- length = values.length,
- offset = array.length;
- while (++index < length) {
- array[offset + index] = values[index];
- }
- return array;
-}
+var converge = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function converge(after, fns) {
+ return (0,_curryN_js__WEBPACK_IMPORTED_MODULE_1__["default"])((0,_reduce_js__WEBPACK_IMPORTED_MODULE_2__["default"])(_max_js__WEBPACK_IMPORTED_MODULE_3__["default"], 0, (0,_pluck_js__WEBPACK_IMPORTED_MODULE_4__["default"])('length', fns)), function () {
+ var args = arguments;
+ var context = this;
+ return after.apply(context, (0,_internal_map_js__WEBPACK_IMPORTED_MODULE_5__["default"])(function (fn) {
+ return fn.apply(context, args);
+ }, fns));
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (converge);
-module.exports = arrayPush;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/curryN.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/curryN.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arity_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_arity.js */ "./node_modules/ramda/es/internal/_arity.js");
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_curryN_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_curryN.js */ "./node_modules/ramda/es/internal/_curryN.js");
-/***/ }),
-/***/ "./node_modules/lodash/_arrayReduce.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_arrayReduce.js ***!
- \*********************************************/
-/***/ (function(module) {
/**
- * A specialized version of `_.reduce` for arrays without support for
- * iteratee shorthands.
+ * Returns a curried equivalent of the provided function, with the specified
+ * arity. The curried function has two unusual capabilities. First, its
+ * arguments needn't be provided one at a time. If `g` is `R.curryN(3, f)`, the
+ * following are equivalent:
*
- * @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.
+ * - `g(1)(2)(3)`
+ * - `g(1)(2, 3)`
+ * - `g(1, 2)(3)`
+ * - `g(1, 2, 3)`
+ *
+ * Secondly, the special placeholder value [`R.__`](#__) may be used to specify
+ * "gaps", allowing partial application of any combination of arguments,
+ * regardless of their positions. If `g` is as above and `_` is [`R.__`](#__),
+ * the following are equivalent:
+ *
+ * - `g(1, 2, 3)`
+ * - `g(_, 2, 3)(1)`
+ * - `g(_, _, 3)(1)(2)`
+ * - `g(_, _, 3)(1, 2)`
+ * - `g(_, 2)(1)(3)`
+ * - `g(_, 2)(1, 3)`
+ * - `g(_, 2)(_, 3)(1)`
+ *
+ * @func
+ * @memberOf R
+ * @since v0.5.0
+ * @category Function
+ * @sig Number -> (* -> a) -> (* -> a)
+ * @param {Number} length The arity for the returned function.
+ * @param {Function} fn The function to curry.
+ * @return {Function} A new, curried function.
+ * @see R.curry
+ * @example
+ *
+ * const sumArgs = (...args) => R.sum(args);
+ *
+ * const curriedAddFourNumbers = R.curryN(4, sumArgs);
+ * const f = curriedAddFourNumbers(1, 2);
+ * const g = f(3);
+ * g(4); //=> 10
*/
-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);
+var curryN = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function curryN(length, fn) {
+ if (length === 1) {
+ return (0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_1__["default"])(fn);
}
- return accumulator;
-}
-
-module.exports = arrayReduce;
-
+ return (0,_internal_arity_js__WEBPACK_IMPORTED_MODULE_2__["default"])(length, (0,_internal_curryN_js__WEBPACK_IMPORTED_MODULE_3__["default"])(length, [], fn));
+});
+/* harmony default export */ __webpack_exports__["default"] = (curryN);
/***/ }),
-/***/ "./node_modules/lodash/_arraySome.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_arraySome.js ***!
- \*******************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/defaultTo.js":
+/*!********************************************!*\
+ !*** ./node_modules/ramda/es/defaultTo.js ***!
+ \********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * A specialized version of `_.some` for arrays without support for iteratee
- * shorthands.
+ * Returns the second argument if it is not `null`, `undefined` or `NaN`;
+ * otherwise the first argument is returned.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.10.0
+ * @category Logic
+ * @sig a -> b -> a | b
+ * @param {a} default The default value.
+ * @param {b} val `val` will be returned instead of `default` unless `val` is `null`, `undefined` or `NaN`.
+ * @return {*} The second value if it is not `null`, `undefined` or `NaN`, otherwise the default value
+ * @example
+ *
+ * const defaultTo42 = R.defaultTo(42);
+ *
+ * defaultTo42(null); //=> 42
+ * defaultTo42(undefined); //=> 42
+ * defaultTo42(false); //=> false
+ * defaultTo42('Ramda'); //=> 'Ramda'
+ * // parseInt('string') results in NaN
+ * defaultTo42(parseInt('string')); //=> 42
*/
-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;
-}
-
-module.exports = arraySome;
+var defaultTo = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function defaultTo(d, v) {
+ return v == null || v !== v ? d : v;
+});
+/* harmony default export */ __webpack_exports__["default"] = (defaultTo);
/***/ }),
-/***/ "./node_modules/lodash/_asciiSize.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_asciiSize.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/difference.js":
+/*!*********************************************!*\
+ !*** ./node_modules/ramda/es/difference.js ***!
+ \*********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_Set_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_Set.js */ "./node_modules/ramda/es/internal/_Set.js");
-var baseProperty = __webpack_require__(/*! ./_baseProperty */ "./node_modules/lodash/_baseProperty.js");
/**
- * Gets the size of an ASCII `string`.
+ * Finds the set (i.e. no duplicates) of all elements in the first list not
+ * contained in the second list. Objects and Arrays are compared in terms of
+ * value equality, not reference equality.
*
- * @private
- * @param {string} string The string inspect.
- * @returns {number} Returns the string size.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Relation
+ * @sig [*] -> [*] -> [*]
+ * @param {Array} list1 The first list.
+ * @param {Array} list2 The second list.
+ * @return {Array} The elements in `list1` that are not in `list2`.
+ * @see R.differenceWith, R.symmetricDifference, R.symmetricDifferenceWith, R.without
+ * @example
+ *
+ * R.difference([1,2,3,4], [7,6,5,4,3]); //=> [1,2]
+ * R.difference([7,6,5,4,3], [1,2,3,4]); //=> [7,6,5]
+ * R.difference([{a: 1}, {b: 2}], [{a: 1}, {c: 3}]) //=> [{b: 2}]
*/
-var asciiSize = baseProperty('length');
-
-module.exports = asciiSize;
+var difference = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function difference(first, second) {
+ var out = [];
+ var idx = 0;
+ var firstLen = first.length;
+ var secondLen = second.length;
+ var toFilterOut = new _internal_Set_js__WEBPACK_IMPORTED_MODULE_1__["default"]();
+ for (var i = 0; i < secondLen; i += 1) {
+ toFilterOut.add(second[i]);
+ }
+ while (idx < firstLen) {
+ if (toFilterOut.add(first[idx])) {
+ out[out.length] = first[idx];
+ }
+ idx += 1;
+ }
+ return out;
+});
+/* harmony default export */ __webpack_exports__["default"] = (difference);
/***/ }),
-/***/ "./node_modules/lodash/_assignMergeValue.js":
-/*!**************************************************!*\
- !*** ./node_modules/lodash/_assignMergeValue.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/dissoc.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/dissoc.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _dissocPath_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./dissocPath.js */ "./node_modules/ramda/es/dissocPath.js");
-var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
- eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
/**
- * This function is like `assignValue` except that it doesn't assign
- * `undefined` values.
+ * Returns a new object that does not contain a `prop` property.
*
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
+ * @func
+ * @memberOf R
+ * @since v0.10.0
+ * @category Object
+ * @sig String -> {k: v} -> {k: v}
+ * @param {String} prop The name of the property to dissociate
+ * @param {Object} obj The object to clone
+ * @return {Object} A new object equivalent to the original but without the specified property
+ * @see R.assoc, R.omit
+ * @example
+ *
+ * R.dissoc('b', {a: 1, b: 2, c: 3}); //=> {a: 1, c: 3}
*/
-function assignMergeValue(object, key, value) {
- if ((value !== undefined && !eq(object[key], value)) ||
- (value === undefined && !(key in object))) {
- baseAssignValue(object, key, value);
- }
-}
-
-module.exports = assignMergeValue;
+var dissoc = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function dissoc(prop, obj) {
+ return (0,_dissocPath_js__WEBPACK_IMPORTED_MODULE_1__["default"])([prop], obj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (dissoc);
/***/ }),
-/***/ "./node_modules/lodash/_assignValue.js":
+/***/ "./node_modules/ramda/es/dissocPath.js":
/*!*********************************************!*\
- !*** ./node_modules/lodash/_assignValue.js ***!
+ !*** ./node_modules/ramda/es/dissocPath.js ***!
\*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dissoc_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_dissoc.js */ "./node_modules/ramda/es/internal/_dissoc.js");
+/* harmony import */ var _internal_isInteger_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
+/* harmony import */ var _internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _assoc_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./assoc.js */ "./node_modules/ramda/es/assoc.js");
+
-var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
- eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * 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.
+ * Makes a shallow clone of an object. Note that this copies and flattens
+ * prototype properties onto the new object as well. All non-primitive
+ * properties are copied by reference.
*
* @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
+ * @param {String|Integer} prop The prop operating
+ * @param {Object|Array} obj The object to clone
+ * @return {Object|Array} A new object equivalent to the original.
*/
-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);
+
+function _shallowCloneObject(prop, obj) {
+ if ((0,_internal_isInteger_js__WEBPACK_IMPORTED_MODULE_0__["default"])(prop) && (0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj)) {
+ return [].concat(obj);
+ }
+ var result = {};
+ for (var p in obj) {
+ result[p] = obj[p];
}
+ return result;
}
-
-module.exports = assignValue;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_assocIndexOf.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_assocIndexOf.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js");
-
/**
- * Gets the index at which the `key` is found in `array` of key-value pairs.
+ * Makes a shallow clone of an object, omitting the property at the given path.
+ * Note that this copies and flattens prototype properties onto the new object
+ * as well. All non-primitive properties are copied by reference.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.11.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig [Idx] -> {k: v} -> {k: v}
+ * @param {Array} path The path to the value to omit
+ * @param {Object} obj The object to clone
+ * @return {Object} A new object without the property at path
+ * @see R.assocPath
+ * @example
+ *
+ * R.dissocPath(['a', 'b', 'c'], {a: {b: {c: 42}}}); //=> {a: {b: {}}}
*/
-function assocIndexOf(array, key) {
- var length = array.length;
- while (length--) {
- if (eq(array[length][0], key)) {
- return length;
- }
- }
- return -1;
-}
-
-module.exports = assocIndexOf;
+var dissocPath = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function dissocPath(path, obj) {
+ if (obj == null) {
+ return obj;
+ }
+ switch (path.length) {
+ case 0:
+ return obj;
+ case 1:
+ return (0,_internal_dissoc_js__WEBPACK_IMPORTED_MODULE_3__["default"])(path[0], obj);
+ default:
+ var head = path[0];
+ var tail = Array.prototype.slice.call(path, 1);
+ if (obj[head] == null) {
+ return _shallowCloneObject(head, obj);
+ } else {
+ return (0,_assoc_js__WEBPACK_IMPORTED_MODULE_4__["default"])(head, dissocPath(tail, obj[head]), obj);
+ }
+ }
+});
+/* harmony default export */ __webpack_exports__["default"] = (dissocPath);
/***/ }),
-/***/ "./node_modules/lodash/_baseAssign.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseAssign.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
+/***/ "./node_modules/ramda/es/empty.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/empty.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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);
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_isArguments_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_isArguments.js */ "./node_modules/ramda/es/internal/_isArguments.js");
+/* harmony import */ var _internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _internal_isObject_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_isObject.js */ "./node_modules/ramda/es/internal/_isObject.js");
+/* harmony import */ var _internal_isString_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_isString.js */ "./node_modules/ramda/es/internal/_isString.js");
+/* harmony import */ var _internal_isTypedArray_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./internal/_isTypedArray.js */ "./node_modules/ramda/es/internal/_isTypedArray.js");
-module.exports = baseAssign;
-/***/ }),
-/***/ "./node_modules/lodash/_baseAssignIn.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseAssignIn.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
/**
- * The base implementation of `_.assignIn` without support for multiple sources
- * or `customizer` functions.
+ * Returns the empty value of its argument's type. Ramda defines the empty
+ * value of Array (`[]`), Object (`{}`), String (`''`),
+ * TypedArray (`Uint8Array []`, `Float32Array []`, etc), and Arguments. Other
+ * types are supported if they define `<Type>.empty`,
+ * `<Type>.prototype.empty` or implement the
+ * [FantasyLand Monoid spec](https://github.com/fantasyland/fantasy-land#monoid).
*
- * @private
- * @param {Object} object The destination object.
- * @param {Object} source The source object.
- * @returns {Object} Returns `object`.
+ * Dispatches to the `empty` method of the first argument, if present.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.3.0
+ * @category Function
+ * @sig a -> a
+ * @param {*} x
+ * @return {*}
+ * @example
+ *
+ * R.empty(Just(42)); //=> Nothing()
+ * R.empty([1, 2, 3]); //=> []
+ * R.empty('unicorns'); //=> ''
+ * R.empty({x: 1, y: 2}); //=> {}
+ * R.empty(Uint8Array.from('123')); //=> Uint8Array []
*/
-function baseAssignIn(object, source) {
- return object && copyObject(source, keysIn(source), object);
-}
-
-module.exports = baseAssignIn;
+var empty = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function empty(x) {
+ return x != null && typeof x['fantasy-land/empty'] === 'function' ? x['fantasy-land/empty']() : x != null && x.constructor != null && typeof x.constructor['fantasy-land/empty'] === 'function' ? x.constructor['fantasy-land/empty']() : x != null && typeof x.empty === 'function' ? x.empty() : x != null && x.constructor != null && typeof x.constructor.empty === 'function' ? x.constructor.empty() : (0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(x) ? [] : (0,_internal_isString_js__WEBPACK_IMPORTED_MODULE_2__["default"])(x) ? '' : (0,_internal_isObject_js__WEBPACK_IMPORTED_MODULE_3__["default"])(x) ? {} : (0,_internal_isArguments_js__WEBPACK_IMPORTED_MODULE_4__["default"])(x) ? function () {
+ return arguments;
+ }() : (0,_internal_isTypedArray_js__WEBPACK_IMPORTED_MODULE_5__["default"])(x) ? x.constructor.from('') : void 0 // else
+ ;
+});
+/* harmony default export */ __webpack_exports__["default"] = (empty);
/***/ }),
-/***/ "./node_modules/lodash/_baseAssignValue.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_baseAssignValue.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/equals.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/equals.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_equals_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_equals.js */ "./node_modules/ramda/es/internal/_equals.js");
-var defineProperty = __webpack_require__(/*! ./_defineProperty */ "./node_modules/lodash/_defineProperty.js");
/**
- * The base implementation of `assignValue` and `assignMergeValue` without
- * value checks.
+ * Returns `true` if its arguments are equivalent, `false` otherwise. Handles
+ * cyclical data structures.
*
- * @private
- * @param {Object} object The object to modify.
- * @param {string} key The key of the property to assign.
- * @param {*} value The value to assign.
+ * Dispatches symmetrically to the `equals` methods of both arguments, if
+ * present.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.15.0
+ * @category Relation
+ * @sig a -> b -> Boolean
+ * @param {*} a
+ * @param {*} b
+ * @return {Boolean}
+ * @example
+ *
+ * R.equals(1, 1); //=> true
+ * R.equals(1, '1'); //=> false
+ * R.equals([1, 2, 3], [1, 2, 3]); //=> true
+ *
+ * const a = {}; a.v = a;
+ * const b = {}; b.v = b;
+ * R.equals(a, b); //=> true
*/
-function baseAssignValue(object, key, value) {
- if (key == '__proto__' && defineProperty) {
- defineProperty(object, key, {
- 'configurable': true,
- 'enumerable': true,
- 'value': value,
- 'writable': true
- });
- } else {
- object[key] = value;
- }
-}
-
-module.exports = baseAssignValue;
+var equals = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function equals(a, b) {
+ return (0,_internal_equals_js__WEBPACK_IMPORTED_MODULE_1__["default"])(a, b, [], []);
+});
+/* harmony default export */ __webpack_exports__["default"] = (equals);
/***/ }),
-/***/ "./node_modules/lodash/_baseClone.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseClone.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
- arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
- assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
- baseAssign = __webpack_require__(/*! ./_baseAssign */ "./node_modules/lodash/_baseAssign.js"),
- baseAssignIn = __webpack_require__(/*! ./_baseAssignIn */ "./node_modules/lodash/_baseAssignIn.js"),
- cloneBuffer = __webpack_require__(/*! ./_cloneBuffer */ "./node_modules/lodash/_cloneBuffer.js"),
- copyArray = __webpack_require__(/*! ./_copyArray */ "./node_modules/lodash/_copyArray.js"),
- copySymbols = __webpack_require__(/*! ./_copySymbols */ "./node_modules/lodash/_copySymbols.js"),
- copySymbolsIn = __webpack_require__(/*! ./_copySymbolsIn */ "./node_modules/lodash/_copySymbolsIn.js"),
- getAllKeys = __webpack_require__(/*! ./_getAllKeys */ "./node_modules/lodash/_getAllKeys.js"),
- getAllKeysIn = __webpack_require__(/*! ./_getAllKeysIn */ "./node_modules/lodash/_getAllKeysIn.js"),
- getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- initCloneArray = __webpack_require__(/*! ./_initCloneArray */ "./node_modules/lodash/_initCloneArray.js"),
- initCloneByTag = __webpack_require__(/*! ./_initCloneByTag */ "./node_modules/lodash/_initCloneByTag.js"),
- initCloneObject = __webpack_require__(/*! ./_initCloneObject */ "./node_modules/lodash/_initCloneObject.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isMap = __webpack_require__(/*! ./isMap */ "./node_modules/lodash/isMap.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- isSet = __webpack_require__(/*! ./isSet */ "./node_modules/lodash/isSet.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
-
-/** Used to compose bitmasks for cloning. */
-var CLONE_DEEP_FLAG = 1,
- CLONE_FLAT_FLAG = 2,
- CLONE_SYMBOLS_FLAG = 4;
+/***/ "./node_modules/ramda/es/evolve.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/evolve.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]',
- arrayTag = '[object Array]',
- boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- errorTag = '[object Error]',
- funcTag = '[object Function]',
- genTag = '[object GeneratorFunction]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- objectTag = '[object Object]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- symbolTag = '[object Symbol]',
- weakMapTag = '[object WeakMap]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_isArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _internal_isObject_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isObject.js */ "./node_modules/ramda/es/internal/_isObject.js");
-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 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;
/**
- * The base implementation of `_.clone` and `_.cloneDeep` which tracks
- * traversed objects.
+ * Creates a new object by recursively evolving a shallow copy of `object`,
+ * according to the `transformation` functions. All non-primitive properties
+ * are copied by reference.
*
- * @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.
+ * A `transformation` function will not be invoked if its corresponding key
+ * does not exist in the evolved object.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.9.0
+ * @category Object
+ * @sig {k: (v -> v)} -> {k: v} -> {k: v}
+ * @param {Object} transformations The object specifying transformation functions to apply
+ * to the object.
+ * @param {Object} object The object to be transformed.
+ * @return {Object} The transformed object.
+ * @example
+ *
+ * const tomato = {firstName: ' Tomato ', data: {elapsed: 100, remaining: 1400}, id:123};
+ * const transformations = {
+ * firstName: R.trim,
+ * lastName: R.trim, // Will not get invoked.
+ * data: {elapsed: R.add(1), remaining: R.add(-1)}
+ * };
+ * R.evolve(transformations, tomato); //=> {firstName: 'Tomato', data: {elapsed: 101, remaining: 1399}, id:123}
*/
-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, isDeep);
- }
+var evolve = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function evolve(transformations, object) {
+ if (!(0,_internal_isObject_js__WEBPACK_IMPORTED_MODULE_1__["default"])(object) && !(0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_2__["default"])(object)) {
+ return object;
}
- // Check for circular references and return its corresponding clone.
- stack || (stack = new Stack);
- var stacked = stack.get(value);
- if (stacked) {
- return stacked;
+ var result = object instanceof Array ? [] : {};
+ var transformation, key, type;
+ for (key in object) {
+ transformation = transformations[key];
+ type = typeof transformation;
+ result[key] = type === 'function' ? transformation(object[key]) : transformation && type === 'object' ? evolve(transformation, object[key]) : object[key];
}
- stack.set(value, result);
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (evolve);
- if (isSet(value)) {
- value.forEach(function(subValue) {
- result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
- });
- } else if (isMap(value)) {
- value.forEach(function(subValue, key) {
- result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
- });
- }
+/***/ }),
- var keysFunc = isFull
- ? (isFlat ? getAllKeysIn : getAllKeys)
- : (isFlat ? keysIn : keys);
+/***/ "./node_modules/ramda/es/filter.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/filter.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- 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;
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_arrayReduce.js */ "./node_modules/ramda/es/internal/_arrayReduce.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_filter_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./internal/_filter.js */ "./node_modules/ramda/es/internal/_filter.js");
+/* harmony import */ var _internal_isObject_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_isObject.js */ "./node_modules/ramda/es/internal/_isObject.js");
+/* harmony import */ var _internal_xfilter_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xfilter.js */ "./node_modules/ramda/es/internal/_xfilter.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./keys.js */ "./node_modules/ramda/es/keys.js");
-module.exports = baseClone;
-/***/ }),
-/***/ "./node_modules/lodash/_baseCreate.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseCreate.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
-/** Built-in value references. */
-var objectCreate = Object.create;
/**
- * The base implementation of `_.create` without support for assigning
- * properties to the created object.
+ * Takes a predicate and a `Filterable`, and returns a new filterable of the
+ * same type containing the members of the given filterable which satisfy the
+ * given predicate. Filterable objects include plain objects or any object
+ * that has a filter method such as `Array`.
*
- * @private
- * @param {Object} proto The object to inherit from.
- * @returns {Object} Returns the new object.
+ * Dispatches to the `filter` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @category Object
+ * @sig Filterable f => (a -> Boolean) -> f a -> f a
+ * @param {Function} pred
+ * @param {Array} filterable
+ * @return {Array} Filterable
+ * @see R.reject, R.transduce, R.addIndex
+ * @example
+ *
+ * const isEven = n => n % 2 === 0;
+ *
+ * R.filter(isEven, [1, 2, 3, 4]); //=> [2, 4]
+ *
+ * R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}
*/
-var baseCreate = (function() {
- function object() {}
- return function(proto) {
- if (!isObject(proto)) {
- return {};
- }
- if (objectCreate) {
- return objectCreate(proto);
+
+var filter = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['fantasy-land/filter', 'filter'], _internal_xfilter_js__WEBPACK_IMPORTED_MODULE_2__["default"], function (pred, filterable) {
+ return (0,_internal_isObject_js__WEBPACK_IMPORTED_MODULE_3__["default"])(filterable) ? (0,_internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_4__["default"])(function (acc, key) {
+ if (pred(filterable[key])) {
+ acc[key] = filterable[key];
}
- object.prototype = proto;
- var result = new object;
- object.prototype = undefined;
- return result;
- };
-}());
+ return acc;
+ }, {}, (0,_keys_js__WEBPACK_IMPORTED_MODULE_5__["default"])(filterable)) :
+ // else
+ (0,_internal_filter_js__WEBPACK_IMPORTED_MODULE_6__["default"])(pred, filterable);
+}));
+/* harmony default export */ __webpack_exports__["default"] = (filter);
-module.exports = baseCreate;
+/***/ }),
+/***/ "./node_modules/ramda/es/find.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/find.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xfind_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xfind.js */ "./node_modules/ramda/es/internal/_xfind.js");
-/***/ "./node_modules/lodash/_baseEach.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_baseEach.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
- createBaseEach = __webpack_require__(/*! ./_createBaseEach */ "./node_modules/lodash/_createBaseEach.js");
/**
- * The base implementation of `_.forEach` without support for iteratee shorthands.
+ * Returns the first element of the list which matches the predicate, or
+ * `undefined` if no element matches.
*
- * @private
- * @param {Array|Object} collection The collection to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Array|Object} Returns `collection`.
+ * Dispatches to the `find` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig (a -> Boolean) -> [a] -> a | undefined
+ * @param {Function} fn The predicate function used to determine if the element is the
+ * desired one.
+ * @param {Array} list The array to consider.
+ * @return {Object} The element found, or `undefined`.
+ * @see R.transduce
+ * @example
+ *
+ * const xs = [{a: 1}, {a: 2}, {a: 3}];
+ * R.find(R.propEq(2, 'a'))(xs); //=> {a: 2}
+ * R.find(R.propEq(4, 'a'))(xs); //=> undefined
*/
-var baseEach = createBaseEach(baseForOwn);
-
-module.exports = baseEach;
+var find = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['find'], _internal_xfind_js__WEBPACK_IMPORTED_MODULE_2__["default"], function find(fn, list) {
+ var idx = 0;
+ var len = list.length;
+ while (idx < len) {
+ if (fn(list[idx])) {
+ return list[idx];
+ }
+ idx += 1;
+ }
+}));
+/* harmony default export */ __webpack_exports__["default"] = (find);
/***/ }),
-/***/ "./node_modules/lodash/_baseExtremum.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseExtremum.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/findIndex.js":
+/*!********************************************!*\
+ !*** ./node_modules/ramda/es/findIndex.js ***!
+ \********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xfindIndex_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xfindIndex.js */ "./node_modules/ramda/es/internal/_xfindIndex.js");
+
-var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
/**
- * The base implementation of methods like `_.max` and `_.min` which accepts a
- * `comparator` to determine the extremum value.
+ * Returns the index of the first element of the list which matches the
+ * predicate, or `-1` if no element matches.
*
- * @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.
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.1
+ * @category List
+ * @sig (a -> Boolean) -> [a] -> Number
+ * @param {Function} fn The predicate function used to determine if the element is the
+ * desired one.
+ * @param {Array} list The array to consider.
+ * @return {Number} The index of the element found, or `-1`.
+ * @see R.transduce, R.indexOf
+ * @example
+ *
+ * const xs = [{a: 1}, {a: 2}, {a: 3}];
+ * R.findIndex(R.propEq(2, 'a'))(xs); //=> 1
+ * R.findIndex(R.propEq(4, 'a'))(xs); //=> -1
*/
-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;
+var findIndex = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])([], _internal_xfindIndex_js__WEBPACK_IMPORTED_MODULE_2__["default"], function findIndex(fn, list) {
+ var idx = 0;
+ var len = list.length;
+ while (idx < len) {
+ if (fn(list[idx])) {
+ return idx;
}
+ idx += 1;
}
- return result;
-}
-
-module.exports = baseExtremum;
-
+ return -1;
+}));
+/* harmony default export */ __webpack_exports__["default"] = (findIndex);
/***/ }),
-/***/ "./node_modules/lodash/_baseFilter.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseFilter.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/flatten.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/flatten.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_makeFlat_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_makeFlat.js */ "./node_modules/ramda/es/internal/_makeFlat.js");
-var baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js");
/**
- * The base implementation of `_.filter` without support for iteratee shorthands.
+ * Returns a new list by pulling every item out of it (and all its sub-arrays)
+ * and putting them in a new array, depth-first.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig [a] -> [b]
+ * @param {Array} list The array to consider.
+ * @return {Array} The flattened list.
+ * @see R.unnest
+ * @example
*
- * @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.
+ * R.flatten([1, 2, [3, 4], 5, [6, [7, 8, [9, [10, 11], 12]]]]);
+ * //=> [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
*/
-function baseFilter(collection, predicate) {
- var result = [];
- baseEach(collection, function(value, index, collection) {
- if (predicate(value, index, collection)) {
- result.push(value);
- }
- });
- return result;
-}
-
-module.exports = baseFilter;
+var flatten = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_makeFlat_js__WEBPACK_IMPORTED_MODULE_1__["default"])(true));
+/* harmony default export */ __webpack_exports__["default"] = (flatten);
/***/ }),
-/***/ "./node_modules/lodash/_baseFindIndex.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_baseFindIndex.js ***!
- \***********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/forEach.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/forEach.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_checkForMethod.js */ "./node_modules/ramda/es/internal/_checkForMethod.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+
/**
- * The base implementation of `_.findIndex` and `_.findLastIndex` without
- * support for iteratee shorthands.
+ * Iterate over an input `list`, calling a provided function `fn` for each
+ * element in the list.
*
- * @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`.
+ * `fn` receives one argument: *(value)*.
+ *
+ * Note: `R.forEach` does not skip deleted or unassigned indices (sparse
+ * arrays), unlike the native `Array.prototype.forEach` method. For more
+ * details on this behavior, see:
+ * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach#Description
+ *
+ * Also note that, unlike `Array.prototype.forEach`, Ramda's `forEach` returns
+ * the original array. In some libraries this function is named `each`.
+ *
+ * Dispatches to the `forEach` method of the second argument, if present.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.1
+ * @category List
+ * @sig (a -> *) -> [a] -> [a]
+ * @param {Function} fn The function to invoke. Receives one argument, `value`.
+ * @param {Array} list The list to iterate over.
+ * @return {Array} The original list.
+ * @see R.addIndex
+ * @example
+ *
+ * const printXPlusFive = x => console.log(x + 5);
+ * R.forEach(printXPlusFive, [1, 2, 3]); //=> [1, 2, 3]
+ * // logs 6
+ * // logs 7
+ * // logs 8
+ * @symb R.forEach(f, [a, b, c]) = [a, b, c]
*/
-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;
- }
+var forEach = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__["default"])('forEach', function forEach(fn, list) {
+ var len = list.length;
+ var idx = 0;
+ while (idx < len) {
+ fn(list[idx]);
+ idx += 1;
}
- return -1;
-}
-
-module.exports = baseFindIndex;
-
+ return list;
+}));
+/* harmony default export */ __webpack_exports__["default"] = (forEach);
/***/ }),
-/***/ "./node_modules/lodash/_baseFlatten.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseFlatten.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/forEachObjIndexed.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/forEachObjIndexed.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./keys.js */ "./node_modules/ramda/es/keys.js");
-var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
- isFlattenable = __webpack_require__(/*! ./_isFlattenable */ "./node_modules/lodash/_isFlattenable.js");
/**
- * The base implementation of `_.flatten` with support for restricting flattening.
+ * Iterate over an input `object`, calling a provided function `fn` for each
+ * key and value in the object.
*
- * @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.
+ * `fn` receives three argument: *(value, key, obj)*.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.23.0
+ * @category Object
+ * @sig ((a, String, StrMap a) -> Any) -> StrMap a -> StrMap a
+ * @param {Function} fn The function to invoke. Receives three argument, `value`, `key`, `obj`.
+ * @param {Object} obj The object to iterate over.
+ * @return {Object} The original object.
+ * @example
+ *
+ * const printKeyConcatValue = (value, key) => console.log(key + ':' + value);
+ * R.forEachObjIndexed(printKeyConcatValue, {x: 1, y: 2}); //=> {x: 1, y: 2}
+ * // logs x:1
+ * // logs y:2
+ * @symb R.forEachObjIndexed(f, {x: a, y: b}) = {x: a, y: b}
*/
-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;
- }
+var forEachObjIndexed = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function forEachObjIndexed(fn, obj) {
+ var keyList = (0,_keys_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj);
+ var idx = 0;
+ while (idx < keyList.length) {
+ var key = keyList[idx];
+ fn(obj[key], key, obj);
+ idx += 1;
}
- return result;
-}
+ return obj;
+});
+/* harmony default export */ __webpack_exports__["default"] = (forEachObjIndexed);
-module.exports = baseFlatten;
+/***/ }),
+/***/ "./node_modules/ramda/es/groupBy.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/groupBy.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_checkForMethod.js */ "./node_modules/ramda/es/internal/_checkForMethod.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _reduceBy_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./reduceBy.js */ "./node_modules/ramda/es/reduceBy.js");
-/***/ "./node_modules/lodash/_baseFor.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_baseFor.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var createBaseFor = __webpack_require__(/*! ./_createBaseFor */ "./node_modules/lodash/_createBaseFor.js");
/**
- * 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`.
+ * Splits a list into sub-lists stored in an object, based on the result of
+ * calling a key-returning function on each element, and grouping the
+ * results according to values returned.
*
- * @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`.
+ * Dispatches to the `groupBy` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @typedefn Idx = String | Int | Symbol
+ * @sig Idx a => (b -> a) -> [b] -> {a: [b]}
+ * @param {Function} fn Function :: a -> Idx
+ * @param {Array} list The array to group
+ * @return {Object} An object with the output of `fn` for keys, mapped to arrays of elements
+ * that produced that key when passed to `fn`.
+ * @see R.reduceBy, R.transduce, R.indexBy, R.collectBy
+ * @example
+ *
+ * const byGrade = R.groupBy(function(student) {
+ * const score = student.score;
+ * return score < 65 ? 'F' :
+ * score < 70 ? 'D' :
+ * score < 80 ? 'C' :
+ * score < 90 ? 'B' : 'A';
+ * });
+ * const students = [{name: 'Abby', score: 84},
+ * {name: 'Eddy', score: 58},
+ * // ...
+ * {name: 'Jack', score: 69}];
+ * byGrade(students);
+ * // {
+ * // 'A': [{name: 'Dianne', score: 99}],
+ * // 'B': [{name: 'Abby', score: 84}]
+ * // // ...,
+ * // 'F': [{name: 'Eddy', score: 58}]
+ * // }
*/
-var baseFor = createBaseFor();
-
-module.exports = baseFor;
+var groupBy = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__["default"])('groupBy', /*#__PURE__*/
+(0,_reduceBy_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function (acc, item) {
+ acc.push(item);
+ return acc;
+}, [])));
+/* harmony default export */ __webpack_exports__["default"] = (groupBy);
/***/ }),
-/***/ "./node_modules/lodash/_baseForOwn.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseForOwn.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/has.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/has.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _hasPath_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./hasPath.js */ "./node_modules/ramda/es/hasPath.js");
-var baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
/**
- * The base implementation of `_.forOwn` without support for iteratee shorthands.
+ * Returns whether or not an object has an own property with the specified name
*
- * @private
- * @param {Object} object The object to iterate over.
- * @param {Function} iteratee The function invoked per iteration.
- * @returns {Object} Returns `object`.
+ * @func
+ * @memberOf R
+ * @since v0.7.0
+ * @category Object
+ * @sig s -> {s: x} -> Boolean
+ * @param {String} prop The name of the property to check for.
+ * @param {Object} obj The object to query.
+ * @return {Boolean} Whether the property exists.
+ * @example
+ *
+ * const hasName = R.has('name');
+ * hasName({name: 'alice'}); //=> true
+ * hasName({name: 'bob'}); //=> true
+ * hasName({}); //=> false
+ *
+ * const point = {x: 0, y: 0};
+ * const pointHas = R.has(R.__, point);
+ * pointHas('x'); //=> true
+ * pointHas('y'); //=> true
+ * pointHas('z'); //=> false
*/
-function baseForOwn(object, iteratee) {
- return object && baseFor(object, iteratee, keys);
-}
-
-module.exports = baseForOwn;
+var has = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function has(prop, obj) {
+ return (0,_hasPath_js__WEBPACK_IMPORTED_MODULE_1__["default"])([prop], obj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (has);
/***/ }),
-/***/ "./node_modules/lodash/_baseGet.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_baseGet.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/hasPath.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/hasPath.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _isNil_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./isNil.js */ "./node_modules/ramda/es/isNil.js");
+
-var castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
/**
- * The base implementation of `_.get` without support for default values.
+ * Returns whether or not a path exists in an object. Only the object's
+ * own properties are checked.
*
- * @private
- * @param {Object} object The object to query.
- * @param {Array|string} path The path of the property to get.
- * @returns {*} Returns the resolved value.
+ * @func
+ * @memberOf R
+ * @since v0.26.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig [Idx] -> {a} -> Boolean
+ * @param {Array} path The path to use.
+ * @param {Object} obj The object to check the path in.
+ * @return {Boolean} Whether the path exists.
+ * @see R.has
+ * @example
+ *
+ * R.hasPath(['a', 'b'], {a: {b: 2}}); // => true
+ * R.hasPath(['a', 'b'], {a: {b: undefined}}); // => true
+ * R.hasPath(['a', 'b'], {a: {c: 2}}); // => false
+ * R.hasPath(['a', 'b'], {}); // => false
*/
-function baseGet(object, path) {
- path = castPath(path, object);
- var index = 0,
- length = path.length;
-
- while (object != null && index < length) {
- object = object[toKey(path[index++])];
+var hasPath = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function hasPath(_path, obj) {
+ if (_path.length === 0 || (0,_isNil_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj)) {
+ return false;
}
- return (index && index == length) ? object : undefined;
-}
-
-module.exports = baseGet;
-
+ var val = obj;
+ var idx = 0;
+ while (idx < _path.length) {
+ if (!(0,_isNil_js__WEBPACK_IMPORTED_MODULE_1__["default"])(val) && (0,_internal_has_js__WEBPACK_IMPORTED_MODULE_2__["default"])(_path[idx], val)) {
+ val = val[_path[idx]];
+ idx += 1;
+ } else {
+ return false;
+ }
+ }
+ return true;
+});
+/* harmony default export */ __webpack_exports__["default"] = (hasPath);
/***/ }),
-/***/ "./node_modules/lodash/_baseGetAllKeys.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_baseGetAllKeys.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/identity.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/identity.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_identity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_identity.js */ "./node_modules/ramda/es/internal/_identity.js");
-var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
/**
- * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
- * `keysFunc` and `symbolsFunc` to get the enumerable property names and
- * symbols of `object`.
+ * A function that does nothing but return the parameter supplied to it. Good
+ * as a default or placeholder function.
*
- * @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.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Function
+ * @sig a -> a
+ * @param {*} x The value to return.
+ * @return {*} The input value, `x`.
+ * @example
+ *
+ * R.identity(1); //=> 1
+ *
+ * const obj = {};
+ * R.identity(obj) === obj; //=> true
+ * @symb R.identity(a) = a
*/
-function baseGetAllKeys(object, keysFunc, symbolsFunc) {
- var result = keysFunc(object);
- return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
-}
-
-module.exports = baseGetAllKeys;
+var identity = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(_internal_identity_js__WEBPACK_IMPORTED_MODULE_1__["default"]);
+/* harmony default export */ __webpack_exports__["default"] = (identity);
/***/ }),
-/***/ "./node_modules/lodash/_baseGetTag.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseGetTag.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
- getRawTag = __webpack_require__(/*! ./_getRawTag */ "./node_modules/lodash/_getRawTag.js"),
- objectToString = __webpack_require__(/*! ./_objectToString */ "./node_modules/lodash/_objectToString.js");
+/***/ "./node_modules/ramda/es/includes.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/includes.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** `Object#toString` result references. */
-var nullTag = '[object Null]',
- undefinedTag = '[object Undefined]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_includes_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_includes.js */ "./node_modules/ramda/es/internal/_includes.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-/** Built-in value references. */
-var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
/**
- * The base implementation of `getTag` without fallbacks for buggy environments.
+ * Returns `true` if the specified value is equal, in [`R.equals`](#equals)
+ * terms, to at least one element of the given list; `false` otherwise.
+ * Also works with strings.
*
- * @private
- * @param {*} value The value to query.
- * @returns {string} Returns the `toStringTag`.
+ * @func
+ * @memberOf R
+ * @since v0.26.0
+ * @category List
+ * @sig a -> [a] -> Boolean
+ * @param {Object} a The item to compare against.
+ * @param {Array} list The array to consider.
+ * @return {Boolean} `true` if an equivalent item is in the list, `false` otherwise.
+ * @see R.any
+ * @example
+ *
+ * R.includes(3, [1, 2, 3]); //=> true
+ * R.includes(4, [1, 2, 3]); //=> false
+ * R.includes({ name: 'Fred' }, [{ name: 'Fred' }]); //=> true
+ * R.includes([42], [[42]]); //=> true
+ * R.includes('ba', 'banana'); //=>true
*/
-function baseGetTag(value) {
- if (value == null) {
- return value === undefined ? undefinedTag : nullTag;
- }
- return (symToStringTag && symToStringTag in Object(value))
- ? getRawTag(value)
- : objectToString(value);
-}
-
-module.exports = baseGetTag;
+var includes = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(_internal_includes_js__WEBPACK_IMPORTED_MODULE_1__["default"]);
+/* harmony default export */ __webpack_exports__["default"] = (includes);
/***/ }),
-/***/ "./node_modules/lodash/_baseGt.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/_baseGt.js ***!
- \****************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/indexOf.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/indexOf.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_indexOf_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_indexOf.js */ "./node_modules/ramda/es/internal/_indexOf.js");
+/* harmony import */ var _internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+
+
/**
- * The base implementation of `_.gt` which doesn't coerce arguments.
+ * Returns the position of the first occurrence of an item in an array, or -1
+ * if the item is not included in the array. [`R.equals`](#equals) is used to
+ * determine equality.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig a -> [a] -> Number
+ * @param {*} target The item to find.
+ * @param {Array} xs The array to search in.
+ * @return {Number} the index of the target, or -1 if the target is not found.
+ * @see R.lastIndexOf, R.findIndex
+ * @example
*
- * @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`.
+ * R.indexOf(3, [1,2,3,4]); //=> 2
+ * R.indexOf(10, [1,2,3,4]); //=> -1
*/
-function baseGt(value, other) {
- return value > other;
-}
-
-module.exports = baseGt;
+var indexOf = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function indexOf(target, xs) {
+ return typeof xs.indexOf === 'function' && !(0,_internal_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(xs) ? xs.indexOf(target) : (0,_internal_indexOf_js__WEBPACK_IMPORTED_MODULE_2__["default"])(xs, target, 0);
+});
+/* harmony default export */ __webpack_exports__["default"] = (indexOf);
/***/ }),
-/***/ "./node_modules/lodash/_baseHas.js":
+/***/ "./node_modules/ramda/es/insert.js":
/*!*****************************************!*\
- !*** ./node_modules/lodash/_baseHas.js ***!
+ !*** ./node_modules/ramda/es/insert.js ***!
\*****************************************/
-/***/ (function(module) {
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
/**
- * The base implementation of `_.has` without support for deep paths.
+ * Inserts the supplied element into the list, at the specified `index`. _Note that
+
+ * this is not destructive_: it returns a copy of the list with the changes.
+ * <small>No lists have been harmed in the application of this function.</small>
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.2.2
+ * @category List
+ * @sig Number -> a -> [a] -> [a]
+ * @param {Number} index The position to insert the element
+ * @param {*} elt The element to insert into the Array
+ * @param {Array} list The list to insert into
+ * @return {Array} A new Array with `elt` inserted at `index`.
+ * @example
+ *
+ * R.insert(2, 'x', [1,2,3,4]); //=> [1,2,'x',3,4]
*/
-function baseHas(object, key) {
- return object != null && hasOwnProperty.call(object, key);
-}
-
-module.exports = baseHas;
+var insert = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function insert(idx, elt, list) {
+ idx = idx < list.length && idx >= 0 ? idx : list.length;
+ var result = Array.prototype.slice.call(list, 0);
+ result.splice(idx, 0, elt);
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (insert);
/***/ }),
-/***/ "./node_modules/lodash/_baseHasIn.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseHasIn.js ***!
- \*******************************************/
-/***/ (function(module) {
-
-/**
- * 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);
-}
+/***/ "./node_modules/ramda/es/internal/_Set.js":
+/*!************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_Set.js ***!
+ \************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-module.exports = baseHasIn;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _includes_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_includes.js */ "./node_modules/ramda/es/internal/_includes.js");
+var _Set = /*#__PURE__*/
+function () {
+ function _Set() {
+ /* globals Set */
+ this._nativeSet = typeof Set === 'function' ? new Set() : null;
+ this._items = {};
+ }
-/***/ }),
+ // until we figure out why jsdoc chokes on this
+ // @param item The item to add to the Set
+ // @returns {boolean} true if the item did not exist prior, otherwise false
+ //
+ _Set.prototype.add = function (item) {
+ return !hasOrAdd(item, true, this);
+ }; //
+ // @param item The item to check for existence in the Set
+ // @returns {boolean} true if the item exists in the Set, otherwise false
+ //
-/***/ "./node_modules/lodash/_baseIndexOf.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseIndexOf.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ _Set.prototype.has = function (item) {
+ return hasOrAdd(item, false, this);
+ }; //
+ // Combines the logic for checking whether an item is a member of the set and
+ // for adding a new item to the set.
+ //
+ // @param item The item to check or add to the Set instance.
+ // @param shouldAdd If true, the item will be added to the set if it doesn't
+ // already exist.
+ // @param set The set instance to check or add to.
+ // @return {boolean} true if the item already existed, otherwise false.
+ //
-var baseFindIndex = __webpack_require__(/*! ./_baseFindIndex */ "./node_modules/lodash/_baseFindIndex.js"),
- baseIsNaN = __webpack_require__(/*! ./_baseIsNaN */ "./node_modules/lodash/_baseIsNaN.js"),
- strictIndexOf = __webpack_require__(/*! ./_strictIndexOf */ "./node_modules/lodash/_strictIndexOf.js");
+ return _Set;
+}();
+function hasOrAdd(item, shouldAdd, set) {
+ var type = typeof item;
+ var prevSize, newSize;
+ switch (type) {
+ case 'string':
+ case 'number':
+ // distinguish between +0 and -0
+ if (item === 0 && 1 / item === -Infinity) {
+ if (set._items['-0']) {
+ return true;
+ } else {
+ if (shouldAdd) {
+ set._items['-0'] = true;
+ }
+ return false;
+ }
+ } // these types can all utilise the native Set
-/**
- * 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);
-}
+ if (set._nativeSet !== null) {
+ if (shouldAdd) {
+ prevSize = set._nativeSet.size;
+ set._nativeSet.add(item);
+ newSize = set._nativeSet.size;
+ return newSize === prevSize;
+ } else {
+ return set._nativeSet.has(item);
+ }
+ } else {
+ if (!(type in set._items)) {
+ if (shouldAdd) {
+ set._items[type] = {};
+ set._items[type][item] = true;
+ }
+ return false;
+ } else if (item in set._items[type]) {
+ return true;
+ } else {
+ if (shouldAdd) {
+ set._items[type][item] = true;
+ }
+ return false;
+ }
+ }
+ case 'boolean':
+ // set._items['boolean'] holds a two element array
+ // representing [ falseExists, trueExists ]
+ if (type in set._items) {
+ var bIdx = item ? 1 : 0;
+ if (set._items[type][bIdx]) {
+ return true;
+ } else {
+ if (shouldAdd) {
+ set._items[type][bIdx] = true;
+ }
+ return false;
+ }
+ } else {
+ if (shouldAdd) {
+ set._items[type] = item ? [false, true] : [true, false];
+ }
+ return false;
+ }
+ case 'function':
+ // compare functions for reference equality
+ if (set._nativeSet !== null) {
+ if (shouldAdd) {
+ prevSize = set._nativeSet.size;
+ set._nativeSet.add(item);
+ newSize = set._nativeSet.size;
+ return newSize === prevSize;
+ } else {
+ return set._nativeSet.has(item);
+ }
+ } else {
+ if (!(type in set._items)) {
+ if (shouldAdd) {
+ set._items[type] = [item];
+ }
+ return false;
+ }
+ if (!(0,_includes_js__WEBPACK_IMPORTED_MODULE_0__["default"])(item, set._items[type])) {
+ if (shouldAdd) {
+ set._items[type].push(item);
+ }
+ return false;
+ }
+ return true;
+ }
+ case 'undefined':
+ if (set._items[type]) {
+ return true;
+ } else {
+ if (shouldAdd) {
+ set._items[type] = true;
+ }
+ return false;
+ }
+ case 'object':
+ if (item === null) {
+ if (!set._items['null']) {
+ if (shouldAdd) {
+ set._items['null'] = true;
+ }
+ return false;
+ }
+ return true;
+ }
-module.exports = baseIndexOf;
+ /* falls through */
+ default:
+ // reduce the search size of heterogeneous sets by creating buckets
+ // for each type.
+ type = Object.prototype.toString.call(item);
+ if (!(type in set._items)) {
+ if (shouldAdd) {
+ set._items[type] = [item];
+ }
+ return false;
+ } // scan through all previously applied items
-/***/ }),
+ if (!(0,_includes_js__WEBPACK_IMPORTED_MODULE_0__["default"])(item, set._items[type])) {
+ if (shouldAdd) {
+ set._items[type].push(item);
+ }
+ return false;
+ }
+ return true;
+ }
+} // A simple Set type that honours R.equals semantics
-/***/ "./node_modules/lodash/_baseIsArguments.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_baseIsArguments.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/* harmony default export */ __webpack_exports__["default"] = (_Set);
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+/***/ }),
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]';
+/***/ "./node_modules/ramda/es/internal/_arity.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_arity.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arity; }
+/* harmony export */ });
+function _arity(n, fn) {
+ /* eslint-disable no-unused-vars */
+ switch (n) {
+ case 0:
+ return function () {
+ return fn.apply(this, arguments);
+ };
+ case 1:
+ return function (a0) {
+ return fn.apply(this, arguments);
+ };
+ case 2:
+ return function (a0, a1) {
+ return fn.apply(this, arguments);
+ };
+ case 3:
+ return function (a0, a1, a2) {
+ return fn.apply(this, arguments);
+ };
+ case 4:
+ return function (a0, a1, a2, a3) {
+ return fn.apply(this, arguments);
+ };
+ case 5:
+ return function (a0, a1, a2, a3, a4) {
+ return fn.apply(this, arguments);
+ };
+ case 6:
+ return function (a0, a1, a2, a3, a4, a5) {
+ return fn.apply(this, arguments);
+ };
+ case 7:
+ return function (a0, a1, a2, a3, a4, a5, a6) {
+ return fn.apply(this, arguments);
+ };
+ case 8:
+ return function (a0, a1, a2, a3, a4, a5, a6, a7) {
+ return fn.apply(this, arguments);
+ };
+ case 9:
+ return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {
+ return fn.apply(this, arguments);
+ };
+ case 10:
+ return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {
+ return fn.apply(this, arguments);
+ };
+ default:
+ throw new Error('First argument to _arity must be a non-negative integer no greater than ten');
+ }
}
-module.exports = baseIsArguments;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsEqual.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseIsEqual.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var baseIsEqualDeep = __webpack_require__(/*! ./_baseIsEqualDeep */ "./node_modules/lodash/_baseIsEqualDeep.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+/***/ "./node_modules/ramda/es/internal/_arrayFromIterator.js":
+/*!**************************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_arrayFromIterator.js ***!
+ \**************************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arrayFromIterator; }
+/* harmony export */ });
+function _arrayFromIterator(iter) {
+ var list = [];
+ var next;
+ while (!(next = iter.next()).done) {
+ list.push(next.value);
}
- return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+ return list;
}
-module.exports = baseIsEqual;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsEqualDeep.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_baseIsEqualDeep.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_arrayReduce.js":
+/*!********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_arrayReduce.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
- equalArrays = __webpack_require__(/*! ./_equalArrays */ "./node_modules/lodash/_equalArrays.js"),
- equalByTag = __webpack_require__(/*! ./_equalByTag */ "./node_modules/lodash/_equalByTag.js"),
- equalObjects = __webpack_require__(/*! ./_equalObjects */ "./node_modules/lodash/_equalObjects.js"),
- getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _arrayReduce; }
+/* harmony export */ });
+function _arrayReduce(reducer, acc, list) {
+ var index = 0;
+ var length = list.length;
+ while (index < length) {
+ acc = reducer(acc, list[index]);
+ index += 1;
+ }
+ return acc;
+}
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1;
+/***/ }),
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]',
- arrayTag = '[object Array]',
- objectTag = '[object Object]';
+/***/ "./node_modules/ramda/es/internal/_assoc.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_assoc.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _assoc; }
+/* harmony export */ });
+/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _isInteger_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * 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;
+ * Makes a shallow clone of an object, setting or overriding the specified
+ * property with the given value. Note that this copies and flattens prototype
+ * properties onto the new object as well. All non-primitive properties are
+ * copied by reference.
+ *
+ * @private
+ * @param {String|Number} prop The property name to set
+ * @param {*} val The new value
+ * @param {Object|Array} obj The object to clone
+ * @return {Object|Array} A new object equivalent to the original except for the changed property.
+ */
- stack || (stack = new Stack);
- return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
- }
+function _assoc(prop, val, obj) {
+ if ((0,_isInteger_js__WEBPACK_IMPORTED_MODULE_0__["default"])(prop) && (0,_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj)) {
+ var arr = [].concat(obj);
+ arr[prop] = val;
+ return arr;
}
- if (!isSameTag) {
- return false;
+ var result = {};
+ for (var p in obj) {
+ result[p] = obj[p];
}
- stack || (stack = new Stack);
- return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+ result[prop] = val;
+ return result;
}
-module.exports = baseIsEqualDeep;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsMap.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseIsMap.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+/***/ "./node_modules/ramda/es/internal/_checkForMethod.js":
+/*!***********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_checkForMethod.js ***!
+ \***********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** `Object#toString` result references. */
-var mapTag = '[object Map]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _checkForMethod; }
+/* harmony export */ });
+/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
/**
- * The base implementation of `_.isMap` without Node.js optimizations.
+ * This checks whether a function has a [methodname] function. If it isn't an
+ * array it will execute that function otherwise it will default to the ramda
+ * implementation.
*
* @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a map, else `false`.
+ * @param {Function} fn ramda implementation
+ * @param {String} methodname property to check for a custom implementation
+ * @return {Object} Whatever the return value of the method is.
*/
-function baseIsMap(value) {
- return isObjectLike(value) && getTag(value) == mapTag;
-}
-
-module.exports = baseIsMap;
+function _checkForMethod(methodname, fn) {
+ return function () {
+ var length = arguments.length;
+ if (length === 0) {
+ return fn();
+ }
+ var obj = arguments[length - 1];
+ return (0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__["default"])(obj) || typeof obj[methodname] !== 'function' ? fn.apply(this, arguments) : obj[methodname].apply(obj, Array.prototype.slice.call(arguments, 0, length - 1));
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_baseIsMatch.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseIsMatch.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_clone.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_clone.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
- baseIsEqual = __webpack_require__(/*! ./_baseIsEqual */ "./node_modules/lodash/_baseIsEqual.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _clone; }
+/* harmony export */ });
+/* harmony import */ var _cloneRegExp_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_cloneRegExp.js */ "./node_modules/ramda/es/internal/_cloneRegExp.js");
+/* harmony import */ var _type_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../type.js */ "./node_modules/ramda/es/type.js");
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1,
- COMPARE_UNORDERED_FLAG = 2;
/**
- * The base implementation of `_.isMatch` without support for iteratee shorthands.
+ * Copies an object.
*
* @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`.
+ * @param {*} value The value to be copied
+ * @param {Boolean} deep Whether or not to perform deep cloning.
+ * @return {*} The copied value.
*/
-function baseIsMatch(object, source, matchData, customizer) {
- var index = matchData.length,
- length = index,
- noCustomizer = !customizer;
- if (object == null) {
- return !length;
+function _clone(value, deep, map) {
+ map || (map = new _ObjectMap()); // this avoids the slower switch with a quick if decision removing some milliseconds in each run.
+
+ if (_isPrimitive(value)) {
+ return value;
}
- object = Object(object);
- while (index--) {
- var data = matchData[index];
- if ((noCustomizer && data[2])
- ? data[1] !== object[data[0]]
- : !(data[0] in object)
- ) {
- return false;
+ var copy = function copy(copiedValue) {
+ // Check for circular and same references on the object graph and return its corresponding clone.
+ var cachedCopy = map.get(value);
+ if (cachedCopy) {
+ return cachedCopy;
}
- }
- 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;
+ map.set(value, copiedValue);
+ for (var key in value) {
+ if (Object.prototype.hasOwnProperty.call(value, key)) {
+ copiedValue[key] = deep ? _clone(value[key], true, map) : value[key];
}
}
+ return copiedValue;
+ };
+ switch ((0,_type_js__WEBPACK_IMPORTED_MODULE_0__["default"])(value)) {
+ case 'Object':
+ return copy(Object.create(Object.getPrototypeOf(value)));
+ case 'Array':
+ return copy([]);
+ case 'Date':
+ return new Date(value.valueOf());
+ case 'RegExp':
+ return (0,_cloneRegExp_js__WEBPACK_IMPORTED_MODULE_1__["default"])(value);
+ case 'Int8Array':
+ case 'Uint8Array':
+ case 'Uint8ClampedArray':
+ case 'Int16Array':
+ case 'Uint16Array':
+ case 'Int32Array':
+ case 'Uint32Array':
+ case 'Float32Array':
+ case 'Float64Array':
+ case 'BigInt64Array':
+ case 'BigUint64Array':
+ return value.slice();
+ default:
+ return value;
}
- return true;
}
-
-module.exports = baseIsMatch;
-
+function _isPrimitive(param) {
+ var type = typeof param;
+ return param == null || type != 'object' && type != 'function';
+}
+var _ObjectMap = /*#__PURE__*/
+function () {
+ function _ObjectMap() {
+ this.map = {};
+ this.length = 0;
+ }
+ _ObjectMap.prototype.set = function (key, value) {
+ var hashedKey = this.hash(key);
+ var bucket = this.map[hashedKey];
+ if (!bucket) {
+ this.map[hashedKey] = bucket = [];
+ }
+ bucket.push([key, value]);
+ this.length += 1;
+ };
+ _ObjectMap.prototype.hash = function (key) {
+ var hashedKey = [];
+ for (var value in key) {
+ hashedKey.push(Object.prototype.toString.call(key[value]));
+ }
+ return hashedKey.join();
+ };
+ _ObjectMap.prototype.get = function (key) {
+ /**
+ * depending on the number of objects to be cloned is faster to just iterate over the items in the map just because the hash function is so costly,
+ * on my tests this number is 180, anything above that using the hash function is faster.
+ */
+ if (this.length <= 180) {
+ for (var p in this.map) {
+ var _bucket = this.map[p];
+ for (var i = 0; i < _bucket.length; i += 1) {
+ var element = _bucket[i];
+ if (element[0] === key) {
+ return element[1];
+ }
+ }
+ }
+ return;
+ }
+ var hashedKey = this.hash(key);
+ var bucket = this.map[hashedKey];
+ if (!bucket) {
+ return;
+ }
+ for (var _i = 0; _i < bucket.length; _i += 1) {
+ var _element = bucket[_i];
+ if (_element[0] === key) {
+ return _element[1];
+ }
+ }
+ };
+ return _ObjectMap;
+}();
/***/ }),
-/***/ "./node_modules/lodash/_baseIsNaN.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseIsNaN.js ***!
- \*******************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_cloneRegExp.js":
+/*!********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_cloneRegExp.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _cloneRegExp; }
+/* harmony export */ });
+function _cloneRegExp(pattern) {
+ return new RegExp(pattern.source, pattern.flags ? pattern.flags : (pattern.global ? 'g' : '') + (pattern.ignoreCase ? 'i' : '') + (pattern.multiline ? 'm' : '') + (pattern.sticky ? 'y' : '') + (pattern.unicode ? 'u' : '') + (pattern.dotAll ? 's' : ''));
}
-module.exports = baseIsNaN;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsNative.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseIsNative.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
- isMasked = __webpack_require__(/*! ./_isMasked */ "./node_modules/lodash/_isMasked.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- toSource = __webpack_require__(/*! ./_toSource */ "./node_modules/lodash/_toSource.js");
-
-/**
- * Used to match `RegExp`
- * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
- */
-var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
-
-/** Used to detect host constructors (Safari). */
-var reIsHostCtor = /^\[object .+?Constructor\]$/;
-
-/** Used for built-in method references. */
-var funcProto = Function.prototype,
- objectProto = Object.prototype;
+/***/ "./node_modules/ramda/es/internal/_complement.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_complement.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to resolve the decompiled source of functions. */
-var funcToString = funcProto.toString;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _complement; }
+/* harmony export */ });
+function _complement(f) {
+ return function () {
+ return !f.apply(this, arguments);
+ };
+}
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+/***/ }),
-/** Used to detect if a method is native. */
-var reIsNative = RegExp('^' +
- funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
- .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
-);
+/***/ "./node_modules/ramda/es/internal/_concat.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_concat.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _concat; }
+/* harmony export */ });
/**
- * The base implementation of `_.isNative` without bad shim checks.
+ * Private `concat` function to merge two array-like objects.
*
* @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a native function,
- * else `false`.
+ * @param {Array|Arguments} [set1=[]] An array-like object.
+ * @param {Array|Arguments} [set2=[]] An array-like object.
+ * @return {Array} A new, merged array.
+ * @example
+ *
+ * _concat([4, 5, 6], [1, 2, 3]); //=> [4, 5, 6, 1, 2, 3]
*/
-function baseIsNative(value) {
- if (!isObject(value) || isMasked(value)) {
- return false;
+function _concat(set1, set2) {
+ set1 = set1 || [];
+ set2 = set2 || [];
+ var idx;
+ var len1 = set1.length;
+ var len2 = set2.length;
+ var result = [];
+ idx = 0;
+ while (idx < len1) {
+ result[result.length] = set1[idx];
+ idx += 1;
}
- var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
- return pattern.test(toSource(value));
+ idx = 0;
+ while (idx < len2) {
+ result[result.length] = set2[idx];
+ idx += 1;
+ }
+ return result;
}
-module.exports = baseIsNative;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsSet.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseIsSet.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+/***/ "./node_modules/ramda/es/internal/_createReduce.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_createReduce.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** `Object#toString` result references. */
-var setTag = '[object Set]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _createReduce; }
+/* harmony export */ });
+/* harmony import */ var _isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isArrayLike.js */ "./node_modules/ramda/es/internal/_isArrayLike.js");
-/**
- * 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;
+var symIterator = typeof Symbol !== 'undefined' ? Symbol.iterator : '@@iterator';
+function _createReduce(arrayReduce, methodReduce, iterableReduce) {
+ return function _reduce(xf, acc, list) {
+ if ((0,_isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__["default"])(list)) {
+ return arrayReduce(xf, acc, list);
+ }
+ if (list == null) {
+ return acc;
+ }
+ if (typeof list['fantasy-land/reduce'] === 'function') {
+ return methodReduce(xf, acc, list, 'fantasy-land/reduce');
+ }
+ if (list[symIterator] != null) {
+ return iterableReduce(xf, acc, list[symIterator]());
+ }
+ if (typeof list.next === 'function') {
+ return iterableReduce(xf, acc, list);
+ }
+ if (typeof list.reduce === 'function') {
+ return methodReduce(xf, acc, list, 'reduce');
+ }
+ throw new TypeError('reduce: list must be array or iterable');
+ };
}
-module.exports = baseIsSet;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseIsTypedArray.js":
-/*!**************************************************!*\
- !*** ./node_modules/lodash/_baseIsTypedArray.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
-
-/** `Object#toString` result references. */
-var argsTag = '[object Arguments]',
- arrayTag = '[object Array]',
- boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- errorTag = '[object Error]',
- funcTag = '[object Function]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- objectTag = '[object Object]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- weakMapTag = '[object WeakMap]';
-
-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]';
+/***/ "./node_modules/ramda/es/internal/_curry1.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_curry1.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _curry1; }
+/* harmony export */ });
+/* harmony import */ var _isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isPlaceholder.js */ "./node_modules/ramda/es/internal/_isPlaceholder.js");
/**
- * The base implementation of `_.isTypedArray` without Node.js optimizations.
+ * Optimized internal one-arity curry function.
*
* @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
+ * @category Function
+ * @param {Function} fn The function to curry.
+ * @return {Function} The curried function.
*/
-function baseIsTypedArray(value) {
- return isObjectLike(value) &&
- isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
-}
-
-module.exports = baseIsTypedArray;
+function _curry1(fn) {
+ return function f1(a) {
+ if (arguments.length === 0 || (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a)) {
+ return f1;
+ } else {
+ return fn.apply(this, arguments);
+ }
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_baseIteratee.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseIteratee.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_curry2.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_curry2.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _curry2; }
+/* harmony export */ });
+/* harmony import */ var _curry1_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isPlaceholder.js */ "./node_modules/ramda/es/internal/_isPlaceholder.js");
-var baseMatches = __webpack_require__(/*! ./_baseMatches */ "./node_modules/lodash/_baseMatches.js"),
- baseMatchesProperty = __webpack_require__(/*! ./_baseMatchesProperty */ "./node_modules/lodash/_baseMatchesProperty.js"),
- identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- property = __webpack_require__(/*! ./property */ "./node_modules/lodash/property.js");
/**
- * The base implementation of `_.iteratee`.
+ * Optimized internal two-arity curry function.
*
* @private
- * @param {*} [value=_.identity] The value to convert to an iteratee.
- * @returns {Function} Returns the iteratee.
+ * @category Function
+ * @param {Function} fn The function to curry.
+ * @return {Function} The curried function.
*/
-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);
-}
-
-module.exports = baseIteratee;
+function _curry2(fn) {
+ return function f2(a, b) {
+ switch (arguments.length) {
+ case 0:
+ return f2;
+ case 1:
+ return (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) ? f2 : (0,_curry1_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_b) {
+ return fn(a, _b);
+ });
+ default:
+ return (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? f2 : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) ? (0,_curry1_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_a) {
+ return fn(_a, b);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? (0,_curry1_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_b) {
+ return fn(a, _b);
+ }) : fn(a, b);
+ }
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_baseKeys.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_baseKeys.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_curry3.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_curry3.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
- nativeKeys = __webpack_require__(/*! ./_nativeKeys */ "./node_modules/lodash/_nativeKeys.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _curry3; }
+/* harmony export */ });
+/* harmony import */ var _curry1_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _curry2_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isPlaceholder.js */ "./node_modules/ramda/es/internal/_isPlaceholder.js");
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
+ * Optimized internal three-arity curry function.
*
* @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names.
+ * @category Function
+ * @param {Function} fn The function to curry.
+ * @return {Function} The curried function.
*/
-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);
+
+function _curry3(fn) {
+ return function f3(a, b, c) {
+ switch (arguments.length) {
+ case 0:
+ return f3;
+ case 1:
+ return (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) ? f3 : (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_b, _c) {
+ return fn(a, _b, _c);
+ });
+ case 2:
+ return (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? f3 : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) ? (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_a, _c) {
+ return fn(_a, b, _c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_b, _c) {
+ return fn(a, _b, _c);
+ }) : (0,_curry1_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function (_c) {
+ return fn(a, b, _c);
+ });
+ default:
+ return (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(c) ? f3 : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_a, _b) {
+ return fn(_a, _b, c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(c) ? (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_a, _c) {
+ return fn(_a, b, _c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) && (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(c) ? (0,_curry2_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_b, _c) {
+ return fn(a, _b, _c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(a) ? (0,_curry1_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function (_a) {
+ return fn(_a, b, c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(b) ? (0,_curry1_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function (_b) {
+ return fn(a, _b, c);
+ }) : (0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(c) ? (0,_curry1_js__WEBPACK_IMPORTED_MODULE_2__["default"])(function (_c) {
+ return fn(a, b, _c);
+ }) : fn(a, b, c);
}
- }
- return result;
+ };
}
-module.exports = baseKeys;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseKeysIn.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseKeysIn.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
- nativeKeysIn = __webpack_require__(/*! ./_nativeKeysIn */ "./node_modules/lodash/_nativeKeysIn.js");
+/***/ "./node_modules/ramda/es/internal/_curryN.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_curryN.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _curryN; }
+/* harmony export */ });
+/* harmony import */ var _arity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_arity.js */ "./node_modules/ramda/es/internal/_arity.js");
+/* harmony import */ var _isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isPlaceholder.js */ "./node_modules/ramda/es/internal/_isPlaceholder.js");
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
+ * Internal curryN function.
*
* @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names.
+ * @category Function
+ * @param {Number} length The arity of the curried function.
+ * @param {Array} received An array of arguments received thus far.
+ * @param {Function} fn The function to curry.
+ * @return {Function} The curried function.
*/
-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);
+function _curryN(length, received, fn) {
+ return function () {
+ var combined = [];
+ var argsIdx = 0;
+ var left = length;
+ var combinedIdx = 0;
+ var hasPlaceholder = false;
+ while (combinedIdx < received.length || argsIdx < arguments.length) {
+ var result;
+ if (combinedIdx < received.length && (!(0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(received[combinedIdx]) || argsIdx >= arguments.length)) {
+ result = received[combinedIdx];
+ } else {
+ result = arguments[argsIdx];
+ argsIdx += 1;
+ }
+ combined[combinedIdx] = result;
+ if (!(0,_isPlaceholder_js__WEBPACK_IMPORTED_MODULE_0__["default"])(result)) {
+ left -= 1;
+ } else {
+ hasPlaceholder = true;
+ }
+ combinedIdx += 1;
}
- }
- return result;
+ return !hasPlaceholder && left <= 0 ? fn.apply(this, combined) : (0,_arity_js__WEBPACK_IMPORTED_MODULE_1__["default"])(Math.max(0, left), _curryN(length, combined, fn));
+ };
}
-module.exports = baseKeysIn;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_dispatchable.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_dispatchable.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _dispatchable; }
+/* harmony export */ });
+/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _isTransformer_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_isTransformer.js */ "./node_modules/ramda/es/internal/_isTransformer.js");
-/***/ "./node_modules/lodash/_baseLt.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/_baseLt.js ***!
- \****************************************/
-/***/ (function(module) {
/**
- * The base implementation of `_.lt` which doesn't coerce arguments.
+ * Returns a function that dispatches with different strategies based on the
+ * object in list position (last argument). If it is an array, executes [fn].
+ * Otherwise, if it has a function with one of the given method names, it will
+ * execute that function (functor case). Otherwise, if it is a transformer,
+ * uses transducer created by [transducerCreator] to return a new transformer
+ * (transducer case).
+ * Otherwise, it will default to executing [fn].
*
* @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`.
+ * @param {Array} methodNames properties to check for a custom implementation
+ * @param {Function} transducerCreator transducer factory if object is transformer
+ * @param {Function} fn default ramda implementation
+ * @return {Function} A function that dispatches on object in list position
*/
-function baseLt(value, other) {
- return value < other;
+
+function _dispatchable(methodNames, transducerCreator, fn) {
+ return function () {
+ if (arguments.length === 0) {
+ return fn();
+ }
+ var obj = arguments[arguments.length - 1];
+ if (!(0,_isArray_js__WEBPACK_IMPORTED_MODULE_0__["default"])(obj)) {
+ var idx = 0;
+ while (idx < methodNames.length) {
+ if (typeof obj[methodNames[idx]] === 'function') {
+ return obj[methodNames[idx]].apply(obj, Array.prototype.slice.call(arguments, 0, -1));
+ }
+ idx += 1;
+ }
+ if ((0,_isTransformer_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj)) {
+ var transducer = transducerCreator.apply(null, Array.prototype.slice.call(arguments, 0, -1));
+ return transducer(obj);
+ }
+ }
+ return fn.apply(this, arguments);
+ };
}
-module.exports = baseLt;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_dissoc.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_dissoc.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _dissoc; }
+/* harmony export */ });
+/* harmony import */ var _isInteger_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
+/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _remove_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../remove.js */ "./node_modules/ramda/es/remove.js");
-/***/ "./node_modules/lodash/_baseMap.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_baseMap.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
/**
- * The base implementation of `_.map` without support for iteratee shorthands.
+ * Returns a new object that does not contain a `prop` property.
*
* @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.
+ * @param {String|Number} prop The name of the property to dissociate
+ * @param {Object|Array} obj The object to clone
+ * @return {Object} A new object equivalent to the original but without the specified property
*/
-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);
- });
+function _dissoc(prop, obj) {
+ if (obj == null) {
+ return obj;
+ }
+ if ((0,_isInteger_js__WEBPACK_IMPORTED_MODULE_0__["default"])(prop) && (0,_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj)) {
+ return (0,_remove_js__WEBPACK_IMPORTED_MODULE_2__["default"])(prop, 1, obj);
+ }
+ var result = {};
+ for (var p in obj) {
+ result[p] = obj[p];
+ }
+ delete result[prop];
return result;
}
-module.exports = baseMap;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_equals.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_equals.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _equals; }
+/* harmony export */ });
+/* harmony import */ var _arrayFromIterator_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_arrayFromIterator.js */ "./node_modules/ramda/es/internal/_arrayFromIterator.js");
+/* harmony import */ var _includesWith_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_includesWith.js */ "./node_modules/ramda/es/internal/_includesWith.js");
+/* harmony import */ var _functionName_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./_functionName.js */ "./node_modules/ramda/es/internal/_functionName.js");
+/* harmony import */ var _has_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _objectIs_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_objectIs.js */ "./node_modules/ramda/es/internal/_objectIs.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../keys.js */ "./node_modules/ramda/es/keys.js");
+/* harmony import */ var _type_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../type.js */ "./node_modules/ramda/es/type.js");
+
+
-/***/ }),
-/***/ "./node_modules/lodash/_baseMatches.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseMatches.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseIsMatch = __webpack_require__(/*! ./_baseIsMatch */ "./node_modules/lodash/_baseIsMatch.js"),
- getMatchData = __webpack_require__(/*! ./_getMatchData */ "./node_modules/lodash/_getMatchData.js"),
- matchesStrictComparable = __webpack_require__(/*! ./_matchesStrictComparable */ "./node_modules/lodash/_matchesStrictComparable.js");
/**
- * The base implementation of `_.matches` which doesn't clone `source`.
+ * private _uniqContentEquals function.
+ * That function is checking equality of 2 iterator contents with 2 assumptions
+ * - iterators lengths are the same
+ * - iterators values are unique
*
- * @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]);
+ * false-positive result will be returned for comparison of, e.g.
+ * - [1,2,3] and [1,2,3,4]
+ * - [1,1,1] and [1,2,3]
+ * */
+
+function _uniqContentEquals(aIterator, bIterator, stackA, stackB) {
+ var a = (0,_arrayFromIterator_js__WEBPACK_IMPORTED_MODULE_0__["default"])(aIterator);
+ var b = (0,_arrayFromIterator_js__WEBPACK_IMPORTED_MODULE_0__["default"])(bIterator);
+ function eq(_a, _b) {
+ return _equals(_a, _b, stackA.slice(), stackB.slice());
+ } // if *a* array contains any element that is not included in *b*
+
+ return !(0,_includesWith_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (b, aItem) {
+ return !(0,_includesWith_js__WEBPACK_IMPORTED_MODULE_1__["default"])(eq, aItem, b);
+ }, b, a);
+}
+function _equals(a, b, stackA, stackB) {
+ if ((0,_objectIs_js__WEBPACK_IMPORTED_MODULE_2__["default"])(a, b)) {
+ return true;
}
- return function(object) {
- return object === source || baseIsMatch(object, source, matchData);
- };
+ var typeA = (0,_type_js__WEBPACK_IMPORTED_MODULE_3__["default"])(a);
+ if (typeA !== (0,_type_js__WEBPACK_IMPORTED_MODULE_3__["default"])(b)) {
+ return false;
+ }
+ if (typeof a['fantasy-land/equals'] === 'function' || typeof b['fantasy-land/equals'] === 'function') {
+ return typeof a['fantasy-land/equals'] === 'function' && a['fantasy-land/equals'](b) && typeof b['fantasy-land/equals'] === 'function' && b['fantasy-land/equals'](a);
+ }
+ if (typeof a.equals === 'function' || typeof b.equals === 'function') {
+ return typeof a.equals === 'function' && a.equals(b) && typeof b.equals === 'function' && b.equals(a);
+ }
+ switch (typeA) {
+ case 'Arguments':
+ case 'Array':
+ case 'Object':
+ if (typeof a.constructor === 'function' && (0,_functionName_js__WEBPACK_IMPORTED_MODULE_4__["default"])(a.constructor) === 'Promise') {
+ return a === b;
+ }
+ break;
+ case 'Boolean':
+ case 'Number':
+ case 'String':
+ if (!(typeof a === typeof b && (0,_objectIs_js__WEBPACK_IMPORTED_MODULE_2__["default"])(a.valueOf(), b.valueOf()))) {
+ return false;
+ }
+ break;
+ case 'Date':
+ if (!(0,_objectIs_js__WEBPACK_IMPORTED_MODULE_2__["default"])(a.valueOf(), b.valueOf())) {
+ return false;
+ }
+ break;
+ case 'Error':
+ return a.name === b.name && a.message === b.message;
+ case 'RegExp':
+ if (!(a.source === b.source && a.global === b.global && a.ignoreCase === b.ignoreCase && a.multiline === b.multiline && a.sticky === b.sticky && a.unicode === b.unicode)) {
+ return false;
+ }
+ break;
+ }
+ var idx = stackA.length - 1;
+ while (idx >= 0) {
+ if (stackA[idx] === a) {
+ return stackB[idx] === b;
+ }
+ idx -= 1;
+ }
+ switch (typeA) {
+ case 'Map':
+ if (a.size !== b.size) {
+ return false;
+ }
+ return _uniqContentEquals(a.entries(), b.entries(), stackA.concat([a]), stackB.concat([b]));
+ case 'Set':
+ if (a.size !== b.size) {
+ return false;
+ }
+ return _uniqContentEquals(a.values(), b.values(), stackA.concat([a]), stackB.concat([b]));
+ case 'Arguments':
+ case 'Array':
+ case 'Object':
+ case 'Boolean':
+ case 'Number':
+ case 'String':
+ case 'Date':
+ case 'Error':
+ case 'RegExp':
+ case 'Int8Array':
+ case 'Uint8Array':
+ case 'Uint8ClampedArray':
+ case 'Int16Array':
+ case 'Uint16Array':
+ case 'Int32Array':
+ case 'Uint32Array':
+ case 'Float32Array':
+ case 'Float64Array':
+ case 'ArrayBuffer':
+ break;
+ default:
+ // Values of other types are only equal if identical.
+ return false;
+ }
+ var keysA = (0,_keys_js__WEBPACK_IMPORTED_MODULE_5__["default"])(a);
+ if (keysA.length !== (0,_keys_js__WEBPACK_IMPORTED_MODULE_5__["default"])(b).length) {
+ return false;
+ }
+ var extendedStackA = stackA.concat([a]);
+ var extendedStackB = stackB.concat([b]);
+ idx = keysA.length - 1;
+ while (idx >= 0) {
+ var key = keysA[idx];
+ if (!((0,_has_js__WEBPACK_IMPORTED_MODULE_6__["default"])(key, b) && _equals(b[key], a[key], extendedStackA, extendedStackB))) {
+ return false;
+ }
+ idx -= 1;
+ }
+ return true;
+}
+
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_filter.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_filter.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _filter; }
+/* harmony export */ });
+function _filter(fn, list) {
+ var idx = 0;
+ var len = list.length;
+ var result = [];
+ while (idx < len) {
+ if (fn(list[idx])) {
+ result[result.length] = list[idx];
+ }
+ idx += 1;
+ }
+ return result;
+}
+
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_functionName.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_functionName.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _functionName; }
+/* harmony export */ });
+function _functionName(f) {
+ // String(x => x) evaluates to "x => x", so the pattern may not match.
+ var match = String(f).match(/^function (\w*)/);
+ return match == null ? '' : match[1];
}
-module.exports = baseMatches;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_has.js":
+/*!************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_has.js ***!
+ \************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _has; }
+/* harmony export */ });
+function _has(prop, obj) {
+ return Object.prototype.hasOwnProperty.call(obj, prop);
+}
/***/ }),
-/***/ "./node_modules/lodash/_baseMatchesProperty.js":
+/***/ "./node_modules/ramda/es/internal/_identity.js":
/*!*****************************************************!*\
- !*** ./node_modules/lodash/_baseMatchesProperty.js ***!
+ !*** ./node_modules/ramda/es/internal/_identity.js ***!
\*****************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var baseIsEqual = __webpack_require__(/*! ./_baseIsEqual */ "./node_modules/lodash/_baseIsEqual.js"),
- get = __webpack_require__(/*! ./get */ "./node_modules/lodash/get.js"),
- hasIn = __webpack_require__(/*! ./hasIn */ "./node_modules/lodash/hasIn.js"),
- isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
- isStrictComparable = __webpack_require__(/*! ./_isStrictComparable */ "./node_modules/lodash/_isStrictComparable.js"),
- matchesStrictComparable = __webpack_require__(/*! ./_matchesStrictComparable */ "./node_modules/lodash/_matchesStrictComparable.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
-
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1,
- COMPARE_UNORDERED_FLAG = 2;
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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);
- };
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _identity; }
+/* harmony export */ });
+function _identity(x) {
+ return x;
}
-module.exports = baseMatchesProperty;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_includes.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_includes.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _includes; }
+/* harmony export */ });
+/* harmony import */ var _indexOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_indexOf.js */ "./node_modules/ramda/es/internal/_indexOf.js");
-/***/ "./node_modules/lodash/_baseMerge.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseMerge.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+function _includes(a, list) {
+ return (0,_indexOf_js__WEBPACK_IMPORTED_MODULE_0__["default"])(list, a, 0) >= 0;
+}
-var Stack = __webpack_require__(/*! ./_Stack */ "./node_modules/lodash/_Stack.js"),
- assignMergeValue = __webpack_require__(/*! ./_assignMergeValue */ "./node_modules/lodash/_assignMergeValue.js"),
- baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
- baseMergeDeep = __webpack_require__(/*! ./_baseMergeDeep */ "./node_modules/lodash/_baseMergeDeep.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js"),
- safeGet = __webpack_require__(/*! ./_safeGet */ "./node_modules/lodash/_safeGet.js");
+/***/ }),
-/**
- * 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) {
- stack || (stack = new Stack);
- if (isObject(srcValue)) {
- baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
- }
- else {
- var newValue = customizer
- ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)
- : undefined;
+/***/ "./node_modules/ramda/es/internal/_includesWith.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_includesWith.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- if (newValue === undefined) {
- newValue = srcValue;
- }
- assignMergeValue(object, key, newValue);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _includesWith; }
+/* harmony export */ });
+function _includesWith(pred, x, list) {
+ var idx = 0;
+ var len = list.length;
+ while (idx < len) {
+ if (pred(x, list[idx])) {
+ return true;
}
- }, keysIn);
+ idx += 1;
+ }
+ return false;
}
-module.exports = baseMerge;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseMergeDeep.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_baseMergeDeep.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var assignMergeValue = __webpack_require__(/*! ./_assignMergeValue */ "./node_modules/lodash/_assignMergeValue.js"),
- cloneBuffer = __webpack_require__(/*! ./_cloneBuffer */ "./node_modules/lodash/_cloneBuffer.js"),
- cloneTypedArray = __webpack_require__(/*! ./_cloneTypedArray */ "./node_modules/lodash/_cloneTypedArray.js"),
- copyArray = __webpack_require__(/*! ./_copyArray */ "./node_modules/lodash/_copyArray.js"),
- initCloneObject = __webpack_require__(/*! ./_initCloneObject */ "./node_modules/lodash/_initCloneObject.js"),
- isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isArrayLikeObject = __webpack_require__(/*! ./isArrayLikeObject */ "./node_modules/lodash/isArrayLikeObject.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- isPlainObject = __webpack_require__(/*! ./isPlainObject */ "./node_modules/lodash/isPlainObject.js"),
- isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js"),
- safeGet = __webpack_require__(/*! ./_safeGet */ "./node_modules/lodash/_safeGet.js"),
- toPlainObject = __webpack_require__(/*! ./toPlainObject */ "./node_modules/lodash/toPlainObject.js");
+/***/ "./node_modules/ramda/es/internal/_indexOf.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_indexOf.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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 = safeGet(object, key),
- srcValue = safeGet(source, key),
- stacked = stack.get(srcValue);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _indexOf; }
+/* harmony export */ });
+/* harmony import */ var _equals_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../equals.js */ "./node_modules/ramda/es/equals.js");
- if (stacked) {
- assignMergeValue(object, key, stacked);
- return;
- }
- var newValue = customizer
- ? customizer(objValue, srcValue, (key + ''), object, source, stack)
- : undefined;
+function _indexOf(list, a, idx) {
+ var inf, item; // Array.prototype.indexOf doesn't exist below IE9
- var isCommon = newValue === undefined;
+ if (typeof list.indexOf === 'function') {
+ switch (typeof a) {
+ case 'number':
+ if (a === 0) {
+ // manually crawl the list to distinguish between +0 and -0
+ inf = 1 / a;
+ while (idx < list.length) {
+ item = list[idx];
+ if (item === 0 && 1 / item === inf) {
+ return idx;
+ }
+ idx += 1;
+ }
+ return -1;
+ } else if (a !== a) {
+ // NaN
+ while (idx < list.length) {
+ item = list[idx];
+ if (typeof item === 'number' && item !== item) {
+ return idx;
+ }
+ idx += 1;
+ }
+ return -1;
+ } // non-zero numbers can utilise Set
- if (isCommon) {
- var isArr = isArray(srcValue),
- isBuff = !isArr && isBuffer(srcValue),
- isTyped = !isArr && !isBuff && isTypedArray(srcValue);
+ return list.indexOf(a, idx);
+ // all these types can utilise Set
- 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) || isFunction(objValue)) {
- newValue = initCloneObject(srcValue);
- }
+ case 'string':
+ case 'boolean':
+ case 'function':
+ case 'undefined':
+ return list.indexOf(a, idx);
+ case 'object':
+ if (a === null) {
+ // null can utilise Set
+ return list.indexOf(a, idx);
+ }
}
- else {
- isCommon = false;
+ } // anything else not covered above, defer to R.equals
+
+ while (idx < list.length) {
+ if ((0,_equals_js__WEBPACK_IMPORTED_MODULE_0__["default"])(list[idx], a)) {
+ return idx;
}
+ idx += 1;
}
- 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);
+ return -1;
}
-module.exports = baseMergeDeep;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_isArguments.js":
+/*!********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isArguments.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _has_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_has.js */ "./node_modules/ramda/es/internal/_has.js");
-/***/ "./node_modules/lodash/_baseOrderBy.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_baseOrderBy.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var toString = Object.prototype.toString;
+var _isArguments = /*#__PURE__*/
+function () {
+ return toString.call(arguments) === '[object Arguments]' ? function _isArguments(x) {
+ return toString.call(x) === '[object Arguments]';
+ } : function _isArguments(x) {
+ return (0,_has_js__WEBPACK_IMPORTED_MODULE_0__["default"])('callee', x);
+ };
+}();
+/* harmony default export */ __webpack_exports__["default"] = (_isArguments);
-var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
- baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- baseMap = __webpack_require__(/*! ./_baseMap */ "./node_modules/lodash/_baseMap.js"),
- baseSortBy = __webpack_require__(/*! ./_baseSortBy */ "./node_modules/lodash/_baseSortBy.js"),
- baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
- compareMultiple = __webpack_require__(/*! ./_compareMultiple */ "./node_modules/lodash/_compareMultiple.js"),
- identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_isArray.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isArray.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
/**
- * The base implementation of `_.orderBy` without param guards.
+ * Tests whether or not an object is an array.
*
* @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.
+ * @param {*} val The object to test.
+ * @return {Boolean} `true` if `val` is an array, `false` otherwise.
+ * @example
+ *
+ * _isArray([]); //=> true
+ * _isArray(null); //=> false
+ * _isArray({}); //=> false
*/
-function baseOrderBy(collection, iteratees, orders) {
- if (iteratees.length) {
- iteratees = arrayMap(iteratees, function(iteratee) {
- if (isArray(iteratee)) {
- return function(value) {
- return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
- }
- }
- return iteratee;
- });
- } else {
- iteratees = [identity];
- }
-
- var index = -1;
- iteratees = arrayMap(iteratees, baseUnary(baseIteratee));
-
- 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);
- });
-}
+/* harmony default export */ __webpack_exports__["default"] = (Array.isArray || function _isArray(val) {
+ return val != null && val.length >= 0 && Object.prototype.toString.call(val) === '[object Array]';
+});
-module.exports = baseOrderBy;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_isArrayLike.js":
+/*!********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isArrayLike.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _isArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_isArray.js */ "./node_modules/ramda/es/internal/_isArray.js");
+/* harmony import */ var _isString_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_isString.js */ "./node_modules/ramda/es/internal/_isString.js");
-/***/ "./node_modules/lodash/_basePick.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_basePick.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var basePickBy = __webpack_require__(/*! ./_basePickBy */ "./node_modules/lodash/_basePickBy.js"),
- hasIn = __webpack_require__(/*! ./hasIn */ "./node_modules/lodash/hasIn.js");
/**
- * The base implementation of `_.pick` without support for individual
- * property identifiers.
+ * Tests whether or not an object is similar to an array.
*
* @private
- * @param {Object} object The source object.
- * @param {string[]} paths The property paths to pick.
- * @returns {Object} Returns the new object.
+ * @category Type
+ * @category List
+ * @sig * -> Boolean
+ * @param {*} x The object to test.
+ * @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.
+ * @example
+ *
+ * _isArrayLike([]); //=> true
+ * _isArrayLike(true); //=> false
+ * _isArrayLike({}); //=> false
+ * _isArrayLike({length: 10}); //=> false
+ * _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true
+ * _isArrayLike({nodeType: 1, length: 1}) // => false
*/
-function basePick(object, paths) {
- return basePickBy(object, paths, function(value, path) {
- return hasIn(object, path);
- });
-}
-
-module.exports = basePick;
+var _isArrayLike = /*#__PURE__*/
+(0,_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function isArrayLike(x) {
+ if ((0,_isArray_js__WEBPACK_IMPORTED_MODULE_1__["default"])(x)) {
+ return true;
+ }
+ if (!x) {
+ return false;
+ }
+ if (typeof x !== 'object') {
+ return false;
+ }
+ if ((0,_isString_js__WEBPACK_IMPORTED_MODULE_2__["default"])(x)) {
+ return false;
+ }
+ if (x.length === 0) {
+ return true;
+ }
+ if (x.length > 0) {
+ return x.hasOwnProperty(0) && x.hasOwnProperty(x.length - 1);
+ }
+ return false;
+});
+/* harmony default export */ __webpack_exports__["default"] = (_isArrayLike);
/***/ }),
-/***/ "./node_modules/lodash/_basePickBy.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_basePickBy.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_isFunction.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isFunction.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js"),
- baseSet = __webpack_require__(/*! ./_baseSet */ "./node_modules/lodash/_baseSet.js"),
- castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isFunction; }
+/* harmony export */ });
+function _isFunction(x) {
+ var type = Object.prototype.toString.call(x);
+ return type === '[object Function]' || type === '[object AsyncFunction]' || type === '[object GeneratorFunction]' || type === '[object AsyncGeneratorFunction]';
+}
+
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_isInteger.js":
+/*!******************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isInteger.js ***!
+ \******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
/**
- * The base implementation of `_.pickBy` without support for iteratee shorthands.
+ * Determine if the passed argument is an integer.
*
* @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.
+ * @param {*} n
+ * @category Type
+ * @return {Boolean}
*/
-function basePickBy(object, paths, predicate) {
- var index = -1,
- length = paths.length,
- result = {};
+/* harmony default export */ __webpack_exports__["default"] = (Number.isInteger || function _isInteger(n) {
+ return n << 0 === n;
+});
- while (++index < length) {
- var path = paths[index],
- value = baseGet(object, path);
+/***/ }),
- if (predicate(value, path)) {
- baseSet(result, castPath(path, object), value);
- }
- }
- return result;
+/***/ "./node_modules/ramda/es/internal/_isObject.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isObject.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isObject; }
+/* harmony export */ });
+function _isObject(x) {
+ return Object.prototype.toString.call(x) === '[object Object]';
}
-module.exports = basePickBy;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_isPlaceholder.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isPlaceholder.js ***!
+ \**********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isPlaceholder; }
+/* harmony export */ });
+function _isPlaceholder(a) {
+ return a != null && typeof a === 'object' && a['@@functional/placeholder'] === true;
+}
/***/ }),
-/***/ "./node_modules/lodash/_baseProperty.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseProperty.js ***!
- \**********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_isString.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isString.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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];
- };
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isString; }
+/* harmony export */ });
+function _isString(x) {
+ return Object.prototype.toString.call(x) === '[object String]';
}
-module.exports = baseProperty;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_isTransformer.js":
+/*!**********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isTransformer.js ***!
+ \**********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isTransformer; }
+/* harmony export */ });
+function _isTransformer(obj) {
+ return obj != null && typeof obj['@@transducer/step'] === 'function';
+}
-/***/ "./node_modules/lodash/_basePropertyDeep.js":
-/*!**************************************************!*\
- !*** ./node_modules/lodash/_basePropertyDeep.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ }),
-var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js");
+/***/ "./node_modules/ramda/es/internal/_isTypedArray.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_isTypedArray.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _isTypedArray; }
+/* harmony export */ });
/**
- * A specialized version of `baseProperty` which supports deep paths.
+ * Tests whether or not an object is a typed array.
*
* @private
- * @param {Array|string} path The path of the property to get.
- * @returns {Function} Returns the new accessor function.
+ * @param {*} val The object to test.
+ * @return {Boolean} `true` if `val` is a typed array, `false` otherwise.
+ * @example
+ *
+ * _isTypedArray(new Uint8Array([])); //=> true
+ * _isTypedArray(new Float32Array([])); //=> true
+ * _isTypedArray([]); //=> false
+ * _isTypedArray(null); //=> false
+ * _isTypedArray({}); //=> false
*/
-function basePropertyDeep(path) {
- return function(object) {
- return baseGet(object, path);
- };
+function _isTypedArray(val) {
+ var type = Object.prototype.toString.call(val);
+ return type === '[object Uint8ClampedArray]' || type === '[object Int8Array]' || type === '[object Uint8Array]' || type === '[object Int16Array]' || type === '[object Uint16Array]' || type === '[object Int32Array]' || type === '[object Uint32Array]' || type === '[object Float32Array]' || type === '[object Float64Array]' || type === '[object BigInt64Array]' || type === '[object BigUint64Array]';
}
-module.exports = basePropertyDeep;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseRange.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseRange.js ***!
- \*******************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_makeFlat.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_makeFlat.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeCeil = Math.ceil,
- nativeMax = Math.max;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _makeFlat; }
+/* harmony export */ });
+/* harmony import */ var _isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_isArrayLike.js */ "./node_modules/ramda/es/internal/_isArrayLike.js");
/**
- * The base implementation of `_.range` and `_.rangeRight` which doesn't
- * coerce arguments.
+ * `_makeFlat` is a helper function that returns a one-level or fully recursive
+ * function based on the flag passed in.
*
* @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;
+function _makeFlat(recursive) {
+ return function flatt(list) {
+ var value, jlen, j;
+ var result = [];
+ var idx = 0;
+ var ilen = list.length;
+ while (idx < ilen) {
+ if ((0,_isArrayLike_js__WEBPACK_IMPORTED_MODULE_0__["default"])(list[idx])) {
+ value = recursive ? flatt(list[idx]) : list[idx];
+ j = 0;
+ jlen = value.length;
+ while (j < jlen) {
+ result[result.length] = value[j];
+ j += 1;
+ }
+ } else {
+ result[result.length] = list[idx];
+ }
+ idx += 1;
+ }
+ return result;
+ };
}
-module.exports = baseRange;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseReduce.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseReduce.js ***!
- \********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_map.js":
+/*!************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_map.js ***!
+ \************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _map; }
+/* harmony export */ });
+function _map(fn, functor) {
+ var idx = 0;
+ var len = functor.length;
+ var result = Array(len);
+ while (idx < len) {
+ result[idx] = fn(functor[idx]);
+ idx += 1;
+ }
+ return result;
}
-module.exports = baseReduce;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseRest.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_baseRest.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_objectAssign.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_objectAssign.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js"),
- overRest = __webpack_require__(/*! ./_overRest */ "./node_modules/lodash/_overRest.js"),
- setToString = __webpack_require__(/*! ./_setToString */ "./node_modules/lodash/_setToString.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _has_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_has.js */ "./node_modules/ramda/es/internal/_has.js");
+ // Based on https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/Object/assign
-/**
- * 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 + '');
+function _objectAssign(target) {
+ if (target == null) {
+ throw new TypeError('Cannot convert undefined or null to object');
+ }
+ var output = Object(target);
+ var idx = 1;
+ var length = arguments.length;
+ while (idx < length) {
+ var source = arguments[idx];
+ if (source != null) {
+ for (var nextKey in source) {
+ if ((0,_has_js__WEBPACK_IMPORTED_MODULE_0__["default"])(nextKey, source)) {
+ output[nextKey] = source[nextKey];
+ }
+ }
+ }
+ idx += 1;
+ }
+ return output;
}
+/* harmony default export */ __webpack_exports__["default"] = (typeof Object.assign === 'function' ? Object.assign : _objectAssign);
-module.exports = baseRest;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_objectIs.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_objectIs.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+// Based on https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
+function _objectIs(a, b) {
+ // SameValue algorithm
+ if (a === b) {
+ // Steps 1-5, 7-10
+ // Steps 6.b-6.e: +0 != -0
+ return a !== 0 || 1 / a === 1 / b;
+ } else {
+ // Step 6.a: NaN == NaN
+ return a !== a && b !== b;
+ }
+}
+/* harmony default export */ __webpack_exports__["default"] = (typeof Object.is === 'function' ? Object.is : _objectIs);
/***/ }),
-/***/ "./node_modules/lodash/_baseSet.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_baseSet.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_quote.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_quote.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
- castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
- isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _quote; }
+/* harmony export */ });
+function _quote(s) {
+ var escaped = s.replace(/\\/g, '\\\\').replace(/[\b]/g, '\\b') // \b matches word boundary; [\b] matches backspace
+ .replace(/\f/g, '\\f').replace(/\n/g, '\\n').replace(/\r/g, '\\r').replace(/\t/g, '\\t').replace(/\v/g, '\\v').replace(/\0/g, '\\0');
+ return '"' + escaped.replace(/"/g, '\\"') + '"';
+}
-/**
- * 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;
+/***/ "./node_modules/ramda/es/internal/_reduce.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_reduce.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- while (nested != null && ++index < length) {
- var key = toKey(path[index]),
- newValue = value;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _arrayReduce_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_arrayReduce.js */ "./node_modules/ramda/es/internal/_arrayReduce.js");
+/* harmony import */ var _createReduce_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_createReduce.js */ "./node_modules/ramda/es/internal/_createReduce.js");
- if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
- return object;
- }
- 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];
+function _iterableReduce(reducer, acc, iter) {
+ var step = iter.next();
+ while (!step.done) {
+ acc = reducer(acc, step.value);
+ step = iter.next();
}
- return object;
+ return acc;
+}
+function _methodReduce(reducer, acc, obj, methodName) {
+ return obj[methodName](reducer, acc);
}
+var _reduce = /*#__PURE__*/
+(0,_createReduce_js__WEBPACK_IMPORTED_MODULE_0__["default"])(_arrayReduce_js__WEBPACK_IMPORTED_MODULE_1__["default"], _methodReduce, _iterableReduce);
+/* harmony default export */ __webpack_exports__["default"] = (_reduce);
-module.exports = baseSet;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_reduced.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_reduced.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _reduced; }
+/* harmony export */ });
+function _reduced(x) {
+ return x && x['@@transducer/reduced'] ? x : {
+ '@@transducer/value': x,
+ '@@transducer/reduced': true
+ };
+}
-/***/ "./node_modules/lodash/_baseSetToString.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_baseSetToString.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ }),
-var constant = __webpack_require__(/*! ./constant */ "./node_modules/lodash/constant.js"),
- defineProperty = __webpack_require__(/*! ./_defineProperty */ "./node_modules/lodash/_defineProperty.js"),
- identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
+/***/ "./node_modules/ramda/es/internal/_toISOString.js":
+/*!********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_toISOString.js ***!
+ \********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
/**
- * 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`.
+ * Polyfill from <https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date/toISOString>.
*/
-var baseSetToString = !defineProperty ? identity : function(func, string) {
- return defineProperty(func, 'toString', {
- 'configurable': true,
- 'enumerable': false,
- 'value': constant(string),
- 'writable': true
- });
+var pad = function pad(n) {
+ return (n < 10 ? '0' : '') + n;
+};
+var _toISOString = typeof Date.prototype.toISOString === 'function' ? function _toISOString(d) {
+ return d.toISOString();
+} : function _toISOString(d) {
+ return d.getUTCFullYear() + '-' + pad(d.getUTCMonth() + 1) + '-' + pad(d.getUTCDate()) + 'T' + pad(d.getUTCHours()) + ':' + pad(d.getUTCMinutes()) + ':' + pad(d.getUTCSeconds()) + '.' + (d.getUTCMilliseconds() / 1000).toFixed(3).slice(2, 5) + 'Z';
};
+/* harmony default export */ __webpack_exports__["default"] = (_toISOString);
-module.exports = baseSetToString;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_toString.js":
+/*!*****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_toString.js ***!
+ \*****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _toString; }
+/* harmony export */ });
+/* harmony import */ var _includes_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_includes.js */ "./node_modules/ramda/es/internal/_includes.js");
+/* harmony import */ var _map_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_map.js */ "./node_modules/ramda/es/internal/_map.js");
+/* harmony import */ var _quote_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_quote.js */ "./node_modules/ramda/es/internal/_quote.js");
+/* harmony import */ var _toISOString_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./_toISOString.js */ "./node_modules/ramda/es/internal/_toISOString.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../keys.js */ "./node_modules/ramda/es/keys.js");
+/* harmony import */ var _reject_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../reject.js */ "./node_modules/ramda/es/reject.js");
-/***/ "./node_modules/lodash/_baseSortBy.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseSortBy.js ***!
- \********************************************/
-/***/ (function(module) {
-/**
- * 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;
+
+
+
+function _toString(x, seen) {
+ var recur = function recur(y) {
+ var xs = seen.concat([x]);
+ return (0,_includes_js__WEBPACK_IMPORTED_MODULE_0__["default"])(y, xs) ? '<Circular>' : _toString(y, xs);
+ }; // mapPairs :: (Object, [String]) -> [String]
+
+ var mapPairs = function mapPairs(obj, keys) {
+ return (0,_map_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (k) {
+ return (0,_quote_js__WEBPACK_IMPORTED_MODULE_2__["default"])(k) + ': ' + recur(obj[k]);
+ }, keys.slice().sort());
+ };
+ switch (Object.prototype.toString.call(x)) {
+ case '[object Arguments]':
+ return '(function() { return arguments; }(' + (0,_map_js__WEBPACK_IMPORTED_MODULE_1__["default"])(recur, x).join(', ') + '))';
+ case '[object Array]':
+ return '[' + (0,_map_js__WEBPACK_IMPORTED_MODULE_1__["default"])(recur, x).concat(mapPairs(x, (0,_reject_js__WEBPACK_IMPORTED_MODULE_3__["default"])(function (k) {
+ return /^\d+$/.test(k);
+ }, (0,_keys_js__WEBPACK_IMPORTED_MODULE_4__["default"])(x)))).join(', ') + ']';
+ case '[object Boolean]':
+ return typeof x === 'object' ? 'new Boolean(' + recur(x.valueOf()) + ')' : x.toString();
+ case '[object Date]':
+ return 'new Date(' + (isNaN(x.valueOf()) ? recur(NaN) : (0,_quote_js__WEBPACK_IMPORTED_MODULE_2__["default"])((0,_toISOString_js__WEBPACK_IMPORTED_MODULE_5__["default"])(x))) + ')';
+ case '[object Map]':
+ return 'new Map(' + recur(Array.from(x)) + ')';
+ case '[object Null]':
+ return 'null';
+ case '[object Number]':
+ return typeof x === 'object' ? 'new Number(' + recur(x.valueOf()) + ')' : 1 / x === -Infinity ? '-0' : x.toString(10);
+ case '[object Set]':
+ return 'new Set(' + recur(Array.from(x).sort()) + ')';
+ case '[object String]':
+ return typeof x === 'object' ? 'new String(' + recur(x.valueOf()) + ')' : (0,_quote_js__WEBPACK_IMPORTED_MODULE_2__["default"])(x);
+ case '[object Undefined]':
+ return 'undefined';
+ default:
+ if (typeof x.toString === 'function') {
+ var repr = x.toString();
+ if (repr !== '[object Object]') {
+ return repr;
+ }
+ }
+ return '{' + mapPairs(x, (0,_keys_js__WEBPACK_IMPORTED_MODULE_4__["default"])(x)).join(', ') + '}';
}
- return array;
}
-module.exports = baseSortBy;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseTimes.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseTimes.js ***!
- \*******************************************/
-/***/ (function(module) {
-
-/**
- * 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);
+/***/ "./node_modules/ramda/es/internal/_xArrayReduce.js":
+/*!*********************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xArrayReduce.js ***!
+ \*********************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- while (++index < n) {
- result[index] = iteratee(index);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xArrayReduce; }
+/* harmony export */ });
+function _xArrayReduce(xf, acc, list) {
+ var idx = 0;
+ var len = list.length;
+ while (idx < len) {
+ acc = xf['@@transducer/step'](acc, list[idx]);
+ if (acc && acc['@@transducer/reduced']) {
+ acc = acc['@@transducer/value'];
+ break;
+ }
+ idx += 1;
}
- return result;
+ return xf['@@transducer/result'](acc);
}
-module.exports = baseTimes;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseToString.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_baseToString.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_xReduce.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xReduce.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
- arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _createReduce_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_createReduce.js */ "./node_modules/ramda/es/internal/_createReduce.js");
+/* harmony import */ var _xArrayReduce_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_xArrayReduce.js */ "./node_modules/ramda/es/internal/_xArrayReduce.js");
+/* harmony import */ var _bind_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../bind.js */ "./node_modules/ramda/es/bind.js");
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = Symbol ? Symbol.prototype : undefined,
- symbolToString = symbolProto ? symbolProto.toString : undefined;
-/**
- * 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) : '';
+function _xIterableReduce(xf, acc, iter) {
+ var step = iter.next();
+ while (!step.done) {
+ acc = xf['@@transducer/step'](acc, step.value);
+ if (acc && acc['@@transducer/reduced']) {
+ acc = acc['@@transducer/value'];
+ break;
+ }
+ step = iter.next();
}
- var result = (value + '');
- return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
+ return xf['@@transducer/result'](acc);
}
-
-module.exports = baseToString;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_baseTrim.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_baseTrim.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var trimmedEndIndex = __webpack_require__(/*! ./_trimmedEndIndex */ "./node_modules/lodash/_trimmedEndIndex.js");
-
-/** Used to match leading whitespace. */
-var reTrimStart = /^\s+/;
-
-/**
- * The base implementation of `_.trim`.
- *
- * @private
- * @param {string} string The string to trim.
- * @returns {string} Returns the trimmed string.
- */
-function baseTrim(string) {
- return string
- ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')
- : string;
+function _xMethodReduce(xf, acc, obj, methodName) {
+ return xf['@@transducer/result'](obj[methodName]((0,_bind_js__WEBPACK_IMPORTED_MODULE_0__["default"])(xf['@@transducer/step'], xf), acc));
}
+var _xReduce = /*#__PURE__*/
+(0,_createReduce_js__WEBPACK_IMPORTED_MODULE_1__["default"])(_xArrayReduce_js__WEBPACK_IMPORTED_MODULE_2__["default"], _xMethodReduce, _xIterableReduce);
+/* harmony default export */ __webpack_exports__["default"] = (_xReduce);
-module.exports = baseTrim;
+/***/ }),
+/***/ "./node_modules/ramda/es/internal/_xall.js":
+/*!*************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xall.js ***!
+ \*************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xall; }
+/* harmony export */ });
+/* harmony import */ var _reduced_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-/***/ "./node_modules/lodash/_baseUnary.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_baseUnary.js ***!
- \*******************************************/
-/***/ (function(module) {
-/**
- * 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);
+var XAll = /*#__PURE__*/
+function () {
+ function XAll(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ this.all = true;
+ }
+ XAll.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XAll.prototype['@@transducer/result'] = function (result) {
+ if (this.all) {
+ result = this.xf['@@transducer/step'](result, true);
+ }
+ return this.xf['@@transducer/result'](result);
+ };
+ XAll.prototype['@@transducer/step'] = function (result, input) {
+ if (!this.f(input)) {
+ this.all = false;
+ result = (0,_reduced_js__WEBPACK_IMPORTED_MODULE_1__["default"])(this.xf['@@transducer/step'](result, false));
+ }
+ return result;
+ };
+ return XAll;
+}();
+function _xall(f) {
+ return function (xf) {
+ return new XAll(f, xf);
};
}
-module.exports = baseUnary;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseUniq.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_baseUniq.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var SetCache = __webpack_require__(/*! ./_SetCache */ "./node_modules/lodash/_SetCache.js"),
- arrayIncludes = __webpack_require__(/*! ./_arrayIncludes */ "./node_modules/lodash/_arrayIncludes.js"),
- arrayIncludesWith = __webpack_require__(/*! ./_arrayIncludesWith */ "./node_modules/lodash/_arrayIncludesWith.js"),
- cacheHas = __webpack_require__(/*! ./_cacheHas */ "./node_modules/lodash/_cacheHas.js"),
- createSet = __webpack_require__(/*! ./_createSet */ "./node_modules/lodash/_createSet.js"),
- setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
+/***/ "./node_modules/ramda/es/internal/_xany.js":
+/*!*************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xany.js ***!
+ \*************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used as the size to enable large array optimizations. */
-var LARGE_ARRAY_SIZE = 200;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xany; }
+/* harmony export */ });
+/* harmony import */ var _reduced_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-/**
- * 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;
+var XAny = /*#__PURE__*/
+function () {
+ function XAny(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ this.any = false;
}
- 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);
+ XAny.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XAny.prototype['@@transducer/result'] = function (result) {
+ if (!this.any) {
+ result = this.xf['@@transducer/step'](result, false);
}
- else if (!includes(seen, computed, comparator)) {
- if (seen !== result) {
- seen.push(computed);
- }
- result.push(value);
+ return this.xf['@@transducer/result'](result);
+ };
+ XAny.prototype['@@transducer/step'] = function (result, input) {
+ if (this.f(input)) {
+ this.any = true;
+ result = (0,_reduced_js__WEBPACK_IMPORTED_MODULE_1__["default"])(this.xf['@@transducer/step'](result, true));
}
- }
- return result;
+ return result;
+ };
+ return XAny;
+}();
+function _xany(f) {
+ return function (xf) {
+ return new XAny(f, xf);
+ };
}
-module.exports = baseUniq;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_baseValues.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_baseValues.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js");
-
-/**
- * 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];
- });
-}
-
-module.exports = baseValues;
+/***/ "./node_modules/ramda/es/internal/_xfBase.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xfBase.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony default export */ __webpack_exports__["default"] = ({
+ init: function init() {
+ return this.xf['@@transducer/init']();
+ },
+ result: function result(_result) {
+ return this.xf['@@transducer/result'](_result);
+ }
+});
/***/ }),
-/***/ "./node_modules/lodash/_baseZipObject.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_baseZipObject.js ***!
- \***********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_xfilter.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xfilter.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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 = {};
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xfilter; }
+/* harmony export */ });
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
- while (++index < length) {
- var value = index < valsLength ? values[index] : undefined;
- assignFunc(result, props[index], value);
+var XFilter = /*#__PURE__*/
+function () {
+ function XFilter(f, xf) {
+ this.xf = xf;
+ this.f = f;
}
- return result;
+ XFilter.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XFilter.prototype['@@transducer/result'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].result;
+ XFilter.prototype['@@transducer/step'] = function (result, input) {
+ return this.f(input) ? this.xf['@@transducer/step'](result, input) : result;
+ };
+ return XFilter;
+}();
+function _xfilter(f) {
+ return function (xf) {
+ return new XFilter(f, xf);
+ };
}
-module.exports = baseZipObject;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_cacheHas.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_cacheHas.js ***!
- \******************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/internal/_xfind.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xfind.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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);
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xfind; }
+/* harmony export */ });
+/* harmony import */ var _reduced_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-module.exports = cacheHas;
+var XFind = /*#__PURE__*/
+function () {
+ function XFind(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ this.found = false;
+ }
+ XFind.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XFind.prototype['@@transducer/result'] = function (result) {
+ if (!this.found) {
+ result = this.xf['@@transducer/step'](result, void 0);
+ }
+ return this.xf['@@transducer/result'](result);
+ };
+ XFind.prototype['@@transducer/step'] = function (result, input) {
+ if (this.f(input)) {
+ this.found = true;
+ result = (0,_reduced_js__WEBPACK_IMPORTED_MODULE_1__["default"])(this.xf['@@transducer/step'](result, input));
+ }
+ return result;
+ };
+ return XFind;
+}();
+function _xfind(f) {
+ return function (xf) {
+ return new XFind(f, xf);
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_castFunction.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_castFunction.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_xfindIndex.js":
+/*!*******************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xfindIndex.js ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xfindIndex; }
+/* harmony export */ });
+/* harmony import */ var _reduced_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-/**
- * 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;
+
+var XFindIndex = /*#__PURE__*/
+function () {
+ function XFindIndex(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ this.idx = -1;
+ this.found = false;
+ }
+ XFindIndex.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XFindIndex.prototype['@@transducer/result'] = function (result) {
+ if (!this.found) {
+ result = this.xf['@@transducer/step'](result, -1);
+ }
+ return this.xf['@@transducer/result'](result);
+ };
+ XFindIndex.prototype['@@transducer/step'] = function (result, input) {
+ this.idx += 1;
+ if (this.f(input)) {
+ this.found = true;
+ result = (0,_reduced_js__WEBPACK_IMPORTED_MODULE_1__["default"])(this.xf['@@transducer/step'](result, this.idx));
+ }
+ return result;
+ };
+ return XFindIndex;
+}();
+function _xfindIndex(f) {
+ return function (xf) {
+ return new XFindIndex(f, xf);
+ };
}
-module.exports = castFunction;
+/***/ }),
+
+/***/ "./node_modules/ramda/es/internal/_xmap.js":
+/*!*************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xmap.js ***!
+ \*************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
+
+var XMap = /*#__PURE__*/
+function () {
+ function XMap(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ }
+ XMap.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XMap.prototype['@@transducer/result'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].result;
+ XMap.prototype['@@transducer/step'] = function (result, input) {
+ return this.xf['@@transducer/step'](result, this.f(input));
+ };
+ return XMap;
+}();
+var _xmap = function _xmap(f) {
+ return function (xf) {
+ return new XMap(f, xf);
+ };
+};
+/* harmony default export */ __webpack_exports__["default"] = (_xmap);
/***/ }),
-/***/ "./node_modules/lodash/_castPath.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_castPath.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_xreduceBy.js":
+/*!******************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xreduceBy.js ***!
+ \******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
- stringToPath = __webpack_require__(/*! ./_stringToPath */ "./node_modules/lodash/_stringToPath.js"),
- toString = __webpack_require__(/*! ./toString */ "./node_modules/lodash/toString.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xreduceBy; }
+/* harmony export */ });
+/* harmony import */ var _clone_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./_clone.js */ "./node_modules/ramda/es/internal/_clone.js");
+/* harmony import */ var _has_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-/**
- * 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));
-}
-module.exports = castPath;
+var XReduceBy = /*#__PURE__*/
+function () {
+ function XReduceBy(valueFn, valueAcc, keyFn, xf) {
+ this.valueFn = valueFn;
+ this.valueAcc = valueAcc;
+ this.keyFn = keyFn;
+ this.xf = xf;
+ this.inputs = {};
+ }
+ XReduceBy.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XReduceBy.prototype['@@transducer/result'] = function (result) {
+ var key;
+ for (key in this.inputs) {
+ if ((0,_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(key, this.inputs)) {
+ result = this.xf['@@transducer/step'](result, this.inputs[key]);
+ if (result['@@transducer/reduced']) {
+ result = result['@@transducer/value'];
+ break;
+ }
+ }
+ }
+ this.inputs = null;
+ return this.xf['@@transducer/result'](result);
+ };
+ XReduceBy.prototype['@@transducer/step'] = function (result, input) {
+ var key = this.keyFn(input);
+ this.inputs[key] = this.inputs[key] || [key, (0,_clone_js__WEBPACK_IMPORTED_MODULE_2__["default"])(this.valueAcc, false)];
+ this.inputs[key][1] = this.valueFn(this.inputs[key][1], input);
+ return result;
+ };
+ return XReduceBy;
+}();
+function _xreduceBy(valueFn, valueAcc, keyFn) {
+ return function (xf) {
+ return new XReduceBy(valueFn, valueAcc, keyFn, xf);
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_cloneArrayBuffer.js":
+/***/ "./node_modules/ramda/es/internal/_xtake.js":
/*!**************************************************!*\
- !*** ./node_modules/lodash/_cloneArrayBuffer.js ***!
+ !*** ./node_modules/ramda/es/internal/_xtake.js ***!
\**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var Uint8Array = __webpack_require__(/*! ./_Uint8Array */ "./node_modules/lodash/_Uint8Array.js");
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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;
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xtake; }
+/* harmony export */ });
+/* harmony import */ var _reduced_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-module.exports = cloneArrayBuffer;
+var XTake = /*#__PURE__*/
+function () {
+ function XTake(n, xf) {
+ this.xf = xf;
+ this.n = n;
+ this.i = 0;
+ }
+ XTake.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].init;
+ XTake.prototype['@@transducer/result'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_0__["default"].result;
+ XTake.prototype['@@transducer/step'] = function (result, input) {
+ this.i += 1;
+ var ret = this.n === 0 ? result : this.xf['@@transducer/step'](result, input);
+ return this.n >= 0 && this.i >= this.n ? (0,_reduced_js__WEBPACK_IMPORTED_MODULE_1__["default"])(ret) : ret;
+ };
+ return XTake;
+}();
+function _xtake(n) {
+ return function (xf) {
+ return new XTake(n, xf);
+ };
+}
/***/ }),
-/***/ "./node_modules/lodash/_cloneBuffer.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_cloneBuffer.js ***!
- \*********************************************/
-/***/ (function(module, exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/internal/_xuniqBy.js":
+/*!****************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xuniqBy.js ***!
+ \****************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/* module decorator */ module = __webpack_require__.nmd(module);
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xuniqBy; }
+/* harmony export */ });
+/* harmony import */ var _Set_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./_Set.js */ "./node_modules/ramda/es/internal/_Set.js");
+/* harmony import */ var _xfBase_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./_xfBase.js */ "./node_modules/ramda/es/internal/_xfBase.js");
-/** Detect free variable `exports`. */
-var freeExports = true && exports && !exports.nodeType && exports;
-/** Detect free variable `module`. */
-var freeModule = freeExports && "object" == 'object' && module && !module.nodeType && module;
+var XUniqBy = /*#__PURE__*/
+function () {
+ function XUniqBy(f, xf) {
+ this.xf = xf;
+ this.f = f;
+ this.set = new _Set_js__WEBPACK_IMPORTED_MODULE_0__["default"]();
+ }
+ XUniqBy.prototype['@@transducer/init'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_1__["default"].init;
+ XUniqBy.prototype['@@transducer/result'] = _xfBase_js__WEBPACK_IMPORTED_MODULE_1__["default"].result;
+ XUniqBy.prototype['@@transducer/step'] = function (result, input) {
+ return this.set.add(this.f(input)) ? this.xf['@@transducer/step'](result, input) : result;
+ };
+ return XUniqBy;
+}();
+function _xuniqBy(f) {
+ return function (xf) {
+ return new XUniqBy(f, xf);
+ };
+}
-/** Detect the popular CommonJS extension `module.exports`. */
-var moduleExports = freeModule && freeModule.exports === freeExports;
+/***/ }),
-/** Built-in value references. */
-var Buffer = moduleExports ? root.Buffer : undefined,
- allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;
+/***/ "./node_modules/ramda/es/internal/_xwrap.js":
+/*!**************************************************!*\
+ !*** ./node_modules/ramda/es/internal/_xwrap.js ***!
+ \**************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * 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();
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ _xwrap; }
+/* harmony export */ });
+var XWrap = /*#__PURE__*/
+function () {
+ function XWrap(fn) {
+ this.f = fn;
}
- var length = buffer.length,
- result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
-
- buffer.copy(result);
- return result;
+ XWrap.prototype['@@transducer/init'] = function () {
+ throw new Error('init not implemented on XWrap');
+ };
+ XWrap.prototype['@@transducer/result'] = function (acc) {
+ return acc;
+ };
+ XWrap.prototype['@@transducer/step'] = function (acc, x) {
+ return this.f(acc, x);
+ };
+ return XWrap;
+}();
+function _xwrap(fn) {
+ return new XWrap(fn);
}
-module.exports = cloneBuffer;
-
-
/***/ }),
-/***/ "./node_modules/lodash/_cloneDataView.js":
+/***/ "./node_modules/ramda/es/intersection.js":
/*!***********************************************!*\
- !*** ./node_modules/lodash/_cloneDataView.js ***!
+ !*** ./node_modules/ramda/es/intersection.js ***!
\***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_filter_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_filter.js */ "./node_modules/ramda/es/internal/_filter.js");
+/* harmony import */ var _internal_Set_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_Set.js */ "./node_modules/ramda/es/internal/_Set.js");
+/* harmony import */ var _uniq_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./uniq.js */ "./node_modules/ramda/es/uniq.js");
+
+
-var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js");
/**
- * Creates a clone of `dataView`.
+ * Combines two lists into a set (i.e. no duplicates) composed of those
+ * elements common to both lists.
*
- * @private
- * @param {Object} dataView The data view to clone.
- * @param {boolean} [isDeep] Specify a deep clone.
- * @returns {Object} Returns the cloned data view.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Relation
+ * @sig [*] -> [*] -> [*]
+ * @param {Array} list1 The first list.
+ * @param {Array} list2 The second list.
+ * @return {Array} The list of elements found in both `list1` and `list2`.
+ * @see R.innerJoin
+ * @example
+ *
+ * R.intersection([1,2,3,4], [7,6,5,4,3]); //=> [4, 3]
*/
-function cloneDataView(dataView, isDeep) {
- var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
- return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
-}
-
-module.exports = cloneDataView;
+var intersection = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function intersection(list1, list2) {
+ var toKeep = new _internal_Set_js__WEBPACK_IMPORTED_MODULE_1__["default"]();
+ for (var i = 0; i < list1.length; i += 1) {
+ toKeep.add(list1[i]);
+ }
+ return (0,_uniq_js__WEBPACK_IMPORTED_MODULE_2__["default"])((0,_internal_filter_js__WEBPACK_IMPORTED_MODULE_3__["default"])(toKeep.has.bind(toKeep), list2));
+});
+/* harmony default export */ __webpack_exports__["default"] = (intersection);
/***/ }),
-/***/ "./node_modules/lodash/_cloneRegExp.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_cloneRegExp.js ***!
- \*********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/is.js":
+/*!*************************************!*\
+ !*** ./node_modules/ramda/es/is.js ***!
+ \*************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to match `RegExp` flags from their coerced string values. */
-var reFlags = /\w*$/;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Creates a clone of `regexp`.
+ * See if an object (i.e. `val`) is an instance of the supplied constructor. This
+ * function will check up the inheritance chain, if any.
+ * If `val` was created using `Object.create`, `R.is(Object, val) === true`.
*
- * @private
- * @param {Object} regexp The regexp to clone.
- * @returns {Object} Returns the cloned regexp.
+ * @func
+ * @memberOf R
+ * @since v0.3.0
+ * @category Type
+ * @sig (* -> {*}) -> a -> Boolean
+ * @param {Object} ctor A constructor
+ * @param {*} val The value to test
+ * @return {Boolean}
+ * @example
+ *
+ * R.is(Object, {}); //=> true
+ * R.is(Number, 1); //=> true
+ * R.is(Object, 1); //=> false
+ * R.is(String, 's'); //=> true
+ * R.is(String, new String('')); //=> true
+ * R.is(Object, new String('')); //=> true
+ * R.is(Object, 's'); //=> false
+ * R.is(Number, {}); //=> false
*/
-function cloneRegExp(regexp) {
- var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
- result.lastIndex = regexp.lastIndex;
- return result;
-}
-
-module.exports = cloneRegExp;
+var is = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function is(Ctor, val) {
+ return val instanceof Ctor || val != null && (val.constructor === Ctor || Ctor.name === 'Object' && typeof val === 'object');
+});
+/* harmony default export */ __webpack_exports__["default"] = (is);
/***/ }),
-/***/ "./node_modules/lodash/_cloneSymbol.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_cloneSymbol.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/isEmpty.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/isEmpty.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _empty_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./empty.js */ "./node_modules/ramda/es/empty.js");
+/* harmony import */ var _equals_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./equals.js */ "./node_modules/ramda/es/equals.js");
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js");
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = Symbol ? Symbol.prototype : undefined,
- symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
/**
- * Creates a clone of the `symbol` object.
+ * Returns `true` if the given value is its type's empty value; `false`
+ * otherwise.
*
- * @private
- * @param {Object} symbol The symbol object to clone.
- * @returns {Object} Returns the cloned symbol object.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Logic
+ * @sig a -> Boolean
+ * @param {*} x
+ * @return {Boolean}
+ * @see R.empty
+ * @example
+ *
+ * R.isEmpty([1, 2, 3]); //=> false
+ * R.isEmpty([]); //=> true
+ * R.isEmpty(''); //=> true
+ * R.isEmpty(null); //=> false
+ * R.isEmpty({}); //=> true
+ * R.isEmpty({length: 0}); //=> false
+ * R.isEmpty(Uint8Array.from('')); //=> true
*/
-function cloneSymbol(symbol) {
- return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
-}
-
-module.exports = cloneSymbol;
+var isEmpty = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function isEmpty(x) {
+ return x != null && (0,_equals_js__WEBPACK_IMPORTED_MODULE_1__["default"])(x, (0,_empty_js__WEBPACK_IMPORTED_MODULE_2__["default"])(x));
+});
+/* harmony default export */ __webpack_exports__["default"] = (isEmpty);
/***/ }),
-/***/ "./node_modules/lodash/_cloneTypedArray.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_cloneTypedArray.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/isNil.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/isNil.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
/**
- * Creates a clone of `typedArray`.
+ * Checks if the input value is `null` or `undefined`.
*
- * @private
- * @param {Object} typedArray The typed array to clone.
- * @param {boolean} [isDeep] Specify a deep clone.
- * @returns {Object} Returns the cloned typed array.
+ * @func
+ * @memberOf R
+ * @since v0.9.0
+ * @category Type
+ * @sig * -> Boolean
+ * @param {*} x The value to test.
+ * @return {Boolean} `true` if `x` is `undefined` or `null`, otherwise `false`.
+ * @example
+ *
+ * R.isNil(null); //=> true
+ * R.isNil(undefined); //=> true
+ * R.isNil(0); //=> false
+ * R.isNil([]); //=> false
*/
-function cloneTypedArray(typedArray, isDeep) {
- var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
- return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
-}
-
-module.exports = cloneTypedArray;
+var isNil = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function isNil(x) {
+ return x == null;
+});
+/* harmony default export */ __webpack_exports__["default"] = (isNil);
/***/ }),
-/***/ "./node_modules/lodash/_compareAscending.js":
-/*!**************************************************!*\
- !*** ./node_modules/lodash/_compareAscending.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/juxt.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/juxt.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _converge_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./converge.js */ "./node_modules/ramda/es/converge.js");
-var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
/**
- * Compares values to sort them in ascending order.
+ * juxt applies a list of functions to a list of values.
*
- * @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;
-}
-
-module.exports = compareAscending;
+ * @func
+ * @memberOf R
+ * @since v0.19.0
+ * @category Function
+ * @sig [(a, b, ..., m) -> n] -> ((a, b, ..., m) -> [n])
+ * @param {Array} fns An array of functions
+ * @return {Function} A function that returns a list of values after applying each of the original `fns` to its parameters.
+ * @see R.applySpec
+ * @example
+ *
+ * const getRange = R.juxt([Math.min, Math.max]);
+ * getRange(3, 4, 9, -3); //=> [-3, 9]
+ * @symb R.juxt([f, g, h])(a, b) = [f(a, b), g(a, b), h(a, b)]
+ */
+var juxt = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function juxt(fns) {
+ return (0,_converge_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function () {
+ return Array.prototype.slice.call(arguments, 0);
+ }, fns);
+});
+/* harmony default export */ __webpack_exports__["default"] = (juxt);
/***/ }),
-/***/ "./node_modules/lodash/_compareMultiple.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_compareMultiple.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var compareAscending = __webpack_require__(/*! ./_compareAscending */ "./node_modules/lodash/_compareAscending.js");
-
-/**
- * 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;
+/***/ "./node_modules/ramda/es/keys.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/keys.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- 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;
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _internal_isArguments_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isArguments.js */ "./node_modules/ramda/es/internal/_isArguments.js");
-module.exports = compareMultiple;
+ // cover IE < 9 keys issues
-/***/ }),
+var hasEnumBug = ! /*#__PURE__*/
+{
+ toString: null
+}.propertyIsEnumerable('toString');
+var nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString']; // Safari bug
-/***/ "./node_modules/lodash/_copyArray.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_copyArray.js ***!
- \*******************************************/
-/***/ (function(module) {
+var hasArgsEnumBug = /*#__PURE__*/
+function () {
+ 'use strict';
+ return arguments.propertyIsEnumerable('length');
+}();
+var contains = function contains(list, item) {
+ var idx = 0;
+ while (idx < list.length) {
+ if (list[idx] === item) {
+ return true;
+ }
+ idx += 1;
+ }
+ return false;
+};
/**
- * Copies the values of `source` to `array`.
+ * Returns a list containing the names of all the enumerable own properties of
+ * the supplied object.
+ * Note that the order of the output array is not guaranteed to be consistent
+ * across different JS platforms.
*
- * @private
- * @param {Array} source The array to copy values from.
- * @param {Array} [array=[]] The array to copy values to.
- * @returns {Array} Returns `array`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig {k: v} -> [k]
+ * @param {Object} obj The object to extract properties from
+ * @return {Array} An array of the object's own properties.
+ * @see R.keysIn, R.values, R.toPairs
+ * @example
+ *
+ * R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']
*/
-function copyArray(source, array) {
- var index = -1,
- length = source.length;
- array || (array = Array(length));
- while (++index < length) {
- array[index] = source[index];
+var keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function keys(obj) {
+ return Object(obj) !== obj ? [] : Object.keys(obj);
+}) : /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function keys(obj) {
+ if (Object(obj) !== obj) {
+ return [];
}
- return array;
-}
-
-module.exports = copyArray;
-
+ var prop, nIdx;
+ var ks = [];
+ var checkArgsLength = hasArgsEnumBug && (0,_internal_isArguments_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj);
+ for (prop in obj) {
+ if ((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_2__["default"])(prop, obj) && (!checkArgsLength || prop !== 'length')) {
+ ks[ks.length] = prop;
+ }
+ }
+ if (hasEnumBug) {
+ nIdx = nonEnumerableProps.length - 1;
+ while (nIdx >= 0) {
+ prop = nonEnumerableProps[nIdx];
+ if ((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_2__["default"])(prop, obj) && !contains(ks, prop)) {
+ ks[ks.length] = prop;
+ }
+ nIdx -= 1;
+ }
+ }
+ return ks;
+});
+/* harmony default export */ __webpack_exports__["default"] = (keys);
/***/ }),
-/***/ "./node_modules/lodash/_copyObject.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_copyObject.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/lens.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/lens.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _map_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./map.js */ "./node_modules/ramda/es/map.js");
-var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
- baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js");
/**
- * Copies properties of `source` to `object`.
+ * Returns a lens for the given getter and setter functions. The getter "gets"
+ * the value of the focus; the setter "sets" the value of the focus. The setter
+ * should not mutate the data structure.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.8.0
+ * @category Object
+ * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig (s -> a) -> ((a, s) -> s) -> Lens s a
+ * @param {Function} getter
+ * @param {Function} setter
+ * @return {Lens}
+ * @see R.view, R.set, R.over, R.lensIndex, R.lensProp
+ * @example
+ *
+ * const xLens = R.lens(R.prop('x'), R.assoc('x'));
+ *
+ * R.view(xLens, {x: 1, y: 2}); //=> 1
+ * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}
+ * R.over(xLens, R.negate, {x: 1, y: 2}); //=> {x: -1, y: 2}
*/
-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;
+var lens = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function lens(getter, setter) {
+ return function (toFunctorFn) {
+ return function (target) {
+ return (0,_map_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (focus) {
+ return setter(focus, target);
+ }, toFunctorFn(getter(target)));
+ };
+ };
+});
+/* harmony default export */ __webpack_exports__["default"] = (lens);
- if (newValue === undefined) {
- newValue = source[key];
- }
- if (isNew) {
- baseAssignValue(object, key, newValue);
- } else {
- assignValue(object, key, newValue);
- }
- }
- return object;
-}
+/***/ }),
-module.exports = copyObject;
+/***/ "./node_modules/ramda/es/lensPath.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/lensPath.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _assocPath_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./assocPath.js */ "./node_modules/ramda/es/assocPath.js");
+/* harmony import */ var _lens_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./lens.js */ "./node_modules/ramda/es/lens.js");
+/* harmony import */ var _path_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./path.js */ "./node_modules/ramda/es/path.js");
-/***/ }),
-/***/ "./node_modules/lodash/_copySymbols.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_copySymbols.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
- getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js");
/**
- * Copies own symbols of `source` to `object`.
+ * Returns a lens whose focus is the specified path.
*
- * @private
- * @param {Object} source The object to copy symbols from.
- * @param {Object} [object={}] The object to copy symbols to.
- * @returns {Object} Returns `object`.
+ * @func
+ * @memberOf R
+ * @since v0.19.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig [Idx] -> Lens s a
+ * @param {Array} path The path to use.
+ * @return {Lens}
+ * @see R.view, R.set, R.over
+ * @example
+ *
+ * const xHeadYLens = R.lensPath(['x', 0, 'y']);
+ *
+ * R.view(xHeadYLens, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});
+ * //=> 2
+ * R.set(xHeadYLens, 1, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});
+ * //=> {x: [{y: 1, z: 3}, {y: 4, z: 5}]}
+ * R.over(xHeadYLens, R.negate, {x: [{y: 2, z: 3}, {y: 4, z: 5}]});
+ * //=> {x: [{y: -2, z: 3}, {y: 4, z: 5}]}
*/
-function copySymbols(source, object) {
- return copyObject(source, getSymbols(source), object);
-}
-
-module.exports = copySymbols;
+var lensPath = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function lensPath(p) {
+ return (0,_lens_js__WEBPACK_IMPORTED_MODULE_1__["default"])((0,_path_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p), (0,_assocPath_js__WEBPACK_IMPORTED_MODULE_3__["default"])(p));
+});
+/* harmony default export */ __webpack_exports__["default"] = (lensPath);
/***/ }),
-/***/ "./node_modules/lodash/_copySymbolsIn.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_copySymbolsIn.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/lt.js":
+/*!*************************************!*\
+ !*** ./node_modules/ramda/es/lt.js ***!
+ \*************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
- getSymbolsIn = __webpack_require__(/*! ./_getSymbolsIn */ "./node_modules/lodash/_getSymbolsIn.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Copies own and inherited symbols of `source` to `object`.
+ * Returns `true` if the first argument is less than the second; `false`
+ * otherwise.
*
- * @private
- * @param {Object} source The object to copy symbols from.
- * @param {Object} [object={}] The object to copy symbols to.
- * @returns {Object} Returns `object`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Relation
+ * @sig Ord a => a -> a -> Boolean
+ * @param {*} a
+ * @param {*} b
+ * @return {Boolean}
+ * @see R.gt
+ * @example
+ *
+ * R.lt(2, 1); //=> false
+ * R.lt(2, 2); //=> false
+ * R.lt(2, 3); //=> true
+ * R.lt('a', 'z'); //=> true
+ * R.lt('z', 'a'); //=> false
*/
-function copySymbolsIn(source, object) {
- return copyObject(source, getSymbolsIn(source), object);
-}
-
-module.exports = copySymbolsIn;
+var lt = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function lt(a, b) {
+ return a < b;
+});
+/* harmony default export */ __webpack_exports__["default"] = (lt);
/***/ }),
-/***/ "./node_modules/lodash/_coreJsData.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_coreJsData.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/map.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/map.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_arrayReduce.js */ "./node_modules/ramda/es/internal/_arrayReduce.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_map_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./internal/_map.js */ "./node_modules/ramda/es/internal/_map.js");
+/* harmony import */ var _internal_xmap_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xmap.js */ "./node_modules/ramda/es/internal/_xmap.js");
+/* harmony import */ var _curryN_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./curryN.js */ "./node_modules/ramda/es/curryN.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./keys.js */ "./node_modules/ramda/es/keys.js");
-/** Used to detect overreaching core-js shims. */
-var coreJsData = root['__core-js_shared__'];
-module.exports = coreJsData;
-/***/ }),
-/***/ "./node_modules/lodash/_createAssigner.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_createAssigner.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
- isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js");
/**
- * Creates a function like `_.assign`.
+ * Takes a function and
+ * a [functor](https://github.com/fantasyland/fantasy-land#functor),
+ * applies the function to each of the functor's values, and returns
+ * a functor of the same shape.
*
- * @private
- * @param {Function} assigner The function to assign values.
- * @returns {Function} Returns the new assigner function.
+ * Ramda provides suitable `map` implementations for `Array` and `Object`,
+ * so this function may be applied to `[1, 2, 3]` or `{x: 1, y: 2, z: 3}`.
+ *
+ * Dispatches to the `map` method of the second argument, if present.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * Also treats functions as functors and will compose them together.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig Functor f => (a -> b) -> f a -> f b
+ * @param {Function} fn The function to be called on every element of the input `list`.
+ * @param {Array} list The list to be iterated over.
+ * @return {Array} The new list.
+ * @see R.transduce, R.addIndex, R.pluck, R.project
+ * @example
+ *
+ * const double = x => x * 2;
+ *
+ * R.map(double, [1, 2, 3]); //=> [2, 4, 6]
+ *
+ * R.map(double, {x: 1, y: 2, z: 3}); //=> {x: 2, y: 4, z: 6}
+ * @symb R.map(f, [a, b]) = [f(a), f(b)]
+ * @symb R.map(f, { x: a, y: b }) = { x: f(a), y: f(b) }
+ * @symb R.map(f, functor_o) = functor_o.map(f)
*/
-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;
- });
-}
-
-module.exports = createAssigner;
+var map = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['fantasy-land/map', 'map'], _internal_xmap_js__WEBPACK_IMPORTED_MODULE_2__["default"], function map(fn, functor) {
+ switch (Object.prototype.toString.call(functor)) {
+ case '[object Function]':
+ return (0,_curryN_js__WEBPACK_IMPORTED_MODULE_3__["default"])(functor.length, function () {
+ return fn.call(this, functor.apply(this, arguments));
+ });
+ case '[object Object]':
+ return (0,_internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_4__["default"])(function (acc, key) {
+ acc[key] = fn(functor[key]);
+ return acc;
+ }, {}, (0,_keys_js__WEBPACK_IMPORTED_MODULE_5__["default"])(functor));
+ default:
+ return (0,_internal_map_js__WEBPACK_IMPORTED_MODULE_6__["default"])(fn, functor);
+ }
+}));
+/* harmony default export */ __webpack_exports__["default"] = (map);
/***/ }),
-/***/ "./node_modules/lodash/_createBaseEach.js":
+/***/ "./node_modules/ramda/es/mapObjIndexed.js":
/*!************************************************!*\
- !*** ./node_modules/lodash/_createBaseEach.js ***!
+ !*** ./node_modules/ramda/es/mapObjIndexed.js ***!
\************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_arrayReduce.js */ "./node_modules/ramda/es/internal/_arrayReduce.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./keys.js */ "./node_modules/ramda/es/keys.js");
+
-var isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
/**
- * Creates a `baseEach` or `baseEachRight` function.
+ * An Object-specific version of [`map`](#map). The function is applied to three
+ * arguments: *(value, key, obj)*. If only the value is significant, use
+ * [`map`](#map) instead.
*
- * @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.
+ * @func
+ * @memberOf R
+ * @since v0.9.0
+ * @category Object
+ * @sig ((*, String, Object) -> *) -> Object -> Object
+ * @param {Function} fn
+ * @param {Object} obj
+ * @return {Object}
+ * @see R.map
+ * @example
+ *
+ * const xyz = { x: 1, y: 2, z: 3 };
+ * const prependKeyAndDouble = (num, key, obj) => key + (num * 2);
+ *
+ * R.mapObjIndexed(prependKeyAndDouble, xyz); //=> { x: 'x2', y: 'y4', z: 'z6' }
*/
-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;
- };
-}
+var mapObjIndexed = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mapObjIndexed(fn, obj) {
+ return (0,_internal_arrayReduce_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (acc, key) {
+ acc[key] = fn(obj[key], key, obj);
+ return acc;
+ }, {}, (0,_keys_js__WEBPACK_IMPORTED_MODULE_2__["default"])(obj));
+});
+/* harmony default export */ __webpack_exports__["default"] = (mapObjIndexed);
-module.exports = createBaseEach;
+/***/ }),
+/***/ "./node_modules/ramda/es/max.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/max.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _toString_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toString.js */ "./node_modules/ramda/es/toString.js");
-/***/ "./node_modules/lodash/_createBaseFor.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_createBaseFor.js ***!
- \***********************************************/
-/***/ (function(module) {
/**
- * Creates a base function for methods like `_.forIn` and `_.forOwn`.
+ * Returns the larger of its two arguments.
*
- * @private
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Function} Returns the new base function.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Relation
+ * @sig Ord a => a -> a -> a
+ * @param {*} a
+ * @param {*} b
+ * @return {*}
+ * @see R.maxBy, R.min
+ * @example
+ *
+ * R.max(789, 123); //=> 789
+ * R.max('a', 'b'); //=> 'b'
*/
-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;
- }
+var max = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function max(a, b) {
+ if (a === b) {
+ return b;
+ }
+ function safeMax(x, y) {
+ if (x > y !== y > x) {
+ return y > x ? y : x;
}
- return object;
- };
-}
+ return undefined;
+ }
+ var maxByValue = safeMax(a, b);
+ if (maxByValue !== undefined) {
+ return maxByValue;
+ }
+ var maxByType = safeMax(typeof a, typeof b);
+ if (maxByType !== undefined) {
+ return maxByType === typeof a ? a : b;
+ }
+ var stringA = (0,_toString_js__WEBPACK_IMPORTED_MODULE_1__["default"])(a);
+ var maxByStringValue = safeMax(stringA, (0,_toString_js__WEBPACK_IMPORTED_MODULE_1__["default"])(b));
+ if (maxByStringValue !== undefined) {
+ return maxByStringValue === stringA ? a : b;
+ }
+ return b;
+});
+/* harmony default export */ __webpack_exports__["default"] = (max);
-module.exports = createBaseFor;
+/***/ }),
+/***/ "./node_modules/ramda/es/memoizeWith.js":
+/*!**********************************************!*\
+ !*** ./node_modules/ramda/es/memoizeWith.js ***!
+ \**********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_arity.js */ "./node_modules/ramda/es/internal/_arity.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
-/***/ "./node_modules/lodash/_createFind.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_createFind.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-var baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
/**
- * Creates a `_.find` or `_.findLast` function.
+ * Takes a string-returning function `keyGen` and a function `fn` and returns
+ * a new function that returns cached results for subsequent
+ * calls with the same arguments.
*
- * @private
- * @param {Function} findIndexFunc The function to find the collection index.
- * @returns {Function} Returns the new find function.
+ * When the function is invoked, `keyGen` is applied to the same arguments
+ * and its result becomes the cache key. If the cache contains something
+ * under that key, the function simply returns it and does not invoke `fn` at all.
+ *
+ * Otherwise `fn` is applied to the same arguments and its return value
+ * is cached under that key and returned by the function.
+ *
+ * Care must be taken when implementing `keyGen` to avoid key collision,
+ * or if tracking references, memory leaks and mutating arguments.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.24.0
+ * @category Function
+ * @sig (*... -> String) -> (*... -> a) -> (*... -> a)
+ * @param {Function} keyGen The function to generate the cache key.
+ * @param {Function} fn The function to memoize.
+ * @return {Function} Memoized version of `fn`.
+ * @example
+ * const withAge = memoizeWith(o => `${o.birth}/${o.death}`, ({birth, death}) => {
+ * // ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^
+ * // keyGen fn
+ * console.log(`computing age for ${birth}/${death}`);
+ * return ({birth, death, age: death - birth});
+ * });
+ *
+ * withAge({birth: 1921, death: 1999});
+ * //=> LOG: computing age for 1921/1999
+ * //=> {birth: 1921, death: 1999, age: 78} (returned from fn)
+ *
+ * withAge({birth: 1921, death: 1999});
+ * //=> {birth: 1921, death: 1999, age: 78} (returned from cache)
*/
-function createFind(findIndexFunc) {
- return function(collection, predicate, fromIndex) {
- var iterable = Object(collection);
- if (!isArrayLike(collection)) {
- var iteratee = baseIteratee(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;
- };
-}
-
-module.exports = createFind;
+var memoizeWith = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function memoizeWith(keyGen, fn) {
+ var cache = {};
+ return (0,_internal_arity_js__WEBPACK_IMPORTED_MODULE_1__["default"])(fn.length, function () {
+ var key = keyGen.apply(this, arguments);
+ if (!(0,_internal_has_js__WEBPACK_IMPORTED_MODULE_2__["default"])(key, cache)) {
+ cache[key] = fn.apply(this, arguments);
+ }
+ return cache[key];
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (memoizeWith);
/***/ }),
-/***/ "./node_modules/lodash/_createRange.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_createRange.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/mergeDeepRight.js":
+/*!*************************************************!*\
+ !*** ./node_modules/ramda/es/mergeDeepRight.js ***!
+ \*************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _mergeDeepWithKey_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./mergeDeepWithKey.js */ "./node_modules/ramda/es/mergeDeepWithKey.js");
-var baseRange = __webpack_require__(/*! ./_baseRange */ "./node_modules/lodash/_baseRange.js"),
- isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js"),
- toFinite = __webpack_require__(/*! ./toFinite */ "./node_modules/lodash/toFinite.js");
/**
- * Creates a `_.range` or `_.rangeRight` function.
+ * Creates a new object with the own properties of the first object merged with
+ * the own properties of the second object. If a key exists in both objects:
+ * - and both values are objects, the two values will be recursively merged
+ * - otherwise the value from the second object will be used.
*
- * @private
- * @param {boolean} [fromRight] Specify iterating from right to left.
- * @returns {Function} Returns the new range function.
+ * @func
+ * @memberOf R
+ * @since v0.24.0
+ * @category Object
+ * @sig {a} -> {a} -> {a}
+ * @param {Object} lObj
+ * @param {Object} rObj
+ * @return {Object}
+ * @see R.merge, R.mergeDeepLeft, R.mergeDeepWith, R.mergeDeepWithKey
+ * @example
+ *
+ * R.mergeDeepRight({ name: 'fred', age: 10, contact: { email: 'moo@example.com' }},
+ * { age: 40, contact: { email: 'baa@example.com' }});
+ * //=> { name: 'fred', age: 40, contact: { email: 'baa@example.com' }}
*/
-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);
- };
-}
-
-module.exports = createRange;
+var mergeDeepRight = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeDeepRight(lObj, rObj) {
+ return (0,_mergeDeepWithKey_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (k, lVal, rVal) {
+ return rVal;
+ }, lObj, rObj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeDeepRight);
/***/ }),
-/***/ "./node_modules/lodash/_createSet.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_createSet.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/mergeDeepWithKey.js":
+/*!***************************************************!*\
+ !*** ./node_modules/ramda/es/mergeDeepWithKey.js ***!
+ \***************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _internal_isObject_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_isObject.js */ "./node_modules/ramda/es/internal/_isObject.js");
+/* harmony import */ var _mergeWithKey_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./mergeWithKey.js */ "./node_modules/ramda/es/mergeWithKey.js");
-var Set = __webpack_require__(/*! ./_Set */ "./node_modules/lodash/_Set.js"),
- noop = __webpack_require__(/*! ./noop */ "./node_modules/lodash/noop.js"),
- setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
/**
- * Creates a set object of `values`.
+ * Creates a new object with the own properties of the two provided objects.
+ * If a key exists in both objects:
+ * - and both associated values are also objects then the values will be
+ * recursively merged.
+ * - otherwise the provided function is applied to the key and associated values
+ * using the resulting value as the new value associated with the key.
+ * If a key only exists in one object, the value will be associated with the key
+ * of the resulting object.
*
- * @private
- * @param {Array} values The values to add to the set.
- * @returns {Object} Returns the new set.
+ * @func
+ * @memberOf R
+ * @since v0.24.0
+ * @category Object
+ * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}
+ * @param {Function} fn
+ * @param {Object} lObj
+ * @param {Object} rObj
+ * @return {Object}
+ * @see R.mergeWithKey, R.mergeDeepWith
+ * @example
+ *
+ * let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r
+ * R.mergeDeepWithKey(concatValues,
+ * { a: true, c: { thing: 'foo', values: [10, 20] }},
+ * { b: true, c: { thing: 'bar', values: [15, 35] }});
+ * //=> { a: true, b: true, c: { thing: 'bar', values: [10, 20, 15, 35] }}
*/
-var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {
- return new Set(values);
-};
-
-module.exports = createSet;
+var mergeDeepWithKey = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeDeepWithKey(fn, lObj, rObj) {
+ return (0,_mergeWithKey_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (k, lVal, rVal) {
+ if ((0,_internal_isObject_js__WEBPACK_IMPORTED_MODULE_2__["default"])(lVal) && (0,_internal_isObject_js__WEBPACK_IMPORTED_MODULE_2__["default"])(rVal)) {
+ return mergeDeepWithKey(fn, lVal, rVal);
+ } else {
+ return fn(k, lVal, rVal);
+ }
+ }, lObj, rObj);
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeDeepWithKey);
/***/ }),
-/***/ "./node_modules/lodash/_defineProperty.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_defineProperty.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/mergeLeft.js":
+/*!********************************************!*\
+ !*** ./node_modules/ramda/es/mergeLeft.js ***!
+ \********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_objectAssign_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_objectAssign.js */ "./node_modules/ramda/es/internal/_objectAssign.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-var defineProperty = (function() {
- try {
- var func = getNative(Object, 'defineProperty');
- func({}, '', {});
- return func;
- } catch (e) {}
-}());
-module.exports = defineProperty;
+/**
+ * Create a new object with the own properties of the first object merged with
+ * the own properties of the second object. If a key exists in both objects,
+ * the value from the first object will be used.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.26.0
+ * @category Object
+ * @sig {k: v} -> {k: v} -> {k: v}
+ * @param {Object} l
+ * @param {Object} r
+ * @return {Object}
+ * @see R.mergeRight, R.mergeDeepLeft, R.mergeWith, R.mergeWithKey
+ * @example
+ *
+ * R.mergeLeft({ 'age': 40 }, { 'name': 'fred', 'age': 10 });
+ * //=> { 'name': 'fred', 'age': 40 }
+ *
+ * const resetToDefault = R.mergeLeft({x: 0});
+ * resetToDefault({x: 5, y: 2}); //=> {x: 0, y: 2}
+ * @symb R.mergeLeft(a, b) = {...b, ...a}
+ */
+var mergeLeft = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeLeft(l, r) {
+ return (0,_internal_objectAssign_js__WEBPACK_IMPORTED_MODULE_1__["default"])({}, r, l);
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeLeft);
/***/ }),
-/***/ "./node_modules/lodash/_equalArrays.js":
+/***/ "./node_modules/ramda/es/mergeRight.js":
/*!*********************************************!*\
- !*** ./node_modules/lodash/_equalArrays.js ***!
+ !*** ./node_modules/ramda/es/mergeRight.js ***!
\*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var SetCache = __webpack_require__(/*! ./_SetCache */ "./node_modules/lodash/_SetCache.js"),
- arraySome = __webpack_require__(/*! ./_arraySome */ "./node_modules/lodash/_arraySome.js"),
- cacheHas = __webpack_require__(/*! ./_cacheHas */ "./node_modules/lodash/_cacheHas.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_objectAssign_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_objectAssign.js */ "./node_modules/ramda/es/internal/_objectAssign.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1,
- COMPARE_UNORDERED_FLAG = 2;
/**
- * A specialized version of `baseIsEqualDeep` for arrays with support for
- * partial deep comparisons.
+ * Create a new object with the own properties of the first object merged with
+ * the own properties of the second object. If a key exists in both objects,
+ * the value from the second object will be used.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.26.0
+ * @category Object
+ * @sig {k: v} -> {k: v} -> {k: v}
+ * @param {Object} l
+ * @param {Object} r
+ * @return {Object}
+ * @see R.mergeLeft, R.mergeDeepRight, R.mergeWith, R.mergeWithKey
+ * @example
+ *
+ * R.mergeRight({ 'name': 'fred', 'age': 10 }, { 'age': 40 });
+ * //=> { 'name': 'fred', 'age': 40 }
+ *
+ * const withDefaults = R.mergeRight({x: 0, y: 0});
+ * withDefaults({y: 2}); //=> {x: 0, y: 2}
+ * @symb R.mergeRight(a, b) = {...a, ...b}
*/
-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;
- }
- // Check that cyclic values are equal.
- var arrStacked = stack.get(array);
- var othStacked = stack.get(other);
- if (arrStacked && othStacked) {
- return arrStacked == other && othStacked == array;
- }
- 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;
-}
-
-module.exports = equalArrays;
+var mergeRight = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeRight(l, r) {
+ return (0,_internal_objectAssign_js__WEBPACK_IMPORTED_MODULE_1__["default"])({}, l, r);
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeRight);
/***/ }),
-/***/ "./node_modules/lodash/_equalByTag.js":
+/***/ "./node_modules/ramda/es/mergeWith.js":
/*!********************************************!*\
- !*** ./node_modules/lodash/_equalByTag.js ***!
+ !*** ./node_modules/ramda/es/mergeWith.js ***!
\********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
- Uint8Array = __webpack_require__(/*! ./_Uint8Array */ "./node_modules/lodash/_Uint8Array.js"),
- eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
- equalArrays = __webpack_require__(/*! ./_equalArrays */ "./node_modules/lodash/_equalArrays.js"),
- mapToArray = __webpack_require__(/*! ./_mapToArray */ "./node_modules/lodash/_mapToArray.js"),
- setToArray = __webpack_require__(/*! ./_setToArray */ "./node_modules/lodash/_setToArray.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _mergeWithKey_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./mergeWithKey.js */ "./node_modules/ramda/es/mergeWithKey.js");
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1,
- COMPARE_UNORDERED_FLAG = 2;
-/** `Object#toString` result references. */
-var boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- errorTag = '[object Error]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- symbolTag = '[object Symbol]';
+/**
+ * Creates a new object with the own properties of the two provided objects. If
+ * a key exists in both objects, the provided function is applied to the values
+ * associated with the key in each object, with the result being used as the
+ * value associated with the key in the returned object.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.19.0
+ * @category Object
+ * @sig ((a, a) -> a) -> {a} -> {a} -> {a}
+ * @param {Function} fn
+ * @param {Object} l
+ * @param {Object} r
+ * @return {Object}
+ * @see R.mergeDeepWith, R.merge, R.mergeWithKey
+ * @example
+ *
+ * R.mergeWith(R.concat,
+ * { a: true, values: [10, 20] },
+ * { b: true, values: [15, 35] });
+ * //=> { a: true, b: true, values: [10, 20, 15, 35] }
+ */
+
+var mergeWith = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeWith(fn, l, r) {
+ return (0,_mergeWithKey_js__WEBPACK_IMPORTED_MODULE_1__["default"])(function (_, _l, _r) {
+ return fn(_l, _r);
+ }, l, r);
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeWith);
+
+/***/ }),
+
+/***/ "./node_modules/ramda/es/mergeWithKey.js":
+/*!***********************************************!*\
+ !*** ./node_modules/ramda/es/mergeWithKey.js ***!
+ \***********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var arrayBufferTag = '[object ArrayBuffer]',
- dataViewTag = '[object DataView]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
-/** Used to convert symbols to primitives and strings. */
-var symbolProto = Symbol ? Symbol.prototype : undefined,
- symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;
/**
- * A specialized version of `baseIsEqualDeep` for comparing objects of
- * the same `toStringTag`.
+ * Creates a new object with the own properties of the two provided objects. If
+ * a key exists in both objects, the provided function is applied to the key
+ * and the values associated with the key in each object, with the result being
+ * used as the value associated with the key in the returned object.
*
- * **Note:** This function only supports comparing values with tags of
- * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+ * @func
+ * @memberOf R
+ * @since v0.19.0
+ * @category Object
+ * @sig ((String, a, a) -> a) -> {a} -> {a} -> {a}
+ * @param {Function} fn
+ * @param {Object} l
+ * @param {Object} r
+ * @return {Object}
+ * @see R.mergeDeepWithKey, R.merge, R.mergeWith
+ * @example
*
- * @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`.
+ * let concatValues = (k, l, r) => k == 'values' ? R.concat(l, r) : r
+ * R.mergeWithKey(concatValues,
+ * { a: true, thing: 'foo', values: [10, 20] },
+ * { b: true, thing: 'bar', values: [15, 35] });
+ * //=> { a: true, b: true, thing: 'bar', values: [10, 20, 15, 35] }
+ * @symb R.mergeWithKey(f, { x: 1, y: 2 }, { y: 5, z: 3 }) = { x: 1, y: f('y', 2, 5), z: 3 }
*/
-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;
+var mergeWithKey = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function mergeWithKey(fn, l, r) {
+ var result = {};
+ var k;
+ l = l || {};
+ r = r || {};
+ for (k in l) {
+ if ((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(k, l)) {
+ result[k] = (0,_internal_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(k, r) ? fn(k, l[k], r[k]) : l[k];
+ }
+ }
+ for (k in r) {
+ if ((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(k, r) && !(0,_internal_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(k, result)) {
+ result[k] = r[k];
+ }
+ }
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (mergeWithKey);
- 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;
+/***/ "./node_modules/ramda/es/nth.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/nth.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- // 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;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_isString_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isString.js */ "./node_modules/ramda/es/internal/_isString.js");
- case symbolTag:
- if (symbolValueOf) {
- return symbolValueOf.call(object) == symbolValueOf.call(other);
- }
- }
- return false;
-}
-module.exports = equalByTag;
+/**
+ * Returns the nth element of the given list or string. If n is negative the
+ * element at index length + n is returned.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig Number -> [a] -> a | Undefined
+ * @sig Number -> String -> String
+ * @param {Number} offset
+ * @param {*} list
+ * @return {*}
+ * @example
+ *
+ * const list = ['foo', 'bar', 'baz', 'quux'];
+ * R.nth(1, list); //=> 'bar'
+ * R.nth(-1, list); //=> 'quux'
+ * R.nth(-99, list); //=> undefined
+ *
+ * R.nth(2, 'abc'); //=> 'c'
+ * R.nth(3, 'abc'); //=> ''
+ * @symb R.nth(-1, [a, b, c]) = c
+ * @symb R.nth(0, [a, b, c]) = a
+ * @symb R.nth(1, [a, b, c]) = b
+ */
+var nth = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function nth(offset, list) {
+ var idx = offset < 0 ? list.length + offset : offset;
+ return (0,_internal_isString_js__WEBPACK_IMPORTED_MODULE_1__["default"])(list) ? list.charAt(idx) : list[idx];
+});
+/* harmony default export */ __webpack_exports__["default"] = (nth);
/***/ }),
-/***/ "./node_modules/lodash/_equalObjects.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_equalObjects.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getAllKeys = __webpack_require__(/*! ./_getAllKeys */ "./node_modules/lodash/_getAllKeys.js");
-
-/** Used to compose bitmasks for value comparisons. */
-var COMPARE_PARTIAL_FLAG = 1;
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+/***/ "./node_modules/ramda/es/omit.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/omit.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * A specialized version of `baseIsEqualDeep` for objects with support for
- * partial deep comparisons.
+ * Returns a partial copy of an object omitting the keys specified.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig [String] -> {String: *} -> {String: *}
+ * @param {Array} names an array of String property names to omit from the new object
+ * @param {Object} obj The object to copy from
+ * @return {Object} A new object with properties from `names` not on it.
+ * @see R.pick
+ * @example
+ *
+ * R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}
*/
-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 omit = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function omit(names, obj) {
+ var result = {};
+ var index = {};
+ var idx = 0;
+ var len = names.length;
+ while (idx < len) {
+ index[names[idx]] = 1;
+ idx += 1;
}
- var index = objLength;
- while (index--) {
- var key = objProps[index];
- if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
- return false;
+ for (var prop in obj) {
+ if (!index.hasOwnProperty(prop)) {
+ result[prop] = obj[prop];
}
}
- // Check that cyclic values are equal.
- var objStacked = stack.get(object);
- var othStacked = stack.get(other);
- if (objStacked && othStacked) {
- return objStacked == other && othStacked == object;
- }
- var result = true;
- stack.set(object, other);
- stack.set(other, object);
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (omit);
- 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;
+/***/ "./node_modules/ramda/es/once.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/once.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- // 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;
-}
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_arity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_arity.js */ "./node_modules/ramda/es/internal/_arity.js");
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
-module.exports = equalObjects;
+/**
+ * Accepts a function `fn` and returns a function that guards invocation of
+ * `fn` such that `fn` can only ever be called once, no matter how many times
+ * the returned function is invoked. The first value calculated is returned in
+ * subsequent invocations.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Function
+ * @sig (a... -> b) -> (a... -> b)
+ * @param {Function} fn The function to wrap in a call-only-once wrapper.
+ * @return {Function} The wrapped function.
+ * @example
+ *
+ * const addOneOnce = R.once(x => x + 1);
+ * addOneOnce(10); //=> 11
+ * addOneOnce(addOneOnce(50)); //=> 11
+ */
+
+var once = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function once(fn) {
+ var called = false;
+ var result;
+ return (0,_internal_arity_js__WEBPACK_IMPORTED_MODULE_1__["default"])(fn.length, function () {
+ if (called) {
+ return result;
+ }
+ called = true;
+ result = fn.apply(this, arguments);
+ return result;
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (once);
/***/ }),
-/***/ "./node_modules/lodash/_flatRest.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_flatRest.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/over.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/over.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var flatten = __webpack_require__(/*! ./flatten */ "./node_modules/lodash/flatten.js"),
- overRest = __webpack_require__(/*! ./_overRest */ "./node_modules/lodash/_overRest.js"),
- setToString = __webpack_require__(/*! ./_setToString */ "./node_modules/lodash/_setToString.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+ // `Identity` is a functor that holds a single value, where `map` simply
+// transforms the held value with the provided function.
+var Identity = function Identity(x) {
+ return {
+ value: x,
+ map: function map(f) {
+ return Identity(f(x));
+ }
+ };
+};
/**
- * A specialized version of `baseRest` which flattens the rest array.
+ * Returns the result of "setting" the portion of the given data structure
+ * focused by the given lens to the result of applying the given function to
+ * the focused value.
*
- * @private
- * @param {Function} func The function to apply a rest parameter to.
- * @returns {Function} Returns the new function.
+ * @func
+ * @memberOf R
+ * @since v0.16.0
+ * @category Object
+ * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig Lens s a -> (a -> a) -> s -> s
+ * @param {Lens} lens
+ * @param {*} v
+ * @param {*} x
+ * @return {*}
+ * @see R.view, R.set, R.lens, R.lensIndex, R.lensProp, R.lensPath
+ * @example
+ *
+ * const headLens = R.lensIndex(0);
+ *
+ * R.over(headLens, R.toUpper, ['foo', 'bar', 'baz']); //=> ['FOO', 'bar', 'baz']
*/
-function flatRest(func) {
- return setToString(overRest(func, undefined, flatten), func + '');
-}
-
-module.exports = flatRest;
+var over = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function over(lens, f, x) {
+ // The value returned by the getter function is first transformed with `f`,
+ // then set as the value of an `Identity`. This is then mapped over with the
+ // setter function of the lens.
+ return lens(function (y) {
+ return Identity(f(y));
+ })(x).value;
+});
+/* harmony default export */ __webpack_exports__["default"] = (over);
/***/ }),
-/***/ "./node_modules/lodash/_freeGlobal.js":
+/***/ "./node_modules/ramda/es/partition.js":
/*!********************************************!*\
- !*** ./node_modules/lodash/_freeGlobal.js ***!
+ !*** ./node_modules/ramda/es/partition.js ***!
\********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Detect free variable `global` from Node.js. */
-var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g && __webpack_require__.g.Object === Object && __webpack_require__.g;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _filter_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./filter.js */ "./node_modules/ramda/es/filter.js");
+/* harmony import */ var _juxt_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./juxt.js */ "./node_modules/ramda/es/juxt.js");
+/* harmony import */ var _reject_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./reject.js */ "./node_modules/ramda/es/reject.js");
-module.exports = freeGlobal;
+/**
+ * Takes a predicate and a list or other `Filterable` object and returns the
+ * pair of filterable objects of the same type of elements which do and do not
+ * satisfy, the predicate, respectively. Filterable objects include plain objects or any object
+ * that has a filter method such as `Array`.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.4
+ * @category List
+ * @sig Filterable f => (a -> Boolean) -> f a -> [f a, f a]
+ * @param {Function} pred A predicate to determine which side the element belongs to.
+ * @param {Array} filterable the list (or other filterable) to partition.
+ * @return {Array} An array, containing first the subset of elements that satisfy the
+ * predicate, and second the subset of elements that do not satisfy.
+ * @see R.filter, R.reject
+ * @example
+ *
+ * R.partition(R.includes('s'), ['sss', 'ttt', 'foo', 'bars']);
+ * // => [ [ 'sss', 'bars' ], [ 'ttt', 'foo' ] ]
+ *
+ * R.partition(R.includes('s'), { a: 'sss', b: 'ttt', foo: 'bars' });
+ * // => [ { a: 'sss', foo: 'bars' }, { b: 'ttt' } ]
+ */
+
+var partition = /*#__PURE__*/
+(0,_juxt_js__WEBPACK_IMPORTED_MODULE_0__["default"])([_filter_js__WEBPACK_IMPORTED_MODULE_1__["default"], _reject_js__WEBPACK_IMPORTED_MODULE_2__["default"]]);
+/* harmony default export */ __webpack_exports__["default"] = (partition);
+
/***/ }),
-/***/ "./node_modules/lodash/_getAllKeys.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_getAllKeys.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/path.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/path.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _paths_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./paths.js */ "./node_modules/ramda/es/paths.js");
-var baseGetAllKeys = __webpack_require__(/*! ./_baseGetAllKeys */ "./node_modules/lodash/_baseGetAllKeys.js"),
- getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
/**
- * Creates an array of own enumerable property names and symbols of `object`.
+ * Retrieves the value at a given path. The nodes of the path can be arbitrary strings or non-negative integers.
+ * For anything else, the value is unspecified. Integer paths are meant to index arrays, strings are meant for objects.
*
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names and symbols.
+ * @func
+ * @memberOf R
+ * @since v0.2.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig [Idx] -> {a} -> a | Undefined
+ * @sig Idx = String | NonNegativeInt
+ * @param {Array} path The path to use.
+ * @param {Object} obj The object or array to retrieve the nested property from.
+ * @return {*} The data at `path`.
+ * @see R.prop, R.nth, R.assocPath, R.dissocPath
+ * @example
+ *
+ * R.path(['a', 'b'], {a: {b: 2}}); //=> 2
+ * R.path(['a', 'b'], {c: {b: 2}}); //=> undefined
+ * R.path(['a', 'b', 0], {a: {b: [1, 2, 3]}}); //=> 1
+ * R.path(['a', 'b', -2], {a: {b: [1, 2, 3]}}); //=> 2
+ * R.path([2], {'2': 2}); //=> 2
+ * R.path([-2], {'-2': 'a'}); //=> undefined
*/
-function getAllKeys(object) {
- return baseGetAllKeys(object, keys, getSymbols);
-}
-
-module.exports = getAllKeys;
+var path = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function path(pathAr, obj) {
+ return (0,_paths_js__WEBPACK_IMPORTED_MODULE_1__["default"])([pathAr], obj)[0];
+});
+/* harmony default export */ __webpack_exports__["default"] = (path);
/***/ }),
-/***/ "./node_modules/lodash/_getAllKeysIn.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_getAllKeysIn.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/pathOr.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/pathOr.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _defaultTo_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./defaultTo.js */ "./node_modules/ramda/es/defaultTo.js");
+/* harmony import */ var _path_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./path.js */ "./node_modules/ramda/es/path.js");
+
-var baseGetAllKeys = __webpack_require__(/*! ./_baseGetAllKeys */ "./node_modules/lodash/_baseGetAllKeys.js"),
- getSymbolsIn = __webpack_require__(/*! ./_getSymbolsIn */ "./node_modules/lodash/_getSymbolsIn.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
/**
- * Creates an array of own and inherited enumerable property names and
- * symbols of `object`.
+ * If the given, non-null object has a value at the given path, returns the
+ * value at that path. Otherwise returns the provided default value.
*
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names and symbols.
+ * @func
+ * @memberOf R
+ * @since v0.18.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig a -> [Idx] -> {a} -> a
+ * @param {*} d The default value.
+ * @param {Array} p The path to use.
+ * @param {Object} obj The object to retrieve the nested property from.
+ * @return {*} The data at `path` of the supplied object or the default value.
+ * @example
+ *
+ * R.pathOr('N/A', ['a', 'b'], {a: {b: 2}}); //=> 2
+ * R.pathOr('N/A', ['a', 'b'], {c: {b: 2}}); //=> "N/A"
*/
-function getAllKeysIn(object) {
- return baseGetAllKeys(object, keysIn, getSymbolsIn);
-}
-
-module.exports = getAllKeysIn;
+var pathOr = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function pathOr(d, p, obj) {
+ return (0,_defaultTo_js__WEBPACK_IMPORTED_MODULE_1__["default"])(d, (0,_path_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p, obj));
+});
+/* harmony default export */ __webpack_exports__["default"] = (pathOr);
/***/ }),
-/***/ "./node_modules/lodash/_getMapData.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_getMapData.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/paths.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/paths.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_isInteger_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
+/* harmony import */ var _nth_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./nth.js */ "./node_modules/ramda/es/nth.js");
+
-var isKeyable = __webpack_require__(/*! ./_isKeyable */ "./node_modules/lodash/_isKeyable.js");
/**
- * Gets the data for `map`.
+ * Retrieves the values at given paths of an object.
*
- * @private
- * @param {Object} map The map to query.
- * @param {string} key The reference key.
- * @returns {*} Returns the map data.
+ * @func
+ * @memberOf R
+ * @since v0.27.1
+ * @category Object
+ * @typedefn Idx = [String | Int | Symbol]
+ * @sig [Idx] -> {a} -> [a | Undefined]
+ * @param {Array} pathsArray The array of paths to be fetched.
+ * @param {Object} obj The object to retrieve the nested properties from.
+ * @return {Array} A list consisting of values at paths specified by "pathsArray".
+ * @see R.path
+ * @example
+ *
+ * R.paths([['a', 'b'], ['p', 0, 'q']], {a: {b: 2}, p: [{q: 3}]}); //=> [2, 3]
+ * R.paths([['a', 'b'], ['p', 'r']], {a: {b: 2}, p: [{q: 3}]}); //=> [2, undefined]
*/
-function getMapData(map, key) {
- var data = map.__data__;
- return isKeyable(key)
- ? data[typeof key == 'string' ? 'string' : 'hash']
- : data.map;
-}
-
-module.exports = getMapData;
+var paths = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function paths(pathsArray, obj) {
+ return pathsArray.map(function (paths) {
+ var val = obj;
+ var idx = 0;
+ var p;
+ while (idx < paths.length) {
+ if (val == null) {
+ return;
+ }
+ p = paths[idx];
+ val = (0,_internal_isInteger_js__WEBPACK_IMPORTED_MODULE_1__["default"])(p) ? (0,_nth_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p, val) : val[p];
+ idx += 1;
+ }
+ return val;
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (paths);
/***/ }),
-/***/ "./node_modules/lodash/_getMatchData.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_getMatchData.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/pick.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/pick.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var isStrictComparable = __webpack_require__(/*! ./_isStrictComparable */ "./node_modules/lodash/_isStrictComparable.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Gets the property names, values, and compare flags of `object`.
+ * Returns a partial copy of an object containing only the keys specified. If
+ * the key does not exist, the property is ignored.
*
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the match data of `object`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig [k] -> {k: v} -> {k: v}
+ * @param {Array} names an array of String property names to copy onto a new object
+ * @param {Object} obj The object to copy from
+ * @return {Object} A new object with only properties from `names` on it.
+ * @see R.omit, R.props
+ * @example
+ *
+ * R.pick(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1, d: 4}
+ * R.pick(['a', 'e', 'f'], {a: 1, b: 2, c: 3, d: 4}); //=> {a: 1}
*/
-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)];
+var pick = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function pick(names, obj) {
+ var result = {};
+ var idx = 0;
+ while (idx < names.length) {
+ if (names[idx] in obj) {
+ result[names[idx]] = obj[names[idx]];
+ }
+ idx += 1;
}
return result;
-}
-
-module.exports = getMatchData;
-
+});
+/* harmony default export */ __webpack_exports__["default"] = (pick);
/***/ }),
-/***/ "./node_modules/lodash/_getNative.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_getNative.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/pickBy.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/pickBy.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var baseIsNative = __webpack_require__(/*! ./_baseIsNative */ "./node_modules/lodash/_baseIsNative.js"),
- getValue = __webpack_require__(/*! ./_getValue */ "./node_modules/lodash/_getValue.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Gets the native function at `key` of `object`.
+ * Returns a partial copy of an object containing only the keys that satisfy
+ * the supplied predicate.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.8.0
+ * @category Object
+ * @sig ((v, k) -> Boolean) -> {k: v} -> {k: v}
+ * @param {Function} pred A predicate to determine whether or not a key
+ * should be included on the output object.
+ * @param {Object} obj The object to copy from
+ * @return {Object} A new object with only properties that satisfy `pred`
+ * on it.
+ * @see R.pick, R.filter
+ * @example
+ *
+ * const isUpperCase = (val, key) => key.toUpperCase() === key;
+ * R.pickBy(isUpperCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}
*/
-function getNative(object, key) {
- var value = getValue(object, key);
- return baseIsNative(value) ? value : undefined;
-}
-
-module.exports = getNative;
+var pickBy = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function pickBy(test, obj) {
+ var result = {};
+ for (var prop in obj) {
+ if (test(obj[prop], prop, obj)) {
+ result[prop] = obj[prop];
+ }
+ }
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (pickBy);
/***/ }),
-/***/ "./node_modules/lodash/_getPrototype.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_getPrototype.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var overArg = __webpack_require__(/*! ./_overArg */ "./node_modules/lodash/_overArg.js");
-
-/** Built-in value references. */
-var getPrototype = overArg(Object.getPrototypeOf, Object);
+/***/ "./node_modules/ramda/es/pluck.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/pluck.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-module.exports = getPrototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _map_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./map.js */ "./node_modules/ramda/es/map.js");
+/* harmony import */ var _prop_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./prop.js */ "./node_modules/ramda/es/prop.js");
-/***/ }),
-/***/ "./node_modules/lodash/_getRawTag.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_getRawTag.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * Returns a new list by plucking the same named property off all objects in
+ * the list supplied.
+ *
+ * `pluck` will work on
+ * any [functor](https://github.com/fantasyland/fantasy-land#functor) in
+ * addition to arrays, as it is equivalent to `R.map(R.prop(k), f)`.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig Functor f => k -> f {k: v} -> f v
+ * @param {Number|String} key The key name to pluck off of each object.
+ * @param {Array} f The array or functor to consider.
+ * @return {Array} The list of values for the given key.
+ * @see R.project, R.prop, R.props
+ * @example
+ *
+ * var getAges = R.pluck('age');
+ * getAges([{name: 'fred', age: 29}, {name: 'wilma', age: 27}]); //=> [29, 27]
+ *
+ * R.pluck(0, [[1, 2], [3, 4]]); //=> [1, 3]
+ * R.pluck('val', {a: {val: 3}, b: {val: 5}}); //=> {a: 3, b: 5}
+ * @symb R.pluck('x', [{x: 1, y: 2}, {x: 3, y: 4}, {x: 5, y: 6}]) = [1, 3, 5]
+ * @symb R.pluck(0, [[1, 2], [3, 4], [5, 6]]) = [1, 3, 5]
+ */
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js");
+var pluck = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function pluck(p, list) {
+ return (0,_map_js__WEBPACK_IMPORTED_MODULE_1__["default"])((0,_prop_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p), list);
+});
+/* harmony default export */ __webpack_exports__["default"] = (pluck);
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+/***/ }),
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+/***/ "./node_modules/ramda/es/prepend.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/prepend.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/**
- * Used to resolve the
- * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
- * of values.
- */
-var nativeObjectToString = objectProto.toString;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_concat_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_concat.js */ "./node_modules/ramda/es/internal/_concat.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
-/** Built-in value references. */
-var symToStringTag = Symbol ? Symbol.toStringTag : undefined;
/**
- * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
+ * Returns a new list with the given element at the front, followed by the
+ * contents of the list.
*
- * @private
- * @param {*} value The value to query.
- * @returns {string} Returns the raw `toStringTag`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig a -> [a] -> [a]
+ * @param {*} el The item to add to the head of the output list.
+ * @param {Array} list The array to add to the tail of the output list.
+ * @return {Array} A new array.
+ * @see R.append
+ * @example
+ *
+ * R.prepend('fee', ['fi', 'fo', 'fum']); //=> ['fee', 'fi', 'fo', 'fum']
*/
-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;
-}
-
-module.exports = getRawTag;
+var prepend = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function prepend(el, list) {
+ return (0,_internal_concat_js__WEBPACK_IMPORTED_MODULE_1__["default"])([el], list);
+});
+/* harmony default export */ __webpack_exports__["default"] = (prepend);
/***/ }),
-/***/ "./node_modules/lodash/_getSymbols.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_getSymbols.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var arrayFilter = __webpack_require__(/*! ./_arrayFilter */ "./node_modules/lodash/_arrayFilter.js"),
- stubArray = __webpack_require__(/*! ./stubArray */ "./node_modules/lodash/stubArray.js");
+/***/ "./node_modules/ramda/es/prop.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/prop.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_isInteger_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isInteger.js */ "./node_modules/ramda/es/internal/_isInteger.js");
+/* harmony import */ var _nth_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./nth.js */ "./node_modules/ramda/es/nth.js");
-/** Built-in value references. */
-var propertyIsEnumerable = objectProto.propertyIsEnumerable;
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeGetSymbols = Object.getOwnPropertySymbols;
/**
- * Creates an array of the own enumerable symbols of `object`.
+ * Returns a function that when supplied an object returns the indicated
+ * property of that object, if it exists.
*
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of symbols.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @typedefn Idx = String | Int | Symbol
+ * @sig Idx -> {s: a} -> a | Undefined
+ * @param {String|Number} p The property name or array index
+ * @param {Object} obj The object to query
+ * @return {*} The value at `obj.p`.
+ * @see R.path, R.props, R.pluck, R.project, R.nth
+ * @example
+ *
+ * R.prop('x', {x: 100}); //=> 100
+ * R.prop('x', {}); //=> undefined
+ * R.prop(0, [100]); //=> 100
+ * R.compose(R.inc, R.prop('x'))({ x: 3 }) //=> 4
*/
-var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
- if (object == null) {
- return [];
- }
- object = Object(object);
- return arrayFilter(nativeGetSymbols(object), function(symbol) {
- return propertyIsEnumerable.call(object, symbol);
- });
-};
-
-module.exports = getSymbols;
+var prop = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function prop(p, obj) {
+ if (obj == null) {
+ return;
+ }
+ return (0,_internal_isInteger_js__WEBPACK_IMPORTED_MODULE_1__["default"])(p) ? (0,_nth_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p, obj) : obj[p];
+});
+/* harmony default export */ __webpack_exports__["default"] = (prop);
/***/ }),
-/***/ "./node_modules/lodash/_getSymbolsIn.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_getSymbolsIn.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/propEq.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/propEq.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _prop_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./prop.js */ "./node_modules/ramda/es/prop.js");
+/* harmony import */ var _equals_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./equals.js */ "./node_modules/ramda/es/equals.js");
-var arrayPush = __webpack_require__(/*! ./_arrayPush */ "./node_modules/lodash/_arrayPush.js"),
- getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
- getSymbols = __webpack_require__(/*! ./_getSymbols */ "./node_modules/lodash/_getSymbols.js"),
- stubArray = __webpack_require__(/*! ./stubArray */ "./node_modules/lodash/stubArray.js");
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeGetSymbols = Object.getOwnPropertySymbols;
/**
- * Creates an array of the own and inherited enumerable symbols of `object`.
+ * Returns `true` if the specified object property is equal, in
+ * [`R.equals`](#equals) terms, to the given value; `false` otherwise.
+ * You can test multiple properties with [`R.whereEq`](#whereEq),
+ * and test nested path property with [`R.pathEq`](#pathEq).
*
- * @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of symbols.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Relation
+ * @sig a -> String -> Object -> Boolean
+ * @param {*} val The value to compare the property with
+ * @param {String} name the specified object property's key
+ * @param {*} obj The object to check the property in
+ * @return {Boolean} `true` if the value equals the specified object property,
+ * `false` otherwise.
+ * @see R.whereEq, R.pathEq, R.propSatisfies, R.equals
+ * @example
+ *
+ * const abby = {name: 'Abby', age: 7, hair: 'blond'};
+ * const fred = {name: 'Fred', age: 12, hair: 'brown'};
+ * const rusty = {name: 'Rusty', age: 10, hair: 'brown'};
+ * const alois = {name: 'Alois', age: 15, disposition: 'surly'};
+ * const kids = [abby, fred, rusty, alois];
+ * const hasBrownHair = R.propEq('brown', 'hair');
+ * R.filter(hasBrownHair, kids); //=> [fred, rusty]
*/
-var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
- var result = [];
- while (object) {
- arrayPush(result, getSymbols(object));
- object = getPrototype(object);
- }
- return result;
-};
-
-module.exports = getSymbolsIn;
+var propEq = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function propEq(val, name, obj) {
+ return (0,_equals_js__WEBPACK_IMPORTED_MODULE_1__["default"])(val, (0,_prop_js__WEBPACK_IMPORTED_MODULE_2__["default"])(name, obj));
+});
+/* harmony default export */ __webpack_exports__["default"] = (propEq);
/***/ }),
-/***/ "./node_modules/lodash/_getTag.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/_getTag.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var DataView = __webpack_require__(/*! ./_DataView */ "./node_modules/lodash/_DataView.js"),
- Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js"),
- Promise = __webpack_require__(/*! ./_Promise */ "./node_modules/lodash/_Promise.js"),
- Set = __webpack_require__(/*! ./_Set */ "./node_modules/lodash/_Set.js"),
- WeakMap = __webpack_require__(/*! ./_WeakMap */ "./node_modules/lodash/_WeakMap.js"),
- baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- toSource = __webpack_require__(/*! ./_toSource */ "./node_modules/lodash/_toSource.js");
+/***/ "./node_modules/ramda/es/propOr.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/propOr.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** `Object#toString` result references. */
-var mapTag = '[object Map]',
- objectTag = '[object Object]',
- promiseTag = '[object Promise]',
- setTag = '[object Set]',
- weakMapTag = '[object WeakMap]';
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _defaultTo_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./defaultTo.js */ "./node_modules/ramda/es/defaultTo.js");
+/* harmony import */ var _prop_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./prop.js */ "./node_modules/ramda/es/prop.js");
-var dataViewTag = '[object DataView]';
-/** Used to detect maps, sets, and weakmaps. */
-var dataViewCtorString = toSource(DataView),
- mapCtorString = toSource(Map),
- promiseCtorString = toSource(Promise),
- setCtorString = toSource(Set),
- weakMapCtorString = toSource(WeakMap);
/**
- * Gets the `toStringTag` of `value`.
+ * Return the specified property of the given non-null object if the property
+ * is present and it's value is not `null`, `undefined` or `NaN`.
+ *
+ * Otherwise the first argument is returned.
*
- * @private
- * @param {*} value The value to query.
- * @returns {string} Returns the `toStringTag`.
+ * @func
+ * @memberOf R
+ * @since v0.6.0
+ * @category Object
+ * @sig a -> String -> Object -> a
+ * @param {*} val The default value.
+ * @param {String} p The name of the property to return.
+ * @param {Object} obj The object to query.
+ * @return {*} The value of given property of the supplied object or the default value.
+ * @example
+ *
+ * const alice = {
+ * name: 'ALICE',
+ * age: 101
+ * };
+ * const favorite = R.prop('favoriteLibrary');
+ * const favoriteWithDefault = R.propOr('Ramda', 'favoriteLibrary');
+ *
+ * favorite(alice); //=> undefined
+ * favoriteWithDefault(alice); //=> 'Ramda'
*/
-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;
- };
-}
+var propOr = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function propOr(val, p, obj) {
+ return (0,_defaultTo_js__WEBPACK_IMPORTED_MODULE_1__["default"])(val, (0,_prop_js__WEBPACK_IMPORTED_MODULE_2__["default"])(p, obj));
+});
+/* harmony default export */ __webpack_exports__["default"] = (propOr);
-module.exports = getTag;
+/***/ }),
+/***/ "./node_modules/ramda/es/props.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/props.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _path_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./path.js */ "./node_modules/ramda/es/path.js");
-/***/ "./node_modules/lodash/_getValue.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_getValue.js ***!
- \******************************************/
-/***/ (function(module) {
/**
- * Gets the value at `key` of `object`.
+ * Acts as multiple `prop`: array of keys in, array of values out. Preserves
+ * order.
*
- * @private
- * @param {Object} [object] The object to query.
- * @param {string} key The key of the property to get.
- * @returns {*} Returns the property value.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig [k] -> {k: v} -> [v]
+ * @param {Array} ps The property names to fetch
+ * @param {Object} obj The object to query
+ * @return {Array} The corresponding values or partially applied function.
+ * @see R.prop, R.pluck, R.project
+ * @example
+ *
+ * R.props(['x', 'y'], {x: 1, y: 2}); //=> [1, 2]
+ * R.props(['c', 'a', 'b'], {b: 2, a: 1}); //=> [undefined, 1, 2]
+ *
+ * const fullName = R.compose(R.join(' '), R.props(['first', 'last']));
+ * fullName({last: 'Bullet-Tooth', age: 33, first: 'Tony'}); //=> 'Tony Bullet-Tooth'
*/
-function getValue(object, key) {
- return object == null ? undefined : object[key];
-}
-
-module.exports = getValue;
+var props = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function props(ps, obj) {
+ return ps.map(function (p) {
+ return (0,_path_js__WEBPACK_IMPORTED_MODULE_1__["default"])([p], obj);
+ });
+});
+/* harmony default export */ __webpack_exports__["default"] = (props);
/***/ }),
-/***/ "./node_modules/lodash/_hasPath.js":
+/***/ "./node_modules/ramda/es/reduce.js":
/*!*****************************************!*\
- !*** ./node_modules/lodash/_hasPath.js ***!
+ !*** ./node_modules/ramda/es/reduce.js ***!
\*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _internal_xReduce_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_xReduce.js */ "./node_modules/ramda/es/internal/_xReduce.js");
+/* harmony import */ var _internal_xwrap_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xwrap.js */ "./node_modules/ramda/es/internal/_xwrap.js");
+
-var castPath = __webpack_require__(/*! ./_castPath */ "./node_modules/lodash/_castPath.js"),
- isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
- isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
/**
- * Checks if `path` exists on `object`.
+ * Returns a single item by iterating through the list, successively calling
+ * the iterator function and passing it an accumulator value and the current
+ * value from the array, and then passing the result to the next call.
*
- * @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`.
+ * The iterator function receives two values: *(acc, value)*. It may use
+ * [`R.reduced`](#reduced) to shortcut the iteration.
+ *
+ * The arguments' order of [`reduceRight`](#reduceRight)'s iterator function
+ * is *(value, acc)*.
+ *
+ * Note: `R.reduce` does not skip deleted or unassigned indices (sparse
+ * arrays), unlike the native `Array.prototype.reduce` method. For more details
+ * on this behavior, see:
+ * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce#Description
+ *
+ * Be cautious of mutating and returning the accumulator. If you reuse it across
+ * invocations, it will continue to accumulate onto the same value. The general
+ * recommendation is to always return a new value. If you can't do so for
+ * performance reasons, then be sure to reinitialize the accumulator on each
+ * invocation.
+ *
+ * Dispatches to the `reduce` method of the third argument, if present. When
+ * doing so, it is up to the user to handle the [`R.reduced`](#reduced)
+ * shortcuting, as this is not implemented by `reduce`.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig ((a, b) -> a) -> a -> [b] -> a
+ * @param {Function} fn The iterator function. Receives two values, the accumulator and the
+ * current element from the array.
+ * @param {*} acc The accumulator value.
+ * @param {Array} list The list to iterate over.
+ * @return {*} The final, accumulated value.
+ * @see R.reduced, R.addIndex, R.reduceRight
+ * @example
+ *
+ * R.reduce(R.subtract, 0, [1, 2, 3, 4]) // => ((((0 - 1) - 2) - 3) - 4) = -10
+ * // - -10
+ * // / \ / \
+ * // - 4 -6 4
+ * // / \ / \
+ * // - 3 ==> -3 3
+ * // / \ / \
+ * // - 2 -1 2
+ * // / \ / \
+ * // 0 1 0 1
+ *
+ * @symb R.reduce(f, a, [b, c, d]) = f(f(f(a, b), c), d)
*/
-function hasPath(object, path, hasFunc) {
- path = castPath(path, object);
- var index = -1,
- length = path.length,
- result = false;
+var reduce = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function (xf, acc, list) {
+ return (0,_internal_xReduce_js__WEBPACK_IMPORTED_MODULE_1__["default"])(typeof xf === 'function' ? (0,_internal_xwrap_js__WEBPACK_IMPORTED_MODULE_2__["default"])(xf) : xf, acc, list);
+});
+/* harmony default export */ __webpack_exports__["default"] = (reduce);
- 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));
-}
+/***/ }),
+
+/***/ "./node_modules/ramda/es/reduceBy.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/reduceBy.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_clone_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./internal/_clone.js */ "./node_modules/ramda/es/internal/_clone.js");
+/* harmony import */ var _internal_curryN_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curryN.js */ "./node_modules/ramda/es/internal/_curryN.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
+/* harmony import */ var _internal_reduced_js__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./internal/_reduced.js */ "./node_modules/ramda/es/internal/_reduced.js");
+/* harmony import */ var _internal_xReduce_js__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./internal/_xReduce.js */ "./node_modules/ramda/es/internal/_xReduce.js");
+/* harmony import */ var _internal_xreduceBy_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xreduceBy.js */ "./node_modules/ramda/es/internal/_xreduceBy.js");
+/* harmony import */ var _internal_xwrap_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_xwrap.js */ "./node_modules/ramda/es/internal/_xwrap.js");
-module.exports = hasPath;
-/***/ }),
-/***/ "./node_modules/lodash/_hasUnicode.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_hasUnicode.js ***!
- \********************************************/
-/***/ (function(module) {
-/** Used to compose unicode character classes. */
-var rsAstralRange = '\\ud800-\\udfff',
- rsComboMarksRange = '\\u0300-\\u036f',
- reComboHalfMarksRange = '\\ufe20-\\ufe2f',
- rsComboSymbolsRange = '\\u20d0-\\u20ff',
- rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
- rsVarRange = '\\ufe0e\\ufe0f';
-/** Used to compose unicode capture groups. */
-var rsZWJ = '\\u200d';
-/** 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 + ']');
/**
- * Checks if `string` contains Unicode symbols.
+ * Groups the elements of the list according to the result of calling
+ * the String-returning function `keyFn` on each element and reduces the elements
+ * of each group to a single value via the reducer function `valueFn`.
*
- * @private
- * @param {string} string The string to inspect.
- * @returns {boolean} Returns `true` if a symbol is found, else `false`.
+ * The value function receives two values: *(acc, value)*. It may use
+ * [`R.reduced`](#reduced) to short circuit the iteration.
+ *
+ * This function is basically a more general [`groupBy`](#groupBy) function.
+ *
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.20.0
+ * @category List
+ * @sig ((a, b) -> a) -> a -> (b -> String) -> [b] -> {String: a}
+ * @param {Function} valueFn The function that reduces the elements of each group to a single
+ * value. Receives two values, accumulator for a particular group and the current element.
+ * @param {*} acc The (initial) accumulator value for each group.
+ * @param {Function} keyFn The function that maps the list's element into a key.
+ * @param {Array} list The array to group.
+ * @return {Object} An object with the output of `keyFn` for keys, mapped to the output of
+ * `valueFn` for elements which produced that key when passed to `keyFn`.
+ * @see R.groupBy, R.reduce, R.reduced
+ * @example
+ *
+ * const groupNames = (acc, {name}) => acc.concat(name)
+ * const toGrade = ({score}) =>
+ * score < 65 ? 'F' :
+ * score < 70 ? 'D' :
+ * score < 80 ? 'C' :
+ * score < 90 ? 'B' : 'A'
+ *
+ * var students = [
+ * {name: 'Abby', score: 83},
+ * {name: 'Bart', score: 62},
+ * {name: 'Curt', score: 88},
+ * {name: 'Dora', score: 92},
+ * ]
+ *
+ * reduceBy(groupNames, [], toGrade, students)
+ * //=> {"A": ["Dora"], "B": ["Abby", "Curt"], "F": ["Bart"]}
*/
-function hasUnicode(string) {
- return reHasUnicode.test(string);
-}
-
-module.exports = hasUnicode;
+var reduceBy = /*#__PURE__*/
+(0,_internal_curryN_js__WEBPACK_IMPORTED_MODULE_0__["default"])(4, [], /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])([], _internal_xreduceBy_js__WEBPACK_IMPORTED_MODULE_2__["default"], function reduceBy(valueFn, valueAcc, keyFn, list) {
+ var xf = (0,_internal_xwrap_js__WEBPACK_IMPORTED_MODULE_3__["default"])(function (acc, elt) {
+ var key = keyFn(elt);
+ var value = valueFn((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_4__["default"])(key, acc) ? acc[key] : (0,_internal_clone_js__WEBPACK_IMPORTED_MODULE_5__["default"])(valueAcc, false), elt);
+ if (value && value['@@transducer/reduced']) {
+ return (0,_internal_reduced_js__WEBPACK_IMPORTED_MODULE_6__["default"])(acc);
+ }
+ acc[key] = value;
+ return acc;
+ });
+ return (0,_internal_xReduce_js__WEBPACK_IMPORTED_MODULE_7__["default"])(xf, {}, list);
+}));
+/* harmony default export */ __webpack_exports__["default"] = (reduceBy);
/***/ }),
-/***/ "./node_modules/lodash/_hashClear.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_hashClear.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/reject.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/reject.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_complement_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_complement.js */ "./node_modules/ramda/es/internal/_complement.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _filter_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./filter.js */ "./node_modules/ramda/es/filter.js");
+
-var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
/**
- * Removes all key-value entries from the hash.
+ * The complement of [`filter`](#filter).
*
- * @private
- * @name clear
- * @memberOf Hash
+ * Acts as a transducer if a transformer is given in list position. Filterable
+ * objects include plain objects or any object that has a filter method such
+ * as `Array`.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig Filterable f => (a -> Boolean) -> f a -> f a
+ * @param {Function} pred
+ * @param {Array} filterable
+ * @return {Array}
+ * @see R.filter, R.transduce, R.addIndex
+ * @example
+ *
+ * const isOdd = (n) => n % 2 !== 0;
+ *
+ * R.reject(isOdd, [1, 2, 3, 4]); //=> [2, 4]
+ *
+ * R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}
*/
-function hashClear() {
- this.__data__ = nativeCreate ? nativeCreate(null) : {};
- this.size = 0;
-}
-
-module.exports = hashClear;
+var reject = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function reject(pred, filterable) {
+ return (0,_filter_js__WEBPACK_IMPORTED_MODULE_1__["default"])((0,_internal_complement_js__WEBPACK_IMPORTED_MODULE_2__["default"])(pred), filterable);
+});
+/* harmony default export */ __webpack_exports__["default"] = (reject);
/***/ }),
-/***/ "./node_modules/lodash/_hashDelete.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_hashDelete.js ***!
- \********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/remove.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/remove.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
/**
- * Removes `key` and its value from the hash.
+ * Removes the sub-list of `list` starting at index `start` and containing
+ * `count` elements. _Note that this is not destructive_: it returns a copy of
+ * the list with the changes.
+ * <small>No lists have been harmed in the application of this function.</small>
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.2.2
+ * @category List
+ * @sig Number -> Number -> [a] -> [a]
+ * @param {Number} start The position to start removing elements
+ * @param {Number} count The number of elements to remove
+ * @param {Array} list The list to remove from
+ * @return {Array} A new Array with `count` elements from `start` removed.
+ * @see R.without
+ * @example
+ *
+ * R.remove(2, 3, [1,2,3,4,5,6,7,8]); //=> [1,2,6,7,8]
*/
-function hashDelete(key) {
- var result = this.has(key) && delete this.__data__[key];
- this.size -= result ? 1 : 0;
- return result;
-}
-
-module.exports = hashDelete;
+var remove = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function remove(start, count, list) {
+ var result = Array.prototype.slice.call(list, 0);
+ result.splice(start, count);
+ return result;
+});
+/* harmony default export */ __webpack_exports__["default"] = (remove);
/***/ }),
-/***/ "./node_modules/lodash/_hashGet.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_hashGet.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
-
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
+/***/ "./node_modules/ramda/es/reverse.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/reverse.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_isString_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_isString.js */ "./node_modules/ramda/es/internal/_isString.js");
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * Gets the hash value for `key`.
+ * Returns a new list or string with the elements or characters in reverse
+ * order.
*
- * @private
- * @name get
- * @memberOf Hash
- * @param {string} key The key of the value to get.
- * @returns {*} Returns the entry value.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig [a] -> [a]
+ * @sig String -> String
+ * @param {Array|String} list
+ * @return {Array|String}
+ * @example
+ *
+ * R.reverse([1, 2, 3]); //=> [3, 2, 1]
+ * R.reverse([1, 2]); //=> [2, 1]
+ * R.reverse([1]); //=> [1]
+ * R.reverse([]); //=> []
+ *
+ * R.reverse('abc'); //=> 'cba'
+ * R.reverse('ab'); //=> 'ba'
+ * R.reverse('a'); //=> 'a'
+ * R.reverse(''); //=> ''
*/
-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;
-}
-
-module.exports = hashGet;
+var reverse = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function reverse(list) {
+ return (0,_internal_isString_js__WEBPACK_IMPORTED_MODULE_1__["default"])(list) ? list.split('').reverse().join('') : Array.prototype.slice.call(list, 0).reverse();
+});
+/* harmony default export */ __webpack_exports__["default"] = (reverse);
/***/ }),
-/***/ "./node_modules/lodash/_hashHas.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_hashHas.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/set.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/set.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
+/* harmony import */ var _always_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./always.js */ "./node_modules/ramda/es/always.js");
+/* harmony import */ var _over_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./over.js */ "./node_modules/ramda/es/over.js");
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * Checks if a hash value for `key` exists.
+ * Returns the result of "setting" the portion of the given data structure
+ * focused by the given lens to the given value.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.16.0
+ * @category Object
+ * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig Lens s a -> a -> s -> s
+ * @param {Lens} lens
+ * @param {*} v
+ * @param {*} x
+ * @return {*}
+ * @see R.view, R.over, R.lens, R.lensIndex, R.lensProp, R.lensPath
+ * @example
+ *
+ * const xLens = R.lensProp('x');
*
- * @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`.
+ * R.set(xLens, 4, {x: 1, y: 2}); //=> {x: 4, y: 2}
+ * R.set(xLens, 8, {x: 1, y: 2}); //=> {x: 8, y: 2}
*/
-function hashHas(key) {
- var data = this.__data__;
- return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);
-}
-
-module.exports = hashHas;
+var set = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function set(lens, v, x) {
+ return (0,_over_js__WEBPACK_IMPORTED_MODULE_1__["default"])(lens, (0,_always_js__WEBPACK_IMPORTED_MODULE_2__["default"])(v), x);
+});
+/* harmony default export */ __webpack_exports__["default"] = (set);
/***/ }),
-/***/ "./node_modules/lodash/_hashSet.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_hashSet.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/slice.js":
+/*!****************************************!*\
+ !*** ./node_modules/ramda/es/slice.js ***!
+ \****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var nativeCreate = __webpack_require__(/*! ./_nativeCreate */ "./node_modules/lodash/_nativeCreate.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_checkForMethod.js */ "./node_modules/ramda/es/internal/_checkForMethod.js");
+/* harmony import */ var _internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry3.js */ "./node_modules/ramda/es/internal/_curry3.js");
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
/**
- * Sets the hash `key` to `value`.
+ * Returns the elements of the given list or string (or object with a `slice`
+ * method) from `fromIndex` (inclusive) to `toIndex` (exclusive).
*
- * @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.
+ * Dispatches to the `slice` method of the third argument, if present.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.4
+ * @category List
+ * @sig Number -> Number -> [a] -> [a]
+ * @sig Number -> Number -> String -> String
+ * @param {Number} fromIndex The start index (inclusive).
+ * @param {Number} toIndex The end index (exclusive).
+ * @param {*} list
+ * @return {*}
+ * @example
+ *
+ * R.slice(1, 3, ['a', 'b', 'c', 'd']); //=> ['b', 'c']
+ * R.slice(1, Infinity, ['a', 'b', 'c', 'd']); //=> ['b', 'c', 'd']
+ * R.slice(0, -1, ['a', 'b', 'c', 'd']); //=> ['a', 'b', 'c']
+ * R.slice(-3, -1, ['a', 'b', 'c', 'd']); //=> ['b', 'c']
+ * R.slice(0, 3, 'ramda'); //=> 'ram'
*/
-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;
-}
-
-module.exports = hashSet;
+var slice = /*#__PURE__*/
+(0,_internal_curry3_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_checkForMethod_js__WEBPACK_IMPORTED_MODULE_1__["default"])('slice', function slice(fromIndex, toIndex, list) {
+ return Array.prototype.slice.call(list, fromIndex, toIndex);
+}));
+/* harmony default export */ __webpack_exports__["default"] = (slice);
/***/ }),
-/***/ "./node_modules/lodash/_initCloneArray.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_initCloneArray.js ***!
- \************************************************/
-/***/ (function(module) {
-
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+/***/ "./node_modules/ramda/es/sort.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/sort.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Initializes an array clone.
+ * Returns a copy of the list, sorted according to the comparator function,
+ * which should accept two values at a time and return a negative number if the
+ * first value is smaller, a positive number if it's larger, and zero if they
+ * are equal. Please note that this is a **copy** of the list. It does not
+ * modify the original.
*
- * @private
- * @param {Array} array The array to clone.
- * @returns {Array} Returns the initialized clone.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig ((a, a) -> Number) -> [a] -> [a]
+ * @param {Function} comparator A sorting function :: a -> b -> Int
+ * @param {Array} list The list to sort
+ * @return {Array} a new array with its elements sorted by the comparator function.
+ * @see R.ascend, R.descend
+ * @example
+ *
+ * const diff = function(a, b) { return a - b; };
+ * R.sort(diff, [4,2,7,5]); //=> [2, 4, 5, 7]
*/
-function initCloneArray(array) {
- var length = array.length,
- result = new 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;
-}
-
-module.exports = initCloneArray;
+var sort = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function sort(comparator, list) {
+ return Array.prototype.slice.call(list, 0).sort(comparator);
+});
+/* harmony default export */ __webpack_exports__["default"] = (sort);
/***/ }),
-/***/ "./node_modules/lodash/_initCloneByTag.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_initCloneByTag.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/startsWith.js":
+/*!*********************************************!*\
+ !*** ./node_modules/ramda/es/startsWith.js ***!
+ \*********************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var cloneArrayBuffer = __webpack_require__(/*! ./_cloneArrayBuffer */ "./node_modules/lodash/_cloneArrayBuffer.js"),
- cloneDataView = __webpack_require__(/*! ./_cloneDataView */ "./node_modules/lodash/_cloneDataView.js"),
- cloneRegExp = __webpack_require__(/*! ./_cloneRegExp */ "./node_modules/lodash/_cloneRegExp.js"),
- cloneSymbol = __webpack_require__(/*! ./_cloneSymbol */ "./node_modules/lodash/_cloneSymbol.js"),
- cloneTypedArray = __webpack_require__(/*! ./_cloneTypedArray */ "./node_modules/lodash/_cloneTypedArray.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _equals_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./equals.js */ "./node_modules/ramda/es/equals.js");
+/* harmony import */ var _take_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./take.js */ "./node_modules/ramda/es/take.js");
-/** `Object#toString` result references. */
-var boolTag = '[object Boolean]',
- dateTag = '[object Date]',
- mapTag = '[object Map]',
- numberTag = '[object Number]',
- regexpTag = '[object RegExp]',
- setTag = '[object Set]',
- stringTag = '[object String]',
- symbolTag = '[object Symbol]';
-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]';
/**
- * Initializes an object clone based on its `toStringTag`.
+ * Checks if a list starts with the provided sublist.
*
- * **Note:** This function only supports cloning values with tags of
- * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
+ * Similarly, checks if a string starts with the provided substring.
*
- * @private
- * @param {Object} object The object to clone.
- * @param {string} tag The `toStringTag` of the object to clone.
- * @param {boolean} [isDeep] Specify a deep clone.
- * @returns {Object} Returns the initialized clone.
+ * @func
+ * @memberOf R
+ * @since v0.24.0
+ * @category List
+ * @sig [a] -> [a] -> Boolean
+ * @sig String -> String -> Boolean
+ * @param {*} prefix
+ * @param {*} list
+ * @return {Boolean}
+ * @see R.endsWith
+ * @example
+ *
+ * R.startsWith('a', 'abc') //=> true
+ * R.startsWith('b', 'abc') //=> false
+ * R.startsWith(['a'], ['a', 'b', 'c']) //=> true
+ * R.startsWith(['b'], ['a', 'b', 'c']) //=> false
*/
-function initCloneByTag(object, tag, 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);
+var startsWith = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function (prefix, list) {
+ return (0,_equals_js__WEBPACK_IMPORTED_MODULE_1__["default"])((0,_take_js__WEBPACK_IMPORTED_MODULE_2__["default"])(prefix.length, list), prefix);
+});
+/* harmony default export */ __webpack_exports__["default"] = (startsWith);
- 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 new Ctor;
+/***/ "./node_modules/ramda/es/take.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/take.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
- case numberTag:
- case stringTag:
- return new Ctor(object);
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xtake_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xtake.js */ "./node_modules/ramda/es/internal/_xtake.js");
+/* harmony import */ var _slice_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./slice.js */ "./node_modules/ramda/es/slice.js");
- case regexpTag:
- return cloneRegExp(object);
- case setTag:
- return new Ctor;
- case symbolTag:
- return cloneSymbol(object);
- }
-}
-module.exports = initCloneByTag;
+/**
+ * Returns the first `n` elements of the given list, string, or
+ * transducer/transformer (or object with a `take` method).
+ *
+ * Dispatches to the `take` method of the second argument, if present.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig Number -> [a] -> [a]
+ * @sig Number -> String -> String
+ * @param {Number} n
+ * @param {*} list
+ * @return {*}
+ * @see R.drop
+ * @example
+ *
+ * R.take(1, ['foo', 'bar', 'baz']); //=> ['foo']
+ * R.take(2, ['foo', 'bar', 'baz']); //=> ['foo', 'bar']
+ * R.take(3, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']
+ * R.take(4, ['foo', 'bar', 'baz']); //=> ['foo', 'bar', 'baz']
+ * R.take(3, 'ramda'); //=> 'ram'
+ *
+ * const personnel = [
+ * 'Dave Brubeck',
+ * 'Paul Desmond',
+ * 'Eugene Wright',
+ * 'Joe Morello',
+ * 'Gerry Mulligan',
+ * 'Bob Bates',
+ * 'Joe Dodge',
+ * 'Ron Crotty'
+ * ];
+ *
+ * const takeFive = R.take(5);
+ * takeFive(personnel);
+ * //=> ['Dave Brubeck', 'Paul Desmond', 'Eugene Wright', 'Joe Morello', 'Gerry Mulligan']
+ * @symb R.take(-1, [a, b]) = [a, b]
+ * @symb R.take(0, [a, b]) = []
+ * @symb R.take(1, [a, b]) = [a]
+ * @symb R.take(2, [a, b]) = [a, b]
+ */
+var take = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])(['take'], _internal_xtake_js__WEBPACK_IMPORTED_MODULE_2__["default"], function take(n, xs) {
+ return (0,_slice_js__WEBPACK_IMPORTED_MODULE_3__["default"])(0, n < 0 ? Infinity : n, xs);
+}));
+/* harmony default export */ __webpack_exports__["default"] = (take);
/***/ }),
-/***/ "./node_modules/lodash/_initCloneObject.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_initCloneObject.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/toPairs.js":
+/*!******************************************!*\
+ !*** ./node_modules/ramda/es/toPairs.js ***!
+ \******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_has_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_has.js */ "./node_modules/ramda/es/internal/_has.js");
-var baseCreate = __webpack_require__(/*! ./_baseCreate */ "./node_modules/lodash/_baseCreate.js"),
- getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
- isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js");
/**
- * Initializes an object clone.
+ * Converts an object into an array of key, value arrays. Only the object's
+ * own properties are used.
+ * Note that the order of the output array is not guaranteed to be consistent
+ * across different JS platforms.
*
- * @private
- * @param {Object} object The object to clone.
- * @returns {Object} Returns the initialized clone.
+ * @func
+ * @memberOf R
+ * @since v0.4.0
+ * @category Object
+ * @sig {String: *} -> [[String,*]]
+ * @param {Object} obj The object to extract from
+ * @return {Array} An array of key, value arrays from the object's own properties.
+ * @see R.fromPairs, R.keys, R.values
+ * @example
+ *
+ * R.toPairs({a: 1, b: 2, c: 3}); //=> [['a', 1], ['b', 2], ['c', 3]]
*/
-function initCloneObject(object) {
- return (typeof object.constructor == 'function' && !isPrototype(object))
- ? baseCreate(getPrototype(object))
- : {};
-}
-
-module.exports = initCloneObject;
+var toPairs = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function toPairs(obj) {
+ var pairs = [];
+ for (var prop in obj) {
+ if ((0,_internal_has_js__WEBPACK_IMPORTED_MODULE_1__["default"])(prop, obj)) {
+ pairs[pairs.length] = [prop, obj[prop]];
+ }
+ }
+ return pairs;
+});
+/* harmony default export */ __webpack_exports__["default"] = (toPairs);
/***/ }),
-/***/ "./node_modules/lodash/_isFlattenable.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_isFlattenable.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/toString.js":
+/*!*******************************************!*\
+ !*** ./node_modules/ramda/es/toString.js ***!
+ \*******************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var Symbol = __webpack_require__(/*! ./_Symbol */ "./node_modules/lodash/_Symbol.js"),
- isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _internal_toString_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_toString.js */ "./node_modules/ramda/es/internal/_toString.js");
-/** Built-in value references. */
-var spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;
/**
- * Checks if `value` is a flattenable `arguments` object or array.
+ * Returns the string representation of the given value. `eval`'ing the output
+ * should result in a value equivalent to the input value. Many of the built-in
+ * `toString` methods do not satisfy this requirement.
*
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
+ * If the given value is an `[object Object]` with a `toString` method other
+ * than `Object.prototype.toString`, this method is invoked with no arguments
+ * to produce the return value. This means user-defined constructor functions
+ * can provide a suitable `toString` method. For example:
+ *
+ * function Point(x, y) {
+ * this.x = x;
+ * this.y = y;
+ * }
+ *
+ * Point.prototype.toString = function() {
+ * return 'new Point(' + this.x + ', ' + this.y + ')';
+ * };
+ *
+ * R.toString(new Point(1, 2)); //=> 'new Point(1, 2)'
+ *
+ * @func
+ * @memberOf R
+ * @since v0.14.0
+ * @category String
+ * @sig * -> String
+ * @param {*} val
+ * @return {String}
+ * @example
+ *
+ * R.toString(42); //=> '42'
+ * R.toString('abc'); //=> '"abc"'
+ * R.toString([1, 2, 3]); //=> '[1, 2, 3]'
+ * R.toString({foo: 1, bar: 2, baz: 3}); //=> '{"bar": 2, "baz": 3, "foo": 1}'
+ * R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date("2001-02-03T04:05:06.000Z")'
*/
-function isFlattenable(value) {
- return isArray(value) || isArguments(value) ||
- !!(spreadableSymbol && value && value[spreadableSymbol]);
-}
-
-module.exports = isFlattenable;
+var toString = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function toString(val) {
+ return (0,_internal_toString_js__WEBPACK_IMPORTED_MODULE_1__["default"])(val, []);
+});
+/* harmony default export */ __webpack_exports__["default"] = (toString);
/***/ }),
-/***/ "./node_modules/lodash/_isIndex.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_isIndex.js ***!
- \*****************************************/
-/***/ (function(module) {
-
-/** Used as references for various `Number` constants. */
-var MAX_SAFE_INTEGER = 9007199254740991;
+/***/ "./node_modules/ramda/es/type.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/type.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used to detect unsigned integer values. */
-var reIsUint = /^(?:0|[1-9]\d*)$/;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
/**
- * Checks if `value` is a valid array-like index.
+ * Gives a single-word string description of the (native) type of a value,
+ * returning such answers as 'Object', 'Number', 'Array', or 'Null'. Does not
+ * attempt to distinguish user Object types any further, reporting them all as
+ * 'Object'.
*
- * @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`.
+ * @func
+ * @memberOf R
+ * @since v0.8.0
+ * @category Type
+ * @sig * -> String
+ * @param {*} val The value to test
+ * @return {String}
+ * @example
+ *
+ * R.type({}); //=> "Object"
+ * R.type(1); //=> "Number"
+ * R.type(false); //=> "Boolean"
+ * R.type('s'); //=> "String"
+ * R.type(null); //=> "Null"
+ * R.type([]); //=> "Array"
+ * R.type(/[A-z]/); //=> "RegExp"
+ * R.type(() => {}); //=> "Function"
+ * R.type(async () => {}); //=> "AsyncFunction"
+ * R.type(undefined); //=> "Undefined"
*/
-function isIndex(value, length) {
- var type = typeof value;
- length = length == null ? MAX_SAFE_INTEGER : length;
-
- return !!length &&
- (type == 'number' ||
- (type != 'symbol' && reIsUint.test(value))) &&
- (value > -1 && value % 1 == 0 && value < length);
-}
-
-module.exports = isIndex;
+var type = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function type(val) {
+ return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);
+});
+/* harmony default export */ __webpack_exports__["default"] = (type);
/***/ }),
-/***/ "./node_modules/lodash/_isIterateeCall.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_isIterateeCall.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/uniq.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/uniq.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _identity_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./identity.js */ "./node_modules/ramda/es/identity.js");
+/* harmony import */ var _uniqBy_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./uniqBy.js */ "./node_modules/ramda/es/uniqBy.js");
-var eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
- isIndex = __webpack_require__(/*! ./_isIndex */ "./node_modules/lodash/_isIndex.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
/**
- * Checks if the given arguments are from an iteratee call.
+ * Returns a new list containing only one copy of each element in the original
+ * list. [`R.equals`](#equals) is used to determine equality.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig [a] -> [a]
+ * @param {Array} list The array to consider.
+ * @return {Array} The list of unique items.
+ * @example
*
- * @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`.
+ * R.uniq([1, 1, 2, 1]); //=> [1, 2]
+ * R.uniq([1, '1']); //=> [1, '1']
+ * R.uniq([[42], [42]]); //=> [[42]]
*/
-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;
-}
-
-module.exports = isIterateeCall;
+var uniq = /*#__PURE__*/
+(0,_uniqBy_js__WEBPACK_IMPORTED_MODULE_0__["default"])(_identity_js__WEBPACK_IMPORTED_MODULE_1__["default"]);
+/* harmony default export */ __webpack_exports__["default"] = (uniq);
/***/ }),
-/***/ "./node_modules/lodash/_isKey.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/_isKey.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/uniqBy.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/uniqBy.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_Set_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./internal/_Set.js */ "./node_modules/ramda/es/internal/_Set.js");
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+/* harmony import */ var _internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internal/_dispatchable.js */ "./node_modules/ramda/es/internal/_dispatchable.js");
+/* harmony import */ var _internal_xuniqBy_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./internal/_xuniqBy.js */ "./node_modules/ramda/es/internal/_xuniqBy.js");
+
-var isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
-/** Used to match property names within property paths. */
-var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
- reIsPlainProp = /^\w*$/;
/**
- * Checks if `value` is a property name and not a property path.
+ * Returns a new list containing only one copy of each element in the original
+ * list, based upon the value returned by applying the supplied function to
+ * each list element. Prefers the first item if the supplied function produces
+ * the same value on two items. [`R.equals`](#equals) is used for comparison.
*
- * @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`.
+ * Acts as a transducer if a transformer is given in list position.
+ *
+ * @func
+ * @memberOf R
+ * @since v0.16.0
+ * @category List
+ * @sig (a -> b) -> [a] -> [a]
+ * @param {Function} fn A function used to produce a value to use during comparisons.
+ * @param {Array} list The array to consider.
+ * @return {Array} The list of unique items.
+ * @example
+ *
+ * R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]
*/
-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;
+
+var uniqBy = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])( /*#__PURE__*/
+(0,_internal_dispatchable_js__WEBPACK_IMPORTED_MODULE_1__["default"])([], _internal_xuniqBy_js__WEBPACK_IMPORTED_MODULE_2__["default"], function (fn, list) {
+ var set = new _internal_Set_js__WEBPACK_IMPORTED_MODULE_3__["default"]();
+ var result = [];
+ var idx = 0;
+ var appliedItem, item;
+ while (idx < list.length) {
+ item = list[idx];
+ appliedItem = fn(item);
+ if (set.add(appliedItem)) {
+ result.push(item);
+ }
+ idx += 1;
}
- return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
- (object != null && value in Object(object));
-}
+ return result;
+}));
+/* harmony default export */ __webpack_exports__["default"] = (uniqBy);
-module.exports = isKey;
+/***/ }),
+/***/ "./node_modules/ramda/es/values.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/values.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/***/ }),
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry1.js */ "./node_modules/ramda/es/internal/_curry1.js");
+/* harmony import */ var _keys_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./keys.js */ "./node_modules/ramda/es/keys.js");
-/***/ "./node_modules/lodash/_isKeyable.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/_isKeyable.js ***!
- \*******************************************/
-/***/ (function(module) {
/**
- * Checks if `value` is suitable for use as unique object key.
+ * Returns a list of all the enumerable own properties of the supplied object.
+ * Note that the order of the output array is not guaranteed across different
+ * JS platforms.
*
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category Object
+ * @sig {k: v} -> [v]
+ * @param {Object} obj The object to extract values from
+ * @return {Array} An array of the values of the object's own properties.
+ * @see R.valuesIn, R.keys, R.toPairs
+ * @example
+ *
+ * R.values({a: 1, b: 2, c: 3}); //=> [1, 2, 3]
*/
-function isKeyable(value) {
- var type = typeof value;
- return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
- ? (value !== '__proto__')
- : (value === null);
-}
-
-module.exports = isKeyable;
+var values = /*#__PURE__*/
+(0,_internal_curry1_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function values(obj) {
+ var props = (0,_keys_js__WEBPACK_IMPORTED_MODULE_1__["default"])(obj);
+ var len = props.length;
+ var vals = [];
+ var idx = 0;
+ while (idx < len) {
+ vals[idx] = obj[props[idx]];
+ idx += 1;
+ }
+ return vals;
+});
+/* harmony default export */ __webpack_exports__["default"] = (values);
/***/ }),
-/***/ "./node_modules/lodash/_isMasked.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_isMasked.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var coreJsData = __webpack_require__(/*! ./_coreJsData */ "./node_modules/lodash/_coreJsData.js");
+/***/ "./node_modules/ramda/es/view.js":
+/*!***************************************!*\
+ !*** ./node_modules/ramda/es/view.js ***!
+ \***************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** 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) : '';
-}());
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
+ // `Const` is a functor that effectively ignores the function given to `map`.
+var Const = function Const(x) {
+ return {
+ value: x,
+ 'fantasy-land/map': function fantasyLandMap() {
+ return this;
+ }
+ };
+};
/**
- * Checks if `func` has its source masked.
+ * Returns a "view" of the given data structure, determined by the given lens.
+ * The lens's focus determines which portion of the data structure is visible.
*
- * @private
- * @param {Function} func The function to check.
- * @returns {boolean} Returns `true` if `func` is masked, else `false`.
+ * @func
+ * @memberOf R
+ * @since v0.16.0
+ * @category Object
+ * @typedefn Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig Lens s a -> s -> a
+ * @param {Lens} lens
+ * @param {*} x
+ * @return {*}
+ * @see R.set, R.over, R.lens, R.lensIndex, R.lensProp, R.lensPath
+ * @example
+ *
+ * const xLens = R.lensProp('x');
+ *
+ * R.view(xLens, {x: 1, y: 2}); //=> 1
+ * R.view(xLens, {x: 4, y: 2}); //=> 4
*/
-function isMasked(func) {
- return !!maskSrcKey && (maskSrcKey in func);
-}
-
-module.exports = isMasked;
+var view = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function view(lens, x) {
+ // Using `Const` effectively ignores the setter function of the `lens`,
+ // leaving the value returned by the getter function unmodified.
+ return lens(Const)(x).value;
+});
+/* harmony default export */ __webpack_exports__["default"] = (view);
/***/ }),
-/***/ "./node_modules/lodash/_isPrototype.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_isPrototype.js ***!
- \*********************************************/
-/***/ (function(module) {
+/***/ "./node_modules/ramda/es/zip.js":
+/*!**************************************!*\
+ !*** ./node_modules/ramda/es/zip.js ***!
+ \**************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Checks if `value` is likely a prototype object.
+ * Creates a new list out of the two supplied by pairing up equally-positioned
+ * items from both lists. The returned list is truncated to the length of the
+ * shorter of the two input lists.
+ * Note: `zip` is equivalent to `zipWith(function(a, b) { return [a, b] })`.
*
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
+ * @func
+ * @memberOf R
+ * @since v0.1.0
+ * @category List
+ * @sig [a] -> [b] -> [[a,b]]
+ * @param {Array} list1 The first array to consider.
+ * @param {Array} list2 The second array to consider.
+ * @return {Array} The list made by pairing up same-indexed elements of `list1` and `list2`.
+ * @example
+ *
+ * R.zip([1, 2, 3], ['a', 'b', 'c']); //=> [[1, 'a'], [2, 'b'], [3, 'c']]
+ * @symb R.zip([a, b, c], [d, e, f]) = [[a, d], [b, e], [c, f]]
*/
-function isPrototype(value) {
- var Ctor = value && value.constructor,
- proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
-
- return value === proto;
-}
-
-module.exports = isPrototype;
+var zip = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function zip(a, b) {
+ var rv = [];
+ var idx = 0;
+ var len = Math.min(a.length, b.length);
+ while (idx < len) {
+ rv[idx] = [a[idx], b[idx]];
+ idx += 1;
+ }
+ return rv;
+});
+/* harmony default export */ __webpack_exports__["default"] = (zip);
/***/ }),
-/***/ "./node_modules/lodash/_isStrictComparable.js":
-/*!****************************************************!*\
- !*** ./node_modules/lodash/_isStrictComparable.js ***!
- \****************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/***/ "./node_modules/ramda/es/zipObj.js":
+/*!*****************************************!*\
+ !*** ./node_modules/ramda/es/zipObj.js ***!
+ \*****************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
-var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony import */ var _internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./internal/_curry2.js */ "./node_modules/ramda/es/internal/_curry2.js");
/**
- * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
+ * Creates a new object out of a list of keys and a list of values.
+ * Key/value pairing is truncated to the length of the shorter of the two lists.
+ * Note: `zipObj` is equivalent to `pipe(zip, fromPairs)`.
*
- * @private
- * @param {*} value The value to check.
- * @returns {boolean} Returns `true` if `value` if suitable for strict
- * equality comparisons, else `false`.
+ * @func
+ * @memberOf R
+ * @since v0.3.0
+ * @category List
+ * @sig [String] -> [*] -> {String: *}
+ * @param {Array} keys The array that will be properties on the output object.
+ * @param {Array} values The list of values on the output object.
+ * @return {Object} The object made by pairing up same-indexed elements of `keys` and `values`.
+ * @example
+ *
+ * R.zipObj(['a', 'b', 'c'], [1, 2, 3]); //=> {a: 1, b: 2, c: 3}
*/
-function isStrictComparable(value) {
- return value === value && !isObject(value);
-}
-
-module.exports = isStrictComparable;
+var zipObj = /*#__PURE__*/
+(0,_internal_curry2_js__WEBPACK_IMPORTED_MODULE_0__["default"])(function zipObj(keys, values) {
+ var idx = 0;
+ var len = Math.min(keys.length, values.length);
+ var out = {};
+ while (idx < len) {
+ out[keys[idx]] = values[idx];
+ idx += 1;
+ }
+ return out;
+});
+/* harmony default export */ __webpack_exports__["default"] = (zipObj);
/***/ }),
-/***/ "./node_modules/lodash/_listCacheClear.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_listCacheClear.js ***!
- \************************************************/
-/***/ (function(module) {
+/***/ "./node_modules/cytoscape/dist/cytoscape.esm.mjs":
+/*!*******************************************************!*\
+ !*** ./node_modules/cytoscape/dist/cytoscape.esm.mjs ***!
+ \*******************************************************/
+/***/ (function(__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) {
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */ "default": function() { return /* binding */ cytoscape; }
+/* harmony export */ });
/**
- * Removes all key-value entries from the list cache.
+ * Copyright (c) 2016-2024, The Cytoscape Consortium.
*
- * @private
- * @name clear
- * @memberOf ListCache
+ * Permission is hereby granted, free of charge, to any person obtaining a copy of
+ * this software and associated documentation files (the “Software”), to deal in
+ * the Software without restriction, including without limitation the rights to
+ * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+ * of the Software, and to permit persons to whom the Software is furnished to do
+ * so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in all
+ * copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
*/
-function listCacheClear() {
- this.__data__ = [];
- this.size = 0;
+
+function _typeof(obj) {
+ "@babel/helpers - typeof";
+
+ return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) {
+ return typeof obj;
+ } : function (obj) {
+ return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj;
+ }, _typeof(obj);
+}
+function _classCallCheck(instance, Constructor) {
+ if (!(instance instanceof Constructor)) {
+ throw new TypeError("Cannot call a class as a 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);
+ }
+}
+function _createClass(Constructor, protoProps, staticProps) {
+ if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+ if (staticProps) _defineProperties(Constructor, staticProps);
+ Object.defineProperty(Constructor, "prototype", {
+ writable: false
+ });
+ return Constructor;
+}
+function _defineProperty$1(obj, key, value) {
+ if (key in obj) {
+ Object.defineProperty(obj, key, {
+ value: value,
+ enumerable: true,
+ configurable: true,
+ writable: true
+ });
+ } else {
+ obj[key] = value;
+ }
+ return obj;
+}
+function _slicedToArray(arr, i) {
+ return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
+}
+function _arrayWithHoles(arr) {
+ if (Array.isArray(arr)) return arr;
+}
+function _iterableToArrayLimit(arr, i) {
+ var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+ if (_i == null) return;
+ var _arr = [];
+ var _n = true;
+ var _d = false;
+ var _s, _e;
+ try {
+ for (_i = _i.call(arr); !(_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"] != null) _i["return"]();
+ } finally {
+ if (_d) throw _e;
+ }
+ }
+ return _arr;
+}
+function _unsupportedIterableToArray(o, minLen) {
+ if (!o) return;
+ if (typeof o === "string") return _arrayLikeToArray(o, minLen);
+ var n = Object.prototype.toString.call(o).slice(8, -1);
+ if (n === "Object" && o.constructor) n = o.constructor.name;
+ if (n === "Map" || n === "Set") return Array.from(o);
+ if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
+}
+function _arrayLikeToArray(arr, len) {
+ if (len == null || len > arr.length) len = arr.length;
+ for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
+ return arr2;
+}
+function _nonIterableRest() {
+ throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function _createForOfIteratorHelper(o, allowArrayLike) {
+ var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
+ if (!it) {
+ if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
+ if (it) o = it;
+ var i = 0;
+ var F = function () {};
+ return {
+ s: F,
+ n: function () {
+ if (i >= o.length) return {
+ done: true
+ };
+ return {
+ done: false,
+ value: o[i++]
+ };
+ },
+ e: function (e) {
+ throw e;
+ },
+ f: F
+ };
+ }
+ throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+ }
+ var normalCompletion = true,
+ didErr = false,
+ err;
+ return {
+ s: function () {
+ it = it.call(o);
+ },
+ n: function () {
+ var step = it.next();
+ normalCompletion = step.done;
+ return step;
+ },
+ e: function (e) {
+ didErr = true;
+ err = e;
+ },
+ f: function () {
+ try {
+ if (!normalCompletion && it.return != null) it.return();
+ } finally {
+ if (didErr) throw err;
+ }
+ }
+ };
}
-module.exports = listCacheClear;
+var _window = typeof window === 'undefined' ? null : window; // eslint-disable-line no-undef
+
+var navigator = _window ? _window.navigator : null;
+_window ? _window.document : null;
+var typeofstr = _typeof('');
+var typeofobj = _typeof({});
+var typeoffn = _typeof(function () {});
+var typeofhtmlele = typeof HTMLElement === "undefined" ? "undefined" : _typeof(HTMLElement);
+var instanceStr = function instanceStr(obj) {
+ return obj && obj.instanceString && fn$6(obj.instanceString) ? obj.instanceString() : null;
+};
+var string = function string(obj) {
+ return obj != null && _typeof(obj) == typeofstr;
+};
+var fn$6 = function fn(obj) {
+ return obj != null && _typeof(obj) === typeoffn;
+};
+var array = function array(obj) {
+ return !elementOrCollection(obj) && (Array.isArray ? Array.isArray(obj) : obj != null && obj instanceof Array);
+};
+var plainObject = function plainObject(obj) {
+ return obj != null && _typeof(obj) === typeofobj && !array(obj) && obj.constructor === Object;
+};
+var object = function object(obj) {
+ return obj != null && _typeof(obj) === typeofobj;
+};
+var number$1 = function number(obj) {
+ return obj != null && _typeof(obj) === _typeof(1) && !isNaN(obj);
+};
+var integer = function integer(obj) {
+ return number$1(obj) && Math.floor(obj) === obj;
+};
+var htmlElement = function htmlElement(obj) {
+ if ('undefined' === typeofhtmlele) {
+ return undefined;
+ } else {
+ return null != obj && obj instanceof HTMLElement;
+ }
+};
+var elementOrCollection = function elementOrCollection(obj) {
+ return element(obj) || collection(obj);
+};
+var element = function element(obj) {
+ return instanceStr(obj) === 'collection' && obj._private.single;
+};
+var collection = function collection(obj) {
+ return instanceStr(obj) === 'collection' && !obj._private.single;
+};
+var core = function core(obj) {
+ return instanceStr(obj) === 'core';
+};
+var stylesheet = function stylesheet(obj) {
+ return instanceStr(obj) === 'stylesheet';
+};
+var event = function event(obj) {
+ return instanceStr(obj) === 'event';
+};
+var emptyString = function emptyString(obj) {
+ if (obj === undefined || obj === null) {
+ // null is empty
+ return true;
+ } else if (obj === '' || obj.match(/^\s+$/)) {
+ return true; // empty string is empty
+ }
-/***/ }),
+ return false; // otherwise, we don't know what we've got
+};
+var domElement = function domElement(obj) {
+ if (typeof HTMLElement === 'undefined') {
+ return false; // we're not in a browser so it doesn't matter
+ } else {
+ return obj instanceof HTMLElement;
+ }
+};
+var boundingBox = function boundingBox(obj) {
+ return plainObject(obj) && number$1(obj.x1) && number$1(obj.x2) && number$1(obj.y1) && number$1(obj.y2);
+};
+var promise = function promise(obj) {
+ return object(obj) && fn$6(obj.then);
+};
+var ms = function ms() {
+ return navigator && navigator.userAgent.match(/msie|trident|edge/i);
+}; // probably a better way to detect this...
-/***/ "./node_modules/lodash/_listCacheDelete.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_listCacheDelete.js ***!
- \*************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var memoize$1 = function memoize(fn, keyFn) {
+ if (!keyFn) {
+ keyFn = function keyFn() {
+ if (arguments.length === 1) {
+ return arguments[0];
+ } else if (arguments.length === 0) {
+ return 'undefined';
+ }
+ var args = [];
+ for (var i = 0; i < arguments.length; i++) {
+ args.push(arguments[i]);
+ }
+ return args.join('$');
+ };
+ }
+ var memoizedFn = function memoizedFn() {
+ var self = this;
+ var args = arguments;
+ var ret;
+ var k = keyFn.apply(self, args);
+ var cache = memoizedFn.cache;
+ if (!(ret = cache[k])) {
+ ret = cache[k] = fn.apply(self, args);
+ }
+ return ret;
+ };
+ memoizedFn.cache = {};
+ return memoizedFn;
+};
-var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
+var camel2dash = memoize$1(function (str) {
+ return str.replace(/([A-Z])/g, function (v) {
+ return '-' + v.toLowerCase();
+ });
+});
+var dash2camel = memoize$1(function (str) {
+ return str.replace(/(-\w)/g, function (v) {
+ return v[1].toUpperCase();
+ });
+});
+var prependCamel = memoize$1(function (prefix, str) {
+ return prefix + str[0].toUpperCase() + str.substring(1);
+}, function (prefix, str) {
+ return prefix + '$' + str;
+});
+var capitalize = function capitalize(str) {
+ if (emptyString(str)) {
+ return str;
+ }
+ return str.charAt(0).toUpperCase() + str.substring(1);
+};
-/** Used for built-in method references. */
-var arrayProto = Array.prototype;
+var number = '(?:[-+]?(?:(?:\\d+|\\d*\\.\\d+)(?:[Ee][+-]?\\d+)?))';
+var rgba = 'rgb[a]?\\((' + number + '[%]?)\\s*,\\s*(' + number + '[%]?)\\s*,\\s*(' + number + '[%]?)(?:\\s*,\\s*(' + number + '))?\\)';
+var rgbaNoBackRefs = 'rgb[a]?\\((?:' + number + '[%]?)\\s*,\\s*(?:' + number + '[%]?)\\s*,\\s*(?:' + number + '[%]?)(?:\\s*,\\s*(?:' + number + '))?\\)';
+var hsla = 'hsl[a]?\\((' + number + ')\\s*,\\s*(' + number + '[%])\\s*,\\s*(' + number + '[%])(?:\\s*,\\s*(' + number + '))?\\)';
+var hslaNoBackRefs = 'hsl[a]?\\((?:' + number + ')\\s*,\\s*(?:' + number + '[%])\\s*,\\s*(?:' + number + '[%])(?:\\s*,\\s*(?:' + number + '))?\\)';
+var hex3 = '\\#[0-9a-fA-F]{3}';
+var hex6 = '\\#[0-9a-fA-F]{6}';
-/** Built-in value references. */
-var splice = arrayProto.splice;
+var ascending = function ascending(a, b) {
+ if (a < b) {
+ return -1;
+ } else if (a > b) {
+ return 1;
+ } else {
+ return 0;
+ }
+};
+var descending = function descending(a, b) {
+ return -1 * ascending(a, b);
+};
-/**
- * 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);
+var extend = Object.assign != null ? Object.assign.bind(Object) : function (tgt) {
+ var args = arguments;
+ for (var i = 1; i < args.length; i++) {
+ var obj = args[i];
+ if (obj == null) {
+ continue;
+ }
+ var keys = Object.keys(obj);
+ for (var j = 0; j < keys.length; j++) {
+ var k = keys[j];
+ tgt[k] = obj[k];
+ }
+ }
+ return tgt;
+};
- if (index < 0) {
- return false;
+// get [r, g, b] from #abc or #aabbcc
+var hex2tuple = function hex2tuple(hex) {
+ if (!(hex.length === 4 || hex.length === 7) || hex[0] !== '#') {
+ return;
}
- var lastIndex = data.length - 1;
- if (index == lastIndex) {
- data.pop();
+ var shortHex = hex.length === 4;
+ var r, g, b;
+ var base = 16;
+ if (shortHex) {
+ r = parseInt(hex[1] + hex[1], base);
+ g = parseInt(hex[2] + hex[2], base);
+ b = parseInt(hex[3] + hex[3], base);
} else {
- splice.call(data, index, 1);
+ r = parseInt(hex[1] + hex[2], base);
+ g = parseInt(hex[3] + hex[4], base);
+ b = parseInt(hex[5] + hex[6], base);
}
- --this.size;
- return true;
-}
-
-module.exports = listCacheDelete;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_listCacheGet.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_listCacheGet.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
-
-/**
- * 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];
-}
-
-module.exports = listCacheGet;
+ return [r, g, b];
+};
+// get [r, g, b, a] from hsl(0, 0, 0) or hsla(0, 0, 0, 0)
+var hsl2tuple = function hsl2tuple(hsl) {
+ var ret;
+ var h, s, l, a, r, g, b;
+ function hue2rgb(p, q, t) {
+ if (t < 0) t += 1;
+ if (t > 1) t -= 1;
+ if (t < 1 / 6) return p + (q - p) * 6 * t;
+ if (t < 1 / 2) return q;
+ if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;
+ return p;
+ }
+ var m = new RegExp('^' + hsla + '$').exec(hsl);
+ if (m) {
+ // get hue
+ h = parseInt(m[1]);
+ if (h < 0) {
+ h = (360 - -1 * h % 360) % 360;
+ } else if (h > 360) {
+ h = h % 360;
+ }
+ h /= 360; // normalise on [0, 1]
-/***/ }),
+ s = parseFloat(m[2]);
+ if (s < 0 || s > 100) {
+ return;
+ } // saturation is [0, 100]
+ s = s / 100; // normalise on [0, 1]
-/***/ "./node_modules/lodash/_listCacheHas.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_listCacheHas.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ l = parseFloat(m[3]);
+ if (l < 0 || l > 100) {
+ return;
+ } // lightness is [0, 100]
+ l = l / 100; // normalise on [0, 1]
-var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
+ a = m[4];
+ if (a !== undefined) {
+ a = parseFloat(a);
+ if (a < 0 || a > 1) {
+ return;
+ } // alpha is [0, 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;
-}
+ // now, convert to rgb
+ // code from http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript
+ if (s === 0) {
+ r = g = b = Math.round(l * 255); // achromatic
+ } else {
+ var q = l < 0.5 ? l * (1 + s) : l + s - l * s;
+ var p = 2 * l - q;
+ r = Math.round(255 * hue2rgb(p, q, h + 1 / 3));
+ g = Math.round(255 * hue2rgb(p, q, h));
+ b = Math.round(255 * hue2rgb(p, q, h - 1 / 3));
+ }
+ ret = [r, g, b, a];
+ }
+ return ret;
+};
-module.exports = listCacheHas;
+// get [r, g, b, a] from rgb(0, 0, 0) or rgba(0, 0, 0, 0)
+var rgb2tuple = function rgb2tuple(rgb) {
+ var ret;
+ var m = new RegExp('^' + rgba + '$').exec(rgb);
+ if (m) {
+ ret = [];
+ var isPct = [];
+ for (var i = 1; i <= 3; i++) {
+ var channel = m[i];
+ if (channel[channel.length - 1] === '%') {
+ isPct[i] = true;
+ }
+ channel = parseFloat(channel);
+ if (isPct[i]) {
+ channel = channel / 100 * 255; // normalise to [0, 255]
+ }
+ if (channel < 0 || channel > 255) {
+ return;
+ } // invalid channel value
-/***/ }),
+ ret.push(Math.floor(channel));
+ }
+ var atLeastOneIsPct = isPct[1] || isPct[2] || isPct[3];
+ var allArePct = isPct[1] && isPct[2] && isPct[3];
+ if (atLeastOneIsPct && !allArePct) {
+ return;
+ } // must all be percent values if one is
-/***/ "./node_modules/lodash/_listCacheSet.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_listCacheSet.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ var alpha = m[4];
+ if (alpha !== undefined) {
+ alpha = parseFloat(alpha);
+ if (alpha < 0 || alpha > 1) {
+ return;
+ } // invalid alpha value
-var assocIndexOf = __webpack_require__(/*! ./_assocIndexOf */ "./node_modules/lodash/_assocIndexOf.js");
+ ret.push(alpha);
+ }
+ }
+ return ret;
+};
+var colorname2tuple = function colorname2tuple(color) {
+ return colors[color.toLowerCase()];
+};
+var color2tuple = function color2tuple(color) {
+ return (array(color) ? color : null) || colorname2tuple(color) || hex2tuple(color) || rgb2tuple(color) || hsl2tuple(color);
+};
+var colors = {
+ // special colour names
+ transparent: [0, 0, 0, 0],
+ // NB alpha === 0
-/**
- * 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);
+ // regular colours
+ aliceblue: [240, 248, 255],
+ antiquewhite: [250, 235, 215],
+ aqua: [0, 255, 255],
+ aquamarine: [127, 255, 212],
+ azure: [240, 255, 255],
+ beige: [245, 245, 220],
+ bisque: [255, 228, 196],
+ black: [0, 0, 0],
+ blanchedalmond: [255, 235, 205],
+ blue: [0, 0, 255],
+ blueviolet: [138, 43, 226],
+ brown: [165, 42, 42],
+ burlywood: [222, 184, 135],
+ cadetblue: [95, 158, 160],
+ chartreuse: [127, 255, 0],
+ chocolate: [210, 105, 30],
+ coral: [255, 127, 80],
+ cornflowerblue: [100, 149, 237],
+ cornsilk: [255, 248, 220],
+ crimson: [220, 20, 60],
+ cyan: [0, 255, 255],
+ darkblue: [0, 0, 139],
+ darkcyan: [0, 139, 139],
+ darkgoldenrod: [184, 134, 11],
+ darkgray: [169, 169, 169],
+ darkgreen: [0, 100, 0],
+ darkgrey: [169, 169, 169],
+ darkkhaki: [189, 183, 107],
+ darkmagenta: [139, 0, 139],
+ darkolivegreen: [85, 107, 47],
+ darkorange: [255, 140, 0],
+ darkorchid: [153, 50, 204],
+ darkred: [139, 0, 0],
+ darksalmon: [233, 150, 122],
+ darkseagreen: [143, 188, 143],
+ darkslateblue: [72, 61, 139],
+ darkslategray: [47, 79, 79],
+ darkslategrey: [47, 79, 79],
+ darkturquoise: [0, 206, 209],
+ darkviolet: [148, 0, 211],
+ deeppink: [255, 20, 147],
+ deepskyblue: [0, 191, 255],
+ dimgray: [105, 105, 105],
+ dimgrey: [105, 105, 105],
+ dodgerblue: [30, 144, 255],
+ firebrick: [178, 34, 34],
+ floralwhite: [255, 250, 240],
+ forestgreen: [34, 139, 34],
+ fuchsia: [255, 0, 255],
+ gainsboro: [220, 220, 220],
+ ghostwhite: [248, 248, 255],
+ gold: [255, 215, 0],
+ goldenrod: [218, 165, 32],
+ gray: [128, 128, 128],
+ grey: [128, 128, 128],
+ green: [0, 128, 0],
+ greenyellow: [173, 255, 47],
+ honeydew: [240, 255, 240],
+ hotpink: [255, 105, 180],
+ indianred: [205, 92, 92],
+ indigo: [75, 0, 130],
+ ivory: [255, 255, 240],
+ khaki: [240, 230, 140],
+ lavender: [230, 230, 250],
+ lavenderblush: [255, 240, 245],
+ lawngreen: [124, 252, 0],
+ lemonchiffon: [255, 250, 205],
+ lightblue: [173, 216, 230],
+ lightcoral: [240, 128, 128],
+ lightcyan: [224, 255, 255],
+ lightgoldenrodyellow: [250, 250, 210],
+ lightgray: [211, 211, 211],
+ lightgreen: [144, 238, 144],
+ lightgrey: [211, 211, 211],
+ lightpink: [255, 182, 193],
+ lightsalmon: [255, 160, 122],
+ lightseagreen: [32, 178, 170],
+ lightskyblue: [135, 206, 250],
+ lightslategray: [119, 136, 153],
+ lightslategrey: [119, 136, 153],
+ lightsteelblue: [176, 196, 222],
+ lightyellow: [255, 255, 224],
+ lime: [0, 255, 0],
+ limegreen: [50, 205, 50],
+ linen: [250, 240, 230],
+ magenta: [255, 0, 255],
+ maroon: [128, 0, 0],
+ mediumaquamarine: [102, 205, 170],
+ mediumblue: [0, 0, 205],
+ mediumorchid: [186, 85, 211],
+ mediumpurple: [147, 112, 219],
+ mediumseagreen: [60, 179, 113],
+ mediumslateblue: [123, 104, 238],
+ mediumspringgreen: [0, 250, 154],
+ mediumturquoise: [72, 209, 204],
+ mediumvioletred: [199, 21, 133],
+ midnightblue: [25, 25, 112],
+ mintcream: [245, 255, 250],
+ mistyrose: [255, 228, 225],
+ moccasin: [255, 228, 181],
+ navajowhite: [255, 222, 173],
+ navy: [0, 0, 128],
+ oldlace: [253, 245, 230],
+ olive: [128, 128, 0],
+ olivedrab: [107, 142, 35],
+ orange: [255, 165, 0],
+ orangered: [255, 69, 0],
+ orchid: [218, 112, 214],
+ palegoldenrod: [238, 232, 170],
+ palegreen: [152, 251, 152],
+ paleturquoise: [175, 238, 238],
+ palevioletred: [219, 112, 147],
+ papayawhip: [255, 239, 213],
+ peachpuff: [255, 218, 185],
+ peru: [205, 133, 63],
+ pink: [255, 192, 203],
+ plum: [221, 160, 221],
+ powderblue: [176, 224, 230],
+ purple: [128, 0, 128],
+ red: [255, 0, 0],
+ rosybrown: [188, 143, 143],
+ royalblue: [65, 105, 225],
+ saddlebrown: [139, 69, 19],
+ salmon: [250, 128, 114],
+ sandybrown: [244, 164, 96],
+ seagreen: [46, 139, 87],
+ seashell: [255, 245, 238],
+ sienna: [160, 82, 45],
+ silver: [192, 192, 192],
+ skyblue: [135, 206, 235],
+ slateblue: [106, 90, 205],
+ slategray: [112, 128, 144],
+ slategrey: [112, 128, 144],
+ snow: [255, 250, 250],
+ springgreen: [0, 255, 127],
+ steelblue: [70, 130, 180],
+ tan: [210, 180, 140],
+ teal: [0, 128, 128],
+ thistle: [216, 191, 216],
+ tomato: [255, 99, 71],
+ turquoise: [64, 224, 208],
+ violet: [238, 130, 238],
+ wheat: [245, 222, 179],
+ white: [255, 255, 255],
+ whitesmoke: [245, 245, 245],
+ yellow: [255, 255, 0],
+ yellowgreen: [154, 205, 50]
+};
- if (index < 0) {
- ++this.size;
- data.push([key, value]);
- } else {
- data[index][1] = value;
+// sets the value in a map (map may not be built)
+var setMap = function setMap(options) {
+ var obj = options.map;
+ var keys = options.keys;
+ var l = keys.length;
+ for (var i = 0; i < l; i++) {
+ var key = keys[i];
+ if (plainObject(key)) {
+ throw Error('Tried to set map with object key');
+ }
+ if (i < keys.length - 1) {
+ // extend the map if necessary
+ if (obj[key] == null) {
+ obj[key] = {};
+ }
+ obj = obj[key];
+ } else {
+ // set the value
+ obj[key] = options.value;
+ }
}
- return this;
-}
-
-module.exports = listCacheSet;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_mapCacheClear.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_mapCacheClear.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+};
-var Hash = __webpack_require__(/*! ./_Hash */ "./node_modules/lodash/_Hash.js"),
- ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
- Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js");
+// gets the value in a map even if it's not built in places
+var getMap = function getMap(options) {
+ var obj = options.map;
+ var keys = options.keys;
+ var l = keys.length;
+ for (var i = 0; i < l; i++) {
+ var key = keys[i];
+ if (plainObject(key)) {
+ throw Error('Tried to get map with object key');
+ }
+ obj = obj[key];
+ if (obj == null) {
+ return obj;
+ }
+ }
+ return obj;
+};
/**
- * Removes all key-value entries from the map.
+ * 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('')`)
*
- * @private
- * @name clear
- * @memberOf MapCache
- */
-function mapCacheClear() {
- this.size = 0;
- this.__data__ = {
- 'hash': new Hash,
- 'map': new (Map || ListCache),
- 'string': new Hash
- };
-}
-
-module.exports = mapCacheClear;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_mapCacheDelete.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_mapCacheDelete.js ***!
- \************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
-
-/**
- * Removes `key` and its value from the map.
+ * @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
*
- * @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;
-}
-
-module.exports = mapCacheDelete;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_mapCacheGet.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_mapCacheGet.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
-
-/**
- * Gets the map value for `key`.
+ * _.isObject({});
+ * // => true
*
- * @private
- * @name get
- * @memberOf MapCache
- * @param {string} key The key of the value to get.
- * @returns {*} Returns the entry value.
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(_.noop);
+ * // => true
+ *
+ * _.isObject(null);
+ * // => false
*/
-function mapCacheGet(key) {
- return getMapData(this, key).get(key);
+function isObject(value) {
+ var type = typeof value;
+ return value != null && (type == 'object' || type == 'function');
}
-module.exports = mapCacheGet;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_mapCacheHas.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_mapCacheHas.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var isObject_1 = isObject;
-var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
+var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
-/**
- * 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);
+function createCommonjsModule(fn, module) {
+ return module = { exports: {} }, fn(module, module.exports), module.exports;
}
-module.exports = mapCacheHas;
+/** Detect free variable `global` from Node.js. */
+var freeGlobal = typeof commonjsGlobal == 'object' && commonjsGlobal && commonjsGlobal.Object === Object && commonjsGlobal;
+var _freeGlobal = freeGlobal;
-/***/ }),
+/** Detect free variable `self`. */
+var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
-/***/ "./node_modules/lodash/_mapCacheSet.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_mapCacheSet.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/** Used as a reference to the global object. */
+var root = _freeGlobal || freeSelf || Function('return this')();
-var getMapData = __webpack_require__(/*! ./_getMapData */ "./node_modules/lodash/_getMapData.js");
+var _root = root;
/**
- * Sets the map `key` to `value`.
+ * Gets the timestamp of the number of milliseconds that have elapsed since
+ * the Unix epoch (1 January 1970 00:00:00 UTC).
*
- * @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.
+ * @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.
*/
-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;
-}
-
-module.exports = mapCacheSet;
-
+var now = function() {
+ return _root.Date.now();
+};
-/***/ }),
+var now_1 = now;
-/***/ "./node_modules/lodash/_mapToArray.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_mapToArray.js ***!
- \********************************************/
-/***/ (function(module) {
+/** Used to match a single whitespace character. */
+var reWhitespace = /\s/;
/**
- * Converts `map` to its key-value pairs.
+ * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
+ * character of `string`.
*
* @private
- * @param {Object} map The map to convert.
- * @returns {Array} Returns the key-value pairs.
+ * @param {string} string The string to inspect.
+ * @returns {number} Returns the index of the last non-whitespace character.
*/
-function mapToArray(map) {
- var index = -1,
- result = Array(map.size);
+function trimmedEndIndex(string) {
+ var index = string.length;
- map.forEach(function(value, key) {
- result[++index] = [key, value];
- });
- return result;
+ while (index-- && reWhitespace.test(string.charAt(index))) {}
+ return index;
}
-module.exports = mapToArray;
-
-
-/***/ }),
+var _trimmedEndIndex = trimmedEndIndex;
-/***/ "./node_modules/lodash/_matchesStrictComparable.js":
-/*!*********************************************************!*\
- !*** ./node_modules/lodash/_matchesStrictComparable.js ***!
- \*********************************************************/
-/***/ (function(module) {
+/** Used to match leading whitespace. */
+var reTrimStart = /^\s+/;
/**
- * A specialized version of `matchesProperty` for source values suitable
- * for strict equality comparisons, i.e. `===`.
+ * The base implementation of `_.trim`.
*
* @private
- * @param {string} key The key of the property to get.
- * @param {*} srcValue The value to match.
- * @returns {Function} Returns the new spec function.
+ * @param {string} string The string to trim.
+ * @returns {string} Returns the trimmed string.
*/
-function matchesStrictComparable(key, srcValue) {
- return function(object) {
- if (object == null) {
- return false;
- }
- return object[key] === srcValue &&
- (srcValue !== undefined || (key in Object(object)));
- };
+function baseTrim(string) {
+ return string
+ ? string.slice(0, _trimmedEndIndex(string) + 1).replace(reTrimStart, '')
+ : string;
}
-module.exports = matchesStrictComparable;
-
+var _baseTrim = baseTrim;
-/***/ }),
+/** Built-in value references. */
+var Symbol$1 = _root.Symbol;
-/***/ "./node_modules/lodash/_memoizeCapped.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_memoizeCapped.js ***!
- \***********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var _Symbol = Symbol$1;
-var memoize = __webpack_require__(/*! ./memoize */ "./node_modules/lodash/memoize.js");
+/** Used for built-in method references. */
+var objectProto$5 = Object.prototype;
-/** Used as the maximum memoize cache size. */
-var MAX_MEMOIZE_SIZE = 500;
+/** Used to check objects for own properties. */
+var hasOwnProperty$4 = objectProto$5.hasOwnProperty;
/**
- * 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.
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
*/
-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;
-}
-
-module.exports = memoizeCapped;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_nativeCreate.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_nativeCreate.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var getNative = __webpack_require__(/*! ./_getNative */ "./node_modules/lodash/_getNative.js");
-
-/* Built-in method references that are verified to be native. */
-var nativeCreate = getNative(Object, 'create');
-
-module.exports = nativeCreate;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_nativeKeys.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_nativeKeys.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var overArg = __webpack_require__(/*! ./_overArg */ "./node_modules/lodash/_overArg.js");
-
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeKeys = overArg(Object.keys, Object);
+var nativeObjectToString$1 = objectProto$5.toString;
-module.exports = nativeKeys;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_nativeKeysIn.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_nativeKeysIn.js ***!
- \**********************************************/
-/***/ (function(module) {
+/** Built-in value references. */
+var symToStringTag$1 = _Symbol ? _Symbol.toStringTag : undefined;
/**
- * This function is like
- * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
- * except that it includes inherited enumerable properties.
+ * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
*
* @private
- * @param {Object} object The object to query.
- * @returns {Array} Returns the array of property names.
+ * @param {*} value The value to query.
+ * @returns {string} Returns the raw `toStringTag`.
*/
-function nativeKeysIn(object) {
- var result = [];
- if (object != null) {
- for (var key in Object(object)) {
- result.push(key);
- }
- }
- return result;
-}
-
-module.exports = nativeKeysIn;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_nodeUtil.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_nodeUtil.js ***!
- \******************************************/
-/***/ (function(module, exports, __webpack_require__) {
-
-/* module decorator */ module = __webpack_require__.nmd(module);
-var freeGlobal = __webpack_require__(/*! ./_freeGlobal */ "./node_modules/lodash/_freeGlobal.js");
-
-/** Detect free variable `exports`. */
-var freeExports = true && exports && !exports.nodeType && exports;
-
-/** Detect free variable `module`. */
-var freeModule = freeExports && "object" == '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;
+function getRawTag(value) {
+ var isOwn = hasOwnProperty$4.call(value, symToStringTag$1),
+ tag = value[symToStringTag$1];
-/** Used to access faster Node.js helpers. */
-var nodeUtil = (function() {
try {
- // Use `util.types` for Node.js 10+.
- var types = freeModule && freeModule.require && freeModule.require('util').types;
-
- if (types) {
- return types;
- }
-
- // Legacy `process.binding('util')` for Node.js < 10.
- return freeProcess && freeProcess.binding && freeProcess.binding('util');
+ value[symToStringTag$1] = undefined;
+ var unmasked = true;
} catch (e) {}
-}());
-module.exports = nodeUtil;
-
-
-/***/ }),
+ var result = nativeObjectToString$1.call(value);
+ if (unmasked) {
+ if (isOwn) {
+ value[symToStringTag$1] = tag;
+ } else {
+ delete value[symToStringTag$1];
+ }
+ }
+ return result;
+}
-/***/ "./node_modules/lodash/_objectToString.js":
-/*!************************************************!*\
- !*** ./node_modules/lodash/_objectToString.js ***!
- \************************************************/
-/***/ (function(module) {
+var _getRawTag = getRawTag;
/** Used for built-in method references. */
-var objectProto = Object.prototype;
+var objectProto$4 = Object.prototype;
/**
* Used to resolve the
* [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
* of values.
*/
-var nativeObjectToString = objectProto.toString;
+var nativeObjectToString = objectProto$4.toString;
/**
* Converts `value` to a string using `Object.prototype.toString`.
@@ -67490,3602 +53771,6761 @@ function objectToString(value) {
return nativeObjectToString.call(value);
}
-module.exports = objectToString;
-
+var _objectToString = objectToString;
-/***/ }),
+/** `Object#toString` result references. */
+var nullTag = '[object Null]',
+ undefinedTag = '[object Undefined]';
-/***/ "./node_modules/lodash/_overArg.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_overArg.js ***!
- \*****************************************/
-/***/ (function(module) {
+/** Built-in value references. */
+var symToStringTag = _Symbol ? _Symbol.toStringTag : undefined;
/**
- * Creates a unary function that invokes `func` with its argument transformed.
+ * The base implementation of `getTag` without fallbacks for buggy environments.
*
* @private
- * @param {Function} func The function to wrap.
- * @param {Function} transform The argument transform.
- * @returns {Function} Returns the new function.
+ * @param {*} value The value to query.
+ * @returns {string} Returns the `toStringTag`.
*/
-function overArg(func, transform) {
- return function(arg) {
- return func(transform(arg));
- };
+function baseGetTag(value) {
+ if (value == null) {
+ return value === undefined ? undefinedTag : nullTag;
+ }
+ return (symToStringTag && symToStringTag in Object(value))
+ ? _getRawTag(value)
+ : _objectToString(value);
}
-module.exports = overArg;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_overRest.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_overRest.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var apply = __webpack_require__(/*! ./_apply */ "./node_modules/lodash/_apply.js");
-
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeMax = Math.max;
+var _baseGetTag = baseGetTag;
/**
- * A specialized version of `baseRest` which transforms the rest array.
+ * Checks if `value` is object-like. A value is object-like if it's not `null`
+ * and has a `typeof` result of "object".
*
- * @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.
+ * @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 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);
- };
-}
-
-module.exports = overRest;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_root.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/_root.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var freeGlobal = __webpack_require__(/*! ./_freeGlobal */ "./node_modules/lodash/_freeGlobal.js");
-
-/** 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')();
-
-module.exports = root;
-
+function isObjectLike(value) {
+ return value != null && typeof value == 'object';
+}
-/***/ }),
+var isObjectLike_1 = isObjectLike;
-/***/ "./node_modules/lodash/_safeGet.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/_safeGet.js ***!
- \*****************************************/
-/***/ (function(module) {
+/** `Object#toString` result references. */
+var symbolTag = '[object Symbol]';
/**
- * Gets the value at `key`, unless `key` is "__proto__" or "constructor".
+ * Checks if `value` is classified as a `Symbol` primitive or object.
*
- * @private
- * @param {Object} object The object to query.
- * @param {string} key The key of the property to get.
- * @returns {*} Returns the property value.
+ * @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 safeGet(object, key) {
- if (key === 'constructor' && typeof object[key] === 'function') {
- return;
- }
-
- if (key == '__proto__') {
- return;
- }
-
- return object[key];
+function isSymbol(value) {
+ return typeof value == 'symbol' ||
+ (isObjectLike_1(value) && _baseGetTag(value) == symbolTag);
}
-module.exports = safeGet;
+var isSymbol_1 = isSymbol;
+/** Used as references for various `Number` constants. */
+var NAN = 0 / 0;
-/***/ }),
+/** Used to detect bad signed hexadecimal string values. */
+var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
-/***/ "./node_modules/lodash/_setCacheAdd.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_setCacheAdd.js ***!
- \*********************************************/
-/***/ (function(module) {
+/** Used to detect binary string values. */
+var reIsBinary = /^0b[01]+$/i;
-/** Used to stand-in for `undefined` hash values. */
-var HASH_UNDEFINED = '__lodash_hash_undefined__';
+/** Used to detect octal string values. */
+var reIsOctal = /^0o[0-7]+$/i;
+
+/** Built-in method references without a dependency on `root`. */
+var freeParseInt = parseInt;
/**
- * Adds `value` to the array cache.
+ * Converts `value` to a number.
*
- * @private
- * @name add
- * @memberOf SetCache
- * @alias push
- * @param {*} value The value to cache.
- * @returns {Object} Returns the cache instance.
+ * @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 setCacheAdd(value) {
- this.__data__.set(value, HASH_UNDEFINED);
- return this;
+function toNumber(value) {
+ if (typeof value == 'number') {
+ return value;
+ }
+ if (isSymbol_1(value)) {
+ return NAN;
+ }
+ if (isObject_1(value)) {
+ var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
+ value = isObject_1(other) ? (other + '') : other;
+ }
+ if (typeof value != 'string') {
+ return value === 0 ? value : +value;
+ }
+ value = _baseTrim(value);
+ var isBinary = reIsBinary.test(value);
+ return (isBinary || reIsOctal.test(value))
+ ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
+ : (reIsBadHex.test(value) ? NAN : +value);
}
-module.exports = setCacheAdd;
-
+var toNumber_1 = toNumber;
-/***/ }),
+/** Error message constants. */
+var FUNC_ERROR_TEXT$1 = 'Expected a function';
-/***/ "./node_modules/lodash/_setCacheHas.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_setCacheHas.js ***!
- \*********************************************/
-/***/ (function(module) {
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max,
+ nativeMin = Math.min;
/**
- * Checks if `value` is in the array cache.
+ * 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.
*
- * @private
- * @name has
- * @memberOf SetCache
- * @param {*} value The value to search for.
- * @returns {number} Returns `true` if `value` is found, else `false`.
+ * **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 setCacheHas(value) {
- return this.__data__.has(value);
-}
-
-module.exports = setCacheHas;
-
+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$1);
+ }
+ wait = toNumber_1(wait) || 0;
+ if (isObject_1(options)) {
+ leading = !!options.leading;
+ maxing = 'maxWait' in options;
+ maxWait = maxing ? nativeMax(toNumber_1(options.maxWait) || 0, wait) : maxWait;
+ trailing = 'trailing' in options ? !!options.trailing : trailing;
+ }
-/***/ "./node_modules/lodash/_setToArray.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_setToArray.js ***!
- \********************************************/
-/***/ (function(module) {
+ function invokeFunc(time) {
+ var args = lastArgs,
+ thisArg = lastThis;
-/**
- * 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);
+ lastArgs = lastThis = undefined;
+ lastInvokeTime = time;
+ result = func.apply(thisArg, args);
+ return result;
+ }
- set.forEach(function(value) {
- result[++index] = value;
- });
- 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;
+ }
-module.exports = setToArray;
+ function remainingWait(time) {
+ var timeSinceLastCall = time - lastCallTime,
+ timeSinceLastInvoke = time - lastInvokeTime,
+ timeWaiting = wait - timeSinceLastCall;
+ return maxing
+ ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
+ : timeWaiting;
+ }
-/***/ }),
+ function shouldInvoke(time) {
+ var timeSinceLastCall = time - lastCallTime,
+ timeSinceLastInvoke = time - lastInvokeTime;
-/***/ "./node_modules/lodash/_setToString.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_setToString.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // 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));
+ }
-var baseSetToString = __webpack_require__(/*! ./_baseSetToString */ "./node_modules/lodash/_baseSetToString.js"),
- shortOut = __webpack_require__(/*! ./_shortOut */ "./node_modules/lodash/_shortOut.js");
+ function timerExpired() {
+ var time = now_1();
+ if (shouldInvoke(time)) {
+ return trailingEdge(time);
+ }
+ // Restart the timer.
+ timerId = setTimeout(timerExpired, remainingWait(time));
+ }
-/**
- * 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);
+ function trailingEdge(time) {
+ timerId = undefined;
-module.exports = setToString;
+ // 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_1());
+ }
-/***/ "./node_modules/lodash/_shortOut.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_shortOut.js ***!
- \******************************************/
-/***/ (function(module) {
+ function debounced() {
+ var time = now_1(),
+ isInvoking = shouldInvoke(time);
-/** Used to detect hot functions by number of calls within a span of milliseconds. */
-var HOT_COUNT = 800,
- HOT_SPAN = 16;
+ lastArgs = arguments;
+ lastThis = this;
+ lastCallTime = time;
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeNow = Date.now;
+ if (isInvoking) {
+ if (timerId === undefined) {
+ return leadingEdge(lastCallTime);
+ }
+ if (maxing) {
+ // Handle invocations in a tight loop.
+ clearTimeout(timerId);
+ timerId = setTimeout(timerExpired, wait);
+ return invokeFunc(lastCallTime);
+ }
+ }
+ if (timerId === undefined) {
+ timerId = setTimeout(timerExpired, wait);
+ }
+ return result;
+ }
+ debounced.cancel = cancel;
+ debounced.flush = flush;
+ return debounced;
+}
-/**
- * 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;
+var debounce_1 = debounce;
- return function() {
- var stamp = nativeNow(),
- remaining = HOT_SPAN - (stamp - lastCalled);
+var performance = _window ? _window.performance : null;
+var pnow = performance && performance.now ? function () {
+ return performance.now();
+} : function () {
+ return Date.now();
+};
+var raf = function () {
+ if (_window) {
+ if (_window.requestAnimationFrame) {
+ return function (fn) {
+ _window.requestAnimationFrame(fn);
+ };
+ } else if (_window.mozRequestAnimationFrame) {
+ return function (fn) {
+ _window.mozRequestAnimationFrame(fn);
+ };
+ } else if (_window.webkitRequestAnimationFrame) {
+ return function (fn) {
+ _window.webkitRequestAnimationFrame(fn);
+ };
+ } else if (_window.msRequestAnimationFrame) {
+ return function (fn) {
+ _window.msRequestAnimationFrame(fn);
+ };
+ }
+ }
+ return function (fn) {
+ if (fn) {
+ setTimeout(function () {
+ fn(pnow());
+ }, 1000 / 60);
+ }
+ };
+}();
+var requestAnimationFrame = function requestAnimationFrame(fn) {
+ return raf(fn);
+};
+var performanceNow = pnow;
- lastCalled = stamp;
- if (remaining > 0) {
- if (++count >= HOT_COUNT) {
- return arguments[0];
+var DEFAULT_HASH_SEED = 9261;
+var K = 65599; // 37 also works pretty well
+var DEFAULT_HASH_SEED_ALT = 5381;
+var hashIterableInts = function hashIterableInts(iterator) {
+ var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED;
+ // sdbm/string-hash
+ var hash = seed;
+ var entry;
+ for (;;) {
+ entry = iterator.next();
+ if (entry.done) {
+ break;
+ }
+ hash = hash * K + entry.value | 0;
+ }
+ return hash;
+};
+var hashInt = function hashInt(num) {
+ var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED;
+ // sdbm/string-hash
+ return seed * K + num | 0;
+};
+var hashIntAlt = function hashIntAlt(num) {
+ var seed = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : DEFAULT_HASH_SEED_ALT;
+ // djb2/string-hash
+ return (seed << 5) + seed + num | 0;
+};
+var combineHashes = function combineHashes(hash1, hash2) {
+ return hash1 * 0x200000 + hash2;
+};
+var combineHashesArray = function combineHashesArray(hashes) {
+ return hashes[0] * 0x200000 + hashes[1];
+};
+var hashArrays = function hashArrays(hashes1, hashes2) {
+ return [hashInt(hashes1[0], hashes2[0]), hashIntAlt(hashes1[1], hashes2[1])];
+};
+var hashIntsArray = function hashIntsArray(ints, seed) {
+ var entry = {
+ value: 0,
+ done: false
+ };
+ var i = 0;
+ var length = ints.length;
+ var iterator = {
+ next: function next() {
+ if (i < length) {
+ entry.value = ints[i++];
+ } else {
+ entry.done = true;
+ }
+ return entry;
+ }
+ };
+ return hashIterableInts(iterator, seed);
+};
+var hashString = function hashString(str, seed) {
+ var entry = {
+ value: 0,
+ done: false
+ };
+ var i = 0;
+ var length = str.length;
+ var iterator = {
+ next: function next() {
+ if (i < length) {
+ entry.value = str.charCodeAt(i++);
+ } else {
+ entry.done = true;
}
+ return entry;
+ }
+ };
+ return hashIterableInts(iterator, seed);
+};
+var hashStrings = function hashStrings() {
+ return hashStringsArray(arguments);
+};
+var hashStringsArray = function hashStringsArray(strs) {
+ var hash;
+ for (var i = 0; i < strs.length; i++) {
+ var str = strs[i];
+ if (i === 0) {
+ hash = hashString(str);
} else {
- count = 0;
+ hash = hashString(str, hash);
+ }
+ }
+ return hash;
+};
+
+/*global console */
+var warningsEnabled = true;
+var warnSupported = console.warn != null; // eslint-disable-line no-console
+var traceSupported = console.trace != null; // eslint-disable-line no-console
+
+var MAX_INT$1 = Number.MAX_SAFE_INTEGER || 9007199254740991;
+var trueify = function trueify() {
+ return true;
+};
+var falsify = function falsify() {
+ return false;
+};
+var zeroify = function zeroify() {
+ return 0;
+};
+var noop$1 = function noop() {};
+var error = function error(msg) {
+ throw new Error(msg);
+};
+var warnings = function warnings(enabled) {
+ if (enabled !== undefined) {
+ warningsEnabled = !!enabled;
+ } else {
+ return warningsEnabled;
+ }
+};
+var warn = function warn(msg) {
+ /* eslint-disable no-console */
+ if (!warnings()) {
+ return;
+ }
+ if (warnSupported) {
+ console.warn(msg);
+ } else {
+ console.log(msg);
+ if (traceSupported) {
+ console.trace();
}
- return func.apply(undefined, arguments);
- };
-}
-
-module.exports = shortOut;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_stackClear.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_stackClear.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js");
-
-/**
- * Removes all key-value entries from the stack.
- *
- * @private
- * @name clear
- * @memberOf Stack
- */
-function stackClear() {
- this.__data__ = new ListCache;
- this.size = 0;
-}
+ }
+}; /* eslint-enable */
-module.exports = stackClear;
+var clone = function clone(obj) {
+ return extend({}, obj);
+};
+// gets a shallow copy of the argument
+var copy = function copy(obj) {
+ if (obj == null) {
+ return obj;
+ }
+ if (array(obj)) {
+ return obj.slice();
+ } else if (plainObject(obj)) {
+ return clone(obj);
+ } else {
+ return obj;
+ }
+};
+var copyArray$1 = function copyArray(arr) {
+ return arr.slice();
+};
+var uuid = function uuid(a, b /* placeholders */) {
+ for (
+ // loop :)
+ b = a = '';
+ // b - result , a - numeric letiable
+ a++ < 36;
+ //
+ b += a * 51 & 52 // if "a" is not 9 or 14 or 19 or 24
+ ?
+ // return a random number or 4
+ (a ^ 15 // if "a" is not 15
+ ?
+ // generate a random number from 0 to 15
+ 8 ^ Math.random() * (a ^ 20 ? 16 : 4) // unless "a" is 20, in which case a random number from 8 to 11
+ : 4 // otherwise 4
+ ).toString(16) : '-' // in other cases (if "a" is 9,14,19,24) insert "-"
+ ) {
+ }
+ return b;
+};
+var _staticEmptyObject = {};
+var staticEmptyObject = function staticEmptyObject() {
+ return _staticEmptyObject;
+};
+var defaults$g = function defaults(_defaults) {
+ var keys = Object.keys(_defaults);
+ return function (opts) {
+ var filledOpts = {};
+ for (var i = 0; i < keys.length; i++) {
+ var key = keys[i];
+ var optVal = opts == null ? undefined : opts[key];
+ filledOpts[key] = optVal === undefined ? _defaults[key] : optVal;
+ }
+ return filledOpts;
+ };
+};
+var removeFromArray = function removeFromArray(arr, ele, oneCopy) {
+ for (var i = arr.length - 1; i >= 0; i--) {
+ if (arr[i] === ele) {
+ arr.splice(i, 1);
+ if (oneCopy) {
+ break;
+ }
+ }
+ }
+};
+var clearArray = function clearArray(arr) {
+ arr.splice(0, arr.length);
+};
+var push = function push(arr, otherArr) {
+ for (var i = 0; i < otherArr.length; i++) {
+ var el = otherArr[i];
+ arr.push(el);
+ }
+};
+var getPrefixedProperty = function getPrefixedProperty(obj, propName, prefix) {
+ if (prefix) {
+ propName = prependCamel(prefix, propName); // e.g. (labelWidth, source) => sourceLabelWidth
+ }
-/***/ }),
+ return obj[propName];
+};
+var setPrefixedProperty = function setPrefixedProperty(obj, propName, prefix, value) {
+ if (prefix) {
+ propName = prependCamel(prefix, propName); // e.g. (labelWidth, source) => sourceLabelWidth
+ }
-/***/ "./node_modules/lodash/_stackDelete.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_stackDelete.js ***!
- \*********************************************/
-/***/ (function(module) {
+ obj[propName] = value;
+};
-/**
- * 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);
+/* global Map */
+var ObjectMap = /*#__PURE__*/function () {
+ function ObjectMap() {
+ _classCallCheck(this, ObjectMap);
+ this._obj = {};
+ }
+ _createClass(ObjectMap, [{
+ key: "set",
+ value: function set(key, val) {
+ this._obj[key] = val;
+ return this;
+ }
+ }, {
+ key: "delete",
+ value: function _delete(key) {
+ this._obj[key] = undefined;
+ return this;
+ }
+ }, {
+ key: "clear",
+ value: function clear() {
+ this._obj = {};
+ }
+ }, {
+ key: "has",
+ value: function has(key) {
+ return this._obj[key] !== undefined;
+ }
+ }, {
+ key: "get",
+ value: function get(key) {
+ return this._obj[key];
+ }
+ }]);
+ return ObjectMap;
+}();
+var Map$2 = typeof Map !== 'undefined' ? Map : ObjectMap;
- this.size = data.size;
- return result;
-}
+/* global Set */
-module.exports = stackDelete;
+var undef = "undefined" ;
+var ObjectSet = /*#__PURE__*/function () {
+ function ObjectSet(arrayOrObjectSet) {
+ _classCallCheck(this, ObjectSet);
+ this._obj = Object.create(null);
+ this.size = 0;
+ if (arrayOrObjectSet != null) {
+ var arr;
+ if (arrayOrObjectSet.instanceString != null && arrayOrObjectSet.instanceString() === this.instanceString()) {
+ arr = arrayOrObjectSet.toArray();
+ } else {
+ arr = arrayOrObjectSet;
+ }
+ for (var i = 0; i < arr.length; i++) {
+ this.add(arr[i]);
+ }
+ }
+ }
+ _createClass(ObjectSet, [{
+ key: "instanceString",
+ value: function instanceString() {
+ return 'set';
+ }
+ }, {
+ key: "add",
+ value: function add(val) {
+ var o = this._obj;
+ if (o[val] !== 1) {
+ o[val] = 1;
+ this.size++;
+ }
+ }
+ }, {
+ key: "delete",
+ value: function _delete(val) {
+ var o = this._obj;
+ if (o[val] === 1) {
+ o[val] = 0;
+ this.size--;
+ }
+ }
+ }, {
+ key: "clear",
+ value: function clear() {
+ this._obj = Object.create(null);
+ }
+ }, {
+ key: "has",
+ value: function has(val) {
+ return this._obj[val] === 1;
+ }
+ }, {
+ key: "toArray",
+ value: function toArray() {
+ var _this = this;
+ return Object.keys(this._obj).filter(function (key) {
+ return _this.has(key);
+ });
+ }
+ }, {
+ key: "forEach",
+ value: function forEach(callback, thisArg) {
+ return this.toArray().forEach(callback, thisArg);
+ }
+ }]);
+ return ObjectSet;
+}();
+var Set$1 = (typeof Set === "undefined" ? "undefined" : _typeof(Set)) !== undef ? Set : ObjectSet;
+// represents a node or an edge
+var Element = function Element(cy, params) {
+ var restore = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+ if (cy === undefined || params === undefined || !core(cy)) {
+ error('An element must have a core reference and parameters set');
+ return;
+ }
+ var group = params.group;
-/***/ }),
+ // try to automatically infer the group if unspecified
+ if (group == null) {
+ if (params.data && params.data.source != null && params.data.target != null) {
+ group = 'edges';
+ } else {
+ group = 'nodes';
+ }
+ }
-/***/ "./node_modules/lodash/_stackGet.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_stackGet.js ***!
- \******************************************/
-/***/ (function(module) {
+ // validate group
+ if (group !== 'nodes' && group !== 'edges') {
+ error('An element must be of type `nodes` or `edges`; you specified `' + group + '`');
+ return;
+ }
-/**
- * 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);
-}
+ // make the element array-like, just like a collection
+ this.length = 1;
+ this[0] = this;
-module.exports = stackGet;
+ // NOTE: when something is added here, add also to ele.json()
+ var _p = this._private = {
+ cy: cy,
+ single: true,
+ // indicates this is an element
+ data: params.data || {},
+ // data object
+ position: params.position || {
+ x: 0,
+ y: 0
+ },
+ // (x, y) position pair
+ autoWidth: undefined,
+ // width and height of nodes calculated by the renderer when set to special 'auto' value
+ autoHeight: undefined,
+ autoPadding: undefined,
+ compoundBoundsClean: false,
+ // whether the compound dimensions need to be recalculated the next time dimensions are read
+ listeners: [],
+ // array of bound listeners
+ group: group,
+ // string; 'nodes' or 'edges'
+ style: {},
+ // properties as set by the style
+ rstyle: {},
+ // properties for style sent from the renderer to the core
+ styleCxts: [],
+ // applied style contexts from the styler
+ styleKeys: {},
+ // per-group keys of style property values
+ removed: true,
+ // whether it's inside the vis; true if removed (set true here since we call restore)
+ selected: params.selected ? true : false,
+ // whether it's selected
+ selectable: params.selectable === undefined ? true : params.selectable ? true : false,
+ // whether it's selectable
+ locked: params.locked ? true : false,
+ // whether the element is locked (cannot be moved)
+ grabbed: false,
+ // whether the element is grabbed by the mouse; renderer sets this privately
+ grabbable: params.grabbable === undefined ? true : params.grabbable ? true : false,
+ // whether the element can be grabbed
+ pannable: params.pannable === undefined ? group === 'edges' ? true : false : params.pannable ? true : false,
+ // whether the element has passthrough panning enabled
+ active: false,
+ // whether the element is active from user interaction
+ classes: new Set$1(),
+ // map ( className => true )
+ animation: {
+ // object for currently-running animations
+ current: [],
+ queue: []
+ },
+ rscratch: {},
+ // object in which the renderer can store information
+ scratch: params.scratch || {},
+ // scratch objects
+ edges: [],
+ // array of connected edges
+ children: [],
+ // array of children
+ parent: params.parent && params.parent.isNode() ? params.parent : null,
+ // parent ref
+ traversalCache: {},
+ // cache of output of traversal functions
+ backgrounding: false,
+ // whether background images are loading
+ bbCache: null,
+ // cache of the current bounding box
+ bbCacheShift: {
+ x: 0,
+ y: 0
+ },
+ // shift applied to cached bb to be applied on next get
+ bodyBounds: null,
+ // bounds cache of element body, w/o overlay
+ overlayBounds: null,
+ // bounds cache of element body, including overlay
+ labelBounds: {
+ // bounds cache of labels
+ all: null,
+ source: null,
+ target: null,
+ main: null
+ },
+ arrowBounds: {
+ // bounds cache of edge arrows
+ source: null,
+ target: null,
+ 'mid-source': null,
+ 'mid-target': null
+ }
+ };
+ if (_p.position.x == null) {
+ _p.position.x = 0;
+ }
+ if (_p.position.y == null) {
+ _p.position.y = 0;
+ }
+ // renderedPosition overrides if specified
+ if (params.renderedPosition) {
+ var rpos = params.renderedPosition;
+ var pan = cy.pan();
+ var zoom = cy.zoom();
+ _p.position = {
+ x: (rpos.x - pan.x) / zoom,
+ y: (rpos.y - pan.y) / zoom
+ };
+ }
+ var classes = [];
+ if (array(params.classes)) {
+ classes = params.classes;
+ } else if (string(params.classes)) {
+ classes = params.classes.split(/\s+/);
+ }
+ for (var i = 0, l = classes.length; i < l; i++) {
+ var cls = classes[i];
+ if (!cls || cls === '') {
+ continue;
+ }
+ _p.classes.add(cls);
+ }
+ this.createEmitter();
+ var bypass = params.style || params.css;
+ if (bypass) {
+ warn('Setting a `style` bypass at element creation should be done only when absolutely necessary. Try to use the stylesheet instead.');
+ this.style(bypass);
+ }
+ if (restore === undefined || restore) {
+ this.restore();
+ }
+};
-/***/ }),
+var defineSearch = function defineSearch(params) {
+ params = {
+ bfs: params.bfs || !params.dfs,
+ dfs: params.dfs || !params.bfs
+ };
-/***/ "./node_modules/lodash/_stackHas.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_stackHas.js ***!
- \******************************************/
-/***/ (function(module) {
+ // from pseudocode on wikipedia
+ return function searchFn(roots, fn, directed) {
+ var options;
+ if (plainObject(roots) && !elementOrCollection(roots)) {
+ options = roots;
+ roots = options.roots || options.root;
+ fn = options.visit;
+ directed = options.directed;
+ }
+ directed = arguments.length === 2 && !fn$6(fn) ? fn : directed;
+ fn = fn$6(fn) ? fn : function () {};
+ var cy = this._private.cy;
+ var v = roots = string(roots) ? this.filter(roots) : roots;
+ var Q = [];
+ var connectedNodes = [];
+ var connectedBy = {};
+ var id2depth = {};
+ var V = {};
+ var j = 0;
+ var found;
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
-/**
- * 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);
-}
+ // enqueue v
+ for (var i = 0; i < v.length; i++) {
+ var vi = v[i];
+ var viId = vi.id();
+ if (vi.isNode()) {
+ Q.unshift(vi);
+ if (params.bfs) {
+ V[viId] = true;
+ connectedNodes.push(vi);
+ }
+ id2depth[viId] = 0;
+ }
+ }
+ var _loop = function _loop() {
+ var v = params.bfs ? Q.shift() : Q.pop();
+ var vId = v.id();
+ if (params.dfs) {
+ if (V[vId]) {
+ return "continue";
+ }
+ V[vId] = true;
+ connectedNodes.push(v);
+ }
+ var depth = id2depth[vId];
+ var prevEdge = connectedBy[vId];
+ var src = prevEdge != null ? prevEdge.source() : null;
+ var tgt = prevEdge != null ? prevEdge.target() : null;
+ var prevNode = prevEdge == null ? undefined : v.same(src) ? tgt[0] : src[0];
+ var ret = void 0;
+ ret = fn(v, prevEdge, prevNode, j++, depth);
+ if (ret === true) {
+ found = v;
+ return "break";
+ }
+ if (ret === false) {
+ return "break";
+ }
+ var vwEdges = v.connectedEdges().filter(function (e) {
+ return (!directed || e.source().same(v)) && edges.has(e);
+ });
+ for (var _i2 = 0; _i2 < vwEdges.length; _i2++) {
+ var e = vwEdges[_i2];
+ var w = e.connectedNodes().filter(function (n) {
+ return !n.same(v) && nodes.has(n);
+ });
+ var wId = w.id();
+ if (w.length !== 0 && !V[wId]) {
+ w = w[0];
+ Q.push(w);
+ if (params.bfs) {
+ V[wId] = true;
+ connectedNodes.push(w);
+ }
+ connectedBy[wId] = e;
+ id2depth[wId] = id2depth[vId] + 1;
+ }
+ }
+ };
+ while (Q.length !== 0) {
+ var _ret = _loop();
+ if (_ret === "continue") continue;
+ if (_ret === "break") break;
+ }
+ var connectedEles = cy.collection();
+ for (var _i = 0; _i < connectedNodes.length; _i++) {
+ var node = connectedNodes[_i];
+ var edge = connectedBy[node.id()];
+ if (edge != null) {
+ connectedEles.push(edge);
+ }
+ connectedEles.push(node);
+ }
+ return {
+ path: cy.collection(connectedEles),
+ found: cy.collection(found)
+ };
+ };
+};
-module.exports = stackHas;
+// search, spanning trees, etc
+var elesfn$v = {
+ breadthFirstSearch: defineSearch({
+ bfs: true
+ }),
+ depthFirstSearch: defineSearch({
+ dfs: true
+ })
+};
+// nice, short mathematical alias
+elesfn$v.bfs = elesfn$v.breadthFirstSearch;
+elesfn$v.dfs = elesfn$v.depthFirstSearch;
-/***/ }),
+var heap$1 = createCommonjsModule(function (module, exports) {
+// Generated by CoffeeScript 1.8.0
+(function() {
+ var Heap, defaultCmp, floor, heapify, heappop, heappush, heappushpop, heapreplace, insort, min, nlargest, nsmallest, updateItem, _siftdown, _siftup;
-/***/ "./node_modules/lodash/_stackSet.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_stackSet.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ floor = Math.floor, min = Math.min;
-var ListCache = __webpack_require__(/*! ./_ListCache */ "./node_modules/lodash/_ListCache.js"),
- Map = __webpack_require__(/*! ./_Map */ "./node_modules/lodash/_Map.js"),
- MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js");
-/** Used as the size to enable large array optimizations. */
-var LARGE_ARRAY_SIZE = 200;
+ /*
+ Default comparison function to be used
+ */
-/**
- * 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;
+ defaultCmp = function(x, y) {
+ if (x < y) {
+ return -1;
}
- data = this.__data__ = new MapCache(pairs);
- }
- data.set(key, value);
- this.size = data.size;
- return this;
-}
-
-module.exports = stackSet;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/_strictIndexOf.js":
-/*!***********************************************!*\
- !*** ./node_modules/lodash/_strictIndexOf.js ***!
- \***********************************************/
-/***/ (function(module) {
-
-/**
- * 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;
+ if (x > y) {
+ return 1;
}
- }
- return -1;
-}
-
-module.exports = strictIndexOf;
+ 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.
+ */
-/***/ "./node_modules/lodash/_stringSize.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/_stringSize.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ 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);
+ };
-var asciiSize = __webpack_require__(/*! ./_asciiSize */ "./node_modules/lodash/_asciiSize.js"),
- hasUnicode = __webpack_require__(/*! ./_hasUnicode */ "./node_modules/lodash/_hasUnicode.js"),
- unicodeSize = __webpack_require__(/*! ./_unicodeSize */ "./node_modules/lodash/_unicodeSize.js");
-/**
- * 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);
-}
+ /*
+ Push item onto heap, maintaining the heap invariant.
+ */
-module.exports = stringSize;
+ 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.
+ */
-/***/ "./node_modules/lodash/_stringToPath.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/_stringToPath.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ 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;
+ };
-var memoizeCapped = __webpack_require__(/*! ./_memoizeCapped */ "./node_modules/lodash/_memoizeCapped.js");
-/** Used to match property names within property paths. */
-var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
+ /*
+ 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)
+ */
-/** Used to match backslashes in property paths. */
-var reEscapeChar = /\\(\\)?/g;
+ heapreplace = function(array, item, cmp) {
+ var returnitem;
+ if (cmp == null) {
+ cmp = defaultCmp;
+ }
+ returnitem = array[0];
+ array[0] = item;
+ _siftup(array, 0, cmp);
+ return returnitem;
+ };
-/**
- * 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 (string.charCodeAt(0) === 46 /* . */) {
- result.push('');
- }
- string.replace(rePropName, function(match, number, quote, subString) {
- result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
- });
- return result;
-});
-module.exports = stringToPath;
+ /*
+ 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;
+ };
-/***/ }),
-/***/ "./node_modules/lodash/_toKey.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/_toKey.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ /*
+ Transform list into a heap, in-place, in O(array.length) time.
+ */
-var isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+ heapify = function(array, cmp) {
+ var i, _i, _len, _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;
+ };
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0;
-/**
- * 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;
-}
+ /*
+ Update the position of the given item in the heap.
+ This function should be called every time the item is being modified.
+ */
-module.exports = toKey;
+ 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.
+ */
-/***/ "./node_modules/lodash/_toSource.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/_toSource.js ***!
- \******************************************/
-/***/ (function(module) {
+ 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();
+ };
-/** Used for built-in method references. */
-var funcProto = Function.prototype;
-/** Used to resolve the decompiled source of functions. */
-var funcToString = funcProto.toString;
+ /*
+ Find the n smallest elements in a dataset.
+ */
-/**
- * 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 '';
-}
+ nsmallest = function(array, n, cmp) {
+ var elem, 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 (_j = 0, _ref1 = min(n, array.length); 0 <= _ref1 ? _j < _ref1 : _j > _ref1; 0 <= _ref1 ? ++_j : --_j) {
+ _results.push(heappop(array, cmp));
+ }
+ return _results;
+ };
-module.exports = toSource;
+ _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;
-/***/ "./node_modules/lodash/_trimmedEndIndex.js":
-/*!*************************************************!*\
- !*** ./node_modules/lodash/_trimmedEndIndex.js ***!
- \*************************************************/
-/***/ (function(module) {
+ Heap.pop = heappop;
-/** Used to match a single whitespace character. */
-var reWhitespace = /\s/;
+ Heap.replace = heapreplace;
-/**
- * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
- * character of `string`.
- *
- * @private
- * @param {string} string The string to inspect.
- * @returns {number} Returns the index of the last non-whitespace character.
- */
-function trimmedEndIndex(string) {
- var index = string.length;
+ Heap.pushpop = heappushpop;
- while (index-- && reWhitespace.test(string.charAt(index))) {}
- return index;
-}
+ Heap.heapify = heapify;
-module.exports = trimmedEndIndex;
+ Heap.updateItem = updateItem;
+ Heap.nlargest = nlargest;
-/***/ }),
+ Heap.nsmallest = nsmallest;
-/***/ "./node_modules/lodash/_unicodeSize.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/_unicodeSize.js ***!
- \*********************************************/
-/***/ (function(module) {
+ function Heap(cmp) {
+ this.cmp = cmp != null ? cmp : defaultCmp;
+ this.nodes = [];
+ }
-/** Used to compose unicode character classes. */
-var rsAstralRange = '\\ud800-\\udfff',
- rsComboMarksRange = '\\u0300-\\u036f',
- reComboHalfMarksRange = '\\ufe20-\\ufe2f',
- rsComboSymbolsRange = '\\u20d0-\\u20ff',
- rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
- rsVarRange = '\\ufe0e\\ufe0f';
+ Heap.prototype.push = function(x) {
+ return heappush(this.nodes, x, this.cmp);
+ };
-/** Used to compose unicode capture groups. */
-var rsAstral = '[' + rsAstralRange + ']',
- rsCombo = '[' + rsComboRange + ']',
- rsFitz = '\\ud83c[\\udffb-\\udfff]',
- rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
- rsNonAstral = '[^' + rsAstralRange + ']',
- rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
- rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
- rsZWJ = '\\u200d';
+ Heap.prototype.pop = function() {
+ return heappop(this.nodes, this.cmp);
+ };
-/** Used to compose unicode regexes. */
-var reOptMod = rsModifier + '?',
- rsOptVar = '[' + rsVarRange + ']?',
- rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
- rsSeq = rsOptVar + reOptMod + rsOptJoin,
- rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+ Heap.prototype.peek = function() {
+ return this.nodes[0];
+ };
-/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
-var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+ Heap.prototype.contains = function(x) {
+ return this.nodes.indexOf(x) !== -1;
+ };
-/**
- * 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;
-}
+ Heap.prototype.replace = function(x) {
+ return heapreplace(this.nodes, x, this.cmp);
+ };
-module.exports = unicodeSize;
+ 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);
+ };
-/***/ "./node_modules/lodash/clone.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/clone.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ Heap.prototype.clear = function() {
+ return this.nodes = [];
+ };
-var baseClone = __webpack_require__(/*! ./_baseClone */ "./node_modules/lodash/_baseClone.js");
+ Heap.prototype.empty = function() {
+ return this.nodes.length === 0;
+ };
-/** Used to compose bitmasks for cloning. */
-var CLONE_SYMBOLS_FLAG = 4;
+ Heap.prototype.size = function() {
+ return this.nodes.length;
+ };
-/**
- * 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);
-}
+ Heap.prototype.clone = function() {
+ var heap;
+ heap = new Heap();
+ heap.nodes = this.nodes.slice(0);
+ return heap;
+ };
-module.exports = clone;
+ Heap.prototype.toArray = function() {
+ return this.nodes.slice(0);
+ };
+ Heap.prototype.insert = Heap.prototype.push;
-/***/ }),
+ Heap.prototype.top = Heap.prototype.peek;
-/***/ "./node_modules/lodash/cloneDeep.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/cloneDeep.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ Heap.prototype.front = Heap.prototype.peek;
-var baseClone = __webpack_require__(/*! ./_baseClone */ "./node_modules/lodash/_baseClone.js");
+ Heap.prototype.has = Heap.prototype.contains;
-/** Used to compose bitmasks for cloning. */
-var CLONE_DEEP_FLAG = 1,
- CLONE_SYMBOLS_FLAG = 4;
+ Heap.prototype.copy = Heap.prototype.clone;
-/**
- * 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);
-}
+ return Heap;
-module.exports = cloneDeep;
+ })();
+ (function(root, factory) {
+ {
+ return module.exports = factory();
+ }
+ })(this, function() {
+ return Heap;
+ });
-/***/ }),
+}).call(commonjsGlobal);
+});
-/***/ "./node_modules/lodash/constant.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/constant.js ***!
- \*****************************************/
-/***/ (function(module) {
+var heap = heap$1;
-/**
- * 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;
- };
-}
+var dijkstraDefaults = defaults$g({
+ root: null,
+ weight: function weight(edge) {
+ return 1;
+ },
+ directed: false
+});
+var elesfn$u = {
+ dijkstra: function dijkstra(options) {
+ if (!plainObject(options)) {
+ var args = arguments;
+ options = {
+ root: args[0],
+ weight: args[1],
+ directed: args[2]
+ };
+ }
+ var _dijkstraDefaults = dijkstraDefaults(options),
+ root = _dijkstraDefaults.root,
+ weight = _dijkstraDefaults.weight,
+ directed = _dijkstraDefaults.directed;
+ var eles = this;
+ var weightFn = weight;
+ var source = string(root) ? this.filter(root)[0] : root[0];
+ var dist = {};
+ var prev = {};
+ var knownDist = {};
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
+ edges.unmergeBy(function (ele) {
+ return ele.isLoop();
+ });
+ var getDist = function getDist(node) {
+ return dist[node.id()];
+ };
+ var setDist = function setDist(node, d) {
+ dist[node.id()] = d;
+ Q.updateItem(node);
+ };
+ var Q = new heap(function (a, b) {
+ return getDist(a) - getDist(b);
+ });
+ for (var i = 0; i < nodes.length; i++) {
+ var node = nodes[i];
+ dist[node.id()] = node.same(source) ? 0 : Infinity;
+ Q.push(node);
+ }
+ var distBetween = function distBetween(u, v) {
+ var uvs = (directed ? u.edgesTo(v) : u.edgesWith(v)).intersect(edges);
+ var smallestDistance = Infinity;
+ var smallestEdge;
+ for (var _i = 0; _i < uvs.length; _i++) {
+ var edge = uvs[_i];
+ var _weight = weightFn(edge);
+ if (_weight < smallestDistance || !smallestEdge) {
+ smallestDistance = _weight;
+ smallestEdge = edge;
+ }
+ }
+ return {
+ edge: smallestEdge,
+ dist: smallestDistance
+ };
+ };
+ while (Q.size() > 0) {
+ var u = Q.pop();
+ var smalletsDist = getDist(u);
+ var uid = u.id();
+ knownDist[uid] = smalletsDist;
+ if (smalletsDist === Infinity) {
+ continue;
+ }
+ var neighbors = u.neighborhood().intersect(nodes);
+ for (var _i2 = 0; _i2 < neighbors.length; _i2++) {
+ var v = neighbors[_i2];
+ var vid = v.id();
+ var vDist = distBetween(u, v);
+ var alt = smalletsDist + vDist.dist;
+ if (alt < getDist(v)) {
+ setDist(v, alt);
+ prev[vid] = {
+ node: u,
+ edge: vDist.edge
+ };
+ }
+ } // for
+ } // while
-module.exports = constant;
+ return {
+ distanceTo: function distanceTo(node) {
+ var target = string(node) ? nodes.filter(node)[0] : node[0];
+ return knownDist[target.id()];
+ },
+ pathTo: function pathTo(node) {
+ var target = string(node) ? nodes.filter(node)[0] : node[0];
+ var S = [];
+ var u = target;
+ var uid = u.id();
+ if (target.length > 0) {
+ S.unshift(target);
+ while (prev[uid]) {
+ var p = prev[uid];
+ S.unshift(p.edge);
+ S.unshift(p.node);
+ u = p.node;
+ uid = u.id();
+ }
+ }
+ return eles.spawn(S);
+ }
+ };
+ }
+};
+var elesfn$t = {
+ // kruskal's algorithm (finds min spanning tree, assuming undirected graph)
+ // implemented from pseudocode from wikipedia
+ kruskal: function kruskal(weightFn) {
+ weightFn = weightFn || function (edge) {
+ return 1;
+ };
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
+ var numNodes = nodes.length;
+ var forest = new Array(numNodes);
+ var A = nodes; // assumes byGroup() creates new collections that can be safely mutated
-/***/ }),
+ var findSetIndex = function findSetIndex(ele) {
+ for (var i = 0; i < forest.length; i++) {
+ var eles = forest[i];
+ if (eles.has(ele)) {
+ return i;
+ }
+ }
+ };
-/***/ "./node_modules/lodash/debounce.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/debounce.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // start with one forest per node
+ for (var i = 0; i < numNodes; i++) {
+ forest[i] = this.spawn(nodes[i]);
+ }
+ var S = edges.sort(function (a, b) {
+ return weightFn(a) - weightFn(b);
+ });
+ for (var _i = 0; _i < S.length; _i++) {
+ var edge = S[_i];
+ var u = edge.source()[0];
+ var v = edge.target()[0];
+ var setUIndex = findSetIndex(u);
+ var setVIndex = findSetIndex(v);
+ var setU = forest[setUIndex];
+ var setV = forest[setVIndex];
+ if (setUIndex !== setVIndex) {
+ A.merge(edge);
-var isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- now = __webpack_require__(/*! ./now */ "./node_modules/lodash/now.js"),
- toNumber = __webpack_require__(/*! ./toNumber */ "./node_modules/lodash/toNumber.js");
+ // combine forests for u and v
+ setU.merge(setV);
+ forest.splice(setVIndex, 1);
+ }
+ }
+ return A;
+ }
+};
-/** Error message constants. */
-var FUNC_ERROR_TEXT = 'Expected a function';
+var aStarDefaults = defaults$g({
+ root: null,
+ goal: null,
+ weight: function weight(edge) {
+ return 1;
+ },
+ heuristic: function heuristic(edge) {
+ return 0;
+ },
+ directed: false
+});
+var elesfn$s = {
+ // Implemented from pseudocode from wikipedia
+ aStar: function aStar(options) {
+ var cy = this.cy();
+ var _aStarDefaults = aStarDefaults(options),
+ root = _aStarDefaults.root,
+ goal = _aStarDefaults.goal,
+ heuristic = _aStarDefaults.heuristic,
+ directed = _aStarDefaults.directed,
+ weight = _aStarDefaults.weight;
+ root = cy.collection(root)[0];
+ goal = cy.collection(goal)[0];
+ var sid = root.id();
+ var tid = goal.id();
+ var gScore = {};
+ var fScore = {};
+ var closedSetIds = {};
+ var openSet = new heap(function (a, b) {
+ return fScore[a.id()] - fScore[b.id()];
+ });
+ var openSetIds = new Set$1();
+ var cameFrom = {};
+ var cameFromEdge = {};
+ var addToOpenSet = function addToOpenSet(ele, id) {
+ openSet.push(ele);
+ openSetIds.add(id);
+ };
+ var cMin, cMinId;
+ var popFromOpenSet = function popFromOpenSet() {
+ cMin = openSet.pop();
+ cMinId = cMin.id();
+ openSetIds["delete"](cMinId);
+ };
+ var isInOpenSet = function isInOpenSet(id) {
+ return openSetIds.has(id);
+ };
+ addToOpenSet(root, sid);
+ gScore[sid] = 0;
+ fScore[sid] = heuristic(root);
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeMax = Math.max,
- nativeMin = Math.min;
+ // Counter
+ var steps = 0;
-/**
- * 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;
+ // Main loop
+ while (openSet.size() > 0) {
+ popFromOpenSet();
+ steps++;
- 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;
- }
+ // If we've found our goal, then we are done
+ if (cMinId === tid) {
+ var path = [];
+ var pathNode = goal;
+ var pathNodeId = tid;
+ var pathEdge = cameFromEdge[pathNodeId];
+ for (;;) {
+ path.unshift(pathNode);
+ if (pathEdge != null) {
+ path.unshift(pathEdge);
+ }
+ pathNode = cameFrom[pathNodeId];
+ if (pathNode == null) {
+ break;
+ }
+ pathNodeId = pathNode.id();
+ pathEdge = cameFromEdge[pathNodeId];
+ }
+ return {
+ found: true,
+ distance: gScore[cMinId],
+ path: this.spawn(path),
+ steps: steps
+ };
+ }
- function invokeFunc(time) {
- var args = lastArgs,
- thisArg = lastThis;
+ // Add cMin to processed nodes
+ closedSetIds[cMinId] = true;
- lastArgs = lastThis = undefined;
- lastInvokeTime = time;
- result = func.apply(thisArg, args);
- return result;
- }
+ // Update scores for neighbors of cMin
+ // Take into account if graph is directed or not
+ var vwEdges = cMin._private.edges;
+ for (var i = 0; i < vwEdges.length; i++) {
+ var e = vwEdges[i];
+
+ // edge must be in set of calling eles
+ if (!this.hasElementWithId(e.id())) {
+ continue;
+ }
- 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;
- }
+ // cMin must be the source of edge if directed
+ if (directed && e.data('source') !== cMinId) {
+ continue;
+ }
+ var wSrc = e.source();
+ var wTgt = e.target();
+ var w = wSrc.id() !== cMinId ? wSrc : wTgt;
+ var wid = w.id();
- function remainingWait(time) {
- var timeSinceLastCall = time - lastCallTime,
- timeSinceLastInvoke = time - lastInvokeTime,
- timeWaiting = wait - timeSinceLastCall;
+ // node must be in set of calling eles
+ if (!this.hasElementWithId(wid)) {
+ continue;
+ }
- return maxing
- ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
- : timeWaiting;
- }
+ // if node is in closedSet, ignore it
+ if (closedSetIds[wid]) {
+ continue;
+ }
- function shouldInvoke(time) {
- var timeSinceLastCall = time - lastCallTime,
- timeSinceLastInvoke = time - lastInvokeTime;
+ // New tentative score for node w
+ var tempScore = gScore[cMinId] + weight(e);
- // 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));
- }
+ // Update gScore for node w if:
+ // w not present in openSet
+ // OR
+ // tentative gScore is less than previous value
- function timerExpired() {
- var time = now();
- if (shouldInvoke(time)) {
- return trailingEdge(time);
- }
- // Restart the timer.
- timerId = setTimeout(timerExpired, remainingWait(time));
- }
+ // w not in openSet
+ if (!isInOpenSet(wid)) {
+ gScore[wid] = tempScore;
+ fScore[wid] = tempScore + heuristic(w);
+ addToOpenSet(w, wid);
+ cameFrom[wid] = cMin;
+ cameFromEdge[wid] = e;
+ continue;
+ }
- function trailingEdge(time) {
- timerId = undefined;
+ // w already in openSet, but with greater gScore
+ if (tempScore < gScore[wid]) {
+ gScore[wid] = tempScore;
+ fScore[wid] = tempScore + heuristic(w);
+ cameFrom[wid] = cMin;
+ cameFromEdge[wid] = e;
+ }
+ } // End of neighbors update
+ } // End of main loop
- // 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;
+ // If we've reached here, then we've not reached our goal
+ return {
+ found: false,
+ distance: undefined,
+ path: undefined,
+ steps: steps
+ };
}
+}; // elesfn
- function cancel() {
- if (timerId !== undefined) {
- clearTimeout(timerId);
+var floydWarshallDefaults = defaults$g({
+ weight: function weight(edge) {
+ return 1;
+ },
+ directed: false
+});
+var elesfn$r = {
+ // Implemented from pseudocode from wikipedia
+ floydWarshall: function floydWarshall(options) {
+ var cy = this.cy();
+ var _floydWarshallDefault = floydWarshallDefaults(options),
+ weight = _floydWarshallDefault.weight,
+ directed = _floydWarshallDefault.directed;
+ var weightFn = weight;
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
+ var N = nodes.length;
+ var Nsq = N * N;
+ var indexOf = function indexOf(node) {
+ return nodes.indexOf(node);
+ };
+ var atIndex = function atIndex(i) {
+ return nodes[i];
+ };
+
+ // Initialize distance matrix
+ var dist = new Array(Nsq);
+ for (var n = 0; n < Nsq; n++) {
+ var j = n % N;
+ var i = (n - j) / N;
+ if (i === j) {
+ dist[n] = 0;
+ } else {
+ dist[n] = Infinity;
+ }
}
- lastInvokeTime = 0;
- lastArgs = lastCallTime = lastThis = timerId = undefined;
- }
- function flush() {
- return timerId === undefined ? result : trailingEdge(now());
- }
+ // Initialize matrix used for path reconstruction
+ // Initialize distance matrix
+ var next = new Array(Nsq);
+ var edgeNext = new Array(Nsq);
- function debounced() {
- var time = now(),
- isInvoking = shouldInvoke(time);
+ // Process edges
+ for (var _i = 0; _i < edges.length; _i++) {
+ var edge = edges[_i];
+ var src = edge.source()[0];
+ var tgt = edge.target()[0];
+ if (src === tgt) {
+ continue;
+ } // exclude loops
- lastArgs = arguments;
- lastThis = this;
- lastCallTime = time;
+ var s = indexOf(src);
+ var t = indexOf(tgt);
+ var st = s * N + t; // source to target index
+ var _weight = weightFn(edge);
- if (isInvoking) {
- if (timerId === undefined) {
- return leadingEdge(lastCallTime);
- }
- if (maxing) {
- // Handle invocations in a tight loop.
- clearTimeout(timerId);
- timerId = setTimeout(timerExpired, wait);
- return invokeFunc(lastCallTime);
+ // Check if already process another edge between same 2 nodes
+ if (dist[st] > _weight) {
+ dist[st] = _weight;
+ next[st] = t;
+ edgeNext[st] = edge;
}
- }
- if (timerId === undefined) {
- timerId = setTimeout(timerExpired, wait);
- }
- return result;
- }
- debounced.cancel = cancel;
- debounced.flush = flush;
- return debounced;
-}
-module.exports = debounce;
+ // If undirected graph, process 'reversed' edge
+ if (!directed) {
+ var ts = t * N + s; // target to source index
+ if (!directed && dist[ts] > _weight) {
+ dist[ts] = _weight;
+ next[ts] = s;
+ edgeNext[ts] = edge;
+ }
+ }
+ }
-/***/ }),
+ // Main loop
+ for (var k = 0; k < N; k++) {
+ for (var _i2 = 0; _i2 < N; _i2++) {
+ var ik = _i2 * N + k;
+ for (var _j = 0; _j < N; _j++) {
+ var ij = _i2 * N + _j;
+ var kj = k * N + _j;
+ if (dist[ik] + dist[kj] < dist[ij]) {
+ dist[ij] = dist[ik] + dist[kj];
+ next[ij] = next[ik];
+ }
+ }
+ }
+ }
+ var getArgEle = function getArgEle(ele) {
+ return (string(ele) ? cy.filter(ele) : ele)[0];
+ };
+ var indexOfArgEle = function indexOfArgEle(ele) {
+ return indexOf(getArgEle(ele));
+ };
+ var res = {
+ distance: function distance(from, to) {
+ var i = indexOfArgEle(from);
+ var j = indexOfArgEle(to);
+ return dist[i * N + j];
+ },
+ path: function path(from, to) {
+ var i = indexOfArgEle(from);
+ var j = indexOfArgEle(to);
+ var fromNode = atIndex(i);
+ if (i === j) {
+ return fromNode.collection();
+ }
+ if (next[i * N + j] == null) {
+ return cy.collection();
+ }
+ var path = cy.collection();
+ var prev = i;
+ var edge;
+ path.merge(fromNode);
+ while (i !== j) {
+ prev = i;
+ i = next[i * N + j];
+ edge = edgeNext[prev * N + i];
+ path.merge(edge);
+ path.merge(atIndex(i));
+ }
+ return path;
+ }
+ };
+ return res;
+ } // floydWarshall
+}; // elesfn
-/***/ "./node_modules/lodash/defaults.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/defaults.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var bellmanFordDefaults = defaults$g({
+ weight: function weight(edge) {
+ return 1;
+ },
+ directed: false,
+ root: null
+});
+var elesfn$q = {
+ // Implemented from pseudocode from wikipedia
+ bellmanFord: function bellmanFord(options) {
+ var _this = this;
+ var _bellmanFordDefaults = bellmanFordDefaults(options),
+ weight = _bellmanFordDefaults.weight,
+ directed = _bellmanFordDefaults.directed,
+ root = _bellmanFordDefaults.root;
+ var weightFn = weight;
+ var eles = this;
+ var cy = this.cy();
+ var _this$byGroup = this.byGroup(),
+ edges = _this$byGroup.edges,
+ nodes = _this$byGroup.nodes;
+ var numNodes = nodes.length;
+ var infoMap = new Map$2();
+ var hasNegativeWeightCycle = false;
+ var negativeWeightCycles = [];
+ root = cy.collection(root)[0]; // in case selector passed
-var baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
- eq = __webpack_require__(/*! ./eq */ "./node_modules/lodash/eq.js"),
- isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
+ edges.unmergeBy(function (edge) {
+ return edge.isLoop();
+ });
+ var numEdges = edges.length;
+ var getInfo = function getInfo(node) {
+ var obj = infoMap.get(node.id());
+ if (!obj) {
+ obj = {};
+ infoMap.set(node.id(), obj);
+ }
+ return obj;
+ };
+ var getNodeFromTo = function getNodeFromTo(to) {
+ return (string(to) ? cy.$(to) : to)[0];
+ };
+ var distanceTo = function distanceTo(to) {
+ return getInfo(getNodeFromTo(to)).dist;
+ };
+ var pathTo = function pathTo(to) {
+ var thisStart = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : root;
+ var end = getNodeFromTo(to);
+ var path = [];
+ var node = end;
+ for (;;) {
+ if (node == null) {
+ return _this.spawn();
+ }
+ var _getInfo = getInfo(node),
+ edge = _getInfo.edge,
+ pred = _getInfo.pred;
+ path.unshift(node[0]);
+ if (node.same(thisStart) && path.length > 0) {
+ break;
+ }
+ if (edge != null) {
+ path.unshift(edge);
+ }
+ node = pred;
+ }
+ return eles.spawn(path);
+ };
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+ // Initializations { dist, pred, edge }
+ for (var i = 0; i < numNodes; i++) {
+ var node = nodes[i];
+ var info = getInfo(node);
+ if (node.same(root)) {
+ info.dist = 0;
+ } else {
+ info.dist = Infinity;
+ }
+ info.pred = null;
+ info.edge = null;
+ }
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+ // Edges relaxation
+ var replacedEdge = false;
+ var checkForEdgeReplacement = function checkForEdgeReplacement(node1, node2, edge, info1, info2, weight) {
+ var dist = info1.dist + weight;
+ if (dist < info2.dist && !edge.same(info1.edge)) {
+ info2.dist = dist;
+ info2.pred = node1;
+ info2.edge = edge;
+ replacedEdge = true;
+ }
+ };
+ for (var _i = 1; _i < numNodes; _i++) {
+ replacedEdge = false;
+ for (var e = 0; e < numEdges; e++) {
+ var edge = edges[e];
+ var src = edge.source();
+ var tgt = edge.target();
+ var _weight = weightFn(edge);
+ var srcInfo = getInfo(src);
+ var tgtInfo = getInfo(tgt);
+ checkForEdgeReplacement(src, tgt, edge, srcInfo, tgtInfo, _weight);
-/**
- * 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(object, sources) {
- object = Object(object);
+ // If undirected graph, we need to take into account the 'reverse' edge
+ if (!directed) {
+ checkForEdgeReplacement(tgt, src, edge, tgtInfo, srcInfo, _weight);
+ }
+ }
+ if (!replacedEdge) {
+ break;
+ }
+ }
+ if (replacedEdge) {
+ // Check for negative weight cycles
+ var negativeWeightCycleIds = [];
+ for (var _e = 0; _e < numEdges; _e++) {
+ var _edge = edges[_e];
+ var _src = _edge.source();
+ var _tgt = _edge.target();
+ var _weight2 = weightFn(_edge);
+ var srcDist = getInfo(_src).dist;
+ var tgtDist = getInfo(_tgt).dist;
+ if (srcDist + _weight2 < tgtDist || !directed && tgtDist + _weight2 < srcDist) {
+ if (!hasNegativeWeightCycle) {
+ warn('Graph contains a negative weight cycle for Bellman-Ford');
+ hasNegativeWeightCycle = true;
+ }
+ if (options.findNegativeWeightCycles !== false) {
+ var negativeNodes = [];
+ if (srcDist + _weight2 < tgtDist) {
+ negativeNodes.push(_src);
+ }
+ if (!directed && tgtDist + _weight2 < srcDist) {
+ negativeNodes.push(_tgt);
+ }
+ var numNegativeNodes = negativeNodes.length;
+ for (var n = 0; n < numNegativeNodes; n++) {
+ var start = negativeNodes[n];
+ var cycle = [start];
+ cycle.push(getInfo(start).edge);
+ var _node = getInfo(start).pred;
+ while (cycle.indexOf(_node) === -1) {
+ cycle.push(_node);
+ cycle.push(getInfo(_node).edge);
+ _node = getInfo(_node).pred;
+ }
+ cycle = cycle.slice(cycle.indexOf(_node));
+ var smallestId = cycle[0].id();
+ var smallestIndex = 0;
+ for (var c = 2; c < cycle.length; c += 2) {
+ if (cycle[c].id() < smallestId) {
+ smallestId = cycle[c].id();
+ smallestIndex = c;
+ }
+ }
+ cycle = cycle.slice(smallestIndex).concat(cycle.slice(0, smallestIndex));
+ cycle.push(cycle[0]);
+ var cycleId = cycle.map(function (el) {
+ return el.id();
+ }).join(",");
+ if (negativeWeightCycleIds.indexOf(cycleId) === -1) {
+ negativeWeightCycles.push(eles.spawn(cycle));
+ negativeWeightCycleIds.push(cycleId);
+ }
+ }
+ } else {
+ break;
+ }
+ }
+ }
+ }
+ return {
+ distanceTo: distanceTo,
+ pathTo: pathTo,
+ hasNegativeWeightCycle: hasNegativeWeightCycle,
+ negativeWeightCycles: negativeWeightCycles
+ };
+ } // bellmanFord
+}; // elesfn
- var index = -1;
- var length = sources.length;
- var guard = length > 2 ? sources[2] : undefined;
+var sqrt2 = Math.sqrt(2);
- if (guard && isIterateeCall(sources[0], sources[1], guard)) {
- length = 1;
+// Function which colapses 2 (meta) nodes into one
+// Updates the remaining edge lists
+// Receives as a paramater the edge which causes the collapse
+var collapse = function collapse(edgeIndex, nodeMap, remainingEdges) {
+ if (remainingEdges.length === 0) {
+ error("Karger-Stein must be run on a connected (sub)graph");
}
+ var edgeInfo = remainingEdges[edgeIndex];
+ var sourceIn = edgeInfo[1];
+ var targetIn = edgeInfo[2];
+ var partition1 = nodeMap[sourceIn];
+ var partition2 = nodeMap[targetIn];
+ var newEdges = remainingEdges; // re-use array
- while (++index < length) {
- var source = sources[index];
- var props = keysIn(source);
- var propsIndex = -1;
- var propsLength = props.length;
+ // Delete all edges between partition1 and partition2
+ for (var i = newEdges.length - 1; i >= 0; i--) {
+ var edge = newEdges[i];
+ var src = edge[1];
+ var tgt = edge[2];
+ if (nodeMap[src] === partition1 && nodeMap[tgt] === partition2 || nodeMap[src] === partition2 && nodeMap[tgt] === partition1) {
+ newEdges.splice(i, 1);
+ }
+ }
- while (++propsIndex < propsLength) {
- var key = props[propsIndex];
- var value = object[key];
+ // All edges pointing to partition2 should now point to partition1
+ for (var _i = 0; _i < newEdges.length; _i++) {
+ var _edge = newEdges[_i];
+ if (_edge[1] === partition2) {
+ // Check source
+ newEdges[_i] = _edge.slice(); // copy
+ newEdges[_i][1] = partition1;
+ } else if (_edge[2] === partition2) {
+ // Check target
+ newEdges[_i] = _edge.slice(); // copy
+ newEdges[_i][2] = partition1;
+ }
+ }
- if (value === undefined ||
- (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
- object[key] = source[key];
- }
+ // Move all nodes from partition2 to partition1
+ for (var _i2 = 0; _i2 < nodeMap.length; _i2++) {
+ if (nodeMap[_i2] === partition2) {
+ nodeMap[_i2] = partition1;
}
}
+ return newEdges;
+};
- return object;
-});
-
-module.exports = defaults;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/each.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/each.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-module.exports = __webpack_require__(/*! ./forEach */ "./node_modules/lodash/forEach.js");
-
-
-/***/ }),
+// Contracts a graph until we reach a certain number of meta nodes
+var contractUntil = function contractUntil(metaNodeMap, remainingEdges, size, sizeLimit) {
+ while (size > sizeLimit) {
+ // Choose an edge randomly
+ var edgeIndex = Math.floor(Math.random() * remainingEdges.length);
-/***/ "./node_modules/lodash/eq.js":
-/*!***********************************!*\
- !*** ./node_modules/lodash/eq.js ***!
- \***********************************/
-/***/ (function(module) {
+ // Collapse graph based on edge
+ remainingEdges = collapse(edgeIndex, metaNodeMap, remainingEdges);
+ size--;
+ }
+ return remainingEdges;
+};
+var elesfn$p = {
+ // Computes the minimum cut of an undirected graph
+ // Returns the correct answer with high probability
+ kargerStein: function kargerStein() {
+ var _this = this;
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
+ edges.unmergeBy(function (edge) {
+ return edge.isLoop();
+ });
+ var numNodes = nodes.length;
+ var numEdges = edges.length;
+ var numIter = Math.ceil(Math.pow(Math.log(numNodes) / Math.LN2, 2));
+ var stopSize = Math.floor(numNodes / sqrt2);
+ if (numNodes < 2) {
+ error('At least 2 nodes are required for Karger-Stein algorithm');
+ return undefined;
+ }
-/**
- * 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);
-}
+ // Now store edge destination as indexes
+ // Format for each edge (edge index, source node index, target node index)
+ var edgeIndexes = [];
+ for (var i = 0; i < numEdges; i++) {
+ var e = edges[i];
+ edgeIndexes.push([i, nodes.indexOf(e.source()), nodes.indexOf(e.target())]);
+ }
-module.exports = eq;
+ // We will store the best cut found here
+ var minCutSize = Infinity;
+ var minCutEdgeIndexes = [];
+ var minCutNodeMap = new Array(numNodes);
+ // Initial meta node partition
+ var metaNodeMap = new Array(numNodes);
+ var metaNodeMap2 = new Array(numNodes);
+ var copyNodesMap = function copyNodesMap(from, to) {
+ for (var _i3 = 0; _i3 < numNodes; _i3++) {
+ to[_i3] = from[_i3];
+ }
+ };
-/***/ }),
+ // Main loop
+ for (var iter = 0; iter <= numIter; iter++) {
+ // Reset meta node partition
+ for (var _i4 = 0; _i4 < numNodes; _i4++) {
+ metaNodeMap[_i4] = _i4;
+ }
-/***/ "./node_modules/lodash/filter.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/filter.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Contract until stop point (stopSize nodes)
+ var edgesState = contractUntil(metaNodeMap, edgeIndexes.slice(), numNodes, stopSize);
+ var edgesState2 = edgesState.slice(); // copy
-var arrayFilter = __webpack_require__(/*! ./_arrayFilter */ "./node_modules/lodash/_arrayFilter.js"),
- baseFilter = __webpack_require__(/*! ./_baseFilter */ "./node_modules/lodash/_baseFilter.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+ // Create a copy of the colapsed nodes state
+ copyNodesMap(metaNodeMap, metaNodeMap2);
-/**
- * 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']
- *
- * // Combining several predicates using `_.overEvery` or `_.overSome`.
- * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));
- * // => objects for ['fred', 'barney']
- */
-function filter(collection, predicate) {
- var func = isArray(collection) ? arrayFilter : baseFilter;
- return func(collection, baseIteratee(predicate, 3));
-}
+ // Run 2 iterations starting in the stop state
+ var res1 = contractUntil(metaNodeMap, edgesState, stopSize, 2);
+ var res2 = contractUntil(metaNodeMap2, edgesState2, stopSize, 2);
-module.exports = filter;
+ // Is any of the 2 results the best cut so far?
+ if (res1.length <= res2.length && res1.length < minCutSize) {
+ minCutSize = res1.length;
+ minCutEdgeIndexes = res1;
+ copyNodesMap(metaNodeMap, minCutNodeMap);
+ } else if (res2.length <= res1.length && res2.length < minCutSize) {
+ minCutSize = res2.length;
+ minCutEdgeIndexes = res2;
+ copyNodesMap(metaNodeMap2, minCutNodeMap);
+ }
+ } // end of main loop
+ // Construct result
+ var cut = this.spawn(minCutEdgeIndexes.map(function (e) {
+ return edges[e[0]];
+ }));
+ var partition1 = this.spawn();
+ var partition2 = this.spawn();
-/***/ }),
+ // traverse metaNodeMap for best cut
+ var witnessNodePartition = minCutNodeMap[0];
+ for (var _i5 = 0; _i5 < minCutNodeMap.length; _i5++) {
+ var partitionId = minCutNodeMap[_i5];
+ var node = nodes[_i5];
+ if (partitionId === witnessNodePartition) {
+ partition1.merge(node);
+ } else {
+ partition2.merge(node);
+ }
+ }
-/***/ "./node_modules/lodash/find.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/find.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // construct components corresponding to each disjoint subset of nodes
+ var constructComponent = function constructComponent(subset) {
+ var component = _this.spawn();
+ subset.forEach(function (node) {
+ component.merge(node);
+ node.connectedEdges().forEach(function (edge) {
+ // ensure edge is within calling collection and edge is not in cut
+ if (_this.contains(edge) && !cut.contains(edge)) {
+ component.merge(edge);
+ }
+ });
+ });
+ return component;
+ };
+ var components = [constructComponent(partition1), constructComponent(partition2)];
+ var ret = {
+ cut: cut,
+ components: components,
+ // n.b. partitions are included to be compatible with the old api spec
+ // (could be removed in a future major version)
+ partition1: partition1,
+ partition2: partition2
+ };
+ return ret;
+ }
+}; // elesfn
-var createFind = __webpack_require__(/*! ./_createFind */ "./node_modules/lodash/_createFind.js"),
- findIndex = __webpack_require__(/*! ./findIndex */ "./node_modules/lodash/findIndex.js");
+var copyPosition = function copyPosition(p) {
+ return {
+ x: p.x,
+ y: p.y
+ };
+};
+var modelToRenderedPosition = function modelToRenderedPosition(p, zoom, pan) {
+ return {
+ x: p.x * zoom + pan.x,
+ y: p.y * zoom + pan.y
+ };
+};
+var renderedToModelPosition = function renderedToModelPosition(p, zoom, pan) {
+ return {
+ x: (p.x - pan.x) / zoom,
+ y: (p.y - pan.y) / zoom
+ };
+};
+var array2point = function array2point(arr) {
+ return {
+ x: arr[0],
+ y: arr[1]
+ };
+};
+var min = function min(arr) {
+ var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+ var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
+ var min = Infinity;
+ for (var i = begin; i < end; i++) {
+ var val = arr[i];
+ if (isFinite(val)) {
+ min = Math.min(val, min);
+ }
+ }
+ return min;
+};
+var max = function max(arr) {
+ var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+ var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
+ var max = -Infinity;
+ for (var i = begin; i < end; i++) {
+ var val = arr[i];
+ if (isFinite(val)) {
+ max = Math.max(val, max);
+ }
+ }
+ return max;
+};
+var mean = function mean(arr) {
+ var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+ var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
+ var total = 0;
+ var n = 0;
+ for (var i = begin; i < end; i++) {
+ var val = arr[i];
+ if (isFinite(val)) {
+ total += val;
+ n++;
+ }
+ }
+ return total / n;
+};
+var median = function median(arr) {
+ var begin = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+ var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : arr.length;
+ var copy = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : true;
+ var sort = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : true;
+ var includeHoles = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : true;
+ if (copy) {
+ arr = arr.slice(begin, end);
+ } else {
+ if (end < arr.length) {
+ arr.splice(end, arr.length - end);
+ }
+ if (begin > 0) {
+ arr.splice(0, begin);
+ }
+ }
-/**
- * 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);
+ // all non finite (e.g. Infinity, NaN) elements must be -Infinity so they go to the start
+ var off = 0; // offset from non-finite values
+ for (var i = arr.length - 1; i >= 0; i--) {
+ var v = arr[i];
+ if (includeHoles) {
+ if (!isFinite(v)) {
+ arr[i] = -Infinity;
+ off++;
+ }
+ } else {
+ // just remove it if we don't want to consider holes
+ arr.splice(i, 1);
+ }
+ }
+ if (sort) {
+ arr.sort(function (a, b) {
+ return a - b;
+ }); // requires copy = true if you don't want to change the orig
+ }
-module.exports = find;
+ var len = arr.length;
+ var mid = Math.floor(len / 2);
+ if (len % 2 !== 0) {
+ return arr[mid + 1 + off];
+ } else {
+ return (arr[mid - 1 + off] + arr[mid + off]) / 2;
+ }
+};
+var deg2rad = function deg2rad(deg) {
+ return Math.PI * deg / 180;
+};
+var getAngleFromDisp = function getAngleFromDisp(dispX, dispY) {
+ return Math.atan2(dispY, dispX) - Math.PI / 2;
+};
+var log2 = Math.log2 || function (n) {
+ return Math.log(n) / Math.log(2);
+};
+var signum = function signum(x) {
+ if (x > 0) {
+ return 1;
+ } else if (x < 0) {
+ return -1;
+ } else {
+ return 0;
+ }
+};
+var dist = function dist(p1, p2) {
+ return Math.sqrt(sqdist(p1, p2));
+};
+var sqdist = function sqdist(p1, p2) {
+ var dx = p2.x - p1.x;
+ var dy = p2.y - p1.y;
+ return dx * dx + dy * dy;
+};
+var inPlaceSumNormalize = function inPlaceSumNormalize(v) {
+ var length = v.length;
+ // First, get sum of all elements
+ var total = 0;
+ for (var i = 0; i < length; i++) {
+ total += v[i];
+ }
-/***/ }),
+ // Now, divide each by the sum of all elements
+ for (var _i = 0; _i < length; _i++) {
+ v[_i] = v[_i] / total;
+ }
+ return v;
+};
-/***/ "./node_modules/lodash/findIndex.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/findIndex.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+// from http://en.wikipedia.org/wiki/Bézier_curve#Quadratic_curves
+var qbezierAt = function qbezierAt(p0, p1, p2, t) {
+ return (1 - t) * (1 - t) * p0 + 2 * (1 - t) * t * p1 + t * t * p2;
+};
+var qbezierPtAt = function qbezierPtAt(p0, p1, p2, t) {
+ return {
+ x: qbezierAt(p0.x, p1.x, p2.x, t),
+ y: qbezierAt(p0.y, p1.y, p2.y, t)
+ };
+};
+var lineAt = function lineAt(p0, p1, t, d) {
+ var vec = {
+ x: p1.x - p0.x,
+ y: p1.y - p0.y
+ };
+ var vecDist = dist(p0, p1);
+ var normVec = {
+ x: vec.x / vecDist,
+ y: vec.y / vecDist
+ };
+ t = t == null ? 0 : t;
+ d = d != null ? d : t * vecDist;
+ return {
+ x: p0.x + normVec.x * d,
+ y: p0.y + normVec.y * d
+ };
+};
+var bound = function bound(min, val, max) {
+ return Math.max(min, Math.min(max, val));
+};
-var baseFindIndex = __webpack_require__(/*! ./_baseFindIndex */ "./node_modules/lodash/_baseFindIndex.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- toInteger = __webpack_require__(/*! ./toInteger */ "./node_modules/lodash/toInteger.js");
+// makes a full bb (x1, y1, x2, y2, w, h) from implicit params
+var makeBoundingBox = function makeBoundingBox(bb) {
+ if (bb == null) {
+ return {
+ x1: Infinity,
+ y1: Infinity,
+ x2: -Infinity,
+ y2: -Infinity,
+ w: 0,
+ h: 0
+ };
+ } else if (bb.x1 != null && bb.y1 != null) {
+ if (bb.x2 != null && bb.y2 != null && bb.x2 >= bb.x1 && bb.y2 >= bb.y1) {
+ return {
+ x1: bb.x1,
+ y1: bb.y1,
+ x2: bb.x2,
+ y2: bb.y2,
+ w: bb.x2 - bb.x1,
+ h: bb.y2 - bb.y1
+ };
+ } else if (bb.w != null && bb.h != null && bb.w >= 0 && bb.h >= 0) {
+ return {
+ x1: bb.x1,
+ y1: bb.y1,
+ x2: bb.x1 + bb.w,
+ y2: bb.y1 + bb.h,
+ w: bb.w,
+ h: bb.h
+ };
+ }
+ }
+};
+var copyBoundingBox = function copyBoundingBox(bb) {
+ return {
+ x1: bb.x1,
+ x2: bb.x2,
+ w: bb.w,
+ y1: bb.y1,
+ y2: bb.y2,
+ h: bb.h
+ };
+};
+var clearBoundingBox = function clearBoundingBox(bb) {
+ bb.x1 = Infinity;
+ bb.y1 = Infinity;
+ bb.x2 = -Infinity;
+ bb.y2 = -Infinity;
+ bb.w = 0;
+ bb.h = 0;
+};
+var shiftBoundingBox = function shiftBoundingBox(bb, dx, dy) {
+ return {
+ x1: bb.x1 + dx,
+ x2: bb.x2 + dx,
+ y1: bb.y1 + dy,
+ y2: bb.y2 + dy,
+ w: bb.w,
+ h: bb.h
+ };
+};
+var updateBoundingBox = function updateBoundingBox(bb1, bb2) {
+ // update bb1 with bb2 bounds
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeMax = Math.max;
+ bb1.x1 = Math.min(bb1.x1, bb2.x1);
+ bb1.x2 = Math.max(bb1.x2, bb2.x2);
+ bb1.w = bb1.x2 - bb1.x1;
+ bb1.y1 = Math.min(bb1.y1, bb2.y1);
+ bb1.y2 = Math.max(bb1.y2, bb2.y2);
+ bb1.h = bb1.y2 - bb1.y1;
+};
+var expandBoundingBoxByPoint = function expandBoundingBoxByPoint(bb, x, y) {
+ bb.x1 = Math.min(bb.x1, x);
+ bb.x2 = Math.max(bb.x2, x);
+ bb.w = bb.x2 - bb.x1;
+ bb.y1 = Math.min(bb.y1, y);
+ bb.y2 = Math.max(bb.y2, y);
+ bb.h = bb.y2 - bb.y1;
+};
+var expandBoundingBox = function expandBoundingBox(bb) {
+ var padding = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+ bb.x1 -= padding;
+ bb.x2 += padding;
+ bb.y1 -= padding;
+ bb.y2 += padding;
+ bb.w = bb.x2 - bb.x1;
+ bb.h = bb.y2 - bb.y1;
+ return bb;
+};
+var expandBoundingBoxSides = function expandBoundingBoxSides(bb) {
+ var padding = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [0];
+ var top, right, bottom, left;
+ if (padding.length === 1) {
+ top = right = bottom = left = padding[0];
+ } else if (padding.length === 2) {
+ top = bottom = padding[0];
+ left = right = padding[1];
+ } else if (padding.length === 4) {
+ var _padding = _slicedToArray(padding, 4);
+ top = _padding[0];
+ right = _padding[1];
+ bottom = _padding[2];
+ left = _padding[3];
+ }
+ bb.x1 -= left;
+ bb.x2 += right;
+ bb.y1 -= top;
+ bb.y2 += bottom;
+ bb.w = bb.x2 - bb.x1;
+ bb.h = bb.y2 - bb.y1;
+ return bb;
+};
-/**
- * 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;
+// assign the values of bb2 into bb1
+var assignBoundingBox = function assignBoundingBox(bb1, bb2) {
+ bb1.x1 = bb2.x1;
+ bb1.y1 = bb2.y1;
+ bb1.x2 = bb2.x2;
+ bb1.y2 = bb2.y2;
+ bb1.w = bb1.x2 - bb1.x1;
+ bb1.h = bb1.y2 - bb1.y1;
+};
+var boundingBoxesIntersect = function boundingBoxesIntersect(bb1, bb2) {
+ // case: one bb to right of other
+ if (bb1.x1 > bb2.x2) {
+ return false;
}
- var index = fromIndex == null ? 0 : toInteger(fromIndex);
- if (index < 0) {
- index = nativeMax(length + index, 0);
+ if (bb2.x1 > bb1.x2) {
+ return false;
}
- return baseFindIndex(array, baseIteratee(predicate, 3), index);
-}
-
-module.exports = findIndex;
+ // case: one bb to left of other
+ if (bb1.x2 < bb2.x1) {
+ return false;
+ }
+ if (bb2.x2 < bb1.x1) {
+ return false;
+ }
-/***/ }),
+ // case: one bb above other
+ if (bb1.y2 < bb2.y1) {
+ return false;
+ }
+ if (bb2.y2 < bb1.y1) {
+ return false;
+ }
-/***/ "./node_modules/lodash/flatten.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/flatten.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // case: one bb below other
+ if (bb1.y1 > bb2.y2) {
+ return false;
+ }
+ if (bb2.y1 > bb1.y2) {
+ return false;
+ }
-var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js");
+ // otherwise, must have some overlap
+ return true;
+};
+var inBoundingBox = function inBoundingBox(bb, x, y) {
+ return bb.x1 <= x && x <= bb.x2 && bb.y1 <= y && y <= bb.y2;
+};
+var pointInBoundingBox = function pointInBoundingBox(bb, pt) {
+ return inBoundingBox(bb, pt.x, pt.y);
+};
+var boundingBoxInBoundingBox = function boundingBoxInBoundingBox(bb1, bb2) {
+ return inBoundingBox(bb1, bb2.x1, bb2.y1) && inBoundingBox(bb1, bb2.x2, bb2.y2);
+};
+var roundRectangleIntersectLine = function roundRectangleIntersectLine(x, y, nodeX, nodeY, width, height, padding) {
+ var radius = arguments.length > 7 && arguments[7] !== undefined ? arguments[7] : 'auto';
+ var cornerRadius = radius === 'auto' ? getRoundRectangleRadius(width, height) : radius;
+ var halfWidth = width / 2;
+ var halfHeight = height / 2;
+ cornerRadius = Math.min(cornerRadius, halfWidth, halfHeight);
+ var doWidth = cornerRadius !== halfWidth,
+ doHeight = cornerRadius !== halfHeight;
-/**
- * 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) : [];
-}
+ // Check intersections with straight line segments
+ var straightLineIntersections;
-module.exports = flatten;
+ // Top segment, left to right
+ if (doWidth) {
+ var topStartX = nodeX - halfWidth + cornerRadius - padding;
+ var topStartY = nodeY - halfHeight - padding;
+ var topEndX = nodeX + halfWidth - cornerRadius + padding;
+ var topEndY = topStartY;
+ straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, topStartX, topStartY, topEndX, topEndY, false);
+ if (straightLineIntersections.length > 0) {
+ return straightLineIntersections;
+ }
+ }
+ // Right segment, top to bottom
+ if (doHeight) {
+ var rightStartX = nodeX + halfWidth + padding;
+ var rightStartY = nodeY - halfHeight + cornerRadius - padding;
+ var rightEndX = rightStartX;
+ var rightEndY = nodeY + halfHeight - cornerRadius + padding;
+ straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, rightStartX, rightStartY, rightEndX, rightEndY, false);
+ if (straightLineIntersections.length > 0) {
+ return straightLineIntersections;
+ }
+ }
-/***/ }),
+ // Bottom segment, left to right
+ if (doWidth) {
+ var bottomStartX = nodeX - halfWidth + cornerRadius - padding;
+ var bottomStartY = nodeY + halfHeight + padding;
+ var bottomEndX = nodeX + halfWidth - cornerRadius + padding;
+ var bottomEndY = bottomStartY;
+ straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, bottomStartX, bottomStartY, bottomEndX, bottomEndY, false);
+ if (straightLineIntersections.length > 0) {
+ return straightLineIntersections;
+ }
+ }
-/***/ "./node_modules/lodash/forEach.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/forEach.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Left segment, top to bottom
+ if (doHeight) {
+ var leftStartX = nodeX - halfWidth - padding;
+ var leftStartY = nodeY - halfHeight + cornerRadius - padding;
+ var leftEndX = leftStartX;
+ var leftEndY = nodeY + halfHeight - cornerRadius + padding;
+ straightLineIntersections = finiteLinesIntersect(x, y, nodeX, nodeY, leftStartX, leftStartY, leftEndX, leftEndY, false);
+ if (straightLineIntersections.length > 0) {
+ return straightLineIntersections;
+ }
+ }
-var arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
- baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
- castFunction = __webpack_require__(/*! ./_castFunction */ "./node_modules/lodash/_castFunction.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+ // Check intersections with arc segments
+ var arcIntersections;
-/**
- * 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, castFunction(iteratee));
-}
+ // Top Left
+ {
+ var topLeftCenterX = nodeX - halfWidth + cornerRadius;
+ var topLeftCenterY = nodeY - halfHeight + cornerRadius;
+ arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, topLeftCenterX, topLeftCenterY, cornerRadius + padding);
-module.exports = forEach;
+ // Ensure the intersection is on the desired quarter of the circle
+ if (arcIntersections.length > 0 && arcIntersections[0] <= topLeftCenterX && arcIntersections[1] <= topLeftCenterY) {
+ return [arcIntersections[0], arcIntersections[1]];
+ }
+ }
+ // Top Right
+ {
+ var topRightCenterX = nodeX + halfWidth - cornerRadius;
+ var topRightCenterY = nodeY - halfHeight + cornerRadius;
+ arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, topRightCenterX, topRightCenterY, cornerRadius + padding);
-/***/ }),
+ // Ensure the intersection is on the desired quarter of the circle
+ if (arcIntersections.length > 0 && arcIntersections[0] >= topRightCenterX && arcIntersections[1] <= topRightCenterY) {
+ return [arcIntersections[0], arcIntersections[1]];
+ }
+ }
-/***/ "./node_modules/lodash/forIn.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/forIn.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Bottom Right
+ {
+ var bottomRightCenterX = nodeX + halfWidth - cornerRadius;
+ var bottomRightCenterY = nodeY + halfHeight - cornerRadius;
+ arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, bottomRightCenterX, bottomRightCenterY, cornerRadius + padding);
-var baseFor = __webpack_require__(/*! ./_baseFor */ "./node_modules/lodash/_baseFor.js"),
- castFunction = __webpack_require__(/*! ./_castFunction */ "./node_modules/lodash/_castFunction.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
+ // Ensure the intersection is on the desired quarter of the circle
+ if (arcIntersections.length > 0 && arcIntersections[0] >= bottomRightCenterX && arcIntersections[1] >= bottomRightCenterY) {
+ return [arcIntersections[0], arcIntersections[1]];
+ }
+ }
-/**
- * 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, castFunction(iteratee), keysIn);
-}
+ // Bottom Left
+ {
+ var bottomLeftCenterX = nodeX - halfWidth + cornerRadius;
+ var bottomLeftCenterY = nodeY + halfHeight - cornerRadius;
+ arcIntersections = intersectLineCircle(x, y, nodeX, nodeY, bottomLeftCenterX, bottomLeftCenterY, cornerRadius + padding);
-module.exports = forIn;
+ // Ensure the intersection is on the desired quarter of the circle
+ if (arcIntersections.length > 0 && arcIntersections[0] <= bottomLeftCenterX && arcIntersections[1] >= bottomLeftCenterY) {
+ return [arcIntersections[0], arcIntersections[1]];
+ }
+ }
+ return []; // if nothing
+};
+var inLineVicinity = function inLineVicinity(x, y, lx1, ly1, lx2, ly2, tolerance) {
+ var t = tolerance;
+ var x1 = Math.min(lx1, lx2);
+ var x2 = Math.max(lx1, lx2);
+ var y1 = Math.min(ly1, ly2);
+ var y2 = Math.max(ly1, ly2);
+ return x1 - t <= x && x <= x2 + t && y1 - t <= y && y <= y2 + t;
+};
+var inBezierVicinity = function inBezierVicinity(x, y, x1, y1, x2, y2, x3, y3, tolerance) {
+ var bb = {
+ x1: Math.min(x1, x3, x2) - tolerance,
+ x2: Math.max(x1, x3, x2) + tolerance,
+ y1: Math.min(y1, y3, y2) - tolerance,
+ y2: Math.max(y1, y3, y2) + tolerance
+ };
-/***/ }),
+ // if outside the rough bounding box for the bezier, then it can't be a hit
+ if (x < bb.x1 || x > bb.x2 || y < bb.y1 || y > bb.y2) {
+ // console.log('bezier out of rough bb')
+ return false;
+ } else {
+ // console.log('do more expensive check');
+ return true;
+ }
+};
+var solveQuadratic = function solveQuadratic(a, b, c, val) {
+ c -= val;
+ var r = b * b - 4 * a * c;
+ if (r < 0) {
+ return [];
+ }
+ var sqrtR = Math.sqrt(r);
+ var denom = 2 * a;
+ var root1 = (-b + sqrtR) / denom;
+ var root2 = (-b - sqrtR) / denom;
+ return [root1, root2];
+};
+var solveCubic = function solveCubic(a, b, c, d, result) {
+ // Solves a cubic function, returns root in form [r1, i1, r2, i2, r3, i3], where
+ // r is the real component, i is the imaginary component
-/***/ "./node_modules/lodash/get.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/get.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // An implementation of the Cardano method from the year 1545
+ // http://en.wikipedia.org/wiki/Cubic_function#The_nature_of_the_roots
-var baseGet = __webpack_require__(/*! ./_baseGet */ "./node_modules/lodash/_baseGet.js");
+ var epsilon = 0.00001;
-/**
- * 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;
-}
+ // avoid division by zero while keeping the overall expression close in value
+ if (a === 0) {
+ a = epsilon;
+ }
+ b /= a;
+ c /= a;
+ d /= a;
+ var discriminant, q, r, dum1, s, t, term1, r13;
+ q = (3.0 * c - b * b) / 9.0;
+ r = -(27.0 * d) + b * (9.0 * c - 2.0 * (b * b));
+ r /= 54.0;
+ discriminant = q * q * q + r * r;
+ result[1] = 0;
+ term1 = b / 3.0;
+ if (discriminant > 0) {
+ s = r + Math.sqrt(discriminant);
+ s = s < 0 ? -Math.pow(-s, 1.0 / 3.0) : Math.pow(s, 1.0 / 3.0);
+ t = r - Math.sqrt(discriminant);
+ t = t < 0 ? -Math.pow(-t, 1.0 / 3.0) : Math.pow(t, 1.0 / 3.0);
+ result[0] = -term1 + s + t;
+ term1 += (s + t) / 2.0;
+ result[4] = result[2] = -term1;
+ term1 = Math.sqrt(3.0) * (-t + s) / 2;
+ result[3] = term1;
+ result[5] = -term1;
+ return;
+ }
+ result[5] = result[3] = 0;
+ if (discriminant === 0) {
+ r13 = r < 0 ? -Math.pow(-r, 1.0 / 3.0) : Math.pow(r, 1.0 / 3.0);
+ result[0] = -term1 + 2.0 * r13;
+ result[4] = result[2] = -(r13 + term1);
+ return;
+ }
+ q = -q;
+ dum1 = q * q * q;
+ dum1 = Math.acos(r / Math.sqrt(dum1));
+ r13 = 2.0 * Math.sqrt(q);
+ result[0] = -term1 + r13 * Math.cos(dum1 / 3.0);
+ result[2] = -term1 + r13 * Math.cos((dum1 + 2.0 * Math.PI) / 3.0);
+ result[4] = -term1 + r13 * Math.cos((dum1 + 4.0 * Math.PI) / 3.0);
+ return;
+};
+var sqdistToQuadraticBezier = function sqdistToQuadraticBezier(x, y, x1, y1, x2, y2, x3, y3) {
+ // Find minimum distance by using the minimum of the distance
+ // function between the given point and the curve
-module.exports = get;
+ // This gives the coefficients of the resulting cubic equation
+ // whose roots tell us where a possible minimum is
+ // (Coefficients are divided by 4)
+ var a = 1.0 * x1 * x1 - 4 * x1 * x2 + 2 * x1 * x3 + 4 * x2 * x2 - 4 * x2 * x3 + x3 * x3 + y1 * y1 - 4 * y1 * y2 + 2 * y1 * y3 + 4 * y2 * y2 - 4 * y2 * y3 + y3 * y3;
+ var b = 1.0 * 9 * x1 * x2 - 3 * x1 * x1 - 3 * x1 * x3 - 6 * x2 * x2 + 3 * x2 * x3 + 9 * y1 * y2 - 3 * y1 * y1 - 3 * y1 * y3 - 6 * y2 * y2 + 3 * y2 * y3;
+ var c = 1.0 * 3 * x1 * x1 - 6 * x1 * x2 + x1 * x3 - x1 * x + 2 * x2 * x2 + 2 * x2 * x - x3 * x + 3 * y1 * y1 - 6 * y1 * y2 + y1 * y3 - y1 * y + 2 * y2 * y2 + 2 * y2 * y - y3 * y;
+ var d = 1.0 * x1 * x2 - x1 * x1 + x1 * x - x2 * x + y1 * y2 - y1 * y1 + y1 * y - y2 * y;
-/***/ }),
+ // debug("coefficients: " + a / a + ", " + b / a + ", " + c / a + ", " + d / a);
-/***/ "./node_modules/lodash/has.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/has.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ var roots = [];
-var baseHas = __webpack_require__(/*! ./_baseHas */ "./node_modules/lodash/_baseHas.js"),
- hasPath = __webpack_require__(/*! ./_hasPath */ "./node_modules/lodash/_hasPath.js");
+ // Use the cubic solving algorithm
+ solveCubic(a, b, c, d, roots);
+ var zeroThreshold = 0.0000001;
+ var params = [];
+ for (var index = 0; index < 6; index += 2) {
+ if (Math.abs(roots[index + 1]) < zeroThreshold && roots[index] >= 0 && roots[index] <= 1.0) {
+ params.push(roots[index]);
+ }
+ }
+ params.push(1.0);
+ params.push(0.0);
+ var minDistanceSquared = -1;
+ var curX, curY, distSquared;
+ for (var i = 0; i < params.length; i++) {
+ curX = Math.pow(1.0 - params[i], 2.0) * x1 + 2.0 * (1 - params[i]) * params[i] * x2 + params[i] * params[i] * x3;
+ curY = Math.pow(1 - params[i], 2.0) * y1 + 2 * (1.0 - params[i]) * params[i] * y2 + params[i] * params[i] * y3;
+ distSquared = Math.pow(curX - x, 2) + Math.pow(curY - y, 2);
+ // debug('distance for param ' + params[i] + ": " + Math.sqrt(distSquared));
+ if (minDistanceSquared >= 0) {
+ if (distSquared < minDistanceSquared) {
+ minDistanceSquared = distSquared;
+ }
+ } else {
+ minDistanceSquared = distSquared;
+ }
+ }
+ return minDistanceSquared;
+};
+var sqdistToFiniteLine = function sqdistToFiniteLine(x, y, x1, y1, x2, y2) {
+ var offset = [x - x1, y - y1];
+ var line = [x2 - x1, y2 - y1];
+ var lineSq = line[0] * line[0] + line[1] * line[1];
+ var hypSq = offset[0] * offset[0] + offset[1] * offset[1];
+ var dotProduct = offset[0] * line[0] + offset[1] * line[1];
+ var adjSq = dotProduct * dotProduct / lineSq;
+ if (dotProduct < 0) {
+ return hypSq;
+ }
+ if (adjSq > lineSq) {
+ return (x - x2) * (x - x2) + (y - y2) * (y - y2);
+ }
+ return hypSq - adjSq;
+};
+var pointInsidePolygonPoints = function pointInsidePolygonPoints(x, y, points) {
+ var x1, y1, x2, y2;
+ var y3;
-/**
- * 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);
-}
+ // Intersect with vertical line through (x, y)
+ var up = 0;
+ // let down = 0;
+ for (var i = 0; i < points.length / 2; i++) {
+ x1 = points[i * 2];
+ y1 = points[i * 2 + 1];
+ if (i + 1 < points.length / 2) {
+ x2 = points[(i + 1) * 2];
+ y2 = points[(i + 1) * 2 + 1];
+ } else {
+ x2 = points[(i + 1 - points.length / 2) * 2];
+ y2 = points[(i + 1 - points.length / 2) * 2 + 1];
+ }
+ if (x1 == x && x2 == x) ; else if (x1 >= x && x >= x2 || x1 <= x && x <= x2) {
+ y3 = (x - x1) / (x2 - x1) * (y2 - y1) + y1;
+ if (y3 > y) {
+ up++;
+ }
-module.exports = has;
+ // if( y3 < y ){
+ // down++;
+ // }
+ } else {
+ continue;
+ }
+ }
+ if (up % 2 === 0) {
+ return false;
+ } else {
+ return true;
+ }
+};
+var pointInsidePolygon = function pointInsidePolygon(x, y, basePoints, centerX, centerY, width, height, direction, padding) {
+ var transformedPoints = new Array(basePoints.length);
+ // Gives negative angle
+ var angle;
+ if (direction[0] != null) {
+ angle = Math.atan(direction[1] / direction[0]);
+ if (direction[0] < 0) {
+ angle = angle + Math.PI / 2;
+ } else {
+ angle = -angle - Math.PI / 2;
+ }
+ } else {
+ angle = direction;
+ }
+ var cos = Math.cos(-angle);
+ var sin = Math.sin(-angle);
-/***/ }),
+ // console.log("base: " + basePoints);
+ for (var i = 0; i < transformedPoints.length / 2; i++) {
+ transformedPoints[i * 2] = width / 2 * (basePoints[i * 2] * cos - basePoints[i * 2 + 1] * sin);
+ transformedPoints[i * 2 + 1] = height / 2 * (basePoints[i * 2 + 1] * cos + basePoints[i * 2] * sin);
+ transformedPoints[i * 2] += centerX;
+ transformedPoints[i * 2 + 1] += centerY;
+ }
+ var points;
+ if (padding > 0) {
+ var expandedLineSet = expandPolygon(transformedPoints, -padding);
+ points = joinLines(expandedLineSet);
+ } else {
+ points = transformedPoints;
+ }
+ return pointInsidePolygonPoints(x, y, points);
+};
+var pointInsideRoundPolygon = function pointInsideRoundPolygon(x, y, basePoints, centerX, centerY, width, height, corners) {
+ var cutPolygonPoints = new Array(basePoints.length * 2);
+ for (var i = 0; i < corners.length; i++) {
+ var corner = corners[i];
+ cutPolygonPoints[i * 4 + 0] = corner.startX;
+ cutPolygonPoints[i * 4 + 1] = corner.startY;
+ cutPolygonPoints[i * 4 + 2] = corner.stopX;
+ cutPolygonPoints[i * 4 + 3] = corner.stopY;
+ var squaredDistance = Math.pow(corner.cx - x, 2) + Math.pow(corner.cy - y, 2);
+ if (squaredDistance <= Math.pow(corner.radius, 2)) {
+ return true;
+ }
+ }
+ return pointInsidePolygonPoints(x, y, cutPolygonPoints);
+};
+var joinLines = function joinLines(lineSet) {
+ var vertices = new Array(lineSet.length / 2);
+ var currentLineStartX, currentLineStartY, currentLineEndX, currentLineEndY;
+ var nextLineStartX, nextLineStartY, nextLineEndX, nextLineEndY;
+ for (var i = 0; i < lineSet.length / 4; i++) {
+ currentLineStartX = lineSet[i * 4];
+ currentLineStartY = lineSet[i * 4 + 1];
+ currentLineEndX = lineSet[i * 4 + 2];
+ currentLineEndY = lineSet[i * 4 + 3];
+ if (i < lineSet.length / 4 - 1) {
+ nextLineStartX = lineSet[(i + 1) * 4];
+ nextLineStartY = lineSet[(i + 1) * 4 + 1];
+ nextLineEndX = lineSet[(i + 1) * 4 + 2];
+ nextLineEndY = lineSet[(i + 1) * 4 + 3];
+ } else {
+ nextLineStartX = lineSet[0];
+ nextLineStartY = lineSet[1];
+ nextLineEndX = lineSet[2];
+ nextLineEndY = lineSet[3];
+ }
+ var intersection = finiteLinesIntersect(currentLineStartX, currentLineStartY, currentLineEndX, currentLineEndY, nextLineStartX, nextLineStartY, nextLineEndX, nextLineEndY, true);
+ vertices[i * 2] = intersection[0];
+ vertices[i * 2 + 1] = intersection[1];
+ }
+ return vertices;
+};
+var expandPolygon = function expandPolygon(points, pad) {
+ var expandedLineSet = new Array(points.length * 2);
+ var currentPointX, currentPointY, nextPointX, nextPointY;
+ for (var i = 0; i < points.length / 2; i++) {
+ currentPointX = points[i * 2];
+ currentPointY = points[i * 2 + 1];
+ if (i < points.length / 2 - 1) {
+ nextPointX = points[(i + 1) * 2];
+ nextPointY = points[(i + 1) * 2 + 1];
+ } else {
+ nextPointX = points[0];
+ nextPointY = points[1];
+ }
-/***/ "./node_modules/lodash/hasIn.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/hasIn.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Current line: [currentPointX, currentPointY] to [nextPointX, nextPointY]
-var baseHasIn = __webpack_require__(/*! ./_baseHasIn */ "./node_modules/lodash/_baseHasIn.js"),
- hasPath = __webpack_require__(/*! ./_hasPath */ "./node_modules/lodash/_hasPath.js");
+ // Assume CCW polygon winding
-/**
- * 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);
-}
+ var offsetX = nextPointY - currentPointY;
+ var offsetY = -(nextPointX - currentPointX);
-module.exports = hasIn;
+ // Normalize
+ var offsetLength = Math.sqrt(offsetX * offsetX + offsetY * offsetY);
+ var normalizedOffsetX = offsetX / offsetLength;
+ var normalizedOffsetY = offsetY / offsetLength;
+ expandedLineSet[i * 4] = currentPointX + normalizedOffsetX * pad;
+ expandedLineSet[i * 4 + 1] = currentPointY + normalizedOffsetY * pad;
+ expandedLineSet[i * 4 + 2] = nextPointX + normalizedOffsetX * pad;
+ expandedLineSet[i * 4 + 3] = nextPointY + normalizedOffsetY * pad;
+ }
+ return expandedLineSet;
+};
+var intersectLineEllipse = function intersectLineEllipse(x, y, centerX, centerY, ellipseWradius, ellipseHradius) {
+ var dispX = centerX - x;
+ var dispY = centerY - y;
+ dispX /= ellipseWradius;
+ dispY /= ellipseHradius;
+ var len = Math.sqrt(dispX * dispX + dispY * dispY);
+ var newLength = len - 1;
+ if (newLength < 0) {
+ return [];
+ }
+ var lenProportion = newLength / len;
+ return [(centerX - x) * lenProportion + x, (centerY - y) * lenProportion + y];
+};
+var checkInEllipse = function checkInEllipse(x, y, width, height, centerX, centerY, padding) {
+ x -= centerX;
+ y -= centerY;
+ x /= width / 2 + padding;
+ y /= height / 2 + padding;
+ return x * x + y * y <= 1;
+};
+// Returns intersections of increasing distance from line's start point
+var intersectLineCircle = function intersectLineCircle(x1, y1, x2, y2, centerX, centerY, radius) {
+ // Calculate d, direction vector of line
+ var d = [x2 - x1, y2 - y1]; // Direction vector of line
+ var f = [x1 - centerX, y1 - centerY];
+ var a = d[0] * d[0] + d[1] * d[1];
+ var b = 2 * (f[0] * d[0] + f[1] * d[1]);
+ var c = f[0] * f[0] + f[1] * f[1] - radius * radius;
+ var discriminant = b * b - 4 * a * c;
+ if (discriminant < 0) {
+ return [];
+ }
+ var t1 = (-b + Math.sqrt(discriminant)) / (2 * a);
+ var t2 = (-b - Math.sqrt(discriminant)) / (2 * a);
+ var tMin = Math.min(t1, t2);
+ var tMax = Math.max(t1, t2);
+ var inRangeParams = [];
+ if (tMin >= 0 && tMin <= 1) {
+ inRangeParams.push(tMin);
+ }
+ if (tMax >= 0 && tMax <= 1) {
+ inRangeParams.push(tMax);
+ }
+ if (inRangeParams.length === 0) {
+ return [];
+ }
+ var nearIntersectionX = inRangeParams[0] * d[0] + x1;
+ var nearIntersectionY = inRangeParams[0] * d[1] + y1;
+ if (inRangeParams.length > 1) {
+ if (inRangeParams[0] == inRangeParams[1]) {
+ return [nearIntersectionX, nearIntersectionY];
+ } else {
+ var farIntersectionX = inRangeParams[1] * d[0] + x1;
+ var farIntersectionY = inRangeParams[1] * d[1] + y1;
+ return [nearIntersectionX, nearIntersectionY, farIntersectionX, farIntersectionY];
+ }
+ } else {
+ return [nearIntersectionX, nearIntersectionY];
+ }
+};
+var midOfThree = function midOfThree(a, b, c) {
+ if (b <= a && a <= c || c <= a && a <= b) {
+ return a;
+ } else if (a <= b && b <= c || c <= b && b <= a) {
+ return b;
+ } else {
+ return c;
+ }
+};
-/***/ }),
+// (x1,y1)=>(x2,y2) intersect with (x3,y3)=>(x4,y4)
+var finiteLinesIntersect = function finiteLinesIntersect(x1, y1, x2, y2, x3, y3, x4, y4, infiniteLines) {
+ var dx13 = x1 - x3;
+ var dx21 = x2 - x1;
+ var dx43 = x4 - x3;
+ var dy13 = y1 - y3;
+ var dy21 = y2 - y1;
+ var dy43 = y4 - y3;
+ var ua_t = dx43 * dy13 - dy43 * dx13;
+ var ub_t = dx21 * dy13 - dy21 * dx13;
+ var u_b = dy43 * dx21 - dx43 * dy21;
+ if (u_b !== 0) {
+ var ua = ua_t / u_b;
+ var ub = ub_t / u_b;
+ var flptThreshold = 0.001;
+ var _min = 0 - flptThreshold;
+ var _max = 1 + flptThreshold;
+ if (_min <= ua && ua <= _max && _min <= ub && ub <= _max) {
+ return [x1 + ua * dx21, y1 + ua * dy21];
+ } else {
+ if (!infiniteLines) {
+ return [];
+ } else {
+ return [x1 + ua * dx21, y1 + ua * dy21];
+ }
+ }
+ } else {
+ if (ua_t === 0 || ub_t === 0) {
+ // Parallel, coincident lines. Check if overlap
-/***/ "./node_modules/lodash/identity.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/identity.js ***!
- \*****************************************/
-/***/ (function(module) {
+ // Check endpoint of second line
+ if (midOfThree(x1, x2, x4) === x4) {
+ return [x4, y4];
+ }
-/**
- * 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;
-}
+ // Check start point of second line
+ if (midOfThree(x1, x2, x3) === x3) {
+ return [x3, y3];
+ }
-module.exports = identity;
+ // Endpoint of first line
+ if (midOfThree(x3, x4, x2) === x2) {
+ return [x2, y2];
+ }
+ return [];
+ } else {
+ // Parallel, non-coincident
+ return [];
+ }
+ }
+};
+// math.polygonIntersectLine( x, y, basePoints, centerX, centerY, width, height, padding )
+// intersect a node polygon (pts transformed)
+//
+// math.polygonIntersectLine( x, y, basePoints, centerX, centerY )
+// intersect the points (no transform)
+var polygonIntersectLine = function polygonIntersectLine(x, y, basePoints, centerX, centerY, width, height, padding) {
+ var intersections = [];
+ var intersection;
+ var transformedPoints = new Array(basePoints.length);
+ var doTransform = true;
+ if (width == null) {
+ doTransform = false;
+ }
+ var points;
+ if (doTransform) {
+ for (var i = 0; i < transformedPoints.length / 2; i++) {
+ transformedPoints[i * 2] = basePoints[i * 2] * width + centerX;
+ transformedPoints[i * 2 + 1] = basePoints[i * 2 + 1] * height + centerY;
+ }
+ if (padding > 0) {
+ var expandedLineSet = expandPolygon(transformedPoints, -padding);
+ points = joinLines(expandedLineSet);
+ } else {
+ points = transformedPoints;
+ }
+ } else {
+ points = basePoints;
+ }
+ var currentX, currentY, nextX, nextY;
+ for (var _i2 = 0; _i2 < points.length / 2; _i2++) {
+ currentX = points[_i2 * 2];
+ currentY = points[_i2 * 2 + 1];
+ if (_i2 < points.length / 2 - 1) {
+ nextX = points[(_i2 + 1) * 2];
+ nextY = points[(_i2 + 1) * 2 + 1];
+ } else {
+ nextX = points[0];
+ nextY = points[1];
+ }
+ intersection = finiteLinesIntersect(x, y, centerX, centerY, currentX, currentY, nextX, nextY);
+ if (intersection.length !== 0) {
+ intersections.push(intersection[0], intersection[1]);
+ }
+ }
+ return intersections;
+};
+var roundPolygonIntersectLine = function roundPolygonIntersectLine(x, y, basePoints, centerX, centerY, width, height, padding, corners) {
+ var intersections = [];
+ var intersection;
+ var lines = new Array(basePoints.length * 2);
+ corners.forEach(function (corner, i) {
+ if (i === 0) {
+ lines[lines.length - 2] = corner.startX;
+ lines[lines.length - 1] = corner.startY;
+ } else {
+ lines[i * 4 - 2] = corner.startX;
+ lines[i * 4 - 1] = corner.startY;
+ }
+ lines[i * 4] = corner.stopX;
+ lines[i * 4 + 1] = corner.stopY;
+ intersection = intersectLineCircle(x, y, centerX, centerY, corner.cx, corner.cy, corner.radius);
+ if (intersection.length !== 0) {
+ intersections.push(intersection[0], intersection[1]);
+ }
+ });
+ for (var i = 0; i < lines.length / 4; i++) {
+ intersection = finiteLinesIntersect(x, y, centerX, centerY, lines[i * 4], lines[i * 4 + 1], lines[i * 4 + 2], lines[i * 4 + 3], false);
+ if (intersection.length !== 0) {
+ intersections.push(intersection[0], intersection[1]);
+ }
+ }
+ if (intersections.length > 2) {
+ var lowestIntersection = [intersections[0], intersections[1]];
+ var lowestSquaredDistance = Math.pow(lowestIntersection[0] - x, 2) + Math.pow(lowestIntersection[1] - y, 2);
+ for (var _i3 = 1; _i3 < intersections.length / 2; _i3++) {
+ var squaredDistance = Math.pow(intersections[_i3 * 2] - x, 2) + Math.pow(intersections[_i3 * 2 + 1] - y, 2);
+ if (squaredDistance <= lowestSquaredDistance) {
+ lowestIntersection[0] = intersections[_i3 * 2];
+ lowestIntersection[1] = intersections[_i3 * 2 + 1];
+ lowestSquaredDistance = squaredDistance;
+ }
+ }
+ return lowestIntersection;
+ }
+ return intersections;
+};
+var shortenIntersection = function shortenIntersection(intersection, offset, amount) {
+ var disp = [intersection[0] - offset[0], intersection[1] - offset[1]];
+ var length = Math.sqrt(disp[0] * disp[0] + disp[1] * disp[1]);
+ var lenRatio = (length - amount) / length;
+ if (lenRatio < 0) {
+ lenRatio = 0.00001;
+ }
+ return [offset[0] + lenRatio * disp[0], offset[1] + lenRatio * disp[1]];
+};
+var generateUnitNgonPointsFitToSquare = function generateUnitNgonPointsFitToSquare(sides, rotationRadians) {
+ var points = generateUnitNgonPoints(sides, rotationRadians);
+ points = fitPolygonToSquare(points);
+ return points;
+};
+var fitPolygonToSquare = function fitPolygonToSquare(points) {
+ var x, y;
+ var sides = points.length / 2;
+ var minX = Infinity,
+ minY = Infinity,
+ maxX = -Infinity,
+ maxY = -Infinity;
+ for (var i = 0; i < sides; i++) {
+ x = points[2 * i];
+ y = points[2 * i + 1];
+ minX = Math.min(minX, x);
+ maxX = Math.max(maxX, x);
+ minY = Math.min(minY, y);
+ maxY = Math.max(maxY, y);
+ }
-/***/ }),
+ // stretch factors
+ var sx = 2 / (maxX - minX);
+ var sy = 2 / (maxY - minY);
+ for (var _i4 = 0; _i4 < sides; _i4++) {
+ x = points[2 * _i4] = points[2 * _i4] * sx;
+ y = points[2 * _i4 + 1] = points[2 * _i4 + 1] * sy;
+ minX = Math.min(minX, x);
+ maxX = Math.max(maxX, x);
+ minY = Math.min(minY, y);
+ maxY = Math.max(maxY, y);
+ }
+ if (minY < -1) {
+ for (var _i5 = 0; _i5 < sides; _i5++) {
+ y = points[2 * _i5 + 1] = points[2 * _i5 + 1] + (-1 - minY);
+ }
+ }
+ return points;
+};
+var generateUnitNgonPoints = function generateUnitNgonPoints(sides, rotationRadians) {
+ var increment = 1.0 / sides * 2 * Math.PI;
+ var startAngle = sides % 2 === 0 ? Math.PI / 2.0 + increment / 2.0 : Math.PI / 2.0;
+ startAngle += rotationRadians;
+ var points = new Array(sides * 2);
+ var currentAngle;
+ for (var i = 0; i < sides; i++) {
+ currentAngle = i * increment + startAngle;
+ points[2 * i] = Math.cos(currentAngle); // x
+ points[2 * i + 1] = Math.sin(-currentAngle); // y
+ }
-/***/ "./node_modules/lodash/isArguments.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/isArguments.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ return points;
+};
-var baseIsArguments = __webpack_require__(/*! ./_baseIsArguments */ "./node_modules/lodash/_baseIsArguments.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+// Set the default radius, unless half of width or height is smaller than default
+var getRoundRectangleRadius = function getRoundRectangleRadius(width, height) {
+ return Math.min(width / 4, height / 4, 8);
+};
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+// Set the default radius
+var getRoundPolygonRadius = function getRoundPolygonRadius(width, height) {
+ return Math.min(width / 10, height / 10, 8);
+};
+var getCutRectangleCornerLength = function getCutRectangleCornerLength() {
+ return 8;
+};
+var bezierPtsToQuadCoeff = function bezierPtsToQuadCoeff(p0, p1, p2) {
+ return [p0 - 2 * p1 + p2, 2 * (p1 - p0), p0];
+};
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+// get curve width, height, and control point position offsets as a percentage of node height / width
+var getBarrelCurveConstants = function getBarrelCurveConstants(width, height) {
+ return {
+ heightOffset: Math.min(15, 0.05 * height),
+ widthOffset: Math.min(100, 0.25 * width),
+ ctrlPtOffsetPct: 0.05
+ };
+};
-/** Built-in value references. */
-var propertyIsEnumerable = objectProto.propertyIsEnumerable;
+var pageRankDefaults = defaults$g({
+ dampingFactor: 0.8,
+ precision: 0.000001,
+ iterations: 200,
+ weight: function weight(edge) {
+ return 1;
+ }
+});
+var elesfn$o = {
+ pageRank: function pageRank(options) {
+ var _pageRankDefaults = pageRankDefaults(options),
+ dampingFactor = _pageRankDefaults.dampingFactor,
+ precision = _pageRankDefaults.precision,
+ iterations = _pageRankDefaults.iterations,
+ weight = _pageRankDefaults.weight;
+ var cy = this._private.cy;
+ var _this$byGroup = this.byGroup(),
+ nodes = _this$byGroup.nodes,
+ edges = _this$byGroup.edges;
+ var numNodes = nodes.length;
+ var numNodesSqd = numNodes * numNodes;
+ var numEdges = edges.length;
-/**
- * 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');
-};
+ // Construct transposed adjacency matrix
+ // First lets have a zeroed matrix of the right size
+ // We'll also keep track of the sum of each column
+ var matrix = new Array(numNodesSqd);
+ var columnSum = new Array(numNodes);
+ var additionalProb = (1 - dampingFactor) / numNodes;
-module.exports = isArguments;
+ // Create null matrix
+ for (var i = 0; i < numNodes; i++) {
+ for (var j = 0; j < numNodes; j++) {
+ var n = i * numNodes + j;
+ matrix[n] = 0;
+ }
+ columnSum[i] = 0;
+ }
+ // Now, process edges
+ for (var _i = 0; _i < numEdges; _i++) {
+ var edge = edges[_i];
+ var srcId = edge.data('source');
+ var tgtId = edge.data('target');
-/***/ }),
+ // Don't include loops in the matrix
+ if (srcId === tgtId) {
+ continue;
+ }
+ var s = nodes.indexOfId(srcId);
+ var t = nodes.indexOfId(tgtId);
+ var w = weight(edge);
+ var _n = t * numNodes + s;
-/***/ "./node_modules/lodash/isArray.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/isArray.js ***!
- \****************************************/
-/***/ (function(module) {
+ // Update matrix
+ matrix[_n] += w;
-/**
- * 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;
+ // Update column sum
+ columnSum[s] += w;
+ }
-module.exports = isArray;
+ // Add additional probability based on damping factor
+ // Also, take into account columns that have sum = 0
+ var p = 1.0 / numNodes + additionalProb; // Shorthand
+ // Traverse matrix, column by column
+ for (var _j = 0; _j < numNodes; _j++) {
+ if (columnSum[_j] === 0) {
+ // No 'links' out from node jth, assume equal probability for each possible node
+ for (var _i2 = 0; _i2 < numNodes; _i2++) {
+ var _n2 = _i2 * numNodes + _j;
+ matrix[_n2] = p;
+ }
+ } else {
+ // Node jth has outgoing link, compute normalized probabilities
+ for (var _i3 = 0; _i3 < numNodes; _i3++) {
+ var _n3 = _i3 * numNodes + _j;
+ matrix[_n3] = matrix[_n3] / columnSum[_j] + additionalProb;
+ }
+ }
+ }
-/***/ }),
+ // Compute dominant eigenvector using power method
+ var eigenvector = new Array(numNodes);
+ var temp = new Array(numNodes);
+ var previous;
-/***/ "./node_modules/lodash/isArrayLike.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/isArrayLike.js ***!
- \********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Start with a vector of all 1's
+ // Also, initialize a null vector which will be used as shorthand
+ for (var _i4 = 0; _i4 < numNodes; _i4++) {
+ eigenvector[_i4] = 1;
+ }
+ for (var iter = 0; iter < iterations; iter++) {
+ // Temp array with all 0's
+ for (var _i5 = 0; _i5 < numNodes; _i5++) {
+ temp[_i5] = 0;
+ }
-var isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
- isLength = __webpack_require__(/*! ./isLength */ "./node_modules/lodash/isLength.js");
+ // Multiply matrix with previous result
+ for (var _i6 = 0; _i6 < numNodes; _i6++) {
+ for (var _j2 = 0; _j2 < numNodes; _j2++) {
+ var _n4 = _i6 * numNodes + _j2;
+ temp[_i6] += matrix[_n4] * eigenvector[_j2];
+ }
+ }
+ inPlaceSumNormalize(temp);
+ previous = eigenvector;
+ eigenvector = temp;
+ temp = previous;
+ var diff = 0;
+ // Compute difference (squared module) of both vectors
+ for (var _i7 = 0; _i7 < numNodes; _i7++) {
+ var delta = previous[_i7] - eigenvector[_i7];
+ diff += delta * delta;
+ }
-/**
- * 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);
-}
+ // If difference is less than the desired threshold, stop iterating
+ if (diff < precision) {
+ break;
+ }
+ }
-module.exports = isArrayLike;
+ // Construct result
+ var res = {
+ rank: function rank(node) {
+ node = cy.collection(node)[0];
+ return eigenvector[nodes.indexOf(node)];
+ }
+ };
+ return res;
+ } // pageRank
+}; // elesfn
+var defaults$f = defaults$g({
+ root: null,
+ weight: function weight(edge) {
+ return 1;
+ },
+ directed: false,
+ alpha: 0
+});
+var elesfn$n = {
+ degreeCentralityNormalized: function degreeCentralityNormalized(options) {
+ options = defaults$f(options);
+ var cy = this.cy();
+ var nodes = this.nodes();
+ var numNodes = nodes.length;
+ if (!options.directed) {
+ var degrees = {};
+ var maxDegree = 0;
+ for (var i = 0; i < numNodes; i++) {
+ var node = nodes[i];
-/***/ }),
+ // add current node to the current options object and call degreeCentrality
+ options.root = node;
+ var currDegree = this.degreeCentrality(options);
+ if (maxDegree < currDegree.degree) {
+ maxDegree = currDegree.degree;
+ }
+ degrees[node.id()] = currDegree.degree;
+ }
+ return {
+ degree: function degree(node) {
+ if (maxDegree === 0) {
+ return 0;
+ }
+ if (string(node)) {
+ // from is a selector string
+ node = cy.filter(node);
+ }
+ return degrees[node.id()] / maxDegree;
+ }
+ };
+ } else {
+ var indegrees = {};
+ var outdegrees = {};
+ var maxIndegree = 0;
+ var maxOutdegree = 0;
+ for (var _i = 0; _i < numNodes; _i++) {
+ var _node = nodes[_i];
+ var id = _node.id();
-/***/ "./node_modules/lodash/isArrayLikeObject.js":
-/*!**************************************************!*\
- !*** ./node_modules/lodash/isArrayLikeObject.js ***!
- \**************************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // add current node to the current options object and call degreeCentrality
+ options.root = _node;
+ var _currDegree = this.degreeCentrality(options);
+ if (maxIndegree < _currDegree.indegree) maxIndegree = _currDegree.indegree;
+ if (maxOutdegree < _currDegree.outdegree) maxOutdegree = _currDegree.outdegree;
+ indegrees[id] = _currDegree.indegree;
+ outdegrees[id] = _currDegree.outdegree;
+ }
+ return {
+ indegree: function indegree(node) {
+ if (maxIndegree == 0) {
+ return 0;
+ }
+ if (string(node)) {
+ // from is a selector string
+ node = cy.filter(node);
+ }
+ return indegrees[node.id()] / maxIndegree;
+ },
+ outdegree: function outdegree(node) {
+ if (maxOutdegree === 0) {
+ return 0;
+ }
+ if (string(node)) {
+ // from is a selector string
+ node = cy.filter(node);
+ }
+ return outdegrees[node.id()] / maxOutdegree;
+ }
+ };
+ }
+ },
+ // degreeCentralityNormalized
-var isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+ // Implemented from the algorithm in Opsahl's paper
+ // "Node centrality in weighted networks: Generalizing degree and shortest paths"
+ // check the heading 2 "Degree"
+ degreeCentrality: function degreeCentrality(options) {
+ options = defaults$f(options);
+ var cy = this.cy();
+ var callingEles = this;
+ var _options = options,
+ root = _options.root,
+ weight = _options.weight,
+ directed = _options.directed,
+ alpha = _options.alpha;
+ root = cy.collection(root)[0];
+ if (!directed) {
+ var connEdges = root.connectedEdges().intersection(callingEles);
+ var k = connEdges.length;
+ var s = 0;
-/**
- * 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);
-}
+ // Now, sum edge weights
+ for (var i = 0; i < connEdges.length; i++) {
+ s += weight(connEdges[i]);
+ }
+ return {
+ degree: Math.pow(k, 1 - alpha) * Math.pow(s, alpha)
+ };
+ } else {
+ var edges = root.connectedEdges();
+ var incoming = edges.filter(function (edge) {
+ return edge.target().same(root) && callingEles.has(edge);
+ });
+ var outgoing = edges.filter(function (edge) {
+ return edge.source().same(root) && callingEles.has(edge);
+ });
+ var k_in = incoming.length;
+ var k_out = outgoing.length;
+ var s_in = 0;
+ var s_out = 0;
-module.exports = isArrayLikeObject;
+ // Now, sum incoming edge weights
+ for (var _i2 = 0; _i2 < incoming.length; _i2++) {
+ s_in += weight(incoming[_i2]);
+ }
+ // Now, sum outgoing edge weights
+ for (var _i3 = 0; _i3 < outgoing.length; _i3++) {
+ s_out += weight(outgoing[_i3]);
+ }
+ return {
+ indegree: Math.pow(k_in, 1 - alpha) * Math.pow(s_in, alpha),
+ outdegree: Math.pow(k_out, 1 - alpha) * Math.pow(s_out, alpha)
+ };
+ }
+ } // degreeCentrality
+}; // elesfn
-/***/ }),
+// nice, short mathematical alias
+elesfn$n.dc = elesfn$n.degreeCentrality;
+elesfn$n.dcn = elesfn$n.degreeCentralityNormalised = elesfn$n.degreeCentralityNormalized;
-/***/ "./node_modules/lodash/isBuffer.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/isBuffer.js ***!
- \*****************************************/
-/***/ (function(module, exports, __webpack_require__) {
+var defaults$e = defaults$g({
+ harmonic: true,
+ weight: function weight() {
+ return 1;
+ },
+ directed: false,
+ root: null
+});
+var elesfn$m = {
+ closenessCentralityNormalized: function closenessCentralityNormalized(options) {
+ var _defaults = defaults$e(options),
+ harmonic = _defaults.harmonic,
+ weight = _defaults.weight,
+ directed = _defaults.directed;
+ var cy = this.cy();
+ var closenesses = {};
+ var maxCloseness = 0;
+ var nodes = this.nodes();
+ var fw = this.floydWarshall({
+ weight: weight,
+ directed: directed
+ });
-/* module decorator */ module = __webpack_require__.nmd(module);
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js"),
- stubFalse = __webpack_require__(/*! ./stubFalse */ "./node_modules/lodash/stubFalse.js");
+ // Compute closeness for every node and find the maximum closeness
+ for (var i = 0; i < nodes.length; i++) {
+ var currCloseness = 0;
+ var node_i = nodes[i];
+ for (var j = 0; j < nodes.length; j++) {
+ if (i !== j) {
+ var d = fw.distance(node_i, nodes[j]);
+ if (harmonic) {
+ currCloseness += 1 / d;
+ } else {
+ currCloseness += d;
+ }
+ }
+ }
+ if (!harmonic) {
+ currCloseness = 1 / currCloseness;
+ }
+ if (maxCloseness < currCloseness) {
+ maxCloseness = currCloseness;
+ }
+ closenesses[node_i.id()] = currCloseness;
+ }
+ return {
+ closeness: function closeness(node) {
+ if (maxCloseness == 0) {
+ return 0;
+ }
+ if (string(node)) {
+ // from is a selector string
+ node = cy.filter(node)[0].id();
+ } else {
+ // from is a node
+ node = node.id();
+ }
+ return closenesses[node] / maxCloseness;
+ }
+ };
+ },
+ // Implemented from pseudocode from wikipedia
+ closenessCentrality: function closenessCentrality(options) {
+ var _defaults2 = defaults$e(options),
+ root = _defaults2.root,
+ weight = _defaults2.weight,
+ directed = _defaults2.directed,
+ harmonic = _defaults2.harmonic;
+ root = this.filter(root)[0];
-/** Detect free variable `exports`. */
-var freeExports = true && exports && !exports.nodeType && exports;
+ // we need distance from this node to every other node
+ var dijkstra = this.dijkstra({
+ root: root,
+ weight: weight,
+ directed: directed
+ });
+ var totalDistance = 0;
+ var nodes = this.nodes();
+ for (var i = 0; i < nodes.length; i++) {
+ var n = nodes[i];
+ if (!n.same(root)) {
+ var d = dijkstra.distanceTo(n);
+ if (harmonic) {
+ totalDistance += 1 / d;
+ } else {
+ totalDistance += d;
+ }
+ }
+ }
+ return harmonic ? totalDistance : 1 / totalDistance;
+ } // closenessCentrality
+}; // elesfn
-/** Detect free variable `module`. */
-var freeModule = freeExports && "object" == 'object' && module && !module.nodeType && module;
+// nice, short mathematical alias
+elesfn$m.cc = elesfn$m.closenessCentrality;
+elesfn$m.ccn = elesfn$m.closenessCentralityNormalised = elesfn$m.closenessCentralityNormalized;
-/** Detect the popular CommonJS extension `module.exports`. */
-var moduleExports = freeModule && freeModule.exports === freeExports;
+var defaults$d = defaults$g({
+ weight: null,
+ directed: false
+});
+var elesfn$l = {
+ // Implemented from the algorithm in the paper "On Variants of Shortest-Path Betweenness Centrality and their Generic Computation" by Ulrik Brandes
+ betweennessCentrality: function betweennessCentrality(options) {
+ var _defaults = defaults$d(options),
+ directed = _defaults.directed,
+ weight = _defaults.weight;
+ var weighted = weight != null;
+ var cy = this.cy();
-/** Built-in value references. */
-var Buffer = moduleExports ? root.Buffer : undefined;
+ // starting
+ var V = this.nodes();
+ var A = {};
+ var _C = {};
+ var max = 0;
+ var C = {
+ set: function set(key, val) {
+ _C[key] = val;
+ if (val > max) {
+ max = val;
+ }
+ },
+ get: function get(key) {
+ return _C[key];
+ }
+ };
-/* Built-in method references for those with the same name as other `lodash` methods. */
-var nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;
+ // A contains the neighborhoods of every node
+ for (var i = 0; i < V.length; i++) {
+ var v = V[i];
+ var vid = v.id();
+ if (directed) {
+ A[vid] = v.outgoers().nodes(); // get outgoers of every node
+ } else {
+ A[vid] = v.openNeighborhood().nodes(); // get neighbors of every node
+ }
-/**
- * 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;
+ C.set(vid, 0);
+ }
+ var _loop = function _loop(s) {
+ var sid = V[s].id();
+ var S = []; // stack
+ var P = {};
+ var g = {};
+ var d = {};
+ var Q = new heap(function (a, b) {
+ return d[a] - d[b];
+ }); // queue
-module.exports = isBuffer;
+ // init dictionaries
+ for (var _i = 0; _i < V.length; _i++) {
+ var _vid = V[_i].id();
+ P[_vid] = [];
+ g[_vid] = 0;
+ d[_vid] = Infinity;
+ }
+ g[sid] = 1; // sigma
+ d[sid] = 0; // distance to s
+ Q.push(sid);
+ while (!Q.empty()) {
+ var _v = Q.pop();
+ S.push(_v);
+ if (weighted) {
+ for (var j = 0; j < A[_v].length; j++) {
+ var w = A[_v][j];
+ var vEle = cy.getElementById(_v);
+ var edge = void 0;
+ if (vEle.edgesTo(w).length > 0) {
+ edge = vEle.edgesTo(w)[0];
+ } else {
+ edge = w.edgesTo(vEle)[0];
+ }
+ var edgeWeight = weight(edge);
+ w = w.id();
+ if (d[w] > d[_v] + edgeWeight) {
+ d[w] = d[_v] + edgeWeight;
+ if (Q.nodes.indexOf(w) < 0) {
+ //if w is not in Q
+ Q.push(w);
+ } else {
+ // update position if w is in Q
+ Q.updateItem(w);
+ }
+ g[w] = 0;
+ P[w] = [];
+ }
+ if (d[w] == d[_v] + edgeWeight) {
+ g[w] = g[w] + g[_v];
+ P[w].push(_v);
+ }
+ }
+ } else {
+ for (var _j = 0; _j < A[_v].length; _j++) {
+ var _w = A[_v][_j].id();
+ if (d[_w] == Infinity) {
+ Q.push(_w);
+ d[_w] = d[_v] + 1;
+ }
+ if (d[_w] == d[_v] + 1) {
+ g[_w] = g[_w] + g[_v];
+ P[_w].push(_v);
+ }
+ }
+ }
+ }
+ var e = {};
+ for (var _i2 = 0; _i2 < V.length; _i2++) {
+ e[V[_i2].id()] = 0;
+ }
+ while (S.length > 0) {
+ var _w2 = S.pop();
+ for (var _j2 = 0; _j2 < P[_w2].length; _j2++) {
+ var _v2 = P[_w2][_j2];
+ e[_v2] = e[_v2] + g[_v2] / g[_w2] * (1 + e[_w2]);
+ }
+ if (_w2 != V[s].id()) {
+ C.set(_w2, C.get(_w2) + e[_w2]);
+ }
+ }
+ };
+ for (var s = 0; s < V.length; s++) {
+ _loop(s);
+ }
+ var ret = {
+ betweenness: function betweenness(node) {
+ var id = cy.collection(node).id();
+ return C.get(id);
+ },
+ betweennessNormalized: function betweennessNormalized(node) {
+ if (max == 0) {
+ return 0;
+ }
+ var id = cy.collection(node).id();
+ return C.get(id) / max;
+ }
+ };
-/***/ }),
+ // alias
+ ret.betweennessNormalised = ret.betweennessNormalized;
+ return ret;
+ } // betweennessCentrality
+}; // elesfn
-/***/ "./node_modules/lodash/isEmpty.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/isEmpty.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+// nice, short mathematical alias
+elesfn$l.bc = elesfn$l.betweennessCentrality;
-var baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
- getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- isArguments = __webpack_require__(/*! ./isArguments */ "./node_modules/lodash/isArguments.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isPrototype = __webpack_require__(/*! ./_isPrototype */ "./node_modules/lodash/_isPrototype.js"),
- isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
+// Implemented by Zoe Xi @zoexi for GSOC 2016
-/** `Object#toString` result references. */
-var mapTag = '[object Map]',
- setTag = '[object Set]';
+/* eslint-disable no-unused-vars */
+var defaults$c = defaults$g({
+ expandFactor: 2,
+ // affects time of computation and cluster granularity to some extent: M * M
+ inflateFactor: 2,
+ // affects cluster granularity (the greater the value, the more clusters): M(i,j) / E(j)
+ multFactor: 1,
+ // optional self loops for each node. Use a neutral value to improve cluster computations.
+ maxIterations: 20,
+ // maximum number of iterations of the MCL algorithm in a single run
+ attributes: [
+ // attributes/features used to group nodes, ie. similarity values between nodes
+ function (edge) {
+ return 1;
+ }]
+});
+/* eslint-enable */
-/** Used for built-in method references. */
-var objectProto = Object.prototype;
+var setOptions$3 = function setOptions(options) {
+ return defaults$c(options);
+};
+/* eslint-enable */
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+var getSimilarity$1 = function getSimilarity(edge, attributes) {
+ var total = 0;
+ for (var i = 0; i < attributes.length; i++) {
+ total += attributes[i](edge);
+ }
+ return total;
+};
+var addLoops = function addLoops(M, n, val) {
+ for (var i = 0; i < n; i++) {
+ M[i * n + i] = val;
+ }
+};
+var normalize = function normalize(M, n) {
+ var sum;
+ for (var col = 0; col < n; col++) {
+ sum = 0;
+ for (var row = 0; row < n; row++) {
+ sum += M[row * n + col];
+ }
+ for (var _row = 0; _row < n; _row++) {
+ M[_row * n + col] = M[_row * n + col] / sum;
+ }
+ }
+};
-/**
- * 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;
+// TODO: blocked matrix multiplication?
+var mmult = function mmult(A, B, n) {
+ var C = new Array(n * n);
+ for (var i = 0; i < n; i++) {
+ for (var j = 0; j < n; j++) {
+ C[i * n + j] = 0;
+ }
+ for (var k = 0; k < n; k++) {
+ for (var _j = 0; _j < n; _j++) {
+ C[i * n + _j] += A[i * n + k] * B[k * n + _j];
+ }
+ }
}
- if (isArrayLike(value) &&
- (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
- isBuffer(value) || isTypedArray(value) || isArguments(value))) {
- return !value.length;
+ return C;
+};
+var expand = function expand(M, n, expandFactor /** power **/) {
+ var _M = M.slice(0);
+ for (var p = 1; p < expandFactor; p++) {
+ M = mmult(M, _M, n);
}
- var tag = getTag(value);
- if (tag == mapTag || tag == setTag) {
- return !value.size;
+ return M;
+};
+var inflate = function inflate(M, n, inflateFactor /** r **/) {
+ var _M = new Array(n * n);
+
+ // M(i,j) ^ inflatePower
+ for (var i = 0; i < n * n; i++) {
+ _M[i] = Math.pow(M[i], inflateFactor);
}
- if (isPrototype(value)) {
- return !baseKeys(value).length;
+ normalize(_M, n);
+ return _M;
+};
+var hasConverged = function hasConverged(M, _M, n2, roundFactor) {
+ // Check that both matrices have the same elements (i,j)
+ for (var i = 0; i < n2; i++) {
+ var v1 = Math.round(M[i] * Math.pow(10, roundFactor)) / Math.pow(10, roundFactor); // truncate to 'roundFactor' decimal places
+ var v2 = Math.round(_M[i] * Math.pow(10, roundFactor)) / Math.pow(10, roundFactor);
+ if (v1 !== v2) {
+ return false;
+ }
}
- for (var key in value) {
- if (hasOwnProperty.call(value, key)) {
+ return true;
+};
+var assign$2 = function assign(M, n, nodes, cy) {
+ var clusters = [];
+ for (var i = 0; i < n; i++) {
+ var cluster = [];
+ for (var j = 0; j < n; j++) {
+ // Row-wise attractors and elements that they attract belong in same cluster
+ if (Math.round(M[i * n + j] * 1000) / 1000 > 0) {
+ cluster.push(nodes[j]);
+ }
+ }
+ if (cluster.length !== 0) {
+ clusters.push(cy.collection(cluster));
+ }
+ }
+ return clusters;
+};
+var isDuplicate = function isDuplicate(c1, c2) {
+ for (var i = 0; i < c1.length; i++) {
+ if (!c2[i] || c1[i].id() !== c2[i].id()) {
return false;
}
}
return true;
-}
-
-module.exports = isEmpty;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/isFunction.js":
-/*!*******************************************!*\
- !*** ./node_modules/lodash/isFunction.js ***!
- \*******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js");
-
-/** `Object#toString` result references. */
-var asyncTag = '[object AsyncFunction]',
- funcTag = '[object Function]',
- genTag = '[object GeneratorFunction]',
- proxyTag = '[object Proxy]';
-
-/**
- * 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;
+};
+var removeDuplicates = function removeDuplicates(clusters) {
+ for (var i = 0; i < clusters.length; i++) {
+ for (var j = 0; j < clusters.length; j++) {
+ if (i != j && isDuplicate(clusters[i], clusters[j])) {
+ clusters.splice(j, 1);
+ }
+ }
}
- // 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;
-}
-
-module.exports = isFunction;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/isLength.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/isLength.js ***!
- \*****************************************/
-/***/ (function(module) {
-
-/** Used as references for various `Number` constants. */
-var MAX_SAFE_INTEGER = 9007199254740991;
-
-/**
- * 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;
-}
-
-module.exports = isLength;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/isMap.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/isMap.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-var baseIsMap = __webpack_require__(/*! ./_baseIsMap */ "./node_modules/lodash/_baseIsMap.js"),
- baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
- nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
-
-/* Node.js helper references. */
-var nodeIsMap = nodeUtil && nodeUtil.isMap;
-
-/**
- * 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;
-
-module.exports = isMap;
-
-
-/***/ }),
-
-/***/ "./node_modules/lodash/isObject.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/isObject.js ***!
- \*****************************************/
-/***/ (function(module) {
-
-/**
- * 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');
-}
+ return clusters;
+};
+var markovClustering = function markovClustering(options) {
+ var nodes = this.nodes();
+ var edges = this.edges();
+ var cy = this.cy();
-module.exports = isObject;
+ // Set parameters of algorithm:
+ var opts = setOptions$3(options);
+ // Map each node to its position in node array
+ var id2position = {};
+ for (var i = 0; i < nodes.length; i++) {
+ id2position[nodes[i].id()] = i;
+ }
-/***/ }),
+ // Generate stochastic matrix M from input graph G (should be symmetric/undirected)
+ var n = nodes.length,
+ n2 = n * n;
+ var M = new Array(n2),
+ _M;
+ for (var _i = 0; _i < n2; _i++) {
+ M[_i] = 0;
+ }
+ for (var e = 0; e < edges.length; e++) {
+ var edge = edges[e];
+ var _i2 = id2position[edge.source().id()];
+ var j = id2position[edge.target().id()];
+ var sim = getSimilarity$1(edge, opts.attributes);
+ M[_i2 * n + j] += sim; // G should be symmetric and undirected
+ M[j * n + _i2] += sim;
+ }
-/***/ "./node_modules/lodash/isObjectLike.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/isObjectLike.js ***!
- \*********************************************/
-/***/ (function(module) {
+ // Begin Markov cluster algorithm
-/**
- * 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';
-}
+ // Step 1: Add self loops to each node, ie. add multFactor to matrix diagonal
+ addLoops(M, n, opts.multFactor);
-module.exports = isObjectLike;
+ // Step 2: M = normalize( M );
+ normalize(M, n);
+ var isStillMoving = true;
+ var iterations = 0;
+ while (isStillMoving && iterations < opts.maxIterations) {
+ isStillMoving = false;
+ // Step 3:
+ _M = expand(M, n, opts.expandFactor);
-/***/ }),
+ // Step 4:
+ M = inflate(_M, n, opts.inflateFactor);
-/***/ "./node_modules/lodash/isPlainObject.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/isPlainObject.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Step 5: check to see if ~steady state has been reached
+ if (!hasConverged(M, _M, n2, 4)) {
+ isStillMoving = true;
+ }
+ iterations++;
+ }
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+ // Build clusters from matrix
+ var clusters = assign$2(M, n, nodes, cy);
-/** `Object#toString` result references. */
-var objectTag = '[object Object]';
+ // Remove duplicate clusters due to symmetry of graph and M matrix
+ clusters = removeDuplicates(clusters);
+ return clusters;
+};
+var markovClustering$1 = {
+ markovClustering: markovClustering,
+ mcl: markovClustering
+};
-/** Used for built-in method references. */
-var funcProto = Function.prototype,
- objectProto = Object.prototype;
+// Common distance metrics for clustering algorithms
+var identity = function identity(x) {
+ return x;
+};
+var absDiff = function absDiff(p, q) {
+ return Math.abs(q - p);
+};
+var addAbsDiff = function addAbsDiff(total, p, q) {
+ return total + absDiff(p, q);
+};
+var addSquaredDiff = function addSquaredDiff(total, p, q) {
+ return total + Math.pow(q - p, 2);
+};
+var sqrt = function sqrt(x) {
+ return Math.sqrt(x);
+};
+var maxAbsDiff = function maxAbsDiff(currentMax, p, q) {
+ return Math.max(currentMax, absDiff(p, q));
+};
+var getDistance = function getDistance(length, getP, getQ, init, visit) {
+ var post = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : identity;
+ var ret = init;
+ var p, q;
+ for (var dim = 0; dim < length; dim++) {
+ p = getP(dim);
+ q = getQ(dim);
+ ret = visit(ret, p, q);
+ }
+ return post(ret);
+};
+var distances = {
+ euclidean: function euclidean(length, getP, getQ) {
+ if (length >= 2) {
+ return getDistance(length, getP, getQ, 0, addSquaredDiff, sqrt);
+ } else {
+ // for single attr case, more efficient to avoid sqrt
+ return getDistance(length, getP, getQ, 0, addAbsDiff);
+ }
+ },
+ squaredEuclidean: function squaredEuclidean(length, getP, getQ) {
+ return getDistance(length, getP, getQ, 0, addSquaredDiff);
+ },
+ manhattan: function manhattan(length, getP, getQ) {
+ return getDistance(length, getP, getQ, 0, addAbsDiff);
+ },
+ max: function max(length, getP, getQ) {
+ return getDistance(length, getP, getQ, -Infinity, maxAbsDiff);
+ }
+};
-/** Used to resolve the decompiled source of functions. */
-var funcToString = funcProto.toString;
+// in case the user accidentally doesn't use camel case
+distances['squared-euclidean'] = distances['squaredEuclidean'];
+distances['squaredeuclidean'] = distances['squaredEuclidean'];
+function clusteringDistance (method, length, getP, getQ, nodeP, nodeQ) {
+ var impl;
+ if (fn$6(method)) {
+ impl = method;
+ } else {
+ impl = distances[method] || distances.euclidean;
+ }
+ if (length === 0 && fn$6(method)) {
+ return impl(nodeP, nodeQ);
+ } else {
+ return impl(length, getP, getQ, nodeP, nodeQ);
+ }
+}
-/** Used to check objects for own properties. */
-var hasOwnProperty = objectProto.hasOwnProperty;
+var defaults$b = defaults$g({
+ k: 2,
+ m: 2,
+ sensitivityThreshold: 0.0001,
+ distance: 'euclidean',
+ maxIterations: 10,
+ attributes: [],
+ testMode: false,
+ testCentroids: null
+});
+var setOptions$2 = function setOptions(options) {
+ return defaults$b(options);
+};
-/** Used to infer the `Object` constructor. */
-var objectCtorString = funcToString.call(Object);
+var getDist = function getDist(type, node, centroid, attributes, mode) {
+ var noNodeP = mode !== 'kMedoids';
+ var getP = noNodeP ? function (i) {
+ return centroid[i];
+ } : function (i) {
+ return attributes[i](centroid);
+ };
+ var getQ = function getQ(i) {
+ return attributes[i](node);
+ };
+ var nodeP = centroid;
+ var nodeQ = node;
+ return clusteringDistance(type, attributes.length, getP, getQ, nodeP, nodeQ);
+};
+var randomCentroids = function randomCentroids(nodes, k, attributes) {
+ var ndim = attributes.length;
+ var min = new Array(ndim);
+ var max = new Array(ndim);
+ var centroids = new Array(k);
+ var centroid = null;
-/**
- * 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;
+ // Find min, max values for each attribute dimension
+ for (var i = 0; i < ndim; i++) {
+ min[i] = nodes.min(attributes[i]).value;
+ max[i] = nodes.max(attributes[i]).value;
}
- var proto = getPrototype(value);
- if (proto === null) {
- return true;
+
+ // Build k centroids, each represented as an n-dim feature vector
+ for (var c = 0; c < k; c++) {
+ centroid = [];
+ for (var _i = 0; _i < ndim; _i++) {
+ centroid[_i] = Math.random() * (max[_i] - min[_i]) + min[_i]; // random initial value
+ }
+
+ centroids[c] = centroid;
}
- var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
- return typeof Ctor == 'function' && Ctor instanceof Ctor &&
- funcToString.call(Ctor) == objectCtorString;
-}
+ return centroids;
+};
+var classify = function classify(node, centroids, distance, attributes, type) {
+ var min = Infinity;
+ var index = 0;
+ for (var i = 0; i < centroids.length; i++) {
+ var dist = getDist(distance, node, centroids[i], attributes, type);
+ if (dist < min) {
+ min = dist;
+ index = i;
+ }
+ }
+ return index;
+};
+var buildCluster = function buildCluster(centroid, nodes, assignment) {
+ var cluster = [];
+ var node = null;
+ for (var n = 0; n < nodes.length; n++) {
+ node = nodes[n];
+ if (assignment[node.id()] === centroid) {
+ //console.log("Node " + node.id() + " is associated with medoid #: " + m);
+ cluster.push(node);
+ }
+ }
+ return cluster;
+};
+var haveValuesConverged = function haveValuesConverged(v1, v2, sensitivityThreshold) {
+ return Math.abs(v2 - v1) <= sensitivityThreshold;
+};
+var haveMatricesConverged = function haveMatricesConverged(v1, v2, sensitivityThreshold) {
+ for (var i = 0; i < v1.length; i++) {
+ for (var j = 0; j < v1[i].length; j++) {
+ var diff = Math.abs(v1[i][j] - v2[i][j]);
+ if (diff > sensitivityThreshold) {
+ return false;
+ }
+ }
+ }
+ return true;
+};
+var seenBefore = function seenBefore(node, medoids, n) {
+ for (var i = 0; i < n; i++) {
+ if (node === medoids[i]) return true;
+ }
+ return false;
+};
+var randomMedoids = function randomMedoids(nodes, k) {
+ var medoids = new Array(k);
-module.exports = isPlainObject;
+ // For small data sets, the probability of medoid conflict is greater,
+ // so we need to check to see if we've already seen or chose this node before.
+ if (nodes.length < 50) {
+ // Randomly select k medoids from the n nodes
+ for (var i = 0; i < k; i++) {
+ var node = nodes[Math.floor(Math.random() * nodes.length)];
+ // If we've already chosen this node to be a medoid, don't choose it again (for small data sets).
+ // Instead choose a different random node.
+ while (seenBefore(node, medoids, i)) {
+ node = nodes[Math.floor(Math.random() * nodes.length)];
+ }
+ medoids[i] = node;
+ }
+ } else {
+ // Relatively large data set, so pretty safe to not check and just select random nodes
+ for (var _i2 = 0; _i2 < k; _i2++) {
+ medoids[_i2] = nodes[Math.floor(Math.random() * nodes.length)];
+ }
+ }
+ return medoids;
+};
+var findCost = function findCost(potentialNewMedoid, cluster, attributes) {
+ var cost = 0;
+ for (var n = 0; n < cluster.length; n++) {
+ cost += getDist('manhattan', cluster[n], potentialNewMedoid, attributes, 'kMedoids');
+ }
+ return cost;
+};
+var kMeans = function kMeans(options) {
+ var cy = this.cy();
+ var nodes = this.nodes();
+ var node = null;
-/***/ }),
+ // Set parameters of algorithm: # of clusters, distance metric, etc.
+ var opts = setOptions$2(options);
-/***/ "./node_modules/lodash/isSet.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/isSet.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Begin k-means algorithm
+ var clusters = new Array(opts.k);
+ var assignment = {};
+ var centroids;
-var baseIsSet = __webpack_require__(/*! ./_baseIsSet */ "./node_modules/lodash/_baseIsSet.js"),
- baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
- nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
+ // Step 1: Initialize centroid positions
+ if (opts.testMode) {
+ if (typeof opts.testCentroids === 'number') {
+ // TODO: implement a seeded random number generator.
+ opts.testCentroids;
+ centroids = randomCentroids(nodes, opts.k, opts.attributes);
+ } else if (_typeof(opts.testCentroids) === 'object') {
+ centroids = opts.testCentroids;
+ } else {
+ centroids = randomCentroids(nodes, opts.k, opts.attributes);
+ }
+ } else {
+ centroids = randomCentroids(nodes, opts.k, opts.attributes);
+ }
+ var isStillMoving = true;
+ var iterations = 0;
+ while (isStillMoving && iterations < opts.maxIterations) {
+ // Step 2: Assign nodes to the nearest centroid
+ for (var n = 0; n < nodes.length; n++) {
+ node = nodes[n];
+ // Determine which cluster this node belongs to: node id => cluster #
+ assignment[node.id()] = classify(node, centroids, opts.distance, opts.attributes, 'kMeans');
+ }
-/* Node.js helper references. */
-var nodeIsSet = nodeUtil && nodeUtil.isSet;
+ // Step 3: For each of the k clusters, update its centroid
+ isStillMoving = false;
+ for (var c = 0; c < opts.k; c++) {
+ // Get all nodes that belong to this cluster
+ var cluster = buildCluster(c, nodes, assignment);
+ if (cluster.length === 0) {
+ // If cluster is empty, break out early & move to next cluster
+ continue;
+ }
-/**
- * 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;
+ // Update centroids by calculating avg of all nodes within the cluster.
+ var ndim = opts.attributes.length;
+ var centroid = centroids[c]; // [ dim_1, dim_2, dim_3, ... , dim_n ]
+ var newCentroid = new Array(ndim);
+ var sum = new Array(ndim);
+ for (var d = 0; d < ndim; d++) {
+ sum[d] = 0.0;
+ for (var i = 0; i < cluster.length; i++) {
+ node = cluster[i];
+ sum[d] += opts.attributes[d](node);
+ }
+ newCentroid[d] = sum[d] / cluster.length;
-module.exports = isSet;
+ // Check to see if algorithm has converged, i.e. when centroids no longer change
+ if (!haveValuesConverged(newCentroid[d], centroid[d], opts.sensitivityThreshold)) {
+ isStillMoving = true;
+ }
+ }
+ centroids[c] = newCentroid;
+ clusters[c] = cy.collection(cluster);
+ }
+ iterations++;
+ }
+ return clusters;
+};
+var kMedoids = function kMedoids(options) {
+ var cy = this.cy();
+ var nodes = this.nodes();
+ var node = null;
+ var opts = setOptions$2(options);
+ // Begin k-medoids algorithm
+ var clusters = new Array(opts.k);
+ var medoids;
+ var assignment = {};
+ var curCost;
+ var minCosts = new Array(opts.k); // minimum cost configuration for each cluster
-/***/ }),
+ // Step 1: Initialize k medoids
+ if (opts.testMode) {
+ if (typeof opts.testCentroids === 'number') ; else if (_typeof(opts.testCentroids) === 'object') {
+ medoids = opts.testCentroids;
+ } else {
+ medoids = randomMedoids(nodes, opts.k);
+ }
+ } else {
+ medoids = randomMedoids(nodes, opts.k);
+ }
+ var isStillMoving = true;
+ var iterations = 0;
+ while (isStillMoving && iterations < opts.maxIterations) {
+ // Step 2: Assign nodes to the nearest medoid
+ for (var n = 0; n < nodes.length; n++) {
+ node = nodes[n];
+ // Determine which cluster this node belongs to: node id => cluster #
+ assignment[node.id()] = classify(node, medoids, opts.distance, opts.attributes, 'kMedoids');
+ }
+ isStillMoving = false;
+ // Step 3: For each medoid m, and for each node associated with mediod m,
+ // select the node with the lowest configuration cost as new medoid.
+ for (var m = 0; m < medoids.length; m++) {
+ // Get all nodes that belong to this medoid
+ var cluster = buildCluster(m, nodes, assignment);
+ if (cluster.length === 0) {
+ // If cluster is empty, break out early & move to next cluster
+ continue;
+ }
+ minCosts[m] = findCost(medoids[m], cluster, opts.attributes); // original cost
+
+ // Select different medoid if its configuration has the lowest cost
+ for (var _n = 0; _n < cluster.length; _n++) {
+ curCost = findCost(cluster[_n], cluster, opts.attributes);
+ if (curCost < minCosts[m]) {
+ minCosts[m] = curCost;
+ medoids[m] = cluster[_n];
+ isStillMoving = true;
+ }
+ }
+ clusters[m] = cy.collection(cluster);
+ }
+ iterations++;
+ }
+ return clusters;
+};
+var updateCentroids = function updateCentroids(centroids, nodes, U, weight, opts) {
+ var numerator, denominator;
+ for (var n = 0; n < nodes.length; n++) {
+ for (var c = 0; c < centroids.length; c++) {
+ weight[n][c] = Math.pow(U[n][c], opts.m);
+ }
+ }
+ for (var _c = 0; _c < centroids.length; _c++) {
+ for (var dim = 0; dim < opts.attributes.length; dim++) {
+ numerator = 0;
+ denominator = 0;
+ for (var _n2 = 0; _n2 < nodes.length; _n2++) {
+ numerator += weight[_n2][_c] * opts.attributes[dim](nodes[_n2]);
+ denominator += weight[_n2][_c];
+ }
+ centroids[_c][dim] = numerator / denominator;
+ }
+ }
+};
+var updateMembership = function updateMembership(U, _U, centroids, nodes, opts) {
+ // Save previous step
+ for (var i = 0; i < U.length; i++) {
+ _U[i] = U[i].slice();
+ }
+ var sum, numerator, denominator;
+ var pow = 2 / (opts.m - 1);
+ for (var c = 0; c < centroids.length; c++) {
+ for (var n = 0; n < nodes.length; n++) {
+ sum = 0;
+ for (var k = 0; k < centroids.length; k++) {
+ // against all other centroids
+ numerator = getDist(opts.distance, nodes[n], centroids[c], opts.attributes, 'cmeans');
+ denominator = getDist(opts.distance, nodes[n], centroids[k], opts.attributes, 'cmeans');
+ sum += Math.pow(numerator / denominator, pow);
+ }
+ U[n][c] = 1 / sum;
+ }
+ }
+};
+var assign$1 = function assign(nodes, U, opts, cy) {
+ var clusters = new Array(opts.k);
+ for (var c = 0; c < clusters.length; c++) {
+ clusters[c] = [];
+ }
+ var max;
+ var index;
+ for (var n = 0; n < U.length; n++) {
+ // for each node (U is N x C matrix)
+ max = -Infinity;
+ index = -1;
+ // Determine which cluster the node is most likely to belong in
+ for (var _c2 = 0; _c2 < U[0].length; _c2++) {
+ if (U[n][_c2] > max) {
+ max = U[n][_c2];
+ index = _c2;
+ }
+ }
+ clusters[index].push(nodes[n]);
+ }
-/***/ "./node_modules/lodash/isString.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/isString.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Turn every array into a collection of nodes
+ for (var _c3 = 0; _c3 < clusters.length; _c3++) {
+ clusters[_c3] = cy.collection(clusters[_c3]);
+ }
+ return clusters;
+};
+var fuzzyCMeans = function fuzzyCMeans(options) {
+ var cy = this.cy();
+ var nodes = this.nodes();
+ var opts = setOptions$2(options);
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+ // Begin fuzzy c-means algorithm
+ var clusters;
+ var centroids;
+ var U;
+ var _U;
+ var weight;
-/** `Object#toString` result references. */
-var stringTag = '[object String]';
+ // Step 1: Initialize letiables.
+ _U = new Array(nodes.length);
+ for (var i = 0; i < nodes.length; i++) {
+ // N x C matrix
+ _U[i] = new Array(opts.k);
+ }
+ U = new Array(nodes.length);
+ for (var _i3 = 0; _i3 < nodes.length; _i3++) {
+ // N x C matrix
+ U[_i3] = new Array(opts.k);
+ }
+ for (var _i4 = 0; _i4 < nodes.length; _i4++) {
+ var total = 0;
+ for (var j = 0; j < opts.k; j++) {
+ U[_i4][j] = Math.random();
+ total += U[_i4][j];
+ }
+ for (var _j = 0; _j < opts.k; _j++) {
+ U[_i4][_j] = U[_i4][_j] / total;
+ }
+ }
+ centroids = new Array(opts.k);
+ for (var _i5 = 0; _i5 < opts.k; _i5++) {
+ centroids[_i5] = new Array(opts.attributes.length);
+ }
+ weight = new Array(nodes.length);
+ for (var _i6 = 0; _i6 < nodes.length; _i6++) {
+ // N x C matrix
+ weight[_i6] = new Array(opts.k);
+ }
+ // end init FCM
-/**
- * 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);
-}
+ var isStillMoving = true;
+ var iterations = 0;
+ while (isStillMoving && iterations < opts.maxIterations) {
+ isStillMoving = false;
-module.exports = isString;
+ // Step 2: Calculate the centroids for each step.
+ updateCentroids(centroids, nodes, U, weight, opts);
+ // Step 3: Update the partition matrix U.
+ updateMembership(U, _U, centroids, nodes, opts);
-/***/ }),
+ // Step 4: Check for convergence.
+ if (!haveMatricesConverged(U, _U, opts.sensitivityThreshold)) {
+ isStillMoving = true;
+ }
+ iterations++;
+ }
-/***/ "./node_modules/lodash/isSymbol.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/isSymbol.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Assign nodes to clusters with highest probability.
+ clusters = assign$1(nodes, U, opts, cy);
+ return {
+ clusters: clusters,
+ degreeOfMembership: U
+ };
+};
+var kClustering = {
+ kMeans: kMeans,
+ kMedoids: kMedoids,
+ fuzzyCMeans: fuzzyCMeans,
+ fcm: fuzzyCMeans
+};
-var baseGetTag = __webpack_require__(/*! ./_baseGetTag */ "./node_modules/lodash/_baseGetTag.js"),
- isObjectLike = __webpack_require__(/*! ./isObjectLike */ "./node_modules/lodash/isObjectLike.js");
+// Implemented by Zoe Xi @zoexi for GSOC 2016
+var defaults$a = defaults$g({
+ distance: 'euclidean',
+ // distance metric to compare nodes
+ linkage: 'min',
+ // linkage criterion : how to determine the distance between clusters of nodes
+ mode: 'threshold',
+ // mode:'threshold' => clusters must be threshold distance apart
+ threshold: Infinity,
+ // the distance threshold
+ // mode:'dendrogram' => the nodes are organised as leaves in a tree (siblings are close), merging makes clusters
+ addDendrogram: false,
+ // whether to add the dendrogram to the graph for viz
+ dendrogramDepth: 0,
+ // depth at which dendrogram branches are merged into the returned clusters
+ attributes: [] // array of attr functions
+});
-/** `Object#toString` result references. */
-var symbolTag = '[object Symbol]';
+var linkageAliases = {
+ 'single': 'min',
+ 'complete': 'max'
+};
+var setOptions$1 = function setOptions(options) {
+ var opts = defaults$a(options);
+ var preferredAlias = linkageAliases[opts.linkage];
+ if (preferredAlias != null) {
+ opts.linkage = preferredAlias;
+ }
+ return opts;
+};
+var mergeClosest = function mergeClosest(clusters, index, dists, mins, opts) {
+ // Find two closest clusters from cached mins
+ var minKey = 0;
+ var min = Infinity;
+ var dist;
+ var attrs = opts.attributes;
+ var getDist = function getDist(n1, n2) {
+ return clusteringDistance(opts.distance, attrs.length, function (i) {
+ return attrs[i](n1);
+ }, function (i) {
+ return attrs[i](n2);
+ }, n1, n2);
+ };
+ for (var i = 0; i < clusters.length; i++) {
+ var key = clusters[i].key;
+ var _dist = dists[key][mins[key]];
+ if (_dist < min) {
+ minKey = key;
+ min = _dist;
+ }
+ }
+ if (opts.mode === 'threshold' && min >= opts.threshold || opts.mode === 'dendrogram' && clusters.length === 1) {
+ return false;
+ }
+ var c1 = index[minKey];
+ var c2 = index[mins[minKey]];
+ var merged;
-/**
- * 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);
-}
+ // Merge two closest clusters
+ if (opts.mode === 'dendrogram') {
+ merged = {
+ left: c1,
+ right: c2,
+ key: c1.key
+ };
+ } else {
+ merged = {
+ value: c1.value.concat(c2.value),
+ key: c1.key
+ };
+ }
+ clusters[c1.index] = merged;
+ clusters.splice(c2.index, 1);
+ index[c1.key] = merged;
-module.exports = isSymbol;
+ // Update distances with new merged cluster
+ for (var _i = 0; _i < clusters.length; _i++) {
+ var cur = clusters[_i];
+ if (c1.key === cur.key) {
+ dist = Infinity;
+ } else if (opts.linkage === 'min') {
+ dist = dists[c1.key][cur.key];
+ if (dists[c1.key][cur.key] > dists[c2.key][cur.key]) {
+ dist = dists[c2.key][cur.key];
+ }
+ } else if (opts.linkage === 'max') {
+ dist = dists[c1.key][cur.key];
+ if (dists[c1.key][cur.key] < dists[c2.key][cur.key]) {
+ dist = dists[c2.key][cur.key];
+ }
+ } else if (opts.linkage === 'mean') {
+ dist = (dists[c1.key][cur.key] * c1.size + dists[c2.key][cur.key] * c2.size) / (c1.size + c2.size);
+ } else {
+ if (opts.mode === 'dendrogram') dist = getDist(cur.value, c1.value);else dist = getDist(cur.value[0], c1.value[0]);
+ }
+ dists[c1.key][cur.key] = dists[cur.key][c1.key] = dist; // distance matrix is symmetric
+ }
+ // Update cached mins
+ for (var _i2 = 0; _i2 < clusters.length; _i2++) {
+ var key1 = clusters[_i2].key;
+ if (mins[key1] === c1.key || mins[key1] === c2.key) {
+ var _min = key1;
+ for (var j = 0; j < clusters.length; j++) {
+ var key2 = clusters[j].key;
+ if (dists[key1][key2] < dists[key1][_min]) {
+ _min = key2;
+ }
+ }
+ mins[key1] = _min;
+ }
+ clusters[_i2].index = _i2;
+ }
-/***/ }),
+ // Clean up meta data used for clustering
+ c1.key = c2.key = c1.index = c2.index = null;
+ return true;
+};
+var getAllChildren = function getAllChildren(root, arr, cy) {
+ if (!root) return;
+ if (root.value) {
+ arr.push(root.value);
+ } else {
+ if (root.left) getAllChildren(root.left, arr);
+ if (root.right) getAllChildren(root.right, arr);
+ }
+};
+var buildDendrogram = function buildDendrogram(root, cy) {
+ if (!root) return '';
+ if (root.left && root.right) {
+ var leftStr = buildDendrogram(root.left, cy);
+ var rightStr = buildDendrogram(root.right, cy);
+ var node = cy.add({
+ group: 'nodes',
+ data: {
+ id: leftStr + ',' + rightStr
+ }
+ });
+ cy.add({
+ group: 'edges',
+ data: {
+ source: leftStr,
+ target: node.id()
+ }
+ });
+ cy.add({
+ group: 'edges',
+ data: {
+ source: rightStr,
+ target: node.id()
+ }
+ });
+ return node.id();
+ } else if (root.value) {
+ return root.value.id();
+ }
+};
+var buildClustersFromTree = function buildClustersFromTree(root, k, cy) {
+ if (!root) return [];
+ var left = [],
+ right = [],
+ leaves = [];
+ if (k === 0) {
+ // don't cut tree, simply return all nodes as 1 single cluster
+ if (root.left) getAllChildren(root.left, left);
+ if (root.right) getAllChildren(root.right, right);
+ leaves = left.concat(right);
+ return [cy.collection(leaves)];
+ } else if (k === 1) {
+ // cut at root
-/***/ "./node_modules/lodash/isTypedArray.js":
-/*!*********************************************!*\
- !*** ./node_modules/lodash/isTypedArray.js ***!
- \*********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ if (root.value) {
+ // leaf node
+ return [cy.collection(root.value)];
+ } else {
+ if (root.left) getAllChildren(root.left, left);
+ if (root.right) getAllChildren(root.right, right);
+ return [cy.collection(left), cy.collection(right)];
+ }
+ } else {
+ if (root.value) {
+ return [cy.collection(root.value)];
+ } else {
+ if (root.left) left = buildClustersFromTree(root.left, k - 1, cy);
+ if (root.right) right = buildClustersFromTree(root.right, k - 1, cy);
+ return left.concat(right);
+ }
+ }
+};
-var baseIsTypedArray = __webpack_require__(/*! ./_baseIsTypedArray */ "./node_modules/lodash/_baseIsTypedArray.js"),
- baseUnary = __webpack_require__(/*! ./_baseUnary */ "./node_modules/lodash/_baseUnary.js"),
- nodeUtil = __webpack_require__(/*! ./_nodeUtil */ "./node_modules/lodash/_nodeUtil.js");
+var hierarchicalClustering = function hierarchicalClustering(options) {
+ var cy = this.cy();
+ var nodes = this.nodes();
-/* Node.js helper references. */
-var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
+ // Set parameters of algorithm: linkage type, distance metric, etc.
+ var opts = setOptions$1(options);
+ var attrs = opts.attributes;
+ var getDist = function getDist(n1, n2) {
+ return clusteringDistance(opts.distance, attrs.length, function (i) {
+ return attrs[i](n1);
+ }, function (i) {
+ return attrs[i](n2);
+ }, n1, n2);
+ };
-/**
- * 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;
+ // Begin hierarchical algorithm
+ var clusters = [];
+ var dists = []; // distances between each pair of clusters
+ var mins = []; // closest cluster for each cluster
+ var index = []; // hash of all clusters by key
-module.exports = isTypedArray;
+ // In agglomerative (bottom-up) clustering, each node starts as its own cluster
+ for (var n = 0; n < nodes.length; n++) {
+ var cluster = {
+ value: opts.mode === 'dendrogram' ? nodes[n] : [nodes[n]],
+ key: n,
+ index: n
+ };
+ clusters[n] = cluster;
+ index[n] = cluster;
+ dists[n] = [];
+ mins[n] = 0;
+ }
+ // Calculate the distance between each pair of clusters
+ for (var i = 0; i < clusters.length; i++) {
+ for (var j = 0; j <= i; j++) {
+ var dist = void 0;
+ if (opts.mode === 'dendrogram') {
+ // modes store cluster values differently
+ dist = i === j ? Infinity : getDist(clusters[i].value, clusters[j].value);
+ } else {
+ dist = i === j ? Infinity : getDist(clusters[i].value[0], clusters[j].value[0]);
+ }
+ dists[i][j] = dist;
+ dists[j][i] = dist;
+ if (dist < dists[i][mins[i]]) {
+ mins[i] = j; // Cache mins: closest cluster to cluster i is cluster j
+ }
+ }
+ }
-/***/ }),
+ // Find the closest pair of clusters and merge them into a single cluster.
+ // Update distances between new cluster and each of the old clusters, and loop until threshold reached.
+ var merged = mergeClosest(clusters, index, dists, mins, opts);
+ while (merged) {
+ merged = mergeClosest(clusters, index, dists, mins, opts);
+ }
+ var retClusters;
-/***/ "./node_modules/lodash/isUndefined.js":
-/*!********************************************!*\
- !*** ./node_modules/lodash/isUndefined.js ***!
- \********************************************/
-/***/ (function(module) {
+ // Dendrogram mode builds the hierarchy and adds intermediary nodes + edges
+ // in addition to returning the clusters.
+ if (opts.mode === 'dendrogram') {
+ retClusters = buildClustersFromTree(clusters[0], opts.dendrogramDepth, cy);
+ if (opts.addDendrogram) buildDendrogram(clusters[0], cy);
+ } else {
+ // Regular mode simply returns the clusters
-/**
- * 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;
-}
+ retClusters = new Array(clusters.length);
+ clusters.forEach(function (cluster, i) {
+ // Clean up meta data used for clustering
+ cluster.key = cluster.index = null;
+ retClusters[i] = cy.collection(cluster.value);
+ });
+ }
+ return retClusters;
+};
+var hierarchicalClustering$1 = {
+ hierarchicalClustering: hierarchicalClustering,
+ hca: hierarchicalClustering
+};
-module.exports = isUndefined;
+// Implemented by Zoe Xi @zoexi for GSOC 2016
+var defaults$9 = defaults$g({
+ distance: 'euclidean',
+ // distance metric to compare attributes between two nodes
+ preference: 'median',
+ // suitability of a data point to serve as an exemplar
+ damping: 0.8,
+ // damping factor between [0.5, 1)
+ maxIterations: 1000,
+ // max number of iterations to run
+ minIterations: 100,
+ // min number of iterations to run in order for clustering to stop
+ attributes: [// functions to quantify the similarity between any two points
+ // e.g. node => node.data('weight')
+ ]
+});
+var setOptions = function setOptions(options) {
+ var dmp = options.damping;
+ var pref = options.preference;
+ if (!(0.5 <= dmp && dmp < 1)) {
+ error("Damping must range on [0.5, 1). Got: ".concat(dmp));
+ }
+ var validPrefs = ['median', 'mean', 'min', 'max'];
+ if (!(validPrefs.some(function (v) {
+ return v === pref;
+ }) || number$1(pref))) {
+ error("Preference must be one of [".concat(validPrefs.map(function (p) {
+ return "'".concat(p, "'");
+ }).join(', '), "] or a number. Got: ").concat(pref));
+ }
+ return defaults$9(options);
+};
+var getSimilarity = function getSimilarity(type, n1, n2, attributes) {
+ var attr = function attr(n, i) {
+ return attributes[i](n);
+ };
-/***/ }),
+ // nb negative because similarity should have an inverse relationship to distance
+ return -clusteringDistance(type, attributes.length, function (i) {
+ return attr(n1, i);
+ }, function (i) {
+ return attr(n2, i);
+ }, n1, n2);
+};
+var getPreference = function getPreference(S, preference) {
+ // larger preference = greater # of clusters
+ var p = null;
+ if (preference === 'median') {
+ p = median(S);
+ } else if (preference === 'mean') {
+ p = mean(S);
+ } else if (preference === 'min') {
+ p = min(S);
+ } else if (preference === 'max') {
+ p = max(S);
+ } else {
+ // Custom preference number, as set by user
+ p = preference;
+ }
+ return p;
+};
+var findExemplars = function findExemplars(n, R, A) {
+ var indices = [];
+ for (var i = 0; i < n; i++) {
+ if (R[i * n + i] + A[i * n + i] > 0) {
+ indices.push(i);
+ }
+ }
+ return indices;
+};
+var assignClusters = function assignClusters(n, S, exemplars) {
+ var clusters = [];
+ for (var i = 0; i < n; i++) {
+ var index = -1;
+ var max = -Infinity;
+ for (var ei = 0; ei < exemplars.length; ei++) {
+ var e = exemplars[ei];
+ if (S[i * n + e] > max) {
+ index = e;
+ max = S[i * n + e];
+ }
+ }
+ if (index > 0) {
+ clusters.push(index);
+ }
+ }
+ for (var _ei = 0; _ei < exemplars.length; _ei++) {
+ clusters[exemplars[_ei]] = exemplars[_ei];
+ }
+ return clusters;
+};
+var assign = function assign(n, S, exemplars) {
+ var clusters = assignClusters(n, S, exemplars);
+ for (var ei = 0; ei < exemplars.length; ei++) {
+ var ii = [];
+ for (var c = 0; c < clusters.length; c++) {
+ if (clusters[c] === exemplars[ei]) {
+ ii.push(c);
+ }
+ }
+ var maxI = -1;
+ var maxSum = -Infinity;
+ for (var i = 0; i < ii.length; i++) {
+ var sum = 0;
+ for (var j = 0; j < ii.length; j++) {
+ sum += S[ii[j] * n + ii[i]];
+ }
+ if (sum > maxSum) {
+ maxI = i;
+ maxSum = sum;
+ }
+ }
+ exemplars[ei] = ii[maxI];
+ }
+ clusters = assignClusters(n, S, exemplars);
+ return clusters;
+};
+var affinityPropagation = function affinityPropagation(options) {
+ var cy = this.cy();
+ var nodes = this.nodes();
+ var opts = setOptions(options);
-/***/ "./node_modules/lodash/keys.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/keys.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Map each node to its position in node array
+ var id2position = {};
+ for (var i = 0; i < nodes.length; i++) {
+ id2position[nodes[i].id()] = i;
+ }
-var arrayLikeKeys = __webpack_require__(/*! ./_arrayLikeKeys */ "./node_modules/lodash/_arrayLikeKeys.js"),
- baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
+ // Begin affinity propagation algorithm
-/**
- * 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);
-}
+ var n; // number of data points
+ var n2; // size of matrices
+ var S; // similarity matrix (1D array)
+ var p; // preference/suitability of a data point to serve as an exemplar
+ var R; // responsibility matrix (1D array)
+ var A; // availability matrix (1D array)
-module.exports = keys;
+ n = nodes.length;
+ n2 = n * n;
+ // Initialize and build S similarity matrix
+ S = new Array(n2);
+ for (var _i = 0; _i < n2; _i++) {
+ S[_i] = -Infinity; // for cases where two data points shouldn't be linked together
+ }
-/***/ }),
+ for (var _i2 = 0; _i2 < n; _i2++) {
+ for (var j = 0; j < n; j++) {
+ if (_i2 !== j) {
+ S[_i2 * n + j] = getSimilarity(opts.distance, nodes[_i2], nodes[j], opts.attributes);
+ }
+ }
+ }
-/***/ "./node_modules/lodash/keysIn.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/keysIn.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ // Place preferences on the diagonal of S
+ p = getPreference(S, opts.preference);
+ for (var _i3 = 0; _i3 < n; _i3++) {
+ S[_i3 * n + _i3] = p;
+ }
-var arrayLikeKeys = __webpack_require__(/*! ./_arrayLikeKeys */ "./node_modules/lodash/_arrayLikeKeys.js"),
- baseKeysIn = __webpack_require__(/*! ./_baseKeysIn */ "./node_modules/lodash/_baseKeysIn.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js");
+ // Initialize R responsibility matrix
+ R = new Array(n2);
+ for (var _i4 = 0; _i4 < n2; _i4++) {
+ R[_i4] = 0.0;
+ }
-/**
- * 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);
-}
+ // Initialize A availability matrix
+ A = new Array(n2);
+ for (var _i5 = 0; _i5 < n2; _i5++) {
+ A[_i5] = 0.0;
+ }
+ var old = new Array(n);
+ var Rp = new Array(n);
+ var se = new Array(n);
+ for (var _i6 = 0; _i6 < n; _i6++) {
+ old[_i6] = 0.0;
+ Rp[_i6] = 0.0;
+ se[_i6] = 0;
+ }
+ var e = new Array(n * opts.minIterations);
+ for (var _i7 = 0; _i7 < e.length; _i7++) {
+ e[_i7] = 0;
+ }
+ var iter;
+ for (iter = 0; iter < opts.maxIterations; iter++) {
+ // main algorithmic loop
-module.exports = keysIn;
+ // Update R responsibility matrix
+ for (var _i8 = 0; _i8 < n; _i8++) {
+ var max = -Infinity,
+ max2 = -Infinity,
+ maxI = -1,
+ AS = 0.0;
+ for (var _j = 0; _j < n; _j++) {
+ old[_j] = R[_i8 * n + _j];
+ AS = A[_i8 * n + _j] + S[_i8 * n + _j];
+ if (AS >= max) {
+ max2 = max;
+ max = AS;
+ maxI = _j;
+ } else if (AS > max2) {
+ max2 = AS;
+ }
+ }
+ for (var _j2 = 0; _j2 < n; _j2++) {
+ R[_i8 * n + _j2] = (1 - opts.damping) * (S[_i8 * n + _j2] - max) + opts.damping * old[_j2];
+ }
+ R[_i8 * n + maxI] = (1 - opts.damping) * (S[_i8 * n + maxI] - max2) + opts.damping * old[maxI];
+ }
+ // Update A availability matrix
+ for (var _i9 = 0; _i9 < n; _i9++) {
+ var sum = 0;
+ for (var _j3 = 0; _j3 < n; _j3++) {
+ old[_j3] = A[_j3 * n + _i9];
+ Rp[_j3] = Math.max(0, R[_j3 * n + _i9]);
+ sum += Rp[_j3];
+ }
+ sum -= Rp[_i9];
+ Rp[_i9] = R[_i9 * n + _i9];
+ sum += Rp[_i9];
+ for (var _j4 = 0; _j4 < n; _j4++) {
+ A[_j4 * n + _i9] = (1 - opts.damping) * Math.min(0, sum - Rp[_j4]) + opts.damping * old[_j4];
+ }
+ A[_i9 * n + _i9] = (1 - opts.damping) * (sum - Rp[_i9]) + opts.damping * old[_i9];
+ }
-/***/ }),
+ // Check for convergence
+ var K = 0;
+ for (var _i10 = 0; _i10 < n; _i10++) {
+ var E = A[_i10 * n + _i10] + R[_i10 * n + _i10] > 0 ? 1 : 0;
+ e[iter % opts.minIterations * n + _i10] = E;
+ K += E;
+ }
+ if (K > 0 && (iter >= opts.minIterations - 1 || iter == opts.maxIterations - 1)) {
+ var _sum = 0;
+ for (var _i11 = 0; _i11 < n; _i11++) {
+ se[_i11] = 0;
+ for (var _j5 = 0; _j5 < opts.minIterations; _j5++) {
+ se[_i11] += e[_j5 * n + _i11];
+ }
+ if (se[_i11] === 0 || se[_i11] === opts.minIterations) {
+ _sum++;
+ }
+ }
+ if (_sum === n) {
+ // then we have convergence
+ break;
+ }
+ }
+ }
-/***/ "./node_modules/lodash/last.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/last.js ***!
- \*************************************/
-/***/ (function(module) {
+ // Identify exemplars (cluster centers)
+ var exemplarsIndices = findExemplars(n, R, A);
-/**
- * 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;
-}
+ // Assign nodes to clusters
+ var clusterIndices = assign(n, S, exemplarsIndices);
+ var clusters = {};
+ for (var c = 0; c < exemplarsIndices.length; c++) {
+ clusters[exemplarsIndices[c]] = [];
+ }
+ for (var _i12 = 0; _i12 < nodes.length; _i12++) {
+ var pos = id2position[nodes[_i12].id()];
+ var clusterIndex = clusterIndices[pos];
+ if (clusterIndex != null) {
+ // the node may have not been assigned a cluster if no valid attributes were specified
+ clusters[clusterIndex].push(nodes[_i12]);
+ }
+ }
+ var retClusters = new Array(exemplarsIndices.length);
+ for (var _c = 0; _c < exemplarsIndices.length; _c++) {
+ retClusters[_c] = cy.collection(clusters[exemplarsIndices[_c]]);
+ }
+ return retClusters;
+};
+var affinityPropagation$1 = {
+ affinityPropagation: affinityPropagation,
+ ap: affinityPropagation
+};
-module.exports = last;
+var hierholzerDefaults = defaults$g({
+ root: undefined,
+ directed: false
+});
+var elesfn$k = {
+ hierholzer: function hierholzer(options) {
+ if (!plainObject(options)) {
+ var args = arguments;
+ options = {
+ root: args[0],
+ directed: args[1]
+ };
+ }
+ var _hierholzerDefaults = hierholzerDefaults(options),
+ root = _hierholzerDefaults.root,
+ directed = _hierholzerDefaults.directed;
+ var eles = this;
+ var dflag = false;
+ var oddIn;
+ var oddOut;
+ var startVertex;
+ if (root) startVertex = string(root) ? this.filter(root)[0].id() : root[0].id();
+ var nodes = {};
+ var edges = {};
+ if (directed) {
+ eles.forEach(function (ele) {
+ var id = ele.id();
+ if (ele.isNode()) {
+ var ind = ele.indegree(true);
+ var outd = ele.outdegree(true);
+ var d1 = ind - outd;
+ var d2 = outd - ind;
+ if (d1 == 1) {
+ if (oddIn) dflag = true;else oddIn = id;
+ } else if (d2 == 1) {
+ if (oddOut) dflag = true;else oddOut = id;
+ } else if (d2 > 1 || d1 > 1) {
+ dflag = true;
+ }
+ nodes[id] = [];
+ ele.outgoers().forEach(function (e) {
+ if (e.isEdge()) nodes[id].push(e.id());
+ });
+ } else {
+ edges[id] = [undefined, ele.target().id()];
+ }
+ });
+ } else {
+ eles.forEach(function (ele) {
+ var id = ele.id();
+ if (ele.isNode()) {
+ var d = ele.degree(true);
+ if (d % 2) {
+ if (!oddIn) oddIn = id;else if (!oddOut) oddOut = id;else dflag = true;
+ }
+ nodes[id] = [];
+ ele.connectedEdges().forEach(function (e) {
+ return nodes[id].push(e.id());
+ });
+ } else {
+ edges[id] = [ele.source().id(), ele.target().id()];
+ }
+ });
+ }
+ var result = {
+ found: false,
+ trail: undefined
+ };
+ if (dflag) return result;else if (oddOut && oddIn) {
+ if (directed) {
+ if (startVertex && oddOut != startVertex) {
+ return result;
+ }
+ startVertex = oddOut;
+ } else {
+ if (startVertex && oddOut != startVertex && oddIn != startVertex) {
+ return result;
+ } else if (!startVertex) {
+ startVertex = oddOut;
+ }
+ }
+ } else {
+ if (!startVertex) startVertex = eles[0].id();
+ }
+ var walk = function walk(v) {
+ var currentNode = v;
+ var subtour = [v];
+ var adj, adjTail, adjHead;
+ while (nodes[currentNode].length) {
+ adj = nodes[currentNode].shift();
+ adjTail = edges[adj][0];
+ adjHead = edges[adj][1];
+ if (currentNode != adjHead) {
+ nodes[adjHead] = nodes[adjHead].filter(function (e) {
+ return e != adj;
+ });
+ currentNode = adjHead;
+ } else if (!directed && currentNode != adjTail) {
+ nodes[adjTail] = nodes[adjTail].filter(function (e) {
+ return e != adj;
+ });
+ currentNode = adjTail;
+ }
+ subtour.unshift(adj);
+ subtour.unshift(currentNode);
+ }
+ return subtour;
+ };
+ var trail = [];
+ var subtour = [];
+ subtour = walk(startVertex);
+ while (subtour.length != 1) {
+ if (nodes[subtour[0]].length == 0) {
+ trail.unshift(eles.getElementById(subtour.shift()));
+ trail.unshift(eles.getElementById(subtour.shift()));
+ } else {
+ subtour = walk(subtour.shift()).concat(subtour);
+ }
+ }
+ trail.unshift(eles.getElementById(subtour.shift())); // final node
+ for (var d in nodes) {
+ if (nodes[d].length) {
+ return result;
+ }
+ }
+ result.found = true;
+ result.trail = this.spawn(trail, true);
+ return result;
+ }
+};
-/***/ }),
+var hopcroftTarjanBiconnected = function hopcroftTarjanBiconnected() {
+ var eles = this;
+ var nodes = {};
+ var id = 0;
+ var edgeCount = 0;
+ var components = [];
+ var stack = [];
+ var visitedEdges = {};
+ var buildComponent = function buildComponent(x, y) {
+ var i = stack.length - 1;
+ var cutset = [];
+ var component = eles.spawn();
+ while (stack[i].x != x || stack[i].y != y) {
+ cutset.push(stack.pop().edge);
+ i--;
+ }
+ cutset.push(stack.pop().edge);
+ cutset.forEach(function (edge) {
+ var connectedNodes = edge.connectedNodes().intersection(eles);
+ component.merge(edge);
+ connectedNodes.forEach(function (node) {
+ var nodeId = node.id();
+ var connectedEdges = node.connectedEdges().intersection(eles);
+ component.merge(node);
+ if (!nodes[nodeId].cutVertex) {
+ component.merge(connectedEdges);
+ } else {
+ component.merge(connectedEdges.filter(function (edge) {
+ return edge.isLoop();
+ }));
+ }
+ });
+ });
+ components.push(component);
+ };
+ var biconnectedSearch = function biconnectedSearch(root, currentNode, parent) {
+ if (root === parent) edgeCount += 1;
+ nodes[currentNode] = {
+ id: id,
+ low: id++,
+ cutVertex: false
+ };
+ var edges = eles.getElementById(currentNode).connectedEdges().intersection(eles);
+ if (edges.size() === 0) {
+ components.push(eles.spawn(eles.getElementById(currentNode)));
+ } else {
+ var sourceId, targetId, otherNodeId, edgeId;
+ edges.forEach(function (edge) {
+ sourceId = edge.source().id();
+ targetId = edge.target().id();
+ otherNodeId = sourceId === currentNode ? targetId : sourceId;
+ if (otherNodeId !== parent) {
+ edgeId = edge.id();
+ if (!visitedEdges[edgeId]) {
+ visitedEdges[edgeId] = true;
+ stack.push({
+ x: currentNode,
+ y: otherNodeId,
+ edge: edge
+ });
+ }
+ if (!(otherNodeId in nodes)) {
+ biconnectedSearch(root, otherNodeId, currentNode);
+ nodes[currentNode].low = Math.min(nodes[currentNode].low, nodes[otherNodeId].low);
+ if (nodes[currentNode].id <= nodes[otherNodeId].low) {
+ nodes[currentNode].cutVertex = true;
+ buildComponent(currentNode, otherNodeId);
+ }
+ } else {
+ nodes[currentNode].low = Math.min(nodes[currentNode].low, nodes[otherNodeId].id);
+ }
+ }
+ });
+ }
+ };
+ eles.forEach(function (ele) {
+ if (ele.isNode()) {
+ var nodeId = ele.id();
+ if (!(nodeId in nodes)) {
+ edgeCount = 0;
+ biconnectedSearch(nodeId, nodeId);
+ nodes[nodeId].cutVertex = edgeCount > 1;
+ }
+ }
+ });
+ var cutVertices = Object.keys(nodes).filter(function (id) {
+ return nodes[id].cutVertex;
+ }).map(function (id) {
+ return eles.getElementById(id);
+ });
+ return {
+ cut: eles.spawn(cutVertices),
+ components: components
+ };
+};
+var hopcroftTarjanBiconnected$1 = {
+ hopcroftTarjanBiconnected: hopcroftTarjanBiconnected,
+ htbc: hopcroftTarjanBiconnected,
+ htb: hopcroftTarjanBiconnected,
+ hopcroftTarjanBiconnectedComponents: hopcroftTarjanBiconnected
+};
-/***/ "./node_modules/lodash/map.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/map.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var tarjanStronglyConnected = function tarjanStronglyConnected() {
+ var eles = this;
+ var nodes = {};
+ var index = 0;
+ var components = [];
+ var stack = [];
+ var cut = eles.spawn(eles);
+ var stronglyConnectedSearch = function stronglyConnectedSearch(sourceNodeId) {
+ stack.push(sourceNodeId);
+ nodes[sourceNodeId] = {
+ index: index,
+ low: index++,
+ explored: false
+ };
+ var connectedEdges = eles.getElementById(sourceNodeId).connectedEdges().intersection(eles);
+ connectedEdges.forEach(function (edge) {
+ var targetNodeId = edge.target().id();
+ if (targetNodeId !== sourceNodeId) {
+ if (!(targetNodeId in nodes)) {
+ stronglyConnectedSearch(targetNodeId);
+ }
+ if (!nodes[targetNodeId].explored) {
+ nodes[sourceNodeId].low = Math.min(nodes[sourceNodeId].low, nodes[targetNodeId].low);
+ }
+ }
+ });
+ if (nodes[sourceNodeId].index === nodes[sourceNodeId].low) {
+ var componentNodes = eles.spawn();
+ for (;;) {
+ var nodeId = stack.pop();
+ componentNodes.merge(eles.getElementById(nodeId));
+ nodes[nodeId].low = nodes[sourceNodeId].index;
+ nodes[nodeId].explored = true;
+ if (nodeId === sourceNodeId) {
+ break;
+ }
+ }
+ var componentEdges = componentNodes.edgesWith(componentNodes);
+ var component = componentNodes.merge(componentEdges);
+ components.push(component);
+ cut = cut.difference(component);
+ }
+ };
+ eles.forEach(function (ele) {
+ if (ele.isNode()) {
+ var nodeId = ele.id();
+ if (!(nodeId in nodes)) {
+ stronglyConnectedSearch(nodeId);
+ }
+ }
+ });
+ return {
+ cut: cut,
+ components: components
+ };
+};
+var tarjanStronglyConnected$1 = {
+ tarjanStronglyConnected: tarjanStronglyConnected,
+ tsc: tarjanStronglyConnected,
+ tscc: tarjanStronglyConnected,
+ tarjanStronglyConnectedComponents: tarjanStronglyConnected
+};
-var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- baseMap = __webpack_require__(/*! ./_baseMap */ "./node_modules/lodash/_baseMap.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+var elesfn$j = {};
+[elesfn$v, elesfn$u, elesfn$t, elesfn$s, elesfn$r, elesfn$q, elesfn$p, elesfn$o, elesfn$n, elesfn$m, elesfn$l, markovClustering$1, kClustering, hierarchicalClustering$1, affinityPropagation$1, elesfn$k, hopcroftTarjanBiconnected$1, tarjanStronglyConnected$1].forEach(function (props) {
+ extend(elesfn$j, props);
+});
-/**
- * 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, baseIteratee(iteratee, 3));
-}
+/*!
+Embeddable Minimum Strictly-Compliant Promises/A+ 1.1.1 Thenable
+Copyright (c) 2013-2014 Ralf S. Engelschall (http://engelschall.com)
+Licensed under The MIT License (http://opensource.org/licenses/MIT)
+*/
-module.exports = map;
+/* promise states [Promises/A+ 2.1] */
+var STATE_PENDING = 0; /* [Promises/A+ 2.1.1] */
+var STATE_FULFILLED = 1; /* [Promises/A+ 2.1.2] */
+var STATE_REJECTED = 2; /* [Promises/A+ 2.1.3] */
+/* promise object constructor */
+var api = function api(executor) {
+ /* optionally support non-constructor/plain-function call */
+ if (!(this instanceof api)) return new api(executor);
-/***/ }),
+ /* initialize object */
+ this.id = 'Thenable/1.0.7';
+ this.state = STATE_PENDING; /* initial state */
+ this.fulfillValue = undefined; /* initial value */ /* [Promises/A+ 1.3, 2.1.2.2] */
+ this.rejectReason = undefined; /* initial reason */ /* [Promises/A+ 1.5, 2.1.3.2] */
+ this.onFulfilled = []; /* initial handlers */
+ this.onRejected = []; /* initial handlers */
-/***/ "./node_modules/lodash/mapValues.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/mapValues.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ /* provide optional information-hiding proxy */
+ this.proxy = {
+ then: this.then.bind(this)
+ };
-var baseAssignValue = __webpack_require__(/*! ./_baseAssignValue */ "./node_modules/lodash/_baseAssignValue.js"),
- baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js");
+ /* support optional executor function */
+ if (typeof executor === 'function') executor.call(this, this.fulfill.bind(this), this.reject.bind(this));
+};
-/**
- * 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 = baseIteratee(iteratee, 3);
+/* promise API methods */
+api.prototype = {
+ /* promise resolving methods */
+ fulfill: function fulfill(value) {
+ return deliver(this, STATE_FULFILLED, 'fulfillValue', value);
+ },
+ reject: function reject(value) {
+ return deliver(this, STATE_REJECTED, 'rejectReason', value);
+ },
+ /* "The then Method" [Promises/A+ 1.1, 1.2, 2.2] */
+ then: function then(onFulfilled, onRejected) {
+ var curr = this;
+ var next = new api(); /* [Promises/A+ 2.2.7] */
+ curr.onFulfilled.push(resolver(onFulfilled, next, 'fulfill')); /* [Promises/A+ 2.2.2/2.2.6] */
+ curr.onRejected.push(resolver(onRejected, next, 'reject')); /* [Promises/A+ 2.2.3/2.2.6] */
+ execute(curr);
+ return next.proxy; /* [Promises/A+ 2.2.7, 3.3] */
+ }
+};
- baseForOwn(object, function(value, key, object) {
- baseAssignValue(result, key, iteratee(value, key, object));
- });
- return result;
-}
+/* deliver an action */
+var deliver = function deliver(curr, state, name, value) {
+ if (curr.state === STATE_PENDING) {
+ curr.state = state; /* [Promises/A+ 2.1.2.1, 2.1.3.1] */
+ curr[name] = value; /* [Promises/A+ 2.1.2.2, 2.1.3.2] */
+ execute(curr);
+ }
+ return curr;
+};
-module.exports = mapValues;
+/* execute all handlers */
+var execute = function execute(curr) {
+ if (curr.state === STATE_FULFILLED) execute_handlers(curr, 'onFulfilled', curr.fulfillValue);else if (curr.state === STATE_REJECTED) execute_handlers(curr, 'onRejected', curr.rejectReason);
+};
+/* execute particular set of handlers */
+var execute_handlers = function execute_handlers(curr, name, value) {
+ /* global setImmediate: true */
+ /* global setTimeout: true */
-/***/ }),
+ /* short-circuit processing */
+ if (curr[name].length === 0) return;
-/***/ "./node_modules/lodash/max.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/max.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ /* iterate over all handlers, exactly once */
+ var handlers = curr[name];
+ curr[name] = []; /* [Promises/A+ 2.2.2.3, 2.2.3.3] */
+ var func = function func() {
+ for (var i = 0; i < handlers.length; i++) {
+ handlers[i](value);
+ } /* [Promises/A+ 2.2.5] */
+ };
-var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
- baseGt = __webpack_require__(/*! ./_baseGt */ "./node_modules/lodash/_baseGt.js"),
- identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
+ /* execute procedure asynchronously */ /* [Promises/A+ 2.2.4, 3.1] */
+ if (typeof setImmediate === 'function') setImmediate(func);else setTimeout(func, 0);
+};
-/**
- * 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;
-}
+/* generate a resolver function */
+var resolver = function resolver(cb, next, method) {
+ return function (value) {
+ if (typeof cb !== 'function') /* [Promises/A+ 2.2.1, 2.2.7.3, 2.2.7.4] */
+ next[method].call(next, value); /* [Promises/A+ 2.2.7.3, 2.2.7.4] */else {
+ var result;
+ try {
+ result = cb(value);
+ } /* [Promises/A+ 2.2.2.1, 2.2.3.1, 2.2.5, 3.2] */ catch (e) {
+ next.reject(e); /* [Promises/A+ 2.2.7.2] */
+ return;
+ }
+ resolve(next, result); /* [Promises/A+ 2.2.7.1] */
+ }
+ };
+};
-module.exports = max;
+/* "Promise Resolution Procedure" */ /* [Promises/A+ 2.3] */
+var resolve = function resolve(promise, x) {
+ /* sanity check arguments */ /* [Promises/A+ 2.3.1] */
+ if (promise === x || promise.proxy === x) {
+ promise.reject(new TypeError('cannot resolve promise with itself'));
+ return;
+ }
+ /* surgically check for a "then" method
+ (mainly to just call the "getter" of "then" only once) */
+ var then;
+ if (_typeof(x) === 'object' && x !== null || typeof x === 'function') {
+ try {
+ then = x.then;
+ } /* [Promises/A+ 2.3.3.1, 3.5] */ catch (e) {
+ promise.reject(e); /* [Promises/A+ 2.3.3.2] */
+ return;
+ }
+ }
-/***/ }),
+ /* handle own Thenables [Promises/A+ 2.3.2]
+ and similar "thenables" [Promises/A+ 2.3.3] */
+ if (typeof then === 'function') {
+ var resolved = false;
+ try {
+ /* call retrieved "then" method */ /* [Promises/A+ 2.3.3.3] */
+ then.call(x, /* resolvePromise */ /* [Promises/A+ 2.3.3.3.1] */
+ function (y) {
+ if (resolved) return;
+ resolved = true; /* [Promises/A+ 2.3.3.3.3] */
+ if (y === x) /* [Promises/A+ 3.6] */
+ promise.reject(new TypeError('circular thenable chain'));else resolve(promise, y);
+ }, /* rejectPromise */ /* [Promises/A+ 2.3.3.3.2] */
+ function (r) {
+ if (resolved) return;
+ resolved = true; /* [Promises/A+ 2.3.3.3.3] */
+ promise.reject(r);
+ });
+ } catch (e) {
+ if (!resolved) /* [Promises/A+ 2.3.3.3.3] */
+ promise.reject(e); /* [Promises/A+ 2.3.3.3.4] */
+ }
-/***/ "./node_modules/lodash/memoize.js":
-/*!****************************************!*\
- !*** ./node_modules/lodash/memoize.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ return;
+ }
-var MapCache = __webpack_require__(/*! ./_MapCache */ "./node_modules/lodash/_MapCache.js");
+ /* handle other values */
+ promise.fulfill(x); /* [Promises/A+ 2.3.4, 2.3.3.4] */
+};
-/** Error message constants. */
-var FUNC_ERROR_TEXT = 'Expected a function';
+// so we always have Promise.all()
+api.all = function (ps) {
+ return new api(function (resolveAll, rejectAll) {
+ var vals = new Array(ps.length);
+ var doneCount = 0;
+ var fulfill = function fulfill(i, val) {
+ vals[i] = val;
+ doneCount++;
+ if (doneCount === ps.length) {
+ resolveAll(vals);
+ }
+ };
+ for (var i = 0; i < ps.length; i++) {
+ (function (i) {
+ var p = ps[i];
+ var isPromise = p != null && p.then != null;
+ if (isPromise) {
+ p.then(function (val) {
+ fulfill(i, val);
+ }, function (err) {
+ rejectAll(err);
+ });
+ } else {
+ var val = p;
+ fulfill(i, val);
+ }
+ })(i);
+ }
+ });
+};
+api.resolve = function (val) {
+ return new api(function (resolve, reject) {
+ resolve(val);
+ });
+};
+api.reject = function (val) {
+ return new api(function (resolve, reject) {
+ reject(val);
+ });
+};
+var Promise$1 = typeof Promise !== 'undefined' ? Promise : api; // eslint-disable-line no-undef
-/**
- * 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 Animation = function Animation(target, opts, opts2) {
+ var isCore = core(target);
+ var isEle = !isCore;
+ var _p = this._private = extend({
+ duration: 1000
+ }, opts, opts2);
+ _p.target = target;
+ _p.style = _p.style || _p.css;
+ _p.started = false;
+ _p.playing = false;
+ _p.hooked = false;
+ _p.applying = false;
+ _p.progress = 0;
+ _p.completes = [];
+ _p.frames = [];
+ if (_p.complete && fn$6(_p.complete)) {
+ _p.completes.push(_p.complete);
+ }
+ if (isEle) {
+ var pos = target.position();
+ _p.startPosition = _p.startPosition || {
+ x: pos.x,
+ y: pos.y
+ };
+ _p.startStyle = _p.startStyle || target.cy().style().getAnimationStartStyle(target, _p.style);
+ }
+ if (isCore) {
+ var pan = target.pan();
+ _p.startPan = {
+ x: pan.x,
+ y: pan.y
+ };
+ _p.startZoom = target.zoom();
}
- 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);
+ // for future timeline/animations impl
+ this.length = 1;
+ this[0] = this;
+};
+var anifn = Animation.prototype;
+extend(anifn, {
+ instanceString: function instanceString() {
+ return 'animation';
+ },
+ hook: function hook() {
+ var _p = this._private;
+ if (!_p.hooked) {
+ // add to target's animation queue
+ var q;
+ var tAni = _p.target._private.animation;
+ if (_p.queue) {
+ q = tAni.queue;
+ } else {
+ q = tAni.current;
+ }
+ q.push(this);
+
+ // add to the animation loop pool
+ if (elementOrCollection(_p.target)) {
+ _p.target.cy().addToAnimationPool(_p.target);
+ }
+ _p.hooked = true;
}
- var result = func.apply(this, args);
- memoized.cache = cache.set(key, result) || cache;
- return result;
- };
- memoized.cache = new (memoize.Cache || MapCache);
- return memoized;
-}
+ return this;
+ },
+ play: function play() {
+ var _p = this._private;
-// Expose `MapCache`.
-memoize.Cache = MapCache;
+ // autorewind
+ if (_p.progress === 1) {
+ _p.progress = 0;
+ }
+ _p.playing = true;
+ _p.started = false; // needs to be started by animation loop
+ _p.stopped = false;
+ this.hook();
-module.exports = memoize;
+ // the animation loop will start the animation...
+ return this;
+ },
+ playing: function playing() {
+ return this._private.playing;
+ },
+ apply: function apply() {
+ var _p = this._private;
+ _p.applying = true;
+ _p.started = false; // needs to be started by animation loop
+ _p.stopped = false;
+ this.hook();
-/***/ }),
+ // the animation loop will apply the animation at this progress
-/***/ "./node_modules/lodash/merge.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/merge.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ return this;
+ },
+ applying: function applying() {
+ return this._private.applying;
+ },
+ pause: function pause() {
+ var _p = this._private;
+ _p.playing = false;
+ _p.started = false;
+ return this;
+ },
+ stop: function stop() {
+ var _p = this._private;
+ _p.playing = false;
+ _p.started = false;
+ _p.stopped = true; // to be removed from animation queues
-var baseMerge = __webpack_require__(/*! ./_baseMerge */ "./node_modules/lodash/_baseMerge.js"),
- createAssigner = __webpack_require__(/*! ./_createAssigner */ "./node_modules/lodash/_createAssigner.js");
+ return this;
+ },
+ rewind: function rewind() {
+ return this.progress(0);
+ },
+ fastforward: function fastforward() {
+ return this.progress(1);
+ },
+ time: function time(t) {
+ var _p = this._private;
+ if (t === undefined) {
+ return _p.progress * _p.duration;
+ } else {
+ return this.progress(t / _p.duration);
+ }
+ },
+ progress: function progress(p) {
+ var _p = this._private;
+ var wasPlaying = _p.playing;
+ if (p === undefined) {
+ return _p.progress;
+ } else {
+ if (wasPlaying) {
+ this.pause();
+ }
+ _p.progress = p;
+ _p.started = false;
+ if (wasPlaying) {
+ this.play();
+ }
+ }
+ return this;
+ },
+ completed: function completed() {
+ return this._private.progress === 1;
+ },
+ reverse: function reverse() {
+ var _p = this._private;
+ var wasPlaying = _p.playing;
+ if (wasPlaying) {
+ this.pause();
+ }
+ _p.progress = 1 - _p.progress;
+ _p.started = false;
+ var swap = function swap(a, b) {
+ var _pa = _p[a];
+ if (_pa == null) {
+ return;
+ }
+ _p[a] = _p[b];
+ _p[b] = _pa;
+ };
+ swap('zoom', 'startZoom');
+ swap('pan', 'startPan');
+ swap('position', 'startPosition');
-/**
- * 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);
+ // swap styles
+ if (_p.style) {
+ for (var i = 0; i < _p.style.length; i++) {
+ var prop = _p.style[i];
+ var name = prop.name;
+ var startStyleProp = _p.startStyle[name];
+ _p.startStyle[name] = prop;
+ _p.style[i] = startStyleProp;
+ }
+ }
+ if (wasPlaying) {
+ this.play();
+ }
+ return this;
+ },
+ promise: function promise(type) {
+ var _p = this._private;
+ var arr;
+ switch (type) {
+ case 'frame':
+ arr = _p.frames;
+ break;
+ default:
+ case 'complete':
+ case 'completed':
+ arr = _p.completes;
+ }
+ return new Promise$1(function (resolve, reject) {
+ arr.push(function () {
+ resolve();
+ });
+ });
+ }
});
+anifn.complete = anifn.completed;
+anifn.run = anifn.play;
+anifn.running = anifn.playing;
-module.exports = merge;
+var define$3 = {
+ animated: function animated() {
+ return function animatedImpl() {
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return false;
+ }
+ var ele = all[0];
+ if (ele) {
+ return ele._private.animation.current.length > 0;
+ }
+ };
+ },
+ // animated
+
+ clearQueue: function clearQueue() {
+ return function clearQueueImpl() {
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ for (var i = 0; i < all.length; i++) {
+ var ele = all[i];
+ ele._private.animation.queue = [];
+ }
+ return this;
+ };
+ },
+ // clearQueue
+ delay: function delay() {
+ return function delayImpl(time, complete) {
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ return this.animate({
+ delay: time,
+ duration: time,
+ complete: complete
+ });
+ };
+ },
+ // delay
-/***/ }),
+ delayAnimation: function delayAnimation() {
+ return function delayAnimationImpl(time, complete) {
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ return this.animation({
+ delay: time,
+ duration: time,
+ complete: complete
+ });
+ };
+ },
+ // delay
-/***/ "./node_modules/lodash/min.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/min.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ animation: function animation() {
+ return function animationImpl(properties, params) {
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var cy = this._private.cy || this;
+ var isCore = !selfIsArrayLike;
+ var isEles = !isCore;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ var style = cy.style();
+ properties = extend({}, properties, params);
+ var propertiesEmpty = Object.keys(properties).length === 0;
+ if (propertiesEmpty) {
+ return new Animation(all[0], properties); // nothing to animate
+ }
-var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
- baseLt = __webpack_require__(/*! ./_baseLt */ "./node_modules/lodash/_baseLt.js"),
- identity = __webpack_require__(/*! ./identity */ "./node_modules/lodash/identity.js");
+ if (properties.duration === undefined) {
+ properties.duration = 400;
+ }
+ switch (properties.duration) {
+ case 'slow':
+ properties.duration = 600;
+ break;
+ case 'fast':
+ properties.duration = 200;
+ break;
+ }
+ if (isEles) {
+ properties.style = style.getPropsList(properties.style || properties.css);
+ properties.css = undefined;
+ }
+ if (isEles && properties.renderedPosition != null) {
+ var rpos = properties.renderedPosition;
+ var pan = cy.pan();
+ var zoom = cy.zoom();
+ properties.position = renderedToModelPosition(rpos, zoom, pan);
+ }
-/**
- * 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;
-}
+ // override pan w/ panBy if set
+ if (isCore && properties.panBy != null) {
+ var panBy = properties.panBy;
+ var cyPan = cy.pan();
+ properties.pan = {
+ x: cyPan.x + panBy.x,
+ y: cyPan.y + panBy.y
+ };
+ }
-module.exports = min;
+ // override pan w/ center if set
+ var center = properties.center || properties.centre;
+ if (isCore && center != null) {
+ var centerPan = cy.getCenterPan(center.eles, properties.zoom);
+ if (centerPan != null) {
+ properties.pan = centerPan;
+ }
+ }
+ // override pan & zoom w/ fit if set
+ if (isCore && properties.fit != null) {
+ var fit = properties.fit;
+ var fitVp = cy.getFitViewport(fit.eles || fit.boundingBox, fit.padding);
+ if (fitVp != null) {
+ properties.pan = fitVp.pan;
+ properties.zoom = fitVp.zoom;
+ }
+ }
-/***/ }),
+ // override zoom (& potentially pan) w/ zoom obj if set
+ if (isCore && plainObject(properties.zoom)) {
+ var vp = cy.getZoomedViewport(properties.zoom);
+ if (vp != null) {
+ if (vp.zoomed) {
+ properties.zoom = vp.zoom;
+ }
+ if (vp.panned) {
+ properties.pan = vp.pan;
+ }
+ } else {
+ properties.zoom = null; // an inavalid zoom (e.g. no delta) gets automatically destroyed
+ }
+ }
-/***/ "./node_modules/lodash/minBy.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/minBy.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ return new Animation(all[0], properties);
+ };
+ },
+ // animate
-var baseExtremum = __webpack_require__(/*! ./_baseExtremum */ "./node_modules/lodash/_baseExtremum.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- baseLt = __webpack_require__(/*! ./_baseLt */ "./node_modules/lodash/_baseLt.js");
+ animate: function animate() {
+ return function animateImpl(properties, params) {
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ if (params) {
+ properties = extend({}, properties, params);
+ }
-/**
- * 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, baseIteratee(iteratee, 2), baseLt)
- : undefined;
-}
+ // manually hook and run the animation
+ for (var i = 0; i < all.length; i++) {
+ var ele = all[i];
+ var queue = ele.animated() && (properties.queue === undefined || properties.queue);
+ var ani = ele.animation(properties, queue ? {
+ queue: true
+ } : undefined);
+ ani.play();
+ }
+ return this; // chaining
+ };
+ },
-module.exports = minBy;
+ // animate
+ stop: function stop() {
+ return function stopImpl(clearQueue, jumpToEnd) {
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var cy = this._private.cy || this;
+ if (!cy.styleEnabled()) {
+ return this;
+ }
+ for (var i = 0; i < all.length; i++) {
+ var ele = all[i];
+ var _p = ele._private;
+ var anis = _p.animation.current;
+ for (var j = 0; j < anis.length; j++) {
+ var ani = anis[j];
+ var ani_p = ani._private;
+ if (jumpToEnd) {
+ // next iteration of the animation loop, the animation
+ // will go straight to the end and be removed
+ ani_p.duration = 0;
+ }
+ }
-/***/ }),
+ // clear the queue of future animations
+ if (clearQueue) {
+ _p.animation.queue = [];
+ }
+ if (!jumpToEnd) {
+ _p.animation.current = [];
+ }
+ }
-/***/ "./node_modules/lodash/noop.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/noop.js ***!
- \*************************************/
-/***/ (function(module) {
+ // we have to notify (the animation loop doesn't do it for us on `stop`)
+ cy.notify('draw');
+ return this;
+ };
+ } // stop
+}; // define
/**
- * This method returns `undefined`.
+ * Checks if `value` is classified as an `Array` object.
*
* @static
* @memberOf _
- * @since 2.3.0
- * @category Util
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array, else `false`.
* @example
*
- * _.times(2, _.noop);
- * // => [undefined, undefined]
+ * _.isArray([1, 2, 3]);
+ * // => true
+ *
+ * _.isArray(document.body.children);
+ * // => false
+ *
+ * _.isArray('abc');
+ * // => false
+ *
+ * _.isArray(_.noop);
+ * // => false
*/
-function noop() {
- // No operation performed.
-}
-
-module.exports = noop;
-
-
-/***/ }),
+var isArray = Array.isArray;
-/***/ "./node_modules/lodash/now.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/now.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var isArray_1 = isArray;
-var root = __webpack_require__(/*! ./_root */ "./node_modules/lodash/_root.js");
+/** Used to match property names within property paths. */
+var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
+ reIsPlainProp = /^\w*$/;
/**
- * 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
+ * Checks if `value` is a property name and not a property path.
*
- * _.defer(function(stamp) {
- * console.log(_.now() - stamp);
- * }, _.now());
- * // => Logs the number of milliseconds it took for the deferred invocation.
+ * @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`.
*/
-var now = function() {
- return root.Date.now();
-};
-
-module.exports = now;
-
-
-/***/ }),
+function isKey(value, object) {
+ if (isArray_1(value)) {
+ return false;
+ }
+ var type = typeof value;
+ if (type == 'number' || type == 'symbol' || type == 'boolean' ||
+ value == null || isSymbol_1(value)) {
+ return true;
+ }
+ return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
+ (object != null && value in Object(object));
+}
-/***/ "./node_modules/lodash/pick.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/pick.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var _isKey = isKey;
-var basePick = __webpack_require__(/*! ./_basePick */ "./node_modules/lodash/_basePick.js"),
- flatRest = __webpack_require__(/*! ./_flatRest */ "./node_modules/lodash/_flatRest.js");
+/** `Object#toString` result references. */
+var asyncTag = '[object AsyncFunction]',
+ funcTag = '[object Function]',
+ genTag = '[object GeneratorFunction]',
+ proxyTag = '[object Proxy]';
/**
- * Creates an object composed of the picked `object` properties.
+ * Checks if `value` is classified as a `Function` object.
*
* @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.
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a function, else `false`.
* @example
*
- * var object = { 'a': 1, 'b': '2', 'c': 3 };
+ * _.isFunction(_);
+ * // => true
*
- * _.pick(object, ['a', 'c']);
- * // => { 'a': 1, 'c': 3 }
+ * _.isFunction(/abc/);
+ * // => false
*/
-var pick = flatRest(function(object, paths) {
- return object == null ? {} : basePick(object, paths);
-});
-
-module.exports = pick;
+function isFunction(value) {
+ if (!isObject_1(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;
+}
+var isFunction_1 = isFunction;
-/***/ }),
+/** Used to detect overreaching core-js shims. */
+var coreJsData = _root['__core-js_shared__'];
-/***/ "./node_modules/lodash/property.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/property.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var _coreJsData = coreJsData;
-var baseProperty = __webpack_require__(/*! ./_baseProperty */ "./node_modules/lodash/_baseProperty.js"),
- basePropertyDeep = __webpack_require__(/*! ./_basePropertyDeep */ "./node_modules/lodash/_basePropertyDeep.js"),
- isKey = __webpack_require__(/*! ./_isKey */ "./node_modules/lodash/_isKey.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js");
+/** 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) : '';
+}());
/**
- * 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]
+ * Checks if `func` has its source masked.
*
- * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
- * // => [1, 2]
+ * @private
+ * @param {Function} func The function to check.
+ * @returns {boolean} Returns `true` if `func` is masked, else `false`.
*/
-function property(path) {
- return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
+function isMasked(func) {
+ return !!maskSrcKey && (maskSrcKey in func);
}
-module.exports = property;
+var _isMasked = isMasked;
+/** Used for built-in method references. */
+var funcProto$1 = Function.prototype;
-/***/ }),
+/** Used to resolve the decompiled source of functions. */
+var funcToString$1 = funcProto$1.toString;
-/***/ "./node_modules/lodash/range.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/range.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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$1.call(func);
+ } catch (e) {}
+ try {
+ return (func + '');
+ } catch (e) {}
+ }
+ return '';
+}
-var createRange = __webpack_require__(/*! ./_createRange */ "./node_modules/lodash/_createRange.js");
+var _toSource = toSource;
/**
- * 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);
- * // => []
+ * Used to match `RegExp`
+ * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
*/
-var range = createRange();
+var reRegExpChar = /[\\^$.*+?()[\]{}|]/g;
-module.exports = range;
+/** Used to detect host constructors (Safari). */
+var reIsHostCtor = /^\[object .+?Constructor\]$/;
+/** Used for built-in method references. */
+var funcProto = Function.prototype,
+ objectProto$3 = Object.prototype;
-/***/ }),
+/** Used to resolve the decompiled source of functions. */
+var funcToString = funcProto.toString;
-/***/ "./node_modules/lodash/reduce.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/reduce.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/** Used to check objects for own properties. */
+var hasOwnProperty$3 = objectProto$3.hasOwnProperty;
-var arrayReduce = __webpack_require__(/*! ./_arrayReduce */ "./node_modules/lodash/_arrayReduce.js"),
- baseEach = __webpack_require__(/*! ./_baseEach */ "./node_modules/lodash/_baseEach.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- baseReduce = __webpack_require__(/*! ./_baseReduce */ "./node_modules/lodash/_baseReduce.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js");
+/** Used to detect if a method is native. */
+var reIsNative = RegExp('^' +
+ funcToString.call(hasOwnProperty$3).replace(reRegExpChar, '\\$&')
+ .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+);
/**
- * 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
+ * The base implementation of `_.isNative` without bad shim checks.
*
- * _.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)
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a native function,
+ * else `false`.
*/
-function reduce(collection, iteratee, accumulator) {
- var func = isArray(collection) ? arrayReduce : baseReduce,
- initAccum = arguments.length < 3;
+function baseIsNative(value) {
+ if (!isObject_1(value) || _isMasked(value)) {
+ return false;
+ }
+ var pattern = isFunction_1(value) ? reIsNative : reIsHostCtor;
+ return pattern.test(_toSource(value));
+}
- return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);
+var _baseIsNative = baseIsNative;
+
+/**
+ * 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$1(object, key) {
+ return object == null ? undefined : object[key];
}
-module.exports = reduce;
+var _getValue = getValue$1;
+/**
+ * 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;
+}
-/***/ }),
+var _getNative = getNative;
-/***/ "./node_modules/lodash/set.js":
-/*!************************************!*\
- !*** ./node_modules/lodash/set.js ***!
- \************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/* Built-in method references that are verified to be native. */
+var nativeCreate = _getNative(Object, 'create');
-var baseSet = __webpack_require__(/*! ./_baseSet */ "./node_modules/lodash/_baseSet.js");
+var _nativeCreate = nativeCreate;
/**
- * 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
+ * Removes all key-value entries from the hash.
*
- * _.set(object, ['x', '0', 'y', 'z'], 5);
- * console.log(object.x[0].y.z);
- * // => 5
+ * @private
+ * @name clear
+ * @memberOf Hash
*/
-function set(object, path, value) {
- return object == null ? object : baseSet(object, path, value);
+function hashClear() {
+ this.__data__ = _nativeCreate ? _nativeCreate(null) : {};
+ this.size = 0;
}
-module.exports = set;
+var _hashClear = hashClear;
+/**
+ * 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;
+}
-/***/ }),
+var _hashDelete = hashDelete;
-/***/ "./node_modules/lodash/size.js":
-/*!*************************************!*\
- !*** ./node_modules/lodash/size.js ***!
- \*************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED$1 = '__lodash_hash_undefined__';
-var baseKeys = __webpack_require__(/*! ./_baseKeys */ "./node_modules/lodash/_baseKeys.js"),
- getTag = __webpack_require__(/*! ./_getTag */ "./node_modules/lodash/_getTag.js"),
- isArrayLike = __webpack_require__(/*! ./isArrayLike */ "./node_modules/lodash/isArrayLike.js"),
- isString = __webpack_require__(/*! ./isString */ "./node_modules/lodash/isString.js"),
- stringSize = __webpack_require__(/*! ./_stringSize */ "./node_modules/lodash/_stringSize.js");
+/** Used for built-in method references. */
+var objectProto$2 = Object.prototype;
-/** `Object#toString` result references. */
-var mapTag = '[object Map]',
- setTag = '[object Set]';
+/** Used to check objects for own properties. */
+var hasOwnProperty$2 = objectProto$2.hasOwnProperty;
/**
- * 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
+ * Gets the hash value for `key`.
*
- * _.size('pebbles');
- * // => 7
+ * @private
+ * @name get
+ * @memberOf Hash
+ * @param {string} key The key of the value to get.
+ * @returns {*} Returns the entry value.
*/
-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;
+function hashGet(key) {
+ var data = this.__data__;
+ if (_nativeCreate) {
+ var result = data[key];
+ return result === HASH_UNDEFINED$1 ? undefined : result;
}
- return baseKeys(collection).length;
+ return hasOwnProperty$2.call(data, key) ? data[key] : undefined;
}
-module.exports = size;
+var _hashGet = hashGet;
+/** Used for built-in method references. */
+var objectProto$1 = Object.prototype;
-/***/ }),
+/** Used to check objects for own properties. */
+var hasOwnProperty$1 = objectProto$1.hasOwnProperty;
-/***/ "./node_modules/lodash/sortBy.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/sortBy.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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$1.call(data, key);
+}
-var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js"),
- baseOrderBy = __webpack_require__(/*! ./_baseOrderBy */ "./node_modules/lodash/_baseOrderBy.js"),
- baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
- isIterateeCall = __webpack_require__(/*! ./_isIterateeCall */ "./node_modules/lodash/_isIterateeCall.js");
+var _hashHas = hashHas;
+
+/** Used to stand-in for `undefined` hash values. */
+var HASH_UNDEFINED = '__lodash_hash_undefined__';
/**
- * 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': 30 },
- * { 'user': 'barney', 'age': 34 }
- * ];
- *
- * _.sortBy(users, [function(o) { return o.user; }]);
- * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]
+ * Sets the hash `key` to `value`.
*
- * _.sortBy(users, ['user', 'age']);
- * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]
+ * @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.
*/
-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]];
+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;
+}
+
+var _hashSet = hashSet;
+
+/**
+ * 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]);
}
- return baseOrderBy(collection, baseFlatten(iteratees, 1), []);
-});
+}
-module.exports = sortBy;
+// Add methods to `Hash`.
+Hash.prototype.clear = _hashClear;
+Hash.prototype['delete'] = _hashDelete;
+Hash.prototype.get = _hashGet;
+Hash.prototype.has = _hashHas;
+Hash.prototype.set = _hashSet;
+var _Hash = Hash;
-/***/ }),
+/**
+ * Removes all key-value entries from the list cache.
+ *
+ * @private
+ * @name clear
+ * @memberOf ListCache
+ */
+function listCacheClear() {
+ this.__data__ = [];
+ this.size = 0;
+}
-/***/ "./node_modules/lodash/stubArray.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/stubArray.js ***!
- \******************************************/
-/***/ (function(module) {
+var _listCacheClear = listCacheClear;
/**
- * This method returns a new empty array.
+ * 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.13.0
- * @category Util
- * @returns {Array} Returns the new empty array.
+ * @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 arrays = _.times(2, _.stubArray);
+ * var object = { 'a': 1 };
+ * var other = { 'a': 1 };
*
- * console.log(arrays);
- * // => [[], []]
+ * _.eq(object, object);
+ * // => true
*
- * console.log(arrays[0] === arrays[1]);
+ * _.eq(object, other);
+ * // => false
+ *
+ * _.eq('a', 'a');
+ * // => true
+ *
+ * _.eq('a', Object('a'));
* // => false
+ *
+ * _.eq(NaN, NaN);
+ * // => true
*/
-function stubArray() {
- return [];
+function eq(value, other) {
+ return value === other || (value !== value && other !== other);
}
-module.exports = stubArray;
+var eq_1 = eq;
+
+/**
+ * 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_1(array[length][0], key)) {
+ return length;
+ }
+ }
+ return -1;
+}
+var _assocIndexOf = assocIndexOf;
-/***/ }),
+/** Used for built-in method references. */
+var arrayProto = Array.prototype;
-/***/ "./node_modules/lodash/stubFalse.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/stubFalse.js ***!
- \******************************************/
-/***/ (function(module) {
+/** Built-in value references. */
+var splice = arrayProto.splice;
/**
- * This method returns `false`.
- *
- * @static
- * @memberOf _
- * @since 4.13.0
- * @category Util
- * @returns {boolean} Returns `false`.
- * @example
+ * Removes `key` and its value from the list cache.
*
- * _.times(2, _.stubFalse);
- * // => [false, false]
+ * @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 stubFalse() {
- return 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;
}
-module.exports = stubFalse;
+var _listCacheDelete = listCacheDelete;
+/**
+ * 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];
+}
-/***/ "./node_modules/lodash/toFinite.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/toFinite.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var _listCacheGet = listCacheGet;
-var toNumber = __webpack_require__(/*! ./toNumber */ "./node_modules/lodash/toNumber.js");
+/**
+ * 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;
+}
-/** Used as references for various `Number` constants. */
-var INFINITY = 1 / 0,
- MAX_INTEGER = 1.7976931348623157e+308;
+var _listCacheHas = listCacheHas;
/**
- * 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
+ * Sets the list cache `key` to `value`.
*
- * _.toFinite('3.2');
- * // => 3.2
+ * @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 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;
+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 value === value ? value : 0;
+ return this;
}
-module.exports = toFinite;
+var _listCacheSet = listCacheSet;
+/**
+ * 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]);
+ }
+}
-/***/ "./node_modules/lodash/toInteger.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/toInteger.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+// Add methods to `ListCache`.
+ListCache.prototype.clear = _listCacheClear;
+ListCache.prototype['delete'] = _listCacheDelete;
+ListCache.prototype.get = _listCacheGet;
+ListCache.prototype.has = _listCacheHas;
+ListCache.prototype.set = _listCacheSet;
-var toFinite = __webpack_require__(/*! ./toFinite */ "./node_modules/lodash/toFinite.js");
+var _ListCache = ListCache;
+
+/* Built-in method references that are verified to be native. */
+var Map$1 = _getNative(_root, 'Map');
+
+var _Map = Map$1;
/**
- * 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
+ * Removes all key-value entries from the map.
*
- * _.toInteger(3.2);
- * // => 3
+ * @private
+ * @name clear
+ * @memberOf MapCache
+ */
+function mapCacheClear() {
+ this.size = 0;
+ this.__data__ = {
+ 'hash': new _Hash,
+ 'map': new (_Map || _ListCache),
+ 'string': new _Hash
+ };
+}
+
+var _mapCacheClear = mapCacheClear;
+
+/**
+ * Checks if `value` is suitable for use as unique object key.
*
- * _.toInteger(Number.MIN_VALUE);
- * // => 0
+ * @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);
+}
+
+var _isKeyable = isKeyable;
+
+/**
+ * Gets the data for `map`.
*
- * _.toInteger(Infinity);
- * // => 1.7976931348623157e+308
+ * @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;
+}
+
+var _getMapData = getMapData;
+
+/**
+ * Removes `key` and its value from the map.
*
- * _.toInteger('3.2');
- * // => 3
+ * @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 toInteger(value) {
- var result = toFinite(value),
- remainder = result % 1;
+function mapCacheDelete(key) {
+ var result = _getMapData(this, key)['delete'](key);
+ this.size -= result ? 1 : 0;
+ return result;
+}
- return result === result ? (remainder ? result - remainder : result) : 0;
+var _mapCacheDelete = mapCacheDelete;
+
+/**
+ * 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);
}
-module.exports = toInteger;
+var _mapCacheGet = mapCacheGet;
+/**
+ * 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);
+}
-/***/ }),
+var _mapCacheHas = mapCacheHas;
-/***/ "./node_modules/lodash/toNumber.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/toNumber.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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;
-var baseTrim = __webpack_require__(/*! ./_baseTrim */ "./node_modules/lodash/_baseTrim.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js");
+ data.set(key, value);
+ this.size += data.size == size ? 0 : 1;
+ return this;
+}
-/** Used as references for various `Number` constants. */
-var NAN = 0 / 0;
+var _mapCacheSet = mapCacheSet;
-/** Used to detect bad signed hexadecimal string values. */
-var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+/**
+ * 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;
-/** Used to detect binary string values. */
-var reIsBinary = /^0b[01]+$/i;
+ this.clear();
+ while (++index < length) {
+ var entry = entries[index];
+ this.set(entry[0], entry[1]);
+ }
+}
-/** Used to detect octal string values. */
-var reIsOctal = /^0o[0-7]+$/i;
+// Add methods to `MapCache`.
+MapCache.prototype.clear = _mapCacheClear;
+MapCache.prototype['delete'] = _mapCacheDelete;
+MapCache.prototype.get = _mapCacheGet;
+MapCache.prototype.has = _mapCacheHas;
+MapCache.prototype.set = _mapCacheSet;
-/** Built-in method references without a dependency on `root`. */
-var freeParseInt = parseInt;
+var _MapCache = MapCache;
+
+/** Error message constants. */
+var FUNC_ERROR_TEXT = 'Expected a function';
/**
- * Converts `value` to a number.
+ * 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 4.0.0
- * @category Lang
- * @param {*} value The value to process.
- * @returns {number} Returns the number.
+ * @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
*
- * _.toNumber(3.2);
- * // => 3.2
+ * var object = { 'a': 1, 'b': 2 };
+ * var other = { 'c': 3, 'd': 4 };
*
- * _.toNumber(Number.MIN_VALUE);
- * // => 5e-324
+ * var values = _.memoize(_.values);
+ * values(object);
+ * // => [1, 2]
*
- * _.toNumber(Infinity);
- * // => Infinity
+ * values(other);
+ * // => [3, 4]
*
- * _.toNumber('3.2');
- * // => 3.2
+ * 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 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;
+function memoize(func, resolver) {
+ if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
+ throw new TypeError(FUNC_ERROR_TEXT);
}
- value = baseTrim(value);
- var isBinary = reIsBinary.test(value);
- return (isBinary || reIsOctal.test(value))
- ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
- : (reIsBadHex.test(value) ? NAN : +value);
-}
-
-module.exports = toNumber;
+ 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;
-/***/ "./node_modules/lodash/toPath.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/toPath.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var memoize_1 = memoize;
-var arrayMap = __webpack_require__(/*! ./_arrayMap */ "./node_modules/lodash/_arrayMap.js"),
- copyArray = __webpack_require__(/*! ./_copyArray */ "./node_modules/lodash/_copyArray.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isSymbol = __webpack_require__(/*! ./isSymbol */ "./node_modules/lodash/isSymbol.js"),
- stringToPath = __webpack_require__(/*! ./_stringToPath */ "./node_modules/lodash/_stringToPath.js"),
- toKey = __webpack_require__(/*! ./_toKey */ "./node_modules/lodash/_toKey.js"),
- toString = __webpack_require__(/*! ./toString */ "./node_modules/lodash/toString.js");
+/** Used as the maximum memoize cache size. */
+var MAX_MEMOIZE_SIZE = 500;
/**
- * 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']
+ * A specialized version of `_.memoize` which clears the memoized function's
+ * cache when it exceeds `MAX_MEMOIZE_SIZE`.
*
- * _.toPath('a[0].b.c');
- * // => ['a', '0', 'b', 'c']
+ * @private
+ * @param {Function} func The function to have its output memoized.
+ * @returns {Function} Returns the new memoized function.
*/
-function toPath(value) {
- if (isArray(value)) {
- return arrayMap(value, toKey);
- }
- return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));
+function memoizeCapped(func) {
+ var result = memoize_1(func, function(key) {
+ if (cache.size === MAX_MEMOIZE_SIZE) {
+ cache.clear();
+ }
+ return key;
+ });
+
+ var cache = result.cache;
+ return result;
}
-module.exports = toPath;
+var _memoizeCapped = memoizeCapped;
+/** Used to match property names within property paths. */
+var rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
-/***/ }),
+/** Used to match backslashes in property paths. */
+var reEscapeChar = /\\(\\)?/g;
-/***/ "./node_modules/lodash/toPlainObject.js":
-/*!**********************************************!*\
- !*** ./node_modules/lodash/toPlainObject.js ***!
- \**********************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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 (string.charCodeAt(0) === 46 /* . */) {
+ result.push('');
+ }
+ string.replace(rePropName, function(match, number, quote, subString) {
+ result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
+ });
+ return result;
+});
-var copyObject = __webpack_require__(/*! ./_copyObject */ "./node_modules/lodash/_copyObject.js"),
- keysIn = __webpack_require__(/*! ./keysIn */ "./node_modules/lodash/keysIn.js");
+var _stringToPath = stringToPath;
/**
- * 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 }
+ * A specialized version of `_.map` for arrays without support for iteratee
+ * shorthands.
*
- * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
- * // => { 'a': 1, 'b': 2, 'c': 3 }
+ * @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 toPlainObject(value) {
- return copyObject(value, keysIn(value));
+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;
}
-module.exports = toPlainObject;
+var _arrayMap = arrayMap;
+/** Used as references for various `Number` constants. */
+var INFINITY$1 = 1 / 0;
-/***/ }),
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = _Symbol ? _Symbol.prototype : undefined,
+ symbolToString = symbolProto ? symbolProto.toString : undefined;
-/***/ "./node_modules/lodash/toString.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/toString.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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_1(value)) {
+ // Recursively convert values (susceptible to call stack limits).
+ return _arrayMap(value, baseToString) + '';
+ }
+ if (isSymbol_1(value)) {
+ return symbolToString ? symbolToString.call(value) : '';
+ }
+ var result = (value + '');
+ return (result == '0' && (1 / value) == -INFINITY$1) ? '-0' : result;
+}
-var baseToString = __webpack_require__(/*! ./_baseToString */ "./node_modules/lodash/_baseToString.js");
+var _baseToString = baseToString;
/**
* Converts `value` to a string. An empty string is returned for `null`
@@ -71108,11623 +60548,23693 @@ var baseToString = __webpack_require__(/*! ./_baseToString */ "./node_modules/lo
* _.toString([1, 2, 3]);
* // => '1,2,3'
*/
-function toString(value) {
- return value == null ? '' : baseToString(value);
+function toString$1(value) {
+ return value == null ? '' : _baseToString(value);
}
-module.exports = toString;
-
+var toString_1 = toString$1;
-/***/ }),
+/**
+ * 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_1(value)) {
+ return value;
+ }
+ return _isKey(value, object) ? [value] : _stringToPath(toString_1(value));
+}
-/***/ "./node_modules/lodash/transform.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/transform.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+var _castPath = castPath;
-var arrayEach = __webpack_require__(/*! ./_arrayEach */ "./node_modules/lodash/_arrayEach.js"),
- baseCreate = __webpack_require__(/*! ./_baseCreate */ "./node_modules/lodash/_baseCreate.js"),
- baseForOwn = __webpack_require__(/*! ./_baseForOwn */ "./node_modules/lodash/_baseForOwn.js"),
- baseIteratee = __webpack_require__(/*! ./_baseIteratee */ "./node_modules/lodash/_baseIteratee.js"),
- getPrototype = __webpack_require__(/*! ./_getPrototype */ "./node_modules/lodash/_getPrototype.js"),
- isArray = __webpack_require__(/*! ./isArray */ "./node_modules/lodash/isArray.js"),
- isBuffer = __webpack_require__(/*! ./isBuffer */ "./node_modules/lodash/isBuffer.js"),
- isFunction = __webpack_require__(/*! ./isFunction */ "./node_modules/lodash/isFunction.js"),
- isObject = __webpack_require__(/*! ./isObject */ "./node_modules/lodash/isObject.js"),
- isTypedArray = __webpack_require__(/*! ./isTypedArray */ "./node_modules/lodash/isTypedArray.js");
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
/**
- * 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]
+ * Converts `value` to a string key if it's not a string or symbol.
*
- * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
- * (result[value] || (result[value] = [])).push(key);
- * }, {});
- * // => { '1': ['a', 'c'], '2': ['b'] }
+ * @private
+ * @param {*} value The value to inspect.
+ * @returns {string|symbol} Returns the key.
*/
-function transform(object, iteratee, accumulator) {
- var isArr = isArray(object),
- isArrLike = isArr || isBuffer(object) || isTypedArray(object);
-
- iteratee = baseIteratee(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 = {};
- }
+function toKey(value) {
+ if (typeof value == 'string' || isSymbol_1(value)) {
+ return value;
}
- (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {
- return iteratee(accumulator, value, index, object);
- });
- return accumulator;
+ var result = (value + '');
+ return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
}
-module.exports = transform;
+var _toKey = toKey;
+/**
+ * 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;
-/***/ "./node_modules/lodash/union.js":
-/*!**************************************!*\
- !*** ./node_modules/lodash/union.js ***!
- \**************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ while (object != null && index < length) {
+ object = object[_toKey(path[index++])];
+ }
+ return (index && index == length) ? object : undefined;
+}
-var baseFlatten = __webpack_require__(/*! ./_baseFlatten */ "./node_modules/lodash/_baseFlatten.js"),
- baseRest = __webpack_require__(/*! ./_baseRest */ "./node_modules/lodash/_baseRest.js"),
- baseUniq = __webpack_require__(/*! ./_baseUniq */ "./node_modules/lodash/_baseUniq.js"),
- isArrayLikeObject = __webpack_require__(/*! ./isArrayLikeObject */ "./node_modules/lodash/isArrayLikeObject.js");
+var _baseGet = baseGet;
/**
- * 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.
+ * Gets the value at `path` of `object`. If the resolved value is
+ * `undefined`, the `defaultValue` is returned in its place.
*
* @static
* @memberOf _
- * @since 0.1.0
- * @category Array
- * @param {...Array} [arrays] The arrays to inspect.
- * @returns {Array} Returns the new array of combined values.
+ * @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
*
- * _.union([2], [1, 2]);
- * // => [2, 1]
+ * 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'
*/
-var union = baseRest(function(arrays) {
- return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));
-});
+function get(object, path, defaultValue) {
+ var result = object == null ? undefined : _baseGet(object, path);
+ return result === undefined ? defaultValue : result;
+}
-module.exports = union;
+var get_1 = get;
+var defineProperty = (function() {
+ try {
+ var func = _getNative(Object, 'defineProperty');
+ func({}, '', {});
+ return func;
+ } catch (e) {}
+}());
-/***/ }),
+var _defineProperty = defineProperty;
-/***/ "./node_modules/lodash/uniqueId.js":
-/*!*****************************************!*\
- !*** ./node_modules/lodash/uniqueId.js ***!
- \*****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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;
+ }
+}
-var toString = __webpack_require__(/*! ./toString */ "./node_modules/lodash/toString.js");
+var _baseAssignValue = baseAssignValue;
-/** Used to generate unique IDs. */
-var idCounter = 0;
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
/**
- * 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'
+ * 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.
*
- * _.uniqueId();
- * // => '105'
+ * @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 uniqueId(prefix) {
- var id = ++idCounter;
- return toString(prefix) + id;
+function assignValue(object, key, value) {
+ var objValue = object[key];
+ if (!(hasOwnProperty.call(object, key) && eq_1(objValue, value)) ||
+ (value === undefined && !(key in object))) {
+ _baseAssignValue(object, key, value);
+ }
}
-module.exports = uniqueId;
+var _assignValue = assignValue;
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
-/***/ }),
+/** Used to detect unsigned integer values. */
+var reIsUint = /^(?:0|[1-9]\d*)$/;
-/***/ "./node_modules/lodash/values.js":
-/*!***************************************!*\
- !*** ./node_modules/lodash/values.js ***!
- \***************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+/**
+ * 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) {
+ var type = typeof value;
+ length = length == null ? MAX_SAFE_INTEGER : length;
-var baseValues = __webpack_require__(/*! ./_baseValues */ "./node_modules/lodash/_baseValues.js"),
- keys = __webpack_require__(/*! ./keys */ "./node_modules/lodash/keys.js");
+ return !!length &&
+ (type == 'number' ||
+ (type != 'symbol' && reIsUint.test(value))) &&
+ (value > -1 && value % 1 == 0 && value < length);
+}
+
+var _isIndex = isIndex;
/**
- * 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)
+ * The base implementation of `_.set`.
*
- * _.values('hi');
- * // => ['h', 'i']
+ * @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 values(object) {
- return object == null ? [] : baseValues(object, keys(object));
-}
+function baseSet(object, path, value, customizer) {
+ if (!isObject_1(object)) {
+ return object;
+ }
+ path = _castPath(path, object);
-module.exports = values;
+ var index = -1,
+ length = path.length,
+ lastIndex = length - 1,
+ nested = object;
+ while (nested != null && ++index < length) {
+ var key = _toKey(path[index]),
+ newValue = value;
-/***/ }),
+ if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
+ return object;
+ }
-/***/ "./node_modules/lodash/zipObject.js":
-/*!******************************************!*\
- !*** ./node_modules/lodash/zipObject.js ***!
- \******************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
+ if (index != lastIndex) {
+ var objValue = nested[key];
+ newValue = customizer ? customizer(objValue, key, nested) : undefined;
+ if (newValue === undefined) {
+ newValue = isObject_1(objValue)
+ ? objValue
+ : (_isIndex(path[index + 1]) ? [] : {});
+ }
+ }
+ _assignValue(nested, key, newValue);
+ nested = nested[key];
+ }
+ return object;
+}
-var assignValue = __webpack_require__(/*! ./_assignValue */ "./node_modules/lodash/_assignValue.js"),
- baseZipObject = __webpack_require__(/*! ./_baseZipObject */ "./node_modules/lodash/_baseZipObject.js");
+var _baseSet = baseSet;
/**
- * This method is like `_.fromPairs` except that it accepts two arrays,
- * one of property identifiers and one of corresponding values.
+ * 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 0.4.0
- * @category Array
- * @param {Array} [props=[]] The property identifiers.
- * @param {Array} [values=[]] The property values.
- * @returns {Object} Returns the new object.
+ * @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
*
- * _.zipObject(['a', 'b'], [1, 2]);
- * // => { 'a': 1, 'b': 2 }
+ * 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 zipObject(props, values) {
- return baseZipObject(props || [], values || [], assignValue);
+function set(object, path, value) {
+ return object == null ? object : _baseSet(object, path, value);
}
-module.exports = zipObject;
-
-
-/***/ }),
-
-/***/ "./node_modules/prop-types/lib/ReactPropTypesSecret.js":
-/*!*************************************************************!*\
- !*** ./node_modules/prop-types/lib/ReactPropTypesSecret.js ***!
- \*************************************************************/
-/***/ (function(module) {
+var set_1 = set;
-"use strict";
/**
- * Copyright (c) 2013-present, Facebook, Inc.
+ * Copies the values of `source` to `array`.
*
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
+ * @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;
-
-
-var ReactPropTypesSecret = 'SECRET_DO_NOT_PASS_THIS_OR_YOU_WILL_BE_FIRED';
-
-module.exports = ReactPropTypesSecret;
-
-
-/***/ }),
-
-/***/ "./node_modules/react-base16-styling/lib/esm/colorConverters.js":
-/*!**********************************************************************!*\
- !*** ./node_modules/react-base16-styling/lib/esm/colorConverters.js ***!
- \**********************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ rgb2yuv: function() { return /* binding */ rgb2yuv; },
-/* harmony export */ yuv2rgb: function() { return /* binding */ yuv2rgb; }
-/* harmony export */ });
-function yuv2rgb(yuv) {
- var y = yuv[0],
- u = yuv[1],
- v = yuv[2];
- var r, g, b;
- r = y * 1 + u * 0 + v * 1.13983;
- g = y * 1 + u * -0.39465 + v * -0.5806;
- b = y * 1 + u * 2.02311 + v * 0;
- r = Math.min(Math.max(0, r), 1);
- g = Math.min(Math.max(0, g), 1);
- b = Math.min(Math.max(0, b), 1);
- return [r * 255, g * 255, b * 255];
-}
-function rgb2yuv(rgb) {
- var r = rgb[0] / 255,
- g = rgb[1] / 255,
- b = rgb[2] / 255;
- var y = r * 0.299 + g * 0.587 + b * 0.114;
- var u = r * -0.14713 + g * -0.28886 + b * 0.436;
- var v = r * 0.615 + g * -0.51499 + b * -0.10001;
- return [y, u, v];
+ array || (array = Array(length));
+ while (++index < length) {
+ array[index] = source[index];
+ }
+ return array;
}
-/***/ }),
+var _copyArray = copyArray;
-/***/ "./node_modules/react-base16-styling/lib/esm/index.js":
-/*!************************************************************!*\
- !*** ./node_modules/react-base16-styling/lib/esm/index.js ***!
- \************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+/**
+ * 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_1(value)) {
+ return _arrayMap(value, _toKey);
+ }
+ return isSymbol_1(value) ? [value] : _copyArray(_stringToPath(toString_1(value)));
+}
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ createStyling: function() { return /* binding */ createStyling; },
-/* harmony export */ getBase16Theme: function() { return /* binding */ getBase16Theme; },
-/* harmony export */ invertBase16Theme: function() { return /* binding */ invertBase16Theme; },
-/* harmony export */ invertTheme: function() { return /* binding */ invertTheme; }
-/* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/typeof */ "./node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/slicedToArray */ "./node_modules/@babel/runtime/helpers/esm/slicedToArray.js");
-/* harmony import */ var base16__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! base16 */ "./node_modules/base16/lib/index.js");
-/* harmony import */ var color__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! color */ "./node_modules/color/index.js");
-/* harmony import */ var color__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(color__WEBPACK_IMPORTED_MODULE_4__);
-/* harmony import */ var lodash_curry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! lodash.curry */ "./node_modules/lodash.curry/index.js");
-/* harmony import */ var lodash_curry__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(lodash_curry__WEBPACK_IMPORTED_MODULE_5__);
-/* harmony import */ var _colorConverters__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./colorConverters */ "./node_modules/react-base16-styling/lib/esm/colorConverters.js");
+var toPath_1 = toPath;
+var define$2 = {
+ // access data field
+ data: function data(params) {
+ var defaults = {
+ field: 'data',
+ bindingEvent: 'data',
+ allowBinding: false,
+ allowSetting: false,
+ allowGetting: false,
+ settingEvent: 'data',
+ settingTriggersEvent: false,
+ triggerFnName: 'trigger',
+ immutableKeys: {},
+ // key => true if immutable
+ updateStyle: false,
+ beforeGet: function beforeGet(self) {},
+ beforeSet: function beforeSet(self, obj) {},
+ onSet: function onSet(self) {},
+ canSet: function canSet(self) {
+ return true;
+ }
+ };
+ params = extend({}, defaults, params);
+ return function dataImpl(name, value) {
+ var p = params;
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
+ var single = selfIsArrayLike ? self[0] : self;
+ // .data('foo', ...)
+ if (string(name)) {
+ // set or get property
+ var isPathLike = name.indexOf('.') !== -1; // there might be a normal field with a dot
+ var path = isPathLike && toPath_1(name);
+ // .data('foo')
+ if (p.allowGetting && value === undefined) {
+ // get
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+ var ret;
+ if (single) {
+ p.beforeGet(single);
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+ // check if it's path and a field with the same name doesn't exist
+ if (path && single._private[p.field][name] === undefined) {
+ ret = get_1(single._private[p.field], path);
+ } else {
+ ret = single._private[p.field][name];
+ }
+ }
+ return ret;
+ // .data('foo', 'bar')
+ } else if (p.allowSetting && value !== undefined) {
+ // set
+ var valid = !p.immutableKeys[name];
+ if (valid) {
+ var change = _defineProperty$1({}, name, value);
+ p.beforeSet(self, change);
+ for (var i = 0, l = all.length; i < l; i++) {
+ var ele = all[i];
+ if (p.canSet(ele)) {
+ if (path && single._private[p.field][name] === undefined) {
+ set_1(ele._private[p.field], path, value);
+ } else {
+ ele._private[p.field][name] = value;
+ }
+ }
+ }
+ // update mappers if asked
+ if (p.updateStyle) {
+ self.updateStyle();
+ }
+ // call onSet callback
+ p.onSet(self);
+ if (p.settingTriggersEvent) {
+ self[p.triggerFnName](p.settingEvent);
+ }
+ }
+ }
+ // .data({ 'foo': 'bar' })
+ } else if (p.allowSetting && plainObject(name)) {
+ // extend
+ var obj = name;
+ var k, v;
+ var keys = Object.keys(obj);
+ p.beforeSet(self, obj);
+ for (var _i = 0; _i < keys.length; _i++) {
+ k = keys[_i];
+ v = obj[k];
+ var _valid = !p.immutableKeys[k];
+ if (_valid) {
+ for (var j = 0; j < all.length; j++) {
+ var _ele = all[j];
+ if (p.canSet(_ele)) {
+ _ele._private[p.field][k] = v;
+ }
+ }
+ }
+ }
-var DEFAULT_BASE16 = base16__WEBPACK_IMPORTED_MODULE_3__["default"];
-var BASE16_KEYS = Object.keys(DEFAULT_BASE16); // we need a correcting factor, so that a dark, but not black background color
-// converts to bright enough inversed color
+ // update mappers if asked
+ if (p.updateStyle) {
+ self.updateStyle();
+ }
-var flip = function flip(x) {
- return x < 0.25 ? 1 : x < 0.5 ? 0.9 - x : 1.1 - x;
-};
+ // call onSet callback
+ p.onSet(self);
+ if (p.settingTriggersEvent) {
+ self[p.triggerFnName](p.settingEvent);
+ }
-var invertColor = function invertColor(hexString) {
- var color = color__WEBPACK_IMPORTED_MODULE_4___default()(hexString);
+ // .data(function(){ ... })
+ } else if (p.allowBinding && fn$6(name)) {
+ // bind to event
+ var fn = name;
+ self.on(p.bindingEvent, fn);
- var _rgb2yuv = (0,_colorConverters__WEBPACK_IMPORTED_MODULE_6__.rgb2yuv)(color.array()),
- _rgb2yuv2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__["default"])(_rgb2yuv, 3),
- y = _rgb2yuv2[0],
- u = _rgb2yuv2[1],
- v = _rgb2yuv2[2];
+ // .data()
+ } else if (p.allowGetting && name === undefined) {
+ // get whole object
+ var _ret;
+ if (single) {
+ p.beforeGet(single);
+ _ret = single._private[p.field];
+ }
+ return _ret;
+ }
+ return self; // maintain chainability
+ }; // function
+ },
- var flippedYuv = [flip(y), u, v];
- var rgb = (0,_colorConverters__WEBPACK_IMPORTED_MODULE_6__.yuv2rgb)(flippedYuv);
- return color__WEBPACK_IMPORTED_MODULE_4___default().rgb(rgb).hex();
-};
+ // data
-var merger = function merger(styling) {
- return function (prevStyling) {
- return {
- className: [prevStyling.className, styling.className].filter(Boolean).join(' '),
- style: _objectSpread(_objectSpread({}, prevStyling.style || {}), styling.style || {})
+ // remove data field
+ removeData: function removeData(params) {
+ var defaults = {
+ field: 'data',
+ event: 'data',
+ triggerFnName: 'trigger',
+ triggerEvent: false,
+ immutableKeys: {} // key => true if immutable
};
- };
-};
-
-var mergeStyling = function mergeStyling(customStyling, defaultStyling) {
- if (customStyling === undefined) {
- return defaultStyling;
- }
-
- if (defaultStyling === undefined) {
- return customStyling;
- }
-
- var customType = (0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(customStyling);
- var defaultType = (0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(defaultStyling);
+ params = extend({}, defaults, params);
+ return function removeDataImpl(names) {
+ var p = params;
+ var self = this;
+ var selfIsArrayLike = self.length !== undefined;
+ var all = selfIsArrayLike ? self : [self]; // put in array if not array-like
- switch (customType) {
- case 'string':
- switch (defaultType) {
- case 'string':
- return [defaultStyling, customStyling].filter(Boolean).join(' ');
+ // .removeData('foo bar')
+ if (string(names)) {
+ // then get the list of keys, and delete them
+ var keys = names.split(/\s+/);
+ var l = keys.length;
+ for (var i = 0; i < l; i++) {
+ // delete each non-empty key
+ var key = keys[i];
+ if (emptyString(key)) {
+ continue;
+ }
+ var valid = !p.immutableKeys[key]; // not valid if immutable
+ if (valid) {
+ for (var i_a = 0, l_a = all.length; i_a < l_a; i_a++) {
+ all[i_a]._private[p.field][key] = undefined;
+ }
+ }
+ }
+ if (p.triggerEvent) {
+ self[p.triggerFnName](p.event);
+ }
- case 'object':
- return merger({
- className: customStyling,
- style: defaultStyling
- });
+ // .removeData()
+ } else if (names === undefined) {
+ // then delete all keys
- case 'function':
- return function (styling) {
- for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
- args[_key - 1] = arguments[_key];
+ for (var _i_a = 0, _l_a = all.length; _i_a < _l_a; _i_a++) {
+ var _privateFields = all[_i_a]._private[p.field];
+ var _keys = Object.keys(_privateFields);
+ for (var _i2 = 0; _i2 < _keys.length; _i2++) {
+ var _key = _keys[_i2];
+ var validKeyToDelete = !p.immutableKeys[_key];
+ if (validKeyToDelete) {
+ _privateFields[_key] = undefined;
}
-
- return merger({
- className: customStyling
- })(defaultStyling.apply(void 0, [styling].concat(args)));
- };
+ }
+ }
+ if (p.triggerEvent) {
+ self[p.triggerFnName](p.event);
+ }
}
+ return self; // maintain chaining
+ }; // function
+ } // removeData
+}; // define
- break;
+var define$1 = {
+ eventAliasesOn: function eventAliasesOn(proto) {
+ var p = proto;
+ p.addListener = p.listen = p.bind = p.on;
+ p.unlisten = p.unbind = p.off = p.removeListener;
+ p.trigger = p.emit;
- case 'object':
- switch (defaultType) {
- case 'string':
- return merger({
- className: defaultStyling,
- style: customStyling
- });
+ // this is just a wrapper alias of .on()
+ p.pon = p.promiseOn = function (events, selector) {
+ var self = this;
+ var args = Array.prototype.slice.call(arguments, 0);
+ return new Promise$1(function (resolve, reject) {
+ var callback = function callback(e) {
+ self.off.apply(self, offArgs);
+ resolve(e);
+ };
+ var onArgs = args.concat([callback]);
+ var offArgs = onArgs.concat([]);
+ self.on.apply(self, onArgs);
+ });
+ };
+ }
+}; // define
- case 'object':
- return _objectSpread(_objectSpread({}, defaultStyling), customStyling);
+// use this module to cherry pick functions into your prototype
+var define = {};
+[define$3, define$2, define$1].forEach(function (m) {
+ extend(define, m);
+});
- case 'function':
- return function (styling) {
- for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {
- args[_key2 - 1] = arguments[_key2];
- }
+var elesfn$i = {
+ animate: define.animate(),
+ animation: define.animation(),
+ animated: define.animated(),
+ clearQueue: define.clearQueue(),
+ delay: define.delay(),
+ delayAnimation: define.delayAnimation(),
+ stop: define.stop()
+};
- return merger({
- style: customStyling
- })(defaultStyling.apply(void 0, [styling].concat(args)));
- };
+var elesfn$h = {
+ classes: function classes(_classes) {
+ var self = this;
+ if (_classes === undefined) {
+ var ret = [];
+ self[0]._private.classes.forEach(function (cls) {
+ return ret.push(cls);
+ });
+ return ret;
+ } else if (!array(_classes)) {
+ // extract classes from string
+ _classes = (_classes || '').match(/\S+/g) || [];
+ }
+ var changed = [];
+ var classesSet = new Set$1(_classes);
+
+ // check and update each ele
+ for (var j = 0; j < self.length; j++) {
+ var ele = self[j];
+ var _p = ele._private;
+ var eleClasses = _p.classes;
+ var changedEle = false;
+
+ // check if ele has all of the passed classes
+ for (var i = 0; i < _classes.length; i++) {
+ var cls = _classes[i];
+ var eleHasClass = eleClasses.has(cls);
+ if (!eleHasClass) {
+ changedEle = true;
+ break;
+ }
}
- break;
+ // check if ele has classes outside of those passed
+ if (!changedEle) {
+ changedEle = eleClasses.size !== _classes.length;
+ }
+ if (changedEle) {
+ _p.classes = classesSet;
+ changed.push(ele);
+ }
+ }
- case 'function':
- switch (defaultType) {
- case 'string':
- return function (styling) {
- for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {
- args[_key3 - 1] = arguments[_key3];
- }
+ // trigger update style on those eles that had class changes
+ if (changed.length > 0) {
+ this.spawn(changed).updateStyle().emit('class');
+ }
+ return self;
+ },
+ addClass: function addClass(classes) {
+ return this.toggleClass(classes, true);
+ },
+ hasClass: function hasClass(className) {
+ var ele = this[0];
+ return ele != null && ele._private.classes.has(className);
+ },
+ toggleClass: function toggleClass(classes, toggle) {
+ if (!array(classes)) {
+ // extract classes from string
+ classes = classes.match(/\S+/g) || [];
+ }
+ var self = this;
+ var toggleUndefd = toggle === undefined;
+ var changed = []; // eles who had classes changed
- return customStyling.apply(void 0, [merger(styling)({
- className: defaultStyling
- })].concat(args));
- };
+ for (var i = 0, il = self.length; i < il; i++) {
+ var ele = self[i];
+ var eleClasses = ele._private.classes;
+ var changedEle = false;
+ for (var j = 0; j < classes.length; j++) {
+ var cls = classes[j];
+ var hasClass = eleClasses.has(cls);
+ var changedNow = false;
+ if (toggle || toggleUndefd && !hasClass) {
+ eleClasses.add(cls);
+ changedNow = true;
+ } else if (!toggle || toggleUndefd && hasClass) {
+ eleClasses["delete"](cls);
+ changedNow = true;
+ }
+ if (!changedEle && changedNow) {
+ changed.push(ele);
+ changedEle = true;
+ }
+ } // for j classes
+ } // for i eles
- case 'object':
- return function (styling) {
- for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {
- args[_key4 - 1] = arguments[_key4];
- }
+ // trigger update style on those eles that had class changes
+ if (changed.length > 0) {
+ this.spawn(changed).updateStyle().emit('class');
+ }
+ return self;
+ },
+ removeClass: function removeClass(classes) {
+ return this.toggleClass(classes, false);
+ },
+ flashClass: function flashClass(classes, duration) {
+ var self = this;
+ if (duration == null) {
+ duration = 250;
+ } else if (duration === 0) {
+ return self; // nothing to do really
+ }
- return customStyling.apply(void 0, [merger(styling)({
- style: defaultStyling
- })].concat(args));
- };
+ self.addClass(classes);
+ setTimeout(function () {
+ self.removeClass(classes);
+ }, duration);
+ return self;
+ }
+};
+elesfn$h.className = elesfn$h.classNames = elesfn$h.classes;
- case 'function':
- return function (styling) {
- for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {
- args[_key5 - 1] = arguments[_key5];
- }
+// tokens in the query language
+var tokens = {
+ metaChar: '[\\!\\"\\#\\$\\%\\&\\\'\\(\\)\\*\\+\\,\\.\\/\\:\\;\\<\\=\\>\\?\\@\\[\\]\\^\\`\\{\\|\\}\\~]',
+ // chars we need to escape in let names, etc
+ comparatorOp: '=|\\!=|>|>=|<|<=|\\$=|\\^=|\\*=',
+ // binary comparison op (used in data selectors)
+ boolOp: '\\?|\\!|\\^',
+ // boolean (unary) operators (used in data selectors)
+ string: '"(?:\\\\"|[^"])*"' + '|' + "'(?:\\\\'|[^'])*'",
+ // string literals (used in data selectors) -- doublequotes | singlequotes
+ number: number,
+ // number literal (used in data selectors) --- e.g. 0.1234, 1234, 12e123
+ meta: 'degree|indegree|outdegree',
+ // allowed metadata fields (i.e. allowed functions to use from Collection)
+ separator: '\\s*,\\s*',
+ // queries are separated by commas, e.g. edge[foo = 'bar'], node.someClass
+ descendant: '\\s+',
+ child: '\\s+>\\s+',
+ subject: '\\$',
+ group: 'node|edge|\\*',
+ directedEdge: '\\s+->\\s+',
+ undirectedEdge: '\\s+<->\\s+'
+};
+tokens.variable = '(?:[\\w-.]|(?:\\\\' + tokens.metaChar + '))+'; // a variable name can have letters, numbers, dashes, and periods
+tokens.className = '(?:[\\w-]|(?:\\\\' + tokens.metaChar + '))+'; // a class name has the same rules as a variable except it can't have a '.' in the name
+tokens.value = tokens.string + '|' + tokens.number; // a value literal, either a string or number
+tokens.id = tokens.variable; // an element id (follows variable conventions)
- return customStyling.apply(void 0, [defaultStyling.apply(void 0, [styling].concat(args))].concat(args));
- };
- }
+(function () {
+ var ops, op, i;
+ // add @ variants to comparatorOp
+ ops = tokens.comparatorOp.split('|');
+ for (i = 0; i < ops.length; i++) {
+ op = ops[i];
+ tokens.comparatorOp += '|@' + op;
}
-};
-var mergeStylings = function mergeStylings(customStylings, defaultStylings) {
- var keys = Object.keys(defaultStylings);
+ // add ! variants to comparatorOp
+ ops = tokens.comparatorOp.split('|');
+ for (i = 0; i < ops.length; i++) {
+ op = ops[i];
+ if (op.indexOf('!') >= 0) {
+ continue;
+ } // skip ops that explicitly contain !
+ if (op === '=') {
+ continue;
+ } // skip = b/c != is explicitly defined
- for (var key in customStylings) {
- if (keys.indexOf(key) === -1) keys.push(key);
+ tokens.comparatorOp += '|\\!' + op;
}
+})();
- return keys.reduce(function (mergedStyling, key) {
- return mergedStyling[key] = mergeStyling(customStylings[key], defaultStylings[key]), mergedStyling;
- }, {});
+/**
+ * Make a new query object
+ *
+ * @prop type {Type} The type enum (int) of the query
+ * @prop checks List of checks to make against an ele to test for a match
+ */
+var newQuery = function newQuery() {
+ return {
+ checks: []
+ };
};
-var getStylingByKeys = function getStylingByKeys(mergedStyling, keys) {
- for (var _len6 = arguments.length, args = new Array(_len6 > 2 ? _len6 - 2 : 0), _key6 = 2; _key6 < _len6; _key6++) {
- args[_key6 - 2] = arguments[_key6];
- }
+/**
+ * A check type enum-like object. Uses integer values for fast match() lookup.
+ * The ordering does not matter as long as the ints are unique.
+ */
+var Type = {
+ /** E.g. node */
+ GROUP: 0,
+ /** A collection of elements */
+ COLLECTION: 1,
+ /** A filter(ele) function */
+ FILTER: 2,
+ /** E.g. [foo > 1] */
+ DATA_COMPARE: 3,
+ /** E.g. [foo] */
+ DATA_EXIST: 4,
+ /** E.g. [?foo] */
+ DATA_BOOL: 5,
+ /** E.g. [[degree > 2]] */
+ META_COMPARE: 6,
+ /** E.g. :selected */
+ STATE: 7,
+ /** E.g. #foo */
+ ID: 8,
+ /** E.g. .foo */
+ CLASS: 9,
+ /** E.g. #foo <-> #bar */
+ UNDIRECTED_EDGE: 10,
+ /** E.g. #foo -> #bar */
+ DIRECTED_EDGE: 11,
+ /** E.g. $#foo -> #bar */
+ NODE_SOURCE: 12,
+ /** E.g. #foo -> $#bar */
+ NODE_TARGET: 13,
+ /** E.g. $#foo <-> #bar */
+ NODE_NEIGHBOR: 14,
+ /** E.g. #foo > #bar */
+ CHILD: 15,
+ /** E.g. #foo #bar */
+ DESCENDANT: 16,
+ /** E.g. $#foo > #bar */
+ PARENT: 17,
+ /** E.g. $#foo #bar */
+ ANCESTOR: 18,
+ /** E.g. #foo > $bar > #baz */
+ COMPOUND_SPLIT: 19,
+ /** Always matches, useful placeholder for subject in `COMPOUND_SPLIT` */
+ TRUE: 20
+};
- if (keys === null) {
- return mergedStyling;
+var stateSelectors = [{
+ selector: ':selected',
+ matches: function matches(ele) {
+ return ele.selected();
}
-
- if (!Array.isArray(keys)) {
- keys = [keys];
+}, {
+ selector: ':unselected',
+ matches: function matches(ele) {
+ return !ele.selected();
}
-
- var styles = keys.map(function (key) {
- return mergedStyling[key];
- }).filter(Boolean);
- var props = styles.reduce(function (obj, s) {
- if (typeof s === 'string') {
- obj.className = [obj.className, s].filter(Boolean).join(' ');
- } else if ((0,_babel_runtime_helpers_typeof__WEBPACK_IMPORTED_MODULE_0__["default"])(s) === 'object') {
- obj.style = _objectSpread(_objectSpread({}, obj.style), s);
- } else if (typeof s === 'function') {
- obj = _objectSpread(_objectSpread({}, obj), s.apply(void 0, [obj].concat(args)));
+}, {
+ selector: ':selectable',
+ matches: function matches(ele) {
+ return ele.selectable();
+ }
+}, {
+ selector: ':unselectable',
+ matches: function matches(ele) {
+ return !ele.selectable();
+ }
+}, {
+ selector: ':locked',
+ matches: function matches(ele) {
+ return ele.locked();
+ }
+}, {
+ selector: ':unlocked',
+ matches: function matches(ele) {
+ return !ele.locked();
+ }
+}, {
+ selector: ':visible',
+ matches: function matches(ele) {
+ return ele.visible();
+ }
+}, {
+ selector: ':hidden',
+ matches: function matches(ele) {
+ return !ele.visible();
+ }
+}, {
+ selector: ':transparent',
+ matches: function matches(ele) {
+ return ele.transparent();
+ }
+}, {
+ selector: ':grabbed',
+ matches: function matches(ele) {
+ return ele.grabbed();
+ }
+}, {
+ selector: ':free',
+ matches: function matches(ele) {
+ return !ele.grabbed();
+ }
+}, {
+ selector: ':removed',
+ matches: function matches(ele) {
+ return ele.removed();
+ }
+}, {
+ selector: ':inside',
+ matches: function matches(ele) {
+ return !ele.removed();
+ }
+}, {
+ selector: ':grabbable',
+ matches: function matches(ele) {
+ return ele.grabbable();
+ }
+}, {
+ selector: ':ungrabbable',
+ matches: function matches(ele) {
+ return !ele.grabbable();
+ }
+}, {
+ selector: ':animated',
+ matches: function matches(ele) {
+ return ele.animated();
+ }
+}, {
+ selector: ':unanimated',
+ matches: function matches(ele) {
+ return !ele.animated();
+ }
+}, {
+ selector: ':parent',
+ matches: function matches(ele) {
+ return ele.isParent();
+ }
+}, {
+ selector: ':childless',
+ matches: function matches(ele) {
+ return ele.isChildless();
+ }
+}, {
+ selector: ':child',
+ matches: function matches(ele) {
+ return ele.isChild();
+ }
+}, {
+ selector: ':orphan',
+ matches: function matches(ele) {
+ return ele.isOrphan();
+ }
+}, {
+ selector: ':nonorphan',
+ matches: function matches(ele) {
+ return ele.isChild();
+ }
+}, {
+ selector: ':compound',
+ matches: function matches(ele) {
+ if (ele.isNode()) {
+ return ele.isParent();
+ } else {
+ return ele.source().isParent() || ele.target().isParent();
}
-
- return obj;
- }, {
- className: '',
- style: {}
- });
-
- if (!props.className) {
- delete props.className;
}
-
- if (Object.keys(props.style).length === 0) {
- delete props.style;
+}, {
+ selector: ':loop',
+ matches: function matches(ele) {
+ return ele.isLoop();
}
-
- return props;
+}, {
+ selector: ':simple',
+ matches: function matches(ele) {
+ return ele.isSimple();
+ }
+}, {
+ selector: ':active',
+ matches: function matches(ele) {
+ return ele.active();
+ }
+}, {
+ selector: ':inactive',
+ matches: function matches(ele) {
+ return !ele.active();
+ }
+}, {
+ selector: ':backgrounding',
+ matches: function matches(ele) {
+ return ele.backgrounding();
+ }
+}, {
+ selector: ':nonbackgrounding',
+ matches: function matches(ele) {
+ return !ele.backgrounding();
+ }
+}].sort(function (a, b) {
+ // n.b. selectors that are starting substrings of others must have the longer ones first
+ return descending(a.selector, b.selector);
+});
+var lookup = function () {
+ var selToFn = {};
+ var s;
+ for (var i = 0; i < stateSelectors.length; i++) {
+ s = stateSelectors[i];
+ selToFn[s.selector] = s.matches;
+ }
+ return selToFn;
+}();
+var stateSelectorMatches = function stateSelectorMatches(sel, ele) {
+ return lookup[sel](ele);
};
+var stateSelectorRegex = '(' + stateSelectors.map(function (s) {
+ return s.selector;
+}).join('|') + ')';
-var invertBase16Theme = function invertBase16Theme(base16Theme) {
- return Object.keys(base16Theme).reduce(function (t, key) {
- return t[key] = /^base/.test(key) ? invertColor(base16Theme[key]) : key === 'scheme' ? base16Theme[key] + ':inverted' : base16Theme[key], t;
- }, {});
+// when a token like a variable has escaped meta characters, we need to clean the backslashes out
+// so that values get compared properly in Selector.filter()
+var cleanMetaChars = function cleanMetaChars(str) {
+ return str.replace(new RegExp('\\\\(' + tokens.metaChar + ')', 'g'), function (match, $1) {
+ return $1;
+ });
+};
+var replaceLastQuery = function replaceLastQuery(selector, examiningQuery, replacementQuery) {
+ selector[selector.length - 1] = replacementQuery;
};
-var createStyling = lodash_curry__WEBPACK_IMPORTED_MODULE_5___default()(function (getStylingFromBase16) {
- var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
- var themeOrStyling = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
- var _options$defaultBase = options.defaultBase16,
- defaultBase16 = _options$defaultBase === void 0 ? DEFAULT_BASE16 : _options$defaultBase,
- _options$base16Themes = options.base16Themes,
- base16Themes = _options$base16Themes === void 0 ? null : _options$base16Themes;
- var base16Theme = getBase16Theme(themeOrStyling, base16Themes);
- if (base16Theme) {
- themeOrStyling = _objectSpread(_objectSpread({}, base16Theme), themeOrStyling);
+// NOTE: add new expression syntax here to have it recognised by the parser;
+// - a query contains all adjacent (i.e. no separator in between) expressions;
+// - the current query is stored in selector[i]
+// - you need to check the query objects in match() for it actually filter properly, but that's pretty straight forward
+var exprs = [{
+ name: 'group',
+ // just used for identifying when debugging
+ query: true,
+ regex: '(' + tokens.group + ')',
+ populate: function populate(selector, query, _ref) {
+ var _ref2 = _slicedToArray(_ref, 1),
+ group = _ref2[0];
+ query.checks.push({
+ type: Type.GROUP,
+ value: group === '*' ? group : group + 's'
+ });
}
-
- var theme = BASE16_KEYS.reduce(function (t, key) {
- return t[key] = themeOrStyling[key] || defaultBase16[key], t;
- }, {});
- var customStyling = Object.keys(themeOrStyling).reduce(function (s, key) {
- return BASE16_KEYS.indexOf(key) === -1 ? (s[key] = themeOrStyling[key], s) : s;
- }, {});
- var defaultStyling = getStylingFromBase16(theme);
- var mergedStyling = mergeStylings(customStyling, defaultStyling);
-
- for (var _len7 = arguments.length, args = new Array(_len7 > 3 ? _len7 - 3 : 0), _key7 = 3; _key7 < _len7; _key7++) {
- args[_key7 - 3] = arguments[_key7];
+}, {
+ name: 'state',
+ query: true,
+ regex: stateSelectorRegex,
+ populate: function populate(selector, query, _ref3) {
+ var _ref4 = _slicedToArray(_ref3, 1),
+ state = _ref4[0];
+ query.checks.push({
+ type: Type.STATE,
+ value: state
+ });
}
-
- return lodash_curry__WEBPACK_IMPORTED_MODULE_5___default()(getStylingByKeys, 2).apply(void 0, [mergedStyling].concat(args));
-}, 3);
-
-var isStylingConfig = function isStylingConfig(theme) {
- return !!theme.extend;
-};
-
-var getBase16Theme = function getBase16Theme(theme, base16Themes) {
- if (theme && isStylingConfig(theme) && theme.extend) {
- theme = theme.extend;
+}, {
+ name: 'id',
+ query: true,
+ regex: '\\#(' + tokens.id + ')',
+ populate: function populate(selector, query, _ref5) {
+ var _ref6 = _slicedToArray(_ref5, 1),
+ id = _ref6[0];
+ query.checks.push({
+ type: Type.ID,
+ value: cleanMetaChars(id)
+ });
}
-
- if (typeof theme === 'string') {
- var _theme$split = theme.split(':'),
- _theme$split2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_2__["default"])(_theme$split, 2),
- _themeName = _theme$split2[0],
- modifier = _theme$split2[1];
-
- if (base16Themes) {
- theme = base16Themes[_themeName];
- } else {
- theme = base16__WEBPACK_IMPORTED_MODULE_3__[_themeName];
- }
-
- if (modifier === 'inverted') {
- theme = invertBase16Theme(theme);
- }
+}, {
+ name: 'className',
+ query: true,
+ regex: '\\.(' + tokens.className + ')',
+ populate: function populate(selector, query, _ref7) {
+ var _ref8 = _slicedToArray(_ref7, 1),
+ className = _ref8[0];
+ query.checks.push({
+ type: Type.CLASS,
+ value: cleanMetaChars(className)
+ });
}
-
- return theme && Object.prototype.hasOwnProperty.call(theme, 'base00') ? theme : undefined;
-};
-var invertTheme = function invertTheme(theme) {
- if (typeof theme === 'string') {
- return "".concat(theme, ":inverted");
+}, {
+ name: 'dataExists',
+ query: true,
+ regex: '\\[\\s*(' + tokens.variable + ')\\s*\\]',
+ populate: function populate(selector, query, _ref9) {
+ var _ref10 = _slicedToArray(_ref9, 1),
+ variable = _ref10[0];
+ query.checks.push({
+ type: Type.DATA_EXIST,
+ field: cleanMetaChars(variable)
+ });
}
-
- if (theme && isStylingConfig(theme) && theme.extend) {
- if (typeof theme.extend === 'string') {
- return _objectSpread(_objectSpread({}, theme), {}, {
- extend: "".concat(theme.extend, ":inverted")
- });
+}, {
+ name: 'dataCompare',
+ query: true,
+ regex: '\\[\\s*(' + tokens.variable + ')\\s*(' + tokens.comparatorOp + ')\\s*(' + tokens.value + ')\\s*\\]',
+ populate: function populate(selector, query, _ref11) {
+ var _ref12 = _slicedToArray(_ref11, 3),
+ variable = _ref12[0],
+ comparatorOp = _ref12[1],
+ value = _ref12[2];
+ var valueIsString = new RegExp('^' + tokens.string + '$').exec(value) != null;
+ if (valueIsString) {
+ value = value.substring(1, value.length - 1);
+ } else {
+ value = parseFloat(value);
}
-
- return _objectSpread(_objectSpread({}, theme), {}, {
- extend: invertBase16Theme(theme.extend)
+ query.checks.push({
+ type: Type.DATA_COMPARE,
+ field: cleanMetaChars(variable),
+ operator: comparatorOp,
+ value: value
});
}
+}, {
+ name: 'dataBool',
+ query: true,
+ regex: '\\[\\s*(' + tokens.boolOp + ')\\s*(' + tokens.variable + ')\\s*\\]',
+ populate: function populate(selector, query, _ref13) {
+ var _ref14 = _slicedToArray(_ref13, 2),
+ boolOp = _ref14[0],
+ variable = _ref14[1];
+ query.checks.push({
+ type: Type.DATA_BOOL,
+ field: cleanMetaChars(variable),
+ operator: boolOp
+ });
+ }
+}, {
+ name: 'metaCompare',
+ query: true,
+ regex: '\\[\\[\\s*(' + tokens.meta + ')\\s*(' + tokens.comparatorOp + ')\\s*(' + tokens.number + ')\\s*\\]\\]',
+ populate: function populate(selector, query, _ref15) {
+ var _ref16 = _slicedToArray(_ref15, 3),
+ meta = _ref16[0],
+ comparatorOp = _ref16[1],
+ number = _ref16[2];
+ query.checks.push({
+ type: Type.META_COMPARE,
+ field: cleanMetaChars(meta),
+ operator: comparatorOp,
+ value: parseFloat(number)
+ });
+ }
+}, {
+ name: 'nextQuery',
+ separator: true,
+ regex: tokens.separator,
+ populate: function populate(selector, query) {
+ var currentSubject = selector.currentSubject;
+ var edgeCount = selector.edgeCount;
+ var compoundCount = selector.compoundCount;
+ var lastQ = selector[selector.length - 1];
+ if (currentSubject != null) {
+ lastQ.subject = currentSubject;
+ selector.currentSubject = null;
+ }
+ lastQ.edgeCount = edgeCount;
+ lastQ.compoundCount = compoundCount;
+ selector.edgeCount = 0;
+ selector.compoundCount = 0;
- if (theme) {
- return invertBase16Theme(theme);
- }
-
- return theme;
-};
-
-
-/***/ }),
-
-/***/ "./node_modules/react-is/cjs/react-is.development.js":
-/*!***********************************************************!*\
- !*** ./node_modules/react-is/cjs/react-is.development.js ***!
- \***********************************************************/
-/***/ (function(__unused_webpack_module, exports) {
-
-"use strict";
-/** @license React v16.13.1
- * react-is.development.js
- *
- * Copyright (c) Facebook, Inc. and its affiliates.
- *
- * This source code is licensed under the MIT license found in the
- * LICENSE file in the root directory of this source tree.
- */
-
-
-
-
-
-if (true) {
- (function() {
-'use strict';
-
-// The Symbol used to tag the ReactElement-like types. If there is no native Symbol
-// nor polyfill, then a plain number is used for performance.
-var hasSymbol = typeof Symbol === 'function' && Symbol.for;
-var REACT_ELEMENT_TYPE = hasSymbol ? Symbol.for('react.element') : 0xeac7;
-var REACT_PORTAL_TYPE = hasSymbol ? Symbol.for('react.portal') : 0xeaca;
-var REACT_FRAGMENT_TYPE = hasSymbol ? Symbol.for('react.fragment') : 0xeacb;
-var REACT_STRICT_MODE_TYPE = hasSymbol ? Symbol.for('react.strict_mode') : 0xeacc;
-var REACT_PROFILER_TYPE = hasSymbol ? Symbol.for('react.profiler') : 0xead2;
-var REACT_PROVIDER_TYPE = hasSymbol ? Symbol.for('react.provider') : 0xeacd;
-var REACT_CONTEXT_TYPE = hasSymbol ? Symbol.for('react.context') : 0xeace; // TODO: We don't use AsyncMode or ConcurrentMode anymore. They were temporary
-// (unstable) APIs that have been removed. Can we remove the symbols?
-
-var REACT_ASYNC_MODE_TYPE = hasSymbol ? Symbol.for('react.async_mode') : 0xeacf;
-var REACT_CONCURRENT_MODE_TYPE = hasSymbol ? Symbol.for('react.concurrent_mode') : 0xeacf;
-var REACT_FORWARD_REF_TYPE = hasSymbol ? Symbol.for('react.forward_ref') : 0xead0;
-var REACT_SUSPENSE_TYPE = hasSymbol ? Symbol.for('react.suspense') : 0xead1;
-var REACT_SUSPENSE_LIST_TYPE = hasSymbol ? Symbol.for('react.suspense_list') : 0xead8;
-var REACT_MEMO_TYPE = hasSymbol ? Symbol.for('react.memo') : 0xead3;
-var REACT_LAZY_TYPE = hasSymbol ? Symbol.for('react.lazy') : 0xead4;
-var REACT_BLOCK_TYPE = hasSymbol ? Symbol.for('react.block') : 0xead9;
-var REACT_FUNDAMENTAL_TYPE = hasSymbol ? Symbol.for('react.fundamental') : 0xead5;
-var REACT_RESPONDER_TYPE = hasSymbol ? Symbol.for('react.responder') : 0xead6;
-var REACT_SCOPE_TYPE = hasSymbol ? Symbol.for('react.scope') : 0xead7;
-
-function isValidElementType(type) {
- return typeof type === 'string' || typeof type === 'function' || // Note: its typeof might be other than 'symbol' or 'number' if it's a polyfill.
- type === REACT_FRAGMENT_TYPE || type === REACT_CONCURRENT_MODE_TYPE || type === REACT_PROFILER_TYPE || type === REACT_STRICT_MODE_TYPE || type === REACT_SUSPENSE_TYPE || type === REACT_SUSPENSE_LIST_TYPE || typeof type === 'object' && type !== null && (type.$$typeof === REACT_LAZY_TYPE || type.$$typeof === REACT_MEMO_TYPE || type.$$typeof === REACT_PROVIDER_TYPE || type.$$typeof === REACT_CONTEXT_TYPE || type.$$typeof === REACT_FORWARD_REF_TYPE || type.$$typeof === REACT_FUNDAMENTAL_TYPE || type.$$typeof === REACT_RESPONDER_TYPE || type.$$typeof === REACT_SCOPE_TYPE || type.$$typeof === REACT_BLOCK_TYPE);
-}
-
-function typeOf(object) {
- if (typeof object === 'object' && object !== null) {
- var $$typeof = object.$$typeof;
-
- switch ($$typeof) {
- case REACT_ELEMENT_TYPE:
- var type = object.type;
-
- switch (type) {
- case REACT_ASYNC_MODE_TYPE:
- case REACT_CONCURRENT_MODE_TYPE:
- case REACT_FRAGMENT_TYPE:
- case REACT_PROFILER_TYPE:
- case REACT_STRICT_MODE_TYPE:
- case REACT_SUSPENSE_TYPE:
- return type;
-
- default:
- var $$typeofType = type && type.$$typeof;
-
- switch ($$typeofType) {
- case REACT_CONTEXT_TYPE:
- case REACT_FORWARD_REF_TYPE:
- case REACT_LAZY_TYPE:
- case REACT_MEMO_TYPE:
- case REACT_PROVIDER_TYPE:
- return $$typeofType;
+ // go on to next query
+ var nextQuery = selector[selector.length++] = newQuery();
+ return nextQuery; // this is the new query to be filled by the following exprs
+ }
+}, {
+ name: 'directedEdge',
+ separator: true,
+ regex: tokens.directedEdge,
+ populate: function populate(selector, query) {
+ if (selector.currentSubject == null) {
+ // undirected edge
+ var edgeQuery = newQuery();
+ var source = query;
+ var target = newQuery();
+ edgeQuery.checks.push({
+ type: Type.DIRECTED_EDGE,
+ source: source,
+ target: target
+ });
- default:
- return $$typeof;
- }
+ // the query in the selector should be the edge rather than the source
+ replaceLastQuery(selector, query, edgeQuery);
+ selector.edgeCount++;
- }
+ // we're now populating the target query with expressions that follow
+ return target;
+ } else {
+ // source/target
+ var srcTgtQ = newQuery();
+ var _source = query;
+ var _target = newQuery();
+ srcTgtQ.checks.push({
+ type: Type.NODE_SOURCE,
+ source: _source,
+ target: _target
+ });
- case REACT_PORTAL_TYPE:
- return $$typeof;
+ // the query in the selector should be the neighbourhood rather than the node
+ replaceLastQuery(selector, query, srcTgtQ);
+ selector.edgeCount++;
+ return _target; // now populating the target with the following expressions
}
}
+}, {
+ name: 'undirectedEdge',
+ separator: true,
+ regex: tokens.undirectedEdge,
+ populate: function populate(selector, query) {
+ if (selector.currentSubject == null) {
+ // undirected edge
+ var edgeQuery = newQuery();
+ var source = query;
+ var target = newQuery();
+ edgeQuery.checks.push({
+ type: Type.UNDIRECTED_EDGE,
+ nodes: [source, target]
+ });
- return undefined;
-} // AsyncMode is deprecated along with isAsyncMode
-
-var AsyncMode = REACT_ASYNC_MODE_TYPE;
-var ConcurrentMode = REACT_CONCURRENT_MODE_TYPE;
-var ContextConsumer = REACT_CONTEXT_TYPE;
-var ContextProvider = REACT_PROVIDER_TYPE;
-var Element = REACT_ELEMENT_TYPE;
-var ForwardRef = REACT_FORWARD_REF_TYPE;
-var Fragment = REACT_FRAGMENT_TYPE;
-var Lazy = REACT_LAZY_TYPE;
-var Memo = REACT_MEMO_TYPE;
-var Portal = REACT_PORTAL_TYPE;
-var Profiler = REACT_PROFILER_TYPE;
-var StrictMode = REACT_STRICT_MODE_TYPE;
-var Suspense = REACT_SUSPENSE_TYPE;
-var hasWarnedAboutDeprecatedIsAsyncMode = false; // AsyncMode should be deprecated
+ // the query in the selector should be the edge rather than the source
+ replaceLastQuery(selector, query, edgeQuery);
+ selector.edgeCount++;
-function isAsyncMode(object) {
- {
- if (!hasWarnedAboutDeprecatedIsAsyncMode) {
- hasWarnedAboutDeprecatedIsAsyncMode = true; // Using console['warn'] to evade Babel and ESLint
+ // we're now populating the target query with expressions that follow
+ return target;
+ } else {
+ // neighbourhood
+ var nhoodQ = newQuery();
+ var node = query;
+ var neighbor = newQuery();
+ nhoodQ.checks.push({
+ type: Type.NODE_NEIGHBOR,
+ node: node,
+ neighbor: neighbor
+ });
- console['warn']('The ReactIs.isAsyncMode() alias has been deprecated, ' + 'and will be removed in React 17+. Update your code to use ' + 'ReactIs.isConcurrentMode() instead. It has the exact same API.');
+ // the query in the selector should be the neighbourhood rather than the node
+ replaceLastQuery(selector, query, nhoodQ);
+ return neighbor; // now populating the neighbor with following expressions
}
}
+}, {
+ name: 'child',
+ separator: true,
+ regex: tokens.child,
+ populate: function populate(selector, query) {
+ if (selector.currentSubject == null) {
+ // default: child query
+ var parentChildQuery = newQuery();
+ var child = newQuery();
+ var parent = selector[selector.length - 1];
+ parentChildQuery.checks.push({
+ type: Type.CHILD,
+ parent: parent,
+ child: child
+ });
- return isConcurrentMode(object) || typeOf(object) === REACT_ASYNC_MODE_TYPE;
-}
-function isConcurrentMode(object) {
- return typeOf(object) === REACT_CONCURRENT_MODE_TYPE;
-}
-function isContextConsumer(object) {
- return typeOf(object) === REACT_CONTEXT_TYPE;
-}
-function isContextProvider(object) {
- return typeOf(object) === REACT_PROVIDER_TYPE;
-}
-function isElement(object) {
- return typeof object === 'object' && object !== null && object.$$typeof === REACT_ELEMENT_TYPE;
-}
-function isForwardRef(object) {
- return typeOf(object) === REACT_FORWARD_REF_TYPE;
-}
-function isFragment(object) {
- return typeOf(object) === REACT_FRAGMENT_TYPE;
-}
-function isLazy(object) {
- return typeOf(object) === REACT_LAZY_TYPE;
-}
-function isMemo(object) {
- return typeOf(object) === REACT_MEMO_TYPE;
-}
-function isPortal(object) {
- return typeOf(object) === REACT_PORTAL_TYPE;
-}
-function isProfiler(object) {
- return typeOf(object) === REACT_PROFILER_TYPE;
-}
-function isStrictMode(object) {
- return typeOf(object) === REACT_STRICT_MODE_TYPE;
-}
-function isSuspense(object) {
- return typeOf(object) === REACT_SUSPENSE_TYPE;
-}
-
-exports.AsyncMode = AsyncMode;
-exports.ConcurrentMode = ConcurrentMode;
-exports.ContextConsumer = ContextConsumer;
-exports.ContextProvider = ContextProvider;
-exports.Element = Element;
-exports.ForwardRef = ForwardRef;
-exports.Fragment = Fragment;
-exports.Lazy = Lazy;
-exports.Memo = Memo;
-exports.Portal = Portal;
-exports.Profiler = Profiler;
-exports.StrictMode = StrictMode;
-exports.Suspense = Suspense;
-exports.isAsyncMode = isAsyncMode;
-exports.isConcurrentMode = isConcurrentMode;
-exports.isContextConsumer = isContextConsumer;
-exports.isContextProvider = isContextProvider;
-exports.isElement = isElement;
-exports.isForwardRef = isForwardRef;
-exports.isFragment = isFragment;
-exports.isLazy = isLazy;
-exports.isMemo = isMemo;
-exports.isPortal = isPortal;
-exports.isProfiler = isProfiler;
-exports.isStrictMode = isStrictMode;
-exports.isSuspense = isSuspense;
-exports.isValidElementType = isValidElementType;
-exports.typeOf = typeOf;
- })();
-}
-
-
-/***/ }),
-
-/***/ "./node_modules/react-is/index.js":
-/*!****************************************!*\
- !*** ./node_modules/react-is/index.js ***!
- \****************************************/
-/***/ (function(module, __unused_webpack_exports, __webpack_require__) {
-
-"use strict";
-
-
-if (false) {} else {
- module.exports = __webpack_require__(/*! ./cjs/react-is.development.js */ "./node_modules/react-is/cjs/react-is.development.js");
-}
-
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/ItemRange.js":
-/*!***********************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/ItemRange.js ***!
- \***********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ "default": function() { return /* binding */ ItemRange; }
-/* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
-/* harmony import */ var _babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/assertThisInitialized */ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
-/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
-/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
-/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_8___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_8__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_9__);
-/* harmony import */ var _JSONArrow__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./JSONArrow */ "./node_modules/react-json-tree/lib/esm/JSONArrow.js");
-
-
-
-
+ // the query in the selector should be the '>' itself
+ replaceLastQuery(selector, query, parentChildQuery);
+ selector.compoundCount++;
+ // we're now populating the child query with expressions that follow
+ return child;
+ } else if (selector.currentSubject === query) {
+ // compound split query
+ var compound = newQuery();
+ var left = selector[selector.length - 1];
+ var right = newQuery();
+ var subject = newQuery();
+ var _child = newQuery();
+ var _parent = newQuery();
+ // set up the root compound q
+ compound.checks.push({
+ type: Type.COMPOUND_SPLIT,
+ left: left,
+ right: right,
+ subject: subject
+ });
+ // populate the subject and replace the q at the old spot (within left) with TRUE
+ subject.checks = query.checks; // take the checks from the left
+ query.checks = [{
+ type: Type.TRUE
+ }]; // checks under left refs the subject implicitly
+ // set up the right q
+ _parent.checks.push({
+ type: Type.TRUE
+ }); // parent implicitly refs the subject
+ right.checks.push({
+ type: Type.PARENT,
+ // type is swapped on right side queries
+ parent: _parent,
+ child: _child // empty for now
+ });
-function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__["default"])(this, result); }; }
+ replaceLastQuery(selector, left, compound);
-function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
+ // update the ref since we moved things around for `query`
+ selector.currentSubject = subject;
+ selector.compoundCount++;
+ return _child; // now populating the right side's child
+ } else {
+ // parent query
+ // info for parent query
+ var _parent2 = newQuery();
+ var _child2 = newQuery();
+ var pcQChecks = [{
+ type: Type.PARENT,
+ parent: _parent2,
+ child: _child2
+ }];
+ // the parent-child query takes the place of the query previously being populated
+ _parent2.checks = query.checks; // the previous query contains the checks for the parent
+ query.checks = pcQChecks; // pc query takes over
+ selector.compoundCount++;
+ return _child2; // we're now populating the child
+ }
+ }
+}, {
+ name: 'descendant',
+ separator: true,
+ regex: tokens.descendant,
+ populate: function populate(selector, query) {
+ if (selector.currentSubject == null) {
+ // default: descendant query
+ var ancChQuery = newQuery();
+ var descendant = newQuery();
+ var ancestor = selector[selector.length - 1];
+ ancChQuery.checks.push({
+ type: Type.DESCENDANT,
+ ancestor: ancestor,
+ descendant: descendant
+ });
+ // the query in the selector should be the '>' itself
+ replaceLastQuery(selector, query, ancChQuery);
+ selector.compoundCount++;
+ // we're now populating the descendant query with expressions that follow
+ return descendant;
+ } else if (selector.currentSubject === query) {
+ // compound split query
+ var compound = newQuery();
+ var left = selector[selector.length - 1];
+ var right = newQuery();
+ var subject = newQuery();
+ var _descendant = newQuery();
+ var _ancestor = newQuery();
-var ItemRange = /*#__PURE__*/function (_React$Component) {
- (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__["default"])(ItemRange, _React$Component);
+ // set up the root compound q
+ compound.checks.push({
+ type: Type.COMPOUND_SPLIT,
+ left: left,
+ right: right,
+ subject: subject
+ });
- var _super = _createSuper(ItemRange);
+ // populate the subject and replace the q at the old spot (within left) with TRUE
+ subject.checks = query.checks; // take the checks from the left
+ query.checks = [{
+ type: Type.TRUE
+ }]; // checks under left refs the subject implicitly
- function ItemRange(props) {
- var _this;
+ // set up the right q
+ _ancestor.checks.push({
+ type: Type.TRUE
+ }); // ancestor implicitly refs the subject
+ right.checks.push({
+ type: Type.ANCESTOR,
+ // type is swapped on right side queries
+ ancestor: _ancestor,
+ descendant: _descendant // empty for now
+ });
- (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_1__["default"])(this, ItemRange);
+ replaceLastQuery(selector, left, compound);
- _this = _super.call(this, props);
+ // update the ref since we moved things around for `query`
+ selector.currentSubject = subject;
+ selector.compoundCount++;
+ return _descendant; // now populating the right side's descendant
+ } else {
+ // ancestor query
+ // info for parent query
+ var _ancestor2 = newQuery();
+ var _descendant2 = newQuery();
+ var adQChecks = [{
+ type: Type.ANCESTOR,
+ ancestor: _ancestor2,
+ descendant: _descendant2
+ }];
- (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])((0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__["default"])(_this), "handleClick", function () {
- _this.setState({
- expanded: !_this.state.expanded
- });
- });
+ // the parent-child query takes the place of the query previously being populated
+ _ancestor2.checks = query.checks; // the previous query contains the checks for the parent
+ query.checks = adQChecks; // pc query takes over
- _this.state = {
- expanded: false
- };
- return _this;
+ selector.compoundCount++;
+ return _descendant2; // we're now populating the child
+ }
}
-
- (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_2__["default"])(ItemRange, [{
- key: "render",
- value: function render() {
- var _this$props = this.props,
- styling = _this$props.styling,
- from = _this$props.from,
- to = _this$props.to,
- renderChildNodes = _this$props.renderChildNodes,
- nodeType = _this$props.nodeType;
- return this.state.expanded ? /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement("div", styling('itemRange', this.state.expanded), renderChildNodes(this.props, from, to)) : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement("div", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, styling('itemRange', this.state.expanded), {
- onClick: this.handleClick
- }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_8___default().createElement(_JSONArrow__WEBPACK_IMPORTED_MODULE_10__["default"], {
- nodeType: nodeType,
- styling: styling,
- expanded: false,
- onClick: this.handleClick,
- arrowStyle: "double"
- }), "".concat(from, " ... ").concat(to));
+}, {
+ name: 'subject',
+ modifier: true,
+ regex: tokens.subject,
+ populate: function populate(selector, query) {
+ if (selector.currentSubject != null && selector.currentSubject !== query) {
+ warn('Redefinition of subject in selector `' + selector.toString() + '`');
+ return false;
}
- }]);
-
- return ItemRange;
-}((react__WEBPACK_IMPORTED_MODULE_8___default().Component));
-
-(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(ItemRange, "propTypes", {
- styling: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().func).isRequired,
- from: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().number).isRequired,
- to: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().number).isRequired,
- renderChildNodes: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().func).isRequired,
- nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_9___default().string).isRequired
-});
-
+ selector.currentSubject = query;
+ var topQ = selector[selector.length - 1];
+ var topChk = topQ.checks[0];
+ var topType = topChk == null ? null : topChk.type;
+ if (topType === Type.DIRECTED_EDGE) {
+ // directed edge with subject on the target
+ // change to target node check
+ topChk.type = Type.NODE_TARGET;
+ } else if (topType === Type.UNDIRECTED_EDGE) {
+ // undirected edge with subject on the second node
-/***/ }),
+ // change to neighbor check
+ topChk.type = Type.NODE_NEIGHBOR;
+ topChk.node = topChk.nodes[1]; // second node is subject
+ topChk.neighbor = topChk.nodes[0];
-/***/ "./node_modules/react-json-tree/lib/esm/JSONArrayNode.js":
-/*!***************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONArrayNode.js ***!
- \***************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+ // clean up unused fields for new type
+ topChk.nodes = null;
+ }
+ }
+}];
+exprs.forEach(function (e) {
+ return e.regexObj = new RegExp('^' + e.regex);
+});
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_2__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_3__);
-/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
+/**
+ * Of all the expressions, find the first match in the remaining text.
+ * @param {string} remaining The remaining text to parse
+ * @returns The matched expression and the newly remaining text `{ expr, match, name, remaining }`
+ */
+var consumeExpr = function consumeExpr(remaining) {
+ var expr;
+ var match;
+ var name;
+ for (var j = 0; j < exprs.length; j++) {
+ var e = exprs[j];
+ var n = e.name;
+ var m = remaining.match(e.regexObj);
+ if (m != null) {
+ match = m;
+ expr = e;
+ name = n;
+ var consumed = m[0];
+ remaining = remaining.substring(consumed.length);
+ break; // we've consumed one expr, so we can return now
+ }
+ }
+ return {
+ expr: expr,
+ match: match,
+ name: name,
+ remaining: remaining
+ };
+};
-var _excluded = ["data"];
+/**
+ * Consume all the leading whitespace
+ * @param {string} remaining The text to consume
+ * @returns The text with the leading whitespace removed
+ */
+var consumeWhitespace = function consumeWhitespace(remaining) {
+ var match = remaining.match(/^\s+/);
+ if (match) {
+ var consumed = match[0];
+ remaining = remaining.substring(consumed.length);
+ }
+ return remaining;
+};
+/**
+ * Parse the string and store the parsed representation in the Selector.
+ * @param {string} selector The selector string
+ * @returns `true` if the selector was successfully parsed, `false` otherwise
+ */
+var parse = function parse(selector) {
+ var self = this;
+ var remaining = self.inputText = selector;
+ var currentQuery = self[0] = newQuery();
+ self.length = 1;
+ remaining = consumeWhitespace(remaining); // get rid of leading whitespace
+ for (;;) {
+ var exprInfo = consumeExpr(remaining);
+ if (exprInfo.expr == null) {
+ warn('The selector `' + selector + '`is invalid');
+ return false;
+ } else {
+ var args = exprInfo.match.slice(1);
+ // let the token populate the selector object in currentQuery
+ var ret = exprInfo.expr.populate(self, currentQuery, args);
+ if (ret === false) {
+ return false; // exit if population failed
+ } else if (ret != null) {
+ currentQuery = ret; // change the current query to be filled if the expr specifies
+ }
+ }
-// Returns the "n Items" string for this node,
-// generating and caching it if it hasn't been created yet.
-function createItemString(data) {
- return "".concat(data.length, " ").concat(data.length !== 1 ? 'items' : 'item');
-}
+ remaining = exprInfo.remaining;
-// Configures <JSONNestedNode> to render an Array
-var JSONArrayNode = function JSONArrayNode(_ref) {
- var data = _ref.data,
- props = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_ref, _excluded);
+ // we're done when there's nothing left to parse
+ if (remaining.match(/^\s*$/)) {
+ break;
+ }
+ }
+ var lastQ = self[self.length - 1];
+ if (self.currentSubject != null) {
+ lastQ.subject = self.currentSubject;
+ }
+ lastQ.edgeCount = self.edgeCount;
+ lastQ.compoundCount = self.compoundCount;
+ for (var i = 0; i < self.length; i++) {
+ var q = self[i];
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_2___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
- data: data,
- nodeType: "Array",
- nodeTypeIndicator: "[]",
- createItemString: createItemString,
- expandable: data.length > 0
- }));
+ // in future, this could potentially be allowed if there were operator precedence and detection of invalid combinations
+ if (q.compoundCount > 0 && q.edgeCount > 0) {
+ warn('The selector `' + selector + '` is invalid because it uses both a compound selector and an edge selector');
+ return false;
+ }
+ if (q.edgeCount > 1) {
+ warn('The selector `' + selector + '` is invalid because it uses multiple edge selectors');
+ return false;
+ } else if (q.edgeCount === 1) {
+ warn('The selector `' + selector + '` is deprecated. Edge selectors do not take effect on changes to source and target nodes after an edge is added, for performance reasons. Use a class or data selector on edges instead, updating the class or data of an edge when your app detects a change in source or target nodes.');
+ }
+ }
+ return true; // success
};
-JSONArrayNode.propTypes = {
- data: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().array)
+/**
+ * Get the selector represented as a string. This value uses default formatting,
+ * so things like spacing may differ from the input text passed to the constructor.
+ * @returns {string} The selector string
+ */
+var toString = function toString() {
+ if (this.toStringCache != null) {
+ return this.toStringCache;
+ }
+ var clean = function clean(obj) {
+ if (obj == null) {
+ return '';
+ } else {
+ return obj;
+ }
+ };
+ var cleanVal = function cleanVal(val) {
+ if (string(val)) {
+ return '"' + val + '"';
+ } else {
+ return clean(val);
+ }
+ };
+ var space = function space(val) {
+ return ' ' + val + ' ';
+ };
+ var checkToString = function checkToString(check, subject) {
+ var type = check.type,
+ value = check.value;
+ switch (type) {
+ case Type.GROUP:
+ {
+ var group = clean(value);
+ return group.substring(0, group.length - 1);
+ }
+ case Type.DATA_COMPARE:
+ {
+ var field = check.field,
+ operator = check.operator;
+ return '[' + field + space(clean(operator)) + cleanVal(value) + ']';
+ }
+ case Type.DATA_BOOL:
+ {
+ var _operator = check.operator,
+ _field = check.field;
+ return '[' + clean(_operator) + _field + ']';
+ }
+ case Type.DATA_EXIST:
+ {
+ var _field2 = check.field;
+ return '[' + _field2 + ']';
+ }
+ case Type.META_COMPARE:
+ {
+ var _operator2 = check.operator,
+ _field3 = check.field;
+ return '[[' + _field3 + space(clean(_operator2)) + cleanVal(value) + ']]';
+ }
+ case Type.STATE:
+ {
+ return value;
+ }
+ case Type.ID:
+ {
+ return '#' + value;
+ }
+ case Type.CLASS:
+ {
+ return '.' + value;
+ }
+ case Type.PARENT:
+ case Type.CHILD:
+ {
+ return queryToString(check.parent, subject) + space('>') + queryToString(check.child, subject);
+ }
+ case Type.ANCESTOR:
+ case Type.DESCENDANT:
+ {
+ return queryToString(check.ancestor, subject) + ' ' + queryToString(check.descendant, subject);
+ }
+ case Type.COMPOUND_SPLIT:
+ {
+ var lhs = queryToString(check.left, subject);
+ var sub = queryToString(check.subject, subject);
+ var rhs = queryToString(check.right, subject);
+ return lhs + (lhs.length > 0 ? ' ' : '') + sub + rhs;
+ }
+ case Type.TRUE:
+ {
+ return '';
+ }
+ }
+ };
+ var queryToString = function queryToString(query, subject) {
+ return query.checks.reduce(function (str, chk, i) {
+ return str + (subject === query && i === 0 ? '$' : '') + checkToString(chk, subject);
+ }, '');
+ };
+ var str = '';
+ for (var i = 0; i < this.length; i++) {
+ var query = this[i];
+ str += queryToString(query, query.subject);
+ if (this.length > 1 && i < this.length - 1) {
+ str += ', ';
+ }
+ }
+ this.toStringCache = str;
+ return str;
+};
+var parse$1 = {
+ parse: parse,
+ toString: toString
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONArrayNode);
-/***/ }),
+var valCmp = function valCmp(fieldVal, operator, value) {
+ var matches;
+ var isFieldStr = string(fieldVal);
+ var isFieldNum = number$1(fieldVal);
+ var isValStr = string(value);
+ var fieldStr, valStr;
+ var caseInsensitive = false;
+ var notExpr = false;
+ var isIneqCmp = false;
+ if (operator.indexOf('!') >= 0) {
+ operator = operator.replace('!', '');
+ notExpr = true;
+ }
+ if (operator.indexOf('@') >= 0) {
+ operator = operator.replace('@', '');
+ caseInsensitive = true;
+ }
+ if (isFieldStr || isValStr || caseInsensitive) {
+ fieldStr = !isFieldStr && !isFieldNum ? '' : '' + fieldVal;
+ valStr = '' + value;
+ }
-/***/ "./node_modules/react-json-tree/lib/esm/JSONArrow.js":
-/*!***********************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONArrow.js ***!
- \***********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+ // if we're doing a case insensitive comparison, then we're using a STRING comparison
+ // even if we're comparing numbers
+ if (caseInsensitive) {
+ fieldVal = fieldStr = fieldStr.toLowerCase();
+ value = valStr = valStr.toLowerCase();
+ }
+ switch (operator) {
+ case '*=':
+ matches = fieldStr.indexOf(valStr) >= 0;
+ break;
+ case '$=':
+ matches = fieldStr.indexOf(valStr, fieldStr.length - valStr.length) >= 0;
+ break;
+ case '^=':
+ matches = fieldStr.indexOf(valStr) === 0;
+ break;
+ case '=':
+ matches = fieldVal === value;
+ break;
+ case '>':
+ isIneqCmp = true;
+ matches = fieldVal > value;
+ break;
+ case '>=':
+ isIneqCmp = true;
+ matches = fieldVal >= value;
+ break;
+ case '<':
+ isIneqCmp = true;
+ matches = fieldVal < value;
+ break;
+ case '<=':
+ isIneqCmp = true;
+ matches = fieldVal <= value;
+ break;
+ default:
+ matches = false;
+ break;
+ }
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_2__);
+ // apply the not op, but null vals for inequalities should always stay non-matching
+ if (notExpr && (fieldVal != null || !isIneqCmp)) {
+ matches = !matches;
+ }
+ return matches;
+};
+var boolCmp = function boolCmp(fieldVal, operator) {
+ switch (operator) {
+ case '?':
+ return fieldVal ? true : false;
+ case '!':
+ return fieldVal ? false : true;
+ case '^':
+ return fieldVal === undefined;
+ }
+};
+var existCmp = function existCmp(fieldVal) {
+ return fieldVal !== undefined;
+};
+var data$1 = function data(ele, field) {
+ return ele.data(field);
+};
+var meta = function meta(ele, field) {
+ return ele[field]();
+};
+
+/** A lookup of `match(check, ele)` functions by `Type` int */
+var match = [];
+
+/**
+ * Returns whether the query matches for the element
+ * @param query The `{ type, value, ... }` query object
+ * @param ele The element to compare against
+*/
+var matches$1 = function matches(query, ele) {
+ return query.checks.every(function (chk) {
+ return match[chk.type](chk, ele);
+ });
+};
+match[Type.GROUP] = function (check, ele) {
+ var group = check.value;
+ return group === '*' || group === ele.group();
+};
+match[Type.STATE] = function (check, ele) {
+ var stateSelector = check.value;
+ return stateSelectorMatches(stateSelector, ele);
+};
+match[Type.ID] = function (check, ele) {
+ var id = check.value;
+ return ele.id() === id;
+};
+match[Type.CLASS] = function (check, ele) {
+ var cls = check.value;
+ return ele.hasClass(cls);
+};
+match[Type.META_COMPARE] = function (check, ele) {
+ var field = check.field,
+ operator = check.operator,
+ value = check.value;
+ return valCmp(meta(ele, field), operator, value);
+};
+match[Type.DATA_COMPARE] = function (check, ele) {
+ var field = check.field,
+ operator = check.operator,
+ value = check.value;
+ return valCmp(data$1(ele, field), operator, value);
+};
+match[Type.DATA_BOOL] = function (check, ele) {
+ var field = check.field,
+ operator = check.operator;
+ return boolCmp(data$1(ele, field), operator);
+};
+match[Type.DATA_EXIST] = function (check, ele) {
+ var field = check.field;
+ check.operator;
+ return existCmp(data$1(ele, field));
+};
+match[Type.UNDIRECTED_EDGE] = function (check, ele) {
+ var qA = check.nodes[0];
+ var qB = check.nodes[1];
+ var src = ele.source();
+ var tgt = ele.target();
+ return matches$1(qA, src) && matches$1(qB, tgt) || matches$1(qB, src) && matches$1(qA, tgt);
+};
+match[Type.NODE_NEIGHBOR] = function (check, ele) {
+ return matches$1(check.node, ele) && ele.neighborhood().some(function (n) {
+ return n.isNode() && matches$1(check.neighbor, n);
+ });
+};
+match[Type.DIRECTED_EDGE] = function (check, ele) {
+ return matches$1(check.source, ele.source()) && matches$1(check.target, ele.target());
+};
+match[Type.NODE_SOURCE] = function (check, ele) {
+ return matches$1(check.source, ele) && ele.outgoers().some(function (n) {
+ return n.isNode() && matches$1(check.target, n);
+ });
+};
+match[Type.NODE_TARGET] = function (check, ele) {
+ return matches$1(check.target, ele) && ele.incomers().some(function (n) {
+ return n.isNode() && matches$1(check.source, n);
+ });
+};
+match[Type.CHILD] = function (check, ele) {
+ return matches$1(check.child, ele) && matches$1(check.parent, ele.parent());
+};
+match[Type.PARENT] = function (check, ele) {
+ return matches$1(check.parent, ele) && ele.children().some(function (c) {
+ return matches$1(check.child, c);
+ });
+};
+match[Type.DESCENDANT] = function (check, ele) {
+ return matches$1(check.descendant, ele) && ele.ancestors().some(function (a) {
+ return matches$1(check.ancestor, a);
+ });
+};
+match[Type.ANCESTOR] = function (check, ele) {
+ return matches$1(check.ancestor, ele) && ele.descendants().some(function (d) {
+ return matches$1(check.descendant, d);
+ });
+};
+match[Type.COMPOUND_SPLIT] = function (check, ele) {
+ return matches$1(check.subject, ele) && matches$1(check.left, ele) && matches$1(check.right, ele);
+};
+match[Type.TRUE] = function () {
+ return true;
+};
+match[Type.COLLECTION] = function (check, ele) {
+ var collection = check.value;
+ return collection.has(ele);
+};
+match[Type.FILTER] = function (check, ele) {
+ var filter = check.value;
+ return filter(ele);
+};
+// filter an existing collection
+var filter = function filter(collection) {
+ var self = this;
+ // for 1 id #foo queries, just get the element
+ if (self.length === 1 && self[0].checks.length === 1 && self[0].checks[0].type === Type.ID) {
+ return collection.getElementById(self[0].checks[0].value).collection();
+ }
+ var selectorFunction = function selectorFunction(element) {
+ for (var j = 0; j < self.length; j++) {
+ var query = self[j];
+ if (matches$1(query, element)) {
+ return true;
+ }
+ }
+ return false;
+ };
+ if (self.text() == null) {
+ selectorFunction = function selectorFunction() {
+ return true;
+ };
+ }
+ return collection.filter(selectorFunction);
+}; // filter
+// does selector match a single element?
+var matches = function matches(ele) {
+ var self = this;
+ for (var j = 0; j < self.length; j++) {
+ var query = self[j];
+ if (matches$1(query, ele)) {
+ return true;
+ }
+ }
+ return false;
+}; // matches
-var JSONArrow = function JSONArrow(_ref) {
- var styling = _ref.styling,
- arrowStyle = _ref.arrowStyle,
- expanded = _ref.expanded,
- nodeType = _ref.nodeType,
- onClick = _ref.onClick;
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, styling('arrowContainer', arrowStyle), {
- onClick: onClick
- }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", styling(['arrow', 'arrowSign'], nodeType, expanded, arrowStyle), "\u25B6", arrowStyle === 'double' && /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("div", styling(['arrowSign', 'arrowSignInner']), "\u25B6")));
+var matching = {
+ matches: matches,
+ filter: filter
};
-JSONArrow.propTypes = {
- styling: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
- arrowStyle: prop_types__WEBPACK_IMPORTED_MODULE_2___default().oneOf(['single', 'double']),
- expanded: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().bool).isRequired,
- nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().string).isRequired,
- onClick: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired
+var Selector = function Selector(selector) {
+ this.inputText = selector;
+ this.currentSubject = null;
+ this.compoundCount = 0;
+ this.edgeCount = 0;
+ this.length = 0;
+ if (selector == null || string(selector) && selector.match(/^\s*$/)) ; else if (elementOrCollection(selector)) {
+ this.addQuery({
+ checks: [{
+ type: Type.COLLECTION,
+ value: selector.collection()
+ }]
+ });
+ } else if (fn$6(selector)) {
+ this.addQuery({
+ checks: [{
+ type: Type.FILTER,
+ value: selector
+ }]
+ });
+ } else if (string(selector)) {
+ if (!this.parse(selector)) {
+ this.invalid = true;
+ }
+ } else {
+ error('A selector must be created from a string; found ');
+ }
+};
+var selfn = Selector.prototype;
+[parse$1, matching].forEach(function (p) {
+ return extend(selfn, p);
+});
+selfn.text = function () {
+ return this.inputText;
+};
+selfn.size = function () {
+ return this.length;
+};
+selfn.eq = function (i) {
+ return this[i];
+};
+selfn.sameText = function (otherSel) {
+ return !this.invalid && !otherSel.invalid && this.text() === otherSel.text();
};
-JSONArrow.defaultProps = {
- arrowStyle: 'single'
+selfn.addQuery = function (q) {
+ this[this.length++] = q;
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONArrow);
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/JSONIterableNode.js":
-/*!******************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONIterableNode.js ***!
- \******************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
-/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
-
-
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+selfn.selector = selfn.toString;
+var elesfn$g = {
+ allAre: function allAre(selector) {
+ var selObj = new Selector(selector);
+ return this.every(function (ele) {
+ return selObj.matches(ele);
+ });
+ },
+ is: function is(selector) {
+ var selObj = new Selector(selector);
+ return this.some(function (ele) {
+ return selObj.matches(ele);
+ });
+ },
+ some: function some(fn, thisArg) {
+ for (var i = 0; i < this.length; i++) {
+ var ret = !thisArg ? fn(this[i], i, this) : fn.apply(thisArg, [this[i], i, this]);
+ if (ret) {
+ return true;
+ }
+ }
+ return false;
+ },
+ every: function every(fn, thisArg) {
+ for (var i = 0; i < this.length; i++) {
+ var ret = !thisArg ? fn(this[i], i, this) : fn.apply(thisArg, [this[i], i, this]);
+ if (!ret) {
+ return false;
+ }
+ }
+ return true;
+ },
+ same: function same(collection) {
+ // cheap collection ref check
+ if (this === collection) {
+ return true;
+ }
+ collection = this.cy().collection(collection);
+ var thisLength = this.length;
+ var collectionLength = collection.length;
+ // cheap length check
+ if (thisLength !== collectionLength) {
+ return false;
+ }
+ // cheap element ref check
+ if (thisLength === 1) {
+ return this[0] === collection[0];
+ }
+ return this.every(function (ele) {
+ return collection.hasElementWithId(ele.id());
+ });
+ },
+ anySame: function anySame(collection) {
+ collection = this.cy().collection(collection);
+ return this.some(function (ele) {
+ return collection.hasElementWithId(ele.id());
+ });
+ },
+ allAreNeighbors: function allAreNeighbors(collection) {
+ collection = this.cy().collection(collection);
+ var nhood = this.neighborhood();
+ return collection.every(function (ele) {
+ return nhood.hasElementWithId(ele.id());
+ });
+ },
+ contains: function contains(collection) {
+ collection = this.cy().collection(collection);
+ var self = this;
+ return collection.every(function (ele) {
+ return self.hasElementWithId(ele.id());
+ });
+ }
+};
+elesfn$g.allAreNeighbours = elesfn$g.allAreNeighbors;
+elesfn$g.has = elesfn$g.contains;
+elesfn$g.equal = elesfn$g.equals = elesfn$g.same;
-// Returns the "n Items" string for this node,
-// generating and caching it if it hasn't been created yet.
-function createItemString(data, limit) {
- var count = 0;
- var hasMore = false;
+var cache = function cache(fn, name) {
+ return function traversalCache(arg1, arg2, arg3, arg4) {
+ var selectorOrEles = arg1;
+ var eles = this;
+ var key;
+ if (selectorOrEles == null) {
+ key = '';
+ } else if (elementOrCollection(selectorOrEles) && selectorOrEles.length === 1) {
+ key = selectorOrEles.id();
+ }
+ if (eles.length === 1 && key) {
+ var _p = eles[0]._private;
+ var tch = _p.traversalCache = _p.traversalCache || {};
+ var ch = tch[name] = tch[name] || [];
+ var hash = hashString(key);
+ var cacheHit = ch[hash];
+ if (cacheHit) {
+ return cacheHit;
+ } else {
+ return ch[hash] = fn.call(eles, arg1, arg2, arg3, arg4);
+ }
+ } else {
+ return fn.call(eles, arg1, arg2, arg3, arg4);
+ }
+ };
+};
- if (Number.isSafeInteger(data.size)) {
- count = data.size;
- } else {
- // eslint-disable-next-line no-unused-vars
- var _iterator = _createForOfIteratorHelper(data),
- _step;
+var elesfn$f = {
+ parent: function parent(selector) {
+ var parents = [];
- try {
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
- var entry = _step.value;
+ // optimisation for single ele call
+ if (this.length === 1) {
+ var parent = this[0]._private.parent;
+ if (parent) {
+ return parent;
+ }
+ }
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var _parent = ele._private.parent;
+ if (_parent) {
+ parents.push(_parent);
+ }
+ }
+ return this.spawn(parents, true).filter(selector);
+ },
+ parents: function parents(selector) {
+ var parents = [];
+ var eles = this.parent();
+ while (eles.nonempty()) {
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ parents.push(ele);
+ }
+ eles = eles.parent();
+ }
+ return this.spawn(parents, true).filter(selector);
+ },
+ commonAncestors: function commonAncestors(selector) {
+ var ancestors;
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var parents = ele.parents();
+ ancestors = ancestors || parents;
+ ancestors = ancestors.intersect(parents); // current list must be common with current ele parents set
+ }
- if (limit && count + 1 > limit) {
- hasMore = true;
- break;
+ return ancestors.filter(selector);
+ },
+ orphans: function orphans(selector) {
+ return this.stdFilter(function (ele) {
+ return ele.isOrphan();
+ }).filter(selector);
+ },
+ nonorphans: function nonorphans(selector) {
+ return this.stdFilter(function (ele) {
+ return ele.isChild();
+ }).filter(selector);
+ },
+ children: cache(function (selector) {
+ var children = [];
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var eleChildren = ele._private.children;
+ for (var j = 0; j < eleChildren.length; j++) {
+ children.push(eleChildren[j]);
+ }
+ }
+ return this.spawn(children, true).filter(selector);
+ }, 'children'),
+ siblings: function siblings(selector) {
+ return this.parent().children().not(this).filter(selector);
+ },
+ isParent: function isParent() {
+ var ele = this[0];
+ if (ele) {
+ return ele.isNode() && ele._private.children.length !== 0;
+ }
+ },
+ isChildless: function isChildless() {
+ var ele = this[0];
+ if (ele) {
+ return ele.isNode() && ele._private.children.length === 0;
+ }
+ },
+ isChild: function isChild() {
+ var ele = this[0];
+ if (ele) {
+ return ele.isNode() && ele._private.parent != null;
+ }
+ },
+ isOrphan: function isOrphan() {
+ var ele = this[0];
+ if (ele) {
+ return ele.isNode() && ele._private.parent == null;
+ }
+ },
+ descendants: function descendants(selector) {
+ var elements = [];
+ function add(eles) {
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ elements.push(ele);
+ if (ele.children().nonempty()) {
+ add(ele.children());
}
-
- count += 1;
}
- } catch (err) {
- _iterator.e(err);
- } finally {
- _iterator.f();
+ }
+ add(this.children());
+ return this.spawn(elements, true).filter(selector);
+ }
+};
+function forEachCompound(eles, fn, includeSelf, recursiveStep) {
+ var q = [];
+ var did = new Set$1();
+ var cy = eles.cy();
+ var hasCompounds = cy.hasCompoundNodes();
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ if (includeSelf) {
+ q.push(ele);
+ } else if (hasCompounds) {
+ recursiveStep(q, did, ele);
+ }
+ }
+ while (q.length > 0) {
+ var _ele = q.shift();
+ fn(_ele);
+ did.add(_ele.id());
+ if (hasCompounds) {
+ recursiveStep(q, did, _ele);
+ }
+ }
+ return eles;
+}
+function addChildren(q, did, ele) {
+ if (ele.isParent()) {
+ var children = ele._private.children;
+ for (var i = 0; i < children.length; i++) {
+ var child = children[i];
+ if (!did.has(child.id())) {
+ q.push(child);
+ }
}
}
-
- return "".concat(hasMore ? '>' : '').concat(count, " ").concat(count !== 1 ? 'entries' : 'entry');
}
-// Configures <JSONNestedNode> to render an iterable
-var JSONIterableNode = function JSONIterableNode(_ref) {
- var props = (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, _ref);
-
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_2__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
- nodeType: "Iterable",
- nodeTypeIndicator: "()",
- createItemString: createItemString
- }));
+// very efficient version of eles.add( eles.descendants() ).forEach()
+// for internal use
+elesfn$f.forEachDown = function (fn) {
+ var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+ return forEachCompound(this, fn, includeSelf, addChildren);
+};
+function addParent(q, did, ele) {
+ if (ele.isChild()) {
+ var parent = ele._private.parent;
+ if (!did.has(parent.id())) {
+ q.push(parent);
+ }
+ }
+}
+elesfn$f.forEachUp = function (fn) {
+ var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+ return forEachCompound(this, fn, includeSelf, addParent);
+};
+function addParentAndChildren(q, did, ele) {
+ addParent(q, did, ele);
+ addChildren(q, did, ele);
+}
+elesfn$f.forEachUpAndDown = function (fn) {
+ var includeSelf = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : true;
+ return forEachCompound(this, fn, includeSelf, addParentAndChildren);
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONIterableNode);
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js":
-/*!****************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONNestedNode.js ***!
- \****************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ "default": function() { return /* binding */ JSONNestedNode; }
-/* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
-/* harmony import */ var _babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/assertThisInitialized */ "./node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
-/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
-/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
-/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_9__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_10__);
-/* harmony import */ var _JSONArrow__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./JSONArrow */ "./node_modules/react-json-tree/lib/esm/JSONArrow.js");
-/* harmony import */ var _getCollectionEntries__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./getCollectionEntries */ "./node_modules/react-json-tree/lib/esm/getCollectionEntries.js");
-/* harmony import */ var _JSONNode__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./JSONNode */ "./node_modules/react-json-tree/lib/esm/JSONNode.js");
-/* harmony import */ var _ItemRange__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./ItemRange */ "./node_modules/react-json-tree/lib/esm/ItemRange.js");
-
-
-
-
-
-
-
-
-
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-
-function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_5__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_4__["default"])(this, result); }; }
-
-function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-
-
-
-
-
+// aliases
+elesfn$f.ancestors = elesfn$f.parents;
+var fn$5, elesfn$e;
+fn$5 = elesfn$e = {
+ data: define.data({
+ field: 'data',
+ bindingEvent: 'data',
+ allowBinding: true,
+ allowSetting: true,
+ settingEvent: 'data',
+ settingTriggersEvent: true,
+ triggerFnName: 'trigger',
+ allowGetting: true,
+ immutableKeys: {
+ 'id': true,
+ 'source': true,
+ 'target': true,
+ 'parent': true
+ },
+ updateStyle: true
+ }),
+ removeData: define.removeData({
+ field: 'data',
+ event: 'data',
+ triggerFnName: 'trigger',
+ triggerEvent: true,
+ immutableKeys: {
+ 'id': true,
+ 'source': true,
+ 'target': true,
+ 'parent': true
+ },
+ updateStyle: true
+ }),
+ scratch: define.data({
+ field: 'scratch',
+ bindingEvent: 'scratch',
+ allowBinding: true,
+ allowSetting: true,
+ settingEvent: 'scratch',
+ settingTriggersEvent: true,
+ triggerFnName: 'trigger',
+ allowGetting: true,
+ updateStyle: true
+ }),
+ removeScratch: define.removeData({
+ field: 'scratch',
+ event: 'scratch',
+ triggerFnName: 'trigger',
+ triggerEvent: true,
+ updateStyle: true
+ }),
+ rscratch: define.data({
+ field: 'rscratch',
+ allowBinding: false,
+ allowSetting: true,
+ settingTriggersEvent: false,
+ allowGetting: true
+ }),
+ removeRscratch: define.removeData({
+ field: 'rscratch',
+ triggerEvent: false
+ }),
+ id: function id() {
+ var ele = this[0];
+ if (ele) {
+ return ele._private.data.id;
+ }
+ }
+};
+// aliases
+fn$5.attr = fn$5.data;
+fn$5.removeAttr = fn$5.removeData;
+var data = elesfn$e;
-function isRange(rangeOrEntry) {
- return rangeOrEntry.to !== undefined;
+var elesfn$d = {};
+function defineDegreeFunction(callback) {
+ return function (includeLoops) {
+ var self = this;
+ if (includeLoops === undefined) {
+ includeLoops = true;
+ }
+ if (self.length === 0) {
+ return;
+ }
+ if (self.isNode() && !self.removed()) {
+ var degree = 0;
+ var node = self[0];
+ var connectedEdges = node._private.edges;
+ for (var i = 0; i < connectedEdges.length; i++) {
+ var edge = connectedEdges[i];
+ if (!includeLoops && edge.isLoop()) {
+ continue;
+ }
+ degree += callback(node, edge);
+ }
+ return degree;
+ } else {
+ return;
+ }
+ };
}
-
-function renderChildNodes(props, from, to) {
- var nodeType = props.nodeType,
- data = props.data,
- collectionLimit = props.collectionLimit,
- circularCache = props.circularCache,
- keyPath = props.keyPath,
- postprocessValue = props.postprocessValue,
- sortObjectKeys = props.sortObjectKeys;
- var childNodes = [];
- (0,_getCollectionEntries__WEBPACK_IMPORTED_MODULE_11__["default"])(nodeType, data, sortObjectKeys, collectionLimit, from, to).forEach(function (entry) {
- if (isRange(entry)) {
- childNodes.push( /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_ItemRange__WEBPACK_IMPORTED_MODULE_12__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, props, {
- key: "ItemRange--".concat(entry.from, "-").concat(entry.to),
- from: entry.from,
- to: entry.to,
- renderChildNodes: renderChildNodes
- })));
+extend(elesfn$d, {
+ degree: defineDegreeFunction(function (node, edge) {
+ if (edge.source().same(edge.target())) {
+ return 2;
+ } else {
+ return 1;
+ }
+ }),
+ indegree: defineDegreeFunction(function (node, edge) {
+ if (edge.target().same(node)) {
+ return 1;
+ } else {
+ return 0;
+ }
+ }),
+ outdegree: defineDegreeFunction(function (node, edge) {
+ if (edge.source().same(node)) {
+ return 1;
} else {
- var key = entry.key,
- value = entry.value;
- var isCircular = circularCache.indexOf(value) !== -1;
- childNodes.push( /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONNode__WEBPACK_IMPORTED_MODULE_13__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, props, {
- postprocessValue: postprocessValue,
- collectionLimit: collectionLimit,
- key: "Node--".concat(key),
- keyPath: [key].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__["default"])(keyPath)),
- value: postprocessValue(value),
- circularCache: [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_7__["default"])(circularCache), [value]),
- isCircular: isCircular,
- hideRoot: false
- })));
+ return 0;
}
- });
- return childNodes;
-}
-
-function getStateFromProps(props) {
- // calculate individual node expansion if necessary
- var expanded = !props.isCircular ? props.shouldExpandNode(props.keyPath, props.data, props.level) : false;
- return {
- expanded: expanded
+ })
+});
+function defineDegreeBoundsFunction(degreeFn, callback) {
+ return function (includeLoops) {
+ var ret;
+ var nodes = this.nodes();
+ for (var i = 0; i < nodes.length; i++) {
+ var ele = nodes[i];
+ var degree = ele[degreeFn](includeLoops);
+ if (degree !== undefined && (ret === undefined || callback(degree, ret))) {
+ ret = degree;
+ }
+ }
+ return ret;
};
}
-
-var JSONNestedNode = /*#__PURE__*/function (_React$Component) {
- (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_3__["default"])(JSONNestedNode, _React$Component);
-
- var _super = _createSuper(JSONNestedNode);
-
- function JSONNestedNode(props) {
- var _this;
-
- (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_0__["default"])(this, JSONNestedNode);
-
- _this = _super.call(this, props);
-
- (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])((0,_babel_runtime_helpers_assertThisInitialized__WEBPACK_IMPORTED_MODULE_2__["default"])(_this), "handleClick", function () {
- if (_this.props.expandable) {
- _this.setState({
- expanded: !_this.state.expanded
- });
- }
- });
-
- _this.state = getStateFromProps(props);
- return _this;
+extend(elesfn$d, {
+ minDegree: defineDegreeBoundsFunction('degree', function (degree, min) {
+ return degree < min;
+ }),
+ maxDegree: defineDegreeBoundsFunction('degree', function (degree, max) {
+ return degree > max;
+ }),
+ minIndegree: defineDegreeBoundsFunction('indegree', function (degree, min) {
+ return degree < min;
+ }),
+ maxIndegree: defineDegreeBoundsFunction('indegree', function (degree, max) {
+ return degree > max;
+ }),
+ minOutdegree: defineDegreeBoundsFunction('outdegree', function (degree, min) {
+ return degree < min;
+ }),
+ maxOutdegree: defineDegreeBoundsFunction('outdegree', function (degree, max) {
+ return degree > max;
+ })
+});
+extend(elesfn$d, {
+ totalDegree: function totalDegree(includeLoops) {
+ var total = 0;
+ var nodes = this.nodes();
+ for (var i = 0; i < nodes.length; i++) {
+ total += nodes[i].degree(includeLoops);
+ }
+ return total;
}
+});
- (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_1__["default"])(JSONNestedNode, [{
- key: "UNSAFE_componentWillReceiveProps",
- value: function UNSAFE_componentWillReceiveProps(nextProps) {
- var nextState = getStateFromProps(nextProps);
-
- if (getStateFromProps(this.props).expanded !== nextState.expanded) {
- this.setState(nextState);
+var fn$4, elesfn$c;
+var beforePositionSet = function beforePositionSet(eles, newPos, silent) {
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ if (!ele.locked()) {
+ var oldPos = ele._private.position;
+ var delta = {
+ x: newPos.x != null ? newPos.x - oldPos.x : 0,
+ y: newPos.y != null ? newPos.y - oldPos.y : 0
+ };
+ if (ele.isParent() && !(delta.x === 0 && delta.y === 0)) {
+ ele.children().shift(delta, silent);
}
+ ele.dirtyBoundingBoxCache();
}
- }, {
- key: "shouldComponentUpdate",
- value: function shouldComponentUpdate(nextProps, nextState) {
- var _this2 = this;
-
- return !!Object.keys(nextProps).find(function (key) {
- return key !== 'circularCache' && (key === 'keyPath' ? nextProps[key].join('/') !== _this2.props[key].join('/') : nextProps[key] !== _this2.props[key]);
- }) || nextState.expanded !== this.state.expanded;
+ }
+};
+var positionDef = {
+ field: 'position',
+ bindingEvent: 'position',
+ allowBinding: true,
+ allowSetting: true,
+ settingEvent: 'position',
+ settingTriggersEvent: true,
+ triggerFnName: 'emitAndNotify',
+ allowGetting: true,
+ validKeys: ['x', 'y'],
+ beforeGet: function beforeGet(ele) {
+ ele.updateCompoundBounds();
+ },
+ beforeSet: function beforeSet(eles, newPos) {
+ beforePositionSet(eles, newPos, false);
+ },
+ onSet: function onSet(eles) {
+ eles.dirtyCompoundBoundsCache();
+ },
+ canSet: function canSet(ele) {
+ return !ele.locked();
+ }
+};
+fn$4 = elesfn$c = {
+ position: define.data(positionDef),
+ // position but no notification to renderer
+ silentPosition: define.data(extend({}, positionDef, {
+ allowBinding: false,
+ allowSetting: true,
+ settingTriggersEvent: false,
+ allowGetting: false,
+ beforeSet: function beforeSet(eles, newPos) {
+ beforePositionSet(eles, newPos, true);
+ },
+ onSet: function onSet(eles) {
+ eles.dirtyCompoundBoundsCache();
}
- }, {
- key: "render",
- value: function render() {
- var _this$props = this.props,
- getItemString = _this$props.getItemString,
- nodeTypeIndicator = _this$props.nodeTypeIndicator,
- nodeType = _this$props.nodeType,
- data = _this$props.data,
- hideRoot = _this$props.hideRoot,
- createItemString = _this$props.createItemString,
- styling = _this$props.styling,
- collectionLimit = _this$props.collectionLimit,
- keyPath = _this$props.keyPath,
- labelRenderer = _this$props.labelRenderer,
- expandable = _this$props.expandable;
- var expanded = this.state.expanded;
- var renderedChildren = expanded || hideRoot && this.props.level === 0 ? renderChildNodes(_objectSpread(_objectSpread({}, this.props), {}, {
- level: this.props.level + 1
- })) : null;
- var itemType = /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", styling('nestedNodeItemType', expanded), nodeTypeIndicator);
- var renderedItemString = getItemString(nodeType, data, itemType, createItemString(data, collectionLimit), keyPath);
- var stylingArgs = [keyPath, nodeType, expanded, expandable];
- return hideRoot ? /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("li", styling.apply(void 0, ['rootNode'].concat(stylingArgs)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling.apply(void 0, ['rootNodeChildren'].concat(stylingArgs)), renderedChildren)) : /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("li", styling.apply(void 0, ['nestedNode'].concat(stylingArgs)), expandable && /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONArrow__WEBPACK_IMPORTED_MODULE_14__["default"], {
- styling: styling,
- nodeType: nodeType,
- expanded: expanded,
- onClick: this.handleClick
- }), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("label", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, styling.apply(void 0, [['label', 'nestedNodeLabel']].concat(stylingArgs)), {
- onClick: this.handleClick
- }), labelRenderer.apply(void 0, stylingArgs)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_8__["default"])({}, styling.apply(void 0, ['nestedNodeItemString'].concat(stylingArgs)), {
- onClick: this.handleClick
- }), renderedItemString), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling.apply(void 0, ['nestedNodeChildren'].concat(stylingArgs)), renderedChildren));
+ })),
+ positions: function positions(pos, silent) {
+ if (plainObject(pos)) {
+ if (silent) {
+ this.silentPosition(pos);
+ } else {
+ this.position(pos);
+ }
+ } else if (fn$6(pos)) {
+ var _fn = pos;
+ var cy = this.cy();
+ cy.startBatch();
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var _pos = void 0;
+ if (_pos = _fn(ele, i)) {
+ if (silent) {
+ ele.silentPosition(_pos);
+ } else {
+ ele.position(_pos);
+ }
+ }
+ }
+ cy.endBatch();
}
- }]);
-
- return JSONNestedNode;
-}((react__WEBPACK_IMPORTED_MODULE_9___default().Component));
-
-(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(JSONNestedNode, "propTypes", {
- getItemString: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
- nodeTypeIndicator: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
- nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().string).isRequired,
- data: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
- hideRoot: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool).isRequired,
- createItemString: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
- styling: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
- collectionLimit: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number),
- keyPath: prop_types__WEBPACK_IMPORTED_MODULE_10___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number)])).isRequired,
- labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func).isRequired,
- shouldExpandNode: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func),
- level: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number).isRequired,
- sortObjectKeys: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().func), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)]),
- isCircular: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
- expandable: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)
-});
-
-(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_6__["default"])(JSONNestedNode, "defaultProps", {
- data: [],
- circularCache: [],
- level: 0,
- expandable: true
-});
-
-
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/JSONNode.js":
-/*!**********************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONNode.js ***!
- \**********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_3__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_4___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_4__);
-/* harmony import */ var _objType__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./objType */ "./node_modules/react-json-tree/lib/esm/objType.js");
-/* harmony import */ var _JSONObjectNode__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./JSONObjectNode */ "./node_modules/react-json-tree/lib/esm/JSONObjectNode.js");
-/* harmony import */ var _JSONArrayNode__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./JSONArrayNode */ "./node_modules/react-json-tree/lib/esm/JSONArrayNode.js");
-/* harmony import */ var _JSONIterableNode__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./JSONIterableNode */ "./node_modules/react-json-tree/lib/esm/JSONIterableNode.js");
-/* harmony import */ var _JSONValueNode__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./JSONValueNode */ "./node_modules/react-json-tree/lib/esm/JSONValueNode.js");
-
-
-
-var _excluded = ["getItemString", "keyPath", "labelRenderer", "styling", "value", "valueRenderer", "isCustomNode"];
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_1__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-
-
-
-
-
-
-
-
-
-var JSONNode = function JSONNode(_ref) {
- var getItemString = _ref.getItemString,
- keyPath = _ref.keyPath,
- labelRenderer = _ref.labelRenderer,
- styling = _ref.styling,
- value = _ref.value,
- valueRenderer = _ref.valueRenderer,
- isCustomNode = _ref.isCustomNode,
- rest = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_2__["default"])(_ref, _excluded);
-
- var nodeType = isCustomNode(value) ? 'Custom' : (0,_objType__WEBPACK_IMPORTED_MODULE_5__["default"])(value);
- var simpleNodeProps = {
- getItemString: getItemString,
- key: keyPath[0],
- keyPath: keyPath,
- labelRenderer: labelRenderer,
- nodeType: nodeType,
- styling: styling,
- value: value,
- valueRenderer: valueRenderer
- };
-
- var nestedNodeProps = _objectSpread(_objectSpread(_objectSpread({}, rest), simpleNodeProps), {}, {
- data: value,
- isCustomNode: isCustomNode
- });
-
- switch (nodeType) {
- case 'Object':
- case 'Error':
- case 'WeakMap':
- case 'WeakSet':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONObjectNode__WEBPACK_IMPORTED_MODULE_6__["default"], nestedNodeProps);
-
- case 'Array':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONArrayNode__WEBPACK_IMPORTED_MODULE_7__["default"], nestedNodeProps);
+ return this; // chaining
+ },
- case 'Iterable':
- case 'Map':
- case 'Set':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONIterableNode__WEBPACK_IMPORTED_MODULE_8__["default"], nestedNodeProps);
+ silentPositions: function silentPositions(pos) {
+ return this.positions(pos, true);
+ },
+ shift: function shift(dim, val, silent) {
+ var delta;
+ if (plainObject(dim)) {
+ delta = {
+ x: number$1(dim.x) ? dim.x : 0,
+ y: number$1(dim.y) ? dim.y : 0
+ };
+ silent = val;
+ } else if (string(dim) && number$1(val)) {
+ delta = {
+ x: 0,
+ y: 0
+ };
+ delta[dim] = val;
+ }
+ if (delta != null) {
+ var cy = this.cy();
+ cy.startBatch();
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
- case 'String':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter(raw) {
- return "\"".concat(raw, "\"");
+ // exclude any node that is a descendant of the calling collection
+ if (cy.hasCompoundNodes() && ele.isChild() && ele.ancestors().anySame(this)) {
+ continue;
}
- }));
-
- case 'Number':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], simpleNodeProps);
-
- case 'Boolean':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter(raw) {
- return raw ? 'true' : 'false';
+ var pos = ele.position();
+ var newPos = {
+ x: pos.x + delta.x,
+ y: pos.y + delta.y
+ };
+ if (silent) {
+ ele.silentPosition(newPos);
+ } else {
+ ele.position(newPos);
}
- }));
-
- case 'Date':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter(raw) {
- return raw.toISOString();
+ }
+ cy.endBatch();
+ }
+ return this;
+ },
+ silentShift: function silentShift(dim, val) {
+ if (plainObject(dim)) {
+ this.shift(dim, true);
+ } else if (string(dim) && number$1(val)) {
+ this.shift(dim, val, true);
+ }
+ return this;
+ },
+ // get/set the rendered (i.e. on screen) positon of the element
+ renderedPosition: function renderedPosition(dim, val) {
+ var ele = this[0];
+ var cy = this.cy();
+ var zoom = cy.zoom();
+ var pan = cy.pan();
+ var rpos = plainObject(dim) ? dim : undefined;
+ var setting = rpos !== undefined || val !== undefined && string(dim);
+ if (ele && ele.isNode()) {
+ // must have an element and must be a node to return position
+ if (setting) {
+ for (var i = 0; i < this.length; i++) {
+ var _ele = this[i];
+ if (val !== undefined) {
+ // set one dimension
+ _ele.position(dim, (val - pan[dim]) / zoom);
+ } else if (rpos !== undefined) {
+ // set whole position
+ _ele.position(renderedToModelPosition(rpos, zoom, pan));
+ }
}
- }));
-
- case 'Null':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter() {
- return 'null';
+ } else {
+ // getting
+ var pos = ele.position();
+ rpos = modelToRenderedPosition(pos, zoom, pan);
+ if (dim === undefined) {
+ // then return the whole rendered position
+ return rpos;
+ } else {
+ // then return the specified dimension
+ return rpos[dim];
}
- }));
+ }
+ } else if (!setting) {
+ return undefined; // for empty collection case
+ }
- case 'Undefined':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter() {
- return 'undefined';
- }
- }));
+ return this; // chaining
+ },
- case 'Function':
- case 'Symbol':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter(raw) {
- return raw.toString();
+ // get/set the position relative to the parent
+ relativePosition: function relativePosition(dim, val) {
+ var ele = this[0];
+ var cy = this.cy();
+ var ppos = plainObject(dim) ? dim : undefined;
+ var setting = ppos !== undefined || val !== undefined && string(dim);
+ var hasCompoundNodes = cy.hasCompoundNodes();
+ if (ele && ele.isNode()) {
+ // must have an element and must be a node to return position
+ if (setting) {
+ for (var i = 0; i < this.length; i++) {
+ var _ele2 = this[i];
+ var parent = hasCompoundNodes ? _ele2.parent() : null;
+ var hasParent = parent && parent.length > 0;
+ var relativeToParent = hasParent;
+ if (hasParent) {
+ parent = parent[0];
+ }
+ var origin = relativeToParent ? parent.position() : {
+ x: 0,
+ y: 0
+ };
+ if (val !== undefined) {
+ // set one dimension
+ _ele2.position(dim, val + origin[dim]);
+ } else if (ppos !== undefined) {
+ // set whole position
+ _ele2.position({
+ x: ppos.x + origin.x,
+ y: ppos.y + origin.y
+ });
+ }
}
- }));
-
- case 'Custom':
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], simpleNodeProps);
-
- default:
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_3___default().createElement(_JSONValueNode__WEBPACK_IMPORTED_MODULE_9__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, simpleNodeProps, {
- valueGetter: function valueGetter() {
- return "<".concat(nodeType, ">");
+ } else {
+ // getting
+ var pos = ele.position();
+ var _parent = hasCompoundNodes ? ele.parent() : null;
+ var _hasParent = _parent && _parent.length > 0;
+ var _relativeToParent = _hasParent;
+ if (_hasParent) {
+ _parent = _parent[0];
}
- }));
- }
-};
+ var _origin = _relativeToParent ? _parent.position() : {
+ x: 0,
+ y: 0
+ };
+ ppos = {
+ x: pos.x - _origin.x,
+ y: pos.y - _origin.y
+ };
+ if (dim === undefined) {
+ // then return the whole rendered position
+ return ppos;
+ } else {
+ // then return the specified dimension
+ return ppos[dim];
+ }
+ }
+ } else if (!setting) {
+ return undefined; // for empty collection case
+ }
-JSONNode.propTypes = {
- getItemString: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
- keyPath: prop_types__WEBPACK_IMPORTED_MODULE_4___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_4___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_4___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_4___default().number)]).isRequired).isRequired,
- labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
- styling: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
- value: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().any),
- valueRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired,
- isCustomNode: (prop_types__WEBPACK_IMPORTED_MODULE_4___default().func).isRequired
+ return this; // chaining
+ }
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONNode);
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/JSONObjectNode.js":
-/*!****************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONObjectNode.js ***!
- \****************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_2__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_3__);
-/* harmony import */ var _JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./JSONNestedNode */ "./node_modules/react-json-tree/lib/esm/JSONNestedNode.js");
-
-
-var _excluded = ["data"];
-
+// aliases
+fn$4.modelPosition = fn$4.point = fn$4.position;
+fn$4.modelPositions = fn$4.points = fn$4.positions;
+fn$4.renderedPoint = fn$4.renderedPosition;
+fn$4.relativePoint = fn$4.relativePosition;
+var position = elesfn$c;
+var fn$3, elesfn$b;
+fn$3 = elesfn$b = {};
+elesfn$b.renderedBoundingBox = function (options) {
+ var bb = this.boundingBox(options);
+ var cy = this.cy();
+ var zoom = cy.zoom();
+ var pan = cy.pan();
+ var x1 = bb.x1 * zoom + pan.x;
+ var x2 = bb.x2 * zoom + pan.x;
+ var y1 = bb.y1 * zoom + pan.y;
+ var y2 = bb.y2 * zoom + pan.y;
+ return {
+ x1: x1,
+ x2: x2,
+ y1: y1,
+ y2: y2,
+ w: x2 - x1,
+ h: y2 - y1
+ };
+};
+elesfn$b.dirtyCompoundBoundsCache = function () {
+ var silent = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
+ var cy = this.cy();
+ if (!cy.styleEnabled() || !cy.hasCompoundNodes()) {
+ return this;
+ }
+ this.forEachUp(function (ele) {
+ if (ele.isParent()) {
+ var _p = ele._private;
+ _p.compoundBoundsClean = false;
+ _p.bbCache = null;
+ if (!silent) {
+ ele.emitAndNotify('bounds');
+ }
+ }
+ });
+ return this;
+};
+elesfn$b.updateCompoundBounds = function () {
+ var force = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : false;
+ var cy = this.cy();
-// Returns the "n Items" string for this node,
-// generating and caching it if it hasn't been created yet.
-function createItemString(data) {
- var len = Object.getOwnPropertyNames(data).length;
- return "".concat(len, " ").concat(len !== 1 ? 'keys' : 'key');
-}
+ // not possible to do on non-compound graphs or with the style disabled
+ if (!cy.styleEnabled() || !cy.hasCompoundNodes()) {
+ return this;
+ }
-// Configures <JSONNestedNode> to render an Object
-var JSONObjectNode = function JSONObjectNode(_ref) {
- var data = _ref.data,
- props = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_ref, _excluded);
+ // save cycles when batching -- but bounds will be stale (or not exist yet)
+ if (!force && cy.batching()) {
+ return this;
+ }
+ function update(parent) {
+ if (!parent.isParent()) {
+ return;
+ }
+ var _p = parent._private;
+ var children = parent.children();
+ var includeLabels = parent.pstyle('compound-sizing-wrt-labels').value === 'include';
+ var min = {
+ width: {
+ val: parent.pstyle('min-width').pfValue,
+ left: parent.pstyle('min-width-bias-left'),
+ right: parent.pstyle('min-width-bias-right')
+ },
+ height: {
+ val: parent.pstyle('min-height').pfValue,
+ top: parent.pstyle('min-height-bias-top'),
+ bottom: parent.pstyle('min-height-bias-bottom')
+ }
+ };
+ var bb = children.boundingBox({
+ includeLabels: includeLabels,
+ includeOverlays: false,
+ // updating the compound bounds happens outside of the regular
+ // cache cycle (i.e. before fired events)
+ useCache: false
+ });
+ var pos = _p.position;
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_2___default().createElement(_JSONNestedNode__WEBPACK_IMPORTED_MODULE_4__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, props, {
- data: data,
- nodeType: "Object",
- nodeTypeIndicator: props.nodeType === 'Error' ? 'Error()' : '{}',
- createItemString: createItemString,
- expandable: Object.getOwnPropertyNames(data).length > 0
- }));
+ // if children take up zero area then keep position and fall back on stylesheet w/h
+ if (bb.w === 0 || bb.h === 0) {
+ bb = {
+ w: parent.pstyle('width').pfValue,
+ h: parent.pstyle('height').pfValue
+ };
+ bb.x1 = pos.x - bb.w / 2;
+ bb.x2 = pos.x + bb.w / 2;
+ bb.y1 = pos.y - bb.h / 2;
+ bb.y2 = pos.y + bb.h / 2;
+ }
+ function computeBiasValues(propDiff, propBias, propBiasComplement) {
+ var biasDiff = 0;
+ var biasComplementDiff = 0;
+ var biasTotal = propBias + propBiasComplement;
+ if (propDiff > 0 && biasTotal > 0) {
+ biasDiff = propBias / biasTotal * propDiff;
+ biasComplementDiff = propBiasComplement / biasTotal * propDiff;
+ }
+ return {
+ biasDiff: biasDiff,
+ biasComplementDiff: biasComplementDiff
+ };
+ }
+ function computePaddingValues(width, height, paddingObject, relativeTo) {
+ // Assuming percentage is number from 0 to 1
+ if (paddingObject.units === '%') {
+ switch (relativeTo) {
+ case 'width':
+ return width > 0 ? paddingObject.pfValue * width : 0;
+ case 'height':
+ return height > 0 ? paddingObject.pfValue * height : 0;
+ case 'average':
+ return width > 0 && height > 0 ? paddingObject.pfValue * (width + height) / 2 : 0;
+ case 'min':
+ return width > 0 && height > 0 ? width > height ? paddingObject.pfValue * height : paddingObject.pfValue * width : 0;
+ case 'max':
+ return width > 0 && height > 0 ? width > height ? paddingObject.pfValue * width : paddingObject.pfValue * height : 0;
+ default:
+ return 0;
+ }
+ } else if (paddingObject.units === 'px') {
+ return paddingObject.pfValue;
+ } else {
+ return 0;
+ }
+ }
+ var leftVal = min.width.left.value;
+ if (min.width.left.units === 'px' && min.width.val > 0) {
+ leftVal = leftVal * 100 / min.width.val;
+ }
+ var rightVal = min.width.right.value;
+ if (min.width.right.units === 'px' && min.width.val > 0) {
+ rightVal = rightVal * 100 / min.width.val;
+ }
+ var topVal = min.height.top.value;
+ if (min.height.top.units === 'px' && min.height.val > 0) {
+ topVal = topVal * 100 / min.height.val;
+ }
+ var bottomVal = min.height.bottom.value;
+ if (min.height.bottom.units === 'px' && min.height.val > 0) {
+ bottomVal = bottomVal * 100 / min.height.val;
+ }
+ var widthBiasDiffs = computeBiasValues(min.width.val - bb.w, leftVal, rightVal);
+ var diffLeft = widthBiasDiffs.biasDiff;
+ var diffRight = widthBiasDiffs.biasComplementDiff;
+ var heightBiasDiffs = computeBiasValues(min.height.val - bb.h, topVal, bottomVal);
+ var diffTop = heightBiasDiffs.biasDiff;
+ var diffBottom = heightBiasDiffs.biasComplementDiff;
+ _p.autoPadding = computePaddingValues(bb.w, bb.h, parent.pstyle('padding'), parent.pstyle('padding-relative-to').value);
+ _p.autoWidth = Math.max(bb.w, min.width.val);
+ pos.x = (-diffLeft + bb.x1 + bb.x2 + diffRight) / 2;
+ _p.autoHeight = Math.max(bb.h, min.height.val);
+ pos.y = (-diffTop + bb.y1 + bb.y2 + diffBottom) / 2;
+ }
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var _p = ele._private;
+ if (!_p.compoundBoundsClean || force) {
+ update(ele);
+ if (!cy.batching()) {
+ _p.compoundBoundsClean = true;
+ }
+ }
+ }
+ return this;
};
-
-JSONObjectNode.propTypes = {
- data: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().object),
- nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_3___default().string).isRequired
+var noninf = function noninf(x) {
+ if (x === Infinity || x === -Infinity) {
+ return 0;
+ }
+ return x;
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONObjectNode);
-
-/***/ }),
+var updateBounds = function updateBounds(b, x1, y1, x2, y2) {
+ // don't update with zero area boxes
+ if (x2 - x1 === 0 || y2 - y1 === 0) {
+ return;
+ }
-/***/ "./node_modules/react-json-tree/lib/esm/JSONValueNode.js":
-/*!***************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/JSONValueNode.js ***!
- \***************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+ // don't update with null dim
+ if (x1 == null || y1 == null || x2 == null || y2 == null) {
+ return;
+ }
+ b.x1 = x1 < b.x1 ? x1 : b.x1;
+ b.x2 = x2 > b.x2 ? x2 : b.x2;
+ b.y1 = y1 < b.y1 ? y1 : b.y1;
+ b.y2 = y2 > b.y2 ? y2 : b.y2;
+ b.w = b.x2 - b.x1;
+ b.h = b.y2 - b.y1;
+};
+var updateBoundsFromBox = function updateBoundsFromBox(b, b2) {
+ if (b2 == null) {
+ return b;
+ }
+ return updateBounds(b, b2.x1, b2.y1, b2.x2, b2.y2);
+};
+var prefixedProperty = function prefixedProperty(obj, field, prefix) {
+ return getPrefixedProperty(obj, field, prefix);
+};
+var updateBoundsFromArrow = function updateBoundsFromArrow(bounds, ele, prefix) {
+ if (ele.cy().headless()) {
+ return;
+ }
+ var _p = ele._private;
+ var rstyle = _p.rstyle;
+ var halfArW = rstyle.arrowWidth / 2;
+ var arrowType = ele.pstyle(prefix + '-arrow-shape').value;
+ var x;
+ var y;
+ if (arrowType !== 'none') {
+ if (prefix === 'source') {
+ x = rstyle.srcX;
+ y = rstyle.srcY;
+ } else if (prefix === 'target') {
+ x = rstyle.tgtX;
+ y = rstyle.tgtY;
+ } else {
+ x = rstyle.midX;
+ y = rstyle.midY;
+ }
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_1__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_2__);
+ // always store the individual arrow bounds
+ var bbs = _p.arrowBounds = _p.arrowBounds || {};
+ var bb = bbs[prefix] = bbs[prefix] || {};
+ bb.x1 = x - halfArW;
+ bb.y1 = y - halfArW;
+ bb.x2 = x + halfArW;
+ bb.y2 = y + halfArW;
+ bb.w = bb.x2 - bb.x1;
+ bb.h = bb.y2 - bb.y1;
+ expandBoundingBox(bb, 1);
+ updateBounds(bounds, bb.x1, bb.y1, bb.x2, bb.y2);
+ }
+};
+var updateBoundsFromLabel = function updateBoundsFromLabel(bounds, ele, prefix) {
+ if (ele.cy().headless()) {
+ return;
+ }
+ var prefixDash;
+ if (prefix) {
+ prefixDash = prefix + '-';
+ } else {
+ prefixDash = '';
+ }
+ var _p = ele._private;
+ var rstyle = _p.rstyle;
+ var label = ele.pstyle(prefixDash + 'label').strValue;
+ if (label) {
+ var halign = ele.pstyle('text-halign');
+ var valign = ele.pstyle('text-valign');
+ var labelWidth = prefixedProperty(rstyle, 'labelWidth', prefix);
+ var labelHeight = prefixedProperty(rstyle, 'labelHeight', prefix);
+ var labelX = prefixedProperty(rstyle, 'labelX', prefix);
+ var labelY = prefixedProperty(rstyle, 'labelY', prefix);
+ var marginX = ele.pstyle(prefixDash + 'text-margin-x').pfValue;
+ var marginY = ele.pstyle(prefixDash + 'text-margin-y').pfValue;
+ var isEdge = ele.isEdge();
+ var rotation = ele.pstyle(prefixDash + 'text-rotation');
+ var outlineWidth = ele.pstyle('text-outline-width').pfValue;
+ var borderWidth = ele.pstyle('text-border-width').pfValue;
+ var halfBorderWidth = borderWidth / 2;
+ var padding = ele.pstyle('text-background-padding').pfValue;
+ var marginOfError = 2; // expand to work around browser dimension inaccuracies
+ var lh = labelHeight;
+ var lw = labelWidth;
+ var lw_2 = lw / 2;
+ var lh_2 = lh / 2;
+ var lx1, lx2, ly1, ly2;
+ if (isEdge) {
+ lx1 = labelX - lw_2;
+ lx2 = labelX + lw_2;
+ ly1 = labelY - lh_2;
+ ly2 = labelY + lh_2;
+ } else {
+ switch (halign.value) {
+ case 'left':
+ lx1 = labelX - lw;
+ lx2 = labelX;
+ break;
+ case 'center':
+ lx1 = labelX - lw_2;
+ lx2 = labelX + lw_2;
+ break;
+ case 'right':
+ lx1 = labelX;
+ lx2 = labelX + lw;
+ break;
+ }
+ switch (valign.value) {
+ case 'top':
+ ly1 = labelY - lh;
+ ly2 = labelY;
+ break;
+ case 'center':
+ ly1 = labelY - lh_2;
+ ly2 = labelY + lh_2;
+ break;
+ case 'bottom':
+ ly1 = labelY;
+ ly2 = labelY + lh;
+ break;
+ }
+ }
+ // shift by margin and expand by outline and border
+ lx1 += marginX - Math.max(outlineWidth, halfBorderWidth) - padding - marginOfError;
+ lx2 += marginX + Math.max(outlineWidth, halfBorderWidth) + padding + marginOfError;
+ ly1 += marginY - Math.max(outlineWidth, halfBorderWidth) - padding - marginOfError;
+ ly2 += marginY + Math.max(outlineWidth, halfBorderWidth) + padding + marginOfError;
+ // always store the unrotated label bounds separately
+ var bbPrefix = prefix || 'main';
+ var bbs = _p.labelBounds;
+ var bb = bbs[bbPrefix] = bbs[bbPrefix] || {};
+ bb.x1 = lx1;
+ bb.y1 = ly1;
+ bb.x2 = lx2;
+ bb.y2 = ly2;
+ bb.w = lx2 - lx1;
+ bb.h = ly2 - ly1;
+ var isAutorotate = isEdge && rotation.strValue === 'autorotate';
+ var isPfValue = rotation.pfValue != null && rotation.pfValue !== 0;
+ if (isAutorotate || isPfValue) {
+ var theta = isAutorotate ? prefixedProperty(_p.rstyle, 'labelAngle', prefix) : rotation.pfValue;
+ var cos = Math.cos(theta);
+ var sin = Math.sin(theta);
-var JSONValueNode = function JSONValueNode(_ref) {
- var nodeType = _ref.nodeType,
- styling = _ref.styling,
- labelRenderer = _ref.labelRenderer,
- keyPath = _ref.keyPath,
- valueRenderer = _ref.valueRenderer,
- value = _ref.value,
- _ref$valueGetter = _ref.valueGetter,
- valueGetter = _ref$valueGetter === void 0 ? function (value) {
- return value;
- } : _ref$valueGetter;
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("li", styling('value', nodeType, keyPath), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("label", styling(['label', 'valueLabel'], nodeType, keyPath), labelRenderer(keyPath, nodeType, false, false)), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_1___default().createElement("span", styling('valueText', nodeType, keyPath), valueRenderer.apply(void 0, [valueGetter(value), value].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(keyPath)))));
+ // rotation point (default value for center-center)
+ var xo = (lx1 + lx2) / 2;
+ var yo = (ly1 + ly2) / 2;
+ if (!isEdge) {
+ switch (halign.value) {
+ case 'left':
+ xo = lx2;
+ break;
+ case 'right':
+ xo = lx1;
+ break;
+ }
+ switch (valign.value) {
+ case 'top':
+ yo = ly2;
+ break;
+ case 'bottom':
+ yo = ly1;
+ break;
+ }
+ }
+ var rotate = function rotate(x, y) {
+ x = x - xo;
+ y = y - yo;
+ return {
+ x: x * cos - y * sin + xo,
+ y: x * sin + y * cos + yo
+ };
+ };
+ var px1y1 = rotate(lx1, ly1);
+ var px1y2 = rotate(lx1, ly2);
+ var px2y1 = rotate(lx2, ly1);
+ var px2y2 = rotate(lx2, ly2);
+ lx1 = Math.min(px1y1.x, px1y2.x, px2y1.x, px2y2.x);
+ lx2 = Math.max(px1y1.x, px1y2.x, px2y1.x, px2y2.x);
+ ly1 = Math.min(px1y1.y, px1y2.y, px2y1.y, px2y2.y);
+ ly2 = Math.max(px1y1.y, px1y2.y, px2y1.y, px2y2.y);
+ }
+ var bbPrefixRot = bbPrefix + 'Rot';
+ var bbRot = bbs[bbPrefixRot] = bbs[bbPrefixRot] || {};
+ bbRot.x1 = lx1;
+ bbRot.y1 = ly1;
+ bbRot.x2 = lx2;
+ bbRot.y2 = ly2;
+ bbRot.w = lx2 - lx1;
+ bbRot.h = ly2 - ly1;
+ updateBounds(bounds, lx1, ly1, lx2, ly2);
+ updateBounds(_p.labelBounds.all, lx1, ly1, lx2, ly2);
+ }
+ return bounds;
};
-
-JSONValueNode.propTypes = {
- nodeType: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().string).isRequired,
- styling: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
- labelRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
- keyPath: prop_types__WEBPACK_IMPORTED_MODULE_2___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_2___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_2___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_2___default().number)]).isRequired).isRequired,
- valueRenderer: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func).isRequired,
- value: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().any),
- valueGetter: (prop_types__WEBPACK_IMPORTED_MODULE_2___default().func)
+var updateBoundsFromOutline = function updateBoundsFromOutline(bounds, ele) {
+ if (ele.cy().headless()) {
+ return;
+ }
+ var outlineOpacity = ele.pstyle('outline-opacity').value;
+ var outlineWidth = ele.pstyle('outline-width').value;
+ if (outlineOpacity > 0 && outlineWidth > 0) {
+ var outlineOffset = ele.pstyle('outline-offset').value;
+ var nodeShape = ele.pstyle('shape').value;
+ var outlineSize = outlineWidth + outlineOffset;
+ var scaleX = (bounds.w + outlineSize * 2) / bounds.w;
+ var scaleY = (bounds.h + outlineSize * 2) / bounds.h;
+ var xOffset = 0;
+ var yOffset = 0;
+ if (["diamond", "pentagon", "round-triangle"].includes(nodeShape)) {
+ scaleX = (bounds.w + outlineSize * 2.4) / bounds.w;
+ yOffset = -outlineSize / 3.6;
+ } else if (["concave-hexagon", "rhomboid", "right-rhomboid"].includes(nodeShape)) {
+ scaleX = (bounds.w + outlineSize * 2.4) / bounds.w;
+ } else if (nodeShape === "star") {
+ scaleX = (bounds.w + outlineSize * 2.8) / bounds.w;
+ scaleY = (bounds.h + outlineSize * 2.6) / bounds.h;
+ yOffset = -outlineSize / 3.8;
+ } else if (nodeShape === "triangle") {
+ scaleX = (bounds.w + outlineSize * 2.8) / bounds.w;
+ scaleY = (bounds.h + outlineSize * 2.4) / bounds.h;
+ yOffset = -outlineSize / 1.4;
+ } else if (nodeShape === "vee") {
+ scaleX = (bounds.w + outlineSize * 4.4) / bounds.w;
+ scaleY = (bounds.h + outlineSize * 3.8) / bounds.h;
+ yOffset = -outlineSize * .5;
+ }
+ var hDelta = bounds.h * scaleY - bounds.h;
+ var wDelta = bounds.w * scaleX - bounds.w;
+ expandBoundingBoxSides(bounds, [Math.ceil(hDelta / 2), Math.ceil(wDelta / 2)]);
+ if (xOffset != 0 || yOffset !== 0) {
+ var oBounds = shiftBoundingBox(bounds, xOffset, yOffset);
+ updateBoundingBox(bounds, oBounds);
+ }
+ }
};
-/* harmony default export */ __webpack_exports__["default"] = (JSONValueNode);
-/***/ }),
+// get the bounding box of the elements (in raw model position)
+var boundingBoxImpl = function boundingBoxImpl(ele, options) {
+ var cy = ele._private.cy;
+ var styleEnabled = cy.styleEnabled();
+ var headless = cy.headless();
+ var bounds = makeBoundingBox();
+ var _p = ele._private;
+ var isNode = ele.isNode();
+ var isEdge = ele.isEdge();
+ var ex1, ex2, ey1, ey2; // extrema of body / lines
+ var x, y; // node pos
+ var rstyle = _p.rstyle;
+ var manualExpansion = isNode && styleEnabled ? ele.pstyle('bounds-expansion').pfValue : [0];
-/***/ "./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js":
-/*!************************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js ***!
- \************************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+ // must use `display` prop only, as reading `compound.width()` causes recursion
+ // (other factors like width values will be considered later in this function anyway)
+ var isDisplayed = function isDisplayed(ele) {
+ return ele.pstyle('display').value !== 'none';
+ };
+ var displayed = !styleEnabled || isDisplayed(ele)
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var react_base16_styling__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! react-base16-styling */ "./node_modules/react-base16-styling/lib/esm/index.js");
-/* harmony import */ var _themes_solarized__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./themes/solarized */ "./node_modules/react-json-tree/lib/esm/themes/solarized.js");
+ // must take into account connected nodes b/c of implicit edge hiding on display:none node
+ && (!isEdge || isDisplayed(ele.source()) && isDisplayed(ele.target()));
+ if (displayed) {
+ // displayed suffices, since we will find zero area eles anyway
+ var overlayOpacity = 0;
+ var overlayPadding = 0;
+ if (styleEnabled && options.includeOverlays) {
+ overlayOpacity = ele.pstyle('overlay-opacity').value;
+ if (overlayOpacity !== 0) {
+ overlayPadding = ele.pstyle('overlay-padding').value;
+ }
+ }
+ var underlayOpacity = 0;
+ var underlayPadding = 0;
+ if (styleEnabled && options.includeUnderlays) {
+ underlayOpacity = ele.pstyle('underlay-opacity').value;
+ if (underlayOpacity !== 0) {
+ underlayPadding = ele.pstyle('underlay-padding').value;
+ }
+ }
+ var padding = Math.max(overlayPadding, underlayPadding);
+ var w = 0;
+ var wHalf = 0;
+ if (styleEnabled) {
+ w = ele.pstyle('width').pfValue;
+ wHalf = w / 2;
+ }
+ if (isNode && options.includeNodes) {
+ var pos = ele.position();
+ x = pos.x;
+ y = pos.y;
+ var _w = ele.outerWidth();
+ var halfW = _w / 2;
+ var h = ele.outerHeight();
+ var halfH = h / 2;
+ // handle node dimensions
+ /////////////////////////
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+ ex1 = x - halfW;
+ ex2 = x + halfW;
+ ey1 = y - halfH;
+ ey2 = y + halfH;
+ updateBounds(bounds, ex1, ey1, ex2, ey2);
+ if (styleEnabled && options.includeOutlines) {
+ updateBoundsFromOutline(bounds, ele);
+ }
+ } else if (isEdge && options.includeEdges) {
+ if (styleEnabled && !headless) {
+ var curveStyle = ele.pstyle('curve-style').strValue;
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_0__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+ // handle edge dimensions (rough box estimate)
+ //////////////////////////////////////////////
+ ex1 = Math.min(rstyle.srcX, rstyle.midX, rstyle.tgtX);
+ ex2 = Math.max(rstyle.srcX, rstyle.midX, rstyle.tgtX);
+ ey1 = Math.min(rstyle.srcY, rstyle.midY, rstyle.tgtY);
+ ey2 = Math.max(rstyle.srcY, rstyle.midY, rstyle.tgtY);
+ // take into account edge width
+ ex1 -= wHalf;
+ ex2 += wHalf;
+ ey1 -= wHalf;
+ ey2 += wHalf;
+ updateBounds(bounds, ex1, ey1, ex2, ey2);
+ // precise edges
+ ////////////////
-var colorMap = function colorMap(theme) {
- return {
- BACKGROUND_COLOR: theme.base00,
- TEXT_COLOR: theme.base07,
- STRING_COLOR: theme.base0B,
- DATE_COLOR: theme.base0B,
- NUMBER_COLOR: theme.base09,
- BOOLEAN_COLOR: theme.base09,
- NULL_COLOR: theme.base08,
- UNDEFINED_COLOR: theme.base08,
- FUNCTION_COLOR: theme.base08,
- SYMBOL_COLOR: theme.base08,
- LABEL_COLOR: theme.base0D,
- ARROW_COLOR: theme.base0D,
- ITEM_STRING_COLOR: theme.base0B,
- ITEM_STRING_EXPANDED_COLOR: theme.base03
- };
-};
+ if (curveStyle === 'haystack') {
+ var hpts = rstyle.haystackPts;
+ if (hpts && hpts.length === 2) {
+ ex1 = hpts[0].x;
+ ey1 = hpts[0].y;
+ ex2 = hpts[1].x;
+ ey2 = hpts[1].y;
+ if (ex1 > ex2) {
+ var temp = ex1;
+ ex1 = ex2;
+ ex2 = temp;
+ }
+ if (ey1 > ey2) {
+ var _temp = ey1;
+ ey1 = ey2;
+ ey2 = _temp;
+ }
+ updateBounds(bounds, ex1 - wHalf, ey1 - wHalf, ex2 + wHalf, ey2 + wHalf);
+ }
+ } else if (curveStyle === 'bezier' || curveStyle === 'unbundled-bezier' || curveStyle.endsWith('segments') || curveStyle.endsWith('taxi')) {
+ var pts;
+ switch (curveStyle) {
+ case 'bezier':
+ case 'unbundled-bezier':
+ pts = rstyle.bezierPts;
+ break;
+ case 'segments':
+ case 'taxi':
+ case 'round-segments':
+ case 'round-taxi':
+ pts = rstyle.linePts;
+ break;
+ }
+ if (pts != null) {
+ for (var j = 0; j < pts.length; j++) {
+ var pt = pts[j];
+ ex1 = pt.x - wHalf;
+ ex2 = pt.x + wHalf;
+ ey1 = pt.y - wHalf;
+ ey2 = pt.y + wHalf;
+ updateBounds(bounds, ex1, ey1, ex2, ey2);
+ }
+ }
+ } // bezier-like or segment-like edge
+ } else {
+ // headless or style disabled
-var valueColorMap = function valueColorMap(colors) {
- return {
- String: colors.STRING_COLOR,
- Date: colors.DATE_COLOR,
- Number: colors.NUMBER_COLOR,
- Boolean: colors.BOOLEAN_COLOR,
- Null: colors.NULL_COLOR,
- Undefined: colors.UNDEFINED_COLOR,
- Function: colors.FUNCTION_COLOR,
- Symbol: colors.SYMBOL_COLOR
- };
-};
+ // fallback on source and target positions
+ //////////////////////////////////////////
-var getDefaultThemeStyling = function getDefaultThemeStyling(theme) {
- var colors = colorMap(theme);
- return {
- tree: {
- border: 0,
- padding: 0,
- marginTop: '0.5em',
- marginBottom: '0.5em',
- marginLeft: '0.125em',
- marginRight: 0,
- listStyle: 'none',
- MozUserSelect: 'none',
- WebkitUserSelect: 'none',
- backgroundColor: colors.BACKGROUND_COLOR
- },
- value: function value(_ref, nodeType, keyPath) {
- var style = _ref.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- paddingTop: '0.25em',
- paddingRight: 0,
- marginLeft: '0.875em',
- WebkitUserSelect: 'text',
- MozUserSelect: 'text',
- wordWrap: 'break-word',
- paddingLeft: keyPath.length > 1 ? '2.125em' : '1.25em',
- textIndent: '-0.5em',
- wordBreak: 'break-all'
- })
- };
- },
- label: {
- display: 'inline-block',
- color: colors.LABEL_COLOR
- },
- valueLabel: {
- margin: '0 0.5em 0 0'
- },
- valueText: function valueText(_ref2, nodeType) {
- var style = _ref2.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- color: valueColorMap(colors)[nodeType]
- })
- };
- },
- itemRange: function itemRange(styling, expanded) {
- return {
- style: {
- paddingTop: expanded ? 0 : '0.25em',
- cursor: 'pointer',
- color: colors.LABEL_COLOR
+ var n1 = ele.source();
+ var n1pos = n1.position();
+ var n2 = ele.target();
+ var n2pos = n2.position();
+ ex1 = n1pos.x;
+ ex2 = n2pos.x;
+ ey1 = n1pos.y;
+ ey2 = n2pos.y;
+ if (ex1 > ex2) {
+ var _temp2 = ex1;
+ ex1 = ex2;
+ ex2 = _temp2;
+ }
+ if (ey1 > ey2) {
+ var _temp3 = ey1;
+ ey1 = ey2;
+ ey2 = _temp3;
}
- };
- },
- arrow: function arrow(_ref3, nodeType, expanded) {
- var style = _ref3.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- marginLeft: 0,
- transition: '150ms',
- WebkitTransition: '150ms',
- MozTransition: '150ms',
- WebkitTransform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
- MozTransform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
- transform: expanded ? 'rotateZ(90deg)' : 'rotateZ(0deg)',
- transformOrigin: '45% 50%',
- WebkitTransformOrigin: '45% 50%',
- MozTransformOrigin: '45% 50%',
- position: 'relative',
- lineHeight: '1.1em',
- fontSize: '0.75em'
- })
- };
- },
- arrowContainer: function arrowContainer(_ref4, arrowStyle) {
- var style = _ref4.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- display: 'inline-block',
- paddingRight: '0.5em',
- paddingLeft: arrowStyle === 'double' ? '1em' : 0,
- cursor: 'pointer'
- })
- };
- },
- arrowSign: {
- color: colors.ARROW_COLOR
- },
- arrowSignInner: {
- position: 'absolute',
- top: 0,
- left: '-0.4em'
- },
- nestedNode: function nestedNode(_ref5, keyPath, nodeType, expanded, expandable) {
- var style = _ref5.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- position: 'relative',
- paddingTop: '0.25em',
- marginLeft: keyPath.length > 1 ? '0.875em' : 0,
- paddingLeft: !expandable ? '1.125em' : 0
- })
- };
- },
- rootNode: {
- padding: 0,
- margin: 0
- },
- nestedNodeLabel: function nestedNodeLabel(_ref6, keyPath, nodeType, expanded, expandable) {
- var style = _ref6.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- margin: 0,
- padding: 0,
- WebkitUserSelect: expandable ? 'inherit' : 'text',
- MozUserSelect: expandable ? 'inherit' : 'text',
- cursor: expandable ? 'pointer' : 'default'
- })
- };
- },
- nestedNodeItemString: function nestedNodeItemString(_ref7, keyPath, nodeType, expanded) {
- var style = _ref7.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- paddingLeft: '0.5em',
- cursor: 'default',
- color: expanded ? colors.ITEM_STRING_EXPANDED_COLOR : colors.ITEM_STRING_COLOR
- })
- };
- },
- nestedNodeItemType: {
- marginLeft: '0.3em',
- marginRight: '0.3em'
- },
- nestedNodeChildren: function nestedNodeChildren(_ref8, nodeType, expanded) {
- var style = _ref8.style;
- return {
- style: _objectSpread(_objectSpread({}, style), {}, {
- padding: 0,
- margin: 0,
- listStyle: 'none',
- display: expanded ? 'block' : 'none'
- })
- };
- },
- rootNodeChildren: {
- padding: 0,
- margin: 0,
- listStyle: 'none'
- }
- };
-};
-
-var createStylingFromTheme = (0,react_base16_styling__WEBPACK_IMPORTED_MODULE_1__.createStyling)(getDefaultThemeStyling, {
- defaultBase16: _themes_solarized__WEBPACK_IMPORTED_MODULE_2__["default"]
-});
-/* harmony default export */ __webpack_exports__["default"] = (createStylingFromTheme);
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/getCollectionEntries.js":
-/*!**********************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/getCollectionEntries.js ***!
- \**********************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ "default": function() { return /* binding */ getCollectionEntries; }
-/* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/toConsumableArray */ "./node_modules/@babel/runtime/helpers/esm/toConsumableArray.js");
+ // take into account edge width
+ ex1 -= wHalf;
+ ex2 += wHalf;
+ ey1 -= wHalf;
+ ey2 += wHalf;
+ updateBounds(bounds, ex1, ey1, ex2, ey2);
+ } // headless or style disabled
+ } // edges
+ // handle edge arrow size
+ /////////////////////////
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
+ if (styleEnabled && options.includeEdges && isEdge) {
+ updateBoundsFromArrow(bounds, ele, 'mid-source');
+ updateBoundsFromArrow(bounds, ele, 'mid-target');
+ updateBoundsFromArrow(bounds, ele, 'source');
+ updateBoundsFromArrow(bounds, ele, 'target');
+ }
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+ // ghost
+ ////////
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+ if (styleEnabled) {
+ var ghost = ele.pstyle('ghost').value === 'yes';
+ if (ghost) {
+ var gx = ele.pstyle('ghost-offset-x').pfValue;
+ var gy = ele.pstyle('ghost-offset-y').pfValue;
+ updateBounds(bounds, bounds.x1 + gx, bounds.y1 + gy, bounds.x2 + gx, bounds.y2 + gy);
+ }
+ }
-function getLength(type, collection) {
- if (type === 'Object') {
- // eslint-disable-next-line @typescript-eslint/ban-types
- return Object.keys(collection).length;
- } else if (type === 'Array') {
- return collection.length;
- }
+ // always store the body bounds separately from the labels
+ var bbBody = _p.bodyBounds = _p.bodyBounds || {};
+ assignBoundingBox(bbBody, bounds);
+ expandBoundingBoxSides(bbBody, manualExpansion);
+ expandBoundingBox(bbBody, 1); // expand to work around browser dimension inaccuracies
- return Infinity;
-}
+ // overlay
+ //////////
-function isIterableMap(collection) {
- return typeof collection.set === 'function';
-}
+ if (styleEnabled) {
+ ex1 = bounds.x1;
+ ex2 = bounds.x2;
+ ey1 = bounds.y1;
+ ey2 = bounds.y2;
+ updateBounds(bounds, ex1 - padding, ey1 - padding, ex2 + padding, ey2 + padding);
+ }
-function getEntries(type, collection, sortObjectKeys) {
- var from = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : 0;
- var to = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : Infinity;
- var res;
+ // always store the body bounds separately from the labels
+ var bbOverlay = _p.overlayBounds = _p.overlayBounds || {};
+ assignBoundingBox(bbOverlay, bounds);
+ expandBoundingBoxSides(bbOverlay, manualExpansion);
+ expandBoundingBox(bbOverlay, 1); // expand to work around browser dimension inaccuracies
- if (type === 'Object') {
- var keys = Object.getOwnPropertyNames(collection);
+ // handle label dimensions
+ //////////////////////////
- if (sortObjectKeys) {
- keys.sort(sortObjectKeys === true ? undefined : sortObjectKeys);
+ var bbLabels = _p.labelBounds = _p.labelBounds || {};
+ if (bbLabels.all != null) {
+ clearBoundingBox(bbLabels.all);
+ } else {
+ bbLabels.all = makeBoundingBox();
}
+ if (styleEnabled && options.includeLabels) {
+ if (options.includeMainLabels) {
+ updateBoundsFromLabel(bounds, ele, null);
+ }
+ if (isEdge) {
+ if (options.includeSourceLabels) {
+ updateBoundsFromLabel(bounds, ele, 'source');
+ }
+ if (options.includeTargetLabels) {
+ updateBoundsFromLabel(bounds, ele, 'target');
+ }
+ }
+ } // style enabled for labels
+ } // if displayed
- keys = keys.slice(from, to + 1);
- res = {
- entries: keys.map(function (key) {
- return {
- key: key,
- value: collection[key]
- };
- })
- };
- } else if (type === 'Array') {
- res = {
- entries: collection.slice(from, to + 1).map(function (val, idx) {
- return {
- key: idx + from,
- value: val
- };
- })
+ bounds.x1 = noninf(bounds.x1);
+ bounds.y1 = noninf(bounds.y1);
+ bounds.x2 = noninf(bounds.x2);
+ bounds.y2 = noninf(bounds.y2);
+ bounds.w = noninf(bounds.x2 - bounds.x1);
+ bounds.h = noninf(bounds.y2 - bounds.y1);
+ if (bounds.w > 0 && bounds.h > 0 && displayed) {
+ expandBoundingBoxSides(bounds, manualExpansion);
+
+ // expand bounds by 1 because antialiasing can increase the visual/effective size by 1 on all sides
+ expandBoundingBox(bounds, 1);
+ }
+ return bounds;
+};
+var getKey = function getKey(opts) {
+ var i = 0;
+ var tf = function tf(val) {
+ return (val ? 1 : 0) << i++;
+ };
+ var key = 0;
+ key += tf(opts.incudeNodes);
+ key += tf(opts.includeEdges);
+ key += tf(opts.includeLabels);
+ key += tf(opts.includeMainLabels);
+ key += tf(opts.includeSourceLabels);
+ key += tf(opts.includeTargetLabels);
+ key += tf(opts.includeOverlays);
+ key += tf(opts.includeOutlines);
+ return key;
+};
+var getBoundingBoxPosKey = function getBoundingBoxPosKey(ele) {
+ if (ele.isEdge()) {
+ var p1 = ele.source().position();
+ var p2 = ele.target().position();
+ var r = function r(x) {
+ return Math.round(x);
};
+ return hashIntsArray([r(p1.x), r(p1.y), r(p2.x), r(p2.y)]);
} else {
- var idx = 0;
- var entries = [];
- var done = true;
- var isMap = isIterableMap(collection);
-
- var _iterator = _createForOfIteratorHelper(collection),
- _step;
-
- try {
- for (_iterator.s(); !(_step = _iterator.n()).done;) {
- var item = _step.value;
+ return 0;
+ }
+};
+var cachedBoundingBoxImpl = function cachedBoundingBoxImpl(ele, opts) {
+ var _p = ele._private;
+ var bb;
+ var isEdge = ele.isEdge();
+ var key = opts == null ? defBbOptsKey : getKey(opts);
+ var usingDefOpts = key === defBbOptsKey;
+ var currPosKey = getBoundingBoxPosKey(ele);
+ var isPosKeySame = _p.bbCachePosKey === currPosKey;
+ var useCache = opts.useCache && isPosKeySame;
+ var isDirty = function isDirty(ele) {
+ return ele._private.bbCache == null || ele._private.styleDirty;
+ };
+ var needRecalc = !useCache || isDirty(ele) || isEdge && isDirty(ele.source()) || isDirty(ele.target());
+ if (needRecalc) {
+ if (!isPosKeySame) {
+ ele.recalculateRenderedStyle(useCache);
+ }
+ bb = boundingBoxImpl(ele, defBbOpts);
+ _p.bbCache = bb;
+ _p.bbCachePosKey = currPosKey;
+ } else {
+ bb = _p.bbCache;
+ }
- if (idx > to) {
- done = false;
- break;
+ // not using def opts => need to build up bb from combination of sub bbs
+ if (!usingDefOpts) {
+ var isNode = ele.isNode();
+ bb = makeBoundingBox();
+ if (opts.includeNodes && isNode || opts.includeEdges && !isNode) {
+ if (opts.includeOverlays) {
+ updateBoundsFromBox(bb, _p.overlayBounds);
+ } else {
+ updateBoundsFromBox(bb, _p.bodyBounds);
+ }
+ }
+ if (opts.includeLabels) {
+ if (opts.includeMainLabels && (!isEdge || opts.includeSourceLabels && opts.includeTargetLabels)) {
+ updateBoundsFromBox(bb, _p.labelBounds.all);
+ } else {
+ if (opts.includeMainLabels) {
+ updateBoundsFromBox(bb, _p.labelBounds.mainRot);
}
-
- if (from <= idx) {
- if (isMap && Array.isArray(item)) {
- if (typeof item[0] === 'string' || typeof item[0] === 'number') {
- entries.push({
- key: item[0],
- value: item[1]
- });
- } else {
- entries.push({
- key: "[entry ".concat(idx, "]"),
- value: {
- '[key]': item[0],
- '[value]': item[1]
- }
- });
- }
- } else {
- entries.push({
- key: idx,
- value: item
- });
- }
+ if (opts.includeSourceLabels) {
+ updateBoundsFromBox(bb, _p.labelBounds.sourceRot);
+ }
+ if (opts.includeTargetLabels) {
+ updateBoundsFromBox(bb, _p.labelBounds.targetRot);
}
-
- idx++;
}
- } catch (err) {
- _iterator.e(err);
- } finally {
- _iterator.f();
}
-
- res = {
- hasMore: !done,
- entries: entries
- };
+ bb.w = bb.x2 - bb.x1;
+ bb.h = bb.y2 - bb.y1;
}
+ return bb;
+};
+var defBbOpts = {
+ includeNodes: true,
+ includeEdges: true,
+ includeLabels: true,
+ includeMainLabels: true,
+ includeSourceLabels: true,
+ includeTargetLabels: true,
+ includeOverlays: true,
+ includeUnderlays: true,
+ includeOutlines: true,
+ useCache: true
+};
+var defBbOptsKey = getKey(defBbOpts);
+var filledBbOpts = defaults$g(defBbOpts);
+elesfn$b.boundingBox = function (options) {
+ var bounds;
- return res;
-}
-
-function getRanges(from, to, limit) {
- var ranges = [];
-
- while (to - from > limit * limit) {
- limit = limit * limit;
+ // the main usecase is ele.boundingBox() for a single element with no/def options
+ // specified s.t. the cache is used, so check for this case to make it faster by
+ // avoiding the overhead of the rest of the function
+ if (this.length === 1 && this[0]._private.bbCache != null && !this[0]._private.styleDirty && (options === undefined || options.useCache === undefined || options.useCache === true)) {
+ if (options === undefined) {
+ options = defBbOpts;
+ } else {
+ options = filledBbOpts(options);
+ }
+ bounds = cachedBoundingBoxImpl(this[0], options);
+ } else {
+ bounds = makeBoundingBox();
+ options = options || defBbOpts;
+ var opts = filledBbOpts(options);
+ var eles = this;
+ var cy = eles.cy();
+ var styleEnabled = cy.styleEnabled();
+ if (styleEnabled) {
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ var _p = ele._private;
+ var currPosKey = getBoundingBoxPosKey(ele);
+ var isPosKeySame = _p.bbCachePosKey === currPosKey;
+ var useCache = opts.useCache && isPosKeySame && !_p.styleDirty;
+ ele.recalculateRenderedStyle(useCache);
+ }
+ }
+ this.updateCompoundBounds(!options.useCache);
+ for (var _i = 0; _i < eles.length; _i++) {
+ var _ele = eles[_i];
+ updateBoundsFromBox(bounds, cachedBoundingBoxImpl(_ele, opts));
+ }
+ }
+ bounds.x1 = noninf(bounds.x1);
+ bounds.y1 = noninf(bounds.y1);
+ bounds.x2 = noninf(bounds.x2);
+ bounds.y2 = noninf(bounds.y2);
+ bounds.w = noninf(bounds.x2 - bounds.x1);
+ bounds.h = noninf(bounds.y2 - bounds.y1);
+ return bounds;
+};
+elesfn$b.dirtyBoundingBoxCache = function () {
+ for (var i = 0; i < this.length; i++) {
+ var _p = this[i]._private;
+ _p.bbCache = null;
+ _p.bbCachePosKey = null;
+ _p.bodyBounds = null;
+ _p.overlayBounds = null;
+ _p.labelBounds.all = null;
+ _p.labelBounds.source = null;
+ _p.labelBounds.target = null;
+ _p.labelBounds.main = null;
+ _p.labelBounds.sourceRot = null;
+ _p.labelBounds.targetRot = null;
+ _p.labelBounds.mainRot = null;
+ _p.arrowBounds.source = null;
+ _p.arrowBounds.target = null;
+ _p.arrowBounds['mid-source'] = null;
+ _p.arrowBounds['mid-target'] = null;
}
+ this.emitAndNotify('bounds');
+ return this;
+};
- for (var i = from; i <= to; i += limit) {
- ranges.push({
- from: i,
- to: Math.min(to, i + limit - 1)
+// private helper to get bounding box for custom node positions
+// - good for perf in certain cases but currently requires dirtying the rendered style
+// - would be better to not modify the nodes but the nodes are read directly everywhere in the renderer...
+// - try to use for only things like discrete layouts where the node position would change anyway
+elesfn$b.boundingBoxAt = function (fn) {
+ var nodes = this.nodes();
+ var cy = this.cy();
+ var hasCompoundNodes = cy.hasCompoundNodes();
+ var parents = cy.collection();
+ if (hasCompoundNodes) {
+ parents = nodes.filter(function (node) {
+ return node.isParent();
});
+ nodes = nodes.not(parents);
+ }
+ if (plainObject(fn)) {
+ var obj = fn;
+ fn = function fn() {
+ return obj;
+ };
+ }
+ var storeOldPos = function storeOldPos(node, i) {
+ return node._private.bbAtOldPos = fn(node, i);
+ };
+ var getOldPos = function getOldPos(node) {
+ return node._private.bbAtOldPos;
+ };
+ cy.startBatch();
+ nodes.forEach(storeOldPos).silentPositions(fn);
+ if (hasCompoundNodes) {
+ parents.dirtyCompoundBoundsCache();
+ parents.dirtyBoundingBoxCache();
+ parents.updateCompoundBounds(true); // force update b/c we're inside a batch cycle
}
- return ranges;
-}
-
-function getCollectionEntries(type, collection, sortObjectKeys, limit) {
- var from = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
- var to = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : Infinity;
- var getEntriesBound = getEntries.bind(null, type, collection, sortObjectKeys);
-
- if (!limit) {
- return getEntriesBound().entries;
+ var bb = copyBoundingBox(this.boundingBox({
+ useCache: false
+ }));
+ nodes.silentPositions(getOldPos);
+ if (hasCompoundNodes) {
+ parents.dirtyCompoundBoundsCache();
+ parents.dirtyBoundingBoxCache();
+ parents.updateCompoundBounds(true); // force update b/c we're inside a batch cycle
}
- var isSubset = to < Infinity;
- var length = Math.min(to - from, getLength(type, collection));
+ cy.endBatch();
+ return bb;
+};
+fn$3.boundingbox = fn$3.bb = fn$3.boundingBox;
+fn$3.renderedBoundingbox = fn$3.renderedBoundingBox;
+var bounds = elesfn$b;
- if (type !== 'Iterable') {
- if (length <= limit || limit < 7) {
- return getEntriesBound(from, to).entries;
+var fn$2, elesfn$a;
+fn$2 = elesfn$a = {};
+var defineDimFns = function defineDimFns(opts) {
+ opts.uppercaseName = capitalize(opts.name);
+ opts.autoName = 'auto' + opts.uppercaseName;
+ opts.labelName = 'label' + opts.uppercaseName;
+ opts.outerName = 'outer' + opts.uppercaseName;
+ opts.uppercaseOuterName = capitalize(opts.outerName);
+ fn$2[opts.name] = function dimImpl() {
+ var ele = this[0];
+ var _p = ele._private;
+ var cy = _p.cy;
+ var styleEnabled = cy._private.styleEnabled;
+ if (ele) {
+ if (styleEnabled) {
+ if (ele.isParent()) {
+ ele.updateCompoundBounds();
+ return _p[opts.autoName] || 0;
+ }
+ var d = ele.pstyle(opts.name);
+ switch (d.strValue) {
+ case 'label':
+ ele.recalculateRenderedStyle();
+ return _p.rstyle[opts.labelName] || 0;
+ default:
+ return d.pfValue;
+ }
+ } else {
+ return 1;
+ }
}
- } else {
- if (length <= limit && !isSubset) {
- return getEntriesBound(from, to).entries;
+ };
+ fn$2['outer' + opts.uppercaseName] = function outerDimImpl() {
+ var ele = this[0];
+ var _p = ele._private;
+ var cy = _p.cy;
+ var styleEnabled = cy._private.styleEnabled;
+ if (ele) {
+ if (styleEnabled) {
+ var dim = ele[opts.name]();
+ var border = ele.pstyle('border-width').pfValue; // n.b. 1/2 each side
+ var padding = 2 * ele.padding();
+ return dim + border + padding;
+ } else {
+ return 1;
+ }
+ }
+ };
+ fn$2['rendered' + opts.uppercaseName] = function renderedDimImpl() {
+ var ele = this[0];
+ if (ele) {
+ var d = ele[opts.name]();
+ return d * this.cy().zoom();
+ }
+ };
+ fn$2['rendered' + opts.uppercaseOuterName] = function renderedOuterDimImpl() {
+ var ele = this[0];
+ if (ele) {
+ var od = ele[opts.outerName]();
+ return od * this.cy().zoom();
+ }
+ };
+};
+defineDimFns({
+ name: 'width'
+});
+defineDimFns({
+ name: 'height'
+});
+elesfn$a.padding = function () {
+ var ele = this[0];
+ var _p = ele._private;
+ if (ele.isParent()) {
+ ele.updateCompoundBounds();
+ if (_p.autoPadding !== undefined) {
+ return _p.autoPadding;
+ } else {
+ return ele.pstyle('padding').pfValue;
}
- }
-
- var limitedEntries;
-
- if (type === 'Iterable') {
- var _getEntriesBound = getEntriesBound(from, from + limit - 1),
- hasMore = _getEntriesBound.hasMore,
- entries = _getEntriesBound.entries;
-
- limitedEntries = hasMore ? [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(entries), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getRanges(from + limit, from + 2 * limit - 1, limit))) : entries;
} else {
- limitedEntries = isSubset ? getRanges(from, to, limit) : [].concat((0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getEntriesBound(0, limit - 5).entries), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getRanges(limit - 4, length - 5, limit)), (0,_babel_runtime_helpers_toConsumableArray__WEBPACK_IMPORTED_MODULE_0__["default"])(getEntriesBound(length - 4, length - 1).entries));
+ return ele.pstyle('padding').pfValue;
}
-
- return limitedEntries;
-}
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/index.js":
-/*!*******************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/index.js ***!
- \*******************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ JSONTree: function() { return /* binding */ JSONTree; }
-/* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/extends */ "./node_modules/@babel/runtime/helpers/esm/extends.js");
-/* harmony import */ var _babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/objectWithoutProperties */ "./node_modules/@babel/runtime/helpers/esm/objectWithoutProperties.js");
-/* harmony import */ var _babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/classCallCheck */ "./node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/createClass */ "./node_modules/@babel/runtime/helpers/esm/createClass.js");
-/* harmony import */ var _babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/inherits */ "./node_modules/@babel/runtime/helpers/esm/inherits.js");
-/* harmony import */ var _babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/possibleConstructorReturn */ "./node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
-/* harmony import */ var _babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/getPrototypeOf */ "./node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
-/* harmony import */ var _babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/defineProperty */ "./node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/slicedToArray */ "./node_modules/@babel/runtime/helpers/esm/slicedToArray.js");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! react */ "react");
-/* harmony import */ var react__WEBPACK_IMPORTED_MODULE_9___default = /*#__PURE__*/__webpack_require__.n(react__WEBPACK_IMPORTED_MODULE_9__);
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! prop-types */ "prop-types");
-/* harmony import */ var prop_types__WEBPACK_IMPORTED_MODULE_10___default = /*#__PURE__*/__webpack_require__.n(prop_types__WEBPACK_IMPORTED_MODULE_10__);
-/* harmony import */ var _JSONNode__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./JSONNode */ "./node_modules/react-json-tree/lib/esm/JSONNode.js");
-/* harmony import */ var _createStylingFromTheme__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./createStylingFromTheme */ "./node_modules/react-json-tree/lib/esm/createStylingFromTheme.js");
-/* harmony import */ var react_base16_styling__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! react-base16-styling */ "./node_modules/react-base16-styling/lib/esm/index.js");
-
-
-
-
-
-
-
-
-
-var _excluded = ["data", "keyPath", "postprocessValue", "hideRoot", "theme", "invertTheme"];
-
-function _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = (0,_babel_runtime_helpers_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__["default"])(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return (0,_babel_runtime_helpers_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__["default"])(this, result); }; }
-
-function _isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function () {})); return true; } catch (e) { return false; } }
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-
-// ES6 + inline style port of JSONViewer https://bitbucket.org/davevedder/react-json-viewer/
-// all credits and original code to the author
-// Dave Vedder <veddermatic@gmail.com> http://www.eskimospy.com/
-// port by Daniele Zannotti http://www.github.com/dzannotti <dzannotti@me.com>
-
-
-
-
-
-
-var identity = function identity(value) {
- return value;
};
-
-var expandRootNode = function expandRootNode(keyPath, data, level) {
- return level === 0;
+elesfn$a.paddedHeight = function () {
+ var ele = this[0];
+ return ele.height() + 2 * ele.padding();
+};
+elesfn$a.paddedWidth = function () {
+ var ele = this[0];
+ return ele.width() + 2 * ele.padding();
};
+var widthHeight = elesfn$a;
-var defaultItemString = function defaultItemString(type, data, itemType, itemString) {
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", null, itemType, " ", itemString);
+var ifEdge = function ifEdge(ele, getValue) {
+ if (ele.isEdge()) {
+ return getValue(ele);
+ }
+};
+var ifEdgeRenderedPosition = function ifEdgeRenderedPosition(ele, getPoint) {
+ if (ele.isEdge()) {
+ var cy = ele.cy();
+ return modelToRenderedPosition(getPoint(ele), cy.zoom(), cy.pan());
+ }
+};
+var ifEdgeRenderedPositions = function ifEdgeRenderedPositions(ele, getPoints) {
+ if (ele.isEdge()) {
+ var cy = ele.cy();
+ var pan = cy.pan();
+ var zoom = cy.zoom();
+ return getPoints(ele).map(function (p) {
+ return modelToRenderedPosition(p, zoom, pan);
+ });
+ }
+};
+var controlPoints = function controlPoints(ele) {
+ return ele.renderer().getControlPoints(ele);
+};
+var segmentPoints = function segmentPoints(ele) {
+ return ele.renderer().getSegmentPoints(ele);
+};
+var sourceEndpoint = function sourceEndpoint(ele) {
+ return ele.renderer().getSourceEndpoint(ele);
+};
+var targetEndpoint = function targetEndpoint(ele) {
+ return ele.renderer().getTargetEndpoint(ele);
+};
+var midpoint = function midpoint(ele) {
+ return ele.renderer().getEdgeMidpoint(ele);
+};
+var pts = {
+ controlPoints: {
+ get: controlPoints,
+ mult: true
+ },
+ segmentPoints: {
+ get: segmentPoints,
+ mult: true
+ },
+ sourceEndpoint: {
+ get: sourceEndpoint
+ },
+ targetEndpoint: {
+ get: targetEndpoint
+ },
+ midpoint: {
+ get: midpoint
+ }
};
+var renderedName = function renderedName(name) {
+ return 'rendered' + name[0].toUpperCase() + name.substr(1);
+};
+var edgePoints = Object.keys(pts).reduce(function (obj, name) {
+ var spec = pts[name];
+ var rName = renderedName(name);
+ obj[name] = function () {
+ return ifEdge(this, spec.get);
+ };
+ if (spec.mult) {
+ obj[rName] = function () {
+ return ifEdgeRenderedPositions(this, spec.get);
+ };
+ } else {
+ obj[rName] = function () {
+ return ifEdgeRenderedPosition(this, spec.get);
+ };
+ }
+ return obj;
+}, {});
-var defaultLabelRenderer = function defaultLabelRenderer(_ref) {
- var _ref2 = (0,_babel_runtime_helpers_slicedToArray__WEBPACK_IMPORTED_MODULE_8__["default"])(_ref, 1),
- label = _ref2[0];
+var dimensions = extend({}, position, bounds, widthHeight, edgePoints);
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("span", null, label, ":");
-};
+/*!
+Event object based on jQuery events, MIT license
-var noCustomNode = function noCustomNode() {
- return false;
+https://jquery.org/license/
+https://tldrlegal.com/license/mit-license
+https://github.com/jquery/jquery/blob/master/src/event.js
+*/
+
+var Event = function Event(src, props) {
+ this.recycle(src, props);
};
+function returnFalse() {
+ return false;
+}
+function returnTrue() {
+ return true;
+}
-function checkLegacyTheming(theme, props) {
- var deprecatedStylingMethodsMap = {
- getArrowStyle: 'arrow',
- getListStyle: 'nestedNodeChildren',
- getItemStringStyle: 'nestedNodeItemString',
- getLabelStyle: 'label',
- getValueStyle: 'valueText'
- };
- var deprecatedStylingMethods = Object.keys(deprecatedStylingMethodsMap).filter(function (name) {
- return props[name];
- });
+// http://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html
+Event.prototype = {
+ instanceString: function instanceString() {
+ return 'event';
+ },
+ recycle: function recycle(src, props) {
+ this.isImmediatePropagationStopped = this.isPropagationStopped = this.isDefaultPrevented = returnFalse;
+ if (src != null && src.preventDefault) {
+ // Browser Event object
+ this.type = src.type;
- if (deprecatedStylingMethods.length > 0) {
- if (typeof theme === 'string') {
- theme = {
- extend: theme
+ // Events bubbling up the document may have been marked as prevented
+ // by a handler lower down the tree; reflect the correct value.
+ this.isDefaultPrevented = src.defaultPrevented ? returnTrue : returnFalse;
+ } else if (src != null && src.type) {
+ // Plain object containing all event details
+ props = src;
+ } else {
+ // Event string
+ this.type = src;
+ }
+
+ // Put explicitly provided properties onto the event object
+ if (props != null) {
+ // more efficient to manually copy fields we use
+ this.originalEvent = props.originalEvent;
+ this.type = props.type != null ? props.type : this.type;
+ this.cy = props.cy;
+ this.target = props.target;
+ this.position = props.position;
+ this.renderedPosition = props.renderedPosition;
+ this.namespace = props.namespace;
+ this.layout = props.layout;
+ }
+ if (this.cy != null && this.position != null && this.renderedPosition == null) {
+ // create a rendered position based on the passed position
+ var pos = this.position;
+ var zoom = this.cy.zoom();
+ var pan = this.cy.pan();
+ this.renderedPosition = {
+ x: pos.x * zoom + pan.x,
+ y: pos.y * zoom + pan.y
};
- } else {
- theme = _objectSpread({}, theme);
}
- deprecatedStylingMethods.forEach(function (name) {
- // eslint-disable-next-line no-console
- console.error("Styling method \"".concat(name, "\" is deprecated, use \"theme\" property instead"));
-
- theme[deprecatedStylingMethodsMap[name]] = function (_ref3) {
- var style = _ref3.style;
-
- for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
- args[_key - 1] = arguments[_key];
- }
+ // Create a timestamp if incoming event doesn't have one
+ this.timeStamp = src && src.timeStamp || Date.now();
+ },
+ preventDefault: function preventDefault() {
+ this.isDefaultPrevented = returnTrue;
+ var e = this.originalEvent;
+ if (!e) {
+ return;
+ }
- return {
- style: _objectSpread(_objectSpread({}, style), props[name].apply(props, args))
- };
- };
- });
- }
+ // if preventDefault exists run it on the original event
+ if (e.preventDefault) {
+ e.preventDefault();
+ }
+ },
+ stopPropagation: function stopPropagation() {
+ this.isPropagationStopped = returnTrue;
+ var e = this.originalEvent;
+ if (!e) {
+ return;
+ }
- return theme;
-}
+ // if stopPropagation exists run it on the original event
+ if (e.stopPropagation) {
+ e.stopPropagation();
+ }
+ },
+ stopImmediatePropagation: function stopImmediatePropagation() {
+ this.isImmediatePropagationStopped = returnTrue;
+ this.stopPropagation();
+ },
+ isDefaultPrevented: returnFalse,
+ isPropagationStopped: returnFalse,
+ isImmediatePropagationStopped: returnFalse
+};
-function getStateFromProps(props) {
- var theme = checkLegacyTheming(props.theme, props);
+var eventRegex = /^([^.]+)(\.(?:[^.]+))?$/; // regex for matching event strings (e.g. "click.namespace")
+var universalNamespace = '.*'; // matches as if no namespace specified and prevents users from unbinding accidentally
- if (props.invertTheme) {
- theme = (0,react_base16_styling__WEBPACK_IMPORTED_MODULE_11__.invertTheme)(theme);
+var defaults$8 = {
+ qualifierCompare: function qualifierCompare(q1, q2) {
+ return q1 === q2;
+ },
+ eventMatches: function eventMatches( /*context, listener, eventObj*/
+ ) {
+ return true;
+ },
+ addEventFields: function addEventFields( /*context, evt*/
+ ) {},
+ callbackContext: function callbackContext(context /*, listener, eventObj*/) {
+ return context;
+ },
+ beforeEmit: function beforeEmit( /* context, listener, eventObj */
+ ) {},
+ afterEmit: function afterEmit( /* context, listener, eventObj */
+ ) {},
+ bubble: function bubble( /*context*/
+ ) {
+ return false;
+ },
+ parent: function parent( /*context*/
+ ) {
+ return null;
+ },
+ context: null
+};
+var defaultsKeys = Object.keys(defaults$8);
+var emptyOpts = {};
+function Emitter() {
+ var opts = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : emptyOpts;
+ var context = arguments.length > 1 ? arguments[1] : undefined;
+ // micro-optimisation vs Object.assign() -- reduces Element instantiation time
+ for (var i = 0; i < defaultsKeys.length; i++) {
+ var key = defaultsKeys[i];
+ this[key] = opts[key] || defaults$8[key];
}
-
- return {
- styling: (0,_createStylingFromTheme__WEBPACK_IMPORTED_MODULE_12__["default"])(theme)
- };
+ this.context = context || this.context;
+ this.listeners = [];
+ this.emitting = 0;
}
-
-var JSONTree = /*#__PURE__*/function (_React$Component) {
- (0,_babel_runtime_helpers_inherits__WEBPACK_IMPORTED_MODULE_4__["default"])(JSONTree, _React$Component);
-
- var _super = _createSuper(JSONTree);
-
- function JSONTree(props) {
- var _this;
-
- (0,_babel_runtime_helpers_classCallCheck__WEBPACK_IMPORTED_MODULE_2__["default"])(this, JSONTree);
-
- _this = _super.call(this, props);
- _this.state = getStateFromProps(props);
- return _this;
+var p = Emitter.prototype;
+var forEachEvent = function forEachEvent(self, handler, events, qualifier, callback, conf, confOverrides) {
+ if (fn$6(qualifier)) {
+ callback = qualifier;
+ qualifier = null;
}
+ if (confOverrides) {
+ if (conf == null) {
+ conf = confOverrides;
+ } else {
+ conf = extend({}, conf, confOverrides);
+ }
+ }
+ var eventList = array(events) ? events : events.split(/\s+/);
+ for (var i = 0; i < eventList.length; i++) {
+ var evt = eventList[i];
+ if (emptyString(evt)) {
+ continue;
+ }
+ var match = evt.match(eventRegex); // type[.namespace]
- (0,_babel_runtime_helpers_createClass__WEBPACK_IMPORTED_MODULE_3__["default"])(JSONTree, [{
- key: "UNSAFE_componentWillReceiveProps",
- value: function UNSAFE_componentWillReceiveProps(nextProps) {
- var _this2 = this;
+ if (match) {
+ var type = match[1];
+ var namespace = match[2] ? match[2] : null;
+ var ret = handler(self, evt, type, namespace, qualifier, callback, conf);
+ if (ret === false) {
+ break;
+ } // allow exiting early
+ }
+ }
+};
- if (['theme', 'invertTheme'].find(function (k) {
- return nextProps[k] !== _this2.props[k];
- })) {
- this.setState(getStateFromProps(nextProps));
- }
+var makeEventObj = function makeEventObj(self, obj) {
+ self.addEventFields(self.context, obj);
+ return new Event(obj.type, obj);
+};
+var forEachEventObj = function forEachEventObj(self, handler, events) {
+ if (event(events)) {
+ handler(self, events);
+ return;
+ } else if (plainObject(events)) {
+ handler(self, makeEventObj(self, events));
+ return;
+ }
+ var eventList = array(events) ? events : events.split(/\s+/);
+ for (var i = 0; i < eventList.length; i++) {
+ var evt = eventList[i];
+ if (emptyString(evt)) {
+ continue;
}
- }, {
- key: "shouldComponentUpdate",
- value: function shouldComponentUpdate(nextProps) {
- var _this3 = this;
+ var match = evt.match(eventRegex); // type[.namespace]
- return !!Object.keys(nextProps).find(function (k) {
- return k === 'keyPath' ? nextProps[k].join('/') !== _this3.props[k].join('/') : nextProps[k] !== _this3.props[k];
+ if (match) {
+ var type = match[1];
+ var namespace = match[2] ? match[2] : null;
+ var eventObj = makeEventObj(self, {
+ type: type,
+ namespace: namespace,
+ target: self.context
});
+ handler(self, eventObj);
}
- }, {
- key: "render",
- value: function render() {
- var _this$props = this.props,
- value = _this$props.data,
- keyPath = _this$props.keyPath,
- postprocessValue = _this$props.postprocessValue,
- hideRoot = _this$props.hideRoot,
- theme = _this$props.theme,
- _ = _this$props.invertTheme,
- rest = (0,_babel_runtime_helpers_objectWithoutProperties__WEBPACK_IMPORTED_MODULE_1__["default"])(_this$props, _excluded);
-
- var styling = this.state.styling;
- return /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement("ul", styling('tree'), /*#__PURE__*/react__WEBPACK_IMPORTED_MODULE_9___default().createElement(_JSONNode__WEBPACK_IMPORTED_MODULE_13__["default"], (0,_babel_runtime_helpers_extends__WEBPACK_IMPORTED_MODULE_0__["default"])({}, _objectSpread({
- postprocessValue: postprocessValue,
- hideRoot: hideRoot,
- styling: styling
- }, rest), {
- keyPath: hideRoot ? [] : keyPath,
- value: postprocessValue(value)
- })));
+ }
+};
+p.on = p.addListener = function (events, qualifier, callback, conf, confOverrides) {
+ forEachEvent(this, function (self, event, type, namespace, qualifier, callback, conf) {
+ if (fn$6(callback)) {
+ self.listeners.push({
+ event: event,
+ // full event string
+ callback: callback,
+ // callback to run
+ type: type,
+ // the event type (e.g. 'click')
+ namespace: namespace,
+ // the event namespace (e.g. ".foo")
+ qualifier: qualifier,
+ // a restriction on whether to match this emitter
+ conf: conf // additional configuration
+ });
}
- }]);
-
- return JSONTree;
-}((react__WEBPACK_IMPORTED_MODULE_9___default().Component));
-
-(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(JSONTree, "propTypes", {
- data: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().any),
- hideRoot: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
- theme: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().object), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().string)]),
- invertTheme: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool),
- keyPath: prop_types__WEBPACK_IMPORTED_MODULE_10___default().arrayOf(prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().string), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().number)])),
- postprocessValue: (prop_types__WEBPACK_IMPORTED_MODULE_10___default().func),
- sortObjectKeys: prop_types__WEBPACK_IMPORTED_MODULE_10___default().oneOfType([(prop_types__WEBPACK_IMPORTED_MODULE_10___default().func), (prop_types__WEBPACK_IMPORTED_MODULE_10___default().bool)])
-});
-
-(0,_babel_runtime_helpers_defineProperty__WEBPACK_IMPORTED_MODULE_7__["default"])(JSONTree, "defaultProps", {
- shouldExpandNode: expandRootNode,
- hideRoot: false,
- keyPath: ['root'],
- getItemString: defaultItemString,
- labelRenderer: defaultLabelRenderer,
- valueRenderer: identity,
- postprocessValue: identity,
- isCustomNode: noCustomNode,
- collectionLimit: 50,
- invertTheme: true
-});
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/objType.js":
-/*!*********************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/objType.js ***!
- \*********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ "default": function() { return /* binding */ objType; }
-/* harmony export */ });
-function objType(obj) {
- var type = Object.prototype.toString.call(obj).slice(8, -1);
-
- if (type === 'Object' && typeof obj[Symbol.iterator] === 'function') {
- return 'Iterable';
+ }, events, qualifier, callback, conf, confOverrides);
+ return this;
+};
+p.one = function (events, qualifier, callback, conf) {
+ return this.on(events, qualifier, callback, conf, {
+ one: true
+ });
+};
+p.removeListener = p.off = function (events, qualifier, callback, conf) {
+ var _this = this;
+ if (this.emitting !== 0) {
+ this.listeners = copyArray$1(this.listeners);
}
-
- if (type === 'Custom' && obj.constructor !== Object && obj instanceof Object) {
- // For projects implementing objects overriding `.prototype[Symbol.toStringTag]`
- return 'Object';
+ var listeners = this.listeners;
+ var _loop = function _loop(i) {
+ var listener = listeners[i];
+ forEachEvent(_this, function (self, event, type, namespace, qualifier, callback /*, conf*/) {
+ if ((listener.type === type || events === '*') && (!namespace && listener.namespace !== '.*' || listener.namespace === namespace) && (!qualifier || self.qualifierCompare(listener.qualifier, qualifier)) && (!callback || listener.callback === callback)) {
+ listeners.splice(i, 1);
+ return false;
+ }
+ }, events, qualifier, callback, conf);
+ };
+ for (var i = listeners.length - 1; i >= 0; i--) {
+ _loop(i);
}
+ return this;
+};
+p.removeAllListeners = function () {
+ return this.removeListener('*');
+};
+p.emit = p.trigger = function (events, extraParams, manualCallback) {
+ var listeners = this.listeners;
+ var numListenersBeforeEmit = listeners.length;
+ this.emitting++;
+ if (!array(extraParams)) {
+ extraParams = [extraParams];
+ }
+ forEachEventObj(this, function (self, eventObj) {
+ if (manualCallback != null) {
+ listeners = [{
+ event: eventObj.event,
+ type: eventObj.type,
+ namespace: eventObj.namespace,
+ callback: manualCallback
+ }];
+ numListenersBeforeEmit = listeners.length;
+ }
+ var _loop2 = function _loop2(i) {
+ var listener = listeners[i];
+ if (listener.type === eventObj.type && (!listener.namespace || listener.namespace === eventObj.namespace || listener.namespace === universalNamespace) && self.eventMatches(self.context, listener, eventObj)) {
+ var args = [eventObj];
+ if (extraParams != null) {
+ push(args, extraParams);
+ }
+ self.beforeEmit(self.context, listener, eventObj);
+ if (listener.conf && listener.conf.one) {
+ self.listeners = self.listeners.filter(function (l) {
+ return l !== listener;
+ });
+ }
+ var context = self.callbackContext(self.context, listener, eventObj);
+ var ret = listener.callback.apply(context, args);
+ self.afterEmit(self.context, listener, eventObj);
+ if (ret === false) {
+ eventObj.stopPropagation();
+ eventObj.preventDefault();
+ }
+ } // if listener matches
+ };
+ for (var i = 0; i < numListenersBeforeEmit; i++) {
+ _loop2(i);
+ } // for listener
- return type;
-}
-
-/***/ }),
-
-/***/ "./node_modules/react-json-tree/lib/esm/themes/solarized.js":
-/*!******************************************************************!*\
- !*** ./node_modules/react-json-tree/lib/esm/themes/solarized.js ***!
- \******************************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony default export */ __webpack_exports__["default"] = ({
- scheme: 'solarized',
- author: 'ethan schoonover (http://ethanschoonover.com/solarized)',
- base00: '#002b36',
- base01: '#073642',
- base02: '#586e75',
- base03: '#657b83',
- base04: '#839496',
- base05: '#93a1a1',
- base06: '#eee8d5',
- base07: '#fdf6e3',
- base08: '#dc322f',
- base09: '#cb4b16',
- base0A: '#b58900',
- base0B: '#859900',
- base0C: '#2aa198',
- base0D: '#268bd2',
- base0E: '#6c71c4',
- base0F: '#d33682'
-});
-
-/***/ }),
-
-/***/ "./node_modules/redux-actions/es/createAction.js":
-/*!*******************************************************!*\
- !*** ./node_modules/redux-actions/es/createAction.js ***!
- \*******************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */ "default": function() { return /* binding */ createAction; }
-/* harmony export */ });
-/* harmony import */ var invariant__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! invariant */ "./node_modules/invariant/browser.js");
-/* harmony import */ var invariant__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(invariant__WEBPACK_IMPORTED_MODULE_0__);
-/* harmony import */ var _utils_isFunction__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./utils/isFunction */ "./node_modules/redux-actions/es/utils/isFunction.js");
-/* harmony import */ var _utils_identity__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./utils/identity */ "./node_modules/redux-actions/es/utils/identity.js");
-/* harmony import */ var _utils_isNull__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./utils/isNull */ "./node_modules/redux-actions/es/utils/isNull.js");
-
-
+ if (self.bubble(self.context) && !eventObj.isPropagationStopped()) {
+ self.parent(self.context).emit(eventObj, extraParams);
+ }
+ }, events);
+ this.emitting--;
+ return this;
+};
+var emitterOptions$1 = {
+ qualifierCompare: function qualifierCompare(selector1, selector2) {
+ if (selector1 == null || selector2 == null) {
+ return selector1 == null && selector2 == null;
+ } else {
+ return selector1.sameText(selector2);
+ }
+ },
+ eventMatches: function eventMatches(ele, listener, eventObj) {
+ var selector = listener.qualifier;
+ if (selector != null) {
+ return ele !== eventObj.target && element(eventObj.target) && selector.matches(eventObj.target);
+ }
+ return true;
+ },
+ addEventFields: function addEventFields(ele, evt) {
+ evt.cy = ele.cy();
+ evt.target = ele;
+ },
+ callbackContext: function callbackContext(ele, listener, eventObj) {
+ return listener.qualifier != null ? eventObj.target : ele;
+ },
+ beforeEmit: function beforeEmit(context, listener /*, eventObj*/) {
+ if (listener.conf && listener.conf.once) {
+ listener.conf.onceCollection.removeListener(listener.event, listener.qualifier, listener.callback);
+ }
+ },
+ bubble: function bubble() {
+ return true;
+ },
+ parent: function parent(ele) {
+ return ele.isChild() ? ele.parent() : ele.cy();
+ }
+};
+var argSelector$1 = function argSelector(arg) {
+ if (string(arg)) {
+ return new Selector(arg);
+ } else {
+ return arg;
+ }
+};
+var elesfn$9 = {
+ createEmitter: function createEmitter() {
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ var _p = ele._private;
+ if (!_p.emitter) {
+ _p.emitter = new Emitter(emitterOptions$1, ele);
+ }
+ }
+ return this;
+ },
+ emitter: function emitter() {
+ return this._private.emitter;
+ },
+ on: function on(events, selector, callback) {
+ var argSel = argSelector$1(selector);
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().on(events, argSel, callback);
+ }
+ return this;
+ },
+ removeListener: function removeListener(events, selector, callback) {
+ var argSel = argSelector$1(selector);
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().removeListener(events, argSel, callback);
+ }
+ return this;
+ },
+ removeAllListeners: function removeAllListeners() {
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().removeAllListeners();
+ }
+ return this;
+ },
+ one: function one(events, selector, callback) {
+ var argSel = argSelector$1(selector);
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().one(events, argSel, callback);
+ }
+ return this;
+ },
+ once: function once(events, selector, callback) {
+ var argSel = argSelector$1(selector);
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().on(events, argSel, callback, {
+ once: true,
+ onceCollection: this
+ });
+ }
+ },
+ emit: function emit(events, extraParams) {
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ ele.emitter().emit(events, extraParams);
+ }
+ return this;
+ },
+ emitAndNotify: function emitAndNotify(event, extraParams) {
+ // for internal use only
+ if (this.length === 0) {
+ return;
+ } // empty collections don't need to notify anything
-function createAction(type, payloadCreator, metaCreator) {
- if (payloadCreator === void 0) {
- payloadCreator = _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"];
+ // notify renderer
+ this.cy().notify(event, this);
+ this.emit(event, extraParams);
+ return this;
}
+};
+define.eventAliasesOn(elesfn$9);
- invariant__WEBPACK_IMPORTED_MODULE_0___default()((0,_utils_isFunction__WEBPACK_IMPORTED_MODULE_2__["default"])(payloadCreator) || (0,_utils_isNull__WEBPACK_IMPORTED_MODULE_3__["default"])(payloadCreator), 'Expected payloadCreator to be a function, undefined or null');
- var finalPayloadCreator = (0,_utils_isNull__WEBPACK_IMPORTED_MODULE_3__["default"])(payloadCreator) || payloadCreator === _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"] ? _utils_identity__WEBPACK_IMPORTED_MODULE_1__["default"] : function (head) {
- for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
- args[_key - 1] = arguments[_key];
+var elesfn$8 = {
+ nodes: function nodes(selector) {
+ return this.filter(function (ele) {
+ return ele.isNode();
+ }).filter(selector);
+ },
+ edges: function edges(selector) {
+ return this.filter(function (ele) {
+ return ele.isEdge();
+ }).filter(selector);
+ },
+ // internal helper to get nodes and edges as separate collections with single iteration over elements
+ byGroup: function byGroup() {
+ var nodes = this.spawn();
+ var edges = this.spawn();
+ for (var i = 0; i < this.length; i++) {
+ var ele = this[i];
+ if (ele.isNode()) {
+ nodes.push(ele);
+ } else {
+ edges.push(ele);
+ }
}
-
- return head instanceof Error ? head : payloadCreator.apply(void 0, [head].concat(args));
- };
- var hasMeta = (0,_utils_isFunction__WEBPACK_IMPORTED_MODULE_2__["default"])(metaCreator);
- var typeString = type.toString();
-
- var actionCreator = function actionCreator() {
- var payload = finalPayloadCreator.apply(void 0, arguments);
- var action = {
- type: type
+ return {
+ nodes: nodes,
+ edges: edges
};
-
- if (payload instanceof Error) {
- action.error = true;
+ },
+ filter: function filter(_filter, thisArg) {
+ if (_filter === undefined) {
+ // check this first b/c it's the most common/performant case
+ return this;
+ } else if (string(_filter) || elementOrCollection(_filter)) {
+ return new Selector(_filter).filter(this);
+ } else if (fn$6(_filter)) {
+ var filterEles = this.spawn();
+ var eles = this;
+ for (var i = 0; i < eles.length; i++) {
+ var ele = eles[i];
+ var include = thisArg ? _filter.apply(thisArg, [ele, i, eles]) : _filter(ele, i, eles);
+ if (include) {
+ filterEles.push(ele);
+ }
+ }
+ return filterEles;
}
+ return this.spawn(); // if not handled by above, give 'em an empty collection
+ },
- if (payload !== undefined) {
- action.payload = payload;
+ not: function not(toRemove) {
+ if (!toRemove) {
+ return this;
+ } else {
+ if (string(toRemove)) {
+ toRemove = this.filter(toRemove);
+ }
+ var elements = this.spawn();
+ for (var i = 0; i < this.length; i++) {
+ var element = this[i];
+ var remove = toRemove.has(element);
+ if (!remove) {
+ elements.push(element);
+ }
+ }
+ return elements;
}
-
- if (hasMeta) {
- action.meta = metaCreator.apply(void 0, arguments);
+ },
+ absoluteComplement: function absoluteComplement() {
+ var cy = this.cy();
+ return cy.mutableElements().not(this);
+ },
+ intersect: function intersect(other) {
+ // if a selector is specified, then filter by it instead
+ if (string(other)) {
+ var selector = other;
+ return this.filter(selector);
}
+ var elements = this.spawn();
+ var col1 = this;
+ var col2 = other;
+ var col1Smaller = this.length < other.length;
+ var colS = col1Smaller ? col1 : col2;
+ var colL = col1Smaller ? col2 : col1;
+ for (var i = 0; i < colS.length; i++) {
+ var ele = colS[i];
+ if (colL.has(ele)) {
+ elements.push(ele);
+ }
+ }
+ return elements;
+ },
+ xor: function xor(other) {
+ var cy = this._private.cy;
+ if (string(other)) {
+ other = cy.$(other);
+ }
+ var elements = this.spawn();
+ var col1 = this;
+ var col2 = other;
+ var add = function add(col, other) {
+ for (var i = 0; i < col.length; i++) {
+ var ele = col[i];
+ var id = ele._private.data.id;
+ var inOther = other.hasElementWithId(id);
+ if (!inOther) {
+ elements.push(ele);
+ }
+ }
+ };
+ add(col1, col2);
+ add(col2, col1);
+ return elements;
+ },
+ diff: function diff(other) {
+ var cy = this._private.cy;
+ if (string(other)) {
+ other = cy.$(other);
+ }
+ var left = this.spawn();
+ var right = this.spawn();
+ var both = this.spawn();
+ var col1 = this;
+ var col2 = other;
+ var add = function add(col, other, retEles) {
+ for (var i = 0; i < col.length; i++) {
+ var ele = col[i];
+ var id = ele._private.data.id;
+ var inOther = other.hasElementWithId(id);
+ if (inOther) {
+ both.merge(ele);
+ } else {
+ retEles.push(ele);
+ }
+ }
+ };
+ add(col1, col2, left);
+ add(col2, col1, right);
+ return {
+ left: left,
+ right: right,
+ both: both
+ };
+ },
+ add: function add(toAdd) {
+ var cy = this._private.cy;
+ if (!toAdd) {
+ return this;
+ }
+ if (string(toAdd)) {
+ var selector = toAdd;
+ toAdd = cy.mutableElements().filter(selector);
+ }
+ var elements = this.spawnSelf();
+ for (var i = 0; i < toAdd.length; i++) {
+ var ele = toAdd[i];
+ var add = !this.has(ele);
+ if (add) {
+ elements.push(ele);
+ }
+ }
+ return elements;
+ },
+ // in place merge on calling collection
+ merge: function merge(toAdd) {
+ var _p = this._private;
+ var cy = _p.cy;
+ if (!toAdd) {
+ return this;
+ }
+ if (toAdd && string(toAdd)) {
+ var selector = toAdd;
+ toAdd = cy.mutableElements().filter(selector);
+ }
+ var map = _p.map;
+ for (var i = 0; i < toAdd.length; i++) {
+ var toAddEle = toAdd[i];
+ var id = toAddEle._private.data.id;
+ var add = !map.has(id);
+ if (add) {
+ var index = this.length++;
+ this[index] = toAddEle;
+ map.set(id, {
+ ele: toAddEle,
+ index: index
+ });
+ }
+ }
+ return this; // chaining
+ },
- return action;
- };
-
- actionCreator.toString = function () {
- return typeString;
- };
-
- return actionCreator;
-}
-
-/***/ }),
-
-/***/ "./node_modules/redux-actions/es/utils/identity.js":
-/*!*********************************************************!*\
- !*** ./node_modules/redux-actions/es/utils/identity.js ***!
- \*********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony default export */ __webpack_exports__["default"] = (function (value) {
- return value;
-});
-
-/***/ }),
-
-/***/ "./node_modules/redux-actions/es/utils/isFunction.js":
-/*!***********************************************************!*\
- !*** ./node_modules/redux-actions/es/utils/isFunction.js ***!
- \***********************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony default export */ __webpack_exports__["default"] = (function (value) {
- return typeof value === 'function';
-});
-
-/***/ }),
-
-/***/ "./node_modules/redux-actions/es/utils/isNull.js":
-/*!*******************************************************!*\
- !*** ./node_modules/redux-actions/es/utils/isNull.js ***!
- \*******************************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
-
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/* harmony default export */ __webpack_exports__["default"] = (function (value) {
- return value === null;
-});
+ unmergeAt: function unmergeAt(i) {
+ var ele = this[i];
+ var id = ele.id();
+ var _p = this._private;
+ var map = _p.map;
-/***/ }),
+ // remove ele
+ this[i] = undefined;
+ map["delete"](id);
+ var unmergedLastEle = i === this.length - 1;
-/***/ "./node_modules/redux-thunk/es/index.js":
-/*!**********************************************!*\
- !*** ./node_modules/redux-thunk/es/index.js ***!
- \**********************************************/
-/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {
+ // replace empty spot with last ele in collection
+ if (this.length > 1 && !unmergedLastEle) {
+ var lastEleI = this.length - 1;
+ var lastEle = this[lastEleI];
+ var lastEleId = lastEle._private.data.id;
+ this[lastEleI] = undefined;
+ this[i] = lastEle;
+ map.set(lastEleId, {
+ ele: lastEle,
+ index: i
+ });
+ }
-"use strict";
-__webpack_require__.r(__webpack_exports__);
-/** A function that accepts a potential "extra argument" value to be injected later,
- * and returns an instance of the thunk middleware that uses that value