diff --git a/CITATION.cff b/CITATION.cff new file mode 100644 index 0000000..dd318d9 --- /dev/null +++ b/CITATION.cff @@ -0,0 +1,22 @@ +cff-version: 1.2.0 +license: Apache-2.0 +message: If you use this software, please cite it using these metadata. +authors: + - name: TNO Quantum + city: The Hague + country: NL + email: tnoquantum@tno.nl + website: https://tno.nl +type: software +url: https://tno.nl +contact: + - name: TNO Quantum + city: The Hague + country: NL + email: tnoquantum@tno.nl + website: https://tno.nl +repository-code: https://github.com/TNO-Quantum/problems.portfolio_optimization +repository-artifact: https://pypi.org/project/tno.quantum.problems.portfolio_optimization +title: TNO Quantum - Problems - Portfolio Optimization +version: v1.0.0 +date-released: 2024-05-01 \ No newline at end of file diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..999d7a7 --- /dev/null +++ b/LICENSE @@ -0,0 +1,201 @@ + 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. + + 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. + + 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. + + 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. + + 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. + + 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. + + END OF TERMS AND CONDITIONS + + 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 2024 The Netherlands Organisation for Applied Scientific Research (TNO) + + 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 + + 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. diff --git a/README.md b/README.md index 8ab6f9c..4425d13 100644 --- a/README.md +++ b/README.md @@ -1,11 +1,3 @@ -# Coming soon! - -This repository will be released in the near future. - -For more details you can contact the developers of this repository at tnoquantum@tno.nl. - -Dataset can already be found in the `tno/quantum/problems/portfolio_optimization/datasets/` folder. - # Portfolio optimization Real-world investment decisions involve multiple, often conflicting, objectives that needs to be balanced. @@ -13,14 +5,13 @@ Primary goals typically revolve around maximizing returns while minimizing risks At the same time, one might want to require additional constraints such as demanding a minimum carbon footprint reduction. Finding a portfolio that balances these objectives is a challenging task and can be solved using multi-objective portfolio optimization. - This repository provides Python code that converts the multi-objective portfolio optimization problem -into a `QUBO`_ problem. The transformed problem can then be solved using quantum annealing techniques. +into a [QUBO](https://en.wikipedia.org/wiki/Quadratic_unconstrained_binary_optimization) problem. The transformed problem can then be solved using quantum annealing techniques. The following objectives can be considered - `return on capital`, indicated by `ROC`, -- `diversification`, indicated by the Herfindahl-Hirschman Index `HHI`. +- `diversification`, indicated by the [Herfindahl-Hirschman Index](https://en.wikipedia.org/wiki/Herfindahl%E2%80%93Hirschman_inde) `HHI`. Additionally, we allow for a capital growth factor and arbitrary emission reduction constraints to be considered. @@ -30,3 +21,155 @@ can be computed for the objectives return on capital and diversification. The codebase is based on the following paper: - [Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2024)](https://www.mdpi.com/2227-7390/12/9/1291) + +**Funding:** This research was funded by Rabobank and Stichting TKI High Tech Systems +and Materials, under a program by Brightland's Techruption. + +*Limitations in (end-)use: the content of this software package may solely be used for applications that comply with international export control laws.* + +## Documentation + +Documentation of the `tno.quantum.problems.portfolio_optimization` package can be found [here](https://tno-quantum.github.io/problems.portfolio_optimization/). + +## Install + +Easily install the `tno.quantum.problems.portfolio_optimization` package using pip: + +```console +$ python -m pip install tno.quantum.problems.portfolio_optimization +``` + +If you wish to use D-Wave quantum hardware: +```console +$ python -m pip install 'tno.quantum.problems.portfolio_optimization[quantum]' +``` + +If you wish to run the tests you can use: +```console +$ python -m pip install 'tno.quantum.problems.portfolio_optimization[tests]' +``` + +## Usage + +
+ Solve portfolio optimization problem. + +Here's an example of how the `PortfolioOptimizer` class can be used to define an portfolio optimization problem, +and subsequently, how the Pareto front can be computed using the simulated annealing sampler from D-Wave. + +```python +import numpy as np +from dwave.samplers import SimulatedAnnealingSampler + +from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + +# Choose sampler for solving qubo +sampler = SimulatedAnnealingSampler() +sampler_kwargs = {"num_reads": 20, "num_sweeps": 200} + +# Set up penalty coefficients for the constraints +lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) +lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) +lambdas3 = np.array([1]) + +# Create portfolio optimization problem +portfolio_optimizer = PortfolioOptimizer("benchmark_dataset") +portfolio_optimizer.add_minimize_hhi(weights=lambdas1) +portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas2) +portfolio_optimizer.add_emission_constraint( + weights=lambdas3, + emission_now="emis_intens_now", + emission_future="emis_intens_future", + name="emission" +) + +# Solve the portfolio optimization problem +results = portfolio_optimizer.run(sampler, sampler_kwargs) +``` +
+ +
+ Visualize results. + +The results can be inspected in more detail by looking at the Pandas results DataFrame +`results.results_df`. + +Alternatively, the results can be plotted in a `(Diversification, ROC)`-graph. The +following example first slices the results in data points that do and do not satisfy the +constraints using the method `slice_results`. + +Note that: + +- Individual data points can subsequently be plotted using the `plot_points` function. +- The Pareto front can be plotted using the `plot_front` function. + +```python +import matplotlib.pyplot as plt + +from tno.quantum.problems.portfolio_optimization import plot_front, plot_points + +(x1, y1), (x2, y2) = results.slice_results() +fig, (ax1, ax2) = plt.subplots(ncols=2, figsize=(12, 5)) + +# Plot data points +plot_points(x2, y2, color="orange", label="QUBO constraint not met", ax=ax1) +plot_points(x1, y1, color="green", label="QUBO constraint met", ax=ax1) +ax1.set_title("Points") + +# Plot Pareto front +plot_front(x2, y2, color="orange", label="QUBO constraint not met", ax=ax2) +plot_front(x1, y1, color="green", label="QUBO constraint met", ax=ax2) +ax2.set_title("Pareto Front") +fig.tight_layout() +plt.show() +``` + +
+ +![(Diversification, ROC)-Graph](./images_for_docs/example.png) + + +More elaborate examples can be found in our [examples repository](https://github.com/TNO-Quantum/examples ). + +Data input +---------- + +The data used for the portfolio optimization can be imported via an excel file, csv file, +json file or as a Pandas DataFrame. +The data needs to contain at least the following columns: + +- `asset`: The name of the asset. +- `outstanding_now`: Current outstanding amount per asset. +- `min_outstanding_future`: Lower bound outstanding amount in the future per asset. +- `max_outstanding_future`: Upper bound outstanding amount in the future per asset. +- `income_now`: Current income per asset, corresponds to return multiplied by the current outstanding amount. +- `regcap_now`: Current regulatory capital per asset. + + +If the input datafile contains all the correct information, but has different column +names, it is possible to rename the columns without altering the input file. +Details and examples can be found in the [documentation]((https://tno-quantum.github.io/problems.portfolio_optimization/)). + +The data that was used for the publication can be found in the `tno/quantum/problems/portfolio_optimization/datasets/` folder. + + +Using Quantum Annealing Solvers +------------------------------- + +By default, the portfolio optimization QUBO is solved using simulated annealing. +Any D-Wave ``Sampler`` is however supported and can be provided to the `PortfolioOptimizer.run` method. + + +Below is an example how to initialise a quantum annealing sampler that uses `100` micro seconds annealing time per sample. +The example assumes a proper [configuration setup](https://docs.ocean.dwavesys.com/en/stable/overview/sapi.html) to the D-Wave's Solver API. + +```python +from dwave.system import DWaveSampler, LazyFixedEmbeddingComposite + +# Define QPU D-Wave Sampler +qpu = DWaveSampler() +sampler = LazyFixedEmbeddingComposite(qpu) +sampler_kwargs = {"annealing_time": 100} +``` + +We refer to the [D-Wave Sampler documentation](https://docs.ocean.dwavesys.com/projects/system/en/stable/reference/samplers.html) for information on usage of different samplers and their sampler arguments. diff --git a/docs/.buildinfo b/docs/.buildinfo new file mode 100644 index 0000000..b619992 --- /dev/null +++ b/docs/.buildinfo @@ -0,0 +1,4 @@ +# Sphinx build info version 1 +# This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done. +config: 218433b376044e18c0aa0ad6ae95cf20 +tags: 645f666f9bcd5a90fca523b33c5a78b7 diff --git a/docs/.doctrees/environment.pickle b/docs/.doctrees/environment.pickle new file mode 100644 index 0000000..0b528a8 Binary files /dev/null and b/docs/.doctrees/environment.pickle differ diff --git a/docs/.doctrees/index.doctree b/docs/.doctrees/index.doctree new file mode 100644 index 0000000..0a7ff01 Binary files /dev/null and b/docs/.doctrees/index.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.doctree b/docs/.doctrees/portfolio_optimization.components.doctree new file mode 100644 index 0000000..9d631b2 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.io.doctree b/docs/.doctrees/portfolio_optimization.components.io.doctree new file mode 100644 index 0000000..563d577 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.io.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.postprocess.doctree b/docs/.doctrees/portfolio_optimization.components.postprocess.doctree new file mode 100644 index 0000000..5799885 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.postprocess.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.qubos.doctree b/docs/.doctrees/portfolio_optimization.components.qubos.doctree new file mode 100644 index 0000000..6981926 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.qubos.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.results.doctree b/docs/.doctrees/portfolio_optimization.components.results.doctree new file mode 100644 index 0000000..0a9fae6 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.results.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.components.visualization.doctree b/docs/.doctrees/portfolio_optimization.components.visualization.doctree new file mode 100644 index 0000000..840db55 Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.components.visualization.doctree differ diff --git a/docs/.doctrees/portfolio_optimization.doctree b/docs/.doctrees/portfolio_optimization.doctree new file mode 100644 index 0000000..cb1fdbe Binary files /dev/null and b/docs/.doctrees/portfolio_optimization.doctree differ diff --git a/docs/.nojekyll b/docs/.nojekyll new file mode 100644 index 0000000..e69de29 diff --git a/docs/_modules/index.html b/docs/_modules/index.html new file mode 100644 index 0000000..b753535 --- /dev/null +++ b/docs/_modules/index.html @@ -0,0 +1,125 @@ + + + + + + Overview: module code — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ + +
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/io.html b/docs/_modules/portfolio_optimization/components/io.html new file mode 100644 index 0000000..9197593 --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/io.html @@ -0,0 +1,371 @@ + + + + + + portfolio_optimization.components.io — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.io

+"""This module implements I/O"""
+from __future__ import annotations
+
+from pathlib import Path
+from typing import TypeVar, cast
+
+import numpy as np
+import pandas as pd
+from numpy.typing import NDArray
+from pandas import DataFrame
+
+DEFAULT_REQUIRED_COLUMN_NAMES = [
+    "asset",
+    "outstanding_now",
+    "min_outstanding_future",
+    "max_outstanding_future",
+    "income_now",
+    "regcap_now",
+]
+
+PortfolioDataT = TypeVar("PortfolioDataT", bound="PortfolioData")
+
+
+
[docs]class PortfolioData: + """The ``PortfolioData`` stores the data used for portfolio optimization.""" + +
[docs] def __init__( + self, + portfolio_dataframe: DataFrame, + columns_rename: dict[str, str] | None = None, + ): + """Creates a ``PortfolioData`` object from a pandas ``DataFrame``. + + The portfolio data is expected to contain at least the following columns names: + + - ``"assets"``: The name of the asset. + - ``"outstanding_now_now"``: Current outstanding amount per asset. + - ``"min_outstanding_future"``: Lower bound outstanding amount in the future per asset. + - ``"max_outstanding_future"``: Upper bound outstanding amount in the future per asset. + - ``"income_now"``: Current income per asset, corresponds to return multiplied by the current outstanding amount. + - ``"regcap_now"``: Current regulatory capital per asset. + + Different column names in the dataset can be used but need to be provided as a + renaming dictionary to the ``columns_rename`` argument. + + Args: + portfolio_dataframe: Pandas ``DataFrame`` containing the portfolio data. + column_rename: to rename columns provided as dict with new column names as keys + and to replace column name as value. Example + ``{"outstanding_2021": "outstanding_now"}``. + + Raises: + ValueError if required columns are not present in dataset. + """ + if columns_rename is not None: + portfolio_dataframe.rename(columns=columns_rename, inplace=True) + + # Validate dataset to contain required column names + for required_column_name in DEFAULT_REQUIRED_COLUMN_NAMES: + if required_column_name not in portfolio_dataframe.columns: + raise ValueError( + f"Required column name {required_column_name} is not in dataset." + ) + + self.portfolio_df = portfolio_dataframe
+ +
[docs] @classmethod + def from_file( + cls: type[PortfolioDataT], + filename: str | Path, + columns_rename: dict[str, str] | None = None, + ) -> PortfolioDataT: + """Reads portfolio data object into ``PortfolioData``. + + The portfolio data is expected to contain at least the following columns names: + + - ``"assets"``: The name of the asset. + - ``"outstanding_now_now"``: Current outstanding amount per asset. + - ``"min_outstanding_future"``: Lower bound outstanding amount in the future per asset. + - ``"max_outstanding_future"``: Upper bound outstanding amount in the future per asset. + - ``"income_now"``: Current income per asset, corresponds to return multiplied by the current outstanding amount. + - ``"regcap_now"``: Current regulatory capital per asset. + + Different column names in the dataset can be used but need to be provided as a + renaming dictionary to the ``columns_rename`` argument. + + Args: + filename: path to portfolio data. If instead ``benchmark_dataset`` is + provided, a default benchmark dataset containing 52 assets will be used. + column_rename: to rename columns provided as dict with new column names as keys + and to replace column name as value. Example + ``{"outstanding_2021": "outstanding_now"}``. + + Raises: + ValueError if required columns are not present in dataset. + """ + if str(filename) == "benchmark_dataset": + filename = Path(__file__).parents[1] / "datasets" / "benchmark_dataset.xlsx" + + filename = str(filename) + if filename.endswith(".xlsx"): + portfolio_data = pd.read_excel(filename) + elif filename.endswith(".csv"): + portfolio_data = pd.read_csv(filename) + elif filename.endswith(".json"): + portfolio_data = pd.read_json(filename) + else: + raise ValueError("Datatype not supported.") + return cls(portfolio_data, columns_rename)
+ +
[docs] def get_outstanding_now(self) -> NDArray[np.float_]: + """Gets the `outstanding_now` data from the dataset. + + Returns: + The `outstanding_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["outstanding_now"].to_numpy())
+ +
[docs] def get_l_bound(self) -> NDArray[np.float_]: + """Gets the `l_bound` data from the dataset. + + Returns: + The `min_outstanding_future` column from the dataset as a numpy array. + """ + return cast( + NDArray[np.float_], self.portfolio_df["min_outstanding_future"].to_numpy() + )
+ +
[docs] def get_u_bound(self) -> NDArray[np.float_]: + """Gets the `u_bound` data from the dataset. + + Returns: + The `max_outstanding_future` column from the dataset as a numpy array. + """ + return cast( + NDArray[np.float_], self.portfolio_df["max_outstanding_future"].to_numpy() + )
+ +
[docs] def get_income(self) -> NDArray[np.float_]: + """Gets the `income` data from the dataset. + + Returns: + The `income_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["income_now"].to_numpy())
+ +
[docs] def get_capital(self) -> NDArray[np.float_]: + """Gets the `capital` data from the dataset. + + Returns: + The `regcap_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["regcap_now"].to_numpy())
+ +
[docs] def get_returns(self) -> NDArray[np.float_]: + """Gets the `returns` data from the dataset. + + Returns: + Returns is defined as income / outstanding_now + """ + income = self.get_income() + outstanding_now = self.get_outstanding_now() + return cast(NDArray[np.float_], income / outstanding_now)
+ +
[docs] def get_column(self, column_name: str) -> NDArray[np.float_]: + """Gets the specified column from the dataset. + + Args: + column_name: Name of the column to get. + + Returns: + The `regcap_now` columns from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df[column_name].to_numpy())
+ +
[docs] def print_portfolio_info(self) -> None: + """Prints information about portfolio data to terminal.""" + outstanding_now = self.get_outstanding_now() + l_bound = self.get_l_bound() + u_bound = self.get_u_bound() + income = self.get_income() + capital = self.get_capital() + + # Calculate the total outstanding amount in now + total_outstanding_now = np.sum(outstanding_now) + print(f"Total outstanding now: {total_outstanding_now:.2f}") + + # Calculate the ROC for now + roc_now = np.sum(income) / np.sum(capital) + print(f"ROC now: {roc_now:.4f}") + + # Calculate the HHI diversification for now + hhi_now = ( + np.sum(total_outstanding_now**2) / np.sum(total_outstanding_now) ** 2 + ) + print(f"HHI now: {hhi_now:.4f}") + + if "emis_intens_now" in self.portfolio_df: + # Calculate the total emissions for now + total_emission_now = np.sum( + self.get_column("emis_intens_now") * total_outstanding_now + ) + print(f"Total Emission now: {total_emission_now:.2f}") + + # Calculate the average emission intensity now + relative_total_emission = total_emission_now / total_outstanding_now + print(f"Relative emission intensity now: {relative_total_emission:.2f}") + + # Estimate the total outstanding amount and its standard deviation for future. This + # follows from the assumption of a symmetric probability distribution on the + # interval [l_bound, u_bound] and the central limit theorem. + expected_total_outstanding_future = np.sum(u_bound + l_bound) / 2 + expected_stddev_total_outstanding_future = np.linalg.norm( + (u_bound - l_bound) / 2 + ) + print( + f"Expected total outstanding future: {expected_total_outstanding_future:.2f}", + f"Std dev: {expected_stddev_total_outstanding_future:.2f}", + ) + + # Estimate a average growth factor and its standard deviation for now-future. This + # consists of the (averaged) amount per asset in future, which is the outcome of the + # optimization, divided by the amount for now. + expected_average_growth_fac = np.sum( + (u_bound + l_bound) / (2 * total_outstanding_now) + ) + expected_stddev_average_growth_fac = np.linalg.norm( + (u_bound - l_bound) / (2 * total_outstanding_now) + ) + print( + f"Expected average growth factor: {expected_average_growth_fac:.4f}", + f"Std dev: {expected_stddev_average_growth_fac:.4f}", + )
+ +
[docs] def __len__(self) -> int: + """Length of the dataset.""" + return len(self.portfolio_df)
+ +
[docs] def __repr__(self) -> str: + """Representation for debugging.""" + txt = f"{self.__class__.__name__} object containing the following data:\n" + txt += repr(self.portfolio_df) + return txt
+ +
[docs] def __str__(self) -> str: + """String representation of the ``PortfolioData`` object.""" + txt = f"{self.__class__.__name__} object containing the following data:\n" + txt += str(self.portfolio_df) + return txt
+ +
[docs] def __contains__(self, other: object) -> bool: + """Check if ``other`` is part of the dataset.""" + return other in self.portfolio_df
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/postprocess.html b/docs/_modules/portfolio_optimization/components/postprocess.html new file mode 100644 index 0000000..eac7726 --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/postprocess.html @@ -0,0 +1,267 @@ + + + + + + portfolio_optimization.components.postprocess — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.postprocess

+"""This module implements required post processing steps."""
+from __future__ import annotations
+
+from collections.abc import Mapping
+
+import numpy as np
+from dimod import SampleSet
+from numpy.typing import ArrayLike, NDArray
+from scipy.spatial import ConvexHull  # pylint: disable=no-name-in-module
+
+from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData
+
+
+
[docs]class Decoder: + """``Decoder`` class for decoding samples and samplesets.""" + +
[docs] def __init__( + self, + portfolio_data: PortfolioData, + k: int, + ) -> None: + """ + Init for the ``Decoder`` Class. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self.number_of_assets = len(portfolio_data) + self.k = k + self.mantissa = np.power(2, np.arange(self.k)) + self.l_bound = portfolio_data.get_l_bound() + self.u_bound = portfolio_data.get_u_bound() + self.multiplier = (self.u_bound - self.l_bound) / (2**self.k - 1)
+ +
[docs] def decode_sample(self, sample: Mapping[int, int]) -> NDArray[np.float_]: + """Decodes a sample to the `oustanding_future` array. + + Args: + sample: Sample as returned by D-Wave. + + Returns: + Array containing all `outstanding future` values. + """ + sample_array = np.array( + [sample[i] for i in range(self.number_of_assets * self.k)], dtype=np.uint8 + ) + sample_reshaped = sample_array.reshape((self.number_of_assets, self.k)) + ints = np.sum(sample_reshaped * self.mantissa, axis=1) + outstanding_future = self.l_bound + self.multiplier * ints + if (self.l_bound > outstanding_future).any() or ( + self.u_bound < outstanding_future + ).any(): + raise ValueError("Bounds not obeyed.") + + return np.asarray(outstanding_future, dtype=np.float_)
+ +
[docs] def decode_sampleset(self, sampleset: SampleSet) -> NDArray[np.float_]: + """Efficiently decodes a `sampleset` create a matrix of `oustanding_future` + values. + + Each row in the matrix corresponds to a different sample in the `sampleset`. + + Args: + sampleset: ``SampleSet`` as returned by D-Wave. + + Returns: + Matrix containing all `outstanding future` values. + """ + samples_matrix = sampleset.record.sample[:, : self.number_of_assets * self.k] + samples_reshaped = samples_matrix.reshape( + (len(sampleset), self.number_of_assets, self.k) + ) + + ints = np.sum(samples_reshaped * self.mantissa, axis=2) + outstanding_future = self.l_bound + self.multiplier * ints + + if (self.l_bound > outstanding_future).any() or ( + self.u_bound < outstanding_future + ).any(): + raise ValueError("Bounds not obeyed.") + + return np.asarray(outstanding_future, dtype=np.float_)
+ + +
[docs]def pareto_front( + xvals: ArrayLike, + yvals: ArrayLike, + min_points: int = 50, + upper_right_quadrant: bool = True, +) -> tuple[NDArray[np.float_], NDArray[np.float_]]: + """Calculates the pareto front with at least min_points data points by repeatedly + creating a convex hull around data points. + + Args: + xvals: x-values of data points + yvals: y-values of data points + min_points: minimum number of points to be selected + upper_right_quadrant: If ``True``, only show the upper right quadrant of the + pareto front. + + Returns: + x, y values of the points that are on the pareto front + """ + points = np.vstack((xvals, yvals)).T + points = np.unique(points, axis=0) + if len(points) < 3: + return points.T[0], points.T[1] + + hull = ConvexHull(points) + pareto_points = points[hull.vertices] + + # Expand the pareto front so that it contains at least min_points. + for _ in range(min_points): + if len(pareto_points) >= min_points: + break + # Remove current hull vertices from data and create a new hull + points = np.delete(points, hull.vertices, axis=0) + if len(points) < 3: + break + hull = ConvexHull(points) + # Add the new hull vertices to the pareto front + new_points = points[hull.vertices] + pareto_points = np.vstack((pareto_points, new_points)) + if upper_right_quadrant: + pareto_points = _get_upper_quadrant(pareto_points) + + if upper_right_quadrant: + pareto_points = _get_upper_quadrant(pareto_points) + + return pareto_points.T[0], pareto_points.T[1]
+ + +def _get_upper_quadrant(points: NDArray[np.float_]) -> NDArray[np.float_]: + """Removes all values that are not in the upper right quadrant of the pareto front.""" + x_values = points.T[0] + y_values = points.T[1] + + x_bound = x_values[np.argmax(y_values)] + y_bound = y_values[np.argmax(x_values)] + mask = (x_values >= x_bound) & (y_values >= y_bound) + + x_values = x_values[mask] + y_values = y_values[mask] + + return np.vstack((x_values, y_values)).T +
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/qubos/_qubo_compiler.html b/docs/_modules/portfolio_optimization/components/qubos/_qubo_compiler.html new file mode 100644 index 0000000..b2b1b9f --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/qubos/_qubo_compiler.html @@ -0,0 +1,339 @@ + + + + + + portfolio_optimization.components.qubos._qubo_compiler — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.qubos._qubo_compiler

+"""This module contains the ``QuboCompiler`` class.
+
+The ``QuboCompiler`` can create a variety of QUBO formulation by combining different
+objectives and constraints with their corresponding penalty or preference parameters.
+"""
+from __future__ import annotations
+
+from collections.abc import Callable
+from functools import partial
+from typing import TypeVar
+
+import numpy as np
+from numpy.typing import NDArray
+
+from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData
+
+from ._qubo_factory import QuboFactory
+
+QuboCompilerT = TypeVar("QuboCompilerT", bound="QuboCompiler")
+
+
+
[docs]class QuboCompiler: + """QuboCompiler - A compiler class for creating QUBO instances. + + This class provides a convenient interface for combining different QUBO formulations + without needing to worry about the qubo size. + + Methods: + + - `add_minimize_hhi`: Adds the to minimize HHI QUBO to the compile list. + - `add_maximize_roc`: Adds a ROC and optionally a stabilizing QUBO to the compile + list. + - `add_emission_constraint`: Adds an emission constraint QUBO to the compile list. + - `add_growth_factor_constraint`: Adds the growth factor constraint QUBO to the + compile list. + + """ + +
[docs] def __init__(self, portfolio_data: PortfolioData, k: int) -> None: + """Init of the ``QuboCompiler`` class. + + The ``QuboCompiler`` can create a variety of QUBO formulation by combining + different objectives and constraints with penalty or preference parameters. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self._qubo_factory = QuboFactory(portfolio_data, k) + + self._to_compile: list[Callable[[], tuple[NDArray[np.float_], float]]] = [] + self._compiled_qubos: list[NDArray[np.float_]] = []
+ +
[docs] def add_minimize_hhi( + self: QuboCompilerT, + ) -> QuboCompilerT: + r"""Adds the minimize HHI objective to the compile list. + + The HHI objective is given by + + $$HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_minimize_hhi`. + + Returns: + Self. + """ + self._to_compile.append(self._qubo_factory.calc_minimize_hhi) + return self
+ +
[docs] def add_maximize_roc( + self: QuboCompilerT, + formulation: int, + ancilla_variables: int = 0, + ) -> QuboCompilerT: + """Adds the maximize ROC objective and based on the chosen formulation a + stabilize c constraint. + + Args: + formulation: Integer representing which formulation to pick. If formulation + is ``1``, then one QUBO term will be added. If formulation is ``2``, + then 2 QUBO terms will be added as well, but the argument + `ancilla_variables` must be provided. + ancilla_variables: Number of ancilla variables to use for formulation ``2``. + + Returns: + Self. + """ + if formulation == 1: + self._to_compile.append(self._qubo_factory.calc_maximize_roc1) + elif formulation == 2: + self._qubo_factory.n_vars += ancilla_variables + self._to_compile.append(self._qubo_factory.calc_maximize_roc2) + self._to_compile.append(self._qubo_factory.calc_stabilize_c) + + return self
+ +
[docs] def add_emission_constraint( + self: QuboCompilerT, + emission_now: str, + emission_future: str | None = None, + reduction_percentage_target: float = 0.7, + ) -> QuboCompilerT: + r"""Adds the emission constraint to the compile list. + + The constraint is given by + + .. math:: + + \frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} + = + g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_emission_constraint`. + + Args: + emission_now: Name of the column in the portfolio dataset corresponding to + the variables at current time. + emission_future: Name of the column in the portfolio dataset corresponding + to the variables at future time. If no value is provided, it is assumed + that the value is constant over time, i.e., the variable + ``emission_now`` will be used. + reduction_percentage_target: target value for reduction percentage amount. + + Returns: + Self. + """ + method = partial( + self._qubo_factory.calc_emission_constraint, + emission_now=emission_now, + emission_future=emission_future, + reduction_percentage_target=reduction_percentage_target, + ) + self._to_compile.append(method) + return self
+ +
[docs] def add_growth_factor_constraint( + self: QuboCompilerT, growth_target: float + ) -> QuboCompilerT: + # pylint: disable=line-too-long + r"""Adds the capital growth factor constraint to the compile list. + + The constraint is given by + + $$\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_c$` is the target value for the total growth factor. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_growth_factor_constraint`. + + Args: + growth_target: target value for growth factor total outstanding amount. + + Returns: + Self. + """ + # pylint: enable=line-too-long + method = partial( + self._qubo_factory.calc_growth_factor_constraint, + growth_target=growth_target, + ) + self._to_compile.append(method) + return self
+ +
[docs] def compile(self: QuboCompilerT) -> QuboCompilerT: + """Compiles all QUBOs in the compile list. + + Returns: + Self.""" + self._compiled_qubos = [] + for constructor in self._to_compile: + qubo, _ = constructor() + self._compiled_qubos.append(qubo) + return self
+ +
[docs] def make_qubo(self, *lambdas: float) -> tuple[NDArray[np.float_], float]: + """Makes a QUBO of the entire problem with the given lambdas. + + Args: + lambdas: Scaling parameters for each QUBO in the formulation. + + Returns: + Tuple containing the QUBO matrix and offset. + """ + if len(lambdas) != len(self._compiled_qubos): + raise ValueError( + "Number of lambdas does not correspond with the number of Hamiltonians." + ) + qubo = sum( + ( + lambda_i * qubo_i + for lambda_i, qubo_i in zip(lambdas, self._compiled_qubos) + ), + start=np.zeros_like(self._compiled_qubos[0]), + ) + + return qubo, float("nan")
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/qubos/_qubo_factory.html b/docs/_modules/portfolio_optimization/components/qubos/_qubo_factory.html new file mode 100644 index 0000000..ab534d5 --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/qubos/_qubo_factory.html @@ -0,0 +1,531 @@ + + + + + + portfolio_optimization.components.qubos._qubo_factory — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.qubos._qubo_factory

+"""This module contains the ``QuboFactory`` class.
+
+The ``QuboFactory`` class provides a convenient interface for constructing intermediate
+QUBO matrices for different objectives and constraints.
+"""
+from __future__ import annotations
+
+import numpy as np
+from numpy.typing import NDArray
+
+from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData
+
+# pylint: disable=too-many-instance-attributes
+
+
+
[docs]class QuboFactory: + """QuboFactory - A factory class for creating QUBO instances. + + This class provides a convenient interface for constructing intermediate QUBO + matrices for different objectives and constraints. + + Methods: + + - `calc_minimize_hhi`: Calculates the to minimize HHI QUBO + - `calc_maximize_roc1`: Calculates the to maximize return on capital QUBO variant 1 + - `calc_maximize_roc2`: Calculates the to maximize return on capital QUBO variant 2 + - `calc_emission_constraint`: Calculates the emission constraint QUBO + - `calc_growth_factor_constraint`: Calculates the growth factor constraint QUBO + - `calc_stabilize_c`: Calculates the constraint QUBO that stabilizes growth factor. + """ + +
[docs] def __init__(self, portfolio_data: PortfolioData, k: int) -> None: + """Init of the ``QuboFactory``. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self.portfolio_data = portfolio_data + self.number_of_assets = len(portfolio_data) + self.n_vars = self.number_of_assets * k + self.outstanding_now = portfolio_data.get_outstanding_now() + self.l_bound = portfolio_data.get_l_bound() + self.u_bound = portfolio_data.get_u_bound() + self.income = portfolio_data.get_income() + self.returns = portfolio_data.get_returns() + self.capital = portfolio_data.get_capital() + self.k = k
+ +
[docs] def calc_minimize_hhi(self) -> tuple[NDArray[np.float_], float]: + r"""Calculates the to minimize HHI QUBO. + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + \sum_{i=1}^N\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right)^2, + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$. + + Returns: + qubo matrix and its offset + """ + qubo = np.zeros((self.n_vars, self.n_vars)) + offset = np.sum(self.l_bound**2) + multiplier = (self.u_bound - self.l_bound) / (2**self.k - 1) + for asset_i, (l_bound_i, multiplier_i) in enumerate( + zip(self.l_bound, multiplier) + ): + # For asset i: (LB + multiplier * sum_j 2**j x_j) ** 2 + for bit_j in range(self.k): + idx_1 = asset_i * self.k + bit_j + + # Diagonal elements: 2 * LB * multiplier * sum_j 2**j x_j + qubo[idx_1, idx_1] += l_bound_i * multiplier_i * 2 ** (bit_j + 1) + qubo[idx_1, idx_1] += multiplier_i**2 * 2 ** (2 * bit_j) + + # Elements: multiplier**2 * (sum_j 2**j x_j) * (sum_j' 2**j' x_j') + for bit_j_prime in range(bit_j + 1, self.k): + idx_2 = asset_i * self.k + bit_j_prime + qubo[idx_1, idx_2] += multiplier_i**2 * 2 ** ( + bit_j + bit_j_prime + 1 + ) + + qubo = qubo + return qubo, offset
+ +
[docs] def calc_emission_constraint( + self, + emission_now: str, + emission_future: str | None = None, + reduction_percentage_target: float = 0.7, + ) -> tuple[NDArray[np.float_], float]: + r"""Calculates the emission constraint QUBO for arbitrary target reduction target + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + &= + \left( + \sum_{i=1}^N f_i x_i + - g_e E + \sum_{i=1}^N x_i + \right)^2, + + x_i & = LB_i+\frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}, + + E &= \frac{\sum_{i=1}^N e_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$. + + Args: + emission_now: Name of the column in the portfolio dataset corresponding to + the variables at current time. + emission_future: Name of the column in the portfolio dataset corresponding + to the variables at future time. If no value is provided, it is assumed + that the value is constant over time, i.e., the variable + ``emission_now`` will be used. + reduction_percentage_target: Target value for reduction percentage amount. + + Raises: + KeyError: if the provided column names are not in the portfolio_data. + + Returns: + qubo matrix and its offset + """ + if emission_future is None: + emission_future = emission_now + + if emission_now not in self.portfolio_data: + raise KeyError( + f"Column name {emission_now} not present in portfolio dataset." + ) + if emission_future not in self.portfolio_data: + raise KeyError( + f"Column name {emission_future} not present in portfolio dataset." + ) + + emission_intensity_now = self.portfolio_data.get_column(emission_now) + emission_intensity_future = self.portfolio_data.get_column(emission_future) + + total_emission_now = np.sum(emission_intensity_now * self.outstanding_now) + relelative_total_emission_now = total_emission_now / np.sum( + self.outstanding_now + ) + + alpha = np.sum( + ( + emission_intensity_future + - reduction_percentage_target * relelative_total_emission_now + ) + * self.l_bound + ) + + mantisse = np.power(2, np.arange(self.k)) + multiplier = ( + ( + emission_intensity_future + - reduction_percentage_target * relelative_total_emission_now + ) + * (self.u_bound - self.l_bound) + / (2**self.k - 1) + ) + beta = np.kron(multiplier, mantisse) + qubo = np.zeros((self.n_vars, self.n_vars)) + + offset = alpha**2 + for idx1 in range(self.number_of_assets * self.k): + qubo[idx1, idx1] += 2 * alpha * beta[idx1] + beta[idx1] ** 2 + for idx2 in range(idx1 + 1, self.number_of_assets * self.k): + qubo[idx1, idx2] += 2 * beta[idx1] * beta[idx2] + + qubo = qubo + return qubo, offset
+ +
[docs] def calc_growth_factor_constraint( + self, growth_target: float + ) -> tuple[NDArray[np.float_], float]: + r"""Calculates the growth factor constraint QUBO + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + \left( + \frac{\sum_{i=1}^N LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1} 2^j\cdot x_{i,j}}{\sum_{i=1}^N y_i} + - g_c + \right)^2 + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$g_c$` is the target value for the total growth factor, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$. + + Args: + growth_target: target value for growth factor total outstanding amount. + + Returns: + qubo matrix and its offset + """ + total_outstanding_now = np.sum(self.outstanding_now) + alpha = np.sum(self.l_bound) / total_outstanding_now - growth_target + + mantisse = np.power(2, np.arange(self.k)) + multiplier = (self.u_bound - self.l_bound) / ( + (2**self.k - 1) * total_outstanding_now + ) + beta = np.kron(multiplier, mantisse) + + qubo = np.zeros((self.n_vars, self.n_vars)) + # We only fill the upper left part of the matrix, since we don't use ancilla + # variables + qubo_slice = qubo[ + : self.k * self.number_of_assets, : self.k * self.number_of_assets + ] + # Add the off diagonal elements + qubo_slice += np.triu(2 * np.outer(beta, beta), k=1) + # Add the diagonal elements + np.fill_diagonal(qubo_slice, beta**2 + 2 * alpha * beta) + offset = alpha**2 + return qubo, float(offset)
+ +
[docs] def calc_maximize_roc1(self) -> tuple[NDArray[np.float_], float]: + r"""Calculates the to maximize ROC QUBO for variant 1. + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + -\sum_{i=1}^N\frac{r_i}{c_i\cdot y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right), + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the current return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$. + + Returns: + qubo matrix and its offset + """ + theta = self.returns / (self.outstanding_now * self.capital) + offset = np.sum(theta * self.l_bound) + mantisse = np.power(2, np.arange(self.k)) + multiplier = theta * (self.u_bound - self.l_bound) / (2**self.k - 1) + qubo_diag = np.kron(multiplier, mantisse) + + qubo = np.diag(qubo_diag) + return -qubo, -offset
+ +
[docs] def calc_maximize_roc2(self) -> tuple[NDArray[np.float_], float]: + r"""Calculates the to maximize ROC QUBO for variant 2. + + The QUBO formulation is given by + + .. math:: + + QUBO(x,g) + &= + - + G_{inv}(g) \cdot + \sum_{i=1}^N\frac{r_i}{y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right), + + G_{inv}(g) &= + 1 + \sum_{j=0}^{k-1} 2^{-j-1}(2^{-j-1} - 1)\cdot g_{j}, + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$a$` is the number of ancilla variables, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$. + - `$g_{j}$` are the $a$ binary ancilla variables with $j<a$. + + Returns: + qubo matrix and its offset + """ + ancilla_variables = self.n_vars - self.k * self.number_of_assets + + alpha = np.sum(self.l_bound * self.returns / self.outstanding_now) + mantisse = mantisse = np.power(2, np.arange(self.k)) + multiplier = ( + self.returns + * (self.u_bound - self.l_bound) + / (self.outstanding_now * (2**self.k - 1)) + ) + beta = np.kron(multiplier, mantisse) + + gamma = np.power(2.0, np.arange(-1, -ancilla_variables - 1, -1)) + gamma = gamma**2 - gamma + + qubo = np.zeros((self.n_vars, self.n_vars)) + np.fill_diagonal( + qubo[: self.number_of_assets * self.k, : self.number_of_assets * self.k], + beta, + ) + qubo[ + : self.number_of_assets * self.k, self.number_of_assets * self.k : + ] += np.outer(beta, gamma) + np.fill_diagonal( + qubo[self.number_of_assets * self.k :, self.number_of_assets * self.k :], + alpha * gamma, + ) + offset = alpha + return -qubo, -offset
+ +
[docs] def calc_stabilize_c(self) -> tuple[NDArray[np.float_], float]: + r"""Calculates the QUBO that stabilizes the growth factor in the second ROC + formulation. + + The QUBO formulation is given by + + .. math:: + + QUBO(x,g) + &= + \left( + \sum_{i=1}^N\frac{c_i}{y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right) + - G_C(g)\sum_{i=1}^N c_i + \right)^2, + + G_C &= 1 + \sum_{j=0}^{k-1} 2^{-j - 1} \cdot g_j, + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$a$` is the number of ancilla variables, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j<k$, + - `$g_j$` are the $a$ ancillary binary variables with $j<a$. + + Returns: + qubo matrix and its offset + """ + ancilla_variables = self.n_vars - self.k * self.number_of_assets + alpha = np.sum(self.capital * self.l_bound / self.outstanding_now) - np.sum( + self.capital + ) + + mantisse = mantisse = np.power(2, np.arange(self.k)) + multiplier = ( + self.capital + * (self.u_bound - self.l_bound) + / (self.outstanding_now * (2**self.k - 1)) + ) + beta = np.kron(multiplier, mantisse) + + gamma = -np.power(2.0, np.arange(-1, -ancilla_variables - 1, -1)) * np.sum( + self.capital + ) + + qubo = np.zeros((self.n_vars, self.n_vars)) + qubo_upper_left = qubo[ + : self.number_of_assets * self.k, : self.number_of_assets * self.k + ] + qubo_upper_left += np.triu(2 * np.outer(beta, beta), k=1) + np.fill_diagonal(qubo_upper_left, 2 * alpha * beta + beta**2) + + qubo_upper_right = qubo[ + : self.number_of_assets * self.k, self.number_of_assets * self.k : + ] + qubo_upper_right += 2 * np.outer(beta, gamma) + + qubo_lower_right = qubo[ + self.number_of_assets * self.k :, self.number_of_assets * self.k : + ] + qubo_lower_right += np.triu(2 * np.outer(gamma, gamma), k=1) + np.fill_diagonal(qubo_lower_right, 2 * alpha * gamma + gamma**2) + offset = alpha**2 + + return qubo, offset
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/results.html b/docs/_modules/portfolio_optimization/components/results.html new file mode 100644 index 0000000..b4d50c0 --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/results.html @@ -0,0 +1,306 @@ + + + + + + portfolio_optimization.components.results — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.results

+"""This module contains a container for Results object."""
+from __future__ import annotations
+
+import numpy as np
+import pandas as pd
+from numpy.typing import NDArray
+
+from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData
+
+
+
[docs]class Results: + """Results container""" + +
[docs] def __init__( + self, + portfolio_data: PortfolioData, + provided_emission_constraints: list[tuple[str, str, float, str]] | None = None, + provided_growth_target: float | None = None, + ) -> None: + """Init of Results container. + + Args: + portfolio_data: the portfolio data + provided_emission_constraints: list of all the emission constraints that are + provided. Each list element contains the ``emission_now``, + ``emission_future`` and ``reduction_percentage_target`` input. + provided_growth_target: target outstanding amount growth factor if the + growth factor constraint is set, otherwise None. + """ + self.portfolio_data = portfolio_data + if provided_emission_constraints is None: + self.provided_emission_constraints = [] + else: + self.provided_emission_constraints = provided_emission_constraints + self.provided_growth_target = provided_growth_target + + self._outstanding_now = portfolio_data.get_outstanding_now() + self._total_outstanding_now = np.sum(self._outstanding_now) + + self._returns = portfolio_data.get_income() / self._outstanding_now + self._capital = portfolio_data.get_capital() + self._roc_now = np.sum(portfolio_data.get_income()) / np.sum(self._capital) + self._hhi_now = ( + np.sum(self._outstanding_now**2) / np.sum(self._outstanding_now) ** 2 + ) + + self.columns = [ + "outstanding amount", + "diff ROC", + "diff diversification", + "diff outstanding", + ] + [ + "diff " + constraint[3] for constraint in self.provided_emission_constraints + ] + self.results_df = pd.DataFrame(columns=self.columns)
+ +
[docs] def __len__(self) -> int: + """Return the number of samples stored in the ``Results`` object.""" + return len(self.results_df)
+ +
[docs] def add_result(self, outstanding_future_samples: NDArray[np.float_]) -> None: + """Adds a new outstanding_future data point to results container. + + Args: + outstanding_future_samples: outstanding amounts in the future for each + sample of the dataset. + """ + for oustanding_future in outstanding_future_samples: + total_outstanding_future = np.sum(oustanding_future) + # Compute the ROC growth + roc = np.sum(oustanding_future * self._returns) / np.sum( + oustanding_future * self._capital / self._outstanding_now + ) + roc_growth = 100 * (roc / self._roc_now - 1) + + # Compute the diversification. + hhi = np.sum(oustanding_future**2) / total_outstanding_future**2 + diff_diversification = 100 * (1 - (hhi / self._hhi_now)) + + # Compute the growth outstanding in outstanding amount + growth_outstanding = total_outstanding_future / self._total_outstanding_now + + new_data = [ + tuple(oustanding_future), + roc_growth, + diff_diversification, + growth_outstanding, + ] + + # Compute the emission constraint growths + for ( + column_name_now, + column_name_future, + _, + _, + ) in self.provided_emission_constraints: + total_relative_emission_now = ( + np.sum( + self._outstanding_now + * self.portfolio_data.get_column(column_name_now) + ) + / self._total_outstanding_now + ) + total_relative_emission_future = np.sum( + oustanding_future + * self.portfolio_data.get_column(column_name_future) + ) / np.sum(oustanding_future) + + new_data.append( + 100 + * (total_relative_emission_future / total_relative_emission_now - 1) + ) + + # Write results + self.results_df.loc[len(self.results_df)] = new_data
+ +
[docs] def head(self, n: int = 5) -> pd.DataFrame: + """Returns first n rows of self.results_df DataFrame + + Args: + selected_columns: By default all columns + n: number of results to return + """ + selected_columns = [ + column for column in self.columns if column != "Outstanding amount" + ] + return self.results_df[selected_columns].head(n)
+ +
[docs] def drop_duplicates(self) -> None: + """Drops duplicates in results DataFrame""" + self.results_df.drop_duplicates(subset=["outstanding amount"], inplace=True)
+ +
[docs] def slice_results( + self, tolerance: float = 0.0 + ) -> tuple[ + tuple[NDArray[np.float_], NDArray[np.float_]], + tuple[NDArray[np.float_], NDArray[np.float_]], + ]: + """Helper function that slices the results in two groups, those results that + satisfy all constraints and those that violate at least one of the growth factor + or emission constraints. + + Args: + tolerance: tolerance on how strict the constraints need to be satisfied (in + percentage point). Example: if the desired target growth rate is 1.2, if + the tolerance is set to 0.05 (5%). Solutions that increase outstanding + amount by a factor of 1.15 are considered to satisfy the constraints + given the tolerance. + + Returns: + Relative difference (diversification, roc) coordinates for solutions that + satisfy all constraints, and for those that do not satisfy all constraints. + + Raises: + ValueError: when there are no emission or growth factor constraints set. + """ + if ( + self.provided_growth_target is None + and len(self.provided_emission_constraints) == 0 + ): + raise ValueError("There are no emission or growth constraints set.") + + mask_growth_target = ( + True + if self.provided_growth_target is None + else ( + self.results_df["diff outstanding"] + >= 100 * (self.provided_growth_target - tolerance - 1) + ) + ) + + mask_emission_constraint = True + for _, _, value, name in self.provided_emission_constraints: + mask_emission_constraint &= self.results_df["diff " + name] <= 100 * ( + (value + tolerance) - 1 + ) + + combined_mask = mask_growth_target & mask_emission_constraint + + # Filter data based on masks + filtered_data_met = self.results_df[combined_mask] + filtered_data_violated = self.results_df[~combined_mask] + + x_met = filtered_data_met["diff diversification"].to_numpy() + y_met = filtered_data_met["diff ROC"].to_numpy() + x_violated = filtered_data_violated["diff diversification"].to_numpy() + y_violated = filtered_data_violated["diff ROC"].to_numpy() + return (x_met, y_met), (x_violated, y_violated)
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/portfolio_optimization/components/visualization.html b/docs/_modules/portfolio_optimization/components/visualization.html new file mode 100644 index 0000000..2444ac7 --- /dev/null +++ b/docs/_modules/portfolio_optimization/components/visualization.html @@ -0,0 +1,251 @@ + + + + + + portfolio_optimization.components.visualization — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for portfolio_optimization.components.visualization

+"""This module contains visualization tools."""
+from __future__ import annotations
+
+from typing import TYPE_CHECKING
+
+import matplotlib.pyplot as plt
+
+from tno.quantum.problems.portfolio_optimization.components.postprocess import (
+    pareto_front,
+)
+
+if TYPE_CHECKING:
+    from collections.abc import Sequence
+    from typing import Any
+
+    from matplotlib.axes import Axes
+    from matplotlib.collections import PatchCollection
+    from matplotlib.colors import Colormap
+    from matplotlib.typing import ColorType
+    from numpy.typing import ArrayLike
+
+
+
[docs]def plot_points( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection | Any: + """Plots the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + if ax is None: + _, ax = plt.subplots() + collection = ax.scatter( + diversification_values, + roc_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ) + ax.set_xlabel("Diversification Change (%)") + ax.set_ylabel("ROC Change (%)") + ax.grid() + if label is not None: + ax.legend() + + xlim = ax.get_xlim() + ylim = ax.get_ylim() + ax.axhline(0, color="black", linewidth=1) + ax.axvline(0, color="black", linewidth=1) + ax.set_xlim(*xlim, auto=True) + ax.set_ylim(*ylim, auto=True) + return collection
+ + +
[docs]def plot_front( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection: + """Plots a pareto front of the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + x_values, y_values = pareto_front(diversification_values, roc_values) + return plot_points( + x_values, + y_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ax=ax, + )
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.html b/docs/_modules/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.html new file mode 100644 index 0000000..5e9d3c9 --- /dev/null +++ b/docs/_modules/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.html @@ -0,0 +1,566 @@ + + + + + + tno.quantum.problems.portfolio_optimization._portfolio_optimizer — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for tno.quantum.problems.portfolio_optimization._portfolio_optimizer

+"""This module contains the ``PortfolioOptimizer`` class."""
+from __future__ import annotations
+
+import itertools
+import math
+from datetime import datetime
+from pathlib import Path
+from typing import Any
+
+import numpy as np
+from dimod.core.sampler import Sampler
+from dwave.samplers import SimulatedAnnealingSampler
+from numpy.typing import ArrayLike, NDArray
+from pandas import DataFrame
+from tqdm import tqdm
+
+from tno.quantum.problems.portfolio_optimization.components import (
+    Decoder,
+    PortfolioData,
+    QuboCompiler,
+    Results,
+)
+
+
+
[docs]class PortfolioOptimizer: + """The ``PortfolioOptimizer`` class is used to convert multi-objective portfolio + optimization problems into QUBO problems which can then be solved using QUBO solving + techniques such as simulated or quantum annealing. + + The following objectives can be considered + + - `return on capital`, indicated by ROC, + - `diversification`, indicated by the `Herfindahl-Hirschman Index`_ HHI. + + The following constraints can be added + + - `capital growth`, demand a minimum increase in outstanding assets. + - `emission reduction`, demand a minimum reduction for an arbitrary emission type. + + Usage example: + + .. code-block:: + + import numpy as np + from dwave.samplers import SimulatedAnnealingSampler + + from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + + # Choose sampler for solving qubo + sampler = SimulatedAnnealingSampler() + sampler_kwargs = {"num_reads": 20, "num_sweeps": 200} + + # Set up penalty coefficients for the constraints + lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas3 = np.array([1]) + + # Create portfolio optimization problem + portfolio_optimizer = PortfolioOptimizer("benchmark_dataset") + portfolio_optimizer.add_minimize_hhi(weights=lambdas1) + portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas1) + portfolio_optimizer.add_emission_constraint( + weights=lambdas3, + emission_now="emis_intens_now", + emission_future="emis_intens_future", + name="emission", + ) + + # Solve the portfolio optimization problem + results = portfolio_optimizer.run(sampler, sampler_kwargs) + print(results.head()) + + .. _Herfindahl-Hirschman Index: https://nl.wikipedia.org/wiki/Herfindahl-index + """ + +
[docs] def __init__( + self, + portfolio_data: PortfolioData | DataFrame | str | Path, + k: int = 2, + columns_rename: dict[str, str] | None = None, + ) -> None: + """Init ``PortfolioOptimizer``. + + Args: + portfolio_data: Portfolio data represented by a ``PortfolioData`` object, + a pandas ``DataFrame`` or a path to where portfolio data is stored. See + the docstring of + :py:class:`~portfolio_optimization.components.io.PortfolioData` for data + input conventions. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + column_rename: can be used to rename data columns. See the docstring of + :py:class:`~portfolio_optimization.components.io.PortfolioData` for + example. + + Raises: + TypeError: If the provided ``portfolio_data`` input has the wrong type. + """ + if isinstance(portfolio_data, PortfolioData): + self.portfolio_data = portfolio_data + elif isinstance(portfolio_data, DataFrame): + self.portfolio_data = PortfolioData(portfolio_data, columns_rename) + elif isinstance(portfolio_data, (Path, str)): + self.portfolio_data = PortfolioData.from_file( + portfolio_data, columns_rename + ) + else: + raise TypeError( + "`portfolio_data` must be of type `PortfolioData`, `DataFrame`, `Path` " + f"or `str`, but was of type {type(portfolio_data)}" + ) + self._qubo_compiler = QuboCompiler(self.portfolio_data, k) + self.decoder = Decoder(self.portfolio_data, k) + self._all_lambdas: list[NDArray[np.float_]] = [] + self._provided_emission_constraints: list[tuple[str, str, float, str]] = [] + self._provided_growth_target: float | None = None
+ +
[docs] def add_minimize_hhi(self, weights: ArrayLike | None = None) -> None: + r"""Adds the minimize HHI objective to the portfolio optimization problem. + + The HHI objective is given by + + $$HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`. + + As the objective contains non-quadratic terms, a QUBO formulation requires + approximations. For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_minimize_hhi`. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_minimize_hhi(weights=lambdas) + + Args: + weights: The coefficients that are considered as penalty parameter. + """ + self._all_lambdas.append(self._parse_weight(weights)) + self._qubo_compiler.add_minimize_hhi()
+ +
[docs] def add_maximize_roc( + self, + formulation: int, + weights_roc: ArrayLike | None = None, + ancilla_variables: int = 0, + weights_stabilize: ArrayLike | None = None, + ) -> None: + r"""Adds the maximize ROC objective to the portfolio optimization problem. + + The ROC objective is given by + + .. math:: + + ROC(x) = + \frac{\sum_{i=1}^N \frac{x_i \cdot r_i}{y_i}} + {\sum_{i=1}^N \frac{x_i \cdot c_i}{y_i}}, + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`. + + As the ROC is not a quadratic function, it is approximated using two different + formulations: + + formulation 1: + $$ROC_1(x)=\sum_{i=1}^N\frac{x_i\cdot r_i}{c_i\cdot y_i}$$ + + Adds 1 qubo term, use ``weights_roc`` to scale. + + formulation 2: + $$ROC_2(x)=\frac{1}{G_C \cdot C_{21}}\sum_{i=1}^N x_i\frac{r_i}{y_i}$$ + + In this formulation, $G_C \cdot C_{21}$ approximates a fixed regulatory + capital growth which is equal for all assets, where + + - `$1≤G_C<2$` is a growth factor to be estimated using ancilla variables, + - `$C_{21} = \sum_{i=1}^N c_{i}$` is the sum of all assets' regulatory capital. + + This formulation adds 2 qubo terms, one for the ROC term, and one to stabilize the + capital growth. The stabilize qubo requires an extra argument ``ancilla_variables``. + Use ``weights_roc`` and ``weights_stabilize`` to scale both qubo's accordingly. + + For the different QUBO formulations, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_maximize_roc(...) + + Args: + formulation: the ROC QUBO formulation that is being used. + Possible options are: [1, 2]. + weights_roc: The coefficients that are considered as penalty parameter for + maximizing the roc objective. + ancilla_variables: The number of ancillary variables that are used to + represent ``G_C`` using fixed point representation. Only relevant for + roc formulation ``2``. + weights_stabilize: The coefficients that are considered as penalty parameter + for the stabilizing constraint. Only relevant for roc formulation ``2``. + + Raises: + ValueError: If invalid formulation is provided. + """ + allowed_formulation_options = [1, 2] + if formulation not in allowed_formulation_options: + raise ValueError( + "Invalid formulation input provided, " + f"choose from {allowed_formulation_options}." + ) + + self._all_lambdas.append(self._parse_weight(weights_roc)) + if formulation == 2: + self._all_lambdas.append(self._parse_weight(weights_stabilize)) + self._qubo_compiler.add_maximize_roc(formulation, ancilla_variables)
+ +
[docs] def add_emission_constraint( + self, + emission_now: str, + emission_future: str | None = None, + reduction_percentage_target: float = 0.7, + name: str | None = None, + weights: ArrayLike | None = None, + ) -> None: + r"""Adds emission constraint to the portfolio optimization problem. + + The constraint is given by + + .. math:: + + \frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} + = + g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_emission_constraint( + ... emission_now="emis_intens_now", weights=lambdas + ... ) + + For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_emission_constraint`. + + Args: + emission_now: Name of the column in the portfolio dataset corresponding to + the variables emission intensity at current time. + emission_future: Name of the column in the portfolio dataset corresponding + to the variables emission intensity at future time. If no value is + provided, it is assumed that the emission intensity is constant over + time, i.e., the variable ``emission_now`` will be used. + reduction_percentage_target: target value for reduction percentage amount. + name: Name that will be used for emission constraint in the results df. + weights: The coefficients that are considered as penalty parameter. + """ + # Store emission constraint information + if name is None: + name = emission_now + if emission_future is None: + emission_future = emission_now + self._provided_emission_constraints.append( + (emission_now, emission_future, reduction_percentage_target, name) + ) + self._all_lambdas.append(self._parse_weight(weights)) + + self._qubo_compiler.add_emission_constraint( + emission_now=emission_now, + emission_future=emission_future, + reduction_percentage_target=reduction_percentage_target, + )
+ +
[docs] def add_growth_factor_constraint( + self, growth_target: float, weights: ArrayLike | None = None + ) -> None: + # pylint: disable=line-too-long + r"""Adds an outstanding amount growth factor constraint to the portfolio + optimization problem. + + The constraint is given by + + $$\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_c$` is the target value for the total growth factor. + + This constraint can only be added once. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_emission_constraint(growth_target=1.2, weights=lambdas) + + For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_growth_factor_constraint`. + + Args: + growth_target: target value for growth factor total outstanding amount. + weights: The coefficients that are considered as penalty parameter. + + Raises: + ValueError: If constraint has been added before. + """ + # pylint: enable=line-too-long + if self._provided_growth_target is not None: + raise ValueError("Growth factor constraint has been set before.") + + self._all_lambdas.append(self._parse_weight(weights)) + self._provided_growth_target = growth_target + self._qubo_compiler.add_growth_factor_constraint(growth_target)
+ +
[docs] def run( + self, + sampler: Sampler | None = None, + sampler_kwargs: dict[str, Any] | None = None, + verbose: bool = True, + ) -> Results: + # pylint: disable=line-too-long + """ + Optimizes a portfolio given the set of provided constraints. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> from dwave.samplers import SimulatedAnnealingSampler + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> portfolio_optimizer.add_minimize_HHI() + >>> portfolio_optimizer.run(sampler=SimulatedAnnealingSampler(), verbose=False) + + Args: + sampler: Instance of a D-Wave Sampler that can be used to solve the QUBO. + More information can be found in the `D-Wave Ocean Documentation`_. + By default the ``SimulatedAnnealingSampler`` is being used. + sampler_kwargs: The sampler specific key-word arguments. + verbose: If True, print detailed information during execution + + Returns: + results + + Raises: + ValueError: if constraints are not set + + .. _D-Wave Ocean Documentation: https://docs.ocean.dwavesys.com/projects/system/en/stable/reference/samplers.html + + """ + # pylint: enable=line-too-long + if verbose: + self.portfolio_data.print_portfolio_info() + + sampler = SimulatedAnnealingSampler() if sampler is None else sampler + sampler_kwargs = {} if sampler_kwargs is None else sampler_kwargs + + if verbose: + print("Status: creating model") + if self._provided_growth_target is not None: + print(f"Growth target: {self._provided_growth_target - 1:.1%}") + + for _, _, target_value, name in self._provided_emission_constraints: + print( + f"Emission constraint: {name}, " + f"target reduction percentage: {target_value - 1:.1%}" + ) + + self._qubo_compiler.compile() + + results = Results( + portfolio_data=self.portfolio_data, + provided_emission_constraints=self._provided_emission_constraints, + provided_growth_target=self._provided_growth_target, + ) + + if verbose: + print("Status: calculating") + starttime = datetime.now() + + total_steps = math.prod(map(len, self._all_lambdas)) + lambdas_iterator = tqdm( + itertools.product(*self._all_lambdas), total=total_steps + ) + + for lambdas in lambdas_iterator: + # Compile the model and generate QUBO + qubo, _ = self._qubo_compiler.make_qubo(*lambdas) + # Solve the QUBO + response = sampler.sample_qubo(qubo, **sampler_kwargs) + # Postprocess solution. Iterate over all found solutions. (Compute future portfolios) + outstanding_future_samples = self.decoder.decode_sampleset(response) + results.add_result(outstanding_future_samples) + + if verbose: + print("Drop duplicate samples in results.") + results.drop_duplicates() + + if verbose: + print("Number of unique samples: ", len(results)) + print("Time consumed:", datetime.now() - starttime) + + return results
+ + @staticmethod + def _parse_weight(weights: ArrayLike | None = None) -> NDArray[np.float_]: + """Converts weights into NumPy array and if needed set default weights to [1.0] + + Args: + weights: penalty coefficients. + + Returns: + Numpy array of weights + """ + if weights is None: + return np.array([1.0]) + return np.asarray(weights, dtype=np.float_)
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_modules/tno/quantum/problems/portfolio_optimization/components/visualization.html b/docs/_modules/tno/quantum/problems/portfolio_optimization/components/visualization.html new file mode 100644 index 0000000..1fbef1b --- /dev/null +++ b/docs/_modules/tno/quantum/problems/portfolio_optimization/components/visualization.html @@ -0,0 +1,251 @@ + + + + + + tno.quantum.problems.portfolio_optimization.components.visualization — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + + +
  • +
  • +
+
+
+
+
+ +

Source code for tno.quantum.problems.portfolio_optimization.components.visualization

+"""This module contains visualization tools."""
+from __future__ import annotations
+
+from typing import TYPE_CHECKING
+
+import matplotlib.pyplot as plt
+
+from tno.quantum.problems.portfolio_optimization.components.postprocess import (
+    pareto_front,
+)
+
+if TYPE_CHECKING:
+    from collections.abc import Sequence
+    from typing import Any
+
+    from matplotlib.axes import Axes
+    from matplotlib.collections import PatchCollection
+    from matplotlib.colors import Colormap
+    from matplotlib.typing import ColorType
+    from numpy.typing import ArrayLike
+
+
+
[docs]def plot_points( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection | Any: + """Plots the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + if ax is None: + _, ax = plt.subplots() + collection = ax.scatter( + diversification_values, + roc_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ) + ax.set_xlabel("Diversification Change (%)") + ax.set_ylabel("ROC Change (%)") + ax.grid() + if label is not None: + ax.legend() + + xlim = ax.get_xlim() + ylim = ax.get_ylim() + ax.axhline(0, color="black", linewidth=1) + ax.axvline(0, color="black", linewidth=1) + ax.set_xlim(*xlim, auto=True) + ax.set_ylim(*ylim, auto=True) + return collection
+ + +
[docs]def plot_front( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection: + """Plots a pareto front of the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + x_values, y_values = pareto_front(diversification_values, roc_values) + return plot_points( + x_values, + y_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ax=ax, + )
+
+ +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/_sources/index.rst.txt b/docs/_sources/index.rst.txt new file mode 100644 index 0000000..49e58d4 --- /dev/null +++ b/docs/_sources/index.rst.txt @@ -0,0 +1,248 @@ +.. tno.quantum.problems.portfolio_optimization documentation master file, created by + sphinx-quickstart on Wed May 1 16:21:09 2024. + You can adapt this file completely to your liking, but it should at least + contain the root `toctree` directive. + + +TNO Quantum +=========== +TNO Quantum provides generic software components aimed at facilitating the development +of quantum applications. + +Portfolio optimization +====================== + +Real-world investment decisions involve multiple, often conflicting, objectives that needs to be balanced. +Primary goals typically revolve around maximizing returns while minimizing risks. +At the same time, one might want to require additional constraints such as demanding a minimum carbon footprint reduction. +Finding a portfolio that balances these objectives is a challenging task and can be solved using multi-objective portfolio optimization. + + +This repository provides Python code that converts the multi-objective portfolio optimization problem +into a `QUBO`_ problem. The transformed problem can then be solved using quantum annealing techniques. + +The following objectives can be considered + +- `return on capital`, indicated by ROC, +- `diversification`, indicated by the `Herfindahl-Hirschman Index`_ HHI. + +Additionally, we allow for a capital growth factor and arbitrary emission reduction constraints to be considered. + +The `Pareto front`_, the set of solutions where one objective can't be improved without worsening the other objective, +can be computed for the objectives return on capital and diversification. + +The codebase is based on the following paper: + +- `Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2024)`_ + +.. _Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2024): https://www.mdpi.com/2227-7390/12/9/1291 +.. _Herfindahl-Hirschman Index: https://en.wikipedia.org/wiki/Herfindahl%E2%80%93Hirschman_index +.. _Pareto front: https://en.wikipedia.org/wiki/Pareto_front +.. _QUBO: https://en.wikipedia.org/wiki/Quadratic_unconstrained_binary_optimization + + +**Funding:** This research was funded by Rabobank and Stichting TKI High Tech Systems +and Materials, under a program by Brightland's Techruption. + +Quick Install +------------- +The portfolio optimization module can be installed using pip as follows:: + + pip install tno.quantum.problems.portfolio_optimization + +Examples +-------- + +Here's an example of how the :py:class:`~portfolio_optimization.PortfolioOptimizer` class +can be used to define an portfolio optimization problem, and subsequently, how the Pareto front can be computed +using the simulated annealing sampler from D-Wave. + + +.. code-block:: python + + import numpy as np + from dwave.samplers import SimulatedAnnealingSampler + + from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + + # Choose sampler for solving qubo + sampler = SimulatedAnnealingSampler() + sampler_kwargs = {"num_reads": 20, "num_sweeps": 200} + + # Set up penalty coefficients for the constraints + lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas3 = np.array([1]) + + # Create portfolio optimization problem + portfolio_optimizer = PortfolioOptimizer("benchmark_dataset") + portfolio_optimizer.add_minimize_hhi(weights=lambdas1) + portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas2) + portfolio_optimizer.add_emission_constraint( + weights=lambdas3, + emission_now="emis_intens_now", + emission_future="emis_intens_future", + name="emission" + ) + + # Solve the portfolio optimization problem + results = portfolio_optimizer.run(sampler, sampler_kwargs) + print(results.head()) + +The results can be inspected in more detail by looking at the Pandas results DataFrame +`results.results_df`. + +Alternatively, the results can be plotted in a `(Diversification, ROC)`-graph. The +following example first slices the results in data points that do and do not satisfy the +constraints using the method :py:meth:`~portfolio_optimization.components.results.Results.slice_results()`. + +Note that: + +- Individual data points can subsequently be plotted using :py:func:`~portfolio_optimization.components.visualization.plot_points()` +- The Pareto front can be plotted using :py:func:`~portfolio_optimization.components.visualization.plot_front()` + +.. code-block:: python + + import matplotlib.pyplot as plt + + from tno.quantum.problems.portfolio_optimization import plot_front, plot_points + + (x1, y1), (x2, y2) = results.slice_results() + fig, (ax1, ax2) = plt.subplots(ncols=2, figsize=(12, 5)) + + # Plot data points + plot_points(x2, y2, color="orange", label="QUBO constraint not met", ax=ax1) + plot_points(x1, y1, color="green", label="QUBO constraint met", ax=ax1) + ax1.set_title("Points") + + # Plot Pareto front + plot_front(x2, y2, color="orange", label="QUBO constraint not met", ax=ax2) + plot_front(x1, y1, color="green", label="QUBO constraint met", ax=ax2) + ax2.set_title("Pareto Front") + fig.tight_layout() + plt.show() + +.. image:: ../images_for_docs/example.png + :width: 1200 + :align: center + :alt: (Diversification, ROC)-Graph + +More elaborate examples can be found in our `examples repository`_. + +.. _examples repository: https://github.com/TNO-Quantum/examples + +Data input +---------- + +The data used for the portfolio optimization can be imported via an excel file, csv file, +json file or as a Pandas DataFrame. +The data needs to contain at least the following columns: + + - ``asset``: The name of the asset. + - ``outstanding_now``: Current outstanding amount per asset. + - ``min_outstanding_future``: Lower bound outstanding amount in the future per asset. + - ``max_outstanding_future``: Upper bound outstanding amount in the future per asset. + - ``income_now``: Current income per asset, corresponds to return multiplied by the current outstanding amount. + - ``regcap_now``: Current regulatory capital per asset. + +The table below shows an example dataset with the correct structure. +Note that this is the least amount of columns that need to be present. +More columns are allowed and required for some functionalities. + +.. list-table:: Example Dataset + :widths: 25 25 25 25 25 25 + :header-rows: 1 + + * - asset + - outstanding_now + - min_outstanding_future + - max_outstanding_future + - income_now + - regcap_now + * - Sector 1 COUNTRY 1 + - 10 + - 14 + - 19 + - 5 + - 5 + * - Sector 2 COUNTRY 1 + - 600 + - 473 + - 528 + - 70 + - 40 + * - Sector 3 COUNTRY 1 + - 20 + - 24 + - 28 + - 5 + - 10 + * - Sector 4 COUNTRY 1 + - 800 + - 1090 + - 1410 + - 1 + - 2 + * - Sector 1 COUNTRY 2 + - 40 + - 56 + - 74 + - 10 + - 5 + * - Sector 2 COUNTRY 2 + - 200 + - 291 + - 397 + - 40 + - 20 + * - ... + - ... + - ... + - ... + - ... + - ... + +If the input datafile contains all the correct information, but has different column +names, it is possible to rename the columns without altering the input file. +Details and examples can be found in the documentation of +:py:class:`~portfolio_optimization.components.io.PortfolioData`. + + +Using Quantum Annealing Solvers +------------------------------- + +By default, the portfolio optimization QUBO is solved using simulated annealing. +Any D-Wave ``Sampler`` is however supported and can be provided to the +:py:meth:`~portfolio_optimization.PortfolioOptimizer.run` method. + + +Below is an example how to initialise a quantum annealing sampler that uses `100` micro seconds annealing time per sample. +The example assumes a proper `configuration setup`_ to the D-Wave's Solver API. + +.. code-block:: python + + from dwave.system import DWaveSampler, LazyFixedEmbeddingComposite + + # Define QPU D-Wave Sampler + qpu = DWaveSampler() + sampler = LazyFixedEmbeddingComposite(qpu) + sampler_kwargs = {"annealing_time": 100} + + +We refer to the `D-Wave Sampler documentation`_ for information on usage of different samplers and their sampler arguments. + +.. _configuration setup: https://docs.ocean.dwavesys.com/en/stable/overview/sapi.html +.. _D-Wave Sampler documentation: https://docs.ocean.dwavesys.com/projects/system/en/stable/reference/samplers.html + +.. toctree:: + :maxdepth: 4 + :caption: Contents: + :hidden: + + portfolio_optimization + + + +(End)use Limitations +-------------------- +The content of this software may solely be used for applications that comply with international export control laws. diff --git a/docs/_sources/portfolio_optimization.components.io.rst.txt b/docs/_sources/portfolio_optimization.components.io.rst.txt new file mode 100644 index 0000000..6f3ab28 --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.io.rst.txt @@ -0,0 +1,7 @@ +portfolio\_optimization.components.io module +============================================ + +.. automodule:: portfolio_optimization.components.io + :members: + :undoc-members: + :show-inheritance: diff --git a/docs/_sources/portfolio_optimization.components.postprocess.rst.txt b/docs/_sources/portfolio_optimization.components.postprocess.rst.txt new file mode 100644 index 0000000..35f91ca --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.postprocess.rst.txt @@ -0,0 +1,7 @@ +portfolio\_optimization.components.postprocess module +===================================================== + +.. automodule:: portfolio_optimization.components.postprocess + :members: + :undoc-members: + :show-inheritance: diff --git a/docs/_sources/portfolio_optimization.components.qubos.rst.txt b/docs/_sources/portfolio_optimization.components.qubos.rst.txt new file mode 100644 index 0000000..e95c07c --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.qubos.rst.txt @@ -0,0 +1,7 @@ +portfolio\_optimization.components.qubos package +================================================ + +.. automodule:: portfolio_optimization.components.qubos + :members: + :undoc-members: + :show-inheritance: diff --git a/docs/_sources/portfolio_optimization.components.results.rst.txt b/docs/_sources/portfolio_optimization.components.results.rst.txt new file mode 100644 index 0000000..d1d9b3d --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.results.rst.txt @@ -0,0 +1,7 @@ +portfolio\_optimization.components.results module +================================================= + +.. automodule:: portfolio_optimization.components.results + :members: + :undoc-members: + :show-inheritance: diff --git a/docs/_sources/portfolio_optimization.components.rst.txt b/docs/_sources/portfolio_optimization.components.rst.txt new file mode 100644 index 0000000..5033955 --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.rst.txt @@ -0,0 +1,25 @@ +portfolio\_optimization.components package +========================================== + +.. automodule:: portfolio_optimization.components + :members: + :undoc-members: + :show-inheritance: + +Subpackages +----------- +.. toctree:: + :maxdepth: 4 + + + portfolio_optimization.components.qubos + + +.. toctree:: + :maxdepth: 4 + + + portfolio_optimization.components.io + portfolio_optimization.components.postprocess + portfolio_optimization.components.results + portfolio_optimization.components.visualization diff --git a/docs/_sources/portfolio_optimization.components.visualization.rst.txt b/docs/_sources/portfolio_optimization.components.visualization.rst.txt new file mode 100644 index 0000000..d46ba55 --- /dev/null +++ b/docs/_sources/portfolio_optimization.components.visualization.rst.txt @@ -0,0 +1,7 @@ +portfolio\_optimization.components.visualization module +======================================================= + +.. automodule:: portfolio_optimization.components.visualization + :members: + :undoc-members: + :show-inheritance: diff --git a/docs/_sources/portfolio_optimization.rst.txt b/docs/_sources/portfolio_optimization.rst.txt new file mode 100644 index 0000000..1c08254 --- /dev/null +++ b/docs/_sources/portfolio_optimization.rst.txt @@ -0,0 +1,15 @@ +portfolio\_optimization package +=============================== + +.. automodule:: portfolio_optimization + :members: + :undoc-members: + :show-inheritance: + +Subpackages +----------- +.. toctree:: + :maxdepth: 4 + + + portfolio_optimization.components diff --git a/docs/_static/TNO_blue.ico b/docs/_static/TNO_blue.ico new file mode 100644 index 0000000..f00e3e8 Binary files /dev/null and b/docs/_static/TNO_blue.ico differ diff --git a/docs/_static/TNO_wit.svg b/docs/_static/TNO_wit.svg new file mode 100644 index 0000000..b5e61c2 --- /dev/null +++ b/docs/_static/TNO_wit.svg @@ -0,0 +1,32 @@ + + + + diff --git a/docs/_static/_sphinx_javascript_frameworks_compat.js b/docs/_static/_sphinx_javascript_frameworks_compat.js new file mode 100644 index 0000000..8549469 --- /dev/null +++ b/docs/_static/_sphinx_javascript_frameworks_compat.js @@ -0,0 +1,134 @@ +/* + * _sphinx_javascript_frameworks_compat.js + * ~~~~~~~~~~ + * + * Compatability shim for jQuery and underscores.js. + * + * WILL BE REMOVED IN Sphinx 6.0 + * xref RemovedInSphinx60Warning + * + */ + +/** + * select a different prefix for underscore + */ +$u = _.noConflict(); + + +/** + * small helper function to urldecode strings + * + * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL + */ +jQuery.urldecode = function(x) { + if (!x) { + return x + } + return decodeURIComponent(x.replace(/\+/g, ' ')); +}; + +/** + * small helper function to urlencode strings + */ +jQuery.urlencode = encodeURIComponent; + +/** + * This function returns the parsed url parameters of the + * current request. Multiple values per key are supported, + * it will always return arrays of strings for the value parts. + */ +jQuery.getQueryParameters = function(s) { + if (typeof s === 'undefined') + s = document.location.search; + var parts = s.substr(s.indexOf('?') + 1).split('&'); + var result = {}; + for (var i = 0; i < parts.length; i++) { + var tmp = parts[i].split('=', 2); + var key = jQuery.urldecode(tmp[0]); + var value = jQuery.urldecode(tmp[1]); + if (key in result) + result[key].push(value); + else + result[key] = [value]; + } + return result; +}; + +/** + * highlight a given string on a jquery object by wrapping it in + * span elements with the given class name. + */ +jQuery.fn.highlightText = function(text, className) { + function highlight(node, addItems) { + if (node.nodeType === 3) { + var val = node.nodeValue; + var pos = val.toLowerCase().indexOf(text); + if (pos >= 0 && + !jQuery(node.parentNode).hasClass(className) && + !jQuery(node.parentNode).hasClass("nohighlight")) { + var span; + var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg"); + if (isInSVG) { + span = document.createElementNS("http://www.w3.org/2000/svg", "tspan"); + } else { + span = document.createElement("span"); + span.className = className; + } + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + node.parentNode.insertBefore(span, node.parentNode.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling)); + node.nodeValue = val.substr(0, pos); + if (isInSVG) { + var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect"); + var bbox = node.parentElement.getBBox(); + rect.x.baseVal.value = bbox.x; + rect.y.baseVal.value = bbox.y; + rect.width.baseVal.value = bbox.width; + rect.height.baseVal.value = bbox.height; + rect.setAttribute('class', className); + addItems.push({ + "parent": node.parentNode, + "target": rect}); + } + } + } + else if (!jQuery(node).is("button, select, textarea")) { + jQuery.each(node.childNodes, function() { + highlight(this, addItems); + }); + } + } + var addItems = []; + var result = this.each(function() { + highlight(this, addItems); + }); + for (var i = 0; i < addItems.length; ++i) { + jQuery(addItems[i].parent).before(addItems[i].target); + } + return result; +}; + +/* + * backward compatibility for jQuery.browser + * This will be supported until firefox bug is fixed. + */ +if (!jQuery.browser) { + jQuery.uaMatch = function(ua) { + ua = ua.toLowerCase(); + + var match = /(chrome)[ \/]([\w.]+)/.exec(ua) || + /(webkit)[ \/]([\w.]+)/.exec(ua) || + /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) || + /(msie) ([\w.]+)/.exec(ua) || + ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) || + []; + + return { + browser: match[ 1 ] || "", + version: match[ 2 ] || "0" + }; + }; + jQuery.browser = {}; + jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true; +} diff --git a/docs/_static/basic.css b/docs/_static/basic.css new file mode 100644 index 0000000..4e9a9f1 --- /dev/null +++ b/docs/_static/basic.css @@ -0,0 +1,900 @@ +/* + * basic.css + * ~~~~~~~~~ + * + * Sphinx stylesheet -- basic theme. + * + * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/* -- main layout ----------------------------------------------------------- */ + +div.clearer { + clear: both; +} + +div.section::after { + display: block; + content: ''; + clear: left; +} + +/* -- relbar ---------------------------------------------------------------- */ + +div.related { + width: 100%; + font-size: 90%; +} + +div.related h3 { + display: none; +} + +div.related ul { + margin: 0; + padding: 0 0 0 10px; + list-style: none; +} + +div.related li { + display: inline; +} + +div.related li.right { + float: right; + margin-right: 5px; +} + +/* -- sidebar --------------------------------------------------------------- */ + +div.sphinxsidebarwrapper { + padding: 10px 5px 0 10px; +} + +div.sphinxsidebar { + float: left; + width: 230px; + margin-left: -100%; + font-size: 90%; + word-wrap: break-word; + overflow-wrap : break-word; +} + +div.sphinxsidebar ul { + list-style: none; +} + +div.sphinxsidebar ul ul, +div.sphinxsidebar ul.want-points { + margin-left: 20px; + list-style: square; +} + +div.sphinxsidebar ul ul { + margin-top: 0; + margin-bottom: 0; +} + +div.sphinxsidebar form { + margin-top: 10px; +} + +div.sphinxsidebar input { + border: 1px solid #98dbcc; + font-family: sans-serif; + font-size: 1em; +} + +div.sphinxsidebar #searchbox form.search { + overflow: hidden; +} + +div.sphinxsidebar #searchbox input[type="text"] { + float: left; + width: 80%; + padding: 0.25em; + box-sizing: border-box; +} + +div.sphinxsidebar #searchbox input[type="submit"] { + float: left; + width: 20%; + border-left: none; + padding: 0.25em; + box-sizing: border-box; +} + + +img { + border: 0; + max-width: 100%; +} + +/* -- search page ----------------------------------------------------------- */ + +ul.search { + margin: 10px 0 0 20px; + padding: 0; +} + +ul.search li { + padding: 5px 0 5px 20px; + background-image: url(file.png); + background-repeat: no-repeat; + background-position: 0 7px; +} + +ul.search li a { + font-weight: bold; +} + +ul.search li p.context { + color: #888; + margin: 2px 0 0 30px; + text-align: left; +} + +ul.keywordmatches li.goodmatch a { + font-weight: bold; +} + +/* -- index page ------------------------------------------------------------ */ + +table.contentstable { + width: 90%; + margin-left: auto; + margin-right: auto; +} + +table.contentstable p.biglink { + line-height: 150%; +} + +a.biglink { + font-size: 1.3em; +} + +span.linkdescr { + font-style: italic; + padding-top: 5px; + font-size: 90%; +} + +/* -- general index --------------------------------------------------------- */ + +table.indextable { + width: 100%; +} + +table.indextable td { + text-align: left; + vertical-align: top; +} + +table.indextable ul { + margin-top: 0; + margin-bottom: 0; + list-style-type: none; +} + +table.indextable > tbody > tr > td > ul { + padding-left: 0em; +} + +table.indextable tr.pcap { + height: 10px; +} + +table.indextable tr.cap { + margin-top: 10px; + background-color: #f2f2f2; +} + +img.toggler { + margin-right: 3px; + margin-top: 3px; + cursor: pointer; +} + +div.modindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +div.genindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +/* -- domain module index --------------------------------------------------- */ + +table.modindextable td { + padding: 2px; + border-collapse: collapse; +} + +/* -- general body styles --------------------------------------------------- */ + +div.body { + min-width: 360px; + max-width: 800px; +} + +div.body p, div.body dd, div.body li, div.body blockquote { + -moz-hyphens: auto; + -ms-hyphens: auto; + -webkit-hyphens: auto; + hyphens: auto; +} + +a.headerlink { + visibility: hidden; +} + +h1:hover > a.headerlink, +h2:hover > a.headerlink, +h3:hover > a.headerlink, +h4:hover > a.headerlink, +h5:hover > a.headerlink, +h6:hover > a.headerlink, +dt:hover > a.headerlink, +caption:hover > a.headerlink, +p.caption:hover > a.headerlink, +div.code-block-caption:hover > a.headerlink { + visibility: visible; +} + +div.body p.caption { + text-align: inherit; +} + +div.body td { + text-align: left; +} + +.first { + margin-top: 0 !important; +} + +p.rubric { + margin-top: 30px; + font-weight: bold; +} + +img.align-left, figure.align-left, .figure.align-left, object.align-left { + clear: left; + float: left; + margin-right: 1em; +} + +img.align-right, figure.align-right, .figure.align-right, object.align-right { + clear: right; + float: right; + margin-left: 1em; +} + +img.align-center, figure.align-center, .figure.align-center, object.align-center { + display: block; + margin-left: auto; + margin-right: auto; +} + +img.align-default, figure.align-default, .figure.align-default { + display: block; + margin-left: auto; + margin-right: auto; +} + +.align-left { + text-align: left; +} + +.align-center { + text-align: center; +} + +.align-default { + text-align: center; +} + +.align-right { + text-align: right; +} + +/* -- sidebars -------------------------------------------------------------- */ + +div.sidebar, +aside.sidebar { + margin: 0 0 0.5em 1em; + border: 1px solid #ddb; + padding: 7px; + background-color: #ffe; + width: 40%; + float: right; + clear: right; + overflow-x: auto; +} + +p.sidebar-title { + font-weight: bold; +} +nav.contents, +aside.topic, +div.admonition, div.topic, blockquote { + clear: left; +} + +/* -- topics ---------------------------------------------------------------- */ +nav.contents, +aside.topic, +div.topic { + border: 1px solid #ccc; + padding: 7px; + margin: 10px 0 10px 0; +} + +p.topic-title { + font-size: 1.1em; + font-weight: bold; + margin-top: 10px; +} + +/* -- admonitions ----------------------------------------------------------- */ + +div.admonition { + margin-top: 10px; + margin-bottom: 10px; + padding: 7px; +} + +div.admonition dt { + font-weight: bold; +} + +p.admonition-title { + margin: 0px 10px 5px 0px; + font-weight: bold; +} + +div.body p.centered { + text-align: center; + margin-top: 25px; +} + +/* -- content of sidebars/topics/admonitions -------------------------------- */ + +div.sidebar > :last-child, +aside.sidebar > :last-child, +nav.contents > :last-child, +aside.topic > :last-child, +div.topic > :last-child, +div.admonition > :last-child { + margin-bottom: 0; +} + +div.sidebar::after, +aside.sidebar::after, +nav.contents::after, +aside.topic::after, +div.topic::after, +div.admonition::after, +blockquote::after { + display: block; + content: ''; + clear: both; +} + +/* -- tables ---------------------------------------------------------------- */ + +table.docutils { + margin-top: 10px; + margin-bottom: 10px; + border: 0; + border-collapse: collapse; +} + +table.align-center { + margin-left: auto; + margin-right: auto; +} + +table.align-default { + margin-left: auto; + margin-right: auto; +} + +table caption span.caption-number { + font-style: italic; +} + +table caption span.caption-text { +} + +table.docutils td, table.docutils th { + padding: 1px 8px 1px 5px; + border-top: 0; + border-left: 0; + border-right: 0; + border-bottom: 1px solid #aaa; +} + +th { + text-align: left; + padding-right: 5px; +} + +table.citation { + border-left: solid 1px gray; + margin-left: 1px; +} + +table.citation td { + border-bottom: none; +} + +th > :first-child, +td > :first-child { + margin-top: 0px; +} + +th > :last-child, +td > :last-child { + margin-bottom: 0px; +} + +/* -- figures --------------------------------------------------------------- */ + +div.figure, figure { + margin: 0.5em; + padding: 0.5em; +} + +div.figure p.caption, figcaption { + padding: 0.3em; +} + +div.figure p.caption span.caption-number, +figcaption span.caption-number { + font-style: italic; +} + +div.figure p.caption span.caption-text, +figcaption span.caption-text { +} + +/* -- field list styles ----------------------------------------------------- */ + +table.field-list td, table.field-list th { + border: 0 !important; +} + +.field-list ul { + margin: 0; + padding-left: 1em; +} + +.field-list p { + margin: 0; +} + +.field-name { + -moz-hyphens: manual; + -ms-hyphens: manual; + -webkit-hyphens: manual; + hyphens: manual; +} + +/* -- hlist styles ---------------------------------------------------------- */ + +table.hlist { + margin: 1em 0; +} + +table.hlist td { + vertical-align: top; +} + +/* -- object description styles --------------------------------------------- */ + +.sig { + font-family: 'Consolas', 'Menlo', 'DejaVu Sans Mono', 'Bitstream Vera Sans Mono', monospace; +} + +.sig-name, code.descname { + background-color: transparent; + font-weight: bold; +} + +.sig-name { + font-size: 1.1em; +} + +code.descname { + font-size: 1.2em; +} + +.sig-prename, code.descclassname { + background-color: transparent; +} + +.optional { + font-size: 1.3em; +} + +.sig-paren { + font-size: larger; +} + +.sig-param.n { + font-style: italic; +} + +/* C++ specific styling */ + +.sig-inline.c-texpr, +.sig-inline.cpp-texpr { + font-family: unset; +} + +.sig.c .k, .sig.c .kt, +.sig.cpp .k, .sig.cpp .kt { + color: #0033B3; +} + +.sig.c .m, +.sig.cpp .m { + color: #1750EB; +} + +.sig.c .s, .sig.c .sc, +.sig.cpp .s, .sig.cpp .sc { + color: #067D17; +} + + +/* -- other body styles ----------------------------------------------------- */ + +ol.arabic { + list-style: decimal; +} + +ol.loweralpha { + list-style: lower-alpha; +} + +ol.upperalpha { + list-style: upper-alpha; +} + +ol.lowerroman { + list-style: lower-roman; +} + +ol.upperroman { + list-style: upper-roman; +} + +:not(li) > ol > li:first-child > :first-child, +:not(li) > ul > li:first-child > :first-child { + margin-top: 0px; +} + +:not(li) > ol > li:last-child > :last-child, +:not(li) > ul > li:last-child > :last-child { + margin-bottom: 0px; +} + +ol.simple ol p, +ol.simple ul p, +ul.simple ol p, +ul.simple ul p { + margin-top: 0; +} + +ol.simple > li:not(:first-child) > p, +ul.simple > li:not(:first-child) > p { + margin-top: 0; +} + +ol.simple p, +ul.simple p { + margin-bottom: 0; +} +aside.footnote > span, +div.citation > span { + float: left; +} +aside.footnote > span:last-of-type, +div.citation > span:last-of-type { + padding-right: 0.5em; +} +aside.footnote > p { + margin-left: 2em; +} +div.citation > p { + margin-left: 4em; +} +aside.footnote > p:last-of-type, +div.citation > p:last-of-type { + margin-bottom: 0em; +} +aside.footnote > p:last-of-type:after, +div.citation > p:last-of-type:after { + content: ""; + clear: both; +} + +dl.field-list { + display: grid; + grid-template-columns: fit-content(30%) auto; +} + +dl.field-list > dt { + font-weight: bold; + word-break: break-word; + padding-left: 0.5em; + padding-right: 5px; +} + +dl.field-list > dd { + padding-left: 0.5em; + margin-top: 0em; + margin-left: 0em; + margin-bottom: 0em; +} + +dl { + margin-bottom: 15px; +} + +dd > :first-child { + margin-top: 0px; +} + +dd ul, dd table { + margin-bottom: 10px; +} + +dd { + margin-top: 3px; + margin-bottom: 10px; + margin-left: 30px; +} + +dl > dd:last-child, +dl > dd:last-child > :last-child { + margin-bottom: 0; +} + +dt:target, span.highlighted { + background-color: #fbe54e; +} + +rect.highlighted { + fill: #fbe54e; +} + +dl.glossary dt { + font-weight: bold; + font-size: 1.1em; +} + +.versionmodified { + font-style: italic; +} + +.system-message { + background-color: #fda; + padding: 5px; + border: 3px solid red; +} + +.footnote:target { + background-color: #ffa; +} + +.line-block { + display: block; + margin-top: 1em; + margin-bottom: 1em; +} + +.line-block .line-block { + margin-top: 0; + margin-bottom: 0; + margin-left: 1.5em; +} + +.guilabel, .menuselection { + font-family: sans-serif; +} + +.accelerator { + text-decoration: underline; +} + +.classifier { + font-style: oblique; +} + +.classifier:before { + font-style: normal; + margin: 0 0.5em; + content: ":"; + display: inline-block; +} + +abbr, acronym { + border-bottom: dotted 1px; + cursor: help; +} + +/* -- code displays --------------------------------------------------------- */ + +pre { + overflow: auto; + overflow-y: hidden; /* fixes display issues on Chrome browsers */ +} + +pre, div[class*="highlight-"] { + clear: both; +} + +span.pre { + -moz-hyphens: none; + -ms-hyphens: none; + -webkit-hyphens: none; + hyphens: none; + white-space: nowrap; +} + +div[class*="highlight-"] { + margin: 1em 0; +} + +td.linenos pre { + border: 0; + background-color: transparent; + color: #aaa; +} + +table.highlighttable { + display: block; +} + +table.highlighttable tbody { + display: block; +} + +table.highlighttable tr { + display: flex; +} + +table.highlighttable td { + margin: 0; + padding: 0; +} + +table.highlighttable td.linenos { + padding-right: 0.5em; +} + +table.highlighttable td.code { + flex: 1; + overflow: hidden; +} + +.highlight .hll { + display: block; +} + +div.highlight pre, +table.highlighttable pre { + margin: 0; +} + +div.code-block-caption + div { + margin-top: 0; +} + +div.code-block-caption { + margin-top: 1em; + padding: 2px 5px; + font-size: small; +} + +div.code-block-caption code { + background-color: transparent; +} + +table.highlighttable td.linenos, +span.linenos, +div.highlight span.gp { /* gp: Generic.Prompt */ + user-select: none; + -webkit-user-select: text; /* Safari fallback only */ + -webkit-user-select: none; /* Chrome/Safari */ + -moz-user-select: none; /* Firefox */ + -ms-user-select: none; /* IE10+ */ +} + +div.code-block-caption span.caption-number { + padding: 0.1em 0.3em; + font-style: italic; +} + +div.code-block-caption span.caption-text { +} + +div.literal-block-wrapper { + margin: 1em 0; +} + +code.xref, a code { + background-color: transparent; + font-weight: bold; +} + +h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { + background-color: transparent; +} + +.viewcode-link { + float: right; +} + +.viewcode-back { + float: right; + font-family: sans-serif; +} + +div.viewcode-block:target { + margin: -1px -10px; + padding: 0 10px; +} + +/* -- math display ---------------------------------------------------------- */ + +img.math { + vertical-align: middle; +} + +div.body div.math p { + text-align: center; +} + +span.eqno { + float: right; +} + +span.eqno a.headerlink { + position: absolute; + z-index: 1; +} + +div.math:hover a.headerlink { + visibility: visible; +} + +/* -- printout stylesheet --------------------------------------------------- */ + +@media print { + div.document, + div.documentwrapper, + div.bodywrapper { + margin: 0 !important; + width: 100%; + } + + div.sphinxsidebar, + div.related, + div.footer, + #top-link { + display: none; + } +} \ No newline at end of file diff --git a/docs/_static/css/badge_only.css b/docs/_static/css/badge_only.css new file mode 100644 index 0000000..c718cee --- /dev/null +++ b/docs/_static/css/badge_only.css @@ -0,0 +1 @@ +.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}@font-face{font-family:FontAwesome;font-style:normal;font-weight:400;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#FontAwesome) format("svg")}.fa:before{font-family:FontAwesome;font-style:normal;font-weight:400;line-height:1}.fa:before,a .fa{text-decoration:inherit}.fa:before,a .fa,li .fa{display:inline-block}li .fa-large:before{width:1.875em}ul.fas{list-style-type:none;margin-left:2em;text-indent:-.8em}ul.fas li .fa{width:.8em}ul.fas li .fa-large:before{vertical-align:baseline}.fa-book:before,.icon-book:before{content:"\f02d"}.fa-caret-down:before,.icon-caret-down:before{content:"\f0d7"}.fa-caret-up:before,.icon-caret-up:before{content:"\f0d8"}.fa-caret-left:before,.icon-caret-left:before{content:"\f0d9"}.fa-caret-right:before,.icon-caret-right:before{content:"\f0da"}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60}.rst-versions .rst-current-version:after{clear:both;content:"";display:block}.rst-versions .rst-current-version .fa{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}} \ No newline at end of file diff --git a/docs/_static/css/fonts/Roboto-Slab-Bold.woff b/docs/_static/css/fonts/Roboto-Slab-Bold.woff new file mode 100644 index 0000000..6cb6000 Binary files /dev/null and b/docs/_static/css/fonts/Roboto-Slab-Bold.woff differ diff --git a/docs/_static/css/fonts/Roboto-Slab-Bold.woff2 b/docs/_static/css/fonts/Roboto-Slab-Bold.woff2 new file mode 100644 index 0000000..7059e23 Binary files /dev/null and b/docs/_static/css/fonts/Roboto-Slab-Bold.woff2 differ diff --git a/docs/_static/css/fonts/Roboto-Slab-Regular.woff b/docs/_static/css/fonts/Roboto-Slab-Regular.woff new file mode 100644 index 0000000..f815f63 Binary files /dev/null and b/docs/_static/css/fonts/Roboto-Slab-Regular.woff differ diff --git a/docs/_static/css/fonts/Roboto-Slab-Regular.woff2 b/docs/_static/css/fonts/Roboto-Slab-Regular.woff2 new file mode 100644 index 0000000..f2c76e5 Binary files /dev/null and b/docs/_static/css/fonts/Roboto-Slab-Regular.woff2 differ diff --git a/docs/_static/css/fonts/fontawesome-webfont.eot b/docs/_static/css/fonts/fontawesome-webfont.eot new file mode 100644 index 0000000..e9f60ca Binary files /dev/null and b/docs/_static/css/fonts/fontawesome-webfont.eot differ diff --git a/docs/_static/css/fonts/fontawesome-webfont.svg b/docs/_static/css/fonts/fontawesome-webfont.svg new file mode 100644 index 0000000..855c845 --- /dev/null +++ b/docs/_static/css/fonts/fontawesome-webfont.svg @@ -0,0 +1,2671 @@ + + + + +Created by FontForge 20120731 at Mon Oct 24 17:37:40 2016 + By ,,, +Copyright Dave Gandy 2016. All rights reserved. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/docs/_static/css/fonts/fontawesome-webfont.ttf b/docs/_static/css/fonts/fontawesome-webfont.ttf new file mode 100644 index 0000000..35acda2 Binary files /dev/null and b/docs/_static/css/fonts/fontawesome-webfont.ttf differ diff --git a/docs/_static/css/fonts/fontawesome-webfont.woff b/docs/_static/css/fonts/fontawesome-webfont.woff new file mode 100644 index 0000000..400014a Binary files /dev/null and b/docs/_static/css/fonts/fontawesome-webfont.woff differ diff --git a/docs/_static/css/fonts/fontawesome-webfont.woff2 b/docs/_static/css/fonts/fontawesome-webfont.woff2 new file mode 100644 index 0000000..4d13fc6 Binary files /dev/null and b/docs/_static/css/fonts/fontawesome-webfont.woff2 differ diff --git a/docs/_static/css/fonts/lato-bold-italic.woff b/docs/_static/css/fonts/lato-bold-italic.woff new file mode 100644 index 0000000..88ad05b Binary files /dev/null and b/docs/_static/css/fonts/lato-bold-italic.woff differ diff --git a/docs/_static/css/fonts/lato-bold-italic.woff2 b/docs/_static/css/fonts/lato-bold-italic.woff2 new file mode 100644 index 0000000..c4e3d80 Binary files /dev/null and b/docs/_static/css/fonts/lato-bold-italic.woff2 differ diff --git a/docs/_static/css/fonts/lato-bold.woff b/docs/_static/css/fonts/lato-bold.woff new file mode 100644 index 0000000..c6dff51 Binary files /dev/null and b/docs/_static/css/fonts/lato-bold.woff differ diff --git a/docs/_static/css/fonts/lato-bold.woff2 b/docs/_static/css/fonts/lato-bold.woff2 new file mode 100644 index 0000000..bb19504 Binary files /dev/null and b/docs/_static/css/fonts/lato-bold.woff2 differ diff --git a/docs/_static/css/fonts/lato-normal-italic.woff b/docs/_static/css/fonts/lato-normal-italic.woff new file mode 100644 index 0000000..76114bc Binary files /dev/null and b/docs/_static/css/fonts/lato-normal-italic.woff differ diff --git a/docs/_static/css/fonts/lato-normal-italic.woff2 b/docs/_static/css/fonts/lato-normal-italic.woff2 new file mode 100644 index 0000000..3404f37 Binary files /dev/null and b/docs/_static/css/fonts/lato-normal-italic.woff2 differ diff --git a/docs/_static/css/fonts/lato-normal.woff b/docs/_static/css/fonts/lato-normal.woff new file mode 100644 index 0000000..ae1307f Binary files /dev/null and b/docs/_static/css/fonts/lato-normal.woff differ diff --git a/docs/_static/css/fonts/lato-normal.woff2 b/docs/_static/css/fonts/lato-normal.woff2 new file mode 100644 index 0000000..3bf9843 Binary files /dev/null and b/docs/_static/css/fonts/lato-normal.woff2 differ diff --git a/docs/_static/css/theme.css b/docs/_static/css/theme.css new file mode 100644 index 0000000..19a446a --- /dev/null +++ b/docs/_static/css/theme.css @@ -0,0 +1,4 @@ +html{box-sizing:border-box}*,:after,:before{box-sizing:inherit}article,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block}audio,canvas,video{display:inline-block;*display:inline;*zoom:1}[hidden],audio:not([controls]){display:none}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}blockquote{margin:0}dfn{font-style:italic}ins{background:#ff9;text-decoration:none}ins,mark{color:#000}mark{background:#ff0;font-style:italic;font-weight:700}.rst-content code,.rst-content tt,code,kbd,pre,samp{font-family:monospace,serif;_font-family:courier new,monospace;font-size:1em}pre{white-space:pre}q{quotes:none}q:after,q:before{content:"";content:none}small{font-size:85%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}dl,ol,ul{margin:0;padding:0;list-style:none;list-style-image:none}li{list-style:none}dd{margin:0}img{border:0;-ms-interpolation-mode:bicubic;vertical-align:middle;max-width:100%}svg:not(:root){overflow:hidden}figure,form{margin:0}label{cursor:pointer}button,input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}button,input{line-height:normal}button,input[type=button],input[type=reset],input[type=submit]{cursor:pointer;-webkit-appearance:button;*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=search]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}textarea{resize:vertical}table{border-collapse:collapse;border-spacing:0}td{vertical-align:top}.chromeframe{margin:.2em 0;background:#ccc;color:#000;padding:.2em 0}.ir{display:block;border:0;text-indent:-999em;overflow:hidden;background-color:transparent;background-repeat:no-repeat;text-align:left;direction:ltr;*line-height:0}.ir br{display:none}.hidden{display:none!important;visibility:hidden}.visuallyhidden{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.visuallyhidden.focusable:active,.visuallyhidden.focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}.invisible{visibility:hidden}.relative{position:relative}big,small{font-size:100%}@media print{body,html,section{background:none!important}*{box-shadow:none!important;text-shadow:none!important;filter:none!important;-ms-filter:none!important}a,a:visited{text-decoration:underline}.ir a:after,a[href^="#"]:after,a[href^="javascript:"]:after{content:""}blockquote,pre{page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}img{max-width:100%!important}@page{margin:.5cm}.rst-content .toctree-wrapper>p.caption,h2,h3,p{orphans:3;widows:3}.rst-content .toctree-wrapper>p.caption,h2,h3{page-break-after:avoid}}.btn,.fa:before,.icon:before,.rst-content .admonition,.rst-content .admonition-title:before,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .code-block-caption .headerlink:before,.rst-content .danger,.rst-content .eqno .headerlink:before,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content p .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-alert,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before,.wy-menu-vertical li button.toctree-expand:before,input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week],select,textarea{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}/*! + * Font Awesome 4.7.0 by @davegandy - http://fontawesome.io - @fontawesome + * License - http://fontawesome.io/license (Font: SIL OFL 1.1, CSS: MIT License) + */@font-face{font-family:FontAwesome;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713);src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix&v=4.7.0) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#fontawesomeregular) format("svg");font-weight:400;font-style:normal}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li button.toctree-expand{display:inline-block;font:normal normal normal 14px/1 FontAwesome;font-size:inherit;text-rendering:auto;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.fa-lg{font-size:1.33333em;line-height:.75em;vertical-align:-15%}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-fw{width:1.28571em;text-align:center}.fa-ul{padding-left:0;margin-left:2.14286em;list-style-type:none}.fa-ul>li{position:relative}.fa-li{position:absolute;left:-2.14286em;width:2.14286em;top:.14286em;text-align:center}.fa-li.fa-lg{left:-1.85714em}.fa-border{padding:.2em .25em .15em;border:.08em solid #eee;border-radius:.1em}.fa-pull-left{float:left}.fa-pull-right{float:right}.fa-pull-left.icon,.fa.fa-pull-left,.rst-content .code-block-caption .fa-pull-left.headerlink,.rst-content .eqno .fa-pull-left.headerlink,.rst-content .fa-pull-left.admonition-title,.rst-content code.download span.fa-pull-left:first-child,.rst-content dl dt .fa-pull-left.headerlink,.rst-content h1 .fa-pull-left.headerlink,.rst-content h2 .fa-pull-left.headerlink,.rst-content h3 .fa-pull-left.headerlink,.rst-content h4 .fa-pull-left.headerlink,.rst-content h5 .fa-pull-left.headerlink,.rst-content h6 .fa-pull-left.headerlink,.rst-content p .fa-pull-left.headerlink,.rst-content table>caption .fa-pull-left.headerlink,.rst-content tt.download span.fa-pull-left:first-child,.wy-menu-vertical li.current>a button.fa-pull-left.toctree-expand,.wy-menu-vertical li.on a button.fa-pull-left.toctree-expand,.wy-menu-vertical li button.fa-pull-left.toctree-expand{margin-right:.3em}.fa-pull-right.icon,.fa.fa-pull-right,.rst-content .code-block-caption .fa-pull-right.headerlink,.rst-content .eqno .fa-pull-right.headerlink,.rst-content .fa-pull-right.admonition-title,.rst-content code.download span.fa-pull-right:first-child,.rst-content dl dt .fa-pull-right.headerlink,.rst-content h1 .fa-pull-right.headerlink,.rst-content h2 .fa-pull-right.headerlink,.rst-content h3 .fa-pull-right.headerlink,.rst-content h4 .fa-pull-right.headerlink,.rst-content h5 .fa-pull-right.headerlink,.rst-content h6 .fa-pull-right.headerlink,.rst-content p .fa-pull-right.headerlink,.rst-content table>caption .fa-pull-right.headerlink,.rst-content tt.download span.fa-pull-right:first-child,.wy-menu-vertical li.current>a button.fa-pull-right.toctree-expand,.wy-menu-vertical li.on a button.fa-pull-right.toctree-expand,.wy-menu-vertical li button.fa-pull-right.toctree-expand{margin-left:.3em}.pull-right{float:right}.pull-left{float:left}.fa.pull-left,.pull-left.icon,.rst-content .code-block-caption .pull-left.headerlink,.rst-content .eqno .pull-left.headerlink,.rst-content .pull-left.admonition-title,.rst-content code.download span.pull-left:first-child,.rst-content dl dt .pull-left.headerlink,.rst-content h1 .pull-left.headerlink,.rst-content h2 .pull-left.headerlink,.rst-content h3 .pull-left.headerlink,.rst-content h4 .pull-left.headerlink,.rst-content h5 .pull-left.headerlink,.rst-content h6 .pull-left.headerlink,.rst-content p .pull-left.headerlink,.rst-content table>caption .pull-left.headerlink,.rst-content tt.download span.pull-left:first-child,.wy-menu-vertical li.current>a button.pull-left.toctree-expand,.wy-menu-vertical li.on a button.pull-left.toctree-expand,.wy-menu-vertical li button.pull-left.toctree-expand{margin-right:.3em}.fa.pull-right,.pull-right.icon,.rst-content .code-block-caption .pull-right.headerlink,.rst-content .eqno .pull-right.headerlink,.rst-content .pull-right.admonition-title,.rst-content code.download span.pull-right:first-child,.rst-content dl dt .pull-right.headerlink,.rst-content h1 .pull-right.headerlink,.rst-content h2 .pull-right.headerlink,.rst-content h3 .pull-right.headerlink,.rst-content h4 .pull-right.headerlink,.rst-content h5 .pull-right.headerlink,.rst-content h6 .pull-right.headerlink,.rst-content p .pull-right.headerlink,.rst-content table>caption .pull-right.headerlink,.rst-content tt.download span.pull-right:first-child,.wy-menu-vertical li.current>a button.pull-right.toctree-expand,.wy-menu-vertical li.on a button.pull-right.toctree-expand,.wy-menu-vertical li button.pull-right.toctree-expand{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}.fa-rotate-90{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)";-webkit-transform:rotate(90deg);-ms-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)";-webkit-transform:rotate(180deg);-ms-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)";-webkit-transform:rotate(270deg);-ms-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);-ms-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)";-webkit-transform:scaleY(-1);-ms-transform:scaleY(-1);transform:scaleY(-1)}:root .fa-flip-horizontal,:root .fa-flip-vertical,:root .fa-rotate-90,:root .fa-rotate-180,:root .fa-rotate-270{filter:none}.fa-stack{position:relative;display:inline-block;width:2em;height:2em;line-height:2em;vertical-align:middle}.fa-stack-1x,.fa-stack-2x{position:absolute;left:0;width:100%;text-align:center}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-glass:before{content:""}.fa-music:before{content:""}.fa-search:before,.icon-search:before{content:""}.fa-envelope-o:before{content:""}.fa-heart:before{content:""}.fa-star:before{content:""}.fa-star-o:before{content:""}.fa-user:before{content:""}.fa-film:before{content:""}.fa-th-large:before{content:""}.fa-th:before{content:""}.fa-th-list:before{content:""}.fa-check:before{content:""}.fa-close:before,.fa-remove:before,.fa-times:before{content:""}.fa-search-plus:before{content:""}.fa-search-minus:before{content:""}.fa-power-off:before{content:""}.fa-signal:before{content:""}.fa-cog:before,.fa-gear:before{content:""}.fa-trash-o:before{content:""}.fa-home:before,.icon-home:before{content:""}.fa-file-o:before{content:""}.fa-clock-o:before{content:""}.fa-road:before{content:""}.fa-download:before,.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{content:""}.fa-arrow-circle-o-down:before{content:""}.fa-arrow-circle-o-up:before{content:""}.fa-inbox:before{content:""}.fa-play-circle-o:before{content:""}.fa-repeat:before,.fa-rotate-right:before{content:""}.fa-refresh:before{content:""}.fa-list-alt:before{content:""}.fa-lock:before{content:""}.fa-flag:before{content:""}.fa-headphones:before{content:""}.fa-volume-off:before{content:""}.fa-volume-down:before{content:""}.fa-volume-up:before{content:""}.fa-qrcode:before{content:""}.fa-barcode:before{content:""}.fa-tag:before{content:""}.fa-tags:before{content:""}.fa-book:before,.icon-book:before{content:""}.fa-bookmark:before{content:""}.fa-print:before{content:""}.fa-camera:before{content:""}.fa-font:before{content:""}.fa-bold:before{content:""}.fa-italic:before{content:""}.fa-text-height:before{content:""}.fa-text-width:before{content:""}.fa-align-left:before{content:""}.fa-align-center:before{content:""}.fa-align-right:before{content:""}.fa-align-justify:before{content:""}.fa-list:before{content:""}.fa-dedent:before,.fa-outdent:before{content:""}.fa-indent:before{content:""}.fa-video-camera:before{content:""}.fa-image:before,.fa-photo:before,.fa-picture-o:before{content:""}.fa-pencil:before{content:""}.fa-map-marker:before{content:""}.fa-adjust:before{content:""}.fa-tint:before{content:""}.fa-edit:before,.fa-pencil-square-o:before{content:""}.fa-share-square-o:before{content:""}.fa-check-square-o:before{content:""}.fa-arrows:before{content:""}.fa-step-backward:before{content:""}.fa-fast-backward:before{content:""}.fa-backward:before{content:""}.fa-play:before{content:""}.fa-pause:before{content:""}.fa-stop:before{content:""}.fa-forward:before{content:""}.fa-fast-forward:before{content:""}.fa-step-forward:before{content:""}.fa-eject:before{content:""}.fa-chevron-left:before{content:""}.fa-chevron-right:before{content:""}.fa-plus-circle:before{content:""}.fa-minus-circle:before{content:""}.fa-times-circle:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before{content:""}.fa-check-circle:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before{content:""}.fa-question-circle:before{content:""}.fa-info-circle:before{content:""}.fa-crosshairs:before{content:""}.fa-times-circle-o:before{content:""}.fa-check-circle-o:before{content:""}.fa-ban:before{content:""}.fa-arrow-left:before{content:""}.fa-arrow-right:before{content:""}.fa-arrow-up:before{content:""}.fa-arrow-down:before{content:""}.fa-mail-forward:before,.fa-share:before{content:""}.fa-expand:before{content:""}.fa-compress:before{content:""}.fa-plus:before{content:""}.fa-minus:before{content:""}.fa-asterisk:before{content:""}.fa-exclamation-circle:before,.rst-content .admonition-title:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before{content:""}.fa-gift:before{content:""}.fa-leaf:before{content:""}.fa-fire:before,.icon-fire:before{content:""}.fa-eye:before{content:""}.fa-eye-slash:before{content:""}.fa-exclamation-triangle:before,.fa-warning:before{content:""}.fa-plane:before{content:""}.fa-calendar:before{content:""}.fa-random:before{content:""}.fa-comment:before{content:""}.fa-magnet:before{content:""}.fa-chevron-up:before{content:""}.fa-chevron-down:before{content:""}.fa-retweet:before{content:""}.fa-shopping-cart:before{content:""}.fa-folder:before{content:""}.fa-folder-open:before{content:""}.fa-arrows-v:before{content:""}.fa-arrows-h:before{content:""}.fa-bar-chart-o:before,.fa-bar-chart:before{content:""}.fa-twitter-square:before{content:""}.fa-facebook-square:before{content:""}.fa-camera-retro:before{content:""}.fa-key:before{content:""}.fa-cogs:before,.fa-gears:before{content:""}.fa-comments:before{content:""}.fa-thumbs-o-up:before{content:""}.fa-thumbs-o-down:before{content:""}.fa-star-half:before{content:""}.fa-heart-o:before{content:""}.fa-sign-out:before{content:""}.fa-linkedin-square:before{content:""}.fa-thumb-tack:before{content:""}.fa-external-link:before{content:""}.fa-sign-in:before{content:""}.fa-trophy:before{content:""}.fa-github-square:before{content:""}.fa-upload:before{content:""}.fa-lemon-o:before{content:""}.fa-phone:before{content:""}.fa-square-o:before{content:""}.fa-bookmark-o:before{content:""}.fa-phone-square:before{content:""}.fa-twitter:before{content:""}.fa-facebook-f:before,.fa-facebook:before{content:""}.fa-github:before,.icon-github:before{content:""}.fa-unlock:before{content:""}.fa-credit-card:before{content:""}.fa-feed:before,.fa-rss:before{content:""}.fa-hdd-o:before{content:""}.fa-bullhorn:before{content:""}.fa-bell:before{content:""}.fa-certificate:before{content:""}.fa-hand-o-right:before{content:""}.fa-hand-o-left:before{content:""}.fa-hand-o-up:before{content:""}.fa-hand-o-down:before{content:""}.fa-arrow-circle-left:before,.icon-circle-arrow-left:before{content:""}.fa-arrow-circle-right:before,.icon-circle-arrow-right:before{content:""}.fa-arrow-circle-up:before{content:""}.fa-arrow-circle-down:before{content:""}.fa-globe:before{content:""}.fa-wrench:before{content:""}.fa-tasks:before{content:""}.fa-filter:before{content:""}.fa-briefcase:before{content:""}.fa-arrows-alt:before{content:""}.fa-group:before,.fa-users:before{content:""}.fa-chain:before,.fa-link:before,.icon-link:before{content:""}.fa-cloud:before{content:""}.fa-flask:before{content:""}.fa-cut:before,.fa-scissors:before{content:""}.fa-copy:before,.fa-files-o:before{content:""}.fa-paperclip:before{content:""}.fa-floppy-o:before,.fa-save:before{content:""}.fa-square:before{content:""}.fa-bars:before,.fa-navicon:before,.fa-reorder:before{content:""}.fa-list-ul:before{content:""}.fa-list-ol:before{content:""}.fa-strikethrough:before{content:""}.fa-underline:before{content:""}.fa-table:before{content:""}.fa-magic:before{content:""}.fa-truck:before{content:""}.fa-pinterest:before{content:""}.fa-pinterest-square:before{content:""}.fa-google-plus-square:before{content:""}.fa-google-plus:before{content:""}.fa-money:before{content:""}.fa-caret-down:before,.icon-caret-down:before,.wy-dropdown .caret:before{content:""}.fa-caret-up:before{content:""}.fa-caret-left:before{content:""}.fa-caret-right:before{content:""}.fa-columns:before{content:""}.fa-sort:before,.fa-unsorted:before{content:""}.fa-sort-desc:before,.fa-sort-down:before{content:""}.fa-sort-asc:before,.fa-sort-up:before{content:""}.fa-envelope:before{content:""}.fa-linkedin:before{content:""}.fa-rotate-left:before,.fa-undo:before{content:""}.fa-gavel:before,.fa-legal:before{content:""}.fa-dashboard:before,.fa-tachometer:before{content:""}.fa-comment-o:before{content:""}.fa-comments-o:before{content:""}.fa-bolt:before,.fa-flash:before{content:""}.fa-sitemap:before{content:""}.fa-umbrella:before{content:""}.fa-clipboard:before,.fa-paste:before{content:""}.fa-lightbulb-o:before{content:""}.fa-exchange:before{content:""}.fa-cloud-download:before{content:""}.fa-cloud-upload:before{content:""}.fa-user-md:before{content:""}.fa-stethoscope:before{content:""}.fa-suitcase:before{content:""}.fa-bell-o:before{content:""}.fa-coffee:before{content:""}.fa-cutlery:before{content:""}.fa-file-text-o:before{content:""}.fa-building-o:before{content:""}.fa-hospital-o:before{content:""}.fa-ambulance:before{content:""}.fa-medkit:before{content:""}.fa-fighter-jet:before{content:""}.fa-beer:before{content:""}.fa-h-square:before{content:""}.fa-plus-square:before{content:""}.fa-angle-double-left:before{content:""}.fa-angle-double-right:before{content:""}.fa-angle-double-up:before{content:""}.fa-angle-double-down:before{content:""}.fa-angle-left:before{content:""}.fa-angle-right:before{content:""}.fa-angle-up:before{content:""}.fa-angle-down:before{content:""}.fa-desktop:before{content:""}.fa-laptop:before{content:""}.fa-tablet:before{content:""}.fa-mobile-phone:before,.fa-mobile:before{content:""}.fa-circle-o:before{content:""}.fa-quote-left:before{content:""}.fa-quote-right:before{content:""}.fa-spinner:before{content:""}.fa-circle:before{content:""}.fa-mail-reply:before,.fa-reply:before{content:""}.fa-github-alt:before{content:""}.fa-folder-o:before{content:""}.fa-folder-open-o:before{content:""}.fa-smile-o:before{content:""}.fa-frown-o:before{content:""}.fa-meh-o:before{content:""}.fa-gamepad:before{content:""}.fa-keyboard-o:before{content:""}.fa-flag-o:before{content:""}.fa-flag-checkered:before{content:""}.fa-terminal:before{content:""}.fa-code:before{content:""}.fa-mail-reply-all:before,.fa-reply-all:before{content:""}.fa-star-half-empty:before,.fa-star-half-full:before,.fa-star-half-o:before{content:""}.fa-location-arrow:before{content:""}.fa-crop:before{content:""}.fa-code-fork:before{content:""}.fa-chain-broken:before,.fa-unlink:before{content:""}.fa-question:before{content:""}.fa-info:before{content:""}.fa-exclamation:before{content:""}.fa-superscript:before{content:""}.fa-subscript:before{content:""}.fa-eraser:before{content:""}.fa-puzzle-piece:before{content:""}.fa-microphone:before{content:""}.fa-microphone-slash:before{content:""}.fa-shield:before{content:""}.fa-calendar-o:before{content:""}.fa-fire-extinguisher:before{content:""}.fa-rocket:before{content:""}.fa-maxcdn:before{content:""}.fa-chevron-circle-left:before{content:""}.fa-chevron-circle-right:before{content:""}.fa-chevron-circle-up:before{content:""}.fa-chevron-circle-down:before{content:""}.fa-html5:before{content:""}.fa-css3:before{content:""}.fa-anchor:before{content:""}.fa-unlock-alt:before{content:""}.fa-bullseye:before{content:""}.fa-ellipsis-h:before{content:""}.fa-ellipsis-v:before{content:""}.fa-rss-square:before{content:""}.fa-play-circle:before{content:""}.fa-ticket:before{content:""}.fa-minus-square:before{content:""}.fa-minus-square-o:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before{content:""}.fa-level-up:before{content:""}.fa-level-down:before{content:""}.fa-check-square:before{content:""}.fa-pencil-square:before{content:""}.fa-external-link-square:before{content:""}.fa-share-square:before{content:""}.fa-compass:before{content:""}.fa-caret-square-o-down:before,.fa-toggle-down:before{content:""}.fa-caret-square-o-up:before,.fa-toggle-up:before{content:""}.fa-caret-square-o-right:before,.fa-toggle-right:before{content:""}.fa-eur:before,.fa-euro:before{content:""}.fa-gbp:before{content:""}.fa-dollar:before,.fa-usd:before{content:""}.fa-inr:before,.fa-rupee:before{content:""}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen:before{content:""}.fa-rouble:before,.fa-rub:before,.fa-ruble:before{content:""}.fa-krw:before,.fa-won:before{content:""}.fa-bitcoin:before,.fa-btc:before{content:""}.fa-file:before{content:""}.fa-file-text:before{content:""}.fa-sort-alpha-asc:before{content:""}.fa-sort-alpha-desc:before{content:""}.fa-sort-amount-asc:before{content:""}.fa-sort-amount-desc:before{content:""}.fa-sort-numeric-asc:before{content:""}.fa-sort-numeric-desc:before{content:""}.fa-thumbs-up:before{content:""}.fa-thumbs-down:before{content:""}.fa-youtube-square:before{content:""}.fa-youtube:before{content:""}.fa-xing:before{content:""}.fa-xing-square:before{content:""}.fa-youtube-play:before{content:""}.fa-dropbox:before{content:""}.fa-stack-overflow:before{content:""}.fa-instagram:before{content:""}.fa-flickr:before{content:""}.fa-adn:before{content:""}.fa-bitbucket:before,.icon-bitbucket:before{content:""}.fa-bitbucket-square:before{content:""}.fa-tumblr:before{content:""}.fa-tumblr-square:before{content:""}.fa-long-arrow-down:before{content:""}.fa-long-arrow-up:before{content:""}.fa-long-arrow-left:before{content:""}.fa-long-arrow-right:before{content:""}.fa-apple:before{content:""}.fa-windows:before{content:""}.fa-android:before{content:""}.fa-linux:before{content:""}.fa-dribbble:before{content:""}.fa-skype:before{content:""}.fa-foursquare:before{content:""}.fa-trello:before{content:""}.fa-female:before{content:""}.fa-male:before{content:""}.fa-gittip:before,.fa-gratipay:before{content:""}.fa-sun-o:before{content:""}.fa-moon-o:before{content:""}.fa-archive:before{content:""}.fa-bug:before{content:""}.fa-vk:before{content:""}.fa-weibo:before{content:""}.fa-renren:before{content:""}.fa-pagelines:before{content:""}.fa-stack-exchange:before{content:""}.fa-arrow-circle-o-right:before{content:""}.fa-arrow-circle-o-left:before{content:""}.fa-caret-square-o-left:before,.fa-toggle-left:before{content:""}.fa-dot-circle-o:before{content:""}.fa-wheelchair:before{content:""}.fa-vimeo-square:before{content:""}.fa-try:before,.fa-turkish-lira:before{content:""}.fa-plus-square-o:before,.wy-menu-vertical li button.toctree-expand:before{content:""}.fa-space-shuttle:before{content:""}.fa-slack:before{content:""}.fa-envelope-square:before{content:""}.fa-wordpress:before{content:""}.fa-openid:before{content:""}.fa-bank:before,.fa-institution:before,.fa-university:before{content:""}.fa-graduation-cap:before,.fa-mortar-board:before{content:""}.fa-yahoo:before{content:""}.fa-google:before{content:""}.fa-reddit:before{content:""}.fa-reddit-square:before{content:""}.fa-stumbleupon-circle:before{content:""}.fa-stumbleupon:before{content:""}.fa-delicious:before{content:""}.fa-digg:before{content:""}.fa-pied-piper-pp:before{content:""}.fa-pied-piper-alt:before{content:""}.fa-drupal:before{content:""}.fa-joomla:before{content:""}.fa-language:before{content:""}.fa-fax:before{content:""}.fa-building:before{content:""}.fa-child:before{content:""}.fa-paw:before{content:""}.fa-spoon:before{content:""}.fa-cube:before{content:""}.fa-cubes:before{content:""}.fa-behance:before{content:""}.fa-behance-square:before{content:""}.fa-steam:before{content:""}.fa-steam-square:before{content:""}.fa-recycle:before{content:""}.fa-automobile:before,.fa-car:before{content:""}.fa-cab:before,.fa-taxi:before{content:""}.fa-tree:before{content:""}.fa-spotify:before{content:""}.fa-deviantart:before{content:""}.fa-soundcloud:before{content:""}.fa-database:before{content:""}.fa-file-pdf-o:before{content:""}.fa-file-word-o:before{content:""}.fa-file-excel-o:before{content:""}.fa-file-powerpoint-o:before{content:""}.fa-file-image-o:before,.fa-file-photo-o:before,.fa-file-picture-o:before{content:""}.fa-file-archive-o:before,.fa-file-zip-o:before{content:""}.fa-file-audio-o:before,.fa-file-sound-o:before{content:""}.fa-file-movie-o:before,.fa-file-video-o:before{content:""}.fa-file-code-o:before{content:""}.fa-vine:before{content:""}.fa-codepen:before{content:""}.fa-jsfiddle:before{content:""}.fa-life-bouy:before,.fa-life-buoy:before,.fa-life-ring:before,.fa-life-saver:before,.fa-support:before{content:""}.fa-circle-o-notch:before{content:""}.fa-ra:before,.fa-rebel:before,.fa-resistance:before{content:""}.fa-empire:before,.fa-ge:before{content:""}.fa-git-square:before{content:""}.fa-git:before{content:""}.fa-hacker-news:before,.fa-y-combinator-square:before,.fa-yc-square:before{content:""}.fa-tencent-weibo:before{content:""}.fa-qq:before{content:""}.fa-wechat:before,.fa-weixin:before{content:""}.fa-paper-plane:before,.fa-send:before{content:""}.fa-paper-plane-o:before,.fa-send-o:before{content:""}.fa-history:before{content:""}.fa-circle-thin:before{content:""}.fa-header:before{content:""}.fa-paragraph:before{content:""}.fa-sliders:before{content:""}.fa-share-alt:before{content:""}.fa-share-alt-square:before{content:""}.fa-bomb:before{content:""}.fa-futbol-o:before,.fa-soccer-ball-o:before{content:""}.fa-tty:before{content:""}.fa-binoculars:before{content:""}.fa-plug:before{content:""}.fa-slideshare:before{content:""}.fa-twitch:before{content:""}.fa-yelp:before{content:""}.fa-newspaper-o:before{content:""}.fa-wifi:before{content:""}.fa-calculator:before{content:""}.fa-paypal:before{content:""}.fa-google-wallet:before{content:""}.fa-cc-visa:before{content:""}.fa-cc-mastercard:before{content:""}.fa-cc-discover:before{content:""}.fa-cc-amex:before{content:""}.fa-cc-paypal:before{content:""}.fa-cc-stripe:before{content:""}.fa-bell-slash:before{content:""}.fa-bell-slash-o:before{content:""}.fa-trash:before{content:""}.fa-copyright:before{content:""}.fa-at:before{content:""}.fa-eyedropper:before{content:""}.fa-paint-brush:before{content:""}.fa-birthday-cake:before{content:""}.fa-area-chart:before{content:""}.fa-pie-chart:before{content:""}.fa-line-chart:before{content:""}.fa-lastfm:before{content:""}.fa-lastfm-square:before{content:""}.fa-toggle-off:before{content:""}.fa-toggle-on:before{content:""}.fa-bicycle:before{content:""}.fa-bus:before{content:""}.fa-ioxhost:before{content:""}.fa-angellist:before{content:""}.fa-cc:before{content:""}.fa-ils:before,.fa-shekel:before,.fa-sheqel:before{content:""}.fa-meanpath:before{content:""}.fa-buysellads:before{content:""}.fa-connectdevelop:before{content:""}.fa-dashcube:before{content:""}.fa-forumbee:before{content:""}.fa-leanpub:before{content:""}.fa-sellsy:before{content:""}.fa-shirtsinbulk:before{content:""}.fa-simplybuilt:before{content:""}.fa-skyatlas:before{content:""}.fa-cart-plus:before{content:""}.fa-cart-arrow-down:before{content:""}.fa-diamond:before{content:""}.fa-ship:before{content:""}.fa-user-secret:before{content:""}.fa-motorcycle:before{content:""}.fa-street-view:before{content:""}.fa-heartbeat:before{content:""}.fa-venus:before{content:""}.fa-mars:before{content:""}.fa-mercury:before{content:""}.fa-intersex:before,.fa-transgender:before{content:""}.fa-transgender-alt:before{content:""}.fa-venus-double:before{content:""}.fa-mars-double:before{content:""}.fa-venus-mars:before{content:""}.fa-mars-stroke:before{content:""}.fa-mars-stroke-v:before{content:""}.fa-mars-stroke-h:before{content:""}.fa-neuter:before{content:""}.fa-genderless:before{content:""}.fa-facebook-official:before{content:""}.fa-pinterest-p:before{content:""}.fa-whatsapp:before{content:""}.fa-server:before{content:""}.fa-user-plus:before{content:""}.fa-user-times:before{content:""}.fa-bed:before,.fa-hotel:before{content:""}.fa-viacoin:before{content:""}.fa-train:before{content:""}.fa-subway:before{content:""}.fa-medium:before{content:""}.fa-y-combinator:before,.fa-yc:before{content:""}.fa-optin-monster:before{content:""}.fa-opencart:before{content:""}.fa-expeditedssl:before{content:""}.fa-battery-4:before,.fa-battery-full:before,.fa-battery:before{content:""}.fa-battery-3:before,.fa-battery-three-quarters:before{content:""}.fa-battery-2:before,.fa-battery-half:before{content:""}.fa-battery-1:before,.fa-battery-quarter:before{content:""}.fa-battery-0:before,.fa-battery-empty:before{content:""}.fa-mouse-pointer:before{content:""}.fa-i-cursor:before{content:""}.fa-object-group:before{content:""}.fa-object-ungroup:before{content:""}.fa-sticky-note:before{content:""}.fa-sticky-note-o:before{content:""}.fa-cc-jcb:before{content:""}.fa-cc-diners-club:before{content:""}.fa-clone:before{content:""}.fa-balance-scale:before{content:""}.fa-hourglass-o:before{content:""}.fa-hourglass-1:before,.fa-hourglass-start:before{content:""}.fa-hourglass-2:before,.fa-hourglass-half:before{content:""}.fa-hourglass-3:before,.fa-hourglass-end:before{content:""}.fa-hourglass:before{content:""}.fa-hand-grab-o:before,.fa-hand-rock-o:before{content:""}.fa-hand-paper-o:before,.fa-hand-stop-o:before{content:""}.fa-hand-scissors-o:before{content:""}.fa-hand-lizard-o:before{content:""}.fa-hand-spock-o:before{content:""}.fa-hand-pointer-o:before{content:""}.fa-hand-peace-o:before{content:""}.fa-trademark:before{content:""}.fa-registered:before{content:""}.fa-creative-commons:before{content:""}.fa-gg:before{content:""}.fa-gg-circle:before{content:""}.fa-tripadvisor:before{content:""}.fa-odnoklassniki:before{content:""}.fa-odnoklassniki-square:before{content:""}.fa-get-pocket:before{content:""}.fa-wikipedia-w:before{content:""}.fa-safari:before{content:""}.fa-chrome:before{content:""}.fa-firefox:before{content:""}.fa-opera:before{content:""}.fa-internet-explorer:before{content:""}.fa-television:before,.fa-tv:before{content:""}.fa-contao:before{content:""}.fa-500px:before{content:""}.fa-amazon:before{content:""}.fa-calendar-plus-o:before{content:""}.fa-calendar-minus-o:before{content:""}.fa-calendar-times-o:before{content:""}.fa-calendar-check-o:before{content:""}.fa-industry:before{content:""}.fa-map-pin:before{content:""}.fa-map-signs:before{content:""}.fa-map-o:before{content:""}.fa-map:before{content:""}.fa-commenting:before{content:""}.fa-commenting-o:before{content:""}.fa-houzz:before{content:""}.fa-vimeo:before{content:""}.fa-black-tie:before{content:""}.fa-fonticons:before{content:""}.fa-reddit-alien:before{content:""}.fa-edge:before{content:""}.fa-credit-card-alt:before{content:""}.fa-codiepie:before{content:""}.fa-modx:before{content:""}.fa-fort-awesome:before{content:""}.fa-usb:before{content:""}.fa-product-hunt:before{content:""}.fa-mixcloud:before{content:""}.fa-scribd:before{content:""}.fa-pause-circle:before{content:""}.fa-pause-circle-o:before{content:""}.fa-stop-circle:before{content:""}.fa-stop-circle-o:before{content:""}.fa-shopping-bag:before{content:""}.fa-shopping-basket:before{content:""}.fa-hashtag:before{content:""}.fa-bluetooth:before{content:""}.fa-bluetooth-b:before{content:""}.fa-percent:before{content:""}.fa-gitlab:before,.icon-gitlab:before{content:""}.fa-wpbeginner:before{content:""}.fa-wpforms:before{content:""}.fa-envira:before{content:""}.fa-universal-access:before{content:""}.fa-wheelchair-alt:before{content:""}.fa-question-circle-o:before{content:""}.fa-blind:before{content:""}.fa-audio-description:before{content:""}.fa-volume-control-phone:before{content:""}.fa-braille:before{content:""}.fa-assistive-listening-systems:before{content:""}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before{content:""}.fa-deaf:before,.fa-deafness:before,.fa-hard-of-hearing:before{content:""}.fa-glide:before{content:""}.fa-glide-g:before{content:""}.fa-sign-language:before,.fa-signing:before{content:""}.fa-low-vision:before{content:""}.fa-viadeo:before{content:""}.fa-viadeo-square:before{content:""}.fa-snapchat:before{content:""}.fa-snapchat-ghost:before{content:""}.fa-snapchat-square:before{content:""}.fa-pied-piper:before{content:""}.fa-first-order:before{content:""}.fa-yoast:before{content:""}.fa-themeisle:before{content:""}.fa-google-plus-circle:before,.fa-google-plus-official:before{content:""}.fa-fa:before,.fa-font-awesome:before{content:""}.fa-handshake-o:before{content:""}.fa-envelope-open:before{content:""}.fa-envelope-open-o:before{content:""}.fa-linode:before{content:""}.fa-address-book:before{content:""}.fa-address-book-o:before{content:""}.fa-address-card:before,.fa-vcard:before{content:""}.fa-address-card-o:before,.fa-vcard-o:before{content:""}.fa-user-circle:before{content:""}.fa-user-circle-o:before{content:""}.fa-user-o:before{content:""}.fa-id-badge:before{content:""}.fa-drivers-license:before,.fa-id-card:before{content:""}.fa-drivers-license-o:before,.fa-id-card-o:before{content:""}.fa-quora:before{content:""}.fa-free-code-camp:before{content:""}.fa-telegram:before{content:""}.fa-thermometer-4:before,.fa-thermometer-full:before,.fa-thermometer:before{content:""}.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:""}.fa-thermometer-2:before,.fa-thermometer-half:before{content:""}.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:""}.fa-thermometer-0:before,.fa-thermometer-empty:before{content:""}.fa-shower:before{content:""}.fa-bath:before,.fa-bathtub:before,.fa-s15:before{content:""}.fa-podcast:before{content:""}.fa-window-maximize:before{content:""}.fa-window-minimize:before{content:""}.fa-window-restore:before{content:""}.fa-times-rectangle:before,.fa-window-close:before{content:""}.fa-times-rectangle-o:before,.fa-window-close-o:before{content:""}.fa-bandcamp:before{content:""}.fa-grav:before{content:""}.fa-etsy:before{content:""}.fa-imdb:before{content:""}.fa-ravelry:before{content:""}.fa-eercast:before{content:""}.fa-microchip:before{content:""}.fa-snowflake-o:before{content:""}.fa-superpowers:before{content:""}.fa-wpexplorer:before{content:""}.fa-meetup:before{content:""}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-dropdown .caret,.wy-inline-validate.wy-inline-validate-danger .wy-input-context,.wy-inline-validate.wy-inline-validate-info .wy-input-context,.wy-inline-validate.wy-inline-validate-success .wy-input-context,.wy-inline-validate.wy-inline-validate-warning .wy-input-context,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li button.toctree-expand{font-family:inherit}.fa:before,.icon:before,.rst-content .admonition-title:before,.rst-content .code-block-caption .headerlink:before,.rst-content .eqno .headerlink:before,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content p .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a button.toctree-expand:before,.wy-menu-vertical li.on a button.toctree-expand:before,.wy-menu-vertical li button.toctree-expand:before{font-family:FontAwesome;display:inline-block;font-style:normal;font-weight:400;line-height:1;text-decoration:inherit}.rst-content .code-block-caption a .headerlink,.rst-content .eqno a .headerlink,.rst-content a .admonition-title,.rst-content code.download a span:first-child,.rst-content dl dt a .headerlink,.rst-content h1 a .headerlink,.rst-content h2 a .headerlink,.rst-content h3 a .headerlink,.rst-content h4 a .headerlink,.rst-content h5 a .headerlink,.rst-content h6 a .headerlink,.rst-content p.caption a .headerlink,.rst-content p a .headerlink,.rst-content table>caption a .headerlink,.rst-content tt.download a span:first-child,.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand,.wy-menu-vertical li a button.toctree-expand,a .fa,a .icon,a .rst-content .admonition-title,a .rst-content .code-block-caption .headerlink,a .rst-content .eqno .headerlink,a .rst-content code.download span:first-child,a .rst-content dl dt .headerlink,a .rst-content h1 .headerlink,a .rst-content h2 .headerlink,a .rst-content h3 .headerlink,a .rst-content h4 .headerlink,a .rst-content h5 .headerlink,a .rst-content h6 .headerlink,a .rst-content p.caption .headerlink,a .rst-content p .headerlink,a .rst-content table>caption .headerlink,a .rst-content tt.download span:first-child,a .wy-menu-vertical li button.toctree-expand{display:inline-block;text-decoration:inherit}.btn .fa,.btn .icon,.btn .rst-content .admonition-title,.btn .rst-content .code-block-caption .headerlink,.btn .rst-content .eqno .headerlink,.btn .rst-content code.download span:first-child,.btn .rst-content dl dt .headerlink,.btn .rst-content h1 .headerlink,.btn .rst-content h2 .headerlink,.btn .rst-content h3 .headerlink,.btn .rst-content h4 .headerlink,.btn .rst-content h5 .headerlink,.btn .rst-content h6 .headerlink,.btn .rst-content p .headerlink,.btn .rst-content table>caption .headerlink,.btn .rst-content tt.download span:first-child,.btn .wy-menu-vertical li.current>a button.toctree-expand,.btn .wy-menu-vertical li.on a button.toctree-expand,.btn .wy-menu-vertical li button.toctree-expand,.nav .fa,.nav .icon,.nav .rst-content .admonition-title,.nav .rst-content .code-block-caption .headerlink,.nav .rst-content .eqno .headerlink,.nav .rst-content code.download span:first-child,.nav .rst-content dl dt .headerlink,.nav .rst-content h1 .headerlink,.nav .rst-content h2 .headerlink,.nav .rst-content h3 .headerlink,.nav .rst-content h4 .headerlink,.nav .rst-content h5 .headerlink,.nav .rst-content h6 .headerlink,.nav .rst-content p .headerlink,.nav .rst-content table>caption .headerlink,.nav .rst-content tt.download span:first-child,.nav .wy-menu-vertical li.current>a button.toctree-expand,.nav .wy-menu-vertical li.on a button.toctree-expand,.nav .wy-menu-vertical li button.toctree-expand,.rst-content .btn .admonition-title,.rst-content .code-block-caption .btn .headerlink,.rst-content .code-block-caption .nav .headerlink,.rst-content .eqno .btn .headerlink,.rst-content .eqno .nav .headerlink,.rst-content .nav .admonition-title,.rst-content code.download .btn span:first-child,.rst-content code.download .nav span:first-child,.rst-content dl dt .btn .headerlink,.rst-content dl dt .nav .headerlink,.rst-content h1 .btn .headerlink,.rst-content h1 .nav .headerlink,.rst-content h2 .btn .headerlink,.rst-content h2 .nav .headerlink,.rst-content h3 .btn .headerlink,.rst-content h3 .nav .headerlink,.rst-content h4 .btn .headerlink,.rst-content h4 .nav .headerlink,.rst-content h5 .btn .headerlink,.rst-content h5 .nav .headerlink,.rst-content h6 .btn .headerlink,.rst-content h6 .nav .headerlink,.rst-content p .btn .headerlink,.rst-content p .nav .headerlink,.rst-content table>caption .btn .headerlink,.rst-content table>caption .nav .headerlink,.rst-content tt.download .btn span:first-child,.rst-content tt.download .nav span:first-child,.wy-menu-vertical li .btn button.toctree-expand,.wy-menu-vertical li.current>a .btn button.toctree-expand,.wy-menu-vertical li.current>a .nav button.toctree-expand,.wy-menu-vertical li .nav button.toctree-expand,.wy-menu-vertical li.on a .btn button.toctree-expand,.wy-menu-vertical li.on a .nav button.toctree-expand{display:inline}.btn .fa-large.icon,.btn .fa.fa-large,.btn .rst-content .code-block-caption .fa-large.headerlink,.btn .rst-content .eqno .fa-large.headerlink,.btn .rst-content .fa-large.admonition-title,.btn .rst-content code.download span.fa-large:first-child,.btn .rst-content dl dt .fa-large.headerlink,.btn .rst-content h1 .fa-large.headerlink,.btn .rst-content h2 .fa-large.headerlink,.btn .rst-content h3 .fa-large.headerlink,.btn .rst-content h4 .fa-large.headerlink,.btn .rst-content h5 .fa-large.headerlink,.btn .rst-content h6 .fa-large.headerlink,.btn .rst-content p .fa-large.headerlink,.btn .rst-content table>caption .fa-large.headerlink,.btn .rst-content tt.download span.fa-large:first-child,.btn .wy-menu-vertical li button.fa-large.toctree-expand,.nav .fa-large.icon,.nav .fa.fa-large,.nav .rst-content .code-block-caption .fa-large.headerlink,.nav .rst-content .eqno .fa-large.headerlink,.nav .rst-content .fa-large.admonition-title,.nav .rst-content code.download span.fa-large:first-child,.nav .rst-content dl dt .fa-large.headerlink,.nav .rst-content h1 .fa-large.headerlink,.nav .rst-content h2 .fa-large.headerlink,.nav .rst-content h3 .fa-large.headerlink,.nav .rst-content h4 .fa-large.headerlink,.nav .rst-content h5 .fa-large.headerlink,.nav .rst-content h6 .fa-large.headerlink,.nav .rst-content p .fa-large.headerlink,.nav .rst-content table>caption .fa-large.headerlink,.nav .rst-content tt.download span.fa-large:first-child,.nav .wy-menu-vertical li button.fa-large.toctree-expand,.rst-content .btn .fa-large.admonition-title,.rst-content .code-block-caption .btn .fa-large.headerlink,.rst-content .code-block-caption .nav .fa-large.headerlink,.rst-content .eqno .btn .fa-large.headerlink,.rst-content .eqno .nav .fa-large.headerlink,.rst-content .nav .fa-large.admonition-title,.rst-content code.download .btn span.fa-large:first-child,.rst-content code.download .nav span.fa-large:first-child,.rst-content dl dt .btn .fa-large.headerlink,.rst-content dl dt .nav .fa-large.headerlink,.rst-content h1 .btn .fa-large.headerlink,.rst-content h1 .nav .fa-large.headerlink,.rst-content h2 .btn .fa-large.headerlink,.rst-content h2 .nav .fa-large.headerlink,.rst-content h3 .btn .fa-large.headerlink,.rst-content h3 .nav .fa-large.headerlink,.rst-content h4 .btn .fa-large.headerlink,.rst-content h4 .nav .fa-large.headerlink,.rst-content h5 .btn .fa-large.headerlink,.rst-content h5 .nav .fa-large.headerlink,.rst-content h6 .btn .fa-large.headerlink,.rst-content h6 .nav .fa-large.headerlink,.rst-content p .btn .fa-large.headerlink,.rst-content p .nav .fa-large.headerlink,.rst-content table>caption .btn .fa-large.headerlink,.rst-content table>caption .nav .fa-large.headerlink,.rst-content tt.download .btn span.fa-large:first-child,.rst-content tt.download .nav span.fa-large:first-child,.wy-menu-vertical li .btn button.fa-large.toctree-expand,.wy-menu-vertical li .nav button.fa-large.toctree-expand{line-height:.9em}.btn .fa-spin.icon,.btn .fa.fa-spin,.btn .rst-content .code-block-caption .fa-spin.headerlink,.btn .rst-content .eqno .fa-spin.headerlink,.btn .rst-content .fa-spin.admonition-title,.btn .rst-content code.download span.fa-spin:first-child,.btn .rst-content dl dt .fa-spin.headerlink,.btn .rst-content h1 .fa-spin.headerlink,.btn .rst-content h2 .fa-spin.headerlink,.btn .rst-content h3 .fa-spin.headerlink,.btn .rst-content h4 .fa-spin.headerlink,.btn .rst-content h5 .fa-spin.headerlink,.btn .rst-content h6 .fa-spin.headerlink,.btn .rst-content p .fa-spin.headerlink,.btn .rst-content table>caption .fa-spin.headerlink,.btn .rst-content tt.download span.fa-spin:first-child,.btn .wy-menu-vertical li button.fa-spin.toctree-expand,.nav .fa-spin.icon,.nav .fa.fa-spin,.nav .rst-content .code-block-caption .fa-spin.headerlink,.nav .rst-content .eqno .fa-spin.headerlink,.nav .rst-content .fa-spin.admonition-title,.nav .rst-content code.download span.fa-spin:first-child,.nav .rst-content dl dt .fa-spin.headerlink,.nav .rst-content h1 .fa-spin.headerlink,.nav .rst-content h2 .fa-spin.headerlink,.nav .rst-content h3 .fa-spin.headerlink,.nav .rst-content h4 .fa-spin.headerlink,.nav .rst-content h5 .fa-spin.headerlink,.nav .rst-content h6 .fa-spin.headerlink,.nav .rst-content p .fa-spin.headerlink,.nav .rst-content table>caption .fa-spin.headerlink,.nav .rst-content tt.download span.fa-spin:first-child,.nav .wy-menu-vertical li button.fa-spin.toctree-expand,.rst-content .btn .fa-spin.admonition-title,.rst-content .code-block-caption .btn .fa-spin.headerlink,.rst-content .code-block-caption .nav .fa-spin.headerlink,.rst-content .eqno .btn .fa-spin.headerlink,.rst-content .eqno .nav .fa-spin.headerlink,.rst-content .nav .fa-spin.admonition-title,.rst-content code.download .btn span.fa-spin:first-child,.rst-content code.download .nav span.fa-spin:first-child,.rst-content dl dt .btn .fa-spin.headerlink,.rst-content dl dt .nav .fa-spin.headerlink,.rst-content h1 .btn .fa-spin.headerlink,.rst-content h1 .nav .fa-spin.headerlink,.rst-content h2 .btn .fa-spin.headerlink,.rst-content h2 .nav .fa-spin.headerlink,.rst-content h3 .btn .fa-spin.headerlink,.rst-content h3 .nav .fa-spin.headerlink,.rst-content h4 .btn .fa-spin.headerlink,.rst-content h4 .nav .fa-spin.headerlink,.rst-content h5 .btn .fa-spin.headerlink,.rst-content h5 .nav .fa-spin.headerlink,.rst-content h6 .btn .fa-spin.headerlink,.rst-content h6 .nav .fa-spin.headerlink,.rst-content p .btn .fa-spin.headerlink,.rst-content p .nav .fa-spin.headerlink,.rst-content table>caption .btn .fa-spin.headerlink,.rst-content table>caption .nav .fa-spin.headerlink,.rst-content tt.download .btn span.fa-spin:first-child,.rst-content tt.download .nav span.fa-spin:first-child,.wy-menu-vertical li .btn button.fa-spin.toctree-expand,.wy-menu-vertical li .nav button.fa-spin.toctree-expand{display:inline-block}.btn.fa:before,.btn.icon:before,.rst-content .btn.admonition-title:before,.rst-content .code-block-caption .btn.headerlink:before,.rst-content .eqno .btn.headerlink:before,.rst-content code.download span.btn:first-child:before,.rst-content dl dt .btn.headerlink:before,.rst-content h1 .btn.headerlink:before,.rst-content h2 .btn.headerlink:before,.rst-content h3 .btn.headerlink:before,.rst-content h4 .btn.headerlink:before,.rst-content h5 .btn.headerlink:before,.rst-content h6 .btn.headerlink:before,.rst-content p .btn.headerlink:before,.rst-content table>caption .btn.headerlink:before,.rst-content tt.download span.btn:first-child:before,.wy-menu-vertical li button.btn.toctree-expand:before{opacity:.5;-webkit-transition:opacity .05s ease-in;-moz-transition:opacity .05s ease-in;transition:opacity .05s ease-in}.btn.fa:hover:before,.btn.icon:hover:before,.rst-content .btn.admonition-title:hover:before,.rst-content .code-block-caption .btn.headerlink:hover:before,.rst-content .eqno .btn.headerlink:hover:before,.rst-content code.download span.btn:first-child:hover:before,.rst-content dl dt .btn.headerlink:hover:before,.rst-content h1 .btn.headerlink:hover:before,.rst-content h2 .btn.headerlink:hover:before,.rst-content h3 .btn.headerlink:hover:before,.rst-content h4 .btn.headerlink:hover:before,.rst-content h5 .btn.headerlink:hover:before,.rst-content h6 .btn.headerlink:hover:before,.rst-content p .btn.headerlink:hover:before,.rst-content table>caption .btn.headerlink:hover:before,.rst-content tt.download span.btn:first-child:hover:before,.wy-menu-vertical li button.btn.toctree-expand:hover:before{opacity:1}.btn-mini .fa:before,.btn-mini .icon:before,.btn-mini .rst-content .admonition-title:before,.btn-mini .rst-content .code-block-caption .headerlink:before,.btn-mini .rst-content .eqno .headerlink:before,.btn-mini .rst-content code.download span:first-child:before,.btn-mini .rst-content dl dt .headerlink:before,.btn-mini .rst-content h1 .headerlink:before,.btn-mini .rst-content h2 .headerlink:before,.btn-mini .rst-content h3 .headerlink:before,.btn-mini .rst-content h4 .headerlink:before,.btn-mini .rst-content h5 .headerlink:before,.btn-mini .rst-content h6 .headerlink:before,.btn-mini .rst-content p .headerlink:before,.btn-mini .rst-content table>caption .headerlink:before,.btn-mini .rst-content tt.download span:first-child:before,.btn-mini .wy-menu-vertical li button.toctree-expand:before,.rst-content .btn-mini .admonition-title:before,.rst-content .code-block-caption .btn-mini .headerlink:before,.rst-content .eqno .btn-mini .headerlink:before,.rst-content code.download .btn-mini span:first-child:before,.rst-content dl dt .btn-mini .headerlink:before,.rst-content h1 .btn-mini .headerlink:before,.rst-content h2 .btn-mini .headerlink:before,.rst-content h3 .btn-mini .headerlink:before,.rst-content h4 .btn-mini .headerlink:before,.rst-content h5 .btn-mini .headerlink:before,.rst-content h6 .btn-mini .headerlink:before,.rst-content p .btn-mini .headerlink:before,.rst-content table>caption .btn-mini .headerlink:before,.rst-content tt.download .btn-mini span:first-child:before,.wy-menu-vertical li .btn-mini button.toctree-expand:before{font-size:14px;vertical-align:-15%}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.wy-alert{padding:12px;line-height:24px;margin-bottom:24px;background:#e7f2fa}.rst-content .admonition-title,.wy-alert-title{font-weight:700;display:block;color:#fff;background:#6ab0de;padding:6px 12px;margin:-12px -12px 12px}.rst-content .danger,.rst-content .error,.rst-content .wy-alert-danger.admonition,.rst-content .wy-alert-danger.admonition-todo,.rst-content .wy-alert-danger.attention,.rst-content .wy-alert-danger.caution,.rst-content .wy-alert-danger.hint,.rst-content .wy-alert-danger.important,.rst-content .wy-alert-danger.note,.rst-content .wy-alert-danger.seealso,.rst-content .wy-alert-danger.tip,.rst-content .wy-alert-danger.warning,.wy-alert.wy-alert-danger{background:#fdf3f2}.rst-content .danger .admonition-title,.rst-content .danger .wy-alert-title,.rst-content .error .admonition-title,.rst-content .error .wy-alert-title,.rst-content .wy-alert-danger.admonition-todo .admonition-title,.rst-content .wy-alert-danger.admonition-todo .wy-alert-title,.rst-content .wy-alert-danger.admonition .admonition-title,.rst-content .wy-alert-danger.admonition .wy-alert-title,.rst-content .wy-alert-danger.attention .admonition-title,.rst-content .wy-alert-danger.attention .wy-alert-title,.rst-content .wy-alert-danger.caution .admonition-title,.rst-content .wy-alert-danger.caution .wy-alert-title,.rst-content .wy-alert-danger.hint .admonition-title,.rst-content .wy-alert-danger.hint .wy-alert-title,.rst-content .wy-alert-danger.important .admonition-title,.rst-content .wy-alert-danger.important .wy-alert-title,.rst-content .wy-alert-danger.note .admonition-title,.rst-content .wy-alert-danger.note .wy-alert-title,.rst-content .wy-alert-danger.seealso .admonition-title,.rst-content .wy-alert-danger.seealso .wy-alert-title,.rst-content .wy-alert-danger.tip .admonition-title,.rst-content .wy-alert-danger.tip .wy-alert-title,.rst-content .wy-alert-danger.warning .admonition-title,.rst-content .wy-alert-danger.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-danger .admonition-title,.wy-alert.wy-alert-danger .rst-content .admonition-title,.wy-alert.wy-alert-danger .wy-alert-title{background:#f29f97}.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .warning,.rst-content .wy-alert-warning.admonition,.rst-content .wy-alert-warning.danger,.rst-content .wy-alert-warning.error,.rst-content .wy-alert-warning.hint,.rst-content .wy-alert-warning.important,.rst-content .wy-alert-warning.note,.rst-content .wy-alert-warning.seealso,.rst-content .wy-alert-warning.tip,.wy-alert.wy-alert-warning{background:#ffedcc}.rst-content .admonition-todo .admonition-title,.rst-content .admonition-todo .wy-alert-title,.rst-content .attention .admonition-title,.rst-content .attention .wy-alert-title,.rst-content .caution .admonition-title,.rst-content .caution .wy-alert-title,.rst-content .warning .admonition-title,.rst-content .warning .wy-alert-title,.rst-content .wy-alert-warning.admonition .admonition-title,.rst-content .wy-alert-warning.admonition .wy-alert-title,.rst-content .wy-alert-warning.danger .admonition-title,.rst-content .wy-alert-warning.danger .wy-alert-title,.rst-content .wy-alert-warning.error .admonition-title,.rst-content .wy-alert-warning.error .wy-alert-title,.rst-content .wy-alert-warning.hint .admonition-title,.rst-content .wy-alert-warning.hint .wy-alert-title,.rst-content .wy-alert-warning.important .admonition-title,.rst-content .wy-alert-warning.important .wy-alert-title,.rst-content .wy-alert-warning.note .admonition-title,.rst-content .wy-alert-warning.note .wy-alert-title,.rst-content .wy-alert-warning.seealso .admonition-title,.rst-content .wy-alert-warning.seealso .wy-alert-title,.rst-content .wy-alert-warning.tip .admonition-title,.rst-content .wy-alert-warning.tip .wy-alert-title,.rst-content .wy-alert.wy-alert-warning .admonition-title,.wy-alert.wy-alert-warning .rst-content .admonition-title,.wy-alert.wy-alert-warning .wy-alert-title{background:#f0b37e}.rst-content .note,.rst-content .seealso,.rst-content .wy-alert-info.admonition,.rst-content .wy-alert-info.admonition-todo,.rst-content .wy-alert-info.attention,.rst-content .wy-alert-info.caution,.rst-content .wy-alert-info.danger,.rst-content .wy-alert-info.error,.rst-content .wy-alert-info.hint,.rst-content .wy-alert-info.important,.rst-content .wy-alert-info.tip,.rst-content .wy-alert-info.warning,.wy-alert.wy-alert-info{background:#e7f2fa}.rst-content .note .admonition-title,.rst-content .note .wy-alert-title,.rst-content .seealso .admonition-title,.rst-content .seealso .wy-alert-title,.rst-content .wy-alert-info.admonition-todo .admonition-title,.rst-content .wy-alert-info.admonition-todo .wy-alert-title,.rst-content .wy-alert-info.admonition .admonition-title,.rst-content .wy-alert-info.admonition .wy-alert-title,.rst-content .wy-alert-info.attention .admonition-title,.rst-content .wy-alert-info.attention .wy-alert-title,.rst-content .wy-alert-info.caution .admonition-title,.rst-content .wy-alert-info.caution .wy-alert-title,.rst-content .wy-alert-info.danger .admonition-title,.rst-content .wy-alert-info.danger .wy-alert-title,.rst-content .wy-alert-info.error .admonition-title,.rst-content .wy-alert-info.error .wy-alert-title,.rst-content .wy-alert-info.hint .admonition-title,.rst-content .wy-alert-info.hint .wy-alert-title,.rst-content .wy-alert-info.important .admonition-title,.rst-content .wy-alert-info.important .wy-alert-title,.rst-content .wy-alert-info.tip .admonition-title,.rst-content .wy-alert-info.tip .wy-alert-title,.rst-content .wy-alert-info.warning .admonition-title,.rst-content .wy-alert-info.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-info .admonition-title,.wy-alert.wy-alert-info .rst-content .admonition-title,.wy-alert.wy-alert-info .wy-alert-title{background:#6ab0de}.rst-content .hint,.rst-content .important,.rst-content .tip,.rst-content .wy-alert-success.admonition,.rst-content .wy-alert-success.admonition-todo,.rst-content .wy-alert-success.attention,.rst-content .wy-alert-success.caution,.rst-content .wy-alert-success.danger,.rst-content .wy-alert-success.error,.rst-content .wy-alert-success.note,.rst-content .wy-alert-success.seealso,.rst-content .wy-alert-success.warning,.wy-alert.wy-alert-success{background:#dbfaf4}.rst-content .hint .admonition-title,.rst-content .hint .wy-alert-title,.rst-content .important .admonition-title,.rst-content .important .wy-alert-title,.rst-content .tip .admonition-title,.rst-content .tip .wy-alert-title,.rst-content .wy-alert-success.admonition-todo .admonition-title,.rst-content .wy-alert-success.admonition-todo .wy-alert-title,.rst-content .wy-alert-success.admonition .admonition-title,.rst-content .wy-alert-success.admonition .wy-alert-title,.rst-content .wy-alert-success.attention .admonition-title,.rst-content .wy-alert-success.attention .wy-alert-title,.rst-content .wy-alert-success.caution .admonition-title,.rst-content .wy-alert-success.caution .wy-alert-title,.rst-content .wy-alert-success.danger .admonition-title,.rst-content .wy-alert-success.danger .wy-alert-title,.rst-content .wy-alert-success.error .admonition-title,.rst-content .wy-alert-success.error .wy-alert-title,.rst-content .wy-alert-success.note .admonition-title,.rst-content .wy-alert-success.note .wy-alert-title,.rst-content .wy-alert-success.seealso .admonition-title,.rst-content .wy-alert-success.seealso .wy-alert-title,.rst-content .wy-alert-success.warning .admonition-title,.rst-content .wy-alert-success.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-success .admonition-title,.wy-alert.wy-alert-success .rst-content .admonition-title,.wy-alert.wy-alert-success .wy-alert-title{background:#1abc9c}.rst-content .wy-alert-neutral.admonition,.rst-content .wy-alert-neutral.admonition-todo,.rst-content .wy-alert-neutral.attention,.rst-content .wy-alert-neutral.caution,.rst-content .wy-alert-neutral.danger,.rst-content .wy-alert-neutral.error,.rst-content .wy-alert-neutral.hint,.rst-content .wy-alert-neutral.important,.rst-content .wy-alert-neutral.note,.rst-content .wy-alert-neutral.seealso,.rst-content .wy-alert-neutral.tip,.rst-content .wy-alert-neutral.warning,.wy-alert.wy-alert-neutral{background:#f3f6f6}.rst-content .wy-alert-neutral.admonition-todo .admonition-title,.rst-content .wy-alert-neutral.admonition-todo .wy-alert-title,.rst-content .wy-alert-neutral.admonition .admonition-title,.rst-content .wy-alert-neutral.admonition .wy-alert-title,.rst-content .wy-alert-neutral.attention .admonition-title,.rst-content .wy-alert-neutral.attention .wy-alert-title,.rst-content .wy-alert-neutral.caution .admonition-title,.rst-content .wy-alert-neutral.caution .wy-alert-title,.rst-content .wy-alert-neutral.danger .admonition-title,.rst-content .wy-alert-neutral.danger .wy-alert-title,.rst-content .wy-alert-neutral.error .admonition-title,.rst-content .wy-alert-neutral.error .wy-alert-title,.rst-content .wy-alert-neutral.hint .admonition-title,.rst-content .wy-alert-neutral.hint .wy-alert-title,.rst-content .wy-alert-neutral.important .admonition-title,.rst-content .wy-alert-neutral.important .wy-alert-title,.rst-content .wy-alert-neutral.note .admonition-title,.rst-content .wy-alert-neutral.note .wy-alert-title,.rst-content .wy-alert-neutral.seealso .admonition-title,.rst-content .wy-alert-neutral.seealso .wy-alert-title,.rst-content .wy-alert-neutral.tip .admonition-title,.rst-content .wy-alert-neutral.tip .wy-alert-title,.rst-content .wy-alert-neutral.warning .admonition-title,.rst-content .wy-alert-neutral.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-neutral .admonition-title,.wy-alert.wy-alert-neutral .rst-content .admonition-title,.wy-alert.wy-alert-neutral .wy-alert-title{color:#404040;background:#e1e4e5}.rst-content .wy-alert-neutral.admonition-todo a,.rst-content .wy-alert-neutral.admonition a,.rst-content .wy-alert-neutral.attention a,.rst-content .wy-alert-neutral.caution a,.rst-content .wy-alert-neutral.danger a,.rst-content .wy-alert-neutral.error a,.rst-content .wy-alert-neutral.hint a,.rst-content .wy-alert-neutral.important a,.rst-content .wy-alert-neutral.note a,.rst-content .wy-alert-neutral.seealso a,.rst-content .wy-alert-neutral.tip a,.rst-content .wy-alert-neutral.warning a,.wy-alert.wy-alert-neutral a{color:#2980b9}.rst-content .admonition-todo p:last-child,.rst-content .admonition p:last-child,.rst-content .attention p:last-child,.rst-content .caution p:last-child,.rst-content .danger p:last-child,.rst-content .error p:last-child,.rst-content .hint p:last-child,.rst-content .important p:last-child,.rst-content .note p:last-child,.rst-content .seealso p:last-child,.rst-content .tip p:last-child,.rst-content .warning p:last-child,.wy-alert p:last-child{margin-bottom:0}.wy-tray-container{position:fixed;bottom:0;left:0;z-index:600}.wy-tray-container li{display:block;width:300px;background:transparent;color:#fff;text-align:center;box-shadow:0 5px 5px 0 rgba(0,0,0,.1);padding:0 24px;min-width:20%;opacity:0;height:0;line-height:56px;overflow:hidden;-webkit-transition:all .3s ease-in;-moz-transition:all .3s ease-in;transition:all .3s ease-in}.wy-tray-container li.wy-tray-item-success{background:#27ae60}.wy-tray-container li.wy-tray-item-info{background:#2980b9}.wy-tray-container li.wy-tray-item-warning{background:#e67e22}.wy-tray-container li.wy-tray-item-danger{background:#e74c3c}.wy-tray-container li.on{opacity:1;height:56px}@media screen and (max-width:768px){.wy-tray-container{bottom:auto;top:0;width:100%}.wy-tray-container li{width:100%}}button{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle;cursor:pointer;line-height:normal;-webkit-appearance:button;*overflow:visible}button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}button[disabled]{cursor:default}.btn{display:inline-block;border-radius:2px;line-height:normal;white-space:nowrap;text-align:center;cursor:pointer;font-size:100%;padding:6px 12px 8px;color:#fff;border:1px solid rgba(0,0,0,.1);background-color:#27ae60;text-decoration:none;font-weight:400;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 2px -1px hsla(0,0%,100%,.5),inset 0 -2px 0 0 rgba(0,0,0,.1);outline-none:false;vertical-align:middle;*display:inline;zoom:1;-webkit-user-drag:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-transition:all .1s linear;-moz-transition:all .1s linear;transition:all .1s linear}.btn-hover{background:#2e8ece;color:#fff}.btn:hover{background:#2cc36b;color:#fff}.btn:focus{background:#2cc36b;outline:0}.btn:active{box-shadow:inset 0 -1px 0 0 rgba(0,0,0,.05),inset 0 2px 0 0 rgba(0,0,0,.1);padding:8px 12px 6px}.btn:visited{color:#fff}.btn-disabled,.btn-disabled:active,.btn-disabled:focus,.btn-disabled:hover,.btn:disabled{background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled = false);filter:alpha(opacity=40);opacity:.4;cursor:not-allowed;box-shadow:none}.btn::-moz-focus-inner{padding:0;border:0}.btn-small{font-size:80%}.btn-info{background-color:#2980b9!important}.btn-info:hover{background-color:#2e8ece!important}.btn-neutral{background-color:#f3f6f6!important;color:#404040!important}.btn-neutral:hover{background-color:#e5ebeb!important;color:#404040}.btn-neutral:visited{color:#404040!important}.btn-success{background-color:#27ae60!important}.btn-success:hover{background-color:#295!important}.btn-danger{background-color:#e74c3c!important}.btn-danger:hover{background-color:#ea6153!important}.btn-warning{background-color:#e67e22!important}.btn-warning:hover{background-color:#e98b39!important}.btn-invert{background-color:#222}.btn-invert:hover{background-color:#2f2f2f!important}.btn-link{background-color:transparent!important;color:#2980b9;box-shadow:none;border-color:transparent!important}.btn-link:active,.btn-link:hover{background-color:transparent!important;color:#409ad5!important;box-shadow:none}.btn-link:visited{color:#9b59b6}.wy-btn-group .btn,.wy-control .btn{vertical-align:middle}.wy-btn-group{margin-bottom:24px;*zoom:1}.wy-btn-group:after,.wy-btn-group:before{display:table;content:""}.wy-btn-group:after{clear:both}.wy-dropdown{position:relative;display:inline-block}.wy-dropdown-active .wy-dropdown-menu{display:block}.wy-dropdown-menu{position:absolute;left:0;display:none;float:left;top:100%;min-width:100%;background:#fcfcfc;z-index:100;border:1px solid #cfd7dd;box-shadow:0 2px 2px 0 rgba(0,0,0,.1);padding:12px}.wy-dropdown-menu>dd>a{display:block;clear:both;color:#404040;white-space:nowrap;font-size:90%;padding:0 12px;cursor:pointer}.wy-dropdown-menu>dd>a:hover{background:#2980b9;color:#fff}.wy-dropdown-menu>dd.divider{border-top:1px solid #cfd7dd;margin:6px 0}.wy-dropdown-menu>dd.search{padding-bottom:12px}.wy-dropdown-menu>dd.search input[type=search]{width:100%}.wy-dropdown-menu>dd.call-to-action{background:#e3e3e3;text-transform:uppercase;font-weight:500;font-size:80%}.wy-dropdown-menu>dd.call-to-action:hover{background:#e3e3e3}.wy-dropdown-menu>dd.call-to-action .btn{color:#fff}.wy-dropdown.wy-dropdown-up .wy-dropdown-menu{bottom:100%;top:auto;left:auto;right:0}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu{background:#fcfcfc;margin-top:2px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a{padding:6px 12px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a:hover{background:#2980b9;color:#fff}.wy-dropdown.wy-dropdown-left .wy-dropdown-menu{right:0;left:auto;text-align:right}.wy-dropdown-arrow:before{content:" ";border-bottom:5px solid #f5f5f5;border-left:5px solid transparent;border-right:5px solid transparent;position:absolute;display:block;top:-4px;left:50%;margin-left:-3px}.wy-dropdown-arrow.wy-dropdown-arrow-left:before{left:11px}.wy-form-stacked select{display:block}.wy-form-aligned .wy-help-inline,.wy-form-aligned input,.wy-form-aligned label,.wy-form-aligned select,.wy-form-aligned textarea{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-form-aligned .wy-control-group>label{display:inline-block;vertical-align:middle;width:10em;margin:6px 12px 0 0;float:left}.wy-form-aligned .wy-control{float:left}.wy-form-aligned .wy-control label{display:block}.wy-form-aligned .wy-control select{margin-top:6px}fieldset{margin:0}fieldset,legend{border:0;padding:0}legend{width:100%;white-space:normal;margin-bottom:24px;font-size:150%;*margin-left:-7px}label,legend{display:block}label{margin:0 0 .3125em;color:#333;font-size:90%}input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}.wy-control-group{margin-bottom:24px;max-width:1200px;margin-left:auto;margin-right:auto;*zoom:1}.wy-control-group:after,.wy-control-group:before{display:table;content:""}.wy-control-group:after{clear:both}.wy-control-group.wy-control-group-required>label:after{content:" *";color:#e74c3c}.wy-control-group .wy-form-full,.wy-control-group .wy-form-halves,.wy-control-group .wy-form-thirds{padding-bottom:12px}.wy-control-group .wy-form-full input[type=color],.wy-control-group .wy-form-full input[type=date],.wy-control-group .wy-form-full input[type=datetime-local],.wy-control-group .wy-form-full input[type=datetime],.wy-control-group .wy-form-full input[type=email],.wy-control-group .wy-form-full input[type=month],.wy-control-group .wy-form-full input[type=number],.wy-control-group .wy-form-full input[type=password],.wy-control-group .wy-form-full input[type=search],.wy-control-group .wy-form-full input[type=tel],.wy-control-group .wy-form-full input[type=text],.wy-control-group .wy-form-full input[type=time],.wy-control-group .wy-form-full input[type=url],.wy-control-group .wy-form-full input[type=week],.wy-control-group .wy-form-full select,.wy-control-group .wy-form-halves input[type=color],.wy-control-group .wy-form-halves input[type=date],.wy-control-group .wy-form-halves input[type=datetime-local],.wy-control-group .wy-form-halves input[type=datetime],.wy-control-group .wy-form-halves input[type=email],.wy-control-group .wy-form-halves input[type=month],.wy-control-group .wy-form-halves input[type=number],.wy-control-group .wy-form-halves input[type=password],.wy-control-group .wy-form-halves input[type=search],.wy-control-group .wy-form-halves input[type=tel],.wy-control-group .wy-form-halves input[type=text],.wy-control-group .wy-form-halves input[type=time],.wy-control-group .wy-form-halves input[type=url],.wy-control-group .wy-form-halves input[type=week],.wy-control-group .wy-form-halves select,.wy-control-group .wy-form-thirds input[type=color],.wy-control-group .wy-form-thirds input[type=date],.wy-control-group .wy-form-thirds input[type=datetime-local],.wy-control-group .wy-form-thirds input[type=datetime],.wy-control-group .wy-form-thirds input[type=email],.wy-control-group .wy-form-thirds input[type=month],.wy-control-group .wy-form-thirds input[type=number],.wy-control-group .wy-form-thirds input[type=password],.wy-control-group .wy-form-thirds input[type=search],.wy-control-group .wy-form-thirds input[type=tel],.wy-control-group .wy-form-thirds input[type=text],.wy-control-group .wy-form-thirds input[type=time],.wy-control-group .wy-form-thirds input[type=url],.wy-control-group .wy-form-thirds input[type=week],.wy-control-group .wy-form-thirds select{width:100%}.wy-control-group .wy-form-full{float:left;display:block;width:100%;margin-right:0}.wy-control-group .wy-form-full:last-child{margin-right:0}.wy-control-group .wy-form-halves{float:left;display:block;margin-right:2.35765%;width:48.82117%}.wy-control-group .wy-form-halves:last-child,.wy-control-group .wy-form-halves:nth-of-type(2n){margin-right:0}.wy-control-group .wy-form-halves:nth-of-type(odd){clear:left}.wy-control-group .wy-form-thirds{float:left;display:block;margin-right:2.35765%;width:31.76157%}.wy-control-group .wy-form-thirds:last-child,.wy-control-group .wy-form-thirds:nth-of-type(3n){margin-right:0}.wy-control-group .wy-form-thirds:nth-of-type(3n+1){clear:left}.wy-control-group.wy-control-group-no-input .wy-control,.wy-control-no-input{margin:6px 0 0;font-size:90%}.wy-control-no-input{display:inline-block}.wy-control-group.fluid-input input[type=color],.wy-control-group.fluid-input input[type=date],.wy-control-group.fluid-input input[type=datetime-local],.wy-control-group.fluid-input input[type=datetime],.wy-control-group.fluid-input input[type=email],.wy-control-group.fluid-input input[type=month],.wy-control-group.fluid-input input[type=number],.wy-control-group.fluid-input input[type=password],.wy-control-group.fluid-input input[type=search],.wy-control-group.fluid-input input[type=tel],.wy-control-group.fluid-input input[type=text],.wy-control-group.fluid-input input[type=time],.wy-control-group.fluid-input input[type=url],.wy-control-group.fluid-input input[type=week]{width:100%}.wy-form-message-inline{padding-left:.3em;color:#666;font-size:90%}.wy-form-message{display:block;color:#999;font-size:70%;margin-top:.3125em;font-style:italic}.wy-form-message p{font-size:inherit;font-style:italic;margin-bottom:6px}.wy-form-message p:last-child{margin-bottom:0}input{line-height:normal}input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;*overflow:visible}input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week]{-webkit-appearance:none;padding:6px;display:inline-block;border:1px solid #ccc;font-size:80%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 3px #ddd;border-radius:0;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}input[type=datetime-local]{padding:.34375em .625em}input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{padding:0;margin-right:.3125em;*height:13px;*width:13px}input[type=checkbox],input[type=radio],input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}input[type=color]:focus,input[type=date]:focus,input[type=datetime-local]:focus,input[type=datetime]:focus,input[type=email]:focus,input[type=month]:focus,input[type=number]:focus,input[type=password]:focus,input[type=search]:focus,input[type=tel]:focus,input[type=text]:focus,input[type=time]:focus,input[type=url]:focus,input[type=week]:focus{outline:0;outline:thin dotted\9;border-color:#333}input.no-focus:focus{border-color:#ccc!important}input[type=checkbox]:focus,input[type=file]:focus,input[type=radio]:focus{outline:thin dotted #333;outline:1px auto #129fea}input[type=color][disabled],input[type=date][disabled],input[type=datetime-local][disabled],input[type=datetime][disabled],input[type=email][disabled],input[type=month][disabled],input[type=number][disabled],input[type=password][disabled],input[type=search][disabled],input[type=tel][disabled],input[type=text][disabled],input[type=time][disabled],input[type=url][disabled],input[type=week][disabled]{cursor:not-allowed;background-color:#fafafa}input:focus:invalid,select:focus:invalid,textarea:focus:invalid{color:#e74c3c;border:1px solid #e74c3c}input:focus:invalid:focus,select:focus:invalid:focus,textarea:focus:invalid:focus{border-color:#e74c3c}input[type=checkbox]:focus:invalid:focus,input[type=file]:focus:invalid:focus,input[type=radio]:focus:invalid:focus{outline-color:#e74c3c}input.wy-input-large{padding:12px;font-size:100%}textarea{overflow:auto;vertical-align:top;width:100%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif}select,textarea{padding:.5em .625em;display:inline-block;border:1px solid #ccc;font-size:80%;box-shadow:inset 0 1px 3px #ddd;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}select{border:1px solid #ccc;background-color:#fff}select[multiple]{height:auto}select:focus,textarea:focus{outline:0}input[readonly],select[disabled],select[readonly],textarea[disabled],textarea[readonly]{cursor:not-allowed;background-color:#fafafa}input[type=checkbox][disabled],input[type=radio][disabled]{cursor:not-allowed}.wy-checkbox,.wy-radio{margin:6px 0;color:#404040;display:block}.wy-checkbox input,.wy-radio input{vertical-align:baseline}.wy-form-message-inline{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-input-prefix,.wy-input-suffix{white-space:nowrap;padding:6px}.wy-input-prefix .wy-input-context,.wy-input-suffix .wy-input-context{line-height:27px;padding:0 8px;display:inline-block;font-size:80%;background-color:#f3f6f6;border:1px solid #ccc;color:#999}.wy-input-suffix .wy-input-context{border-left:0}.wy-input-prefix .wy-input-context{border-right:0}.wy-switch{position:relative;display:block;height:24px;margin-top:12px;cursor:pointer}.wy-switch:before{left:0;top:0;width:36px;height:12px;background:#ccc}.wy-switch:after,.wy-switch:before{position:absolute;content:"";display:block;border-radius:4px;-webkit-transition:all .2s ease-in-out;-moz-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.wy-switch:after{width:18px;height:18px;background:#999;left:-3px;top:-3px}.wy-switch span{position:absolute;left:48px;display:block;font-size:12px;color:#ccc;line-height:1}.wy-switch.active:before{background:#1e8449}.wy-switch.active:after{left:24px;background:#27ae60}.wy-switch.disabled{cursor:not-allowed;opacity:.8}.wy-control-group.wy-control-group-error .wy-form-message,.wy-control-group.wy-control-group-error>label{color:#e74c3c}.wy-control-group.wy-control-group-error input[type=color],.wy-control-group.wy-control-group-error input[type=date],.wy-control-group.wy-control-group-error input[type=datetime-local],.wy-control-group.wy-control-group-error input[type=datetime],.wy-control-group.wy-control-group-error input[type=email],.wy-control-group.wy-control-group-error input[type=month],.wy-control-group.wy-control-group-error input[type=number],.wy-control-group.wy-control-group-error input[type=password],.wy-control-group.wy-control-group-error input[type=search],.wy-control-group.wy-control-group-error input[type=tel],.wy-control-group.wy-control-group-error input[type=text],.wy-control-group.wy-control-group-error input[type=time],.wy-control-group.wy-control-group-error input[type=url],.wy-control-group.wy-control-group-error input[type=week],.wy-control-group.wy-control-group-error textarea{border:1px solid #e74c3c}.wy-inline-validate{white-space:nowrap}.wy-inline-validate .wy-input-context{padding:.5em .625em;display:inline-block;font-size:80%}.wy-inline-validate.wy-inline-validate-success .wy-input-context{color:#27ae60}.wy-inline-validate.wy-inline-validate-danger .wy-input-context{color:#e74c3c}.wy-inline-validate.wy-inline-validate-warning .wy-input-context{color:#e67e22}.wy-inline-validate.wy-inline-validate-info .wy-input-context{color:#2980b9}.rotate-90{-webkit-transform:rotate(90deg);-moz-transform:rotate(90deg);-ms-transform:rotate(90deg);-o-transform:rotate(90deg);transform:rotate(90deg)}.rotate-180{-webkit-transform:rotate(180deg);-moz-transform:rotate(180deg);-ms-transform:rotate(180deg);-o-transform:rotate(180deg);transform:rotate(180deg)}.rotate-270{-webkit-transform:rotate(270deg);-moz-transform:rotate(270deg);-ms-transform:rotate(270deg);-o-transform:rotate(270deg);transform:rotate(270deg)}.mirror{-webkit-transform:scaleX(-1);-moz-transform:scaleX(-1);-ms-transform:scaleX(-1);-o-transform:scaleX(-1);transform:scaleX(-1)}.mirror.rotate-90{-webkit-transform:scaleX(-1) rotate(90deg);-moz-transform:scaleX(-1) rotate(90deg);-ms-transform:scaleX(-1) rotate(90deg);-o-transform:scaleX(-1) rotate(90deg);transform:scaleX(-1) rotate(90deg)}.mirror.rotate-180{-webkit-transform:scaleX(-1) rotate(180deg);-moz-transform:scaleX(-1) rotate(180deg);-ms-transform:scaleX(-1) rotate(180deg);-o-transform:scaleX(-1) rotate(180deg);transform:scaleX(-1) rotate(180deg)}.mirror.rotate-270{-webkit-transform:scaleX(-1) rotate(270deg);-moz-transform:scaleX(-1) rotate(270deg);-ms-transform:scaleX(-1) rotate(270deg);-o-transform:scaleX(-1) rotate(270deg);transform:scaleX(-1) rotate(270deg)}@media only screen and (max-width:480px){.wy-form button[type=submit]{margin:.7em 0 0}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=text],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week],.wy-form label{margin-bottom:.3em;display:block}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week]{margin-bottom:0}.wy-form-aligned .wy-control-group label{margin-bottom:.3em;text-align:left;display:block;width:100%}.wy-form-aligned .wy-control{margin:1.5em 0 0}.wy-form-message,.wy-form-message-inline,.wy-form .wy-help-inline{display:block;font-size:80%;padding:6px 0}}@media screen and (max-width:768px){.tablet-hide{display:none}}@media screen and (max-width:480px){.mobile-hide{display:none}}.float-left{float:left}.float-right{float:right}.full-width{width:100%}.rst-content table.docutils,.rst-content table.field-list,.wy-table{border-collapse:collapse;border-spacing:0;empty-cells:show;margin-bottom:24px}.rst-content table.docutils caption,.rst-content table.field-list caption,.wy-table caption{color:#000;font:italic 85%/1 arial,sans-serif;padding:1em 0;text-align:center}.rst-content table.docutils td,.rst-content table.docutils th,.rst-content table.field-list td,.rst-content table.field-list th,.wy-table td,.wy-table th{font-size:90%;margin:0;overflow:visible;padding:8px 16px}.rst-content table.docutils td:first-child,.rst-content table.docutils th:first-child,.rst-content table.field-list td:first-child,.rst-content table.field-list th:first-child,.wy-table td:first-child,.wy-table th:first-child{border-left-width:0}.rst-content table.docutils thead,.rst-content table.field-list thead,.wy-table thead{color:#000;text-align:left;vertical-align:bottom;white-space:nowrap}.rst-content table.docutils thead th,.rst-content table.field-list thead th,.wy-table thead th{font-weight:700;border-bottom:2px solid #e1e4e5}.rst-content table.docutils td,.rst-content table.field-list td,.wy-table td{background-color:transparent;vertical-align:middle}.rst-content table.docutils td p,.rst-content table.field-list td p,.wy-table td p{line-height:18px}.rst-content table.docutils td p:last-child,.rst-content table.field-list td p:last-child,.wy-table td p:last-child{margin-bottom:0}.rst-content table.docutils .wy-table-cell-min,.rst-content table.field-list .wy-table-cell-min,.wy-table .wy-table-cell-min{width:1%;padding-right:0}.rst-content table.docutils .wy-table-cell-min input[type=checkbox],.rst-content table.field-list .wy-table-cell-min input[type=checkbox],.wy-table .wy-table-cell-min input[type=checkbox]{margin:0}.wy-table-secondary{color:grey;font-size:90%}.wy-table-tertiary{color:grey;font-size:80%}.rst-content table.docutils:not(.field-list) tr:nth-child(2n-1) td,.wy-table-backed,.wy-table-odd td,.wy-table-striped tr:nth-child(2n-1) td{background-color:#f3f6f6}.rst-content table.docutils,.wy-table-bordered-all{border:1px solid #e1e4e5}.rst-content table.docutils td,.wy-table-bordered-all td{border-bottom:1px solid #e1e4e5;border-left:1px solid #e1e4e5}.rst-content table.docutils tbody>tr:last-child td,.wy-table-bordered-all tbody>tr:last-child td{border-bottom-width:0}.wy-table-bordered{border:1px solid #e1e4e5}.wy-table-bordered-rows td{border-bottom:1px solid #e1e4e5}.wy-table-bordered-rows tbody>tr:last-child td{border-bottom-width:0}.wy-table-horizontal td,.wy-table-horizontal th{border-width:0 0 1px;border-bottom:1px solid #e1e4e5}.wy-table-horizontal tbody>tr:last-child td{border-bottom-width:0}.wy-table-responsive{margin-bottom:24px;max-width:100%;overflow:auto}.wy-table-responsive table{margin-bottom:0!important}.wy-table-responsive table td,.wy-table-responsive table th{white-space:nowrap}a{color:#2980b9;text-decoration:none;cursor:pointer}a:hover{color:#3091d1}a:visited{color:#9b59b6}html{height:100%}body,html{overflow-x:hidden}body{font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;font-weight:400;color:#404040;min-height:100%;background:#edf0f2}.wy-text-left{text-align:left}.wy-text-center{text-align:center}.wy-text-right{text-align:right}.wy-text-large{font-size:120%}.wy-text-normal{font-size:100%}.wy-text-small,small{font-size:80%}.wy-text-strike{text-decoration:line-through}.wy-text-warning{color:#e67e22!important}a.wy-text-warning:hover{color:#eb9950!important}.wy-text-info{color:#2980b9!important}a.wy-text-info:hover{color:#409ad5!important}.wy-text-success{color:#27ae60!important}a.wy-text-success:hover{color:#36d278!important}.wy-text-danger{color:#e74c3c!important}a.wy-text-danger:hover{color:#ed7669!important}.wy-text-neutral{color:#404040!important}a.wy-text-neutral:hover{color:#595959!important}.rst-content .toctree-wrapper>p.caption,h1,h2,h3,h4,h5,h6,legend{margin-top:0;font-weight:700;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif}p{line-height:24px;font-size:16px;margin:0 0 24px}h1{font-size:175%}.rst-content .toctree-wrapper>p.caption,h2{font-size:150%}h3{font-size:125%}h4{font-size:115%}h5{font-size:110%}h6{font-size:100%}hr{display:block;height:1px;border:0;border-top:1px solid #e1e4e5;margin:24px 0;padding:0}.rst-content code,.rst-content tt,code{white-space:nowrap;max-width:100%;background:#fff;border:1px solid #e1e4e5;font-size:75%;padding:0 5px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#e74c3c;overflow-x:auto}.rst-content tt.code-large,code.code-large{font-size:90%}.rst-content .section ul,.rst-content .toctree-wrapper ul,.rst-content section ul,.wy-plain-list-disc,article ul{list-style:disc;line-height:24px;margin-bottom:24px}.rst-content .section ul li,.rst-content .toctree-wrapper ul li,.rst-content section ul li,.wy-plain-list-disc li,article ul li{list-style:disc;margin-left:24px}.rst-content .section ul li p:last-child,.rst-content .section ul li ul,.rst-content .toctree-wrapper ul li p:last-child,.rst-content .toctree-wrapper ul li ul,.rst-content section ul li p:last-child,.rst-content section ul li ul,.wy-plain-list-disc li p:last-child,.wy-plain-list-disc li ul,article ul li p:last-child,article ul li ul{margin-bottom:0}.rst-content .section ul li li,.rst-content .toctree-wrapper ul li li,.rst-content section ul li li,.wy-plain-list-disc li li,article ul li li{list-style:circle}.rst-content .section ul li li li,.rst-content .toctree-wrapper ul li li li,.rst-content section ul li li li,.wy-plain-list-disc li li li,article ul li li li{list-style:square}.rst-content .section ul li ol li,.rst-content .toctree-wrapper ul li ol li,.rst-content section ul li ol li,.wy-plain-list-disc li ol li,article ul li ol li{list-style:decimal}.rst-content .section ol,.rst-content .section ol.arabic,.rst-content .toctree-wrapper ol,.rst-content .toctree-wrapper ol.arabic,.rst-content section ol,.rst-content section ol.arabic,.wy-plain-list-decimal,article ol{list-style:decimal;line-height:24px;margin-bottom:24px}.rst-content .section ol.arabic li,.rst-content .section ol li,.rst-content .toctree-wrapper ol.arabic li,.rst-content .toctree-wrapper ol li,.rst-content section ol.arabic li,.rst-content section ol li,.wy-plain-list-decimal li,article ol li{list-style:decimal;margin-left:24px}.rst-content .section ol.arabic li ul,.rst-content .section ol li p:last-child,.rst-content .section ol li ul,.rst-content .toctree-wrapper ol.arabic li ul,.rst-content .toctree-wrapper ol li p:last-child,.rst-content .toctree-wrapper ol li ul,.rst-content section ol.arabic li ul,.rst-content section ol li p:last-child,.rst-content section ol li ul,.wy-plain-list-decimal li p:last-child,.wy-plain-list-decimal li ul,article ol li p:last-child,article ol li ul{margin-bottom:0}.rst-content .section ol.arabic li ul li,.rst-content .section ol li ul li,.rst-content .toctree-wrapper ol.arabic li ul li,.rst-content .toctree-wrapper ol li ul li,.rst-content section ol.arabic li ul li,.rst-content section ol li ul li,.wy-plain-list-decimal li ul li,article ol li ul li{list-style:disc}.wy-breadcrumbs{*zoom:1}.wy-breadcrumbs:after,.wy-breadcrumbs:before{display:table;content:""}.wy-breadcrumbs:after{clear:both}.wy-breadcrumbs>li{display:inline-block;padding-top:5px}.wy-breadcrumbs>li.wy-breadcrumbs-aside{float:right}.rst-content .wy-breadcrumbs>li code,.rst-content .wy-breadcrumbs>li tt,.wy-breadcrumbs>li .rst-content tt,.wy-breadcrumbs>li code{all:inherit;color:inherit}.breadcrumb-item:before{content:"/";color:#bbb;font-size:13px;padding:0 6px 0 3px}.wy-breadcrumbs-extra{margin-bottom:0;color:#b3b3b3;font-size:80%;display:inline-block}@media screen and (max-width:480px){.wy-breadcrumbs-extra,.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}@media print{.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}html{font-size:16px}.wy-affix{position:fixed;top:1.618em}.wy-menu a:hover{text-decoration:none}.wy-menu-horiz{*zoom:1}.wy-menu-horiz:after,.wy-menu-horiz:before{display:table;content:""}.wy-menu-horiz:after{clear:both}.wy-menu-horiz li,.wy-menu-horiz ul{display:inline-block}.wy-menu-horiz li:hover{background:hsla(0,0%,100%,.1)}.wy-menu-horiz li.divide-left{border-left:1px solid #404040}.wy-menu-horiz li.divide-right{border-right:1px solid #404040}.wy-menu-horiz a{height:32px;display:inline-block;line-height:32px;padding:0 16px}.wy-menu-vertical{width:300px}.wy-menu-vertical header,.wy-menu-vertical p.caption{color:#55a5d9;height:32px;line-height:32px;padding:0 1.618em;margin:12px 0 0;display:block;font-weight:700;text-transform:uppercase;font-size:85%;white-space:nowrap}.wy-menu-vertical ul{margin-bottom:0}.wy-menu-vertical li.divide-top{border-top:1px solid #404040}.wy-menu-vertical li.divide-bottom{border-bottom:1px solid #404040}.wy-menu-vertical li.current{background:#e3e3e3}.wy-menu-vertical li.current a{color:grey;border-right:1px solid #c9c9c9;padding:.4045em 2.427em}.wy-menu-vertical li.current a:hover{background:#d6d6d6}.rst-content .wy-menu-vertical li tt,.wy-menu-vertical li .rst-content tt,.wy-menu-vertical li code{border:none;background:inherit;color:inherit;padding-left:0;padding-right:0}.wy-menu-vertical li button.toctree-expand{display:block;float:left;margin-left:-1.2em;line-height:18px;color:#4d4d4d;border:none;background:none;padding:0}.wy-menu-vertical li.current>a,.wy-menu-vertical li.on a{color:#404040;font-weight:700;position:relative;background:#fcfcfc;border:none;padding:.4045em 1.618em}.wy-menu-vertical li.current>a:hover,.wy-menu-vertical li.on a:hover{background:#fcfcfc}.wy-menu-vertical li.current>a:hover button.toctree-expand,.wy-menu-vertical li.on a:hover button.toctree-expand{color:grey}.wy-menu-vertical li.current>a button.toctree-expand,.wy-menu-vertical li.on a button.toctree-expand{display:block;line-height:18px;color:#333}.wy-menu-vertical li.toctree-l1.current>a{border-bottom:1px solid #c9c9c9;border-top:1px solid #c9c9c9}.wy-menu-vertical .toctree-l1.current .toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .toctree-l11>ul{display:none}.wy-menu-vertical .toctree-l1.current .current.toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .current.toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .current.toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .current.toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .current.toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .current.toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .current.toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .current.toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .current.toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .current.toctree-l11>ul{display:block}.wy-menu-vertical li.toctree-l3,.wy-menu-vertical li.toctree-l4{font-size:.9em}.wy-menu-vertical li.toctree-l2 a,.wy-menu-vertical li.toctree-l3 a,.wy-menu-vertical li.toctree-l4 a,.wy-menu-vertical li.toctree-l5 a,.wy-menu-vertical li.toctree-l6 a,.wy-menu-vertical li.toctree-l7 a,.wy-menu-vertical li.toctree-l8 a,.wy-menu-vertical li.toctree-l9 a,.wy-menu-vertical li.toctree-l10 a{color:#404040}.wy-menu-vertical li.toctree-l2 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l3 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l4 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l5 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l6 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l7 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l8 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l9 a:hover button.toctree-expand,.wy-menu-vertical li.toctree-l10 a:hover button.toctree-expand{color:grey}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{display:block}.wy-menu-vertical li.toctree-l2.current>a{padding:.4045em 2.427em}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{padding:.4045em 1.618em .4045em 4.045em}.wy-menu-vertical li.toctree-l3.current>a{padding:.4045em 4.045em}.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{padding:.4045em 1.618em .4045em 5.663em}.wy-menu-vertical li.toctree-l4.current>a{padding:.4045em 5.663em}.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a{padding:.4045em 1.618em .4045em 7.281em}.wy-menu-vertical li.toctree-l5.current>a{padding:.4045em 7.281em}.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a{padding:.4045em 1.618em .4045em 8.899em}.wy-menu-vertical li.toctree-l6.current>a{padding:.4045em 8.899em}.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a{padding:.4045em 1.618em .4045em 10.517em}.wy-menu-vertical li.toctree-l7.current>a{padding:.4045em 10.517em}.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a{padding:.4045em 1.618em .4045em 12.135em}.wy-menu-vertical li.toctree-l8.current>a{padding:.4045em 12.135em}.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a{padding:.4045em 1.618em .4045em 13.753em}.wy-menu-vertical li.toctree-l9.current>a{padding:.4045em 13.753em}.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a{padding:.4045em 1.618em .4045em 15.371em}.wy-menu-vertical li.toctree-l10.current>a{padding:.4045em 15.371em}.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{padding:.4045em 1.618em .4045em 16.989em}.wy-menu-vertical li.toctree-l2.current>a,.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{background:#c9c9c9}.wy-menu-vertical li.toctree-l2 button.toctree-expand{color:#a3a3a3}.wy-menu-vertical li.toctree-l3.current>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{background:#bdbdbd}.wy-menu-vertical li.toctree-l3 button.toctree-expand{color:#969696}.wy-menu-vertical li.current ul{display:block}.wy-menu-vertical li ul{margin-bottom:0;display:none}.wy-menu-vertical li ul li a{margin-bottom:0;color:#d9d9d9;font-weight:400}.wy-menu-vertical a{line-height:18px;padding:.4045em 1.618em;display:block;position:relative;font-size:90%;color:#d9d9d9}.wy-menu-vertical a:hover{background-color:#4e4a4a;cursor:pointer}.wy-menu-vertical a:hover button.toctree-expand{color:#d9d9d9}.wy-menu-vertical a:active{background-color:#2980b9;cursor:pointer;color:#fff}.wy-menu-vertical a:active button.toctree-expand{color:#fff}.wy-side-nav-search{display:block;width:300px;padding:.809em;margin-bottom:.809em;z-index:200;background-color:#2980b9;text-align:center;color:#fcfcfc}.wy-side-nav-search input[type=text]{width:100%;border-radius:50px;padding:6px 12px;border-color:#2472a4}.wy-side-nav-search img{display:block;margin:auto auto .809em;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a{color:#fcfcfc;font-size:100%;font-weight:700;display:inline-block;padding:4px 6px;margin-bottom:.809em;max-width:100%}.wy-side-nav-search .wy-dropdown>a:hover,.wy-side-nav-search>a:hover{background:hsla(0,0%,100%,.1)}.wy-side-nav-search .wy-dropdown>a img.logo,.wy-side-nav-search>a img.logo{display:block;margin:0 auto;height:auto;width:auto;border-radius:0;max-width:100%;background:transparent}.wy-side-nav-search .wy-dropdown>a.icon img.logo,.wy-side-nav-search>a.icon img.logo{margin-top:.85em}.wy-side-nav-search>div.version{margin-top:-.4045em;margin-bottom:.809em;font-weight:400;color:hsla(0,0%,100%,.3)}.wy-nav .wy-menu-vertical header{color:#2980b9}.wy-nav .wy-menu-vertical a{color:#b3b3b3}.wy-nav .wy-menu-vertical a:hover{background-color:#2980b9;color:#fff}[data-menu-wrap]{-webkit-transition:all .2s ease-in;-moz-transition:all .2s ease-in;transition:all .2s ease-in;position:absolute;opacity:1;width:100%;opacity:0}[data-menu-wrap].move-center{left:0;right:auto;opacity:1}[data-menu-wrap].move-left{right:auto;left:-100%;opacity:0}[data-menu-wrap].move-right{right:-100%;left:auto;opacity:0}.wy-body-for-nav{background:#fcfcfc}.wy-grid-for-nav{position:absolute;width:100%;height:100%}.wy-nav-side{position:fixed;top:0;bottom:0;left:0;padding-bottom:2em;width:300px;overflow-x:hidden;overflow-y:hidden;min-height:100%;color:#9b9b9b;background:#343131;z-index:200}.wy-side-scroll{width:320px;position:relative;overflow-x:hidden;overflow-y:scroll;height:100%}.wy-nav-top{display:none;background:#2980b9;color:#fff;padding:.4045em .809em;position:relative;line-height:50px;text-align:center;font-size:100%;*zoom:1}.wy-nav-top:after,.wy-nav-top:before{display:table;content:""}.wy-nav-top:after{clear:both}.wy-nav-top a{color:#fff;font-weight:700}.wy-nav-top img{margin-right:12px;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-nav-top i{font-size:30px;float:left;cursor:pointer;padding-top:inherit}.wy-nav-content-wrap{margin-left:300px;background:#fcfcfc;min-height:100%}.wy-nav-content{padding:1.618em 3.236em;height:100%;max-width:800px;margin:auto}.wy-body-mask{position:fixed;width:100%;height:100%;background:rgba(0,0,0,.2);display:none;z-index:499}.wy-body-mask.on{display:block}footer{color:grey}footer p{margin-bottom:12px}.rst-content footer span.commit tt,footer span.commit .rst-content tt,footer span.commit code{padding:0;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:1em;background:none;border:none;color:grey}.rst-footer-buttons{*zoom:1}.rst-footer-buttons:after,.rst-footer-buttons:before{width:100%;display:table;content:""}.rst-footer-buttons:after{clear:both}.rst-breadcrumbs-buttons{margin-top:12px;*zoom:1}.rst-breadcrumbs-buttons:after,.rst-breadcrumbs-buttons:before{display:table;content:""}.rst-breadcrumbs-buttons:after{clear:both}#search-results .search li{margin-bottom:24px;border-bottom:1px solid #e1e4e5;padding-bottom:24px}#search-results .search li:first-child{border-top:1px solid #e1e4e5;padding-top:24px}#search-results .search li a{font-size:120%;margin-bottom:12px;display:inline-block}#search-results .context{color:grey;font-size:90%}.genindextable li>ul{margin-left:24px}@media screen and (max-width:768px){.wy-body-for-nav{background:#fcfcfc}.wy-nav-top{display:block}.wy-nav-side{left:-300px}.wy-nav-side.shift{width:85%;left:0}.wy-menu.wy-menu-vertical,.wy-side-nav-search,.wy-side-scroll{width:auto}.wy-nav-content-wrap{margin-left:0}.wy-nav-content-wrap .wy-nav-content{padding:1.618em}.wy-nav-content-wrap.shift{position:fixed;min-width:100%;left:85%;top:0;height:100%;overflow:hidden}}@media screen and (min-width:1100px){.wy-nav-content-wrap{background:rgba(0,0,0,.05)}.wy-nav-content{margin:0;background:#fcfcfc}}@media print{.rst-versions,.wy-nav-side,footer{display:none}.wy-nav-content-wrap{margin-left:0}}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60;*zoom:1}.rst-versions .rst-current-version:after,.rst-versions .rst-current-version:before{display:table;content:""}.rst-versions .rst-current-version:after{clear:both}.rst-content .code-block-caption .rst-versions .rst-current-version .headerlink,.rst-content .eqno .rst-versions .rst-current-version .headerlink,.rst-content .rst-versions .rst-current-version .admonition-title,.rst-content code.download .rst-versions .rst-current-version span:first-child,.rst-content dl dt .rst-versions .rst-current-version .headerlink,.rst-content h1 .rst-versions .rst-current-version .headerlink,.rst-content h2 .rst-versions .rst-current-version .headerlink,.rst-content h3 .rst-versions .rst-current-version .headerlink,.rst-content h4 .rst-versions .rst-current-version .headerlink,.rst-content h5 .rst-versions .rst-current-version .headerlink,.rst-content h6 .rst-versions .rst-current-version .headerlink,.rst-content p .rst-versions .rst-current-version .headerlink,.rst-content table>caption .rst-versions .rst-current-version .headerlink,.rst-content tt.download .rst-versions .rst-current-version span:first-child,.rst-versions .rst-current-version .fa,.rst-versions .rst-current-version .icon,.rst-versions .rst-current-version .rst-content .admonition-title,.rst-versions .rst-current-version .rst-content .code-block-caption .headerlink,.rst-versions .rst-current-version .rst-content .eqno .headerlink,.rst-versions .rst-current-version .rst-content code.download span:first-child,.rst-versions .rst-current-version .rst-content dl dt .headerlink,.rst-versions .rst-current-version .rst-content h1 .headerlink,.rst-versions .rst-current-version .rst-content h2 .headerlink,.rst-versions .rst-current-version .rst-content h3 .headerlink,.rst-versions .rst-current-version .rst-content h4 .headerlink,.rst-versions .rst-current-version .rst-content h5 .headerlink,.rst-versions .rst-current-version .rst-content h6 .headerlink,.rst-versions .rst-current-version .rst-content p .headerlink,.rst-versions .rst-current-version .rst-content table>caption .headerlink,.rst-versions .rst-current-version .rst-content tt.download span:first-child,.rst-versions .rst-current-version .wy-menu-vertical li button.toctree-expand,.wy-menu-vertical li .rst-versions .rst-current-version button.toctree-expand{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}.rst-content .toctree-wrapper>p.caption,.rst-content h1,.rst-content h2,.rst-content h3,.rst-content h4,.rst-content h5,.rst-content h6{margin-bottom:24px}.rst-content img{max-width:100%;height:auto}.rst-content div.figure,.rst-content figure{margin-bottom:24px}.rst-content div.figure .caption-text,.rst-content figure .caption-text{font-style:italic}.rst-content div.figure p:last-child.caption,.rst-content figure p:last-child.caption{margin-bottom:0}.rst-content div.figure.align-center,.rst-content figure.align-center{text-align:center}.rst-content .section>a>img,.rst-content .section>img,.rst-content section>a>img,.rst-content section>img{margin-bottom:24px}.rst-content abbr[title]{text-decoration:none}.rst-content.style-external-links a.reference.external:after{font-family:FontAwesome;content:"\f08e";color:#b3b3b3;vertical-align:super;font-size:60%;margin:0 .2em}.rst-content blockquote{margin-left:24px;line-height:24px;margin-bottom:24px}.rst-content pre.literal-block{white-space:pre;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;display:block;overflow:auto}.rst-content div[class^=highlight],.rst-content pre.literal-block{border:1px solid #e1e4e5;overflow-x:auto;margin:1px 0 24px}.rst-content div[class^=highlight] div[class^=highlight],.rst-content pre.literal-block div[class^=highlight]{padding:0;border:none;margin:0}.rst-content div[class^=highlight] td.code{width:100%}.rst-content .linenodiv pre{border-right:1px solid #e6e9ea;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;user-select:none;pointer-events:none}.rst-content div[class^=highlight] pre{white-space:pre;margin:0;padding:12px;display:block;overflow:auto}.rst-content div[class^=highlight] pre .hll{display:block;margin:0 -12px;padding:0 12px}.rst-content .linenodiv pre,.rst-content div[class^=highlight] pre,.rst-content pre.literal-block{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:12px;line-height:1.4}.rst-content div.highlight .gp,.rst-content div.highlight span.linenos{user-select:none;pointer-events:none}.rst-content div.highlight span.linenos{display:inline-block;padding-left:0;padding-right:12px;margin-right:12px;border-right:1px solid #e6e9ea}.rst-content .code-block-caption{font-style:italic;font-size:85%;line-height:1;padding:1em 0;text-align:center}@media print{.rst-content .codeblock,.rst-content div[class^=highlight],.rst-content div[class^=highlight] pre{white-space:pre-wrap}}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning{clear:both}.rst-content .admonition-todo .last,.rst-content .admonition-todo>:last-child,.rst-content .admonition .last,.rst-content .admonition>:last-child,.rst-content .attention .last,.rst-content .attention>:last-child,.rst-content .caution .last,.rst-content .caution>:last-child,.rst-content .danger .last,.rst-content .danger>:last-child,.rst-content .error .last,.rst-content .error>:last-child,.rst-content .hint .last,.rst-content .hint>:last-child,.rst-content .important .last,.rst-content .important>:last-child,.rst-content .note .last,.rst-content .note>:last-child,.rst-content .seealso .last,.rst-content .seealso>:last-child,.rst-content .tip .last,.rst-content .tip>:last-child,.rst-content .warning .last,.rst-content .warning>:last-child{margin-bottom:0}.rst-content .admonition-title:before{margin-right:4px}.rst-content .admonition table{border-color:rgba(0,0,0,.1)}.rst-content .admonition table td,.rst-content .admonition table th{background:transparent!important;border-color:rgba(0,0,0,.1)!important}.rst-content .section ol.loweralpha,.rst-content .section ol.loweralpha>li,.rst-content .toctree-wrapper ol.loweralpha,.rst-content .toctree-wrapper ol.loweralpha>li,.rst-content section ol.loweralpha,.rst-content section ol.loweralpha>li{list-style:lower-alpha}.rst-content .section ol.upperalpha,.rst-content .section ol.upperalpha>li,.rst-content .toctree-wrapper ol.upperalpha,.rst-content .toctree-wrapper ol.upperalpha>li,.rst-content section ol.upperalpha,.rst-content section ol.upperalpha>li{list-style:upper-alpha}.rst-content .section ol li>*,.rst-content .section ul li>*,.rst-content .toctree-wrapper ol li>*,.rst-content .toctree-wrapper ul li>*,.rst-content section ol li>*,.rst-content section ul li>*{margin-top:12px;margin-bottom:12px}.rst-content .section ol li>:first-child,.rst-content .section ul li>:first-child,.rst-content .toctree-wrapper ol li>:first-child,.rst-content .toctree-wrapper ul li>:first-child,.rst-content section ol li>:first-child,.rst-content section ul li>:first-child{margin-top:0}.rst-content .section ol li>p,.rst-content .section ol li>p:last-child,.rst-content .section ul li>p,.rst-content .section ul li>p:last-child,.rst-content .toctree-wrapper ol li>p,.rst-content .toctree-wrapper ol li>p:last-child,.rst-content .toctree-wrapper ul li>p,.rst-content .toctree-wrapper ul li>p:last-child,.rst-content section ol li>p,.rst-content section ol li>p:last-child,.rst-content section ul li>p,.rst-content section ul li>p:last-child{margin-bottom:12px}.rst-content .section ol li>p:only-child,.rst-content .section ol li>p:only-child:last-child,.rst-content .section ul li>p:only-child,.rst-content .section ul li>p:only-child:last-child,.rst-content .toctree-wrapper ol li>p:only-child,.rst-content .toctree-wrapper ol li>p:only-child:last-child,.rst-content .toctree-wrapper ul li>p:only-child,.rst-content .toctree-wrapper ul li>p:only-child:last-child,.rst-content section ol li>p:only-child,.rst-content section ol li>p:only-child:last-child,.rst-content section ul li>p:only-child,.rst-content section ul li>p:only-child:last-child{margin-bottom:0}.rst-content .section ol li>ol,.rst-content .section ol li>ul,.rst-content .section ul li>ol,.rst-content .section ul li>ul,.rst-content .toctree-wrapper ol li>ol,.rst-content .toctree-wrapper ol li>ul,.rst-content .toctree-wrapper ul li>ol,.rst-content .toctree-wrapper ul li>ul,.rst-content section ol li>ol,.rst-content section ol li>ul,.rst-content section ul li>ol,.rst-content section ul li>ul{margin-bottom:12px}.rst-content .section ol.simple li>*,.rst-content .section ol.simple li ol,.rst-content .section ol.simple li ul,.rst-content .section ul.simple li>*,.rst-content .section ul.simple li ol,.rst-content .section ul.simple li ul,.rst-content .toctree-wrapper ol.simple li>*,.rst-content .toctree-wrapper ol.simple li ol,.rst-content .toctree-wrapper ol.simple li ul,.rst-content .toctree-wrapper ul.simple li>*,.rst-content .toctree-wrapper ul.simple li ol,.rst-content .toctree-wrapper ul.simple li ul,.rst-content section ol.simple li>*,.rst-content section ol.simple li ol,.rst-content section ol.simple li ul,.rst-content section ul.simple li>*,.rst-content section ul.simple li ol,.rst-content section ul.simple li ul{margin-top:0;margin-bottom:0}.rst-content .line-block{margin-left:0;margin-bottom:24px;line-height:24px}.rst-content .line-block .line-block{margin-left:24px;margin-bottom:0}.rst-content .topic-title{font-weight:700;margin-bottom:12px}.rst-content .toc-backref{color:#404040}.rst-content .align-right{float:right;margin:0 0 24px 24px}.rst-content .align-left{float:left;margin:0 24px 24px 0}.rst-content .align-center{margin:auto}.rst-content .align-center:not(table){display:block}.rst-content .code-block-caption .headerlink,.rst-content .eqno .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content p .headerlink,.rst-content table>caption .headerlink{opacity:0;font-size:14px;font-family:FontAwesome;margin-left:.5em}.rst-content .code-block-caption .headerlink:focus,.rst-content .code-block-caption:hover .headerlink,.rst-content .eqno .headerlink:focus,.rst-content .eqno:hover .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink:focus,.rst-content .toctree-wrapper>p.caption:hover .headerlink,.rst-content dl dt .headerlink:focus,.rst-content dl dt:hover .headerlink,.rst-content h1 .headerlink:focus,.rst-content h1:hover .headerlink,.rst-content h2 .headerlink:focus,.rst-content h2:hover .headerlink,.rst-content h3 .headerlink:focus,.rst-content h3:hover .headerlink,.rst-content h4 .headerlink:focus,.rst-content h4:hover .headerlink,.rst-content h5 .headerlink:focus,.rst-content h5:hover .headerlink,.rst-content h6 .headerlink:focus,.rst-content h6:hover .headerlink,.rst-content p.caption .headerlink:focus,.rst-content p.caption:hover .headerlink,.rst-content p .headerlink:focus,.rst-content p:hover .headerlink,.rst-content table>caption .headerlink:focus,.rst-content table>caption:hover .headerlink{opacity:1}.rst-content p a{overflow-wrap:anywhere}.rst-content .wy-table td p,.rst-content .wy-table td ul,.rst-content .wy-table th p,.rst-content .wy-table th ul,.rst-content table.docutils td p,.rst-content table.docutils td ul,.rst-content table.docutils th p,.rst-content table.docutils th ul,.rst-content table.field-list td p,.rst-content table.field-list td ul,.rst-content table.field-list th p,.rst-content table.field-list th ul{font-size:inherit}.rst-content .btn:focus{outline:2px solid}.rst-content table>caption .headerlink:after{font-size:12px}.rst-content .centered{text-align:center}.rst-content .sidebar{float:right;width:40%;display:block;margin:0 0 24px 24px;padding:24px;background:#f3f6f6;border:1px solid #e1e4e5}.rst-content .sidebar dl,.rst-content .sidebar p,.rst-content .sidebar ul{font-size:90%}.rst-content .sidebar .last,.rst-content .sidebar>:last-child{margin-bottom:0}.rst-content .sidebar .sidebar-title{display:block;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif;font-weight:700;background:#e1e4e5;padding:6px 12px;margin:-24px -24px 24px;font-size:100%}.rst-content .highlighted{background:#f1c40f;box-shadow:0 0 0 2px #f1c40f;display:inline;font-weight:700}.rst-content .citation-reference,.rst-content .footnote-reference{vertical-align:baseline;position:relative;top:-.4em;line-height:0;font-size:90%}.rst-content .citation-reference>span.fn-bracket,.rst-content .footnote-reference>span.fn-bracket{display:none}.rst-content .hlist{width:100%}.rst-content dl dt span.classifier:before{content:" : "}.rst-content dl dt span.classifier-delimiter{display:none!important}html.writer-html4 .rst-content table.docutils.citation,html.writer-html4 .rst-content table.docutils.footnote{background:none;border:none}html.writer-html4 .rst-content table.docutils.citation td,html.writer-html4 .rst-content table.docutils.citation tr,html.writer-html4 .rst-content table.docutils.footnote td,html.writer-html4 .rst-content table.docutils.footnote tr{border:none;background-color:transparent!important;white-space:normal}html.writer-html4 .rst-content table.docutils.citation td.label,html.writer-html4 .rst-content table.docutils.footnote td.label{padding-left:0;padding-right:0;vertical-align:top}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{display:grid;grid-template-columns:auto minmax(80%,95%)}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{display:inline-grid;grid-template-columns:max-content auto}html.writer-html5 .rst-content aside.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content div.citation{display:grid;grid-template-columns:auto auto minmax(.65rem,auto) minmax(40%,95%)}html.writer-html5 .rst-content aside.citation>span.label,html.writer-html5 .rst-content aside.footnote>span.label,html.writer-html5 .rst-content div.citation>span.label{grid-column-start:1;grid-column-end:2}html.writer-html5 .rst-content aside.citation>span.backrefs,html.writer-html5 .rst-content aside.footnote>span.backrefs,html.writer-html5 .rst-content div.citation>span.backrefs{grid-column-start:2;grid-column-end:3;grid-row-start:1;grid-row-end:3}html.writer-html5 .rst-content aside.citation>p,html.writer-html5 .rst-content aside.footnote>p,html.writer-html5 .rst-content div.citation>p{grid-column-start:4;grid-column-end:5}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{margin-bottom:24px}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{padding-left:1rem}html.writer-html5 .rst-content dl.citation>dd,html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.field-list>dd,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dd,html.writer-html5 .rst-content dl.footnote>dt{margin-bottom:0}html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.footnote{font-size:.9rem}html.writer-html5 .rst-content dl.citation>dt,html.writer-html5 .rst-content dl.footnote>dt{margin:0 .5rem .5rem 0;line-height:1.2rem;word-break:break-all;font-weight:400}html.writer-html5 .rst-content dl.citation>dt>span.brackets:before,html.writer-html5 .rst-content dl.footnote>dt>span.brackets:before{content:"["}html.writer-html5 .rst-content dl.citation>dt>span.brackets:after,html.writer-html5 .rst-content dl.footnote>dt>span.brackets:after{content:"]"}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref{text-align:left;font-style:italic;margin-left:.65rem;word-break:break-word;word-spacing:-.1rem;max-width:5rem}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref>a,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref>a{word-break:keep-all}html.writer-html5 .rst-content dl.citation>dt>span.fn-backref>a:not(:first-child):before,html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref>a:not(:first-child):before{content:" "}html.writer-html5 .rst-content dl.citation>dd,html.writer-html5 .rst-content dl.footnote>dd{margin:0 0 .5rem;line-height:1.2rem}html.writer-html5 .rst-content dl.citation>dd p,html.writer-html5 .rst-content dl.footnote>dd p{font-size:.9rem}html.writer-html5 .rst-content aside.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content div.citation{padding-left:1rem;padding-right:1rem;font-size:.9rem;line-height:1.2rem}html.writer-html5 .rst-content aside.citation p,html.writer-html5 .rst-content aside.footnote p,html.writer-html5 .rst-content div.citation p{font-size:.9rem;line-height:1.2rem;margin-bottom:12px}html.writer-html5 .rst-content aside.citation span.backrefs,html.writer-html5 .rst-content aside.footnote span.backrefs,html.writer-html5 .rst-content div.citation span.backrefs{text-align:left;font-style:italic;margin-left:.65rem;word-break:break-word;word-spacing:-.1rem;max-width:5rem}html.writer-html5 .rst-content aside.citation span.backrefs>a,html.writer-html5 .rst-content aside.footnote span.backrefs>a,html.writer-html5 .rst-content div.citation span.backrefs>a{word-break:keep-all}html.writer-html5 .rst-content aside.citation span.backrefs>a:not(:first-child):before,html.writer-html5 .rst-content aside.footnote span.backrefs>a:not(:first-child):before,html.writer-html5 .rst-content div.citation span.backrefs>a:not(:first-child):before{content:" "}html.writer-html5 .rst-content aside.citation span.label,html.writer-html5 .rst-content aside.footnote span.label,html.writer-html5 .rst-content div.citation span.label{line-height:1.2rem}html.writer-html5 .rst-content aside.citation-list,html.writer-html5 .rst-content aside.footnote-list,html.writer-html5 .rst-content div.citation-list{margin-bottom:24px}html.writer-html5 .rst-content dl.option-list kbd{font-size:.9rem}.rst-content table.docutils.footnote,html.writer-html4 .rst-content table.docutils.citation,html.writer-html5 .rst-content aside.footnote,html.writer-html5 .rst-content aside.footnote-list aside.footnote,html.writer-html5 .rst-content div.citation-list>div.citation,html.writer-html5 .rst-content dl.citation,html.writer-html5 .rst-content dl.footnote{color:grey}.rst-content table.docutils.footnote code,.rst-content table.docutils.footnote tt,html.writer-html4 .rst-content table.docutils.citation code,html.writer-html4 .rst-content table.docutils.citation tt,html.writer-html5 .rst-content aside.footnote-list aside.footnote code,html.writer-html5 .rst-content aside.footnote-list aside.footnote tt,html.writer-html5 .rst-content aside.footnote code,html.writer-html5 .rst-content aside.footnote tt,html.writer-html5 .rst-content div.citation-list>div.citation code,html.writer-html5 .rst-content div.citation-list>div.citation tt,html.writer-html5 .rst-content dl.citation code,html.writer-html5 .rst-content dl.citation tt,html.writer-html5 .rst-content dl.footnote code,html.writer-html5 .rst-content dl.footnote tt{color:#555}.rst-content .wy-table-responsive.citation,.rst-content .wy-table-responsive.footnote{margin-bottom:0}.rst-content .wy-table-responsive.citation+:not(.citation),.rst-content .wy-table-responsive.footnote+:not(.footnote){margin-top:24px}.rst-content .wy-table-responsive.citation:last-child,.rst-content .wy-table-responsive.footnote:last-child{margin-bottom:24px}.rst-content table.docutils th{border-color:#e1e4e5}html.writer-html5 .rst-content table.docutils th{border:1px solid #e1e4e5}html.writer-html5 .rst-content table.docutils td>p,html.writer-html5 .rst-content table.docutils th>p{line-height:1rem;margin-bottom:0;font-size:.9rem}.rst-content table.docutils td .last,.rst-content table.docutils td .last>:last-child{margin-bottom:0}.rst-content table.field-list,.rst-content table.field-list td{border:none}.rst-content table.field-list td p{line-height:inherit}.rst-content table.field-list td>strong{display:inline-block}.rst-content table.field-list .field-name{padding-right:10px;text-align:left;white-space:nowrap}.rst-content table.field-list .field-body{text-align:left}.rst-content code,.rst-content tt{color:#000;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;padding:2px 5px}.rst-content code big,.rst-content code em,.rst-content tt big,.rst-content tt em{font-size:100%!important;line-height:normal}.rst-content code.literal,.rst-content tt.literal{color:#e74c3c;white-space:normal}.rst-content code.xref,.rst-content tt.xref,a .rst-content code,a .rst-content tt{font-weight:700;color:#404040;overflow-wrap:normal}.rst-content kbd,.rst-content pre,.rst-content samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace}.rst-content a code,.rst-content a tt{color:#2980b9}.rst-content dl{margin-bottom:24px}.rst-content dl dt{font-weight:700;margin-bottom:12px}.rst-content dl ol,.rst-content dl p,.rst-content dl table,.rst-content dl ul{margin-bottom:12px}.rst-content dl dd{margin:0 0 12px 24px;line-height:24px}.rst-content dl dd>ol:last-child,.rst-content dl dd>p:last-child,.rst-content dl dd>table:last-child,.rst-content dl dd>ul:last-child{margin-bottom:0}html.writer-html4 .rst-content dl:not(.docutils),html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple){margin-bottom:24px}html.writer-html4 .rst-content dl:not(.docutils)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt{display:table;margin:6px 0;font-size:90%;line-height:normal;background:#e7f2fa;color:#2980b9;border-top:3px solid #6ab0de;padding:6px;position:relative}html.writer-html4 .rst-content dl:not(.docutils)>dt:before,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt:before{color:#6ab0de}html.writer-html4 .rst-content dl:not(.docutils)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt{margin-bottom:6px;border:none;border-left:3px solid #ccc;background:#f0f0f0;color:#555}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) dl:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils)>dt:first-child,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple)>dt:first-child{margin-top:0}html.writer-html4 .rst-content dl:not(.docutils) code.descclassname,html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descclassname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descname{background-color:transparent;border:none;padding:0;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) tt.descname{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .optional,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .optional{display:inline-block;padding:0 4px;color:#000;font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .property,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .property{display:inline-block;padding-right:8px;max-width:100%}html.writer-html4 .rst-content dl:not(.docutils) .k,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .k{font-style:italic}html.writer-html4 .rst-content dl:not(.docutils) .descclassname,html.writer-html4 .rst-content dl:not(.docutils) .descname,html.writer-html4 .rst-content dl:not(.docutils) .sig-name,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.citation):not(.glossary):not(.simple) .sig-name{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#000}.rst-content .viewcode-back,.rst-content .viewcode-link{display:inline-block;color:#27ae60;font-size:80%;padding-left:24px}.rst-content .viewcode-back{display:block;float:right}.rst-content p.rubric{margin-bottom:12px;font-weight:700}.rst-content code.download,.rst-content tt.download{background:inherit;padding:inherit;font-weight:400;font-family:inherit;font-size:inherit;color:inherit;border:inherit;white-space:inherit}.rst-content code.download span:first-child,.rst-content tt.download span:first-child{-webkit-font-smoothing:subpixel-antialiased}.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{margin-right:4px}.rst-content .guilabel,.rst-content .menuselection{font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px}.rst-content .guilabel,.rst-content .menuselection{border:1px solid #7fbbe3;background:#e7f2fa}.rst-content :not(dl.option-list)>:not(dt):not(kbd):not(.kbd)>.kbd,.rst-content :not(dl.option-list)>:not(dt):not(kbd):not(.kbd)>kbd{color:inherit;font-size:80%;background-color:#fff;border:1px solid #a6a6a6;border-radius:4px;box-shadow:0 2px grey;padding:2.4px 6px;margin:auto 0}.rst-content .versionmodified{font-style:italic}@media screen and (max-width:480px){.rst-content .sidebar{width:100%}}span[id*=MathJax-Span]{color:#404040}.math{text-align:center}@font-face{font-family:Lato;src:url(fonts/lato-normal.woff2?bd03a2cc277bbbc338d464e679fe9942) format("woff2"),url(fonts/lato-normal.woff?27bd77b9162d388cb8d4c4217c7c5e2a) format("woff");font-weight:400;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold.woff2?cccb897485813c7c256901dbca54ecf2) format("woff2"),url(fonts/lato-bold.woff?d878b6c29b10beca227e9eef4246111b) format("woff");font-weight:700;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold-italic.woff2?0b6bb6725576b072c5d0b02ecdd1900d) format("woff2"),url(fonts/lato-bold-italic.woff?9c7e4e9eb485b4a121c760e61bc3707c) format("woff");font-weight:700;font-style:italic;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-normal-italic.woff2?4eb103b4d12be57cb1d040ed5e162e9d) format("woff2"),url(fonts/lato-normal-italic.woff?f28f2d6482446544ef1ea1ccc6dd5892) format("woff");font-weight:400;font-style:italic;font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:400;src:url(fonts/Roboto-Slab-Regular.woff2?7abf5b8d04d26a2cafea937019bca958) format("woff2"),url(fonts/Roboto-Slab-Regular.woff?c1be9284088d487c5e3ff0a10a92e58c) format("woff");font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:700;src:url(fonts/Roboto-Slab-Bold.woff2?9984f4a9bda09be08e83f2506954adbe) format("woff2"),url(fonts/Roboto-Slab-Bold.woff?bed5564a116b05148e3b3bea6fb1162a) format("woff");font-display:block} \ No newline at end of file diff --git a/docs/_static/custom.css b/docs/_static/custom.css new file mode 100644 index 0000000..ade5d6e --- /dev/null +++ b/docs/_static/custom.css @@ -0,0 +1,11 @@ +.wy-side-nav-search { + background-color: #082484; +} + +.wy-side-nav-search>div.version { + color: #ffffff +} + +.wy-nav-top { + background-color: #082484; +} \ No newline at end of file diff --git a/docs/_static/doctools.js b/docs/_static/doctools.js new file mode 100644 index 0000000..527b876 --- /dev/null +++ b/docs/_static/doctools.js @@ -0,0 +1,156 @@ +/* + * doctools.js + * ~~~~~~~~~~~ + * + * Base JavaScript utilities for all Sphinx HTML documentation. + * + * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ +"use strict"; + +const BLACKLISTED_KEY_CONTROL_ELEMENTS = new Set([ + "TEXTAREA", + "INPUT", + "SELECT", + "BUTTON", +]); + +const _ready = (callback) => { + if (document.readyState !== "loading") { + callback(); + } else { + document.addEventListener("DOMContentLoaded", callback); + } +}; + +/** + * Small JavaScript module for the documentation. + */ +const Documentation = { + init: () => { + Documentation.initDomainIndexTable(); + Documentation.initOnKeyListeners(); + }, + + /** + * i18n support + */ + TRANSLATIONS: {}, + PLURAL_EXPR: (n) => (n === 1 ? 0 : 1), + LOCALE: "unknown", + + // gettext and ngettext don't access this so that the functions + // can safely bound to a different name (_ = Documentation.gettext) + gettext: (string) => { + const translated = Documentation.TRANSLATIONS[string]; + switch (typeof translated) { + case "undefined": + return string; // no translation + case "string": + return translated; // translation exists + default: + return translated[0]; // (singular, plural) translation tuple exists + } + }, + + ngettext: (singular, plural, n) => { + const translated = Documentation.TRANSLATIONS[singular]; + if (typeof translated !== "undefined") + return translated[Documentation.PLURAL_EXPR(n)]; + return n === 1 ? singular : plural; + }, + + addTranslations: (catalog) => { + Object.assign(Documentation.TRANSLATIONS, catalog.messages); + Documentation.PLURAL_EXPR = new Function( + "n", + `return (${catalog.plural_expr})` + ); + Documentation.LOCALE = catalog.locale; + }, + + /** + * helper function to focus on search bar + */ + focusSearchBar: () => { + document.querySelectorAll("input[name=q]")[0]?.focus(); + }, + + /** + * Initialise the domain index toggle buttons + */ + initDomainIndexTable: () => { + const toggler = (el) => { + const idNumber = el.id.substr(7); + const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`); + if (el.src.substr(-9) === "minus.png") { + el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`; + toggledRows.forEach((el) => (el.style.display = "none")); + } else { + el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`; + toggledRows.forEach((el) => (el.style.display = "")); + } + }; + + const togglerElements = document.querySelectorAll("img.toggler"); + togglerElements.forEach((el) => + el.addEventListener("click", (event) => toggler(event.currentTarget)) + ); + togglerElements.forEach((el) => (el.style.display = "")); + if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler); + }, + + initOnKeyListeners: () => { + // only install a listener if it is really needed + if ( + !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS && + !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS + ) + return; + + document.addEventListener("keydown", (event) => { + // bail for input elements + if (BLACKLISTED_KEY_CONTROL_ELEMENTS.has(document.activeElement.tagName)) return; + // bail with special keys + if (event.altKey || event.ctrlKey || event.metaKey) return; + + if (!event.shiftKey) { + switch (event.key) { + case "ArrowLeft": + if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break; + + const prevLink = document.querySelector('link[rel="prev"]'); + if (prevLink && prevLink.href) { + window.location.href = prevLink.href; + event.preventDefault(); + } + break; + case "ArrowRight": + if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break; + + const nextLink = document.querySelector('link[rel="next"]'); + if (nextLink && nextLink.href) { + window.location.href = nextLink.href; + event.preventDefault(); + } + break; + } + } + + // some keyboard layouts may need Shift to get / + switch (event.key) { + case "/": + if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break; + Documentation.focusSearchBar(); + event.preventDefault(); + } + }); + }, +}; + +// quick alias for translations +const _ = Documentation.gettext; + +_ready(Documentation.init); diff --git a/docs/_static/documentation_options.js b/docs/_static/documentation_options.js new file mode 100644 index 0000000..b57ae3b --- /dev/null +++ b/docs/_static/documentation_options.js @@ -0,0 +1,14 @@ +var DOCUMENTATION_OPTIONS = { + URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'), + VERSION: '', + LANGUAGE: 'en', + COLLAPSE_INDEX: false, + BUILDER: 'html', + FILE_SUFFIX: '.html', + LINK_SUFFIX: '.html', + HAS_SOURCE: true, + SOURCELINK_SUFFIX: '.txt', + NAVIGATION_WITH_KEYS: false, + SHOW_SEARCH_SUMMARY: true, + ENABLE_SEARCH_SHORTCUTS: true, +}; \ No newline at end of file diff --git a/docs/_static/file.png b/docs/_static/file.png new file mode 100644 index 0000000..a858a41 Binary files /dev/null and b/docs/_static/file.png differ diff --git a/docs/_static/jquery-3.6.0.js b/docs/_static/jquery-3.6.0.js new file mode 100644 index 0000000..fc6c299 --- /dev/null +++ b/docs/_static/jquery-3.6.0.js @@ -0,0 +1,10881 @@ +/*! + * jQuery JavaScript Library v3.6.0 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright OpenJS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2021-03-02T17:08Z + */ +( function( global, factory ) { + + "use strict"; + + if ( typeof module === "object" && typeof module.exports === "object" ) { + + // For CommonJS and CommonJS-like environments where a proper `window` + // is present, execute the factory and get jQuery. + // For environments that do not have a `window` with a `document` + // (such as Node.js), expose a factory as module.exports. + // This accentuates the need for the creation of a real `window`. + // e.g. var jQuery = require("jquery")(window); + // See ticket #14549 for more info. + module.exports = global.document ? + factory( global, true ) : + function( w ) { + if ( !w.document ) { + throw new Error( "jQuery requires a window with a document" ); + } + return factory( w ); + }; + } else { + factory( global ); + } + +// Pass this if window is not defined yet +} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { + +// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 +// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode +// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common +// enough that all such attempts are guarded in a try block. +"use strict"; + +var arr = []; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var flat = arr.flat ? function( array ) { + return arr.flat.call( array ); +} : function( array ) { + return arr.concat.apply( [], array ); +}; + + +var push = arr.push; + +var indexOf = arr.indexOf; + +var class2type = {}; + +var toString = class2type.toString; + +var hasOwn = class2type.hasOwnProperty; + +var fnToString = hasOwn.toString; + +var ObjectFunctionString = fnToString.call( Object ); + +var support = {}; + +var isFunction = function isFunction( obj ) { + + // Support: Chrome <=57, Firefox <=52 + // In some browsers, typeof returns "function" for HTML elements + // (i.e., `typeof document.createElement( "object" ) === "function"`). + // We don't want to classify *any* DOM node as a function. + // Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5 + // Plus for old WebKit, typeof returns "function" for HTML collections + // (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756) + return typeof obj === "function" && typeof obj.nodeType !== "number" && + typeof obj.item !== "function"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + +var document = window.document; + + + + var preservedScriptAttributes = { + type: true, + src: true, + nonce: true, + noModule: true + }; + + function DOMEval( code, node, doc ) { + doc = doc || document; + + var i, val, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + + // Support: Firefox 64+, Edge 18+ + // Some browsers don't support the "nonce" property on scripts. + // On the other hand, just using `getAttribute` is not enough as + // the `nonce` attribute is reset to an empty string whenever it + // becomes browsing-context connected. + // See https://github.com/whatwg/html/issues/2369 + // See https://html.spec.whatwg.org/#nonce-attributes + // The `node.getAttribute` check was added for the sake of + // `jQuery.globalEval` so that it can fake a nonce-containing node + // via an object. + val = node[ i ] || node.getAttribute && node.getAttribute( i ); + if ( val ) { + script.setAttribute( i, val ); + } + } + } + doc.head.appendChild( script ).parentNode.removeChild( script ); + } + + +function toType( obj ) { + if ( obj == null ) { + return obj + ""; + } + + // Support: Android <=2.3 only (functionish RegExp) + return typeof obj === "object" || typeof obj === "function" ? + class2type[ toString.call( obj ) ] || "object" : + typeof obj; +} +/* global Symbol */ +// Defining this global in .eslintrc.json would create a danger of using the global +// unguarded in another place, it seems safer to define global only for this module + + + +var + version = "3.6.0", + + // Define a local copy of jQuery + jQuery = function( selector, context ) { + + // The jQuery object is actually just the init constructor 'enhanced' + // Need init if jQuery is called (just allow error to be thrown if not included) + return new jQuery.fn.init( selector, context ); + }; + +jQuery.fn = jQuery.prototype = { + + // The current version of jQuery being used + jquery: version, + + constructor: jQuery, + + // The default length of a jQuery object is 0 + length: 0, + + toArray: function() { + return slice.call( this ); + }, + + // Get the Nth element in the matched element set OR + // Get the whole matched element set as a clean array + get: function( num ) { + + // Return all the elements in a clean array + if ( num == null ) { + return slice.call( this ); + } + + // Return just the one element from the set + return num < 0 ? this[ num + this.length ] : this[ num ]; + }, + + // Take an array of elements and push it onto the stack + // (returning the new matched element set) + pushStack: function( elems ) { + + // Build a new jQuery matched element set + var ret = jQuery.merge( this.constructor(), elems ); + + // Add the old object onto the stack (as a reference) + ret.prevObject = this; + + // Return the newly-formed element set + return ret; + }, + + // Execute a callback for every element in the matched set. + each: function( callback ) { + return jQuery.each( this, callback ); + }, + + map: function( callback ) { + return this.pushStack( jQuery.map( this, function( elem, i ) { + return callback.call( elem, i, elem ); + } ) ); + }, + + slice: function() { + return this.pushStack( slice.apply( this, arguments ) ); + }, + + first: function() { + return this.eq( 0 ); + }, + + last: function() { + return this.eq( -1 ); + }, + + even: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return ( i + 1 ) % 2; + } ) ); + }, + + odd: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return i % 2; + } ) ); + }, + + eq: function( i ) { + var len = this.length, + j = +i + ( i < 0 ? len : 0 ); + return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); + }, + + end: function() { + return this.prevObject || this.constructor(); + }, + + // For internal use only. + // Behaves like an Array's method, not like a jQuery method. + push: push, + sort: arr.sort, + splice: arr.splice +}; + +jQuery.extend = jQuery.fn.extend = function() { + var options, name, src, copy, copyIsArray, clone, + target = arguments[ 0 ] || {}, + i = 1, + length = arguments.length, + deep = false; + + // Handle a deep copy situation + if ( typeof target === "boolean" ) { + deep = target; + + // Skip the boolean and the target + target = arguments[ i ] || {}; + i++; + } + + // Handle case when target is a string or something (possible in deep copy) + if ( typeof target !== "object" && !isFunction( target ) ) { + target = {}; + } + + // Extend jQuery itself if only one argument is passed + if ( i === length ) { + target = this; + i--; + } + + for ( ; i < length; i++ ) { + + // Only deal with non-null/undefined values + if ( ( options = arguments[ i ] ) != null ) { + + // Extend the base object + for ( name in options ) { + copy = options[ name ]; + + // Prevent Object.prototype pollution + // Prevent never-ending loop + if ( name === "__proto__" || target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + src = target[ name ]; + + // Ensure proper type for the source value + if ( copyIsArray && !Array.isArray( src ) ) { + clone = []; + } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { + clone = {}; + } else { + clone = src; + } + copyIsArray = false; + + // Never move original objects, clone them + target[ name ] = jQuery.extend( deep, clone, copy ); + + // Don't bring in undefined values + } else if ( copy !== undefined ) { + target[ name ] = copy; + } + } + } + } + + // Return the modified object + return target; +}; + +jQuery.extend( { + + // Unique for each copy of jQuery on the page + expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), + + // Assume jQuery is ready without the ready module + isReady: true, + + error: function( msg ) { + throw new Error( msg ); + }, + + noop: function() {}, + + isPlainObject: function( obj ) { + var proto, Ctor; + + // Detect obvious negatives + // Use toString instead of jQuery.type to catch host objects + if ( !obj || toString.call( obj ) !== "[object Object]" ) { + return false; + } + + proto = getProto( obj ); + + // Objects with no prototype (e.g., `Object.create( null )`) are plain + if ( !proto ) { + return true; + } + + // Objects with prototype are plain iff they were constructed by a global Object function + Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; + return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; + }, + + isEmptyObject: function( obj ) { + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a provided context; falls back to the global one + // if not specified. + globalEval: function( code, options, doc ) { + DOMEval( code, { nonce: options && options.nonce }, doc ); + }, + + each: function( obj, callback ) { + var length, i = 0; + + if ( isArrayLike( obj ) ) { + length = obj.length; + for ( ; i < length; i++ ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } else { + for ( i in obj ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } + + return obj; + }, + + // results is for internal usage only + makeArray: function( arr, results ) { + var ret = results || []; + + if ( arr != null ) { + if ( isArrayLike( Object( arr ) ) ) { + jQuery.merge( ret, + typeof arr === "string" ? + [ arr ] : arr + ); + } else { + push.call( ret, arr ); + } + } + + return ret; + }, + + inArray: function( elem, arr, i ) { + return arr == null ? -1 : indexOf.call( arr, elem, i ); + }, + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + merge: function( first, second ) { + var len = +second.length, + j = 0, + i = first.length; + + for ( ; j < len; j++ ) { + first[ i++ ] = second[ j ]; + } + + first.length = i; + + return first; + }, + + grep: function( elems, callback, invert ) { + var callbackInverse, + matches = [], + i = 0, + length = elems.length, + callbackExpect = !invert; + + // Go through the array, only saving the items + // that pass the validator function + for ( ; i < length; i++ ) { + callbackInverse = !callback( elems[ i ], i ); + if ( callbackInverse !== callbackExpect ) { + matches.push( elems[ i ] ); + } + } + + return matches; + }, + + // arg is for internal usage only + map: function( elems, callback, arg ) { + var length, value, + i = 0, + ret = []; + + // Go through the array, translating each of the items to their new values + if ( isArrayLike( elems ) ) { + length = elems.length; + for ( ; i < length; i++ ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + + // Go through every key on the object, + } else { + for ( i in elems ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + } + + // Flatten any nested arrays + return flat( ret ); + }, + + // A global GUID counter for objects + guid: 1, + + // jQuery.support is not used in Core but other projects attach their + // properties to it so it needs to exist. + support: support +} ); + +if ( typeof Symbol === "function" ) { + jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; +} + +// Populate the class2type map +jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), + function( _i, name ) { + class2type[ "[object " + name + "]" ] = name.toLowerCase(); + } ); + +function isArrayLike( obj ) { + + // Support: real iOS 8.2 only (not reproducible in simulator) + // `in` check used to prevent JIT error (gh-2145) + // hasOwn isn't used here due to false negatives + // regarding Nodelist length in IE + var length = !!obj && "length" in obj && obj.length, + type = toType( obj ); + + if ( isFunction( obj ) || isWindow( obj ) ) { + return false; + } + + return type === "array" || length === 0 || + typeof length === "number" && length > 0 && ( length - 1 ) in obj; +} +var Sizzle = +/*! + * Sizzle CSS Selector Engine v2.3.6 + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://js.foundation/ + * + * Date: 2021-02-16 + */ +( function( window ) { +var i, + support, + Expr, + getText, + isXML, + tokenize, + compile, + select, + outermostContext, + sortInput, + hasDuplicate, + + // Local document vars + setDocument, + document, + docElem, + documentIsHTML, + rbuggyQSA, + rbuggyMatches, + matches, + contains, + + // Instance-specific data + expando = "sizzle" + 1 * new Date(), + preferredDoc = window.document, + dirruns = 0, + done = 0, + classCache = createCache(), + tokenCache = createCache(), + compilerCache = createCache(), + nonnativeSelectorCache = createCache(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ( {} ).hasOwnProperty, + arr = [], + pop = arr.pop, + pushNative = arr.push, + push = arr.push, + slice = arr.slice, + + // Use a stripped-down indexOf as it's faster than native + // https://jsperf.com/thor-indexof-vs-for/5 + indexOf = function( list, elem ) { + var i = 0, + len = list.length; + for ( ; i < len; i++ ) { + if ( list[ i ] === elem ) { + return i; + } + } + return -1; + }, + + booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + + "ismap|loop|multiple|open|readonly|required|scoped", + + // Regular expressions + + // http://www.w3.org/TR/css3-selectors/#whitespace + whitespace = "[\\x20\\t\\r\\n\\f]", + + // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram + identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", + + // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors + attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + + + // Operator (capture 2) + "*([*^$|!~]?=)" + whitespace + + + // "Attribute values must be CSS identifiers [capture 5] + // or strings [capture 3 or capture 4]" + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + + whitespace + "*\\]", + + pseudos = ":(" + identifier + ")(?:\\((" + + + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: + // 1. quoted (capture 3; capture 4 or capture 5) + "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + + + // 2. simple (capture 6) + "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + + + // 3. anything else (capture 2) + ".*" + + ")\\)|)", + + // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter + rwhitespace = new RegExp( whitespace + "+", "g" ), + rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + + whitespace + "+$", "g" ), + + rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), + rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + + "*" ), + rdescend = new RegExp( whitespace + "|>" ), + + rpseudo = new RegExp( pseudos ), + ridentifier = new RegExp( "^" + identifier + "$" ), + + matchExpr = { + "ID": new RegExp( "^#(" + identifier + ")" ), + "CLASS": new RegExp( "^\\.(" + identifier + ")" ), + "TAG": new RegExp( "^(" + identifier + "|[*])" ), + "ATTR": new RegExp( "^" + attributes ), + "PSEUDO": new RegExp( "^" + pseudos ), + "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), + "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), + + // For use in libraries implementing .is() + // We use this for POS matching in `select` + "needsContext": new RegExp( "^" + whitespace + + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) + }, + + rhtml = /HTML$/i, + rinputs = /^(?:input|select|textarea|button)$/i, + rheader = /^h\d$/i, + + rnative = /^[^{]+\{\s*\[native \w/, + + // Easily-parseable/retrievable ID or TAG or CLASS selectors + rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, + + rsibling = /[+~]/, + + // CSS escapes + // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters + runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), + funescape = function( escape, nonHex ) { + var high = "0x" + escape.slice( 1 ) - 0x10000; + + return nonHex ? + + // Strip the backslash prefix from a non-hex escape sequence + nonHex : + + // Replace a hexadecimal escape sequence with the encoded Unicode code point + // Support: IE <=11+ + // For values outside the Basic Multilingual Plane (BMP), manually construct a + // surrogate pair + high < 0 ? + String.fromCharCode( high + 0x10000 ) : + String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); + }, + + // CSS string/identifier serialization + // https://drafts.csswg.org/cssom/#common-serializing-idioms + rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, + fcssescape = function( ch, asCodePoint ) { + if ( asCodePoint ) { + + // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER + if ( ch === "\0" ) { + return "\uFFFD"; + } + + // Control characters and (dependent upon position) numbers get escaped as code points + return ch.slice( 0, -1 ) + "\\" + + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; + } + + // Other potentially-special ASCII characters get backslash-escaped + return "\\" + ch; + }, + + // Used for iframes + // See setDocument() + // Removing the function wrapper causes a "Permission Denied" + // error in IE + unloadHandler = function() { + setDocument(); + }, + + inDisabledFieldset = addCombinator( + function( elem ) { + return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; + }, + { dir: "parentNode", next: "legend" } + ); + +// Optimize for push.apply( _, NodeList ) +try { + push.apply( + ( arr = slice.call( preferredDoc.childNodes ) ), + preferredDoc.childNodes + ); + + // Support: Android<4.0 + // Detect silently failing push.apply + // eslint-disable-next-line no-unused-expressions + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + pushNative.apply( target, slice.call( els ) ); + } : + + // Support: IE<9 + // Otherwise append directly + function( target, els ) { + var j = target.length, + i = 0; + + // Can't trust NodeList.length + while ( ( target[ j++ ] = els[ i++ ] ) ) {} + target.length = j - 1; + } + }; +} + +function Sizzle( selector, context, results, seed ) { + var m, i, elem, nid, match, groups, newSelector, + newContext = context && context.ownerDocument, + + // nodeType defaults to 9, since context defaults to document + nodeType = context ? context.nodeType : 9; + + results = results || []; + + // Return early from calls with invalid selector or context + if ( typeof selector !== "string" || !selector || + nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { + + return results; + } + + // Try to shortcut find operations (as opposed to filters) in HTML documents + if ( !seed ) { + setDocument( context ); + context = context || document; + + if ( documentIsHTML ) { + + // If the selector is sufficiently simple, try using a "get*By*" DOM method + // (excepting DocumentFragment context, where the methods don't exist) + if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { + + // ID selector + if ( ( m = match[ 1 ] ) ) { + + // Document context + if ( nodeType === 9 ) { + if ( ( elem = context.getElementById( m ) ) ) { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( elem.id === m ) { + results.push( elem ); + return results; + } + } else { + return results; + } + + // Element context + } else { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( newContext && ( elem = newContext.getElementById( m ) ) && + contains( context, elem ) && + elem.id === m ) { + + results.push( elem ); + return results; + } + } + + // Type selector + } else if ( match[ 2 ] ) { + push.apply( results, context.getElementsByTagName( selector ) ); + return results; + + // Class selector + } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && + context.getElementsByClassName ) { + + push.apply( results, context.getElementsByClassName( m ) ); + return results; + } + } + + // Take advantage of querySelectorAll + if ( support.qsa && + !nonnativeSelectorCache[ selector + " " ] && + ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && + + // Support: IE 8 only + // Exclude object elements + ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { + + newSelector = selector; + newContext = context; + + // qSA considers elements outside a scoping root when evaluating child or + // descendant combinators, which is not what we want. + // In such cases, we work around the behavior by prefixing every selector in the + // list with an ID selector referencing the scope context. + // The technique has to be used as well when a leading combinator is used + // as such selectors are not recognized by querySelectorAll. + // Thanks to Andrew Dupont for this technique. + if ( nodeType === 1 && + ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + + // We can use :scope instead of the ID hack if the browser + // supports it & if we're not changing the context. + if ( newContext !== context || !support.scope ) { + + // Capture the context ID, setting it first if necessary + if ( ( nid = context.getAttribute( "id" ) ) ) { + nid = nid.replace( rcssescape, fcssescape ); + } else { + context.setAttribute( "id", ( nid = expando ) ); + } + } + + // Prefix every selector in the list + groups = tokenize( selector ); + i = groups.length; + while ( i-- ) { + groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + + toSelector( groups[ i ] ); + } + newSelector = groups.join( "," ); + } + + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + nonnativeSelectorCache( selector, true ); + } finally { + if ( nid === expando ) { + context.removeAttribute( "id" ); + } + } + } + } + } + + // All others + return select( selector.replace( rtrim, "$1" ), context, results, seed ); +} + +/** + * Create key-value caches of limited size + * @returns {function(string, object)} Returns the Object data after storing it on itself with + * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) + * deleting the oldest entry + */ +function createCache() { + var keys = []; + + function cache( key, value ) { + + // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) + if ( keys.push( key + " " ) > Expr.cacheLength ) { + + // Only keep the most recent entries + delete cache[ keys.shift() ]; + } + return ( cache[ key + " " ] = value ); + } + return cache; +} + +/** + * Mark a function for special use by Sizzle + * @param {Function} fn The function to mark + */ +function markFunction( fn ) { + fn[ expando ] = true; + return fn; +} + +/** + * Support testing using an element + * @param {Function} fn Passed the created element and returns a boolean result + */ +function assert( fn ) { + var el = document.createElement( "fieldset" ); + + try { + return !!fn( el ); + } catch ( e ) { + return false; + } finally { + + // Remove from its parent by default + if ( el.parentNode ) { + el.parentNode.removeChild( el ); + } + + // release memory in IE + el = null; + } +} + +/** + * Adds the same handler for all of the specified attrs + * @param {String} attrs Pipe-separated list of attributes + * @param {Function} handler The method that will be applied + */ +function addHandle( attrs, handler ) { + var arr = attrs.split( "|" ), + i = arr.length; + + while ( i-- ) { + Expr.attrHandle[ arr[ i ] ] = handler; + } +} + +/** + * Checks document order of two siblings + * @param {Element} a + * @param {Element} b + * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b + */ +function siblingCheck( a, b ) { + var cur = b && a, + diff = cur && a.nodeType === 1 && b.nodeType === 1 && + a.sourceIndex - b.sourceIndex; + + // Use IE sourceIndex if available on both nodes + if ( diff ) { + return diff; + } + + // Check if b follows a + if ( cur ) { + while ( ( cur = cur.nextSibling ) ) { + if ( cur === b ) { + return -1; + } + } + } + + return a ? 1 : -1; +} + +/** + * Returns a function to use in pseudos for input types + * @param {String} type + */ +function createInputPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for buttons + * @param {String} type + */ +function createButtonPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return ( name === "input" || name === "button" ) && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for :enabled/:disabled + * @param {Boolean} disabled true for :disabled; false for :enabled + */ +function createDisabledPseudo( disabled ) { + + // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable + return function( elem ) { + + // Only certain elements can match :enabled or :disabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled + if ( "form" in elem ) { + + // Check for inherited disabledness on relevant non-disabled elements: + // * listed form-associated elements in a disabled fieldset + // https://html.spec.whatwg.org/multipage/forms.html#category-listed + // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled + // * option elements in a disabled optgroup + // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled + // All such elements have a "form" property. + if ( elem.parentNode && elem.disabled === false ) { + + // Option elements defer to a parent optgroup if present + if ( "label" in elem ) { + if ( "label" in elem.parentNode ) { + return elem.parentNode.disabled === disabled; + } else { + return elem.disabled === disabled; + } + } + + // Support: IE 6 - 11 + // Use the isDisabled shortcut property to check for disabled fieldset ancestors + return elem.isDisabled === disabled || + + // Where there is no isDisabled, check manually + /* jshint -W018 */ + elem.isDisabled !== !disabled && + inDisabledFieldset( elem ) === disabled; + } + + return elem.disabled === disabled; + + // Try to winnow out elements that can't be disabled before trusting the disabled property. + // Some victims get caught in our net (label, legend, menu, track), but it shouldn't + // even exist on them, let alone have a boolean value. + } else if ( "label" in elem ) { + return elem.disabled === disabled; + } + + // Remaining elements are neither :enabled nor :disabled + return false; + }; +} + +/** + * Returns a function to use in pseudos for positionals + * @param {Function} fn + */ +function createPositionalPseudo( fn ) { + return markFunction( function( argument ) { + argument = +argument; + return markFunction( function( seed, matches ) { + var j, + matchIndexes = fn( [], seed.length, argument ), + i = matchIndexes.length; + + // Match elements found at the specified indexes + while ( i-- ) { + if ( seed[ ( j = matchIndexes[ i ] ) ] ) { + seed[ j ] = !( matches[ j ] = seed[ j ] ); + } + } + } ); + } ); +} + +/** + * Checks a node for validity as a Sizzle context + * @param {Element|Object=} context + * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value + */ +function testContext( context ) { + return context && typeof context.getElementsByTagName !== "undefined" && context; +} + +// Expose support vars for convenience +support = Sizzle.support = {}; + +/** + * Detects XML nodes + * @param {Element|Object} elem An element or a document + * @returns {Boolean} True iff elem is a non-HTML XML node + */ +isXML = Sizzle.isXML = function( elem ) { + var namespace = elem && elem.namespaceURI, + docElem = elem && ( elem.ownerDocument || elem ).documentElement; + + // Support: IE <=8 + // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes + // https://bugs.jquery.com/ticket/4833 + return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); +}; + +/** + * Sets document-related variables once based on the current document + * @param {Element|Object} [doc] An element or document object to use to set the document + * @returns {Object} Returns the current document + */ +setDocument = Sizzle.setDocument = function( node ) { + var hasCompare, subWindow, + doc = node ? node.ownerDocument || node : preferredDoc; + + // Return early if doc is invalid or already selected + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { + return document; + } + + // Update global variables + document = doc; + docElem = document.documentElement; + documentIsHTML = !isXML( document ); + + // Support: IE 9 - 11+, Edge 12 - 18+ + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( preferredDoc != document && + ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { + + // Support: IE 11, Edge + if ( subWindow.addEventListener ) { + subWindow.addEventListener( "unload", unloadHandler, false ); + + // Support: IE 9 - 10 only + } else if ( subWindow.attachEvent ) { + subWindow.attachEvent( "onunload", unloadHandler ); + } + } + + // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, + // Safari 4 - 5 only, Opera <=11.6 - 12.x only + // IE/Edge & older browsers don't support the :scope pseudo-class. + // Support: Safari 6.0 only + // Safari 6.0 supports :scope but it's an alias of :root there. + support.scope = assert( function( el ) { + docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); + return typeof el.querySelectorAll !== "undefined" && + !el.querySelectorAll( ":scope fieldset div" ).length; + } ); + + /* Attributes + ---------------------------------------------------------------------- */ + + // Support: IE<8 + // Verify that getAttribute really returns attributes and not properties + // (excepting IE8 booleans) + support.attributes = assert( function( el ) { + el.className = "i"; + return !el.getAttribute( "className" ); + } ); + + /* getElement(s)By* + ---------------------------------------------------------------------- */ + + // Check if getElementsByTagName("*") returns only elements + support.getElementsByTagName = assert( function( el ) { + el.appendChild( document.createComment( "" ) ); + return !el.getElementsByTagName( "*" ).length; + } ); + + // Support: IE<9 + support.getElementsByClassName = rnative.test( document.getElementsByClassName ); + + // Support: IE<10 + // Check if getElementById returns elements by name + // The broken getElementById methods don't pick up programmatically-set names, + // so use a roundabout getElementsByName test + support.getById = assert( function( el ) { + docElem.appendChild( el ).id = expando; + return !document.getElementsByName || !document.getElementsByName( expando ).length; + } ); + + // ID filter and find + if ( support.getById ) { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + return elem.getAttribute( "id" ) === attrId; + }; + }; + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var elem = context.getElementById( id ); + return elem ? [ elem ] : []; + } + }; + } else { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + var node = typeof elem.getAttributeNode !== "undefined" && + elem.getAttributeNode( "id" ); + return node && node.value === attrId; + }; + }; + + // Support: IE 6 - 7 only + // getElementById is not reliable as a find shortcut + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var node, i, elems, + elem = context.getElementById( id ); + + if ( elem ) { + + // Verify the id attribute + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + + // Fall back on getElementsByName + elems = context.getElementsByName( id ); + i = 0; + while ( ( elem = elems[ i++ ] ) ) { + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + } + } + + return []; + } + }; + } + + // Tag + Expr.find[ "TAG" ] = support.getElementsByTagName ? + function( tag, context ) { + if ( typeof context.getElementsByTagName !== "undefined" ) { + return context.getElementsByTagName( tag ); + + // DocumentFragment nodes don't have gEBTN + } else if ( support.qsa ) { + return context.querySelectorAll( tag ); + } + } : + + function( tag, context ) { + var elem, + tmp = [], + i = 0, + + // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too + results = context.getElementsByTagName( tag ); + + // Filter out possible comments + if ( tag === "*" ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem.nodeType === 1 ) { + tmp.push( elem ); + } + } + + return tmp; + } + return results; + }; + + // Class + Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { + if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { + return context.getElementsByClassName( className ); + } + }; + + /* QSA/matchesSelector + ---------------------------------------------------------------------- */ + + // QSA and matchesSelector support + + // matchesSelector(:active) reports false when true (IE9/Opera 11.5) + rbuggyMatches = []; + + // qSa(:focus) reports false when true (Chrome 21) + // We allow this because of a bug in IE8/9 that throws an error + // whenever `document.activeElement` is accessed on an iframe + // So, we allow :focus to pass through QSA all the time to avoid the IE error + // See https://bugs.jquery.com/ticket/13378 + rbuggyQSA = []; + + if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { + + // Build QSA regex + // Regex strategy adopted from Diego Perini + assert( function( el ) { + + var input; + + // Select is set to empty string on purpose + // This is to test IE's treatment of not explicitly + // setting a boolean content attribute, + // since its presence should be enough + // https://bugs.jquery.com/ticket/12359 + docElem.appendChild( el ).innerHTML = "" + + ""; + + // Support: IE8, Opera 11-12.16 + // Nothing should be selected when empty strings follow ^= or $= or *= + // The test attribute must be unknown in Opera but "safe" for WinRT + // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section + if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { + rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); + } + + // Support: IE8 + // Boolean attributes and "value" are not treated correctly + if ( !el.querySelectorAll( "[selected]" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); + } + + // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ + if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { + rbuggyQSA.push( "~=" ); + } + + // Support: IE 11+, Edge 15 - 18+ + // IE 11/Edge don't find elements on a `[name='']` query in some cases. + // Adding a temporary attribute to the document before the selection works + // around the issue. + // Interestingly, IE 10 & older don't seem to have the issue. + input = document.createElement( "input" ); + input.setAttribute( "name", "" ); + el.appendChild( input ); + if ( !el.querySelectorAll( "[name='']" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + + whitespace + "*(?:''|\"\")" ); + } + + // Webkit/Opera - :checked should return selected option elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + // IE8 throws error here and will not see later tests + if ( !el.querySelectorAll( ":checked" ).length ) { + rbuggyQSA.push( ":checked" ); + } + + // Support: Safari 8+, iOS 8+ + // https://bugs.webkit.org/show_bug.cgi?id=136851 + // In-page `selector#id sibling-combinator selector` fails + if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { + rbuggyQSA.push( ".#.+[+~]" ); + } + + // Support: Firefox <=3.6 - 5 only + // Old Firefox doesn't throw on a badly-escaped identifier. + el.querySelectorAll( "\\\f" ); + rbuggyQSA.push( "[\\r\\n\\f]" ); + } ); + + assert( function( el ) { + el.innerHTML = "" + + ""; + + // Support: Windows 8 Native Apps + // The type and name attributes are restricted during .innerHTML assignment + var input = document.createElement( "input" ); + input.setAttribute( "type", "hidden" ); + el.appendChild( input ).setAttribute( "name", "D" ); + + // Support: IE8 + // Enforce case-sensitivity of name attribute + if ( el.querySelectorAll( "[name=d]" ).length ) { + rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); + } + + // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) + // IE8 throws error here and will not see later tests + if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: IE9-11+ + // IE's :disabled selector does not pick up the children of disabled fieldsets + docElem.appendChild( el ).disabled = true; + if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: Opera 10 - 11 only + // Opera 10-11 does not throw on post-comma invalid pseudos + el.querySelectorAll( "*,:x" ); + rbuggyQSA.push( ",.*:" ); + } ); + } + + if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || + docElem.webkitMatchesSelector || + docElem.mozMatchesSelector || + docElem.oMatchesSelector || + docElem.msMatchesSelector ) ) ) ) { + + assert( function( el ) { + + // Check to see if it's possible to do matchesSelector + // on a disconnected node (IE 9) + support.disconnectedMatch = matches.call( el, "*" ); + + // This should fail with an exception + // Gecko does not error, returns false instead + matches.call( el, "[s!='']:x" ); + rbuggyMatches.push( "!=", pseudos ); + } ); + } + + rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); + rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); + + /* Contains + ---------------------------------------------------------------------- */ + hasCompare = rnative.test( docElem.compareDocumentPosition ); + + // Element contains another + // Purposefully self-exclusive + // As in, an element does not contain itself + contains = hasCompare || rnative.test( docElem.contains ) ? + function( a, b ) { + var adown = a.nodeType === 9 ? a.documentElement : a, + bup = b && b.parentNode; + return a === bup || !!( bup && bup.nodeType === 1 && ( + adown.contains ? + adown.contains( bup ) : + a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 + ) ); + } : + function( a, b ) { + if ( b ) { + while ( ( b = b.parentNode ) ) { + if ( b === a ) { + return true; + } + } + } + return false; + }; + + /* Sorting + ---------------------------------------------------------------------- */ + + // Document order sorting + sortOrder = hasCompare ? + function( a, b ) { + + // Flag for duplicate removal + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + // Sort on method existence if only one input has compareDocumentPosition + var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; + if ( compare ) { + return compare; + } + + // Calculate position if both inputs belong to the same document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? + a.compareDocumentPosition( b ) : + + // Otherwise we know they are disconnected + 1; + + // Disconnected nodes + if ( compare & 1 || + ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { + + // Choose the first element that is related to our preferred document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( a == document || a.ownerDocument == preferredDoc && + contains( preferredDoc, a ) ) { + return -1; + } + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( b == document || b.ownerDocument == preferredDoc && + contains( preferredDoc, b ) ) { + return 1; + } + + // Maintain original order + return sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + } + + return compare & 4 ? -1 : 1; + } : + function( a, b ) { + + // Exit early if the nodes are identical + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + var cur, + i = 0, + aup = a.parentNode, + bup = b.parentNode, + ap = [ a ], + bp = [ b ]; + + // Parentless nodes are either documents or disconnected + if ( !aup || !bup ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + return a == document ? -1 : + b == document ? 1 : + /* eslint-enable eqeqeq */ + aup ? -1 : + bup ? 1 : + sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + + // If the nodes are siblings, we can do a quick check + } else if ( aup === bup ) { + return siblingCheck( a, b ); + } + + // Otherwise we need full lists of their ancestors for comparison + cur = a; + while ( ( cur = cur.parentNode ) ) { + ap.unshift( cur ); + } + cur = b; + while ( ( cur = cur.parentNode ) ) { + bp.unshift( cur ); + } + + // Walk down the tree looking for a discrepancy + while ( ap[ i ] === bp[ i ] ) { + i++; + } + + return i ? + + // Do a sibling check if the nodes have a common ancestor + siblingCheck( ap[ i ], bp[ i ] ) : + + // Otherwise nodes in our document sort first + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + ap[ i ] == preferredDoc ? -1 : + bp[ i ] == preferredDoc ? 1 : + /* eslint-enable eqeqeq */ + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + setDocument( elem ); + + if ( support.matchesSelector && documentIsHTML && + !nonnativeSelectorCache[ expr + " " ] && + ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && + ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { + + try { + var ret = matches.call( elem, expr ); + + // IE 9's matchesSelector returns false on disconnected nodes + if ( ret || support.disconnectedMatch || + + // As well, disconnected nodes are said to be in a document + // fragment in IE 9 + elem.document && elem.document.nodeType !== 11 ) { + return ret; + } + } catch ( e ) { + nonnativeSelectorCache( expr, true ); + } + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( context.ownerDocument || context ) != document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( elem.ownerDocument || elem ) != document ) { + setDocument( elem ); + } + + var fn = Expr.attrHandle[ name.toLowerCase() ], + + // Don't get fooled by Object.prototype properties (jQuery #13807) + val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? + fn( elem, name, !documentIsHTML ) : + undefined; + + return val !== undefined ? + val : + support.attributes || !documentIsHTML ? + elem.getAttribute( name ) : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; +}; + +Sizzle.escape = function( sel ) { + return ( sel + "" ).replace( rcssescape, fcssescape ); +}; + +Sizzle.error = function( msg ) { + throw new Error( "Syntax error, unrecognized expression: " + msg ); +}; + +/** + * Document sorting and removing duplicates + * @param {ArrayLike} results + */ +Sizzle.uniqueSort = function( results ) { + var elem, + duplicates = [], + j = 0, + i = 0; + + // Unless we *know* we can detect duplicates, assume their presence + hasDuplicate = !support.detectDuplicates; + sortInput = !support.sortStable && results.slice( 0 ); + results.sort( sortOrder ); + + if ( hasDuplicate ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem === results[ i ] ) { + j = duplicates.push( i ); + } + } + while ( j-- ) { + results.splice( duplicates[ j ], 1 ); + } + } + + // Clear input after sorting to release objects + // See https://github.com/jquery/sizzle/pull/225 + sortInput = null; + + return results; +}; + +/** + * Utility function for retrieving the text value of an array of DOM nodes + * @param {Array|Element} elem + */ +getText = Sizzle.getText = function( elem ) { + var node, + ret = "", + i = 0, + nodeType = elem.nodeType; + + if ( !nodeType ) { + + // If no nodeType, this is expected to be an array + while ( ( node = elem[ i++ ] ) ) { + + // Do not traverse comment nodes + ret += getText( node ); + } + } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { + + // Use textContent for elements + // innerText usage removed for consistency of new lines (jQuery #11153) + if ( typeof elem.textContent === "string" ) { + return elem.textContent; + } else { + + // Traverse its children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + ret += getText( elem ); + } + } + } else if ( nodeType === 3 || nodeType === 4 ) { + return elem.nodeValue; + } + + // Do not include comment or processing instruction nodes + + return ret; +}; + +Expr = Sizzle.selectors = { + + // Can be adjusted by the user + cacheLength: 50, + + createPseudo: markFunction, + + match: matchExpr, + + attrHandle: {}, + + find: {}, + + relative: { + ">": { dir: "parentNode", first: true }, + " ": { dir: "parentNode" }, + "+": { dir: "previousSibling", first: true }, + "~": { dir: "previousSibling" } + }, + + preFilter: { + "ATTR": function( match ) { + match[ 1 ] = match[ 1 ].replace( runescape, funescape ); + + // Move the given value to match[3] whether quoted or unquoted + match[ 3 ] = ( match[ 3 ] || match[ 4 ] || + match[ 5 ] || "" ).replace( runescape, funescape ); + + if ( match[ 2 ] === "~=" ) { + match[ 3 ] = " " + match[ 3 ] + " "; + } + + return match.slice( 0, 4 ); + }, + + "CHILD": function( match ) { + + /* matches from matchExpr["CHILD"] + 1 type (only|nth|...) + 2 what (child|of-type) + 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) + 4 xn-component of xn+y argument ([+-]?\d*n|) + 5 sign of xn-component + 6 x of xn-component + 7 sign of y-component + 8 y of y-component + */ + match[ 1 ] = match[ 1 ].toLowerCase(); + + if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { + + // nth-* requires argument + if ( !match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + // numeric x and y parameters for Expr.filter.CHILD + // remember that false/true cast respectively to 0/1 + match[ 4 ] = +( match[ 4 ] ? + match[ 5 ] + ( match[ 6 ] || 1 ) : + 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); + match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); + + // other types prohibit arguments + } else if ( match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + return match; + }, + + "PSEUDO": function( match ) { + var excess, + unquoted = !match[ 6 ] && match[ 2 ]; + + if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { + return null; + } + + // Accept quoted arguments as-is + if ( match[ 3 ] ) { + match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; + + // Strip excess characters from unquoted arguments + } else if ( unquoted && rpseudo.test( unquoted ) && + + // Get excess from tokenize (recursively) + ( excess = tokenize( unquoted, true ) ) && + + // advance to the next closing parenthesis + ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { + + // excess is a negative index + match[ 0 ] = match[ 0 ].slice( 0, excess ); + match[ 2 ] = unquoted.slice( 0, excess ); + } + + // Return only captures needed by the pseudo filter method (type and argument) + return match.slice( 0, 3 ); + } + }, + + filter: { + + "TAG": function( nodeNameSelector ) { + var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); + return nodeNameSelector === "*" ? + function() { + return true; + } : + function( elem ) { + return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; + }; + }, + + "CLASS": function( className ) { + var pattern = classCache[ className + " " ]; + + return pattern || + ( pattern = new RegExp( "(^|" + whitespace + + ")" + className + "(" + whitespace + "|$)" ) ) && classCache( + className, function( elem ) { + return pattern.test( + typeof elem.className === "string" && elem.className || + typeof elem.getAttribute !== "undefined" && + elem.getAttribute( "class" ) || + "" + ); + } ); + }, + + "ATTR": function( name, operator, check ) { + return function( elem ) { + var result = Sizzle.attr( elem, name ); + + if ( result == null ) { + return operator === "!="; + } + if ( !operator ) { + return true; + } + + result += ""; + + /* eslint-disable max-len */ + + return operator === "=" ? result === check : + operator === "!=" ? result !== check : + operator === "^=" ? check && result.indexOf( check ) === 0 : + operator === "*=" ? check && result.indexOf( check ) > -1 : + operator === "$=" ? check && result.slice( -check.length ) === check : + operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : + operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : + false; + /* eslint-enable max-len */ + + }; + }, + + "CHILD": function( type, what, _argument, first, last ) { + var simple = type.slice( 0, 3 ) !== "nth", + forward = type.slice( -4 ) !== "last", + ofType = what === "of-type"; + + return first === 1 && last === 0 ? + + // Shortcut for :nth-*(n) + function( elem ) { + return !!elem.parentNode; + } : + + function( elem, _context, xml ) { + var cache, uniqueCache, outerCache, node, nodeIndex, start, + dir = simple !== forward ? "nextSibling" : "previousSibling", + parent = elem.parentNode, + name = ofType && elem.nodeName.toLowerCase(), + useCache = !xml && !ofType, + diff = false; + + if ( parent ) { + + // :(first|last|only)-(child|of-type) + if ( simple ) { + while ( dir ) { + node = elem; + while ( ( node = node[ dir ] ) ) { + if ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) { + + return false; + } + } + + // Reverse direction for :only-* (if we haven't yet done so) + start = dir = type === "only" && !start && "nextSibling"; + } + return true; + } + + start = [ forward ? parent.firstChild : parent.lastChild ]; + + // non-xml :nth-child(...) stores cache data on `parent` + if ( forward && useCache ) { + + // Seek `elem` from a previously-cached index + + // ...in a gzip-friendly way + node = parent; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex && cache[ 2 ]; + node = nodeIndex && parent.childNodes[ nodeIndex ]; + + while ( ( node = ++nodeIndex && node && node[ dir ] || + + // Fallback to seeking `elem` from the start + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + // When found, cache indexes on `parent` and break + if ( node.nodeType === 1 && ++diff && node === elem ) { + uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; + break; + } + } + + } else { + + // Use previously-cached element index if available + if ( useCache ) { + + // ...in a gzip-friendly way + node = elem; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex; + } + + // xml :nth-child(...) + // or :nth-last-child(...) or :nth(-last)?-of-type(...) + if ( diff === false ) { + + // Use the same loop as above to seek `elem` from the start + while ( ( node = ++nodeIndex && node && node[ dir ] || + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + if ( ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) && + ++diff ) { + + // Cache the index of each encountered element + if ( useCache ) { + outerCache = node[ expando ] || + ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + uniqueCache[ type ] = [ dirruns, diff ]; + } + + if ( node === elem ) { + break; + } + } + } + } + } + + // Incorporate the offset, then check against cycle size + diff -= last; + return diff === first || ( diff % first === 0 && diff / first >= 0 ); + } + }; + }, + + "PSEUDO": function( pseudo, argument ) { + + // pseudo-class names are case-insensitive + // http://www.w3.org/TR/selectors/#pseudo-classes + // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters + // Remember that setFilters inherits from pseudos + var args, + fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || + Sizzle.error( "unsupported pseudo: " + pseudo ); + + // The user may use createPseudo to indicate that + // arguments are needed to create the filter function + // just as Sizzle does + if ( fn[ expando ] ) { + return fn( argument ); + } + + // But maintain support for old signatures + if ( fn.length > 1 ) { + args = [ pseudo, pseudo, "", argument ]; + return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? + markFunction( function( seed, matches ) { + var idx, + matched = fn( seed, argument ), + i = matched.length; + while ( i-- ) { + idx = indexOf( seed, matched[ i ] ); + seed[ idx ] = !( matches[ idx ] = matched[ i ] ); + } + } ) : + function( elem ) { + return fn( elem, 0, args ); + }; + } + + return fn; + } + }, + + pseudos: { + + // Potentially complex pseudos + "not": markFunction( function( selector ) { + + // Trim the selector passed to compile + // to avoid treating leading and trailing + // spaces as combinators + var input = [], + results = [], + matcher = compile( selector.replace( rtrim, "$1" ) ); + + return matcher[ expando ] ? + markFunction( function( seed, matches, _context, xml ) { + var elem, + unmatched = matcher( seed, null, xml, [] ), + i = seed.length; + + // Match elements unmatched by `matcher` + while ( i-- ) { + if ( ( elem = unmatched[ i ] ) ) { + seed[ i ] = !( matches[ i ] = elem ); + } + } + } ) : + function( elem, _context, xml ) { + input[ 0 ] = elem; + matcher( input, null, xml, results ); + + // Don't keep the element (issue #299) + input[ 0 ] = null; + return !results.pop(); + }; + } ), + + "has": markFunction( function( selector ) { + return function( elem ) { + return Sizzle( selector, elem ).length > 0; + }; + } ), + + "contains": markFunction( function( text ) { + text = text.replace( runescape, funescape ); + return function( elem ) { + return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; + }; + } ), + + // "Whether an element is represented by a :lang() selector + // is based solely on the element's language value + // being equal to the identifier C, + // or beginning with the identifier C immediately followed by "-". + // The matching of C against the element's language value is performed case-insensitively. + // The identifier C does not have to be a valid language name." + // http://www.w3.org/TR/selectors/#lang-pseudo + "lang": markFunction( function( lang ) { + + // lang value must be a valid identifier + if ( !ridentifier.test( lang || "" ) ) { + Sizzle.error( "unsupported lang: " + lang ); + } + lang = lang.replace( runescape, funescape ).toLowerCase(); + return function( elem ) { + var elemLang; + do { + if ( ( elemLang = documentIsHTML ? + elem.lang : + elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { + + elemLang = elemLang.toLowerCase(); + return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; + } + } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); + return false; + }; + } ), + + // Miscellaneous + "target": function( elem ) { + var hash = window.location && window.location.hash; + return hash && hash.slice( 1 ) === elem.id; + }, + + "root": function( elem ) { + return elem === docElem; + }, + + "focus": function( elem ) { + return elem === document.activeElement && + ( !document.hasFocus || document.hasFocus() ) && + !!( elem.type || elem.href || ~elem.tabIndex ); + }, + + // Boolean properties + "enabled": createDisabledPseudo( false ), + "disabled": createDisabledPseudo( true ), + + "checked": function( elem ) { + + // In CSS3, :checked should return both checked and selected elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + var nodeName = elem.nodeName.toLowerCase(); + return ( nodeName === "input" && !!elem.checked ) || + ( nodeName === "option" && !!elem.selected ); + }, + + "selected": function( elem ) { + + // Accessing this property makes selected-by-default + // options in Safari work properly + if ( elem.parentNode ) { + // eslint-disable-next-line no-unused-expressions + elem.parentNode.selectedIndex; + } + + return elem.selected === true; + }, + + // Contents + "empty": function( elem ) { + + // http://www.w3.org/TR/selectors/#empty-pseudo + // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), + // but not by others (comment: 8; processing instruction: 7; etc.) + // nodeType < 6 works because attributes (2) do not appear as children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + if ( elem.nodeType < 6 ) { + return false; + } + } + return true; + }, + + "parent": function( elem ) { + return !Expr.pseudos[ "empty" ]( elem ); + }, + + // Element/input types + "header": function( elem ) { + return rheader.test( elem.nodeName ); + }, + + "input": function( elem ) { + return rinputs.test( elem.nodeName ); + }, + + "button": function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === "button" || name === "button"; + }, + + "text": function( elem ) { + var attr; + return elem.nodeName.toLowerCase() === "input" && + elem.type === "text" && + + // Support: IE<8 + // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" + ( ( attr = elem.getAttribute( "type" ) ) == null || + attr.toLowerCase() === "text" ); + }, + + // Position-in-collection + "first": createPositionalPseudo( function() { + return [ 0 ]; + } ), + + "last": createPositionalPseudo( function( _matchIndexes, length ) { + return [ length - 1 ]; + } ), + + "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { + return [ argument < 0 ? argument + length : argument ]; + } ), + + "even": createPositionalPseudo( function( matchIndexes, length ) { + var i = 0; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "odd": createPositionalPseudo( function( matchIndexes, length ) { + var i = 1; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? + argument + length : + argument > length ? + length : + argument; + for ( ; --i >= 0; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? argument + length : argument; + for ( ; ++i < length; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ) + } +}; + +Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; + +// Add button/input type pseudos +for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { + Expr.pseudos[ i ] = createInputPseudo( i ); +} +for ( i in { submit: true, reset: true } ) { + Expr.pseudos[ i ] = createButtonPseudo( i ); +} + +// Easy API for creating new setFilters +function setFilters() {} +setFilters.prototype = Expr.filters = Expr.pseudos; +Expr.setFilters = new setFilters(); + +tokenize = Sizzle.tokenize = function( selector, parseOnly ) { + var matched, match, tokens, type, + soFar, groups, preFilters, + cached = tokenCache[ selector + " " ]; + + if ( cached ) { + return parseOnly ? 0 : cached.slice( 0 ); + } + + soFar = selector; + groups = []; + preFilters = Expr.preFilter; + + while ( soFar ) { + + // Comma and first run + if ( !matched || ( match = rcomma.exec( soFar ) ) ) { + if ( match ) { + + // Don't consume trailing commas as valid + soFar = soFar.slice( match[ 0 ].length ) || soFar; + } + groups.push( ( tokens = [] ) ); + } + + matched = false; + + // Combinators + if ( ( match = rcombinators.exec( soFar ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + + // Cast descendant combinators to space + type: match[ 0 ].replace( rtrim, " " ) + } ); + soFar = soFar.slice( matched.length ); + } + + // Filters + for ( type in Expr.filter ) { + if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || + ( match = preFilters[ type ]( match ) ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + type: type, + matches: match + } ); + soFar = soFar.slice( matched.length ); + } + } + + if ( !matched ) { + break; + } + } + + // Return the length of the invalid excess + // if we're just parsing + // Otherwise, throw an error or return tokens + return parseOnly ? + soFar.length : + soFar ? + Sizzle.error( selector ) : + + // Cache the tokens + tokenCache( selector, groups ).slice( 0 ); +}; + +function toSelector( tokens ) { + var i = 0, + len = tokens.length, + selector = ""; + for ( ; i < len; i++ ) { + selector += tokens[ i ].value; + } + return selector; +} + +function addCombinator( matcher, combinator, base ) { + var dir = combinator.dir, + skip = combinator.next, + key = skip || dir, + checkNonElements = base && key === "parentNode", + doneName = done++; + + return combinator.first ? + + // Check against closest ancestor/preceding element + function( elem, context, xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + return matcher( elem, context, xml ); + } + } + return false; + } : + + // Check against all ancestor/preceding elements + function( elem, context, xml ) { + var oldCache, uniqueCache, outerCache, + newCache = [ dirruns, doneName ]; + + // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching + if ( xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + if ( matcher( elem, context, xml ) ) { + return true; + } + } + } + } else { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + outerCache = elem[ expando ] || ( elem[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ elem.uniqueID ] || + ( outerCache[ elem.uniqueID ] = {} ); + + if ( skip && skip === elem.nodeName.toLowerCase() ) { + elem = elem[ dir ] || elem; + } else if ( ( oldCache = uniqueCache[ key ] ) && + oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { + + // Assign to newCache so results back-propagate to previous elements + return ( newCache[ 2 ] = oldCache[ 2 ] ); + } else { + + // Reuse newcache so results back-propagate to previous elements + uniqueCache[ key ] = newCache; + + // A match means we're done; a fail means we have to keep checking + if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { + return true; + } + } + } + } + } + return false; + }; +} + +function elementMatcher( matchers ) { + return matchers.length > 1 ? + function( elem, context, xml ) { + var i = matchers.length; + while ( i-- ) { + if ( !matchers[ i ]( elem, context, xml ) ) { + return false; + } + } + return true; + } : + matchers[ 0 ]; +} + +function multipleContexts( selector, contexts, results ) { + var i = 0, + len = contexts.length; + for ( ; i < len; i++ ) { + Sizzle( selector, contexts[ i ], results ); + } + return results; +} + +function condense( unmatched, map, filter, context, xml ) { + var elem, + newUnmatched = [], + i = 0, + len = unmatched.length, + mapped = map != null; + + for ( ; i < len; i++ ) { + if ( ( elem = unmatched[ i ] ) ) { + if ( !filter || filter( elem, context, xml ) ) { + newUnmatched.push( elem ); + if ( mapped ) { + map.push( i ); + } + } + } + } + + return newUnmatched; +} + +function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { + if ( postFilter && !postFilter[ expando ] ) { + postFilter = setMatcher( postFilter ); + } + if ( postFinder && !postFinder[ expando ] ) { + postFinder = setMatcher( postFinder, postSelector ); + } + return markFunction( function( seed, results, context, xml ) { + var temp, i, elem, + preMap = [], + postMap = [], + preexisting = results.length, + + // Get initial elements from seed or context + elems = seed || multipleContexts( + selector || "*", + context.nodeType ? [ context ] : context, + [] + ), + + // Prefilter to get matcher input, preserving a map for seed-results synchronization + matcherIn = preFilter && ( seed || !selector ) ? + condense( elems, preMap, preFilter, context, xml ) : + elems, + + matcherOut = matcher ? + + // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, + postFinder || ( seed ? preFilter : preexisting || postFilter ) ? + + // ...intermediate processing is necessary + [] : + + // ...otherwise use results directly + results : + matcherIn; + + // Find primary matches + if ( matcher ) { + matcher( matcherIn, matcherOut, context, xml ); + } + + // Apply postFilter + if ( postFilter ) { + temp = condense( matcherOut, postMap ); + postFilter( temp, [], context, xml ); + + // Un-match failing elements by moving them back to matcherIn + i = temp.length; + while ( i-- ) { + if ( ( elem = temp[ i ] ) ) { + matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); + } + } + } + + if ( seed ) { + if ( postFinder || preFilter ) { + if ( postFinder ) { + + // Get the final matcherOut by condensing this intermediate into postFinder contexts + temp = []; + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) ) { + + // Restore matcherIn since elem is not yet a final match + temp.push( ( matcherIn[ i ] = elem ) ); + } + } + postFinder( null, ( matcherOut = [] ), temp, xml ); + } + + // Move matched elements from seed to results to keep them synchronized + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) && + ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { + + seed[ temp ] = !( results[ temp ] = elem ); + } + } + } + + // Add elements to results, through postFinder if defined + } else { + matcherOut = condense( + matcherOut === results ? + matcherOut.splice( preexisting, matcherOut.length ) : + matcherOut + ); + if ( postFinder ) { + postFinder( null, results, matcherOut, xml ); + } else { + push.apply( results, matcherOut ); + } + } + } ); +} + +function matcherFromTokens( tokens ) { + var checkContext, matcher, j, + len = tokens.length, + leadingRelative = Expr.relative[ tokens[ 0 ].type ], + implicitRelative = leadingRelative || Expr.relative[ " " ], + i = leadingRelative ? 1 : 0, + + // The foundational matcher ensures that elements are reachable from top-level context(s) + matchContext = addCombinator( function( elem ) { + return elem === checkContext; + }, implicitRelative, true ), + matchAnyContext = addCombinator( function( elem ) { + return indexOf( checkContext, elem ) > -1; + }, implicitRelative, true ), + matchers = [ function( elem, context, xml ) { + var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( + ( checkContext = context ).nodeType ? + matchContext( elem, context, xml ) : + matchAnyContext( elem, context, xml ) ); + + // Avoid hanging onto element (issue #299) + checkContext = null; + return ret; + } ]; + + for ( ; i < len; i++ ) { + if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { + matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; + } else { + matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); + + // Return special upon seeing a positional matcher + if ( matcher[ expando ] ) { + + // Find the next relative operator (if any) for proper handling + j = ++i; + for ( ; j < len; j++ ) { + if ( Expr.relative[ tokens[ j ].type ] ) { + break; + } + } + return setMatcher( + i > 1 && elementMatcher( matchers ), + i > 1 && toSelector( + + // If the preceding token was a descendant combinator, insert an implicit any-element `*` + tokens + .slice( 0, i - 1 ) + .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) + ).replace( rtrim, "$1" ), + matcher, + i < j && matcherFromTokens( tokens.slice( i, j ) ), + j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), + j < len && toSelector( tokens ) + ); + } + matchers.push( matcher ); + } + } + + return elementMatcher( matchers ); +} + +function matcherFromGroupMatchers( elementMatchers, setMatchers ) { + var bySet = setMatchers.length > 0, + byElement = elementMatchers.length > 0, + superMatcher = function( seed, context, xml, results, outermost ) { + var elem, j, matcher, + matchedCount = 0, + i = "0", + unmatched = seed && [], + setMatched = [], + contextBackup = outermostContext, + + // We must always have either seed elements or outermost context + elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), + + // Use integer dirruns iff this is the outermost matcher + dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), + len = elems.length; + + if ( outermost ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + outermostContext = context == document || context || outermost; + } + + // Add elements passing elementMatchers directly to results + // Support: IE<9, Safari + // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id + for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { + if ( byElement && elem ) { + j = 0; + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( !context && elem.ownerDocument != document ) { + setDocument( elem ); + xml = !documentIsHTML; + } + while ( ( matcher = elementMatchers[ j++ ] ) ) { + if ( matcher( elem, context || document, xml ) ) { + results.push( elem ); + break; + } + } + if ( outermost ) { + dirruns = dirrunsUnique; + } + } + + // Track unmatched elements for set filters + if ( bySet ) { + + // They will have gone through all possible matchers + if ( ( elem = !matcher && elem ) ) { + matchedCount--; + } + + // Lengthen the array for every element, matched or not + if ( seed ) { + unmatched.push( elem ); + } + } + } + + // `i` is now the count of elements visited above, and adding it to `matchedCount` + // makes the latter nonnegative. + matchedCount += i; + + // Apply set filters to unmatched elements + // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` + // equals `i`), unless we didn't visit _any_ elements in the above loop because we have + // no element matchers and no seed. + // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that + // case, which will result in a "00" `matchedCount` that differs from `i` but is also + // numerically zero. + if ( bySet && i !== matchedCount ) { + j = 0; + while ( ( matcher = setMatchers[ j++ ] ) ) { + matcher( unmatched, setMatched, context, xml ); + } + + if ( seed ) { + + // Reintegrate element matches to eliminate the need for sorting + if ( matchedCount > 0 ) { + while ( i-- ) { + if ( !( unmatched[ i ] || setMatched[ i ] ) ) { + setMatched[ i ] = pop.call( results ); + } + } + } + + // Discard index placeholder values to get only actual matches + setMatched = condense( setMatched ); + } + + // Add matches to results + push.apply( results, setMatched ); + + // Seedless set matches succeeding multiple successful matchers stipulate sorting + if ( outermost && !seed && setMatched.length > 0 && + ( matchedCount + setMatchers.length ) > 1 ) { + + Sizzle.uniqueSort( results ); + } + } + + // Override manipulation of globals by nested matchers + if ( outermost ) { + dirruns = dirrunsUnique; + outermostContext = contextBackup; + } + + return unmatched; + }; + + return bySet ? + markFunction( superMatcher ) : + superMatcher; +} + +compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { + var i, + setMatchers = [], + elementMatchers = [], + cached = compilerCache[ selector + " " ]; + + if ( !cached ) { + + // Generate a function of recursive functions that can be used to check each element + if ( !match ) { + match = tokenize( selector ); + } + i = match.length; + while ( i-- ) { + cached = matcherFromTokens( match[ i ] ); + if ( cached[ expando ] ) { + setMatchers.push( cached ); + } else { + elementMatchers.push( cached ); + } + } + + // Cache the compiled function + cached = compilerCache( + selector, + matcherFromGroupMatchers( elementMatchers, setMatchers ) + ); + + // Save selector and tokenization + cached.selector = selector; + } + return cached; +}; + +/** + * A low-level selection function that works with Sizzle's compiled + * selector functions + * @param {String|Function} selector A selector or a pre-compiled + * selector function built with Sizzle.compile + * @param {Element} context + * @param {Array} [results] + * @param {Array} [seed] A set of elements to match against + */ +select = Sizzle.select = function( selector, context, results, seed ) { + var i, tokens, token, type, find, + compiled = typeof selector === "function" && selector, + match = !seed && tokenize( ( selector = compiled.selector || selector ) ); + + results = results || []; + + // Try to minimize operations if there is only one selector in the list and no seed + // (the latter of which guarantees us context) + if ( match.length === 1 ) { + + // Reduce context if the leading compound selector is an ID + tokens = match[ 0 ] = match[ 0 ].slice( 0 ); + if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && + context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { + + context = ( Expr.find[ "ID" ]( token.matches[ 0 ] + .replace( runescape, funescape ), context ) || [] )[ 0 ]; + if ( !context ) { + return results; + + // Precompiled matchers will still verify ancestry, so step up a level + } else if ( compiled ) { + context = context.parentNode; + } + + selector = selector.slice( tokens.shift().value.length ); + } + + // Fetch a seed set for right-to-left matching + i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; + while ( i-- ) { + token = tokens[ i ]; + + // Abort if we hit a combinator + if ( Expr.relative[ ( type = token.type ) ] ) { + break; + } + if ( ( find = Expr.find[ type ] ) ) { + + // Search, expanding context for leading sibling combinators + if ( ( seed = find( + token.matches[ 0 ].replace( runescape, funescape ), + rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || + context + ) ) ) { + + // If seed is empty or no tokens remain, we can return early + tokens.splice( i, 1 ); + selector = seed.length && toSelector( tokens ); + if ( !selector ) { + push.apply( results, seed ); + return results; + } + + break; + } + } + } + } + + // Compile and execute a filtering function if one is not provided + // Provide `match` to avoid retokenization if we modified the selector above + ( compiled || compile( selector, match ) )( + seed, + context, + !documentIsHTML, + results, + !context || rsibling.test( selector ) && testContext( context.parentNode ) || context + ); + return results; +}; + +// One-time assignments + +// Sort stability +support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; + +// Support: Chrome 14-35+ +// Always assume duplicates if they aren't passed to the comparison function +support.detectDuplicates = !!hasDuplicate; + +// Initialize against the default document +setDocument(); + +// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) +// Detached nodes confoundingly follow *each other* +support.sortDetached = assert( function( el ) { + + // Should return 1, but returns 4 (following) + return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; +} ); + +// Support: IE<8 +// Prevent attribute/property "interpolation" +// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx +if ( !assert( function( el ) { + el.innerHTML = ""; + return el.firstChild.getAttribute( "href" ) === "#"; +} ) ) { + addHandle( "type|href|height|width", function( elem, name, isXML ) { + if ( !isXML ) { + return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); + } + } ); +} + +// Support: IE<9 +// Use defaultValue in place of getAttribute("value") +if ( !support.attributes || !assert( function( el ) { + el.innerHTML = ""; + el.firstChild.setAttribute( "value", "" ); + return el.firstChild.getAttribute( "value" ) === ""; +} ) ) { + addHandle( "value", function( elem, _name, isXML ) { + if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { + return elem.defaultValue; + } + } ); +} + +// Support: IE<9 +// Use getAttributeNode to fetch booleans when getAttribute lies +if ( !assert( function( el ) { + return el.getAttribute( "disabled" ) == null; +} ) ) { + addHandle( booleans, function( elem, name, isXML ) { + var val; + if ( !isXML ) { + return elem[ name ] === true ? name.toLowerCase() : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; + } + } ); +} + +return Sizzle; + +} )( window ); + + + +jQuery.find = Sizzle; +jQuery.expr = Sizzle.selectors; + +// Deprecated +jQuery.expr[ ":" ] = jQuery.expr.pseudos; +jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; +jQuery.text = Sizzle.getText; +jQuery.isXMLDoc = Sizzle.isXML; +jQuery.contains = Sizzle.contains; +jQuery.escapeSelector = Sizzle.escape; + + + + +var dir = function( elem, dir, until ) { + var matched = [], + truncate = until !== undefined; + + while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { + if ( elem.nodeType === 1 ) { + if ( truncate && jQuery( elem ).is( until ) ) { + break; + } + matched.push( elem ); + } + } + return matched; +}; + + +var siblings = function( n, elem ) { + var matched = []; + + for ( ; n; n = n.nextSibling ) { + if ( n.nodeType === 1 && n !== elem ) { + matched.push( n ); + } + } + + return matched; +}; + + +var rneedsContext = jQuery.expr.match.needsContext; + + + +function nodeName( elem, name ) { + + return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); + +} +var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); + + + +// Implement the identical functionality for filter and not +function winnow( elements, qualifier, not ) { + if ( isFunction( qualifier ) ) { + return jQuery.grep( elements, function( elem, i ) { + return !!qualifier.call( elem, i, elem ) !== not; + } ); + } + + // Single element + if ( qualifier.nodeType ) { + return jQuery.grep( elements, function( elem ) { + return ( elem === qualifier ) !== not; + } ); + } + + // Arraylike of elements (jQuery, arguments, Array) + if ( typeof qualifier !== "string" ) { + return jQuery.grep( elements, function( elem ) { + return ( indexOf.call( qualifier, elem ) > -1 ) !== not; + } ); + } + + // Filtered directly for both simple and complex selectors + return jQuery.filter( qualifier, elements, not ); +} + +jQuery.filter = function( expr, elems, not ) { + var elem = elems[ 0 ]; + + if ( not ) { + expr = ":not(" + expr + ")"; + } + + if ( elems.length === 1 && elem.nodeType === 1 ) { + return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; + } + + return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { + return elem.nodeType === 1; + } ) ); +}; + +jQuery.fn.extend( { + find: function( selector ) { + var i, ret, + len = this.length, + self = this; + + if ( typeof selector !== "string" ) { + return this.pushStack( jQuery( selector ).filter( function() { + for ( i = 0; i < len; i++ ) { + if ( jQuery.contains( self[ i ], this ) ) { + return true; + } + } + } ) ); + } + + ret = this.pushStack( [] ); + + for ( i = 0; i < len; i++ ) { + jQuery.find( selector, self[ i ], ret ); + } + + return len > 1 ? jQuery.uniqueSort( ret ) : ret; + }, + filter: function( selector ) { + return this.pushStack( winnow( this, selector || [], false ) ); + }, + not: function( selector ) { + return this.pushStack( winnow( this, selector || [], true ) ); + }, + is: function( selector ) { + return !!winnow( + this, + + // If this is a positional/relative selector, check membership in the returned set + // so $("p:first").is("p:last") won't return true for a doc with two "p". + typeof selector === "string" && rneedsContext.test( selector ) ? + jQuery( selector ) : + selector || [], + false + ).length; + } +} ); + + +// Initialize a jQuery object + + +// A central reference to the root jQuery(document) +var rootjQuery, + + // A simple way to check for HTML strings + // Prioritize #id over to avoid XSS via location.hash (#9521) + // Strict HTML recognition (#11290: must start with <) + // Shortcut simple #id case for speed + rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, + + init = jQuery.fn.init = function( selector, context, root ) { + var match, elem; + + // HANDLE: $(""), $(null), $(undefined), $(false) + if ( !selector ) { + return this; + } + + // Method init() accepts an alternate rootjQuery + // so migrate can support jQuery.sub (gh-2101) + root = root || rootjQuery; + + // Handle HTML strings + if ( typeof selector === "string" ) { + if ( selector[ 0 ] === "<" && + selector[ selector.length - 1 ] === ">" && + selector.length >= 3 ) { + + // Assume that strings that start and end with <> are HTML and skip the regex check + match = [ null, selector, null ]; + + } else { + match = rquickExpr.exec( selector ); + } + + // Match html or make sure no context is specified for #id + if ( match && ( match[ 1 ] || !context ) ) { + + // HANDLE: $(html) -> $(array) + if ( match[ 1 ] ) { + context = context instanceof jQuery ? context[ 0 ] : context; + + // Option to run scripts is true for back-compat + // Intentionally let the error be thrown if parseHTML is not present + jQuery.merge( this, jQuery.parseHTML( + match[ 1 ], + context && context.nodeType ? context.ownerDocument || context : document, + true + ) ); + + // HANDLE: $(html, props) + if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { + for ( match in context ) { + + // Properties of context are called as methods if possible + if ( isFunction( this[ match ] ) ) { + this[ match ]( context[ match ] ); + + // ...and otherwise set as attributes + } else { + this.attr( match, context[ match ] ); + } + } + } + + return this; + + // HANDLE: $(#id) + } else { + elem = document.getElementById( match[ 2 ] ); + + if ( elem ) { + + // Inject the element directly into the jQuery object + this[ 0 ] = elem; + this.length = 1; + } + return this; + } + + // HANDLE: $(expr, $(...)) + } else if ( !context || context.jquery ) { + return ( context || root ).find( selector ); + + // HANDLE: $(expr, context) + // (which is just equivalent to: $(context).find(expr) + } else { + return this.constructor( context ).find( selector ); + } + + // HANDLE: $(DOMElement) + } else if ( selector.nodeType ) { + this[ 0 ] = selector; + this.length = 1; + return this; + + // HANDLE: $(function) + // Shortcut for document ready + } else if ( isFunction( selector ) ) { + return root.ready !== undefined ? + root.ready( selector ) : + + // Execute immediately if ready is not present + selector( jQuery ); + } + + return jQuery.makeArray( selector, this ); + }; + +// Give the init function the jQuery prototype for later instantiation +init.prototype = jQuery.fn; + +// Initialize central reference +rootjQuery = jQuery( document ); + + +var rparentsprev = /^(?:parents|prev(?:Until|All))/, + + // Methods guaranteed to produce a unique set when starting from a unique set + guaranteedUnique = { + children: true, + contents: true, + next: true, + prev: true + }; + +jQuery.fn.extend( { + has: function( target ) { + var targets = jQuery( target, this ), + l = targets.length; + + return this.filter( function() { + var i = 0; + for ( ; i < l; i++ ) { + if ( jQuery.contains( this, targets[ i ] ) ) { + return true; + } + } + } ); + }, + + closest: function( selectors, context ) { + var cur, + i = 0, + l = this.length, + matched = [], + targets = typeof selectors !== "string" && jQuery( selectors ); + + // Positional selectors never match, since there's no _selection_ context + if ( !rneedsContext.test( selectors ) ) { + for ( ; i < l; i++ ) { + for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { + + // Always skip document fragments + if ( cur.nodeType < 11 && ( targets ? + targets.index( cur ) > -1 : + + // Don't pass non-elements to Sizzle + cur.nodeType === 1 && + jQuery.find.matchesSelector( cur, selectors ) ) ) { + + matched.push( cur ); + break; + } + } + } + } + + return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); + }, + + // Determine the position of an element within the set + index: function( elem ) { + + // No argument, return index in parent + if ( !elem ) { + return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; + } + + // Index in selector + if ( typeof elem === "string" ) { + return indexOf.call( jQuery( elem ), this[ 0 ] ); + } + + // Locate the position of the desired element + return indexOf.call( this, + + // If it receives a jQuery object, the first element is used + elem.jquery ? elem[ 0 ] : elem + ); + }, + + add: function( selector, context ) { + return this.pushStack( + jQuery.uniqueSort( + jQuery.merge( this.get(), jQuery( selector, context ) ) + ) + ); + }, + + addBack: function( selector ) { + return this.add( selector == null ? + this.prevObject : this.prevObject.filter( selector ) + ); + } +} ); + +function sibling( cur, dir ) { + while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} + return cur; +} + +jQuery.each( { + parent: function( elem ) { + var parent = elem.parentNode; + return parent && parent.nodeType !== 11 ? parent : null; + }, + parents: function( elem ) { + return dir( elem, "parentNode" ); + }, + parentsUntil: function( elem, _i, until ) { + return dir( elem, "parentNode", until ); + }, + next: function( elem ) { + return sibling( elem, "nextSibling" ); + }, + prev: function( elem ) { + return sibling( elem, "previousSibling" ); + }, + nextAll: function( elem ) { + return dir( elem, "nextSibling" ); + }, + prevAll: function( elem ) { + return dir( elem, "previousSibling" ); + }, + nextUntil: function( elem, _i, until ) { + return dir( elem, "nextSibling", until ); + }, + prevUntil: function( elem, _i, until ) { + return dir( elem, "previousSibling", until ); + }, + siblings: function( elem ) { + return siblings( ( elem.parentNode || {} ).firstChild, elem ); + }, + children: function( elem ) { + return siblings( elem.firstChild ); + }, + contents: function( elem ) { + if ( elem.contentDocument != null && + + // Support: IE 11+ + // elements with no `data` attribute has an object + // `contentDocument` with a `null` prototype. + getProto( elem.contentDocument ) ) { + + return elem.contentDocument; + } + + // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only + // Treat the template element as a regular one in browsers that + // don't support it. + if ( nodeName( elem, "template" ) ) { + elem = elem.content || elem; + } + + return jQuery.merge( [], elem.childNodes ); + } +}, function( name, fn ) { + jQuery.fn[ name ] = function( until, selector ) { + var matched = jQuery.map( this, fn, until ); + + if ( name.slice( -5 ) !== "Until" ) { + selector = until; + } + + if ( selector && typeof selector === "string" ) { + matched = jQuery.filter( selector, matched ); + } + + if ( this.length > 1 ) { + + // Remove duplicates + if ( !guaranteedUnique[ name ] ) { + jQuery.uniqueSort( matched ); + } + + // Reverse order for parents* and prev-derivatives + if ( rparentsprev.test( name ) ) { + matched.reverse(); + } + } + + return this.pushStack( matched ); + }; +} ); +var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); + + + +// Convert String-formatted options into Object-formatted ones +function createOptions( options ) { + var object = {}; + jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { + object[ flag ] = true; + } ); + return object; +} + +/* + * Create a callback list using the following parameters: + * + * options: an optional list of space-separated options that will change how + * the callback list behaves or a more traditional option object + * + * By default a callback list will act like an event callback list and can be + * "fired" multiple times. + * + * Possible options: + * + * once: will ensure the callback list can only be fired once (like a Deferred) + * + * memory: will keep track of previous values and will call any callback added + * after the list has been fired right away with the latest "memorized" + * values (like a Deferred) + * + * unique: will ensure a callback can only be added once (no duplicate in the list) + * + * stopOnFalse: interrupt callings when a callback returns false + * + */ +jQuery.Callbacks = function( options ) { + + // Convert options from String-formatted to Object-formatted if needed + // (we check in cache first) + options = typeof options === "string" ? + createOptions( options ) : + jQuery.extend( {}, options ); + + var // Flag to know if list is currently firing + firing, + + // Last fire value for non-forgettable lists + memory, + + // Flag to know if list was already fired + fired, + + // Flag to prevent firing + locked, + + // Actual callback list + list = [], + + // Queue of execution data for repeatable lists + queue = [], + + // Index of currently firing callback (modified by add/remove as needed) + firingIndex = -1, + + // Fire callbacks + fire = function() { + + // Enforce single-firing + locked = locked || options.once; + + // Execute callbacks for all pending executions, + // respecting firingIndex overrides and runtime changes + fired = firing = true; + for ( ; queue.length; firingIndex = -1 ) { + memory = queue.shift(); + while ( ++firingIndex < list.length ) { + + // Run callback and check for early termination + if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && + options.stopOnFalse ) { + + // Jump to end and forget the data so .add doesn't re-fire + firingIndex = list.length; + memory = false; + } + } + } + + // Forget the data if we're done with it + if ( !options.memory ) { + memory = false; + } + + firing = false; + + // Clean up if we're done firing for good + if ( locked ) { + + // Keep an empty list if we have data for future add calls + if ( memory ) { + list = []; + + // Otherwise, this object is spent + } else { + list = ""; + } + } + }, + + // Actual Callbacks object + self = { + + // Add a callback or a collection of callbacks to the list + add: function() { + if ( list ) { + + // If we have memory from a past run, we should fire after adding + if ( memory && !firing ) { + firingIndex = list.length - 1; + queue.push( memory ); + } + + ( function add( args ) { + jQuery.each( args, function( _, arg ) { + if ( isFunction( arg ) ) { + if ( !options.unique || !self.has( arg ) ) { + list.push( arg ); + } + } else if ( arg && arg.length && toType( arg ) !== "string" ) { + + // Inspect recursively + add( arg ); + } + } ); + } )( arguments ); + + if ( memory && !firing ) { + fire(); + } + } + return this; + }, + + // Remove a callback from the list + remove: function() { + jQuery.each( arguments, function( _, arg ) { + var index; + while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { + list.splice( index, 1 ); + + // Handle firing indexes + if ( index <= firingIndex ) { + firingIndex--; + } + } + } ); + return this; + }, + + // Check if a given callback is in the list. + // If no argument is given, return whether or not list has callbacks attached. + has: function( fn ) { + return fn ? + jQuery.inArray( fn, list ) > -1 : + list.length > 0; + }, + + // Remove all callbacks from the list + empty: function() { + if ( list ) { + list = []; + } + return this; + }, + + // Disable .fire and .add + // Abort any current/pending executions + // Clear all callbacks and values + disable: function() { + locked = queue = []; + list = memory = ""; + return this; + }, + disabled: function() { + return !list; + }, + + // Disable .fire + // Also disable .add unless we have memory (since it would have no effect) + // Abort any pending executions + lock: function() { + locked = queue = []; + if ( !memory && !firing ) { + list = memory = ""; + } + return this; + }, + locked: function() { + return !!locked; + }, + + // Call all callbacks with the given context and arguments + fireWith: function( context, args ) { + if ( !locked ) { + args = args || []; + args = [ context, args.slice ? args.slice() : args ]; + queue.push( args ); + if ( !firing ) { + fire(); + } + } + return this; + }, + + // Call all the callbacks with the given arguments + fire: function() { + self.fireWith( this, arguments ); + return this; + }, + + // To know if the callbacks have already been called at least once + fired: function() { + return !!fired; + } + }; + + return self; +}; + + +function Identity( v ) { + return v; +} +function Thrower( ex ) { + throw ex; +} + +function adoptValue( value, resolve, reject, noValue ) { + var method; + + try { + + // Check for promise aspect first to privilege synchronous behavior + if ( value && isFunction( ( method = value.promise ) ) ) { + method.call( value ).done( resolve ).fail( reject ); + + // Other thenables + } else if ( value && isFunction( ( method = value.then ) ) ) { + method.call( value, resolve, reject ); + + // Other non-thenables + } else { + + // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: + // * false: [ value ].slice( 0 ) => resolve( value ) + // * true: [ value ].slice( 1 ) => resolve() + resolve.apply( undefined, [ value ].slice( noValue ) ); + } + + // For Promises/A+, convert exceptions into rejections + // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in + // Deferred#then to conditionally suppress rejection. + } catch ( value ) { + + // Support: Android 4.0 only + // Strict mode functions invoked without .call/.apply get global-object context + reject.apply( undefined, [ value ] ); + } +} + +jQuery.extend( { + + Deferred: function( func ) { + var tuples = [ + + // action, add listener, callbacks, + // ... .then handlers, argument index, [final state] + [ "notify", "progress", jQuery.Callbacks( "memory" ), + jQuery.Callbacks( "memory" ), 2 ], + [ "resolve", "done", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 0, "resolved" ], + [ "reject", "fail", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 1, "rejected" ] + ], + state = "pending", + promise = { + state: function() { + return state; + }, + always: function() { + deferred.done( arguments ).fail( arguments ); + return this; + }, + "catch": function( fn ) { + return promise.then( null, fn ); + }, + + // Keep pipe for back-compat + pipe: function( /* fnDone, fnFail, fnProgress */ ) { + var fns = arguments; + + return jQuery.Deferred( function( newDefer ) { + jQuery.each( tuples, function( _i, tuple ) { + + // Map tuples (progress, done, fail) to arguments (done, fail, progress) + var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; + + // deferred.progress(function() { bind to newDefer or newDefer.notify }) + // deferred.done(function() { bind to newDefer or newDefer.resolve }) + // deferred.fail(function() { bind to newDefer or newDefer.reject }) + deferred[ tuple[ 1 ] ]( function() { + var returned = fn && fn.apply( this, arguments ); + if ( returned && isFunction( returned.promise ) ) { + returned.promise() + .progress( newDefer.notify ) + .done( newDefer.resolve ) + .fail( newDefer.reject ); + } else { + newDefer[ tuple[ 0 ] + "With" ]( + this, + fn ? [ returned ] : arguments + ); + } + } ); + } ); + fns = null; + } ).promise(); + }, + then: function( onFulfilled, onRejected, onProgress ) { + var maxDepth = 0; + function resolve( depth, deferred, handler, special ) { + return function() { + var that = this, + args = arguments, + mightThrow = function() { + var returned, then; + + // Support: Promises/A+ section 2.3.3.3.3 + // https://promisesaplus.com/#point-59 + // Ignore double-resolution attempts + if ( depth < maxDepth ) { + return; + } + + returned = handler.apply( that, args ); + + // Support: Promises/A+ section 2.3.1 + // https://promisesaplus.com/#point-48 + if ( returned === deferred.promise() ) { + throw new TypeError( "Thenable self-resolution" ); + } + + // Support: Promises/A+ sections 2.3.3.1, 3.5 + // https://promisesaplus.com/#point-54 + // https://promisesaplus.com/#point-75 + // Retrieve `then` only once + then = returned && + + // Support: Promises/A+ section 2.3.4 + // https://promisesaplus.com/#point-64 + // Only check objects and functions for thenability + ( typeof returned === "object" || + typeof returned === "function" ) && + returned.then; + + // Handle a returned thenable + if ( isFunction( then ) ) { + + // Special processors (notify) just wait for resolution + if ( special ) { + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ) + ); + + // Normal processors (resolve) also hook into progress + } else { + + // ...and disregard older resolution values + maxDepth++; + + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ), + resolve( maxDepth, deferred, Identity, + deferred.notifyWith ) + ); + } + + // Handle all other returned values + } else { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Identity ) { + that = undefined; + args = [ returned ]; + } + + // Process the value(s) + // Default process is resolve + ( special || deferred.resolveWith )( that, args ); + } + }, + + // Only normal processors (resolve) catch and reject exceptions + process = special ? + mightThrow : + function() { + try { + mightThrow(); + } catch ( e ) { + + if ( jQuery.Deferred.exceptionHook ) { + jQuery.Deferred.exceptionHook( e, + process.stackTrace ); + } + + // Support: Promises/A+ section 2.3.3.3.4.1 + // https://promisesaplus.com/#point-61 + // Ignore post-resolution exceptions + if ( depth + 1 >= maxDepth ) { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Thrower ) { + that = undefined; + args = [ e ]; + } + + deferred.rejectWith( that, args ); + } + } + }; + + // Support: Promises/A+ section 2.3.3.3.1 + // https://promisesaplus.com/#point-57 + // Re-resolve promises immediately to dodge false rejection from + // subsequent errors + if ( depth ) { + process(); + } else { + + // Call an optional hook to record the stack, in case of exception + // since it's otherwise lost when execution goes async + if ( jQuery.Deferred.getStackHook ) { + process.stackTrace = jQuery.Deferred.getStackHook(); + } + window.setTimeout( process ); + } + }; + } + + return jQuery.Deferred( function( newDefer ) { + + // progress_handlers.add( ... ) + tuples[ 0 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onProgress ) ? + onProgress : + Identity, + newDefer.notifyWith + ) + ); + + // fulfilled_handlers.add( ... ) + tuples[ 1 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onFulfilled ) ? + onFulfilled : + Identity + ) + ); + + // rejected_handlers.add( ... ) + tuples[ 2 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onRejected ) ? + onRejected : + Thrower + ) + ); + } ).promise(); + }, + + // Get a promise for this deferred + // If obj is provided, the promise aspect is added to the object + promise: function( obj ) { + return obj != null ? jQuery.extend( obj, promise ) : promise; + } + }, + deferred = {}; + + // Add list-specific methods + jQuery.each( tuples, function( i, tuple ) { + var list = tuple[ 2 ], + stateString = tuple[ 5 ]; + + // promise.progress = list.add + // promise.done = list.add + // promise.fail = list.add + promise[ tuple[ 1 ] ] = list.add; + + // Handle state + if ( stateString ) { + list.add( + function() { + + // state = "resolved" (i.e., fulfilled) + // state = "rejected" + state = stateString; + }, + + // rejected_callbacks.disable + // fulfilled_callbacks.disable + tuples[ 3 - i ][ 2 ].disable, + + // rejected_handlers.disable + // fulfilled_handlers.disable + tuples[ 3 - i ][ 3 ].disable, + + // progress_callbacks.lock + tuples[ 0 ][ 2 ].lock, + + // progress_handlers.lock + tuples[ 0 ][ 3 ].lock + ); + } + + // progress_handlers.fire + // fulfilled_handlers.fire + // rejected_handlers.fire + list.add( tuple[ 3 ].fire ); + + // deferred.notify = function() { deferred.notifyWith(...) } + // deferred.resolve = function() { deferred.resolveWith(...) } + // deferred.reject = function() { deferred.rejectWith(...) } + deferred[ tuple[ 0 ] ] = function() { + deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); + return this; + }; + + // deferred.notifyWith = list.fireWith + // deferred.resolveWith = list.fireWith + // deferred.rejectWith = list.fireWith + deferred[ tuple[ 0 ] + "With" ] = list.fireWith; + } ); + + // Make the deferred a promise + promise.promise( deferred ); + + // Call given func if any + if ( func ) { + func.call( deferred, deferred ); + } + + // All done! + return deferred; + }, + + // Deferred helper + when: function( singleValue ) { + var + + // count of uncompleted subordinates + remaining = arguments.length, + + // count of unprocessed arguments + i = remaining, + + // subordinate fulfillment data + resolveContexts = Array( i ), + resolveValues = slice.call( arguments ), + + // the primary Deferred + primary = jQuery.Deferred(), + + // subordinate callback factory + updateFunc = function( i ) { + return function( value ) { + resolveContexts[ i ] = this; + resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; + if ( !( --remaining ) ) { + primary.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( primary.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return primary.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject ); + } + + return primary.promise(); + } +} ); + + +// These usually indicate a programmer mistake during development, +// warn about them ASAP rather than swallowing them by default. +var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; + +jQuery.Deferred.exceptionHook = function( error, stack ) { + + // Support: IE 8 - 9 only + // Console exists when dev tools are open, which can happen at any time + if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { + window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); + } +}; + + + + +jQuery.readyException = function( error ) { + window.setTimeout( function() { + throw error; + } ); +}; + + + + +// The deferred used on DOM ready +var readyList = jQuery.Deferred(); + +jQuery.fn.ready = function( fn ) { + + readyList + .then( fn ) + + // Wrap jQuery.readyException in a function so that the lookup + // happens at the time of error handling instead of callback + // registration. + .catch( function( error ) { + jQuery.readyException( error ); + } ); + + return this; +}; + +jQuery.extend( { + + // Is the DOM ready to be used? Set to true once it occurs. + isReady: false, + + // A counter to track how many items to wait for before + // the ready event fires. See #6781 + readyWait: 1, + + // Handle when the DOM is ready + ready: function( wait ) { + + // Abort if there are pending holds or we're already ready + if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { + return; + } + + // Remember that the DOM is ready + jQuery.isReady = true; + + // If a normal DOM Ready event fired, decrement, and wait if need be + if ( wait !== true && --jQuery.readyWait > 0 ) { + return; + } + + // If there are functions bound, to execute + readyList.resolveWith( document, [ jQuery ] ); + } +} ); + +jQuery.ready.then = readyList.then; + +// The ready event handler and self cleanup method +function completed() { + document.removeEventListener( "DOMContentLoaded", completed ); + window.removeEventListener( "load", completed ); + jQuery.ready(); +} + +// Catch cases where $(document).ready() is called +// after the browser event has already occurred. +// Support: IE <=9 - 10 only +// Older IE sometimes signals "interactive" too soon +if ( document.readyState === "complete" || + ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { + + // Handle it asynchronously to allow scripts the opportunity to delay ready + window.setTimeout( jQuery.ready ); + +} else { + + // Use the handy event callback + document.addEventListener( "DOMContentLoaded", completed ); + + // A fallback to window.onload, that will always work + window.addEventListener( "load", completed ); +} + + + + +// Multifunctional method to get and set values of a collection +// The value/s can optionally be executed if it's a function +var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { + var i = 0, + len = elems.length, + bulk = key == null; + + // Sets many values + if ( toType( key ) === "object" ) { + chainable = true; + for ( i in key ) { + access( elems, fn, i, key[ i ], true, emptyGet, raw ); + } + + // Sets one value + } else if ( value !== undefined ) { + chainable = true; + + if ( !isFunction( value ) ) { + raw = true; + } + + if ( bulk ) { + + // Bulk operations run against the entire set + if ( raw ) { + fn.call( elems, value ); + fn = null; + + // ...except when executing function values + } else { + bulk = fn; + fn = function( elem, _key, value ) { + return bulk.call( jQuery( elem ), value ); + }; + } + } + + if ( fn ) { + for ( ; i < len; i++ ) { + fn( + elems[ i ], key, raw ? + value : + value.call( elems[ i ], i, fn( elems[ i ], key ) ) + ); + } + } + } + + if ( chainable ) { + return elems; + } + + // Gets + if ( bulk ) { + return fn.call( elems ); + } + + return len ? fn( elems[ 0 ], key ) : emptyGet; +}; + + +// Matches dashed string for camelizing +var rmsPrefix = /^-ms-/, + rdashAlpha = /-([a-z])/g; + +// Used by camelCase as callback to replace() +function fcamelCase( _all, letter ) { + return letter.toUpperCase(); +} + +// Convert dashed to camelCase; used by the css and data modules +// Support: IE <=9 - 11, Edge 12 - 15 +// Microsoft forgot to hump their vendor prefix (#9572) +function camelCase( string ) { + return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); +} +var acceptData = function( owner ) { + + // Accepts only: + // - Node + // - Node.ELEMENT_NODE + // - Node.DOCUMENT_NODE + // - Object + // - Any + return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); +}; + + + + +function Data() { + this.expando = jQuery.expando + Data.uid++; +} + +Data.uid = 1; + +Data.prototype = { + + cache: function( owner ) { + + // Check if the owner object already has a cache + var value = owner[ this.expando ]; + + // If not, create one + if ( !value ) { + value = {}; + + // We can accept data for non-element nodes in modern browsers, + // but we should not, see #8335. + // Always return an empty object. + if ( acceptData( owner ) ) { + + // If it is a node unlikely to be stringify-ed or looped over + // use plain assignment + if ( owner.nodeType ) { + owner[ this.expando ] = value; + + // Otherwise secure it in a non-enumerable property + // configurable must be true to allow the property to be + // deleted when data is removed + } else { + Object.defineProperty( owner, this.expando, { + value: value, + configurable: true + } ); + } + } + } + + return value; + }, + set: function( owner, data, value ) { + var prop, + cache = this.cache( owner ); + + // Handle: [ owner, key, value ] args + // Always use camelCase key (gh-2257) + if ( typeof data === "string" ) { + cache[ camelCase( data ) ] = value; + + // Handle: [ owner, { properties } ] args + } else { + + // Copy the properties one-by-one to the cache object + for ( prop in data ) { + cache[ camelCase( prop ) ] = data[ prop ]; + } + } + return cache; + }, + get: function( owner, key ) { + return key === undefined ? + this.cache( owner ) : + + // Always use camelCase key (gh-2257) + owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; + }, + access: function( owner, key, value ) { + + // In cases where either: + // + // 1. No key was specified + // 2. A string key was specified, but no value provided + // + // Take the "read" path and allow the get method to determine + // which value to return, respectively either: + // + // 1. The entire cache object + // 2. The data stored at the key + // + if ( key === undefined || + ( ( key && typeof key === "string" ) && value === undefined ) ) { + + return this.get( owner, key ); + } + + // When the key is not a string, or both a key and value + // are specified, set or extend (existing objects) with either: + // + // 1. An object of properties + // 2. A key and value + // + this.set( owner, key, value ); + + // Since the "set" path can have two possible entry points + // return the expected data based on which path was taken[*] + return value !== undefined ? value : key; + }, + remove: function( owner, key ) { + var i, + cache = owner[ this.expando ]; + + if ( cache === undefined ) { + return; + } + + if ( key !== undefined ) { + + // Support array or space separated string of keys + if ( Array.isArray( key ) ) { + + // If key is an array of keys... + // We always set camelCase keys, so remove that. + key = key.map( camelCase ); + } else { + key = camelCase( key ); + + // If a key with the spaces exists, use it. + // Otherwise, create an array by matching non-whitespace + key = key in cache ? + [ key ] : + ( key.match( rnothtmlwhite ) || [] ); + } + + i = key.length; + + while ( i-- ) { + delete cache[ key[ i ] ]; + } + } + + // Remove the expando if there's no more data + if ( key === undefined || jQuery.isEmptyObject( cache ) ) { + + // Support: Chrome <=35 - 45 + // Webkit & Blink performance suffers when deleting properties + // from DOM nodes, so set to undefined instead + // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) + if ( owner.nodeType ) { + owner[ this.expando ] = undefined; + } else { + delete owner[ this.expando ]; + } + } + }, + hasData: function( owner ) { + var cache = owner[ this.expando ]; + return cache !== undefined && !jQuery.isEmptyObject( cache ); + } +}; +var dataPriv = new Data(); + +var dataUser = new Data(); + + + +// Implementation Summary +// +// 1. Enforce API surface and semantic compatibility with 1.9.x branch +// 2. Improve the module's maintainability by reducing the storage +// paths to a single mechanism. +// 3. Use the same single mechanism to support "private" and "user" data. +// 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) +// 5. Avoid exposing implementation details on user objects (eg. expando properties) +// 6. Provide a clear path for implementation upgrade to WeakMap in 2014 + +var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, + rmultiDash = /[A-Z]/g; + +function getData( data ) { + if ( data === "true" ) { + return true; + } + + if ( data === "false" ) { + return false; + } + + if ( data === "null" ) { + return null; + } + + // Only convert to a number if it doesn't change the string + if ( data === +data + "" ) { + return +data; + } + + if ( rbrace.test( data ) ) { + return JSON.parse( data ); + } + + return data; +} + +function dataAttr( elem, key, data ) { + var name; + + // If nothing was found internally, try to fetch any + // data from the HTML5 data-* attribute + if ( data === undefined && elem.nodeType === 1 ) { + name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); + data = elem.getAttribute( name ); + + if ( typeof data === "string" ) { + try { + data = getData( data ); + } catch ( e ) {} + + // Make sure we set the data so it isn't changed later + dataUser.set( elem, key, data ); + } else { + data = undefined; + } + } + return data; +} + +jQuery.extend( { + hasData: function( elem ) { + return dataUser.hasData( elem ) || dataPriv.hasData( elem ); + }, + + data: function( elem, name, data ) { + return dataUser.access( elem, name, data ); + }, + + removeData: function( elem, name ) { + dataUser.remove( elem, name ); + }, + + // TODO: Now that all calls to _data and _removeData have been replaced + // with direct calls to dataPriv methods, these can be deprecated. + _data: function( elem, name, data ) { + return dataPriv.access( elem, name, data ); + }, + + _removeData: function( elem, name ) { + dataPriv.remove( elem, name ); + } +} ); + +jQuery.fn.extend( { + data: function( key, value ) { + var i, name, data, + elem = this[ 0 ], + attrs = elem && elem.attributes; + + // Gets all values + if ( key === undefined ) { + if ( this.length ) { + data = dataUser.get( elem ); + + if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { + i = attrs.length; + while ( i-- ) { + + // Support: IE 11 only + // The attrs elements can be null (#14894) + if ( attrs[ i ] ) { + name = attrs[ i ].name; + if ( name.indexOf( "data-" ) === 0 ) { + name = camelCase( name.slice( 5 ) ); + dataAttr( elem, name, data[ name ] ); + } + } + } + dataPriv.set( elem, "hasDataAttrs", true ); + } + } + + return data; + } + + // Sets multiple values + if ( typeof key === "object" ) { + return this.each( function() { + dataUser.set( this, key ); + } ); + } + + return access( this, function( value ) { + var data; + + // The calling jQuery object (element matches) is not empty + // (and therefore has an element appears at this[ 0 ]) and the + // `value` parameter was not undefined. An empty jQuery object + // will result in `undefined` for elem = this[ 0 ] which will + // throw an exception if an attempt to read a data cache is made. + if ( elem && value === undefined ) { + + // Attempt to get data from the cache + // The key will always be camelCased in Data + data = dataUser.get( elem, key ); + if ( data !== undefined ) { + return data; + } + + // Attempt to "discover" the data in + // HTML5 custom data-* attrs + data = dataAttr( elem, key ); + if ( data !== undefined ) { + return data; + } + + // We tried really hard, but the data doesn't exist. + return; + } + + // Set the data... + this.each( function() { + + // We always store the camelCased key + dataUser.set( this, key, value ); + } ); + }, null, value, arguments.length > 1, null, true ); + }, + + removeData: function( key ) { + return this.each( function() { + dataUser.remove( this, key ); + } ); + } +} ); + + +jQuery.extend( { + queue: function( elem, type, data ) { + var queue; + + if ( elem ) { + type = ( type || "fx" ) + "queue"; + queue = dataPriv.get( elem, type ); + + // Speed up dequeue by getting out quickly if this is just a lookup + if ( data ) { + if ( !queue || Array.isArray( data ) ) { + queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); + } else { + queue.push( data ); + } + } + return queue || []; + } + }, + + dequeue: function( elem, type ) { + type = type || "fx"; + + var queue = jQuery.queue( elem, type ), + startLength = queue.length, + fn = queue.shift(), + hooks = jQuery._queueHooks( elem, type ), + next = function() { + jQuery.dequeue( elem, type ); + }; + + // If the fx queue is dequeued, always remove the progress sentinel + if ( fn === "inprogress" ) { + fn = queue.shift(); + startLength--; + } + + if ( fn ) { + + // Add a progress sentinel to prevent the fx queue from being + // automatically dequeued + if ( type === "fx" ) { + queue.unshift( "inprogress" ); + } + + // Clear up the last queue stop function + delete hooks.stop; + fn.call( elem, next, hooks ); + } + + if ( !startLength && hooks ) { + hooks.empty.fire(); + } + }, + + // Not public - generate a queueHooks object, or return the current one + _queueHooks: function( elem, type ) { + var key = type + "queueHooks"; + return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { + empty: jQuery.Callbacks( "once memory" ).add( function() { + dataPriv.remove( elem, [ type + "queue", key ] ); + } ) + } ); + } +} ); + +jQuery.fn.extend( { + queue: function( type, data ) { + var setter = 2; + + if ( typeof type !== "string" ) { + data = type; + type = "fx"; + setter--; + } + + if ( arguments.length < setter ) { + return jQuery.queue( this[ 0 ], type ); + } + + return data === undefined ? + this : + this.each( function() { + var queue = jQuery.queue( this, type, data ); + + // Ensure a hooks for this queue + jQuery._queueHooks( this, type ); + + if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { + jQuery.dequeue( this, type ); + } + } ); + }, + dequeue: function( type ) { + return this.each( function() { + jQuery.dequeue( this, type ); + } ); + }, + clearQueue: function( type ) { + return this.queue( type || "fx", [] ); + }, + + // Get a promise resolved when queues of a certain type + // are emptied (fx is the type by default) + promise: function( type, obj ) { + var tmp, + count = 1, + defer = jQuery.Deferred(), + elements = this, + i = this.length, + resolve = function() { + if ( !( --count ) ) { + defer.resolveWith( elements, [ elements ] ); + } + }; + + if ( typeof type !== "string" ) { + obj = type; + type = undefined; + } + type = type || "fx"; + + while ( i-- ) { + tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); + if ( tmp && tmp.empty ) { + count++; + tmp.empty.add( resolve ); + } + } + resolve(); + return defer.promise( obj ); + } +} ); +var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; + +var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); + + +var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; + +var documentElement = document.documentElement; + + + + var isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ); + }, + composed = { composed: true }; + + // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only + // Check attachment across shadow DOM boundaries when possible (gh-3504) + // Support: iOS 10.0-10.2 only + // Early iOS 10 versions support `attachShadow` but not `getRootNode`, + // leading to errors. We need to check for `getRootNode`. + if ( documentElement.getRootNode ) { + isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ) || + elem.getRootNode( composed ) === elem.ownerDocument; + }; + } +var isHiddenWithinTree = function( elem, el ) { + + // isHiddenWithinTree might be called from jQuery#filter function; + // in that case, element will be second argument + elem = el || elem; + + // Inline style trumps all + return elem.style.display === "none" || + elem.style.display === "" && + + // Otherwise, check computed style + // Support: Firefox <=43 - 45 + // Disconnected elements can have computed display: none, so first confirm that elem is + // in the document. + isAttached( elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + + + +function adjustCSS( elem, prop, valueParts, tween ) { + var adjusted, scale, + maxIterations = 20, + currentValue = tween ? + function() { + return tween.cur(); + } : + function() { + return jQuery.css( elem, prop, "" ); + }, + initial = currentValue(), + unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), + + // Starting value computation is required for potential unit mismatches + initialInUnit = elem.nodeType && + ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && + rcssNum.exec( jQuery.css( elem, prop ) ); + + if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { + + // Support: Firefox <=54 + // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) + initial = initial / 2; + + // Trust units reported by jQuery.css + unit = unit || initialInUnit[ 3 ]; + + // Iteratively approximate from a nonzero starting point + initialInUnit = +initial || 1; + + while ( maxIterations-- ) { + + // Evaluate and update our best guess (doubling guesses that zero out). + // Finish if the scale equals or crosses 1 (making the old*new product non-positive). + jQuery.style( elem, prop, initialInUnit + unit ); + if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { + maxIterations = 0; + } + initialInUnit = initialInUnit / scale; + + } + + initialInUnit = initialInUnit * 2; + jQuery.style( elem, prop, initialInUnit + unit ); + + // Make sure we update the tween properties later on + valueParts = valueParts || []; + } + + if ( valueParts ) { + initialInUnit = +initialInUnit || +initial || 0; + + // Apply relative offset (+=/-=) if specified + adjusted = valueParts[ 1 ] ? + initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : + +valueParts[ 2 ]; + if ( tween ) { + tween.unit = unit; + tween.start = initialInUnit; + tween.end = adjusted; + } + } + return adjusted; +} + + +var defaultDisplayMap = {}; + +function getDefaultDisplay( elem ) { + var temp, + doc = elem.ownerDocument, + nodeName = elem.nodeName, + display = defaultDisplayMap[ nodeName ]; + + if ( display ) { + return display; + } + + temp = doc.body.appendChild( doc.createElement( nodeName ) ); + display = jQuery.css( temp, "display" ); + + temp.parentNode.removeChild( temp ); + + if ( display === "none" ) { + display = "block"; + } + defaultDisplayMap[ nodeName ] = display; + + return display; +} + +function showHide( elements, show ) { + var display, elem, + values = [], + index = 0, + length = elements.length; + + // Determine new display value for elements that need to change + for ( ; index < length; index++ ) { + elem = elements[ index ]; + if ( !elem.style ) { + continue; + } + + display = elem.style.display; + if ( show ) { + + // Since we force visibility upon cascade-hidden elements, an immediate (and slow) + // check is required in this first loop unless we have a nonempty display value (either + // inline or about-to-be-restored) + if ( display === "none" ) { + values[ index ] = dataPriv.get( elem, "display" ) || null; + if ( !values[ index ] ) { + elem.style.display = ""; + } + } + if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { + values[ index ] = getDefaultDisplay( elem ); + } + } else { + if ( display !== "none" ) { + values[ index ] = "none"; + + // Remember what we're overwriting + dataPriv.set( elem, "display", display ); + } + } + } + + // Set the display of the elements in a second loop to avoid constant reflow + for ( index = 0; index < length; index++ ) { + if ( values[ index ] != null ) { + elements[ index ].style.display = values[ index ]; + } + } + + return elements; +} + +jQuery.fn.extend( { + show: function() { + return showHide( this, true ); + }, + hide: function() { + return showHide( this ); + }, + toggle: function( state ) { + if ( typeof state === "boolean" ) { + return state ? this.show() : this.hide(); + } + + return this.each( function() { + if ( isHiddenWithinTree( this ) ) { + jQuery( this ).show(); + } else { + jQuery( this ).hide(); + } + } ); + } +} ); +var rcheckableType = ( /^(?:checkbox|radio)$/i ); + +var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); + +var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); + + + +( function() { + var fragment = document.createDocumentFragment(), + div = fragment.appendChild( document.createElement( "div" ) ), + input = document.createElement( "input" ); + + // Support: Android 4.0 - 4.3 only + // Check state lost if the name is set (#11217) + // Support: Windows Web Apps (WWA) + // `name` and `type` must use .setAttribute for WWA (#14901) + input.setAttribute( "type", "radio" ); + input.setAttribute( "checked", "checked" ); + input.setAttribute( "name", "t" ); + + div.appendChild( input ); + + // Support: Android <=4.1 only + // Older WebKit doesn't clone checked state correctly in fragments + support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; + + // Support: IE <=11 only + // Make sure textarea (and checkbox) defaultValue is properly cloned + div.innerHTML = ""; + support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; + + // Support: IE <=9 only + // IE <=9 replaces "; + support.option = !!div.lastChild; +} )(); + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // XHTML parsers do not magically insert elements in the + // same way that tag soup parsers do. So we cannot shorten + // this by omitting or other required elements. + thead: [ 1, "", "
" ], + col: [ 2, "", "
" ], + tr: [ 2, "", "
" ], + td: [ 3, "", "
" ], + + _default: [ 0, "", "" ] +}; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + +// Support: IE <=9 only +if ( !support.option ) { + wrapMap.optgroup = wrapMap.option = [ 1, "" ]; +} + + +function getAll( context, tag ) { + + // Support: IE <=9 - 11 only + // Use typeof to avoid zero-argument method invocation on host objects (#15151) + var ret; + + if ( typeof context.getElementsByTagName !== "undefined" ) { + ret = context.getElementsByTagName( tag || "*" ); + + } else if ( typeof context.querySelectorAll !== "undefined" ) { + ret = context.querySelectorAll( tag || "*" ); + + } else { + ret = []; + } + + if ( tag === undefined || tag && nodeName( context, tag ) ) { + return jQuery.merge( [ context ], ret ); + } + + return ret; +} + + +// Mark scripts as having already been evaluated +function setGlobalEval( elems, refElements ) { + var i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + dataPriv.set( + elems[ i ], + "globalEval", + !refElements || dataPriv.get( refElements[ i ], "globalEval" ) + ); + } +} + + +var rhtml = /<|&#?\w+;/; + +function buildFragment( elems, context, scripts, selection, ignored ) { + var elem, tmp, tag, wrap, attached, j, + fragment = context.createDocumentFragment(), + nodes = [], + i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + elem = elems[ i ]; + + if ( elem || elem === 0 ) { + + // Add nodes directly + if ( toType( elem ) === "object" ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); + + // Convert non-html into a text node + } else if ( !rhtml.test( elem ) ) { + nodes.push( context.createTextNode( elem ) ); + + // Convert html into DOM nodes + } else { + tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); + + // Deserialize a standard representation + tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); + wrap = wrapMap[ tag ] || wrapMap._default; + tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; + + // Descend through wrappers to the right content + j = wrap[ 0 ]; + while ( j-- ) { + tmp = tmp.lastChild; + } + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, tmp.childNodes ); + + // Remember the top-level container + tmp = fragment.firstChild; + + // Ensure the created nodes are orphaned (#12392) + tmp.textContent = ""; + } + } + } + + // Remove wrapper from fragment + fragment.textContent = ""; + + i = 0; + while ( ( elem = nodes[ i++ ] ) ) { + + // Skip elements already in the context collection (trac-4087) + if ( selection && jQuery.inArray( elem, selection ) > -1 ) { + if ( ignored ) { + ignored.push( elem ); + } + continue; + } + + attached = isAttached( elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( attached ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +var rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 - 11+ +// focus() and blur() are asynchronous, except when they are no-op. +// So expect focus to be synchronous when the element is already active, +// and blur to be synchronous when the element is not already active. +// (focus and blur are always synchronous in other supported browsers, +// this just defines when we can count on it). +function expectSync( elem, type ) { + return ( elem === safeActiveElement() ) === ( type === "focus" ); +} + +// Support: IE <=9 only +// Accessing document.activeElement can throw unexpectedly +// https://bugs.jquery.com/ticket/13393 +function safeActiveElement() { + try { + return document.activeElement; + } catch ( err ) { } +} + +function on( elem, types, selector, data, fn, one ) { + var origFn, type; + + // Types can be a map of types/handlers + if ( typeof types === "object" ) { + + // ( types-Object, selector, data ) + if ( typeof selector !== "string" ) { + + // ( types-Object, data ) + data = data || selector; + selector = undefined; + } + for ( type in types ) { + on( elem, type, selector, data, types[ type ], one ); + } + return elem; + } + + if ( data == null && fn == null ) { + + // ( types, fn ) + fn = selector; + data = selector = undefined; + } else if ( fn == null ) { + if ( typeof selector === "string" ) { + + // ( types, selector, fn ) + fn = data; + data = undefined; + } else { + + // ( types, data, fn ) + fn = data; + data = selector; + selector = undefined; + } + } + if ( fn === false ) { + fn = returnFalse; + } else if ( !fn ) { + return elem; + } + + if ( one === 1 ) { + origFn = fn; + fn = function( event ) { + + // Can use an empty set, since event contains the info + jQuery().off( event ); + return origFn.apply( this, arguments ); + }; + + // Use same guid so caller can remove using origFn + fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); + } + return elem.each( function() { + jQuery.event.add( this, types, fn, data, selector ); + } ); +} + +/* + * Helper functions for managing events -- not part of the public interface. + * Props to Dean Edwards' addEvent library for many of the ideas. + */ +jQuery.event = { + + global: {}, + + add: function( elem, types, handler, data, selector ) { + + var handleObjIn, eventHandle, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.get( elem ); + + // Only attach events to objects that accept data + if ( !acceptData( elem ) ) { + return; + } + + // Caller can pass in an object of custom data in lieu of the handler + if ( handler.handler ) { + handleObjIn = handler; + handler = handleObjIn.handler; + selector = handleObjIn.selector; + } + + // Ensure that invalid selectors throw exceptions at attach time + // Evaluate against documentElement in case elem is a non-element node (e.g., document) + if ( selector ) { + jQuery.find.matchesSelector( documentElement, selector ); + } + + // Make sure that the handler has a unique ID, used to find/remove it later + if ( !handler.guid ) { + handler.guid = jQuery.guid++; + } + + // Init the element's event structure and main handler, if this is the first + if ( !( events = elemData.events ) ) { + events = elemData.events = Object.create( null ); + } + if ( !( eventHandle = elemData.handle ) ) { + eventHandle = elemData.handle = function( e ) { + + // Discard the second event of a jQuery.event.trigger() and + // when an event is called after a page has unloaded + return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? + jQuery.event.dispatch.apply( elem, arguments ) : undefined; + }; + } + + // Handle multiple events separated by a space + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // There *must* be a type, no attaching namespace-only handlers + if ( !type ) { + continue; + } + + // If event changes its type, use the special event handlers for the changed type + special = jQuery.event.special[ type ] || {}; + + // If selector defined, determine special event api type, otherwise given type + type = ( selector ? special.delegateType : special.bindType ) || type; + + // Update special based on newly reset type + special = jQuery.event.special[ type ] || {}; + + // handleObj is passed to all event handlers + handleObj = jQuery.extend( { + type: type, + origType: origType, + data: data, + handler: handler, + guid: handler.guid, + selector: selector, + needsContext: selector && jQuery.expr.match.needsContext.test( selector ), + namespace: namespaces.join( "." ) + }, handleObjIn ); + + // Init the event handler queue if we're the first + if ( !( handlers = events[ type ] ) ) { + handlers = events[ type ] = []; + handlers.delegateCount = 0; + + // Only use addEventListener if the special events handler returns false + if ( !special.setup || + special.setup.call( elem, data, namespaces, eventHandle ) === false ) { + + if ( elem.addEventListener ) { + elem.addEventListener( type, eventHandle ); + } + } + } + + if ( special.add ) { + special.add.call( elem, handleObj ); + + if ( !handleObj.handler.guid ) { + handleObj.handler.guid = handler.guid; + } + } + + // Add to the element's handler list, delegates in front + if ( selector ) { + handlers.splice( handlers.delegateCount++, 0, handleObj ); + } else { + handlers.push( handleObj ); + } + + // Keep track of which events have ever been used, for event optimization + jQuery.event.global[ type ] = true; + } + + }, + + // Detach an event or set of events from an element + remove: function( elem, types, handler, selector, mappedTypes ) { + + var j, origCount, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); + + if ( !elemData || !( events = elemData.events ) ) { + return; + } + + // Once for each type.namespace in types; type may be omitted + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // Unbind all events (on this namespace, if provided) for the element + if ( !type ) { + for ( type in events ) { + jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); + } + continue; + } + + special = jQuery.event.special[ type ] || {}; + type = ( selector ? special.delegateType : special.bindType ) || type; + handlers = events[ type ] || []; + tmp = tmp[ 2 ] && + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); + + // Remove matching events + origCount = j = handlers.length; + while ( j-- ) { + handleObj = handlers[ j ]; + + if ( ( mappedTypes || origType === handleObj.origType ) && + ( !handler || handler.guid === handleObj.guid ) && + ( !tmp || tmp.test( handleObj.namespace ) ) && + ( !selector || selector === handleObj.selector || + selector === "**" && handleObj.selector ) ) { + handlers.splice( j, 1 ); + + if ( handleObj.selector ) { + handlers.delegateCount--; + } + if ( special.remove ) { + special.remove.call( elem, handleObj ); + } + } + } + + // Remove generic event handler if we removed something and no more handlers exist + // (avoids potential for endless recursion during removal of special event handlers) + if ( origCount && !handlers.length ) { + if ( !special.teardown || + special.teardown.call( elem, namespaces, elemData.handle ) === false ) { + + jQuery.removeEvent( elem, type, elemData.handle ); + } + + delete events[ type ]; + } + } + + // Remove data and the expando if it's no longer used + if ( jQuery.isEmptyObject( events ) ) { + dataPriv.remove( elem, "handle events" ); + } + }, + + dispatch: function( nativeEvent ) { + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + + // Make a writable jQuery.Event from the native event object + event = jQuery.event.fix( nativeEvent ), + + handlers = ( + dataPriv.get( this, "events" ) || Object.create( null ) + )[ event.type ] || [], + special = jQuery.event.special[ event.type ] || {}; + + // Use the fix-ed jQuery.Event rather than the (read-only) native event + args[ 0 ] = event; + + for ( i = 1; i < arguments.length; i++ ) { + args[ i ] = arguments[ i ]; + } + + event.delegateTarget = this; + + // Call the preDispatch hook for the mapped type, and let it bail if desired + if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { + return; + } + + // Determine handlers + handlerQueue = jQuery.event.handlers.call( this, event, handlers ); + + // Run delegates first; they may want to stop propagation beneath us + i = 0; + while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { + event.currentTarget = matched.elem; + + j = 0; + while ( ( handleObj = matched.handlers[ j++ ] ) && + !event.isImmediatePropagationStopped() ) { + + // If the event is namespaced, then each handler is only invoked if it is + // specially universal or its namespaces are a superset of the event's. + if ( !event.rnamespace || handleObj.namespace === false || + event.rnamespace.test( handleObj.namespace ) ) { + + event.handleObj = handleObj; + event.data = handleObj.data; + + ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || + handleObj.handler ).apply( matched.elem, args ); + + if ( ret !== undefined ) { + if ( ( event.result = ret ) === false ) { + event.preventDefault(); + event.stopPropagation(); + } + } + } + } + } + + // Call the postDispatch hook for the mapped type + if ( special.postDispatch ) { + special.postDispatch.call( this, event ); + } + + return event.result; + }, + + handlers: function( event, handlers ) { + var i, handleObj, sel, matchedHandlers, matchedSelectors, + handlerQueue = [], + delegateCount = handlers.delegateCount, + cur = event.target; + + // Find delegate handlers + if ( delegateCount && + + // Support: IE <=9 + // Black-hole SVG instance trees (trac-13180) + cur.nodeType && + + // Support: Firefox <=42 + // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) + // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click + // Support: IE 11 only + // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) + !( event.type === "click" && event.button >= 1 ) ) { + + for ( ; cur !== this; cur = cur.parentNode || this ) { + + // Don't check non-elements (#13208) + // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) + if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { + matchedHandlers = []; + matchedSelectors = {}; + for ( i = 0; i < delegateCount; i++ ) { + handleObj = handlers[ i ]; + + // Don't conflict with Object.prototype properties (#13203) + sel = handleObj.selector + " "; + + if ( matchedSelectors[ sel ] === undefined ) { + matchedSelectors[ sel ] = handleObj.needsContext ? + jQuery( sel, this ).index( cur ) > -1 : + jQuery.find( sel, this, null, [ cur ] ).length; + } + if ( matchedSelectors[ sel ] ) { + matchedHandlers.push( handleObj ); + } + } + if ( matchedHandlers.length ) { + handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); + } + } + } + } + + // Add the remaining (directly-bound) handlers + cur = this; + if ( delegateCount < handlers.length ) { + handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); + } + + return handlerQueue; + }, + + addProp: function( name, hook ) { + Object.defineProperty( jQuery.Event.prototype, name, { + enumerable: true, + configurable: true, + + get: isFunction( hook ) ? + function() { + if ( this.originalEvent ) { + return hook( this.originalEvent ); + } + } : + function() { + if ( this.originalEvent ) { + return this.originalEvent[ name ]; + } + }, + + set: function( value ) { + Object.defineProperty( this, name, { + enumerable: true, + configurable: true, + writable: true, + value: value + } ); + } + } ); + }, + + fix: function( originalEvent ) { + return originalEvent[ jQuery.expando ] ? + originalEvent : + new jQuery.Event( originalEvent ); + }, + + special: { + load: { + + // Prevent triggered image.load events from bubbling to window.load + noBubble: true + }, + click: { + + // Utilize native event to ensure correct state for checkable inputs + setup: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Claim the first handler + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + // dataPriv.set( el, "click", ... ) + leverageNative( el, "click", returnTrue ); + } + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Force setup before triggering a click + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + leverageNative( el, "click" ); + } + + // Return non-false to allow normal event-path propagation + return true; + }, + + // For cross-browser consistency, suppress native .click() on links + // Also prevent it if we're currently inside a leveraged native-event stack + _default: function( event ) { + var target = event.target; + return rcheckableType.test( target.type ) && + target.click && nodeName( target, "input" ) && + dataPriv.get( target, "click" ) || + nodeName( target, "a" ); + } + }, + + beforeunload: { + postDispatch: function( event ) { + + // Support: Firefox 20+ + // Firefox doesn't alert if the returnValue field is not set. + if ( event.result !== undefined && event.originalEvent ) { + event.originalEvent.returnValue = event.result; + } + } + } + } +}; + +// Ensure the presence of an event listener that handles manually-triggered +// synthetic events by interrupting progress until reinvoked in response to +// *native* events that it fires directly, ensuring that state changes have +// already occurred before other listeners are invoked. +function leverageNative( el, type, expectSync ) { + + // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add + if ( !expectSync ) { + if ( dataPriv.get( el, type ) === undefined ) { + jQuery.event.add( el, type, returnTrue ); + } + return; + } + + // Register the controller as a special universal handler for all event namespaces + dataPriv.set( el, type, false ); + jQuery.event.add( el, type, { + namespace: false, + handler: function( event ) { + var notAsync, result, + saved = dataPriv.get( this, type ); + + if ( ( event.isTrigger & 1 ) && this[ type ] ) { + + // Interrupt processing of the outer synthetic .trigger()ed event + // Saved data should be false in such cases, but might be a leftover capture object + // from an async native handler (gh-4350) + if ( !saved.length ) { + + // Store arguments for use when handling the inner native event + // There will always be at least one argument (an event object), so this array + // will not be confused with a leftover capture object. + saved = slice.call( arguments ); + dataPriv.set( this, type, saved ); + + // Trigger the native event and capture its result + // Support: IE <=9 - 11+ + // focus() and blur() are asynchronous + notAsync = expectSync( this, type ); + this[ type ](); + result = dataPriv.get( this, type ); + if ( saved !== result || notAsync ) { + dataPriv.set( this, type, false ); + } else { + result = {}; + } + if ( saved !== result ) { + + // Cancel the outer synthetic event + event.stopImmediatePropagation(); + event.preventDefault(); + + // Support: Chrome 86+ + // In Chrome, if an element having a focusout handler is blurred by + // clicking outside of it, it invokes the handler synchronously. If + // that handler calls `.remove()` on the element, the data is cleared, + // leaving `result` undefined. We need to guard against this. + return result && result.value; + } + + // If this is an inner synthetic event for an event with a bubbling surrogate + // (focus or blur), assume that the surrogate already propagated from triggering the + // native event and prevent that from happening again here. + // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the + // bubbling surrogate propagates *after* the non-bubbling base), but that seems + // less bad than duplication. + } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { + event.stopPropagation(); + } + + // If this is a native event triggered above, everything is now in order + // Fire an inner synthetic event with the original arguments + } else if ( saved.length ) { + + // ...and capture the result + dataPriv.set( this, type, { + value: jQuery.event.trigger( + + // Support: IE <=9 - 11+ + // Extend with the prototype to reset the above stopImmediatePropagation() + jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), + saved.slice( 1 ), + this + ) + } ); + + // Abort handling of the native event + event.stopImmediatePropagation(); + } + } + } ); +} + +jQuery.removeEvent = function( elem, type, handle ) { + + // This "if" is needed for plain objects + if ( elem.removeEventListener ) { + elem.removeEventListener( type, handle ); + } +}; + +jQuery.Event = function( src, props ) { + + // Allow instantiation without the 'new' keyword + if ( !( this instanceof jQuery.Event ) ) { + return new jQuery.Event( src, props ); + } + + // Event object + if ( src && src.type ) { + this.originalEvent = src; + this.type = src.type; + + // 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 || + src.defaultPrevented === undefined && + + // Support: Android <=2.3 only + src.returnValue === false ? + returnTrue : + returnFalse; + + // Create target properties + // Support: Safari <=6 - 7 only + // Target should not be a text node (#504, #13143) + this.target = ( src.target && src.target.nodeType === 3 ) ? + src.target.parentNode : + src.target; + + this.currentTarget = src.currentTarget; + this.relatedTarget = src.relatedTarget; + + // Event type + } else { + this.type = src; + } + + // Put explicitly provided properties onto the event object + if ( props ) { + jQuery.extend( this, props ); + } + + // Create a timestamp if incoming event doesn't have one + this.timeStamp = src && src.timeStamp || Date.now(); + + // Mark it as fixed + this[ jQuery.expando ] = true; +}; + +// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding +// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html +jQuery.Event.prototype = { + constructor: jQuery.Event, + isDefaultPrevented: returnFalse, + isPropagationStopped: returnFalse, + isImmediatePropagationStopped: returnFalse, + isSimulated: false, + + preventDefault: function() { + var e = this.originalEvent; + + this.isDefaultPrevented = returnTrue; + + if ( e && !this.isSimulated ) { + e.preventDefault(); + } + }, + stopPropagation: function() { + var e = this.originalEvent; + + this.isPropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopPropagation(); + } + }, + stopImmediatePropagation: function() { + var e = this.originalEvent; + + this.isImmediatePropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopImmediatePropagation(); + } + + this.stopPropagation(); + } +}; + +// Includes all common event props including KeyEvent and MouseEvent specific props +jQuery.each( { + altKey: true, + bubbles: true, + cancelable: true, + changedTouches: true, + ctrlKey: true, + detail: true, + eventPhase: true, + metaKey: true, + pageX: true, + pageY: true, + shiftKey: true, + view: true, + "char": true, + code: true, + charCode: true, + key: true, + keyCode: true, + button: true, + buttons: true, + clientX: true, + clientY: true, + offsetX: true, + offsetY: true, + pointerId: true, + pointerType: true, + screenX: true, + screenY: true, + targetTouches: true, + toElement: true, + touches: true, + which: true +}, jQuery.event.addProp ); + +jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { + jQuery.event.special[ type ] = { + + // Utilize native event if possible so blur/focus sequence is correct + setup: function() { + + // Claim the first handler + // dataPriv.set( this, "focus", ... ) + // dataPriv.set( this, "blur", ... ) + leverageNative( this, type, expectSync ); + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function() { + + // Force setup before trigger + leverageNative( this, type ); + + // Return non-false to allow normal event-path propagation + return true; + }, + + // Suppress native focus or blur as it's already being fired + // in leverageNative. + _default: function() { + return true; + }, + + delegateType: delegateType + }; +} ); + +// Create mouseenter/leave events using mouseover/out and event-time checks +// so that event delegation works in jQuery. +// Do the same for pointerenter/pointerleave and pointerover/pointerout +// +// Support: Safari 7 only +// Safari sends mouseenter too often; see: +// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 +// for the description of the bug (it existed in older Chrome versions as well). +jQuery.each( { + mouseenter: "mouseover", + mouseleave: "mouseout", + pointerenter: "pointerover", + pointerleave: "pointerout" +}, function( orig, fix ) { + jQuery.event.special[ orig ] = { + delegateType: fix, + bindType: fix, + + handle: function( event ) { + var ret, + target = this, + related = event.relatedTarget, + handleObj = event.handleObj; + + // For mouseenter/leave call the handler if related is outside the target. + // NB: No relatedTarget if the mouse left/entered the browser window + if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { + event.type = handleObj.origType; + ret = handleObj.handler.apply( this, arguments ); + event.type = fix; + } + return ret; + } + }; +} ); + +jQuery.fn.extend( { + + on: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn ); + }, + one: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn, 1 ); + }, + off: function( types, selector, fn ) { + var handleObj, type; + if ( types && types.preventDefault && types.handleObj ) { + + // ( event ) dispatched jQuery.Event + handleObj = types.handleObj; + jQuery( types.delegateTarget ).off( + handleObj.namespace ? + handleObj.origType + "." + handleObj.namespace : + handleObj.origType, + handleObj.selector, + handleObj.handler + ); + return this; + } + if ( typeof types === "object" ) { + + // ( types-object [, selector] ) + for ( type in types ) { + this.off( type, selector, types[ type ] ); + } + return this; + } + if ( selector === false || typeof selector === "function" ) { + + // ( types [, fn] ) + fn = selector; + selector = undefined; + } + if ( fn === false ) { + fn = returnFalse; + } + return this.each( function() { + jQuery.event.remove( this, types, fn, selector ); + } ); + } +} ); + + +var + + // Support: IE <=10 - 11, Edge 12 - 13 only + // In IE/Edge using regex groups here causes severe slowdowns. + // See https://connect.microsoft.com/IE/feedback/details/1736512/ + rnoInnerhtml = /\s*$/g; + +// Prefer a tbody over its parent table for containing new rows +function manipulationTarget( elem, content ) { + if ( nodeName( elem, "table" ) && + nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { + + return jQuery( elem ).children( "tbody" )[ 0 ] || elem; + } + + return elem; +} + +// Replace/restore the type attribute of script elements for safe DOM manipulation +function disableScript( elem ) { + elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; + return elem; +} +function restoreScript( elem ) { + if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { + elem.type = elem.type.slice( 5 ); + } else { + elem.removeAttribute( "type" ); + } + + return elem; +} + +function cloneCopyEvent( src, dest ) { + var i, l, type, pdataOld, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.get( src ); + events = pdataOld.events; + + if ( events ) { + dataPriv.remove( dest, "handle events" ); + + for ( type in events ) { + for ( i = 0, l = events[ type ].length; i < l; i++ ) { + jQuery.event.add( dest, type, events[ type ][ i ] ); + } + } + } + } + + // 2. Copy user data + if ( dataUser.hasData( src ) ) { + udataOld = dataUser.access( src ); + udataCur = jQuery.extend( {}, udataOld ); + + dataUser.set( dest, udataCur ); + } +} + +// Fix IE bugs, see support tests +function fixInput( src, dest ) { + var nodeName = dest.nodeName.toLowerCase(); + + // Fails to persist the checked state of a cloned checkbox or radio button. + if ( nodeName === "input" && rcheckableType.test( src.type ) ) { + dest.checked = src.checked; + + // Fails to return the selected option to the default selected state when cloning options + } else if ( nodeName === "input" || nodeName === "textarea" ) { + dest.defaultValue = src.defaultValue; + } +} + +function domManip( collection, args, callback, ignored ) { + + // Flatten any nested arrays + args = flat( args ); + + var fragment, first, scripts, hasScripts, node, doc, + i = 0, + l = collection.length, + iNoClone = l - 1, + value = args[ 0 ], + valueIsFunction = isFunction( value ); + + // We can't cloneNode fragments that contain checked, in WebKit + if ( valueIsFunction || + ( l > 1 && typeof value === "string" && + !support.checkClone && rchecked.test( value ) ) ) { + return collection.each( function( index ) { + var self = collection.eq( index ); + if ( valueIsFunction ) { + args[ 0 ] = value.call( this, index, self.html() ); + } + domManip( self, args, callback, ignored ); + } ); + } + + if ( l ) { + fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); + first = fragment.firstChild; + + if ( fragment.childNodes.length === 1 ) { + fragment = first; + } + + // Require either new content or an interest in ignored elements to invoke the callback + if ( first || ignored ) { + scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); + hasScripts = scripts.length; + + // Use the original fragment for the last item + // instead of the first because it can end up + // being emptied incorrectly in certain situations (#8070). + for ( ; i < l; i++ ) { + node = fragment; + + if ( i !== iNoClone ) { + node = jQuery.clone( node, true, true ); + + // Keep references to cloned scripts for later restoration + if ( hasScripts ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( scripts, getAll( node, "script" ) ); + } + } + + callback.call( collection[ i ], node, i ); + } + + if ( hasScripts ) { + doc = scripts[ scripts.length - 1 ].ownerDocument; + + // Reenable scripts + jQuery.map( scripts, restoreScript ); + + // Evaluate executable scripts on first document insertion + for ( i = 0; i < hasScripts; i++ ) { + node = scripts[ i ]; + if ( rscriptType.test( node.type || "" ) && + !dataPriv.access( node, "globalEval" ) && + jQuery.contains( doc, node ) ) { + + if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { + + // Optional AJAX dependency, but won't run scripts if not present + if ( jQuery._evalUrl && !node.noModule ) { + jQuery._evalUrl( node.src, { + nonce: node.nonce || node.getAttribute( "nonce" ) + }, doc ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); + } + } + } + } + } + } + + return collection; +} + +function remove( elem, selector, keepData ) { + var node, + nodes = selector ? jQuery.filter( selector, elem ) : elem, + i = 0; + + for ( ; ( node = nodes[ i ] ) != null; i++ ) { + if ( !keepData && node.nodeType === 1 ) { + jQuery.cleanData( getAll( node ) ); + } + + if ( node.parentNode ) { + if ( keepData && isAttached( node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html; + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = isAttached( elem ); + + // Fix IE cloning issues + if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && + !jQuery.isXMLDoc( elem ) ) { + + // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 + destElements = getAll( clone ); + srcElements = getAll( elem ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + fixInput( srcElements[ i ], destElements[ i ] ); + } + } + + // Copy the events from the original to the clone + if ( dataAndEvents ) { + if ( deepDataAndEvents ) { + srcElements = srcElements || getAll( elem ); + destElements = destElements || getAll( clone ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + cloneCopyEvent( srcElements[ i ], destElements[ i ] ); + } + } else { + cloneCopyEvent( elem, clone ); + } + } + + // Preserve script evaluation history + destElements = getAll( clone, "script" ); + if ( destElements.length > 0 ) { + setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); + } + + // Return the cloned set + return clone; + }, + + cleanData: function( elems ) { + var data, elem, type, + special = jQuery.event.special, + i = 0; + + for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { + if ( acceptData( elem ) ) { + if ( ( data = elem[ dataPriv.expando ] ) ) { + if ( data.events ) { + for ( type in data.events ) { + if ( special[ type ] ) { + jQuery.event.remove( elem, type ); + + // This is a shortcut to avoid jQuery.event.remove's overhead + } else { + jQuery.removeEvent( elem, type, data.handle ); + } + } + } + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataPriv.expando ] = undefined; + } + if ( elem[ dataUser.expando ] ) { + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataUser.expando ] = undefined; + } + } + } + } +} ); + +jQuery.fn.extend( { + detach: function( selector ) { + return remove( this, selector, true ); + }, + + remove: function( selector ) { + return remove( this, selector ); + }, + + text: function( value ) { + return access( this, function( value ) { + return value === undefined ? + jQuery.text( this ) : + this.empty().each( function() { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + this.textContent = value; + } + } ); + }, null, value, arguments.length ); + }, + + append: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.appendChild( elem ); + } + } ); + }, + + prepend: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.insertBefore( elem, target.firstChild ); + } + } ); + }, + + before: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this ); + } + } ); + }, + + after: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this.nextSibling ); + } + } ); + }, + + empty: function() { + var elem, + i = 0; + + for ( ; ( elem = this[ i ] ) != null; i++ ) { + if ( elem.nodeType === 1 ) { + + // Prevent memory leaks + jQuery.cleanData( getAll( elem, false ) ); + + // Remove any remaining nodes + elem.textContent = ""; + } + } + + return this; + }, + + clone: function( dataAndEvents, deepDataAndEvents ) { + dataAndEvents = dataAndEvents == null ? false : dataAndEvents; + deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; + + return this.map( function() { + return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); + } ); + }, + + html: function( value ) { + return access( this, function( value ) { + var elem = this[ 0 ] || {}, + i = 0, + l = this.length; + + if ( value === undefined && elem.nodeType === 1 ) { + return elem.innerHTML; + } + + // See if we can take a shortcut and just use innerHTML + if ( typeof value === "string" && !rnoInnerhtml.test( value ) && + !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { + + value = jQuery.htmlPrefilter( value ); + + try { + for ( ; i < l; i++ ) { + elem = this[ i ] || {}; + + // Remove element nodes and prevent memory leaks + if ( elem.nodeType === 1 ) { + jQuery.cleanData( getAll( elem, false ) ); + elem.innerHTML = value; + } + } + + elem = 0; + + // If using innerHTML throws an exception, use the fallback method + } catch ( e ) {} + } + + if ( elem ) { + this.empty().append( value ); + } + }, null, value, arguments.length ); + }, + + replaceWith: function() { + var ignored = []; + + // Make the changes, replacing each non-ignored context element with the new content + return domManip( this, arguments, function( elem ) { + var parent = this.parentNode; + + if ( jQuery.inArray( this, ignored ) < 0 ) { + jQuery.cleanData( getAll( this ) ); + if ( parent ) { + parent.replaceChild( elem, this ); + } + } + + // Force callback invocation + }, ignored ); + } +} ); + +jQuery.each( { + appendTo: "append", + prependTo: "prepend", + insertBefore: "before", + insertAfter: "after", + replaceAll: "replaceWith" +}, function( name, original ) { + jQuery.fn[ name ] = function( selector ) { + var elems, + ret = [], + insert = jQuery( selector ), + last = insert.length - 1, + i = 0; + + for ( ; i <= last; i++ ) { + elems = i === last ? this : this.clone( true ); + jQuery( insert[ i ] )[ original ]( elems ); + + // Support: Android <=4.0 only, PhantomJS 1 only + // .get() because push.apply(_, arraylike) throws on ancient WebKit + push.apply( ret, elems.get() ); + } + + return this.pushStack( ret ); + }; +} ); +var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); + +var getStyles = function( elem ) { + + // Support: IE <=11 only, Firefox <=30 (#15098, #14150) + // IE throws on elements created in popups + // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" + var view = elem.ownerDocument.defaultView; + + if ( !view || !view.opener ) { + view = window; + } + + return view.getComputedStyle( elem ); + }; + +var swap = function( elem, options, callback ) { + var ret, name, + old = {}; + + // Remember the old values, and insert the new ones + for ( name in options ) { + old[ name ] = elem.style[ name ]; + elem.style[ name ] = options[ name ]; + } + + ret = callback.call( elem ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + +var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); + + + +( function() { + + // Executing both pixelPosition & boxSizingReliable tests require only one layout + // so they're executed at the same time to save the second computation. + function computeStyleTests() { + + // This is a singleton, we need to execute it only once + if ( !div ) { + return; + } + + container.style.cssText = "position:absolute;left:-11111px;width:60px;" + + "margin-top:1px;padding:0;border:0"; + div.style.cssText = + "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + + "margin:auto;border:1px;padding:1px;" + + "width:60%;top:1%"; + documentElement.appendChild( container ).appendChild( div ); + + var divStyle = window.getComputedStyle( div ); + pixelPositionVal = divStyle.top !== "1%"; + + // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 + reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; + + // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 + // Some styles come back with percentage values, even though they shouldn't + div.style.right = "60%"; + pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; + + // Support: IE 9 - 11 only + // Detect misreporting of content dimensions for box-sizing:border-box elements + boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; + + // Support: IE 9 only + // Detect overflow:scroll screwiness (gh-3699) + // Support: Chrome <=64 + // Don't get tricked when zoom affects offsetWidth (gh-4029) + div.style.position = "absolute"; + scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; + + documentElement.removeChild( container ); + + // Nullify the div so it wouldn't be stored in the memory and + // it will also be a sign that checks already performed + div = null; + } + + function roundPixelMeasures( measure ) { + return Math.round( parseFloat( measure ) ); + } + + var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, + reliableTrDimensionsVal, reliableMarginLeftVal, + container = document.createElement( "div" ), + div = document.createElement( "div" ); + + // Finish early in limited (non-browser) environments + if ( !div.style ) { + return; + } + + // Support: IE <=9 - 11 only + // Style of cloned element affects source element cloned (#8908) + div.style.backgroundClip = "content-box"; + div.cloneNode( true ).style.backgroundClip = ""; + support.clearCloneStyle = div.style.backgroundClip === "content-box"; + + jQuery.extend( support, { + boxSizingReliable: function() { + computeStyleTests(); + return boxSizingReliableVal; + }, + pixelBoxStyles: function() { + computeStyleTests(); + return pixelBoxStylesVal; + }, + pixelPosition: function() { + computeStyleTests(); + return pixelPositionVal; + }, + reliableMarginLeft: function() { + computeStyleTests(); + return reliableMarginLeftVal; + }, + scrollboxSize: function() { + computeStyleTests(); + return scrollboxSizeVal; + }, + + // Support: IE 9 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Behavior in IE 9 is more subtle than in newer versions & it passes + // some versions of this test; make sure not to make it pass there! + // + // Support: Firefox 70+ + // Only Firefox includes border widths + // in computed dimensions. (gh-4529) + reliableTrDimensions: function() { + var table, tr, trChild, trStyle; + if ( reliableTrDimensionsVal == null ) { + table = document.createElement( "table" ); + tr = document.createElement( "tr" ); + trChild = document.createElement( "div" ); + + table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate"; + tr.style.cssText = "border:1px solid"; + + // Support: Chrome 86+ + // Height set through cssText does not get applied. + // Computed height then comes back as 0. + tr.style.height = "1px"; + trChild.style.height = "9px"; + + // Support: Android 8 Chrome 86+ + // In our bodyBackground.html iframe, + // display for all div elements is set to "inline", + // which causes a problem only in Android 8 Chrome 86. + // Ensuring the div is display: block + // gets around this issue. + trChild.style.display = "block"; + + documentElement + .appendChild( table ) + .appendChild( tr ) + .appendChild( trChild ); + + trStyle = window.getComputedStyle( tr ); + reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) + + parseInt( trStyle.borderTopWidth, 10 ) + + parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight; + + documentElement.removeChild( table ); + } + return reliableTrDimensionsVal; + } + } ); +} )(); + + +function curCSS( elem, name, computed ) { + var width, minWidth, maxWidth, ret, + + // Support: Firefox 51+ + // Retrieving style before computed somehow + // fixes an issue with getting wrong values + // on detached elements + style = elem.style; + + computed = computed || getStyles( elem ); + + // getPropertyValue is needed for: + // .css('filter') (IE 9 only, #12537) + // .css('--customProperty) (#3144) + if ( computed ) { + ret = computed.getPropertyValue( name ) || computed[ name ]; + + if ( ret === "" && !isAttached( elem ) ) { + ret = jQuery.style( elem, name ); + } + + // A tribute to the "awesome hack by Dean Edwards" + // Android Browser returns percentage for some values, + // but width seems to be reliably pixels. + // This is against the CSSOM draft spec: + // https://drafts.csswg.org/cssom/#resolved-values + if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { + + // Remember the original values + width = style.width; + minWidth = style.minWidth; + maxWidth = style.maxWidth; + + // Put in the new values to get a computed value out + style.minWidth = style.maxWidth = style.width = ret; + ret = computed.width; + + // Revert the changed values + style.width = width; + style.minWidth = minWidth; + style.maxWidth = maxWidth; + } + } + + return ret !== undefined ? + + // Support: IE <=9 - 11 only + // IE returns zIndex value as an integer. + ret + "" : + ret; +} + + +function addGetHookIf( conditionFn, hookFn ) { + + // Define the hook, we'll check on the first run if it's really needed. + return { + get: function() { + if ( conditionFn() ) { + + // Hook not needed (or it's not possible to use it due + // to missing dependency), remove it. + delete this.get; + return; + } + + // Hook needed; redefine it so that the support test is not executed again. + return ( this.get = hookFn ).apply( this, arguments ); + } + }; +} + + +var cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style, + vendorProps = {}; + +// Return a vendor-prefixed property or undefined +function vendorPropName( name ) { + + // Check for vendor prefixed names + var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), + i = cssPrefixes.length; + + while ( i-- ) { + name = cssPrefixes[ i ] + capName; + if ( name in emptyStyle ) { + return name; + } + } +} + +// Return a potentially-mapped jQuery.cssProps or vendor prefixed property +function finalPropName( name ) { + var final = jQuery.cssProps[ name ] || vendorProps[ name ]; + + if ( final ) { + return final; + } + if ( name in emptyStyle ) { + return name; + } + return vendorProps[ name ] = vendorPropName( name ) || name; +} + + +var + + // Swappable if display is none or starts with table + // except "table", "table-cell", or "table-caption" + // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display + rdisplayswap = /^(none|table(?!-c[ea]).+)/, + rcustomProp = /^--/, + cssShow = { position: "absolute", visibility: "hidden", display: "block" }, + cssNormalTransform = { + letterSpacing: "0", + fontWeight: "400" + }; + +function setPositiveNumber( _elem, value, subtract ) { + + // Any relative (+/-) values have already been + // normalized at this point + var matches = rcssNum.exec( value ); + return matches ? + + // Guard against undefined "subtract", e.g., when used as in cssHooks + Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : + value; +} + +function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { + var i = dimension === "width" ? 1 : 0, + extra = 0, + delta = 0; + + // Adjustment may not be necessary + if ( box === ( isBorderBox ? "border" : "content" ) ) { + return 0; + } + + for ( ; i < 4; i += 2 ) { + + // Both box models exclude margin + if ( box === "margin" ) { + delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); + } + + // If we get here with a content-box, we're seeking "padding" or "border" or "margin" + if ( !isBorderBox ) { + + // Add padding + delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + + // For "border" or "margin", add border + if ( box !== "padding" ) { + delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + + // But still keep track of it otherwise + } else { + extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + + // If we get here with a border-box (content + padding + border), we're seeking "content" or + // "padding" or "margin" + } else { + + // For "content", subtract padding + if ( box === "content" ) { + delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + } + + // For "content" or "padding", subtract border + if ( box !== "margin" ) { + delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + } + } + + // Account for positive content-box scroll gutter when requested by providing computedVal + if ( !isBorderBox && computedVal >= 0 ) { + + // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border + // Assuming integer scroll gutter, subtract the rest and round down + delta += Math.max( 0, Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + computedVal - + delta - + extra - + 0.5 + + // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter + // Use an explicit zero to avoid NaN (gh-3964) + ) ) || 0; + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). + // Fake content-box until we know it's needed to know the true value. + boxSizingNeeded = !support.boxSizingReliable() || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox, + + val = curCSS( elem, dimension, styles ), + offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + + // Support: IE 9 - 11 only + // Use offsetWidth/offsetHeight for when box sizing is unreliable. + // In those cases, the computed value can be trusted to be border-box. + if ( ( !support.boxSizingReliable() && isBorderBox || + + // Support: IE 10 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Interestingly, in some cases IE 9 doesn't suffer from this issue. + !support.reliableTrDimensions() && nodeName( elem, "tr" ) || + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + val === "auto" || + + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && + + // Make sure the element is visible & connected + elem.getClientRects().length ) { + + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; + + // Where available, offsetWidth/offsetHeight approximate border box dimensions. + // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the + // retrieved value as a content box dimension. + valueIsBorderBox = offsetProp in elem; + if ( valueIsBorderBox ) { + val = elem[ offsetProp ]; + } + } + + // Normalize "" and auto + val = parseFloat( val ) || 0; + + // Adjust for the element's box model + return ( val + + boxModelAdjustment( + elem, + dimension, + extra || ( isBorderBox ? "border" : "content" ), + valueIsBorderBox, + styles, + + // Provide the current computed size to request scroll gutter calculation (gh-3589) + val + ) + ) + "px"; +} + +jQuery.extend( { + + // Add in style property hooks for overriding the default + // behavior of getting and setting a style property + cssHooks: { + opacity: { + get: function( elem, computed ) { + if ( computed ) { + + // We should always get a number back from opacity + var ret = curCSS( elem, "opacity" ); + return ret === "" ? "1" : ret; + } + } + } + }, + + // Don't automatically add "px" to these possibly-unitless properties + cssNumber: { + "animationIterationCount": true, + "columnCount": true, + "fillOpacity": true, + "flexGrow": true, + "flexShrink": true, + "fontWeight": true, + "gridArea": true, + "gridColumn": true, + "gridColumnEnd": true, + "gridColumnStart": true, + "gridRow": true, + "gridRowEnd": true, + "gridRowStart": true, + "lineHeight": true, + "opacity": true, + "order": true, + "orphans": true, + "widows": true, + "zIndex": true, + "zoom": true + }, + + // Add in properties whose names you wish to fix before + // setting or getting the value + cssProps: {}, + + // Get and set the style property on a DOM Node + style: function( elem, name, value, extra ) { + + // Don't set styles on text and comment nodes + if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { + return; + } + + // Make sure that we're working with the right name + var ret, type, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ), + style = elem.style; + + // Make sure that we're working with the right name. We don't + // want to query the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Gets hook for the prefixed version, then unprefixed version + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // Check if we're setting a value + if ( value !== undefined ) { + type = typeof value; + + // Convert "+=" or "-=" to relative numbers (#7345) + if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { + value = adjustCSS( elem, name, ret ); + + // Fixes bug #9237 + type = "number"; + } + + // Make sure that null and NaN values aren't set (#7116) + if ( value == null || value !== value ) { + return; + } + + // If a number was passed in, add the unit (except for certain CSS properties) + // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append + // "px" to a few hardcoded values. + if ( type === "number" && !isCustomProp ) { + value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); + } + + // background-* props affect original clone's values + if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { + style[ name ] = "inherit"; + } + + // If a hook was provided, use that value, otherwise just set the specified value + if ( !hooks || !( "set" in hooks ) || + ( value = hooks.set( elem, value, extra ) ) !== undefined ) { + + if ( isCustomProp ) { + style.setProperty( name, value ); + } else { + style[ name ] = value; + } + } + + } else { + + // If a hook was provided get the non-computed value from there + if ( hooks && "get" in hooks && + ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { + + return ret; + } + + // Otherwise just get the value from the style object + return style[ name ]; + } + }, + + css: function( elem, name, extra, styles ) { + var val, num, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ); + + // Make sure that we're working with the right name. We don't + // want to modify the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Try prefixed name followed by the unprefixed name + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // If a hook was provided get the computed value from there + if ( hooks && "get" in hooks ) { + val = hooks.get( elem, true, extra ); + } + + // Otherwise, if a way to get the computed value exists, use that + if ( val === undefined ) { + val = curCSS( elem, name, styles ); + } + + // Convert "normal" to computed value + if ( val === "normal" && name in cssNormalTransform ) { + val = cssNormalTransform[ name ]; + } + + // Make numeric if forced or a qualifier was provided and val looks numeric + if ( extra === "" || extra ) { + num = parseFloat( val ); + return extra === true || isFinite( num ) ? num || 0 : val; + } + + return val; + } +} ); + +jQuery.each( [ "height", "width" ], function( _i, dimension ) { + jQuery.cssHooks[ dimension ] = { + get: function( elem, computed, extra ) { + if ( computed ) { + + // Certain elements can have dimension info if we invisibly show them + // but it must have a current display style that would benefit + return rdisplayswap.test( jQuery.css( elem, "display" ) ) && + + // Support: Safari 8+ + // Table columns in Safari have non-zero offsetWidth & zero + // getBoundingClientRect().width unless display is changed. + // Support: IE <=11 only + // Running getBoundingClientRect on a disconnected node + // in IE throws an error. + ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? + swap( elem, cssShow, function() { + return getWidthOrHeight( elem, dimension, extra ); + } ) : + getWidthOrHeight( elem, dimension, extra ); + } + }, + + set: function( elem, value, extra ) { + var matches, + styles = getStyles( elem ), + + // Only read styles.position if the test has a chance to fail + // to avoid forcing a reflow. + scrollboxSizeBuggy = !support.scrollboxSize() && + styles.position === "absolute", + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) + boxSizingNeeded = scrollboxSizeBuggy || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra ? + boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ) : + 0; + + // Account for unreliable border-box dimensions by comparing offset* to computed and + // faking a content-box to get border and padding (gh-3699) + if ( isBorderBox && scrollboxSizeBuggy ) { + subtract -= Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + parseFloat( styles[ dimension ] ) - + boxModelAdjustment( elem, dimension, "border", false, styles ) - + 0.5 + ); + } + + // Convert to pixels if value adjustment is needed + if ( subtract && ( matches = rcssNum.exec( value ) ) && + ( matches[ 3 ] || "px" ) !== "px" ) { + + elem.style[ dimension ] = value; + value = jQuery.css( elem, dimension ); + } + + return setPositiveNumber( elem, value, subtract ); + } + }; +} ); + +jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, + function( elem, computed ) { + if ( computed ) { + return ( parseFloat( curCSS( elem, "marginLeft" ) ) || + elem.getBoundingClientRect().left - + swap( elem, { marginLeft: 0 }, function() { + return elem.getBoundingClientRect().left; + } ) + ) + "px"; + } + } +); + +// These hooks are used by animate to expand properties +jQuery.each( { + margin: "", + padding: "", + border: "Width" +}, function( prefix, suffix ) { + jQuery.cssHooks[ prefix + suffix ] = { + expand: function( value ) { + var i = 0, + expanded = {}, + + // Assumes a single number if not a string + parts = typeof value === "string" ? value.split( " " ) : [ value ]; + + for ( ; i < 4; i++ ) { + expanded[ prefix + cssExpand[ i ] + suffix ] = + parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; + } + + return expanded; + } + }; + + if ( prefix !== "margin" ) { + jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; + } +} ); + +jQuery.fn.extend( { + css: function( name, value ) { + return access( this, function( elem, name, value ) { + var styles, len, + map = {}, + i = 0; + + if ( Array.isArray( name ) ) { + styles = getStyles( elem ); + len = name.length; + + for ( ; i < len; i++ ) { + map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); + } + + return map; + } + + return value !== undefined ? + jQuery.style( elem, name, value ) : + jQuery.css( elem, name ); + }, name, value, arguments.length > 1 ); + } +} ); + + +function Tween( elem, options, prop, end, easing ) { + return new Tween.prototype.init( elem, options, prop, end, easing ); +} +jQuery.Tween = Tween; + +Tween.prototype = { + constructor: Tween, + init: function( elem, options, prop, end, easing, unit ) { + this.elem = elem; + this.prop = prop; + this.easing = easing || jQuery.easing._default; + this.options = options; + this.start = this.now = this.cur(); + this.end = end; + this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); + }, + cur: function() { + var hooks = Tween.propHooks[ this.prop ]; + + return hooks && hooks.get ? + hooks.get( this ) : + Tween.propHooks._default.get( this ); + }, + run: function( percent ) { + var eased, + hooks = Tween.propHooks[ this.prop ]; + + if ( this.options.duration ) { + this.pos = eased = jQuery.easing[ this.easing ]( + percent, this.options.duration * percent, 0, 1, this.options.duration + ); + } else { + this.pos = eased = percent; + } + this.now = ( this.end - this.start ) * eased + this.start; + + if ( this.options.step ) { + this.options.step.call( this.elem, this.now, this ); + } + + if ( hooks && hooks.set ) { + hooks.set( this ); + } else { + Tween.propHooks._default.set( this ); + } + return this; + } +}; + +Tween.prototype.init.prototype = Tween.prototype; + +Tween.propHooks = { + _default: { + get: function( tween ) { + var result; + + // Use a property on the element directly when it is not a DOM element, + // or when there is no matching style property that exists. + if ( tween.elem.nodeType !== 1 || + tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { + return tween.elem[ tween.prop ]; + } + + // Passing an empty string as a 3rd parameter to .css will automatically + // attempt a parseFloat and fallback to a string if the parse fails. + // Simple values such as "10px" are parsed to Float; + // complex values such as "rotate(1rad)" are returned as-is. + result = jQuery.css( tween.elem, tween.prop, "" ); + + // Empty strings, null, undefined and "auto" are converted to 0. + return !result || result === "auto" ? 0 : result; + }, + set: function( tween ) { + + // Use step hook for back compat. + // Use cssHook if its there. + // Use .style if available and use plain properties where available. + if ( jQuery.fx.step[ tween.prop ] ) { + jQuery.fx.step[ tween.prop ]( tween ); + } else if ( tween.elem.nodeType === 1 && ( + jQuery.cssHooks[ tween.prop ] || + tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { + jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); + } else { + tween.elem[ tween.prop ] = tween.now; + } + } + } +}; + +// Support: IE <=9 only +// Panic based approach to setting things on disconnected nodes +Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { + set: function( tween ) { + if ( tween.elem.nodeType && tween.elem.parentNode ) { + tween.elem[ tween.prop ] = tween.now; + } + } +}; + +jQuery.easing = { + linear: function( p ) { + return p; + }, + swing: function( p ) { + return 0.5 - Math.cos( p * Math.PI ) / 2; + }, + _default: "swing" +}; + +jQuery.fx = Tween.prototype.init; + +// Back compat <1.8 extension point +jQuery.fx.step = {}; + + + + +var + fxNow, inProgress, + rfxtypes = /^(?:toggle|show|hide)$/, + rrun = /queueHooks$/; + +function schedule() { + if ( inProgress ) { + if ( document.hidden === false && window.requestAnimationFrame ) { + window.requestAnimationFrame( schedule ); + } else { + window.setTimeout( schedule, jQuery.fx.interval ); + } + + jQuery.fx.tick(); + } +} + +// Animations created synchronously will run synchronously +function createFxNow() { + window.setTimeout( function() { + fxNow = undefined; + } ); + return ( fxNow = Date.now() ); +} + +// Generate parameters to create a standard animation +function genFx( type, includeWidth ) { + var which, + i = 0, + attrs = { height: type }; + + // If we include width, step value is 1 to do all cssExpand values, + // otherwise step value is 2 to skip over Left and Right + includeWidth = includeWidth ? 1 : 0; + for ( ; i < 4; i += 2 - includeWidth ) { + which = cssExpand[ i ]; + attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; + } + + if ( includeWidth ) { + attrs.opacity = attrs.width = type; + } + + return attrs; +} + +function createTween( value, prop, animation ) { + var tween, + collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), + index = 0, + length = collection.length; + for ( ; index < length; index++ ) { + if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { + + // We're done with this property + return tween; + } + } +} + +function defaultPrefilter( elem, props, opts ) { + var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, + isBox = "width" in props || "height" in props, + anim = this, + orig = {}, + style = elem.style, + hidden = elem.nodeType && isHiddenWithinTree( elem ), + dataShow = dataPriv.get( elem, "fxshow" ); + + // Queue-skipping animations hijack the fx hooks + if ( !opts.queue ) { + hooks = jQuery._queueHooks( elem, "fx" ); + if ( hooks.unqueued == null ) { + hooks.unqueued = 0; + oldfire = hooks.empty.fire; + hooks.empty.fire = function() { + if ( !hooks.unqueued ) { + oldfire(); + } + }; + } + hooks.unqueued++; + + anim.always( function() { + + // Ensure the complete handler is called before this completes + anim.always( function() { + hooks.unqueued--; + if ( !jQuery.queue( elem, "fx" ).length ) { + hooks.empty.fire(); + } + } ); + } ); + } + + // Detect show/hide animations + for ( prop in props ) { + value = props[ prop ]; + if ( rfxtypes.test( value ) ) { + delete props[ prop ]; + toggle = toggle || value === "toggle"; + if ( value === ( hidden ? "hide" : "show" ) ) { + + // Pretend to be hidden if this is a "show" and + // there is still data from a stopped show/hide + if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { + hidden = true; + + // Ignore all other no-op show/hide data + } else { + continue; + } + } + orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); + } + } + + // Bail out if this is a no-op like .hide().hide() + propTween = !jQuery.isEmptyObject( props ); + if ( !propTween && jQuery.isEmptyObject( orig ) ) { + return; + } + + // Restrict "overflow" and "display" styles during box animations + if ( isBox && elem.nodeType === 1 ) { + + // Support: IE <=9 - 11, Edge 12 - 15 + // Record all 3 overflow attributes because IE does not infer the shorthand + // from identically-valued overflowX and overflowY and Edge just mirrors + // the overflowX value there. + opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; + + // Identify a display type, preferring old show/hide data over the CSS cascade + restoreDisplay = dataShow && dataShow.display; + if ( restoreDisplay == null ) { + restoreDisplay = dataPriv.get( elem, "display" ); + } + display = jQuery.css( elem, "display" ); + if ( display === "none" ) { + if ( restoreDisplay ) { + display = restoreDisplay; + } else { + + // Get nonempty value(s) by temporarily forcing visibility + showHide( [ elem ], true ); + restoreDisplay = elem.style.display || restoreDisplay; + display = jQuery.css( elem, "display" ); + showHide( [ elem ] ); + } + } + + // Animate inline elements as inline-block + if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { + if ( jQuery.css( elem, "float" ) === "none" ) { + + // Restore the original display value at the end of pure show/hide animations + if ( !propTween ) { + anim.done( function() { + style.display = restoreDisplay; + } ); + if ( restoreDisplay == null ) { + display = style.display; + restoreDisplay = display === "none" ? "" : display; + } + } + style.display = "inline-block"; + } + } + } + + if ( opts.overflow ) { + style.overflow = "hidden"; + anim.always( function() { + style.overflow = opts.overflow[ 0 ]; + style.overflowX = opts.overflow[ 1 ]; + style.overflowY = opts.overflow[ 2 ]; + } ); + } + + // Implement show/hide animations + propTween = false; + for ( prop in orig ) { + + // General show/hide setup for this element animation + if ( !propTween ) { + if ( dataShow ) { + if ( "hidden" in dataShow ) { + hidden = dataShow.hidden; + } + } else { + dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); + } + + // Store hidden/visible for toggle so `.stop().toggle()` "reverses" + if ( toggle ) { + dataShow.hidden = !hidden; + } + + // Show elements before animating them + if ( hidden ) { + showHide( [ elem ], true ); + } + + /* eslint-disable no-loop-func */ + + anim.done( function() { + + /* eslint-enable no-loop-func */ + + // The final step of a "hide" animation is actually hiding the element + if ( !hidden ) { + showHide( [ elem ] ); + } + dataPriv.remove( elem, "fxshow" ); + for ( prop in orig ) { + jQuery.style( elem, prop, orig[ prop ] ); + } + } ); + } + + // Per-property setup + propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); + if ( !( prop in dataShow ) ) { + dataShow[ prop ] = propTween.start; + if ( hidden ) { + propTween.end = propTween.start; + propTween.start = 0; + } + } + } +} + +function propFilter( props, specialEasing ) { + var index, name, easing, value, hooks; + + // camelCase, specialEasing and expand cssHook pass + for ( index in props ) { + name = camelCase( index ); + easing = specialEasing[ name ]; + value = props[ index ]; + if ( Array.isArray( value ) ) { + easing = value[ 1 ]; + value = props[ index ] = value[ 0 ]; + } + + if ( index !== name ) { + props[ name ] = value; + delete props[ index ]; + } + + hooks = jQuery.cssHooks[ name ]; + if ( hooks && "expand" in hooks ) { + value = hooks.expand( value ); + delete props[ name ]; + + // Not quite $.extend, this won't overwrite existing keys. + // Reusing 'index' because we have the correct "name" + for ( index in value ) { + if ( !( index in props ) ) { + props[ index ] = value[ index ]; + specialEasing[ index ] = easing; + } + } + } else { + specialEasing[ name ] = easing; + } + } +} + +function Animation( elem, properties, options ) { + var result, + stopped, + index = 0, + length = Animation.prefilters.length, + deferred = jQuery.Deferred().always( function() { + + // Don't match elem in the :animated selector + delete tick.elem; + } ), + tick = function() { + if ( stopped ) { + return false; + } + var currentTime = fxNow || createFxNow(), + remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), + + // Support: Android 2.3 only + // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) + temp = remaining / animation.duration || 0, + percent = 1 - temp, + index = 0, + length = animation.tweens.length; + + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( percent ); + } + + deferred.notifyWith( elem, [ animation, percent, remaining ] ); + + // If there's more to do, yield + if ( percent < 1 && length ) { + return remaining; + } + + // If this was an empty animation, synthesize a final progress notification + if ( !length ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + } + + // Resolve the animation and report its conclusion + deferred.resolveWith( elem, [ animation ] ); + return false; + }, + animation = deferred.promise( { + elem: elem, + props: jQuery.extend( {}, properties ), + opts: jQuery.extend( true, { + specialEasing: {}, + easing: jQuery.easing._default + }, options ), + originalProperties: properties, + originalOptions: options, + startTime: fxNow || createFxNow(), + duration: options.duration, + tweens: [], + createTween: function( prop, end ) { + var tween = jQuery.Tween( elem, animation.opts, prop, end, + animation.opts.specialEasing[ prop ] || animation.opts.easing ); + animation.tweens.push( tween ); + return tween; + }, + stop: function( gotoEnd ) { + var index = 0, + + // If we are going to the end, we want to run all the tweens + // otherwise we skip this part + length = gotoEnd ? animation.tweens.length : 0; + if ( stopped ) { + return this; + } + stopped = true; + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( 1 ); + } + + // Resolve when we played the last frame; otherwise, reject + if ( gotoEnd ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + deferred.resolveWith( elem, [ animation, gotoEnd ] ); + } else { + deferred.rejectWith( elem, [ animation, gotoEnd ] ); + } + return this; + } + } ), + props = animation.props; + + propFilter( props, animation.opts.specialEasing ); + + for ( ; index < length; index++ ) { + result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); + if ( result ) { + if ( isFunction( result.stop ) ) { + jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = + result.stop.bind( result ); + } + return result; + } + } + + jQuery.map( props, createTween, animation ); + + if ( isFunction( animation.opts.start ) ) { + animation.opts.start.call( elem, animation ); + } + + // Attach callbacks from options + animation + .progress( animation.opts.progress ) + .done( animation.opts.done, animation.opts.complete ) + .fail( animation.opts.fail ) + .always( animation.opts.always ); + + jQuery.fx.timer( + jQuery.extend( tick, { + elem: elem, + anim: animation, + queue: animation.opts.queue + } ) + ); + + return animation; +} + +jQuery.Animation = jQuery.extend( Animation, { + + tweeners: { + "*": [ function( prop, value ) { + var tween = this.createTween( prop, value ); + adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); + return tween; + } ] + }, + + tweener: function( props, callback ) { + if ( isFunction( props ) ) { + callback = props; + props = [ "*" ]; + } else { + props = props.match( rnothtmlwhite ); + } + + var prop, + index = 0, + length = props.length; + + for ( ; index < length; index++ ) { + prop = props[ index ]; + Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; + Animation.tweeners[ prop ].unshift( callback ); + } + }, + + prefilters: [ defaultPrefilter ], + + prefilter: function( callback, prepend ) { + if ( prepend ) { + Animation.prefilters.unshift( callback ); + } else { + Animation.prefilters.push( callback ); + } + } +} ); + +jQuery.speed = function( speed, easing, fn ) { + var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { + complete: fn || !fn && easing || + isFunction( speed ) && speed, + duration: speed, + easing: fn && easing || easing && !isFunction( easing ) && easing + }; + + // Go to the end state if fx are off + if ( jQuery.fx.off ) { + opt.duration = 0; + + } else { + if ( typeof opt.duration !== "number" ) { + if ( opt.duration in jQuery.fx.speeds ) { + opt.duration = jQuery.fx.speeds[ opt.duration ]; + + } else { + opt.duration = jQuery.fx.speeds._default; + } + } + } + + // Normalize opt.queue - true/undefined/null -> "fx" + if ( opt.queue == null || opt.queue === true ) { + opt.queue = "fx"; + } + + // Queueing + opt.old = opt.complete; + + opt.complete = function() { + if ( isFunction( opt.old ) ) { + opt.old.call( this ); + } + + if ( opt.queue ) { + jQuery.dequeue( this, opt.queue ); + } + }; + + return opt; +}; + +jQuery.fn.extend( { + fadeTo: function( speed, to, easing, callback ) { + + // Show any hidden elements after setting opacity to 0 + return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() + + // Animate to the value specified + .end().animate( { opacity: to }, speed, easing, callback ); + }, + animate: function( prop, speed, easing, callback ) { + var empty = jQuery.isEmptyObject( prop ), + optall = jQuery.speed( speed, easing, callback ), + doAnimation = function() { + + // Operate on a copy of prop so per-property easing won't be lost + var anim = Animation( this, jQuery.extend( {}, prop ), optall ); + + // Empty animations, or finishing resolves immediately + if ( empty || dataPriv.get( this, "finish" ) ) { + anim.stop( true ); + } + }; + + doAnimation.finish = doAnimation; + + return empty || optall.queue === false ? + this.each( doAnimation ) : + this.queue( optall.queue, doAnimation ); + }, + stop: function( type, clearQueue, gotoEnd ) { + var stopQueue = function( hooks ) { + var stop = hooks.stop; + delete hooks.stop; + stop( gotoEnd ); + }; + + if ( typeof type !== "string" ) { + gotoEnd = clearQueue; + clearQueue = type; + type = undefined; + } + if ( clearQueue ) { + this.queue( type || "fx", [] ); + } + + return this.each( function() { + var dequeue = true, + index = type != null && type + "queueHooks", + timers = jQuery.timers, + data = dataPriv.get( this ); + + if ( index ) { + if ( data[ index ] && data[ index ].stop ) { + stopQueue( data[ index ] ); + } + } else { + for ( index in data ) { + if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { + stopQueue( data[ index ] ); + } + } + } + + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && + ( type == null || timers[ index ].queue === type ) ) { + + timers[ index ].anim.stop( gotoEnd ); + dequeue = false; + timers.splice( index, 1 ); + } + } + + // Start the next in the queue if the last step wasn't forced. + // Timers currently will call their complete callbacks, which + // will dequeue but only if they were gotoEnd. + if ( dequeue || !gotoEnd ) { + jQuery.dequeue( this, type ); + } + } ); + }, + finish: function( type ) { + if ( type !== false ) { + type = type || "fx"; + } + return this.each( function() { + var index, + data = dataPriv.get( this ), + queue = data[ type + "queue" ], + hooks = data[ type + "queueHooks" ], + timers = jQuery.timers, + length = queue ? queue.length : 0; + + // Enable finishing flag on private data + data.finish = true; + + // Empty the queue first + jQuery.queue( this, type, [] ); + + if ( hooks && hooks.stop ) { + hooks.stop.call( this, true ); + } + + // Look for any active animations, and finish them + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && timers[ index ].queue === type ) { + timers[ index ].anim.stop( true ); + timers.splice( index, 1 ); + } + } + + // Look for any animations in the old queue and finish them + for ( index = 0; index < length; index++ ) { + if ( queue[ index ] && queue[ index ].finish ) { + queue[ index ].finish.call( this ); + } + } + + // Turn off finishing flag + delete data.finish; + } ); + } +} ); + +jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { + var cssFn = jQuery.fn[ name ]; + jQuery.fn[ name ] = function( speed, easing, callback ) { + return speed == null || typeof speed === "boolean" ? + cssFn.apply( this, arguments ) : + this.animate( genFx( name, true ), speed, easing, callback ); + }; +} ); + +// Generate shortcuts for custom animations +jQuery.each( { + slideDown: genFx( "show" ), + slideUp: genFx( "hide" ), + slideToggle: genFx( "toggle" ), + fadeIn: { opacity: "show" }, + fadeOut: { opacity: "hide" }, + fadeToggle: { opacity: "toggle" } +}, function( name, props ) { + jQuery.fn[ name ] = function( speed, easing, callback ) { + return this.animate( props, speed, easing, callback ); + }; +} ); + +jQuery.timers = []; +jQuery.fx.tick = function() { + var timer, + i = 0, + timers = jQuery.timers; + + fxNow = Date.now(); + + for ( ; i < timers.length; i++ ) { + timer = timers[ i ]; + + // Run the timer and safely remove it when done (allowing for external removal) + if ( !timer() && timers[ i ] === timer ) { + timers.splice( i--, 1 ); + } + } + + if ( !timers.length ) { + jQuery.fx.stop(); + } + fxNow = undefined; +}; + +jQuery.fx.timer = function( timer ) { + jQuery.timers.push( timer ); + jQuery.fx.start(); +}; + +jQuery.fx.interval = 13; +jQuery.fx.start = function() { + if ( inProgress ) { + return; + } + + inProgress = true; + schedule(); +}; + +jQuery.fx.stop = function() { + inProgress = null; +}; + +jQuery.fx.speeds = { + slow: 600, + fast: 200, + + // Default speed + _default: 400 +}; + + +// Based off of the plugin by Clint Helfers, with permission. +// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ +jQuery.fn.delay = function( time, type ) { + time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; + type = type || "fx"; + + return this.queue( type, function( next, hooks ) { + var timeout = window.setTimeout( next, time ); + hooks.stop = function() { + window.clearTimeout( timeout ); + }; + } ); +}; + + +( function() { + var input = document.createElement( "input" ), + select = document.createElement( "select" ), + opt = select.appendChild( document.createElement( "option" ) ); + + input.type = "checkbox"; + + // Support: Android <=4.3 only + // Default value for a checkbox should be "on" + support.checkOn = input.value !== ""; + + // Support: IE <=11 only + // Must access selectedIndex to make default options select + support.optSelected = opt.selected; + + // Support: IE <=11 only + // An input loses its value after becoming a radio + input = document.createElement( "input" ); + input.value = "t"; + input.type = "radio"; + support.radioValue = input.value === "t"; +} )(); + + +var boolHook, + attrHandle = jQuery.expr.attrHandle; + +jQuery.fn.extend( { + attr: function( name, value ) { + return access( this, jQuery.attr, name, value, arguments.length > 1 ); + }, + + removeAttr: function( name ) { + return this.each( function() { + jQuery.removeAttr( this, name ); + } ); + } +} ); + +jQuery.extend( { + attr: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set attributes on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + // Fallback to prop when attributes are not supported + if ( typeof elem.getAttribute === "undefined" ) { + return jQuery.prop( elem, name, value ); + } + + // Attribute hooks are determined by the lowercase version + // Grab necessary hook if one is defined + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + hooks = jQuery.attrHooks[ name.toLowerCase() ] || + ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); + } + + if ( value !== undefined ) { + if ( value === null ) { + jQuery.removeAttr( elem, name ); + return; + } + + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + elem.setAttribute( name, value + "" ); + return value; + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + ret = jQuery.find.attr( elem, name ); + + // Non-existent attributes return null, we normalize to undefined + return ret == null ? undefined : ret; + }, + + attrHooks: { + type: { + set: function( elem, value ) { + if ( !support.radioValue && value === "radio" && + nodeName( elem, "input" ) ) { + var val = elem.value; + elem.setAttribute( "type", value ); + if ( val ) { + elem.value = val; + } + return value; + } + } + } + }, + + removeAttr: function( elem, value ) { + var name, + i = 0, + + // Attribute names can contain non-HTML whitespace characters + // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 + attrNames = value && value.match( rnothtmlwhite ); + + if ( attrNames && elem.nodeType === 1 ) { + while ( ( name = attrNames[ i++ ] ) ) { + elem.removeAttribute( name ); + } + } + } +} ); + +// Hooks for boolean attributes +boolHook = { + set: function( elem, value, name ) { + if ( value === false ) { + + // Remove boolean attributes when set to false + jQuery.removeAttr( elem, name ); + } else { + elem.setAttribute( name, name ); + } + return name; + } +}; + +jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { + var getter = attrHandle[ name ] || jQuery.find.attr; + + attrHandle[ name ] = function( elem, name, isXML ) { + var ret, handle, + lowercaseName = name.toLowerCase(); + + if ( !isXML ) { + + // Avoid an infinite loop by temporarily removing this function from the getter + handle = attrHandle[ lowercaseName ]; + attrHandle[ lowercaseName ] = ret; + ret = getter( elem, name, isXML ) != null ? + lowercaseName : + null; + attrHandle[ lowercaseName ] = handle; + } + return ret; + }; +} ); + + + + +var rfocusable = /^(?:input|select|textarea|button)$/i, + rclickable = /^(?:a|area)$/i; + +jQuery.fn.extend( { + prop: function( name, value ) { + return access( this, jQuery.prop, name, value, arguments.length > 1 ); + }, + + removeProp: function( name ) { + return this.each( function() { + delete this[ jQuery.propFix[ name ] || name ]; + } ); + } +} ); + +jQuery.extend( { + prop: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set properties on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + + // Fix name and attach hooks + name = jQuery.propFix[ name ] || name; + hooks = jQuery.propHooks[ name ]; + } + + if ( value !== undefined ) { + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + return ( elem[ name ] = value ); + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + return elem[ name ]; + }, + + propHooks: { + tabIndex: { + get: function( elem ) { + + // Support: IE <=9 - 11 only + // elem.tabIndex doesn't always return the + // correct value when it hasn't been explicitly set + // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ + // Use proper attribute retrieval(#12072) + var tabindex = jQuery.find.attr( elem, "tabindex" ); + + if ( tabindex ) { + return parseInt( tabindex, 10 ); + } + + if ( + rfocusable.test( elem.nodeName ) || + rclickable.test( elem.nodeName ) && + elem.href + ) { + return 0; + } + + return -1; + } + } + }, + + propFix: { + "for": "htmlFor", + "class": "className" + } +} ); + +// Support: IE <=11 only +// Accessing the selectedIndex property +// forces the browser to respect setting selected +// on the option +// The getter ensures a default option is selected +// when in an optgroup +// eslint rule "no-unused-expressions" is disabled for this code +// since it considers such accessions noop +if ( !support.optSelected ) { + jQuery.propHooks.selected = { + get: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent && parent.parentNode ) { + parent.parentNode.selectedIndex; + } + return null; + }, + set: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent ) { + parent.selectedIndex; + + if ( parent.parentNode ) { + parent.parentNode.selectedIndex; + } + } + } + }; +} + +jQuery.each( [ + "tabIndex", + "readOnly", + "maxLength", + "cellSpacing", + "cellPadding", + "rowSpan", + "colSpan", + "useMap", + "frameBorder", + "contentEditable" +], function() { + jQuery.propFix[ this.toLowerCase() ] = this; +} ); + + + + + // Strip and collapse whitespace according to HTML spec + // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace + function stripAndCollapse( value ) { + var tokens = value.match( rnothtmlwhite ) || []; + return tokens.join( " " ); + } + + +function getClass( elem ) { + return elem.getAttribute && elem.getAttribute( "class" ) || ""; +} + +function classesToArray( value ) { + if ( Array.isArray( value ) ) { + return value; + } + if ( typeof value === "string" ) { + return value.match( rnothtmlwhite ) || []; + } + return []; +} + +jQuery.fn.extend( { + addClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + if ( cur.indexOf( " " + clazz + " " ) < 0 ) { + cur += clazz + " "; + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + removeClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + if ( !arguments.length ) { + return this.attr( "class", "" ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + + // This expression is here for better compressibility (see addClass) + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + + // Remove *all* instances + while ( cur.indexOf( " " + clazz + " " ) > -1 ) { + cur = cur.replace( " " + clazz + " ", " " ); + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + toggleClass: function( value, stateVal ) { + var type = typeof value, + isValidValue = type === "string" || Array.isArray( value ); + + if ( typeof stateVal === "boolean" && isValidValue ) { + return stateVal ? this.addClass( value ) : this.removeClass( value ); + } + + if ( isFunction( value ) ) { + return this.each( function( i ) { + jQuery( this ).toggleClass( + value.call( this, i, getClass( this ), stateVal ), + stateVal + ); + } ); + } + + return this.each( function() { + var className, i, self, classNames; + + if ( isValidValue ) { + + // Toggle individual class names + i = 0; + self = jQuery( this ); + classNames = classesToArray( value ); + + while ( ( className = classNames[ i++ ] ) ) { + + // Check each className given, space separated list + if ( self.hasClass( className ) ) { + self.removeClass( className ); + } else { + self.addClass( className ); + } + } + + // Toggle whole class name + } else if ( value === undefined || type === "boolean" ) { + className = getClass( this ); + if ( className ) { + + // Store className if set + dataPriv.set( this, "__className__", className ); + } + + // If the element has a class name or if we're passed `false`, + // then remove the whole classname (if there was one, the above saved it). + // Otherwise bring back whatever was previously saved (if anything), + // falling back to the empty string if nothing was stored. + if ( this.setAttribute ) { + this.setAttribute( "class", + className || value === false ? + "" : + dataPriv.get( this, "__className__" ) || "" + ); + } + } + } ); + }, + + hasClass: function( selector ) { + var className, elem, + i = 0; + + className = " " + selector + " "; + while ( ( elem = this[ i++ ] ) ) { + if ( elem.nodeType === 1 && + ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { + return true; + } + } + + return false; + } +} ); + + + + +var rreturn = /\r/g; + +jQuery.fn.extend( { + val: function( value ) { + var hooks, ret, valueIsFunction, + elem = this[ 0 ]; + + if ( !arguments.length ) { + if ( elem ) { + hooks = jQuery.valHooks[ elem.type ] || + jQuery.valHooks[ elem.nodeName.toLowerCase() ]; + + if ( hooks && + "get" in hooks && + ( ret = hooks.get( elem, "value" ) ) !== undefined + ) { + return ret; + } + + ret = elem.value; + + // Handle most common string cases + if ( typeof ret === "string" ) { + return ret.replace( rreturn, "" ); + } + + // Handle cases where value is null/undef or number + return ret == null ? "" : ret; + } + + return; + } + + valueIsFunction = isFunction( value ); + + return this.each( function( i ) { + var val; + + if ( this.nodeType !== 1 ) { + return; + } + + if ( valueIsFunction ) { + val = value.call( this, i, jQuery( this ).val() ); + } else { + val = value; + } + + // Treat null/undefined as ""; convert numbers to string + if ( val == null ) { + val = ""; + + } else if ( typeof val === "number" ) { + val += ""; + + } else if ( Array.isArray( val ) ) { + val = jQuery.map( val, function( value ) { + return value == null ? "" : value + ""; + } ); + } + + hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; + + // If set returns undefined, fall back to normal setting + if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { + this.value = val; + } + } ); + } +} ); + +jQuery.extend( { + valHooks: { + option: { + get: function( elem ) { + + var val = jQuery.find.attr( elem, "value" ); + return val != null ? + val : + + // Support: IE <=10 - 11 only + // option.text throws exceptions (#14686, #14858) + // Strip and collapse whitespace + // https://html.spec.whatwg.org/#strip-and-collapse-whitespace + stripAndCollapse( jQuery.text( elem ) ); + } + }, + select: { + get: function( elem ) { + var value, option, i, + options = elem.options, + index = elem.selectedIndex, + one = elem.type === "select-one", + values = one ? null : [], + max = one ? index + 1 : options.length; + + if ( index < 0 ) { + i = max; + + } else { + i = one ? index : 0; + } + + // Loop through all the selected options + for ( ; i < max; i++ ) { + option = options[ i ]; + + // Support: IE <=9 only + // IE8-9 doesn't update selected after form reset (#2551) + if ( ( option.selected || i === index ) && + + // Don't return options that are disabled or in a disabled optgroup + !option.disabled && + ( !option.parentNode.disabled || + !nodeName( option.parentNode, "optgroup" ) ) ) { + + // Get the specific value for the option + value = jQuery( option ).val(); + + // We don't need an array for one selects + if ( one ) { + return value; + } + + // Multi-Selects return an array + values.push( value ); + } + } + + return values; + }, + + set: function( elem, value ) { + var optionSet, option, + options = elem.options, + values = jQuery.makeArray( value ), + i = options.length; + + while ( i-- ) { + option = options[ i ]; + + /* eslint-disable no-cond-assign */ + + if ( option.selected = + jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 + ) { + optionSet = true; + } + + /* eslint-enable no-cond-assign */ + } + + // Force browsers to behave consistently when non-matching value is set + if ( !optionSet ) { + elem.selectedIndex = -1; + } + return values; + } + } + } +} ); + +// Radios and checkboxes getter/setter +jQuery.each( [ "radio", "checkbox" ], function() { + jQuery.valHooks[ this ] = { + set: function( elem, value ) { + if ( Array.isArray( value ) ) { + return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); + } + } + }; + if ( !support.checkOn ) { + jQuery.valHooks[ this ].get = function( elem ) { + return elem.getAttribute( "value" ) === null ? "on" : elem.value; + }; + } +} ); + + + + +// Return jQuery for attributes-only inclusion + + +support.focusin = "onfocusin" in window; + + +var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, + stopPropagationCallback = function( e ) { + e.stopPropagation(); + }; + +jQuery.extend( jQuery.event, { + + trigger: function( event, data, elem, onlyHandlers ) { + + var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, + eventPath = [ elem || document ], + type = hasOwn.call( event, "type" ) ? event.type : event, + namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; + + cur = lastElement = tmp = elem = elem || document; + + // Don't do events on text and comment nodes + if ( elem.nodeType === 3 || elem.nodeType === 8 ) { + return; + } + + // focus/blur morphs to focusin/out; ensure we're not firing them right now + if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { + return; + } + + if ( type.indexOf( "." ) > -1 ) { + + // Namespaced trigger; create a regexp to match event type in handle() + namespaces = type.split( "." ); + type = namespaces.shift(); + namespaces.sort(); + } + ontype = type.indexOf( ":" ) < 0 && "on" + type; + + // Caller can pass in a jQuery.Event object, Object, or just an event type string + event = event[ jQuery.expando ] ? + event : + new jQuery.Event( type, typeof event === "object" && event ); + + // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) + event.isTrigger = onlyHandlers ? 2 : 3; + event.namespace = namespaces.join( "." ); + event.rnamespace = event.namespace ? + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : + null; + + // Clean up the event in case it is being reused + event.result = undefined; + if ( !event.target ) { + event.target = elem; + } + + // Clone any incoming data and prepend the event, creating the handler arg list + data = data == null ? + [ event ] : + jQuery.makeArray( data, [ event ] ); + + // Allow special events to draw outside the lines + special = jQuery.event.special[ type ] || {}; + if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { + return; + } + + // Determine event propagation path in advance, per W3C events spec (#9951) + // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) + if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { + + bubbleType = special.delegateType || type; + if ( !rfocusMorph.test( bubbleType + type ) ) { + cur = cur.parentNode; + } + for ( ; cur; cur = cur.parentNode ) { + eventPath.push( cur ); + tmp = cur; + } + + // Only add window if we got to document (e.g., not plain obj or detached DOM) + if ( tmp === ( elem.ownerDocument || document ) ) { + eventPath.push( tmp.defaultView || tmp.parentWindow || window ); + } + } + + // Fire handlers on the event path + i = 0; + while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { + lastElement = cur; + event.type = i > 1 ? + bubbleType : + special.bindType || type; + + // jQuery handler + handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] && + dataPriv.get( cur, "handle" ); + if ( handle ) { + handle.apply( cur, data ); + } + + // Native handler + handle = ontype && cur[ ontype ]; + if ( handle && handle.apply && acceptData( cur ) ) { + event.result = handle.apply( cur, data ); + if ( event.result === false ) { + event.preventDefault(); + } + } + } + event.type = type; + + // If nobody prevented the default action, do it now + if ( !onlyHandlers && !event.isDefaultPrevented() ) { + + if ( ( !special._default || + special._default.apply( eventPath.pop(), data ) === false ) && + acceptData( elem ) ) { + + // Call a native DOM method on the target with the same name as the event. + // Don't do default actions on window, that's where global variables be (#6170) + if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { + + // Don't re-trigger an onFOO event when we call its FOO() method + tmp = elem[ ontype ]; + + if ( tmp ) { + elem[ ontype ] = null; + } + + // Prevent re-triggering of the same event, since we already bubbled it above + jQuery.event.triggered = type; + + if ( event.isPropagationStopped() ) { + lastElement.addEventListener( type, stopPropagationCallback ); + } + + elem[ type ](); + + if ( event.isPropagationStopped() ) { + lastElement.removeEventListener( type, stopPropagationCallback ); + } + + jQuery.event.triggered = undefined; + + if ( tmp ) { + elem[ ontype ] = tmp; + } + } + } + } + + return event.result; + }, + + // Piggyback on a donor event to simulate a different one + // Used only for `focus(in | out)` events + simulate: function( type, elem, event ) { + var e = jQuery.extend( + new jQuery.Event(), + event, + { + type: type, + isSimulated: true + } + ); + + jQuery.event.trigger( e, null, elem ); + } + +} ); + +jQuery.fn.extend( { + + trigger: function( type, data ) { + return this.each( function() { + jQuery.event.trigger( type, data, this ); + } ); + }, + triggerHandler: function( type, data ) { + var elem = this[ 0 ]; + if ( elem ) { + return jQuery.event.trigger( type, data, elem, true ); + } + } +} ); + + +// Support: Firefox <=44 +// Firefox doesn't have focus(in | out) events +// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 +// +// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 +// focus(in | out) events fire after focus & blur events, +// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order +// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 +if ( !support.focusin ) { + jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { + + // Attach a single capturing handler on the document while someone wants focusin/focusout + var handler = function( event ) { + jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); + }; + + jQuery.event.special[ fix ] = { + setup: function() { + + // Handle: regular nodes (via `this.ownerDocument`), window + // (via `this.document`) & document (via `this`). + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ); + + if ( !attaches ) { + doc.addEventListener( orig, handler, true ); + } + dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); + }, + teardown: function() { + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ) - 1; + + if ( !attaches ) { + doc.removeEventListener( orig, handler, true ); + dataPriv.remove( doc, fix ); + + } else { + dataPriv.access( doc, fix, attaches ); + } + } + }; + } ); +} +var location = window.location; + +var nonce = { guid: Date.now() }; + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml, parserErrorElem; + if ( !data || typeof data !== "string" ) { + return null; + } + + // Support: IE 9 - 11 only + // IE throws on parseFromString with invalid input. + try { + xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); + } catch ( e ) {} + + parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ]; + if ( !xml || parserErrorElem ) { + jQuery.error( "Invalid XML: " + ( + parserErrorElem ? + jQuery.map( parserErrorElem.childNodes, function( el ) { + return el.textContent; + } ).join( "\n" ) : + data + ) ); + } + return xml; +}; + + +var + rbracket = /\[\]$/, + rCRLF = /\r?\n/g, + rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, + rsubmittable = /^(?:input|select|textarea|keygen)/i; + +function buildParams( prefix, obj, traditional, add ) { + var name; + + if ( Array.isArray( obj ) ) { + + // Serialize array item. + jQuery.each( obj, function( i, v ) { + if ( traditional || rbracket.test( prefix ) ) { + + // Treat each array item as a scalar. + add( prefix, v ); + + } else { + + // Item is non-scalar (array or object), encode its numeric index. + buildParams( + prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", + v, + traditional, + add + ); + } + } ); + + } else if ( !traditional && toType( obj ) === "object" ) { + + // Serialize object item. + for ( name in obj ) { + buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); + } + + } else { + + // Serialize scalar item. + add( prefix, obj ); + } +} + +// Serialize an array of form elements or a set of +// key/values into a query string +jQuery.param = function( a, traditional ) { + var prefix, + s = [], + add = function( key, valueOrFunction ) { + + // If value is a function, invoke it and use its return value + var value = isFunction( valueOrFunction ) ? + valueOrFunction() : + valueOrFunction; + + s[ s.length ] = encodeURIComponent( key ) + "=" + + encodeURIComponent( value == null ? "" : value ); + }; + + if ( a == null ) { + return ""; + } + + // If an array was passed in, assume that it is an array of form elements. + if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { + + // Serialize the form elements + jQuery.each( a, function() { + add( this.name, this.value ); + } ); + + } else { + + // If traditional, encode the "old" way (the way 1.3.2 or older + // did it), otherwise encode params recursively. + for ( prefix in a ) { + buildParams( prefix, a[ prefix ], traditional, add ); + } + } + + // Return the resulting serialization + return s.join( "&" ); +}; + +jQuery.fn.extend( { + serialize: function() { + return jQuery.param( this.serializeArray() ); + }, + serializeArray: function() { + return this.map( function() { + + // Can add propHook for "elements" to filter or add form elements + var elements = jQuery.prop( this, "elements" ); + return elements ? jQuery.makeArray( elements ) : this; + } ).filter( function() { + var type = this.type; + + // Use .is( ":disabled" ) so that fieldset[disabled] works + return this.name && !jQuery( this ).is( ":disabled" ) && + rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && + ( this.checked || !rcheckableType.test( type ) ); + } ).map( function( _i, elem ) { + var val = jQuery( this ).val(); + + if ( val == null ) { + return null; + } + + if ( Array.isArray( val ) ) { + return jQuery.map( val, function( val ) { + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ); + } + + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ).get(); + } +} ); + + +var + r20 = /%20/g, + rhash = /#.*$/, + rantiCache = /([?&])_=[^&]*/, + rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, + + // #7653, #8125, #8152: local protocol detection + rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, + rnoContent = /^(?:GET|HEAD)$/, + rprotocol = /^\/\//, + + /* Prefilters + * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) + * 2) These are called: + * - BEFORE asking for a transport + * - AFTER param serialization (s.data is a string if s.processData is true) + * 3) key is the dataType + * 4) the catchall symbol "*" can be used + * 5) execution will start with transport dataType and THEN continue down to "*" if needed + */ + prefilters = {}, + + /* Transports bindings + * 1) key is the dataType + * 2) the catchall symbol "*" can be used + * 3) selection will start with transport dataType and THEN go to "*" if needed + */ + transports = {}, + + // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression + allTypes = "*/".concat( "*" ), + + // Anchor tag for parsing the document origin + originAnchor = document.createElement( "a" ); + +originAnchor.href = location.href; + +// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport +function addToPrefiltersOrTransports( structure ) { + + // dataTypeExpression is optional and defaults to "*" + return function( dataTypeExpression, func ) { + + if ( typeof dataTypeExpression !== "string" ) { + func = dataTypeExpression; + dataTypeExpression = "*"; + } + + var dataType, + i = 0, + dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; + + if ( isFunction( func ) ) { + + // For each dataType in the dataTypeExpression + while ( ( dataType = dataTypes[ i++ ] ) ) { + + // Prepend if requested + if ( dataType[ 0 ] === "+" ) { + dataType = dataType.slice( 1 ) || "*"; + ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); + + // Otherwise append + } else { + ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); + } + } + } + }; +} + +// Base inspection function for prefilters and transports +function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { + + var inspected = {}, + seekingTransport = ( structure === transports ); + + function inspect( dataType ) { + var selected; + inspected[ dataType ] = true; + jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { + var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); + if ( typeof dataTypeOrTransport === "string" && + !seekingTransport && !inspected[ dataTypeOrTransport ] ) { + + options.dataTypes.unshift( dataTypeOrTransport ); + inspect( dataTypeOrTransport ); + return false; + } else if ( seekingTransport ) { + return !( selected = dataTypeOrTransport ); + } + } ); + return selected; + } + + return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); +} + +// A special extend for ajax options +// that takes "flat" options (not to be deep extended) +// Fixes #9887 +function ajaxExtend( target, src ) { + var key, deep, + flatOptions = jQuery.ajaxSettings.flatOptions || {}; + + for ( key in src ) { + if ( src[ key ] !== undefined ) { + ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; + } + } + if ( deep ) { + jQuery.extend( true, target, deep ); + } + + return target; +} + +/* Handles responses to an ajax request: + * - finds the right dataType (mediates between content-type and expected dataType) + * - returns the corresponding response + */ +function ajaxHandleResponses( s, jqXHR, responses ) { + + var ct, type, finalDataType, firstDataType, + contents = s.contents, + dataTypes = s.dataTypes; + + // Remove auto dataType and get content-type in the process + while ( dataTypes[ 0 ] === "*" ) { + dataTypes.shift(); + if ( ct === undefined ) { + ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); + } + } + + // Check if we're dealing with a known content-type + if ( ct ) { + for ( type in contents ) { + if ( contents[ type ] && contents[ type ].test( ct ) ) { + dataTypes.unshift( type ); + break; + } + } + } + + // Check to see if we have a response for the expected dataType + if ( dataTypes[ 0 ] in responses ) { + finalDataType = dataTypes[ 0 ]; + } else { + + // Try convertible dataTypes + for ( type in responses ) { + if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { + finalDataType = type; + break; + } + if ( !firstDataType ) { + firstDataType = type; + } + } + + // Or just use first one + finalDataType = finalDataType || firstDataType; + } + + // If we found a dataType + // We add the dataType to the list if needed + // and return the corresponding response + if ( finalDataType ) { + if ( finalDataType !== dataTypes[ 0 ] ) { + dataTypes.unshift( finalDataType ); + } + return responses[ finalDataType ]; + } +} + +/* Chain conversions given the request and the original response + * Also sets the responseXXX fields on the jqXHR instance + */ +function ajaxConvert( s, response, jqXHR, isSuccess ) { + var conv2, current, conv, tmp, prev, + converters = {}, + + // Work with a copy of dataTypes in case we need to modify it for conversion + dataTypes = s.dataTypes.slice(); + + // Create converters map with lowercased keys + if ( dataTypes[ 1 ] ) { + for ( conv in s.converters ) { + converters[ conv.toLowerCase() ] = s.converters[ conv ]; + } + } + + current = dataTypes.shift(); + + // Convert to each sequential dataType + while ( current ) { + + if ( s.responseFields[ current ] ) { + jqXHR[ s.responseFields[ current ] ] = response; + } + + // Apply the dataFilter if provided + if ( !prev && isSuccess && s.dataFilter ) { + response = s.dataFilter( response, s.dataType ); + } + + prev = current; + current = dataTypes.shift(); + + if ( current ) { + + // There's only work to do if current dataType is non-auto + if ( current === "*" ) { + + current = prev; + + // Convert response if prev dataType is non-auto and differs from current + } else if ( prev !== "*" && prev !== current ) { + + // Seek a direct converter + conv = converters[ prev + " " + current ] || converters[ "* " + current ]; + + // If none found, seek a pair + if ( !conv ) { + for ( conv2 in converters ) { + + // If conv2 outputs current + tmp = conv2.split( " " ); + if ( tmp[ 1 ] === current ) { + + // If prev can be converted to accepted input + conv = converters[ prev + " " + tmp[ 0 ] ] || + converters[ "* " + tmp[ 0 ] ]; + if ( conv ) { + + // Condense equivalence converters + if ( conv === true ) { + conv = converters[ conv2 ]; + + // Otherwise, insert the intermediate dataType + } else if ( converters[ conv2 ] !== true ) { + current = tmp[ 0 ]; + dataTypes.unshift( tmp[ 1 ] ); + } + break; + } + } + } + } + + // Apply converter (if not an equivalence) + if ( conv !== true ) { + + // Unless errors are allowed to bubble, catch and return them + if ( conv && s.throws ) { + response = conv( response ); + } else { + try { + response = conv( response ); + } catch ( e ) { + return { + state: "parsererror", + error: conv ? e : "No conversion from " + prev + " to " + current + }; + } + } + } + } + } + } + + return { state: "success", data: response }; +} + +jQuery.extend( { + + // Counter for holding the number of active queries + active: 0, + + // Last-Modified header cache for next request + lastModified: {}, + etag: {}, + + ajaxSettings: { + url: location.href, + type: "GET", + isLocal: rlocalProtocol.test( location.protocol ), + global: true, + processData: true, + async: true, + contentType: "application/x-www-form-urlencoded; charset=UTF-8", + + /* + timeout: 0, + data: null, + dataType: null, + username: null, + password: null, + cache: null, + throws: false, + traditional: false, + headers: {}, + */ + + accepts: { + "*": allTypes, + text: "text/plain", + html: "text/html", + xml: "application/xml, text/xml", + json: "application/json, text/javascript" + }, + + contents: { + xml: /\bxml\b/, + html: /\bhtml/, + json: /\bjson\b/ + }, + + responseFields: { + xml: "responseXML", + text: "responseText", + json: "responseJSON" + }, + + // Data converters + // Keys separate source (or catchall "*") and destination types with a single space + converters: { + + // Convert anything to text + "* text": String, + + // Text to html (true = no transformation) + "text html": true, + + // Evaluate text as a json expression + "text json": JSON.parse, + + // Parse text as xml + "text xml": jQuery.parseXML + }, + + // For options that shouldn't be deep extended: + // you can add your own custom options here if + // and when you create one that shouldn't be + // deep extended (see ajaxExtend) + flatOptions: { + url: true, + context: true + } + }, + + // Creates a full fledged settings object into target + // with both ajaxSettings and settings fields. + // If target is omitted, writes into ajaxSettings. + ajaxSetup: function( target, settings ) { + return settings ? + + // Building a settings object + ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : + + // Extending ajaxSettings + ajaxExtend( jQuery.ajaxSettings, target ); + }, + + ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), + ajaxTransport: addToPrefiltersOrTransports( transports ), + + // Main method + ajax: function( url, options ) { + + // If url is an object, simulate pre-1.5 signature + if ( typeof url === "object" ) { + options = url; + url = undefined; + } + + // Force options to be an object + options = options || {}; + + var transport, + + // URL without anti-cache param + cacheURL, + + // Response headers + responseHeadersString, + responseHeaders, + + // timeout handle + timeoutTimer, + + // Url cleanup var + urlAnchor, + + // Request state (becomes false upon send and true upon completion) + completed, + + // To know if global events are to be dispatched + fireGlobals, + + // Loop variable + i, + + // uncached part of the url + uncached, + + // Create the final options object + s = jQuery.ajaxSetup( {}, options ), + + // Callbacks context + callbackContext = s.context || s, + + // Context for global events is callbackContext if it is a DOM node or jQuery collection + globalEventContext = s.context && + ( callbackContext.nodeType || callbackContext.jquery ) ? + jQuery( callbackContext ) : + jQuery.event, + + // Deferreds + deferred = jQuery.Deferred(), + completeDeferred = jQuery.Callbacks( "once memory" ), + + // Status-dependent callbacks + statusCode = s.statusCode || {}, + + // Headers (they are sent all at once) + requestHeaders = {}, + requestHeadersNames = {}, + + // Default abort message + strAbort = "canceled", + + // Fake xhr + jqXHR = { + readyState: 0, + + // Builds headers hashtable if needed + getResponseHeader: function( key ) { + var match; + if ( completed ) { + if ( !responseHeaders ) { + responseHeaders = {}; + while ( ( match = rheaders.exec( responseHeadersString ) ) ) { + responseHeaders[ match[ 1 ].toLowerCase() + " " ] = + ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) + .concat( match[ 2 ] ); + } + } + match = responseHeaders[ key.toLowerCase() + " " ]; + } + return match == null ? null : match.join( ", " ); + }, + + // Raw string + getAllResponseHeaders: function() { + return completed ? responseHeadersString : null; + }, + + // Caches the header + setRequestHeader: function( name, value ) { + if ( completed == null ) { + name = requestHeadersNames[ name.toLowerCase() ] = + requestHeadersNames[ name.toLowerCase() ] || name; + requestHeaders[ name ] = value; + } + return this; + }, + + // Overrides response content-type header + overrideMimeType: function( type ) { + if ( completed == null ) { + s.mimeType = type; + } + return this; + }, + + // Status-dependent callbacks + statusCode: function( map ) { + var code; + if ( map ) { + if ( completed ) { + + // Execute the appropriate callbacks + jqXHR.always( map[ jqXHR.status ] ); + } else { + + // Lazy-add the new callbacks in a way that preserves old ones + for ( code in map ) { + statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; + } + } + } + return this; + }, + + // Cancel the request + abort: function( statusText ) { + var finalText = statusText || strAbort; + if ( transport ) { + transport.abort( finalText ); + } + done( 0, finalText ); + return this; + } + }; + + // Attach deferreds + deferred.promise( jqXHR ); + + // Add protocol if not provided (prefilters might expect it) + // Handle falsy url in the settings object (#10093: consistency with old signature) + // We also use the url parameter if available + s.url = ( ( url || s.url || location.href ) + "" ) + .replace( rprotocol, location.protocol + "//" ); + + // Alias method option to type as per ticket #12004 + s.type = options.method || options.type || s.method || s.type; + + // Extract dataTypes list + s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; + + // A cross-domain request is in order when the origin doesn't match the current origin. + if ( s.crossDomain == null ) { + urlAnchor = document.createElement( "a" ); + + // Support: IE <=8 - 11, Edge 12 - 15 + // IE throws exception on accessing the href property if url is malformed, + // e.g. http://example.com:80x/ + try { + urlAnchor.href = s.url; + + // Support: IE <=8 - 11 only + // Anchor's host property isn't correctly set when s.url is relative + urlAnchor.href = urlAnchor.href; + s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== + urlAnchor.protocol + "//" + urlAnchor.host; + } catch ( e ) { + + // If there is an error parsing the URL, assume it is crossDomain, + // it can be rejected by the transport if it is invalid + s.crossDomain = true; + } + } + + // Convert data if not already a string + if ( s.data && s.processData && typeof s.data !== "string" ) { + s.data = jQuery.param( s.data, s.traditional ); + } + + // Apply prefilters + inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); + + // If request was aborted inside a prefilter, stop there + if ( completed ) { + return jqXHR; + } + + // We can fire global events as of now if asked to + // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) + fireGlobals = jQuery.event && s.global; + + // Watch for a new set of requests + if ( fireGlobals && jQuery.active++ === 0 ) { + jQuery.event.trigger( "ajaxStart" ); + } + + // Uppercase the type + s.type = s.type.toUpperCase(); + + // Determine if request has content + s.hasContent = !rnoContent.test( s.type ); + + // Save the URL in case we're toying with the If-Modified-Since + // and/or If-None-Match header later on + // Remove hash to simplify url manipulation + cacheURL = s.url.replace( rhash, "" ); + + // More options handling for requests with no content + if ( !s.hasContent ) { + + // Remember the hash so we can put it back + uncached = s.url.slice( cacheURL.length ); + + // If data is available and should be processed, append data to url + if ( s.data && ( s.processData || typeof s.data === "string" ) ) { + cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; + + // #9682: remove data so that it's not used in an eventual retry + delete s.data; + } + + // Add or update anti-cache param if needed + if ( s.cache === false ) { + cacheURL = cacheURL.replace( rantiCache, "$1" ); + uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + + uncached; + } + + // Put hash and anti-cache on the URL that will be requested (gh-1732) + s.url = cacheURL + uncached; + + // Change '%20' to '+' if this is encoded form body content (gh-2658) + } else if ( s.data && s.processData && + ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { + s.data = s.data.replace( r20, "+" ); + } + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + if ( jQuery.lastModified[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); + } + if ( jQuery.etag[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); + } + } + + // Set the correct header, if data is being sent + if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { + jqXHR.setRequestHeader( "Content-Type", s.contentType ); + } + + // Set the Accepts header for the server, depending on the dataType + jqXHR.setRequestHeader( + "Accept", + s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? + s.accepts[ s.dataTypes[ 0 ] ] + + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : + s.accepts[ "*" ] + ); + + // Check for headers option + for ( i in s.headers ) { + jqXHR.setRequestHeader( i, s.headers[ i ] ); + } + + // Allow custom headers/mimetypes and early abort + if ( s.beforeSend && + ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { + + // Abort if not done already and return + return jqXHR.abort(); + } + + // Aborting is no longer a cancellation + strAbort = "abort"; + + // Install callbacks on deferreds + completeDeferred.add( s.complete ); + jqXHR.done( s.success ); + jqXHR.fail( s.error ); + + // Get transport + transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); + + // If no transport, we auto-abort + if ( !transport ) { + done( -1, "No Transport" ); + } else { + jqXHR.readyState = 1; + + // Send global event + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); + } + + // If request was aborted inside ajaxSend, stop there + if ( completed ) { + return jqXHR; + } + + // Timeout + if ( s.async && s.timeout > 0 ) { + timeoutTimer = window.setTimeout( function() { + jqXHR.abort( "timeout" ); + }, s.timeout ); + } + + try { + completed = false; + transport.send( requestHeaders, done ); + } catch ( e ) { + + // Rethrow post-completion exceptions + if ( completed ) { + throw e; + } + + // Propagate others as results + done( -1, e ); + } + } + + // Callback for when everything is done + function done( status, nativeStatusText, responses, headers ) { + var isSuccess, success, error, response, modified, + statusText = nativeStatusText; + + // Ignore repeat invocations + if ( completed ) { + return; + } + + completed = true; + + // Clear timeout if it exists + if ( timeoutTimer ) { + window.clearTimeout( timeoutTimer ); + } + + // Dereference transport for early garbage collection + // (no matter how long the jqXHR object will be used) + transport = undefined; + + // Cache response headers + responseHeadersString = headers || ""; + + // Set readyState + jqXHR.readyState = status > 0 ? 4 : 0; + + // Determine if successful + isSuccess = status >= 200 && status < 300 || status === 304; + + // Get response data + if ( responses ) { + response = ajaxHandleResponses( s, jqXHR, responses ); + } + + // Use a noop converter for missing script but not if jsonp + if ( !isSuccess && + jQuery.inArray( "script", s.dataTypes ) > -1 && + jQuery.inArray( "json", s.dataTypes ) < 0 ) { + s.converters[ "text script" ] = function() {}; + } + + // Convert no matter what (that way responseXXX fields are always set) + response = ajaxConvert( s, response, jqXHR, isSuccess ); + + // If successful, handle type chaining + if ( isSuccess ) { + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + modified = jqXHR.getResponseHeader( "Last-Modified" ); + if ( modified ) { + jQuery.lastModified[ cacheURL ] = modified; + } + modified = jqXHR.getResponseHeader( "etag" ); + if ( modified ) { + jQuery.etag[ cacheURL ] = modified; + } + } + + // if no content + if ( status === 204 || s.type === "HEAD" ) { + statusText = "nocontent"; + + // if not modified + } else if ( status === 304 ) { + statusText = "notmodified"; + + // If we have data, let's convert it + } else { + statusText = response.state; + success = response.data; + error = response.error; + isSuccess = !error; + } + } else { + + // Extract error from statusText and normalize for non-aborts + error = statusText; + if ( status || !statusText ) { + statusText = "error"; + if ( status < 0 ) { + status = 0; + } + } + } + + // Set data for the fake xhr object + jqXHR.status = status; + jqXHR.statusText = ( nativeStatusText || statusText ) + ""; + + // Success/Error + if ( isSuccess ) { + deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); + } else { + deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); + } + + // Status-dependent callbacks + jqXHR.statusCode( statusCode ); + statusCode = undefined; + + if ( fireGlobals ) { + globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", + [ jqXHR, s, isSuccess ? success : error ] ); + } + + // Complete + completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); + + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); + + // Handle the global AJAX counter + if ( !( --jQuery.active ) ) { + jQuery.event.trigger( "ajaxStop" ); + } + } + } + + return jqXHR; + }, + + getJSON: function( url, data, callback ) { + return jQuery.get( url, data, callback, "json" ); + }, + + getScript: function( url, callback ) { + return jQuery.get( url, undefined, callback, "script" ); + } +} ); + +jQuery.each( [ "get", "post" ], function( _i, method ) { + jQuery[ method ] = function( url, data, callback, type ) { + + // Shift arguments if data argument was omitted + if ( isFunction( data ) ) { + type = type || callback; + callback = data; + data = undefined; + } + + // The url can be an options object (which then must have .url) + return jQuery.ajax( jQuery.extend( { + url: url, + type: method, + dataType: type, + data: data, + success: callback + }, jQuery.isPlainObject( url ) && url ) ); + }; +} ); + +jQuery.ajaxPrefilter( function( s ) { + var i; + for ( i in s.headers ) { + if ( i.toLowerCase() === "content-type" ) { + s.contentType = s.headers[ i ] || ""; + } + } +} ); + + +jQuery._evalUrl = function( url, options, doc ) { + return jQuery.ajax( { + url: url, + + // Make this explicit, since user can override this through ajaxSetup (#11264) + type: "GET", + dataType: "script", + cache: true, + async: false, + global: false, + + // Only evaluate the response if it is successful (gh-4126) + // dataFilter is not invoked for failure responses, so using it instead + // of the default converter is kludgy but it works. + converters: { + "text script": function() {} + }, + dataFilter: function( response ) { + jQuery.globalEval( response, options, doc ); + } + } ); +}; + + +jQuery.fn.extend( { + wrapAll: function( html ) { + var wrap; + + if ( this[ 0 ] ) { + if ( isFunction( html ) ) { + html = html.call( this[ 0 ] ); + } + + // The elements to wrap the target around + wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); + + if ( this[ 0 ].parentNode ) { + wrap.insertBefore( this[ 0 ] ); + } + + wrap.map( function() { + var elem = this; + + while ( elem.firstElementChild ) { + elem = elem.firstElementChild; + } + + return elem; + } ).append( this ); + } + + return this; + }, + + wrapInner: function( html ) { + if ( isFunction( html ) ) { + return this.each( function( i ) { + jQuery( this ).wrapInner( html.call( this, i ) ); + } ); + } + + return this.each( function() { + var self = jQuery( this ), + contents = self.contents(); + + if ( contents.length ) { + contents.wrapAll( html ); + + } else { + self.append( html ); + } + } ); + }, + + wrap: function( html ) { + var htmlIsFunction = isFunction( html ); + + return this.each( function( i ) { + jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); + } ); + }, + + unwrap: function( selector ) { + this.parent( selector ).not( "body" ).each( function() { + jQuery( this ).replaceWith( this.childNodes ); + } ); + return this; + } +} ); + + +jQuery.expr.pseudos.hidden = function( elem ) { + return !jQuery.expr.pseudos.visible( elem ); +}; +jQuery.expr.pseudos.visible = function( elem ) { + return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); +}; + + + + +jQuery.ajaxSettings.xhr = function() { + try { + return new window.XMLHttpRequest(); + } catch ( e ) {} +}; + +var xhrSuccessStatus = { + + // File protocol always yields status code 0, assume 200 + 0: 200, + + // Support: IE <=9 only + // #1450: sometimes IE returns 1223 when it should be 204 + 1223: 204 + }, + xhrSupported = jQuery.ajaxSettings.xhr(); + +support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); +support.ajax = xhrSupported = !!xhrSupported; + +jQuery.ajaxTransport( function( options ) { + var callback, errorCallback; + + // Cross domain only allowed if supported through XMLHttpRequest + if ( support.cors || xhrSupported && !options.crossDomain ) { + return { + send: function( headers, complete ) { + var i, + xhr = options.xhr(); + + xhr.open( + options.type, + options.url, + options.async, + options.username, + options.password + ); + + // Apply custom fields if provided + if ( options.xhrFields ) { + for ( i in options.xhrFields ) { + xhr[ i ] = options.xhrFields[ i ]; + } + } + + // Override mime type if needed + if ( options.mimeType && xhr.overrideMimeType ) { + xhr.overrideMimeType( options.mimeType ); + } + + // X-Requested-With header + // For cross-domain requests, seeing as conditions for a preflight are + // akin to a jigsaw puzzle, we simply never set it to be sure. + // (it can always be set on a per-request basis or even using ajaxSetup) + // For same-domain requests, won't change header if already provided. + if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { + headers[ "X-Requested-With" ] = "XMLHttpRequest"; + } + + // Set headers + for ( i in headers ) { + xhr.setRequestHeader( i, headers[ i ] ); + } + + // Callback + callback = function( type ) { + return function() { + if ( callback ) { + callback = errorCallback = xhr.onload = + xhr.onerror = xhr.onabort = xhr.ontimeout = + xhr.onreadystatechange = null; + + if ( type === "abort" ) { + xhr.abort(); + } else if ( type === "error" ) { + + // Support: IE <=9 only + // On a manual native abort, IE9 throws + // errors on any property access that is not readyState + if ( typeof xhr.status !== "number" ) { + complete( 0, "error" ); + } else { + complete( + + // File: protocol always yields status 0; see #8605, #14207 + xhr.status, + xhr.statusText + ); + } + } else { + complete( + xhrSuccessStatus[ xhr.status ] || xhr.status, + xhr.statusText, + + // Support: IE <=9 only + // IE9 has no XHR2 but throws on binary (trac-11426) + // For XHR2 non-text, let the caller handle it (gh-2498) + ( xhr.responseType || "text" ) !== "text" || + typeof xhr.responseText !== "string" ? + { binary: xhr.response } : + { text: xhr.responseText }, + xhr.getAllResponseHeaders() + ); + } + } + }; + }; + + // Listen to events + xhr.onload = callback(); + errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); + + // Support: IE 9 only + // Use onreadystatechange to replace onabort + // to handle uncaught aborts + if ( xhr.onabort !== undefined ) { + xhr.onabort = errorCallback; + } else { + xhr.onreadystatechange = function() { + + // Check readyState before timeout as it changes + if ( xhr.readyState === 4 ) { + + // Allow onerror to be called first, + // but that will not handle a native abort + // Also, save errorCallback to a variable + // as xhr.onerror cannot be accessed + window.setTimeout( function() { + if ( callback ) { + errorCallback(); + } + } ); + } + }; + } + + // Create the abort callback + callback = callback( "abort" ); + + try { + + // Do send the request (this may raise an exception) + xhr.send( options.hasContent && options.data || null ); + } catch ( e ) { + + // #14683: Only rethrow if this hasn't been notified as an error yet + if ( callback ) { + throw e; + } + } + }, + + abort: function() { + if ( callback ) { + callback(); + } + } + }; + } +} ); + + + + +// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) +jQuery.ajaxPrefilter( function( s ) { + if ( s.crossDomain ) { + s.contents.script = false; + } +} ); + +// Install script dataType +jQuery.ajaxSetup( { + accepts: { + script: "text/javascript, application/javascript, " + + "application/ecmascript, application/x-ecmascript" + }, + contents: { + script: /\b(?:java|ecma)script\b/ + }, + converters: { + "text script": function( text ) { + jQuery.globalEval( text ); + return text; + } + } +} ); + +// Handle cache's special case and crossDomain +jQuery.ajaxPrefilter( "script", function( s ) { + if ( s.cache === undefined ) { + s.cache = false; + } + if ( s.crossDomain ) { + s.type = "GET"; + } +} ); + +// Bind script tag hack transport +jQuery.ajaxTransport( "script", function( s ) { + + // This transport only deals with cross domain or forced-by-attrs requests + if ( s.crossDomain || s.scriptAttrs ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( " + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + +
  • +
  • +
+
+
+
+
+ + +

Index

+ +
+ _ + | A + | C + | D + | F + | G + | H + | M + | P + | Q + | R + | S + +
+

_

+ + + +
+ +

A

+ + + +
+ +

C

+ + + +
+ +

D

+ + + +
+ +

F

+ + +
+ +

G

+ + + +
+ +

H

+ + +
+ +

M

+ + +
+ +

P

+ + + +
+ +

Q

+ + + +
+ +

R

+ + + +
+ +

S

+ + +
+ + + +
+
+
+ +
+ +
+

© Copyright 2023-2024, TNO Quantum Code Lab.

+
+ + Built with Sphinx using a + theme + provided by Read the Docs. + + +
+
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/index.html b/docs/index.html new file mode 100644 index 0000000..e9be577 --- /dev/null +++ b/docs/index.html @@ -0,0 +1,341 @@ + + + + + + + TNO Quantum — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

TNO Quantum

+

TNO Quantum provides generic software components aimed at facilitating the development +of quantum applications.

+
+
+

Portfolio optimization

+

Real-world investment decisions involve multiple, often conflicting, objectives that needs to be balanced. +Primary goals typically revolve around maximizing returns while minimizing risks. +At the same time, one might want to require additional constraints such as demanding a minimum carbon footprint reduction. +Finding a portfolio that balances these objectives is a challenging task and can be solved using multi-objective portfolio optimization.

+

This repository provides Python code that converts the multi-objective portfolio optimization problem +into a QUBO problem. The transformed problem can then be solved using quantum annealing techniques.

+

The following objectives can be considered

+ +

Additionally, we allow for a capital growth factor and arbitrary emission reduction constraints to be considered.

+

The Pareto front, the set of solutions where one objective can’t be improved without worsening the other objective, +can be computed for the objectives return on capital and diversification.

+

The codebase is based on the following paper:

+ +

Funding: This research was funded by Rabobank and Stichting TKI High Tech Systems +and Materials, under a program by Brightland’s Techruption.

+
+

Quick Install

+

The portfolio optimization module can be installed using pip as follows:

+
pip install tno.quantum.problems.portfolio_optimization
+
+
+
+
+

Examples

+

Here’s an example of how the PortfolioOptimizer class +can be used to define an portfolio optimization problem, and subsequently, how the Pareto front can be computed +using the simulated annealing sampler from D-Wave.

+
import numpy as np
+from dwave.samplers import SimulatedAnnealingSampler
+
+from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+
+# Choose sampler for solving qubo
+sampler = SimulatedAnnealingSampler()
+sampler_kwargs = {"num_reads": 20, "num_sweeps": 200}
+
+# Set up penalty coefficients for the constraints
+lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+lambdas3 = np.array([1])
+
+# Create portfolio optimization problem
+portfolio_optimizer = PortfolioOptimizer("benchmark_dataset")
+portfolio_optimizer.add_minimize_hhi(weights=lambdas1)
+portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas2)
+portfolio_optimizer.add_emission_constraint(
+    weights=lambdas3,
+    emission_now="emis_intens_now",
+    emission_future="emis_intens_future",
+    name="emission"
+)
+
+# Solve the portfolio optimization problem
+results = portfolio_optimizer.run(sampler, sampler_kwargs)
+print(results.head())
+
+
+

The results can be inspected in more detail by looking at the Pandas results DataFrame +results.results_df.

+

Alternatively, the results can be plotted in a (Diversification, ROC)-graph. The +following example first slices the results in data points that do and do not satisfy the +constraints using the method slice_results().

+

Note that:

+
    +
  • Individual data points can subsequently be plotted using plot_points()

  • +
  • The Pareto front can be plotted using plot_front()

  • +
+
import matplotlib.pyplot as plt
+
+from tno.quantum.problems.portfolio_optimization import plot_front, plot_points
+
+(x1, y1), (x2, y2) = results.slice_results()
+fig, (ax1, ax2) = plt.subplots(ncols=2, figsize=(12, 5))
+
+# Plot data points
+plot_points(x2, y2, color="orange", label="QUBO constraint not met", ax=ax1)
+plot_points(x1, y1, color="green", label="QUBO constraint met", ax=ax1)
+ax1.set_title("Points")
+
+# Plot Pareto front
+plot_front(x2, y2, color="orange", label="QUBO constraint not met", ax=ax2)
+plot_front(x1, y1, color="green", label="QUBO constraint met", ax=ax2)
+ax2.set_title("Pareto Front")
+fig.tight_layout()
+plt.show()
+
+
+(Diversification, ROC)-Graph +

More elaborate examples can be found in our examples repository.

+
+
+

Data input

+

The data used for the portfolio optimization can be imported via an excel file, csv file, +json file or as a Pandas DataFrame. +The data needs to contain at least the following columns:

+
+
    +
  • asset: The name of the asset.

  • +
  • outstanding_now: Current outstanding amount per asset.

  • +
  • min_outstanding_future: Lower bound outstanding amount in the future per asset.

  • +
  • max_outstanding_future: Upper bound outstanding amount in the future per asset.

  • +
  • income_now: Current income per asset, corresponds to return multiplied by the current outstanding amount.

  • +
  • regcap_now: Current regulatory capital per asset.

  • +
+
+

The table below shows an example dataset with the correct structure. +Note that this is the least amount of columns that need to be present. +More columns are allowed and required for some functionalities.

+ + ++++++++ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Example Dataset

asset

outstanding_now

min_outstanding_future

max_outstanding_future

income_now

regcap_now

Sector 1 COUNTRY 1

10

14

19

5

5

Sector 2 COUNTRY 1

600

473

528

70

40

Sector 3 COUNTRY 1

20

24

28

5

10

Sector 4 COUNTRY 1

800

1090

1410

1

2

Sector 1 COUNTRY 2

40

56

74

10

5

Sector 2 COUNTRY 2

200

291

397

40

20

+

If the input datafile contains all the correct information, but has different column +names, it is possible to rename the columns without altering the input file. +Details and examples can be found in the documentation of +PortfolioData.

+
+
+

Using Quantum Annealing Solvers

+

By default, the portfolio optimization QUBO is solved using simulated annealing. +Any D-Wave Sampler is however supported and can be provided to the +run() method.

+

Below is an example how to initialise a quantum annealing sampler that uses 100 micro seconds annealing time per sample. +The example assumes a proper configuration setup to the D-Wave’s Solver API.

+
from dwave.system import DWaveSampler, LazyFixedEmbeddingComposite
+
+# Define QPU D-Wave Sampler
+qpu = DWaveSampler()
+sampler = LazyFixedEmbeddingComposite(qpu)
+sampler_kwargs = {"annealing_time": 100}
+
+
+

We refer to the D-Wave Sampler documentation for information on usage of different samplers and their sampler arguments.

+
+
+
+
+

(End)use Limitations

+

The content of this software may solely be used for applications that comply with international export control laws.

+
+
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/objects.inv b/docs/objects.inv new file mode 100644 index 0000000..66c173f Binary files /dev/null and b/docs/objects.inv differ diff --git a/docs/portfolio_optimization.components.html b/docs/portfolio_optimization.components.html new file mode 100644 index 0000000..b577731 --- /dev/null +++ b/docs/portfolio_optimization.components.html @@ -0,0 +1,1144 @@ + + + + + + + portfolio_optimization.components package — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components package

+

This subpackage contains components used by the PortfolioOptimizer.

+
+
+class portfolio_optimization.components.Decoder(portfolio_data, k)[source]
+

Bases: object

+

Decoder class for decoding samples and samplesets.

+
+
+__init__(portfolio_data, k)[source]
+

Init for the Decoder Class.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+decode_sample(sample)[source]
+

Decodes a sample to the oustanding_future array.

+
+
Parameters:
+

sample (Mapping[int, int]) – Sample as returned by D-Wave.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Array containing all outstanding future values.

+
+
+
+ +
+
+decode_sampleset(sampleset)[source]
+

Efficiently decodes a sampleset create a matrix of oustanding_future +values.

+

Each row in the matrix corresponds to a different sample in the sampleset.

+
+
Parameters:
+

sampleset (SampleSet) – SampleSet as returned by D-Wave.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Matrix containing all outstanding future values.

+
+
+
+ +
+ +
+
+class portfolio_optimization.components.PortfolioData(portfolio_dataframe, columns_rename=None)[source]
+

Bases: object

+

The PortfolioData stores the data used for portfolio optimization.

+
+
+__contains__(other)[source]
+

Check if other is part of the dataset.

+
+
Return type:
+

bool

+
+
+
+ +
+
+__init__(portfolio_dataframe, columns_rename=None)[source]
+

Creates a PortfolioData object from a pandas DataFrame.

+

The portfolio data is expected to contain at least the following columns names:

+
+
    +
  • "assets": The name of the asset.

  • +
  • "outstanding_now_now": Current outstanding amount per asset.

  • +
  • "min_outstanding_future": Lower bound outstanding amount in the future per asset.

  • +
  • "max_outstanding_future": Upper bound outstanding amount in the future per asset.

  • +
  • "income_now": Current income per asset, corresponds to return multiplied by the current outstanding amount.

  • +
  • "regcap_now": Current regulatory capital per asset.

  • +
+
+

Different column names in the dataset can be used but need to be provided as a +renaming dictionary to the columns_rename argument.

+
+
Parameters:
+
    +
  • portfolio_dataframe (DataFrame) – Pandas DataFrame containing the portfolio data.

  • +
  • column_rename – to rename columns provided as dict with new column names as keys +and to replace column name as value. Example +{"outstanding_2021": "outstanding_now"}.

  • +
+
+
Raises:
+

ValueError if required columns are not present in dataset.

+
+
+
+ +
+
+__len__()[source]
+

Length of the dataset.

+
+
Return type:
+

int

+
+
+
+ +
+
+__repr__()[source]
+

Representation for debugging.

+
+
Return type:
+

str

+
+
+
+ +
+
+__str__()[source]
+

String representation of the PortfolioData object.

+
+
Return type:
+

str

+
+
+
+ +
+
+classmethod from_file(filename, columns_rename=None)[source]
+

Reads portfolio data object into PortfolioData.

+

The portfolio data is expected to contain at least the following columns names:

+
+
    +
  • "assets": The name of the asset.

  • +
  • "outstanding_now_now": Current outstanding amount per asset.

  • +
  • "min_outstanding_future": Lower bound outstanding amount in the future per asset.

  • +
  • "max_outstanding_future": Upper bound outstanding amount in the future per asset.

  • +
  • "income_now": Current income per asset, corresponds to return multiplied by the current outstanding amount.

  • +
  • "regcap_now": Current regulatory capital per asset.

  • +
+
+

Different column names in the dataset can be used but need to be provided as a +renaming dictionary to the columns_rename argument.

+
+
Parameters:
+
    +
  • filename (str | Path) – path to portfolio data. If instead benchmark_dataset is +provided, a default benchmark dataset containing 52 assets will be used.

  • +
  • column_rename – to rename columns provided as dict with new column names as keys +and to replace column name as value. Example +{"outstanding_2021": "outstanding_now"}.

  • +
+
+
Raises:
+

ValueError if required columns are not present in dataset.

+
+
Return type:
+

TypeVar(PortfolioDataT, bound= PortfolioData)

+
+
+
+ +
+
+get_capital()[source]
+

Gets the capital data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The regcap_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_column(column_name)[source]
+

Gets the specified column from the dataset.

+
+
Parameters:
+

column_name (str) – Name of the column to get.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The regcap_now columns from the dataset as a numpy array.

+
+
+
+ +
+
+get_income()[source]
+

Gets the income data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The income_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_l_bound()[source]
+

Gets the l_bound data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The min_outstanding_future column from the dataset as a numpy array.

+
+
+
+ +
+
+get_outstanding_now()[source]
+

Gets the outstanding_now data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The outstanding_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_returns()[source]
+

Gets the returns data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Returns is defined as income / outstanding_now

+
+
+
+ +
+
+get_u_bound()[source]
+

Gets the u_bound data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The max_outstanding_future column from the dataset as a numpy array.

+
+
+
+ +
+
+print_portfolio_info()[source]
+

Prints information about portfolio data to terminal.

+
+
Return type:
+

None

+
+
+
+ +
+ +
+
+class portfolio_optimization.components.QuboCompiler(portfolio_data, k)[source]
+

Bases: object

+

QuboCompiler - A compiler class for creating QUBO instances.

+

This class provides a convenient interface for combining different QUBO formulations +without needing to worry about the qubo size.

+

Methods:

+
    +
  • add_minimize_hhi: Adds the to minimize HHI QUBO to the compile list.

  • +
  • add_maximize_roc: Adds a ROC and optionally a stabilizing QUBO to the compile +list.

  • +
  • add_emission_constraint: Adds an emission constraint QUBO to the compile list.

  • +
  • add_growth_factor_constraint: Adds the growth factor constraint QUBO to the +compile list.

  • +
+
+
+__init__(portfolio_data, k)[source]
+

Init of the QuboCompiler class.

+

The QuboCompiler can create a variety of QUBO formulation by combining +different objectives and constraints with penalty or preference parameters.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+add_emission_constraint(emission_now, emission_future=None, reduction_percentage_target=0.7)[source]
+

Adds the emission constraint to the compile list.

+

The constraint is given by

+
+\[\frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} += +g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i},\]
+

where:

+
+
    +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(e_i\) is the current emission intensity for asset \(i\),

  • +
  • \(f_i\) is the expected emission intensity at the future for asset \(i\),

  • +
  • \(g_e\) is the target value for the relative emission reduction.

  • +
+
+

For the QUBO formulation, see the docs of +calc_emission_constraint().

+
+
Parameters:
+
    +
  • emission_now (str) – Name of the column in the portfolio dataset corresponding to +the variables at current time.

  • +
  • emission_future (Optional[str]) – Name of the column in the portfolio dataset corresponding +to the variables at future time. If no value is provided, it is assumed +that the value is constant over time, i.e., the variable +emission_now will be used.

  • +
  • reduction_percentage_target (float) – target value for reduction percentage amount.

  • +
+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_growth_factor_constraint(growth_target)[source]
+

Adds the capital growth factor constraint to the compile list.

+

The constraint is given by

+

+\[\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(g_c\) is the target value for the total growth factor.

  • +
+
+

For the QUBO formulation, see the docs of +calc_growth_factor_constraint().

+
+
Parameters:
+

growth_target (float) – target value for growth factor total outstanding amount.

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_maximize_roc(formulation, ancilla_variables=0)[source]
+

Adds the maximize ROC objective and based on the chosen formulation a +stabilize c constraint.

+
+
Parameters:
+
    +
  • formulation (int) – Integer representing which formulation to pick. If formulation +is 1, then one QUBO term will be added. If formulation is 2, +then 2 QUBO terms will be added as well, but the argument +ancilla_variables must be provided.

  • +
  • ancilla_variables (int) – Number of ancilla variables to use for formulation 2.

  • +
+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_minimize_hhi()[source]
+

Adds the minimize HHI objective to the compile list.

+

The HHI objective is given by

+

+\[HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\).

  • +
+
+

For the QUBO formulation, see the docs of +calc_minimize_hhi().

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+compile()[source]
+

Compiles all QUBOs in the compile list.

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+make_qubo(*lambdas)[source]
+

Makes a QUBO of the entire problem with the given lambdas.

+
+
Parameters:
+

lambdas (float) – Scaling parameters for each QUBO in the formulation.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

Tuple containing the QUBO matrix and offset.

+
+
+
+ +
+ +
+
+class portfolio_optimization.components.QuboFactory(portfolio_data, k)[source]
+

Bases: object

+

QuboFactory - A factory class for creating QUBO instances.

+

This class provides a convenient interface for constructing intermediate QUBO +matrices for different objectives and constraints.

+

Methods:

+
    +
  • calc_minimize_hhi: Calculates the to minimize HHI QUBO

  • +
  • calc_maximize_roc1: Calculates the to maximize return on capital QUBO variant 1

  • +
  • calc_maximize_roc2: Calculates the to maximize return on capital QUBO variant 2

  • +
  • calc_emission_constraint: Calculates the emission constraint QUBO

  • +
  • calc_growth_factor_constraint: Calculates the growth factor constraint QUBO

  • +
  • calc_stabilize_c: Calculates the constraint QUBO that stabilizes growth factor.

  • +
+
+
+__init__(portfolio_data, k)[source]
+

Init of the QuboFactory.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+calc_emission_constraint(emission_now, emission_future=None, reduction_percentage_target=0.7)[source]
+

Calculates the emission constraint QUBO for arbitrary target reduction target

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x) +&= +\left( +\sum_{i=1}^N f_i x_i +- g_e E +\sum_{i=1}^N x_i +\right)^2,\\x_i & = LB_i+\frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j},\\E &= \frac{\sum_{i=1}^N e_i \cdot y_i}{\sum_{i=1}^N y_i},\end{aligned}\end{align} \]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(e_i\) is the current emission intensity for asset \(i\),

  • +
  • \(f_i\) is the expected emission intensity at the future for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(g_e\) is the target value for the relative emission reduction,

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Parameters:
+
    +
  • emission_now (str) – Name of the column in the portfolio dataset corresponding to +the variables at current time.

  • +
  • emission_future (Optional[str]) – Name of the column in the portfolio dataset corresponding +to the variables at future time. If no value is provided, it is assumed +that the value is constant over time, i.e., the variable +emission_now will be used.

  • +
  • reduction_percentage_target (float) – Target value for reduction percentage amount.

  • +
+
+
Raises:
+

KeyError – if the provided column names are not in the portfolio_data.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_growth_factor_constraint(growth_target)[source]
+

Calculates the growth factor constraint QUBO

+

The QUBO formulation is given by

+
+\[QUBO(x) += +\left( +\frac{\sum_{i=1}^N LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1} 2^j\cdot x_{i,j}}{\sum_{i=1}^N y_i} +- g_c +\right)^2\]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(g_c\) is the target value for the total growth factor,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Parameters:
+

growth_target (float) – target value for growth factor total outstanding amount.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_maximize_roc1()[source]
+

Calculates the to maximize ROC QUBO for variant 1.

+

The QUBO formulation is given by

+
+\[QUBO(x) += +-\sum_{i=1}^N\frac{r_i}{c_i\cdot y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right),\]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(r_i\) is the current return for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_maximize_roc2()[source]
+

Calculates the to maximize ROC QUBO for variant 2.

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x,g) +&= +- +G_{inv}(g) \cdot +\sum_{i=1}^N\frac{r_i}{y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right),\\G_{inv}(g) &= +1 + \sum_{j=0}^{k-1} 2^{-j-1}(2^{-j-1} - 1)\cdot g_{j},\end{aligned}\end{align} \]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(a\) is the number of ancilla variables,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(r_i\) is the return for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
  • \(g_{j}\) are the \(a\) binary ancilla variables with \(j<a\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_minimize_hhi()[source]
+

Calculates the to minimize HHI QUBO.

+

The QUBO formulation is given by

+
+\[QUBO(x) += +\sum_{i=1}^N\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right)^2,\]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_stabilize_c()[source]
+

Calculates the QUBO that stabilizes the growth factor in the second ROC +formulation.

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x,g) +&= +\left( +\sum_{i=1}^N\frac{c_i}{y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right) +- G_C(g)\sum_{i=1}^N c_i +\right)^2,\\G_C &= 1 + \sum_{j=0}^{k-1} 2^{-j - 1} \cdot g_j,\end{aligned}\end{align} \]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(a\) is the number of ancilla variables,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\),

  • +
  • \(g_j\) are the \(a\) ancillary binary variables with \(j<a\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+ +
+
+class portfolio_optimization.components.Results(portfolio_data, provided_emission_constraints=None, provided_growth_target=None)[source]
+

Bases: object

+

Results container

+
+
+__init__(portfolio_data, provided_emission_constraints=None, provided_growth_target=None)[source]
+

Init of Results container.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – the portfolio data

  • +
  • provided_emission_constraints (Optional[list[tuple[str, str, float, str]]]) – list of all the emission constraints that are +provided. Each list element contains the emission_now, +emission_future and reduction_percentage_target input.

  • +
  • provided_growth_target (Optional[float]) – target outstanding amount growth factor if the +growth factor constraint is set, otherwise None.

  • +
+
+
+
+ +
+
+__len__()[source]
+

Return the number of samples stored in the Results object.

+
+
Return type:
+

int

+
+
+
+ +
+
+add_result(outstanding_future_samples)[source]
+

Adds a new outstanding_future data point to results container.

+
+
Parameters:
+

outstanding_future_samples (ndarray[Any, dtype[float64]]) – outstanding amounts in the future for each +sample of the dataset.

+
+
Return type:
+

None

+
+
+
+ +
+
+drop_duplicates()[source]
+

Drops duplicates in results DataFrame

+
+
Return type:
+

None

+
+
+
+ +
+
+head(n=5)[source]
+

Returns first n rows of self.results_df DataFrame

+
+
Parameters:
+
    +
  • selected_columns – By default all columns

  • +
  • n (int) – number of results to return

  • +
+
+
Return type:
+

DataFrame

+
+
+
+ +
+
+slice_results(tolerance=0.0)[source]
+

Helper function that slices the results in two groups, those results that +satisfy all constraints and those that violate at least one of the growth factor +or emission constraints.

+
+
Parameters:
+

tolerance (float) – tolerance on how strict the constraints need to be satisfied (in +percentage point). Example: if the desired target growth rate is 1.2, if +the tolerance is set to 0.05 (5%). Solutions that increase outstanding +amount by a factor of 1.15 are considered to satisfy the constraints +given the tolerance.

+
+
Return type:
+

tuple[tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]], tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]]]

+
+
Returns:
+

Relative difference (diversification, roc) coordinates for solutions that +satisfy all constraints, and for those that do not satisfy all constraints.

+
+
Raises:
+

ValueError – when there are no emission or growth factor constraints set.

+
+
+
+ +
+ +
+
+portfolio_optimization.components.pareto_front(xvals, yvals, min_points=50, upper_right_quadrant=True)[source]
+

Calculates the pareto front with at least min_points data points by repeatedly +creating a convex hull around data points.

+
+
Parameters:
+
    +
  • xvals (ArrayLike) – x-values of data points

  • +
  • yvals (ArrayLike) – y-values of data points

  • +
  • min_points (int) – minimum number of points to be selected

  • +
  • upper_right_quadrant (bool) – If True, only show the upper right quadrant of the +pareto front.

  • +
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]]

+
+
Returns:
+

x, y values of the points that are on the pareto front

+
+
+
+ +
+
+portfolio_optimization.components.plot_front(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots a pareto front of the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+
+portfolio_optimization.components.plot_points(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection | Any

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+

Subpackages

+ + +
+
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.components.io.html b/docs/portfolio_optimization.components.io.html new file mode 100644 index 0000000..936c474 --- /dev/null +++ b/docs/portfolio_optimization.components.io.html @@ -0,0 +1,360 @@ + + + + + + + portfolio_optimization.components.io module — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components.io module

+

This module implements I/O

+
+
+class portfolio_optimization.components.io.PortfolioData(portfolio_dataframe, columns_rename=None)[source]
+

Bases: object

+

The PortfolioData stores the data used for portfolio optimization.

+
+
+__contains__(other)[source]
+

Check if other is part of the dataset.

+
+
Return type:
+

bool

+
+
+
+ +
+
+__init__(portfolio_dataframe, columns_rename=None)[source]
+

Creates a PortfolioData object from a pandas DataFrame.

+

The portfolio data is expected to contain at least the following columns names:

+
+
    +
  • "assets": The name of the asset.

  • +
  • "outstanding_now_now": Current outstanding amount per asset.

  • +
  • "min_outstanding_future": Lower bound outstanding amount in the future per asset.

  • +
  • "max_outstanding_future": Upper bound outstanding amount in the future per asset.

  • +
  • "income_now": Current income per asset, corresponds to return multiplied by the current outstanding amount.

  • +
  • "regcap_now": Current regulatory capital per asset.

  • +
+
+

Different column names in the dataset can be used but need to be provided as a +renaming dictionary to the columns_rename argument.

+
+
Parameters:
+
    +
  • portfolio_dataframe (DataFrame) – Pandas DataFrame containing the portfolio data.

  • +
  • column_rename – to rename columns provided as dict with new column names as keys +and to replace column name as value. Example +{"outstanding_2021": "outstanding_now"}.

  • +
+
+
Raises:
+

ValueError if required columns are not present in dataset.

+
+
+
+ +
+
+__len__()[source]
+

Length of the dataset.

+
+
Return type:
+

int

+
+
+
+ +
+
+__repr__()[source]
+

Representation for debugging.

+
+
Return type:
+

str

+
+
+
+ +
+
+__str__()[source]
+

String representation of the PortfolioData object.

+
+
Return type:
+

str

+
+
+
+ +
+
+classmethod from_file(filename, columns_rename=None)[source]
+

Reads portfolio data object into PortfolioData.

+

The portfolio data is expected to contain at least the following columns names:

+
+
    +
  • "assets": The name of the asset.

  • +
  • "outstanding_now_now": Current outstanding amount per asset.

  • +
  • "min_outstanding_future": Lower bound outstanding amount in the future per asset.

  • +
  • "max_outstanding_future": Upper bound outstanding amount in the future per asset.

  • +
  • "income_now": Current income per asset, corresponds to return multiplied by the current outstanding amount.

  • +
  • "regcap_now": Current regulatory capital per asset.

  • +
+
+

Different column names in the dataset can be used but need to be provided as a +renaming dictionary to the columns_rename argument.

+
+
Parameters:
+
    +
  • filename (str | Path) – path to portfolio data. If instead benchmark_dataset is +provided, a default benchmark dataset containing 52 assets will be used.

  • +
  • column_rename – to rename columns provided as dict with new column names as keys +and to replace column name as value. Example +{"outstanding_2021": "outstanding_now"}.

  • +
+
+
Raises:
+

ValueError if required columns are not present in dataset.

+
+
Return type:
+

TypeVar(PortfolioDataT, bound= PortfolioData)

+
+
+
+ +
+
+get_capital()[source]
+

Gets the capital data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The regcap_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_column(column_name)[source]
+

Gets the specified column from the dataset.

+
+
Parameters:
+

column_name (str) – Name of the column to get.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The regcap_now columns from the dataset as a numpy array.

+
+
+
+ +
+
+get_income()[source]
+

Gets the income data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The income_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_l_bound()[source]
+

Gets the l_bound data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The min_outstanding_future column from the dataset as a numpy array.

+
+
+
+ +
+
+get_outstanding_now()[source]
+

Gets the outstanding_now data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The outstanding_now column from the dataset as a numpy array.

+
+
+
+ +
+
+get_returns()[source]
+

Gets the returns data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Returns is defined as income / outstanding_now

+
+
+
+ +
+
+get_u_bound()[source]
+

Gets the u_bound data from the dataset.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

The max_outstanding_future column from the dataset as a numpy array.

+
+
+
+ +
+
+print_portfolio_info()[source]
+

Prints information about portfolio data to terminal.

+
+
Return type:
+

None

+
+
+
+ +
+ +
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.components.postprocess.html b/docs/portfolio_optimization.components.postprocess.html new file mode 100644 index 0000000..9559d3f --- /dev/null +++ b/docs/portfolio_optimization.components.postprocess.html @@ -0,0 +1,215 @@ + + + + + + + portfolio_optimization.components.postprocess module — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components.postprocess module

+

This module implements required post processing steps.

+
+
+class portfolio_optimization.components.postprocess.Decoder(portfolio_data, k)[source]
+

Bases: object

+

Decoder class for decoding samples and samplesets.

+
+
+__init__(portfolio_data, k)[source]
+

Init for the Decoder Class.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+decode_sample(sample)[source]
+

Decodes a sample to the oustanding_future array.

+
+
Parameters:
+

sample (Mapping[int, int]) – Sample as returned by D-Wave.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Array containing all outstanding future values.

+
+
+
+ +
+
+decode_sampleset(sampleset)[source]
+

Efficiently decodes a sampleset create a matrix of oustanding_future +values.

+

Each row in the matrix corresponds to a different sample in the sampleset.

+
+
Parameters:
+

sampleset (SampleSet) – SampleSet as returned by D-Wave.

+
+
Return type:
+

ndarray[Any, dtype[float64]]

+
+
Returns:
+

Matrix containing all outstanding future values.

+
+
+
+ +
+ +
+
+portfolio_optimization.components.postprocess.pareto_front(xvals, yvals, min_points=50, upper_right_quadrant=True)[source]
+

Calculates the pareto front with at least min_points data points by repeatedly +creating a convex hull around data points.

+
+
Parameters:
+
    +
  • xvals (ArrayLike) – x-values of data points

  • +
  • yvals (ArrayLike) – y-values of data points

  • +
  • min_points (int) – minimum number of points to be selected

  • +
  • upper_right_quadrant (bool) – If True, only show the upper right quadrant of the +pareto front.

  • +
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]]

+
+
Returns:
+

x, y values of the points that are on the pareto front

+
+
+
+ +
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.components.qubos.html b/docs/portfolio_optimization.components.qubos.html new file mode 100644 index 0000000..9aa60a6 --- /dev/null +++ b/docs/portfolio_optimization.components.qubos.html @@ -0,0 +1,583 @@ + + + + + + + portfolio_optimization.components.qubos package — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components.qubos package

+

This subpackage contains QUBO related classes and methods.

+

The QuboCompiler can create a variety of QUBO formulation by combining different +objectives and constraints with their corresponding penalty or preference parameters.

+

The QuboFactory class provides a convenient interface for constructing intermediate +QUBO matrices for different objectives and constraints.

+
+
+class portfolio_optimization.components.qubos.QuboCompiler(portfolio_data, k)[source]
+

Bases: object

+

QuboCompiler - A compiler class for creating QUBO instances.

+

This class provides a convenient interface for combining different QUBO formulations +without needing to worry about the qubo size.

+

Methods:

+
    +
  • add_minimize_hhi: Adds the to minimize HHI QUBO to the compile list.

  • +
  • add_maximize_roc: Adds a ROC and optionally a stabilizing QUBO to the compile +list.

  • +
  • add_emission_constraint: Adds an emission constraint QUBO to the compile list.

  • +
  • add_growth_factor_constraint: Adds the growth factor constraint QUBO to the +compile list.

  • +
+
+
+__init__(portfolio_data, k)[source]
+

Init of the QuboCompiler class.

+

The QuboCompiler can create a variety of QUBO formulation by combining +different objectives and constraints with penalty or preference parameters.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+add_emission_constraint(emission_now, emission_future=None, reduction_percentage_target=0.7)[source]
+

Adds the emission constraint to the compile list.

+

The constraint is given by

+
+\[\frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} += +g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i},\]
+

where:

+
+
    +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(e_i\) is the current emission intensity for asset \(i\),

  • +
  • \(f_i\) is the expected emission intensity at the future for asset \(i\),

  • +
  • \(g_e\) is the target value for the relative emission reduction.

  • +
+
+

For the QUBO formulation, see the docs of +calc_emission_constraint().

+
+
Parameters:
+
    +
  • emission_now (str) – Name of the column in the portfolio dataset corresponding to +the variables at current time.

  • +
  • emission_future (Optional[str]) – Name of the column in the portfolio dataset corresponding +to the variables at future time. If no value is provided, it is assumed +that the value is constant over time, i.e., the variable +emission_now will be used.

  • +
  • reduction_percentage_target (float) – target value for reduction percentage amount.

  • +
+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_growth_factor_constraint(growth_target)[source]
+

Adds the capital growth factor constraint to the compile list.

+

The constraint is given by

+

+\[\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(g_c\) is the target value for the total growth factor.

  • +
+
+

For the QUBO formulation, see the docs of +calc_growth_factor_constraint().

+
+
Parameters:
+

growth_target (float) – target value for growth factor total outstanding amount.

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_maximize_roc(formulation, ancilla_variables=0)[source]
+

Adds the maximize ROC objective and based on the chosen formulation a +stabilize c constraint.

+
+
Parameters:
+
    +
  • formulation (int) – Integer representing which formulation to pick. If formulation +is 1, then one QUBO term will be added. If formulation is 2, +then 2 QUBO terms will be added as well, but the argument +ancilla_variables must be provided.

  • +
  • ancilla_variables (int) – Number of ancilla variables to use for formulation 2.

  • +
+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+add_minimize_hhi()[source]
+

Adds the minimize HHI objective to the compile list.

+

The HHI objective is given by

+

+\[HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\).

  • +
+
+

For the QUBO formulation, see the docs of +calc_minimize_hhi().

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+compile()[source]
+

Compiles all QUBOs in the compile list.

+
+
Return type:
+

TypeVar(QuboCompilerT, bound= QuboCompiler)

+
+
Returns:
+

Self.

+
+
+
+ +
+
+make_qubo(*lambdas)[source]
+

Makes a QUBO of the entire problem with the given lambdas.

+
+
Parameters:
+

lambdas (float) – Scaling parameters for each QUBO in the formulation.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

Tuple containing the QUBO matrix and offset.

+
+
+
+ +
+ +
+
+class portfolio_optimization.components.qubos.QuboFactory(portfolio_data, k)[source]
+

Bases: object

+

QuboFactory - A factory class for creating QUBO instances.

+

This class provides a convenient interface for constructing intermediate QUBO +matrices for different objectives and constraints.

+

Methods:

+
    +
  • calc_minimize_hhi: Calculates the to minimize HHI QUBO

  • +
  • calc_maximize_roc1: Calculates the to maximize return on capital QUBO variant 1

  • +
  • calc_maximize_roc2: Calculates the to maximize return on capital QUBO variant 2

  • +
  • calc_emission_constraint: Calculates the emission constraint QUBO

  • +
  • calc_growth_factor_constraint: Calculates the growth factor constraint QUBO

  • +
  • calc_stabilize_c: Calculates the constraint QUBO that stabilizes growth factor.

  • +
+
+
+__init__(portfolio_data, k)[source]
+

Init of the QuboFactory.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – A PortfolioData object containing the portfolio to +optimize.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
+
+
+
+ +
+
+calc_emission_constraint(emission_now, emission_future=None, reduction_percentage_target=0.7)[source]
+

Calculates the emission constraint QUBO for arbitrary target reduction target

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x) +&= +\left( +\sum_{i=1}^N f_i x_i +- g_e E +\sum_{i=1}^N x_i +\right)^2,\\x_i & = LB_i+\frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j},\\E &= \frac{\sum_{i=1}^N e_i \cdot y_i}{\sum_{i=1}^N y_i},\end{aligned}\end{align} \]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(e_i\) is the current emission intensity for asset \(i\),

  • +
  • \(f_i\) is the expected emission intensity at the future for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(g_e\) is the target value for the relative emission reduction,

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Parameters:
+
    +
  • emission_now (str) – Name of the column in the portfolio dataset corresponding to +the variables at current time.

  • +
  • emission_future (Optional[str]) – Name of the column in the portfolio dataset corresponding +to the variables at future time. If no value is provided, it is assumed +that the value is constant over time, i.e., the variable +emission_now will be used.

  • +
  • reduction_percentage_target (float) – Target value for reduction percentage amount.

  • +
+
+
Raises:
+

KeyError – if the provided column names are not in the portfolio_data.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_growth_factor_constraint(growth_target)[source]
+

Calculates the growth factor constraint QUBO

+

The QUBO formulation is given by

+
+\[QUBO(x) += +\left( +\frac{\sum_{i=1}^N LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1} 2^j\cdot x_{i,j}}{\sum_{i=1}^N y_i} +- g_c +\right)^2\]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(g_c\) is the target value for the total growth factor,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Parameters:
+

growth_target (float) – target value for growth factor total outstanding amount.

+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_maximize_roc1()[source]
+

Calculates the to maximize ROC QUBO for variant 1.

+

The QUBO formulation is given by

+
+\[QUBO(x) += +-\sum_{i=1}^N\frac{r_i}{c_i\cdot y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right),\]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(r_i\) is the current return for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_maximize_roc2()[source]
+

Calculates the to maximize ROC QUBO for variant 2.

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x,g) +&= +- +G_{inv}(g) \cdot +\sum_{i=1}^N\frac{r_i}{y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right),\\G_{inv}(g) &= +1 + \sum_{j=0}^{k-1} 2^{-j-1}(2^{-j-1} - 1)\cdot g_{j},\end{aligned}\end{align} \]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(a\) is the number of ancilla variables,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(r_i\) is the return for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
  • \(g_{j}\) are the \(a\) binary ancilla variables with \(j<a\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_minimize_hhi()[source]
+

Calculates the to minimize HHI QUBO.

+

The QUBO formulation is given by

+
+\[QUBO(x) += +\sum_{i=1}^N\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right)^2,\]
+

where:

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • and \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+
+calc_stabilize_c()[source]
+

Calculates the QUBO that stabilizes the growth factor in the second ROC +formulation.

+

The QUBO formulation is given by

+
+\[ \begin{align}\begin{aligned}QUBO(x,g) +&= +\left( +\sum_{i=1}^N\frac{c_i}{y_i} +\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right) +- G_C(g)\sum_{i=1}^N c_i +\right)^2,\\G_C &= 1 + \sum_{j=0}^{k-1} 2^{-j - 1} \cdot g_j,\end{aligned}\end{align} \]
+

where

+
+
    +
  • \(LB_i\) is the lower bound for asset \(i\),

  • +
  • \(UB_i\) is the upper bound for asset \(i\),

  • +
  • \(k\) is the number of bits,

  • +
  • \(a\) is the number of ancilla variables,

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\),

  • +
  • \(x_{i,j}\) are the \(k\) binary variables for asset \(i\) with \(j<k\),

  • +
  • \(g_j\) are the \(a\) ancillary binary variables with \(j<a\).

  • +
+
+
+
Return type:
+

tuple[ndarray[Any, dtype[float64]], float]

+
+
Returns:
+

qubo matrix and its offset

+
+
+
+ +
+ +
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.components.results.html b/docs/portfolio_optimization.components.results.html new file mode 100644 index 0000000..ac150db --- /dev/null +++ b/docs/portfolio_optimization.components.results.html @@ -0,0 +1,235 @@ + + + + + + + portfolio_optimization.components.results module — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components.results module

+

This module contains a container for Results object.

+
+
+class portfolio_optimization.components.results.Results(portfolio_data, provided_emission_constraints=None, provided_growth_target=None)[source]
+

Bases: object

+

Results container

+
+
+__init__(portfolio_data, provided_emission_constraints=None, provided_growth_target=None)[source]
+

Init of Results container.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData) – the portfolio data

  • +
  • provided_emission_constraints (Optional[list[tuple[str, str, float, str]]]) – list of all the emission constraints that are +provided. Each list element contains the emission_now, +emission_future and reduction_percentage_target input.

  • +
  • provided_growth_target (Optional[float]) – target outstanding amount growth factor if the +growth factor constraint is set, otherwise None.

  • +
+
+
+
+ +
+
+__len__()[source]
+

Return the number of samples stored in the Results object.

+
+
Return type:
+

int

+
+
+
+ +
+
+add_result(outstanding_future_samples)[source]
+

Adds a new outstanding_future data point to results container.

+
+
Parameters:
+

outstanding_future_samples (ndarray[Any, dtype[float64]]) – outstanding amounts in the future for each +sample of the dataset.

+
+
Return type:
+

None

+
+
+
+ +
+
+drop_duplicates()[source]
+

Drops duplicates in results DataFrame

+
+
Return type:
+

None

+
+
+
+ +
+
+head(n=5)[source]
+

Returns first n rows of self.results_df DataFrame

+
+
Parameters:
+
    +
  • selected_columns – By default all columns

  • +
  • n (int) – number of results to return

  • +
+
+
Return type:
+

DataFrame

+
+
+
+ +
+
+slice_results(tolerance=0.0)[source]
+

Helper function that slices the results in two groups, those results that +satisfy all constraints and those that violate at least one of the growth factor +or emission constraints.

+
+
Parameters:
+

tolerance (float) – tolerance on how strict the constraints need to be satisfied (in +percentage point). Example: if the desired target growth rate is 1.2, if +the tolerance is set to 0.05 (5%). Solutions that increase outstanding +amount by a factor of 1.15 are considered to satisfy the constraints +given the tolerance.

+
+
Return type:
+

tuple[tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]], tuple[ndarray[Any, dtype[float64]], ndarray[Any, dtype[float64]]]]

+
+
Returns:
+

Relative difference (diversification, roc) coordinates for solutions that +satisfy all constraints, and for those that do not satisfy all constraints.

+
+
Raises:
+

ValueError – when there are no emission or growth factor constraints set.

+
+
+
+ +
+ +
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.components.visualization.html b/docs/portfolio_optimization.components.visualization.html new file mode 100644 index 0000000..d131fde --- /dev/null +++ b/docs/portfolio_optimization.components.visualization.html @@ -0,0 +1,191 @@ + + + + + + + portfolio_optimization.components.visualization module — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization.components.visualization module

+

This module contains visualization tools.

+
+
+portfolio_optimization.components.visualization.plot_front(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots a pareto front of the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+
+portfolio_optimization.components.visualization.plot_points(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection | Any

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/portfolio_optimization.html b/docs/portfolio_optimization.html new file mode 100644 index 0000000..1de64e8 --- /dev/null +++ b/docs/portfolio_optimization.html @@ -0,0 +1,621 @@ + + + + + + + portfolio_optimization package — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+ +
+
+
+
+ +
+

portfolio_optimization package

+

This package provides Python code that converts the multi-objective portfolio +optimization problem into a QUBO problem. The transformed problem can then be solved +using quantum annealing techniques.

+

The following objectives can be considered

+ +

Additionally, we allow for capital growth factor and arbitrary emission reduction +constraints to be considered.

+

The Pareto front, the set of solutions where one objective can’t be improved without +worsening the other objective, can be computed for return on capital and diversification.

+

The codebase is based on the following paper:

+ +
+
+class portfolio_optimization.PortfolioOptimizer(portfolio_data, k=2, columns_rename=None)[source]
+

Bases: object

+

The PortfolioOptimizer class is used to convert multi-objective portfolio +optimization problems into QUBO problems which can then be solved using QUBO solving +techniques such as simulated or quantum annealing.

+

The following objectives can be considered

+ +

The following constraints can be added

+
    +
  • capital growth, demand a minimum increase in outstanding assets.

  • +
  • emission reduction, demand a minimum reduction for an arbitrary emission type.

  • +
+

Usage example:

+
import numpy as np
+from dwave.samplers import SimulatedAnnealingSampler
+
+from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+
+# Choose sampler for solving qubo
+sampler = SimulatedAnnealingSampler()
+sampler_kwargs = {"num_reads": 20, "num_sweeps": 200}
+
+# Set up penalty coefficients for the constraints
+lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+lambdas3 = np.array([1])
+
+# Create portfolio optimization problem
+portfolio_optimizer = PortfolioOptimizer("benchmark_dataset")
+portfolio_optimizer.add_minimize_hhi(weights=lambdas1)
+portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas1)
+portfolio_optimizer.add_emission_constraint(
+    weights=lambdas3,
+    emission_now="emis_intens_now",
+    emission_future="emis_intens_future",
+    name="emission",
+)
+
+# Solve the portfolio optimization problem
+results = portfolio_optimizer.run(sampler, sampler_kwargs)
+print(results.head())
+
+
+
+
+__init__(portfolio_data, k=2, columns_rename=None)[source]
+

Init PortfolioOptimizer.

+
+
Parameters:
+
    +
  • portfolio_data (PortfolioData | DataFrame | str | Path) – Portfolio data represented by a PortfolioData object, +a pandas DataFrame or a path to where portfolio data is stored. See +the docstring of +PortfolioData for data +input conventions.

  • +
  • k (int) – The number of bits that are used to represent the outstanding amount for +each asset. A fixed point representation is used to represent \(2^k\) +different equidistant values in the range \([LB_i, UB_i]\) for asset i.

  • +
  • column_rename – can be used to rename data columns. See the docstring of +PortfolioData for +example.

  • +
+
+
Raises:
+

TypeError – If the provided portfolio_data input has the wrong type.

+
+
+
+ +
+
+add_emission_constraint(emission_now, emission_future=None, reduction_percentage_target=0.7, name=None, weights=None)[source]
+

Adds emission constraint to the portfolio optimization problem.

+

The constraint is given by

+
+\[\frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} += +g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i},\]
+

where:

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(e_i\) is the current emission intensity for asset \(i\),

  • +
  • \(f_i\) is the expected emission intensity at the future for asset \(i\),

  • +
  • \(g_e\) is the target value for the relative emission reduction.

  • +
+
+

Usage example:

+
>>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+>>> import numpy as np
+>>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset")
+>>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+>>> portfolio_optimizer.add_emission_constraint(
+...   emission_now="emis_intens_now", weights=lambdas
+... )
+
+
+

For the QUBO formulation, see the docs of +QuboFactory. +calc_emission_constraint().

+
+
Parameters:
+
    +
  • emission_now (str) – Name of the column in the portfolio dataset corresponding to +the variables emission intensity at current time.

  • +
  • emission_future (Optional[str]) – Name of the column in the portfolio dataset corresponding +to the variables emission intensity at future time. If no value is +provided, it is assumed that the emission intensity is constant over +time, i.e., the variable emission_now will be used.

  • +
  • reduction_percentage_target (float) – target value for reduction percentage amount.

  • +
  • name (Optional[str]) – Name that will be used for emission constraint in the results df.

  • +
  • weights (Optional[ArrayLike]) – The coefficients that are considered as penalty parameter.

  • +
+
+
Return type:
+

None

+
+
+
+ +
+
+add_growth_factor_constraint(growth_target, weights=None)[source]
+

Adds an outstanding amount growth factor constraint to the portfolio +optimization problem.

+

The constraint is given by

+

+\[\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(g_c\) is the target value for the total growth factor.

  • +
+
+

This constraint can only be added once.

+

Usage example:

+
>>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+>>> import numpy as np
+>>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset")
+>>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+>>> portfolio_optimizer.add_emission_constraint(growth_target=1.2, weights=lambdas)
+
+
+

For the QUBO formulation, see the docs of +QuboFactory. +calc_growth_factor_constraint().

+
+
Parameters:
+
    +
  • growth_target (float) – target value for growth factor total outstanding amount.

  • +
  • weights (Optional[ArrayLike]) – The coefficients that are considered as penalty parameter.

  • +
+
+
Raises:
+

ValueError – If constraint has been added before.

+
+
Return type:
+

None

+
+
+
+ +
+
+add_maximize_roc(formulation, weights_roc=None, ancilla_variables=0, weights_stabilize=None)[source]
+

Adds the maximize ROC objective to the portfolio optimization problem.

+

The ROC objective is given by

+
+\[ROC(x) = +\frac{\sum_{i=1}^N \frac{x_i \cdot r_i}{y_i}} +{\sum_{i=1}^N \frac{x_i \cdot c_i}{y_i}},\]
+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\),

  • +
  • \(y_i\) is the current outstanding amount for asset \(i\),

  • +
  • \(r_i\) is the return for asset \(i\),

  • +
  • \(c_i\) is the regulatory capital for asset \(i\).

  • +
+
+

As the ROC is not a quadratic function, it is approximated using two different +formulations:

+
+
formulation 1:

+\[ROC_1(x)=\sum_{i=1}^N\frac{x_i\cdot r_i}{c_i\cdot y_i}\]
+

+

Adds 1 qubo term, use weights_roc to scale.

+
+
formulation 2:

+\[ROC_2(x)=\frac{1}{G_C \cdot C_{21}}\sum_{i=1}^N x_i\frac{r_i}{y_i}\]
+

+

In this formulation, \(G_C \cdot C_{21}\) approximates a fixed regulatory +capital growth which is equal for all assets, where

+
+
    +
  • \(1≤G_C<2\) is a growth factor to be estimated using ancilla variables,

  • +
  • \(C_{21} = \sum_{i=1}^N c_{i}\) is the sum of all assets’ regulatory capital.

  • +
+
+

This formulation adds 2 qubo terms, one for the ROC term, and one to stabilize the +capital growth. The stabilize qubo requires an extra argument ancilla_variables. +Use weights_roc and weights_stabilize to scale both qubo’s accordingly.

+
+
+

For the different QUBO formulations, see the docs of +QuboFactory.

+

Usage example:

+
>>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+>>> import numpy as np
+>>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset")
+>>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+>>> portfolio_optimizer.add_maximize_roc(...)
+
+
+
+
Parameters:
+
    +
  • formulation (int) – the ROC QUBO formulation that is being used. +Possible options are: [1, 2].

  • +
  • weights_roc (Optional[ArrayLike]) – The coefficients that are considered as penalty parameter for +maximizing the roc objective.

  • +
  • ancilla_variables (int) – The number of ancillary variables that are used to +represent G_C using fixed point representation. Only relevant for +roc formulation 2.

  • +
  • weights_stabilize (Optional[ArrayLike]) – The coefficients that are considered as penalty parameter +for the stabilizing constraint. Only relevant for roc formulation 2.

  • +
+
+
Raises:
+

ValueError – If invalid formulation is provided.

+
+
Return type:
+

None

+
+
+
+ +
+
+add_minimize_hhi(weights=None)[source]
+

Adds the minimize HHI objective to the portfolio optimization problem.

+

The HHI objective is given by

+

+\[HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,\]
+

+

where

+
+
    +
  • \(N\) is the total number of assets,

  • +
  • \(x_i\) is the future outstanding amount for asset \(i\).

  • +
+
+

As the objective contains non-quadratic terms, a QUBO formulation requires +approximations. For the QUBO formulation, see the docs of +QuboFactory. +calc_minimize_hhi().

+

Usage example:

+
>>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+>>> import numpy as np
+>>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset")
+>>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0)
+>>> portfolio_optimizer.add_minimize_hhi(weights=lambdas)
+
+
+
+
Parameters:
+

weights (Optional[ArrayLike]) – The coefficients that are considered as penalty parameter.

+
+
Return type:
+

None

+
+
+
+ +
+
+run(sampler=None, sampler_kwargs=None, verbose=True)[source]
+

Optimizes a portfolio given the set of provided constraints.

+

Usage example:

+
>>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer
+>>> from dwave.samplers import SimulatedAnnealingSampler
+>>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset")
+>>> portfolio_optimizer.add_minimize_HHI()
+>>> portfolio_optimizer.run(sampler=SimulatedAnnealingSampler(), verbose=False)
+
+
+
+
Parameters:
+
    +
  • sampler (Optional[Sampler]) – Instance of a D-Wave Sampler that can be used to solve the QUBO. +More information can be found in the D-Wave Ocean Documentation. +By default the SimulatedAnnealingSampler is being used.

  • +
  • sampler_kwargs (Optional[dict[str, Any]]) – The sampler specific key-word arguments.

  • +
  • verbose (bool) – If True, print detailed information during execution

  • +
+
+
Return type:
+

Results

+
+
Returns:
+

results

+
+
Raises:
+

ValueError – if constraints are not set

+
+
+
+ +
+ +
+
+portfolio_optimization.plot_front(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots a pareto front of the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+
+portfolio_optimization.plot_points(diversification_values, roc_values, color=None, label=None, c=None, vmin=None, vmax=None, alpha=None, cmap=None, ax=None)[source]
+

Plots the given data-points in a Diversification-ROC plot.

+
+
Parameters:
+
    +
  • diversification_values (ArrayLike) – 1-D ArrayLike containing the x values of the plot.

  • +
  • roc_values (ArrayLike) – 1-D ArrayLike containing the y values of the plot.

  • +
  • color (Optional[str]) – Optional color to use for the points. For an overview of allowed colors +see the Matplotlib Documentation. If None is given, a default color +will be assigned by matplotlib. Default is None.

  • +
  • label (Optional[str]) – Label to use in the legend. If None is given, no label will be used. +Default is None.

  • +
  • c (Union[_SupportsArray[dtype[Any]], _NestedSequence[_SupportsArray[dtype[Any]]], bool, int, float, complex, str, bytes, _NestedSequence[Union[bool, int, float, complex, str, bytes]], Sequence[Union[tuple[float, float, float], str, tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float]]], tuple[float, float, float], tuple[float, float, float, float], tuple[Union[tuple[float, float, float], str], float], tuple[tuple[float, float, float, float], float], None]) – The marker colors as used by matplotlib.

  • +
  • vmin (Optional[float]) – min value of data range that colormap covers as used by matplotlib.

  • +
  • vmax (Optional[float]) – max value of data range that colormap covers as used by matplotlib.

  • +
  • alpha (Optional[float]) – The alpha blending value as used by matplotlib.

  • +
  • cmap (UnionType[str, Colormap, None]) – The Colormap instance or registered colormap name as used by matplotlib.

  • +
  • ax (Optional[Axes]) – Axes to plot on. If None, a new figure with one Axes will be +created.

  • +
+
+
Return type:
+

PatchCollection | Any

+
+
Returns:
+

The matplotlib PathCollection object created by scatter.

+
+
+
+ +
+

Subpackages

+
+ +
+
+
+ + +
+
+ +
+
+
+
+ + + + \ No newline at end of file diff --git a/docs/py-modindex.html b/docs/py-modindex.html new file mode 100644 index 0000000..b1b1ad0 --- /dev/null +++ b/docs/py-modindex.html @@ -0,0 +1,167 @@ + + + + + + Python Module Index — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/docs/search.html b/docs/search.html new file mode 100644 index 0000000..2e5df90 --- /dev/null +++ b/docs/search.html @@ -0,0 +1,137 @@ + + + + + + Search — tno.quantum.problems.portfolio_optimization + + + + + + + + + + + + + + + + + + + + + +
+ + +
+ +
+
+
+
    +
  • + +
  • +
  • +
+
+
+
+
+ + + + +
+ +
+ +
+
+
+ +
+ +
+

© Copyright 2023-2024, TNO Quantum Code Lab.

+
+ + Built with Sphinx using a + theme + provided by Read the Docs. + + +
+
+
+
+
+ + + + + + + + + \ No newline at end of file diff --git a/docs/searchindex.js b/docs/searchindex.js new file mode 100644 index 0000000..30191d8 --- /dev/null +++ b/docs/searchindex.js @@ -0,0 +1 @@ +Search.setIndex({"docnames": ["index", "portfolio_optimization", "portfolio_optimization.components", "portfolio_optimization.components.io", "portfolio_optimization.components.postprocess", "portfolio_optimization.components.qubos", "portfolio_optimization.components.results", "portfolio_optimization.components.visualization"], "filenames": ["index.rst", "portfolio_optimization.rst", "portfolio_optimization.components.rst", "portfolio_optimization.components.io.rst", "portfolio_optimization.components.postprocess.rst", "portfolio_optimization.components.qubos.rst", "portfolio_optimization.components.results.rst", "portfolio_optimization.components.visualization.rst"], "titles": ["TNO Quantum", "portfolio_optimization package", "portfolio_optimization.components package", "portfolio_optimization.components.io module", "portfolio_optimization.components.postprocess module", "portfolio_optimization.components.qubos package", "portfolio_optimization.components.results module", "portfolio_optimization.components.visualization module"], "terms": {"provid": [0, 1, 2, 3, 5, 6], "gener": 0, "softwar": 0, "compon": [0, 1], "aim": 0, "facilit": 0, "develop": 0, "applic": 0, "real": 0, "world": 0, "invest": 0, "decis": 0, "involv": 0, "multipl": 0, "often": 0, "conflict": 0, "object": [0, 1, 2, 3, 4, 5, 6, 7], "need": [0, 2, 3, 5, 6], "balanc": 0, "primari": 0, "goal": 0, "typic": 0, "revolv": 0, "around": [0, 2, 4], "maxim": [0, 1, 2, 5], "return": [0, 1, 2, 3, 4, 5, 6, 7], "while": 0, "minim": [0, 1, 2, 5], "risk": 0, "At": 0, "same": 0, "time": [0, 1, 2, 5], "one": [0, 1, 2, 5, 6, 7], "might": 0, "want": 0, "requir": [0, 1, 2, 3, 4], "addit": 0, "constraint": [0, 1, 2, 5, 6], "demand": [0, 1], "minimum": [0, 1, 2, 4], "carbon": 0, "footprint": 0, "reduct": [0, 1, 2, 5], "find": 0, "i": [0, 1, 2, 3, 4, 5, 6, 7], "challeng": 0, "task": 0, "can": [0, 1, 2, 3, 5], "solv": [0, 1], "multi": [0, 1], "thi": [0, 1, 2, 3, 4, 5, 6, 7], "repositori": 0, "python": [0, 1], "code": [0, 1], "convert": [0, 1], "problem": [0, 1, 2, 5], "qubo": [0, 1, 2], "The": [0, 1, 2, 3, 4, 5, 7], "transform": [0, 1], "techniqu": [0, 1], "follow": [0, 1, 2, 3], "consid": [0, 1, 2, 6], "capit": [0, 1, 2, 3, 5], "indic": [0, 1], "roc": [0, 1, 2, 5, 6, 7], "diversif": [0, 1, 2, 6, 7], "herfindahl": [0, 1], "hirschman": [0, 1], "index": [0, 1], "hhi": [0, 1, 2, 5], "addition": [0, 1], "we": [0, 1], "allow": [0, 1, 2, 7], "growth": [0, 1, 2, 5, 6], "factor": [0, 1, 2, 5, 6], "arbitrari": [0, 1, 2, 5], "emiss": [0, 1, 2, 5, 6], "pareto": [0, 1, 2, 4, 7], "front": [0, 1, 2, 4, 7], "set": [0, 1, 2, 6], "solut": [0, 1, 2, 6], "where": [0, 1, 2, 5], "t": [0, 1], "improv": [0, 1], "without": [0, 1, 2, 5], "worsen": [0, 1], "other": [0, 1, 2, 3], "comput": [0, 1], "codebas": [0, 1], "base": [0, 1, 2, 3, 4, 5, 6], "paper": [0, 1], "aguilera": [0, 1], "et": [0, 1], "al": [0, 1], "optimis": [0, 1], "2024": [0, 1], "fund": 0, "research": 0, "wa": 0, "rabobank": 0, "sticht": 0, "tki": 0, "high": 0, "tech": 0, "system": 0, "materi": 0, "under": 0, "program": 0, "brightland": 0, "": [0, 1], "techrupt": 0, "modul": [0, 1, 2], "pip": 0, "portfolio_optim": 0, "here": 0, "an": [0, 1, 2, 5, 7], "how": [0, 2, 6], "portfoliooptim": [0, 1, 2], "class": [0, 1, 2, 3, 4, 5, 6], "defin": [0, 2, 3], "subsequ": 0, "simul": [0, 1], "sampler": [0, 1], "from": [0, 1, 2, 3], "d": [0, 1, 2, 4, 7], "wave": [0, 1, 2, 4], "import": [0, 1], "numpi": [0, 1, 2, 3], "np": [0, 1], "dwave": [0, 1], "simulatedannealingsampl": [0, 1], "choos": [0, 1], "sampler_kwarg": [0, 1], "num_read": [0, 1], "20": [0, 1], "num_sweep": [0, 1], "200": [0, 1], "up": [0, 1], "penalti": [0, 1, 2, 5], "coeffici": [0, 1], "lambdas1": [0, 1], "logspac": [0, 1], "16": [0, 1], "1": [0, 1, 2, 5, 6, 7], "25": [0, 1], "endpoint": [0, 1], "fals": [0, 1], "10": [0, 1], "0": [0, 1, 2, 5, 6], "lambdas2": [0, 1], "lambdas3": [0, 1], "arrai": [0, 1, 2, 3, 4], "creat": [0, 1, 2, 3, 4, 5, 7], "benchmark_dataset": [0, 1, 2, 3], "add_minimize_hhi": [0, 1, 2, 5], "weight": [0, 1], "add_maximize_roc": [0, 1, 2, 5], "formul": [0, 1, 2, 5], "weights_roc": [0, 1], "add_emission_constraint": [0, 1, 2, 5], "emission_now": [0, 1, 2, 5, 6], "emis_intens_now": [0, 1], "emission_futur": [0, 1, 2, 5, 6], "emis_intens_futur": [0, 1], "name": [0, 1, 2, 3, 5, 7], "result": [0, 1, 2], "run": [0, 1], "print": [0, 1, 2, 3], "head": [0, 1, 2, 6], "inspect": 0, "more": [0, 1], "detail": [0, 1], "look": 0, "panda": [0, 1, 2, 3], "datafram": [0, 1, 2, 3, 6], "results_df": [0, 2, 6], "altern": 0, "plot": [0, 1, 2, 7], "graph": 0, "first": [0, 2, 6], "slice": [0, 2, 6], "point": [0, 1, 2, 4, 5, 6, 7], "do": [0, 2, 6], "satisfi": [0, 2, 6], "method": [0, 2, 5], "slice_result": [0, 1, 2, 6], "note": 0, "individu": 0, "plot_point": [0, 1, 2, 7], "plot_front": [0, 1, 2, 7], "matplotlib": [0, 1, 2, 7], "pyplot": 0, "plt": 0, "x1": 0, "y1": 0, "x2": 0, "y2": 0, "fig": 0, "ax1": 0, "ax2": 0, "subplot": 0, "ncol": 0, "2": [0, 1, 2, 4, 5, 6], "figsiz": 0, "12": 0, "5": [0, 2, 6], "color": [0, 1, 2, 7], "orang": 0, "label": [0, 1, 2, 7], "met": 0, "ax": [0, 1, 2, 7], "green": 0, "set_titl": 0, "tight_layout": 0, "show": [0, 2, 4], "elabor": 0, "found": [0, 1], "our": 0, "via": 0, "excel": 0, "file": 0, "csv": 0, "json": 0, "contain": [0, 1, 2, 3, 4, 5, 6, 7], "least": [0, 2, 3, 4, 6], "column": [0, 1, 2, 3, 5, 6], "asset": [0, 1, 2, 3, 4, 5], "outstanding_now": [0, 2, 3], "current": [0, 1, 2, 3, 5], "outstand": [0, 1, 2, 3, 4, 5, 6], "amount": [0, 1, 2, 3, 4, 5, 6], "per": [0, 2, 3], "min_outstanding_futur": [0, 2, 3], "lower": [0, 2, 3, 5], "bound": [0, 2, 3, 5], "futur": [0, 1, 2, 3, 4, 5, 6], "max_outstanding_futur": [0, 2, 3], "upper": [0, 2, 3, 4, 5], "income_now": [0, 2, 3], "incom": [0, 2, 3], "correspond": [0, 1, 2, 3, 4, 5], "multipli": [0, 2, 3], "regcap_now": [0, 2, 3], "regulatori": [0, 1, 2, 3, 5], "tabl": 0, "below": 0, "correct": 0, "structur": 0, "present": [0, 2, 3], "ar": [0, 1, 2, 3, 4, 5, 6], "some": 0, "function": [0, 1, 2, 6], "sector": 0, "countri": 0, "14": 0, "19": 0, "600": 0, "473": 0, "528": 0, "70": 0, "40": 0, "3": 0, "24": 0, "28": 0, "4": 0, "800": 0, "1090": 0, "1410": 0, "56": 0, "74": 0, "291": 0, "397": 0, "If": [0, 1, 2, 3, 4, 5, 7], "datafil": 0, "all": [0, 1, 2, 4, 5, 6], "inform": [0, 1, 2, 3], "ha": [0, 1], "differ": [0, 1, 2, 3, 4, 5, 6], "possibl": [0, 1], "renam": [0, 1, 2, 3], "alter": 0, "document": [0, 1, 2, 7], "portfoliodata": [0, 1, 2, 3, 4, 5, 6], "By": [0, 1, 2, 6], "default": [0, 1, 2, 3, 6, 7], "ani": [0, 1, 2, 3, 4, 5, 6, 7], "howev": 0, "support": 0, "initialis": 0, "100": 0, "micro": 0, "second": [0, 2, 5], "sampl": [0, 2, 4, 6], "assum": [0, 1, 2, 5], "proper": 0, "configur": 0, "setup": 0, "api": 0, "dwavesampl": 0, "lazyfixedembeddingcomposit": 0, "qpu": 0, "annealing_tim": 0, "refer": 0, "usag": [0, 1], "argument": [0, 1, 2, 3, 5], "content": 0, "mai": 0, "sole": 0, "compli": 0, "intern": 0, "export": 0, "control": 0, "law": 0, "portfolio": [1, 2, 3, 4, 5, 6], "optim": [1, 2, 3, 4, 5], "us": [1, 2, 3, 4, 5, 7], "quantum": 1, "anneal": 1, "portfolio_data": [1, 2, 4, 5, 6], "k": [1, 2, 4, 5], "columns_renam": [1, 2, 3], "none": [1, 2, 3, 5, 6, 7], "sourc": [1, 2, 3, 4, 5, 6, 7], "which": [1, 2, 5], "ad": [1, 2, 5], "increas": [1, 2, 6], "type": [1, 2, 3, 4, 5, 6, 7], "exampl": [1, 2, 3, 6], "tno": 1, "__init__": [1, 2, 3, 4, 5, 6], "init": [1, 2, 4, 5, 6], "paramet": [1, 2, 3, 4, 5, 6, 7], "str": [1, 2, 3, 5, 6, 7], "path": [1, 2, 3], "data": [1, 2, 3, 4, 6, 7], "repres": [1, 2, 4, 5], "store": [1, 2, 3, 6], "see": [1, 2, 5, 7], "docstr": 1, "input": [1, 2, 6], "convent": 1, "int": [1, 2, 3, 4, 5, 6, 7], "number": [1, 2, 4, 5, 6], "bit": [1, 2, 4, 5], "each": [1, 2, 4, 5, 6], "A": [1, 2, 4, 5], "fix": [1, 2, 4, 5], "represent": [1, 2, 3, 4, 5], "equidist": [1, 2, 4, 5], "valu": [1, 2, 3, 4, 5, 7], "rang": [1, 2, 4, 5, 7], "lb_i": [1, 2, 4, 5], "ub_i": [1, 2, 4, 5], "column_renam": [1, 2, 3], "rais": [1, 2, 3, 5, 6], "typeerror": 1, "wrong": 1, "reduction_percentage_target": [1, 2, 5, 6], "7": [1, 2, 5], "add": [1, 2, 5, 6], "given": [1, 2, 5, 6, 7], "frac": [1, 2, 5], "sum_": [1, 2, 5], "nf_i": [1, 2, 5], "cdot": [1, 2, 5], "x_i": [1, 2, 5], "n": [1, 2, 5, 6], "g_e": [1, 2, 5], "ne_i": [1, 2, 5], "y_i": [1, 2, 5], "total": [1, 2, 5], "e_i": [1, 2, 5], "intens": [1, 2, 5], "f_i": [1, 2, 5], "expect": [1, 2, 3, 5], "target": [1, 2, 5, 6], "rel": [1, 2, 5, 6], "filenam": [1, 2, 3], "lambda": [1, 2, 5], "For": [1, 2, 5, 7], "doc": [1, 2, 5], "qubofactori": [1, 2, 5], "calc_emission_constraint": [1, 2, 5], "dataset": [1, 2, 3, 5, 6], "variabl": [1, 2, 5], "option": [1, 2, 5, 6, 7], "constant": [1, 2, 5], "over": [1, 2, 5], "e": [1, 2, 5], "float": [1, 2, 5, 6, 7], "percentag": [1, 2, 5, 6], "df": 1, "arraylik": [1, 2, 4, 7], "add_growth_factor_constraint": [1, 2, 5], "growth_target": [1, 2, 5], "g_c": [1, 2, 5], "onli": [1, 2, 4], "onc": 1, "calc_growth_factor_constraint": [1, 2, 5], "valueerror": [1, 2, 3, 6], "been": 1, "befor": 1, "ancilla_vari": [1, 2, 5], "weights_stabil": 1, "x": [1, 2, 4, 5, 7], "r_i": [1, 2, 5], "c_i": [1, 2, 5], "As": 1, "quadrat": 1, "approxim": 1, "two": [1, 2, 6], "roc_1": 1, "term": [1, 2, 5], "scale": [1, 2, 5], "roc_2": 1, "c_": 1, "21": 1, "In": 1, "equal": 1, "estim": 1, "ancilla": [1, 2, 5], "sum": 1, "stabil": [1, 2, 5], "extra": 1, "both": 1, "accordingli": 1, "being": 1, "ancillari": [1, 2, 5], "relev": 1, "invalid": 1, "left": [1, 2, 5], "j": [1, 2, 5], "x_j": [1, 2, 5], "right": [1, 2, 4, 5], "non": 1, "calc_minimize_hhi": [1, 2, 5], "verbos": 1, "true": [1, 2, 4], "instanc": [1, 2, 5, 7], "ocean": 1, "dict": [1, 2, 3], "specif": 1, "kei": [1, 2, 3], "word": 1, "bool": [1, 2, 3, 4, 7], "dure": 1, "execut": 1, "diversification_valu": [1, 2, 7], "roc_valu": [1, 2, 7], "c": [1, 2, 5, 7], "vmin": [1, 2, 7], "vmax": [1, 2, 7], "alpha": [1, 2, 7], "cmap": [1, 2, 7], "y": [1, 2, 4, 7], "overview": [1, 2, 7], "assign": [1, 2, 7], "legend": [1, 2, 7], "union": [1, 2, 7], "_supportsarrai": [1, 2, 7], "dtype": [1, 2, 3, 4, 5, 6, 7], "_nestedsequ": [1, 2, 7], "complex": [1, 2, 7], "byte": [1, 2, 7], "sequenc": [1, 2, 7], "tupl": [1, 2, 4, 5, 6, 7], "marker": [1, 2, 7], "min": [1, 2, 7], "colormap": [1, 2, 7], "cover": [1, 2, 7], "max": [1, 2, 7], "blend": [1, 2, 7], "uniontyp": [1, 2, 7], "regist": [1, 2, 7], "new": [1, 2, 3, 6, 7], "figur": [1, 2, 7], "patchcollect": [1, 2, 7], "pathcollect": [1, 2, 7], "scatter": [1, 2, 7], "decod": [1, 2, 4], "decode_sampl": [1, 2, 4], "decode_sampleset": [1, 2, 4], "__contains__": [1, 2, 3], "__len__": [1, 2, 3, 6], "__repr__": [1, 2, 3], "__str__": [1, 2, 3], "from_fil": [1, 2, 3], "get_capit": [1, 2, 3], "get_column": [1, 2, 3], "get_incom": [1, 2, 3], "get_l_bound": [1, 2, 3], "get_outstanding_now": [1, 2, 3], "get_return": [1, 2, 3], "get_u_bound": [1, 2, 3], "print_portfolio_info": [1, 2, 3], "qubocompil": [1, 2, 5], "compil": [1, 2, 5], "make_qubo": [1, 2, 5], "calc_maximize_roc1": [1, 2, 5], "calc_maximize_roc2": [1, 2, 5], "calc_stabilize_c": [1, 2, 5], "add_result": [1, 2, 6], "drop_dupl": [1, 2, 6], "pareto_front": [1, 2, 4], "io": [1, 2], "postprocess": [1, 2], "visual": [1, 2], "sampleset": [2, 4], "oustanding_futur": [2, 4], "map": [2, 4], "ndarrai": [2, 3, 4, 5, 6], "float64": [2, 3, 4, 5, 6], "effici": [2, 4], "matrix": [2, 4, 5], "row": [2, 4, 6], "portfolio_datafram": [2, 3], "check": [2, 3], "part": [2, 3], "outstanding_now_now": [2, 3], "dictionari": [2, 3], "replac": [2, 3], "outstanding_2021": [2, 3], "length": [2, 3], "debug": [2, 3], "string": [2, 3], "classmethod": [2, 3], "read": [2, 3], "instead": [2, 3], "benchmark": [2, 3], "52": [2, 3], "typevar": [2, 3, 5], "portfoliodatat": [2, 3], "get": [2, 3], "column_nam": [2, 3], "specifi": [2, 3], "l_bound": [2, 3], "u_bound": [2, 3], "about": [2, 3, 5], "termin": [2, 3], "conveni": [2, 5], "interfac": [2, 5], "combin": [2, 5], "worri": [2, 5], "size": [2, 5], "list": [2, 5, 6], "varieti": [2, 5], "prefer": [2, 5], "qubocompilert": [2, 5], "self": [2, 5, 6], "chosen": [2, 5], "integ": [2, 5], "pick": [2, 5], "well": [2, 5], "must": [2, 5], "make": [2, 5], "entir": [2, 5], "offset": [2, 5], "factori": [2, 5], "construct": [2, 5], "intermedi": [2, 5], "matric": [2, 5], "calcul": [2, 4, 5], "variant": [2, 5], "x_": [2, 5], "binari": [2, 5], "keyerror": [2, 5], "its": [2, 5], "g": [2, 5], "g_": [2, 5], "inv": [2, 5], "g_j": [2, 5], "provided_emission_constraint": [2, 6], "provided_growth_target": [2, 6], "element": [2, 6], "otherwis": [2, 6], "outstanding_future_sampl": [2, 6], "outstanding_futur": [2, 6], "drop": [2, 6], "duplic": [2, 6], "selected_column": [2, 6], "toler": [2, 6], "helper": [2, 6], "group": [2, 6], "those": [2, 6], "violat": [2, 6], "strict": [2, 6], "desir": [2, 6], "rate": [2, 6], "05": [2, 6], "15": [2, 6], "coordin": [2, 6], "when": [2, 6], "xval": [2, 4], "yval": [2, 4], "min_point": [2, 4], "50": [2, 4], "upper_right_quadr": [2, 4], "repeatedli": [2, 4], "convex": [2, 4], "hull": [2, 4], "select": [2, 4], "quadrant": [2, 4], "implement": [3, 4], "o": 3, "post": 4, "process": 4, "step": 4, "subpackag": 5, "relat": 5, "tool": 7}, "objects": {"": [[1, 0, 0, "-", "portfolio_optimization"]], "portfolio_optimization": [[1, 1, 1, "", "PortfolioOptimizer"], [2, 0, 0, "-", "components"], [1, 3, 1, "", "plot_front"], [1, 3, 1, "", "plot_points"]], "portfolio_optimization.PortfolioOptimizer": [[1, 2, 1, "", "__init__"], [1, 2, 1, "", "add_emission_constraint"], [1, 2, 1, "", "add_growth_factor_constraint"], [1, 2, 1, "", "add_maximize_roc"], [1, 2, 1, "", "add_minimize_hhi"], [1, 2, 1, "", "run"]], "portfolio_optimization.components": [[2, 1, 1, "", "Decoder"], [2, 1, 1, "", "PortfolioData"], [2, 1, 1, "", "QuboCompiler"], [2, 1, 1, "", "QuboFactory"], [2, 1, 1, "", "Results"], [3, 0, 0, "-", "io"], [2, 3, 1, "", "pareto_front"], [2, 3, 1, "", "plot_front"], [2, 3, 1, "", "plot_points"], [4, 0, 0, "-", "postprocess"], [5, 0, 0, "-", "qubos"], [6, 0, 0, "-", "results"], [7, 0, 0, "-", "visualization"]], "portfolio_optimization.components.Decoder": [[2, 2, 1, "", "__init__"], [2, 2, 1, "", "decode_sample"], [2, 2, 1, "", "decode_sampleset"]], "portfolio_optimization.components.PortfolioData": [[2, 2, 1, "", "__contains__"], [2, 2, 1, "", "__init__"], [2, 2, 1, "", "__len__"], [2, 2, 1, "", "__repr__"], [2, 2, 1, "", "__str__"], [2, 2, 1, "", "from_file"], [2, 2, 1, "", "get_capital"], [2, 2, 1, "", "get_column"], [2, 2, 1, "", "get_income"], [2, 2, 1, "", "get_l_bound"], [2, 2, 1, "", "get_outstanding_now"], [2, 2, 1, "", "get_returns"], [2, 2, 1, "", "get_u_bound"], [2, 2, 1, "", "print_portfolio_info"]], "portfolio_optimization.components.QuboCompiler": [[2, 2, 1, "", "__init__"], [2, 2, 1, "", "add_emission_constraint"], [2, 2, 1, "", "add_growth_factor_constraint"], [2, 2, 1, "", "add_maximize_roc"], [2, 2, 1, "", "add_minimize_hhi"], [2, 2, 1, "", "compile"], [2, 2, 1, "", "make_qubo"]], "portfolio_optimization.components.QuboFactory": [[2, 2, 1, "", "__init__"], [2, 2, 1, "", "calc_emission_constraint"], [2, 2, 1, "", "calc_growth_factor_constraint"], [2, 2, 1, "", "calc_maximize_roc1"], [2, 2, 1, "", "calc_maximize_roc2"], [2, 2, 1, "", "calc_minimize_hhi"], [2, 2, 1, "", "calc_stabilize_c"]], "portfolio_optimization.components.Results": [[2, 2, 1, "", "__init__"], [2, 2, 1, "", "__len__"], [2, 2, 1, "", "add_result"], [2, 2, 1, "", "drop_duplicates"], [2, 2, 1, "", "head"], [2, 2, 1, "", "slice_results"]], "portfolio_optimization.components.io": [[3, 1, 1, "", "PortfolioData"]], "portfolio_optimization.components.io.PortfolioData": [[3, 2, 1, "", "__contains__"], [3, 2, 1, "", "__init__"], [3, 2, 1, "", "__len__"], [3, 2, 1, "", "__repr__"], [3, 2, 1, "", "__str__"], [3, 2, 1, "", "from_file"], [3, 2, 1, "", "get_capital"], [3, 2, 1, "", "get_column"], [3, 2, 1, "", "get_income"], [3, 2, 1, "", "get_l_bound"], [3, 2, 1, "", "get_outstanding_now"], [3, 2, 1, "", "get_returns"], [3, 2, 1, "", "get_u_bound"], [3, 2, 1, "", "print_portfolio_info"]], "portfolio_optimization.components.postprocess": [[4, 1, 1, "", "Decoder"], [4, 3, 1, "", "pareto_front"]], "portfolio_optimization.components.postprocess.Decoder": [[4, 2, 1, "", "__init__"], [4, 2, 1, "", "decode_sample"], [4, 2, 1, "", "decode_sampleset"]], "portfolio_optimization.components.qubos": [[5, 1, 1, "", "QuboCompiler"], [5, 1, 1, "", "QuboFactory"]], "portfolio_optimization.components.qubos.QuboCompiler": [[5, 2, 1, "", "__init__"], [5, 2, 1, "", "add_emission_constraint"], [5, 2, 1, "", "add_growth_factor_constraint"], [5, 2, 1, "", "add_maximize_roc"], [5, 2, 1, "", "add_minimize_hhi"], [5, 2, 1, "", "compile"], [5, 2, 1, "", "make_qubo"]], "portfolio_optimization.components.qubos.QuboFactory": [[5, 2, 1, "", "__init__"], [5, 2, 1, "", "calc_emission_constraint"], [5, 2, 1, "", "calc_growth_factor_constraint"], [5, 2, 1, "", "calc_maximize_roc1"], [5, 2, 1, "", "calc_maximize_roc2"], [5, 2, 1, "", "calc_minimize_hhi"], [5, 2, 1, "", "calc_stabilize_c"]], "portfolio_optimization.components.results": [[6, 1, 1, "", "Results"]], "portfolio_optimization.components.results.Results": [[6, 2, 1, "", "__init__"], [6, 2, 1, "", "__len__"], [6, 2, 1, "", "add_result"], [6, 2, 1, "", "drop_duplicates"], [6, 2, 1, "", "head"], [6, 2, 1, "", "slice_results"]], "portfolio_optimization.components.visualization": [[7, 3, 1, "", "plot_front"], [7, 3, 1, "", "plot_points"]]}, "objtypes": {"0": "py:module", "1": "py:class", "2": "py:method", "3": "py:function"}, "objnames": {"0": ["py", "module", "Python module"], "1": ["py", "class", "Python class"], "2": ["py", "method", "Python method"], "3": ["py", "function", "Python function"]}, "titleterms": {"tno": 0, "quantum": 0, "portfolio": 0, "optim": 0, "quick": 0, "instal": 0, "exampl": 0, "data": 0, "input": 0, "dataset": 0, "us": 0, "anneal": 0, "solver": 0, "end": 0, "limit": 0, "portfolio_optim": [1, 2, 3, 4, 5, 6, 7], "packag": [1, 2, 5], "subpackag": [1, 2], "compon": [2, 3, 4, 5, 6, 7], "io": 3, "modul": [3, 4, 6, 7], "postprocess": 4, "qubo": 5, "result": 6, "visual": 7}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 8, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.intersphinx": 1, "sphinx.ext.viewcode": 1, "sphinx": 57}, "alltitles": {"TNO Quantum": [[0, "tno-quantum"]], "Portfolio optimization": [[0, "portfolio-optimization"]], "Quick Install": [[0, "quick-install"]], "Examples": [[0, "examples"]], "Data input": [[0, "data-input"]], "Example Dataset": [[0, "id1"]], "Using Quantum Annealing Solvers": [[0, "using-quantum-annealing-solvers"]], "(End)use Limitations": [[0, "end-use-limitations"]], "portfolio_optimization package": [[1, "module-portfolio_optimization"]], "Subpackages": [[1, "subpackages"], [2, "subpackages"]], "portfolio_optimization.components package": [[2, "module-portfolio_optimization.components"]], "portfolio_optimization.components.io module": [[3, "module-portfolio_optimization.components.io"]], "portfolio_optimization.components.postprocess module": [[4, "module-portfolio_optimization.components.postprocess"]], "portfolio_optimization.components.qubos package": [[5, "module-portfolio_optimization.components.qubos"]], "portfolio_optimization.components.results module": [[6, "module-portfolio_optimization.components.results"]], "portfolio_optimization.components.visualization module": [[7, "module-portfolio_optimization.components.visualization"]]}, "indexentries": {"portfoliooptimizer (class in portfolio_optimization)": [[1, "portfolio_optimization.PortfolioOptimizer"]], "__init__() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.__init__"]], "add_emission_constraint() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.add_emission_constraint"]], "add_growth_factor_constraint() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.add_growth_factor_constraint"]], "add_maximize_roc() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.add_maximize_roc"]], "add_minimize_hhi() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.add_minimize_hhi"]], "module": [[1, "module-portfolio_optimization"], [2, "module-portfolio_optimization.components"], [3, "module-portfolio_optimization.components.io"], [4, "module-portfolio_optimization.components.postprocess"], [5, "module-portfolio_optimization.components.qubos"], [6, "module-portfolio_optimization.components.results"], [7, "module-portfolio_optimization.components.visualization"]], "plot_front() (in module portfolio_optimization)": [[1, "portfolio_optimization.plot_front"]], "plot_points() (in module portfolio_optimization)": [[1, "portfolio_optimization.plot_points"]], "portfolio_optimization": [[1, "module-portfolio_optimization"]], "run() (portfolio_optimization.portfoliooptimizer method)": [[1, "portfolio_optimization.PortfolioOptimizer.run"]], "decoder (class in portfolio_optimization.components)": [[2, "portfolio_optimization.components.Decoder"]], "portfoliodata (class in portfolio_optimization.components)": [[2, "portfolio_optimization.components.PortfolioData"]], "qubocompiler (class in portfolio_optimization.components)": [[2, "portfolio_optimization.components.QuboCompiler"]], "qubofactory (class in portfolio_optimization.components)": [[2, "portfolio_optimization.components.QuboFactory"]], "results (class in portfolio_optimization.components)": [[2, "portfolio_optimization.components.Results"]], "__contains__() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.__contains__"]], "__init__() (portfolio_optimization.components.decoder method)": [[2, "portfolio_optimization.components.Decoder.__init__"]], "__init__() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.__init__"]], "__init__() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.__init__"]], "__init__() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.__init__"]], "__init__() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.__init__"]], "__len__() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.__len__"]], "__len__() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.__len__"]], "__repr__() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.__repr__"]], "__str__() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.__str__"]], "add_emission_constraint() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.add_emission_constraint"]], "add_growth_factor_constraint() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.add_growth_factor_constraint"]], "add_maximize_roc() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.add_maximize_roc"]], "add_minimize_hhi() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.add_minimize_hhi"]], "add_result() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.add_result"]], "calc_emission_constraint() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_emission_constraint"]], "calc_growth_factor_constraint() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_growth_factor_constraint"]], "calc_maximize_roc1() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_maximize_roc1"]], "calc_maximize_roc2() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_maximize_roc2"]], "calc_minimize_hhi() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_minimize_hhi"]], "calc_stabilize_c() (portfolio_optimization.components.qubofactory method)": [[2, "portfolio_optimization.components.QuboFactory.calc_stabilize_c"]], "compile() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.compile"]], "decode_sample() (portfolio_optimization.components.decoder method)": [[2, "portfolio_optimization.components.Decoder.decode_sample"]], "decode_sampleset() (portfolio_optimization.components.decoder method)": [[2, "portfolio_optimization.components.Decoder.decode_sampleset"]], "drop_duplicates() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.drop_duplicates"]], "from_file() (portfolio_optimization.components.portfoliodata class method)": [[2, "portfolio_optimization.components.PortfolioData.from_file"]], "get_capital() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_capital"]], "get_column() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_column"]], "get_income() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_income"]], "get_l_bound() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_l_bound"]], "get_outstanding_now() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_outstanding_now"]], "get_returns() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_returns"]], "get_u_bound() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.get_u_bound"]], "head() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.head"]], "make_qubo() (portfolio_optimization.components.qubocompiler method)": [[2, "portfolio_optimization.components.QuboCompiler.make_qubo"]], "pareto_front() (in module portfolio_optimization.components)": [[2, "portfolio_optimization.components.pareto_front"]], "plot_front() (in module portfolio_optimization.components)": [[2, "portfolio_optimization.components.plot_front"]], "plot_points() (in module portfolio_optimization.components)": [[2, "portfolio_optimization.components.plot_points"]], "portfolio_optimization.components": [[2, "module-portfolio_optimization.components"]], "print_portfolio_info() (portfolio_optimization.components.portfoliodata method)": [[2, "portfolio_optimization.components.PortfolioData.print_portfolio_info"]], "slice_results() (portfolio_optimization.components.results method)": [[2, "portfolio_optimization.components.Results.slice_results"]], "portfoliodata (class in portfolio_optimization.components.io)": [[3, "portfolio_optimization.components.io.PortfolioData"]], "__contains__() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.__contains__"]], "__init__() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.__init__"]], "__len__() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.__len__"]], "__repr__() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.__repr__"]], "__str__() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.__str__"]], "from_file() (portfolio_optimization.components.io.portfoliodata class method)": [[3, "portfolio_optimization.components.io.PortfolioData.from_file"]], "get_capital() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_capital"]], "get_column() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_column"]], "get_income() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_income"]], "get_l_bound() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_l_bound"]], "get_outstanding_now() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_outstanding_now"]], "get_returns() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_returns"]], "get_u_bound() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.get_u_bound"]], "portfolio_optimization.components.io": [[3, "module-portfolio_optimization.components.io"]], "print_portfolio_info() (portfolio_optimization.components.io.portfoliodata method)": [[3, "portfolio_optimization.components.io.PortfolioData.print_portfolio_info"]], "decoder (class in portfolio_optimization.components.postprocess)": [[4, "portfolio_optimization.components.postprocess.Decoder"]], "__init__() (portfolio_optimization.components.postprocess.decoder method)": [[4, "portfolio_optimization.components.postprocess.Decoder.__init__"]], "decode_sample() (portfolio_optimization.components.postprocess.decoder method)": [[4, "portfolio_optimization.components.postprocess.Decoder.decode_sample"]], "decode_sampleset() (portfolio_optimization.components.postprocess.decoder method)": [[4, "portfolio_optimization.components.postprocess.Decoder.decode_sampleset"]], "pareto_front() (in module portfolio_optimization.components.postprocess)": [[4, "portfolio_optimization.components.postprocess.pareto_front"]], "portfolio_optimization.components.postprocess": [[4, "module-portfolio_optimization.components.postprocess"]], "qubocompiler (class in portfolio_optimization.components.qubos)": [[5, "portfolio_optimization.components.qubos.QuboCompiler"]], "qubofactory (class in portfolio_optimization.components.qubos)": [[5, "portfolio_optimization.components.qubos.QuboFactory"]], "__init__() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.__init__"]], "__init__() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.__init__"]], "add_emission_constraint() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.add_emission_constraint"]], "add_growth_factor_constraint() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.add_growth_factor_constraint"]], "add_maximize_roc() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.add_maximize_roc"]], "add_minimize_hhi() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.add_minimize_hhi"]], "calc_emission_constraint() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_emission_constraint"]], "calc_growth_factor_constraint() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_growth_factor_constraint"]], "calc_maximize_roc1() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_maximize_roc1"]], "calc_maximize_roc2() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_maximize_roc2"]], "calc_minimize_hhi() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_minimize_hhi"]], "calc_stabilize_c() (portfolio_optimization.components.qubos.qubofactory method)": [[5, "portfolio_optimization.components.qubos.QuboFactory.calc_stabilize_c"]], "compile() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.compile"]], "make_qubo() (portfolio_optimization.components.qubos.qubocompiler method)": [[5, "portfolio_optimization.components.qubos.QuboCompiler.make_qubo"]], "portfolio_optimization.components.qubos": [[5, "module-portfolio_optimization.components.qubos"]], "results (class in portfolio_optimization.components.results)": [[6, "portfolio_optimization.components.results.Results"]], "__init__() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.__init__"]], "__len__() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.__len__"]], "add_result() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.add_result"]], "drop_duplicates() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.drop_duplicates"]], "head() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.head"]], "portfolio_optimization.components.results": [[6, "module-portfolio_optimization.components.results"]], "slice_results() (portfolio_optimization.components.results.results method)": [[6, "portfolio_optimization.components.results.Results.slice_results"]], "plot_front() (in module portfolio_optimization.components.visualization)": [[7, "portfolio_optimization.components.visualization.plot_front"]], "plot_points() (in module portfolio_optimization.components.visualization)": [[7, "portfolio_optimization.components.visualization.plot_points"]], "portfolio_optimization.components.visualization": [[7, "module-portfolio_optimization.components.visualization"]]}}) \ No newline at end of file diff --git a/images_for_docs/example.png b/images_for_docs/example.png new file mode 100644 index 0000000..b983bd4 Binary files /dev/null and b/images_for_docs/example.png differ diff --git a/pyproject.toml b/pyproject.toml new file mode 100644 index 0000000..a86dd49 --- /dev/null +++ b/pyproject.toml @@ -0,0 +1,21 @@ +[build-system] +requires = [ "setuptools >= 67.1", "wheel"] +build-backend = "setuptools.build_meta" + +[tool.tbump] + +[tool.tbump.version] +current = "1.0.0" +regex = ''' +\d+\.\d+\.\d+(-(.*))? +''' + +[tool.tbump.git] +message_template = "Bump to {new_version}" +tag_template = "v{new_version}" + +[[tool.tbump.file]] +src = "pyproject.toml" + +[[tool.tbump.file]] +src = "tno/quantum/problems/portfolio_optimization/__init__.py" diff --git a/setup.cfg b/setup.cfg new file mode 100644 index 0000000..95631d7 --- /dev/null +++ b/setup.cfg @@ -0,0 +1,71 @@ +[metadata] +name = tno.quantum.problems.portfolio_optimization +author = TNO Quantum +author_email = tnoquantum@tno.nl +maintainer = TNO Quantum +maintainer_email = tnoquantum@tno.nl +description = Quantum Computing based Portfolio Optimization +classifiers = + License :: OSI Approved :: Apache Software License + Programming Language :: Python :: 3 + Programming Language :: Python :: 3.8 + Programming Language :: Python :: 3.9 + Programming Language :: Python :: 3.10 + Programming Language :: Python :: 3.11 + Programming Language :: Python :: 3.12 + Operating System :: OS Independent + Intended Audience :: Developers + Intended Audience :: Information Technology + Intended Audience :: Science/Research + Typing :: Typed +license = Apache License, Version 2.0 +license_file = LICENSE +platform = any +python_requires = >=3.8 +keywords = + TNO + Quantum + Portfolio Optimization + Quantum Annealing +url = https://tno.nl +download_url = https://pypi.org/project/tno.quantum.problems.portfolio_optimization/#files +project_urls = + Documentation = https://tno-quantum.github.io/problems.portfolio_optimization/ + Source Code = https://github.com/TNO-Quantum/problems.portfolio_optimization +version = attr: tno.quantum.problems.portfolio_optimization.__version__ +long_description_content_type = text/markdown +long_description = file: README.md + +[options] +packages = + tno.quantum.problems.portfolio_optimization + tno.quantum.problems.portfolio_optimization.components + tno.quantum.problems.portfolio_optimization.components.qubos + tno.quantum.problems.portfolio_optimization.datasets + tno.quantum.problems.portfolio_optimization.test +zip_safe = False +install_requires = + numpy>=1.21.6 + dimod>=0.12.13 + matplotlib>=3.0.0 + pandas>=2.0.3 + openpyxl>=3.1.2 + tqdm>=4.66.1 + scipy>=1.2.1 + dwave_samplers>=1.2.0 +namespace_packages = + tno + tno.quantum + tno.quantum.problems + +[options.extras_require] +quantum = + dwave_system>=1.21.0 +tests = + pytest~=8.1.1 + pytest_cov~=4.1.0 + +[options.package_data] +tno.quantum.problems.portfolio_optimization = py.typed +tno.quantum.problems.portfolio_optimization.datasets = benchmark_dataset.xlsx + diff --git a/tno/quantum/problems/portfolio_optimization/__init__.py b/tno/quantum/problems/portfolio_optimization/__init__.py index a3149a4..23deb01 100644 --- a/tno/quantum/problems/portfolio_optimization/__init__.py +++ b/tno/quantum/problems/portfolio_optimization/__init__.py @@ -15,12 +15,20 @@ The codebase is based on the following paper: -- Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2023) +- `Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2024)`_ +.. _Aguilera et al., - Multi-objective Portfolio Optimisation Using the Quantum Annealer (2024): https://www.mdpi.com/2227-7390/12/9/1291 .. _Pareto front: https://en.wikipedia.org/wiki/Pareto_front .. _QUBO: https://en.wikipedia.org/wiki/Quadratic_unconstrained_binary_optimization""" +from tno.quantum.problems.portfolio_optimization._portfolio_optimizer import ( + PortfolioOptimizer, +) +from tno.quantum.problems.portfolio_optimization.components import ( + plot_front, + plot_points, +) -__all__ = [] +__all__ = ["PortfolioOptimizer", "plot_front", "plot_points"] -__version__ = "dev" +__version__ = "1.0.0" diff --git a/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.py b/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.py new file mode 100644 index 0000000..65d968b --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/_portfolio_optimizer.py @@ -0,0 +1,448 @@ +"""This module contains the ``PortfolioOptimizer`` class.""" +from __future__ import annotations + +import itertools +import math +from datetime import datetime +from pathlib import Path +from typing import Any + +import numpy as np +from dimod.core.sampler import Sampler +from dwave.samplers import SimulatedAnnealingSampler +from numpy.typing import ArrayLike, NDArray +from pandas import DataFrame +from tqdm import tqdm + +from tno.quantum.problems.portfolio_optimization.components import ( + Decoder, + PortfolioData, + QuboCompiler, + Results, +) + + +class PortfolioOptimizer: + """The ``PortfolioOptimizer`` class is used to convert multi-objective portfolio + optimization problems into QUBO problems which can then be solved using QUBO solving + techniques such as simulated or quantum annealing. + + The following objectives can be considered + + - `return on capital`, indicated by ROC, + - `diversification`, indicated by the `Herfindahl-Hirschman Index`_ HHI. + + The following constraints can be added + + - `capital growth`, demand a minimum increase in outstanding assets. + - `emission reduction`, demand a minimum reduction for an arbitrary emission type. + + Usage example: + + .. code-block:: + + import numpy as np + from dwave.samplers import SimulatedAnnealingSampler + + from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + + # Choose sampler for solving qubo + sampler = SimulatedAnnealingSampler() + sampler_kwargs = {"num_reads": 20, "num_sweeps": 200} + + # Set up penalty coefficients for the constraints + lambdas1 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas2 = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + lambdas3 = np.array([1]) + + # Create portfolio optimization problem + portfolio_optimizer = PortfolioOptimizer("benchmark_dataset") + portfolio_optimizer.add_minimize_hhi(weights=lambdas1) + portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=lambdas1) + portfolio_optimizer.add_emission_constraint( + weights=lambdas3, + emission_now="emis_intens_now", + emission_future="emis_intens_future", + name="emission", + ) + + # Solve the portfolio optimization problem + results = portfolio_optimizer.run(sampler, sampler_kwargs) + print(results.head()) + + .. _Herfindahl-Hirschman Index: https://nl.wikipedia.org/wiki/Herfindahl-index + """ + + def __init__( + self, + portfolio_data: PortfolioData | DataFrame | str | Path, + k: int = 2, + columns_rename: dict[str, str] | None = None, + ) -> None: + """Init ``PortfolioOptimizer``. + + Args: + portfolio_data: Portfolio data represented by a ``PortfolioData`` object, + a pandas ``DataFrame`` or a path to where portfolio data is stored. See + the docstring of + :py:class:`~portfolio_optimization.components.io.PortfolioData` for data + input conventions. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + column_rename: can be used to rename data columns. See the docstring of + :py:class:`~portfolio_optimization.components.io.PortfolioData` for + example. + + Raises: + TypeError: If the provided ``portfolio_data`` input has the wrong type. + """ + if isinstance(portfolio_data, PortfolioData): + self.portfolio_data = portfolio_data + elif isinstance(portfolio_data, DataFrame): + self.portfolio_data = PortfolioData(portfolio_data, columns_rename) + elif isinstance(portfolio_data, (Path, str)): + self.portfolio_data = PortfolioData.from_file( + portfolio_data, columns_rename + ) + else: + raise TypeError( + "`portfolio_data` must be of type `PortfolioData`, `DataFrame`, `Path` " + f"or `str`, but was of type {type(portfolio_data)}" + ) + self._qubo_compiler = QuboCompiler(self.portfolio_data, k) + self.decoder = Decoder(self.portfolio_data, k) + self._all_lambdas: list[NDArray[np.float_]] = [] + self._provided_emission_constraints: list[tuple[str, str, float, str]] = [] + self._provided_growth_target: float | None = None + + def add_minimize_hhi(self, weights: ArrayLike | None = None) -> None: + r"""Adds the minimize HHI objective to the portfolio optimization problem. + + The HHI objective is given by + + $$HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`. + + As the objective contains non-quadratic terms, a QUBO formulation requires + approximations. For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_minimize_hhi`. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_minimize_hhi(weights=lambdas) + + Args: + weights: The coefficients that are considered as penalty parameter. + """ + self._all_lambdas.append(self._parse_weight(weights)) + self._qubo_compiler.add_minimize_hhi() + + def add_maximize_roc( + self, + formulation: int, + weights_roc: ArrayLike | None = None, + ancilla_variables: int = 0, + weights_stabilize: ArrayLike | None = None, + ) -> None: + r"""Adds the maximize ROC objective to the portfolio optimization problem. + + The ROC objective is given by + + .. math:: + + ROC(x) = + \frac{\sum_{i=1}^N \frac{x_i \cdot r_i}{y_i}} + {\sum_{i=1}^N \frac{x_i \cdot c_i}{y_i}}, + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`. + + As the ROC is not a quadratic function, it is approximated using two different + formulations: + + formulation 1: + $$ROC_1(x)=\sum_{i=1}^N\frac{x_i\cdot r_i}{c_i\cdot y_i}$$ + + Adds 1 qubo term, use ``weights_roc`` to scale. + + formulation 2: + $$ROC_2(x)=\frac{1}{G_C \cdot C_{21}}\sum_{i=1}^N x_i\frac{r_i}{y_i}$$ + + In this formulation, $G_C \cdot C_{21}$ approximates a fixed regulatory + capital growth which is equal for all assets, where + + - `$1≤G_C<2$` is a growth factor to be estimated using ancilla variables, + - `$C_{21} = \sum_{i=1}^N c_{i}$` is the sum of all assets' regulatory capital. + + This formulation adds 2 qubo terms, one for the ROC term, and one to stabilize the + capital growth. The stabilize qubo requires an extra argument ``ancilla_variables``. + Use ``weights_roc`` and ``weights_stabilize`` to scale both qubo's accordingly. + + For the different QUBO formulations, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_maximize_roc(...) + + Args: + formulation: the ROC QUBO formulation that is being used. + Possible options are: [1, 2]. + weights_roc: The coefficients that are considered as penalty parameter for + maximizing the roc objective. + ancilla_variables: The number of ancillary variables that are used to + represent ``G_C`` using fixed point representation. Only relevant for + roc formulation ``2``. + weights_stabilize: The coefficients that are considered as penalty parameter + for the stabilizing constraint. Only relevant for roc formulation ``2``. + + Raises: + ValueError: If invalid formulation is provided. + """ + allowed_formulation_options = [1, 2] + if formulation not in allowed_formulation_options: + raise ValueError( + "Invalid formulation input provided, " + f"choose from {allowed_formulation_options}." + ) + + self._all_lambdas.append(self._parse_weight(weights_roc)) + if formulation == 2: + self._all_lambdas.append(self._parse_weight(weights_stabilize)) + self._qubo_compiler.add_maximize_roc(formulation, ancilla_variables) + + def add_emission_constraint( + self, + emission_now: str, + emission_future: str | None = None, + reduction_percentage_target: float = 0.7, + name: str | None = None, + weights: ArrayLike | None = None, + ) -> None: + r"""Adds emission constraint to the portfolio optimization problem. + + The constraint is given by + + .. math:: + + \frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} + = + g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_emission_constraint( + ... emission_now="emis_intens_now", weights=lambdas + ... ) + + For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_emission_constraint`. + + Args: + emission_now: Name of the column in the portfolio dataset corresponding to + the variables emission intensity at current time. + emission_future: Name of the column in the portfolio dataset corresponding + to the variables emission intensity at future time. If no value is + provided, it is assumed that the emission intensity is constant over + time, i.e., the variable ``emission_now`` will be used. + reduction_percentage_target: target value for reduction percentage amount. + name: Name that will be used for emission constraint in the results df. + weights: The coefficients that are considered as penalty parameter. + """ + # Store emission constraint information + if name is None: + name = emission_now + if emission_future is None: + emission_future = emission_now + self._provided_emission_constraints.append( + (emission_now, emission_future, reduction_percentage_target, name) + ) + self._all_lambdas.append(self._parse_weight(weights)) + + self._qubo_compiler.add_emission_constraint( + emission_now=emission_now, + emission_future=emission_future, + reduction_percentage_target=reduction_percentage_target, + ) + + def add_growth_factor_constraint( + self, growth_target: float, weights: ArrayLike | None = None + ) -> None: + # pylint: disable=line-too-long + r"""Adds an outstanding amount growth factor constraint to the portfolio + optimization problem. + + The constraint is given by + + $$\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_c$` is the target value for the total growth factor. + + This constraint can only be added once. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> import numpy as np + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> lambdas = np.logspace(-16, 1, 25, endpoint=False, base=10.0) + >>> portfolio_optimizer.add_emission_constraint(growth_target=1.2, weights=lambdas) + + For the QUBO formulation, see the docs of + :py:class:`~portfolio_optimization.components.qubos.QuboFactory`. + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_growth_factor_constraint`. + + Args: + growth_target: target value for growth factor total outstanding amount. + weights: The coefficients that are considered as penalty parameter. + + Raises: + ValueError: If constraint has been added before. + """ + # pylint: enable=line-too-long + if self._provided_growth_target is not None: + raise ValueError("Growth factor constraint has been set before.") + + self._all_lambdas.append(self._parse_weight(weights)) + self._provided_growth_target = growth_target + self._qubo_compiler.add_growth_factor_constraint(growth_target) + + def run( + self, + sampler: Sampler | None = None, + sampler_kwargs: dict[str, Any] | None = None, + verbose: bool = True, + ) -> Results: + # pylint: disable=line-too-long + """ + Optimizes a portfolio given the set of provided constraints. + + Usage example: + + >>> from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + >>> from dwave.samplers import SimulatedAnnealingSampler + >>> portfolio_optimizer = PortfolioOptimizer(filename="benchmark_dataset") + >>> portfolio_optimizer.add_minimize_HHI() + >>> portfolio_optimizer.run(sampler=SimulatedAnnealingSampler(), verbose=False) + + Args: + sampler: Instance of a D-Wave Sampler that can be used to solve the QUBO. + More information can be found in the `D-Wave Ocean Documentation`_. + By default the ``SimulatedAnnealingSampler`` is being used. + sampler_kwargs: The sampler specific key-word arguments. + verbose: If True, print detailed information during execution + + Returns: + results + + Raises: + ValueError: if constraints are not set + + .. _D-Wave Ocean Documentation: https://docs.ocean.dwavesys.com/projects/system/en/stable/reference/samplers.html + + """ + # pylint: enable=line-too-long + if verbose: + self.portfolio_data.print_portfolio_info() + + sampler = SimulatedAnnealingSampler() if sampler is None else sampler + sampler_kwargs = {} if sampler_kwargs is None else sampler_kwargs + + if verbose: + print("Status: creating model") + if self._provided_growth_target is not None: + print(f"Growth target: {self._provided_growth_target - 1:.1%}") + + for _, _, target_value, name in self._provided_emission_constraints: + print( + f"Emission constraint: {name}, " + f"target reduction percentage: {target_value - 1:.1%}" + ) + + self._qubo_compiler.compile() + + results = Results( + portfolio_data=self.portfolio_data, + provided_emission_constraints=self._provided_emission_constraints, + provided_growth_target=self._provided_growth_target, + ) + + if verbose: + print("Status: calculating") + starttime = datetime.now() + + total_steps = math.prod(map(len, self._all_lambdas)) + lambdas_iterator = tqdm( + itertools.product(*self._all_lambdas), total=total_steps + ) + + for lambdas in lambdas_iterator: + # Compile the model and generate QUBO + qubo, _ = self._qubo_compiler.make_qubo(*lambdas) + # Solve the QUBO + response = sampler.sample_qubo(qubo, **sampler_kwargs) + # Postprocess solution. Iterate over all found solutions. (Compute future portfolios) + outstanding_future_samples = self.decoder.decode_sampleset(response) + results.add_result(outstanding_future_samples) + + if verbose: + print("Drop duplicate samples in results.") + results.drop_duplicates() + + if verbose: + print("Number of unique samples: ", len(results)) + print("Time consumed:", datetime.now() - starttime) + + return results + + @staticmethod + def _parse_weight(weights: ArrayLike | None = None) -> NDArray[np.float_]: + """Converts weights into NumPy array and if needed set default weights to [1.0] + + Args: + weights: penalty coefficients. + + Returns: + Numpy array of weights + """ + if weights is None: + return np.array([1.0]) + return np.asarray(weights, dtype=np.float_) diff --git a/tno/quantum/problems/portfolio_optimization/components/__init__.py b/tno/quantum/problems/portfolio_optimization/components/__init__.py new file mode 100644 index 0000000..1aa14e3 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/__init__.py @@ -0,0 +1,17 @@ +"""This subpackage contains components used by the ``PortfolioOptimizer``.""" +from .io import PortfolioData +from .postprocess import Decoder, pareto_front +from .qubos import QuboCompiler, QuboFactory +from .results import Results +from .visualization import plot_front, plot_points + +__all__ = [ + "Results", + "pareto_front", + "Decoder", + "plot_front", + "plot_points", + "PortfolioData", + "QuboCompiler", + "QuboFactory", +] diff --git a/tno/quantum/problems/portfolio_optimization/components/io.py b/tno/quantum/problems/portfolio_optimization/components/io.py new file mode 100644 index 0000000..695b691 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/io.py @@ -0,0 +1,253 @@ +"""This module implements I/O""" +from __future__ import annotations + +from pathlib import Path +from typing import TypeVar, cast + +import numpy as np +import pandas as pd +from numpy.typing import NDArray +from pandas import DataFrame + +DEFAULT_REQUIRED_COLUMN_NAMES = [ + "asset", + "outstanding_now", + "min_outstanding_future", + "max_outstanding_future", + "income_now", + "regcap_now", +] + +PortfolioDataT = TypeVar("PortfolioDataT", bound="PortfolioData") + + +class PortfolioData: + """The ``PortfolioData`` stores the data used for portfolio optimization.""" + + def __init__( + self, + portfolio_dataframe: DataFrame, + columns_rename: dict[str, str] | None = None, + ): + """Creates a ``PortfolioData`` object from a pandas ``DataFrame``. + + The portfolio data is expected to contain at least the following columns names: + + - ``"assets"``: The name of the asset. + - ``"outstanding_now_now"``: Current outstanding amount per asset. + - ``"min_outstanding_future"``: Lower bound outstanding amount in the future per asset. + - ``"max_outstanding_future"``: Upper bound outstanding amount in the future per asset. + - ``"income_now"``: Current income per asset, corresponds to return multiplied by the current outstanding amount. + - ``"regcap_now"``: Current regulatory capital per asset. + + Different column names in the dataset can be used but need to be provided as a + renaming dictionary to the ``columns_rename`` argument. + + Args: + portfolio_dataframe: Pandas ``DataFrame`` containing the portfolio data. + column_rename: to rename columns provided as dict with new column names as keys + and to replace column name as value. Example + ``{"outstanding_2021": "outstanding_now"}``. + + Raises: + ValueError if required columns are not present in dataset. + """ + if columns_rename is not None: + portfolio_dataframe.rename(columns=columns_rename, inplace=True) + + # Validate dataset to contain required column names + for required_column_name in DEFAULT_REQUIRED_COLUMN_NAMES: + if required_column_name not in portfolio_dataframe.columns: + raise ValueError( + f"Required column name {required_column_name} is not in dataset." + ) + + self.portfolio_df = portfolio_dataframe + + @classmethod + def from_file( + cls: type[PortfolioDataT], + filename: str | Path, + columns_rename: dict[str, str] | None = None, + ) -> PortfolioDataT: + """Reads portfolio data object into ``PortfolioData``. + + The portfolio data is expected to contain at least the following columns names: + + - ``"assets"``: The name of the asset. + - ``"outstanding_now_now"``: Current outstanding amount per asset. + - ``"min_outstanding_future"``: Lower bound outstanding amount in the future per asset. + - ``"max_outstanding_future"``: Upper bound outstanding amount in the future per asset. + - ``"income_now"``: Current income per asset, corresponds to return multiplied by the current outstanding amount. + - ``"regcap_now"``: Current regulatory capital per asset. + + Different column names in the dataset can be used but need to be provided as a + renaming dictionary to the ``columns_rename`` argument. + + Args: + filename: path to portfolio data. If instead ``benchmark_dataset`` is + provided, a default benchmark dataset containing 52 assets will be used. + column_rename: to rename columns provided as dict with new column names as keys + and to replace column name as value. Example + ``{"outstanding_2021": "outstanding_now"}``. + + Raises: + ValueError if required columns are not present in dataset. + """ + if str(filename) == "benchmark_dataset": + filename = Path(__file__).parents[1] / "datasets" / "benchmark_dataset.xlsx" + + filename = str(filename) + if filename.endswith(".xlsx"): + portfolio_data = pd.read_excel(filename) + elif filename.endswith(".csv"): + portfolio_data = pd.read_csv(filename) + elif filename.endswith(".json"): + portfolio_data = pd.read_json(filename) + else: + raise ValueError("Datatype not supported.") + return cls(portfolio_data, columns_rename) + + def get_outstanding_now(self) -> NDArray[np.float_]: + """Gets the `outstanding_now` data from the dataset. + + Returns: + The `outstanding_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["outstanding_now"].to_numpy()) + + def get_l_bound(self) -> NDArray[np.float_]: + """Gets the `l_bound` data from the dataset. + + Returns: + The `min_outstanding_future` column from the dataset as a numpy array. + """ + return cast( + NDArray[np.float_], self.portfolio_df["min_outstanding_future"].to_numpy() + ) + + def get_u_bound(self) -> NDArray[np.float_]: + """Gets the `u_bound` data from the dataset. + + Returns: + The `max_outstanding_future` column from the dataset as a numpy array. + """ + return cast( + NDArray[np.float_], self.portfolio_df["max_outstanding_future"].to_numpy() + ) + + def get_income(self) -> NDArray[np.float_]: + """Gets the `income` data from the dataset. + + Returns: + The `income_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["income_now"].to_numpy()) + + def get_capital(self) -> NDArray[np.float_]: + """Gets the `capital` data from the dataset. + + Returns: + The `regcap_now` column from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df["regcap_now"].to_numpy()) + + def get_returns(self) -> NDArray[np.float_]: + """Gets the `returns` data from the dataset. + + Returns: + Returns is defined as income / outstanding_now + """ + income = self.get_income() + outstanding_now = self.get_outstanding_now() + return cast(NDArray[np.float_], income / outstanding_now) + + def get_column(self, column_name: str) -> NDArray[np.float_]: + """Gets the specified column from the dataset. + + Args: + column_name: Name of the column to get. + + Returns: + The `regcap_now` columns from the dataset as a numpy array. + """ + return cast(NDArray[np.float_], self.portfolio_df[column_name].to_numpy()) + + def print_portfolio_info(self) -> None: + """Prints information about portfolio data to terminal.""" + outstanding_now = self.get_outstanding_now() + l_bound = self.get_l_bound() + u_bound = self.get_u_bound() + income = self.get_income() + capital = self.get_capital() + + # Calculate the total outstanding amount in now + total_outstanding_now = np.sum(outstanding_now) + print(f"Total outstanding now: {total_outstanding_now:.2f}") + + # Calculate the ROC for now + roc_now = np.sum(income) / np.sum(capital) + print(f"ROC now: {roc_now:.4f}") + + # Calculate the HHI diversification for now + hhi_now = ( + np.sum(total_outstanding_now**2) / np.sum(total_outstanding_now) ** 2 + ) + print(f"HHI now: {hhi_now:.4f}") + + if "emis_intens_now" in self.portfolio_df: + # Calculate the total emissions for now + total_emission_now = np.sum( + self.get_column("emis_intens_now") * total_outstanding_now + ) + print(f"Total Emission now: {total_emission_now:.2f}") + + # Calculate the average emission intensity now + relative_total_emission = total_emission_now / total_outstanding_now + print(f"Relative emission intensity now: {relative_total_emission:.2f}") + + # Estimate the total outstanding amount and its standard deviation for future. This + # follows from the assumption of a symmetric probability distribution on the + # interval [l_bound, u_bound] and the central limit theorem. + expected_total_outstanding_future = np.sum(u_bound + l_bound) / 2 + expected_stddev_total_outstanding_future = np.linalg.norm( + (u_bound - l_bound) / 2 + ) + print( + f"Expected total outstanding future: {expected_total_outstanding_future:.2f}", + f"Std dev: {expected_stddev_total_outstanding_future:.2f}", + ) + + # Estimate a average growth factor and its standard deviation for now-future. This + # consists of the (averaged) amount per asset in future, which is the outcome of the + # optimization, divided by the amount for now. + expected_average_growth_fac = np.sum( + (u_bound + l_bound) / (2 * total_outstanding_now) + ) + expected_stddev_average_growth_fac = np.linalg.norm( + (u_bound - l_bound) / (2 * total_outstanding_now) + ) + print( + f"Expected average growth factor: {expected_average_growth_fac:.4f}", + f"Std dev: {expected_stddev_average_growth_fac:.4f}", + ) + + def __len__(self) -> int: + """Length of the dataset.""" + return len(self.portfolio_df) + + def __repr__(self) -> str: + """Representation for debugging.""" + txt = f"{self.__class__.__name__} object containing the following data:\n" + txt += repr(self.portfolio_df) + return txt + + def __str__(self) -> str: + """String representation of the ``PortfolioData`` object.""" + txt = f"{self.__class__.__name__} object containing the following data:\n" + txt += str(self.portfolio_df) + return txt + + def __contains__(self, other: object) -> bool: + """Check if ``other`` is part of the dataset.""" + return other in self.portfolio_df diff --git a/tno/quantum/problems/portfolio_optimization/components/postprocess.py b/tno/quantum/problems/portfolio_optimization/components/postprocess.py new file mode 100644 index 0000000..3d734a4 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/postprocess.py @@ -0,0 +1,149 @@ +"""This module implements required post processing steps.""" +from __future__ import annotations + +from collections.abc import Mapping + +import numpy as np +from dimod import SampleSet +from numpy.typing import ArrayLike, NDArray +from scipy.spatial import ConvexHull # pylint: disable=no-name-in-module + +from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData + + +class Decoder: + """``Decoder`` class for decoding samples and samplesets.""" + + def __init__( + self, + portfolio_data: PortfolioData, + k: int, + ) -> None: + """ + Init for the ``Decoder`` Class. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self.number_of_assets = len(portfolio_data) + self.k = k + self.mantissa = np.power(2, np.arange(self.k)) + self.l_bound = portfolio_data.get_l_bound() + self.u_bound = portfolio_data.get_u_bound() + self.multiplier = (self.u_bound - self.l_bound) / (2**self.k - 1) + + def decode_sample(self, sample: Mapping[int, int]) -> NDArray[np.float_]: + """Decodes a sample to the `oustanding_future` array. + + Args: + sample: Sample as returned by D-Wave. + + Returns: + Array containing all `outstanding future` values. + """ + sample_array = np.array( + [sample[i] for i in range(self.number_of_assets * self.k)], dtype=np.uint8 + ) + sample_reshaped = sample_array.reshape((self.number_of_assets, self.k)) + ints = np.sum(sample_reshaped * self.mantissa, axis=1) + outstanding_future = self.l_bound + self.multiplier * ints + if (self.l_bound > outstanding_future).any() or ( + self.u_bound < outstanding_future + ).any(): + raise ValueError("Bounds not obeyed.") + + return np.asarray(outstanding_future, dtype=np.float_) + + def decode_sampleset(self, sampleset: SampleSet) -> NDArray[np.float_]: + """Efficiently decodes a `sampleset` create a matrix of `oustanding_future` + values. + + Each row in the matrix corresponds to a different sample in the `sampleset`. + + Args: + sampleset: ``SampleSet`` as returned by D-Wave. + + Returns: + Matrix containing all `outstanding future` values. + """ + samples_matrix = sampleset.record.sample[:, : self.number_of_assets * self.k] + samples_reshaped = samples_matrix.reshape( + (len(sampleset), self.number_of_assets, self.k) + ) + + ints = np.sum(samples_reshaped * self.mantissa, axis=2) + outstanding_future = self.l_bound + self.multiplier * ints + + if (self.l_bound > outstanding_future).any() or ( + self.u_bound < outstanding_future + ).any(): + raise ValueError("Bounds not obeyed.") + + return np.asarray(outstanding_future, dtype=np.float_) + + +def pareto_front( + xvals: ArrayLike, + yvals: ArrayLike, + min_points: int = 50, + upper_right_quadrant: bool = True, +) -> tuple[NDArray[np.float_], NDArray[np.float_]]: + """Calculates the pareto front with at least min_points data points by repeatedly + creating a convex hull around data points. + + Args: + xvals: x-values of data points + yvals: y-values of data points + min_points: minimum number of points to be selected + upper_right_quadrant: If ``True``, only show the upper right quadrant of the + pareto front. + + Returns: + x, y values of the points that are on the pareto front + """ + points = np.vstack((xvals, yvals)).T + points = np.unique(points, axis=0) + if len(points) < 3: + return points.T[0], points.T[1] + + hull = ConvexHull(points) + pareto_points = points[hull.vertices] + + # Expand the pareto front so that it contains at least min_points. + for _ in range(min_points): + if len(pareto_points) >= min_points: + break + # Remove current hull vertices from data and create a new hull + points = np.delete(points, hull.vertices, axis=0) + if len(points) < 3: + break + hull = ConvexHull(points) + # Add the new hull vertices to the pareto front + new_points = points[hull.vertices] + pareto_points = np.vstack((pareto_points, new_points)) + if upper_right_quadrant: + pareto_points = _get_upper_quadrant(pareto_points) + + if upper_right_quadrant: + pareto_points = _get_upper_quadrant(pareto_points) + + return pareto_points.T[0], pareto_points.T[1] + + +def _get_upper_quadrant(points: NDArray[np.float_]) -> NDArray[np.float_]: + """Removes all values that are not in the upper right quadrant of the pareto front.""" + x_values = points.T[0] + y_values = points.T[1] + + x_bound = x_values[np.argmax(y_values)] + y_bound = y_values[np.argmax(x_values)] + mask = (x_values >= x_bound) & (y_values >= y_bound) + + x_values = x_values[mask] + y_values = y_values[mask] + + return np.vstack((x_values, y_values)).T diff --git a/tno/quantum/problems/portfolio_optimization/components/qubos/__init__.py b/tno/quantum/problems/portfolio_optimization/components/qubos/__init__.py new file mode 100644 index 0000000..6fc3e75 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/qubos/__init__.py @@ -0,0 +1,12 @@ +"""This subpackage contains QUBO related classes and methods. + +The ``QuboCompiler`` can create a variety of QUBO formulation by combining different +objectives and constraints with their corresponding penalty or preference parameters. + +The ``QuboFactory`` class provides a convenient interface for constructing intermediate +QUBO matrices for different objectives and constraints. +""" +from ._qubo_compiler import QuboCompiler +from ._qubo_factory import QuboFactory + +__all__ = ["QuboCompiler", "QuboFactory"] diff --git a/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_compiler.py b/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_compiler.py new file mode 100644 index 0000000..3fa6dec --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_compiler.py @@ -0,0 +1,221 @@ +"""This module contains the ``QuboCompiler`` class. + +The ``QuboCompiler`` can create a variety of QUBO formulation by combining different +objectives and constraints with their corresponding penalty or preference parameters. +""" +from __future__ import annotations + +from collections.abc import Callable +from functools import partial +from typing import TypeVar + +import numpy as np +from numpy.typing import NDArray + +from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData + +from ._qubo_factory import QuboFactory + +QuboCompilerT = TypeVar("QuboCompilerT", bound="QuboCompiler") + + +class QuboCompiler: + """QuboCompiler - A compiler class for creating QUBO instances. + + This class provides a convenient interface for combining different QUBO formulations + without needing to worry about the qubo size. + + Methods: + + - `add_minimize_hhi`: Adds the to minimize HHI QUBO to the compile list. + - `add_maximize_roc`: Adds a ROC and optionally a stabilizing QUBO to the compile + list. + - `add_emission_constraint`: Adds an emission constraint QUBO to the compile list. + - `add_growth_factor_constraint`: Adds the growth factor constraint QUBO to the + compile list. + + """ + + def __init__(self, portfolio_data: PortfolioData, k: int) -> None: + """Init of the ``QuboCompiler`` class. + + The ``QuboCompiler`` can create a variety of QUBO formulation by combining + different objectives and constraints with penalty or preference parameters. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self._qubo_factory = QuboFactory(portfolio_data, k) + + self._to_compile: list[Callable[[], tuple[NDArray[np.float_], float]]] = [] + self._compiled_qubos: list[NDArray[np.float_]] = [] + + def add_minimize_hhi( + self: QuboCompilerT, + ) -> QuboCompilerT: + r"""Adds the minimize HHI objective to the compile list. + + The HHI objective is given by + + $$HHI(x) = \sum_{i=1}^N\left(\frac{x_i}{\sum_{j=1}^N x_j}\right)^2,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_minimize_hhi`. + + Returns: + Self. + """ + self._to_compile.append(self._qubo_factory.calc_minimize_hhi) + return self + + def add_maximize_roc( + self: QuboCompilerT, + formulation: int, + ancilla_variables: int = 0, + ) -> QuboCompilerT: + """Adds the maximize ROC objective and based on the chosen formulation a + stabilize c constraint. + + Args: + formulation: Integer representing which formulation to pick. If formulation + is ``1``, then one QUBO term will be added. If formulation is ``2``, + then 2 QUBO terms will be added as well, but the argument + `ancilla_variables` must be provided. + ancilla_variables: Number of ancilla variables to use for formulation ``2``. + + Returns: + Self. + """ + if formulation == 1: + self._to_compile.append(self._qubo_factory.calc_maximize_roc1) + elif formulation == 2: + self._qubo_factory.n_vars += ancilla_variables + self._to_compile.append(self._qubo_factory.calc_maximize_roc2) + self._to_compile.append(self._qubo_factory.calc_stabilize_c) + + return self + + def add_emission_constraint( + self: QuboCompilerT, + emission_now: str, + emission_future: str | None = None, + reduction_percentage_target: float = 0.7, + ) -> QuboCompilerT: + r"""Adds the emission constraint to the compile list. + + The constraint is given by + + .. math:: + + \frac{\sum_{i=1}^Nf_i \cdot x_i}{\sum_{i=1}^N x_i} + = + g_e \frac{\sum_{i=1}^Ne_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_emission_constraint`. + + Args: + emission_now: Name of the column in the portfolio dataset corresponding to + the variables at current time. + emission_future: Name of the column in the portfolio dataset corresponding + to the variables at future time. If no value is provided, it is assumed + that the value is constant over time, i.e., the variable + ``emission_now`` will be used. + reduction_percentage_target: target value for reduction percentage amount. + + Returns: + Self. + """ + method = partial( + self._qubo_factory.calc_emission_constraint, + emission_now=emission_now, + emission_future=emission_future, + reduction_percentage_target=reduction_percentage_target, + ) + self._to_compile.append(method) + return self + + def add_growth_factor_constraint( + self: QuboCompilerT, growth_target: float + ) -> QuboCompilerT: + # pylint: disable=line-too-long + r"""Adds the capital growth factor constraint to the compile list. + + The constraint is given by + + $$\frac{\sum_{i=1}^N x_i}{\sum_{i=1}^N y_i} = g_c,$$ + + where + + - `$N$` is the total number of assets, + - `$x_i$` is the future outstanding amount for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_c$` is the target value for the total growth factor. + + For the QUBO formulation, see the docs of + :py:meth:`~portfolio_optimization.components.qubos.QuboFactory.calc_growth_factor_constraint`. + + Args: + growth_target: target value for growth factor total outstanding amount. + + Returns: + Self. + """ + # pylint: enable=line-too-long + method = partial( + self._qubo_factory.calc_growth_factor_constraint, + growth_target=growth_target, + ) + self._to_compile.append(method) + return self + + def compile(self: QuboCompilerT) -> QuboCompilerT: + """Compiles all QUBOs in the compile list. + + Returns: + Self.""" + self._compiled_qubos = [] + for constructor in self._to_compile: + qubo, _ = constructor() + self._compiled_qubos.append(qubo) + return self + + def make_qubo(self, *lambdas: float) -> tuple[NDArray[np.float_], float]: + """Makes a QUBO of the entire problem with the given lambdas. + + Args: + lambdas: Scaling parameters for each QUBO in the formulation. + + Returns: + Tuple containing the QUBO matrix and offset. + """ + if len(lambdas) != len(self._compiled_qubos): + raise ValueError( + "Number of lambdas does not correspond with the number of Hamiltonians." + ) + qubo = sum( + ( + lambda_i * qubo_i + for lambda_i, qubo_i in zip(lambdas, self._compiled_qubos) + ), + start=np.zeros_like(self._compiled_qubos[0]), + ) + + return qubo, float("nan") diff --git a/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_factory.py b/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_factory.py new file mode 100644 index 0000000..b4a5352 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/qubos/_qubo_factory.py @@ -0,0 +1,413 @@ +"""This module contains the ``QuboFactory`` class. + +The ``QuboFactory`` class provides a convenient interface for constructing intermediate +QUBO matrices for different objectives and constraints. +""" +from __future__ import annotations + +import numpy as np +from numpy.typing import NDArray + +from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData + +# pylint: disable=too-many-instance-attributes + + +class QuboFactory: + """QuboFactory - A factory class for creating QUBO instances. + + This class provides a convenient interface for constructing intermediate QUBO + matrices for different objectives and constraints. + + Methods: + + - `calc_minimize_hhi`: Calculates the to minimize HHI QUBO + - `calc_maximize_roc1`: Calculates the to maximize return on capital QUBO variant 1 + - `calc_maximize_roc2`: Calculates the to maximize return on capital QUBO variant 2 + - `calc_emission_constraint`: Calculates the emission constraint QUBO + - `calc_growth_factor_constraint`: Calculates the growth factor constraint QUBO + - `calc_stabilize_c`: Calculates the constraint QUBO that stabilizes growth factor. + """ + + def __init__(self, portfolio_data: PortfolioData, k: int) -> None: + """Init of the ``QuboFactory``. + + Args: + portfolio_data: A ``PortfolioData`` object containing the portfolio to + optimize. + k: The number of bits that are used to represent the outstanding amount for + each asset. A fixed point representation is used to represent `$2^k$` + different equidistant values in the range `$[LB_i, UB_i]$` for asset i. + """ + self.portfolio_data = portfolio_data + self.number_of_assets = len(portfolio_data) + self.n_vars = self.number_of_assets * k + self.outstanding_now = portfolio_data.get_outstanding_now() + self.l_bound = portfolio_data.get_l_bound() + self.u_bound = portfolio_data.get_u_bound() + self.income = portfolio_data.get_income() + self.returns = portfolio_data.get_returns() + self.capital = portfolio_data.get_capital() + self.k = k + + def calc_minimize_hhi(self) -> tuple[NDArray[np.float_], float]: + r"""Calculates the to minimize HHI QUBO. + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + \sum_{i=1}^N\left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right)^2, + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j tuple[NDArray[np.float_], float]: + r"""Calculates the emission constraint QUBO for arbitrary target reduction target + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + &= + \left( + \sum_{i=1}^N f_i x_i + - g_e E + \sum_{i=1}^N x_i + \right)^2, + + x_i & = LB_i+\frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}, + + E &= \frac{\sum_{i=1}^N e_i \cdot y_i}{\sum_{i=1}^N y_i}, + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$e_i$` is the current emission intensity for asset `$i$`, + - `$f_i$` is the expected emission intensity at the future for asset `$i$`, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$g_e$` is the target value for the relative emission reduction, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j tuple[NDArray[np.float_], float]: + r"""Calculates the growth factor constraint QUBO + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + \left( + \frac{\sum_{i=1}^N LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1} 2^j\cdot x_{i,j}}{\sum_{i=1}^N y_i} + - g_c + \right)^2 + + where: + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$g_c$` is the target value for the total growth factor, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j tuple[NDArray[np.float_], float]: + r"""Calculates the to maximize ROC QUBO for variant 1. + + The QUBO formulation is given by + + .. math:: + + QUBO(x) + = + -\sum_{i=1}^N\frac{r_i}{c_i\cdot y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right), + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the current return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - and `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j tuple[NDArray[np.float_], float]: + r"""Calculates the to maximize ROC QUBO for variant 2. + + The QUBO formulation is given by + + .. math:: + + QUBO(x,g) + &= + - + G_{inv}(g) \cdot + \sum_{i=1}^N\frac{r_i}{y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right), + + G_{inv}(g) &= + 1 + \sum_{j=0}^{k-1} 2^{-j-1}(2^{-j-1} - 1)\cdot g_{j}, + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$a$` is the number of ancilla variables, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$r_i$` is the return for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j tuple[NDArray[np.float_], float]: + r"""Calculates the QUBO that stabilizes the growth factor in the second ROC + formulation. + + The QUBO formulation is given by + + .. math:: + + QUBO(x,g) + &= + \left( + \sum_{i=1}^N\frac{c_i}{y_i} + \left(LB_i + \frac{UB_i-LB_i}{2^k-1}\sum_{j=0}^{k-1}2^j\cdot x_{i,j}\right) + - G_C(g)\sum_{i=1}^N c_i + \right)^2, + + G_C &= 1 + \sum_{j=0}^{k-1} 2^{-j - 1} \cdot g_j, + + where + + - `$LB_i$` is the lower bound for asset `$i$`, + - `$UB_i$` is the upper bound for asset `$i$`, + - `$k$` is the number of bits, + - `$a$` is the number of ancilla variables, + - `$y_i$` is the current outstanding amount for asset `$i$`, + - `$c_i$` is the regulatory capital for asset `$i$`, + - `$x_{i,j}$` are the $k$ binary variables for asset `$i$` with $j None: + """Init of Results container. + + Args: + portfolio_data: the portfolio data + provided_emission_constraints: list of all the emission constraints that are + provided. Each list element contains the ``emission_now``, + ``emission_future`` and ``reduction_percentage_target`` input. + provided_growth_target: target outstanding amount growth factor if the + growth factor constraint is set, otherwise None. + """ + self.portfolio_data = portfolio_data + if provided_emission_constraints is None: + self.provided_emission_constraints = [] + else: + self.provided_emission_constraints = provided_emission_constraints + self.provided_growth_target = provided_growth_target + + self._outstanding_now = portfolio_data.get_outstanding_now() + self._total_outstanding_now = np.sum(self._outstanding_now) + + self._returns = portfolio_data.get_income() / self._outstanding_now + self._capital = portfolio_data.get_capital() + self._roc_now = np.sum(portfolio_data.get_income()) / np.sum(self._capital) + self._hhi_now = ( + np.sum(self._outstanding_now**2) / np.sum(self._outstanding_now) ** 2 + ) + + self.columns = [ + "outstanding amount", + "diff ROC", + "diff diversification", + "diff outstanding", + ] + [ + "diff " + constraint[3] for constraint in self.provided_emission_constraints + ] + self.results_df = pd.DataFrame(columns=self.columns) + + def __len__(self) -> int: + """Return the number of samples stored in the ``Results`` object.""" + return len(self.results_df) + + def add_result(self, outstanding_future_samples: NDArray[np.float_]) -> None: + """Adds a new outstanding_future data point to results container. + + Args: + outstanding_future_samples: outstanding amounts in the future for each + sample of the dataset. + """ + for oustanding_future in outstanding_future_samples: + total_outstanding_future = np.sum(oustanding_future) + # Compute the ROC growth + roc = np.sum(oustanding_future * self._returns) / np.sum( + oustanding_future * self._capital / self._outstanding_now + ) + roc_growth = 100 * (roc / self._roc_now - 1) + + # Compute the diversification. + hhi = np.sum(oustanding_future**2) / total_outstanding_future**2 + diff_diversification = 100 * (1 - (hhi / self._hhi_now)) + + # Compute the growth outstanding in outstanding amount + growth_outstanding = total_outstanding_future / self._total_outstanding_now + + new_data = [ + tuple(oustanding_future), + roc_growth, + diff_diversification, + growth_outstanding, + ] + + # Compute the emission constraint growths + for ( + column_name_now, + column_name_future, + _, + _, + ) in self.provided_emission_constraints: + total_relative_emission_now = ( + np.sum( + self._outstanding_now + * self.portfolio_data.get_column(column_name_now) + ) + / self._total_outstanding_now + ) + total_relative_emission_future = np.sum( + oustanding_future + * self.portfolio_data.get_column(column_name_future) + ) / np.sum(oustanding_future) + + new_data.append( + 100 + * (total_relative_emission_future / total_relative_emission_now - 1) + ) + + # Write results + self.results_df.loc[len(self.results_df)] = new_data + + def head(self, n: int = 5) -> pd.DataFrame: + """Returns first n rows of self.results_df DataFrame + + Args: + selected_columns: By default all columns + n: number of results to return + """ + selected_columns = [ + column for column in self.columns if column != "Outstanding amount" + ] + return self.results_df[selected_columns].head(n) + + def drop_duplicates(self) -> None: + """Drops duplicates in results DataFrame""" + self.results_df.drop_duplicates(subset=["outstanding amount"], inplace=True) + + def slice_results( + self, tolerance: float = 0.0 + ) -> tuple[ + tuple[NDArray[np.float_], NDArray[np.float_]], + tuple[NDArray[np.float_], NDArray[np.float_]], + ]: + """Helper function that slices the results in two groups, those results that + satisfy all constraints and those that violate at least one of the growth factor + or emission constraints. + + Args: + tolerance: tolerance on how strict the constraints need to be satisfied (in + percentage point). Example: if the desired target growth rate is 1.2, if + the tolerance is set to 0.05 (5%). Solutions that increase outstanding + amount by a factor of 1.15 are considered to satisfy the constraints + given the tolerance. + + Returns: + Relative difference (diversification, roc) coordinates for solutions that + satisfy all constraints, and for those that do not satisfy all constraints. + + Raises: + ValueError: when there are no emission or growth factor constraints set. + """ + if ( + self.provided_growth_target is None + and len(self.provided_emission_constraints) == 0 + ): + raise ValueError("There are no emission or growth constraints set.") + + mask_growth_target = ( + True + if self.provided_growth_target is None + else ( + self.results_df["diff outstanding"] + >= 100 * (self.provided_growth_target - tolerance - 1) + ) + ) + + mask_emission_constraint = True + for _, _, value, name in self.provided_emission_constraints: + mask_emission_constraint &= self.results_df["diff " + name] <= 100 * ( + (value + tolerance) - 1 + ) + + combined_mask = mask_growth_target & mask_emission_constraint + + # Filter data based on masks + filtered_data_met = self.results_df[combined_mask] + filtered_data_violated = self.results_df[~combined_mask] + + x_met = filtered_data_met["diff diversification"].to_numpy() + y_met = filtered_data_met["diff ROC"].to_numpy() + x_violated = filtered_data_violated["diff diversification"].to_numpy() + y_violated = filtered_data_violated["diff ROC"].to_numpy() + return (x_met, y_met), (x_violated, y_violated) diff --git a/tno/quantum/problems/portfolio_optimization/components/visualization.py b/tno/quantum/problems/portfolio_optimization/components/visualization.py new file mode 100644 index 0000000..b103d30 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/components/visualization.py @@ -0,0 +1,133 @@ +"""This module contains visualization tools.""" +from __future__ import annotations + +from typing import TYPE_CHECKING + +import matplotlib.pyplot as plt + +from tno.quantum.problems.portfolio_optimization.components.postprocess import ( + pareto_front, +) + +if TYPE_CHECKING: + from collections.abc import Sequence + from typing import Any + + from matplotlib.axes import Axes + from matplotlib.collections import PatchCollection + from matplotlib.colors import Colormap + from matplotlib.typing import ColorType + from numpy.typing import ArrayLike + + +def plot_points( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection | Any: + """Plots the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + if ax is None: + _, ax = plt.subplots() + collection = ax.scatter( + diversification_values, + roc_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ) + ax.set_xlabel("Diversification Change (%)") + ax.set_ylabel("ROC Change (%)") + ax.grid() + if label is not None: + ax.legend() + + xlim = ax.get_xlim() + ylim = ax.get_ylim() + ax.axhline(0, color="black", linewidth=1) + ax.axvline(0, color="black", linewidth=1) + ax.set_xlim(*xlim, auto=True) + ax.set_ylim(*ylim, auto=True) + return collection + + +def plot_front( + diversification_values: ArrayLike, + roc_values: ArrayLike, + color: str | None = None, + label: str | None = None, + c: ArrayLike | Sequence[ColorType] | ColorType | None = None, + vmin: float | None = None, + vmax: float | None = None, + alpha: float | None = None, + cmap: str | Colormap | None = None, + ax: Axes | None = None, # pylint: disable=invalid-name +) -> PatchCollection: + """Plots a pareto front of the given data-points in a Diversification-ROC plot. + + Args: + diversification_values: 1-D ``ArrayLike`` containing the x values of the plot. + roc_values: 1-D ``ArrayLike`` containing the y values of the plot. + color: Optional color to use for the points. For an overview of allowed colors + see the `Matplotlib Documentation`_. If ``None`` is given, a default color + will be assigned by ``matplotlib``. Default is ``None``. + label: Label to use in the legend. If ``None`` is given, no label will be used. + Default is ``None``. + c: The marker colors as used by ``matplotlib``. + vmin: min value of data range that colormap covers as used by ``matplotlib``. + vmax: max value of data range that colormap covers as used by ``matplotlib``. + alpha: The alpha blending value as used by ``matplotlib``. + cmap: The Colormap instance or registered colormap name as used by ``matplotlib``. + ax: ``Axes`` to plot on. If ``None``, a new figure with one ``Axes`` will be + created. + + Returns: + The ``matplotlib`` PathCollection object created by scatter. + + .. _Matplotlib Documentation: https://matplotlib.org/stable/gallery/color/named_colors.html + """ + x_values, y_values = pareto_front(diversification_values, roc_values) + return plot_points( + x_values, + y_values, + color=color, + c=c, + alpha=alpha, + vmin=vmin, + vmax=vmax, + cmap=cmap, + label=label, + ax=ax, + ) diff --git a/tno/quantum/problems/portfolio_optimization/py.typed b/tno/quantum/problems/portfolio_optimization/py.typed new file mode 100644 index 0000000..e69de29 diff --git a/tno/quantum/problems/portfolio_optimization/test/__init__.py b/tno/quantum/problems/portfolio_optimization/test/__init__.py new file mode 100644 index 0000000..26311c7 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/__init__.py @@ -0,0 +1,7 @@ +"""Testing subpackage of the tno.quantum.problems.portfolio_optimization package""" + +from tno.quantum.problems.portfolio_optimization.test.dataset_for_tests import ( + make_test_dataset, +) + +__all__ = ["make_test_dataset"] diff --git a/tno/quantum/problems/portfolio_optimization/test/components/__init__.py b/tno/quantum/problems/portfolio_optimization/test/components/__init__.py new file mode 100644 index 0000000..10b0fd7 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/__init__.py @@ -0,0 +1 @@ +# pylint: disable=cyclic-import diff --git a/tno/quantum/problems/portfolio_optimization/test/components/io.py b/tno/quantum/problems/portfolio_optimization/test/components/io.py new file mode 100644 index 0000000..378acd4 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/io.py @@ -0,0 +1,35 @@ +"""This module contains tests for the io module.""" +from pathlib import Path + +from tno.quantum.problems.portfolio_optimization.components import PortfolioData +from tno.quantum.problems.portfolio_optimization.test.dataset_for_tests import ( + make_test_dataset, +) + +# pylint: disable=missing-function-docstring + + +def test_default_dataset() -> None: + PortfolioData.from_file("benchmark_dataset") + + +def test_from_file() -> None: + dataset_file = Path(__file__).parents[1] / "datasets" / "benchmark_dataset.xlsx" + PortfolioData.from_file(dataset_file) + PortfolioData.from_file(str(dataset_file)) + + +def test_init() -> None: + data_frame = make_test_dataset() + PortfolioData(data_frame) + + +def test_len() -> None: + data_frame = make_test_dataset() + assert len(PortfolioData(data_frame)) == 2 + + +def test_print() -> None: + data_frame = make_test_dataset() + portfolio_data = PortfolioData(data_frame) + portfolio_data.print_portfolio_info() diff --git a/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_compiler.py b/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_compiler.py new file mode 100644 index 0000000..4749b20 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_compiler.py @@ -0,0 +1,147 @@ +"""This module contains test for the ``QuboCompiler`` class.""" +from __future__ import annotations + +from collections.abc import MutableSequence +from typing import Any + +import numpy as np +import pytest + +from tno.quantum.problems.portfolio_optimization.components import ( + QuboCompiler, + QuboFactory, +) +from tno.quantum.problems.portfolio_optimization.test import make_test_dataset + +# pylint: disable=missing-function-docstring + + +@pytest.fixture(name="qubo_compiler") +def qubo_compiler_fixture() -> QuboCompiler: + portfolio_data = make_test_dataset() + return QuboCompiler(portfolio_data, k=2) + + +def test_init(qubo_compiler: QuboCompiler) -> None: + assert isinstance(qubo_compiler._qubo_factory, QuboFactory) + assert isinstance(qubo_compiler._to_compile, MutableSequence) + assert isinstance(qubo_compiler._compiled_qubos, MutableSequence) + + assert len(qubo_compiler._to_compile) == 0 + assert len(qubo_compiler._compiled_qubos) == 0 + + +@pytest.mark.parametrize( + "method_name,method_args", + [ + ("add_minimize_hhi", []), + ("add_emission_constraint", ["emis_intens_now", "emis_intens_future", 0.7]), + ("add_growth_factor_constraint", [5]), + ("add_maximize_roc", [1]), + ], +) +def test_add_single_qubo( + qubo_compiler: QuboCompiler, method_name: str, method_args: list[Any] +) -> None: + assert len(qubo_compiler._to_compile) == 0 + assert len(qubo_compiler._compiled_qubos) == 0 + + assert hasattr(qubo_compiler, method_name) + getattr(qubo_compiler, method_name)(*method_args) + + assert len(qubo_compiler._to_compile) == 1 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.compile() + + assert len(qubo_compiler._to_compile) == 1 + assert len(qubo_compiler._compiled_qubos) == 1 + + qubo, _ = qubo_compiler.make_qubo(1) + assert len(qubo) == 4 + np.testing.assert_array_equal(qubo, qubo_compiler._compiled_qubos[0]) + + +@pytest.mark.parametrize( + "method_name,method_args,len_qubo", + [ + ("add_maximize_roc", [2, 5], 9), + ], +) +def test_add_double_qubo( + qubo_compiler: QuboCompiler, method_name: str, method_args: list[Any], len_qubo: int +) -> None: + assert len(qubo_compiler._to_compile) == 0 + assert len(qubo_compiler._compiled_qubos) == 0 + + assert hasattr(qubo_compiler, method_name) + getattr(qubo_compiler, method_name)(*method_args) + + assert len(qubo_compiler._to_compile) == 2 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.compile() + + assert len(qubo_compiler._to_compile) == 2 + assert len(qubo_compiler._compiled_qubos) == 2 + + qubo, _ = qubo_compiler.make_qubo(1, 2) + assert len(qubo) == len_qubo + np.testing.assert_array_equal( + qubo, qubo_compiler._compiled_qubos[0] + 2 * qubo_compiler._compiled_qubos[1] + ) + + +def test_mixing(qubo_compiler: QuboCompiler) -> None: + assert len(qubo_compiler._to_compile) == 0 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.add_minimize_hhi() + assert len(qubo_compiler._to_compile) == 1 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.add_maximize_roc(formulation=2, ancilla_variables=5) + assert len(qubo_compiler._to_compile) == 3 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.add_growth_factor_constraint(growth_target=1.5) + assert len(qubo_compiler._to_compile) == 4 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.add_emission_constraint(emission_now="emis_intens_now") + assert len(qubo_compiler._to_compile) == 5 + assert len(qubo_compiler._compiled_qubos) == 0 + + qubo_compiler.compile() + assert len(qubo_compiler._to_compile) == 5 + assert len(qubo_compiler._compiled_qubos) == 5 + + qubo, _ = qubo_compiler.make_qubo(1, 2, 3, 4, 5) + assert len(qubo) == 9 + np.testing.assert_array_equal( + qubo, sum((i + 1) * qubo_compiler._compiled_qubos[i] for i in range(5)) + ) + + +def test_ordering() -> None: + """Test order""" + portfolio_data = make_test_dataset() + + qubo_compiler1 = QuboCompiler(portfolio_data, k=2) + qubo_compiler1.add_minimize_hhi() + qubo_compiler1.add_maximize_roc(formulation=2) + qubo1, offset1 = qubo_compiler1.compile().make_qubo(1, 1, 1) + + qubo_compiler2 = QuboCompiler(portfolio_data, k=2) + qubo_compiler2.add_maximize_roc(formulation=2) + qubo_compiler2.add_minimize_hhi() + qubo2, offset2 = qubo_compiler2.compile().make_qubo(1, 1, 1) + assert np.allclose(qubo1, qubo2) + assert np.equal(offset1, offset2) | (np.isnan(offset1) & np.isnan(offset2)) + + +def test_incorrect_lambdas(qubo_compiler: QuboCompiler) -> None: + qubo_compiler.add_emission_constraint(emission_now="emis_intens_now") + qubo_compiler.compile() + with pytest.raises(ValueError): + qubo_compiler.make_qubo(1, 2, 3) diff --git a/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_factory.py b/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_factory.py new file mode 100644 index 0000000..688231f --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/qubos/test_qubo_factory.py @@ -0,0 +1,111 @@ +"""This module contains tests for the ``QuboFactory`` class.""" +import numpy as np +import pytest + +from tno.quantum.problems.portfolio_optimization.components import QuboFactory +from tno.quantum.problems.portfolio_optimization.test import make_test_dataset + +# pylint: disable=missing-function-docstring + + +@pytest.fixture(name="qubo_factory") +def qubo_factory_fixture() -> QuboFactory: + portfolio_data = make_test_dataset() + return QuboFactory(portfolio_data, k=2) + + +def test_calc_minimize_hhi(qubo_factory: QuboFactory) -> None: + expected_qubo = np.array( + [[69, 36, 0, 0], [0, 156, 0, 0], [0, 0, 189, 36], [0, 0, 0, 396]] + ) + expected_offset = 1000 + qubo, offset = qubo_factory.calc_minimize_hhi() + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) + + +def test_calc_emission_constraint(qubo_factory: QuboFactory) -> None: + expected_qubo = ( + np.array( + [ + [-433_588, 178_608, -77_592, -155_184], + [0, -777_872, -155_184, -310_368], + [0, 0, 449_228, 134_832], + [0, 0, 0, 965_872], + ] + ) + / 3 + ) + expected_offset = 3_841_600 / 9 + qubo, offset = qubo_factory.calc_emission_constraint( + emission_now="emis_intens_now", emission_future="emis_intens_future" + ) + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) + + +def test_calc_growth_factor_constraint(qubo_factory: QuboFactory) -> None: + expected_qubo = [ + [25, 4, 2, 4], + [0, 52, 4, 8], + [0, 0, 25, 4], + [0, 0, 0, 52], + ] + expected_offset = 144 + qubo, offset = qubo_factory.calc_growth_factor_constraint(4 / 3) + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) + + +def test_calc_maximize_roc1(qubo_factory: QuboFactory) -> None: + expected_qubo = np.diag([-3, -6, -3 / 4, -3 / 2]) + expected_offset = -17.5 + qubo, offset = qubo_factory.calc_maximize_roc1() + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) + + +def test_calc_maximize_roc2(qubo_factory: QuboFactory) -> None: + # Use 3 ancilla variables + qubo_factory.n_vars += 3 + + expected_qubo = [ + [-3, 0, 0, 0, 3 / 4, 9 / 16, 21 / 64], + [0, -6, 0, 0, 3 / 2, 9 / 8, 21 / 32], + [0, 0, -3 / 4, 0, 3 / 16, 9 / 64, 21 / 256], + [0, 0, 0, -3 / 2, 3 / 8, 9 / 32, 21 / 128], + [0, 0, 0, 0, 35 / 8, 0, 0], + [0, 0, 0, 0, 0, 105 / 32, 0], + [0, 0, 0, 0, 0, 0, 245 / 128], + ] + expected_offset = -17.5 + qubo, offset = qubo_factory.calc_maximize_roc2() + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) + + +def test_calc_stabilize_c(qubo_factory: QuboFactory) -> None: + # Use 3 ancilla variables + qubo_factory.n_vars += 3 + + expected_qubo = np.array( + [ + [147, 36, 9, 18, -6, -3, -3 / 2], + [0, 312, 18, 36, -12, -6, -3], + [0, 0, 71.25, 9, -3, -3 / 2, -3 / 4], + [0, 0, 0, 147, -6, -3, -3 / 2], + [0, 0, 0, 0, -45, 1, 1 / 2], + [0, 0, 0, 0, 0, -22.75, 1 / 4], + [0, 0, 0, 0, 0, 0, -11.4375], + ] + ) + expected_offset = 529 + qubo, offset = qubo_factory.calc_stabilize_c() + + np.testing.assert_almost_equal(offset, expected_offset) + np.testing.assert_almost_equal(qubo, expected_qubo) diff --git a/tno/quantum/problems/portfolio_optimization/test/components/test_postprocess.py b/tno/quantum/problems/portfolio_optimization/test/components/test_postprocess.py new file mode 100644 index 0000000..e8417e4 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/test_postprocess.py @@ -0,0 +1,140 @@ +"""This module contains tests for post-processing of results.""" +from __future__ import annotations + +from collections.abc import Mapping + +import numpy as np +import pytest +from dimod import SampleSet +from numpy.typing import NDArray + +from tno.quantum.problems.portfolio_optimization.components import Decoder, pareto_front +from tno.quantum.problems.portfolio_optimization.test import make_test_dataset + +# pylint: disable=missing-function-docstring + + +@pytest.fixture(name="decoder") +def decoder_fixture() -> Decoder: + portfolio_data = make_test_dataset() + return Decoder(portfolio_data, k=2) + + +@pytest.mark.parametrize( + "sample,expected_results", + [ + ({0: 0, 1: 0, 2: 0, 3: 0}, np.array([10, 30])), + ({0: 0, 1: 0, 2: 0, 3: 1}, np.array([10, 36])), + ({0: 0, 1: 0, 2: 1, 3: 0}, np.array([10, 33])), + ({0: 0, 1: 0, 2: 1, 3: 1}, np.array([10, 39])), + ({0: 0, 1: 1, 2: 0, 3: 0}, np.array([16, 30])), + ({0: 0, 1: 1, 2: 0, 3: 1}, np.array([16, 36])), + ({0: 0, 1: 1, 2: 1, 3: 0}, np.array([16, 33])), + ({0: 0, 1: 1, 2: 1, 3: 1}, np.array([16, 39])), + ({0: 1, 1: 0, 2: 0, 3: 0}, np.array([13, 30])), + ({0: 1, 1: 0, 2: 0, 3: 1}, np.array([13, 36])), + ({0: 1, 1: 0, 2: 1, 3: 0}, np.array([13, 33])), + ({0: 1, 1: 0, 2: 1, 3: 1}, np.array([13, 39])), + ({0: 1, 1: 1, 2: 0, 3: 0}, np.array([19, 30])), + ({0: 1, 1: 1, 2: 0, 3: 1}, np.array([19, 36])), + ({0: 1, 1: 1, 2: 1, 3: 0}, np.array([19, 33])), + ({0: 1, 1: 1, 2: 1, 3: 1}, np.array([19, 39])), + ], +) +def test_decode_sample( + decoder: Decoder, sample: Mapping[int, int], expected_results: NDArray[np.float_] +) -> None: + np.testing.assert_array_equal(decoder.decode_sample(sample), expected_results) + + +def test_decode_sampleset(decoder: Decoder) -> None: + samples = [ + {0: 0, 1: 0, 2: 0, 3: 0}, + {0: 0, 1: 0, 2: 0, 3: 1}, + {0: 0, 1: 0, 2: 1, 3: 0}, + {0: 0, 1: 0, 2: 1, 3: 1}, + {0: 0, 1: 1, 2: 0, 3: 0}, + {0: 0, 1: 1, 2: 0, 3: 1}, + {0: 0, 1: 1, 2: 1, 3: 0}, + {0: 0, 1: 1, 2: 1, 3: 1}, + {0: 1, 1: 0, 2: 0, 3: 0}, + {0: 1, 1: 0, 2: 0, 3: 1}, + {0: 1, 1: 0, 2: 1, 3: 0}, + {0: 1, 1: 0, 2: 1, 3: 1}, + {0: 1, 1: 1, 2: 0, 3: 0}, + {0: 1, 1: 1, 2: 0, 3: 1}, + {0: 1, 1: 1, 2: 1, 3: 0}, + {0: 1, 1: 1, 2: 1, 3: 1}, + ] + sampleset = SampleSet.from_samples(samples, "BINARY", [0] * 16) # type: ignore[no-untyped-call] + expected_result = np.array( + [ + [10, 30], + [10, 36], + [10, 33], + [10, 39], + [16, 30], + [16, 36], + [16, 33], + [16, 39], + [13, 30], + [13, 36], + [13, 33], + [13, 39], + [19, 30], + [19, 36], + [19, 33], + [19, 39], + ] + ) + + np.testing.assert_array_equal(decoder.decode_sampleset(sampleset), expected_result) + + +# ---- TESTS FOR THE PARETO FRONT ------ +@pytest.fixture(name="x_y_points") +def x_y_points_fixture() -> tuple[list[int], list[int]]: + # Create point with a square in a square inside another square + x_vals = [0, 0, 5, 5, 1, 1, 4, 4, 2, 2, 3, 3] + y_vals = [0, 5, 0, 5, 1, 4, 1, 4, 2, 3, 2, 3] + return x_vals, y_vals + + +@pytest.mark.parametrize( + "min_points,expected_points", + [ + (4, {(0, 0), (0, 5), (5, 0), (5, 5)}), + (8, {(0, 0), (0, 5), (5, 0), (5, 5), (1, 1), (1, 4), (4, 1), (4, 4)}), + ], +) +def test_pareto_front( + x_y_points: tuple[list[float], list[float]], + min_points: int, + expected_points: set[tuple[int, int]], +) -> None: + x_vals, y_vals = x_y_points + x_par, y_par = pareto_front(x_vals, y_vals, min_points, False) + assert len(x_par) == len(expected_points) + assert len(y_par) == len(expected_points) + for point in zip(x_par, y_par): + assert point in expected_points + + +def test_small_front() -> None: + x_vals = [1, 2] + y_vals = [3, 4] + x_par, y_par = pareto_front(x_vals, y_vals) + np.testing.assert_array_equal(x_vals, x_par) + np.testing.assert_array_equal(y_vals, y_par) + + +def test_small_front2() -> None: + x_vals = [0, 0, 5, 5, 1] + y_vals = [0, 5, 0, 5, 1] + expected_points = {(0, 0), (0, 5), (5, 0), (5, 5)} + x_par, y_par = pareto_front(x_vals, y_vals, upper_right_quadrant=False) + + assert len(x_par) == len(expected_points) + assert len(y_par) == len(expected_points) + for point in zip(x_par, y_par): + assert point in expected_points diff --git a/tno/quantum/problems/portfolio_optimization/test/components/test_results.py b/tno/quantum/problems/portfolio_optimization/test/components/test_results.py new file mode 100644 index 0000000..bcfa2ff --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/components/test_results.py @@ -0,0 +1,38 @@ +"""This module contains tests for the Results module.""" +from __future__ import annotations + +import numpy as np +import pytest + +from tno.quantum.problems.portfolio_optimization.components import Results +from tno.quantum.problems.portfolio_optimization.test import make_test_dataset + +# pylint: disable=missing-function-docstring +# pylint: disable=protected-access + + +@pytest.fixture(name="results") +def results_fixture() -> Results: + portfolio_data = make_test_dataset() + provided_constraints: list[tuple[str, str, float, str]] = [] + return Results(portfolio_data, provided_constraints) + + +def test_add_result(results: Results) -> None: + assert len(results) == 0 + + outstanding_future_samples = np.array([[19, 39], [10, 30]]) + results.add_result(outstanding_future_samples) + assert len(results) == 2 + + # Add duplicate result + results.add_result(outstanding_future_samples) + results.drop_duplicates() + assert len(results) == 2 + + # Add different results + for i in range(10): + outstanding_future_samples = np.array([[i, 1]]) + results.add_result(outstanding_future_samples) + results.drop_duplicates() + assert len(results) == i + 3 diff --git a/tno/quantum/problems/portfolio_optimization/test/dataset_for_tests.py b/tno/quantum/problems/portfolio_optimization/test/dataset_for_tests.py new file mode 100644 index 0000000..eb4394a --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/dataset_for_tests.py @@ -0,0 +1,24 @@ +"""Dataset creation for testing.""" +from pandas import DataFrame + +from tno.quantum.problems.portfolio_optimization.components.io import PortfolioData + + +def make_test_dataset() -> PortfolioData: + """Creates a small portfolio datasets for testing.""" + data = [ + ["asset 1", 1.0, 10.0, 19.0, 100.0, 76.0, 1.0, 1.0], + ["asset 2", 2.0, 30.0, 39.0, 200.0, 152.0, 1.0, 1.0], + ] + column_names = [ + "asset", + "outstanding_now", + "min_outstanding_future", + "max_outstanding_future", + "emis_intens_now", + "emis_intens_future", + "income_now", + "regcap_now", + ] + data_frame = DataFrame(data=data, columns=column_names) + return PortfolioData(data_frame) diff --git a/tno/quantum/problems/portfolio_optimization/test/test_portfolio_optimizer.py b/tno/quantum/problems/portfolio_optimization/test/test_portfolio_optimizer.py new file mode 100644 index 0000000..ae72d61 --- /dev/null +++ b/tno/quantum/problems/portfolio_optimization/test/test_portfolio_optimizer.py @@ -0,0 +1,49 @@ +"""This module contains tests for the ``PortfolioOptimizer`` class.""" +from __future__ import annotations + +import numpy as np +import pytest +from numpy.typing import ArrayLike + +from tno.quantum.problems.portfolio_optimization import PortfolioOptimizer + +# pylint: disable=missing-function-docstring +# pylint: disable=protected-access + + +@pytest.mark.parametrize( + "weight,expected_outcome", [(None, [1.0]), ([1, 2, 3], [1, 2, 3])] +) +def test_parse_weight(weight: ArrayLike | None, expected_outcome: ArrayLike) -> None: + parsed_weights = PortfolioOptimizer._parse_weight(weight) + np.testing.assert_array_equal(parsed_weights, expected_outcome) + + +def test_portfolio_optimizer() -> None: + portfolio_optimizer = PortfolioOptimizer("benchmark_dataset", k=2) + portfolio_optimizer.add_minimize_hhi(weights=[1]) + portfolio_optimizer.add_maximize_roc(formulation=1, weights_roc=[1]) + portfolio_optimizer.add_emission_constraint( + weights=[1], + emission_now="emis_intens_now", + emission_future="emis_intens_future", + reduction_percentage_target=0.7, + ) + portfolio_optimizer.run() + + +def test_multiple_growth_factor_constraints() -> None: + portfolio_optimizer = PortfolioOptimizer("benchmark_dataset", k=2) + + portfolio_optimizer.add_growth_factor_constraint( + growth_target=1.2, + weights=[1], + ) + portfolio_optimizer.run() + + expected_message = "Growth factor constraint has been set before." + with pytest.raises(ValueError, match=expected_message): + portfolio_optimizer.add_growth_factor_constraint( + growth_target=1.4, + weights=[1], + )