Generated: Tue Nov 18 09:58:19 2025
Third Party Licenses for sharc-fx-nn-software-framework 3.0.0-b
Summary
| License |
SPDX-ID |
Components |
|
| Apache License 2.0 |
Apache-2.0 |
21 |
|
| BSD 2-clause "Simplified" License |
BSD-2-Clause |
5 |
|
| BSD 3-clause "New" or "Revised" License |
BSD-3-Clause |
29 |
|
| GNU Lesser General Public License v2.1 or later |
LGPL-2.1-or-later |
1 |
|
| ISC License |
ISC |
2 |
|
| MIT License |
MIT |
18 |
|
| Mozilla Public License 2.0 |
MPL-2.0 |
3 |
|
| NVIDIA End User License Agreement v13.0 |
None |
2 |
|
| Python Imaging Library Software License |
None |
1 |
|
| Python Software Foundation License 2.0 |
PSF-2.0 |
1 |
|
| The Unlicense |
Unlicense |
1 |
|
| Unicode License v3 |
Unicode-3.0 |
1 |
|
Contents
Licenses
absl-py
2.3.1
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
astunparse
1.6.3
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
=======
Copyright (c) 2014, Simon Percivall
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of AST Unparser nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
audioread
3.0.1
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
cachetools
5.5.2
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
filesystem_spec
2024.10.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
FlatBuffers
25.2.10
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
gast
0.6.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
google-auth-oauthlib
1.2.2
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
google-pasta
0.2.0
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
grpc
1.73.1
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
h5py
3.14.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
idna
3.10
License: (BSD 3-clause "New" or "Revised" License AND Unicode License v3)
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
License: Unicode License v3 (SPDX-License-Identifier: Unicode-3.0)
UNICODE LICENSE V3
==================
COPYRIGHT AND PERMISSION NOTICE
Copyright © 1991-2023 Unicode, Inc.
NOTICE TO USER: Carefully read the following legal agreement. BY DOWNLOADING,
INSTALLING, COPYING OR OTHERWISE USING DATA FILES, AND/OR SOFTWARE, YOU
UNEQUIVOCALLY ACCEPT, AND AGREE TO BE BOUND BY, ALL OF THE TERMS AND CONDITIONS
OF THIS AGREEMENT. IF YOU DO NOT AGREE, DO NOT DOWNLOAD, INSTALL, COPY,
DISTRIBUTE OR USE THE DATA FILES OR SOFTWARE.
Permission is hereby granted, free of charge, to any person obtaining a copy of
data files and any associated documentation (the "Data Files") or software and
any associated documentation (the "Software") to deal in the Data Files or
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, and/or sell copies of the Data Files or
Software, and to permit persons to whom the Data Files or Software are furnished
to do so, provided that either (a) this copyright and permission notice appear
with all copies of the Data Files or Software, or (b) this copyright and
permission notice appear in associated Documentation.
THE DATA FILES AND SOFTWARE ARE PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD
PARTY RIGHTS.
IN NO EVENT SHALL THE COPYRIGHT HOLDER OR HOLDERS INCLUDED IN THIS NOTICE BE
LIABLE FOR ANY CLAIM, OR ANY SPECIAL INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY
DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
CONNECTION WITH THE USE OR PERFORMANCE OF THE DATA FILES OR SOFTWARE.
Except as contained in this notice, the name of a copyright holder shall not be
used in advertising or otherwise to promote the sale, use or other dealings in
these Data Files or Software without prior written authorization of the copyright
holder.
jinjapython
3.1.4
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
joblib
1.4.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
keras-team/keras
2.15.0
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
lazy-loader
0.4
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
libclang
18.1.1
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
librosa
0.10.2.post1
License: ISC License
License: ISC License (SPDX-License-Identifier: ISC)
ISC License (ISCL)
==================
Copyright (c) 4-digit year, Company or Person's Name
Permission to use, copy, modify, and/or distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright notice
and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
llvmlite
0.44.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
markdown-it-py
3.0.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
MarkupSafe
3.0.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
mdurl
0.1.2
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
ml-dtypes
0.2.0
License: (Apache License 2.0 AND Mozilla Public License 2.0)
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
License: Mozilla Public License 2.0 (SPDX-License-Identifier: MPL-2.0)
Mozilla Public License
Version 2.0
======================
1. Definitions
--------------
1.1. "Contributor"
means each individual or legal entity that creates, contributes to the creation
of, or owns Covered Software.
1.2. "Contributor Version"
means the combination of the Contributions of others (if any) used by a
Contributor and that particular Contributor's Contribution.
1.3. "Contribution"
means Covered Software of a particular Contributor.
1.4. "Covered Software"
means Source Code Form to which the initial Contributor has attached the notice
in Exhibit A, the Executable Form of such Source Code Form, and Modifications
of such Source Code Form, in each case including portions thereof.
1.5. "Incompatible With Secondary Licenses"
means
a.
that the initial Contributor has attached the notice described in Exhibit B
to the Covered Software; or
b.
that the Covered Software was made available under the terms of version 1.1
or earlier of the License, but not also under the terms of a Secondary
License.
1.6. "Executable Form"
means any form of the work other than Source Code Form.
1.7. "Larger Work"
means a work that combines Covered Software with other material, in a separate
file or files, that is not Covered Software.
1.8. "License"
means this document.
1.9. "Licensable"
means having the right to grant, to the maximum extent possible, whether at the
time of the initial grant or subsequently, any and all of the rights conveyed
by this License.
1.10. "Modifications"
means any of the following:
a.
any file in Source Code Form that results from an addition to, deletion
from, or modification of the contents of Covered Software; or
b.
any new file in Source Code Form that contains any Covered Software.
1.11. "Patent Claims" of a Contributor
means any patent claim(s), including without limitation, method, process, and
apparatus claims, in any patent Licensable by such Contributor that would be
infringed, but for the grant of the License, by the making, using, selling,
offering for sale, having made, import, or transfer of either its Contributions
or its Contributor Version.
1.12. "Secondary License"
means either the GNU General Public License, Version 2.0, the GNU Lesser
General Public License, Version 2.1, the GNU Affero General Public License,
Version 3.0, or any later versions of those licenses.
1.13. "Source Code Form"
means the form of the work preferred for making modifications.
1.14. "You" (or "Your")
means an individual or a legal entity exercising rights under this License. For
legal entities, "You" includes any entity that controls, is controlled by, or
is under common control with You. For purposes of this definition, "control"
means (a) the power, direct or indirect, to cause the direction or management
of such entity, whether by contract or otherwise, or (b) ownership of more than
fifty percent (50%) of the outstanding shares or beneficial ownership of such
entity.
2. License Grants and Conditions
--------------------------------
2.1. Grants
Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive
license:
a.
under intellectual property rights (other than patent or trademark)
Licensable by such Contributor to use, reproduce, make available, modify,
display, perform, distribute, and otherwise exploit its Contributions,
either on an unmodified basis, with Modifications, or as part of a Larger
Work; and
b.
under Patent Claims of such Contributor to make, use, sell, offer for sale,
have made, import, and otherwise transfer either its Contributions or its
Contributor Version.
2.2. Effective Date
The licenses granted in Section 2.1 with respect to any Contribution become
effective for each Contribution on the date the Contributor first distributes
such Contribution.
2.3. Limitations on Grant Scope
The licenses granted in this Section 2 are the only rights granted under this
License. No additional rights or licenses will be implied from the distribution
or licensing of Covered Software under this License. Notwithstanding
Section 2.1(b) above, no patent license is granted by a Contributor:
a.
for any code that a Contributor has removed from Covered Software; or
b.
for infringements caused by: (i) Your and any other third party's
modifications of Covered Software, or (ii) the combination of its
Contributions with other software (except as part of its Contributor
Version); or
c.
under Patent Claims infringed by Covered Software in the absence of its
Contributions.
This License does not grant any rights in the trademarks, service marks, or
logos of any Contributor (except as may be necessary to comply with the notice
requirements in Section 3.4).
2.4. Subsequent Licenses
No Contributor makes additional grants as a result of Your choice to distribute
the Covered Software under a subsequent version of this License (see
Section 10.2) or under the terms of a Secondary License (if permitted under the
terms of Section 3.3).
2.5. Representation
Each Contributor represents that the Contributor believes its Contributions are
its original creation(s) or it has sufficient rights to grant the rights to its
Contributions conveyed by this License.
2.6. Fair Use
This License is not intended to limit any rights You have under applicable
copyright doctrines of fair use, fair dealing, or other equivalents.
2.7. Conditions
Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
Section 2.1.
3. Responsibilities
-------------------
3.1. Distribution of Source Form
All distribution of Covered Software in Source Code Form, including any
Modifications that You create or to which You contribute, must be under the
terms of this License. You must inform recipients that the Source Code Form of
the Covered Software is governed by the terms of this License, and how they can
obtain a copy of this License. You may not attempt to alter or restrict the
recipients' rights in the Source Code Form.
3.2. Distribution of Executable Form
If You distribute Covered Software in Executable Form then:
a.
such Covered Software must also be made available in Source Code Form, as
described in Section 3.1, and You must inform recipients of the Executable
Form how they can obtain a copy of such Source Code Form by reasonable
means in a timely manner, at a charge no more than the cost of distribution
to the recipient; and
b.
You may distribute such Executable Form under the terms of this License, or
sublicense it under different terms, provided that the license for the
Executable Form does not attempt to limit or alter the recipients' rights
in the Source Code Form under this License.
3.3. Distribution of a Larger Work
You may create and distribute a Larger Work under terms of Your choice,
provided that You also comply with the requirements of this License for the
Covered Software. If the Larger Work is a combination of Covered Software with
a work governed by one or more Secondary Licenses, and the Covered Software is
not Incompatible With Secondary Licenses, this License permits You to
additionally distribute such Covered Software under the terms of such Secondary
License(s), so that the recipient of the Larger Work may, at their option,
further distribute the Covered Software under the terms of either this License
or such Secondary License(s).
3.4. Notices
You may not remove or alter the substance of any license notices (including
copyright notices, patent notices, disclaimers of warranty, or limitations of
liability) contained within the Source Code Form of the Covered Software,
except that You may alter any license notices to the extent required to remedy
known factual inaccuracies.
3.5. Application of Additional Terms
You may choose to offer, and to charge a fee for, warranty, support, indemnity
or liability obligations to one or more recipients of Covered Software.
However, You may do so only on Your own behalf, and not on behalf of any
Contributor. You must make it absolutely clear that any such warranty, support,
indemnity, or liability obligation is offered by You alone, and You hereby
agree to indemnify every Contributor for any liability incurred by such
Contributor as a result of warranty, support, indemnity or liability terms You
offer. You may include additional disclaimers of warranty and limitations of
liability specific to any jurisdiction.
4. Inability to Comply Due to Statute or Regulation
---------------------------------------------------
If it is impossible for You to comply with any of the terms of this License with
respect to some or all of the Covered Software due to statute, judicial order, or
regulation then You must: (a) comply with the terms of this License to the
maximum extent possible; and (b) describe the limitations and the code they
affect. Such description must be placed in a text file included with all
distributions of the Covered Software under this License. Except to the extent
prohibited by statute or regulation, such description must be sufficiently
detailed for a recipient of ordinary skill to be able to understand it.
5. Termination
--------------
5.1. The rights granted under this License will terminate automatically if You
fail to comply with any of its terms. However, if You become compliant, then
the rights granted under this License from a particular Contributor are
reinstated (a) provisionally, unless and until such Contributor explicitly and
finally terminates Your grants, and (b) on an ongoing basis, if such
Contributor fails to notify You of the non-compliance by some reasonable means
prior to 60 days after You have come back into compliance. Moreover, Your
grants from a particular Contributor are reinstated on an ongoing basis if such
Contributor notifies You of the non-compliance by some reasonable means, this
is the first time You have received notice of non-compliance with this License
from such Contributor, and You become compliant prior to 30 days after Your
receipt of the notice.
5.2. If You initiate litigation against any entity by asserting a patent
infringement claim (excluding declaratory judgment actions, counter-claims, and
cross-claims) alleging that a Contributor Version directly or indirectly
infringes any patent, then the rights granted to You by any and all
Contributors for the Covered Software under Section 2.1 of this License shall
terminate.
5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
license agreements (excluding distributors and resellers) which have been
validly granted by You or Your distributors under this License prior to
termination shall survive termination.
6. Disclaimer of Warranty
-------------------------
Covered Software is provided under this License on an "as is" basis, without
warranty of any kind, either expressed, implied, or statutory, including, without
limitation, warranties that the Covered Software is free of defects,
merchantable, fit for a particular purpose or non-infringing. The entire risk as
to the quality and performance of the Covered Software is with You. Should any
Covered Software prove defective in any respect, You (not any Contributor) assume
the cost of any necessary servicing, repair, or correction. This disclaimer of
warranty constitutes an essential part of this License. No use of any Covered
Software is authorized under this License except under this disclaimer.
7. Limitation of Liability
--------------------------
Under no circumstances and under no legal theory, whether tort (including
negligence), contract, or otherwise, shall any Contributor, or anyone who
distributes Covered Software as permitted above, be liable to You for any direct,
indirect, special, incidental, or consequential damages of any character
including, without limitation, damages for lost profits, loss of goodwill, work
stoppage, computer failure or malfunction, or any and all other commercial
damages or losses, even if such party shall have been informed of the possibility
of such damages. This limitation of liability shall not apply to liability for
death or personal injury resulting from such party's negligence to the extent
applicable law prohibits such limitation. Some jurisdictions do not allow the
exclusion or limitation of incidental or consequential damages, so this exclusion
and limitation may not apply to You.
8. Litigation
-------------
Any litigation relating to this License may be brought only in the courts of a
jurisdiction where the defendant maintains its principal place of business and
such litigation shall be governed by laws of that jurisdiction, without reference
to its conflict-of-law provisions. Nothing in this Section shall prevent a
party's ability to bring cross-claims or counter-claims.
9. Miscellaneous
----------------
This License represents the complete agreement concerning the subject matter
hereof. If any provision of this License is held to be unenforceable, such
provision shall be reformed only to the extent necessary to make it enforceable.
Any law or regulation which provides that the language of a contract shall be
construed against the drafter shall not be used to construe this License against
a Contributor.
10. Versions of the License
---------------------------
10.1. New Versions
Mozilla Foundation is the license steward. Except as provided in Section 10.3,
no one other than the license steward has the right to modify or publish new
versions of this License. Each version will be given a distinguishing version
number.
10.2. Effect of New Versions
You may distribute the Covered Software under the terms of the version of the
License under which You originally received the Covered Software, or under the
terms of any subsequent version published by the license steward.
10.3. Modified Versions
If you create software not governed by this License, and you want to create a
new license for such software, you may create and use a modified version of
this License if you rename the license and remove any references to the name of
the license steward (except to note that such modified license differs from
this License).
10.4. Distributing Source Code Form that is Incompatible With Secondary
Licenses
If You choose to distribute Source Code Form that is Incompatible With
Secondary Licenses under the terms of this version of the License, the notice
described in Exhibit B of this License must be attached.
Exhibit A - Source Code Form License Notice
-------------------------------------------
This Source Code Form is subject to the terms of the Mozilla Public License,
v. 2.0. If a copy of the MPL was not distributed with this file, You can
obtain one at http://mozilla.org/MPL/2.0/.
If it is not possible or desirable to put the notice in a particular file, then
You may include the notice in a location (such as a LICENSE file in a relevant
directory) where a recipient would be likely to look for such a notice.
You may add additional accurate notices of copyright ownership.
Exhibit B - "Incompatible With Secondary Licenses" Notice
---------------------------------------------------------
This Source Code Form is "Incompatible With Secondary Licenses", as defined
by the Mozilla Public License, v. 2.0.
mpmath
1.3.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
msgpack
1.1.0
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
NetworkX
3.4.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
nobuco
0.17.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
numba
0.61.2
License: BSD 2-clause "Simplified" License
License: BSD 2-clause "Simplified" License (SPDX-License-Identifier: BSD-2-Clause)
BSD Two Clause License
======================
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
NumPy
1.26.4
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
nvidia-cufft-cu12
11.0.2.54
License: NVIDIA End User License Agreement v13.0
License: NVIDIA End User License Agreement v13.0 (SPDX-License-Identifier: None)
This software contains source code provided by NVIDIA Corporation.
End User License Agreement
NVIDIA Software License Agreement and CUDA Supplement to Software License Agreement.
The CUDA Toolkit End User License Agreement applies to the NVIDIA
CUDA Toolkit, the NVIDIA CUDA Samples, the NVIDIA Display Driver,
NVIDIA Nsight tools (Visual Studio Edition), and the associated
documentation on CUDA APIs, programming model and development tools.
If you do not agree with the terms and conditions of the license
agreement, then do not download or use the software.
Last updated: January 7, 2025
Preface
The Software License Agreement in Chapter 1 and the Supplement in
Chapter 2 contain license terms and conditions that govern the use
of NVIDIA CUDA toolkit. By accepting this agreement, you agree to
comply with all the terms and conditions applicable to the product(s)
included herein.
NVIDIA Driver
Description
This package contains the operating system driver and fundamental
system software components for NVIDIA GPUs.
NVIDIA CUDA Toolkit
Description
The NVIDIA CUDA Toolkit provides command-line and graphical tools
for building, debugging and optimizing the performance of applications
accelerated by NVIDIA GPUs, runtime and math libraries, and
documentation including programming guides, user manuals, and API
references.
Default Install Location of CUDA Toolkit
Windows platform:
%ProgramFiles%\NVIDIA GPU Computing Toolkit\CUDA\v#.#
Linux platform:
/usr/local/cuda-#.#
Mac platform:
/Developer/NVIDIA/CUDA-#.#
NVIDIA CUDA Samples
Description
CUDA Samples are now located in https://github.com/nvidia/cuda-samples,
which includes instructions for obtaining, building, and running
the samples. They are no longer included in the CUDA toolkit.
NVIDIA Nsight Visual Studio Edition (Windows only)
Description
NVIDIA Nsight Development Platform, Visual Studio Edition is a
development environment integrated into Microsoft Visual Studio
that provides tools for debugging, profiling, analyzing and optimizing
your GPU computing and graphics applications.
Default Install Location of Nsight Visual Studio Edition
Windows platform:
%ProgramFiles(x86)%\NVIDIA Corporation\Nsight Visual Studio Edition #.#
1. License Agreement for NVIDIA Software Development Kits
Important Notice—Read before downloading, installing, copying or
using the licensed software:
This license agreement, including exhibits attached ("Agreement")
is a legal agreement between you and NVIDIA Corporation ("NVIDIA")
and governs your use of a NVIDIA software development kit ("SDK").
Each SDK has its own set of software and materials, but here is a
description of the types of items that may be included in a SDK:
source code, header files, APIs, data sets and assets (examples
include images, textures, models, scenes, videos, native API
input/output files), binary software, sample code, libraries, utility
programs, programming code and documentation.
This Agreement can be accepted only by an adult of legal age of
majority in the country in which the SDK is used.
If you are entering into this Agreement on behalf of a company or
other legal entity, you represent that you have the legal authority
to bind the entity to this Agreement, in which case "you" will mean
the entity you represent.
If you don't have the required age or authority to accept this
Agreement, or if you don't accept all the terms and conditions of
this Agreement, do not download, install or use the SDK.
You agree to use the SDK only for purposes that are permitted by
(a) this Agreement, and (b) any applicable law, regulation or
generally accepted practices or guidelines in the relevant
jurisdictions.
1.1. License
1.1.1. License Grant
Subject to the terms of this Agreement, NVIDIA hereby grants you a
non-exclusive, non-transferable license, without the right to
sublicense (except as expressly provided in this Agreement) to:
1. Install and use the SDK,
2. Modify and create derivative works of sample source code delivered
in the SDK, and
3. Distribute those portions of the SDK that are identified in this
Agreement as distributable, as incorporated in object code format
into a software application that meets the distribution requirements
indicated in this Agreement.
1.1.2. Distribution Requirements
These are the distribution requirements for you to exercise the
distribution grant:
1. Your application must have material additional functionality,
beyond the included portions of the SDK.
2. The distributable portions of the SDK shall only be accessed by
your application.
3. The following notice shall be included in modifications and
derivative works of sample source code distributed: "This software
contains source code provided by NVIDIA Corporation."
4. Unless a developer tool is identified in this Agreement as
distributable, it is delivered for your internal use only.
5. The terms under which you distribute your application must be
consistent with the terms of this Agreement, including (without
limitation) terms relating to the license grant and license
restrictions and protection of NVIDIA's intellectual property rights.
Additionally, you agree that you will protect the privacy, security
and legal rights of your application users.
6. You agree to notify NVIDIA in writing of any known or suspected
distribution or use of the SDK not in compliance with the requirements
of this Agreement, and to enforce the terms of your agreements with
respect to distributed SDK.
1.1.3. Authorized Users
You may allow employees and contractors of your entity or of your
subsidiary(ies) to access and use the SDK from your secure network
to perform work on your behalf.
If you are an academic institution you may allow users enrolled or
employed by the academic institution to access and use the SDK from
your secure network.
You are responsible for the compliance with the terms of this
Agreement by your authorized users. If you become aware that your
authorized users didn't follow the terms of this Agreement, you
agree to take reasonable steps to resolve the non-compliance and
prevent new occurrences.
1.1.4. Pre-Release SDK
The SDK versions identified as alpha, beta, preview or otherwise
as pre-release, may not be fully functional, may contain errors or
design flaws, and may have reduced or different security, privacy,
accessibility, availability, and reliability standards relative to
commercial versions of NVIDIA software and materials. Use of a
pre-release SDK may result in unexpected results, loss of data,
project delays or other unpredictable damage or loss.
You may use a pre-release SDK at your own risk, understanding that
pre-release SDKs are not intended for use in production or
business-critical systems.
NVIDIA may choose not to make available a commercial version of any
pre-release SDK. NVIDIA may also choose to abandon development and
terminate the availability of a pre-release SDK at any time without
liability.
1.1.5. Updates
NVIDIA may, at its option, make available patches, workarounds or
other updates to this SDK. Unless the updates are provided with
their separate governing terms, they are deemed part of the SDK
licensed to you as provided in this Agreement. You agree that the
form and content of the SDK that NVIDIA provides may change without
prior notice to you. While NVIDIA generally maintains compatibility
between versions, NVIDIA may in some cases make changes that introduce
incompatibilities in future versions of the SDK.
1.1.6. Components Under Other Licenses
The SDK may come bundled with, or otherwise include or be distributed
with, NVIDIA or third-party components with separate legal notices
or terms as may be described in proprietary notices accompanying
the SDK. If and to the extent there is a conflict between the terms
in this Agreement and the license terms associated with the component,
the license terms associated with the components control only to
the extent necessary to resolve the conflict.
Subject to the other terms of this Agreement, you may use the SDK
to develop and test applications released under Open Source Initiative
(OSI) approved open source software licenses.
1.1.7. Reservation of Rights
NVIDIA reserves all rights, title, and interest in and to the SDK,
not expressly granted to you under this Agreement.
1.2. Limitations
The following license limitations apply to your use of the SDK:
1. You may not reverse engineer, decompile or disassemble, or remove
copyright or other proprietary notices from any portion of the SDK
or copies of the SDK.
2. Except as expressly provided in this Agreement, you may not copy,
sell, rent, sublicense, transfer, distribute, modify, or create
derivative works of any portion of the SDK. For clarity, you may
not distribute or sublicense the SDK as a stand-alone product.
3. Unless you have an agreement with NVIDIA for this purpose, you
may not indicate that an application created with the SDK is sponsored
or endorsed by NVIDIA.
4. You may not bypass, disable, or circumvent any encryption,
security, digital rights management or authentication mechanism in
the SDK.
5. You may not use the SDK in any manner that would cause it to
become subject to an open source software license. As examples,
licenses that require as a condition of use, modification, and/or
distribution that the SDK be:
a. Disclosed or distributed in source code form;
b. Licensed for the purpose of making derivative works; or
c. Redistributable at no charge.
6. You acknowledge that the SDK as delivered is not tested or
certified by NVIDIA for use in connection with the design, construction,
maintenance, and/or operation of any system where the use or failure
of such system could result in a situation that threatens the safety
of human life or results in catastrophic damages (each, a "Critical
Application"). Examples of Critical Applications include use in
avionics, navigation, autonomous vehicle applications, ai solutions
for automotive products, military, medical, life support or other
life critical applications. NVIDIA shall not be liable to you or
any third party, in whole or in part, for any claims or damages
arising from such uses. You are solely responsible for ensuring
that any product or service developed with the SDK as a whole
includes sufficient features to comply with all applicable legal
and regulatory standards and requirements.
7. You agree to defend, indemnify and hold harmless NVIDIA and its
affiliates, and their respective employees, contractors, agents,
officers and directors, from and against any and all claims, damages,
obligations, losses, liabilities, costs or debt, fines, restitutions
and expenses (including but not limited to attorney's fees and costs
incident to establishing the right of indemnification) arising out
of or related to products or services that use the SDK in or for
Critical Applications, and for use of the SDK outside of the scope
of this Agreement or not in compliance with its terms.
8. You may not reverse engineer, decompile or disassemble any portion
of the output generated using SDK elements for the purpose of
translating such output artifacts to target a non-NVIDIA platform.
1.3. Ownership
1. NVIDIA or its licensors hold all rights, title and interest in
and to the SDK and its modifications and derivative works, including
their respective intellectual property rights, subject to your
rights under Section 1.3.2. This SDK may include software and
materials from NVIDIA's licensors, and these licensors are intended
third party beneficiaries that may enforce this Agreement with
respect to their intellectual property rights.
1. You hold all rights, title and interest in and to your applications
and your derivative works of the sample source code delivered in
the SDK, including their respective intellectual property rights,
subject to NVIDIA's rights under Section 1.3.1.
2. You may, but don't have to, provide to NVIDIA suggestions, feature
requests or other feedback regarding the SDK, including possible
enhancements or modifications to the SDK. For any feedback that you
voluntarily provide, you hereby grant NVIDIA and its affiliates a
perpetual, non-exclusive, worldwide, irrevocable license to use,
reproduce, modify, license, sublicense (through multiple tiers of
sublicensees), and distribute (through multiple tiers of distributors)
it without the payment of any royalties or fees to you. NVIDIA will
use feedback at its choice. NVIDIA is constantly looking for ways
to improve its products, so you may send feedback to NVIDIA through
the developer portal at https://developer.nvidia.com.
1.4. No Warranties
THE SDK IS PROVIDED BY NVIDIA "AS IS" AND "WITH ALL FAULTS." TO THE
MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND ITS AFFILIATES EXPRESSLY
DISCLAIM ALL WARRANTIES OF ANY KIND OR NATURE, WHETHER EXPRESS,
IMPLIED OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE,
NON-INFRINGEMENT, OR THE ABSENCE OF ANY DEFECTS THEREIN, WHETHER
LATENT OR PATENT. NO WARRANTY IS MADE ON THE BASIS OF TRADE USAGE,
COURSE OF DEALING OR COURSE OF TRADE.
1.5. Limitation of Liability
TO THE MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND ITS AFFILIATES
SHALL NOT BE LIABLE FOR ANY (I) SPECIAL, INCIDENTAL, PUNITIVE OR
CONSEQUENTIAL DAMAGES, OR (II) DAMAGES FOR (A) ANY LOST PROFITS,
LOSS OF USE, LOSS OF DATA OR LOSS OF GOODWILL, OR (B) THE COSTS OF
PROCURING SUBSTITUTE PRODUCTS, ARISING OUT OF OR IN CONNECTION WITH
THIS AGREEMENT OR THE USE OR PERFORMANCE OF THE SDK, WHETHER SUCH
LIABILITY ARISES FROM ANY CLAIM BASED UPON BREACH OF CONTRACT,
BREACH OF WARRANTY, TORT (INCLUDING NEGLIGENCE), PRODUCT LIABILITY
OR ANY OTHER CAUSE OF ACTION OR THEORY OF LIABILITY. IN NO EVENT
WILL NVIDIA'S AND ITS AFFILIATES TOTAL CUMULATIVE LIABILITY UNDER
OR ARISING OUT OF THIS AGREEMENT EXCEED US$10.00. THE NATURE OF THE
LIABILITY OR THE NUMBER OF CLAIMS OR SUITS SHALL NOT ENLARGE OR
EXTEND THIS LIMIT.
These exclusions and limitations of liability shall apply regardless
if NVIDIA or its affiliates have been advised of the possibility
of such damages, and regardless of whether a remedy fails its
essential purpose. These exclusions and limitations of liability
form an essential basis of the bargain between the parties, and,
absent any of these exclusions or limitations of liability, the
provisions of this Agreement, including, without limitation, the
economic terms, would be substantially different.
1.6. Termination
1. This Agreement will continue to apply until terminated by either
you or NVIDIA as described below.
2. If you want to terminate this Agreement, you may do so by stopping
to use the SDK.
3. NVIDIA may, at any time, terminate this Agreement if:
(i) you fail to comply with any term of this Agreement and the
non-compliance is not fixed within thirty (30) days following notice
from NVIDIA (or immediately if you violate NVIDIA's intellectual
property rights);
(ii) you commence or participate in any legal proceeding against
NVIDIA with respect to the SDK; or
(iii) NVIDIA decides to no longer provide the SDK in a country or,
in NVIDIA's sole discretion, the continued use of it is no longer
commercially viable.
4. Upon any termination of this Agreement, you agree to promptly
discontinue use of the SDK and destroy all copies in your possession
or control. Your prior distributions in accordance with this Agreement
are not affected by the termination of this Agreement. Upon written
request, you will certify in writing that you have complied with
your commitments under this section. Upon any termination of this
Agreement all provisions survive except for the license grant
provisions.
1.7. General
If you wish to assign this Agreement or your rights and obligations,
including by merger, consolidation, dissolution or operation of
law, contact NVIDIA to ask for permission. Any attempted assignment
not approved by NVIDIA in writing shall be void and of no effect.
NVIDIA may assign, delegate or transfer this Agreement and its
rights and obligations, and if to a non-affiliate you will be
notified.
You agree to cooperate with NVIDIA and provide reasonably requested
information to verify your compliance with this Agreement.
This Agreement will be governed in all respects by the laws of the
United States and of the State of Delaware, without regard to the
conflicts of laws principles. The United Nations Convention on
Contracts for the International Sale of Goods is specifically
disclaimed. You agree to all terms of this Agreement in the English
language.
The state or federal courts residing in Santa Clara County, California
shall have exclusive jurisdiction over any dispute or claim arising
out of this Agreement. Notwithstanding this, you agree that NVIDIA
shall still be allowed to apply for injunctive remedies or an
equivalent type of urgent legal relief in any jurisdiction.
If any court of competent jurisdiction determines that any provision
of this Agreement is illegal, invalid or unenforceable, such provision
will be construed as limited to the extent necessary to be consistent
with and fully enforceable under the law and the remaining provisions
will remain in full force and effect. Unless otherwise specified,
remedies are cumulative.
Each party acknowledges and agrees that the other is an independent
contractor in the performance of this Agreement.
The SDK has been developed entirely at private expense and is
"commercial items" consisting of "commercial computer software" and
"commercial computer software documentation" provided with RESTRICTED
RIGHTS. Use, duplication or disclosure by the U.S. Government or a
U.S. Government subcontractor is subject to the restrictions in
this Agreement pursuant to DFARS 227.7202-3(a) or as set forth in
subparagraphs (c)(1) and (2) of the Commercial Computer Software -
Restricted Rights clause at FAR 52.227-19, as applicable.
Contractor/manufacturer is NVIDIA, 2788 San Tomas Expressway, Santa
Clara, CA 95051.
The SDK is subject to United States export laws and regulations.
You agree that you will not ship, transfer or export the SDK into
any country, or use the SDK in any manner, prohibited by the United
States Bureau of Industry and Security or economic sanctions
regulations administered by the U.S. Department of Treasury's Office
of Foreign Assets Control (OFAC), or any applicable export laws,
restrictions or regulations. These laws include restrictions on
destinations, end users and end use. By accepting this Agreement,
you confirm that you are not located in a country currently embargoed
by the U.S. or otherwise prohibited from receiving the SDK under
U.S. law.
Any notice delivered by NVIDIA to you under this Agreement will be
delivered via mail, email or fax. You agree that any notices that
NVIDIA sends you electronically will satisfy any legal communication
requirements. Please direct your legal notices or other correspondence
to NVIDIA Corporation, 2788 San Tomas Expressway, Santa Clara,
California 95051, United States of America, Attention: Legal
Department.
This Agreement and any exhibits incorporated into this Agreement
constitute the entire agreement of the parties with respect to the
subject matter of this Agreement and supersede all prior negotiations
or documentation exchanged between the parties relating to this SDK
license. Any additional and/or conflicting terms on documents issued
by you are null, void, and invalid. Any amendment or waiver under
this Agreement shall be in writing and signed by representatives
of both parties.
2. CUDA Toolkit Supplement to Software License Agreement for NVIDIA Software Development Kits
The terms in this supplement govern your use of the NVIDIA CUDA
Toolkit SDK under the terms of your license agreement ("Agreement")
as modified by this supplement. Capitalized terms used but not
defined below have the meaning assigned to them in the Agreement.
This supplement is an exhibit to the Agreement and is incorporated
as an integral part of the Agreement. In the event of conflict
between the terms in this supplement and the terms in the Agreement,
the terms in this supplement govern.
2.1. License Scope
The SDK is licensed for you to develop applications only for use
in systems with NVIDIA GPUs.
2.2. Distribution
The portions of the SDK that are distributable under the Agreement
are listed in Attachment A.
2.3. Operating Systems
Those portions of the SDK designed exclusively for use on the Linux
or FreeBSD operating systems, or other operating systems derived
from the source code to these operating systems, may be copied and
redistributed for use in accordance with this Agreement, provided
that the object code files are not modified in any way (except for
unzipping of compressed files).
2.4. Audio and Video Encoders and Decoders
You acknowledge and agree that it is your sole responsibility to
obtain any additional third-party licenses required to make, have
made, use, have used, sell, import, and offer for sale your products
or services that include or incorporate any third-party software
and content relating to audio and/or video encoders and decoders
from, including but not limited to, Microsoft, Thomson, Fraunhofer
IIS, Sisvel S.p.A., MPEG-LA, and Coding Technologies. NVIDIA does
not grant to you under this Agreement any necessary patent or other
rights with respect to any audio and/or video encoders and decoders.
2.5. Licensing
If the distribution terms in this Agreement are not suitable for
your organization, or for any questions regarding this Agreement,
please contact NVIDIA at nvidia-compute-license-questions@nvidia.com.
2.6. Attachment A
The following CUDA Toolkit files may be distributed with applications
developed by you, including certain variations of these files that
have version number or architecture specific information embedded
in the file name - as an example only, for release version 9.0 of
the 64-bit Windows software, the file cudart64_90.dll is redistributable.
Component CUDA Runtime
--------- ------------
Windows cudart.dll, cudart_static.lib, cudadevrt.lib
Mac OSX libcudart.dylib, libcudart_static.a, libcudadevrt.a
Linux libcudart.so, libcudart_static.a, libcudadevrt.a
Android libcudart.so, libcudart_static.a, libcudadevrt.a
Component CUDA FFT Library
--------- ----------------
Windows cufft.dll, cufftw.dll, cufft.lib, cufftw.lib
Mac OSX libcufft.dylib, libcufft_static.a, libcufftw.dylib, libcufftw_static.a
Linux libcufft.so, libcufft_static.a, libcufftw.so, libcufftw_static.a
Android libcufft.so, libcufft_static.a, libcufftw.so, libcufftw_static.a
Component CUDA BLAS Library
--------- -----------------
Windows cublas.dll, cublasLt.dll
Mac OSX libcublas.dylib, libcublasLt.dylib, libcublas_static.a, libcublasLt_static.a
Linux libcublas.so, libcublasLt.so, libcublas_static.a, libcublasLt_static.a
Android libcublas.so, libcublasLt.so, libcublas_static.a, libcublasLt_static.a
Component NVIDIA "Drop-in" BLAS Library
--------- -----------------
Windows nvblas.dll
Mac OSX libnvblas.dylib
Linux libnvblas.so
Component CUDA Sparse Matrix Library
--------- -----------------
Windows cusparse.dll, cusparse.lib
Mac OSX libcusparse.dylib, libcusparse_static.a
Linux libcusparse.so, libcusparse_static.a
Android libcusparse.so, libcusparse_static.a
Component CUDA Linear Solver Library
--------- -----------------
Windows cusolver.dll, cusolver.lib
Mac OSX libcusolver.dylib, libcusolver_static.a
Linux libcusolver.so, libcusolver_static.a
Android libcusolver.so, libcusolver_static.a
Component CUDA Random Number Generation Library
--------- -----------------
Windows curand.dll, curand.lib
Mac OSX libcurand.dylib, libcurand_static.a
Linux libcurand.so, libcurand_static.a
Android libcurand.so, libcurand_static.a
Component NVIDIA Performance Primitives Library
--------- -----------------
Windows nppc.dll, nppc.lib, nppial.dll, nppial.lib, nppicc.dll, nppicc.lib, nppicom.dll, nppicom.lib, nppidei.dll, nppidei.lib, nppif.dll, nppif.lib, nppig.dll, nppig.lib, nppim.dll, nppim.lib, nppist.dll, nppist.lib, nppisu.dll, nppisu.lib, nppitc.dll, nppitc.lib, npps.dll, npps.lib
Mac OSX libnppc.dylib, libnppc_static.a, libnppial.dylib, libnppial_static.a, libnppicc.dylib, libnppicc_static.a, libnppicom.dylib, libnppicom_static.a, libnppidei.dylib, libnppidei_static.a, libnppif.dylib, libnppif_static.a, libnppig.dylib, libnppig_static.a, libnppim.dylib, libnppisu_static.a, libnppitc.dylib, libnppitc_static.a, libnpps.dylib, libnpps_static.a
Linux libnppc.so, libnppc_static.a, libnppial.so, libnppial_static.a, libnppicc.so, libnppicc_static.a, libnppicom.so, libnppicom_static.a, libnppidei.so, libnppidei_static.a, libnppif.so, libnppif_static.a libnppig.so, libnppig_static.a, libnppim.so, libnppim_static.a, libnppist.so, libnppist_static.a, libnppisu.so, libnppisu_static.a, libnppitc.so libnppitc_static.a, libnpps.so, libnpps_static.a
Android libnppc.so, libnppc_static.a, libnppial.so, libnppial_static.a, libnppicc.so, libnppicc_static.a, libnppicom.so, libnppicom_static.a, libnppidei.so, libnppidei_static.a, libnppif.so, libnppif_static.a libnppig.so, libnppig_static.a, libnppim.so, libnppim_static.a, libnppist.so, libnppist_static.a, libnppisu.so, libnppisu_static.a, libnppitc.so libnppitc_static.a, libnpps.so, libnpps_static.a
Component NVIDIA JPEG Library
--------- -----------------
Windows nvjpeg.lib, nvjpeg.dll
Linux libnvjpeg.so, libnvjpeg_static.a
Component Internal common library required for statically linking to cuBLAS, cuSPARSE, cuFFT, cuRAND, nvJPEG and NPP
--------- -----------------
Mac OSX libculibos.a
Linux libculibos.a
Component NVIDIA Runtime Compilation Library and Header
--------- -----------------
All nvrtc.h
Windows nvrtc.dll, nvrtc-builtins.dll
Mac OSX libnvrtc.dylib, libnvrtc-builtins.dylib
Linux libnvrtc.so, libnvrtc-builtins.so, libnvrtc_static.a, libnvrtc-builtins_static.a
Component NVIDIA Optimizing Compiler Library
--------- -----------------
Windows nvvm.dll
Mac OSX libnvvm.dylib
Linux libnvvm.so
Component NVIDIA JIT Linking Library
--------- -----------------
Windows libnvJitLink.dll, libnvJitLink.lib
Linux libnvJitLink.so, libnvJitLink_static.a
Component NVIDIA Common Device Math Functions Library
--------- -----------------
Windows libdevice.10.bc
Mac OSX libdevice.10.bc
Linux libdevice.10.bc
Component CUDA Occupancy Calculation Header Library
--------- -----------------
All cuda_occupancy.h
Component CUDA Floating Point Type Headers
--------- -----------------
All cuda_fp16.h, cuda_fp16.hpp, cuda_bf16.h, cuda_bf16.hpp, cuda_fp8.h, cuda_fp8.hpp, cuda_fp6.h, cuda_fp6.hpp, cuda_fp4.h, cuda_fp4.hpp
Component CUDA Headers for Runtime Compilation
--------- -----------------
All crt/host_defines.h, cuComplex.h, cuda_awbarrier_helpers.h, cuda_awbarrier_primitives.h, cuda_wbarrier.h, cuda_pipeline_helpers.h, cuda_pipeline_primitives.h, cuda_pipeline.h, cuda_runtime_api.h, cuda.h, cuda/std/tuple, cuda/std/type_traits, cuda/std/type_traits, cuda/std/utility, device_types.h, vector_functions.h, vector_types.h
Component CUDA Profiling Tools Interface (CUPTI) Library
--------- -----------------
Windows cupti.dll
Mac OSX libcupti.dylib
Linux libcupti.so
Component NVIDIA Tools Extension Library
--------- -----------------
Windows nvToolsExt.dll, nvToolsExt.lib
Mac OSX libnvToolsExt.dylib
Linux libnvToolsExt.so
Component NVIDIA CUDA Driver Libraries
--------- -----------------
Linux libcuda.so, libnvidia-ptxjitcompiler.so, libnvptxcompiler_static.a
Component NVIDIA CUDA File IO Libraries and Header
--------- -----------------
All cufile.h
Linux libcufile.so, libcufile_rdma.so, libcufile_static.a, libcufile_rdma_static.a
In addition to the rights above, for parties that are developing
software intended solely for use on Jetson development kits or
Jetson modules, and running Linux for Tegra software, the following
shall apply:
The SDK may be distributed in its entirety, as provided by NVIDIA,
and without separation of its components, for you and/or your
licensees to create software development kits for use only on the
Jetson platform and running Linux for Tegra software.
2.7. Attachment B
Additional Licensing Obligations
The following third party components included in the SOFTWARE are
licensed to Licensee pursuant to the following terms and conditions:
1. Licensee's use of the GDB third party component is subject to the
terms and conditions of GNU GPL v3:
This product includes copyrighted third-party software licensed
under the terms of the GNU General Public License v3 ("GPL v3").
All third-party software packages are copyright by their respective
authors. GPL v3 terms and conditions are hereby incorporated into
the Agreement by this reference: http://www.gnu.org/licenses/gpl.txt
Consistent with these licensing requirements, the software listed
below is provided under the terms of the specified open source
software licenses. To obtain source code for software provided under
licenses that require redistribution of source code, including the
GNU General Public License (GPL) and GNU Lesser General Public
License (LGPL), contact oss-requests@nvidia.com. This offer is valid
for a period of three (3) years from the date of the distribution
of this product by NVIDIA CORPORATION.
Component License
CUDA-GDB GPL v3
2. Licensee represents and warrants that any and all third party
licensing and/or royalty payment obligations in connection with
Licensee's use of the H.264 video codecs are solely the responsibility
of Licensee.
3. Licensee's use of the Thrust library is subject to the terms and
conditions of the Apache License Version 2.0. All third-party
software packages are copyright by their respective authors. Apache
License Version 2.0 terms and conditions are hereby incorporated
into the Agreement by this reference.
http://www.apache.org/licenses/LICENSE-2.0.html
In addition, Licensee acknowledges the following notice: Thrust
includes source code from the Boost Iterator, Tuple, System, and
Random Number libraries.
Boost Software License - Version 1.0 - August 17th, 2003
. . . .
Permission is hereby granted, free of charge, to any person or
organization obtaining a copy of the software and accompanying
documentation covered by this license (the "Software") to use,
reproduce, display, distribute, execute, and transmit the Software,
and to prepare derivative works of the Software, and to permit
third-parties to whom the Software is furnished to do so, all
subject to the following:
The copyright notices in the Software and this entire statement,
including the above license grant, this restriction and the following
disclaimer, must be included in all copies of the Software, in whole
or in part, and all derivative works of the Software, unless such
copies or derivative works are solely in the form of machine-executable
object code generated by a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
4. Licensee's use of the LLVM third party component is subject to the
following terms and conditions:
========================================================================================================
All LLVM after 8.0 are distributed under Apache-2.0 with LLVM-exception license, an OSI-approved license
========================================================================================================
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 [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
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.
-----------------------------------------
LLVM Exceptions to the Apache 2.0 License
-----------------------------------------
As an exception, if, as a result of your compiling your source code, portions
of this Software are embedded into an Object form of such source code, you
may redistribute such embedded portions in such Object form without complying
with the conditions of Sections 4(a), 4(b) and 4(d) of the License.
In addition, if you combine or link compiled forms of this Software with
software that is licensed under the GPLv2 ("Combined Software") and if a
court of competent jurisdiction determines that the patent provision (Section
3), the indemnity provision (Section 9) or other Section of the License
conflicts with the conditions of the GPLv2, you may retroactively and
prospectively choose to deem waived or otherwise exclude such Section(s) of
the License, but only in their entirety and only with respect to the Combined
Software.
========================================================
Software from third parties included in the LLVM Project
========================================================
The LLVM Project contains third party software which is under different license
terms. All such code will be identified clearly using at least one of two
mechanisms:
1) It will be in a separate directory tree with its own `LICENSE.txt` or
`LICENSE` file at the top containing the specific license and restrictions
which apply to that software, or
2) It will contain specific license and restriction terms at the top of every
file.
==================================================================================================
LLVM releases prior to LLVM 8.0 was licensed under this University of Illinois Open Source License
==================================================================================================
University of Illinois/NCSA
Open Source License
Copyright (c) 2003-2019 University of Illinois at Urbana-Champaign.
All rights reserved.
Developed by:
LLVM Team
University of Illinois at Urbana-Champaign
http://llvm.org
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal with
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimers.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimers in the
documentation and/or other materials provided with the distribution.
* Neither the names of the LLVM Team, University of Illinois at
Urbana-Champaign, nor the names of its contributors may be used to
endorse or promote products derived from this Software without specific
prior written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
SOFTWARE.
5. Licensee's use of the PCRE third party component is subject to
the following terms and conditions:
------------
PCRE LICENCE
------------
PCRE is a library of functions to support regular expressions whose syntax
and semantics are as close as possible to those of the Perl 5 language.
Release 8 of PCRE is distributed under the terms of the "BSD" licence, as
specified below. The documentation for PCRE, supplied in the "doc"
directory, is distributed under the same terms as the software itself. The
basic library functions are written in C and are freestanding. Also
included in the distribution is a set of C++ wrapper functions, and a just-
in-time compiler that can be used to optimize pattern matching. These are
both optional features that can be omitted when the library is built.
THE BASIC LIBRARY FUNCTIONS
---------------------------
Written by: Philip Hazel
Email local part: ph10
Email domain: cam.ac.uk
University of Cambridge Computing Service,
Cambridge, England.
Copyright (c) 1997-2012 University of Cambridge
All rights reserved.
PCRE JUST-IN-TIME COMPILATION SUPPORT
-------------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2010-2012 Zoltan Herczeg
All rights reserved.
STACK-LESS JUST-IN-TIME COMPILER
--------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2009-2012 Zoltan Herczeg
All rights reserved.
THE C++ WRAPPER FUNCTIONS
-------------------------
Contributed by: Google Inc.
Copyright (c) 2007-2012, Google Inc.
All rights reserved.
THE "BSD" LICENCE
-----------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the name of Google
Inc. nor the names of their contributors may be used to endorse or
promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
6. Some of the cuBLAS library routines were written by or derived
from code written by Vasily Volkov and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2007-2009, Regents of the University of California
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the University of California, Berkeley nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
7. Some of the cuBLAS library routines were written by or derived
from code written by Davide Barbieri and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2008-2009 Davide Barbieri @ University of Rome Tor Vergata.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
8. Some of the cuBLAS library routines were derived from code
developed by the University of Tennessee and are subject to the
Modified Berkeley Software Distribution License as follows:
Copyright (c) 2010 The University of Tennessee.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer listed in this license in the documentation and/or
other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
9. Some of the cuBLAS library routines were written by or derived
from code written by Jonathan Hogg and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2012, The Science and Technology Facilities Council (STFC).
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the STFC nor the names of its contributors
may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE STFC BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
10. Some of the cuBLAS library routines were written by or derived
from code written by Ahmad M. Abdelfattah, David Keyes, and Hatem
Ltaief, and are subject to the Apache License, Version 2.0, as
follows:
-- (C) Copyright 2013 King Abdullah University of Science and Technology
Authors:
Ahmad Abdelfattah (ahmad.ahmad@kaust.edu.sa)
David Keyes (david.keyes@kaust.edu.sa)
Hatem Ltaief (hatem.ltaief@kaust.edu.sa)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the King Abdullah University of Science and
Technology nor the names of its contributors may be used to endorse
or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
11. Some of the cuSPARSE library routines were written by or derived
from code written by Li-Wen Chang and are subject to the NCSA Open
Source License as follows:
Copyright (c) 2012, University of Illinois.
All rights reserved.
Developed by: IMPACT Group, University of Illinois, http://impact.crhc.illinois.edu
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal with the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimers in the documentation and/or other materials provided
with the distribution.
* Neither the names of IMPACT Group, University of Illinois, nor
the names of its contributors may be used to endorse or promote
products derived from this Software without specific prior
written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
SOFTWARE.
12. Some of the cuRAND library routines were written by or derived
from code written by Mutsuo Saito and Makoto Matsumoto and are
subject to the following license:
Copyright (c) 2009, 2010 Mutsuo Saito, Makoto Matsumoto and Hiroshima
University. All rights reserved.
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
University and University of Tokyo. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the Hiroshima University nor the names of
its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
13. Some of the cuRAND library routines were derived from code
developed by D. E. Shaw Research and are subject to the following
license:
Copyright 2010-2011, D. E. Shaw Research.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions, and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of D. E. Shaw Research nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
14. Some of the Math library routines were written by or derived
from code developed by Norbert Juffa and are subject to the following
license:
Copyright (c) 2015-2017, Norbert Juffa
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
15. Licensee's use of the lz4 third party component is subject to
the following terms and conditions:
Copyright (C) 2011-2013, Yann Collet.
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
16. The NPP library uses code from the Boost Math Toolkit, and is
subject to the following license:
Boost Software License - Version 1.0 - August 17th, 2003
. . . .
Permission is hereby granted, free of charge, to any person or
organization obtaining a copy of the software and accompanying
documentation covered by this license (the "Software") to use,
reproduce, display, distribute, execute, and transmit the Software,
and to prepare derivative works of the Software, and to permit
third-parties to whom the Software is furnished to do so, all
subject to the following:
The copyright notices in the Software and this entire statement,
including the above license grant, this restriction and the following
disclaimer, must be included in all copies of the Software, in whole
or in part, and all derivative works of the Software, unless such
copies or derivative works are solely in the form of machine-executable
object code generated by a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
17. Portions of the Nsight Eclipse Edition is subject to the following
license:
The Eclipse Foundation makes available all content in this plug-in
("Content"). Unless otherwise indicated below, the Content is provided
to you under the terms and conditions of the Eclipse Public License
Version 1.0 ("EPL"). A copy of the EPL is available at http://
www.eclipse.org/legal/epl-v10.html. For purposes of the EPL, "Program"
will mean the Content.
If you did not receive this Content directly from the Eclipse
Foundation, the Content is being redistributed by another party
("Redistributor") and different terms and conditions may apply to your
use of any object code in the Content. Check the Redistributor's
license that was provided with the Content. If no such license exists,
contact the Redistributor. Unless otherwise indicated below, the terms
and conditions of the EPL still apply to any source code in the
Content and such source code may be obtained at http://www.eclipse.org.
18. Some of the cuBLAS library routines uses code from OpenAI, which
is subject to the following license:
License URL
https://github.com/openai/openai-gemm/blob/master/LICENSE
License Text
The MIT License
Copyright (c) 2016 OpenAI (http://openai.com), 2016 Google Inc.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
19. Licensee's use of the Visual Studio Setup Configuration Samples
is subject to the following license:
The MIT License (MIT)
Copyright (C) Microsoft Corporation. All rights reserved.
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
20. Licensee's use of linmath.h header for CPU functions for GL
vector/matrix operations from lunarG is subject to the Apache License
Version 2.0.
21. The DX12-CUDA sample uses the d3dx12.h header, which is subject to the MIT license .
22. Components of the driver and compiler used for binary management,
including nvFatBin, nvcc, and cuobjdump, use the Zstandard library
which is subject to the following license:
BSD License
For Zstandard software
Copyright (c) Meta Platforms, Inc. and affiliates. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted
provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name Facebook, nor Meta, nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
23. Components of the ctadvisor component, use the SQLite library
which is subject to the following license:
All of the code and documentation in SQLite has been dedicated to the public domain by the
authors. All code authors, and representatives of the companies they work for, have signed
affidavits dedicating their contributions to the public domain and originals of those signed
affidavits are stored in a firesafe at the main offices of Hwaci. All contributors are citizens
of countries that allow creative works to be dedicated into the public domain. Anyone is free
to copy, modify, publish, use, compile, sell, or distribute the original SQLite code, either
in source code form or as a compiled binary, for any purpose, commercial or non-commercial,
and by any means.
24. Portions of support for math operations on 128-bit floating-point
data type in compiler were derived from SLEEF library which is
subject to the following license:
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (the "Software") to use, reproduce, display, distribute,
execute, and transmit the Software, and to prepare derivative works of the
Software, and to permit third-parties to whom the Software is furnished to
do so, all subject to the following:
The copyright notices in the Software and this entire statement, including
the above license grant, this restriction and the following disclaimer,
must be included in all copies of the Software, in whole or in part, and
all derivative works of the Software, unless such copies or derivative
works are solely in the form of machine-executable object code generated by
a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
25. Portions of support for math operations on 128-bit floating-point
data type in compiler were derived from SoftFloat library which is
subject to the following license:
The SoftFloat package was written by me, John R. Hauser. Release 3 of SoftFloat
was a completely new implementation supplanting earlier releases. The project to
create Release 3 (now through 3e) was done in the employ of the University of
California, Berkeley, within the Department of Electrical Engineering and
Computer Sciences, first for the Parallel Computing Laboratory (Par Lab) and
then for the ASPIRE Lab. The work was officially overseen by Prof. Krste
Asanovic, with funding provided by these sources:
Par Lab: Microsoft (Award #024263), Intel (Award #024894), and U.C. Discovery
(Award #DIG07-10227), with additional support from Par Lab affiliates Nokia,
NVIDIA, Oracle, and Samsung.
ASPIRE Lab: DARPA PERFECT program (Award #HR0011-12-2-0016), with additional
support from ASPIRE industrial sponsor Intel and ASPIRE affiliates Google, Nokia,
NVIDIA, Oracle, and Samsung.
The following applies to the whole of SoftFloat Release 3e as well as to each
source file individually.
Copyright 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018 The Regents of the
University of California. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list
of conditions, and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this
list of conditions, and the following disclaimer in the documentation and/or
other materials provided with the distribution.
Neither the name of the University nor the names of its contributors may be used
to endorse or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS", AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED. IN NO EVENT
SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
nvidia-curand-cu12
10.3.2.106
License: NVIDIA End User License Agreement v13.0
License: NVIDIA End User License Agreement v13.0 (SPDX-License-Identifier: None)
This software contains source code provided by NVIDIA Corporation.
End User License Agreement
NVIDIA Software License Agreement and CUDA Supplement to Software License Agreement.
The CUDA Toolkit End User License Agreement applies to the NVIDIA
CUDA Toolkit, the NVIDIA CUDA Samples, the NVIDIA Display Driver,
NVIDIA Nsight tools (Visual Studio Edition), and the associated
documentation on CUDA APIs, programming model and development tools.
If you do not agree with the terms and conditions of the license
agreement, then do not download or use the software.
Last updated: January 7, 2025
Preface
The Software License Agreement in Chapter 1 and the Supplement in
Chapter 2 contain license terms and conditions that govern the use
of NVIDIA CUDA toolkit. By accepting this agreement, you agree to
comply with all the terms and conditions applicable to the product(s)
included herein.
NVIDIA Driver
Description
This package contains the operating system driver and fundamental
system software components for NVIDIA GPUs.
NVIDIA CUDA Toolkit
Description
The NVIDIA CUDA Toolkit provides command-line and graphical tools
for building, debugging and optimizing the performance of applications
accelerated by NVIDIA GPUs, runtime and math libraries, and
documentation including programming guides, user manuals, and API
references.
Default Install Location of CUDA Toolkit
Windows platform:
%ProgramFiles%\NVIDIA GPU Computing Toolkit\CUDA\v#.#
Linux platform:
/usr/local/cuda-#.#
Mac platform:
/Developer/NVIDIA/CUDA-#.#
NVIDIA CUDA Samples
Description
CUDA Samples are now located in https://github.com/nvidia/cuda-samples,
which includes instructions for obtaining, building, and running
the samples. They are no longer included in the CUDA toolkit.
NVIDIA Nsight Visual Studio Edition (Windows only)
Description
NVIDIA Nsight Development Platform, Visual Studio Edition is a
development environment integrated into Microsoft Visual Studio
that provides tools for debugging, profiling, analyzing and optimizing
your GPU computing and graphics applications.
Default Install Location of Nsight Visual Studio Edition
Windows platform:
%ProgramFiles(x86)%\NVIDIA Corporation\Nsight Visual Studio Edition #.#
1. License Agreement for NVIDIA Software Development Kits
Important Notice—Read before downloading, installing, copying or
using the licensed software:
This license agreement, including exhibits attached ("Agreement")
is a legal agreement between you and NVIDIA Corporation ("NVIDIA")
and governs your use of a NVIDIA software development kit ("SDK").
Each SDK has its own set of software and materials, but here is a
description of the types of items that may be included in a SDK:
source code, header files, APIs, data sets and assets (examples
include images, textures, models, scenes, videos, native API
input/output files), binary software, sample code, libraries, utility
programs, programming code and documentation.
This Agreement can be accepted only by an adult of legal age of
majority in the country in which the SDK is used.
If you are entering into this Agreement on behalf of a company or
other legal entity, you represent that you have the legal authority
to bind the entity to this Agreement, in which case "you" will mean
the entity you represent.
If you don't have the required age or authority to accept this
Agreement, or if you don't accept all the terms and conditions of
this Agreement, do not download, install or use the SDK.
You agree to use the SDK only for purposes that are permitted by
(a) this Agreement, and (b) any applicable law, regulation or
generally accepted practices or guidelines in the relevant
jurisdictions.
1.1. License
1.1.1. License Grant
Subject to the terms of this Agreement, NVIDIA hereby grants you a
non-exclusive, non-transferable license, without the right to
sublicense (except as expressly provided in this Agreement) to:
1. Install and use the SDK,
2. Modify and create derivative works of sample source code delivered
in the SDK, and
3. Distribute those portions of the SDK that are identified in this
Agreement as distributable, as incorporated in object code format
into a software application that meets the distribution requirements
indicated in this Agreement.
1.1.2. Distribution Requirements
These are the distribution requirements for you to exercise the
distribution grant:
1. Your application must have material additional functionality,
beyond the included portions of the SDK.
2. The distributable portions of the SDK shall only be accessed by
your application.
3. The following notice shall be included in modifications and
derivative works of sample source code distributed: "This software
contains source code provided by NVIDIA Corporation."
4. Unless a developer tool is identified in this Agreement as
distributable, it is delivered for your internal use only.
5. The terms under which you distribute your application must be
consistent with the terms of this Agreement, including (without
limitation) terms relating to the license grant and license
restrictions and protection of NVIDIA's intellectual property rights.
Additionally, you agree that you will protect the privacy, security
and legal rights of your application users.
6. You agree to notify NVIDIA in writing of any known or suspected
distribution or use of the SDK not in compliance with the requirements
of this Agreement, and to enforce the terms of your agreements with
respect to distributed SDK.
1.1.3. Authorized Users
You may allow employees and contractors of your entity or of your
subsidiary(ies) to access and use the SDK from your secure network
to perform work on your behalf.
If you are an academic institution you may allow users enrolled or
employed by the academic institution to access and use the SDK from
your secure network.
You are responsible for the compliance with the terms of this
Agreement by your authorized users. If you become aware that your
authorized users didn't follow the terms of this Agreement, you
agree to take reasonable steps to resolve the non-compliance and
prevent new occurrences.
1.1.4. Pre-Release SDK
The SDK versions identified as alpha, beta, preview or otherwise
as pre-release, may not be fully functional, may contain errors or
design flaws, and may have reduced or different security, privacy,
accessibility, availability, and reliability standards relative to
commercial versions of NVIDIA software and materials. Use of a
pre-release SDK may result in unexpected results, loss of data,
project delays or other unpredictable damage or loss.
You may use a pre-release SDK at your own risk, understanding that
pre-release SDKs are not intended for use in production or
business-critical systems.
NVIDIA may choose not to make available a commercial version of any
pre-release SDK. NVIDIA may also choose to abandon development and
terminate the availability of a pre-release SDK at any time without
liability.
1.1.5. Updates
NVIDIA may, at its option, make available patches, workarounds or
other updates to this SDK. Unless the updates are provided with
their separate governing terms, they are deemed part of the SDK
licensed to you as provided in this Agreement. You agree that the
form and content of the SDK that NVIDIA provides may change without
prior notice to you. While NVIDIA generally maintains compatibility
between versions, NVIDIA may in some cases make changes that introduce
incompatibilities in future versions of the SDK.
1.1.6. Components Under Other Licenses
The SDK may come bundled with, or otherwise include or be distributed
with, NVIDIA or third-party components with separate legal notices
or terms as may be described in proprietary notices accompanying
the SDK. If and to the extent there is a conflict between the terms
in this Agreement and the license terms associated with the component,
the license terms associated with the components control only to
the extent necessary to resolve the conflict.
Subject to the other terms of this Agreement, you may use the SDK
to develop and test applications released under Open Source Initiative
(OSI) approved open source software licenses.
1.1.7. Reservation of Rights
NVIDIA reserves all rights, title, and interest in and to the SDK,
not expressly granted to you under this Agreement.
1.2. Limitations
The following license limitations apply to your use of the SDK:
1. You may not reverse engineer, decompile or disassemble, or remove
copyright or other proprietary notices from any portion of the SDK
or copies of the SDK.
2. Except as expressly provided in this Agreement, you may not copy,
sell, rent, sublicense, transfer, distribute, modify, or create
derivative works of any portion of the SDK. For clarity, you may
not distribute or sublicense the SDK as a stand-alone product.
3. Unless you have an agreement with NVIDIA for this purpose, you
may not indicate that an application created with the SDK is sponsored
or endorsed by NVIDIA.
4. You may not bypass, disable, or circumvent any encryption,
security, digital rights management or authentication mechanism in
the SDK.
5. You may not use the SDK in any manner that would cause it to
become subject to an open source software license. As examples,
licenses that require as a condition of use, modification, and/or
distribution that the SDK be:
a. Disclosed or distributed in source code form;
b. Licensed for the purpose of making derivative works; or
c. Redistributable at no charge.
6. You acknowledge that the SDK as delivered is not tested or
certified by NVIDIA for use in connection with the design, construction,
maintenance, and/or operation of any system where the use or failure
of such system could result in a situation that threatens the safety
of human life or results in catastrophic damages (each, a "Critical
Application"). Examples of Critical Applications include use in
avionics, navigation, autonomous vehicle applications, ai solutions
for automotive products, military, medical, life support or other
life critical applications. NVIDIA shall not be liable to you or
any third party, in whole or in part, for any claims or damages
arising from such uses. You are solely responsible for ensuring
that any product or service developed with the SDK as a whole
includes sufficient features to comply with all applicable legal
and regulatory standards and requirements.
7. You agree to defend, indemnify and hold harmless NVIDIA and its
affiliates, and their respective employees, contractors, agents,
officers and directors, from and against any and all claims, damages,
obligations, losses, liabilities, costs or debt, fines, restitutions
and expenses (including but not limited to attorney's fees and costs
incident to establishing the right of indemnification) arising out
of or related to products or services that use the SDK in or for
Critical Applications, and for use of the SDK outside of the scope
of this Agreement or not in compliance with its terms.
8. You may not reverse engineer, decompile or disassemble any portion
of the output generated using SDK elements for the purpose of
translating such output artifacts to target a non-NVIDIA platform.
1.3. Ownership
1. NVIDIA or its licensors hold all rights, title and interest in
and to the SDK and its modifications and derivative works, including
their respective intellectual property rights, subject to your
rights under Section 1.3.2. This SDK may include software and
materials from NVIDIA's licensors, and these licensors are intended
third party beneficiaries that may enforce this Agreement with
respect to their intellectual property rights.
1. You hold all rights, title and interest in and to your applications
and your derivative works of the sample source code delivered in
the SDK, including their respective intellectual property rights,
subject to NVIDIA's rights under Section 1.3.1.
2. You may, but don't have to, provide to NVIDIA suggestions, feature
requests or other feedback regarding the SDK, including possible
enhancements or modifications to the SDK. For any feedback that you
voluntarily provide, you hereby grant NVIDIA and its affiliates a
perpetual, non-exclusive, worldwide, irrevocable license to use,
reproduce, modify, license, sublicense (through multiple tiers of
sublicensees), and distribute (through multiple tiers of distributors)
it without the payment of any royalties or fees to you. NVIDIA will
use feedback at its choice. NVIDIA is constantly looking for ways
to improve its products, so you may send feedback to NVIDIA through
the developer portal at https://developer.nvidia.com.
1.4. No Warranties
THE SDK IS PROVIDED BY NVIDIA "AS IS" AND "WITH ALL FAULTS." TO THE
MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND ITS AFFILIATES EXPRESSLY
DISCLAIM ALL WARRANTIES OF ANY KIND OR NATURE, WHETHER EXPRESS,
IMPLIED OR STATUTORY, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTIES
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE,
NON-INFRINGEMENT, OR THE ABSENCE OF ANY DEFECTS THEREIN, WHETHER
LATENT OR PATENT. NO WARRANTY IS MADE ON THE BASIS OF TRADE USAGE,
COURSE OF DEALING OR COURSE OF TRADE.
1.5. Limitation of Liability
TO THE MAXIMUM EXTENT PERMITTED BY LAW, NVIDIA AND ITS AFFILIATES
SHALL NOT BE LIABLE FOR ANY (I) SPECIAL, INCIDENTAL, PUNITIVE OR
CONSEQUENTIAL DAMAGES, OR (II) DAMAGES FOR (A) ANY LOST PROFITS,
LOSS OF USE, LOSS OF DATA OR LOSS OF GOODWILL, OR (B) THE COSTS OF
PROCURING SUBSTITUTE PRODUCTS, ARISING OUT OF OR IN CONNECTION WITH
THIS AGREEMENT OR THE USE OR PERFORMANCE OF THE SDK, WHETHER SUCH
LIABILITY ARISES FROM ANY CLAIM BASED UPON BREACH OF CONTRACT,
BREACH OF WARRANTY, TORT (INCLUDING NEGLIGENCE), PRODUCT LIABILITY
OR ANY OTHER CAUSE OF ACTION OR THEORY OF LIABILITY. IN NO EVENT
WILL NVIDIA'S AND ITS AFFILIATES TOTAL CUMULATIVE LIABILITY UNDER
OR ARISING OUT OF THIS AGREEMENT EXCEED US$10.00. THE NATURE OF THE
LIABILITY OR THE NUMBER OF CLAIMS OR SUITS SHALL NOT ENLARGE OR
EXTEND THIS LIMIT.
These exclusions and limitations of liability shall apply regardless
if NVIDIA or its affiliates have been advised of the possibility
of such damages, and regardless of whether a remedy fails its
essential purpose. These exclusions and limitations of liability
form an essential basis of the bargain between the parties, and,
absent any of these exclusions or limitations of liability, the
provisions of this Agreement, including, without limitation, the
economic terms, would be substantially different.
1.6. Termination
1. This Agreement will continue to apply until terminated by either
you or NVIDIA as described below.
2. If you want to terminate this Agreement, you may do so by stopping
to use the SDK.
3. NVIDIA may, at any time, terminate this Agreement if:
(i) you fail to comply with any term of this Agreement and the
non-compliance is not fixed within thirty (30) days following notice
from NVIDIA (or immediately if you violate NVIDIA's intellectual
property rights);
(ii) you commence or participate in any legal proceeding against
NVIDIA with respect to the SDK; or
(iii) NVIDIA decides to no longer provide the SDK in a country or,
in NVIDIA's sole discretion, the continued use of it is no longer
commercially viable.
4. Upon any termination of this Agreement, you agree to promptly
discontinue use of the SDK and destroy all copies in your possession
or control. Your prior distributions in accordance with this Agreement
are not affected by the termination of this Agreement. Upon written
request, you will certify in writing that you have complied with
your commitments under this section. Upon any termination of this
Agreement all provisions survive except for the license grant
provisions.
1.7. General
If you wish to assign this Agreement or your rights and obligations,
including by merger, consolidation, dissolution or operation of
law, contact NVIDIA to ask for permission. Any attempted assignment
not approved by NVIDIA in writing shall be void and of no effect.
NVIDIA may assign, delegate or transfer this Agreement and its
rights and obligations, and if to a non-affiliate you will be
notified.
You agree to cooperate with NVIDIA and provide reasonably requested
information to verify your compliance with this Agreement.
This Agreement will be governed in all respects by the laws of the
United States and of the State of Delaware, without regard to the
conflicts of laws principles. The United Nations Convention on
Contracts for the International Sale of Goods is specifically
disclaimed. You agree to all terms of this Agreement in the English
language.
The state or federal courts residing in Santa Clara County, California
shall have exclusive jurisdiction over any dispute or claim arising
out of this Agreement. Notwithstanding this, you agree that NVIDIA
shall still be allowed to apply for injunctive remedies or an
equivalent type of urgent legal relief in any jurisdiction.
If any court of competent jurisdiction determines that any provision
of this Agreement is illegal, invalid or unenforceable, such provision
will be construed as limited to the extent necessary to be consistent
with and fully enforceable under the law and the remaining provisions
will remain in full force and effect. Unless otherwise specified,
remedies are cumulative.
Each party acknowledges and agrees that the other is an independent
contractor in the performance of this Agreement.
The SDK has been developed entirely at private expense and is
"commercial items" consisting of "commercial computer software" and
"commercial computer software documentation" provided with RESTRICTED
RIGHTS. Use, duplication or disclosure by the U.S. Government or a
U.S. Government subcontractor is subject to the restrictions in
this Agreement pursuant to DFARS 227.7202-3(a) or as set forth in
subparagraphs (c)(1) and (2) of the Commercial Computer Software -
Restricted Rights clause at FAR 52.227-19, as applicable.
Contractor/manufacturer is NVIDIA, 2788 San Tomas Expressway, Santa
Clara, CA 95051.
The SDK is subject to United States export laws and regulations.
You agree that you will not ship, transfer or export the SDK into
any country, or use the SDK in any manner, prohibited by the United
States Bureau of Industry and Security or economic sanctions
regulations administered by the U.S. Department of Treasury's Office
of Foreign Assets Control (OFAC), or any applicable export laws,
restrictions or regulations. These laws include restrictions on
destinations, end users and end use. By accepting this Agreement,
you confirm that you are not located in a country currently embargoed
by the U.S. or otherwise prohibited from receiving the SDK under
U.S. law.
Any notice delivered by NVIDIA to you under this Agreement will be
delivered via mail, email or fax. You agree that any notices that
NVIDIA sends you electronically will satisfy any legal communication
requirements. Please direct your legal notices or other correspondence
to NVIDIA Corporation, 2788 San Tomas Expressway, Santa Clara,
California 95051, United States of America, Attention: Legal
Department.
This Agreement and any exhibits incorporated into this Agreement
constitute the entire agreement of the parties with respect to the
subject matter of this Agreement and supersede all prior negotiations
or documentation exchanged between the parties relating to this SDK
license. Any additional and/or conflicting terms on documents issued
by you are null, void, and invalid. Any amendment or waiver under
this Agreement shall be in writing and signed by representatives
of both parties.
2. CUDA Toolkit Supplement to Software License Agreement for NVIDIA Software Development Kits
The terms in this supplement govern your use of the NVIDIA CUDA
Toolkit SDK under the terms of your license agreement ("Agreement")
as modified by this supplement. Capitalized terms used but not
defined below have the meaning assigned to them in the Agreement.
This supplement is an exhibit to the Agreement and is incorporated
as an integral part of the Agreement. In the event of conflict
between the terms in this supplement and the terms in the Agreement,
the terms in this supplement govern.
2.1. License Scope
The SDK is licensed for you to develop applications only for use
in systems with NVIDIA GPUs.
2.2. Distribution
The portions of the SDK that are distributable under the Agreement
are listed in Attachment A.
2.3. Operating Systems
Those portions of the SDK designed exclusively for use on the Linux
or FreeBSD operating systems, or other operating systems derived
from the source code to these operating systems, may be copied and
redistributed for use in accordance with this Agreement, provided
that the object code files are not modified in any way (except for
unzipping of compressed files).
2.4. Audio and Video Encoders and Decoders
You acknowledge and agree that it is your sole responsibility to
obtain any additional third-party licenses required to make, have
made, use, have used, sell, import, and offer for sale your products
or services that include or incorporate any third-party software
and content relating to audio and/or video encoders and decoders
from, including but not limited to, Microsoft, Thomson, Fraunhofer
IIS, Sisvel S.p.A., MPEG-LA, and Coding Technologies. NVIDIA does
not grant to you under this Agreement any necessary patent or other
rights with respect to any audio and/or video encoders and decoders.
2.5. Licensing
If the distribution terms in this Agreement are not suitable for
your organization, or for any questions regarding this Agreement,
please contact NVIDIA at nvidia-compute-license-questions@nvidia.com.
2.6. Attachment A
The following CUDA Toolkit files may be distributed with applications
developed by you, including certain variations of these files that
have version number or architecture specific information embedded
in the file name - as an example only, for release version 9.0 of
the 64-bit Windows software, the file cudart64_90.dll is redistributable.
Component CUDA Runtime
--------- ------------
Windows cudart.dll, cudart_static.lib, cudadevrt.lib
Mac OSX libcudart.dylib, libcudart_static.a, libcudadevrt.a
Linux libcudart.so, libcudart_static.a, libcudadevrt.a
Android libcudart.so, libcudart_static.a, libcudadevrt.a
Component CUDA FFT Library
--------- ----------------
Windows cufft.dll, cufftw.dll, cufft.lib, cufftw.lib
Mac OSX libcufft.dylib, libcufft_static.a, libcufftw.dylib, libcufftw_static.a
Linux libcufft.so, libcufft_static.a, libcufftw.so, libcufftw_static.a
Android libcufft.so, libcufft_static.a, libcufftw.so, libcufftw_static.a
Component CUDA BLAS Library
--------- -----------------
Windows cublas.dll, cublasLt.dll
Mac OSX libcublas.dylib, libcublasLt.dylib, libcublas_static.a, libcublasLt_static.a
Linux libcublas.so, libcublasLt.so, libcublas_static.a, libcublasLt_static.a
Android libcublas.so, libcublasLt.so, libcublas_static.a, libcublasLt_static.a
Component NVIDIA "Drop-in" BLAS Library
--------- -----------------
Windows nvblas.dll
Mac OSX libnvblas.dylib
Linux libnvblas.so
Component CUDA Sparse Matrix Library
--------- -----------------
Windows cusparse.dll, cusparse.lib
Mac OSX libcusparse.dylib, libcusparse_static.a
Linux libcusparse.so, libcusparse_static.a
Android libcusparse.so, libcusparse_static.a
Component CUDA Linear Solver Library
--------- -----------------
Windows cusolver.dll, cusolver.lib
Mac OSX libcusolver.dylib, libcusolver_static.a
Linux libcusolver.so, libcusolver_static.a
Android libcusolver.so, libcusolver_static.a
Component CUDA Random Number Generation Library
--------- -----------------
Windows curand.dll, curand.lib
Mac OSX libcurand.dylib, libcurand_static.a
Linux libcurand.so, libcurand_static.a
Android libcurand.so, libcurand_static.a
Component NVIDIA Performance Primitives Library
--------- -----------------
Windows nppc.dll, nppc.lib, nppial.dll, nppial.lib, nppicc.dll, nppicc.lib, nppicom.dll, nppicom.lib, nppidei.dll, nppidei.lib, nppif.dll, nppif.lib, nppig.dll, nppig.lib, nppim.dll, nppim.lib, nppist.dll, nppist.lib, nppisu.dll, nppisu.lib, nppitc.dll, nppitc.lib, npps.dll, npps.lib
Mac OSX libnppc.dylib, libnppc_static.a, libnppial.dylib, libnppial_static.a, libnppicc.dylib, libnppicc_static.a, libnppicom.dylib, libnppicom_static.a, libnppidei.dylib, libnppidei_static.a, libnppif.dylib, libnppif_static.a, libnppig.dylib, libnppig_static.a, libnppim.dylib, libnppisu_static.a, libnppitc.dylib, libnppitc_static.a, libnpps.dylib, libnpps_static.a
Linux libnppc.so, libnppc_static.a, libnppial.so, libnppial_static.a, libnppicc.so, libnppicc_static.a, libnppicom.so, libnppicom_static.a, libnppidei.so, libnppidei_static.a, libnppif.so, libnppif_static.a libnppig.so, libnppig_static.a, libnppim.so, libnppim_static.a, libnppist.so, libnppist_static.a, libnppisu.so, libnppisu_static.a, libnppitc.so libnppitc_static.a, libnpps.so, libnpps_static.a
Android libnppc.so, libnppc_static.a, libnppial.so, libnppial_static.a, libnppicc.so, libnppicc_static.a, libnppicom.so, libnppicom_static.a, libnppidei.so, libnppidei_static.a, libnppif.so, libnppif_static.a libnppig.so, libnppig_static.a, libnppim.so, libnppim_static.a, libnppist.so, libnppist_static.a, libnppisu.so, libnppisu_static.a, libnppitc.so libnppitc_static.a, libnpps.so, libnpps_static.a
Component NVIDIA JPEG Library
--------- -----------------
Windows nvjpeg.lib, nvjpeg.dll
Linux libnvjpeg.so, libnvjpeg_static.a
Component Internal common library required for statically linking to cuBLAS, cuSPARSE, cuFFT, cuRAND, nvJPEG and NPP
--------- -----------------
Mac OSX libculibos.a
Linux libculibos.a
Component NVIDIA Runtime Compilation Library and Header
--------- -----------------
All nvrtc.h
Windows nvrtc.dll, nvrtc-builtins.dll
Mac OSX libnvrtc.dylib, libnvrtc-builtins.dylib
Linux libnvrtc.so, libnvrtc-builtins.so, libnvrtc_static.a, libnvrtc-builtins_static.a
Component NVIDIA Optimizing Compiler Library
--------- -----------------
Windows nvvm.dll
Mac OSX libnvvm.dylib
Linux libnvvm.so
Component NVIDIA JIT Linking Library
--------- -----------------
Windows libnvJitLink.dll, libnvJitLink.lib
Linux libnvJitLink.so, libnvJitLink_static.a
Component NVIDIA Common Device Math Functions Library
--------- -----------------
Windows libdevice.10.bc
Mac OSX libdevice.10.bc
Linux libdevice.10.bc
Component CUDA Occupancy Calculation Header Library
--------- -----------------
All cuda_occupancy.h
Component CUDA Floating Point Type Headers
--------- -----------------
All cuda_fp16.h, cuda_fp16.hpp, cuda_bf16.h, cuda_bf16.hpp, cuda_fp8.h, cuda_fp8.hpp, cuda_fp6.h, cuda_fp6.hpp, cuda_fp4.h, cuda_fp4.hpp
Component CUDA Headers for Runtime Compilation
--------- -----------------
All crt/host_defines.h, cuComplex.h, cuda_awbarrier_helpers.h, cuda_awbarrier_primitives.h, cuda_wbarrier.h, cuda_pipeline_helpers.h, cuda_pipeline_primitives.h, cuda_pipeline.h, cuda_runtime_api.h, cuda.h, cuda/std/tuple, cuda/std/type_traits, cuda/std/type_traits, cuda/std/utility, device_types.h, vector_functions.h, vector_types.h
Component CUDA Profiling Tools Interface (CUPTI) Library
--------- -----------------
Windows cupti.dll
Mac OSX libcupti.dylib
Linux libcupti.so
Component NVIDIA Tools Extension Library
--------- -----------------
Windows nvToolsExt.dll, nvToolsExt.lib
Mac OSX libnvToolsExt.dylib
Linux libnvToolsExt.so
Component NVIDIA CUDA Driver Libraries
--------- -----------------
Linux libcuda.so, libnvidia-ptxjitcompiler.so, libnvptxcompiler_static.a
Component NVIDIA CUDA File IO Libraries and Header
--------- -----------------
All cufile.h
Linux libcufile.so, libcufile_rdma.so, libcufile_static.a, libcufile_rdma_static.a
In addition to the rights above, for parties that are developing
software intended solely for use on Jetson development kits or
Jetson modules, and running Linux for Tegra software, the following
shall apply:
The SDK may be distributed in its entirety, as provided by NVIDIA,
and without separation of its components, for you and/or your
licensees to create software development kits for use only on the
Jetson platform and running Linux for Tegra software.
2.7. Attachment B
Additional Licensing Obligations
The following third party components included in the SOFTWARE are
licensed to Licensee pursuant to the following terms and conditions:
1. Licensee's use of the GDB third party component is subject to the
terms and conditions of GNU GPL v3:
This product includes copyrighted third-party software licensed
under the terms of the GNU General Public License v3 ("GPL v3").
All third-party software packages are copyright by their respective
authors. GPL v3 terms and conditions are hereby incorporated into
the Agreement by this reference: http://www.gnu.org/licenses/gpl.txt
Consistent with these licensing requirements, the software listed
below is provided under the terms of the specified open source
software licenses. To obtain source code for software provided under
licenses that require redistribution of source code, including the
GNU General Public License (GPL) and GNU Lesser General Public
License (LGPL), contact oss-requests@nvidia.com. This offer is valid
for a period of three (3) years from the date of the distribution
of this product by NVIDIA CORPORATION.
Component License
CUDA-GDB GPL v3
2. Licensee represents and warrants that any and all third party
licensing and/or royalty payment obligations in connection with
Licensee's use of the H.264 video codecs are solely the responsibility
of Licensee.
3. Licensee's use of the Thrust library is subject to the terms and
conditions of the Apache License Version 2.0. All third-party
software packages are copyright by their respective authors. Apache
License Version 2.0 terms and conditions are hereby incorporated
into the Agreement by this reference.
http://www.apache.org/licenses/LICENSE-2.0.html
In addition, Licensee acknowledges the following notice: Thrust
includes source code from the Boost Iterator, Tuple, System, and
Random Number libraries.
Boost Software License - Version 1.0 - August 17th, 2003
. . . .
Permission is hereby granted, free of charge, to any person or
organization obtaining a copy of the software and accompanying
documentation covered by this license (the "Software") to use,
reproduce, display, distribute, execute, and transmit the Software,
and to prepare derivative works of the Software, and to permit
third-parties to whom the Software is furnished to do so, all
subject to the following:
The copyright notices in the Software and this entire statement,
including the above license grant, this restriction and the following
disclaimer, must be included in all copies of the Software, in whole
or in part, and all derivative works of the Software, unless such
copies or derivative works are solely in the form of machine-executable
object code generated by a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
4. Licensee's use of the LLVM third party component is subject to the
following terms and conditions:
========================================================================================================
All LLVM after 8.0 are distributed under Apache-2.0 with LLVM-exception license, an OSI-approved license
========================================================================================================
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 [yyyy] [name of copyright owner]
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
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.
-----------------------------------------
LLVM Exceptions to the Apache 2.0 License
-----------------------------------------
As an exception, if, as a result of your compiling your source code, portions
of this Software are embedded into an Object form of such source code, you
may redistribute such embedded portions in such Object form without complying
with the conditions of Sections 4(a), 4(b) and 4(d) of the License.
In addition, if you combine or link compiled forms of this Software with
software that is licensed under the GPLv2 ("Combined Software") and if a
court of competent jurisdiction determines that the patent provision (Section
3), the indemnity provision (Section 9) or other Section of the License
conflicts with the conditions of the GPLv2, you may retroactively and
prospectively choose to deem waived or otherwise exclude such Section(s) of
the License, but only in their entirety and only with respect to the Combined
Software.
========================================================
Software from third parties included in the LLVM Project
========================================================
The LLVM Project contains third party software which is under different license
terms. All such code will be identified clearly using at least one of two
mechanisms:
1) It will be in a separate directory tree with its own `LICENSE.txt` or
`LICENSE` file at the top containing the specific license and restrictions
which apply to that software, or
2) It will contain specific license and restriction terms at the top of every
file.
==================================================================================================
LLVM releases prior to LLVM 8.0 was licensed under this University of Illinois Open Source License
==================================================================================================
University of Illinois/NCSA
Open Source License
Copyright (c) 2003-2019 University of Illinois at Urbana-Champaign.
All rights reserved.
Developed by:
LLVM Team
University of Illinois at Urbana-Champaign
http://llvm.org
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal with
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimers.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimers in the
documentation and/or other materials provided with the distribution.
* Neither the names of the LLVM Team, University of Illinois at
Urbana-Champaign, nor the names of its contributors may be used to
endorse or promote products derived from this Software without specific
prior written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
SOFTWARE.
5. Licensee's use of the PCRE third party component is subject to
the following terms and conditions:
------------
PCRE LICENCE
------------
PCRE is a library of functions to support regular expressions whose syntax
and semantics are as close as possible to those of the Perl 5 language.
Release 8 of PCRE is distributed under the terms of the "BSD" licence, as
specified below. The documentation for PCRE, supplied in the "doc"
directory, is distributed under the same terms as the software itself. The
basic library functions are written in C and are freestanding. Also
included in the distribution is a set of C++ wrapper functions, and a just-
in-time compiler that can be used to optimize pattern matching. These are
both optional features that can be omitted when the library is built.
THE BASIC LIBRARY FUNCTIONS
---------------------------
Written by: Philip Hazel
Email local part: ph10
Email domain: cam.ac.uk
University of Cambridge Computing Service,
Cambridge, England.
Copyright (c) 1997-2012 University of Cambridge
All rights reserved.
PCRE JUST-IN-TIME COMPILATION SUPPORT
-------------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2010-2012 Zoltan Herczeg
All rights reserved.
STACK-LESS JUST-IN-TIME COMPILER
--------------------------------
Written by: Zoltan Herczeg
Email local part: hzmester
Emain domain: freemail.hu
Copyright(c) 2009-2012 Zoltan Herczeg
All rights reserved.
THE C++ WRAPPER FUNCTIONS
-------------------------
Contributed by: Google Inc.
Copyright (c) 2007-2012, Google Inc.
All rights reserved.
THE "BSD" LICENCE
-----------------
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of Cambridge nor the name of Google
Inc. nor the names of their contributors may be used to endorse or
promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
6. Some of the cuBLAS library routines were written by or derived
from code written by Vasily Volkov and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2007-2009, Regents of the University of California
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the University of California, Berkeley nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
7. Some of the cuBLAS library routines were written by or derived
from code written by Davide Barbieri and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2008-2009 Davide Barbieri @ University of Rome Tor Vergata.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* The name of the author may not be used to endorse or promote
products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
8. Some of the cuBLAS library routines were derived from code
developed by the University of Tennessee and are subject to the
Modified Berkeley Software Distribution License as follows:
Copyright (c) 2010 The University of Tennessee.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer listed in this license in the documentation and/or
other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
9. Some of the cuBLAS library routines were written by or derived
from code written by Jonathan Hogg and are subject to the Modified
Berkeley Software Distribution License as follows:
Copyright (c) 2012, The Science and Technology Facilities Council (STFC).
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the STFC nor the names of its contributors
may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE STFC BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
10. Some of the cuBLAS library routines were written by or derived
from code written by Ahmad M. Abdelfattah, David Keyes, and Hatem
Ltaief, and are subject to the Apache License, Version 2.0, as
follows:
-- (C) Copyright 2013 King Abdullah University of Science and Technology
Authors:
Ahmad Abdelfattah (ahmad.ahmad@kaust.edu.sa)
David Keyes (david.keyes@kaust.edu.sa)
Hatem Ltaief (hatem.ltaief@kaust.edu.sa)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the King Abdullah University of Science and
Technology nor the names of its contributors may be used to endorse
or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE
11. Some of the cuSPARSE library routines were written by or derived
from code written by Li-Wen Chang and are subject to the NCSA Open
Source License as follows:
Copyright (c) 2012, University of Illinois.
All rights reserved.
Developed by: IMPACT Group, University of Illinois, http://impact.crhc.illinois.edu
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal with the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimers in the documentation and/or other materials provided
with the distribution.
* Neither the names of IMPACT Group, University of Illinois, nor
the names of its contributors may be used to endorse or promote
products derived from this Software without specific prior
written permission.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE CONTRIBUTORS OR COPYRIGHT
HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH THE
SOFTWARE.
12. Some of the cuRAND library routines were written by or derived
from code written by Mutsuo Saito and Makoto Matsumoto and are
subject to the following license:
Copyright (c) 2009, 2010 Mutsuo Saito, Makoto Matsumoto and Hiroshima
University. All rights reserved.
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
University and University of Tokyo. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the Hiroshima University nor the names of
its contributors may be used to endorse or promote products
derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
13. Some of the cuRAND library routines were derived from code
developed by D. E. Shaw Research and are subject to the following
license:
Copyright 2010-2011, D. E. Shaw Research.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions, and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of D. E. Shaw Research nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
14. Some of the Math library routines were written by or derived
from code developed by Norbert Juffa and are subject to the following
license:
Copyright (c) 2015-2017, Norbert Juffa
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
15. Licensee's use of the lz4 third party component is subject to
the following terms and conditions:
Copyright (C) 2011-2013, Yann Collet.
BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
16. The NPP library uses code from the Boost Math Toolkit, and is
subject to the following license:
Boost Software License - Version 1.0 - August 17th, 2003
. . . .
Permission is hereby granted, free of charge, to any person or
organization obtaining a copy of the software and accompanying
documentation covered by this license (the "Software") to use,
reproduce, display, distribute, execute, and transmit the Software,
and to prepare derivative works of the Software, and to permit
third-parties to whom the Software is furnished to do so, all
subject to the following:
The copyright notices in the Software and this entire statement,
including the above license grant, this restriction and the following
disclaimer, must be included in all copies of the Software, in whole
or in part, and all derivative works of the Software, unless such
copies or derivative works are solely in the form of machine-executable
object code generated by a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
NON-INFRINGEMENT. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES OR
OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
OTHER DEALINGS IN THE SOFTWARE.
17. Portions of the Nsight Eclipse Edition is subject to the following
license:
The Eclipse Foundation makes available all content in this plug-in
("Content"). Unless otherwise indicated below, the Content is provided
to you under the terms and conditions of the Eclipse Public License
Version 1.0 ("EPL"). A copy of the EPL is available at http://
www.eclipse.org/legal/epl-v10.html. For purposes of the EPL, "Program"
will mean the Content.
If you did not receive this Content directly from the Eclipse
Foundation, the Content is being redistributed by another party
("Redistributor") and different terms and conditions may apply to your
use of any object code in the Content. Check the Redistributor's
license that was provided with the Content. If no such license exists,
contact the Redistributor. Unless otherwise indicated below, the terms
and conditions of the EPL still apply to any source code in the
Content and such source code may be obtained at http://www.eclipse.org.
18. Some of the cuBLAS library routines uses code from OpenAI, which
is subject to the following license:
License URL
https://github.com/openai/openai-gemm/blob/master/LICENSE
License Text
The MIT License
Copyright (c) 2016 OpenAI (http://openai.com), 2016 Google Inc.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
19. Licensee's use of the Visual Studio Setup Configuration Samples
is subject to the following license:
The MIT License (MIT)
Copyright (C) Microsoft Corporation. All rights reserved.
Permission is hereby granted, free of charge, to any person
obtaining a copy of this software and associated documentation
files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge,
publish, distribute, sublicense, and/or sell copies of the Software,
and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
20. Licensee's use of linmath.h header for CPU functions for GL
vector/matrix operations from lunarG is subject to the Apache License
Version 2.0.
21. The DX12-CUDA sample uses the d3dx12.h header, which is subject to the MIT license .
22. Components of the driver and compiler used for binary management,
including nvFatBin, nvcc, and cuobjdump, use the Zstandard library
which is subject to the following license:
BSD License
For Zstandard software
Copyright (c) Meta Platforms, Inc. and affiliates. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted
provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name Facebook, nor Meta, nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
23. Components of the ctadvisor component, use the SQLite library
which is subject to the following license:
All of the code and documentation in SQLite has been dedicated to the public domain by the
authors. All code authors, and representatives of the companies they work for, have signed
affidavits dedicating their contributions to the public domain and originals of those signed
affidavits are stored in a firesafe at the main offices of Hwaci. All contributors are citizens
of countries that allow creative works to be dedicated into the public domain. Anyone is free
to copy, modify, publish, use, compile, sell, or distribute the original SQLite code, either
in source code form or as a compiled binary, for any purpose, commercial or non-commercial,
and by any means.
24. Portions of support for math operations on 128-bit floating-point
data type in compiler were derived from SLEEF library which is
subject to the following license:
Boost Software License - Version 1.0 - August 17th, 2003
Permission is hereby granted, free of charge, to any person or organization
obtaining a copy of the software and accompanying documentation covered by
this license (the "Software") to use, reproduce, display, distribute,
execute, and transmit the Software, and to prepare derivative works of the
Software, and to permit third-parties to whom the Software is furnished to
do so, all subject to the following:
The copyright notices in the Software and this entire statement, including
the above license grant, this restriction and the following disclaimer,
must be included in all copies of the Software, in whole or in part, and
all derivative works of the Software, unless such copies or derivative
works are solely in the form of machine-executable object code generated by
a source language processor.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
25. Portions of support for math operations on 128-bit floating-point
data type in compiler were derived from SoftFloat library which is
subject to the following license:
The SoftFloat package was written by me, John R. Hauser. Release 3 of SoftFloat
was a completely new implementation supplanting earlier releases. The project to
create Release 3 (now through 3e) was done in the employ of the University of
California, Berkeley, within the Department of Electrical Engineering and
Computer Sciences, first for the Parallel Computing Laboratory (Par Lab) and
then for the ASPIRE Lab. The work was officially overseen by Prof. Krste
Asanovic, with funding provided by these sources:
Par Lab: Microsoft (Award #024263), Intel (Award #024894), and U.C. Discovery
(Award #DIG07-10227), with additional support from Par Lab affiliates Nokia,
NVIDIA, Oracle, and Samsung.
ASPIRE Lab: DARPA PERFECT program (Award #HR0011-12-2-0016), with additional
support from ASPIRE industrial sponsor Intel and ASPIRE affiliates Google, Nokia,
NVIDIA, Oracle, and Samsung.
The following applies to the whole of SoftFloat Release 3e as well as to each
source file individually.
Copyright 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018 The Regents of the
University of California. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this list
of conditions, and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this
list of conditions, and the following disclaimer in the documentation and/or
other materials provided with the distribution.
Neither the name of the University nor the names of its contributors may be used
to endorse or promote products derived from this software without specific prior
written permission.
THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS "AS IS", AND ANY EXPRESS
OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED. IN NO EVENT
SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
oauthlib/oauthlib
3.3.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
opt-einsum
3.4.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Packaging
24.2
License: (BSD 2-clause "Simplified" License OR Apache License 2.0)
License: BSD 2-clause "Simplified" License (SPDX-License-Identifier: BSD-2-Clause)
BSD Two Clause License
======================
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
PillowPython
11.3.0
License: Python Imaging Library Software License
License: Python Imaging Library Software License (SPDX-License-Identifier: None)
Python Imaging Library Software License
=======================================
The Python Imaging Library (PIL) is
Copyright © 1997-2011 by Secret Labs AB
Copyright © 1995-2011 by Fredrik Lundh
Pillow is the friendly PIL fork. It is
Copyright © 2010-2018 by Alex Clark and contributors
Like PIL, Pillow is licensed under the open source PIL Software License:
By obtaining, using, and/or copying this software and/or its associated
documentation, you agree that you have read, understood, and will comply with the
following terms and conditions:
Permission to use, copy, modify, and distribute this software and its associated
documentation for any purpose and without fee is hereby granted, provided that
the above copyright notice appears in all copies, and that both that copyright
notice and this permission notice appear in supporting documentation, and that
the name of Secret Labs AB or the author not be used in advertising or publicity
pertaining to distribution of the software without specific, written prior
permission.
SECRET LABS AB AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
EVENT SHALL SECRET LABS AB OR THE AUTHOR BE LIABLE FOR ANY SPECIAL, INDIRECT OR
CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
platformdirs
4.3.6
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
pooch
1.8.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
psf-requests
2.32.3
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
py-filelock
3.16.1
License: The Unlicense
License: The Unlicense (SPDX-License-Identifier: Unlicense)
The Unlicense
=============
This is free and unencumbered software released into the public domain.
Anyone is free to copy, modify, publish, use, compile, sell, or distribute this
software, either in source code form or as a compiled binary, for any purpose,
commercial or non-commercial, and by any means.
In jurisdictions that recognize copyright laws, the author or authors of this
software dedicate any and all copyright interest in the software to the public
domain. We make this dedication for the benefit of the public at large and to the
detriment of our heirs and successors. We intend this dedication to be an overt
act of relinquishment in perpetuity of all present and future rights to this
software under copyright law.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
For more information, please refer to http://unlicense.org/
py3-google-auth
2.40.3
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
pyasn1
0.6.1
License: BSD 2-clause "Simplified" License
License: BSD 2-clause "Simplified" License (SPDX-License-Identifier: BSD-2-Clause)
BSD Two Clause License
======================
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
pyasn1-modules
0.4.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
pycparser
2.22
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Pygments - Python syntax highlighter
2.19.2
License: BSD 2-clause "Simplified" License
License: BSD 2-clause "Simplified" License (SPDX-License-Identifier: BSD-2-Clause)
BSD Two Clause License
======================
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
pypi/setuptools
65.5.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
python cffi
1.17.1
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Python six
1.17.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
python-certifi
2024.8.30
License: Mozilla Public License 2.0
License: Mozilla Public License 2.0 (SPDX-License-Identifier: MPL-2.0)
Mozilla Public License
Version 2.0
======================
1. Definitions
--------------
1.1. "Contributor"
means each individual or legal entity that creates, contributes to the creation
of, or owns Covered Software.
1.2. "Contributor Version"
means the combination of the Contributions of others (if any) used by a
Contributor and that particular Contributor's Contribution.
1.3. "Contribution"
means Covered Software of a particular Contributor.
1.4. "Covered Software"
means Source Code Form to which the initial Contributor has attached the notice
in Exhibit A, the Executable Form of such Source Code Form, and Modifications
of such Source Code Form, in each case including portions thereof.
1.5. "Incompatible With Secondary Licenses"
means
a.
that the initial Contributor has attached the notice described in Exhibit B
to the Covered Software; or
b.
that the Covered Software was made available under the terms of version 1.1
or earlier of the License, but not also under the terms of a Secondary
License.
1.6. "Executable Form"
means any form of the work other than Source Code Form.
1.7. "Larger Work"
means a work that combines Covered Software with other material, in a separate
file or files, that is not Covered Software.
1.8. "License"
means this document.
1.9. "Licensable"
means having the right to grant, to the maximum extent possible, whether at the
time of the initial grant or subsequently, any and all of the rights conveyed
by this License.
1.10. "Modifications"
means any of the following:
a.
any file in Source Code Form that results from an addition to, deletion
from, or modification of the contents of Covered Software; or
b.
any new file in Source Code Form that contains any Covered Software.
1.11. "Patent Claims" of a Contributor
means any patent claim(s), including without limitation, method, process, and
apparatus claims, in any patent Licensable by such Contributor that would be
infringed, but for the grant of the License, by the making, using, selling,
offering for sale, having made, import, or transfer of either its Contributions
or its Contributor Version.
1.12. "Secondary License"
means either the GNU General Public License, Version 2.0, the GNU Lesser
General Public License, Version 2.1, the GNU Affero General Public License,
Version 3.0, or any later versions of those licenses.
1.13. "Source Code Form"
means the form of the work preferred for making modifications.
1.14. "You" (or "Your")
means an individual or a legal entity exercising rights under this License. For
legal entities, "You" includes any entity that controls, is controlled by, or
is under common control with You. For purposes of this definition, "control"
means (a) the power, direct or indirect, to cause the direction or management
of such entity, whether by contract or otherwise, or (b) ownership of more than
fifty percent (50%) of the outstanding shares or beneficial ownership of such
entity.
2. License Grants and Conditions
--------------------------------
2.1. Grants
Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive
license:
a.
under intellectual property rights (other than patent or trademark)
Licensable by such Contributor to use, reproduce, make available, modify,
display, perform, distribute, and otherwise exploit its Contributions,
either on an unmodified basis, with Modifications, or as part of a Larger
Work; and
b.
under Patent Claims of such Contributor to make, use, sell, offer for sale,
have made, import, and otherwise transfer either its Contributions or its
Contributor Version.
2.2. Effective Date
The licenses granted in Section 2.1 with respect to any Contribution become
effective for each Contribution on the date the Contributor first distributes
such Contribution.
2.3. Limitations on Grant Scope
The licenses granted in this Section 2 are the only rights granted under this
License. No additional rights or licenses will be implied from the distribution
or licensing of Covered Software under this License. Notwithstanding
Section 2.1(b) above, no patent license is granted by a Contributor:
a.
for any code that a Contributor has removed from Covered Software; or
b.
for infringements caused by: (i) Your and any other third party's
modifications of Covered Software, or (ii) the combination of its
Contributions with other software (except as part of its Contributor
Version); or
c.
under Patent Claims infringed by Covered Software in the absence of its
Contributions.
This License does not grant any rights in the trademarks, service marks, or
logos of any Contributor (except as may be necessary to comply with the notice
requirements in Section 3.4).
2.4. Subsequent Licenses
No Contributor makes additional grants as a result of Your choice to distribute
the Covered Software under a subsequent version of this License (see
Section 10.2) or under the terms of a Secondary License (if permitted under the
terms of Section 3.3).
2.5. Representation
Each Contributor represents that the Contributor believes its Contributions are
its original creation(s) or it has sufficient rights to grant the rights to its
Contributions conveyed by this License.
2.6. Fair Use
This License is not intended to limit any rights You have under applicable
copyright doctrines of fair use, fair dealing, or other equivalents.
2.7. Conditions
Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
Section 2.1.
3. Responsibilities
-------------------
3.1. Distribution of Source Form
All distribution of Covered Software in Source Code Form, including any
Modifications that You create or to which You contribute, must be under the
terms of this License. You must inform recipients that the Source Code Form of
the Covered Software is governed by the terms of this License, and how they can
obtain a copy of this License. You may not attempt to alter or restrict the
recipients' rights in the Source Code Form.
3.2. Distribution of Executable Form
If You distribute Covered Software in Executable Form then:
a.
such Covered Software must also be made available in Source Code Form, as
described in Section 3.1, and You must inform recipients of the Executable
Form how they can obtain a copy of such Source Code Form by reasonable
means in a timely manner, at a charge no more than the cost of distribution
to the recipient; and
b.
You may distribute such Executable Form under the terms of this License, or
sublicense it under different terms, provided that the license for the
Executable Form does not attempt to limit or alter the recipients' rights
in the Source Code Form under this License.
3.3. Distribution of a Larger Work
You may create and distribute a Larger Work under terms of Your choice,
provided that You also comply with the requirements of this License for the
Covered Software. If the Larger Work is a combination of Covered Software with
a work governed by one or more Secondary Licenses, and the Covered Software is
not Incompatible With Secondary Licenses, this License permits You to
additionally distribute such Covered Software under the terms of such Secondary
License(s), so that the recipient of the Larger Work may, at their option,
further distribute the Covered Software under the terms of either this License
or such Secondary License(s).
3.4. Notices
You may not remove or alter the substance of any license notices (including
copyright notices, patent notices, disclaimers of warranty, or limitations of
liability) contained within the Source Code Form of the Covered Software,
except that You may alter any license notices to the extent required to remedy
known factual inaccuracies.
3.5. Application of Additional Terms
You may choose to offer, and to charge a fee for, warranty, support, indemnity
or liability obligations to one or more recipients of Covered Software.
However, You may do so only on Your own behalf, and not on behalf of any
Contributor. You must make it absolutely clear that any such warranty, support,
indemnity, or liability obligation is offered by You alone, and You hereby
agree to indemnify every Contributor for any liability incurred by such
Contributor as a result of warranty, support, indemnity or liability terms You
offer. You may include additional disclaimers of warranty and limitations of
liability specific to any jurisdiction.
4. Inability to Comply Due to Statute or Regulation
---------------------------------------------------
If it is impossible for You to comply with any of the terms of this License with
respect to some or all of the Covered Software due to statute, judicial order, or
regulation then You must: (a) comply with the terms of this License to the
maximum extent possible; and (b) describe the limitations and the code they
affect. Such description must be placed in a text file included with all
distributions of the Covered Software under this License. Except to the extent
prohibited by statute or regulation, such description must be sufficiently
detailed for a recipient of ordinary skill to be able to understand it.
5. Termination
--------------
5.1. The rights granted under this License will terminate automatically if You
fail to comply with any of its terms. However, if You become compliant, then
the rights granted under this License from a particular Contributor are
reinstated (a) provisionally, unless and until such Contributor explicitly and
finally terminates Your grants, and (b) on an ongoing basis, if such
Contributor fails to notify You of the non-compliance by some reasonable means
prior to 60 days after You have come back into compliance. Moreover, Your
grants from a particular Contributor are reinstated on an ongoing basis if such
Contributor notifies You of the non-compliance by some reasonable means, this
is the first time You have received notice of non-compliance with this License
from such Contributor, and You become compliant prior to 30 days after Your
receipt of the notice.
5.2. If You initiate litigation against any entity by asserting a patent
infringement claim (excluding declaratory judgment actions, counter-claims, and
cross-claims) alleging that a Contributor Version directly or indirectly
infringes any patent, then the rights granted to You by any and all
Contributors for the Covered Software under Section 2.1 of this License shall
terminate.
5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
license agreements (excluding distributors and resellers) which have been
validly granted by You or Your distributors under this License prior to
termination shall survive termination.
6. Disclaimer of Warranty
-------------------------
Covered Software is provided under this License on an "as is" basis, without
warranty of any kind, either expressed, implied, or statutory, including, without
limitation, warranties that the Covered Software is free of defects,
merchantable, fit for a particular purpose or non-infringing. The entire risk as
to the quality and performance of the Covered Software is with You. Should any
Covered Software prove defective in any respect, You (not any Contributor) assume
the cost of any necessary servicing, repair, or correction. This disclaimer of
warranty constitutes an essential part of this License. No use of any Covered
Software is authorized under this License except under this disclaimer.
7. Limitation of Liability
--------------------------
Under no circumstances and under no legal theory, whether tort (including
negligence), contract, or otherwise, shall any Contributor, or anyone who
distributes Covered Software as permitted above, be liable to You for any direct,
indirect, special, incidental, or consequential damages of any character
including, without limitation, damages for lost profits, loss of goodwill, work
stoppage, computer failure or malfunction, or any and all other commercial
damages or losses, even if such party shall have been informed of the possibility
of such damages. This limitation of liability shall not apply to liability for
death or personal injury resulting from such party's negligence to the extent
applicable law prohibits such limitation. Some jurisdictions do not allow the
exclusion or limitation of incidental or consequential damages, so this exclusion
and limitation may not apply to You.
8. Litigation
-------------
Any litigation relating to this License may be brought only in the courts of a
jurisdiction where the defendant maintains its principal place of business and
such litigation shall be governed by laws of that jurisdiction, without reference
to its conflict-of-law provisions. Nothing in this Section shall prevent a
party's ability to bring cross-claims or counter-claims.
9. Miscellaneous
----------------
This License represents the complete agreement concerning the subject matter
hereof. If any provision of this License is held to be unenforceable, such
provision shall be reformed only to the extent necessary to make it enforceable.
Any law or regulation which provides that the language of a contract shall be
construed against the drafter shall not be used to construe this License against
a Contributor.
10. Versions of the License
---------------------------
10.1. New Versions
Mozilla Foundation is the license steward. Except as provided in Section 10.3,
no one other than the license steward has the right to modify or publish new
versions of this License. Each version will be given a distinguishing version
number.
10.2. Effect of New Versions
You may distribute the Covered Software under the terms of the version of the
License under which You originally received the Covered Software, or under the
terms of any subsequent version published by the license steward.
10.3. Modified Versions
If you create software not governed by this License, and you want to create a
new license for such software, you may create and use a modified version of
this License if you rename the license and remove any references to the name of
the license steward (except to note that such modified license differs from
this License).
10.4. Distributing Source Code Form that is Incompatible With Secondary
Licenses
If You choose to distribute Source Code Form that is Incompatible With
Secondary Licenses under the terms of this version of the License, the notice
described in Exhibit B of this License must be attached.
Exhibit A - Source Code Form License Notice
-------------------------------------------
This Source Code Form is subject to the terms of the Mozilla Public License,
v. 2.0. If a copy of the MPL was not distributed with this file, You can
obtain one at http://mozilla.org/MPL/2.0/.
If it is not possible or desirable to put the notice in a particular file, then
You may include the notice in a location (such as a LICENSE file in a relevant
directory) where a recipient would be likely to look for such a notice.
You may add additional accurate notices of copyright ownership.
Exhibit B - "Incompatible With Secondary Licenses" Notice
---------------------------------------------------------
This Source Code Form is "Incompatible With Secondary Licenses", as defined
by the Mozilla Public License, v. 2.0.
python-decorator
5.1.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Python-Markdown
3.8.2
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
python-protobuf
4.25.8
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Python-RSA
4.9.1
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
python-typing-extensions
4.12.2
License: Python Software Foundation License 2.0
License: Python Software Foundation License 2.0 (SPDX-License-Identifier: PSF-2.0)
This license was approved as the official PSF License Version 2 on October 22,
2004. The only differences between this and version 1 of the PSF license consist
of removing Python version numbers (like 2.1.1 or 2.3).
PYTHON SOFTWARE FOUNDATION LICENSE VERSION 2
============================================
--------------------------------------------
1. This LICENSE AGREEMENT is between the Python Software Foundation ("PSF"),
and the Individual or Organization ("Licensee") accessing and otherwise using
this software ("Python") in source or binary form and its associated
documentation.
2. Subject to the terms and conditions of this License Agreement, PSF hereby
grants Licensee a nonexclusive, royalty-free, world-wide license to
reproduce, analyze, test, perform and/or display publicly, prepare derivative
works, distribute, and otherwise use Python alone or in any derivative
version, provided, however, that PSF's License Agreement and PSF's notice of
copyright, i.e., "Copyright (c) 2001, 2002, 2003, 2004 Python Software
Foundation; All Rights Reserved" are retained in Python alone or in any
derivative version prepared by Licensee.
3. In the event Licensee prepares a derivative work that is based on or
incorporates Python or any part thereof, and wants to make the derivative
work available to others as provided herein, then Licensee hereby agrees to
include in any such work a brief summary of the changes made to Python.
4. PSF is making Python available to Licensee on an "AS IS" basis. PSF MAKES
NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. BY WAY OF EXAMPLE, BUT
NOT LIMITATION, PSF MAKES NO AND DISCLAIMS ANY REPRESENTATION OR WARRANTY OF
MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR PURPOSE OR THAT THE USE OF
PYTHON WILL NOT INFRINGE ANY THIRD PARTY RIGHTS.
5. PSF SHALL NOT BE LIABLE TO LICENSEE OR ANY OTHER USERS OF PYTHON FOR ANY
INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES OR LOSS AS A RESULT OF
MODIFYING, DISTRIBUTING, OR OTHERWISE USING PYTHON, OR ANY DERIVATIVE
THEREOF, EVEN IF ADVISED OF THE POSSIBILITY THEREOF.
6. This License Agreement will automatically terminate upon a material breach
of its terms and conditions.
7. Nothing in this License Agreement shall be deemed to create any
relationship of agency, partnership, or joint venture between PSF and
Licensee. This License Agreement does not grant permission to use PSF
trademarks or trade name in a trademark sense to endorse or promote products
or services of Licensee, or any third party.
8. By copying, installing or otherwise using Python, Licensee agrees to be
bound by the terms and conditions of this License Agreement.
python-wheel
0.45.1
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
python3-charset-normalizer
3.4.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
python3-rich
14.0.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
pytorch
2.1.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
requests-oauthlib
2.0.0
License: ISC License
License: ISC License (SPDX-License-Identifier: ISC)
ISC License (ISCL)
==================
Copyright (c) 4-digit year, Company or Person's Name
Permission to use, copy, modify, and/or distribute this software for any purpose
with or without fee is hereby granted, provided that the above copyright notice
and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
THIS SOFTWARE.
scikit-learn
1.7.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
SciPy
1.15.3
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
soundfile
0.12.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
soxr
0.5.0.post1
License: GNU Lesser General Public License v2.1 or later
License: GNU Lesser General Public License v2.1 or later (SPDX-License-Identifier: LGPL-2.1-or-later)
GNU Lesser General Public License
=================================
Version 2.1, February 1999
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
[This is the first released version of the Lesser GPL. It also counts
as the successor of the GNU Library Public License, version 2, hence
the version number 2.1.]
Preamble
--------
The licenses for most software are designed to take away your freedom to share
and change it. By contrast, the GNU General Public Licenses are intended to
guarantee your freedom to share and change free software--to make sure the
software is free for all its users.
This license, the Lesser General Public License, applies to some specially
designated software packages--typically libraries--of the Free Software
Foundation and other authors who decide to use it. You can use it too, but we
suggest you first think carefully about whether this license or the ordinary
General Public License is the better strategy to use in any particular case,
based on the explanations below.
When we speak of free software, we are referring to freedom of use, not price.
Our General Public Licenses are designed to make sure that you have the freedom
to distribute copies of free software (and charge for this service if you wish);
that you receive source code or can get it if you want it; that you can change
the software and use pieces of it in new free programs; and that you are informed
that you can do these things.
To protect your rights, we need to make restrictions that forbid distributors to
deny you these rights or to ask you to surrender these rights. These restrictions
translate to certain responsibilities for you if you distribute copies of the
library or if you modify it.
For example, if you distribute copies of the library, whether gratis or for a
fee, you must give the recipients all the rights that we gave you. You must make
sure that they, too, receive or can get the source code. If you link other code
with the library, you must provide complete object files to the recipients, so
that they can relink them with the library after making changes to the library
and recompiling it. And you must show them these terms so they know their rights.
We protect your rights with a two-step method: (1) we copyright the library, and
(2) we offer you this license, which gives you legal permission to copy,
distribute and/or modify the library.
To protect each distributor, we want to make it very clear that there is no
warranty for the free library. Also, if the library is modified by someone else
and passed on, the recipients should know that what they have is not the original
version, so that the original author's reputation will not be affected by
problems that might be introduced by others.
Finally, software patents pose a constant threat to the existence of any free
program. We wish to make sure that a company cannot effectively restrict the
users of a free program by obtaining a restrictive license from a patent holder.
Therefore, we insist that any patent license obtained for a version of the
library must be consistent with the full freedom of use specified in this
license.
Most GNU software, including some libraries, is covered by the ordinary GNU
General Public License. This license, the GNU Lesser General Public License,
applies to certain designated libraries, and is quite different from the ordinary
General Public License. We use this license for certain libraries in order to
permit linking those libraries into non-free programs.
When a program is linked with a library, whether statically or using a shared
library, the combination of the two is legally speaking a combined work, a
derivative of the original library. The ordinary General Public License therefore
permits such linking only if the entire combination fits its criteria of freedom.
The Lesser General Public License permits more lax criteria for linking other
code with the library.
We call this license the "Lesser" General Public License because it does Less to
protect the user's freedom than the ordinary General Public License. It also
provides other free software developers Less of an advantage over competing
non-free programs. These disadvantages are the reason we use the ordinary General
Public License for many libraries. However, the Lesser license provides
advantages in certain special circumstances.
For example, on rare occasions, there may be a special need to encourage the
widest possible use of a certain library, so that it becomes a de-facto standard.
To achieve this, non-free programs must be allowed to use the library. A more
frequent case is that a free library does the same job as widely used non-free
libraries. In this case, there is little to gain by limiting the free library to
free software only, so we use the Lesser General Public License.
In other cases, permission to use a particular library in non-free programs
enables a greater number of people to use a large body of free software. For
example, permission to use the GNU C Library in non-free programs enables many
more people to use the whole GNU operating system, as well as its variant, the
GNU/Linux operating system.
Although the Lesser General Public License is Less protective of the users'
freedom, it does ensure that the user of a program that is linked with the
Library has the freedom and the wherewithal to run that program using a modified
version of the Library.
The precise terms and conditions for copying, distribution and modification
follow. Pay close attention to the difference between a "work based on the
library" and a "work that uses the library". The former contains code derived
from the library, whereas the latter must be combined with the library in order
to run.
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
---------------------------------------------------------------
0. This License Agreement applies to any software library or other program which
contains a notice placed by the copyright holder or other authorized party saying
it may be distributed under the terms of this Lesser General Public License (also
called "this License"). Each licensee is addressed as "you".
A "library" means a collection of software functions and/or data prepared so as
to be conveniently linked with application programs (which use some of those
functions and data) to form executables.
The "Library", below, refers to any such software library or work which has been
distributed under these terms. A "work based on the Library" means either the
Library or any derivative work under copyright law: that is to say, a work
containing the Library or a portion of it, either verbatim or with modifications
and/or translated straightforwardly into another language. (Hereinafter,
translation is included without limitation in the term "modification".)
"Source code" for a work means the preferred form of the work for making
modifications to it. For a library, complete source code means all the source
code for all modules it contains, plus any associated interface definition files,
plus the scripts used to control compilation and installation of the library.
Activities other than copying, distribution and modification are not covered by
this License; they are outside its scope. The act of running a program using the
Library is not restricted, and output from such a program is covered only if its
contents constitute a work based on the Library (independent of the use of the
Library in a tool for writing it). Whether that is true depends on what the
Library does and what the program that uses the Library does.
1. You may copy and distribute verbatim copies of the Library's complete source
code as you receive it, in any medium, provided that you conspicuously and
appropriately publish on each copy an appropriate copyright notice and disclaimer
of warranty; keep intact all the notices that refer to this License and to the
absence of any warranty; and distribute a copy of this License along with the
Library.
You may charge a fee for the physical act of transferring a copy, and you may at
your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Library or any portion of it, thus
forming a work based on the Library, and copy and distribute such modifications
or work under the terms of Section 1 above, provided that you also meet all of
these conditions:
a) The modified work must itself be a software library.
b) You must cause the files modified to carry prominent notices stating
that you changed the files and the date of any change.
c) You must cause the whole of the work to be licensed at no charge to all
third parties under the terms of this License.
d) If a facility in the modified Library refers to a function or a table of
data to be supplied by an application program that uses the facility, other
than as an argument passed when the facility is invoked, then you must make
a good faith effort to ensure that, in the event an application does not
supply such function or table, the facility still operates, and performs
whatever part of its purpose remains meaningful.
(For example, a function in a library to compute square roots has a purpose
that is entirely well-defined independent of the application. Therefore,
Subsection 2d requires that any application-supplied function or table used
by this function must be optional: if the application does not supply it,
the square root function must still compute square roots.)
These requirements apply to the modified work as a whole. If identifiable
sections of that work are not derived from the Library, and can be
reasonably considered independent and separate works in themselves, then
this License, and its terms, do not apply to those sections when you
distribute them as separate works. But when you distribute the same
sections as part of a whole which is a work based on the Library, the
distribution of the whole must be on the terms of this License, whose
permissions for other licensees extend to the entire whole, and thus to
each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest your
rights to work written entirely by you; rather, the intent is to exercise
the right to control the distribution of derivative or collective works
based on the Library.
In addition, mere aggregation of another work not based on the Library with
the Library (or with a work based on the Library) on a volume of a storage
or distribution medium does not bring the other work under the scope of
this License.
3. You may opt to apply the terms of the ordinary GNU General Public License
instead of this License to a given copy of the Library. To do this, you must
alter all the notices that refer to this License, so that they refer to the
ordinary GNU General Public License, version 2, instead of to this License. (If a
newer version than version 2 of the ordinary GNU General Public License has
appeared, then you can specify that version instead if you wish.) Do not make any
other change in these notices.
Once this change is made in a given copy, it is irreversible for that copy, so
the ordinary GNU General Public License applies to all subsequent copies and
derivative works made from that copy.
This option is useful when you wish to copy part of the code of the Library into
a program that is not a library.
4. You may copy and distribute the Library (or a portion or derivative of it,
under Section 2) in object code or executable form under the terms of Sections 1
and 2 above provided that you accompany it with the complete corresponding
machine-readable source code, which must be distributed under the terms of
Sections 1 and 2 above on a medium customarily used for software interchange.
If distribution of object code is made by offering access to copy from a
designated place, then offering equivalent access to copy the source code from
the same place satisfies the requirement to distribute the source code, even
though third parties are not compelled to copy the source along with the object
code.
5. A program that contains no derivative of any portion of the Library, but is
designed to work with the Library by being compiled or linked with it, is called
a "work that uses the Library". Such a work, in isolation, is not a derivative
work of the Library, and therefore falls outside the scope of this License.
However, linking a "work that uses the Library" with the Library creates an
executable that is a derivative of the Library (because it contains portions of
the Library), rather than a "work that uses the library". The executable is
therefore covered by this License. Section 6 states terms for distribution of
such executables.
When a "work that uses the Library" uses material from a header file that is part
of the Library, the object code for the work may be a derivative work of the
Library even though the source code is not. Whether this is true is especially
significant if the work can be linked without the Library, or if the work is
itself a library. The threshold for this to be true is not precisely defined by
law.
If such an object file uses only numerical parameters, data structure layouts and
accessors, and small macros and small inline functions (ten lines or less in
length), then the use of the object file is unrestricted, regardless of whether
it is legally a derivative work. (Executables containing this object code plus
portions of the Library will still fall under Section 6.)
Otherwise, if the work is a derivative of the Library, you may distribute the
object code for the work under the terms of Section 6. Any executables containing
that work also fall under Section 6, whether or not they are linked directly with
the Library itself.
6. As an exception to the Sections above, you may also combine or link a "work
that uses the Library" with the Library to produce a work containing portions of
the Library, and distribute that work under terms of your choice, provided that
the terms permit modification of the work for the customer's own use and reverse
engineering for debugging such modifications.
You must give prominent notice with each copy of the work that the Library is
used in it and that the Library and its use are covered by this License. You must
supply a copy of this License. If the work during execution displays copyright
notices, you must include the copyright notice for the Library among them, as
well as a reference directing the user to the copy of this License. Also, you
must do one of these things:
a) Accompany the work with the complete corresponding machine-readable
source code for the Library including whatever changes were used in the
work (which must be distributed under Sections 1 and 2 above); and, if the
work is an executable linked with the Library, with the complete
machine-readable "work that uses the Library", as object code and/or source
code, so that the user can modify the Library and then relink to produce a
modified executable containing the modified Library. (It is understood that
the user who changes the contents of definitions files in the Library will
not necessarily be able to recompile the application to use the modified
definitions.)
b) Use a suitable shared library mechanism for linking with the Library. A
suitable mechanism is one that (1) uses at run time a copy of the library
already present on the user's computer system, rather than copying library
functions into the executable, and (2) will operate properly with a
modified version of the library, if the user installs one, as long as the
modified version is interface-compatible with the version that the work was
made with.
c) Accompany the work with a written offer, valid for at least three years,
to give the same user the materials specified in Subsection 6a, above, for
a charge no more than the cost of performing this distribution.
d) If distribution of the work is made by offering access to copy from a
designated place, offer equivalent access to copy the above specified
materials from the same place.
e) Verify that the user has already received a copy of these materials or
that you have already sent this user a copy.
For an executable, the required form of the "work that uses the Library" must
include any data and utility programs needed for reproducing the executable from
it. However, as a special exception, the materials to be distributed need not
include anything that is normally distributed (in either source or binary form)
with the major components (compiler, kernel, and so on) of the operating system
on which the executable runs, unless that component itself accompanies the
executable.
It may happen that this requirement contradicts the license restrictions of other
proprietary libraries that do not normally accompany the operating system. Such a
contradiction means you cannot use both them and the Library together in an
executable that you distribute.
7. You may place library facilities that are a work based on the Library
side-by-side in a single library together with other library facilities not
covered by this License, and distribute such a combined library, provided that
the separate distribution of the work based on the Library and of the other
library facilities is otherwise permitted, and provided that you do these two
things:
a) Accompany the combined library with a copy of the same work based on the
Library, uncombined with any other library facilities. This must be
distributed under the terms of the Sections above.
b) Give prominent notice with the combined library of the fact that part of
it is a work based on the Library, and explaining where to find the
accompanying uncombined form of the same work.
8. You may not copy, modify, sublicense, link with, or distribute the Library
except as expressly provided under this License. Any attempt otherwise to copy,
modify, sublicense, link with, or distribute the Library is void, and will
automatically terminate your rights under this License. However, parties who have
received copies, or rights, from you under this License will not have their
licenses terminated so long as such parties remain in full compliance.
9. You are not required to accept this License, since you have not signed it.
However, nothing else grants you permission to modify or distribute the Library
or its derivative works. These actions are prohibited by law if you do not accept
this License. Therefore, by modifying or distributing the Library (or any work
based on the Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying the Library
or works based on it.
10. Each time you redistribute the Library (or any work based on the Library),
the recipient automatically receives a license from the original licensor to
copy, distribute, link with or modify the Library subject to these terms and
conditions. You may not impose any further restrictions on the recipients'
exercise of the rights granted herein. You are not responsible for enforcing
compliance by third parties with this License.
11. If, as a consequence of a court judgment or allegation of patent infringement
or for any other reason (not limited to patent issues), conditions are imposed on
you (whether by court order, agreement or otherwise) that contradict the
conditions of this License, they do not excuse you from the conditions of this
License. If you cannot distribute so as to satisfy simultaneously your
obligations under this License and any other pertinent obligations, then as a
consequence you may not distribute the Library at all. For example, if a patent
license would not permit royalty-free redistribution of the Library by all those
who receive copies directly or indirectly through you, then the only way you
could satisfy both it and this License would be to refrain entirely from
distribution of the Library.
If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply, and the
section as a whole is intended to apply in other circumstances.
It is not the purpose of this section to induce you to infringe any patents or
other property right claims or to contest validity of any such claims; this
section has the sole purpose of protecting the integrity of the free software
distribution system which is implemented by public license practices. Many people
have made generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that system; it is
up to the author/donor to decide if he or she is willing to distribute software
through any other system and a licensee cannot impose that choice.
This section is intended to make thoroughly clear what is believed to be a
consequence of the rest of this License.
12. If the distribution and/or use of the Library is restricted in certain
countries either by patents or by copyrighted interfaces, the original copyright
holder who places the Library under this License may add an explicit geographical
distribution limitation excluding those countries, so that distribution is
permitted only in or among countries not thus excluded. In such case, this
License incorporates the limitation as if written in the body of this License.
13. The Free Software Foundation may publish revised and/or new versions of the
Lesser General Public License from time to time. Such new versions will be
similar in spirit to the present version, but may differ in detail to address new
problems or concerns.
Each version is given a distinguishing version number. If the Library specifies a
version number of this License which applies to it and "any later version", you
have the option of following the terms and conditions either of that version or
of any later version published by the Free Software Foundation. If the Library
does not specify a license version number, you may choose any version ever
published by the Free Software Foundation.
14. If you wish to incorporate parts of the Library into other free programs
whose distribution conditions are incompatible with these, write to the author to
ask for permission. For software which is copyrighted by the Free Software
Foundation, write to the Free Software Foundation; we sometimes make exceptions
for this. Our decision will be guided by the two goals of preserving the free
status of all derivatives of our free software and of promoting the sharing and
reuse of software generally.
NO WARRANTY
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE
LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED
IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS"
WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL
ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE
LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL,
SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY
TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF
THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER
PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Libraries
----------------------------------------------
If you develop a new library, and you want it to be of the greatest possible use
to the public, we recommend making it free software that everyone can
redistribute and change. You can do so by permitting redistribution under these
terms (or, alternatively, under the terms of the ordinary General Public
License).
To apply these terms, attach the following notices to the library. It is safest
to attach them to the start of each source file to most effectively convey the
exclusion of warranty; and each file should have at least the "copyright" line
and a pointer to where the full notice is found.
one line to give the library's name and an idea of what it does.
Copyright (C) year name of author
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Also add information on how to contact you by electronic and paper mail.
You should also get your employer (if you work as a programmer) or your school,
if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a
sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in
the library `Frob' (a library for tweaking knobs) written
by James Random Hacker.
signature of Ty Coon, 1 April 1990
Ty Coon, President of Vice
That's all there is to it!
sty
1.0.6
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
SymPy
1.13.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
tensorboard
2.15.2
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
TensorFlow
2.15.0
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
tensorflow-estimator
2.15.0
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
tensorflow/io
0.37.1
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
tensorflow/tensorboard
0.7.2
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
termcolor-pypi
3.1.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
tflite-micro
20230726-snapshot-aa945a0f
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
threadpoolctl
3.5.0
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
torchaudio
2.1.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
torchinfo
1.8.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
torchvision
0.16.1
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
tornado
6.4.2
License: Apache License 2.0
License: Apache License 2.0 (SPDX-License-Identifier: Apache-2.0)
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 [yyyy] [name of copyright owner] Licensed under the Apache License,
Version 2.0 (the "License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
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.
tqdm
4.67.0
License: (MIT License AND Mozilla Public License 2.0)
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
License: Mozilla Public License 2.0 (SPDX-License-Identifier: MPL-2.0)
Mozilla Public License
Version 2.0
======================
1. Definitions
--------------
1.1. "Contributor"
means each individual or legal entity that creates, contributes to the creation
of, or owns Covered Software.
1.2. "Contributor Version"
means the combination of the Contributions of others (if any) used by a
Contributor and that particular Contributor's Contribution.
1.3. "Contribution"
means Covered Software of a particular Contributor.
1.4. "Covered Software"
means Source Code Form to which the initial Contributor has attached the notice
in Exhibit A, the Executable Form of such Source Code Form, and Modifications
of such Source Code Form, in each case including portions thereof.
1.5. "Incompatible With Secondary Licenses"
means
a.
that the initial Contributor has attached the notice described in Exhibit B
to the Covered Software; or
b.
that the Covered Software was made available under the terms of version 1.1
or earlier of the License, but not also under the terms of a Secondary
License.
1.6. "Executable Form"
means any form of the work other than Source Code Form.
1.7. "Larger Work"
means a work that combines Covered Software with other material, in a separate
file or files, that is not Covered Software.
1.8. "License"
means this document.
1.9. "Licensable"
means having the right to grant, to the maximum extent possible, whether at the
time of the initial grant or subsequently, any and all of the rights conveyed
by this License.
1.10. "Modifications"
means any of the following:
a.
any file in Source Code Form that results from an addition to, deletion
from, or modification of the contents of Covered Software; or
b.
any new file in Source Code Form that contains any Covered Software.
1.11. "Patent Claims" of a Contributor
means any patent claim(s), including without limitation, method, process, and
apparatus claims, in any patent Licensable by such Contributor that would be
infringed, but for the grant of the License, by the making, using, selling,
offering for sale, having made, import, or transfer of either its Contributions
or its Contributor Version.
1.12. "Secondary License"
means either the GNU General Public License, Version 2.0, the GNU Lesser
General Public License, Version 2.1, the GNU Affero General Public License,
Version 3.0, or any later versions of those licenses.
1.13. "Source Code Form"
means the form of the work preferred for making modifications.
1.14. "You" (or "Your")
means an individual or a legal entity exercising rights under this License. For
legal entities, "You" includes any entity that controls, is controlled by, or
is under common control with You. For purposes of this definition, "control"
means (a) the power, direct or indirect, to cause the direction or management
of such entity, whether by contract or otherwise, or (b) ownership of more than
fifty percent (50%) of the outstanding shares or beneficial ownership of such
entity.
2. License Grants and Conditions
--------------------------------
2.1. Grants
Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive
license:
a.
under intellectual property rights (other than patent or trademark)
Licensable by such Contributor to use, reproduce, make available, modify,
display, perform, distribute, and otherwise exploit its Contributions,
either on an unmodified basis, with Modifications, or as part of a Larger
Work; and
b.
under Patent Claims of such Contributor to make, use, sell, offer for sale,
have made, import, and otherwise transfer either its Contributions or its
Contributor Version.
2.2. Effective Date
The licenses granted in Section 2.1 with respect to any Contribution become
effective for each Contribution on the date the Contributor first distributes
such Contribution.
2.3. Limitations on Grant Scope
The licenses granted in this Section 2 are the only rights granted under this
License. No additional rights or licenses will be implied from the distribution
or licensing of Covered Software under this License. Notwithstanding
Section 2.1(b) above, no patent license is granted by a Contributor:
a.
for any code that a Contributor has removed from Covered Software; or
b.
for infringements caused by: (i) Your and any other third party's
modifications of Covered Software, or (ii) the combination of its
Contributions with other software (except as part of its Contributor
Version); or
c.
under Patent Claims infringed by Covered Software in the absence of its
Contributions.
This License does not grant any rights in the trademarks, service marks, or
logos of any Contributor (except as may be necessary to comply with the notice
requirements in Section 3.4).
2.4. Subsequent Licenses
No Contributor makes additional grants as a result of Your choice to distribute
the Covered Software under a subsequent version of this License (see
Section 10.2) or under the terms of a Secondary License (if permitted under the
terms of Section 3.3).
2.5. Representation
Each Contributor represents that the Contributor believes its Contributions are
its original creation(s) or it has sufficient rights to grant the rights to its
Contributions conveyed by this License.
2.6. Fair Use
This License is not intended to limit any rights You have under applicable
copyright doctrines of fair use, fair dealing, or other equivalents.
2.7. Conditions
Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in
Section 2.1.
3. Responsibilities
-------------------
3.1. Distribution of Source Form
All distribution of Covered Software in Source Code Form, including any
Modifications that You create or to which You contribute, must be under the
terms of this License. You must inform recipients that the Source Code Form of
the Covered Software is governed by the terms of this License, and how they can
obtain a copy of this License. You may not attempt to alter or restrict the
recipients' rights in the Source Code Form.
3.2. Distribution of Executable Form
If You distribute Covered Software in Executable Form then:
a.
such Covered Software must also be made available in Source Code Form, as
described in Section 3.1, and You must inform recipients of the Executable
Form how they can obtain a copy of such Source Code Form by reasonable
means in a timely manner, at a charge no more than the cost of distribution
to the recipient; and
b.
You may distribute such Executable Form under the terms of this License, or
sublicense it under different terms, provided that the license for the
Executable Form does not attempt to limit or alter the recipients' rights
in the Source Code Form under this License.
3.3. Distribution of a Larger Work
You may create and distribute a Larger Work under terms of Your choice,
provided that You also comply with the requirements of this License for the
Covered Software. If the Larger Work is a combination of Covered Software with
a work governed by one or more Secondary Licenses, and the Covered Software is
not Incompatible With Secondary Licenses, this License permits You to
additionally distribute such Covered Software under the terms of such Secondary
License(s), so that the recipient of the Larger Work may, at their option,
further distribute the Covered Software under the terms of either this License
or such Secondary License(s).
3.4. Notices
You may not remove or alter the substance of any license notices (including
copyright notices, patent notices, disclaimers of warranty, or limitations of
liability) contained within the Source Code Form of the Covered Software,
except that You may alter any license notices to the extent required to remedy
known factual inaccuracies.
3.5. Application of Additional Terms
You may choose to offer, and to charge a fee for, warranty, support, indemnity
or liability obligations to one or more recipients of Covered Software.
However, You may do so only on Your own behalf, and not on behalf of any
Contributor. You must make it absolutely clear that any such warranty, support,
indemnity, or liability obligation is offered by You alone, and You hereby
agree to indemnify every Contributor for any liability incurred by such
Contributor as a result of warranty, support, indemnity or liability terms You
offer. You may include additional disclaimers of warranty and limitations of
liability specific to any jurisdiction.
4. Inability to Comply Due to Statute or Regulation
---------------------------------------------------
If it is impossible for You to comply with any of the terms of this License with
respect to some or all of the Covered Software due to statute, judicial order, or
regulation then You must: (a) comply with the terms of this License to the
maximum extent possible; and (b) describe the limitations and the code they
affect. Such description must be placed in a text file included with all
distributions of the Covered Software under this License. Except to the extent
prohibited by statute or regulation, such description must be sufficiently
detailed for a recipient of ordinary skill to be able to understand it.
5. Termination
--------------
5.1. The rights granted under this License will terminate automatically if You
fail to comply with any of its terms. However, if You become compliant, then
the rights granted under this License from a particular Contributor are
reinstated (a) provisionally, unless and until such Contributor explicitly and
finally terminates Your grants, and (b) on an ongoing basis, if such
Contributor fails to notify You of the non-compliance by some reasonable means
prior to 60 days after You have come back into compliance. Moreover, Your
grants from a particular Contributor are reinstated on an ongoing basis if such
Contributor notifies You of the non-compliance by some reasonable means, this
is the first time You have received notice of non-compliance with this License
from such Contributor, and You become compliant prior to 30 days after Your
receipt of the notice.
5.2. If You initiate litigation against any entity by asserting a patent
infringement claim (excluding declaratory judgment actions, counter-claims, and
cross-claims) alleging that a Contributor Version directly or indirectly
infringes any patent, then the rights granted to You by any and all
Contributors for the Covered Software under Section 2.1 of this License shall
terminate.
5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user
license agreements (excluding distributors and resellers) which have been
validly granted by You or Your distributors under this License prior to
termination shall survive termination.
6. Disclaimer of Warranty
-------------------------
Covered Software is provided under this License on an "as is" basis, without
warranty of any kind, either expressed, implied, or statutory, including, without
limitation, warranties that the Covered Software is free of defects,
merchantable, fit for a particular purpose or non-infringing. The entire risk as
to the quality and performance of the Covered Software is with You. Should any
Covered Software prove defective in any respect, You (not any Contributor) assume
the cost of any necessary servicing, repair, or correction. This disclaimer of
warranty constitutes an essential part of this License. No use of any Covered
Software is authorized under this License except under this disclaimer.
7. Limitation of Liability
--------------------------
Under no circumstances and under no legal theory, whether tort (including
negligence), contract, or otherwise, shall any Contributor, or anyone who
distributes Covered Software as permitted above, be liable to You for any direct,
indirect, special, incidental, or consequential damages of any character
including, without limitation, damages for lost profits, loss of goodwill, work
stoppage, computer failure or malfunction, or any and all other commercial
damages or losses, even if such party shall have been informed of the possibility
of such damages. This limitation of liability shall not apply to liability for
death or personal injury resulting from such party's negligence to the extent
applicable law prohibits such limitation. Some jurisdictions do not allow the
exclusion or limitation of incidental or consequential damages, so this exclusion
and limitation may not apply to You.
8. Litigation
-------------
Any litigation relating to this License may be brought only in the courts of a
jurisdiction where the defendant maintains its principal place of business and
such litigation shall be governed by laws of that jurisdiction, without reference
to its conflict-of-law provisions. Nothing in this Section shall prevent a
party's ability to bring cross-claims or counter-claims.
9. Miscellaneous
----------------
This License represents the complete agreement concerning the subject matter
hereof. If any provision of this License is held to be unenforceable, such
provision shall be reformed only to the extent necessary to make it enforceable.
Any law or regulation which provides that the language of a contract shall be
construed against the drafter shall not be used to construe this License against
a Contributor.
10. Versions of the License
---------------------------
10.1. New Versions
Mozilla Foundation is the license steward. Except as provided in Section 10.3,
no one other than the license steward has the right to modify or publish new
versions of this License. Each version will be given a distinguishing version
number.
10.2. Effect of New Versions
You may distribute the Covered Software under the terms of the version of the
License under which You originally received the Covered Software, or under the
terms of any subsequent version published by the license steward.
10.3. Modified Versions
If you create software not governed by this License, and you want to create a
new license for such software, you may create and use a modified version of
this License if you rename the license and remove any references to the name of
the license steward (except to note that such modified license differs from
this License).
10.4. Distributing Source Code Form that is Incompatible With Secondary
Licenses
If You choose to distribute Source Code Form that is Incompatible With
Secondary Licenses under the terms of this version of the License, the notice
described in Exhibit B of this License must be attached.
Exhibit A - Source Code Form License Notice
-------------------------------------------
This Source Code Form is subject to the terms of the Mozilla Public License,
v. 2.0. If a copy of the MPL was not distributed with this file, You can
obtain one at http://mozilla.org/MPL/2.0/.
If it is not possible or desirable to put the notice in a particular file, then
You may include the notice in a location (such as a LICENSE file in a relevant
directory) where a recipient would be likely to look for such a notice.
You may add additional accurate notices of copyright ownership.
Exhibit B - "Incompatible With Secondary Licenses" Notice
---------------------------------------------------------
This Source Code Form is "Incompatible With Secondary Licenses", as defined
by the Mozilla Public License, v. 2.0.
triton
2.1.0
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
urllib3
2.2.3
License: MIT License
License: MIT License (SPDX-License-Identifier: MIT)
The MIT License
===============
Copyright (c) <year> <copyright holders>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in the
Software without restriction, including without limitation the rights to use,
copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the
Software, and to permit persons to whom the Software is furnished to do so,
subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Werkzeug
3.1.3
License: BSD 3-clause "New" or "Revised" License
License: BSD 3-clause "New" or "Revised" License (SPDX-License-Identifier: BSD-3-Clause)
Copyright (c) <YEAR>, <OWNER>
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
wrapt
1.14.1
License: BSD 2-clause "Simplified" License
License: BSD 2-clause "Simplified" License (SPDX-License-Identifier: BSD-2-Clause)
BSD Two Clause License
======================
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
Copyrights
absl-py
2.3.1
(c) for c in self.testcases)
Copyright 2017 The Abseil Authors.
Copyright 2018 The Abseil Authors.
Copyright 2021 The Abseil Authors.
astunparse
1.6.3
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
Copyright (c) 2014, Simon Percivall
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of AST Unparser nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
audioread
3.0.1
Copyright 2011, Adrian Sampson.
Copyright 2013, Adrian Sampson.
Copyright 2014, Adrian Sampson.
Copyright 2017, Adrian Sampson.
Copyright 2018, Sam Thursfield
Copyright 2021, Adrian Sampson.
Copyright (c) 2011-2018 Adrian Sampson
cachetools
5.5.2
Copyright (c) 2014-2025 Thomas Kemmer
Copyright (c) 2014-2025 Thomas Kemmer.
filesystem_spec
2024.10.0
(c)
name = column.path_in_schema
# Skip this column if we are targeting a
# specific columns
split_name = name.split(".")[0]
if (
column_set is None
or name in column_set
or split_name in column_set
):
Copyright (c) 2018, Martin Durant
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
N/A
FlatBuffers
25.2.10
Copyright 2014 Google Inc. All rights reserved.
Copyright 2016 Google Inc. All rights reserved.
Copyright 2016 Google Inc. All rights reserved.
Copyright 2017 Google Inc. All rights reserved.
Copyright 2019 Google Inc. All rights reserved.
Copyright 2020 Google Inc. All rights reserved.
gast
0.6.0
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
Copyright (c) 2016, Serge Guelton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Neither the name of HPCProject, Serge Guelton nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
google-auth-oauthlib
1.2.2
Copyright 2014 Google Inc.
Copyright 2016 Google Inc.
Copyright 2017 Google Inc.
Copyright 2017 Google Inc.
Copyright 2019 Google LLC
Copyright (C) 2017 Google Inc.
google-pasta
0.2.0
Copyright 2017 Google LLC
Copyright 2019 Google LLC
grpc
1.73.1
(c) & 0x3f
des_skb[1][((c >> 6) & 0x03) | ((c >> 7) & 0x3c)] |
des_skb[2][((c >> 13) & 0x0f) | ((c >> 14) & 0x30)] |
des_skb[3][((c >> 20) & 0x01) | ((c >> 21) & 0x06) |
((c >> 22) & 0x38)];
t = des_skb[4][(d) & 0x3f] |
des_skb[5][((d >> 7) & 0x03) | ((d >> 8) & 0x3c)] |
des_skb[6][(d >> 15) & 0x3f] |
des_skb[7][((d >> 21) & 0x0f) | ((d >> 22) & 0x30)];
// table contained 0213 4657
t2 = ((t << 16) | (s & 0x0000ffff)) & 0xffffffff;
schedule->subkeys[i][0] = CRYPTO_rotr_u32(t2, 30);
(c) < 0x80)
return std::string(1, static_cast<char>(c));
}
(c) ? 1 : -1
# endif
(c) < 128
}
(c) & 15
}
(c) * 16
return true;
// C escapes.
case 'n':
(c) << 2);
return ShiftMix(y * k2 ^ z * k0) * k2;
}
return k2;
(c) >> 4
(c) / 64
(c) % 64))
0x1) == 0x1;
}
(c) >> 8))
(c) Address resolution that causes number of backends to go from
// non-zero to zero.
// (d) Address resolution that causes a new LB policy to be created.
//
// We track a list of strings to eventually be concatenated and traced.
std::vector<const char*> trace_strings;
const bool resolution_contains_addresses =
result.addresses.ok() && !result.addresses->empty();
if (!resolution_contains_addresses &&
previous_resolution_contained_addresses_) {
trace_strings.push_back("Address list became empty");
} else if (resolution_contains_addresses &&
!previous_resolution_contained_addresses_) {
trace_strings.push_back("Address list became non-empty");
(C)
aes_ctr(aes_ctx, out, n, in, in_len);
return 1;
}
(C) and C(D) are supplied.
CertIssuerSourceStatic sync_certs;
sync_certs.AddCert(b_by_c_);
sync_certs.AddCert(c_by_d_);
for (const bool insufficient_limit : {true, false}) {
CertPathBuilder path_builder(
a_by_b_, &trust_store, &delegate_, time_, KeyPurpose::ANY_EKU,
initial_explicit_policy_, user_initial_policy_set_,
initial_policy_mapping_inhibit_, initial_any_policy_inhibit_);
path_builder.AddCertIssuerSource(&sync_certs);
(C) and C(D) are supplied.
CertIssuerSourceStatic sync_certs;
sync_certs.AddCert(b_by_c_);
sync_certs.AddCert(c_by_d_);
for (const bool insufficient_limit : {true, false}) {
SCOPED_TRACE(insufficient_limit);
(c) as a "positive integer". So doing a
// key derivation with iterations=0 is ill-defined and should result in a
// failure.
TEST(PBKDFTest, ZeroIterations) {
static const char kPassword[] = "password";
const size_t password_len = strlen(kPassword);
static const uint8_t kSalt[] = {1, 2, 3, 4};
const size_t salt_len = sizeof(kSalt);
const EVP_MD *digest = EVP_sha1();
uint8_t key[10] = {0};
const size_t key_len = sizeof(key);
(c) as being a "positive integer", so a
// value of 0 is an error.
//
// Unfortunately not all consumers of PKCS5_PBKDF2_HMAC() check their return
// value, expecting it to succeed and unconditionally using |out_key|. As a
// precaution for such callsites in external code, the old behavior of
// iterations < 1 being treated as iterations == 1 is preserved, but
// additionally an error result is returned.
(c) assert(c)
#else
(c) ^ (b))
(C) bool high_bit_set = (crc
// crc <<= 1;
// if (high_bit_set) crc ^= ((kCrc32cPoly << 1) ^ 1);
//
// The last observation is, if we store our checksums in variable `rcrc`,
// with order of the bits reversed, the inverse operation becomes:
(c) can safely add the extra character c to the sequence.
// These pointers remain in place for the duration of the buffer
this->setp(buffer, buffer + buffer_size - 1);
}
else
(c) (((c) ==
int ExprMatch (char *string,char *expr)
(c) ^ (d))
(c) & (d)))
(c) ^ (d))
#define F_40_59(b, c, d) (((b) & (c)) | (((b) | (c)) & (d)))
#define F_60_79(b, c, d) F_20_39(b, c, d)
#define BODY_00_15(i, a, b, c, d, e, f, xi) \
do { \
(f) = (xi) + (e) + K_00_19 + CRYPTO_rotl_u32((a), 5) + \
F_00_19((b), (c), (d)); \
(b) = CRYPTO_rotl_u32((b), 30); \
} while (0)
(c) ^ (d))
#define G(b, c, d) ((((b) ^ (c)) & (d)) ^ (c))
(c) ^ (d))
#define I(b, c, d) (((~(d)) | (b)) ^ (c))
#define R0(a, b, c, d, k, s, t) \
do { \
(a) += ((k) + (t) + F((b), (c), (d))); \
(a) = CRYPTO_rotl_u32(a, s); \
(a) += (b); \
} while (0)
(c) ^ (d))
#define R0(a, b, c, d, k, s, t) \
do { \
(a) += ((k) + (t) + F((b), (c), (d))); \
(a) = CRYPTO_rotl_u32(a, s); \
} while (0)
(C)(D)(E)(F)(G)(H)(I)(J)(K)(L)(M)" \
"(N)(O)(P)(Q)(R)(S)(T)(U)(V)(W)(X)(Y)(Z)$"
void Search_Easy0_CachedDFA(benchmark::State& state) { Search(state, EASY0, SearchCachedDFA); }
void Search_Easy0_CachedNFA(benchmark::State& state) { Search(state, EASY0, SearchCachedNFA); }
void Search_Easy0_CachedPCRE(benchmark::State& state) { Search(state, EASY0, SearchCachedPCRE); }
void Search_Easy0_CachedRE2(benchmark::State& state) { Search(state, EASY0, SearchCachedRE2); }
(C)
EXPECT_TRUE(Demangle("_Z1fI1CEDTcldtfp_onclEET_", tmp, sizeof(tmp)));
EXPECT_STREQ("f<>()", tmp);
}
(C) is supplied.
CertIssuerSourceStatic sync_certs;
sync_certs.AddCert(b_by_c_);
for (const bool insufficient_limit : {true, false}) {
SCOPED_TRACE(insufficient_limit);
(C) is supplied.
CertIssuerSourceStatic sync_certs;
sync_certs.AddCert(b_by_c_);
// Test Activation / DeActivation of the cache.
EXPECT_FALSE(delegate_.GetVerifyCache());
delegate_.ActivateCache();
EXPECT_TRUE(delegate_.GetVerifyCache());
delegate_.DeActivateCache();
EXPECT_FALSE(delegate_.GetVerifyCache());
delegate_.ActivateCache();
EXPECT_TRUE(delegate_.GetVerifyCache());
for (size_t i = 0; i < 3; i++) {
SCOPED_TRACE(i);
(C) is supplied statically.
CertIssuerSourceStatic sync_certs;
sync_certs.AddCert(b_by_c_);
// Cert C(D) is supplied asynchronously and will expire the deadline before
// returning the async result.
AsyncCertIssuerSourceStatic async_certs;
async_certs.AddCert(c_by_d_);
async_certs.SetAsyncGetCallback(
[&] { delegate_.SetDeadlineExpiredForTesting(true); });
(c) it reports overflows via errno.
const char* ptr = text;
int base = 10;
uint64_t overflow_if_mul_base = (UINT64_MAX / 10) + 1;
if (ptr[0] == '0') {
if (ptr[1] == 'x' || ptr[1] == 'X') {
// This is hex.
base = 16;
overflow_if_mul_base = (UINT64_MAX / 16) + 1;
ptr += 2;
} else {
// This is octal.
base = 8;
overflow_if_mul_base = (UINT64_MAX / 8) + 1;
(c) / kP32;
// The probability of acceptance on the fast path is `q` and so the
// probability of acceptance here should be `p - q`.
(c) > MaxCasefoldGroup:
raise unicode.Error("casefold group too long: %s" % (c,))
for i in range(len(c)):
Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 1995-2017 The OpenSSL Project Authors. All Rights Reserved.
Copyright 1995-2024 Jean-loup Gailly and Mark Adler ";
/*
If you use the zlib library in a product, an acknowledgment is welcome
in the documentation of your product. If for some reason you cannot
include such an acknowledgment, I would appreciate that you keep this
Copyright 1995-2024 Mark Adler ";
/*
If you use the zlib library in a product, an acknowledgment is welcome
in the documentation of your product. If for some reason you cannot
include such an acknowledgment, I would appreciate that you keep this
Copyright 1998-2004 Gilles Vollant - http://www.winimage.com/zLibDll";
Copyright 1998-2004 Gilles Vollant - http://www.winimage.com/zLibDll";
/* unz_file_info64_internal contain internal info about a file in zipfile*/
typedef struct unz_file_info64_internal_s
Copyright 1998, 2011, 2013 by the Massachusetts Institute of Technology.
Copyright 1998, 2011, 2013 by the Massachusetts Institute of Technology.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 1998, 2011 by the Massachusetts Institute of Technology.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 1998 by the Massachusetts Institute of Technology.
Copyright 1998 by the Massachusetts Institute of Technology.
*
Copyright 1998 by the Massachusetts Institute of Technology.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 1999-2005 The RE2 Authors. All Rights Reserved.
Copyright 1999-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2000-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2000 by the Massachusetts Institute of Technology.
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 2001-2010 The RE2 Authors. All Rights Reserved.
Copyright 2001-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2002-2009 The RE2 Authors. All Rights Reserved.
Copyright 2002-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2003-2009 Google Inc. All rights reserved.
Copyright 2003-2009 The RE2 Authors. All Rights Reserved.
Copyright 2003-2010 Google Inc. All Rights Reserved.
Copyright 2003-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2004-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2004 The RE2 Authors. All Rights Reserved.
Copyright 2005-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2005 by Dominick Meglio
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 2005 Dominick Meglio
Copyright 2005, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2005 Google Inc. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2005 Nokia. All rights reserved.
Copyright 2005 The RE2 Authors. All Rights Reserved.
Copyright 2006-2007 The RE2 Authors. All Rights Reserved.
Copyright 2006-2008 The RE2 Authors. All Rights Reserved.
Copyright 2006-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2006-2017 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2006-2019 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2006-2021 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2006, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2006, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2006 The RE2 Authors. All Rights Reserved.
Copyright 2007, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2007 The RE2 Authors. All Rights Reserved.
Copyright 2008-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2008, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2008 Google Inc.
// All Rights Reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2008 The RE2 Authors. All Rights Reserved.
Copyright 2009 Google Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2009 Google Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2009, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2009, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2009 Google Inc. All Rights Reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2009 Google Inc. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2009 The RE2 Authors. All Rights Reserved.
Copyright 2010-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2010 Google Inc. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2010 The Chromium Authors
Copyright 2010 The RE2 Authors. All Rights Reserved.
Copyright 2011-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2011 The Chromium Authors
Copyright 2012-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2013-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2013, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2014-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2014 The BoringSSL Authors
Copyright 2015-2016 gRPC authors.
Copyright 2015-2016 gRPC authors.
Copyright 2015-2016 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2015 Google Inc. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2015, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2015 gRPC authors.
Copyright 2015 gRPC authors.
Copyright 2015 The BoringSSL Authors
Copyright 2015 The Chromium Authors
Copyright 2016 Brian Smith.
Copyright 2016 Google Inc. All Rights Reserved.
Copyright 2016, Google Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
Copyright 2016, Google Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
Copyright 2016 gRPC authors.
Copyright 2016 gRPC authors.
Copyright 2016 The BoringSSL Authors
Copyright 2016 The Chromium Authors
Copyright 2016 The RE2 Authors. All Rights Reserved.
Copyright 2017 Google Inc. All Rights Reserved.
Copyright 2017 gRPC authors.
Copyright 2017 gRPC authors.
Copyright 2017 The Abseil Authors.
Copyright 2017 The BoringSSL Authors
Copyright 2017 The Chromium Authors
Copyright 2017 The OpenSSL Project Authors. All Rights Reserved.
Copyright 2018, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2018, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2018 Google LLC. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2018, Google LLC.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2018 gRPC authors.
Copyright 2018 gRPC authors.
Copyright 2018 The Abseil Authors.
Copyright 2018 The BoringSSL Authors
Copyright 2018 The Chromium Authors
Copyright 2018 The RE2 Authors. All Rights Reserved.
Copyright 2019, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2019 Google LLC. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2019, Google LLC.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google LLC. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2019 gRPC authors.
Copyright 2019 gRPC authors.
Copyright 2019 The Abseil Authors.
Copyright 2019 The Abseil Authors
Copyright 2019 The BoringSSL Authors
Copyright 2019 The Chromium Authors
Copyright 2019 The gRPC authors.
Copyright 2019 The gRPC authors.
Copyright 2019 The gRPC Authors
Copyright 2019 The gRPC Authors
Copyright 2020 by <danny.sonnenschein@platynum.ch>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright 2020 Google Inc. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2020 gRPC authors.
Copyright 2020 gRPC authors.
Copyright 2020 The Abseil Authors.
Copyright 2020 The Abseil Authors
Copyright 2020 The BoringSSL Authors
Copyright 2020 The gRPC authors.
Copyright 2020 The gRPC authors.
Copyright 2020 The gRPC Authors
Copyright 2020 The gRPC Authors
Copyright 2021 Google Inc. All Rights Reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2021 gRPC authors.
Copyright 2021 gRPC Authors
Copyright 2021 The Abseil Authors.
Copyright 2021 The Abseil Authors
Copyright 2021 The BoringSSL Authors
Copyright 2021 The Chromium Authors
Copyright 2021 the gRPC authors.
Copyright 2021 The gRPC authors.
Copyright 2021 The gRPC Authors
Copyright 2022 Google LLC
Copyright 2022 gRPC authors.
Copyright 2022 gRPC authors.
Copyright 2022 gRPC Authors
Copyright 2022 The Abseil Authors.
Copyright 2022 The Abseil Authors
Copyright 2022 The BoringSSL Authors
Copyright 2022 The Chromium Authors
Copyright 2022 The gRPC Authors
Copyright 2023 Google LLC
Copyright 2023 Google LLC. All rights reserved.
Copyright 2023 Google LLC. All rights reserved.
# https://developers.google.com/protocol-buffers/
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google LLC nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2023 gRPC authors.
Copyright 2023 gRPC Authors
Copyright 2023 The Abseil Authors.
Copyright 2023 The Abseil Authors
Copyright 2023 The BoringSSL Authors
Copyright 2023 The Chromium Authors
Copyright 2023 The gRPC authors.
Copyright 2023 The gRPC authors.
Copyright 2023 The gRPC Authors.
Copyright 2023 The gRPC Authors
Copyright 2024 Google LLC. All rights reserved.
Copyright 2024 gRPC authors.
Copyright 2024 The Abseil Authors.
Copyright 2024 The Abseil Authors
Copyright 2024 The BoringSSL Authors
Copyright 2024 The gRPC Authors.
Copyright 2024 The gRPC Authors
Copyright 2025, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2025, Google Inc.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following disclaimer
# in the documentation and/or other materials provided with the
# distribution.
# * Neither the name of Google Inc. nor the names of its
# contributors may be used to endorse or promote products derived from
# this software without specific prior written permission.
#
Copyright 2025 gRPC authors.
Copyright 2025 The BoringSSL Authors
Copyright 2025 The gRPC Authors.
Copyright 2025 The gRPC Authors
Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
Copyright (c) 1987-2001 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* A. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* B. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* C. Neither the names of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
Copyright (c) 1990-2000 Info-ZIP. All rights reserved.
Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
Copyright (C) 1995-2003, 2010, 2014, 2016 Jean-loup Gailly, Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2003, 2010 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2003 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2005, 2010 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2005, 2014, 2016 Jean-loup Gailly, Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2006, 2010, 2011, 2016 Jean-loup Gailly
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2006, 2011, 2016 Jean-loup Gailly
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2008 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2011, 2016 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2017 Jean-loup Gailly
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2017 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2019 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2022 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2022 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*
* This interleaved implementation of a CRC makes use of pipelined multiple
* arithmetic-logic units, commonly found in modern CPU cores. It is due to
* Kadatch and Jenkins (2010). See doc/crc-doc.1.0.pdf in this distribution.
Copyright (C) 1995-2024 Jean-loup Gailly and Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2024 Jean-loup Gailly and Mark Adler
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Copyright (C) 1995-2024 Jean-loup Gailly
* detect_data_type() function provided freely by Cosmin Truta, 2006
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2024 Jean-loup Gailly
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2024 Jean-loup Gailly, Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 1995-2024 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (c) 1996-1999 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
Copyright (c) 1996,1999 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
Copyright (c) 1997
* Christian Michelsen Research AS
* Advanced Computing
* Fantoftvegen 38, 5036 BERGEN, Norway
* http://www.cmr.no
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. Christian Michelsen Research AS makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
Copyright (C) 1998-2005 Gilles Vollant
This code is a modified version of crypting code in Infozip distribution
Copyright (C) 1998 - 2010 Gilles Vollant, Even Rouault, Mathias Svensson
Copyright (C) 1998-2010 Gilles Vollant (minizip) ( http://www.winimage.com/zLibDll/minizip.html )
Modifications for Zip64 support
Copyright (C) 1998-2010 Gilles Vollant (minizip) ( http://www.winimage.com/zLibDll/minizip.html )
Modifications of Unzip for Zip64
Copyright (C) 2002-2013 Mark Adler, all rights reserved
version 2.3, 21 Jan 2013
This software is provided 'as-is', without any express or implied
warranty. In no event will the author be held liable for any damages
arising from the use of this software.
Copyright (C) 2002-2013 Mark Adler
* For conditions of distribution and use, see copyright notice in puff.h
* version 2.3, 21 Jan 2013
*/
Copyright (C) 2002-2013 Mark Adler
* For conditions of distribution and use, see copyright notice in puff.h
* version 2.3, 21 Jan 2013
*
* puff.c is a simple inflate written to be an unambiguous way to specify the
* deflate format. It is not written for speed but rather simplicity. As a
* side benefit, this code might actually be useful when small code is more
* important than speed, such as bootstrap applications. For typical deflate
* data, zlib's inflate() is about four times as fast as puff(). zlib's
* inflate compiles to around 20K on my machine, whereas puff.c compiles to
* around 4K on my machine (a PowerPC using GNU cc). If the faster decode()
* function here is used, then puff() is only twice as slow as zlib's
* inflate().
Copyright (c) 2002 by Lucent Technologies.
* Permission to use, copy, modify, and distribute this software for any
* purpose without fee is hereby granted, provided that this entire notice
* is included in all copies of any software which is or includes a copy
* or modification of this software and in all copies of the supporting
* documentation for such software.
* THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
* REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
* OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
*/
Copyright (c) 2002 by Lucent Technologies.
* Permission to use, copy, modify, and distribute this software for any
* purpose without fee is hereby granted, provided that this entire notice
* is included in all copies of any software which is or includes a copy
* or modification of this software and in all copies of the supporting
* documentation for such software.
* THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTY. IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
* REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
* OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
*
* This file and rune.cc have been converted to compile as C++ code
* in name space re2.
Copyright (c) 2002, Oracle and/or its affiliates. All rights reserved.
Copyright (C) 2003, 2005, 2008, 2010, 2012 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
Version 1.7 12 August 2012 Mark Adler */
/* Version history:
Copyright (C) 2003-2010 Mark Adler\n");
fprintf(stderr, "usage: gun [-t] [file1.gz [file2.Z ...]]\n");
return 0;
}
if (argc && strcmp(*argv, "-t") == 0) {
test = 1;
argc--;
argv++;
Copyright (C) 2003, 2012, 2013 Mark Adler
* For conditions of distribution and use, see copyright notice in blast.h
* version 1.3, 24 Aug 2013
*
* blast.c decompresses data compressed by the PKWare Compression Library.
* This function provides functionality similar to the explode() function of
* the PKWare library, hence the name "blast".
Copyright (C) 2003, 2012, 2013 Mark Adler
version 1.3, 24 Aug 2013
This software is provided 'as-is', without any express or implied
warranty. In no event will the author be held liable for any damages
arising from the use of this software.
Copyright (C) 2003, 2012 Mark Adler, all rights reserved
version 1.2, 11 Oct 2012
This software is provided 'as-is', without any express or implied
warranty. In no event will the author be held liable for any damages
arising from the use of this software.
Copyright (C) 2003, 2012 Mark Adler\n"
);
printf(
"usage: gzappend [-level] file.gz [ addthis [ andthis ... ]]\n");
return 0;
Copyright (C) 2003 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2004, 2005, 2012 Mark Adler, all rights reserved
version 1.2, 14 Aug 2012
This software is provided 'as-is', without any express or implied
warranty. In no event will the author be held liable for any damages
arising from the use of this software.
Copyright (C) 2004, 2008, 2012, 2016, 2019 Mark Adler, all rights reserved
* For conditions of distribution and use, see copyright notice in gzlog.h
* version 2.3, 25 May 2019
*/
Copyright (C) 2004, 2008, 2012 Mark Adler, all rights reserved
version 2.2, 14 Aug 2012
This software is provided 'as-is', without any express or implied
warranty. In no event will the author be held liable for any damages
arising from the use of this software.
Copyright (C) 2004-2009 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004-2010 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004, 2010 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2004 - 2011 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004 - 2011 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004-2011 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004 - 2012 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004 - 2013 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004-2017 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2004-2017 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2004-2019 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2004-2024 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2004 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
Copyright (C) 2005 - 2010, Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2005, 2012, 2018, 2023 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
* Version 1.3 18 Feb 2023 Mark Adler */
#include <stdio.h>
#include "zlib.h"
Copyright (C) 2005, 2012, 2018, 2023 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
* Version 1.4 13 Apr 2023 Mark Adler */
/* Version History:
Copyright (C) 2005-2013 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2005, 2013 by Dominick Meglio
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2005 by Dominick Meglio
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2006, Network Resonance, Inc.
Copyright (C) 2007, 2008, 2012, 2018 Mark Adler
* Version 1.5 5 August 2018 Mark Adler
*/
Copyright (C) 2007-2008 Even Rouault
Copyright (C) 2007-2008 Even Rouault
Modifications for Zip64 support on both zip and unzip
Copyright (C) 2007-2013 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2008-2013 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2008 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2009-2010 Mathias Svensson ( http://result42.com )
*/
Copyright (C) 2009-2010 Mathias Svensson ( http://result42.com )
For more info read MiniZip_info.txt
Copyright (C) 2009-2010 Mathias Svensson ( http://result42.com )
For more info read MiniZip_info.txt
Copyright (C) 2009 - 2013 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2009-2013 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2009 - 2021 by Daniel Stenberg et al
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. M.I.T. makes no representations about the
* suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2009 by Jakub Hrozek <jhrozek@redhat.com>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2010-2012 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2010-2013 by Daniel Stenberg
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2010 Jeremy Lal <kapouer@melix.org>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2011, 2016 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
*/
Copyright (C) 2011, RTFM, Inc.
Copyright (C) 2012-2020 Yann Collet
Copyright (c) 2012 by Gilles Chehade <gilles@openbsd.org>
Copyright (c) 2012, Intel Corporation. All Rights Reserved.
Copyright (C) 2012 Marko Kreen <markokr@gmail.com>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (c) 2014, Intel Corporation. All Rights Reserved.
Copyright (c) 2015, Intel Inc.
Copyright (C) 2017 - 2018 by Christian Ammer
Copyright (C) 2017 by John Schember <john@nachtimwald.com>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2018 by John Schember <john@nachtimwald.com>
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2018 Mark Adler
* For conditions of distribution and use, see copyright notice in zlib.h
* Version 1.0 7 Oct 2018 Mark Adler */
// gznorm takes a gzip stream, potentially containing multiple members, and
// converts it to a gzip stream with a single member. In addition the gzip
// header is normalized, removing the file name and time stamp, and setting the
// other header contents (XFL, OS) to fixed values. gznorm does not recompress
// the data, so it is fast, but no advantage is gained from the history that
// could be available across member boundaries.
Copyright (C) 2018 The Android Open Source Project
Copyright (C) 2019 by Andrew Selivanov
Copyright (C) 2019 by Andrew Selivanov
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
Copyright (C) 2019 by Andrew Selivanov
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (c) 2020, Arm Ltd.
Copyright (C) 2021 by Brad House
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (C) 2021
*
* Permission to use, copy, modify, and distribute this
* software and its documentation for any purpose and without
* fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright
* notice and this permission notice appear in supporting
* documentation, and that the name of M.I.T. not be used in
* advertising or publicity pertaining to distribution of the
* software without specific, written prior permission.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is"
* without express or implied warranty.
Copyright (c) 2022, Robert Nagy <robert.nagy@gmail.com>
copyright doctrines of fair use, fair dealing, or other
equivalents.
2.7. Conditions
copyright doctrines of fair use, fair dealing, or other
equivalents.
2.7. Conditions
copyright = lines
"// Protocol Buffers - Google's data interchange format"
)
copyright string in the executable of your product.
*/
copyright
// that probe a variety of ranges of code-point space. All are longer than 32
// code points, so they exercise the carrying of seminibbles from one uint64_t
// to the next higher one in BoundedUtf8LengthSequence.
// The first three lines of the Old English epic _Beowulf_, mostly ASCII with a
// few archaic two-byte letters interspersed.
TEST_F(DecodeRustPunycodeTest, Beowulf) {
punycode_ = "hwt_we_gardena_in_geardagum_"
"eodcyninga_rym_gefrunon_"
"hu_a_elingas_ellen_fremedon_hxg9c70do9alau";
plaintext_ = "hwæt_we_gardena_in_geardagum_"
"þeodcyninga_þrym_gefrunon_"
"hu_ða_æþelingas_ellen_fremedon";
copyright to help
* - Send help to stdout instead of stderr
* - Add some preemptive typecasts
* - Add L to constants in lseek() calls
* - Remove some debugging information in error messages
* - Use new data_type definition for zlib 1.2.1
* - Simplify and unify file operations
* - Finish off gzip file in gztack()
* - Use deflatePrime() instead of adding empty blocks
* - Keep gzip file clean on appended file read errors
* - Use in-place rotate instead of auxiliary buffer
* (Why you ask? Because it was fun to write!)
* 1.2 11 Oct 2012 - Fix for proper z_const usage
* - Check for input buffer malloc failure
*/
copyright:
while not lines
(c) (possibly std::begin(c)).
// ContainerIter<const vector<T>> gives vector<T>::const_iterator,
// while ContainerIter<vector<T>> gives vector<T>::iterator.
template <typename C>
using ContainerIter = decltype(begin(std::declval<C&>()));
// An MSVC bug involving template parameter substitution requires us to use
// decltype() here instead of just std::pair.
template <typename C1, typename C2>
using ContainerIterPairType =
decltype(std::make_pair(ContainerIter<C1>(), ContainerIter<C2>()));
(c)
static constexpr size_t kA = // ceil(w/m)
(kResultBits / kUrbgBits) + ((kResultBits % kUrbgBits) != 0); // n'
static constexpr size_t kABits = kResultBits / kA; // w0'
static constexpr urbg_result_type kARejection =
((kUrbgRange >> kABits) << kABits); // y0'
(c) under Patent Claims infringed by Covered Software in the absence of
(c) under Patent Claims infringed by Covered Software in the absence of
(c) ((unsigned char)c)
#define __Pyx_long_cast(x) ((long)x)
#define __Pyx_fits_Py_ssize_t(v, type, is_signed) (\
(sizeof(type) < sizeof(Py_ssize_t)) ||\
(sizeof(type) > sizeof(Py_ssize_t) &&\
likely(v < (type)PY_SSIZE_T_MAX ||\
v == (type)PY_SSIZE_T_MAX) &&\
(!is_signed || likely(v > (type)PY_SSIZE_T_MIN ||\
v == (type)PY_SSIZE_T_MIN))) ||\
(sizeof(type) == sizeof(Py_ssize_t) &&\
(is_signed || likely(v < (type)PY_SSIZE_T_MAX ||\
v == (type)PY_SSIZE_T_MAX))) )
static CYTHON_INLINE int __Pyx_is_valid_index(Py_ssize_t i, Py_ssize_t limit) {
return (size_t) i < (size_t) limit;
}
#if defined (__cplusplus) && __cplusplus >= 201103L
#include <cstdlib>
#define __Pyx_sst_abs(value) std::abs(value)
#elif SIZEOF_INT >= SIZEOF_SIZE_T
#define __Pyx_sst_abs(value) abs(value)
#elif SIZEOF_LONG >= SIZEOF_SIZE_T
#define __Pyx_sst_abs(value) labs(value)
#elif defined (_MSC_VER)
#define __Pyx_sst_abs(value) ((Py_ssize_t)_abs64(value))
#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
#define __Pyx_sst_abs(value) llabs(value)
#elif defined (__GNUC__)
#define __Pyx_sst_abs(value) __builtin_llabs(value)
#else
#define __Pyx_sst_abs(value) ((value<0) ? -value : value)
#endif
static CYTHON_INLINE Py_ssize_t __Pyx_ssize_strlen(const char *s);
static CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject*);
static CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length);
static CYTHON_INLINE PyObject* __Pyx_PyByteArray_FromString(const char*);
#define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l)
#define __Pyx_PyBytes_FromString PyBytes_FromString
#define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize
static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char*);
#if CYTHON_ASSUME_SAFE_MACROS
#define __Pyx_PyBytes_AsWritableString(s) ((char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsWritableSString(s) ((signed char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsWritableUString(s) ((unsigned char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsString(s) ((const char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsSString(s) ((const signed char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsUString(s) ((const unsigned char*) PyBytes_AS_STRING(s))
#define __Pyx_PyByteArray_AsString(s) PyByteArray_AS_STRING(s)
#else
#define __Pyx_PyBytes_AsWritableString(s) ((char*) PyBytes_AsString(s))
#define __Pyx_PyBytes_AsWritableSString(s) ((signed char*) PyBytes_AsString(s))
#define __Pyx_PyBytes_AsWritableUString(s) ((unsigned char*) PyBytes_AsString(s))
#define __Pyx_PyBytes_AsString(s) ((const char*) PyBytes_AsString(s))
#define __Pyx_PyBytes_AsSString(s) ((const signed char*) PyBytes_AsString(s))
#define __Pyx_PyBytes_AsUString(s) ((const unsigned char*) PyBytes_AsString(s))
#define __Pyx_PyByteArray_AsString(s) PyByteArray_AsString(s)
#endif
#define __Pyx_PyObject_AsWritableString(s) ((char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsWritableSString(s) ((signed char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsWritableUString(s) ((unsigned char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsSString(s) ((const signed char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsUString(s) ((const unsigned char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_FromCString(s) __Pyx_PyObject_FromString((const char*)s)
#define __Pyx_PyBytes_FromCString(s) __Pyx_PyBytes_FromString((const char*)s)
#define __Pyx_PyByteArray_FromCString(s) __Pyx_PyByteArray_FromString((const char*)s)
#define __Pyx_PyUnicode_FromCString(s) __Pyx_PyUnicode_FromString((const char*)s)
#define __Pyx_PyUnicode_FromOrdinal(o) PyUnicode_FromOrdinal((int)o)
#define __Pyx_PyUnicode_AsUnicode PyUnicode_AsUnicode
static CYTHON_INLINE PyObject *__Pyx_NewRef(PyObject *obj) {
#if CYTHON_COMPILING_IN_CPYTHON && PY_VERSION_HEX >= 0x030a0000 || defined(Py_NewRef)
return Py_NewRef(obj);
#else
Py_INCREF(obj);
return obj;
#endif
(c) Use FAILED_PRECONDITION if the client should not retry until
the system state has been explicitly fixed. E.g., if an "rmdir"
fails because the directory is non-empty, FAILED_PRECONDITION
should be returned since the client should not retry unless
they have first fixed up the directory by deleting files from it.
(d) Use FAILED_PRECONDITION if the client performs conditional
REST Get/Update/Delete on a resource and the resource on the
server does not match the condition. E.g., conflicting
read-modify-write on the same resource. */
GRPC_STATUS_FAILED_PRECONDITION = 9,
/** The operation was aborted, typically due to a concurrency issue
like sequencer check failures, transaction aborts, etc.
(c) user-initial-policy-set: A set of certificate policy
// identifiers naming the policies that are acceptable to the
// certificate user. The user-initial-policy-set contains the
// special value any-policy if the user is not concerned about
// certificate policy.
//
// initial_policy_mapping_inhibit:
(c) Use string_view::find in each fragment, and specifically handle fragment
// boundaries.
//
// This currently implements option (b).
absl::Cord::CharIterator absl::Cord::FindImpl(CharIterator it,
absl::string_view needle) const {
// Ensure preconditions are met by callers first.
(c) Use
// the system state has been explicitly fixed. For example, if a "rmdir"
// fails because the directory is non-empty, `kFailedPrecondition`
// should be returned since the client should not retry unless
// the files are deleted from the directory.
kFailedPrecondition = 9,
// StatusCode::kAborted
(c) ((void)0)
#endif
/* note: use after variable declarations */
#ifndef XXH_STATIC_ASSERT
# if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 201112L) /* C11 */
# include <assert.h>
# define XXH_STATIC_ASSERT_WITH_MESSAGE(c,m) do { static_assert((c),m); } while(0)
# elif defined(__cplusplus) && (__cplusplus >= 201103L) /* C++11 */
# define XXH_STATIC_ASSERT_WITH_MESSAGE(c,m) do { static_assert((c),m); } while(0)
# else
(c) where
// `Container` and `c.size()` is equal to `num_elements`.
//
// static size_t LowerBoundAllocatedByteSize(size_t num_elements);
(c) X_SEP X_VAL(s) X_SEP \
/* ints */ \
X_VAL(d) X_SEP X_VAL(i) X_SEP X_VAL(o) X_SEP \
X_VAL(u) X_SEP X_VAL(x) X_SEP X_VAL(X) X_SEP \
/* floats */ \
X_VAL(f) X_SEP X_VAL(F) X_SEP X_VAL(e) X_SEP X_VAL(E) X_SEP \
X_VAL(g) X_SEP X_VAL(G) X_SEP X_VAL(a) X_SEP X_VAL(A) X_SEP \
/* misc */ \
X_VAL(n) X_SEP X_VAL(p) X_SEP X_VAL(v)
// clang-format on
// This type should not be referenced, it exists only to provide labels
// internally that match the values declared in FormatConversionChar in
// str_format.h. This is meant to allow internal libraries to use the same
// declared interface type as the public interface
// (absl::StrFormatConversionChar) while keeping the definition in a public
// header.
// Internal libraries should use the form
// `FormatConversionCharInternal::c`, `FormatConversionCharInternal::kNone` for
// comparisons. Use in switch statements is not recommended due to a bug in how
// gcc 4.9 -Wswitch handles declared but undefined enums.
struct FormatConversionCharInternal {
FormatConversionCharInternal() = delete;
(c) XXH_STATIC_ASSERT_WITH_MESSAGE((c),
#endif
h5py
3.14.0
(C) Copyright ..." is shown in the HTML footer. Default is True.
Copyright 1998-2006 by the Board of Trustees of the University of Illinois.
All rights reserved.
Copyright 2001-2013 Python Software Foundation; All Rights
Copyright 2006-2007 by The HDF Group (THG).
NCSA HDF5 (Hierarchical Data Format 5) Software Library and Utilities
Copyright 2008-2013 Andrew Collette and contributors
Copyright 2008-2013 Andrew Collette and contributors
Copyright 2008-2019 Andrew Collette and contributors
Copyright 2008-2019 Andrew Collette and contributors
Copyright 2008-2020 Andrew Collette and contributors
Copyright 2008-2020 Andrew Collette and contributors
copyright = '2014, Andrew Collette and contributors
# The version info for the project you're documenting, acts as replacement for
# |version| and |release|, also used in various other places throughout the
# built documents.
Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de>
*
* Redistribution and use in source and binary forms, with or without modifica-
* tion, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
Copyright (c) 2000-2008 Marc Alexander Lehmann <schmorp@schmorp.de>
*
* Redistribution and use in source and binary forms, with or without modifica-
* tion, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
Copyright (c) 2002, 2003, 2004 Francesc Altet
Copyright (c) 2005, 2006, 2007 Carabos Coop. V.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
a. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
b. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
c. Neither the name of the Carabos Coop. V. nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2006-2008 Alexander Chemeris
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The name of the author may be used to endorse or promote products
derived from this software without specific prior written permission.
Copyright (c) 2008-2009 Andrew Collette
http://h5py.org
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
a. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
b. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
c. Neither the name of the author nor the names of contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2008-2009 Andrew Collette
http://h5py.org
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
a. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
b. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
c. Neither the name of the author nor the names of contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2008-2013 Andrew Collette and contributors
http://www.h5py.org
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
a. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
b. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
c. Neither the name of the author nor the names of contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2008-2013 Andrew Collette and contributors
http://www.h5py.org
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
a. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
b. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
c. Neither the name of the author nor the names of contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (C) 2008 Andrew Collette
Copyright (c) 2008 Andrew Collette and contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2008 Andrew Collette and contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2008 Andrew Collette and contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the
distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright
# (c) 2009-2022, Marcel Hellkamp, MIT license).
class cached_property:
Copyright
# (c) 2009-2022, Marcel Hellkamp, MIT license).
class cached_property:
Copyright (C) 2009 Andrew Collette
Copyright (C) 2009 Darren Dale
Copyright (C) 2009 Darren Dale
Copyright (c) 2015,
Copyright (c) 2015,
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
#html_use_opensearch = ''
idna
3.10
Copyright (c) 2013-2024, Kim Davies and contributors. All rights reserved.
jinjapython
3.1.4
(c)
assert c.current == 2
c.reset()
assert c.current == 1
def test_expressions(self, env):
(c)
if c:
c_size += 1
except StopIteration:
joblib
1.4.2
(c) 2009-2021 Jeremy Ashkenas, Julian Gonggrijp, and DocumentCloud and Investigative Reporters
(c) JS Foundation and other contributors
copyright = '2008-2021, Joblib developers
# The version info for the project you're documenting, acts as replacement for
# |version| and |release|, also used in various other places throughout the
# built documents.
Copyright 2009 Brian Quinlan. All Rights Reserved.
Copyright: 2010, Gael Varoquaux
Copyright: 2012, Olivier Grisel
Copyright: 2017, Thomas Moreau
Copyright (c) 2008 Gael Varoquaux
Copyright (c) 2009
All rights reserved.
Copyright (c) 2009 Gael Varoquaux
Copyright (c) 2010-2011 Gael Varoquaux
Copyright (c) 2010 Gael Varoquaux
Copyright (c) 2012-now, CloudPickle developers and contributors.
Copyright (c) 2012, Regents of the University of California.
copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS.
Copyright JS Foundation and other contributors
keras-team/keras
2.15.0
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Copyright 2021 The TensorFlow Authors. All Rights Reserved.
Copyright 2021 The TensorFlow Authors. All Rights Reserved.
Copyright 2022 The Keras Authors. All Rights Reserved.
Copyright 2022 The TensorFlow Authors. All Rights Reserved.
Copyright 2022 The TensorFlow Authors. All Rights Reserved.
Copyright 2023 The Keras Authors. All Rights Reserved.
Copyright 2023 The TensorFlow Authors. All Rights Reserved.
copyright for Fashion-MNIST is held by Zalando SE.
N/A
lazy-loader
0.4
Copyright (c) 2022--2023, Scientific Python project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
libclang
18.1.1
Copyright (c) 2007-2019 University of Illinois at Urbana-Champaign.
All rights reserved.
Developed by:
Copyright (c) 2007-2019 University of Illinois at Urbana-Champaign.
All rights reserved.
Developed by:
librosa
0.10.2.post1
(C)
fill_off_diagonal(C, radius=band_rad, value=np.inf)
# initialize whole matrix with infinity values
D = np.ones(C.shape + np.array([max_0, max_1])) * np.inf
(C)
for i in range(n_chroma):
v = chroma[i][chroma[i] != 0]
v = np.around(v, decimals=2)
if base_c:
(C)
# if diagonal matching, Y has to be longer than X
# (X simply cannot be contained in Y)
if np.array_equal(step_sizes_sigma, np.array([[1, 1]])) and (
C.shape[0] > C.shape[1]
):
(C)
# number of bins is correct
assert C.shape[0] == n_bins
if fmin is None:
Copyright (c) 2013--2023, librosa development team.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
(C)
y_rec = librosa.griffinlim_cqt(
Cmag,
hop_length=hop_length,
window=window,
sr=sr,
fmin=fmin,
bins_per_octave=bins_per_octave,
scale=scale,
pad_mode=pad_mode,
n_iter=2,
momentum=momentum,
random_state=random_state,
length=length,
res_type=res_type,
init=init,
dtype=dtype,
)
llvmlite
0.44.0
Copyright (c) 2014-, Continuum Analytics, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Copyright (c) 2014-, Continuum Analytics, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
N/A
markdown-it-py
3.0.0
Copyright 2014 Mathias Bynens <https://mathiasbynens.be/>
Copyright 2021 Taneli Hukkinen
Copyright (c) 2014 Vitaly Puzrin, Alex Kocharin.
Copyright (c) 2020 ExecutableBookProject
MarkupSafe
3.0.2
Copyright 2010 Pallets
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2010 Pallets
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
mdurl
0.1.2
Copyright (c) 2015 Vitaly Puzrin, Alex Kocharin.
Copyright (c) 2021 Taneli Hukkinen
Copyright Joyent, Inc. and other Node contributors.
Copyright Joyent, Inc. and other Node contributors. All rights reserved.
ml-dtypes
0.2.0
(c) << 4)
typedef v4f32 Packet4f;
typedef v4i32 Packet4i;
typedef v4u32 Packet4ui;
Copyright 2017 The ml_dtypes Authors.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2022 The ml_dtypes Authors
Copyright 2022 The ml_dtypes Authors.
Copyright 2022 The TensorFlow Authors. All Rights Reserved.
Copyright 2022 The TensorFlow Authors. All Rights Reserved.
Copyright 2023 The ml_dtypes Authors
Copyright 2023 The ml_dtypes Authors.
Copyright (C) 2006-2008, 2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2008, 2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2006-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2007-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2007-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2007-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2007-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2007 Julien Pommier
Copyright (C) 2007 Julien Pommier
Copyright (C) 2007 Michael Olbrich <michael.olbrich@gmx.net>
Copyright (C) 2007 Michael Olbrich <michael.olbrich@gmx.net>
Copyright (C) 2008-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2008-2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2008-2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2008-2017 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2017 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2008 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2009-2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2009-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2009 Kenneth Riddile <kfriddile@yahoo.com>
Copyright (C) 2009 Kenneth Riddile <kfriddile@yahoo.com>
Copyright (C) 2009 Ricard Marxer <email@ricardmarxer.com>
Copyright (C) 2009 Ricard Marxer <email@ricardmarxer.com>
Copyright (C) 2010-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010-2013 Hauke Heibel <hauke.heibel@gmail.com>
Copyright (C) 2010-2013 Hauke Heibel <hauke.heibel@gmail.com>
Copyright (C) 2010-2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010-2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010-2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2010-2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2010 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2010 Hauke Heibel <hauke.heibel@gmail.com>
Copyright (C) 2010 Hauke Heibel <hauke.heibel@gmail.com>
Copyright (C) 2010 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2010 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2010 Thomas Capricelli <orzel@freehackers.org>
Copyright (C) 2010 Thomas Capricelli <orzel@freehackers.org>
Copyright (C) 2011-2012 Jitse Niesen <jitse@maths.leeds.ac.uk>
Copyright (C) 2011-2012 Jitse Niesen <jitse@maths.leeds.ac.uk>
Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2011-2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2011-2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2011 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (C) 2011 Benoit Jacob <jacob.benoit.1@gmail.com>
Copyright (c) 2011, Intel Corporation. All rights reserved.
Copyright (c) 2011, Intel Corporation. All rights reserved.
Copyright (c) 2011, Intel Corporation. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of Intel Corporation nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2011 Jitse Niesen <jitse@maths.leeds.ac.uk>
Copyright (C) 2011 Jitse Niesen <jitse@maths.leeds.ac.uk>
Copyright (C) 2012 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2012 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2013 Pavel Holoborodko <pavel@holoborodko.com>
Copyright (C) 2013 Pavel Holoborodko <pavel@holoborodko.com>
Copyright (C) 2014-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2014-2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2014 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2014 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2014 Benoit Steiner (benoit.steiner.goog@gmail.com)
Copyright (C) 2014 Benoit Steiner (benoit.steiner.goog@gmail.com)
Copyright (C) 2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2014 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2014 Pedro Gonnet (pedro.gonnet@gmail.com)
Copyright (C) 2014 Pedro Gonnet (pedro.gonnet@gmail.com)
Copyright (C) 2014 yoco <peter.xiau@gmail.com>
Copyright (C) 2014 yoco <peter.xiau@gmail.com>
Copyright (C) 2015 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2015 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of Intel Corporation nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2016 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2016 Benoit Steiner <benoit.steiner.goog@gmail.com>
Copyright (C) 2016 Benoit Steiner (benoit.steiner.goog@gmail.com)
Copyright (C) 2016 Benoit Steiner (benoit.steiner.goog@gmail.com)
Copyright (C) 2016 Eugene Brevdo <ebrevdo@gmail.com>
Copyright (C) 2016 Eugene Brevdo <ebrevdo@gmail.com>
Copyright (C) 2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2016 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2016 Gael Guennebaud <gael.guennebaud@inria.fr>
//
Copyright (C) 2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2016 Konstantinos Margaritis <markos@freevec.org>
Copyright (C) 2016 Pedro Gonnet (pedro.gonnet@gmail.com)
Copyright (C) 2016 Pedro Gonnet (pedro.gonnet@gmail.com)
Copyright (C) 2016 Rasmus Munk Larsen (rmlarsen@google.com)
Copyright (C) 2016 Rasmus Munk Larsen (rmlarsen@google.com)
Copyright (C) 2017 Codeplay Software Limited
Copyright (C) 2017 Codeplay Software Limited
Copyright (C) 2017 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2017 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2018 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2018 Rasmus Munk Larsen <rmlarsen@google.com>
Copyright (C) 2018 Rasmus Munk Larsen <rmlarsen@google.com>
Copyright (C) 2018 Wave Computing, Inc.
Copyright (C) 2018 Wave Computing, Inc.
// Written by:
Copyright (C) 2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2019 Gael Guennebaud <gael.guennebaud@inria.fr>
Copyright (C) 2019 Rasmus Munk Larsen <rmlarsen@google.com>
Copyright (C) 2019 Rasmus Munk Larsen <rmlarsen@google.com>
Copyright (C) 2020 Antonio Sanchez <cantonios@google.com>
Copyright (C) 2020 Antonio Sanchez <cantonios@google.com>
Copyright (C) 2020, Arm Limited and Contributors
Copyright (C) 2020, Arm Limited and Contributors
Copyright (C) 2020 Everton Constantino (everton.constantino@ibm.com)
Copyright (C) 2020 Everton Constantino (everton.constantino@ibm.com)
Copyright (C) 2021 C. Antonio Sanchez <cantonios@google.com>
Copyright (C) 2021 C. Antonio Sanchez <cantonios@google.com>
Copyright (C) 2021 Chip Kerchner (chip.kerchner@ibm.com)
Copyright (C) 2021 Chip Kerchner (chip.kerchner@ibm.com)
Copyright (c) 2021, NVIDIA CORPORATION. All rights reserved.
Copyright (c) 2021, NVIDIA CORPORATION. All rights reserved.
Copyright (C) 2021 The Eigen Team
Copyright (C) 2021 The Eigen Team
Copyright (C) 2022 Intel Corporation
Copyright (C) 2022 Intel Corporation
Copyright (C) 2022, The Eigen authors.
Copyright (C) 2022, The Eigen authors.
Copyright (c) Fabian Giesen, 2016
Copyright (c) Fabian Giesen, 2016.
Copyright (c) Fabian Giesen, 2016.
Copyright (c) Fabian Giesen, 2016
// All rights reserved.
// Redistribution and use in source and binary forms, with or without
// modification, are permitted.
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
copyright doctrines of fair use, fair dealing, or other
equivalents.
2.7. Conditions
copyright doctrines of fair use, fair dealing, or other
equivalents.
2.7. Conditions
(c) under Patent Claims infringed by Covered Software in the absence of
(c) under Patent Claims infringed by Covered Software in the absence of
N/A
mpmath
1.3.0
Copyright 2013 Timo Hartmann (thartmann15 at gmail.com)
r"""
This interface implements Levin's (nonlinear) sequence transformation for
convergence acceleration and summation of divergent series. It performs
better than the Shanks/Wynn-epsilon algorithm for logarithmic convergent
or alternating divergent series.
Let *A* be the series we want to sum:
Copyright 2013 Timo Hartmann (thartmann15 at gmail.com)
r"""
This interface implements the convergence acceleration of alternating series
as described in H. Cohen, F.R. Villegas, D. Zagier - "Convergence Acceleration
of Alternating Series". This series transformation works only well if the
individual terms of the series have an alternating sign. It belongs to the
class of linear series transformations (in contrast to the Shanks/Wynn-epsilon
or Levin transform). This series transformation is also able to sum some types
of divergent series. See the paper under which conditions this resummation is
mathematical sound.
Let *A* be the series we want to sum:
Copyright 2013 Timo Hartmann (thartmann15 at gmail.com)
#
# todo:
Copyright (c) 2005-2021 Fredrik Johansson and mpmath contributors
All rights reserved.
msgpack
1.1.0
(c) for c in arr)
Copyright (C) 2008-2010 FURUHASHI Sadayuki
Copyright (C) 2008-2011 INADA Naoki <songofacandy@gmail.com>
Copyright (C) 2008-2011 INADA Naoki <songofacandy@gmail.com>
Copyright (C) 2009 Naoki INADA
(c) ((unsigned char)c)
#define __Pyx_long_cast(x) ((long)x)
#define __Pyx_fits_Py_ssize_t(v, type, is_signed) (\
(sizeof(type) < sizeof(Py_ssize_t)) ||\
(sizeof(type) > sizeof(Py_ssize_t) &&\
likely(v < (type)PY_SSIZE_T_MAX ||\
v == (type)PY_SSIZE_T_MAX) &&\
(!is_signed || likely(v > (type)PY_SSIZE_T_MIN ||\
v == (type)PY_SSIZE_T_MIN))) ||\
(sizeof(type) == sizeof(Py_ssize_t) &&\
(is_signed || likely(v < (type)PY_SSIZE_T_MAX ||\
v == (type)PY_SSIZE_T_MAX))) )
static CYTHON_INLINE int __Pyx_is_valid_index(Py_ssize_t i, Py_ssize_t limit) {
return (size_t) i < (size_t) limit;
}
#if defined (__cplusplus) && __cplusplus >= 201103L
#include <cstdlib>
#define __Pyx_sst_abs(value) std::abs(value)
#elif SIZEOF_INT >= SIZEOF_SIZE_T
#define __Pyx_sst_abs(value) abs(value)
#elif SIZEOF_LONG >= SIZEOF_SIZE_T
#define __Pyx_sst_abs(value) labs(value)
#elif defined (_MSC_VER)
#define __Pyx_sst_abs(value) ((Py_ssize_t)_abs64(value))
#elif defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
#define __Pyx_sst_abs(value) llabs(value)
#elif defined (__GNUC__)
#define __Pyx_sst_abs(value) __builtin_llabs(value)
#else
#define __Pyx_sst_abs(value) ((value<0) ? -value : value)
#endif
static CYTHON_INLINE Py_ssize_t __Pyx_ssize_strlen(const char *s);
static CYTHON_INLINE const char* __Pyx_PyObject_AsString(PyObject*);
static CYTHON_INLINE const char* __Pyx_PyObject_AsStringAndSize(PyObject*, Py_ssize_t* length);
static CYTHON_INLINE PyObject* __Pyx_PyByteArray_FromString(const char*);
#define __Pyx_PyByteArray_FromStringAndSize(s, l) PyByteArray_FromStringAndSize((const char*)s, l)
#define __Pyx_PyBytes_FromString PyBytes_FromString
#define __Pyx_PyBytes_FromStringAndSize PyBytes_FromStringAndSize
static CYTHON_INLINE PyObject* __Pyx_PyUnicode_FromString(const char*);
#if PY_MAJOR_VERSION < 3
#define __Pyx_PyStr_FromString __Pyx_PyBytes_FromString
#define __Pyx_PyStr_FromStringAndSize __Pyx_PyBytes_FromStringAndSize
#else
#define __Pyx_PyStr_FromString __Pyx_PyUnicode_FromString
#define __Pyx_PyStr_FromStringAndSize __Pyx_PyUnicode_FromStringAndSize
#endif
#define __Pyx_PyBytes_AsWritableString(s) ((char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsWritableSString(s) ((signed char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsWritableUString(s) ((unsigned char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsString(s) ((const char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsSString(s) ((const signed char*) PyBytes_AS_STRING(s))
#define __Pyx_PyBytes_AsUString(s) ((const unsigned char*) PyBytes_AS_STRING(s))
#define __Pyx_PyObject_AsWritableString(s) ((char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsWritableSString(s) ((signed char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsWritableUString(s) ((unsigned char*)(__pyx_uintptr_t) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsSString(s) ((const signed char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_AsUString(s) ((const unsigned char*) __Pyx_PyObject_AsString(s))
#define __Pyx_PyObject_FromCString(s) __Pyx_PyObject_FromString((const char*)s)
#define __Pyx_PyBytes_FromCString(s) __Pyx_PyBytes_FromString((const char*)s)
#define __Pyx_PyByteArray_FromCString(s) __Pyx_PyByteArray_FromString((const char*)s)
#define __Pyx_PyStr_FromCString(s) __Pyx_PyStr_FromString((const char*)s)
#define __Pyx_PyUnicode_FromCString(s) __Pyx_PyUnicode_FromString((const char*)s)
#define __Pyx_PyUnicode_FromOrdinal(o) PyUnicode_FromOrdinal((int)o)
#define __Pyx_PyUnicode_AsUnicode PyUnicode_AsUnicode
#define __Pyx_NewRef(obj) (Py_INCREF(obj), obj)
#define __Pyx_Owned_Py_None(b) __Pyx_NewRef(Py_None)
static CYTHON_INLINE PyObject * __Pyx_PyBool_FromLong(long b);
static CYTHON_INLINE int __Pyx_PyObject_IsTrue(PyObject*);
static CYTHON_INLINE int __Pyx_PyObject_IsTrueAndDecref(PyObject*);
static CYTHON_INLINE PyObject* __Pyx_PyNumber_IntOrLong(PyObject* x);
#define __Pyx_PySequence_Tuple(obj)\
(likely(PyTuple_CheckExact(obj)) ? __Pyx_NewRef(obj) : PySequence_Tuple(obj))
static CYTHON_INLINE Py_ssize_t __Pyx_PyIndex_AsSsize_t(PyObject*);
static CYTHON_INLINE PyObject * __Pyx_PyInt_FromSize_t(size_t);
static CYTHON_INLINE Py_hash_t __Pyx_PyIndex_AsHash_t(PyObject*);
#if CYTHON_ASSUME_SAFE_MACROS
#define __pyx_PyFloat_AsDouble(x) (PyFloat_CheckExact(x) ? PyFloat_AS_DOUBLE(x) : PyFloat_AsDouble(x))
#else
#define __pyx_PyFloat_AsDouble(x) PyFloat_AsDouble(x)
#endif
#define __pyx_PyFloat_AsFloat(x) ((float) __pyx_PyFloat_AsDouble(x))
#if PY_MAJOR_VERSION >= 3
#define __Pyx_PyNumber_Int(x) (PyLong_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Long(x))
#else
#define __Pyx_PyNumber_Int(x) (PyInt_CheckExact(x) ? __Pyx_NewRef(x) : PyNumber_Int(x))
#endif
#if CYTHON_USE_PYLONG_INTERNALS
#if PY_VERSION_HEX >= 0x030C00A7
#ifndef _PyLong_SIGN_MASK
#define _PyLong_SIGN_MASK 3
#endif
#ifndef _PyLong_NON_SIZE_BITS
#define _PyLong_NON_SIZE_BITS 3
#endif
#define __Pyx_PyLong_Sign(x) (((PyLongObject*)x)->long_value.lv_tag & _PyLong_SIGN_MASK)
#define __Pyx_PyLong_IsNeg(x) ((__Pyx_PyLong_Sign(x) & 2) != 0)
#define __Pyx_PyLong_IsNonNeg(x) (!__Pyx_PyLong_IsNeg(x))
#define __Pyx_PyLong_IsZero(x) (__Pyx_PyLong_Sign(x) & 1)
#define __Pyx_PyLong_IsPos(x) (__Pyx_PyLong_Sign(x) == 0)
#define __Pyx_PyLong_CompactValueUnsigned(x) (__Pyx_PyLong_Digits(x)[0])
#define __Pyx_PyLong_DigitCount(x) ((Py_ssize_t) (((PyLongObject*)x)->long_value.lv_tag >> _PyLong_NON_SIZE_BITS))
#define __Pyx_PyLong_SignedDigitCount(x)\
((1 - (Py_ssize_t) __Pyx_PyLong_Sign(x)) * __Pyx_PyLong_DigitCount(x))
#if defined(PyUnstable_Long_IsCompact) && defined(PyUnstable_Long_CompactValue)
#define __Pyx_PyLong_IsCompact(x) PyUnstable_Long_IsCompact((PyLongObject*) x)
#define __Pyx_PyLong_CompactValue(x) PyUnstable_Long_CompactValue((PyLongObject*) x)
#else
#define __Pyx_PyLong_IsCompact(x) (((PyLongObject*)x)->long_value.lv_tag < (2 << _PyLong_NON_SIZE_BITS))
#define __Pyx_PyLong_CompactValue(x) ((1 - (Py_ssize_t) __Pyx_PyLong_Sign(x)) * (Py_ssize_t) __Pyx_PyLong_Digits(x)[0])
#endif
typedef Py_ssize_t __Pyx_compact_pylong;
typedef size_t __Pyx_compact_upylong;
#else
#define __Pyx_PyLong_IsNeg(x) (Py_SIZE(x) < 0)
#define __Pyx_PyLong_IsNonNeg(x) (Py_SIZE(x) >= 0)
#define __Pyx_PyLong_IsZero(x) (Py_SIZE(x) == 0)
#define __Pyx_PyLong_IsPos(x) (Py_SIZE(x) > 0)
#define __Pyx_PyLong_CompactValueUnsigned(x) ((Py_SIZE(x) == 0) ? 0 : __Pyx_PyLong_Digits(x)[0])
#define __Pyx_PyLong_DigitCount(x) __Pyx_sst_abs(Py_SIZE(x))
#define __Pyx_PyLong_SignedDigitCount(x) Py_SIZE(x)
#define __Pyx_PyLong_IsCompact(x) (Py_SIZE(x) == 0 || Py_SIZE(x) == 1 || Py_SIZE(x) == -1)
#define __Pyx_PyLong_CompactValue(x)\
((Py_SIZE(x) == 0) ? (sdigit) 0 : ((Py_SIZE(x) < 0) ? -(sdigit)__Pyx_PyLong_Digits(x)[0] : (sdigit)__Pyx_PyLong_Digits(x)[0]))
typedef sdigit __Pyx_compact_pylong;
typedef digit __Pyx_compact_upylong;
#endif
#if PY_VERSION_HEX >= 0x030C00A5
#define __Pyx_PyLong_Digits(x) (((PyLongObject*)x)->long_value.ob_digit)
#else
#define __Pyx_PyLong_Digits(x) (((PyLongObject*)x)->ob_digit)
#endif
#endif
#if PY_MAJOR_VERSION < 3 && __PYX_DEFAULT_STRING_ENCODING_IS_ASCII
#include <string.h>
static int __Pyx_sys_getdefaultencoding_not_ascii;
static int __Pyx_init_sys_getdefaultencoding_params(void) {
PyObject* sys;
PyObject* default_encoding = NULL;
PyObject* ascii_chars_u = NULL;
PyObject* ascii_chars_b = NULL;
const char* default_encoding_c;
sys = PyImport_ImportModule("sys");
if (!sys) goto bad;
default_encoding = PyObject_CallMethod(sys, (char*) "getdefaultencoding", NULL);
Py_DECREF(sys);
if (!default_encoding) goto bad;
default_encoding_c = PyBytes_AsString(default_encoding);
if (!default_encoding_c) goto bad;
if (strcmp(default_encoding_c, "ascii") == 0) {
__Pyx_sys_getdefaultencoding_not_ascii = 0;
} else {
char ascii_chars[128];
int c;
for (c = 0; c < 128; c++) {
ascii_chars[c] = (char) c;
NetworkX
3.4.2
Copyright 2011 Alex Levenson <alex@isnotinvain.com>
Copyright 2011 Diederik van Liere <diederik.vanliere@rotman.utoronto.ca>
"""Functions for analyzing triads of a graph."""
from collections import defaultdict
from itertools import combinations, permutations
Copyright 2011 Diederik van Liere <diederik.vanliere@rotman.utoronto.ca>
"""Functions that generate the triad graphs, that is, the possible
digraphs on three nodes.
Copyright 2011 Reya Group <http://www.reyagroup.com>
Copyright (C) 2004-2024 NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Copyright (C) 2004-2024, NetworkX Developers
Aric Hagberg <hagberg@lanl.gov>
Dan Schult <dschult@colgate.edu>
Pieter Swart <swart@lanl.gov>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NetworkX Developers nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2015
Redistribution and use in source and binary forms, with or without
modification, are permitted (subject to the limitations in the
disclaimer below) provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Thomson Licensing, or Technicolor, nor the names
of its contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
numba
0.61.2
© 2020 GitHub, Inc.
(c) > 255:
has_high_char = True
break
if has_high_char:
(c) > 255:
has_high_char = True
break
if has_high_char:
(c) > 255:
has_high_char = True
break
if has_high_char:
(c) > 255:
has_high_char = True
break
if has_high_char:
(c)
# assign for cast d to return, del (d), return
expect = [*((ir.Assign,) * 3), ir.Del, ir.Del, ir.Assign, ir.Del,
ir.Assign, ir.Del, ir.Return]
check(del_after_use_ir, expect)
del_at_block_end_ir = get_ir(True)
# should be 4 assigns (a, b, c, d), assign for cast d to return,
# 4 dels (a, b, c, d) then the return.
expect = [*((ir.Assign,) * 4), ir.Assign, *((ir.Del,) * 4), ir.Return]
check(del_at_block_end_ir, expect)
(c)
# assign for cast d to return, del (d), return
expect = [*((ir.Assign,) * 3), ir.Del, ir.Del, ir.Assign, ir.Del,
ir.Assign, ir.Del, ir.Return]
check(del_after_use_ir, expect)
del_at_block_end_ir = get_ir(True)
# should be 4 assigns (a, b, c, d), assign for cast d to return,
# 4 dels (a, b, c, d) then the return.
expect = [*((ir.Assign,) * 4), ir.Assign, *((ir.Del,) * 4), ir.Return]
check(del_at_block_end_ir, expect)
(c)
body
# now compile and return it along with its body in __doc__ and patterns
ldict = {}
exec(body, globals(), ldict)
ldict[name].__doc__ = body
return ldict[name], contains, avoids
(c)
body
# now compile and return it along with its body in __doc__ and patterns
ldict = {}
exec(body, globals(), ldict)
ldict[name].__doc__ = body
return ldict[name], contains, avoids
(C)
def cuconst(A):
C = cuda.const.array_like(CONST1D)
i = cuda.grid(1)
# +1 or it'll be loaded & stored as a u32
A[i] = C[i] + 1.0
(C)
def cuconstRec(A, B):
C = cuda.const.array_like(CONST_RECORD)
i = cuda.grid(1)
A[i] = C[i]['x']
B[i] = C[i]['y']
(c)
def simple_clz(ary, c):
(c)
def simple_ffs(ary, c):
(c)
def simple_fma(ary, a, b, c):
ary[0] = cuda.fma(a, b, c)
(c)
def simple_round(ary, c):
(c)
def simple_round_to(ary, c, ndigits):
ary[0] = round(c, ndigits)
(c)
else:
return c
return impl
(c)
else:
return c
return impl
(c)
f = len(d)
return e == f
self._compile_and_test(test_11, (),
equivs=[self.with_equiv('e', 'f')])
def test_12():
(c)
f = len(d)
return e == f
self._compile_and_test(test_11, (),
equivs=[self.with_equiv('e', 'f')])
def test_12():
(c)
for c in unichar.encode(
text = 'fo' + enc
expect = '_Z{}{}if'.format(len(text), text)
self.assertEqual(name, expect)
# ensure result chars are in the right charset
self.assertRegex(name, r'^_Z[a-zA-Z0-9_\$]+$')
(c)
for c in unichar.encode(
text = 'fo' + enc
expect = '_Z{}{}if'.format(len(text), text)
self.assertEqual(name, expect)
# ensure result chars are in the right charset
self.assertRegex(name, r'^_Z[a-zA-Z0-9_\$]+$')
(c)
if tid < size:
c[tid] = a[tid] + b[tid]
# ex_vecadd.kernel.end
# Seed RNG for test repeatability
np.random.seed(1)
(c)
if tid < size:
c[tid] = a[tid] + b[tid]
# ex_vecadd.kernel.end
# Seed RNG for test repeatability
np.random.seed(1)
(c)
@njit
def inner(x, y):
(c)
@njit
def inner(x, y):
Copyright 1993-2020 NVIDIA Corporation. All rights reserved.
Copyright 1993-2020 NVIDIA Corporation. All rights reserved.
Copyright 1993-2021 NVIDIA Corporation. All rights reserved.
Copyright 1993-2021 NVIDIA Corporation. All rights reserved.
Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,
The Netherlands. All rights reserved.
Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,
The Netherlands. All rights reserved.
Copyright (c) 1995-2001 Corporation for National Research Initiatives; All Rights
Copyright (c) 1999 by Fredrik Lundh
Copyright (c) 1999 by Secret Labs AB
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
Copyright (C) 2004-2019, NetworkX Developers
Copyright (c) 2005-2010 ActiveState Software Inc.
Copyright (c) 2005-2010 ActiveState Software Inc.
Copyright (c) 2005-2021, NumPy Developers.
Copyright (c) 2005 Don Owens
Copyright (c) 2009
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of California, Berkeley nor the
names of its contributors may be used to endorse or promote
Copyright (c) 2009
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the University of California, Berkeley nor the
names of its contributors may be used to endorse or promote
Copyright (c) 2009 PiCloud, Inc.
Copyright (c) 2010 ActiveState Software Inc.
Copyright (c) 2012, Anaconda, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Copyright (c) 2012, Anaconda, Inc.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Copyright (c) 2012-now, CloudPickle developers and contributors.
Copyright (c) 2012-now, CloudPickle developers and contributors.
Copyright (c) 2012, Regents of the University of California.
Copyright (c) 2012, Regents of the University of California.
Copyright (c) 2012, Regents of the University of California.
Copyright (c) 2013 Eddy Petri
"""Utilities for determining application-specific dirs.
Copyright (c) 2013 Eddy Petri
"""Utilities for determining application-specific dirs.
Copyright (c) 2013 Marek Majkowski <marek@popcount.org>
Copyright (c) 2015, Cloudpickle contributors.
Copyright (c) 2015 Mountainstorm
Copyright (c) 2017 Intel Corporation
Copyright (c) 2017 Intel Corporation
Copyright (c) 2017 Intel Corporation
Copyright (c) Corporation for National Research Initiatives.
Copyright Contributors to the pythoncapi_compat project.
Copyright of cfuhash:
----------------------------------
Creation date: 2005-06-24 21:22:40
Authors: Don
Change log:
(c)
q2 = cfunc1(c)
self.assertPreciseEqual(p1, p2)
self.assertPreciseEqual(p1.coef, p2.coef)
self.assertPreciseEqual(p1.domain, p2.domain)
self.assertPreciseEqual(p1.window, p2.window)
self.assertPreciseEqual(q1.coef, q2.coef)
self.assertPreciseEqual(q1.domain, q2.domain)
self.assertPreciseEqual(q1.window, q2.window)
def test_Polynomial_exeption(self):
(c)
q2 = cfunc1(c)
self.assertPreciseEqual(p1, p2)
self.assertPreciseEqual(p1.coef, p2.coef)
self.assertPreciseEqual(p1.domain, p2.domain)
self.assertPreciseEqual(p1.window, p2.window)
self.assertPreciseEqual(q1.coef, q2.coef)
self.assertPreciseEqual(q1.domain, q2.domain)
self.assertPreciseEqual(q1.window, q2.window)
def test_Polynomial_exeption(self):
(c)
return list(s)
def bool_usecase(arg):
(c)
return list(s)
def bool_usecase(arg):
(c)
return p
cfunc1 = njit(pyfunc1)
list1 = (np.array([0, 1]), np.array([0., 1.]))
list2 = (np.array([0, 1]), np.array([0., 1.]))
list3 = (np.array([0, 1]), np.array([0., 1.]))
for c in list1:
(c)
return p
cfunc1 = njit(pyfunc1)
list1 = (np.array([0, 1]), np.array([0., 1.]))
list2 = (np.array([0, 1]), np.array([0., 1.]))
list3 = (np.array([0, 1]), np.array([0., 1.]))
for c in list1:
(c)
# Sanity check
self.assertEqual(sum(ms.pending[ms.n - 1]), len(keys))
# Now merge the runs
ms = f(ms, keys, keys)
# Remaining run is the whole list
self.assertEqual(ms.n, 1)
self.assertEqual(ms.pending[0], MergeRun(0, len(keys)))
# The list is now sorted
self.assertSorted(orig_keys, keys)
def test_run_timsort(self):
(c)
# Sanity check
self.assertEqual(sum(ms.pending[ms.n - 1]), len(keys))
# Now merge the runs
ms = f(ms, keys, keys)
# Remaining run is the whole list
self.assertEqual(ms.n, 1)
self.assertEqual(ms.pending[0], MergeRun(0, len(keys)))
# The list is now sorted
self.assertSorted(orig_keys, keys)
def test_run_timsort(self):
(c)
tmp = np.empty((n
tmp[0] = c[0] * 0
tmp[1] = c[0]
for j in range(1, n):
(c)
tmp = np.empty((n
tmp[0] = c[0] * 0
tmp[1] = c[0]
for j in range(1, n):
(c)
with self.assertRaises(AttributeError):
c.x
def test_delattr_attribute_error(self):
(c)
with self.assertRaises(AttributeError):
c.x
def test_delattr_attribute_error(self):
N/A
NumPy
1.26.4
© 2018, Meson Team
(C)
(c)
1.0
>>> # Formatting supersedes all class/package-level defaults
>>> print(f"{p:unicode}")
1.0 + 2.0·x + 3.0·x²
"""
if style not in ('unicode', 'ascii'):
(c)
1.0
>>> # Formatting supersedes all class/package-level defaults
>>> print(f"{p:unicode}")
1.0 + 2.0·x + 3.0·x²
"""
if style not in ('unicode', 'ascii'):
(c)
1.0
>>> np.polynomial.set_default_printstyle('ascii')
>>> print(p)
1.0 + 2.0 x + 3.0 x**2
(c)
1.0
>>> np.polynomial.set_default_printstyle('ascii')
>>> print(p)
1.0 + 2.0 x + 3.0 x**2
(c) > 1:
tmp = c[1:]/2
prd[2:] = tmp
prd[0:-2] += tmp
return prd
(c) > 1:
tmp = c[1:]/2
prd[2:] = tmp
prd[0:-2] += tmp
return prd
(c) < 2:
raise ValueError('Series must have maximum degree of at least 1.')
if len(c) == 2:
(c) < 2:
raise ValueError('Series must have maximum degree of at least 1.')
if len(c) == 2:
(c) < 2:
return np.array([], dtype=c.dtype)
if len(c) == 2:
(c) < 2:
return np.array([], dtype=c.dtype)
if len(c) == 2:
(c)**2).sum(-1).sum(-1)
* (abs(cinv)**2).sum(-1).sum(-1)),
single_decimal=5, double_decimal=11)
(c)**2).sum(-1).sum(-1)
* (abs(cinv)**2).sum(-1).sum(-1)),
single_decimal=5, double_decimal=11)
(c)
# 3d
f(d)
# 1d size
f(b, size=10)
# 2d - size - broadcast
f(e, size=(10, 2))
# 3d - size
f(g, size=(10, 10, 10))
(c)
# 3d
f(d)
# 1d size
f(b, size=10)
# 2d - size - broadcast
f(e, size=(10, 2))
# 3d - size
f(g, size=(10, 10, 10))
(c) and I have not modified
(c)
array(
(c)
array(
(c)
array(
[1, 4],
[2, 5]])
Vector inner products:
(c)
array(
[1, 4],
[2, 5]])
Vector inner products:
(c)
array(
[2., 3.]])
>>> d = StringIO("M 21 72\nF 35 58")
>>> np.loadtxt(d, dtype={'names': ('gender', 'age', 'weight'),
... 'formats': ('S1', 'i4', 'f4')})
array([(b'M', 21, 72.), (b'F', 35, 58.)],
dtype=[('gender', 'S1'), ('age', '<i4'), ('weight', '<f4')])
(c)
array(
[2., 3.]])
>>> d = StringIO("M 21 72\nF 35 58")
>>> np.loadtxt(d, dtype={'names': ('gender', 'age', 'weight'),
... 'formats': ('S1', 'i4', 'f4')})
array([(b'M', 21, 72.), (b'F', 35, 58.)],
dtype=[('gender', 'S1'), ('age', '<i4'), ('weight', '<f4')])
(c)
array(
>>> C.chebder(c,3)
array([96.])
>>> C.chebder(c,scl=-1)
array([-14., -12., -24.])
>>> C.chebder(c,2,-1)
array([12., 96.])
(c)
array(
>>> C.chebder(c,3)
array([96.])
>>> C.chebder(c,scl=-1)
array([-14., -12., -24.])
>>> C.chebder(c,2,-1)
array([12., 96.])
(c)
array(
>>> C.chebint(c,3)
array([ 0.03125 , -0.1875 , 0.04166667, -0.05208333, 0.01041667, # may vary
0.00625 ])
>>> C.chebint(c, k=3)
array([ 3.5, -0.5, 0.5, 0.5])
>>> C.chebint(c,lbnd=-2)
array([ 8.5, -0.5, 0.5, 0.5])
>>> C.chebint(c,scl=-2)
array([-1., 1., -1., -1.])
(c)
array(
>>> C.chebint(c,3)
array([ 0.03125 , -0.1875 , 0.04166667, -0.05208333, 0.01041667, # may vary
0.00625 ])
>>> C.chebint(c, k=3)
array([ 3.5, -0.5, 0.5, 0.5])
>>> C.chebint(c,lbnd=-2)
array([ 8.5, -0.5, 0.5, 0.5])
>>> C.chebint(c,scl=-2)
array([-1., 1., -1., -1.])
(c)
array(
dtype='|S4')
(c)
array(
dtype='|S4')
(c)
array(
dtype='|S5')
(c)
array(
dtype='|S5')
(c)
array(
>>> L.legder(c, 3)
array([60.])
>>> L.legder(c, scl=-1)
array([ -6., -9., -20.])
>>> L.legder(c, 2,-1)
array([ 9., 60.])
(c)
array(
>>> L.legder(c, 3)
array([60.])
>>> L.legder(c, scl=-1)
array([ -6., -9., -20.])
>>> L.legder(c, 2,-1)
array([ 9., 60.])
(c)
array(
>>> L.legint(c, 3)
array([ 1.66666667e-02, -1.78571429e-02, 4.76190476e-02, # may vary
-1.73472348e-18, 1.90476190e-02, 9.52380952e-03])
>>> L.legint(c, k=3)
array([ 3.33333333, 0.4 , 0.66666667, 0.6 ]) # may vary
>>> L.legint(c, lbnd=-2)
array([ 7.33333333, 0.4 , 0.66666667, 0.6 ]) # may vary
>>> L.legint(c, scl=2)
array([ 0.66666667, 0.8 , 1.33333333, 1.2 ]) # may vary
(c)
array(
>>> L.legint(c, 3)
array([ 1.66666667e-02, -1.78571429e-02, 4.76190476e-02, # may vary
-1.73472348e-18, 1.90476190e-02, 9.52380952e-03])
>>> L.legint(c, k=3)
array([ 3.33333333, 0.4 , 0.66666667, 0.6 ]) # may vary
>>> L.legint(c, lbnd=-2)
array([ 7.33333333, 0.4 , 0.66666667, 0.6 ]) # may vary
>>> L.legint(c, scl=2)
array([ 0.66666667, 0.8 , 1.33333333, 1.2 ]) # may vary
(c)
array(
>>> np.char.strip(c, 'a') # 'a' unstripped from c[1] because whitespace leads
array(['AaAaA', ' aA ', 'bBABb'], dtype='<U7')
>>> np.char.strip(c, 'A') # 'A' unstripped from c[1] because (unprinted) ws trails
array(['aAaAa', ' aA ', 'abBABba'], dtype='<U7')
(c)
array(
>>> np.char.strip(c, 'a') # 'a' unstripped from c[1] because whitespace leads
array(['AaAaA', ' aA ', 'bBABb'], dtype='<U7')
>>> np.char.strip(c, 'A') # 'A' unstripped from c[1] because (unprinted) ws trails
array(['aAaAa', ' aA ', 'abBABba'], dtype='<U7')
(c)
assert_almost_equal(
linalg.cond(a, 1),
abs(c).sum(-2).max(-1) * abs(cinv).sum(-2).max(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, -1),
abs(c).sum(-2).min(-1) * abs(cinv).sum(-2).min(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, np.inf),
abs(c).sum(-1).max(-1) * abs(cinv).sum(-1).max(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, -np.inf),
abs(c).sum(-1).min(-1) * abs(cinv).sum(-1).min(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, 'fro'),
(c)
assert_almost_equal(
linalg.cond(a, 1),
abs(c).sum(-2).max(-1) * abs(cinv).sum(-2).max(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, -1),
abs(c).sum(-2).min(-1) * abs(cinv).sum(-2).min(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, np.inf),
abs(c).sum(-1).max(-1) * abs(cinv).sum(-1).max(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, -np.inf),
abs(c).sum(-1).min(-1) * abs(cinv).sum(-1).min(-1),
single_decimal=5, double_decimal=11)
assert_almost_equal(
linalg.cond(a, 'fro'),
(c)
assert_equal(a, l
assert_equal(b, l['file_b'])
(c)
assert_equal(a, l
assert_equal(b, l['file_b'])
(c)
assert_equal(cp, c, msg)
def test__complex__should_not_work(self):
(c)
assert_equal(cp, c, msg)
def test__complex__should_not_work(self):
(c)
assert_equal(p.trim().coef, c
assert_equal(p.trim(1e-10).coef, c[:2])
assert_equal(p.trim(1e-5).coef, c[:1])
(c)
assert_equal(p.trim().coef, c
assert_equal(p.trim(1e-10).coef, c[:2])
assert_equal(p.trim(1e-5).coef, c[:1])
(c)
assert_equal(sorted(dir(l.f)),
assert_equal(a, l.f.file_a)
assert_equal(b, l.f.file_b)
@pytest.mark.skipif(IS_WASM, reason="Cannot start thread")
def test_savez_filename_clashes(self):
(c)
assert_equal(sorted(dir(l.f)),
assert_equal(a, l.f.file_a)
assert_equal(b, l.f.file_b)
@pytest.mark.skipif(IS_WASM, reason="Cannot start thread")
def test_savez_filename_clashes(self):
(C)
assert_equal(type(c
# check that accessing nested structures keep record type, but
# not for subarrays, non-void structures, non-structured voids
test_dtype = [('a', 'f4,f4'), ('b', 'V8'), ('c', ('f4',2)),
('d', ('i8', 'i4,i4'))]
r = np.rec.array([((1,1), b'11111111', [1,1], 1),
((1,1), b'11111111', [1,1], 1)], dtype=test_dtype)
assert_equal(r.a.dtype.type, np.record)
assert_equal(r.b.dtype.type, np.void)
assert_equal(r.c.dtype.type, np.float32)
assert_equal(r.d.dtype.type, np.int64)
# check the same, but for views
r = np.rec.array(np.ones(4, dtype='i4,i4'))
assert_equal(r.view('f4,f4').dtype.type, np.record)
assert_equal(r.view(('i4',2)).dtype.type, np.int32)
assert_equal(r.view('V8').dtype.type, np.void)
assert_equal(r.view(('i8', 'i4,i4')).dtype.type, np.int64)
(C)
assert_equal(type(c
# check that accessing nested structures keep record type, but
# not for subarrays, non-void structures, non-structured voids
test_dtype = [('a', 'f4,f4'), ('b', 'V8'), ('c', ('f4',2)),
('d', ('i8', 'i4,i4'))]
r = np.rec.array([((1,1), b'11111111', [1,1], 1),
((1,1), b'11111111', [1,1], 1)], dtype=test_dtype)
assert_equal(r.a.dtype.type, np.record)
assert_equal(r.b.dtype.type, np.void)
assert_equal(r.c.dtype.type, np.float32)
assert_equal(r.d.dtype.type, np.int64)
# check the same, but for views
r = np.rec.array(np.ones(4, dtype='i4,i4'))
assert_equal(r.view('f4,f4').dtype.type, np.record)
assert_equal(r.view(('i4',2)).dtype.type, np.int32)
assert_equal(r.view('V8').dtype.type, np.void)
assert_equal(r.view(('i8', 'i4,i4')).dtype.type, np.int64)
(C)
assert_equal(type(np.polyval(
def test_polyvalfromroots(self):
(C)
assert_equal(type(np.polyval(
def test_polyvalfromroots(self):
(c)
assert_equal(x.shape, (0,))
x = np.loadtxt(c, dtype=np.int64)
assert_equal(x.shape, (0,))
assert_(x.dtype == np.int64)
def test_unused_converter(self):
(c)
assert_equal(x.shape, (0,))
x = np.loadtxt(c, dtype=np.int64)
assert_equal(x.shape, (0,))
assert_(x.dtype == np.int64)
def test_unused_converter(self):
(c)
c0 = c
c1 = c[-1]
for i in range(3, len(c) + 1):
(c)
c0 = c
c1 = c[-1]
for i in range(3, len(c) + 1):
(c)
c0 = c
c1 = c[-1]*xs
for i in range(3, len(c) + 1):
(c)
c0 = c
c1 = c[-1]*xs
for i in range(3, len(c) + 1):
(c) call-back (Python) functions :
cb_passed_call_time);
fprintf(stderr, "(d) f2py call-back interface, %6d calls : %8d msec\n",
cb_passed_counter, cb_passed_time);
fprintf(stderr,
"(e) wrapped (Fortran/C) functions (actual) : %8d msec\n\n",
passed_call_time - cb_passed_call_time - cb_passed_time);
fprintf(stderr,
"Use -DF2PY_REPORT_ATEXIT_DISABLE to disable this message.\n");
fprintf(stderr, "Exit status: %d\n", exit_flag);
fprintf(stderr, "Modules : %s\n", (char *)name);
(c) call-back (Python) functions :
cb_passed_call_time);
fprintf(stderr, "(d) f2py call-back interface, %6d calls : %8d msec\n",
cb_passed_counter, cb_passed_time);
fprintf(stderr,
"(e) wrapped (Fortran/C) functions (actual) : %8d msec\n\n",
passed_call_time - cb_passed_call_time - cb_passed_time);
fprintf(stderr,
"Use -DF2PY_REPORT_ATEXIT_DISABLE to disable this message.\n");
fprintf(stderr, "Exit status: %d\n", exit_flag);
fprintf(stderr, "Modules : %s\n", (char *)name);
(c)
character :: c
character, intent(in) :: o
c = transfer(o, c)
end function {fprefix}_return
subroutine {fprefix}_array_input(c, o)
character, intent(in) :: c(3)
integer*1 o(3)
!f2py intent(out) o
integer i
do i=1,3
o(i) = transfer(c(i), o(i))
end do
end subroutine {fprefix}_array_input
(c)
character :: c
character, intent(in) :: o
c = transfer(o, c)
end function {fprefix}_return
subroutine {fprefix}_array_input(c, o)
character, intent(in) :: c(3)
integer*1 o(3)
!f2py intent(out) o
integer i
do i=1,3
o(i) = transfer(c(i), o(i))
end do
end subroutine {fprefix}_array_input
(c)
character, dimension(3) :: c
character, intent(in) :: o(3)
do i=1,3
c(i) = o(i)
end do
end function {fprefix}_array_return
(c)
character, dimension(3) :: c
character, intent(in) :: o(3)
do i=1,3
c(i) = o(i)
end do
end function {fprefix}_array_return
(c)
character, intent(in) :: o
!f2py character o = "a"
character :: c
c = o
end function {fprefix}_optional
""")
(c)
character, intent(in) :: o
!f2py character o = "a"
character :: c
c = o
end function {fprefix}_optional
""")
(c)
check = None
if dim and 'dimension' not in vars[n]:
(c)
check = None
if dim and 'dimension' not in vars[n]:
(c)
c
if n == 1 and np.all(c[0] == 0):
(c)
c
if n == 1 and np.all(c[0] == 0):
(c)
class TestMatmulOperator(MatmulCommon):
import operator
matmul = operator.matmul
def test_array_priority_override(self):
(c)
c = np.add.accumulate(a, 0, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
indices = [0, 2, 1]
check = np.add.reduceat(d, indices, axis=1)
c = np.add.reduceat(a, indices, axis=1)
assert_equal(c, check)
assert_(c.info, {'inputs': [0]})
(c)
c = np.add.accumulate(a, 0, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
indices = [0, 2, 1]
check = np.add.reduceat(d, indices, axis=1)
c = np.add.reduceat(a, indices, axis=1)
assert_equal(c, check)
assert_(c.info, {'inputs': [0]})
(c)
c = np.add.reduce(a, 1, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
check = np.add.accumulate(d, axis=0)
c = np.add.accumulate(a, axis=0)
assert_equal(c, check)
assert_(c.info, {'inputs': [0]})
(c)
c = np.add.reduce(a, 1, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
check = np.add.accumulate(d, axis=0)
c = np.add.accumulate(a, axis=0)
assert_equal(c, check)
assert_(c.info, {'inputs': [0]})
(c)
c = np.add.reduceat(a, indices, 1, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
# and a few tests for at
d = np.array([[1, 2, 3], [1, 2, 3]])
check = d.copy()
a = d.copy().view(A)
np.add.at(check, ([0, 1], [0, 2]), 1.)
np.add.at(a, ([0, 1], [0, 2]), 1.)
assert_equal(a, check)
assert_(a.info, {'inputs': [0]})
b = np.array(1.).view(A)
a = d.copy().view(A)
np.add.at(a, ([0, 1], [0, 2]), b)
assert_equal(a, check)
assert_(a.info, {'inputs': [0, 2]})
def test_array_ufunc_direct_call(self):
(c)
c = np.add.reduceat(a, indices, 1, None, b)
assert_equal(c, check)
assert_(c is b)
assert_(c.info, {'inputs': [0], 'outputs': [0]})
# and a few tests for at
d = np.array([[1, 2, 3], [1, 2, 3]])
check = d.copy()
a = d.copy().view(A)
np.add.at(check, ([0, 1], [0, 2]), 1.)
np.add.at(a, ([0, 1], [0, 2]), 1.)
assert_equal(a, check)
assert_(a.info, {'inputs': [0]})
b = np.array(1.).view(A)
a = d.copy().view(A)
np.add.at(a, ([0, 1], [0, 2]), b)
assert_equal(a, check)
assert_(a.info, {'inputs': [0, 2]})
def test_array_ufunc_direct_call(self):
(c)?c:null,l(d)
function Ea(a,b,c,d,e){if(a instanceof E||8==a.b||c&&null===a.b){var f=b.all;if(!f)return e;a=Ga(a);if("*"!=a&&(f=b.getElementsByTagName(a),!f))return e;if(c){for(var g=[],h=0;b=f[h++];)A(b,c,d)&&g.push(b);f=g}for(h=0;b=f[h++];)"*"==a&&"!"==b.tagName||F(e,b);return e}Ha(a,b,c,d,e);return e}
function Fa(a,b,c,d,e){b.getElementsByName&&d&&"name"==c&&!v?(b=b.getElementsByName(d),r(b,function(b){a.a(b)&&F(e,b)})):b.getElementsByClassName&&d&&"class"==c?(b=b.getElementsByClassName(d),r(b,function(b){b.className==d&&a.a(b)&&F(e,b)})):a instanceof G?Ha(a,b,c,d,e):b.getElementsByTagName&&(b=b.getElementsByTagName(a.f()),r(b,function(a){A(a,c,d)&&F(e,a)}));return e}
function Ia(a,b,c,d,e){var f;if((a instanceof E||8==a.b||c&&null===a.b)&&(f=b.childNodes)){var g=Ga(a);if("*"!=g&&(f=ia(f,function(a){return a.tagName&&a.tagName.toLowerCase()==g}),!f))return e;c&&(f=ia(f,function(a){return A(a,c,d)}));r(f,function(a){"*"==g&&("!"==a.tagName||"*"==g&&1!=a.nodeType)||F(e,a)});return e}return Ja(a,b,c,d,e)}function Ja(a,b,c,d,e){for(b=b.firstChild;b;b=b.nextSibling)A(b,c,d)&&a.a(b)&&F(e,b);return e}
function Ha(a,b,c,d,e){for(b=b.firstChild;b;b=b.nextSibling)A(b,c,d)&&a.a(b)&&F(e,b),Ha(a,b,c,d,e)}function Ga(a){if(a instanceof G){if(8==a.b)return"!";if(null===a.b)return"*"}return a.f()};!ra&&!v||v&&9<=Number(Ba)||ra&&za("1.9.1");v&&za("9");function Ka(a,b){if(!a||!b)return!1;if(a.contains&&1==b.nodeType)return a==b||a.contains(b);if("undefined"!=typeof a.compareDocumentPosition)return a==b||!!(a.compareDocumentPosition(b)&16);for(;b&&a!=b;)b=b.parentNode;return b==a}
function La(a,b){if(a==b)return 0;if(a.compareDocumentPosition)return a.compareDocumentPosition(b)&2?1:-1;if(v&&!(9<=Number(Ba))){if(9==a.nodeType)return-1;if(9==b.nodeType)return 1}if("sourceIndex"in a||a.parentNode&&"sourceIndex"in a.parentNode){var c=1==a.nodeType,d=1==b.nodeType;if(c&&d)return a.sourceIndex-b.sourceIndex;var e=a.parentNode,f=b.parentNode;return e==f?Ma(a,b):!c&&Ka(e,b)?-1*Na(a,b):!d&&Ka(f,a)?Na(b,a):(c?a.sourceIndex:e.sourceIndex)-(d?b.sourceIndex:f.sourceIndex)}d=9==a.nodeType?
a:a.ownerDocument||a.document;c=d.createRange();c.selectNode(a);c.collapse(!0);d=d.createRange();d.selectNode(b);d.collapse(!0);return c.compareBoundaryPoints(k.Range.START_TO_END,d)}function Na(a,b){var c=a.parentNode;if(c==b)return-1;for(var d=b;d.parentNode!=c;)d=d.parentNode;return Ma(d,a)}function Ma(a,b){for(var c=b;c=c.previousSibling;)if(c==a)return-1;return 1};function C(){this.b=this.a=null;this.l=0}function Oa(a){this.node=a;this.a=this.b=null}function Pa(a,b){if(!a.a)return b;if(!b.a)return a;for(var c=a.a,d=b.a,e=null,f=null,g=0;c&&d;){var f=c.node,h=d.node;f==h||f instanceof x&&h instanceof x&&f.a==h.a?(f=c,c=c.a,d=d.a):0<La(c.node,d.node)?(f=d,d=d.a):(f=c,c=c.a);(f.b=e)?e.a=f:a.a=f;e=f;g++}for(f=c||d;f;)f.b=e,e=e.a=f,g++,f=f.a;a.b=e;a.l=g;return a}function Qa(a,b){var c=new Oa(b);c.a=a.a;a.b?a.a.b=c:a.a=a.b=c;a.a=c;a.l++}
function F(a,b){var c=new Oa(b);c.b=a.b;a.a?a.b.a=c:a.a=a.b=c;a.b=c;a.l++}function Ra(a){return(a=a.a)?a.node:null}function Sa(a){return(a=Ra(a))?z(a):""}function H(a,b){return new Ta(a,!!b)}function Ta(a,b){this.f=a;this.b=(this.c=b)?a.b:a.a;this.a=null}function I(a){var b=a.b;if(null==b)return null;var c=a.a=b;a.b=a.c?b.b:b.a;return c.node};function n(a){this.i=a;this.b=this.g=!1;this.f=null}function J(a){return"\n "+a.toString().split("\n").join("\n ")}function Ua(a,b){a.g=b}function Va(a,b){a.b=b}function K(a,b){var c=a.a(b);return c instanceof C?+Sa(c):+c}function L(a,b){var c=a.a(b);return c instanceof C?Sa(c):""+c}function M(a,b){var c=a.a(b);return c instanceof C?!!c.l:!!c};function N(a,b,c){n.call(this,a.i);this.c=a;this.h=b;this.o=c;this.g=b.g||c.g;this.b=b.b||c.b;this.c==Wa&&(c.b||c.g||4==c.i||0==c.i||!b.f?b.b||b.g||4==b.i||0==b.i||!c.f||(this.f={name:c.f.name,s:b}):this.f={name:b.f.name,s:c})}m(N);
function O(a,b,c,d,e){b=b.a(d);c=c.a(d);var f;if(b instanceof C&&c instanceof C){b=H(b);for(d=I(b);d;d=I(b))for(e=H(c),f=I(e);f;f=I(e))if(a(z(d),z(f)))return!0;return!1}if(b instanceof C||c instanceof C){b instanceof C?(e=b,d=c):(e=c,d=b);f=H(e);for(var g=typeof d,h=I(f);h;h=I(f)){switch(g){case "number":h=+z(h);break;case "boolean":h=!!z(h);break;case "string":h=z(h);break;default:throw Error("Illegal primitive type for comparison.");}if(e==b&&a(h,d)||e==c&&a(d,h))return!0}return!1}return e?"boolean"==
typeof b||"boolean"==typeof c?a(!!b,!!c):"number"==typeof b||"number"==typeof c?a(+b,+c):a(b,c):a(+b,+c)}N.prototype.a=function(a){return this.c.m(this.h,this.o,a)};N.prototype.toString=function(){var a="Binary Expression: "+this.c,a=a+J(this.h);return a+=J(this.o)};function Xa(a,b,c,d){this.a=a;this.w=b;this.i=c;this.m=d}Xa.prototype.toString=function(){return this.a};var Ya={};
function P(a,b,c,d){if(Ya.hasOwnProperty(a))throw Error("Binary operator already created: "+a);a=new Xa(a,b,c,d);return Ya[a.toString()]=a}P("div",6,1,function(a,b,c){return K(a,c)/K(b,c)});P("mod",6,1,function(a,b,c){return K(a,c)%K(b,c)});P("*",6,1,function(a,b,c){return K(a,c)*K(b,c)});P("+",5,1,function(a,b,c){return K(a,c)+K(b,c)});P("-",5,1,function(a,b,c){return K(a,c)-K(b,c)});P("<",4,2,function(a,b,c){return O(function(a,b){return a<b},a,b,c)});
P(">",4,2,function(a,b,c){return O(function(a,b){return a>b},a,b,c)});P("<=",4,2,function(a,b,c){return O(function(a,b){return a<=b},a,b,c)});P(">=",4,2,function(a,b,c){return O(function(a,b){return a>=b},a,b,c)});var Wa=P("=",3,2,function(a,b,c){return O(function(a,b){return a==b},a,b,c,!0)});P("!=",3,2,function(a,b,c){return O(function(a,b){return a!=b},a,b,c,!0)});P("and",2,2,function(a,b,c){return M(a,c)&&M(b,c)});P("or",1,2,function(a,b,c){return M(a,c)||M(b,c)});function Q(a,b,c){this.a=a;this.b=b||1;this.f=c||1};function Za(a,b){if(b.a.length&&4!=a.i)throw Error("Primary expression must evaluate to nodeset if filter has predicate(s).");n.call(this,a.i);this.c=a;this.h=b;this.g=a.g;this.b=a.b}m(Za);Za.prototype.a=function(a){a=this.c.a(a);return $a(this.h,a)};Za.prototype.toString=function(){var a;a="Filter:"+J(this.c);return a+=J(this.h)};function ab(a,b){if(b.length<a.A)throw Error("Function "+a.j+" expects at least"+a.A+" arguments, "+b.length+" given");if(null!==a.v&&b.length>a.v)throw Error("Function "+a.j+" expects at most "+a.v+" arguments, "+b.length+" given");a.B&&r(b,function(b,d){if(4!=b.i)throw Error("Argument "+d+" to function "+a.j+" is not of type Nodeset: "+b);});n.call(this,a.i);this.h=a;this.c=b;Ua(this,a.g||ja(b,function(a){return a.g}));Va(this,a.D&&!b.length||a.C&&!!b.length||ja(b,function(a){return a.b}))}m(ab);
ab.prototype.a=function(a){return this.h.m.apply(null,la(a,this.c))};ab.prototype.toString=function(){var a="Function: "+this.h;if(this.c.length)var b=t(this.c,function(a,b){return a+J(b)},"Arguments:"),a=a+J(b);return a};function bb(a,b,c,d,e,f,g,h,p){this.j=a;this.i=b;this.g=c;this.D=d;this.C=e;this.m=f;this.A=g;this.v=void 0!==h?h:g;this.B=!!p}bb.prototype.toString=function(){return this.j};var cb={};
function R(a,b,c,d,e,f,g,h){if(cb.hasOwnProperty(a))throw Error("Function already created: "+a+".");cb[a]=new bb(a,b,c,d,!1,e,f,g,h)}R("boolean",2,!1,!1,function(a,b){return M(b,a)},1);R("ceiling",1,!1,!1,function(a,b){return Math.ceil(K(b,a))},1);R("concat",3,!1,!1,function(a,b){return t(ma(arguments,1),function(b,d){return b+L(d,a)},"")},2,null);R("contains",2,!1,!1,function(a,b,c){return q(L(b,a),L(c,a))},2);R("count",1,!1,!1,function(a,b){return b.a(a).l},1,1,!0);
R("false",2,!1,!1,function(){return!1},0);R("floor",1,!1,!1,function(a,b){return Math.floor(K(b,a))},1);R("id",4,!1,!1,function(a,b){function c(a){if(w){var b=e.all[a];if(b){if(b.nodeType&&a==b.id)return b;if(b.length)return ka(b,function(b){return a==b.id})}return null}return e.getElementById(a)}var d=a.a,e=9==d.nodeType?d:d.ownerDocument,d=L(b,a).split(/\s+/),f=[];r(d,function(a){a=c(a);!a||0<=ha(f,a)||f.push(a)});f.sort(La);var g=new C;r(f,function(a){F(g,a)});return g},1);
R("lang",2,!1,!1,function(){return!1},1);R("last",1,!0,!1,function(a){if(1!=arguments.length)throw Error("Function last expects ()");return a.f},0);R("local-name",3,!1,!0,function(a,b){var c=b?Ra(b.a(a)):a.a;return c?c.localName||c.nodeName.toLowerCase():""},0,1,!0);R("name",3,!1,!0,function(a,b){var c=b?Ra(b.a(a)):a.a;return c?c.nodeName.toLowerCase():""},0,1,!0);R("namespace-uri",3,!0,!1,function(){return""},0,1,!0);
R("normalize-space",3,!1,!0,function(a,b){return(b?L(b,a):z(a.a)).replace(/[\s\xa0]+/g," ").replace(/^\s+|\s+$/g,"")},0,1);R("not",2,!1,!1,function(a,b){return!M(b,a)},1);R("number",1,!1,!0,function(a,b){return b?K(b,a):+z(a.a)},0,1);R("position",1,!0,!1,function(a){return a.b},0);R("round",1,!1,!1,function(a,b){return Math.round(K(b,a))},1);R("starts-with",2,!1,!1,function(a,b,c){b=L(b,a);a=L(c,a);return 0==b.lastIndexOf(a,0)},2);R("string",3,!1,!0,function(a,b){return b?L(b,a):z(a.a)},0,1);
R("string-length",1,!1,!0,function(a,b){return(b?L(b,a):z(a.a)).length},0,1);R("substring",3,!1,!1,function(a,b,c,d){c=K(c,a);if(isNaN(c)||Infinity==c||-Infinity==c)return"";d=d?K(d,a):Infinity;if(isNaN(d)||-Infinity===d)return"";c=Math.round(c)-1;var e=Math.max(c,0);a=L(b,a);return Infinity==d?a.substring(e):a.substring(e,c+Math.round(d))},2,3);R("substring-after",3,!1,!1,function(a,b,c){b=L(b,a);a=L(c,a);c=b.indexOf(a);return-1==c?"":b.substring(c+a.length)},2);
R("substring-before",3,!1,!1,function(a,b,c){b=L(b,a);a=L(c,a);a=b.indexOf(a);return-1==a?"":b.substring(0,a)},2);R("sum",1,!1,!1,function(a,b){for(var c=H(b.a(a)),d=0,e=I(c);e;e=I(c))d+=+z(e);return d},1,1,!0);R("translate",3,!1,!1,function(a,b,c,d){b=L(b,a);c=L(c,a);var e=L(d,a);a={};for(d=0;d<c.length;d++){var f=c.charAt(d);f in a||(a[f]=e.charAt(d))}c="";for(d=0;d<b.length;d++)f=b.charAt(d),c+=f in a?a[f]:f;return c},3);R("true",2,!1,!1,function(){return!0},0);function G(a,b){this.h=a;this.c=void 0!==b?b:null;this.b=null;switch(a){case "comment":this.b=8;break;case "text":this.b=3;break;case "processing-instruction":this.b=7;break;case "node":break;default:throw Error("Unexpected argument");}}function db(a){return"comment"==a||"text"==a||"processing-instruction"==a||"node"==a}G.prototype.a=function(a){return null===this.b||this.b==a.nodeType};G.prototype.f=function(){return this.h};
G.prototype.toString=function(){var a="Kind Test: "+this.h;null===this.c||(a+=J(this.c));return a};function eb(a){this.b=a;this.a=0}function fb(a){a=a.match(gb);for(var b=0;b<a.length;b++)hb.test(a[b])&&a.splice(b,1);return new eb(a)}var gb=/\$?(?:(?![0-9-\.])(?:\*|[\w-\.]+):)?(?![0-9-\.])(?:\*|[\w-\.]+)|\/\/|\.\.|::|\d+(?:\.\d*)?|\.\d+|"[^"]*"|'[^']*'|[!<>]=|\s+|./g,hb=/^\s/;function S(a,b){return a.b[a.a+(b||0)]}function T(a){return a.b[a.a++]}function ib(a){return a.b.length<=a.a};function jb(a){n.call(this,3);this.c=a.substring(1,a.length-1)}m(jb);jb.prototype.a=function(){return this.c};jb.prototype.toString=function(){return"Literal: "+this.c};function E(a,b){this.j=a.toLowerCase();var c;c="*"==this.j?"*":"http://www.w3.org/1999/xhtml";this.c=b?b.toLowerCase():c}E.prototype.a=function(a){var b=a.nodeType;if(1!=b&&2!=b)return!1;b=void 0!==a.localName?a.localName:a.nodeName;return"*"!=this.j&&this.j!=b.toLowerCase()?!1:"*"==this.c?!0:this.c==(a.namespaceURI?a.namespaceURI.toLowerCase():"http://www.w3.org/1999/xhtml")};E.prototype.f=function(){return this.j};
E.prototype.toString=function(){return"Name Test: "+("http://www.w3.org/1999/xhtml"==this.c?"":this.c+":")+this.j};function kb(a,b){n.call(this,a.i);this.h=a;this.c=b;this.g=a.g;this.b=a.b;if(1==this.c.length){var c=this.c[0];c.u||c.c!=lb||(c=c.o,"*"!=c.f()&&(this.f={name:c.f(),s:null}))}}m(kb);function mb(){n.call(this,4)}m(mb);mb.prototype.a=function(a){var b=new C;a=a.a;9==a.nodeType?F(b,a):F(b,a.ownerDocument);return b};mb.prototype.toString=function(){return"Root Helper Expression"};function nb(){n.call(this,4)}m(nb);nb.prototype.a=function(a){var b=new C;F(b,a.a);return b};nb.prototype.toString=function(){return"Context Helper Expression"};
function ob(a){return"/"==a||"//"==a}kb.prototype.a=function(a){var b=this.h.a(a);if(!(b instanceof C))throw Error("Filter expression must evaluate to nodeset.");a=this.c;for(var c=0,d=a.length;c<d&&b.l;c++){var e=a[c],f=H(b,e.c.a),g;if(e.g||e.c!=pb)if(e.g||e.c!=qb)for(g=I(f),b=e.a(new Q(g));null!=(g=I(f));)g=e.a(new Q(g)),b=Pa(b,g);else g=I(f),b=e.a(new Q(g));else{for(g=I(f);(b=I(f))&&(!g.contains||g.contains(b))&&b.compareDocumentPosition(g)&8;g=b);b=e.a(new Q(g))}}return b};
kb.prototype.toString=function(){var a;a="Path Expression:"+J(this.h);if(this.c.length){var b=t(this.c,function(a,b){return a+J(b)},"Steps:");a+=J(b)}return a};function rb(a){n.call(this,4);this.c=a;Ua(this,ja(this.c,function(a){return a.g}));Va(this,ja(this.c,function(a){return a.b}))}m(rb);rb.prototype.a=function(a){var b=new C;r(this.c,function(c){c=c.a(a);if(!(c instanceof C))throw Error("Path expression must evaluate to NodeSet.");b=Pa(b,c)});return b};rb.prototype.toString=function(){return t(this.c,function(a,b){return a+J(b)},"Union Expression:")};function sb(a,b){this.a=a;this.b=!!b}
function $a(a,b,c){for(c=c||0;c<a.a.length;c++)for(var d=a.a[c],e=H(b),f=b.l,g,h=0;g=I(e);h++){var p=a.b?f-h:h+1;g=d.a(new Q(g,p,f));if("number"==typeof g)p=p==g;else if("string"==typeof g||"boolean"==typeof g)p=!!g;else if(g instanceof C)p=0<g.l;else throw Error("Predicate.evaluate returned an unexpected type.");if(!p){p=e;g=p.f;var y=p.a;if(!y)throw Error("Next must be called at least once before remove.");var D=y.b,y=y.a;D?D.a=y:g.a=y;y?y.b=D:g.b=D;g.l--;p.a=null}}return b}
sb.prototype.toString=function(){return t(this.a,function(a,b){return a+J(b)},"Predicates:")};function U(a,b,c,d){n.call(this,4);this.c=a;this.o=b;this.h=c||new sb([]);this.u=!!d;b=this.h;b=0<b.a.length?b.a[0].f:null;a.b&&b&&(a=b.name,a=w?a.toLowerCase():a,this.f={name:a,s:b.s});a:{a=this.h;for(b=0;b<a.a.length;b++)if(c=a.a[b],c.g||1==c.i||0==c.i){a=!0;break a}a=!1}this.g=a}m(U);
U.prototype.a=function(a){var b=a.a,c=null,c=this.f,d=null,e=null,f=0;c&&(d=c.name,e=c.s?L(c.s,a):null,f=1);if(this.u)if(this.g||this.c!=tb)if(a=H((new U(ub,new G("node"))).a(a)),b=I(a))for(c=this.m(b,d,e,f);null!=(b=I(a));)c=Pa(c,this.m(b,d,e,f));else c=new C;else c=B(this.o,b,d,e),c=$a(this.h,c,f);else c=this.m(a.a,d,e,f);return c};U.prototype.m=function(a,b,c,d){a=this.c.f(this.o,a,b,c);return a=$a(this.h,a,d)};
U.prototype.toString=function(){var a;a="Step:"+J("Operator: "+(this.u?"//":"/"));this.c.j&&(a+=J("Axis: "+this.c));a+=J(this.o);if(this.h.a.length){var b=t(this.h.a,function(a,b){return a+J(b)},"Predicates:");a+=J(b)}return a};function vb(a,b,c,d){this.j=a;this.f=b;this.a=c;this.b=d}vb.prototype.toString=function(){return this.j};var wb={};function V(a,b,c,d){if(wb.hasOwnProperty(a))throw Error("Axis already created: "+a);b=new vb(a,b,c,!!d);return wb[a]=b}
V("ancestor",function(a,b){for(var c=new C,d=b;d=d.parentNode;)a.a(d)&&Qa(c,d);return c},!0);V("ancestor-or-self",function(a,b){var c=new C,d=b;do a.a(d)&&Qa(c,d);while(d=d.parentNode);return c},!0);
(c)?c:null,l(d)
var ub=V("descendant-or-self",function(a,b,c,d){var e=new C;A(b,c,d)&&a.a(b)&&F(e,b);return B(a,b,c,d,e)},!1,!0),pb=V("following",function(a,b,c,d){var e=new C;do for(var f=b;f=f.nextSibling;)A(f,c,d)&&a.a(f)&&F(e,f),e=B(a,f,c,d,e);while(b=b.parentNode);return e},!1,!0);V("following-sibling",function(a,b){for(var c=new C,d=b;d=d.nextSibling;)a.a(d)&&F(c,d);return c},!1);V("namespace",function(){return new C},!1);
var xb=V("parent",function(a,b){var c=new C;if(9==b.nodeType)return c;if(2==b.nodeType)return F(c,b.ownerElement),c;var d=b.parentNode;a.a(d)&&F(c,d);return c},!1),qb=V("preceding",function(a,b,c,d){var e=new C,f=[];do f.unshift(b);while(b=b.parentNode);for(var g=1,h=f.length;g<h;g++){var p=[];for(b=f[g];b=b.previousSibling;)p.unshift(b);for(var y=0,D=p.length;y<D;y++)b=p[y],A(b,c,d)&&a.a(b)&&F(e,b),e=B(a,b,c,d,e)}return e},!0,!0);
V("preceding-sibling",function(a,b){for(var c=new C,d=b;d=d.previousSibling;)a.a(d)&&Qa(c,d);return c},!0);var yb=V("self",function(a,b){var c=new C;a.a(b)&&F(c,b);return c},!1);function zb(a){n.call(this,1);this.c=a;this.g=a.g;this.b=a.b}m(zb);zb.prototype.a=function(a){return-K(this.c,a)};zb.prototype.toString=function(){return"Unary Expression: -"+J(this.c)};function Ab(a){n.call(this,1);this.c=a}m(Ab);Ab.prototype.a=function(){return this.c};Ab.prototype.toString=function(){return"Number: "+this.c};function Bb(a,b){this.a=a;this.b=b}function Cb(a){for(var b,c=[];;){W(a,"Missing right hand side of binary expression.");b=Db(a);var d=T(a.a);if(!d)break;var e=(d=Ya[d]||null)&&d.w;if(!e){a.a.a--;break}for(;c.length&&e<=c[c.length-1].w;)b=new N(c.pop(),c.pop(),b);c.push(b,d)}for(;c.length;)b=new N(c.pop(),c.pop(),b);return b}function W(a,b){if(ib(a.a))throw Error(b);}function Eb(a,b){var c=T(a.a);if(c!=b)throw Error("Bad token, expected: "+b+" got: "+c);}
function Fb(a){a=T(a.a);if(")"!=a)throw Error("Bad token: "+a);}function Gb(a){a=T(a.a);if(2>a.length)throw Error("Unclosed literal string");return new jb(a)}
function Hb(a){var b,c=[],d;if(ob(S(a.a))){b=T(a.a);d=S(a.a);if("/"==b&&(ib(a.a)||"."!=d&&".."!=d&&"@"!=d&&"*"!=d&&!/(?![0-9])[\w]/.test(d)))return new mb;d=new mb;W(a,"Missing next location step.");b=Ib(a,b);c.push(b)}else{a:{b=S(a.a);d=b.charAt(0);switch(d){case "$":throw Error("Variable reference not allowed in HTML XPath");case "(":T(a.a);b=Cb(a);W(a,'unclosed "("');Eb(a,")");break;case '"':case "'":b=Gb(a);break;default:if(isNaN(+b))if(!db(b)&&/(?![0-9])[\w]/.test(d)&&"("==S(a.a,1)){b=T(a.a);
b=cb[b]||null;T(a.a);for(d=[];")"!=S(a.a);){W(a,"Missing function argument list.");d.push(Cb(a));if(","!=S(a.a))break;T(a.a)}W(a,"Unclosed function argument list.");Fb(a);b=new ab(b,d)}else{b=null;break a}else b=new Ab(+T(a.a))}"["==S(a.a)&&(d=new sb(Jb(a)),b=new Za(b,d))}if(b)if(ob(S(a.a)))d=b;else return b;else b=Ib(a,"/"),d=new nb,c.push(b)}for(;ob(S(a.a));)b=T(a.a),W(a,"Missing next location step."),b=Ib(a,b),c.push(b);return new kb(d,c)}
function Ib(a,b){var c,d,e;if("/"!=b&&"//"!=b)throw Error('Step op should be "/" or "//"');if("."==S(a.a))return d=new U(yb,new G("node")),T(a.a),d;if(".."==S(a.a))return d=new U(xb,new G("node")),T(a.a),d;var f;if("@"==S(a.a))f=lb,T(a.a),W(a,"Missing attribute name");else if("::"==S(a.a,1)){if(!/(?![0-9])[\w]/.test(S(a.a).charAt(0)))throw Error("Bad token: "+T(a.a));c=T(a.a);f=wb[c]||null;if(!f)throw Error("No axis with name: "+c);T(a.a);W(a,"Missing node name")}else f=tb;c=S(a.a);if(/(?![0-9])[\w\*]/.test(c.charAt(0)))if("("==
S(a.a,1)){if(!db(c))throw Error("Invalid node type: "+c);c=T(a.a);if(!db(c))throw Error("Invalid type name: "+c);Eb(a,"(");W(a,"Bad nodetype");e=S(a.a).charAt(0);var g=null;if('"'==e||"'"==e)g=Gb(a);W(a,"Bad nodetype");Fb(a);c=new G(c,g)}else if(c=T(a.a),e=c.indexOf(":"),-1==e)c=new E(c);else{var g=c.substring(0,e),h;if("*"==g)h="*";else if(h=a.b(g),!h)throw Error("Namespace prefix not declared: "+g);c=c.substr(e+1);c=new E(c,h)}else throw Error("Bad token: "+T(a.a));e=new sb(Jb(a),f.a);return d||
new U(f,c,e,"//"==b)}function Jb(a){for(var b=[];"["==S(a.a);){T(a.a);W(a,"Missing predicate expression.");var c=Cb(a);b.push(c);W(a,"Unclosed predicate expression.");Eb(a,"]")}return b}function Db(a){if("-"==S(a.a))return T(a.a),new zb(Db(a));var b=Hb(a);if("|"!=S(a.a))a=b;else{for(b=[b];"|"==T(a.a);)W(a,"Missing next union location path."),b.push(Hb(a));a.a.a--;a=new rb(b)}return a};function Kb(a){switch(a.nodeType){case 1:return ea(Lb,a);case 9:return Kb(a.documentElement);case 11:case 10:case 6:case 12:return Mb;default:return a.parentNode?Kb(a.parentNode):Mb}}function Mb(){return null}function Lb(a,b){if(a.prefix==b)return a.namespaceURI||"http://www.w3.org/1999/xhtml";var c=a.getAttributeNode("xmlns:"+b);return c&&c.specified?c.value||null:a.parentNode&&9!=a.parentNode.nodeType?Lb(a.parentNode,b):null};function Nb(a,b){if(!a.length)throw Error("Empty XPath expression.");var c=fb(a);if(ib(c))throw Error("Invalid XPath expression.");b?"function"==aa(b)||(b=da(b.lookupNamespaceURI,b)):b=function(){return null};var d=Cb(new Bb(c,b));if(!ib(c))throw Error("Bad token: "+T(c));this.evaluate=function(a,b){var c=d.a(new Q(a));return new Y(c,b)}}
function Y(a,b){if(0==b)if(a instanceof C)b=4;else if("string"==typeof a)b=2;else if("number"==typeof a)b=1;else if("boolean"==typeof a)b=3;else throw Error("Unexpected evaluation result.");if(2!=b&&1!=b&&3!=b&&!(a instanceof C))throw Error("value could not be converted to the specified type");this.resultType=b;var c;switch(b){case 2:this.stringValue=a instanceof C?Sa(a):""+a;break;case 1:this.numberValue=a instanceof C?+Sa(a):+a;break;case 3:this.booleanValue=a instanceof C?0<a.l:!!a;break;case 4:case 5:case 6:case 7:var d=
H(a);c=[];for(var e=I(d);e;e=I(d))c.push(e instanceof x?e.a:e);this.snapshotLength=a.l;this.invalidIteratorState=!1;break;case 8:case 9:d=Ra(a);this.singleNodeValue=d instanceof x?d.a:d;break;default:throw Error("Unknown XPathResult type.");}var f=0;this.iterateNext=function(){if(4!=b&&5!=b)throw Error("iterateNext called with wrong result type");return f>=c.length?null:c[f++]};this.snapshotItem=function(a){if(6!=b&&7!=b)throw Error("snapshotItem called with wrong result type");return a>=c.length||
0>a?null:c[a]}}Y.ANY_TYPE=0;Y.NUMBER_TYPE=1;Y.STRING_TYPE=2;Y.BOOLEAN_TYPE=3;Y.UNORDERED_NODE_ITERATOR_TYPE=4;Y.ORDERED_NODE_ITERATOR_TYPE=5;Y.UNORDERED_NODE_SNAPSHOT_TYPE=6;Y.ORDERED_NODE_SNAPSHOT_TYPE=7;Y.ANY_UNORDERED_NODE_TYPE=8;Y.FIRST_ORDERED_NODE_TYPE=9;function Ob(a){this.lookupNamespaceURI=Kb(a)}
(C) CONTIGUOUS (if > 1d).
*
* NPY_ARRAY_WRITEBACKIFCOPY flag sets this flag in the returned
* array if a copy is made and the base argument points to the (possibly)
* misbehaved array. Before returning to python, PyArray_ResolveWritebackIfCopy
* must be called to update the contents of the original array from the copy.
(C) c = span.innerHTML = C;
if (c.match(/[\u02C6-\u02DC\u00A8]/)) {this.PHTML.acc = -.52}
else if (c === "\u2192") {this.PHTML.acc = -.15; this.PHTML.vec = true}
}
(c) # (d/dx)(c) = 2
array([ 2., 6., 12.])
>>> P.polyder(c,3) # (d**3/dx**3)(c) = 24
array([24.])
>>> P.polyder(c,scl=-1) # (d/d(-x))(c) = -2 - 6x - 12x**2
array([ -2., -6., -12.])
>>> P.polyder(c,2,-1) # (d**2/d(-x)**2)(c) = 6 + 24x
array([ 6., 24.])
(c) # (d/dx)(c) = 2
array([ 2., 6., 12.])
>>> P.polyder(c,3) # (d**3/dx**3)(c) = 24
array([24.])
>>> P.polyder(c,scl=-1) # (d/d(-x))(c) = -2 - 6x - 12x**2
array([ -2., -6., -12.])
>>> P.polyder(c,2,-1) # (d**2/d(-x)**2)(c) = 6 + 24x
array([ 6., 24.])
(c)
def test_from_complex(self):
tgt = (complex(1, 1), complex(1, -1))
c = TextIO()
c.write("%s %s" % tgt)
c.seek(0)
res = np.loadtxt(c, dtype=complex)
assert_equal(res, tgt)
def test_complex_misformatted(self):
(c)
def test_from_complex(self):
tgt = (complex(1, 1), complex(1, -1))
c = TextIO()
c.write("%s %s" % tgt)
c.seek(0)
res = np.loadtxt(c, dtype=complex)
assert_equal(res, tgt)
def test_complex_misformatted(self):
(c)
depend = None
if check is not None:
(c)
depend = None
if check is not None:
(c)
d = inner1d(a, b, axis=-1, out=out)
assert_(d is out)
assert_array_equal(d, c)
c = inner1d(a, b, axis=0)
assert_array_equal(c, (a * b).sum(0))
# Sanity checks on innerwt and cumsum.
a = np.arange(6).reshape((2, 3))
b = np.arange(10, 16).reshape((2, 3))
w = np.arange(20, 26).reshape((2, 3))
assert_array_equal(umt.innerwt(a, b, w, axis=0),
np.sum(a * b * w, axis=0))
assert_array_equal(umt.cumsum(a, axis=0), np.cumsum(a, axis=0))
assert_array_equal(umt.cumsum(a, axis=-1), np.cumsum(a, axis=-1))
out = np.empty_like(a)
b = umt.cumsum(a, out=out, axis=0)
assert_(out is b)
assert_array_equal(b, np.cumsum(a, axis=0))
b = umt.cumsum(a, out=out, axis=1)
assert_(out is b)
assert_array_equal(b, np.cumsum(a, axis=-1))
# Check errors.
# Cannot pass in both axis and axes.
assert_raises(TypeError, inner1d, a, b, axis=0, axes=[0, 0])
# Not an integer.
assert_raises(TypeError, inner1d, a, b, axis=[0])
# more than 1 core dimensions.
mm = umt.matrix_multiply
assert_raises(TypeError, mm, a, b, axis=1)
# Output wrong size in axis.
out = np.empty((1, 2, 3), dtype=a.dtype)
assert_raises(ValueError, umt.cumsum, a, out=out, axis=0)
# Regular ufuncs should not accept axis.
assert_raises(TypeError, np.add, 1., 1., axis=0)
def test_keepdims_argument(self):
(c)
d = inner1d(a, b, axis=-1, out=out)
assert_(d is out)
assert_array_equal(d, c)
c = inner1d(a, b, axis=0)
assert_array_equal(c, (a * b).sum(0))
# Sanity checks on innerwt and cumsum.
a = np.arange(6).reshape((2, 3))
b = np.arange(10, 16).reshape((2, 3))
w = np.arange(20, 26).reshape((2, 3))
assert_array_equal(umt.innerwt(a, b, w, axis=0),
np.sum(a * b * w, axis=0))
assert_array_equal(umt.cumsum(a, axis=0), np.cumsum(a, axis=0))
assert_array_equal(umt.cumsum(a, axis=-1), np.cumsum(a, axis=-1))
out = np.empty_like(a)
b = umt.cumsum(a, out=out, axis=0)
assert_(out is b)
assert_array_equal(b, np.cumsum(a, axis=0))
b = umt.cumsum(a, out=out, axis=1)
assert_(out is b)
assert_array_equal(b, np.cumsum(a, axis=-1))
# Check errors.
# Cannot pass in both axis and axes.
assert_raises(TypeError, inner1d, a, b, axis=0, axes=[0, 0])
# Not an integer.
assert_raises(TypeError, inner1d, a, b, axis=[0])
# more than 1 core dimensions.
mm = umt.matrix_multiply
assert_raises(TypeError, mm, a, b, axis=1)
# Output wrong size in axis.
out = np.empty((1, 2, 3), dtype=a.dtype)
assert_raises(ValueError, umt.cumsum, a, out=out, axis=0)
# Regular ufuncs should not accept axis.
assert_raises(TypeError, np.add, 1., 1., axis=0)
def test_keepdims_argument(self):
(c)
d = inner1d(a, b, keepdims=True, out=out)
assert_(d is out)
assert_array_equal(d, c)
# Now combined with axis and axes.
c = inner1d(a, b, axis=-1, keepdims=False)
assert_array_equal(c, (a * b).sum(-1, keepdims=False))
c = inner1d(a, b, axis=-1, keepdims=True)
assert_array_equal(c, (a * b).sum(-1, keepdims=True))
c = inner1d(a, b, axis=0, keepdims=False)
assert_array_equal(c, (a * b).sum(0, keepdims=False))
c = inner1d(a, b, axis=0, keepdims=True)
assert_array_equal(c, (a * b).sum(0, keepdims=True))
c = inner1d(a, b, axes=[(-1,), (-1,), ()], keepdims=False)
assert_array_equal(c, (a * b).sum(-1))
c = inner1d(a, b, axes=[(-1,), (-1,), (-1,)], keepdims=True)
assert_array_equal(c, (a * b).sum(-1, keepdims=True))
c = inner1d(a, b, axes=[0, 0], keepdims=False)
assert_array_equal(c, (a * b).sum(0))
c = inner1d(a, b, axes=[0, 0, 0], keepdims=True)
assert_array_equal(c, (a * b).sum(0, keepdims=True))
c = inner1d(a, b, axes=[0, 2], keepdims=False)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1))
c = inner1d(a, b, axes=[0, 2], keepdims=True)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
keepdims=True))
c = inner1d(a, b, axes=[0, 2, 2], keepdims=True)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
keepdims=True))
c = inner1d(a, b, axes=[0, 2, 0], keepdims=True)
assert_array_equal(c, (a * b.transpose(2, 0, 1)).sum(0, keepdims=True))
# Hardly useful, but should work.
c = inner1d(a, b, axes=[0, 2, 1], keepdims=True)
assert_array_equal(c, (a.transpose(1, 0, 2) * b.transpose(0, 2, 1))
.sum(1, keepdims=True))
# Check with two core dimensions.
a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
expected = uml.det(a)
c = uml.det(a, keepdims=False)
assert_array_equal(c, expected)
c = uml.det(a, keepdims=True)
assert_array_equal(c, expected[:, np.newaxis, np.newaxis])
a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
expected_s, expected_l = uml.slogdet(a)
cs, cl = uml.slogdet(a, keepdims=False)
assert_array_equal(cs, expected_s)
assert_array_equal(cl, expected_l)
cs, cl = uml.slogdet(a, keepdims=True)
assert_array_equal(cs, expected_s[:, np.newaxis, np.newaxis])
assert_array_equal(cl, expected_l[:, np.newaxis, np.newaxis])
# Sanity check on innerwt.
a = np.arange(6).reshape((2, 3))
b = np.arange(10, 16).reshape((2, 3))
w = np.arange(20, 26).reshape((2, 3))
assert_array_equal(umt.innerwt(a, b, w, keepdims=True),
np.sum(a * b * w, axis=-1, keepdims=True))
assert_array_equal(umt.innerwt(a, b, w, axis=0, keepdims=True),
np.sum(a * b * w, axis=0, keepdims=True))
# Check errors.
# Not a boolean
assert_raises(TypeError, inner1d, a, b, keepdims='true')
# More than 1 core dimension, and core output dimensions.
mm = umt.matrix_multiply
assert_raises(TypeError, mm, a, b, keepdims=True)
assert_raises(TypeError, mm, a, b, keepdims=False)
# Regular ufuncs should not accept keepdims.
assert_raises(TypeError, np.add, 1., 1., keepdims=False)
def test_innerwt(self):
(c)
d = inner1d(a, b, keepdims=True, out=out)
assert_(d is out)
assert_array_equal(d, c)
# Now combined with axis and axes.
c = inner1d(a, b, axis=-1, keepdims=False)
assert_array_equal(c, (a * b).sum(-1, keepdims=False))
c = inner1d(a, b, axis=-1, keepdims=True)
assert_array_equal(c, (a * b).sum(-1, keepdims=True))
c = inner1d(a, b, axis=0, keepdims=False)
assert_array_equal(c, (a * b).sum(0, keepdims=False))
c = inner1d(a, b, axis=0, keepdims=True)
assert_array_equal(c, (a * b).sum(0, keepdims=True))
c = inner1d(a, b, axes=[(-1,), (-1,), ()], keepdims=False)
assert_array_equal(c, (a * b).sum(-1))
c = inner1d(a, b, axes=[(-1,), (-1,), (-1,)], keepdims=True)
assert_array_equal(c, (a * b).sum(-1, keepdims=True))
c = inner1d(a, b, axes=[0, 0], keepdims=False)
assert_array_equal(c, (a * b).sum(0))
c = inner1d(a, b, axes=[0, 0, 0], keepdims=True)
assert_array_equal(c, (a * b).sum(0, keepdims=True))
c = inner1d(a, b, axes=[0, 2], keepdims=False)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1))
c = inner1d(a, b, axes=[0, 2], keepdims=True)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
keepdims=True))
c = inner1d(a, b, axes=[0, 2, 2], keepdims=True)
assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
keepdims=True))
c = inner1d(a, b, axes=[0, 2, 0], keepdims=True)
assert_array_equal(c, (a * b.transpose(2, 0, 1)).sum(0, keepdims=True))
# Hardly useful, but should work.
c = inner1d(a, b, axes=[0, 2, 1], keepdims=True)
assert_array_equal(c, (a.transpose(1, 0, 2) * b.transpose(0, 2, 1))
.sum(1, keepdims=True))
# Check with two core dimensions.
a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
expected = uml.det(a)
c = uml.det(a, keepdims=False)
assert_array_equal(c, expected)
c = uml.det(a, keepdims=True)
assert_array_equal(c, expected[:, np.newaxis, np.newaxis])
a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
expected_s, expected_l = uml.slogdet(a)
cs, cl = uml.slogdet(a, keepdims=False)
assert_array_equal(cs, expected_s)
assert_array_equal(cl, expected_l)
cs, cl = uml.slogdet(a, keepdims=True)
assert_array_equal(cs, expected_s[:, np.newaxis, np.newaxis])
assert_array_equal(cl, expected_l[:, np.newaxis, np.newaxis])
# Sanity check on innerwt.
a = np.arange(6).reshape((2, 3))
b = np.arange(10, 16).reshape((2, 3))
w = np.arange(20, 26).reshape((2, 3))
assert_array_equal(umt.innerwt(a, b, w, keepdims=True),
np.sum(a * b * w, axis=-1, keepdims=True))
assert_array_equal(umt.innerwt(a, b, w, axis=0, keepdims=True),
np.sum(a * b * w, axis=0, keepdims=True))
# Check errors.
# Not a boolean
assert_raises(TypeError, inner1d, a, b, keepdims='true')
# More than 1 core dimension, and core output dimensions.
mm = umt.matrix_multiply
assert_raises(TypeError, mm, a, b, keepdims=True)
assert_raises(TypeError, mm, a, b, keepdims=False)
# Regular ufuncs should not accept keepdims.
assert_raises(TypeError, np.add, 1., 1., keepdims=False)
def test_innerwt(self):
(c)
elif isinstance(c, File):
(c)
else:
raise InvalidArguments(f'Argument {c!r} in "command" is invalid')
return final_cmd
class CustomTarget(Target, CommandBase):
(c)
except ValueError:
return 1
#
if xnotmask.all():
(c)
except ValueError:
return 1
#
if xnotmask.all():
(c)
except ValueError:
# scalar covariance
# nan if incorrect value (nan, inf, 0), 1 otherwise
return c / c
stddev = sqrt(d.real)
c /= stddev[:, None]
c /= stddev[None, :]
# Clip real and imaginary parts to [-1, 1]. This does not guarantee
# abs(a[i,j]) <= 1 for complex arrays, but is the best we can do without
# excessive work.
np.clip(c.real, -1, 1, out=c.real)
if np.iscomplexobj(c):
(c)
except ValueError:
# scalar covariance
# nan if incorrect value (nan, inf, 0), 1 otherwise
return c / c
stddev = sqrt(d.real)
c /= stddev[:, None]
c /= stddev[None, :]
# Clip real and imaginary parts to [-1, 1]. This does not guarantee
# abs(a[i,j]) <= 1 for complex arrays, but is the best we can do without
# excessive work.
np.clip(c.real, -1, 1, out=c.real)
if np.iscomplexobj(c):
(c)
expected = np.array(
[144, -12, 1],
[169, 13, 1]])
assert_array_equal(v, expected)
c = array([1.0+1j, 1.0-1j])
v = vander(c, N=3)
expected = np.array([[2j, 1+1j, 1],
[-2j, 1-1j, 1]])
# The data is floating point, but the values are small integers,
# so assert_array_equal *should* be safe here (rather than, say,
# assert_array_almost_equal).
(c)
expected = np.array(
[144, -12, 1],
[169, 13, 1]])
assert_array_equal(v, expected)
c = array([1.0+1j, 1.0-1j])
v = vander(c, N=3)
expected = np.array([[2j, 1+1j, 1],
[-2j, 1-1j, 1]])
# The data is floating point, but the values are small integers,
# so assert_array_equal *should* be safe here (rather than, say,
# assert_array_almost_equal).
(c)
!f2py integer, depend(c), intent(hide) :: m2 = shape(c, 1)
(c)
!f2py integer, depend(c), intent(hide) :: m2 = shape(c, 1)
(c)
!f2py integer, depend(c), intent(hide) :: n = f2py_itemsize(c)
integer*1, dimension(m, n), intent(out) :: o
do i=1,m
o(i, :) = transfer(c(i), o(i, :))
end do
end subroutine {fprefix}_array_input_{fsuffix}
subroutine {fprefix}_array_output_{fsuffix}(c, o, m, n)
character*{clength}, intent(out), dimension(m) :: c
integer n
integer*1, dimension(m, n), intent(in) :: o
!f2py character(f2py_len=n) :: c
!f2py integer, depend(o), intent(hide) :: m = len(o)
!f2py integer, depend(o), intent(hide) :: n = shape(o, 1)
do i=1,m
c(i) = transfer(o(i, :), c(i))
end do
end subroutine {fprefix}_array_output_{fsuffix}
(c)
!f2py integer, depend(c), intent(hide) :: n = f2py_itemsize(c)
integer*1, dimension(m, n), intent(out) :: o
do i=1,m
o(i, :) = transfer(c(i), o(i, :))
end do
end subroutine {fprefix}_array_input_{fsuffix}
subroutine {fprefix}_array_output_{fsuffix}(c, o, m, n)
character*{clength}, intent(out), dimension(m) :: c
integer n
integer*1, dimension(m, n), intent(in) :: o
!f2py character(f2py_len=n) :: c
!f2py integer, depend(o), intent(hide) :: m = len(o)
!f2py integer, depend(o), intent(hide) :: n = shape(o, 1)
do i=1,m
c(i) = transfer(o(i, :), c(i))
end do
end subroutine {fprefix}_array_output_{fsuffix}
(c)
final_cmd.append(c)
elif isinstance(c, CustomTargetIndex):
(c)
final_cmd.append(c)
elif isinstance(c, programs.ExternalProgram):
(c) foo
(c) foo
integer intent(out) :: x
callprotoargument int*
callstatement {{ &
; &
x = 42; &
(c) foo
integer intent(out) :: x
callprotoargument int*
callstatement {{ &
; &
x = 42; &
(c) foo
integer intent(out) :: x
end subroutine foo
end interface
end python module {module_name}
"""
(c) foo
integer intent(out) :: x
end subroutine foo
end interface
end python module {module_name}
"""
(c) for c in arr
if charmax < 256:
(c) for c in arr
if charmax < 256:
(c) for c in c2d
res = cheb.chebder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = cheb.chebder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = cheb.chebint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([cheb.chebint(c, k=3) for c in c2d])
res = cheb.chebint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = cheb.chebint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([cheb.chebint(c, k=3) for c in c2d])
res = cheb.chebint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herme.hermeder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herme.hermeder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herme.hermeint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([herme.hermeint(c, k=3) for c in c2d])
res = herme.hermeint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herme.hermeint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([herme.hermeint(c, k=3) for c in c2d])
res = herme.hermeint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herm.hermder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herm.hermder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herm.hermint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([herm.hermint(c, k=3) for c in c2d])
res = herm.hermint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = herm.hermint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([herm.hermint(c, k=3) for c in c2d])
res = herm.hermint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = lag.lagder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = lag.lagder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = lag.lagint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([lag.lagint(c, k=3) for c in c2d])
res = lag.lagint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = lag.lagint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([lag.lagint(c, k=3) for c in c2d])
res = lag.lagint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = leg.legder(c2d, axis=1)
assert_almost_equal(res, tgt)
def test_legder_orderhigherthancoeff(self):
(c) for c in c2d
res = leg.legder(c2d, axis=1)
assert_almost_equal(res, tgt)
def test_legder_orderhigherthancoeff(self):
(c) for c in c2d
res = leg.legint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([leg.legint(c, k=3) for c in c2d])
res = leg.legint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = leg.legint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([leg.legint(c, k=3) for c in c2d])
res = leg.legint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = poly.polyder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = poly.polyder(c2d, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = poly.polyint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([poly.polyint(c, k=3) for c in c2d])
res = poly.polyint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d
res = poly.polyint(c2d, axis=1)
assert_almost_equal(res, tgt)
tgt = np.vstack([poly.polyint(c, k=3) for c in c2d])
res = poly.polyint(c2d, k=3, axis=1)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = cheb.chebder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = cheb.chebder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = cheb.chebint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = cheb.chebint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herme.hermeder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herme.hermeder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herme.hermeint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herme.hermeint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herm.hermder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herm.hermder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herm.hermint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = herm.hermint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = lag.lagder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = lag.lagder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = lag.lagint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = lag.lagint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = leg.legder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = leg.legder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = leg.legint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = leg.legint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = poly.polyder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = poly.polyder(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = poly.polyint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in c2d.T
res = poly.polyint(c2d, axis=0)
assert_almost_equal(res, tgt)
(c) for c in
class TestMatrixPower:
(c) for c in
class TestMatrixPower:
(c) for c in command
self.args: T.List[NinjaCommandArg] = [strToCommandArg(a) for a in args] # args which will go into a rspfile, if used
self.description = description
self.deps = deps # depstyle 'gcc' or 'msvc'
self.depfile = depfile
self.extra = extra
self.rspable = rspable # if a rspfile can be used
self.refcount = 0
self.rsprefcount = 0
self.rspfile_quote_style = rspfile_quote_style
if self.depfile == '$DEPFILE':
(c) for c in commits
if commit_b == 'HEAD' and _dirty_git_working_dir():
(c) for c in compilers
def detect_fortran_compiler(env: 'Environment', for_machine: MachineChoice) -> Compiler:
(c) for c in
def test_values(self):
(c) for c in
def test_values(self):
(c) for c in re.split(
path_sorter = lambda key: ([(key.count('/') <= idx, alphanum_key(x)) for idx, x in enumerate(key.split('/'))])
unknown = [x for x in i.arguments if not isinstance(x, StringNode)]
sources = [x for x in i.arguments if isinstance(x, StringNode)]
sources = sorted(sources, key=lambda x: path_sorter(x.value))
i.arguments = unknown + sources
(c) for c in s
# Check that we do not allow writeable buffer export
with pytest.raises(BufferError, match="scalar buffer is readonly"):
(c) for c in s
# Check that we do not allow writeable buffer export
with pytest.raises(BufferError, match="scalar buffer is readonly"):
(c) for c in yo2
out.append(" ".join(line))
return out
(c)
if cnt >= n:
c = c[:1]*0
else:
(c)
if cnt >= n:
c = c[:1]*0
else:
(c)
if cnt >= n:
return c[:1]*0
else:
(c)
if cnt >= n:
return c[:1]*0
else:
(c)
if DependencyMethods.SYSTEM in methods:
candidates.append(functools.partial(ShadercDependency, env, kwargs))
return candidates
packages['shaderc'] = shaderc_factory
(c)
if n == 1:
return c
else:
(c)
if n == 1:
return c
else:
(c)
if n == 1:
return c
if n == 2:
(c)
if n == 1:
return c
if n == 2:
(c)
if n < 3:
return c
else:
(c)
if n < 3:
return c
else:
(c)
if (nl > 1) or (nr > 1) or (nl
return False
# can't do implicit summation or dimension collapse e.g.
# "ab,bc->c" (implicitly sum over 'a')
# "ab,ca->ca" (take diagonal of 'a')
if nl + nr - 1 == int(c in result):
(c)
if (nl > 1) or (nr > 1) or (nl
return False
# can't do implicit summation or dimension collapse e.g.
# "ab,bc->c" (implicitly sum over 'a')
# "ab,ca->ca" (take diagonal of 'a')
if nl + nr - 1 == int(c in result):
(c)
if os.path.basename(c).startswith(
env['WINEPATH'] = get_wine_shortpath(
winecmd,
['Z:' + p for p in self.test.extra_paths] + env.get('WINEPATH', '').split(';'),
self.test.workdir
)
break
(c)
instance_finfo = finfo(c(1.2))
assert_finfo_equal(class_finfo, instance_finfo)
with pytest.raises(ValueError):
(c)
instance_finfo = finfo(c(1.2))
assert_finfo_equal(class_finfo, instance_finfo)
with pytest.raises(ValueError):
(c)
instance_iinfo = iinfo(c(12))
assert_iinfo_equal(class_iinfo, instance_iinfo)
(c)
instance_iinfo = iinfo(c(12))
assert_iinfo_equal(class_iinfo, instance_iinfo)
(c)
integer(c_int64_t), intent(in) :: a, b
integer(c_int64_t), intent(out) :: c
c = a + b
end subroutine c_add_int64
! gh-25207
subroutine add_arr(A, B, C)
integer(c_int64_t), intent(in) :: A(3)
integer(c_int64_t), intent(in) :: B(3)
integer(c_int64_t), intent(out) :: C(3)
integer :: j
do j = 1, 3
C(j) = A(j)+B(j)
end do
end subroutine
(c)
integer(c_int64_t), intent(in) :: a, b
integer(c_int64_t), intent(out) :: c
c = a + b
end subroutine c_add_int64
! gh-25207
subroutine add_arr(A, B, C)
integer(c_int64_t), intent(in) :: A(3)
integer(c_int64_t), intent(in) :: B(3)
integer(c_int64_t), intent(out) :: C(3)
integer :: j
do j = 1, 3
C(j) = A(j)+B(j)
end do
end subroutine
(c)
integer(c_int), intent(in) :: x, y
integer(c_int) :: z
z = x + 7
end function wat
! gh-25207
(c)
integer(c_int), intent(in) :: x, y
integer(c_int) :: z
z = x + 7
end function wat
! gh-25207
(c)
integer
do i=1,m1
do j=1,m2
o(i, j, :) = transfer(c(i, j), o(i, j, :))
end do
end do
end subroutine {fprefix}_2d_array_input_{fsuffix}
""")
(c)
integer
do i=1,m1
do j=1,m2
o(i, j, :) = transfer(c(i, j), o(i, j, :))
end do
end do
end subroutine {fprefix}_2d_array_input_{fsuffix}
""")
(c)
integer
!f2py intent(out) o
o = transfer(c, o)
end subroutine {fprefix}_input_{fsuffix}
subroutine {fprefix}_output_{fsuffix}(c, o, n)
character*{clength}, intent(out) :: c
integer n
integer*1, dimension(n), intent(in) :: o
!f2py integer, depend(o), intent(hide) :: n = len(o)
c = transfer(o, c)
end subroutine {fprefix}_output_{fsuffix}
(c)
integer
!f2py intent(out) o
o = transfer(c, o)
end subroutine {fprefix}_input_{fsuffix}
subroutine {fprefix}_output_{fsuffix}(c, o, n)
character*{clength}, intent(out) :: c
integer n
integer*1, dimension(n), intent(in) :: o
!f2py integer, depend(o), intent(hide) :: n = len(o)
c = transfer(o, c)
end subroutine {fprefix}_output_{fsuffix}
(C) int printLibraryString(const char
void main ()
(c) is C))
def test_failing_wrap(self):
(c) is C))
def test_failing_wrap(self):
(c) is False
# int should fail on complex arrays
assert int(b) == int(i) == int(f) == 0
assert_raises(TypeError, lambda: int(c))
(c) is False
# int should fail on complex arrays
assert int(b) == int(i) == int(f) == 0
assert_raises(TypeError, lambda: int(c))
(c) is not None
s = as_string("'123'")
s2 = as_string('"ABC"')
assert s.op == Op.STRING
assert repr(s) == "Expr(Op.STRING, (\"'123'\", 1))", repr(s)
assert s == s
assert s != s2
(c) is not None
s = as_string("'123'")
s2 = as_string('"ABC"')
assert s.op == Op.STRING
assert repr(s) == "Expr(Op.STRING, (\"'123'\", 1))", repr(s)
assert s == s
assert s != s2
(c) is not np.matrix)
(c) is not np.matrix)
(c) is np.ndarray)
assert_(c.dtype == object)
assert_(d.dtype == object)
def test_array_resize_method_system_error(self):
(c) is np.ndarray)
assert_(c.dtype == object)
assert_(d.dtype == object)
def test_array_resize_method_system_error(self):
(c) is np.ndarray)
assert_(type(d) is np.ndarray)
(c) is np.ndarray)
assert_(type(d) is np.ndarray)
(c) is np.ndarray)
assert_(type(d) is np.ndarray)
def test_matrix_multiply_by_1d_vector(self):
(c) is np.ndarray)
assert_(type(d) is np.ndarray)
def test_matrix_multiply_by_1d_vector(self):
(C) is real and the
sin (S) is complex, and the vectors CX and CY are complex.
Arguments
(C) Jussi Pakkanen and used by the Meson project with
(c)
machine = self.environment.machines
if machine.is_windows() or machine.is_cygwin():
(c)
mod_rules.append(code)
for r in mod_rules:
(c)
mod_rules.append(code)
for r in mod_rules:
(c)
np.all(A)
np.all(B)
np.all(A, axis=0)
np.all(B, axis=0)
np.all(A, keepdims=True)
np.all(B, keepdims=True)
np.any(a)
np.any(b)
(c)
np.amax(A)
np.amax(B)
np.amax(A, axis=0)
np.amax(B, axis=0)
np.amax(A, keepdims=True)
np.amax(B, keepdims=True)
np.amin(a)
np.amin(b)
(c)
np.amin(A)
np.amin(B)
np.amin(A, axis=0)
np.amin(B, axis=0)
np.amin(A, keepdims=True)
np.amin(B, keepdims=True)
np.prod(a)
np.prod(b)
(c)
np.any(A)
np.any(B)
np.any(A, axis=0)
np.any(B, axis=0)
np.any(A, keepdims=True)
np.any(B, keepdims=True)
np.cumsum(a)
np.cumsum(b)
(c)
np.around(A)
np.around(B)
np.mean(a)
np.mean(b)
(C)
np.asanyarray(A)
np.asanyarray(B)
np.asanyarray(B, dtype=int)
(C)
np.ascontiguousarray(A)
np.ascontiguousarray(B)
(C)
np.asfortranarray(A)
np.asfortranarray(B)
(C)
np.atleast_1d(A)
np.atleast_1d(C, C)
np.atleast_1d(C, A)
np.atleast_1d(A, A)
(C)
np.atleast_3d(C)
np.vstack([C, C])
np.vstack([C, A])
np.vstack([A, A])
(c)
np.cumprod(A)
np.cumprod(B)
np.ndim(a)
np.ndim(b)
(c)
np.cumsum(A)
np.cumsum(B)
np.ptp(b)
(C)
np.empty_like(B)
np.empty_like(B, dtype=np.int64)
np.full_like(A, i8)
np.full_like(C, i8)
np.full_like(B, i8)
np.full_like(B, i8, dtype=np.int64)
(C)
np.linspace(0, 2)
np.linspace(0.5, [0, 1, 2])
np.linspace([0, 1, 2], 3)
np.linspace(0j, 2)
np.linspace(0, 2, num=10)
np.linspace(0, 2, endpoint=True)
np.linspace(0, 2, retstep=True)
np.linspace(0j, 2j, retstep=True)
np.linspace(0, 2, dtype=bool)
np.linspace([0, 1], [2, 3], axis=Index())
np.logspace(0, 2, base=2)
np.logspace(0, 2, base=2)
np.logspace(0, 2, base=[1j, 2j], num=2)
(c)
np.mean(A)
np.mean(B)
np.mean(A, axis=0)
np.mean(B, axis=0)
np.mean(A, keepdims=True)
np.mean(B, keepdims=True)
np.mean(b, out=d)
np.mean(B, out=d)
np.std(a)
np.std(b)
(c)
np.ndim(A)
np.ndim(B)
np.size(a)
np.size(b)
(C)
np.ones_like(B)
np.ones_like(B, dtype=np.int64)
np.empty_like(A)
(c)
np.prod(A)
np.prod(B)
np.prod(a, dtype=None)
np.prod(A, dtype=None)
np.prod(A, axis=0)
np.prod(B, axis=0)
np.prod(A, keepdims=True)
np.prod(B, keepdims=True)
np.prod(b, out=d)
np.prod(B, out=d)
np.cumprod(a)
np.cumprod(b)
(c)
np.ptp(B)
np.ptp(B, axis=0)
np.ptp(B, keepdims=True)
np.amax(a)
np.amax(b)
(c)
np.ravel(A)
np.ravel(B)
np.nonzero(A)
np.nonzero(B)
(C)
np.require(A)
np.require(B)
np.require(B, dtype=int)
np.require(B, requirements=None)
np.require(B, requirements="E")
np.require(B, requirements=["ENSUREARRAY"])
np.require(B, requirements={"F", "E"})
np.require(B, requirements=["C", "OWNDATA"])
np.require(B, requirements="W")
np.require(B, requirements="A")
(c)
np.shape(A)
np.shape(B)
np.compress([True], a)
np.compress([True], b)
np.compress([True], c)
np.compress([True], A)
np.compress([True], B)
(c)
np.size(A)
np.size(B)
np.around(a)
np.around(b)
(c)
np.squeeze(A)
np.squeeze(B)
np.diagonal(A)
np.diagonal(B)
(c)
np.std(A)
np.std(B)
np.std(A, axis=0)
np.std(B, axis=0)
np.std(A, keepdims=True)
np.std(B, keepdims=True)
np.std(b, out=d)
np.std(B, out=d)
np.var(a)
np.var(b)
(c)
np.sum(A)
np.sum(B)
np.sum(A, axis=0)
np.sum(B, axis=0)
np.all(a)
np.all(b)
(c)
np.transpose(A)
np.transpose(B)
np.partition(a, 0, axis=None)
np.partition(b, 0, axis=None)
np.partition(c, 0, axis=None)
np.partition(A, 0)
np.partition(B, 0)
(c)
np.var(A)
np.var(B)
np.var(A, axis=0)
np.var(B, axis=0)
np.var(A, keepdims=True)
np.var(B, keepdims=True)
np.var(b, out=d)
(C)
np.zeros_like(B)
np.zeros_like(B, dtype=np.int64)
np.ones_like(A)
COPYRIGHT$
Copyright 1999, 2000, 2001 Regents of the University of California.
Copyright 1999, 2000, 2001 Regents of the University of California.
Released for unlimited redistribution.
* Adapted for numpy_core 2005 by Travis Oliphant and (mainly) Paul Dubois.
* Subclassing of the base `ndarray` 2006 by Pierre Gerard-Marchant
(pgmdevlist_AT_gmail_DOT_com)
* Improvements suggested by Reggie Dugard (reggie_AT_merfinllc_DOT_com)
Copyright 1999, 2000, 2001 Regents of the University of California.
Released for unlimited redistribution.
* Adapted for numpy_core 2005 by Travis Oliphant and (mainly) Paul Dubois.
* Subclassing of the base `ndarray` 2006 by Pierre Gerard-Marchant
(pgmdevlist_AT_gmail_DOT_com)
* Improvements suggested by Reggie Dugard (reggie_AT_merfinllc_DOT_com)
Copyright 1999 -- 2011 Pearu Peterson all rights reserved.
Copyright 1999 -- 2011 Pearu Peterson all rights reserved.
Copyright 1999 -- 2011 Pearu Peterson all rights reserved.
Copyright 2001-2005 Pearu Peterson all rights reserved,
Copyright 2001-2005 Pearu Peterson all rights reserved,
Copyright 2001-2005 Pearu Peterson all rights reserved,
Copyright 2002 Pearu Peterson all rights reserved
Copyright 2002 Pearu Peterson all rights reserved,
Copyright 2002 Pearu Peterson all rights reserved,
Copyright 2002 Pearu Peterson all rights reserved,
copyright = '2008-2022, NumPy Developers
# The default replacements for |version| and |release|, also used in various
# other places throughout the built documents.
Copyright 2010-2012, D. E. Shaw Research.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions, and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of D. E. Shaw Research nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2011 -- present NumPy Developers.
Copyright 2011 -- present NumPy Developers.
Copyright 2011 -- present NumPy Developers.
Copyright 2011 -- present NumPy Developers.
https://numpy.org/doc/stable/f2py/index.html\n"""
Copyright 2011 -- present NumPy Developers.
https://numpy.org/doc/stable/f2py/index.html\n"""
Copyright 2012-2016 The Meson development team
Copyright 2012-2017 The Meson development team
Copyright 2012-2019 The Meson development team
Copyright 2012-2020 Meson development team
Copyright 2012-2020 The Meson development team
Copyright 2012-2021 The Meson development team
Copyright 2012-2022 The Meson development team
Copyright 2012-2023 The Meson development team
Copyright 2013-2014 The Meson development team
Copyright 2013-2016 The Meson development team
Copyright 2013-2017 The Meson development team
Copyright 2013-2018 The Meson development team
Copyright 2013-2019 The Meson development team
Copyright 2013-2020 The Meson development team
Copyright 2013-2021 The Meson development team
Copyright 2013-2023 The Meson development team
Copyright 2013 The Meson development team
Copyright 2014-2016 The Meson development team
Copyright 2014-2017 The Meson development team
Copyright 2014-2019 The Meson development team
Copyright 2014-2021 The Meson development team
Copyright 2014 Jussi Pakkanen
Copyright 2014 Melissa O
Copyright 2015-2016 The Meson development team
Copyright 2015-2022 The Meson development team
Copyright 2015 Robert Kern <robert.kern@gmail.com>
Copyright 2015 The Meson development team
Copyright 2016-2017 The Meson development team
Copyright 2016-2018 The Meson development team
Copyright 2016-2021 Matthew Brett, Isuru Fernando, Matti Picus
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# Redistributions of source code must retain the above copyright notice, this
# list of conditions and the following disclaimer.
# Redistributions in binary form must reproduce the above copyright notice, this
# list of conditions and the following disclaimer in the documentation and/or
# other materials provided with the distribution.
Copyright 2016-2021 The Meson development team
Copyright 2016-2022 The Meson development team
Copyright 2016 The Meson development team
copyright = '2017-2018, NumPy Developers
author = 'NumPy Developers'
title = 'NumPy Enhancement Proposals Documentation'
# The version info for the project you're documenting, acts as replacement for
# |version| and |release|, also used in various other places throughout the
# built documents.
Copyright 2017, 2019 The Meson development team
Copyright 2017-2021 The Meson development team
Copyright © 2017 Dylan Baker
Copyright © 2017 Intel Corporation
Copyright 2017 Niklas Claesson
Copyright 2017 The Meson development team
Copyright © 2018 Intel Corporation
Copyright 2018 The Meson development team
Copyright 2019-2022 The meson development team
Copyright 2019 Red Hat, Inc.
Copyright 2019 The meson development team
Copyright 2019 The Meson development team
Copyright © 2020-2021 Intel Corporation
Copyright © 2020-2023 Intel Corporation
Copyright © 2020 Intel Corporation
Copyright 2020 The Meson development team
Copyright © 2021 Intel Corporation
Copyright © 2021 Intel Corporation
#![allow(non_upper_case_globals)]
#![allow(non_camel_case_types)]
#![allow(non_snake_case)]
Copyright © 2021 Intel Corporation
from __future__ import annotations
"""Abstraction for Cython language compilers."""
Copyright © 2021 Intel Corporation
from __future__ import annotations
"""Helper script to copy files at build time.
Copyright © 2021 Intel Corporation
from __future__ import annotations
import collections
import enum
import functools
import os
import itertools
import typing as T
Copyright © 2021 Intel Corporation
from __future__ import annotations
import os
import typing as T
Copyright © 2021 Intel Corporation
from __future__ import annotations
"""Keyword Argument type annotations."""
Copyright © 2021 Intel Corporation
"""Helpers for strict type checking."""
Copyright © 2021 Intel Corporation
import argparse
import shutil
Copyright © 2021 Intel Corporation
#include "header.h"
Copyright © 2021 Intel Corporation
int func(void) {
return 1;
Copyright © 2021 Intel Corporation
# pragma once
Copyright © 2021 Intel Corporation
#pragma once
Copyright © 2021 Intel Corporation
"""Script for running a single project test.
Copyright © 2021 The Meson Developers
Copyright 2021 The Meson development team
Copyright 2021 The Meson development team
from __future__ import annotations
from .common import cmake_is_debug
from .. import mlog
Copyright 2021 The Meson development team
from pathlib import Path
import json
import re
Copyright 2021 The Meson development team
from pathlib import Path
import pickle
Copyright 2021 The Meson development team
import argparse
import json
from pathlib import Path
from copy import deepcopy
Copyright 2021 The Meson development team
import typing as T
Copyright © 2022-2023 Intel Corporation
"""Convert Cargo versions into Meson compatible ones."""
Copyright © 2022-2023 Intel Corporation
from __future__ import annotations
import unittest
import typing as T
Copyright © 2022-2023 Intel Corporation
"""Interpreter for converting Cargo Toml definitions to Meson AST
Copyright © 2022-2023 Intel Corporation
"""Provides helpers for building AST
Copyright © 2022-2023 Intel Corporation
"""Rust CFG parser.
Copyright © 2022-2023 Intel Corporation
"""Type definitions for cargo manifest files."""
Copyright © 2022 Intel Corporation
#include "gen.h"
Copyright © 2022 Intel Corporation
#include <zlib.h>
Copyright 2022 Mark Bolhuis <mark@bolhuis.dev>
Copyright 2022 The Meson development team
Copyright © 2023 Intel Corporation
from __future__ import annotations
import argparse
import os
import typing as T
Copyright © 2023 Intel Corporation
#include <cstddef>
#include <cstdint>
Copyright © 2023 Intel Corporation
#include "lib.hpp"
Copyright © 2023 Intel Corporation
#include <stdio.h>
#include <stdlib.h>
Copyright © 2023 Intel Corporation
use std::ffi::CString;
use std::os::raw::c_char;
Copyright Absoft Corporation.
Copyright Absoft Corporation 1994-1998 mV2; Cray Research, Inc. 1994-1996 CF90
Copyright Absoft Corporation 1994-1998 mV2; Cray Research, Inc. 1994-1996 CF90 (2.x.x.x f36t87) Version 2.3 Wed Apr 19, 2006 13:05:16
# samt5735(8)$ f90 -V -c dummy.f
Copyright Absoft Corporation 1994-1998 mV2; Cray Research, Inc. 1994-1996 CF90 (2.x.x.x f36t87) Version 2.3 Wed Apr 19, 2006 13:05:16
# samt5735(8)$ f90 -V -c dummy.f
Copyright Absoft Corporation 1994-2002
Copyright Absoft Corporation 1994-2002; Absoft Pro FORTRAN Version 8.0
# Note that fink installs g77 as f77, so need to use f90 for detection.
executables = {
'version_cmd' : None, # set by update_executables
'compiler_f77' : ["f77"],
'compiler_fix' : ["f90"],
'compiler_f90' : ["f90"],
'linker_so' : ["<F90>"],
'archiver' : ["ar", "-cr"],
'ranlib' : ["ranlib"]
Copyright Absoft Corporation 1994-2002; Absoft Pro FORTRAN Version 8.0
# Note that fink installs g77 as f77, so need to use f90 for detection.
executables = {
'version_cmd' : None, # set by update_executables
'compiler_f77' : ["f77"],
'compiler_fix' : ["f90"],
'compiler_f90' : ["f90"],
'linker_so' : ["<F90>"],
'archiver' : ["ar", "-cr"],
'ranlib' : ["ranlib"]
Copyright Absoft Corporation.
r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
# on windows: f90 -V -c dummy.f
Copyright Absoft Corporation.
r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
# on windows: f90 -V -c dummy.f
COPYRIGHT$
Additional copyrights may follow
$HEADER$
COPYRIGHT$
Additional copyrights may follow
$HEADER$
COPYRIGHT$
Additional copyrights may follow
$HEADER$
Copyright (c) 1992-2013 The University of Tennessee and The University
of Tennessee Research Foundation. All rights
reserved.
Copyright (c) 1992-2013 The University of Tennessee and The University
of Tennessee Research Foundation. All rights
reserved.
Copyright (c) 1992-2013 The University of Tennessee and The University
of Tennessee Research Foundation. All rights
reserved.
Copyright (c) 1992-2013 The University of Tennessee and The University
of Tennessee Research Foundation. All rights
reserved.
Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunPro, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
Copyright (c) 1995, 1996, 1997 Jim Hugunin, hugunin@mit.edu
Modified for numpy in 2005
Copyright (c) 1995, 1996, 1997 Jim Hugunin, hugunin@mit.edu
with contributions from many Numeric Python developers 1995-2004
Copyright (c) 1995, 1996, 1997 Jim Hugunin, hugunin@mit.edu
*
* with inspiration and code from
* Numarray
* Space Science Telescope Institute
* J. Todd Miller
* Perry Greenfield
* Rick White
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. The names of its contributors may not be used to endorse or promote
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. The names of its contributors may not be used to endorse or promote
Copyright (c) 2000-2013 The University of California Berkeley. All rights reserved.
Copyright (c) 2000-2013 The University of California Berkeley. All
rights reserved.
Copyright (c) 2000-2013 The University of California Berkeley. All
rights reserved.
Copyright (c) 2000-2013 The University of California Berkeley. All
rights reserved.
Copyright (c) 2000-2013 The University of California Berkeley. All
rights reserved.
Copyright (C) 2002-2017 Free Software Foundation, Inc.
Copyright (C) 2002-2017 Free Software Foundation, Inc.
Copyright (C) 2002-2017 Free Software Foundation, Inc.
Copyright (c) 2003-2005, Jean-Sebastien Roy (js@jeannot.org)
Copyright (c) 2003-2005, Jean-Sebastien Roy (js@jeannot.org)
*
* The rk_random and rk_seed functions algorithms and the original design of
* the Mersenne Twister RNG:
*
Copyright (c) 2003-2005, Jean-Sebastien Roy (js@jeannot.org)
The rk_random and rk_seed functions algorithms and the original design of
the Mersenne Twister RNG:
Copyright (C) 2004, 2006 The Linux Foundation and its contributors.
Copyright (C) 2004-2018 Max-Planck-Society
* \author Martin Reinecke
*/
#define NPY_NO_DEPRECATED_API NPY_API_VERSION
Copyright (c) 2005-2015, NumPy Developers.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* * Neither the name of the NumPy Developers nor the names of any
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
Copyright (c) 2005-2017, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2005-2018 NVIDIA Corporation
# Built on Sat_Aug_25_21:08:01_CDT_2018
# Cuda compilation tools, release 10.0, V10.0.130
#
# search_version() first finds the "10.0" after "release",
# rather than the more precise "10.0.130" after "V".
# The patch version number is occasionally important; For
# instance, on Linux,
# - CUDA Toolkit 8.0.44 requires NVIDIA Driver 367.48
# - CUDA Toolkit 8.0.61 requires NVIDIA Driver 375.26
# Luckily, the "V" also makes it very simple to extract
# the full version:
Copyright (c) 2005-2018 NVIDIA Corporation
# Built on Sun_Sep_30_21:09:22_CDT_2018
# Cuda compilation tools, release 10.0, V10.0.166
# we need the most verbose version output. Luckily starting with V
return out.strip().rsplit('V', maxsplit=1)[-1]
def get_accepts_rsp(self) -> bool:
Copyright (c) 2005-2021, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2005-2023, NumPy Developers.
Copyright (c) 2005-2023, NumPy Developers.
All rights reserved.
Copyright (c) 2005-2023, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2005-2023, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
reserved.
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
reserved.
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
reserved.
Copyright (c) 2006-2013 The University of Colorado Denver. All rights reserved.
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
reserved.
Copyright (c) 2006, University of Georgia and Pierre G.F. Gerard-Marchant
Copyright (c) 2006, University of Georgia and Pierre G.F. Gerard-Marchant
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the University of Georgia nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
Copyright (c) 2006, University of Georgia and Pierre G.F. Gerard-Marchant
* All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the University of Georgia nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
Copyright (c) 2007 Cybozu Labs, Inc.
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (c) 2008 Ian Bicking and Contributors
Copyright (c) 2009-2017 The MathJax Consortium
Copyright (c) 2009-2019: Jeff Bezanson, Stefan Karpinski, Viral B. Shah,
and other contributors:
Copyright (C) 2009 Free Software Foundation, Inc.
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (c) 2010-2011 by Mark Wiebe (mwwiebe@gmail.com)
* The University of British Columbia
*
Copyright (c) 2010-2017 The MathJax Consortium
Copyright (c) 2010-2017 The MathJax Consortium
*
* Part of the MathJax library.
* See http://www.mathjax.org for details.
Copyright (C) 2010-2019 Free Software Foundation, Inc.
Copyright (C) 2010-2019 Free Software Foundation, Inc.
Copyright (C) 2010-2019 Free Software Foundation, Inc.
Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
Copyright (C) 2010 - 2019 ridiculous_fish, <libdivide@ridiculousfish.com>
Copyright (c) 2010 by Mark Wiebe (mwwiebe@gmail.com)
Copyright (C) 2010 The Android Open Source Project
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
Copyright (c) 2011-2014, The OpenBLAS Project
Copyright (c) 2011-2014, The OpenBLAS Project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
3. Neither the name of the OpenBLAS project nor the names of
its contributors may be used to endorse or promote products
Copyright (c) 2011-2014, The OpenBLAS Project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
3. Neither the name of the OpenBLAS project nor the names of
its contributors may be used to endorse or promote products
Copyright (c) 2011-2015 The MathJax Consortium
Copyright (c) 2011-2017 The MathJax Consortium
Copyright (c) 2011 by Enthought, Inc.
Copyright (c) 2011 by Mark Wiebe (mwwiebe@gmail.com)
Copyright (c) 2011 Enthought, Inc
Copyright (c) 2012 Google Inc.
Copyright (c) 2013-2017 The MathJax Consortium
Copyright (c) 2013 Gabriele Svelto <gabriele.svelto@gmail.com>
#
# Copying and distribution of this file, with or without modification, are
# permitted in any medium without royalty provided the copyright notice
# and this notice are preserved. This file is offered as-is, without any
# warranty.
Copyright (c) 2014-2017 The MathJax Consortium
Copyright (c) 2014 Mathjax Consortium
Copyright (c) 2014 Ryan Juckett
Copyright (c) 2015-2017 Martin Hensel
Copyright (c) 2015-2017 The MathJax Consortium
Copyright (c) 2015 Pauli Virtanen
Copyright (c) 2016-2017 The MathJax Consortium
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Copyright (C) 2016 - 2019 Kim Walisch, <kim.walisch@gmail.com>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Copyright (c) 2017 by Contributors
* \file dlpack.h
* \brief The common header of DLPack.
*/
#ifndef DLPACK_DLPACK_H_
#define DLPACK_DLPACK_H_
Copyright (c) 2018 Melissa E. O
Copyright (c) 2019 Kevin Sheppard. All rights reserved.
Copyright (c) 2019 Kevin Sheppard. All rights reserved.
Developed by: Kevin Sheppard (<kevin.sheppard@economics.ox.ac.uk>,
<kevin.k.sheppard@gmail.com>)
[http://www.kevinsheppard.com](http://www.kevinsheppard.com)
Copyright (c) 2019 Kevin Sheppard. All rights reserved.
Developed by: Kevin Sheppard (<kevin.sheppard@economics.ox.ac.uk>,
<kevin.k.sheppard@gmail.com>)
[http://www.kevinsheppard.com](http://www.kevinsheppard.com)
Copyright (c) 2019 Kevin Sheppard. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2019 Kevin Sheppard. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2021--2022, Scientific Python project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (C) 2021 Serge Sans Paille
Copyright (c) 2022, Intel. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (C) 2022 Intel Corporation
Copyright (C) 2023 Intel Corporation
Copyright (c) 2023, NumPy Developers.
# All rights reserved.
import re
from typing import (
Dict, Set, Tuple, List, Callable, Optional,
Union, Any, Iterable, cast, TYPE_CHECKING
)
from dataclasses import dataclass, field
from ...mesonlib import File, MesonException
from ...interpreter.type_checking import NoneType
from ...interpreterbase.decorators import (
noKwargs, noPosargs, KwargInfo, typed_kwargs, typed_pos_args,
ContainerTypeInfo
Copyright (c) 2023, NumPy Developers.
from typing import TYPE_CHECKING
Copyright (c) 2023, NumPy Developers.
import hashlib
from typing import Tuple, List, Union, Any, TYPE_CHECKING
from ...mesonlib import MesonException, MachineChoice
if TYPE_CHECKING:
Copyright (c) 2023, NumPy Developers.
import os
from typing import (
Dict, Set, Tuple, List, Callable, Optional,
Union, Any, cast, TYPE_CHECKING
)
from ... import mlog, build
from ...compilers import Compiler
from ...mesonlib import File, MesonException
from ...interpreter.type_checking import NoneType
from ...interpreterbase.decorators import (
noKwargs, KwargInfo, typed_kwargs, typed_pos_args,
ContainerTypeInfo, permittedKwargs
Copyright (c) 2023, NumPy Developers.
import re
import contextlib
from mesonbuild.interpreter import Interpreter
from mesonbuild.build import Build
from mesonbuild.mparser import FunctionNode, ArgumentNode, Token
from mesonbuild.modules import ModuleState
from mesonbuild.modules.features import Module
from mesonbuild.compilers import Compiler, CompileResult
from mesonbuild.mesonlib import MachineChoice
from mesonbuild.envconfig import MachineInfo
Copyright (c) Donald Stufft and individual contributors.
Copyright (c) Donald Stufft and individual contributors.
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
Copyright (c) Donald Stufft and individual contributors.
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
Copyright (c)" in text and re.search(
r"This binary distribution of \w+ also bundles the following software",
text,
)
return ok
copyright: 'Copyright
copyright: false
...
copyright = fs.read(
cdata.set('COPYRIGHT', copyright)
if build_machine.system() == 'linux'
os_release = fs.read('/etc/os-release')
cdata.set('LINUX_BUILDER', os_release)
endif
configure_file(...)
```
Copy right of H to scratch (the first KZS
. columns get multiplied by zero) ====
*/
Copy right of Z to left of scratch (first
. KZS columns get multiplied by zero) ====
*/
copyright-sign"
copyright sign","short":"copyright"
copyright sign",short:"copyright"
Copy right singular vectors of A from A to VT
clacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
Copy right singular vectors of A from A to VT
dlacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
Copy right singular vectors of A from A to VT
slacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
Copy right singular vectors of A from A to VT
zlacpy_("F", m, n, &a[a_offset], lda, &vt[vt_offset], ldvt);
Copy right singular vectors of A from WORK(IVT) to A
dlacpy_("F", m, n, &work[ivt], &ldwkvt, &a[a_offset], lda);
} else {
Copy right singular vectors of A from WORK(IVT) to A
slacpy_("F", m, n, &work[ivt], &ldwkvt, &a[a_offset], lda);
} else {
(C) or column-major (Fortran) order. The function
* array_from_pyobj is very flexible about its Python object argument
* that can be any number, list, tuple, or array.
*
* array_from_pyobj is used in f2py generated Python extension
* modules.
(C) or column-major (Fortran) order. The function
* array_from_pyobj is very flexible about its Python object argument
* that can be any number, list, tuple, or array.
*
* array_from_pyobj is used in f2py generated Python extension
* modules.
(c)
powers = np.array(
[1, 1, 1, 1, 1],
[16, -8, 4, -2, 1],
[81, 27, 9, 3, 1]])
# Check default value of N:
(c)
powers = np.array(
[1, 1, 1, 1, 1],
[16, -8, 4, -2, 1],
[81, 27, 9, 3, 1]])
# Check default value of N:
(C)
#pragma once
(c)
prd = zs
for i in range(2, power + 1):
(c)
prd = zs
for i in range(2, power + 1):
(C) Preprocessor flag handling
Meson previously stored `CPPFLAGS` and per-language compilation flags
separately. (That latter would come from `CFLAGS`, `CXXFLAGS`, etc.,
along with `<lang>_args` options whether specified no the command-line
interface (`-D..`), `meson.build` (`default_options`), or cross file
(`[properties]`).) This was mostly unobservable, except for certain
preprocessor-only checks like `check_header` would only use the
preprocessor flags, leading to confusion if some `-isystem` was in
`CFLAGS` but not `CPPFLAGS`. Now, they are lumped together, and
`CPPFLAGS`, for the languages which are deemed to care to about, is
just another source of compilation flags along with the others already
listed.
(c)
@pytest.mark.skipif(IS_PYPY and sys.implementation.version <= (7, 3, 8),
reason="PyPy bug in error formatting")
def test_default_float_converter_exception(self):
"""
(c)
@pytest.mark.skipif(IS_PYPY and sys.implementation.version <= (7, 3, 8),
reason="PyPy bug in error formatting")
def test_default_float_converter_exception(self):
"""
(c)
quoted_cmds.append(
cmdstr = '"' + ' && '.join(quoted_cmds) + '"'
gen_dict.add_item('shellScript', cmdstr)
gen_dict.add_item('showEnvVarsInLog', 0)
def generate_pbx_sources_build_phase(self, objects_dict):
(c)
res = self.advance(i)
self.advance(len(c))
return res
@property
def next(self):
(c)
res = self.advance(i)
self.advance(len(c))
return res
@property
def next(self):
(c)
result
return result
def determine_worker_count() -> int:
(c)
result
return result
def list_projinfo_from_source(intr: IntrospectionInterpreter) -> T.Dict[str, T.Union[str, T.List[T.Dict[str, str]]]]:
(c)
return config_list
def _get_configuration_from_setup_py(self, setup_py,
subpackage_name,
subpackage_path,
parent_name,
caller_level = 1):
(c)
return config_list
def _get_configuration_from_setup_py(self, setup_py,
subpackage_name,
subpackage_path,
parent_name,
caller_level = 1):
(c)
return deps
def get_transitive_build_target_deps(self) -> T.Set[T.Union[BuildTarget, 'CustomTarget']]:
'''
(c)
return genlists
def get_generated_sources(self) -> T.List[GeneratedList]:
(c)` returns
* NotImplemented (so `c` knows more). You may notice that the result
* `res = a.__common_dtype__(b)` is not important. We could try to use it
* to remove the whole branch if `res is c` or by checking if
* `c.__common_dtype(res) is c`.
* Right now, we only clear initial elements in the most simple case where
* `a.__common_dtype(b) is a` (and thus `b` cannot alter the end-result).
* Clearing means, we do not have to worry about them later.
*
* There is one further subtlety. If we have an abstract DType and a
* non-abstract one, we "prioritize" the non-abstract DType here.
* In this sense "prioritizing" means that we use:
(c) s4
(c) s4
real*4 intent(out) :: t4
real*4 intent(c) :: value
end
subroutine s8(t8,value)
(c) s4
real*4 intent(out) :: t4
real*4 intent(c) :: value
end
subroutine s8(t8,value)
(c) s8
(c) s8
real*8 intent(out) :: t8
real*8 intent(c) :: value
end
end interface
end python module c_ext_return_real
"""
(c) s8
real*8 intent(out) :: t8
real*8 intent(c) :: value
end
end interface
end python module c_ext_return_real
"""
(c)
self.name = rule
(c) # should return array(
array([0., 1., 1., 1.])
>>> P.polyint(c,3) # should return array([0, 0, 0, 1/6, 1/12, 1/20])
array([ 0. , 0. , 0. , 0.16666667, 0.08333333, # may vary
0.05 ])
>>> P.polyint(c,k=3) # should return array([3, 1, 1, 1])
array([3., 1., 1., 1.])
>>> P.polyint(c,lbnd=-2) # should return array([6, 1, 1, 1])
array([6., 1., 1., 1.])
>>> P.polyint(c,scl=-2) # should return array([0, -2, -2, -2])
array([ 0., -2., -2., -2.])
(c) # should return array(
array([0., 1., 1., 1.])
>>> P.polyint(c,3) # should return array([0, 0, 0, 1/6, 1/12, 1/20])
array([ 0. , 0. , 0. , 0.16666667, 0.08333333, # may vary
0.05 ])
>>> P.polyint(c,k=3) # should return array([3, 1, 1, 1])
array([3., 1., 1., 1.])
>>> P.polyint(c,lbnd=-2) # should return array([6, 1, 1, 1])
array([6., 1., 1., 1.])
>>> P.polyint(c,scl=-2) # should return array([0, -2, -2, -2])
array([ 0., -2., -2., -2.])
(C) < SMINI, use SMINI
if (cmax < smini) {
/* Computing MAX */
d__3 = (d__1 = b[b_dim1 + 1], abs(d__1)), d__4 = (d__2 = b[
b_dim1 + 2], abs(d__2));
bnorm = max(d__3,d__4);
if (smini < 1. && bnorm > 1.) {
if (bnorm > bignum * smini) {
*scale = 1. / bnorm;
(C) < SMINI, use SMINI
if (cmax < smini) {
/* Computing MAX */
d__5 = (d__1 = b[b_dim1 + 1], abs(d__1)) + (d__2 = b[(b_dim1
<< 1) + 1], abs(d__2)), d__6 = (d__3 = b[b_dim1 + 2],
abs(d__3)) + (d__4 = b[(b_dim1 << 1) + 2], abs(d__4));
bnorm = max(d__5,d__6);
if (smini < 1. && bnorm > 1.) {
if (bnorm > bignum * smini) {
*scale = 1. / bnorm;
(C) < SMINI, use SMINI
if (cmax < smini) {
/* Computing MAX */
r__3 = (r__1 = b[b_dim1 + 1], dabs(r__1)), r__4 = (r__2 = b[
b_dim1 + 2], dabs(r__2));
bnorm = dmax(r__3,r__4);
if (smini < 1.f && bnorm > 1.f) {
if (bnorm > bignum * smini) {
*scale = 1.f / bnorm;
(C) < SMINI, use SMINI
if (cmax < smini) {
/* Computing MAX */
r__5 = (r__1 = b[b_dim1 + 1], dabs(r__1)) + (r__2 = b[(b_dim1
<< 1) + 1], dabs(r__2)), r__6 = (r__3 = b[b_dim1 + 2],
dabs(r__3)) + (r__4 = b[(b_dim1 << 1) + 2], dabs(
r__4));
bnorm = dmax(r__5,r__6);
if (smini < 1.f && bnorm > 1.f) {
if (bnorm > bignum * smini) {
*scale = 1.f / bnorm;
(c)
super().__init__(description, choices, yielding, deprecated)
self.set_value(default_value)
def validate_value(self, value: T.Any) -> int:
(c) The contribution was provided directly to me by some other
(C)
The data is in a single, C-style contiguous segment.
F_CONTIGUOUS (F)
The data is in a single, Fortran-style contiguous segment.
OWNDATA (O)
The array owns the memory it uses or borrows it from another object.
WRITEABLE (W)
The data area can be written to. Setting this to False locks
the data, making it read-only. A view (slice, etc.) inherits WRITEABLE
from its base array at creation time, but a view of a writeable
array may be subsequently locked while the base array remains writeable.
(The opposite is not true, in that a view of a locked array may not
be made writeable. However, currently, locking a base object does not
lock any views that already reference it, so under that circumstance it
is possible to alter the contents of a locked array via a previously
created writeable view onto it.) Attempting to change a non-writeable
array raises a RuntimeError exception.
ALIGNED (A)
The data and all elements are aligned appropriately for the hardware.
WRITEBACKIFCOPY (X)
This array is a copy of some other array. The C-API function
PyArray_ResolveWritebackIfCopy must be called before deallocating
to the base array will be updated with the contents of this array.
FNC
F_CONTIGUOUS and not C_CONTIGUOUS.
FORC
F_CONTIGUOUS or C_CONTIGUOUS (one-segment test).
BEHAVED (B)
ALIGNED and WRITEABLE.
CARRAY (CA)
BEHAVED and C_CONTIGUOUS.
FARRAY (FA)
BEHAVED and F_CONTIGUOUS and not C_CONTIGUOUS.
Notes
(C)
The data is in a single, C-style contiguous segment.
F_CONTIGUOUS (F)
The data is in a single, Fortran-style contiguous segment.
OWNDATA (O)
The array owns the memory it uses or borrows it from another object.
WRITEABLE (W)
The data area can be written to. Setting this to False locks
the data, making it read-only. A view (slice, etc.) inherits WRITEABLE
from its base array at creation time, but a view of a writeable
array may be subsequently locked while the base array remains writeable.
(The opposite is not true, in that a view of a locked array may not
be made writeable. However, currently, locking a base object does not
lock any views that already reference it, so under that circumstance it
is possible to alter the contents of a locked array via a previously
created writeable view onto it.) Attempting to change a non-writeable
array raises a RuntimeError exception.
ALIGNED (A)
The data and all elements are aligned appropriately for the hardware.
WRITEBACKIFCOPY (X)
This array is a copy of some other array. The C-API function
PyArray_ResolveWritebackIfCopy must be called before deallocating
to the base array will be updated with the contents of this array.
FNC
F_CONTIGUOUS and not C_CONTIGUOUS.
FORC
F_CONTIGUOUS or C_CONTIGUOUS (one-segment test).
BEHAVED (B)
ALIGNED and WRITEABLE.
CARRAY (CA)
BEHAVED and C_CONTIGUOUS.
FARRAY (FA)
BEHAVED and F_CONTIGUOUS and not C_CONTIGUOUS.
Notes
(c) > tol)
if len(ind) == 0:
(c) > tol)
if len(ind) == 0:
(C)
use, intrinsic :: iso_c_binding, only: dp=>c_double
implicit none
real(dp) :: r, fortran
(C)
want = np.array(
assert_equal(have, want)
def test_for_equal_names(self):
(C)
want = np.array(
assert_equal(have, want)
def test_for_equal_names(self):
(c)
where the points
`a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
a grid with `x` in the first dimension, `y` in the second, and `z` in
the third.
The parameters `x`, `y`, and `z` are converted to arrays only if they
are tuples or a lists, otherwise they are treated as a scalars. In
either case, either `x`, `y`, and `z` or their elements must support
multiplication and addition both with themselves and with the elements
of `c`.
(c)
where the points
`a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
a grid with `x` in the first dimension, `y` in the second, and `z` in
the third.
The parameters `x`, `y`, and `z` are converted to arrays only if they
are tuples or a lists, otherwise they are treated as a scalars. In
either case, either `x`, `y`, and `z` or their elements must support
multiplication and addition both with themselves and with the elements
of `c`.
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = lagval(x, c)
df = lagval(x, lagder(c))
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = lagval(x, c)
df = lagval(x, lagder(c))
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = legval(x, c)
df = legval(x, legder(c))
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = legval(x, c)
df = legval(x, legder(c))
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = _normed_hermite_e_n(x, ideg)
df = _normed_hermite_e_n(x, ideg - 1) * np.sqrt(ideg)
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = _normed_hermite_e_n(x, ideg)
df = _normed_hermite_e_n(x, ideg - 1) * np.sqrt(ideg)
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = _normed_hermite_n(x, ideg)
df = _normed_hermite_n(x, ideg - 1) * np.sqrt(2*ideg)
x -= dy/df
(c)
x = la.eigvalsh(m)
# improve roots by one application of Newton
dy = _normed_hermite_n(x, ideg)
df = _normed_hermite_n(x, ideg - 1) * np.sqrt(2*ideg)
x -= dy/df
N/A
nvidia-cufft-cu12
11.0.2.54
Copyright 2005-2014 NVIDIA Corporation. All rights reserved.
Copyright 2005-2014 NVIDIA Corporation. All rights reserved.
Copyright 2005-2021 NVIDIA Corporation. All rights reserved.
Copyright 2005-2021 NVIDIA Corporation. All rights reserved.
Copyright 2013,2014 NVIDIA Corporation. All rights reserved.
Copyright 2013,2014 NVIDIA Corporation. All rights reserved.
nvidia-curand-cu12
10.3.2.106
Copyright 2010-2011, D. E. Shaw Research.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions, and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of D. E. Shaw Research nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2010-2011, D. E. Shaw Research.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions, and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions, and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of D. E. Shaw Research nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2010-2012 NVIDIA Corporation. All rights reserved.
Copyright 2010-2012 NVIDIA Corporation. All rights reserved.
Copyright 2010-2014 NVIDIA Corporation. All rights reserved.
Copyright 2010-2014 NVIDIA Corporation. All rights reserved.
Copyright 2010-2018 NVIDIA Corporation. All rights reserved.
Copyright 2010-2018 NVIDIA Corporation. All rights reserved.
Copyright (c) 2009, 2010 Mutsuo Saito, Makoto Matsumoto and Hiroshima
* University. All rights reserved.
Copyright (c) 2009, 2010 Mutsuo Saito, Makoto Matsumoto and Hiroshima
* University. All rights reserved.
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
* University and University of Tokyo. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Hiroshima University nor the names of
* its contributors may be used to endorse or promote products
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
* University and University of Tokyo. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Hiroshima University nor the names of
* its contributors may be used to endorse or promote products
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
* University and University of Tokyo. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Hiroshima University nor the names of
* its contributors may be used to endorse or promote products
Copyright (c) 2011 Mutsuo Saito, Makoto Matsumoto, Hiroshima
* University and University of Tokyo. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the Hiroshima University nor the names of
* its contributors may be used to endorse or promote products
oauthlib/oauthlib
3.3.1
(C) are broken into
two parts as they pass through the user-agent.
Figure 3: Authorization Code Flow
(C) Assuming the resource owner grants access, the authorization
server redirects the user-agent back to the client using the
redirection URI provided earlier (in the request or during
client registration). The redirection URI includes an
authorization code and any local state provided by the client
earlier.
(D) The client requests an access token from the authorization
server's token endpoint by including the authorization code
received in the previous step. When making the request, the
client authenticates with the authorization server. The client
includes the redirection URI used to obtain the authorization
code for verification.
(C) Assuming the resource owner grants access, the authorization
server redirects the user-agent back to the client using the
redirection URI provided earlier. The redirection URI includes
the access token in the URI fragment.
(D) The user-agent follows the redirection instructions by making a
request to the web-hosted client resource (which does not
include the fragment per [RFC2616]). The user-agent retains the
fragment information locally.
copyright: (c) The OAuthlib Community
Copyright (c) The OAuthlib Community
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
(C) The authorization server authenticates the client and validates
the resource owner credentials, and if valid, issues an access
token.
.. _`Resource Owner Password Credentials Grant`: https://tools.ietf.org/html/rfc6749#section-4.3
opt-einsum
3.4.0
Copyright (c) 2014 Daniel Smith
Copyright (c) 2018 Uber Technologies
N/A
PillowPython
11.3.0
© Bitstream (see below). DejaVu changes are in public domain. Explanation of copyright is on Gnome page on Bitstream Vera fonts. Glyphs imported from Arev fonts are
(C) 1995-2017 Jean-loup Gailly and Mark Adler
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
(C) 1995-2024 Jean-loup Gailly and Mark Adler
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
(c) (1) of DFARs. Notwithstanding the
(c) (2). If you are acquiring the software
* on behalf of the Department of Defense, the software shall be
* classified as "Commercial Computer Software" and the
* Government shall have only "Restricted Rights" as defined in
(c)
# Assert
assert mystdout.getvalue() == "61 62 63 \n"
(c)
# Assert
assert ret == 97
(C) Copyright ..." is shown in the HTML footer. Default is True.
(c)
def dump(c: Sequence
""".. deprecated:: 10.2.0"""
deprecate("IptcImagePlugin.dump", 12)
for i in c:
(c) for c in "
def __bytes__(self) -> bytes:
(c) for c in "
def __bytes__(self) -> bytes:
(c) is the Copyright property of
CompuServe Incorporated. GIF(sm) is a Service Mark property of
CompuServe Incorporated."
(c) is the Copyright property of
CompuServe Incorporated. GIF(sm) is a Service Mark property of
CompuServe Incorporated."
Copyright = 0x8298
ExposureTime = 0x829A
FNumber = 0x829D
IPTCNAA = 0x83BB
ImageResources = 0x8649
ExifOffset = 0x8769
InterColorProfile = 0x8773
ExposureProgram = 0x8822
SpectralSensitivity = 0x8824
GPSInfo = 0x8825
ISOSpeedRatings = 0x8827
OECF = 0x8828
Interlace = 0x8829
TimeZoneOffset = 0x882A
SelfTimerMode = 0x882B
SensitivityType = 0x8830
StandardOutputSensitivity = 0x8831
RecommendedExposureIndex = 0x8832
ISOSpeed = 0x8833
ISOSpeedLatitudeyyy = 0x8834
ISOSpeedLatitudezzz = 0x8835
ExifVersion = 0x9000
DateTimeOriginal = 0x9003
DateTimeDigitized = 0x9004
OffsetTime = 0x9010
OffsetTimeOriginal = 0x9011
OffsetTimeDigitized = 0x9012
ComponentsConfiguration = 0x9101
CompressedBitsPerPixel = 0x9102
ShutterSpeedValue = 0x9201
ApertureValue = 0x9202
BrightnessValue = 0x9203
ExposureBiasValue = 0x9204
MaxApertureValue = 0x9205
SubjectDistance = 0x9206
MeteringMode = 0x9207
LightSource = 0x9208
Flash = 0x9209
FocalLength = 0x920A
Noise = 0x920D
ImageNumber = 0x9211
SecurityClassification = 0x9212
ImageHistory = 0x9213
TIFFEPStandardID = 0x9216
MakerNote = 0x927C
UserComment = 0x9286
SubsecTime = 0x9290
SubsecTimeOriginal = 0x9291
SubsecTimeDigitized = 0x9292
AmbientTemperature = 0x9400
Humidity = 0x9401
Pressure = 0x9402
WaterDepth = 0x9403
Acceleration = 0x9404
CameraElevationAngle = 0x9405
XPTitle = 0x9C9B
XPComment = 0x9C9C
XPAuthor = 0x9C9D
XPKeywords = 0x9C9E
XPSubject = 0x9C9F
FlashPixVersion = 0xA000
ColorSpace = 0xA001
ExifImageWidth = 0xA002
ExifImageHeight = 0xA003
RelatedSoundFile = 0xA004
ExifInteroperabilityOffset = 0xA005
FlashEnergy = 0xA20B
SpatialFrequencyResponse = 0xA20C
FocalPlaneXResolution = 0xA20E
FocalPlaneYResolution = 0xA20F
FocalPlaneResolutionUnit = 0xA210
SubjectLocation = 0xA214
ExposureIndex = 0xA215
SensingMethod = 0xA217
FileSource = 0xA300
SceneType = 0xA301
CFAPattern = 0xA302
CustomRendered = 0xA401
ExposureMode = 0xA402
WhiteBalance = 0xA403
DigitalZoomRatio = 0xA404
FocalLengthIn35mmFilm = 0xA405
SceneCaptureType = 0xA406
GainControl = 0xA407
Contrast = 0xA408
Saturation = 0xA409
Sharpness = 0xA40A
DeviceSettingDescription = 0xA40B
SubjectDistanceRange = 0xA40C
ImageUniqueID = 0xA420
CameraOwnerName = 0xA430
BodySerialNumber = 0xA431
LensSpecification = 0xA432
LensMake = 0xA433
LensModel = 0xA434
LensSerialNumber = 0xA435
CompositeImage = 0xA460
CompositeImageCount = 0xA461
CompositeImageExposureTimes = 0xA462
Gamma = 0xA500
PrintImageMatching = 0xC4A5
DNGVersion = 0xC612
DNGBackwardVersion = 0xC613
UniqueCameraModel = 0xC614
LocalizedCameraModel = 0xC615
CFAPlaneColor = 0xC616
CFALayout = 0xC617
LinearizationTable = 0xC618
BlackLevelRepeatDim = 0xC619
BlackLevel = 0xC61A
BlackLevelDeltaH = 0xC61B
BlackLevelDeltaV = 0xC61C
WhiteLevel = 0xC61D
DefaultScale = 0xC61E
DefaultCropOrigin = 0xC61F
DefaultCropSize = 0xC620
ColorMatrix1 = 0xC621
ColorMatrix2 = 0xC622
CameraCalibration1 = 0xC623
CameraCalibration2 = 0xC624
ReductionMatrix1 = 0xC625
ReductionMatrix2 = 0xC626
AnalogBalance = 0xC627
AsShotNeutral = 0xC628
AsShotWhiteXY = 0xC629
BaselineExposure = 0xC62A
BaselineNoise = 0xC62B
BaselineSharpness = 0xC62C
BayerGreenSplit = 0xC62D
LinearResponseLimit = 0xC62E
CameraSerialNumber = 0xC62F
LensInfo = 0xC630
ChromaBlurRadius = 0xC631
AntiAliasStrength = 0xC632
ShadowScale = 0xC633
DNGPrivateData = 0xC634
MakerNoteSafety = 0xC635
CalibrationIlluminant1 = 0xC65A
CalibrationIlluminant2 = 0xC65B
BestQualityScale = 0xC65C
RawDataUniqueID = 0xC65D
OriginalRawFileName = 0xC68B
OriginalRawFileData = 0xC68C
ActiveArea = 0xC68D
MaskedAreas = 0xC68E
AsShotICCProfile = 0xC68F
AsShotPreProfileMatrix = 0xC690
CurrentICCProfile = 0xC691
CurrentPreProfileMatrix = 0xC692
ColorimetricReference = 0xC6BF
CameraCalibrationSignature = 0xC6F3
ProfileCalibrationSignature = 0xC6F4
AsShotProfileName = 0xC6F6
NoiseReductionApplied = 0xC6F7
ProfileName = 0xC6F8
ProfileHueSatMapDims = 0xC6F9
ProfileHueSatMapData1 = 0xC6FA
ProfileHueSatMapData2 = 0xC6FB
ProfileToneCurve = 0xC6FC
ProfileEmbedPolicy = 0xC6FD
Copyright = 0x8298
ExposureTime = 0x829A
FNumber = 0x829D
IPTCNAA = 0x83BB
ImageResources = 0x8649
ExifOffset = 0x8769
InterColorProfile = 0x8773
ExposureProgram = 0x8822
SpectralSensitivity = 0x8824
GPSInfo = 0x8825
ISOSpeedRatings = 0x8827
OECF = 0x8828
Interlace = 0x8829
TimeZoneOffset = 0x882A
SelfTimerMode = 0x882B
SensitivityType = 0x8830
StandardOutputSensitivity = 0x8831
RecommendedExposureIndex = 0x8832
ISOSpeed = 0x8833
ISOSpeedLatitudeyyy = 0x8834
ISOSpeedLatitudezzz = 0x8835
ExifVersion = 0x9000
DateTimeOriginal = 0x9003
DateTimeDigitized = 0x9004
OffsetTime = 0x9010
OffsetTimeOriginal = 0x9011
OffsetTimeDigitized = 0x9012
ComponentsConfiguration = 0x9101
CompressedBitsPerPixel = 0x9102
ShutterSpeedValue = 0x9201
ApertureValue = 0x9202
BrightnessValue = 0x9203
ExposureBiasValue = 0x9204
MaxApertureValue = 0x9205
SubjectDistance = 0x9206
MeteringMode = 0x9207
LightSource = 0x9208
Flash = 0x9209
FocalLength = 0x920A
Noise = 0x920D
ImageNumber = 0x9211
SecurityClassification = 0x9212
ImageHistory = 0x9213
TIFFEPStandardID = 0x9216
MakerNote = 0x927C
UserComment = 0x9286
SubsecTime = 0x9290
SubsecTimeOriginal = 0x9291
SubsecTimeDigitized = 0x9292
AmbientTemperature = 0x9400
Humidity = 0x9401
Pressure = 0x9402
WaterDepth = 0x9403
Acceleration = 0x9404
CameraElevationAngle = 0x9405
XPTitle = 0x9C9B
XPComment = 0x9C9C
XPAuthor = 0x9C9D
XPKeywords = 0x9C9E
XPSubject = 0x9C9F
FlashPixVersion = 0xA000
ColorSpace = 0xA001
ExifImageWidth = 0xA002
ExifImageHeight = 0xA003
RelatedSoundFile = 0xA004
ExifInteroperabilityOffset = 0xA005
FlashEnergy = 0xA20B
SpatialFrequencyResponse = 0xA20C
FocalPlaneXResolution = 0xA20E
FocalPlaneYResolution = 0xA20F
FocalPlaneResolutionUnit = 0xA210
SubjectLocation = 0xA214
ExposureIndex = 0xA215
SensingMethod = 0xA217
FileSource = 0xA300
SceneType = 0xA301
CFAPattern = 0xA302
CustomRendered = 0xA401
ExposureMode = 0xA402
WhiteBalance = 0xA403
DigitalZoomRatio = 0xA404
FocalLengthIn35mmFilm = 0xA405
SceneCaptureType = 0xA406
GainControl = 0xA407
Contrast = 0xA408
Saturation = 0xA409
Sharpness = 0xA40A
DeviceSettingDescription = 0xA40B
SubjectDistanceRange = 0xA40C
ImageUniqueID = 0xA420
CameraOwnerName = 0xA430
BodySerialNumber = 0xA431
LensSpecification = 0xA432
LensMake = 0xA433
LensModel = 0xA434
LensSerialNumber = 0xA435
CompositeImage = 0xA460
CompositeImageCount = 0xA461
CompositeImageExposureTimes = 0xA462
Gamma = 0xA500
PrintImageMatching = 0xC4A5
DNGVersion = 0xC612
DNGBackwardVersion = 0xC613
UniqueCameraModel = 0xC614
LocalizedCameraModel = 0xC615
CFAPlaneColor = 0xC616
CFALayout = 0xC617
LinearizationTable = 0xC618
BlackLevelRepeatDim = 0xC619
BlackLevel = 0xC61A
BlackLevelDeltaH = 0xC61B
BlackLevelDeltaV = 0xC61C
WhiteLevel = 0xC61D
DefaultScale = 0xC61E
DefaultCropOrigin = 0xC61F
DefaultCropSize = 0xC620
ColorMatrix1 = 0xC621
ColorMatrix2 = 0xC622
CameraCalibration1 = 0xC623
CameraCalibration2 = 0xC624
ReductionMatrix1 = 0xC625
ReductionMatrix2 = 0xC626
AnalogBalance = 0xC627
AsShotNeutral = 0xC628
AsShotWhiteXY = 0xC629
BaselineExposure = 0xC62A
BaselineNoise = 0xC62B
BaselineSharpness = 0xC62C
BayerGreenSplit = 0xC62D
LinearResponseLimit = 0xC62E
CameraSerialNumber = 0xC62F
LensInfo = 0xC630
ChromaBlurRadius = 0xC631
AntiAliasStrength = 0xC632
ShadowScale = 0xC633
DNGPrivateData = 0xC634
MakerNoteSafety = 0xC635
CalibrationIlluminant1 = 0xC65A
CalibrationIlluminant2 = 0xC65B
BestQualityScale = 0xC65C
RawDataUniqueID = 0xC65D
OriginalRawFileName = 0xC68B
OriginalRawFileData = 0xC68C
ActiveArea = 0xC68D
MaskedAreas = 0xC68E
AsShotICCProfile = 0xC68F
AsShotPreProfileMatrix = 0xC690
CurrentICCProfile = 0xC691
CurrentPreProfileMatrix = 0xC692
ColorimetricReference = 0xC6BF
CameraCalibrationSignature = 0xC6F3
ProfileCalibrationSignature = 0xC6F4
AsShotProfileName = 0xC6F6
NoiseReductionApplied = 0xC6F7
ProfileName = 0xC6F8
ProfileHueSatMapDims = 0xC6F9
ProfileHueSatMapData1 = 0xC6FA
ProfileHueSatMapData2 = 0xC6FB
ProfileToneCurve = 0xC6FC
ProfileEmbedPolicy = 0xC6FD
Copyright = 0xC6FE
ForwardMatrix1 = 0xC714
ForwardMatrix2 = 0xC715
PreviewApplicationName = 0xC716
PreviewApplicationVersion = 0xC717
PreviewSettingsName = 0xC718
PreviewSettingsDigest = 0xC719
PreviewColorSpace = 0xC71A
PreviewDateTime = 0xC71B
RawImageDigest = 0xC71C
OriginalRawFileDigest = 0xC71D
SubTileBlockSize = 0xC71E
RowInterleaveFactor = 0xC71F
ProfileLookTableDims = 0xC725
ProfileLookTableData = 0xC726
OpcodeList1 = 0xC740
OpcodeList2 = 0xC741
OpcodeList3 = 0xC74E
NoiseProfile = 0xC761
Copyright = 0xC6FE
ForwardMatrix1 = 0xC714
ForwardMatrix2 = 0xC715
PreviewApplicationName = 0xC716
PreviewApplicationVersion = 0xC717
PreviewSettingsName = 0xC718
PreviewSettingsDigest = 0xC719
PreviewColorSpace = 0xC71A
PreviewDateTime = 0xC71B
RawImageDigest = 0xC71C
OriginalRawFileDigest = 0xC71D
SubTileBlockSize = 0xC71E
RowInterleaveFactor = 0xC71F
ProfileLookTableDims = 0xC725
ProfileLookTableData = 0xC726
OpcodeList1 = 0xC740
OpcodeList2 = 0xC741
OpcodeList3 = 0xC74E
NoiseProfile = 0xC761
Copyright 1988, 1993, 1994, 1998 The Open Group
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
Copyright © 1988-1997 Sam Leffler\
Copyright 1989, 1998 The Open Group
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
Copyright © 1991-1997 Silicon Graphics, Inc.
Permission to use, copy, modify, distribute, and sell this software and
its documentation for any purpose is hereby granted without fee, provided
that (i) the above copyright notices and this permission notice appear in
all copies of the software and related documentation, and (ii) the names of
Sam Leffler and Silicon Graphics may not be used in any advertising or
publicity relating to the software without the specific, prior written
permission of Sam Leffler and Silicon Graphics.
Copyright © 1995-2011 by Fredrik Lundh and contributors
Pillow is the friendly PIL fork. It is
Copyright © 1995-2011 by Fredrik Lundh and contributors
Pillow is the friendly PIL fork. It is
Copyright 1996-2002, 2006 by
David Turner, Robert Wilhelm, and Werner Lemberg
Copyright 1996-2002, 2006 by
David Turner, Robert Wilhelm, and Werner Lemberg
Copyright © 1997-2011 by Secret Labs AB
Copyright © 1997-2011 by Secret Labs AB
Copyright © 1998-2005 David Turner and Werner Lemberg
Copyright © 1998-2005 David Turner and Werner Lemberg
Copyright 2000 Computing Research Labs, New Mexico State University
Copyright 2001-2002, 2011 Francesco Zappa Nardelli
copyright 2003
Copyright © 2004,2007,2008,2009,2010,2013,2021,2022,2023 Red Hat, Inc.
Copyright © 2004,2007,2008,2009,2010,2013,2021,2022,2023 Red Hat, Inc.
Copyright © 2005,2006,2020,2021,2022,2023 Behdad Esfahbod
Copyright © 2005,2006,2020,2021,2022,2023 Behdad Esfahbod
Copyright © 2007 Chris Wilson
Copyright © 2007 Chris Wilson
Copyright © 2008,2010 Nokia Corporation and/or its subsidiary(-ies)
Copyright © 2008,2010 Nokia Corporation and/or its subsidiary(-ies)
Copyright © 2009 Keith Stribley
Copyright © 2009 Keith Stribley
Copyright © 2010-2022 Google, Inc.
Copyright © 2010-2022 Google, Inc.
Copyright © 2010 by Jeffrey A. Clark and contributors
Copyright © 2010 by Jeffrey A. Clark and contributors
Copyright © 2011 Codethink Limited
Copyright © 2011 Codethink Limited
Copyright © 2011 Google, Inc.
*
* This is part of HarfBuzz, a text shaping library.
Copyright © 2011 Martin Hosken and SIL International
Copyright © 2011 Martin Hosken and SIL International
Copyright 2011 The LibYuv Project Authors. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright 2011 The LibYuv Project Authors. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright © 2012,2015 Mozilla Foundation
Copyright © 2012,2015 Mozilla Foundation
Copyright © 2013-2015 Alexei Podtelezhnikov
For full copyright notices consult the individual files in the package.
Copyright © 2013-2015 Alexei Podtelezhnikov
For full copyright notices consult the individual files in the package.
Copyright © 2015-2020 Ebrahim Byagowi
Copyright © 2015-2020 Ebrahim Byagowi
Copyright © 2015 Information Technology Authority (ITA) <foss@ita.gov.om>
Copyright © 2016-2023 Khaled Hosny <khaled@aliftype.com>
Copyright © 2016 Igalia S.L.
Copyright © 2016 Igalia S.L.
Copyright © 2016 Khaled Hosny <khaledhosny@eglug.org>
Copyright © 2018,2019,2020 Adobe, Inc
Copyright © 2018,2019,2020 Adobe, Inc
Copyright © 2018-2019, VideoLAN and dav1d authors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright © 2018-2019, VideoLAN and dav1d authors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright © 2018,2021 Khaled Hosny
Copyright © 2018,2021 Khaled Hosny
Copyright © 2019,2020 Facebook, Inc.
Copyright © 2019,2020 Facebook, Inc.
Copyright 2019 Joe Drago. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright 2019 Joe Drago. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright 2020 Emmanuel Gil Peyrot. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright 2020 Emmanuel Gil Peyrot. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright 2020 Google LLC
Copyright © 2022 Matthias Clasen
Copyright © 2022 Matthias Clasen
COPYRIGHT = 33432
IPTC_NAA_CHUNK = 33723 # newsphoto properties
PHOTOSHOP_CHUNK = 34377 # photoshop properties
ICCPROFILE = 34675
EXIFIFD = 34665
XMP = 700
JPEGQUALITY = 65537 # pseudo-tag by libtiff
# https://github.com/imagej/ImageJA/blob/master/src/main/java/ij/io/TiffDecoder.java
IMAGEJ_META_DATA_BYTE_COUNTS = 50838
IMAGEJ_META_DATA = 50839
COPYRIGHT = 33432
IPTC_NAA_CHUNK = 33723 # newsphoto properties
PHOTOSHOP_CHUNK = 34377 # photoshop properties
ICCPROFILE = 34675
EXIFIFD = 34665
XMP = 700
JPEGQUALITY = 65537 # pseudo-tag by libtiff
# https://github.com/imagej/ImageJA/blob/master/src/main/java/ij/io/TiffDecoder.java
IMAGEJ_META_DATA_BYTE_COUNTS = 50838
IMAGEJ_META_DATA = 50839
copyright by the Free Software Foundation but is freely distributable.
The same holds for its supporting scripts (config.guess, config.sub,
copyright by the Free Software Foundation but is freely distributable.
The same holds for its supporting scripts (config.guess, config.sub,
copyright by X Consortium
but is also freely distributable.
The IJG distribution formerly included code to read and write GIF files.
To avoid entanglement with the Unisys LZW patent, GIF reading support has
been removed altogether, and the GIF writer has been simplified to produce
"uncompressed GIFs". This technique does not use the LZW algorithm; the
resulting GIF files are larger than usual, but are readable by all standard
GIF decoders.
copyright by X Consortium
but is also freely distributable.
The IJG distribution formerly included code to read and write GIF files.
To avoid entanglement with the Unisys LZW patent, GIF reading support has
been removed altogether, and the GIF writer has been simplified to produce
"uncompressed GIFs". This technique does not use the LZW algorithm; the
resulting GIF files are larger than usual, but are readable by all standard
GIF decoders.
Copyright (c) 1987-1994 The Regents of the University of California.
Copyright (c) 1988-1997 Sam Leffler
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
copyright (C) 1991-1995, Thomas G. Lane.
#define DIST(a, b, s) (a - b) * (a - b) * s
Copyright (c) 1991-1997 Silicon Graphics, Inc.
Permission to use, copy, modify, distribute, and sell this software and
its documentation for any purpose is hereby granted without fee, provided
that (i) the above copyright notices and this permission notice appear in
all copies of the software and related documentation, and (ii) the names of
Sam Leffler and Silicon Graphics may not be used in any advertising or
publicity relating to the software without the specific, prior written
permission of Sam Leffler and Silicon Graphics.
copyright (C) 1991-2013, Thomas G. Lane, Guido Vollbeding.
All Rights Reserved except as specified below.
Permission is hereby granted to use, copy, modify, and distribute this
software (or portions thereof) for any purpose, without fee, subject to these
conditions:
copyright (C) 1991-2013, Thomas G. Lane, Guido Vollbeding.
All Rights Reserved except as specified below.
Permission is hereby granted to use, copy, modify, and distribute this
software (or portions thereof) for any purpose, without fee, subject to these
conditions:
copyright (C) 1991-2020, Thomas G. Lane, Guido Vollbeding.
All Rights Reserved except as specified below.
Permission is hereby granted to use, copy, modify, and distribute this
software (or portions thereof) for any purpose, without fee, subject to these
conditions:
copyright (C) 1991-2020, Thomas G. Lane, Guido Vollbeding.
All Rights Reserved except as specified below.
Permission is hereby granted to use, copy, modify, and distribute this
software (or portions thereof) for any purpose, without fee, subject to these
conditions:
Copyright (c) 1993-1996 Lucent Technologies.
Copyright (c) 1994-1998 Sun Microsystems, Inc.
Copyright (c) 1995-1996 by Fredrik Lundh
*/
Copyright (c) 1995-1996 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-1996 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-1996 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-1996 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
The software is supplied "as is", without warranty of any kind,
express or implied, including, without limitation, the warranties
of merchantability, fitness for a particular purpose, title, and
non-infringement. In no event shall the Copyright owners, or
anyone distributing the software, be liable for any damages or
other liability, whether in contract, tort or otherwise, arising
from, out of, or in connection with the software, or the use or
other dealings in the software, even if advised of the possibility
of such damage.
Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
The software is supplied "as is", without warranty of any kind,
express or implied, including, without limitation, the warranties
of merchantability, fitness for a particular purpose, title, and
non-infringement. In no event shall the Copyright owners, or
anyone distributing the software, be liable for any damages or
other liability, whether in contract, tort or otherwise, arising
from, out of, or in connection with the software, or the use or
other dealings in the software, even if advised of the possibility
of such damage.
Copyright (c) 1995-1997 by Fredrik Lundh.
*
* See the README file for details on usage and redistribution.
Copyright (c) 1995-1997 by Fredrik Lundh
*
* See the README file for details on usage and redistribution.
Copyright (c) 1995-1997 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-1997 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2001 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2001 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2001 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2001 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2001 by Secret Labs AB
Copyright (c) 1995-2002 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2002 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2002 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2003 by Fredrik Lundh
Copyright (c) 1995-2003 by Fredrik Lundh
Copyright (c) 1995-2003 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2004 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2004 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2005 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2006 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-2009 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2009 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-2022 The PNG Reference Library Authors.
Copyright (c) 1995-2025 The PNG Reference Library Authors.
Copyright (c) 1995-96 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1995-96 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995-96 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1995 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 Andreas Dilger.
Copyright (c) 1996-1997 Andreas Dilger.
Copyright (c) 1996-1997 Andreas Dilger, are derived from libpng-0.88,
Copyright (c) 1996-1997 Andreas Dilger, are derived from libpng-0.88,
Copyright (c) 1996-1997 by Fredrik Lundh.
*
* See the README file for details on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-1997 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
copyright (C) 1996-2000 by David Turner,
Robert Wilhelm, and Werner Lemberg. All rights reserved except as
specified below.
1. No Warranty
copyright (C) 1996-2000 by David Turner,
Robert Wilhelm, and Werner Lemberg. All rights reserved except as
specified below.
1. No Warranty
Copyright (c) 1996-2000 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-2000 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-2000 Fredrik Lundh
*
* See the README file for details on usage and redistribution.
Copyright (c) 1996-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-2004 by Fredrik Lundh.
*
* See the README file for details on usage and redistribution.
Copyright (c) 1996-2006 by Fredrik Lundh
Copyright (c) 1996-2006 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996-2006 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
copyright (C) 1996-2019 Julian R Seward. All
rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Copyright (c) 1996 by Fredrik Lundh.
Copyright (c) 1996 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1996 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997-1998 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997-1998 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997-1998 by Secret Labs AB
Copyright (c) 1997-1998 by Secret Labs AB
Copyright (c) 1997-1999 by Secret Labs AB
Copyright (c) 1997-1999 by Secret Labs AB
Copyright (c) 1997-2000 by Secret Labs AB
Copyright (c) 1997-2000 by Secret Labs AB
Copyright (c) 1997-2001 by Secret Labs AB.
Copyright (c) 1997-2001 by Secret Labs AB.
Copyright (c) 1997-2001 by Secret Labs AB
Copyright (c) 1997-2001 by Secret Labs AB
Copyright (c) 1997-2002 by Secret Labs AB.
Copyright (c) 1997-2003 by Fredrik Lundh.
Copyright (c) 1997-2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997-2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997-2003 by Secret Labs AB.
Copyright (c) 1997-2003 by Secret Labs AB.
Copyright (c) 1997-2003 by Secret Labs AB
Copyright (c) 1997-2003 by Secret Labs AB
Copyright (c) 1997-2004 by Secret Labs AB.
Copyright (c) 1997-2004 by Secret Labs AB
Copyright (c) 1997-2004 by Secret Labs AB
Copyright (c) 1997-2004 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2004 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2005 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 1997-2005 by Secret Labs AB.
Copyright (c) 1997-2005 by Secret Labs AB
Copyright (c) 1997-2005 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2005 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2006 by Secret Labs AB.
Copyright (c) 1997-2006 by Secret Labs AB
Copyright (c) 1997-2006 by Secret Labs AB
Copyright (c) 1997-2006 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2006 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2006 by Secret Labs AB.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1997-2009 by Secret Labs AB
Copyright (c) 1997-2009 by Secret Labs AB
Copyright (c) 1997-2009 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-2009 by Secret Labs AB. All rights reserved.
Copyright (c) 1997-98 by Secret Labs AB.
Copyright (c) 1997-98 by Secret Labs AB.
Copyright (c) 1997-99 by Secret Labs AB.
Copyright (c) 1997 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 1997 by Secret Labs AB.
Copyright (c) 1997 by Secret Labs AB.
Copyright (c) 1997 by Secret Labs AB.
*
* See the README file for details on usage and redistribution.
Copyright (c) 1997 by Secret Labs AB.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1998-2000 by Scriptics Corporation.
Copyright (c) 1998-2000 Glenn Randers-Pehrson, are derived from
Copyright (c) 1998-2000 Glenn Randers-Pehrson, are derived from
Copyright (c) 1998-2000 Secret Labs AB
Copyright (C) 1998-2001 Marti Maria)
Copyright (C) 1998-2001 Marti Maria)
Copyright (c) 1998-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1998-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 1998-2003 by Secret Labs AB.
Copyright (c) 1998-2004 by Secret Labs AB. All rights reserved.
*
* See the README file for information on usage and redistribution.
Copyright (c) 1998-2005 by Secret Labs AB
Copyright (c) 1998-2007 by Secret Labs AB
*/
Copyright (c) 1998-2020 Marti Maria Saguer
Copyright (c) 1998 by Secret Labs AB
*
* See the README file for information on usage and redistribution.
Copyright (c) 1998 by Toby J Sargeant
Copyright (c) 1999-2005 by Secret Labs AB
Copyright (c) 1999-2005 by Secret Labs AB
Copyright (c) 1999 by Secret Labs AB.
Use PIL.__version__ for this Pillow version.
Copyright (c) 1999 by Secret Labs AB.
Use PIL.__version__ for this Pillow version.
Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson.
Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson.
Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson, are
Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson, are
Copyright (c) 2000-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2000-2003 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (C) 2000 by Francesco Zappa Nardelli
Copyright (C) 2001-2002 by Francesco Zappa Nardelli
Copyright (c) 2001-2002 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2001-2002 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2001-2002 by Secret Labs AB
Copyright (c) 2001-2002 by Secret Labs AB
Copyright (c) 2001-2003, David Janssens
Copyright (c) 2001-2003, David Janssens
Copyright (c) 2001-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2001-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2001-2004 by Secret Labs AB
Copyright (c) 2001-2004 by Secret Labs AB
Copyright (C) 2001-2006 Bart Massey, Jamey Sharp, and Josh Triplett.
Copyright (C) 2002-2003 Kevin Cazabon
Copyright (C) 2002-2003 Kevin Cazabon
Copyright (C) 2002-2003 Kevin Cazabon
* kevin@cazabon.com
* https://www.cazabon.com
* Adapted/reworked for PIL by Fredrik Lundh
Copyright (C) 2002-2003 Kevin Cazabon
kevin@cazabon.com
https://www.cazabon.com
pyCMS home page: https://www.cazabon.com/pyCMS
littleCMS home page: https://www.littlecms.com
Copyright (C) 2002-2003 Kevin Cazabon
kevin@cazabon.com
https://www.cazabon.com
pyCMS home page: https://www.cazabon.com/pyCMS
littleCMS home page: https://www.littlecms.com
Copyright (C) 2002-2003 Kevin Cazabon\n\
kevin@cazabon.com\n\
https://www.cazabon.com\n\
"
Copyright (c) 2002-2003, Yannick Verschueren
Copyright (c) 2002-2003, Yannick Verschueren
Copyright (c) 2002-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2002-2004 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2002-2004 by Secret Labs AB
Copyright (c) 2002-2004 by Secret Labs AB
Copyright (c) 2002-2014, Professor Benoit Macq
Copyright (c) 2002-2014, Professor Benoit Macq
Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
Copyright (c) 2002 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2002 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2002 by Kevin B. Kenny. All rights reserved.
*
* This software is copyrighted by the Regents of the University
* of California, Sun Microsystems, Inc., Scriptics Corporation,
* and other parties. The following terms apply to all files
* associated with the software unless explicitly disclaimed in
* individual files.
Copyright (c) 2002 by Secret Labs AB
Copyright (c) 2002 by Secret Labs AB
Copyright (c) 2003-2005 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2003-2005 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2003-2005 by Secret Labs AB
Copyright (c) 2003-2005 by Secret Labs AB
Copyright (c) 2003-2009, Francois-Olivier Devaux
Copyright (c) 2003-2009, Francois-Olivier Devaux
Copyright (c) 2003-2014, Antonin Descampe
Copyright (c) 2003-2014, Antonin Descampe
Copyright (c) 2003 by Fredrik Lundh.
*
* See the README file for information on usage and redistribution.
Copyright (c) 2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2003 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2003 by Secret Labs AB
#
# See the README file for information on usage and redistribution.
Copyright (c) 2003 by Secret Labs AB
#
# See the README file for information on usage and redistribution.
Copyright (c) 2004 by Bob Ippolito.
Copyright (c) 2004 by Bob Ippolito.
Copyright (c) 2004 by Fredrik Lundh.
Copyright (c) 2004 by Fredrik Lundh.
#
Copyright (c) 2004 by Fredrik Lundh.
Copyright (c) 2004 by Fredrik Lundh.
#
Copyright (c) 2004 by Health Research Inc. (HRI) RENSSELAER, NY 12144.
Copyright (c) 2004 by Health Research Inc. (HRI) RENSSELAER, NY 12144.
Copyright (c) 2004 by Secret Labs.
Copyright (c) 2004 by Secret Labs.
Copyright (c) 2004 by Secret Labs AB.
Copyright (c) 2004 by Secret Labs AB.
Copyright (c) 2004 by William Baxter.
Copyright (c) 2004 by William Baxter.
Copyright (c) 2005 by Fredrik Lundh
*
* See the README file for information on usage and redistribution.
Copyright (c) 2005 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2005 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2005, Herve Drolon, FreeImage Team
Copyright (c) 2005, Herve Drolon, FreeImage Team
Copyright (c) 2006 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2006 by Fredrik Lundh.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2006 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2006 by Fredrik Lundh
#
# See the README file for information on usage and redistribution.
Copyright (c) 2006 by Secret Labs AB.
Copyright (c) 2006 by Secret Labs AB.
Copyright (c) 2006 by Secret Labs AB
Copyright (c) 2006 by Secret Labs AB
Copyright (c) 2006 by Tavmjong Bah. All Rights Reserved.
Copyright (c) 2008 by Karsten Hiddemann.
Copyright (c) 2008 by Karsten Hiddemann.
Copyright (c) 2009, 2010, 2013-2016 by the Brotli Authors.
Copyright (c) 2009, 2010, 2013-2016 by the Brotli Authors.
Copyright (C)2009-2024 D. R. Commander. All Rights Reserved.<br>
Copyright (c) 2009 by Fredrik Lundh
Copyright (c) 2009 by Fredrik Lundh
Copyright (c) 2009 Fredrik Lundh
* Updated to LCMS2
Copyright (c) 2010, Google Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2010, Google Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Google nor the names of its contributors may
be used to endorse or promote products derived from this software
without specific prior written permission.
Copyright (c) 2010 Oliver Tonnhofer <olt@bogosoft.com>, Omniscale
Copyright (c) 2011-2012, Centre National d
Copyright (c) 2011-2012, Centre National d
Copyright (c) 2012 by Brian Crowell
#
# See the README file for information on usage and redistribution.
Copyright (c) 2012 by Brian Crowell
#
# See the README file for information on usage and redistribution.
Copyright (c) 2012, CS Systemes d
*
* All rights reserved.
Copyright (c) 2012, CS Systemes d
*
* All rights reserved.
Copyright (c) 2013 by Eric Soroos
# See the README file for information on usage and redistribution. See
# below for the original description.
from __future__ import annotations
Copyright (c) 2013 by Eric Soroos
# See the README file for information on usage and redistribution. See
# below for the original description.
from __future__ import annotations
Copyright (c) 2013 Eric Soroos
*
* pyCMS home page: https://www.cazabon.com/pyCMS
* littleCMS home page: https://www.littlecms.com
Copyright (c) 2014 Alastair Houghton
*
* See the README file for details on usage and redistribution.
Copyright (c) 2014 Alastair Houghton
#
# See the README file for information on usage and redistribution.
Copyright (c) 2014 Alastair Houghton
#
# See the README file for information on usage and redistribution.
Copyright (c) 2014 by Alastair Houghton.
Copyright (c) 2014 by Alastair Houghton.
Copyright (c) 2014 by Alastair Houghton
*/
Copyright (c) 2014 by Coriolis Systems Limited
Copyright (c) 2014 Coriolis Systems Limited
Copyright (c) 2014 Coriolis Systems Limited
Copyright (c) 2014 Dov Grobgeld <dov.grobgeld@gmail.com>
from __future__ import annotations
import re
Copyright (c) 2014 Dov Grobgeld <dov.grobgeld@gmail.com>
from __future__ import annotations
import re
Copyright (c) 2014 Dov Grobgeld <dov.grobgeld@gmail.com>
*
* See the README file for information on usage and redistribution.
Copyright (C)2015 Viktor Szathm
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
- Neither the name of the libjpeg-turbo Project nor the names of its
contributors may be used to endorse or promote products derived from this
software without specific prior written permission.
Copyright (c) 2016, Alliance for Open Media. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
Copyright (c) 2016 by Mickael Bonfill.
Copyright (c) 2016 by Mickael Bonfill.
Copyright (c) 2016 Marcin Kurczewski <rr-@sakuya.pl>
*
Copyright (c) 2018-2022 Cosmin Truta.
Copyright (c) 2018-2025 Cosmin Truta.
Copyright (c) 2018 Roel Nieskens, https://pixelambacht.nl Copyright (c) 2018 Google LLC
Copyright (c) 2020 by Pan Jing.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2020 by Pan Jing.
#
# See the README file for information on usage and redistribution.
Copyright (c) 2023 Marti Maria Saguer
Copyright (c) Eric Soroos 2016.
#
# See the README file for information on usage and redistribution.
Copyright (c) Eric Soroos 2016.
#
# See the README file for information on usage and redistribution.
Copyright (c) Eric Soroos 2017.
#
# See the README file for information on usage and redistribution.
Copyright (c) Eric Soroos 2017.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1994.
#
Copyright (c) Fredrik Lundh 1994.
#
Copyright (c) Fredrik Lundh 1995.
Copyright (c) Fredrik Lundh 1995-1997.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-2003.
*/
Copyright (c) Fredrik Lundh 1995-96.
*/
Copyright (c) Fredrik Lundh 1995-96.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-96.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-96.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-97.
Copyright (c) Fredrik Lundh 1995-97.
Copyright (c) Fredrik Lundh 1995-97.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-97.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995-97.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1995.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996.
Copyright (c) Fredrik Lundh 1996.
*/
Copyright (c) Fredrik Lundh 1996.
Copyright (c) Fredrik Lundh 1996-2001.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996-2001.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996-2003.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996-2003.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996-97.
Copyright (c) Fredrik Lundh 1996-97.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996-97.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1996.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1997.
Copyright (c) Fredrik Lundh 1997-2004.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1997-2004.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1997.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1997.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1997.
#
# See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 1999.
Copyright (c) Fredrik Lundh 1999.
*
* See the README file for information on usage and redistribution.
Copyright (c) Fredrik Lundh 2009.
*
* See the README file for information on usage and redistribution.
Copyright (c) Mickael Bonfill 2017.
*
* See the README file for information on usage and redistribution.
copyright(CmsProfileObject
return _profile_read_mlu(self, cmsSigCopyrightTag);
}
Copyright Contributors to the pythoncapi_compat project.
//
// Homepage:
Copyright
Copyright (c) 2003 by Bitstream, Inc. All Rights Reserved. Bitstream Vera is a trademark of Bitstream, Inc.
Copyright (c) Secret Labs AB 1997.
Copyright (c) Secret Labs AB 1997.
Copyright (c) Secret Labs AB 1997-2001.
Copyright (c) Secret Labs AB 1997-2001.
Copyright (c) Secret Labs AB 1997-2001.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1997-2002.
Copyright (c) Secret Labs AB 1997-2002.
Copyright (c) Secret Labs AB 1997-2002. All rights reserved.
Copyright (c) Secret Labs AB 1997-2003.
Copyright (c) Secret Labs AB 1997-2003.
Copyright (c) Secret Labs AB 1997-2004. All rights reserved.
Copyright (c) Secret Labs AB 1997-2004. All rights reserved.
Copyright (c) Secret Labs AB 1997-2005. All rights reserved.
Copyright (c) Secret Labs AB 1997-98.
Copyright (c) Secret Labs AB 1997-98.
Copyright (c) Secret Labs AB 1997-98. All rights reserved.
Copyright (c) Secret Labs AB 1997-98.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1997-99.
Copyright (c) Secret Labs AB 1997-99.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1997.
*
* See the README file for details on usage and redistribution.
Copyright (c) Secret Labs AB 1997.
*
* See the README file for information on usage and redistribution. */
Copyright (c) Secret Labs AB 1997.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1998
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1999.
Copyright (c) Secret Labs AB 1999.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1999.
#
# See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 1999.
#
# See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 2002-2004. All rights reserved.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 2002. All rights reserved.
*
* See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 2008.
#
# See the README file for information on usage and redistribution.
Copyright (c) Secret Labs AB 2008.
#
# See the README file for information on usage and redistribution.
Copyright (C) The XZ Utils authors and contributors
Copyright (C) year name of author
copyright
elements =
return "\r\n\r\n".join(elements) + "\r\n\r\n"
except (AttributeError, OSError, TypeError, ValueError) as v:
copyright
elements =
return "\r\n\r\n".join(elements) + "\r\n\r\n"
except (AttributeError, OSError, TypeError, ValueError) as v:
copyright for the given profile.
If ``profile`` isn't a valid CmsProfile object or filename to a profile, a
:exc:`PyCMSError` is raised.
copyright for the given profile.
If ``profile`` isn't a valid CmsProfile object or filename to a profile, a
:exc:`PyCMSError` is raised.
copyright header in that file, then you can
Copyright International Color Consortium, 2009",
"",
Copyright International Color Consortium, 2009"
)
Copyright International Color Consortium, 2009"
assert p.creation_date == datetime.datetime(2009, 2, 27, 21, 36, 31)
assert p.device_class == "mntr"
assert_truncated_tuple_equal(
p.green_colorant,
(
(0.3851470947265625, 0.7168731689453125, 0.097076416015625),
(0.32119769927720654, 0.5978443449048152, 0.7168731689453125),
copyright in this software is being made available under the 2-clauses
copyright in this software is being made available under the 2-clauses
copyright legally problematic, you have too many
lawyers.
As usual, this software is provided "as is", without any warranty.
copyright() -> None:
skip_missing()
assert (
copyright or "")
except (AttributeError, OSError, TypeError, ValueError) as v:
copyright or "")
except (AttributeError, OSError, TypeError, ValueError) as v:
Copyright
Original text
copyright or license notices
copyright or license text in that file.
Copyright(profile: _CmsProfileCompatible) -> str:
"""
Copyright(profile: _CmsProfileCompatible) -> str:
"""
copyright \r\n\r\n K007 tag \r\n\r\n whitepoint
description = profile.profile.profile_description
copyright \r\n\r\n K007 tag \r\n\r\n whitepoint
description = profile.profile.profile_description
Copyright(SRGB).strip()
copyright tag,
a :exc:`PyCMSError` is raised.
Use this function to obtain the information stored in the profile's
copyright tag,
a :exc:`PyCMSError` is raised.
Use this function to obtain the information stored in the profile's
copyright tag.
:param profile: EITHER a valid CmsProfile object, OR a string of the
filename of an ICC profile.
:returns: A string containing the internal profile information stored in
an ICC tag.
:exception PyCMSError:
"""
copyright tag.
:param profile: EITHER a valid CmsProfile object, OR a string of the
filename of an ICC profile.
:returns: A string containing the internal profile information stored in
an ICC tag.
:exception PyCMSError:
"""
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
# html_use_opensearch = ''
copyright © <year> The FreeType
Project (www.freetype.org). All rights reserved.
"""
copyright © <year> The FreeType
Project (www.freetype.org). All rights reserved.
"""
© Tavmjung Bah (see below)
platformdirs
4.3.6
(c) > 255 for c in buf):
buf2 = ctypes.create_unicode_buffer(1024)
if windll.kernel32.GetShortPathNameW(buf.value, buf2, 1024):
Copyright (c) 2010-202x The platformdirs developers
pooch
1.8.2
Copyright (c) 2018 The Pooch Developers.
Copyright (c) 2018 The Pooch Developers.
Copyright (c) 2018 The Pooch Developers
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holders nor the names of any contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
psf-requests
2.32.3
Copyright 2019 Kenneth Reitz
copyright: (c) 2012 by Kenneth Reitz.
copyright: (c) 2017 by Kenneth Reitz.
Copyright Kenneth Reitz"
(c)
return c
def iterkeys(self):
py3-google-auth
2.40.3
Copyright 2014 Google Inc.
Copyright 2014 Google Inc.
Copyright 2015 Google Inc.
Copyright 2015 Google Inc.
Copyright 2016 Google Inc.
Copyright 2016 Google LLC
Copyright 2016 Google LLC
Copyright 2017 Google Inc.
Copyright 2017 Google LLC
Copyright 2018 Google Inc.
Copyright 2020 Google Inc.
Copyright 2020 Google LLC
Copyright 2020 Google LLC
Copyright 2021 Google LLC
Copyright 2021 Google LLC
Copyright 2022 Google Inc.
Copyright 2022 Google LLC
Copyright 2023 Google LLC
Copyright 2024 Google LLC
Copyright 2024 Google LLC
Copyright 2025 Google Inc.
Copyright 2025 Google LLC
pyasn1
0.6.1
Copyright (c) 2005-2019, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2019, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2020,
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
N/A
pyasn1-modules
0.4.2
Copyright: Ancitel, S.p.a, Rome, Italy
Copyright (c) 2005-2020,
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
Copyright (c) 2005-2020, Ilya Etingof <etingof@gmail.com>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright (c) 2017, Danielle Madeley <danielle@madeley.id.au>
Copyright (c) 2018-2019, Vigil Security, LLC
Copyright (c) 2018, 2019 Vigil Security, LLC
Copyright (c) 2018, 2019 Vigil Security, LLC
Copyright (c) 2018, Vigil Security, LLC
Copyright (c) 2019, Vigil Security, LLC
Copyright (c) 2019, Vigil Security, LLC
Copyright (c) 2020, Vigil Security, LLC
pycparser
2.22
Copyright (C) 2001-2017
# David M. Beazley (Dabeaz LLC)
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
# * Neither the name of the David Beazley or Dabeaz LLC may be used to
# endorse or promote products derived from this software without
# specific prior written permission.
#
Copyright (c) 2008-2022, Eli Bendersky
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2017
# All rights reserved
#
# This module implements an ANSI-C style lexical preprocessor for PLY.
Pygments - Python syntax highlighter
2.19.2
(c) & 0xFFFFFF);
}
(c) 2006-2024 by Georg Brandl, Matth
'Chajdas and contributors.')
return 0
def is_only_option(opt):
(c)
assert len(cats) == 1, "
(C) Copyright 2006 Salvatore Filippone University of Rome Tor Vergata
!!$ Alfredo Buttari University of Rome Tor Vergata
!!$ Daniela Di Serafino II University of Naples
!!$ Pasqua D'Ambra ICAR-CNR
!!$
!!$ Redistribution and use in source and binary forms, with or without
!!$ modification, are permitted provided that the following conditions
!!$ are met:
!!$ 1. Redistributions of source code must retain the above copyright
!!$ notice, this list of conditions and the following disclaimer.
!!$ 2. Redistributions in binary form must reproduce the above copyright
!!$ notice, this list of conditions, and the following disclaimer in the
!!$ documentation and/or other materials provided with the distribution.
(C) Copyright ..." is shown in the HTML footer. Default is True.
(c) (declare (ignore c)) nil)
)
(c) * F;
F := F * B;
end;
end;
function KeepIn(i, Bottom, Top: Variant): Variant;
begin
Result := i;
if Result > Top then
Result := Top
else if Result < Bottom then
Result := Bottom;
end;
(C) FSF.
;;; See the file `COPYING' for terms applying to this program.
;;;
(c)
if (
(c)
(if (> c 127)
(logxor c listify-key-sequence-1)
c)))
key)))
(defun eventp (obj)
"True if the argument is an event object."
(when obj
(or (integerp obj)
(and (symbolp obj) obj (not (keywordp obj)))
(and (consp obj) (symbolp (car obj))))))
(c)
if cn < (2
# ASCII character
buf.append(str(c))
elif (2**7) <= cn < (2**16):
(c)
if ord(c) == 0xdc00:
# Hack to avoid combining this combining with the preceding high
# surrogate, 0xdbff, when doing a repr.
c = '\\' + c
(c) in (0x2d, 0x5b, 0x5c, 0x5d, 0x5e):
# Escape regex metachars.
c = '\\' + c
(c) of
'0'..'9': c := c - 48;
'A'..'Z': c := c - 55;
end;
if c < B then
Copyright 1996 Institut National de Recherche en Informatique et
Copyright 2005 Brian Alliet
\documentclass[11pt]{article}
\usepackage{palatino}
\usepackage{fullpage}
\usepackage{parskip}
\usepackage{lhs}
copyright = '2006-2024, Georg Brandl and Pygments contributors
# The version info for the project you're documenting, acts as replacement for
# |version| and |release|, also used in various other places throughout the
# built documents.
Copyright 2006-2025 by the Pygments team.
copyright 2006.
Uploaded to HaskellWiki as DancingSudoku.lhs
I compile on a powerbook G4 (Mac OS X, ghc 6.4.2) using
ghc -optc-O3 -funbox-strict-fields -O2 --make -fglasgow-exts
Copyright 2012 by Luis Majano and Ortus Solutions, Corp
Copyright 2012 Nokia Siemens Networks Oyj
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
Copyright (C) 1985-1986, 1992, 1994-1995, 1999-2015 Free Software
;; Foundation, Inc.
;; Maintainer: emacs-devel@gnu.org
;; Keywords: internal
;; Package: emacs
Copyright (C) 1993-2003 Yukihiro Matsumoto
Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005
Copyright (c) 1997 Borland International
{ }
Copyright (c) 1998,1999,2000,2001,2002 Tal Davidson. All rights reserved.
*
* ASBeautifier.cpp
* by Tal Davidson (davidsont@bigfoot.com)
* This file is a part of "Artistic Style" - an indentater and reformatter
* of C, C, C# and Java source files.
Copyright (c) 1998,1999,2000,2001,2002 Tal Davidson. All rights reserved.
*
* ASFormatter.cpp
* by Tal Davidson (davidsont@bigfoot.com)
* This file is a part of "Artistic Style" - an indentater and reformatter
* of C, C++, C# and Java source files.
Copyright (c) 1998,1999,2000,2001,2002 Tal Davidson. All rights reserved.
*
* compiler_defines.h (1 January 1999)
* by Tal Davidson (davidsont@bigfoot.com)
* This file is a part of "Artistic Style" - an indentater and reformatter
* of C, C++, C# and Java source files.
Copyright (C) 2000 Information-technology Promotion Agency, Japan
Copyright (C) 2000 Network Applied Communication Laboratory, Inc.
Copyright (C) 2004, 2005, 2006 Aelitis, All Rights Reserved.
copyright : (C) 2004 by Andr
email : andre.simon1@gmx.de
***************************************************************************/
copyright : (C) 2004 by Andre Simon
email : andre.simon1@gmx.de
***************************************************************************/
Copyright (c) 2005-2006 by: //
// //
// Authors: //
// Michael Dominic K. <michaldominik@gmail.com> //
Copyright (C) 2005 Free Software Foundation, Inc."
$echo "This is free software; see the source for copying conditions. There is NO"
$echo "warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
exit $?
;;
Copyright (c) 2006-2022 by the respective authors (see AUTHORS file).
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
Copyright (c) 2008 Silken Web - Free BSD License
' All rights reserved.
'
' Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
' * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer
' * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
' * Neither the name of Silken Web nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
'
Copyright (C) 2008 Slava Pestov
Copyright (C) 2009 Benjamin Kowarsch. All rights reserved.
Copyright (c) 2014 Fullstack.io. All rights reserved.
//
Copyright (c) 2015 Georg Brandl
Copyright (c) Curve.Fi, 2020-2023 - all rights reserved
@notice Stableswap implementation for up to 8 coins with no rehypothecation,
i.e. the AMM does not deposit tokens into other contracts. The Pool contract also
records exponential moving averages for coins relative to coin 0.
@dev Asset Types:
copyright: Copyright 2006-2020 by the Pygments team, see AUTHORS.
copyright: Copyright 2006-2022 by the Pygments team, see AUTHORS.
copyright: Copyright 2006-2025 by
r'the Pygments team, see AUTHORS\.$')
copyright_2_re = re.compile(rf'^ {name_mail_re}(, {name_mail_re})*[,.]$')
is_const_re = re.compile(r'if.*?==\s+(None|False|True)\b')
misspellings = ["developement", "adress", "verificate", # ALLOW-MISSPELLING
"informations", "unlexer"] # ALLOW-MISSPELLING
copyright: Copyright 2006-2025 by the Pygments team, see AUTHORS.
copyright: Copyright 2021 by the Pygments team, see AUTHORS.
Copyright:: Copyright (c) 2003, 04 by Johannes Barre
copyright Copyright (c) 2006, Manni
* @version 1.0
* @link http://www.pkware.com/business_and_developers/developer/popups/appnote.txt
* @link http://mannithedark.is-a-geek.net/
* @since 1.0
* @package fnord.bb
* @subpackage archive
*/
class Zip extends Archive {
Copyright (c) Rich Hickey. All rights reserved.
copyright info"
copyright = llist
copyright = llist
while copyright and copyright_2_re.match(copyright[0]):
copyright or not copyright_re.match(copyright
Copyright Since
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
#html_use_opensearch = ''
copyright>' : '\U000000a9
'\\<registered>' : '\U000000ae',
'\\<hyphen>' : '\U000000ad',
'\\<inverse>' : '\U000000af',
'\\<onequarter>' : '\U000000bc',
'\\<onehalf>' : '\U000000bd',
'\\<threequarters>' : '\U000000be',
'\\<ordfeminine>' : '\U000000aa',
'\\<ordmasculine>' : '\U000000ba',
'\\<section>' : '\U000000a7',
'\\<paragraph>' : '\U000000b6',
'\\<exclamdown>' : '\U000000a1',
'\\<questiondown>' : '\U000000bf',
'\\<euro>' : '\U000020ac',
'\\<pounds>' : '\U000000a3',
'\\<yen>' : '\U000000a5',
'\\<cent>' : '\U000000a2',
'\\<currency>' : '\U000000a4',
'\\<degree>' : '\U000000b0',
'\\<amalg>' : '\U00002a3f',
'\\<mho>' : '\U00002127',
'\\<lozenge>' : '\U000025ca',
'\\<wp>' : '\U00002118',
'\\<wrong>' : '\U00002240',
'\\<struct>' : '\U000022c4',
'\\<acute>' : '\U000000b4',
'\\<index>' : '\U00000131',
'\\<dieresis>' : '\U000000a8',
'\\<cedilla>' : '\U000000b8',
'\\<hungarumlaut>' : '\U000002dd',
'\\<some>' : '\U000003f5',
'\\<newline>' : '\U000023ce',
'\\<open>' : '\U00002039',
'\\<close>' : '\U0000203a',
'\\<here>' : '\U00002302',
'\\<^sub>' : '\U000021e9',
'\\<^sup>' : '\U000021e7',
'\\<^bold>' : '\U00002759',
'\\<^bsub>' : '\U000021d8',
'\\<^esub>' : '\U000021d9',
'\\<^bsup>' : '\U000021d7',
'\\<^esup>' : '\U000021d6',
}
copyright' : '\U000000a9
'\\textregistered' : '\U000000ae',
'\\textonequarter' : '\U000000bc',
'\\textonehalf' : '\U000000bd',
'\\textthreequarters' : '\U000000be',
'\\textordfeminine' : '\U000000aa',
'\\textordmasculine' : '\U000000ba',
'\\euro' : '\U000020ac',
'\\pounds' : '\U000000a3',
'\\yen' : '\U000000a5',
'\\textcent' : '\U000000a2',
'\\textcurrency' : '\U000000a4',
'\\textdegree' : '\U000000b0',
}
Copyright|VersionDescription
r'VersionNumber|VersionProduct|VersionTrademarks|Version|'
r'VFPXMLProgID|ViewPortHeight|ViewPortLeft|'
r'ViewPortTop|ViewPortWidth|VScrollSmallChange|View|Visible|'
r'VisualEffect|WhatsThisButton|WhatsThisHelpID|WhatsThisHelp|'
r'WhereType|Width|WindowList|WindowState|WindowType|WordWrap|'
r'WrapCharInCDATA|WrapInCDATA|WrapMemoInCDATA|XMLAdapter|'
r'XMLConstraints|XMLNameIsXPath|XMLNamespace|XMLName|'
r'XMLPrefix|XMLSchemaLocation|XMLTable|XMLType|'
r'XSDfractionDigits|XSDmaxLength|XSDtotalDigits|'
r'XSDtype|ZoomBox)', Name.Attribute),
(r'\.(ActivateCell|AddColumn|AddItem|AddListItem|AddObject|'
r'AddProperty|AddTableSchema|AddToSCC|Add|'
r'ApplyDiffgram|Attach|AutoFit|AutoOpen|Box|Build|'
r'CancelReport|ChangesToCursor|CheckIn|CheckOut|Circle|'
r'CleanUp|ClearData|ClearStatus|Clear|CloneObject|CloseTables|'
r'Close|Cls|CursorAttach|CursorDetach|CursorFill|'
r'CursorRefresh|DataToClip|DelayedMemoFetch|DeleteColumn|'
r'Dock|DoMessage|DoScroll|DoStatus|DoVerb|Drag|Draw|Eval|'
r'GetData|GetDockState|GetFormat|GetKey|GetLatestVersion|'
r'GetPageHeight|GetPageWidth|Help|Hide|IncludePageInOutput|'
r'IndexToItemID|ItemIDToIndex|Item|LoadXML|Line|Modify|'
r'MoveItem|Move|Nest|OLEDrag|OnPreviewClose|OutputPage|'
r'Point|Print|PSet|Quit|ReadExpression|ReadMethod|'
r'RecordRefresh|Refresh|ReleaseXML|Release|RemoveFromSCC|'
r'RemoveItem|RemoveListItem|RemoveObject|Remove|'
r'Render|Requery|RequestData|ResetToDefault|Reset|Run|'
r'SaveAsClass|SaveAs|SetAll|SetData|SetFocus|SetFormat|'
r'SetMain|SetVar|SetViewPort|ShowWhatsThis|Show|'
r'SupportsListenerType|TextHeight|TextWidth|ToCursor|'
r'ToXML|UndoCheckOut|Unnest|UpdateStatus|WhatsThisMode|'
r'WriteExpression|WriteMethod|ZOrder)', Name.Function),
(c)
with open(__file__,
fp.write(header)
for cat in sorted(categories):
(c)
# XID_START and XID_CONTINUE are special categories used for matching
# identifiers in Python 3.
if c.isidentifier():
pypi/setuptools
65.5.0
Copyright (c) 2003-2022 Paul T. McGuire
Copyright (c) 2005-2010 ActiveState Software Inc.
Copyright (c) 2013 Eddy Petri
"""Utilities for determining application-specific dirs.
Copyright (c) 2018
Copyright Jason R. Coombs
python cffi
1.17.1
Copyright (c) 1996, 1998, 1999, 2001 Red Hat, Inc.
Copyright (c) 1996, 1998, 2001, 2002 Red Hat, Inc.
Copyright (c) 1996, 1998 Red Hat, Inc.
Copyright (c) 1996, 1998 Red Hat, Inc.
Predefined ffi_types needed by libffi.
Copyright (c) 1996-2003, 2007, 2008 Red Hat, Inc.
Copyright (c) 1996-2003 Red Hat, Inc.
Copyright (c) 1996 Red Hat, Inc.
Common internal definitions and macros. Only necessary for building
libffi.
Copyright (c) 2001 John Beniton
Copyright (c) 2002 Bo Thorsen
Copyright (c) 2002 Ranjit Mathew
Copyright (c) 2002 Ranjit Mathew
Copyright (c) 2002 Roger Sayle
x86 Foreign Function Interface
Copyright (c) 2009, 2010, 2011, 2012 ARM Ltd.
Copyright (c) 2011, 2014, 2019, 2021 Anthony Green
Python six
1.17.0
Copyright (c) 2010-2024 Benjamin Peterson
Copyright (c) 2010-2024 Benjamin Peterson
copyright = u"2010-2024, Benjamin Peterson"
N/A
python-decorator
5.1.1
Copyright (c) 2005-2018, Michele Simionato
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in bytecode form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
Copyright (c) 2005-2020, Michele Simionato
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Redistributions in bytecode form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
Copyright (c) 2005-2021, Michele Simionato
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# Redistributions in bytecode form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
Python-Markdown
3.8.2
Copyright 2004, 2005, 2006 Yuri Takhteyev (v. 0.2-1.6b)
Copyright 2004 Manfred Stienstra (the original version)
Copyright 2004 Manfred Stienstra (the original version)
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2006-2008
Copyright 2007-2008
Copyright 2007-2008
# and [Seemant Kulleen](http://www.kulleen.org/)
Copyright 2007, 2008 The Python Markdown Project (v. 1.7 and later)
Copyright 2007-2019 The Python Markdown Project (v. 1.7 and later)
Copyright 2007-2021 The Python Markdown Project (v. 1.7 and later)
Copyright 2007-2022 The Python Markdown Project (v. 1.7 and later)
Copyright 2007-2023 The Python Markdown Project (v. 1.7 and later)
Copyright 2007-2024 The Python Markdown Project (v. 1.7 and later)
Copyright 2008
Copyright 2008-2014 The Python Markdown Project
Copyright 2008-2024 The Python Markdown Project
Copyright 2009
Copyright 2011
Copyright 2011-2014 The Python Markdown Project
Copyright 2013-2014 The Python Markdown Project
Copyright 2015-2018 The Python Markdown Project
Copyright (c) 1999-2007 by Fredrik Lundh. All rights reserved.
#
# fredrik@pythonware.com
# https://www.pythonware.com/
Copyright (c) 1999-2007 by Fredrik Lundh
#
# By obtaining, using, and/or copying this software and/or its
# associated documentation, you agree that you have read, understood,
# and will comply with the following terms and conditions:
#
# Permission to use, copy, modify, and distribute this software and
# its associated documentation for any purpose and without fee is
Copyright (c) 2003 John Gruber <https://daringfireball.net/>
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
# * Neither the name "SmartyPants" nor the names of its contributors
# may be used to endorse or promote products derived from this
# software without specific prior written permission.
Copyright (c) 2004, 2007 Chad Miller <http://web.chad.org/>
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
Copyright The Python Markdown Project
(c)
return
(c)
return
python-protobuf
4.25.8
(C) Creates a stub
*
* In case (B) we have some freedom: we could either create a stub, or create
* a reified object with underlying data. It appears that either could work
* equally well, with no observable change to users. There isn't a clear
* advantage to either choice. We choose to follow the behavior of the
* pre-existing C++ behavior for consistency, but if it becomes apparent that
* there would be some benefit to reversing this decision, it should be totally
* within the realm of possibility.
(c) for c in self.testcases)
(C) global
// variables. This makes this extension compatible with sub-interpreters.
typedef struct {
// From descriptor.c
PyTypeObject* descriptor_types[kPyUpb_Descriptor_Count];
Copyright 2007 Google Inc. All Rights Reserved.
Copyright 2008 Google Inc. All rights reserved.
Copyright 2008 Google Inc. All rights reserved.
Copyright 2008 Google Inc. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following disclaimer
in the documentation and/or other materials provided with the
distribution.
* Neither the name of Google Inc. nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright 2023 Google LLC. All rights reserved.
Copyright 2023 Google LLC. All rights reserved.
Copyright 2023 Google LLC. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google LLC nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Python-RSA
4.9.1
Copyright 2011 Sybren A. St
Copyright 2011 Sybren A. St
python-typing-extensions
4.12.2
Copyright (c) 1991 - 1995, Stichting Mathematisch Centrum Amsterdam,
The Netherlands. All rights reserved.
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of Stichting Mathematisch
Centrum or CWI not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission.
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
python-wheel
0.45.1
(C) Copyright ..." is shown in the HTML footer. Default is True.
Copyright (c) 2012 Daniel Holth <dholth@fastmail.fm> and contributors
Copyright (c) Donald Stufft and individual contributors.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
# html_use_opensearch = ''
python3-rich
14.0.0
Copyright (c) 2020 Will McGugan
Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
©",
"couch_and_lamp": "
"counterclockwise_arrows_button": "🔄",
"couple_with_heart": "💑",
"couple_with_heart_man_man": "👨\u200d❤️\u200d👨",
"couple_with_heart_woman_man": "👩\u200d❤️\u200d👨",
"couple_with_heart_woman_woman": "👩\u200d❤️\u200d👩",
"cow": "🐮",
"cow_face": "🐮",
"cowboy_hat_face": "🤠",
"crab": "🦀",
"crayon": "🖍",
"credit_card": "💳",
"crescent_moon": "🌙",
"cricket": "🦗",
"cricket_game": "🏏",
"crocodile": "🐊",
"croissant": "🥐",
"cross_mark": "❌",
"cross_mark_button": "❎",
"crossed_fingers": "🤞",
"crossed_fingers_dark_skin_tone": "🤞🏿",
"crossed_fingers_light_skin_tone": "🤞🏻",
"crossed_fingers_medium-dark_skin_tone": "🤞🏾",
"crossed_fingers_medium-light_skin_tone": "🤞🏼",
"crossed_fingers_medium_skin_tone": "🤞🏽",
"crossed_flags": "🎌",
"crossed_swords": "⚔",
"crown": "👑",
"crying_cat_face": "😿",
"crying_face": "😢",
"crystal_ball": "🔮",
"cucumber": "🥒",
"cupcake": "🧁",
"cup_with_straw": "🥤",
"curling_stone": "🥌",
"curly_hair": "🦱",
"curly-haired_man": "👨\u200d🦱",
"curly-haired_woman": "👩\u200d🦱",
"curly_loop": "➰",
"currency_exchange": "💱",
"curry_rice": "🍛",
"custard": "🍮",
"customs": "🛃",
"cut_of_meat": "🥩",
"cyclone": "🌀",
"dagger": "🗡",
"dango": "🍡",
"dashing_away": "💨",
"deaf_person": "🧏",
"deciduous_tree": "🌳",
"deer": "🦌",
"delivery_truck": "🚚",
"department_store": "🏬",
"derelict_house": "🏚",
"desert": "🏜",
"desert_island": "🏝",
"desktop_computer": "🖥",
"detective": "🕵",
"detective_dark_skin_tone": "🕵🏿",
"detective_light_skin_tone": "🕵🏻",
"detective_medium-dark_skin_tone": "🕵🏾",
"detective_medium-light_skin_tone": "🕵🏼",
"detective_medium_skin_tone": "🕵🏽",
"diamond_suit": "♦",
"diamond_with_a_dot": "💠",
"dim_button": "🔅",
"direct_hit": "🎯",
"disappointed_face": "😞",
"diving_mask": "🤿",
"diya_lamp": "🪔",
"dizzy": "💫",
"dizzy_face": "😵",
"dna": "🧬",
"dog": "🐶",
"dog_face": "🐶",
"dollar_banknote": "💵",
"dolphin": "🐬",
"door": "🚪",
"dotted_six-pointed_star": "🔯",
"double_curly_loop": "➿",
"double_exclamation_mark": "‼",
"doughnut": "🍩",
"dove": "🕊",
"down-left_arrow": "↙",
"down-right_arrow": "↘",
"down_arrow": "⬇",
"downcast_face_with_sweat": "😓",
"downwards_button": "🔽",
"dragon": "🐉",
"dragon_face": "🐲",
"dress": "👗",
"drooling_face": "🤤",
"drop_of_blood": "🩸",
"droplet": "💧",
"drum": "🥁",
"duck": "🦆",
"dumpling": "🥟",
"dvd": "📀",
"e-mail": "📧",
"eagle": "🦅",
"ear": "👂",
"ear_dark_skin_tone": "👂🏿",
"ear_light_skin_tone": "👂🏻",
"ear_medium-dark_skin_tone": "👂🏾",
"ear_medium-light_skin_tone": "👂🏼",
"ear_medium_skin_tone": "👂🏽",
"ear_of_corn": "🌽",
"ear_with_hearing_aid": "🦻",
"egg": "🍳",
"eggplant": "🍆",
"eight-pointed_star": "✴",
"eight-spoked_asterisk": "✳",
"eight-thirty": "🕣",
"eight_o’clock": "🕗",
"eject_button": "⏏",
"electric_plug": "🔌",
"elephant": "🐘",
"eleven-thirty": "🕦",
"eleven_o’clock": "🕚",
"elf": "🧝",
"elf_dark_skin_tone": "🧝🏿",
"elf_light_skin_tone": "🧝🏻",
"elf_medium-dark_skin_tone": "🧝🏾",
"elf_medium-light_skin_tone": "🧝🏼",
"elf_medium_skin_tone": "🧝🏽",
"envelope": "✉",
"envelope_with_arrow": "📩",
"euro_banknote": "💶",
"evergreen_tree": "🌲",
"ewe": "🐑",
"exclamation_mark": "❗",
"exclamation_question_mark": "⁉",
"exploding_head": "🤯",
"expressionless_face": "😑",
"eye": "👁",
"eye_in_speech_bubble": "👁️\u200d🗨️",
"eyes": "👀",
"face_blowing_a_kiss": "😘",
"face_savoring_food": "😋",
"face_screaming_in_fear": "😱",
"face_vomiting": "🤮",
"face_with_hand_over_mouth": "🤭",
"face_with_head-bandage": "🤕",
"face_with_medical_mask": "😷",
"face_with_monocle": "🧐",
"face_with_open_mouth": "😮",
"face_with_raised_eyebrow": "🤨",
"face_with_rolling_eyes": "🙄",
"face_with_steam_from_nose": "😤",
"face_with_symbols_on_mouth": "🤬",
"face_with_tears_of_joy": "😂",
"face_with_thermometer": "🤒",
"face_with_tongue": "😛",
"face_without_mouth": "😶",
"factory": "🏭",
"fairy": "🧚",
"fairy_dark_skin_tone": "🧚🏿",
"fairy_light_skin_tone": "🧚🏻",
"fairy_medium-dark_skin_tone": "🧚🏾",
"fairy_medium-light_skin_tone": "🧚🏼",
"fairy_medium_skin_tone": "🧚🏽",
"falafel": "🧆",
"fallen_leaf": "🍂",
"family": "👪",
"family_man_boy": "👨\u200d👦",
"family_man_boy_boy": "👨\u200d👦\u200d👦",
"family_man_girl": "👨\u200d👧",
"family_man_girl_boy": "👨\u200d👧\u200d👦",
"family_man_girl_girl": "👨\u200d👧\u200d👧",
"family_man_man_boy": "👨\u200d👨\u200d👦",
"family_man_man_boy_boy": "👨\u200d👨\u200d👦\u200d👦",
"family_man_man_girl": "👨\u200d👨\u200d👧",
"family_man_man_girl_boy": "👨\u200d👨\u200d👧\u200d👦",
"family_man_man_girl_girl": "👨\u200d👨\u200d👧\u200d👧",
"family_man_woman_boy": "👨\u200d👩\u200d👦",
"family_man_woman_boy_boy": "👨\u200d👩\u200d👦\u200d👦",
"family_man_woman_girl": "👨\u200d👩\u200d👧",
"family_man_woman_girl_boy": "👨\u200d👩\u200d👧\u200d👦",
"family_man_woman_girl_girl": "👨\u200d👩\u200d👧\u200d👧",
"family_woman_boy": "👩\u200d👦",
"family_woman_boy_boy": "👩\u200d👦\u200d👦",
"family_woman_girl": "👩\u200d👧",
"family_woman_girl_boy": "👩\u200d👧\u200d👦",
"family_woman_girl_girl": "👩\u200d👧\u200d👧",
"family_woman_woman_boy": "👩\u200d👩\u200d👦",
"family_woman_woman_boy_boy": "👩\u200d👩\u200d👦\u200d👦",
"family_woman_woman_girl": "👩\u200d👩\u200d👧",
"family_woman_woman_girl_boy": "👩\u200d👩\u200d👧\u200d👦",
"family_woman_woman_girl_girl": "👩\u200d👩\u200d👧\u200d👧",
"fast-forward_button": "⏩",
"fast_down_button": "⏬",
"fast_reverse_button": "⏪",
"fast_up_button": "⏫",
"fax_machine": "📠",
"fearful_face": "😨",
"female_sign": "♀",
"ferris_wheel": "🎡",
"ferry": "⛴",
"field_hockey": "🏑",
"file_cabinet": "🗄",
"file_folder": "📁",
"film_frames": "🎞",
"film_projector": "📽",
"fire": "🔥",
"fire_extinguisher": "🧯",
"firecracker": "🧨",
"fire_engine": "🚒",
"fireworks": "🎆",
"first_quarter_moon": "🌓",
"first_quarter_moon_face": "🌛",
"fish": "🐟",
"fish_cake_with_swirl": "🍥",
"fishing_pole": "🎣",
"five-thirty": "🕠",
"five_o’clock": "🕔",
"flag_in_hole": "⛳",
"flamingo": "🦩",
"flashlight": "🔦",
"flat_shoe": "🥿",
"fleur-de-lis": "⚜",
"flexed_biceps": "💪",
"flexed_biceps_dark_skin_tone": "💪🏿",
"flexed_biceps_light_skin_tone": "💪🏻",
"flexed_biceps_medium-dark_skin_tone": "💪🏾",
"flexed_biceps_medium-light_skin_tone": "💪🏼",
"flexed_biceps_medium_skin_tone": "💪🏽",
"floppy_disk": "💾",
"flower_playing_cards": "🎴",
"flushed_face": "😳",
"flying_disc": "🥏",
"flying_saucer": "🛸",
"fog": "🌫",
"foggy": "🌁",
"folded_hands": "🙏",
"folded_hands_dark_skin_tone": "🙏🏿",
"folded_hands_light_skin_tone": "🙏🏻",
"folded_hands_medium-dark_skin_tone": "🙏🏾",
"folded_hands_medium-light_skin_tone": "🙏🏼",
"folded_hands_medium_skin_tone": "🙏🏽",
"foot": "🦶",
"footprints": "👣",
"fork_and_knife": "🍴",
"fork_and_knife_with_plate": "🍽",
"fortune_cookie": "🥠",
"fountain": "⛲",
"fountain_pen": "🖋",
"four-thirty": "🕟",
"four_leaf_clover": "🍀",
"four_o’clock": "🕓",
"fox_face": "🦊",
"framed_picture": "🖼",
"french_fries": "🍟",
"fried_shrimp": "🍤",
"frog_face": "🐸",
"front-facing_baby_chick": "🐥",
"frowning_face": "☹",
"frowning_face_with_open_mouth": "😦",
"fuel_pump": "⛽",
"full_moon": "🌕",
"full_moon_face": "🌝",
"funeral_urn": "⚱",
"game_die": "🎲",
"garlic": "🧄",
"gear": "⚙",
"gem_stone": "💎",
"genie": "🧞",
"ghost": "👻",
"giraffe": "🦒",
"girl": "👧",
"girl_dark_skin_tone": "👧🏿",
"girl_light_skin_tone": "👧🏻",
"girl_medium-dark_skin_tone": "👧🏾",
"girl_medium-light_skin_tone": "👧🏼",
"girl_medium_skin_tone": "👧🏽",
"glass_of_milk": "🥛",
"glasses": "👓",
"globe_showing_americas": "🌎",
"globe_showing_asia-australia": "🌏",
"globe_showing_europe-africa": "🌍",
"globe_with_meridians": "🌐",
"gloves": "🧤",
"glowing_star": "🌟",
"goal_net": "🥅",
"goat": "🐐",
"goblin": "👺",
"goggles": "🥽",
"gorilla": "🦍",
"graduation_cap": "🎓",
"grapes": "🍇",
"green_apple": "🍏",
"green_book": "📗",
"green_circle": "🟢",
"green_heart": "💚",
"green_salad": "🥗",
"green_square": "🟩",
"grimacing_face": "😬",
"grinning_cat_face": "😺",
"grinning_cat_face_with_smiling_eyes": "😸",
"grinning_face": "😀",
"grinning_face_with_big_eyes": "😃",
"grinning_face_with_smiling_eyes": "😄",
"grinning_face_with_sweat": "😅",
"grinning_squinting_face": "😆",
"growing_heart": "💗",
"guard": "💂",
"guard_dark_skin_tone": "💂🏿",
"guard_light_skin_tone": "💂🏻",
"guard_medium-dark_skin_tone": "💂🏾",
"guard_medium-light_skin_tone": "💂🏼",
"guard_medium_skin_tone": "💂🏽",
"guide_dog": "🦮",
"guitar": "🎸",
"hamburger": "🍔",
"hammer": "🔨",
"hammer_and_pick": "⚒",
"hammer_and_wrench": "🛠",
"hamster_face": "🐹",
"hand_with_fingers_splayed": "🖐",
"hand_with_fingers_splayed_dark_skin_tone": "🖐🏿",
"hand_with_fingers_splayed_light_skin_tone": "🖐🏻",
"hand_with_fingers_splayed_medium-dark_skin_tone": "🖐🏾",
"hand_with_fingers_splayed_medium-light_skin_tone": "🖐🏼",
"hand_with_fingers_splayed_medium_skin_tone": "🖐🏽",
"handbag": "👜",
"handshake": "🤝",
"hatching_chick": "🐣",
"headphone": "🎧",
"hear-no-evil_monkey": "🙉",
"heart_decoration": "💟",
"heart_suit": "♥",
"heart_with_arrow": "💘",
"heart_with_ribbon": "💝",
"heavy_check_mark": "✔",
"heavy_division_sign": "➗",
"heavy_dollar_sign": "💲",
"heavy_heart_exclamation": "❣",
"heavy_large_circle": "⭕",
"heavy_minus_sign": "➖",
"heavy_multiplication_x": "✖",
"heavy_plus_sign": "➕",
"hedgehog": "🦔",
"helicopter": "🚁",
"herb": "🌿",
"hibiscus": "🌺",
"high-heeled_shoe": "👠",
"high-speed_train": "🚄",
"high_voltage": "⚡",
"hiking_boot": "🥾",
"hindu_temple": "🛕",
"hippopotamus": "🦛",
"hole": "🕳",
"honey_pot": "🍯",
"honeybee": "🐝",
"horizontal_traffic_light": "🚥",
"horse": "🐴",
"horse_face": "🐴",
"horse_racing": "🏇",
"horse_racing_dark_skin_tone": "🏇🏿",
"horse_racing_light_skin_tone": "🏇🏻",
"horse_racing_medium-dark_skin_tone": "🏇🏾",
"horse_racing_medium-light_skin_tone": "🏇🏼",
"horse_racing_medium_skin_tone": "🏇🏽",
"hospital": "🏥",
"hot_beverage": "☕",
"hot_dog": "🌭",
"hot_face": "🥵",
"hot_pepper": "🌶",
"hot_springs": "♨",
"hotel": "🏨",
"hourglass_done": "⌛",
"hourglass_not_done": "⏳",
"house": "🏠",
"house_with_garden": "🏡",
"houses": "🏘",
"hugging_face": "🤗",
"hundred_points": "💯",
"hushed_face": "😯",
"ice": "🧊",
"ice_cream": "🍨",
"ice_hockey": "🏒",
"ice_skate": "⛸",
"inbox_tray": "📥",
"incoming_envelope": "📨",
"index_pointing_up": "☝",
"index_pointing_up_dark_skin_tone": "☝🏿",
"index_pointing_up_light_skin_tone": "☝🏻",
"index_pointing_up_medium-dark_skin_tone": "☝🏾",
"index_pointing_up_medium-light_skin_tone": "☝🏼",
"index_pointing_up_medium_skin_tone": "☝🏽",
"infinity": "♾",
"information": "ℹ",
"input_latin_letters": "🔤",
"input_latin_lowercase": "🔡",
"input_latin_uppercase": "🔠",
"input_numbers": "🔢",
"input_symbols": "🔣",
"jack-o-lantern": "🎃",
"jeans": "👖",
"jigsaw": "🧩",
"joker": "🃏",
"joystick": "🕹",
"kaaba": "🕋",
"kangaroo": "🦘",
"key": "🔑",
"keyboard": "⌨",
"keycap_#": "#️⃣",
"keycap_*": "*️⃣",
"keycap_0": "0️⃣",
"keycap_1": "1️⃣",
"keycap_10": "🔟",
"keycap_2": "2️⃣",
"keycap_3": "3️⃣",
"keycap_4": "4️⃣",
"keycap_5": "5️⃣",
"keycap_6": "6️⃣",
"keycap_7": "7️⃣",
"keycap_8": "8️⃣",
"keycap_9": "9️⃣",
"kick_scooter": "🛴",
"kimono": "👘",
"kiss": "💋",
"kiss_man_man": "👨\u200d❤️\u200d💋\u200d👨",
"kiss_mark": "💋",
"kiss_woman_man": "👩\u200d❤️\u200d💋\u200d👨",
"kiss_woman_woman": "👩\u200d❤️\u200d💋\u200d👩",
"kissing_cat_face": "😽",
"kissing_face": "😗",
"kissing_face_with_closed_eyes": "😚",
"kissing_face_with_smiling_eyes": "😙",
"kitchen_knife": "🔪",
"kite": "🪁",
"kiwi_fruit": "🥝",
"koala": "🐨",
"lab_coat": "🥼",
"label": "🏷",
"lacrosse": "🥍",
"lady_beetle": "🐞",
"laptop_computer": "💻",
"large_blue_diamond": "🔷",
"large_orange_diamond": "🔶",
"last_quarter_moon": "🌗",
"last_quarter_moon_face": "🌜",
"last_track_button": "⏮",
"latin_cross": "✝",
"leaf_fluttering_in_wind": "🍃",
"leafy_green": "🥬",
"ledger": "📒",
"left-facing_fist": "🤛",
"left-facing_fist_dark_skin_tone": "🤛🏿",
"left-facing_fist_light_skin_tone": "🤛🏻",
"left-facing_fist_medium-dark_skin_tone": "🤛🏾",
"left-facing_fist_medium-light_skin_tone": "🤛🏼",
"left-facing_fist_medium_skin_tone": "🤛🏽",
"left-right_arrow": "↔",
"left_arrow": "⬅",
"left_arrow_curving_right": "↪",
"left_luggage": "🛅",
"left_speech_bubble": "🗨",
"leg": "🦵",
"lemon": "🍋",
"leopard": "🐆",
"level_slider": "🎚",
"light_bulb": "💡",
"light_rail": "🚈",
"link": "🔗",
"linked_paperclips": "🖇",
"lion_face": "🦁",
"lipstick": "💄",
"litter_in_bin_sign": "🚮",
"lizard": "🦎",
"llama": "🦙",
"lobster": "🦞",
"locked": "🔒",
"locked_with_key": "🔐",
"locked_with_pen": "🔏",
"locomotive": "🚂",
"lollipop": "🍭",
"lotion_bottle": "🧴",
"loudly_crying_face": "😭",
"loudspeaker": "📢",
"love-you_gesture": "🤟",
"love-you_gesture_dark_skin_tone": "🤟🏿",
"love-you_gesture_light_skin_tone": "🤟🏻",
"love-you_gesture_medium-dark_skin_tone": "🤟🏾",
"love-you_gesture_medium-light_skin_tone": "🤟🏼",
"love-you_gesture_medium_skin_tone": "🤟🏽",
"love_hotel": "🏩",
"love_letter": "💌",
"luggage": "🧳",
"lying_face": "🤥",
"mage": "🧙",
"mage_dark_skin_tone": "🧙🏿",
"mage_light_skin_tone": "🧙🏻",
"mage_medium-dark_skin_tone": "🧙🏾",
"mage_medium-light_skin_tone": "🧙🏼",
"mage_medium_skin_tone": "🧙🏽",
"magnet": "🧲",
"magnifying_glass_tilted_left": "🔍",
"magnifying_glass_tilted_right": "🔎",
"mahjong_red_dragon": "🀄",
"male_sign": "♂",
"man": "👨",
"man_and_woman_holding_hands": "👫",
"man_artist": "👨\u200d🎨",
"man_artist_dark_skin_tone": "👨🏿\u200d🎨",
"man_artist_light_skin_tone": "👨🏻\u200d🎨",
"man_artist_medium-dark_skin_tone": "👨🏾\u200d🎨",
"man_artist_medium-light_skin_tone": "👨🏼\u200d🎨",
"man_artist_medium_skin_tone": "👨🏽\u200d🎨",
"man_astronaut": "👨\u200d🚀",
"man_astronaut_dark_skin_tone": "👨🏿\u200d🚀",
"man_astronaut_light_skin_tone": "👨🏻\u200d🚀",
"man_astronaut_medium-dark_skin_tone": "👨🏾\u200d🚀",
"man_astronaut_medium-light_skin_tone": "👨🏼\u200d🚀",
"man_astronaut_medium_skin_tone": "👨🏽\u200d🚀",
"man_biking": "🚴\u200d♂️",
"man_biking_dark_skin_tone": "🚴🏿\u200d♂️",
"man_biking_light_skin_tone": "🚴🏻\u200d♂️",
"man_biking_medium-dark_skin_tone": "🚴🏾\u200d♂️",
"man_biking_medium-light_skin_tone": "🚴🏼\u200d♂️",
"man_biking_medium_skin_tone": "🚴🏽\u200d♂️",
"man_bouncing_ball": "⛹️\u200d♂️",
"man_bouncing_ball_dark_skin_tone": "⛹🏿\u200d♂️",
"man_bouncing_ball_light_skin_tone": "⛹🏻\u200d♂️",
"man_bouncing_ball_medium-dark_skin_tone": "⛹🏾\u200d♂️",
"man_bouncing_ball_medium-light_skin_tone": "⛹🏼\u200d♂️",
"man_bouncing_ball_medium_skin_tone": "⛹🏽\u200d♂️",
"man_bowing": "🙇\u200d♂️",
"man_bowing_dark_skin_tone": "🙇🏿\u200d♂️",
"man_bowing_light_skin_tone": "🙇🏻\u200d♂️",
"man_bowing_medium-dark_skin_tone": "🙇🏾\u200d♂️",
"man_bowing_medium-light_skin_tone": "🙇🏼\u200d♂️",
"man_bowing_medium_skin_tone": "🙇🏽\u200d♂️",
"man_cartwheeling": "🤸\u200d♂️",
"man_cartwheeling_dark_skin_tone": "🤸🏿\u200d♂️",
"man_cartwheeling_light_skin_tone": "🤸🏻\u200d♂️",
"man_cartwheeling_medium-dark_skin_tone": "🤸🏾\u200d♂️",
"man_cartwheeling_medium-light_skin_tone": "🤸🏼\u200d♂️",
"man_cartwheeling_medium_skin_tone": "🤸🏽\u200d♂️",
"man_climbing": "🧗\u200d♂️",
"man_climbing_dark_skin_tone": "🧗🏿\u200d♂️",
"man_climbing_light_skin_tone": "🧗🏻\u200d♂️",
"man_climbing_medium-dark_skin_tone": "🧗🏾\u200d♂️",
"man_climbing_medium-light_skin_tone": "🧗🏼\u200d♂️",
"man_climbing_medium_skin_tone": "🧗🏽\u200d♂️",
"man_construction_worker": "👷\u200d♂️",
"man_construction_worker_dark_skin_tone": "👷🏿\u200d♂️",
"man_construction_worker_light_skin_tone": "👷🏻\u200d♂️",
"man_construction_worker_medium-dark_skin_tone": "👷🏾\u200d♂️",
"man_construction_worker_medium-light_skin_tone": "👷🏼\u200d♂️",
"man_construction_worker_medium_skin_tone": "👷🏽\u200d♂️",
"man_cook": "👨\u200d🍳",
"man_cook_dark_skin_tone": "👨🏿\u200d🍳",
"man_cook_light_skin_tone": "👨🏻\u200d🍳",
"man_cook_medium-dark_skin_tone": "👨🏾\u200d🍳",
"man_cook_medium-light_skin_tone": "👨🏼\u200d🍳",
"man_cook_medium_skin_tone": "👨🏽\u200d🍳",
"man_dancing": "🕺",
"man_dancing_dark_skin_tone": "🕺🏿",
"man_dancing_light_skin_tone": "🕺🏻",
"man_dancing_medium-dark_skin_tone": "🕺🏾",
"man_dancing_medium-light_skin_tone": "🕺🏼",
"man_dancing_medium_skin_tone": "🕺🏽",
"man_dark_skin_tone": "👨🏿",
"man_detective": "🕵️\u200d♂️",
"man_detective_dark_skin_tone": "🕵🏿\u200d♂️",
"man_detective_light_skin_tone": "🕵🏻\u200d♂️",
"man_detective_medium-dark_skin_tone": "🕵🏾\u200d♂️",
"man_detective_medium-light_skin_tone": "🕵🏼\u200d♂️",
"man_detective_medium_skin_tone": "🕵🏽\u200d♂️",
"man_elf": "🧝\u200d♂️",
"man_elf_dark_skin_tone": "🧝🏿\u200d♂️",
"man_elf_light_skin_tone": "🧝🏻\u200d♂️",
"man_elf_medium-dark_skin_tone": "🧝🏾\u200d♂️",
"man_elf_medium-light_skin_tone": "🧝🏼\u200d♂️",
"man_elf_medium_skin_tone": "🧝🏽\u200d♂️",
"man_facepalming": "🤦\u200d♂️",
"man_facepalming_dark_skin_tone": "🤦🏿\u200d♂️",
"man_facepalming_light_skin_tone": "🤦🏻\u200d♂️",
"man_facepalming_medium-dark_skin_tone": "🤦🏾\u200d♂️",
"man_facepalming_medium-light_skin_tone": "🤦🏼\u200d♂️",
"man_facepalming_medium_skin_tone": "🤦🏽\u200d♂️",
"man_factory_worker": "👨\u200d🏭",
"man_factory_worker_dark_skin_tone": "👨🏿\u200d🏭",
"man_factory_worker_light_skin_tone": "👨🏻\u200d🏭",
"man_factory_worker_medium-dark_skin_tone": "👨🏾\u200d🏭",
"man_factory_worker_medium-light_skin_tone": "👨🏼\u200d🏭",
"man_factory_worker_medium_skin_tone": "👨🏽\u200d🏭",
"man_fairy": "🧚\u200d♂️",
"man_fairy_dark_skin_tone": "🧚🏿\u200d♂️",
"man_fairy_light_skin_tone": "🧚🏻\u200d♂️",
"man_fairy_medium-dark_skin_tone": "🧚🏾\u200d♂️",
"man_fairy_medium-light_skin_tone": "🧚🏼\u200d♂️",
"man_fairy_medium_skin_tone": "🧚🏽\u200d♂️",
"man_farmer": "👨\u200d🌾",
"man_farmer_dark_skin_tone": "👨🏿\u200d🌾",
"man_farmer_light_skin_tone": "👨🏻\u200d🌾",
"man_farmer_medium-dark_skin_tone": "👨🏾\u200d🌾",
"man_farmer_medium-light_skin_tone": "👨🏼\u200d🌾",
"man_farmer_medium_skin_tone": "👨🏽\u200d🌾",
"man_firefighter": "👨\u200d🚒",
"man_firefighter_dark_skin_tone": "👨🏿\u200d🚒",
"man_firefighter_light_skin_tone": "👨🏻\u200d🚒",
"man_firefighter_medium-dark_skin_tone": "👨🏾\u200d🚒",
"man_firefighter_medium-light_skin_tone": "👨🏼\u200d🚒",
"man_firefighter_medium_skin_tone": "👨🏽\u200d🚒",
"man_frowning": "🙍\u200d♂️",
"man_frowning_dark_skin_tone": "🙍🏿\u200d♂️",
"man_frowning_light_skin_tone": "🙍🏻\u200d♂️",
"man_frowning_medium-dark_skin_tone": "🙍🏾\u200d♂️",
"man_frowning_medium-light_skin_tone": "🙍🏼\u200d♂️",
"man_frowning_medium_skin_tone": "🙍🏽\u200d♂️",
"man_genie": "🧞\u200d♂️",
"man_gesturing_no": "🙅\u200d♂️",
"man_gesturing_no_dark_skin_tone": "🙅🏿\u200d♂️",
"man_gesturing_no_light_skin_tone": "🙅🏻\u200d♂️",
"man_gesturing_no_medium-dark_skin_tone": "🙅🏾\u200d♂️",
"man_gesturing_no_medium-light_skin_tone": "🙅🏼\u200d♂️",
"man_gesturing_no_medium_skin_tone": "🙅🏽\u200d♂️",
"man_gesturing_ok": "🙆\u200d♂️",
"man_gesturing_ok_dark_skin_tone": "🙆🏿\u200d♂️",
"man_gesturing_ok_light_skin_tone": "🙆🏻\u200d♂️",
"man_gesturing_ok_medium-dark_skin_tone": "🙆🏾\u200d♂️",
"man_gesturing_ok_medium-light_skin_tone": "🙆🏼\u200d♂️",
"man_gesturing_ok_medium_skin_tone": "🙆🏽\u200d♂️",
"man_getting_haircut": "💇\u200d♂️",
"man_getting_haircut_dark_skin_tone": "💇🏿\u200d♂️",
"man_getting_haircut_light_skin_tone": "💇🏻\u200d♂️",
"man_getting_haircut_medium-dark_skin_tone": "💇🏾\u200d♂️",
"man_getting_haircut_medium-light_skin_tone": "💇🏼\u200d♂️",
"man_getting_haircut_medium_skin_tone": "💇🏽\u200d♂️",
"man_getting_massage": "💆\u200d♂️",
"man_getting_massage_dark_skin_tone": "💆🏿\u200d♂️",
"man_getting_massage_light_skin_tone": "💆🏻\u200d♂️",
"man_getting_massage_medium-dark_skin_tone": "💆🏾\u200d♂️",
"man_getting_massage_medium-light_skin_tone": "💆🏼\u200d♂️",
"man_getting_massage_medium_skin_tone": "💆🏽\u200d♂️",
"man_golfing": "🏌️\u200d♂️",
"man_golfing_dark_skin_tone": "🏌🏿\u200d♂️",
"man_golfing_light_skin_tone": "🏌🏻\u200d♂️",
"man_golfing_medium-dark_skin_tone": "🏌🏾\u200d♂️",
"man_golfing_medium-light_skin_tone": "🏌🏼\u200d♂️",
"man_golfing_medium_skin_tone": "🏌🏽\u200d♂️",
"man_guard": "💂\u200d♂️",
"man_guard_dark_skin_tone": "💂🏿\u200d♂️",
"man_guard_light_skin_tone": "💂🏻\u200d♂️",
"man_guard_medium-dark_skin_tone": "💂🏾\u200d♂️",
"man_guard_medium-light_skin_tone": "💂🏼\u200d♂️",
"man_guard_medium_skin_tone": "💂🏽\u200d♂️",
"man_health_worker": "👨\u200d⚕️",
"man_health_worker_dark_skin_tone": "👨🏿\u200d⚕️",
"man_health_worker_light_skin_tone": "👨🏻\u200d⚕️",
"man_health_worker_medium-dark_skin_tone": "👨🏾\u200d⚕️",
"man_health_worker_medium-light_skin_tone": "👨🏼\u200d⚕️",
"man_health_worker_medium_skin_tone": "👨🏽\u200d⚕️",
"man_in_lotus_position": "🧘\u200d♂️",
"man_in_lotus_position_dark_skin_tone": "🧘🏿\u200d♂️",
"man_in_lotus_position_light_skin_tone": "🧘🏻\u200d♂️",
"man_in_lotus_position_medium-dark_skin_tone": "🧘🏾\u200d♂️",
"man_in_lotus_position_medium-light_skin_tone": "🧘🏼\u200d♂️",
"man_in_lotus_position_medium_skin_tone": "🧘🏽\u200d♂️",
"man_in_manual_wheelchair": "👨\u200d🦽",
"man_in_motorized_wheelchair": "👨\u200d🦼",
"man_in_steamy_room": "🧖\u200d♂️",
"man_in_steamy_room_dark_skin_tone": "🧖🏿\u200d♂️",
"man_in_steamy_room_light_skin_tone": "🧖🏻\u200d♂️",
"man_in_steamy_room_medium-dark_skin_tone": "🧖🏾\u200d♂️",
"man_in_steamy_room_medium-light_skin_tone": "🧖🏼\u200d♂️",
"man_in_steamy_room_medium_skin_tone": "🧖🏽\u200d♂️",
"man_in_suit_levitating": "🕴",
"man_in_suit_levitating_dark_skin_tone": "🕴🏿",
"man_in_suit_levitating_light_skin_tone": "🕴🏻",
"man_in_suit_levitating_medium-dark_skin_tone": "🕴🏾",
"man_in_suit_levitating_medium-light_skin_tone": "🕴🏼",
"man_in_suit_levitating_medium_skin_tone": "🕴🏽",
"man_in_tuxedo": "🤵",
"man_in_tuxedo_dark_skin_tone": "🤵🏿",
"man_in_tuxedo_light_skin_tone": "🤵🏻",
"man_in_tuxedo_medium-dark_skin_tone": "🤵🏾",
"man_in_tuxedo_medium-light_skin_tone": "🤵🏼",
"man_in_tuxedo_medium_skin_tone": "🤵🏽",
"man_judge": "👨\u200d⚖️",
"man_judge_dark_skin_tone": "👨🏿\u200d⚖️",
"man_judge_light_skin_tone": "👨🏻\u200d⚖️",
"man_judge_medium-dark_skin_tone": "👨🏾\u200d⚖️",
"man_judge_medium-light_skin_tone": "👨🏼\u200d⚖️",
"man_judge_medium_skin_tone": "👨🏽\u200d⚖️",
"man_juggling": "🤹\u200d♂️",
"man_juggling_dark_skin_tone": "🤹🏿\u200d♂️",
"man_juggling_light_skin_tone": "🤹🏻\u200d♂️",
"man_juggling_medium-dark_skin_tone": "🤹🏾\u200d♂️",
"man_juggling_medium-light_skin_tone": "🤹🏼\u200d♂️",
"man_juggling_medium_skin_tone": "🤹🏽\u200d♂️",
"man_lifting_weights": "🏋️\u200d♂️",
"man_lifting_weights_dark_skin_tone": "🏋🏿\u200d♂️",
"man_lifting_weights_light_skin_tone": "🏋🏻\u200d♂️",
"man_lifting_weights_medium-dark_skin_tone": "🏋🏾\u200d♂️",
"man_lifting_weights_medium-light_skin_tone": "🏋🏼\u200d♂️",
"man_lifting_weights_medium_skin_tone": "🏋🏽\u200d♂️",
"man_light_skin_tone": "👨🏻",
"man_mage": "🧙\u200d♂️",
"man_mage_dark_skin_tone": "🧙🏿\u200d♂️",
"man_mage_light_skin_tone": "🧙🏻\u200d♂️",
"man_mage_medium-dark_skin_tone": "🧙🏾\u200d♂️",
"man_mage_medium-light_skin_tone": "🧙🏼\u200d♂️",
"man_mage_medium_skin_tone": "🧙🏽\u200d♂️",
"man_mechanic": "👨\u200d🔧",
"man_mechanic_dark_skin_tone": "👨🏿\u200d🔧",
"man_mechanic_light_skin_tone": "👨🏻\u200d🔧",
"man_mechanic_medium-dark_skin_tone": "👨🏾\u200d🔧",
"man_mechanic_medium-light_skin_tone": "👨🏼\u200d🔧",
"man_mechanic_medium_skin_tone": "👨🏽\u200d🔧",
"man_medium-dark_skin_tone": "👨🏾",
"man_medium-light_skin_tone": "👨🏼",
"man_medium_skin_tone": "👨🏽",
"man_mountain_biking": "🚵\u200d♂️",
"man_mountain_biking_dark_skin_tone": "🚵🏿\u200d♂️",
"man_mountain_biking_light_skin_tone": "🚵🏻\u200d♂️",
"man_mountain_biking_medium-dark_skin_tone": "🚵🏾\u200d♂️",
"man_mountain_biking_medium-light_skin_tone": "🚵🏼\u200d♂️",
"man_mountain_biking_medium_skin_tone": "🚵🏽\u200d♂️",
"man_office_worker": "👨\u200d💼",
"man_office_worker_dark_skin_tone": "👨🏿\u200d💼",
"man_office_worker_light_skin_tone": "👨🏻\u200d💼",
"man_office_worker_medium-dark_skin_tone": "👨🏾\u200d💼",
"man_office_worker_medium-light_skin_tone": "👨🏼\u200d💼",
"man_office_worker_medium_skin_tone": "👨🏽\u200d💼",
"man_pilot": "👨\u200d✈️",
"man_pilot_dark_skin_tone": "👨🏿\u200d✈️",
"man_pilot_light_skin_tone": "👨🏻\u200d✈️",
"man_pilot_medium-dark_skin_tone": "👨🏾\u200d✈️",
"man_pilot_medium-light_skin_tone": "👨🏼\u200d✈️",
"man_pilot_medium_skin_tone": "👨🏽\u200d✈️",
"man_playing_handball": "🤾\u200d♂️",
"man_playing_handball_dark_skin_tone": "🤾🏿\u200d♂️",
"man_playing_handball_light_skin_tone": "🤾🏻\u200d♂️",
"man_playing_handball_medium-dark_skin_tone": "🤾🏾\u200d♂️",
"man_playing_handball_medium-light_skin_tone": "🤾🏼\u200d♂️",
"man_playing_handball_medium_skin_tone": "🤾🏽\u200d♂️",
"man_playing_water_polo": "🤽\u200d♂️",
"man_playing_water_polo_dark_skin_tone": "🤽🏿\u200d♂️",
"man_playing_water_polo_light_skin_tone": "🤽🏻\u200d♂️",
"man_playing_water_polo_medium-dark_skin_tone": "🤽🏾\u200d♂️",
"man_playing_water_polo_medium-light_skin_tone": "🤽🏼\u200d♂️",
"man_playing_water_polo_medium_skin_tone": "🤽🏽\u200d♂️",
"man_police_officer": "👮\u200d♂️",
"man_police_officer_dark_skin_tone": "👮🏿\u200d♂️",
"man_police_officer_light_skin_tone": "👮🏻\u200d♂️",
"man_police_officer_medium-dark_skin_tone": "👮🏾\u200d♂️",
"man_police_officer_medium-light_skin_tone": "👮🏼\u200d♂️",
"man_police_officer_medium_skin_tone": "👮🏽\u200d♂️",
"man_pouting": "🙎\u200d♂️",
"man_pouting_dark_skin_tone": "🙎🏿\u200d♂️",
"man_pouting_light_skin_tone": "🙎🏻\u200d♂️",
"man_pouting_medium-dark_skin_tone": "🙎🏾\u200d♂️",
"man_pouting_medium-light_skin_tone": "🙎🏼\u200d♂️",
"man_pouting_medium_skin_tone": "🙎🏽\u200d♂️",
"man_raising_hand": "🙋\u200d♂️",
"man_raising_hand_dark_skin_tone": "🙋🏿\u200d♂️",
"man_raising_hand_light_skin_tone": "🙋🏻\u200d♂️",
"man_raising_hand_medium-dark_skin_tone": "🙋🏾\u200d♂️",
"man_raising_hand_medium-light_skin_tone": "🙋🏼\u200d♂️",
"man_raising_hand_medium_skin_tone": "🙋🏽\u200d♂️",
"man_rowing_boat": "🚣\u200d♂️",
"man_rowing_boat_dark_skin_tone": "🚣🏿\u200d♂️",
"man_rowing_boat_light_skin_tone": "🚣🏻\u200d♂️",
"man_rowing_boat_medium-dark_skin_tone": "🚣🏾\u200d♂️",
"man_rowing_boat_medium-light_skin_tone": "🚣🏼\u200d♂️",
"man_rowing_boat_medium_skin_tone": "🚣🏽\u200d♂️",
"man_running": "🏃\u200d♂️",
"man_running_dark_skin_tone": "🏃🏿\u200d♂️",
"man_running_light_skin_tone": "🏃🏻\u200d♂️",
"man_running_medium-dark_skin_tone": "🏃🏾\u200d♂️",
"man_running_medium-light_skin_tone": "🏃🏼\u200d♂️",
"man_running_medium_skin_tone": "🏃🏽\u200d♂️",
"man_scientist": "👨\u200d🔬",
"man_scientist_dark_skin_tone": "👨🏿\u200d🔬",
"man_scientist_light_skin_tone": "👨🏻\u200d🔬",
"man_scientist_medium-dark_skin_tone": "👨🏾\u200d🔬",
"man_scientist_medium-light_skin_tone": "👨🏼\u200d🔬",
"man_scientist_medium_skin_tone": "👨🏽\u200d🔬",
"man_shrugging": "🤷\u200d♂️",
"man_shrugging_dark_skin_tone": "🤷🏿\u200d♂️",
"man_shrugging_light_skin_tone": "🤷🏻\u200d♂️",
"man_shrugging_medium-dark_skin_tone": "🤷🏾\u200d♂️",
"man_shrugging_medium-light_skin_tone": "🤷🏼\u200d♂️",
"man_shrugging_medium_skin_tone": "🤷🏽\u200d♂️",
"man_singer": "👨\u200d🎤",
"man_singer_dark_skin_tone": "👨🏿\u200d🎤",
"man_singer_light_skin_tone": "👨🏻\u200d🎤",
"man_singer_medium-dark_skin_tone": "👨🏾\u200d🎤",
"man_singer_medium-light_skin_tone": "👨🏼\u200d🎤",
"man_singer_medium_skin_tone": "👨🏽\u200d🎤",
"man_student": "👨\u200d🎓",
"man_student_dark_skin_tone": "👨🏿\u200d🎓",
"man_student_light_skin_tone": "👨🏻\u200d🎓",
"man_student_medium-dark_skin_tone": "👨🏾\u200d🎓",
"man_student_medium-light_skin_tone": "👨🏼\u200d🎓",
"man_student_medium_skin_tone": "👨🏽\u200d🎓",
"man_surfing": "🏄\u200d♂️",
"man_surfing_dark_skin_tone": "🏄🏿\u200d♂️",
"man_surfing_light_skin_tone": "🏄🏻\u200d♂️",
"man_surfing_medium-dark_skin_tone": "🏄🏾\u200d♂️",
"man_surfing_medium-light_skin_tone": "🏄🏼\u200d♂️",
"man_surfing_medium_skin_tone": "🏄🏽\u200d♂️",
"man_swimming": "🏊\u200d♂️",
"man_swimming_dark_skin_tone": "🏊🏿\u200d♂️",
"man_swimming_light_skin_tone": "🏊🏻\u200d♂️",
"man_swimming_medium-dark_skin_tone": "🏊🏾\u200d♂️",
"man_swimming_medium-light_skin_tone": "🏊🏼\u200d♂️",
"man_swimming_medium_skin_tone": "🏊🏽\u200d♂️",
"man_teacher": "👨\u200d🏫",
"man_teacher_dark_skin_tone": "👨🏿\u200d🏫",
"man_teacher_light_skin_tone": "👨🏻\u200d🏫",
"man_teacher_medium-dark_skin_tone": "👨🏾\u200d🏫",
"man_teacher_medium-light_skin_tone": "👨🏼\u200d🏫",
"man_teacher_medium_skin_tone": "👨🏽\u200d🏫",
"man_technologist": "👨\u200d💻",
"man_technologist_dark_skin_tone": "👨🏿\u200d💻",
"man_technologist_light_skin_tone": "👨🏻\u200d💻",
"man_technologist_medium-dark_skin_tone": "👨🏾\u200d💻",
"man_technologist_medium-light_skin_tone": "👨🏼\u200d💻",
"man_technologist_medium_skin_tone": "👨🏽\u200d💻",
"man_tipping_hand": "💁\u200d♂️",
"man_tipping_hand_dark_skin_tone": "💁🏿\u200d♂️",
"man_tipping_hand_light_skin_tone": "💁🏻\u200d♂️",
"man_tipping_hand_medium-dark_skin_tone": "💁🏾\u200d♂️",
"man_tipping_hand_medium-light_skin_tone": "💁🏼\u200d♂️",
"man_tipping_hand_medium_skin_tone": "💁🏽\u200d♂️",
"man_vampire": "🧛\u200d♂️",
"man_vampire_dark_skin_tone": "🧛🏿\u200d♂️",
"man_vampire_light_skin_tone": "🧛🏻\u200d♂️",
"man_vampire_medium-dark_skin_tone": "🧛🏾\u200d♂️",
"man_vampire_medium-light_skin_tone": "🧛🏼\u200d♂️",
"man_vampire_medium_skin_tone": "🧛🏽\u200d♂️",
"man_walking": "🚶\u200d♂️",
"man_walking_dark_skin_tone": "🚶🏿\u200d♂️",
"man_walking_light_skin_tone": "🚶🏻\u200d♂️",
"man_walking_medium-dark_skin_tone": "🚶🏾\u200d♂️",
"man_walking_medium-light_skin_tone": "🚶🏼\u200d♂️",
"man_walking_medium_skin_tone": "🚶🏽\u200d♂️",
"man_wearing_turban": "👳\u200d♂️",
"man_wearing_turban_dark_skin_tone": "👳🏿\u200d♂️",
"man_wearing_turban_light_skin_tone": "👳🏻\u200d♂️",
"man_wearing_turban_medium-dark_skin_tone": "👳🏾\u200d♂️",
"man_wearing_turban_medium-light_skin_tone": "👳🏼\u200d♂️",
"man_wearing_turban_medium_skin_tone": "👳🏽\u200d♂️",
"man_with_probing_cane": "👨\u200d🦯",
"man_with_chinese_cap": "👲",
"man_with_chinese_cap_dark_skin_tone": "👲🏿",
"man_with_chinese_cap_light_skin_tone": "👲🏻",
"man_with_chinese_cap_medium-dark_skin_tone": "👲🏾",
"man_with_chinese_cap_medium-light_skin_tone": "👲🏼",
"man_with_chinese_cap_medium_skin_tone": "👲🏽",
"man_zombie": "🧟\u200d♂️",
"mango": "🥭",
"mantelpiece_clock": "🕰",
"manual_wheelchair": "🦽",
"man’s_shoe": "👞",
"map_of_japan": "🗾",
"maple_leaf": "🍁",
"martial_arts_uniform": "🥋",
"mate": "🧉",
"meat_on_bone": "🍖",
"mechanical_arm": "🦾",
"mechanical_leg": "🦿",
"medical_symbol": "⚕",
"megaphone": "📣",
"melon": "🍈",
"memo": "📝",
"men_with_bunny_ears": "👯\u200d♂️",
"men_wrestling": "🤼\u200d♂️",
"menorah": "🕎",
"men’s_room": "🚹",
"mermaid": "🧜\u200d♀️",
"mermaid_dark_skin_tone": "🧜🏿\u200d♀️",
"mermaid_light_skin_tone": "🧜🏻\u200d♀️",
"mermaid_medium-dark_skin_tone": "🧜🏾\u200d♀️",
"mermaid_medium-light_skin_tone": "🧜🏼\u200d♀️",
"mermaid_medium_skin_tone": "🧜🏽\u200d♀️",
"merman": "🧜\u200d♂️",
"merman_dark_skin_tone": "🧜🏿\u200d♂️",
"merman_light_skin_tone": "🧜🏻\u200d♂️",
"merman_medium-dark_skin_tone": "🧜🏾\u200d♂️",
"merman_medium-light_skin_tone": "🧜🏼\u200d♂️",
"merman_medium_skin_tone": "🧜🏽\u200d♂️",
"merperson": "🧜",
"merperson_dark_skin_tone": "🧜🏿",
"merperson_light_skin_tone": "🧜🏻",
"merperson_medium-dark_skin_tone": "🧜🏾",
"merperson_medium-light_skin_tone": "🧜🏼",
"merperson_medium_skin_tone": "🧜🏽",
"metro": "🚇",
"microbe": "🦠",
"microphone": "🎤",
"microscope": "🔬",
"middle_finger": "🖕",
"middle_finger_dark_skin_tone": "🖕🏿",
"middle_finger_light_skin_tone": "🖕🏻",
"middle_finger_medium-dark_skin_tone": "🖕🏾",
"middle_finger_medium-light_skin_tone": "🖕🏼",
"middle_finger_medium_skin_tone": "🖕🏽",
"military_medal": "🎖",
"milky_way": "🌌",
"minibus": "🚐",
"moai": "🗿",
"mobile_phone": "📱",
"mobile_phone_off": "📴",
"mobile_phone_with_arrow": "📲",
"money-mouth_face": "🤑",
"money_bag": "💰",
"money_with_wings": "💸",
"monkey": "🐒",
"monkey_face": "🐵",
"monorail": "🚝",
"moon_cake": "🥮",
"moon_viewing_ceremony": "🎑",
"mosque": "🕌",
"mosquito": "🦟",
"motor_boat": "🛥",
"motor_scooter": "🛵",
"motorcycle": "🏍",
"motorized_wheelchair": "🦼",
"motorway": "🛣",
"mount_fuji": "🗻",
"mountain": "⛰",
"mountain_cableway": "🚠",
"mountain_railway": "🚞",
"mouse": "🐭",
"mouse_face": "🐭",
"mouth": "👄",
"movie_camera": "🎥",
"mushroom": "🍄",
"musical_keyboard": "🎹",
"musical_note": "🎵",
"musical_notes": "🎶",
"musical_score": "🎼",
"muted_speaker": "🔇",
"nail_polish": "💅",
"nail_polish_dark_skin_tone": "💅🏿",
"nail_polish_light_skin_tone": "💅🏻",
"nail_polish_medium-dark_skin_tone": "💅🏾",
"nail_polish_medium-light_skin_tone": "💅🏼",
"nail_polish_medium_skin_tone": "💅🏽",
"name_badge": "📛",
"national_park": "🏞",
"nauseated_face": "🤢",
"nazar_amulet": "🧿",
"necktie": "👔",
"nerd_face": "🤓",
"neutral_face": "😐",
"new_moon": "🌑",
"new_moon_face": "🌚",
"newspaper": "📰",
"next_track_button": "⏭",
"night_with_stars": "🌃",
"nine-thirty": "🕤",
"nine_o’clock": "🕘",
"no_bicycles": "🚳",
"no_entry": "⛔",
"no_littering": "🚯",
"no_mobile_phones": "📵",
"no_one_under_eighteen": "🔞",
"no_pedestrians": "🚷",
"no_smoking": "🚭",
"non-potable_water": "🚱",
"nose": "👃",
"nose_dark_skin_tone": "👃🏿",
"nose_light_skin_tone": "👃🏻",
"nose_medium-dark_skin_tone": "👃🏾",
"nose_medium-light_skin_tone": "👃🏼",
"nose_medium_skin_tone": "👃🏽",
"notebook": "📓",
"notebook_with_decorative_cover": "📔",
"nut_and_bolt": "🔩",
"octopus": "🐙",
"oden": "🍢",
"office_building": "🏢",
"ogre": "👹",
"oil_drum": "🛢",
"old_key": "🗝",
"old_man": "👴",
"old_man_dark_skin_tone": "👴🏿",
"old_man_light_skin_tone": "👴🏻",
"old_man_medium-dark_skin_tone": "👴🏾",
"old_man_medium-light_skin_tone": "👴🏼",
"old_man_medium_skin_tone": "👴🏽",
"old_woman": "👵",
"old_woman_dark_skin_tone": "👵🏿",
"old_woman_light_skin_tone": "👵🏻",
"old_woman_medium-dark_skin_tone": "👵🏾",
"old_woman_medium-light_skin_tone": "👵🏼",
"old_woman_medium_skin_tone": "👵🏽",
"older_adult": "🧓",
"older_adult_dark_skin_tone": "🧓🏿",
"older_adult_light_skin_tone": "🧓🏻",
"older_adult_medium-dark_skin_tone": "🧓🏾",
"older_adult_medium-light_skin_tone": "🧓🏼",
"older_adult_medium_skin_tone": "🧓🏽",
"om": "🕉",
"oncoming_automobile": "🚘",
"oncoming_bus": "🚍",
"oncoming_fist": "👊",
"oncoming_fist_dark_skin_tone": "👊🏿",
"oncoming_fist_light_skin_tone": "👊🏻",
"oncoming_fist_medium-dark_skin_tone": "👊🏾",
"oncoming_fist_medium-light_skin_tone": "👊🏼",
"oncoming_fist_medium_skin_tone": "👊🏽",
"oncoming_police_car": "🚔",
"oncoming_taxi": "🚖",
"one-piece_swimsuit": "🩱",
"one-thirty": "🕜",
"one_o’clock": "🕐",
"onion": "🧅",
"open_book": "📖",
"open_file_folder": "📂",
"open_hands": "👐",
"open_hands_dark_skin_tone": "👐🏿",
"open_hands_light_skin_tone": "👐🏻",
"open_hands_medium-dark_skin_tone": "👐🏾",
"open_hands_medium-light_skin_tone": "👐🏼",
"open_hands_medium_skin_tone": "👐🏽",
"open_mailbox_with_lowered_flag": "📭",
"open_mailbox_with_raised_flag": "📬",
"optical_disk": "💿",
"orange_book": "📙",
"orange_circle": "🟠",
"orange_heart": "🧡",
"orange_square": "🟧",
"orangutan": "🦧",
"orthodox_cross": "☦",
"otter": "🦦",
"outbox_tray": "📤",
"owl": "🦉",
"ox": "🐂",
"oyster": "🦪",
"package": "📦",
"page_facing_up": "📄",
"page_with_curl": "📃",
"pager": "📟",
"paintbrush": "🖌",
"palm_tree": "🌴",
"palms_up_together": "🤲",
"palms_up_together_dark_skin_tone": "🤲🏿",
"palms_up_together_light_skin_tone": "🤲🏻",
"palms_up_together_medium-dark_skin_tone": "🤲🏾",
"palms_up_together_medium-light_skin_tone": "🤲🏼",
"palms_up_together_medium_skin_tone": "🤲🏽",
"pancakes": "🥞",
"panda_face": "🐼",
"paperclip": "📎",
"parrot": "🦜",
"part_alternation_mark": "〽",
"party_popper": "🎉",
"partying_face": "🥳",
"passenger_ship": "🛳",
"passport_control": "🛂",
"pause_button": "⏸",
"paw_prints": "🐾",
"peace_symbol": "☮",
"peach": "🍑",
"peacock": "🦚",
"peanuts": "🥜",
"pear": "🍐",
"pen": "🖊",
"pencil": "📝",
"penguin": "🐧",
"pensive_face": "😔",
"people_holding_hands": "🧑\u200d🤝\u200d🧑",
"people_with_bunny_ears": "👯",
"people_wrestling": "🤼",
"performing_arts": "🎭",
"persevering_face": "😣",
"person_biking": "🚴",
"person_biking_dark_skin_tone": "🚴🏿",
"person_biking_light_skin_tone": "🚴🏻",
"person_biking_medium-dark_skin_tone": "🚴🏾",
"person_biking_medium-light_skin_tone": "🚴🏼",
"person_biking_medium_skin_tone": "🚴🏽",
"person_bouncing_ball": "⛹",
"person_bouncing_ball_dark_skin_tone": "⛹🏿",
"person_bouncing_ball_light_skin_tone": "⛹🏻",
"person_bouncing_ball_medium-dark_skin_tone": "⛹🏾",
"person_bouncing_ball_medium-light_skin_tone": "⛹🏼",
"person_bouncing_ball_medium_skin_tone": "⛹🏽",
"person_bowing": "🙇",
"person_bowing_dark_skin_tone": "🙇🏿",
"person_bowing_light_skin_tone": "🙇🏻",
"person_bowing_medium-dark_skin_tone": "🙇🏾",
"person_bowing_medium-light_skin_tone": "🙇🏼",
"person_bowing_medium_skin_tone": "🙇🏽",
"person_cartwheeling": "🤸",
"person_cartwheeling_dark_skin_tone": "🤸🏿",
"person_cartwheeling_light_skin_tone": "🤸🏻",
"person_cartwheeling_medium-dark_skin_tone": "🤸🏾",
"person_cartwheeling_medium-light_skin_tone": "🤸🏼",
"person_cartwheeling_medium_skin_tone": "🤸🏽",
"person_climbing": "🧗",
"person_climbing_dark_skin_tone": "🧗🏿",
"person_climbing_light_skin_tone": "🧗🏻",
"person_climbing_medium-dark_skin_tone": "🧗🏾",
"person_climbing_medium-light_skin_tone": "🧗🏼",
"person_climbing_medium_skin_tone": "🧗🏽",
"person_facepalming": "🤦",
"person_facepalming_dark_skin_tone": "🤦🏿",
"person_facepalming_light_skin_tone": "🤦🏻",
"person_facepalming_medium-dark_skin_tone": "🤦🏾",
"person_facepalming_medium-light_skin_tone": "🤦🏼",
"person_facepalming_medium_skin_tone": "🤦🏽",
"person_fencing": "🤺",
"person_frowning": "🙍",
"person_frowning_dark_skin_tone": "🙍🏿",
"person_frowning_light_skin_tone": "🙍🏻",
"person_frowning_medium-dark_skin_tone": "🙍🏾",
"person_frowning_medium-light_skin_tone": "🙍🏼",
"person_frowning_medium_skin_tone": "🙍🏽",
"person_gesturing_no": "🙅",
"person_gesturing_no_dark_skin_tone": "🙅🏿",
"person_gesturing_no_light_skin_tone": "🙅🏻",
"person_gesturing_no_medium-dark_skin_tone": "🙅🏾",
"person_gesturing_no_medium-light_skin_tone": "🙅🏼",
"person_gesturing_no_medium_skin_tone": "🙅🏽",
"person_gesturing_ok": "🙆",
"person_gesturing_ok_dark_skin_tone": "🙆🏿",
"person_gesturing_ok_light_skin_tone": "🙆🏻",
"person_gesturing_ok_medium-dark_skin_tone": "🙆🏾",
"person_gesturing_ok_medium-light_skin_tone": "🙆🏼",
"person_gesturing_ok_medium_skin_tone": "🙆🏽",
"person_getting_haircut": "💇",
"person_getting_haircut_dark_skin_tone": "💇🏿",
"person_getting_haircut_light_skin_tone": "💇🏻",
"person_getting_haircut_medium-dark_skin_tone": "💇🏾",
"person_getting_haircut_medium-light_skin_tone": "💇🏼",
"person_getting_haircut_medium_skin_tone": "💇🏽",
"person_getting_massage": "💆",
"person_getting_massage_dark_skin_tone": "💆🏿",
"person_getting_massage_light_skin_tone": "💆🏻",
"person_getting_massage_medium-dark_skin_tone": "💆🏾",
"person_getting_massage_medium-light_skin_tone": "💆🏼",
"person_getting_massage_medium_skin_tone": "💆🏽",
"person_golfing": "🏌",
"person_golfing_dark_skin_tone": "🏌🏿",
"person_golfing_light_skin_tone": "🏌🏻",
"person_golfing_medium-dark_skin_tone": "🏌🏾",
"person_golfing_medium-light_skin_tone": "🏌🏼",
"person_golfing_medium_skin_tone": "🏌🏽",
"person_in_bed": "🛌",
"person_in_bed_dark_skin_tone": "🛌🏿",
"person_in_bed_light_skin_tone": "🛌🏻",
"person_in_bed_medium-dark_skin_tone": "🛌🏾",
"person_in_bed_medium-light_skin_tone": "🛌🏼",
"person_in_bed_medium_skin_tone": "🛌🏽",
"person_in_lotus_position": "🧘",
"person_in_lotus_position_dark_skin_tone": "🧘🏿",
"person_in_lotus_position_light_skin_tone": "🧘🏻",
"person_in_lotus_position_medium-dark_skin_tone": "🧘🏾",
"person_in_lotus_position_medium-light_skin_tone": "🧘🏼",
"person_in_lotus_position_medium_skin_tone": "🧘🏽",
"person_in_steamy_room": "🧖",
"person_in_steamy_room_dark_skin_tone": "🧖🏿",
"person_in_steamy_room_light_skin_tone": "🧖🏻",
"person_in_steamy_room_medium-dark_skin_tone": "🧖🏾",
"person_in_steamy_room_medium-light_skin_tone": "🧖🏼",
"person_in_steamy_room_medium_skin_tone": "🧖🏽",
"person_juggling": "🤹",
"person_juggling_dark_skin_tone": "🤹🏿",
"person_juggling_light_skin_tone": "🤹🏻",
"person_juggling_medium-dark_skin_tone": "🤹🏾",
"person_juggling_medium-light_skin_tone": "🤹🏼",
"person_juggling_medium_skin_tone": "🤹🏽",
"person_kneeling": "🧎",
"person_lifting_weights": "🏋",
"person_lifting_weights_dark_skin_tone": "🏋🏿",
"person_lifting_weights_light_skin_tone": "🏋🏻",
"person_lifting_weights_medium-dark_skin_tone": "🏋🏾",
"person_lifting_weights_medium-light_skin_tone": "🏋🏼",
"person_lifting_weights_medium_skin_tone": "🏋🏽",
"person_mountain_biking": "🚵",
"person_mountain_biking_dark_skin_tone": "🚵🏿",
"person_mountain_biking_light_skin_tone": "🚵🏻",
"person_mountain_biking_medium-dark_skin_tone": "🚵🏾",
"person_mountain_biking_medium-light_skin_tone": "🚵🏼",
"person_mountain_biking_medium_skin_tone": "🚵🏽",
"person_playing_handball": "🤾",
"person_playing_handball_dark_skin_tone": "🤾🏿",
"person_playing_handball_light_skin_tone": "🤾🏻",
"person_playing_handball_medium-dark_skin_tone": "🤾🏾",
"person_playing_handball_medium-light_skin_tone": "🤾🏼",
"person_playing_handball_medium_skin_tone": "🤾🏽",
"person_playing_water_polo": "🤽",
"person_playing_water_polo_dark_skin_tone": "🤽🏿",
"person_playing_water_polo_light_skin_tone": "🤽🏻",
"person_playing_water_polo_medium-dark_skin_tone": "🤽🏾",
"person_playing_water_polo_medium-light_skin_tone": "🤽🏼",
"person_playing_water_polo_medium_skin_tone": "🤽🏽",
"person_pouting": "🙎",
"person_pouting_dark_skin_tone": "🙎🏿",
"person_pouting_light_skin_tone": "🙎🏻",
"person_pouting_medium-dark_skin_tone": "🙎🏾",
"person_pouting_medium-light_skin_tone": "🙎🏼",
"person_pouting_medium_skin_tone": "🙎🏽",
"person_raising_hand": "🙋",
"person_raising_hand_dark_skin_tone": "🙋🏿",
"person_raising_hand_light_skin_tone": "🙋🏻",
"person_raising_hand_medium-dark_skin_tone": "🙋🏾",
"person_raising_hand_medium-light_skin_tone": "🙋🏼",
"person_raising_hand_medium_skin_tone": "🙋🏽",
"person_rowing_boat": "🚣",
"person_rowing_boat_dark_skin_tone": "🚣🏿",
"person_rowing_boat_light_skin_tone": "🚣🏻",
"person_rowing_boat_medium-dark_skin_tone": "🚣🏾",
"person_rowing_boat_medium-light_skin_tone": "🚣🏼",
"person_rowing_boat_medium_skin_tone": "🚣🏽",
"person_running": "🏃",
"person_running_dark_skin_tone": "🏃🏿",
"person_running_light_skin_tone": "🏃🏻",
"person_running_medium-dark_skin_tone": "🏃🏾",
"person_running_medium-light_skin_tone": "🏃🏼",
"person_running_medium_skin_tone": "🏃🏽",
"person_shrugging": "🤷",
"person_shrugging_dark_skin_tone": "🤷🏿",
"person_shrugging_light_skin_tone": "🤷🏻",
"person_shrugging_medium-dark_skin_tone": "🤷🏾",
"person_shrugging_medium-light_skin_tone": "🤷🏼",
"person_shrugging_medium_skin_tone": "🤷🏽",
"person_standing": "🧍",
"person_surfing": "🏄",
"person_surfing_dark_skin_tone": "🏄🏿",
"person_surfing_light_skin_tone": "🏄🏻",
"person_surfing_medium-dark_skin_tone": "🏄🏾",
"person_surfing_medium-light_skin_tone": "🏄🏼",
"person_surfing_medium_skin_tone": "🏄🏽",
"person_swimming": "🏊",
"person_swimming_dark_skin_tone": "🏊🏿",
"person_swimming_light_skin_tone": "🏊🏻",
"person_swimming_medium-dark_skin_tone": "🏊🏾",
"person_swimming_medium-light_skin_tone": "🏊🏼",
"person_swimming_medium_skin_tone": "🏊🏽",
"person_taking_bath": "🛀",
"person_taking_bath_dark_skin_tone": "🛀🏿",
"person_taking_bath_light_skin_tone": "🛀🏻",
"person_taking_bath_medium-dark_skin_tone": "🛀🏾",
"person_taking_bath_medium-light_skin_tone": "🛀🏼",
"person_taking_bath_medium_skin_tone": "🛀🏽",
"person_tipping_hand": "💁",
"person_tipping_hand_dark_skin_tone": "💁🏿",
"person_tipping_hand_light_skin_tone": "💁🏻",
"person_tipping_hand_medium-dark_skin_tone": "💁🏾",
"person_tipping_hand_medium-light_skin_tone": "💁🏼",
"person_tipping_hand_medium_skin_tone": "💁🏽",
"person_walking": "🚶",
"person_walking_dark_skin_tone": "🚶🏿",
"person_walking_light_skin_tone": "🚶🏻",
"person_walking_medium-dark_skin_tone": "🚶🏾",
"person_walking_medium-light_skin_tone": "🚶🏼",
"person_walking_medium_skin_tone": "🚶🏽",
"person_wearing_turban": "👳",
"person_wearing_turban_dark_skin_tone": "👳🏿",
"person_wearing_turban_light_skin_tone": "👳🏻",
"person_wearing_turban_medium-dark_skin_tone": "👳🏾",
"person_wearing_turban_medium-light_skin_tone": "👳🏼",
"person_wearing_turban_medium_skin_tone": "👳🏽",
"petri_dish": "🧫",
"pick": "⛏",
"pie": "🥧",
"pig": "🐷",
"pig_face": "🐷",
"pig_nose": "🐽",
"pile_of_poo": "💩",
"pill": "💊",
"pinching_hand": "🤏",
"pine_decoration": "🎍",
"pineapple": "🍍",
"ping_pong": "🏓",
"pirate_flag": "🏴\u200d☠️",
"pistol": "🔫",
"pizza": "🍕",
"place_of_worship": "🛐",
"play_button": "▶",
"play_or_pause_button": "⏯",
"pleading_face": "🥺",
"police_car": "🚓",
"police_car_light": "🚨",
"police_officer": "👮",
"police_officer_dark_skin_tone": "👮🏿",
"police_officer_light_skin_tone": "👮🏻",
"police_officer_medium-dark_skin_tone": "👮🏾",
"police_officer_medium-light_skin_tone": "👮🏼",
"police_officer_medium_skin_tone": "👮🏽",
"poodle": "🐩",
"pool_8_ball": "🎱",
"popcorn": "🍿",
"post_office": "🏣",
"postal_horn": "📯",
"postbox": "📮",
"pot_of_food": "🍲",
"potable_water": "🚰",
"potato": "🥔",
"poultry_leg": "🍗",
"pound_banknote": "💷",
"pouting_cat_face": "😾",
"pouting_face": "😡",
"prayer_beads": "📿",
"pregnant_woman": "🤰",
"pregnant_woman_dark_skin_tone": "🤰🏿",
"pregnant_woman_light_skin_tone": "🤰🏻",
"pregnant_woman_medium-dark_skin_tone": "🤰🏾",
"pregnant_woman_medium-light_skin_tone": "🤰🏼",
"pregnant_woman_medium_skin_tone": "🤰🏽",
"pretzel": "🥨",
"probing_cane": "🦯",
"prince": "🤴",
"prince_dark_skin_tone": "🤴🏿",
"prince_light_skin_tone": "🤴🏻",
"prince_medium-dark_skin_tone": "🤴🏾",
"prince_medium-light_skin_tone": "🤴🏼",
"prince_medium_skin_tone": "🤴🏽",
"princess": "👸",
"princess_dark_skin_tone": "👸🏿",
"princess_light_skin_tone": "👸🏻",
"princess_medium-dark_skin_tone": "👸🏾",
"princess_medium-light_skin_tone": "👸🏼",
"princess_medium_skin_tone": "👸🏽",
"printer": "🖨",
"prohibited": "🚫",
"purple_circle": "🟣",
"purple_heart": "💜",
"purple_square": "🟪",
"purse": "👛",
"pushpin": "📌",
"question_mark": "❓",
"rabbit": "🐰",
"rabbit_face": "🐰",
"raccoon": "🦝",
"racing_car": "🏎",
"radio": "📻",
"radio_button": "🔘",
"radioactive": "☢",
"railway_car": "🚃",
"railway_track": "🛤",
"rainbow": "🌈",
"rainbow_flag": "🏳️\u200d🌈",
"raised_back_of_hand": "🤚",
"raised_back_of_hand_dark_skin_tone": "🤚🏿",
"raised_back_of_hand_light_skin_tone": "🤚🏻",
"raised_back_of_hand_medium-dark_skin_tone": "🤚🏾",
"raised_back_of_hand_medium-light_skin_tone": "🤚🏼",
"raised_back_of_hand_medium_skin_tone": "🤚🏽",
"raised_fist": "✊",
"raised_fist_dark_skin_tone": "✊🏿",
"raised_fist_light_skin_tone": "✊🏻",
"raised_fist_medium-dark_skin_tone": "✊🏾",
"raised_fist_medium-light_skin_tone": "✊🏼",
"raised_fist_medium_skin_tone": "✊🏽",
"raised_hand": "✋",
"raised_hand_dark_skin_tone": "✋🏿",
"raised_hand_light_skin_tone": "✋🏻",
"raised_hand_medium-dark_skin_tone": "✋🏾",
"raised_hand_medium-light_skin_tone": "✋🏼",
"raised_hand_medium_skin_tone": "✋🏽",
"raising_hands": "🙌",
"raising_hands_dark_skin_tone": "🙌🏿",
"raising_hands_light_skin_tone": "🙌🏻",
"raising_hands_medium-dark_skin_tone": "🙌🏾",
"raising_hands_medium-light_skin_tone": "🙌🏼",
"raising_hands_medium_skin_tone": "🙌🏽",
"ram": "🐏",
"rat": "🐀",
"razor": "🪒",
"ringed_planet": "🪐",
"receipt": "🧾",
"record_button": "⏺",
"recycling_symbol": "♻",
"red_apple": "🍎",
"red_circle": "🔴",
"red_envelope": "🧧",
"red_hair": "🦰",
"red-haired_man": "👨\u200d🦰",
"red-haired_woman": "👩\u200d🦰",
"red_heart": "❤",
"red_paper_lantern": "🏮",
"red_square": "🟥",
"red_triangle_pointed_down": "🔻",
"red_triangle_pointed_up": "🔺",
"registered": "®",
"relieved_face": "😌",
"reminder_ribbon": "🎗",
"repeat_button": "🔁",
"repeat_single_button": "🔂",
"rescue_worker’s_helmet": "⛑",
"restroom": "🚻",
"reverse_button": "◀",
"revolving_hearts": "💞",
"rhinoceros": "🦏",
"ribbon": "🎀",
"rice_ball": "🍙",
"rice_cracker": "🍘",
"right-facing_fist": "🤜",
"right-facing_fist_dark_skin_tone": "🤜🏿",
"right-facing_fist_light_skin_tone": "🤜🏻",
"right-facing_fist_medium-dark_skin_tone": "🤜🏾",
"right-facing_fist_medium-light_skin_tone": "🤜🏼",
"right-facing_fist_medium_skin_tone": "🤜🏽",
"right_anger_bubble": "🗯",
"right_arrow": "➡",
"right_arrow_curving_down": "⤵",
"right_arrow_curving_left": "↩",
"right_arrow_curving_up": "⤴",
"ring": "💍",
"roasted_sweet_potato": "🍠",
"robot_face": "🤖",
"rocket": "🚀",
"roll_of_paper": "🧻",
"rolled-up_newspaper": "🗞",
"roller_coaster": "🎢",
"rolling_on_the_floor_laughing": "🤣",
"rooster": "🐓",
"rose": "🌹",
"rosette": "🏵",
"round_pushpin": "📍",
"rugby_football": "🏉",
"running_shirt": "🎽",
"running_shoe": "👟",
"sad_but_relieved_face": "😥",
"safety_pin": "🧷",
"safety_vest": "🦺",
"salt": "🧂",
"sailboat": "⛵",
"sake": "🍶",
"sandwich": "🥪",
"sari": "🥻",
"satellite": "📡",
"satellite_antenna": "📡",
"sauropod": "🦕",
"saxophone": "🎷",
"scarf": "🧣",
"school": "🏫",
"school_backpack": "🎒",
"scissors": "✂",
"scorpion": "🦂",
"scroll": "📜",
"seat": "💺",
"see-no-evil_monkey": "🙈",
"seedling": "🌱",
"selfie": "🤳",
"selfie_dark_skin_tone": "🤳🏿",
"selfie_light_skin_tone": "🤳🏻",
"selfie_medium-dark_skin_tone": "🤳🏾",
"selfie_medium-light_skin_tone": "🤳🏼",
"selfie_medium_skin_tone": "🤳🏽",
"service_dog": "🐕\u200d🦺",
"seven-thirty": "🕢",
"seven_o’clock": "🕖",
"shallow_pan_of_food": "🥘",
"shamrock": "☘",
"shark": "🦈",
"shaved_ice": "🍧",
"sheaf_of_rice": "🌾",
"shield": "🛡",
"shinto_shrine": "⛩",
"ship": "🚢",
"shooting_star": "🌠",
"shopping_bags": "🛍",
"shopping_cart": "🛒",
"shortcake": "🍰",
"shorts": "🩳",
"shower": "🚿",
"shrimp": "🦐",
"shuffle_tracks_button": "🔀",
"shushing_face": "🤫",
"sign_of_the_horns": "🤘",
"sign_of_the_horns_dark_skin_tone": "🤘🏿",
"sign_of_the_horns_light_skin_tone": "🤘🏻",
"sign_of_the_horns_medium-dark_skin_tone": "🤘🏾",
"sign_of_the_horns_medium-light_skin_tone": "🤘🏼",
"sign_of_the_horns_medium_skin_tone": "🤘🏽",
"six-thirty": "🕡",
"six_o’clock": "🕕",
"skateboard": "🛹",
"skier": "⛷",
"skis": "🎿",
"skull": "💀",
"skull_and_crossbones": "☠",
"skunk": "🦨",
"sled": "🛷",
"sleeping_face": "😴",
"sleepy_face": "😪",
"slightly_frowning_face": "🙁",
"slightly_smiling_face": "🙂",
"slot_machine": "🎰",
"sloth": "🦥",
"small_airplane": "🛩",
"small_blue_diamond": "🔹",
"small_orange_diamond": "🔸",
"smiling_cat_face_with_heart-eyes": "😻",
"smiling_face": "☺",
"smiling_face_with_halo": "😇",
"smiling_face_with_3_hearts": "🥰",
"smiling_face_with_heart-eyes": "😍",
"smiling_face_with_horns": "😈",
"smiling_face_with_smiling_eyes": "😊",
"smiling_face_with_sunglasses": "😎",
"smirking_face": "😏",
"snail": "🐌",
"snake": "🐍",
"sneezing_face": "🤧",
"snow-capped_mountain": "🏔",
"snowboarder": "🏂",
"snowboarder_dark_skin_tone": "🏂🏿",
"snowboarder_light_skin_tone": "🏂🏻",
"snowboarder_medium-dark_skin_tone": "🏂🏾",
"snowboarder_medium-light_skin_tone": "🏂🏼",
"snowboarder_medium_skin_tone": "🏂🏽",
"snowflake": "❄",
"snowman": "☃",
"snowman_without_snow": "⛄",
"soap": "🧼",
"soccer_ball": "⚽",
"socks": "🧦",
"softball": "🥎",
"soft_ice_cream": "🍦",
"spade_suit": "♠",
"spaghetti": "🍝",
"sparkle": "❇",
"sparkler": "🎇",
"sparkles": "✨",
"sparkling_heart": "💖",
"speak-no-evil_monkey": "🙊",
"speaker_high_volume": "🔊",
"speaker_low_volume": "🔈",
"speaker_medium_volume": "🔉",
"speaking_head": "🗣",
"speech_balloon": "💬",
"speedboat": "🚤",
"spider": "🕷",
"spider_web": "🕸",
"spiral_calendar": "🗓",
"spiral_notepad": "🗒",
"spiral_shell": "🐚",
"spoon": "🥄",
"sponge": "🧽",
"sport_utility_vehicle": "🚙",
"sports_medal": "🏅",
"spouting_whale": "🐳",
"squid": "🦑",
"squinting_face_with_tongue": "😝",
"stadium": "🏟",
"star-struck": "🤩",
"star_and_crescent": "☪",
"star_of_david": "✡",
"station": "🚉",
"steaming_bowl": "🍜",
"stethoscope": "🩺",
"stop_button": "⏹",
"stop_sign": "🛑",
"stopwatch": "⏱",
"straight_ruler": "📏",
"strawberry": "🍓",
"studio_microphone": "🎙",
"stuffed_flatbread": "🥙",
"sun": "☀",
"sun_behind_cloud": "⛅",
"sun_behind_large_cloud": "🌥",
"sun_behind_rain_cloud": "🌦",
"sun_behind_small_cloud": "🌤",
"sun_with_face": "🌞",
"sunflower": "🌻",
"sunglasses": "😎",
"sunrise": "🌅",
"sunrise_over_mountains": "🌄",
"sunset": "🌇",
"superhero": "🦸",
"supervillain": "🦹",
"sushi": "🍣",
"suspension_railway": "🚟",
"swan": "🦢",
"sweat_droplets": "💦",
"synagogue": "🕍",
"syringe": "💉",
"t-shirt": "👕",
"taco": "🌮",
"takeout_box": "🥡",
"tanabata_tree": "🎋",
"tangerine": "🍊",
"taxi": "🚕",
"teacup_without_handle": "🍵",
"tear-off_calendar": "📆",
"teddy_bear": "🧸",
"telephone": "☎",
"telephone_receiver": "📞",
"telescope": "🔭",
"television": "📺",
"ten-thirty": "🕥",
"ten_o’clock": "🕙",
"tennis": "🎾",
"tent": "⛺",
"test_tube": "🧪",
"thermometer": "🌡",
"thinking_face": "🤔",
"thought_balloon": "💭",
"thread": "🧵",
"three-thirty": "🕞",
"three_o’clock": "🕒",
"thumbs_down": "👎",
"thumbs_down_dark_skin_tone": "👎🏿",
"thumbs_down_light_skin_tone": "👎🏻",
"thumbs_down_medium-dark_skin_tone": "👎🏾",
"thumbs_down_medium-light_skin_tone": "👎🏼",
"thumbs_down_medium_skin_tone": "👎🏽",
"thumbs_up": "👍",
"thumbs_up_dark_skin_tone": "👍🏿",
"thumbs_up_light_skin_tone": "👍🏻",
"thumbs_up_medium-dark_skin_tone": "👍🏾",
"thumbs_up_medium-light_skin_tone": "👍🏼",
"thumbs_up_medium_skin_tone": "👍🏽",
"ticket": "🎫",
"tiger": "🐯",
"tiger_face": "🐯",
"timer_clock": "⏲",
"tired_face": "😫",
"toolbox": "🧰",
"toilet": "🚽",
"tomato": "🍅",
"tongue": "👅",
"tooth": "🦷",
"top_hat": "🎩",
"tornado": "🌪",
"trackball": "🖲",
"tractor": "🚜",
"trade_mark": "™",
"train": "🚋",
"tram": "🚊",
"tram_car": "🚋",
"triangular_flag": "🚩",
"triangular_ruler": "📐",
"trident_emblem": "🔱",
"trolleybus": "🚎",
"trophy": "🏆",
"tropical_drink": "🍹",
"tropical_fish": "🐠",
"trumpet": "🎺",
"tulip": "🌷",
"tumbler_glass": "🥃",
"turtle": "🐢",
"twelve-thirty": "🕧",
"twelve_o’clock": "🕛",
"two-hump_camel": "🐫",
"two-thirty": "🕝",
"two_hearts": "💕",
"two_men_holding_hands": "👬",
"two_o’clock": "🕑",
"two_women_holding_hands": "👭",
"umbrella": "☂",
"umbrella_on_ground": "⛱",
"umbrella_with_rain_drops": "☔",
"unamused_face": "😒",
"unicorn_face": "🦄",
"unlocked": "🔓",
"up-down_arrow": "↕",
"up-left_arrow": "↖",
"up-right_arrow": "↗",
"up_arrow": "⬆",
"upside-down_face": "🙃",
"upwards_button": "🔼",
"vampire": "🧛",
"vampire_dark_skin_tone": "🧛🏿",
"vampire_light_skin_tone": "🧛🏻",
"vampire_medium-dark_skin_tone": "🧛🏾",
"vampire_medium-light_skin_tone": "🧛🏼",
"vampire_medium_skin_tone": "🧛🏽",
"vertical_traffic_light": "🚦",
"vibration_mode": "📳",
"victory_hand": "✌",
"victory_hand_dark_skin_tone": "✌🏿",
"victory_hand_light_skin_tone": "✌🏻",
"victory_hand_medium-dark_skin_tone": "✌🏾",
"victory_hand_medium-light_skin_tone": "✌🏼",
"victory_hand_medium_skin_tone": "✌🏽",
"video_camera": "📹",
"video_game": "🎮",
"videocassette": "📼",
"violin": "🎻",
"volcano": "🌋",
"volleyball": "🏐",
"vulcan_salute": "🖖",
"vulcan_salute_dark_skin_tone": "🖖🏿",
"vulcan_salute_light_skin_tone": "🖖🏻",
"vulcan_salute_medium-dark_skin_tone": "🖖🏾",
"vulcan_salute_medium-light_skin_tone": "🖖🏼",
"vulcan_salute_medium_skin_tone": "🖖🏽",
"waffle": "🧇",
"waning_crescent_moon": "🌘",
"waning_gibbous_moon": "🌖",
"warning": "⚠",
"wastebasket": "🗑",
"watch": "⌚",
"water_buffalo": "🐃",
"water_closet": "🚾",
"water_wave": "🌊",
"watermelon": "🍉",
"waving_hand": "👋",
"waving_hand_dark_skin_tone": "👋🏿",
"waving_hand_light_skin_tone": "👋🏻",
"waving_hand_medium-dark_skin_tone": "👋🏾",
"waving_hand_medium-light_skin_tone": "👋🏼",
"waving_hand_medium_skin_tone": "👋🏽",
"wavy_dash": "〰",
"waxing_crescent_moon": "🌒",
"waxing_gibbous_moon": "🌔",
"weary_cat_face": "🙀",
"weary_face": "😩",
"wedding": "💒",
"whale": "🐳",
"wheel_of_dharma": "☸",
"wheelchair_symbol": "♿",
"white_circle": "⚪",
"white_exclamation_mark": "❕",
"white_flag": "🏳",
"white_flower": "💮",
"white_hair": "🦳",
"white-haired_man": "👨\u200d🦳",
"white-haired_woman": "👩\u200d🦳",
"white_heart": "🤍",
"white_heavy_check_mark": "✅",
"white_large_square": "⬜",
"white_medium-small_square": "◽",
"white_medium_square": "◻",
"white_medium_star": "⭐",
"white_question_mark": "❔",
"white_small_square": "▫",
"white_square_button": "🔳",
"wilted_flower": "🥀",
"wind_chime": "🎐",
"wind_face": "🌬",
"wine_glass": "🍷",
"winking_face": "😉",
"winking_face_with_tongue": "😜",
"wolf_face": "🐺",
"woman": "👩",
"woman_artist": "👩\u200d🎨",
"woman_artist_dark_skin_tone": "👩🏿\u200d🎨",
"woman_artist_light_skin_tone": "👩🏻\u200d🎨",
"woman_artist_medium-dark_skin_tone": "👩🏾\u200d🎨",
"woman_artist_medium-light_skin_tone": "👩🏼\u200d🎨",
"woman_artist_medium_skin_tone": "👩🏽\u200d🎨",
"woman_astronaut": "👩\u200d🚀",
"woman_astronaut_dark_skin_tone": "👩🏿\u200d🚀",
"woman_astronaut_light_skin_tone": "👩🏻\u200d🚀",
"woman_astronaut_medium-dark_skin_tone": "👩🏾\u200d🚀",
"woman_astronaut_medium-light_skin_tone": "👩🏼\u200d🚀",
"woman_astronaut_medium_skin_tone": "👩🏽\u200d🚀",
"woman_biking": "🚴\u200d♀️",
"woman_biking_dark_skin_tone": "🚴🏿\u200d♀️",
"woman_biking_light_skin_tone": "🚴🏻\u200d♀️",
"woman_biking_medium-dark_skin_tone": "🚴🏾\u200d♀️",
"woman_biking_medium-light_skin_tone": "🚴🏼\u200d♀️",
"woman_biking_medium_skin_tone": "🚴🏽\u200d♀️",
"woman_bouncing_ball": "⛹️\u200d♀️",
"woman_bouncing_ball_dark_skin_tone": "⛹🏿\u200d♀️",
"woman_bouncing_ball_light_skin_tone": "⛹🏻\u200d♀️",
"woman_bouncing_ball_medium-dark_skin_tone": "⛹🏾\u200d♀️",
"woman_bouncing_ball_medium-light_skin_tone": "⛹🏼\u200d♀️",
"woman_bouncing_ball_medium_skin_tone": "⛹🏽\u200d♀️",
"woman_bowing": "🙇\u200d♀️",
"woman_bowing_dark_skin_tone": "🙇🏿\u200d♀️",
"woman_bowing_light_skin_tone": "🙇🏻\u200d♀️",
"woman_bowing_medium-dark_skin_tone": "🙇🏾\u200d♀️",
"woman_bowing_medium-light_skin_tone": "🙇🏼\u200d♀️",
"woman_bowing_medium_skin_tone": "🙇🏽\u200d♀️",
"woman_cartwheeling": "🤸\u200d♀️",
"woman_cartwheeling_dark_skin_tone": "🤸🏿\u200d♀️",
"woman_cartwheeling_light_skin_tone": "🤸🏻\u200d♀️",
"woman_cartwheeling_medium-dark_skin_tone": "🤸🏾\u200d♀️",
"woman_cartwheeling_medium-light_skin_tone": "🤸🏼\u200d♀️",
"woman_cartwheeling_medium_skin_tone": "🤸🏽\u200d♀️",
"woman_climbing": "🧗\u200d♀️",
"woman_climbing_dark_skin_tone": "🧗🏿\u200d♀️",
"woman_climbing_light_skin_tone": "🧗🏻\u200d♀️",
"woman_climbing_medium-dark_skin_tone": "🧗🏾\u200d♀️",
"woman_climbing_medium-light_skin_tone": "🧗🏼\u200d♀️",
"woman_climbing_medium_skin_tone": "🧗🏽\u200d♀️",
"woman_construction_worker": "👷\u200d♀️",
"woman_construction_worker_dark_skin_tone": "👷🏿\u200d♀️",
"woman_construction_worker_light_skin_tone": "👷🏻\u200d♀️",
"woman_construction_worker_medium-dark_skin_tone": "👷🏾\u200d♀️",
"woman_construction_worker_medium-light_skin_tone": "👷🏼\u200d♀️",
"woman_construction_worker_medium_skin_tone": "👷🏽\u200d♀️",
"woman_cook": "👩\u200d🍳",
"woman_cook_dark_skin_tone": "👩🏿\u200d🍳",
"woman_cook_light_skin_tone": "👩🏻\u200d🍳",
"woman_cook_medium-dark_skin_tone": "👩🏾\u200d🍳",
"woman_cook_medium-light_skin_tone": "👩🏼\u200d🍳",
"woman_cook_medium_skin_tone": "👩🏽\u200d🍳",
"woman_dancing": "💃",
"woman_dancing_dark_skin_tone": "💃🏿",
"woman_dancing_light_skin_tone": "💃🏻",
"woman_dancing_medium-dark_skin_tone": "💃🏾",
"woman_dancing_medium-light_skin_tone": "💃🏼",
"woman_dancing_medium_skin_tone": "💃🏽",
"woman_dark_skin_tone": "👩🏿",
"woman_detective": "🕵️\u200d♀️",
"woman_detective_dark_skin_tone": "🕵🏿\u200d♀️",
"woman_detective_light_skin_tone": "🕵🏻\u200d♀️",
"woman_detective_medium-dark_skin_tone": "🕵🏾\u200d♀️",
"woman_detective_medium-light_skin_tone": "🕵🏼\u200d♀️",
"woman_detective_medium_skin_tone": "🕵🏽\u200d♀️",
"woman_elf": "🧝\u200d♀️",
"woman_elf_dark_skin_tone": "🧝🏿\u200d♀️",
"woman_elf_light_skin_tone": "🧝🏻\u200d♀️",
"woman_elf_medium-dark_skin_tone": "🧝🏾\u200d♀️",
"woman_elf_medium-light_skin_tone": "🧝🏼\u200d♀️",
"woman_elf_medium_skin_tone": "🧝🏽\u200d♀️",
"woman_facepalming": "🤦\u200d♀️",
"woman_facepalming_dark_skin_tone": "🤦🏿\u200d♀️",
"woman_facepalming_light_skin_tone": "🤦🏻\u200d♀️",
"woman_facepalming_medium-dark_skin_tone": "🤦🏾\u200d♀️",
"woman_facepalming_medium-light_skin_tone": "🤦🏼\u200d♀️",
"woman_facepalming_medium_skin_tone": "🤦🏽\u200d♀️",
"woman_factory_worker": "👩\u200d🏭",
"woman_factory_worker_dark_skin_tone": "👩🏿\u200d🏭",
"woman_factory_worker_light_skin_tone": "👩🏻\u200d🏭",
"woman_factory_worker_medium-dark_skin_tone": "👩🏾\u200d🏭",
"woman_factory_worker_medium-light_skin_tone": "👩🏼\u200d🏭",
"woman_factory_worker_medium_skin_tone": "👩🏽\u200d🏭",
"woman_fairy": "🧚\u200d♀️",
"woman_fairy_dark_skin_tone": "🧚🏿\u200d♀️",
"woman_fairy_light_skin_tone": "🧚🏻\u200d♀️",
"woman_fairy_medium-dark_skin_tone": "🧚🏾\u200d♀️",
"woman_fairy_medium-light_skin_tone": "🧚🏼\u200d♀️",
"woman_fairy_medium_skin_tone": "🧚🏽\u200d♀️",
"woman_farmer": "👩\u200d🌾",
"woman_farmer_dark_skin_tone": "👩🏿\u200d🌾",
"woman_farmer_light_skin_tone": "👩🏻\u200d🌾",
"woman_farmer_medium-dark_skin_tone": "👩🏾\u200d🌾",
"woman_farmer_medium-light_skin_tone": "👩🏼\u200d🌾",
"woman_farmer_medium_skin_tone": "👩🏽\u200d🌾",
"woman_firefighter": "👩\u200d🚒",
"woman_firefighter_dark_skin_tone": "👩🏿\u200d🚒",
"woman_firefighter_light_skin_tone": "👩🏻\u200d🚒",
"woman_firefighter_medium-dark_skin_tone": "👩🏾\u200d🚒",
"woman_firefighter_medium-light_skin_tone": "👩🏼\u200d🚒",
"woman_firefighter_medium_skin_tone": "👩🏽\u200d🚒",
"woman_frowning": "🙍\u200d♀️",
"woman_frowning_dark_skin_tone": "🙍🏿\u200d♀️",
"woman_frowning_light_skin_tone": "🙍🏻\u200d♀️",
"woman_frowning_medium-dark_skin_tone": "🙍🏾\u200d♀️",
"woman_frowning_medium-light_skin_tone": "🙍🏼\u200d♀️",
"woman_frowning_medium_skin_tone": "🙍🏽\u200d♀️",
"woman_genie": "🧞\u200d♀️",
"woman_gesturing_no": "🙅\u200d♀️",
"woman_gesturing_no_dark_skin_tone": "🙅🏿\u200d♀️",
"woman_gesturing_no_light_skin_tone": "🙅🏻\u200d♀️",
"woman_gesturing_no_medium-dark_skin_tone": "🙅🏾\u200d♀️",
"woman_gesturing_no_medium-light_skin_tone": "🙅🏼\u200d♀️",
"woman_gesturing_no_medium_skin_tone": "🙅🏽\u200d♀️",
"woman_gesturing_ok": "🙆\u200d♀️",
"woman_gesturing_ok_dark_skin_tone": "🙆🏿\u200d♀️",
"woman_gesturing_ok_light_skin_tone": "🙆🏻\u200d♀️",
"woman_gesturing_ok_medium-dark_skin_tone": "🙆🏾\u200d♀️",
"woman_gesturing_ok_medium-light_skin_tone": "🙆🏼\u200d♀️",
"woman_gesturing_ok_medium_skin_tone": "🙆🏽\u200d♀️",
"woman_getting_haircut": "💇\u200d♀️",
"woman_getting_haircut_dark_skin_tone": "💇🏿\u200d♀️",
"woman_getting_haircut_light_skin_tone": "💇🏻\u200d♀️",
"woman_getting_haircut_medium-dark_skin_tone": "💇🏾\u200d♀️",
"woman_getting_haircut_medium-light_skin_tone": "💇🏼\u200d♀️",
"woman_getting_haircut_medium_skin_tone": "💇🏽\u200d♀️",
"woman_getting_massage": "💆\u200d♀️",
"woman_getting_massage_dark_skin_tone": "💆🏿\u200d♀️",
"woman_getting_massage_light_skin_tone": "💆🏻\u200d♀️",
"woman_getting_massage_medium-dark_skin_tone": "💆🏾\u200d♀️",
"woman_getting_massage_medium-light_skin_tone": "💆🏼\u200d♀️",
"woman_getting_massage_medium_skin_tone": "💆🏽\u200d♀️",
"woman_golfing": "🏌️\u200d♀️",
"woman_golfing_dark_skin_tone": "🏌🏿\u200d♀️",
"woman_golfing_light_skin_tone": "🏌🏻\u200d♀️",
"woman_golfing_medium-dark_skin_tone": "🏌🏾\u200d♀️",
"woman_golfing_medium-light_skin_tone": "🏌🏼\u200d♀️",
"woman_golfing_medium_skin_tone": "🏌🏽\u200d♀️",
"woman_guard": "💂\u200d♀️",
"woman_guard_dark_skin_tone": "💂🏿\u200d♀️",
"woman_guard_light_skin_tone": "💂🏻\u200d♀️",
"woman_guard_medium-dark_skin_tone": "💂🏾\u200d♀️",
"woman_guard_medium-light_skin_tone": "💂🏼\u200d♀️",
"woman_guard_medium_skin_tone": "💂🏽\u200d♀️",
"woman_health_worker": "👩\u200d⚕️",
"woman_health_worker_dark_skin_tone": "👩🏿\u200d⚕️",
"woman_health_worker_light_skin_tone": "👩🏻\u200d⚕️",
"woman_health_worker_medium-dark_skin_tone": "👩🏾\u200d⚕️",
"woman_health_worker_medium-light_skin_tone": "👩🏼\u200d⚕️",
"woman_health_worker_medium_skin_tone": "👩🏽\u200d⚕️",
"woman_in_lotus_position": "🧘\u200d♀️",
"woman_in_lotus_position_dark_skin_tone": "🧘🏿\u200d♀️",
"woman_in_lotus_position_light_skin_tone": "🧘🏻\u200d♀️",
"woman_in_lotus_position_medium-dark_skin_tone": "🧘🏾\u200d♀️",
"woman_in_lotus_position_medium-light_skin_tone": "🧘🏼\u200d♀️",
"woman_in_lotus_position_medium_skin_tone": "🧘🏽\u200d♀️",
"woman_in_manual_wheelchair": "👩\u200d🦽",
"woman_in_motorized_wheelchair": "👩\u200d🦼",
"woman_in_steamy_room": "🧖\u200d♀️",
"woman_in_steamy_room_dark_skin_tone": "🧖🏿\u200d♀️",
"woman_in_steamy_room_light_skin_tone": "🧖🏻\u200d♀️",
"woman_in_steamy_room_medium-dark_skin_tone": "🧖🏾\u200d♀️",
"woman_in_steamy_room_medium-light_skin_tone": "🧖🏼\u200d♀️",
"woman_in_steamy_room_medium_skin_tone": "🧖🏽\u200d♀️",
"woman_judge": "👩\u200d⚖️",
"woman_judge_dark_skin_tone": "👩🏿\u200d⚖️",
"woman_judge_light_skin_tone": "👩🏻\u200d⚖️",
"woman_judge_medium-dark_skin_tone": "👩🏾\u200d⚖️",
"woman_judge_medium-light_skin_tone": "👩🏼\u200d⚖️",
"woman_judge_medium_skin_tone": "👩🏽\u200d⚖️",
"woman_juggling": "🤹\u200d♀️",
"woman_juggling_dark_skin_tone": "🤹🏿\u200d♀️",
"woman_juggling_light_skin_tone": "🤹🏻\u200d♀️",
"woman_juggling_medium-dark_skin_tone": "🤹🏾\u200d♀️",
"woman_juggling_medium-light_skin_tone": "🤹🏼\u200d♀️",
"woman_juggling_medium_skin_tone": "🤹🏽\u200d♀️",
"woman_lifting_weights": "🏋️\u200d♀️",
"woman_lifting_weights_dark_skin_tone": "🏋🏿\u200d♀️",
"woman_lifting_weights_light_skin_tone": "🏋🏻\u200d♀️",
"woman_lifting_weights_medium-dark_skin_tone": "🏋🏾\u200d♀️",
"woman_lifting_weights_medium-light_skin_tone": "🏋🏼\u200d♀️",
"woman_lifting_weights_medium_skin_tone": "🏋🏽\u200d♀️",
"woman_light_skin_tone": "👩🏻",
"woman_mage": "🧙\u200d♀️",
"woman_mage_dark_skin_tone": "🧙🏿\u200d♀️",
"woman_mage_light_skin_tone": "🧙🏻\u200d♀️",
"woman_mage_medium-dark_skin_tone": "🧙🏾\u200d♀️",
"woman_mage_medium-light_skin_tone": "🧙🏼\u200d♀️",
"woman_mage_medium_skin_tone": "🧙🏽\u200d♀️",
"woman_mechanic": "👩\u200d🔧",
"woman_mechanic_dark_skin_tone": "👩🏿\u200d🔧",
"woman_mechanic_light_skin_tone": "👩🏻\u200d🔧",
"woman_mechanic_medium-dark_skin_tone": "👩🏾\u200d🔧",
"woman_mechanic_medium-light_skin_tone": "👩🏼\u200d🔧",
"woman_mechanic_medium_skin_tone": "👩🏽\u200d🔧",
"woman_medium-dark_skin_tone": "👩🏾",
"woman_medium-light_skin_tone": "👩🏼",
"woman_medium_skin_tone": "👩🏽",
"woman_mountain_biking": "🚵\u200d♀️",
"woman_mountain_biking_dark_skin_tone": "🚵🏿\u200d♀️",
"woman_mountain_biking_light_skin_tone": "🚵🏻\u200d♀️",
"woman_mountain_biking_medium-dark_skin_tone": "🚵🏾\u200d♀️",
"woman_mountain_biking_medium-light_skin_tone": "🚵🏼\u200d♀️",
"woman_mountain_biking_medium_skin_tone": "🚵🏽\u200d♀️",
"woman_office_worker": "👩\u200d💼",
"woman_office_worker_dark_skin_tone": "👩🏿\u200d💼",
"woman_office_worker_light_skin_tone": "👩🏻\u200d💼",
"woman_office_worker_medium-dark_skin_tone": "👩🏾\u200d💼",
"woman_office_worker_medium-light_skin_tone": "👩🏼\u200d💼",
"woman_office_worker_medium_skin_tone": "👩🏽\u200d💼",
"woman_pilot": "👩\u200d✈️",
"woman_pilot_dark_skin_tone": "👩🏿\u200d✈️",
"woman_pilot_light_skin_tone": "👩🏻\u200d✈️",
"woman_pilot_medium-dark_skin_tone": "👩🏾\u200d✈️",
"woman_pilot_medium-light_skin_tone": "👩🏼\u200d✈️",
"woman_pilot_medium_skin_tone": "👩🏽\u200d✈️",
"woman_playing_handball": "🤾\u200d♀️",
"woman_playing_handball_dark_skin_tone": "🤾🏿\u200d♀️",
"woman_playing_handball_light_skin_tone": "🤾🏻\u200d♀️",
"woman_playing_handball_medium-dark_skin_tone": "🤾🏾\u200d♀️",
"woman_playing_handball_medium-light_skin_tone": "🤾🏼\u200d♀️",
"woman_playing_handball_medium_skin_tone": "🤾🏽\u200d♀️",
"woman_playing_water_polo": "🤽\u200d♀️",
"woman_playing_water_polo_dark_skin_tone": "🤽🏿\u200d♀️",
"woman_playing_water_polo_light_skin_tone": "🤽🏻\u200d♀️",
"woman_playing_water_polo_medium-dark_skin_tone": "🤽🏾\u200d♀️",
"woman_playing_water_polo_medium-light_skin_tone": "🤽🏼\u200d♀️",
"woman_playing_water_polo_medium_skin_tone": "🤽🏽\u200d♀️",
"woman_police_officer": "👮\u200d♀️",
"woman_police_officer_dark_skin_tone": "👮🏿\u200d♀️",
"woman_police_officer_light_skin_tone": "👮🏻\u200d♀️",
"woman_police_officer_medium-dark_skin_tone": "👮🏾\u200d♀️",
"woman_police_officer_medium-light_skin_tone": "👮🏼\u200d♀️",
"woman_police_officer_medium_skin_tone": "👮🏽\u200d♀️",
"woman_pouting": "🙎\u200d♀️",
"woman_pouting_dark_skin_tone": "🙎🏿\u200d♀️",
"woman_pouting_light_skin_tone": "🙎🏻\u200d♀️",
"woman_pouting_medium-dark_skin_tone": "🙎🏾\u200d♀️",
"woman_pouting_medium-light_skin_tone": "🙎🏼\u200d♀️",
"woman_pouting_medium_skin_tone": "🙎🏽\u200d♀️",
"woman_raising_hand": "🙋\u200d♀️",
"woman_raising_hand_dark_skin_tone": "🙋🏿\u200d♀️",
"woman_raising_hand_light_skin_tone": "🙋🏻\u200d♀️",
"woman_raising_hand_medium-dark_skin_tone": "🙋🏾\u200d♀️",
"woman_raising_hand_medium-light_skin_tone": "🙋🏼\u200d♀️",
"woman_raising_hand_medium_skin_tone": "🙋🏽\u200d♀️",
"woman_rowing_boat": "🚣\u200d♀️",
"woman_rowing_boat_dark_skin_tone": "🚣🏿\u200d♀️",
"woman_rowing_boat_light_skin_tone": "🚣🏻\u200d♀️",
"woman_rowing_boat_medium-dark_skin_tone": "🚣🏾\u200d♀️",
"woman_rowing_boat_medium-light_skin_tone": "🚣🏼\u200d♀️",
"woman_rowing_boat_medium_skin_tone": "🚣🏽\u200d♀️",
"woman_running": "🏃\u200d♀️",
"woman_running_dark_skin_tone": "🏃🏿\u200d♀️",
"woman_running_light_skin_tone": "🏃🏻\u200d♀️",
"woman_running_medium-dark_skin_tone": "🏃🏾\u200d♀️",
"woman_running_medium-light_skin_tone": "🏃🏼\u200d♀️",
"woman_running_medium_skin_tone": "🏃🏽\u200d♀️",
"woman_scientist": "👩\u200d🔬",
"woman_scientist_dark_skin_tone": "👩🏿\u200d🔬",
"woman_scientist_light_skin_tone": "👩🏻\u200d🔬",
"woman_scientist_medium-dark_skin_tone": "👩🏾\u200d🔬",
"woman_scientist_medium-light_skin_tone": "👩🏼\u200d🔬",
"woman_scientist_medium_skin_tone": "👩🏽\u200d🔬",
"woman_shrugging": "🤷\u200d♀️",
"woman_shrugging_dark_skin_tone": "🤷🏿\u200d♀️",
"woman_shrugging_light_skin_tone": "🤷🏻\u200d♀️",
"woman_shrugging_medium-dark_skin_tone": "🤷🏾\u200d♀️",
"woman_shrugging_medium-light_skin_tone": "🤷🏼\u200d♀️",
"woman_shrugging_medium_skin_tone": "🤷🏽\u200d♀️",
"woman_singer": "👩\u200d🎤",
"woman_singer_dark_skin_tone": "👩🏿\u200d🎤",
"woman_singer_light_skin_tone": "👩🏻\u200d🎤",
"woman_singer_medium-dark_skin_tone": "👩🏾\u200d🎤",
"woman_singer_medium-light_skin_tone": "👩🏼\u200d🎤",
"woman_singer_medium_skin_tone": "👩🏽\u200d🎤",
"woman_student": "👩\u200d🎓",
"woman_student_dark_skin_tone": "👩🏿\u200d🎓",
"woman_student_light_skin_tone": "👩🏻\u200d🎓",
"woman_student_medium-dark_skin_tone": "👩🏾\u200d🎓",
"woman_student_medium-light_skin_tone": "👩🏼\u200d🎓",
"woman_student_medium_skin_tone": "👩🏽\u200d🎓",
"woman_surfing": "🏄\u200d♀️",
"woman_surfing_dark_skin_tone": "🏄🏿\u200d♀️",
"woman_surfing_light_skin_tone": "🏄🏻\u200d♀️",
"woman_surfing_medium-dark_skin_tone": "🏄🏾\u200d♀️",
"woman_surfing_medium-light_skin_tone": "🏄🏼\u200d♀️",
"woman_surfing_medium_skin_tone": "🏄🏽\u200d♀️",
"woman_swimming": "🏊\u200d♀️",
"woman_swimming_dark_skin_tone": "🏊🏿\u200d♀️",
"woman_swimming_light_skin_tone": "🏊🏻\u200d♀️",
"woman_swimming_medium-dark_skin_tone": "🏊🏾\u200d♀️",
"woman_swimming_medium-light_skin_tone": "🏊🏼\u200d♀️",
"woman_swimming_medium_skin_tone": "🏊🏽\u200d♀️",
"woman_teacher": "👩\u200d🏫",
"woman_teacher_dark_skin_tone": "👩🏿\u200d🏫",
"woman_teacher_light_skin_tone": "👩🏻\u200d🏫",
"woman_teacher_medium-dark_skin_tone": "👩🏾\u200d🏫",
"woman_teacher_medium-light_skin_tone": "👩🏼\u200d🏫",
"woman_teacher_medium_skin_tone": "👩🏽\u200d🏫",
"woman_technologist": "👩\u200d💻",
"woman_technologist_dark_skin_tone": "👩🏿\u200d💻",
"woman_technologist_light_skin_tone": "👩🏻\u200d💻",
"woman_technologist_medium-dark_skin_tone": "👩🏾\u200d💻",
"woman_technologist_medium-light_skin_tone": "👩🏼\u200d💻",
"woman_technologist_medium_skin_tone": "👩🏽\u200d💻",
"woman_tipping_hand": "💁\u200d♀️",
"woman_tipping_hand_dark_skin_tone": "💁🏿\u200d♀️",
"woman_tipping_hand_light_skin_tone": "💁🏻\u200d♀️",
"woman_tipping_hand_medium-dark_skin_tone": "💁🏾\u200d♀️",
"woman_tipping_hand_medium-light_skin_tone": "💁🏼\u200d♀️",
"woman_tipping_hand_medium_skin_tone": "💁🏽\u200d♀️",
"woman_vampire": "🧛\u200d♀️",
"woman_vampire_dark_skin_tone": "🧛🏿\u200d♀️",
"woman_vampire_light_skin_tone": "🧛🏻\u200d♀️",
"woman_vampire_medium-dark_skin_tone": "🧛🏾\u200d♀️",
"woman_vampire_medium-light_skin_tone": "🧛🏼\u200d♀️",
"woman_vampire_medium_skin_tone": "🧛🏽\u200d♀️",
"woman_walking": "🚶\u200d♀️",
"woman_walking_dark_skin_tone": "🚶🏿\u200d♀️",
"woman_walking_light_skin_tone": "🚶🏻\u200d♀️",
"woman_walking_medium-dark_skin_tone": "🚶🏾\u200d♀️",
"woman_walking_medium-light_skin_tone": "🚶🏼\u200d♀️",
"woman_walking_medium_skin_tone": "🚶🏽\u200d♀️",
"woman_wearing_turban": "👳\u200d♀️",
"woman_wearing_turban_dark_skin_tone": "👳🏿\u200d♀️",
"woman_wearing_turban_light_skin_tone": "👳🏻\u200d♀️",
"woman_wearing_turban_medium-dark_skin_tone": "👳🏾\u200d♀️",
"woman_wearing_turban_medium-light_skin_tone": "👳🏼\u200d♀️",
"woman_wearing_turban_medium_skin_tone": "👳🏽\u200d♀️",
"woman_with_headscarf": "🧕",
"woman_with_headscarf_dark_skin_tone": "🧕🏿",
"woman_with_headscarf_light_skin_tone": "🧕🏻",
"woman_with_headscarf_medium-dark_skin_tone": "🧕🏾",
"woman_with_headscarf_medium-light_skin_tone": "🧕🏼",
"woman_with_headscarf_medium_skin_tone": "🧕🏽",
"woman_with_probing_cane": "👩\u200d🦯",
"woman_zombie": "🧟\u200d♀️",
"woman’s_boot": "👢",
"woman’s_clothes": "👚",
"woman’s_hat": "👒",
"woman’s_sandal": "👡",
"women_with_bunny_ears": "👯\u200d♀️",
"women_wrestling": "🤼\u200d♀️",
"women’s_room": "🚺",
"woozy_face": "🥴",
"world_map": "🗺",
"worried_face": "😟",
"wrapped_gift": "🎁",
"wrench": "🔧",
"writing_hand": "✍",
"writing_hand_dark_skin_tone": "✍🏿",
"writing_hand_light_skin_tone": "✍🏻",
"writing_hand_medium-dark_skin_tone": "✍🏾",
"writing_hand_medium-light_skin_tone": "✍🏼",
"writing_hand_medium_skin_tone": "✍🏽",
"yarn": "🧶",
"yawning_face": "🥱",
"yellow_circle": "🟡",
"yellow_heart": "💛",
"yellow_square": "🟨",
"yen_banknote": "💴",
"yo-yo": "🪀",
"yin_yang": "☯",
"zany_face": "🤪",
"zebra": "🦓",
"zipper-mouth_face": "🤐",
"zombie": "🧟",
"zzz": "💤",
"åland_islands": "🇦🇽",
"keycap_asterisk": "*⃣",
"keycap_digit_eight": "8⃣",
"keycap_digit_five": "5⃣",
"keycap_digit_four": "4⃣",
"keycap_digit_nine": "9⃣",
"keycap_digit_one": "1⃣",
"keycap_digit_seven": "7⃣",
"keycap_digit_six": "6⃣",
"keycap_digit_three": "3⃣",
"keycap_digit_two": "2⃣",
"keycap_digit_zero": "0⃣",
"keycap_number_sign": "#⃣",
"light_skin_tone": "🏻",
"medium_light_skin_tone": "🏼",
"medium_skin_tone": "🏽",
"medium_dark_skin_tone": "🏾",
"dark_skin_tone": "🏿",
"regional_indicator_symbol_letter_a": "🇦",
"regional_indicator_symbol_letter_b": "🇧",
"regional_indicator_symbol_letter_c": "🇨",
"regional_indicator_symbol_letter_d": "🇩",
"regional_indicator_symbol_letter_e": "🇪",
"regional_indicator_symbol_letter_f": "🇫",
"regional_indicator_symbol_letter_g": "🇬",
"regional_indicator_symbol_letter_h": "🇭",
"regional_indicator_symbol_letter_i": "🇮",
"regional_indicator_symbol_letter_j": "🇯",
"regional_indicator_symbol_letter_k": "🇰",
"regional_indicator_symbol_letter_l": "🇱",
"regional_indicator_symbol_letter_m": "🇲",
"regional_indicator_symbol_letter_n": "🇳",
"regional_indicator_symbol_letter_o": "🇴",
"regional_indicator_symbol_letter_p": "🇵",
"regional_indicator_symbol_letter_q": "🇶",
"regional_indicator_symbol_letter_r": "🇷",
"regional_indicator_symbol_letter_s": "🇸",
"regional_indicator_symbol_letter_t": "🇹",
"regional_indicator_symbol_letter_u": "🇺",
"regional_indicator_symbol_letter_v": "🇻",
"regional_indicator_symbol_letter_w": "🇼",
"regional_indicator_symbol_letter_x": "🇽",
"regional_indicator_symbol_letter_y": "🇾",
"regional_indicator_symbol_letter_z": "🇿",
"airplane_arriving": "🛬",
"space_invader": "👾",
"football": "🏈",
"anger": "💢",
"angry": "😠",
"anguished": "😧",
"signal_strength": "📶",
"arrows_counterclockwise": "🔄",
"arrow_heading_down": "⤵",
"arrow_heading_up": "⤴",
"art": "🎨",
"astonished": "😲",
"athletic_shoe": "👟",
"atm": "🏧",
"car": "🚗",
"red_car": "🚗",
"angel": "👼",
"back": "🔙",
"badminton_racquet_and_shuttlecock": "🏸",
"dollar": "💵",
"euro": "💶",
"pound": "💷",
"yen": "💴",
"barber": "💈",
"bath": "🛀",
"bear": "🐻",
"heartbeat": "💓",
"beer": "🍺",
"no_bell": "🔕",
"bento": "🍱",
"bike": "🚲",
"bicyclist": "🚴",
"8ball": "🎱",
"biohazard_sign": "☣",
"birthday": "🎂",
"black_circle_for_record": "⏺",
"clubs": "♣",
"diamonds": "♦",
"arrow_double_down": "⏬",
"hearts": "♥",
"rewind": "⏪",
"black_left__pointing_double_triangle_with_vertical_bar": "⏮",
"arrow_backward": "◀",
"black_medium_small_square": "◾",
"question": "❓",
"fast_forward": "⏩",
"black_right__pointing_double_triangle_with_vertical_bar": "⏭",
"arrow_forward": "▶",
"black_right__pointing_triangle_with_double_vertical_bar": "⏯",
"arrow_right": "➡",
"spades": "♠",
"black_square_for_stop": "⏹",
"sunny": "☀",
"phone": "☎",
"recycle": "♻",
"arrow_double_up": "⏫",
"busstop": "🚏",
"date": "📅",
"flags": "🎏",
"cat2": "🐈",
"joy_cat": "😹",
"smirk_cat": "😼",
"chart_with_downwards_trend": "📉",
"chart_with_upwards_trend": "📈",
"chart": "💹",
"mega": "📣",
"checkered_flag": "🏁",
"accept": "🉑",
"ideograph_advantage": "🉐",
"congratulations": "㊗",
"secret": "㊙",
"m": "Ⓜ",
"city_sunset": "🌆",
"clapper": "🎬",
"clap": "👏",
"beers": "🍻",
"clock830": "🕣",
"clock8": "🕗",
"clock1130": "🕦",
"clock11": "🕚",
"clock530": "🕠",
"clock5": "🕔",
"clock430": "🕟",
"clock4": "🕓",
"clock930": "🕤",
"clock9": "🕘",
"clock130": "🕜",
"clock1": "🕐",
"clock730": "🕢",
"clock7": "🕖",
"clock630": "🕡",
"clock6": "🕕",
"clock1030": "🕥",
"clock10": "🕙",
"clock330": "🕞",
"clock3": "🕒",
"clock1230": "🕧",
"clock12": "🕛",
"clock230": "🕝",
"clock2": "🕑",
"arrows_clockwise": "🔃",
"repeat": "🔁",
"repeat_one": "🔂",
"closed_lock_with_key": "🔐",
"mailbox_closed": "📪",
"mailbox": "📫",
"cloud_with_tornado": "🌪",
"cocktail": "🍸",
"boom": "💥",
"compression": "🗜",
"confounded": "😖",
"confused": "😕",
"rice": "🍚",
"cow2": "🐄",
"cricket_bat_and_ball": "🏏",
"x": "❌",
"cry": "😢",
"curry": "🍛",
"dagger_knife": "🗡",
"dancer": "💃",
"dark_sunglasses": "🕶",
"dash": "💨",
"truck": "🚚",
"derelict_house_building": "🏚",
"diamond_shape_with_a_dot_inside": "💠",
"dart": "🎯",
"disappointed_relieved": "😥",
"disappointed": "😞",
"do_not_litter": "🚯",
"dog2": "🐕",
"flipper": "🐬",
"loop": "➿",
"bangbang": "‼",
"double_vertical_bar": "⏸",
"dove_of_peace": "🕊",
"small_red_triangle_down": "🔻",
"arrow_down_small": "🔽",
"arrow_down": "⬇",
"dromedary_camel": "🐪",
"e__mail": "📧",
"corn": "🌽",
"ear_of_rice": "🌾",
"earth_americas": "🌎",
"earth_asia": "🌏",
"earth_africa": "🌍",
"eight_pointed_black_star": "✴",
"eight_spoked_asterisk": "✳",
"eject_symbol": "⏏",
"bulb": "💡",
"emoji_modifier_fitzpatrick_type__1__2": "🏻",
"emoji_modifier_fitzpatrick_type__3": "🏼",
"emoji_modifier_fitzpatrick_type__4": "🏽",
"emoji_modifier_fitzpatrick_type__5": "🏾",
"emoji_modifier_fitzpatrick_type__6": "🏿",
"end": "🔚",
"email": "✉",
"european_castle": "🏰",
"european_post_office": "🏤",
"interrobang": "⁉",
"expressionless": "😑",
"eyeglasses": "👓",
"massage": "💆",
"yum": "😋",
"scream": "😱",
"kissing_heart": "😘",
"sweat": "😓",
"face_with_head__bandage": "🤕",
"triumph": "😤",
"mask": "😷",
"no_good": "🙅",
"ok_woman": "🙆",
"open_mouth": "😮",
"cold_sweat": "😰",
"stuck_out_tongue": "😛",
"stuck_out_tongue_closed_eyes": "😝",
"stuck_out_tongue_winking_eye": "😜",
"joy": "😂",
"no_mouth": "😶",
"santa": "🎅",
"fax": "📠",
"fearful": "😨",
"field_hockey_stick_and_ball": "🏑",
"first_quarter_moon_with_face": "🌛",
"fish_cake": "🍥",
"fishing_pole_and_fish": "🎣",
"facepunch": "👊",
"punch": "👊",
"flag_for_afghanistan": "🇦🇫",
"flag_for_albania": "🇦🇱",
"flag_for_algeria": "🇩🇿",
"flag_for_american_samoa": "🇦🇸",
"flag_for_andorra": "🇦🇩",
"flag_for_angola": "🇦🇴",
"flag_for_anguilla": "🇦🇮",
"flag_for_antarctica": "🇦🇶",
"flag_for_antigua_&_barbuda": "🇦🇬",
"flag_for_argentina": "🇦🇷",
"flag_for_armenia": "🇦🇲",
"flag_for_aruba": "🇦🇼",
"flag_for_ascension_island": "🇦🇨",
"flag_for_australia": "🇦🇺",
"flag_for_austria": "🇦🇹",
"flag_for_azerbaijan": "🇦🇿",
"flag_for_bahamas": "🇧🇸",
"flag_for_bahrain": "🇧🇭",
"flag_for_bangladesh": "🇧🇩",
"flag_for_barbados": "🇧🇧",
"flag_for_belarus": "🇧🇾",
"flag_for_belgium": "🇧🇪",
"flag_for_belize": "🇧🇿",
"flag_for_benin": "🇧🇯",
"flag_for_bermuda": "🇧🇲",
"flag_for_bhutan": "🇧🇹",
"flag_for_bolivia": "🇧🇴",
"flag_for_bosnia_&_herzegovina": "🇧🇦",
"flag_for_botswana": "🇧🇼",
"flag_for_bouvet_island": "🇧🇻",
"flag_for_brazil": "🇧🇷",
"flag_for_british_indian_ocean_territory": "🇮🇴",
"flag_for_british_virgin_islands": "🇻🇬",
"flag_for_brunei": "🇧🇳",
"flag_for_bulgaria": "🇧🇬",
"flag_for_burkina_faso": "🇧🇫",
"flag_for_burundi": "🇧🇮",
"flag_for_cambodia": "🇰🇭",
"flag_for_cameroon": "🇨🇲",
"flag_for_canada": "🇨🇦",
"flag_for_canary_islands": "🇮🇨",
"flag_for_cape_verde": "🇨🇻",
"flag_for_caribbean_netherlands": "🇧🇶",
"flag_for_cayman_islands": "🇰🇾",
"flag_for_central_african_republic": "🇨🇫",
"flag_for_ceuta_&_melilla": "🇪🇦",
"flag_for_chad": "🇹🇩",
"flag_for_chile": "🇨🇱",
"flag_for_china": "🇨🇳",
"flag_for_christmas_island": "🇨🇽",
"flag_for_clipperton_island": "🇨🇵",
"flag_for_cocos__islands": "🇨🇨",
"flag_for_colombia": "🇨🇴",
"flag_for_comoros": "🇰🇲",
"flag_for_congo____brazzaville": "🇨🇬",
"flag_for_congo____kinshasa": "🇨🇩",
"flag_for_cook_islands": "🇨🇰",
"flag_for_costa_rica": "🇨🇷",
"flag_for_croatia": "🇭🇷",
"flag_for_cuba": "🇨🇺",
"flag_for_curaçao": "🇨🇼",
"flag_for_cyprus": "🇨🇾",
"flag_for_czech_republic": "🇨🇿",
"flag_for_côte_d’ivoire": "🇨🇮",
"flag_for_denmark": "🇩🇰",
"flag_for_diego_garcia": "🇩🇬",
"flag_for_djibouti": "🇩🇯",
"flag_for_dominica": "🇩🇲",
"flag_for_dominican_republic": "🇩🇴",
"flag_for_ecuador": "🇪🇨",
"flag_for_egypt": "🇪🇬",
"flag_for_el_salvador": "🇸🇻",
"flag_for_equatorial_guinea": "🇬🇶",
"flag_for_eritrea": "🇪🇷",
"flag_for_estonia": "🇪🇪",
"flag_for_ethiopia": "🇪🇹",
"flag_for_european_union": "🇪🇺",
"flag_for_falkland_islands": "🇫🇰",
"flag_for_faroe_islands": "🇫🇴",
"flag_for_fiji": "🇫🇯",
"flag_for_finland": "🇫🇮",
"flag_for_france": "🇫🇷",
"flag_for_french_guiana": "🇬🇫",
"flag_for_french_polynesia": "🇵🇫",
"flag_for_french_southern_territories": "🇹🇫",
"flag_for_gabon": "🇬🇦",
"flag_for_gambia": "🇬🇲",
"flag_for_georgia": "🇬🇪",
"flag_for_germany": "🇩🇪",
"flag_for_ghana": "🇬🇭",
"flag_for_gibraltar": "🇬🇮",
"flag_for_greece": "🇬🇷",
"flag_for_greenland": "🇬🇱",
"flag_for_grenada": "🇬🇩",
"flag_for_guadeloupe": "🇬🇵",
"flag_for_guam": "🇬🇺",
"flag_for_guatemala": "🇬🇹",
"flag_for_guernsey": "🇬🇬",
"flag_for_guinea": "🇬🇳",
"flag_for_guinea__bissau": "🇬🇼",
"flag_for_guyana": "🇬🇾",
"flag_for_haiti": "🇭🇹",
"flag_for_heard_&_mcdonald_islands": "🇭🇲",
"flag_for_honduras": "🇭🇳",
"flag_for_hong_kong": "🇭🇰",
"flag_for_hungary": "🇭🇺",
"flag_for_iceland": "🇮🇸",
"flag_for_india": "🇮🇳",
"flag_for_indonesia": "🇮🇩",
"flag_for_iran": "🇮🇷",
"flag_for_iraq": "🇮🇶",
"flag_for_ireland": "🇮🇪",
"flag_for_isle_of_man": "🇮🇲",
"flag_for_israel": "🇮🇱",
"flag_for_italy": "🇮🇹",
"flag_for_jamaica": "🇯🇲",
"flag_for_japan": "🇯🇵",
"flag_for_jersey": "🇯🇪",
"flag_for_jordan": "🇯🇴",
"flag_for_kazakhstan": "🇰🇿",
"flag_for_kenya": "🇰🇪",
"flag_for_kiribati": "🇰🇮",
"flag_for_kosovo": "🇽🇰",
"flag_for_kuwait": "🇰🇼",
"flag_for_kyrgyzstan": "🇰🇬",
"flag_for_laos": "🇱🇦",
"flag_for_latvia": "🇱🇻",
"flag_for_lebanon": "🇱🇧",
"flag_for_lesotho": "🇱🇸",
"flag_for_liberia": "🇱🇷",
"flag_for_libya": "🇱🇾",
"flag_for_liechtenstein": "🇱🇮",
"flag_for_lithuania": "🇱🇹",
"flag_for_luxembourg": "🇱🇺",
"flag_for_macau": "🇲🇴",
"flag_for_macedonia": "🇲🇰",
"flag_for_madagascar": "🇲🇬",
"flag_for_malawi": "🇲🇼",
"flag_for_malaysia": "🇲🇾",
"flag_for_maldives": "🇲🇻",
"flag_for_mali": "🇲🇱",
"flag_for_malta": "🇲🇹",
"flag_for_marshall_islands": "🇲🇭",
"flag_for_martinique": "🇲🇶",
"flag_for_mauritania": "🇲🇷",
"flag_for_mauritius": "🇲🇺",
"flag_for_mayotte": "🇾🇹",
"flag_for_mexico": "🇲🇽",
"flag_for_micronesia": "🇫🇲",
"flag_for_moldova": "🇲🇩",
"flag_for_monaco": "🇲🇨",
"flag_for_mongolia": "🇲🇳",
"flag_for_montenegro": "🇲🇪",
"flag_for_montserrat": "🇲🇸",
"flag_for_morocco": "🇲🇦",
"flag_for_mozambique": "🇲🇿",
"flag_for_myanmar": "🇲🇲",
"flag_for_namibia": "🇳🇦",
"flag_for_nauru": "🇳🇷",
"flag_for_nepal": "🇳🇵",
"flag_for_netherlands": "🇳🇱",
"flag_for_new_caledonia": "🇳🇨",
"flag_for_new_zealand": "🇳🇿",
"flag_for_nicaragua": "🇳🇮",
"flag_for_niger": "🇳🇪",
"flag_for_nigeria": "🇳🇬",
"flag_for_niue": "🇳🇺",
"flag_for_norfolk_island": "🇳🇫",
"flag_for_north_korea": "🇰🇵",
"flag_for_northern_mariana_islands": "🇲🇵",
"flag_for_norway": "🇳🇴",
"flag_for_oman": "🇴🇲",
"flag_for_pakistan": "🇵🇰",
"flag_for_palau": "🇵🇼",
"flag_for_palestinian_territories": "🇵🇸",
"flag_for_panama": "🇵🇦",
"flag_for_papua_new_guinea": "🇵🇬",
"flag_for_paraguay": "🇵🇾",
"flag_for_peru": "🇵🇪",
"flag_for_philippines": "🇵🇭",
"flag_for_pitcairn_islands": "🇵🇳",
"flag_for_poland": "🇵🇱",
"flag_for_portugal": "🇵🇹",
"flag_for_puerto_rico": "🇵🇷",
"flag_for_qatar": "🇶🇦",
"flag_for_romania": "🇷🇴",
"flag_for_russia": "🇷🇺",
"flag_for_rwanda": "🇷🇼",
"flag_for_réunion": "🇷🇪",
"flag_for_samoa": "🇼🇸",
"flag_for_san_marino": "🇸🇲",
"flag_for_saudi_arabia": "🇸🇦",
"flag_for_senegal": "🇸🇳",
"flag_for_serbia": "🇷🇸",
"flag_for_seychelles": "🇸🇨",
"flag_for_sierra_leone": "🇸🇱",
"flag_for_singapore": "🇸🇬",
"flag_for_sint_maarten": "🇸🇽",
"flag_for_slovakia": "🇸🇰",
"flag_for_slovenia": "🇸🇮",
"flag_for_solomon_islands": "🇸🇧",
"flag_for_somalia": "🇸🇴",
"flag_for_south_africa": "🇿🇦",
"flag_for_south_georgia_&_south_sandwich_islands": "🇬🇸",
"flag_for_south_korea": "🇰🇷",
"flag_for_south_sudan": "🇸🇸",
"flag_for_spain": "🇪🇸",
"flag_for_sri_lanka": "🇱🇰",
"flag_for_st._barthélemy": "🇧🇱",
"flag_for_st._helena": "🇸🇭",
"flag_for_st._kitts_&_nevis": "🇰🇳",
"flag_for_st._lucia": "🇱🇨",
"flag_for_st._martin": "🇲🇫",
"flag_for_st._pierre_&_miquelon": "🇵🇲",
"flag_for_st._vincent_&_grenadines": "🇻🇨",
"flag_for_sudan": "🇸🇩",
"flag_for_suriname": "🇸🇷",
"flag_for_svalbard_&_jan_mayen": "🇸🇯",
"flag_for_swaziland": "🇸🇿",
"flag_for_sweden": "🇸🇪",
"flag_for_switzerland": "🇨🇭",
"flag_for_syria": "🇸🇾",
"flag_for_são_tomé_&_príncipe": "🇸🇹",
"flag_for_taiwan": "🇹🇼",
"flag_for_tajikistan": "🇹🇯",
"flag_for_tanzania": "🇹🇿",
"flag_for_thailand": "🇹🇭",
"flag_for_timor__leste": "🇹🇱",
"flag_for_togo": "🇹🇬",
"flag_for_tokelau": "🇹🇰",
"flag_for_tonga": "🇹🇴",
"flag_for_trinidad_&_tobago": "🇹🇹",
"flag_for_tristan_da_cunha": "🇹🇦",
"flag_for_tunisia": "🇹🇳",
"flag_for_turkey": "🇹🇷",
"flag_for_turkmenistan": "🇹🇲",
"flag_for_turks_&_caicos_islands": "🇹🇨",
"flag_for_tuvalu": "🇹🇻",
"flag_for_u.s._outlying_islands": "🇺🇲",
"flag_for_u.s._virgin_islands": "🇻🇮",
"flag_for_uganda": "🇺🇬",
"flag_for_ukraine": "🇺🇦",
"flag_for_united_arab_emirates": "🇦🇪",
"flag_for_united_kingdom": "🇬🇧",
"flag_for_united_states": "🇺🇸",
"flag_for_uruguay": "🇺🇾",
"flag_for_uzbekistan": "🇺🇿",
"flag_for_vanuatu": "🇻🇺",
"flag_for_vatican_city": "🇻🇦",
"flag_for_venezuela": "🇻🇪",
"flag_for_vietnam": "🇻🇳",
"flag_for_wallis_&_futuna": "🇼🇫",
"flag_for_western_sahara": "🇪🇭",
"flag_for_yemen": "🇾🇪",
"flag_for_zambia": "🇿🇲",
"flag_for_zimbabwe": "🇿🇼",
"flag_for_åland_islands": "🇦🇽",
"golf": "⛳",
"fleur__de__lis": "⚜",
"muscle": "💪",
"flushed": "😳",
"frame_with_picture": "🖼",
"fries": "🍟",
"frog": "🐸",
"hatched_chick": "🐥",
"frowning": "😦",
"fuelpump": "⛽",
"full_moon_with_face": "🌝",
"gem": "💎",
"star2": "🌟",
"golfer": "🏌",
"mortar_board": "🎓",
"grimacing": "😬",
"smile_cat": "😸",
"grinning": "😀",
"grin": "😁",
"heartpulse": "💗",
"guardsman": "💂",
"haircut": "💇",
"hamster": "🐹",
"raising_hand": "🙋",
"headphones": "🎧",
"hear_no_evil": "🙉",
"cupid": "💘",
"gift_heart": "💝",
"heart": "❤",
"exclamation": "❗",
"heavy_exclamation_mark": "❗",
"heavy_heart_exclamation_mark_ornament": "❣",
"o": "⭕",
"helm_symbol": "⎈",
"helmet_with_white_cross": "⛑",
"high_heel": "👠",
"bullettrain_side": "🚄",
"bullettrain_front": "🚅",
"high_brightness": "🔆",
"zap": "⚡",
"hocho": "🔪",
"knife": "🔪",
"bee": "🐝",
"traffic_light": "🚥",
"racehorse": "🐎",
"coffee": "☕",
"hotsprings": "♨",
"hourglass": "⌛",
"hourglass_flowing_sand": "⏳",
"house_buildings": "🏘",
"100": "💯",
"hushed": "😯",
"ice_hockey_stick_and_puck": "🏒",
"imp": "👿",
"information_desk_person": "💁",
"information_source": "ℹ",
"capital_abcd": "🔠",
"abc": "🔤",
"abcd": "🔡",
"1234": "🔢",
"symbols": "🔣",
"izakaya_lantern": "🏮",
"lantern": "🏮",
"jack_o_lantern": "🎃",
"dolls": "🎎",
"japanese_goblin": "👺",
"japanese_ogre": "👹",
"beginner": "🔰",
"zero": "0️⃣",
"one": "1️⃣",
"ten": "🔟",
"two": "2️⃣",
"three": "3️⃣",
"four": "4️⃣",
"five": "5️⃣",
"six": "6️⃣",
"seven": "7️⃣",
"eight": "8️⃣",
"nine": "9️⃣",
"couplekiss": "💏",
"kissing_cat": "😽",
"kissing": "😗",
"kissing_closed_eyes": "😚",
"kissing_smiling_eyes": "😙",
"beetle": "🐞",
"large_blue_circle": "🔵",
"last_quarter_moon_with_face": "🌜",
"leaves": "🍃",
"mag": "🔍",
"left_right_arrow": "↔",
"leftwards_arrow_with_hook": "↩",
"arrow_left": "⬅",
"lock": "🔒",
"lock_with_ink_pen": "🔏",
"sob": "😭",
"low_brightness": "🔅",
"lower_left_ballpoint_pen": "🖊",
"lower_left_crayon": "🖍",
"lower_left_fountain_pen": "🖋",
"lower_left_paintbrush": "🖌",
"mahjong": "🀄",
"couple": "👫",
"man_in_business_suit_levitating": "🕴",
"man_with_gua_pi_mao": "👲",
"man_with_turban": "👳",
"mans_shoe": "👞",
"shoe": "👞",
"menorah_with_nine_branches": "🕎",
"mens": "🚹",
"minidisc": "💽",
"iphone": "📱",
"calling": "📲",
"money__mouth_face": "🤑",
"moneybag": "💰",
"rice_scene": "🎑",
"mountain_bicyclist": "🚵",
"mouse2": "🐁",
"lips": "👄",
"moyai": "🗿",
"notes": "🎶",
"nail_care": "💅",
"ab": "🆎",
"negative_squared_cross_mark": "❎",
"a": "🅰",
"b": "🅱",
"o2": "🅾",
"parking": "🅿",
"new_moon_with_face": "🌚",
"no_entry_sign": "🚫",
"underage": "🔞",
"non__potable_water": "🚱",
"arrow_upper_right": "↗",
"arrow_upper_left": "↖",
"office": "🏢",
"older_man": "👴",
"older_woman": "👵",
"om_symbol": "🕉",
"on": "🔛",
"book": "📖",
"unlock": "🔓",
"mailbox_with_no_mail": "📭",
"mailbox_with_mail": "📬",
"cd": "💿",
"tada": "🎉",
"feet": "🐾",
"walking": "🚶",
"pencil2": "✏",
"pensive": "😔",
"persevere": "😣",
"bow": "🙇",
"raised_hands": "🙌",
"person_with_ball": "⛹",
"person_with_blond_hair": "👱",
"pray": "🙏",
"person_with_pouting_face": "🙎",
"computer": "💻",
"pig2": "🐖",
"hankey": "💩",
"poop": "💩",
"shit": "💩",
"bamboo": "🎍",
"gun": "🔫",
"black_joker": "🃏",
"rotating_light": "🚨",
"cop": "👮",
"stew": "🍲",
"pouch": "👝",
"pouting_cat": "😾",
"rage": "😡",
"put_litter_in_its_place": "🚮",
"rabbit2": "🐇",
"racing_motorcycle": "🏍",
"radioactive_sign": "☢",
"fist": "✊",
"hand": "✋",
"raised_hand_with_fingers_splayed": "🖐",
"raised_hand_with_part_between_middle_and_ring_fingers": "🖖",
"blue_car": "🚙",
"apple": "🍎",
"relieved": "😌",
"reversed_hand_with_middle_finger_extended": "🖕",
"mag_right": "🔎",
"arrow_right_hook": "↪",
"sweet_potato": "🍠",
"robot": "🤖",
"rolled__up_newspaper": "🗞",
"rowboat": "🚣",
"runner": "🏃",
"running": "🏃",
"running_shirt_with_sash": "🎽",
"boat": "⛵",
"scales": "⚖",
"school_satchel": "🎒",
"scorpius": "♏",
"see_no_evil": "🙈",
"sheep": "🐑",
"stars": "🌠",
"cake": "🍰",
"six_pointed_star": "🔯",
"ski": "🎿",
"sleeping_accommodation": "🛌",
"sleeping": "😴",
"sleepy": "😪",
"sleuth_or_spy": "🕵",
"heart_eyes_cat": "😻",
"smiley_cat": "😺",
"innocent": "😇",
"heart_eyes": "😍",
"smiling_imp": "😈",
"smiley": "😃",
"sweat_smile": "😅",
"smile": "😄",
"laughing": "😆",
"satisfied": "😆",
"blush": "😊",
"smirk": "😏",
"smoking": "🚬",
"snow_capped_mountain": "🏔",
"soccer": "⚽",
"icecream": "🍦",
"soon": "🔜",
"arrow_lower_right": "↘",
"arrow_lower_left": "↙",
"speak_no_evil": "🙊",
"speaker": "🔈",
"mute": "🔇",
"sound": "🔉",
"loud_sound": "🔊",
"speaking_head_in_silhouette": "🗣",
"spiral_calendar_pad": "🗓",
"spiral_note_pad": "🗒",
"shell": "🐚",
"sweat_drops": "💦",
"u5272": "🈹",
"u5408": "🈴",
"u55b6": "🈺",
"u6307": "🈯",
"u6708": "🈷",
"u6709": "🈶",
"u6e80": "🈵",
"u7121": "🈚",
"u7533": "🈸",
"u7981": "🈲",
"u7a7a": "🈳",
"cl": "🆑",
"cool": "🆒",
"free": "🆓",
"id": "🆔",
"koko": "🈁",
"sa": "🈂",
"new": "🆕",
"ng": "🆖",
"ok": "🆗",
"sos": "🆘",
"up": "🆙",
"vs": "🆚",
"steam_locomotive": "🚂",
"ramen": "🍜",
"partly_sunny": "⛅",
"city_sunrise": "🌇",
"surfer": "🏄",
"swimmer": "🏊",
"shirt": "👕",
"tshirt": "👕",
"table_tennis_paddle_and_ball": "🏓",
"tea": "🍵",
"tv": "📺",
"three_button_mouse": "🖱",
"+1": "👍",
"thumbsup": "👍",
"__1": "👎",
"-1": "👎",
"thumbsdown": "👎",
"thunder_cloud_and_rain": "⛈",
"tiger2": "🐅",
"tophat": "🎩",
"top": "🔝",
"tm": "™",
"train2": "🚆",
"triangular_flag_on_post": "🚩",
"trident": "🔱",
"twisted_rightwards_arrows": "🔀",
"unamused": "😒",
"small_red_triangle": "🔺",
"arrow_up_small": "🔼",
"arrow_up_down": "↕",
"upside__down_face": "🙃",
"arrow_up": "⬆",
"v": "✌",
"vhs": "📼",
"wc": "🚾",
"ocean": "🌊",
"waving_black_flag": "🏴",
"wave": "👋",
"waving_white_flag": "🏳",
"moon": "🌔",
"scream_cat": "🙀",
"weary": "😩",
"weight_lifter": "🏋",
"whale2": "🐋",
"wheelchair": "♿",
"point_down": "👇",
"grey_exclamation": "❕",
"white_frowning_face": "☹",
"white_check_mark": "✅",
"point_left": "👈",
"white_medium_small_square": "◽",
"star": "⭐",
"grey_question": "❔",
"point_right": "👉",
"relaxed": "☺",
"white_sun_behind_cloud": "🌥",
"white_sun_behind_cloud_with_rain": "🌦",
"white_sun_with_small_cloud": "🌤",
"point_up_2": "👆",
"point_up": "☝",
"wind_blowing_face": "🌬",
"wink": "😉",
"wolf": "🐺",
"dancers": "👯",
"boot": "👢",
"womans_clothes": "👚",
"womans_hat": "👒",
"sandal": "👡",
"womens": "🚺",
"worried": "😟",
"gift": "🎁",
"zipper__mouth_face": "🤐",
"regional_indicator_a": "🇦",
"regional_indicator_b": "🇧",
"regional_indicator_c": "🇨",
"regional_indicator_d": "🇩",
"regional_indicator_e": "🇪",
"regional_indicator_f": "🇫",
"regional_indicator_g": "🇬",
"regional_indicator_h": "🇭",
"regional_indicator_i": "🇮",
"regional_indicator_j": "🇯",
"regional_indicator_k": "🇰",
"regional_indicator_l": "🇱",
"regional_indicator_m": "🇲",
"regional_indicator_n": "🇳",
"regional_indicator_o": "🇴",
"regional_indicator_p": "🇵",
"regional_indicator_q": "🇶",
"regional_indicator_r": "🇷",
"regional_indicator_s": "🇸",
"regional_indicator_t": "🇹",
"regional_indicator_u": "🇺",
"regional_indicator_v": "🇻",
"regional_indicator_w": "🇼",
"regional_indicator_x": "🇽",
"regional_indicator_y": "🇾",
"regional_indicator_z": "🇿",
pytorch
2.1.1
© 2005-2020 Rich Felker, et al.
© 2005-2020 Rich Felker, et al.
(c) & 0x80) == 0x00;
(c) & 0x80) == 0x00;
(c) & 0xC0) == 0xC0;
auto is_leading_2b = [](char c) { return static_cast<unsigned char>(c) <= 0xDF; };
auto is_leading_3b = [](char c) { return static_cast<unsigned char>(c) <= 0xEF; };
// If the last character is ASCII, there are no incomplete code points
if (is_ascii(*rpptr)) {
return 0;
}
// Otherwise, work back from the end of the buffer and find the first
// UTF-8 leading byte
const auto rpend = rbase - rpptr >= 3 ? rpptr + 3 : rbase;
const auto leading = std::find_if(rpptr, rpend, is_leading);
if (leading == rbase) {
return 0;
(c) & 0xC0) == 0xC0;
auto is_leading_2b = [](char c) { return static_cast<unsigned char>(c) <= 0xDF; };
auto is_leading_3b = [](char c) { return static_cast<unsigned char>(c) <= 0xEF; };
// If the last character is ASCII, there are no incomplete code points
if (is_ascii(*rpptr)) {
return 0;
}
// Otherwise, work back from the end of the buffer and find the first
// UTF-8 leading byte
const auto rpend = rbase - rpptr >= 3 ? rpptr + 3 : rbase;
const auto leading = std::find_if(rpptr, rpend, is_leading);
if (leading == rbase) {
return 0;
(c) > 255:
has_high_char = True
break
if has_high_char:
(c) > 255:
has_high_char = True
break
if has_high_char:
(c)
assert a.is_bool
assert b.is_bool == c.is_bool
if b.is_bool:
(C) Copyright John Maddock 2006.
(C) Copyright John Maddock 2006.
(c) Create/register a custom symbolic function to replace the default one.\n",
},
"message_strings": {
"default": {
"text": "The OnnxFunction: {symbolic_fn} is the nearest match of the node {node}."
(c) Create/register a custom symbolic function to replace the default one.\n\nHere are some suggestions based on the ERROR situation:\n\n1. Report the unsupported operator to the PyTorch-ONNX team.\n2. Create/register a custom symbolic function to replace the default one.\n",
},
"message_strings": {
"default": {
"text": "Checking if the FX node: {node} is supported in onnx registry."
(C)
d = tl.load(D)
else:
(c) for c in constraint.cseq
(c) for c in constraint.cseq
)
(c) for c in "HWC"
tensor_HWC = tensor.transpose(index)
if tensor_HWC.shape[2] == 1:
(c) for c in "HW"
tensor = tensor.transpose(index)
tensor = np.stack([tensor, tensor, tensor], 2)
(c) for c in "NCHW"
tensor_NCHW = tensor.transpose(index)
tensor_CHW = make_grid(tensor_NCHW)
return tensor_CHW.transpose(1, 2, 0)
if len(input_format) == 3:
(c) for c in pattern.split(separator))
(c) for c in signature)
raise TypeError(f"Tried to dispatch on non-type: {typ}\n"
f"In signature: <{str_sig}>\n"
f"In function: {self.name}")
# handle variadic signatures
if isinstance(typ, list):
(C)` for unbatched input,
:math:`(minibatch, C)` or :math:`(minibatch, C, d_1, d_2, ..., d_K)` with :math:`K \geq 1` for the
`K`-dimensional case. The last being useful for higher dimension inputs, such
as computing cross entropy loss per-pixel for 2D images.
The `target` that this criterion expects should contain either:
(c) If "a" is used as an input into a view "inverse" / "scatter"
operator, it is potentially fine to re-inplace
(and remove that scatter operator from the graph).
See below for a more detailed example.
NOTE: there is an optimization in this step that is crucial
to fully recovering performance from functionalization.
(c) is better placed after (b) because it may leave corrupted
# data in `worker_result_queue`, which `pin_memory_thread`
# reads from, in which case the `pin_memory_thread` can only
# happen at timing out, which is slow. Nonetheless, same thing
# happens if a worker is killed by signal at unfortunate times,
# but in other cases, we are better off having a non-corrupted
# `worker_result_queue` for `pin_memory_thread`.
#
# NOTE: If `pin_memory=False`, there is no `pin_memory_thread` and (b)
# can be omitted
(c)
kwargs =
if optimizer_kwargs is not None:
(c) "\n"
#define TORCH_SDT_ASM_STRING(x) TORCH_SDT_ASM_1(.asciz TORCH_SDT_S(x))
// Helper to determine the size of an argument.
#define TORCH_SDT_IS_ARRAY_POINTER(x) ((__builtin_classify_type(x) == 14) || \
(__builtin_classify_type(x) == 5))
#define TORCH_SDT_ARGSIZE(x) (TORCH_SDT_IS_ARRAY_POINTER(x) \
? sizeof(void*) \
: sizeof(x))
(c) no zeros reduced (self
# (d) 2 zeros reduced (both from src) is tested in test/test_autograd.py
# test_scatter_index_reduce_prod_gradgrad_error as this case is not supported for gradgrad
input = torch.tensor([[0, 13], [0, 0], [15, 19]], dtype=dtype, device=device, requires_grad=requires_grad)
src = torch.tensor([[2, 0], [0, 0], [2, 3], [2, 2]], dtype=dtype, device=device, requires_grad=requires_grad)
idx = torch.tensor([0, 1, 2, 0], dtype=torch.long, device=device)
yield SampleInput(input,
args=(0, idx, src, 'prod'),
kwargs={'include_self': True})
(c) no zeros reduced (self(
# (d) 2 zeros reduced (both from src) is tested in test/test_autograd.py
# test_scatter_index_reduce_prod_gradgrad_error as this case is not supported for gradgrad
input = torch.tensor([[0, 13], [0, 17], [0, 19]], dtype=dtype, device=device, requires_grad=requires_grad)
src = torch.tensor([[0, 1, 2, 3], [0, 4, 0, 1], [2, 3, 5, 6]], dtype=dtype, device=device, requires_grad=requires_grad)
idx = torch.tensor([[1, 1, 0, 0], [0, 0, 1, 1], [0, 0, 0, 1]], dtype=torch.long, device=device)
yield SampleInput(input,
args=(1, idx, src, reduce),
kwargs={'include_self': True})
Copyright
Copyright © 1995-2011 by Fredrik Lundh
Copyright © 1995-2011 by Fredrik Lundh
Pillow is the friendly PIL fork. It is
Copyright © 1995-2011 by Fredrik Lundh
Pillow is the friendly PIL fork. It is
Copyright © 1995-2011 by Fredrik Lundh
Pillow is the friendly PIL fork. It is
Copyright © 1997-2011 by Secret Labs AB
Copyright © 1997-2011 by Secret Labs AB
Copyright © 1997-2011 by Secret Labs AB
Copyright 2004-present Facebook. All Rights Reserved.
Copyright 2004-present Facebook. All Rights Reserved.
#pragma once
Copyright 2004-present Facebook. All Rights Reserved.
#pragma once
#include <ATen/core/Tensor.h>
Copyright 2004-present Facebook. All Rights Reserved.
#pragma once
#include <ATen/core/Tensor.h>
#include <ATen/native/DispatchStub.h>
Copyright 2005 Robert Kern (robert.kern@gmail.com)
Copyright 2008, Google Inc.
Copyright 2008 Google Inc. All rights reserved.
Copyright 2008 Google Inc. All rights reserved.
Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
Copyright 2010-2014 Rich Geldreich and Tenacious Software LLC
Copyright © 2010-2022 by Alex Clark and contributors
Copyright © 2010-2022 by Alex Clark and contributors
Copyright © 2010-2022 by Alex Clark and contributors
Copyright 2013-2014 RAD Game Tools and Valve Software
Copyright 2013 Mark Dickinson
Copyright 2013 Mark Dickinson
Copyright 2014 Google Inc.
Copyright 2016-2021 Intel Corporation
Copyright 2017 The Native Object Protocols Authors
Copyright 2018 YANDEX LLC
Copyright 2019-2020 Kakao Brain
Copyright 2019-2020 Kakao Brain
All other contributions:
Copyright 2019-2020 Kakao Brain
All other contributions:
Copyright 2019-2021 FUJITSU LIMITED
Copyright 2019 Google LLC
Copyright 2019 Google LLC
Copyright 2019 Kakao Brain
Copyright 2019 Kakao Brain
#
copyright: 2019 The TensorFlow Authors.
copyright: 2019 The TensorFlow Authors.
Copyright 2020 Arm Limited and affiliates
Copyright 2020 Codeplay Software Limited
Copyright 2020 Intel Corporation
Copyright 2020 Intel Corporation
Copyright 2020-present Daniel Trugman
Copyright 2021 Alanna Tempest
Copyright © 2022 Apple Inc.
Copyright © 2022 Apple Inc.
#define AT_DISPATCH_MPS_TYPES(TYPE, NAME, ...) \
AT_DISPATCH_SWITCH( \
TYPE, NAME, \
AT_DISPATCH_CASE(at::ScalarType::Float, __VA_ARGS__) \
AT_DISPATCH_CASE(at::ScalarType::Half, __VA_ARGS__) \
AT_DISPATCH_CASE(at::ScalarType::Long, __VA_ARGS__) \
AT_DISPATCH_CASE(at::ScalarType::Int, __VA_ARGS__) \
AT_DISPATCH_CASE(at::ScalarType::Short, __VA_ARGS__) \
AT_DISPATCH_CASE(at::ScalarType::Char, __VA_ARGS__) \
Copyright © 2022 Apple Inc.
#pragma once
Copyright © 2022 Apple Inc.
#pragma once
#include <ATen/core/TensorBase.h>
Copyright © 2022 Apple Inc.
#pragma once
#include <ATen/core/Tensor.h>
Copyright © 2022 Apple Inc.
#pragma once
#include <c10/core/Allocator.h>
#include <c10/macros/Macros.h>
#include <c10/util/Exception.h>
Copyright © 2022 Apple Inc.
#pragma once
#include <c10/core/impl/DeviceGuardImplInterface.h>
#include <c10/macros/Macros.h>
#include <c10/util/Exception.h>
#include <ATen/Context.h>
#include <ATen/mps/MPSStream.h>
#include <ATen/mps/MPSEvent.h>
Copyright 2022 Cruise LLC
Copyright 2022 Cruise LLC
import logging
import warnings
from collections import OrderedDict
from typing import Union, Iterable, Dict
import torch
import torch.distributed as dist
import torch.distributed.algorithms.model_averaging.averagers as averagers
import torch.distributed.algorithms.model_averaging.utils as utils
Copyright © 2023 Apple Inc.
Copyright © 2023 Apple Inc.
#pragma once
copyright Alexander Chemeris
copyright Alexander Chemeris.
COPYRIGHT
All contributions by the University of California:
COPYRIGHT
All contributions by the University of California:
copyright Berkeley Software Design
Copyright (c) 1994
* Hewlett-Packard Company
Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. Hewlett-Packard Company makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
Copyright (c) 1996-1998
Copyright (c) 1996-1998
* Silicon Graphics Computer Systems, Inc.
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,
* provided that the above copyright notice appear in all copies and
* that both that copyright notice and this permission notice appear
* in supporting documentation. Silicon Graphics makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied warranty.
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. The names of its contributors may not be used to endorse or promote
Copyright (C) 2000-2017 Julian Seward. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Copyright (C) 2000-2017 Julian Seward. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
// 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software
// Foundation; All Rights Reserved
Copyright (c) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
// 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020 Python Software
// Foundation; All Rights Reserved
//
// Stolen (with appropriate modifications) by @agolynski
// (https://github.com/pytorch/pytorch/pull/33019) from cpython repo
// Objects/sliceobject.c with comment: this is harder to get right than you
// might think
Copyright (c) 2001-2002 Enthought, Inc. 2003-2019, SciPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2001-2002 Enthought, Inc. 2003-2019, SciPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2001-2004 Idiap Research Institute (Ronan Collobert, Samy Bengio, Johnny Mariethoz)
Copyright (C) 2001-2019 Free Software Foundation, Inc.
Copyright (C) 2001-2019 Free Software Foundation, Inc.
Copyright (C) 2003-2017 Josef Weidendorfer. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Copyright (C) 2003-2017 Josef Weidendorfer. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
Copyright (c) 2005-2010 ActiveState Software Inc.
Copyright (c) 2005-2010 ActiveState Software Inc.
Copyright (c) 2006-2010 NEC Laboratories America (Ronan Collobert, Leon Bottou, Iain Melvin, Jason Weston)
Copyright (c) 2006 Idiap Research Institute (Samy Bengio)
Copyright (c) 2006 Idiap Research Institute (Samy Bengio)
Copyright (c) 2007-2009
Copyright (c) 2007-2009
Copyright (c) 2007-2009
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
#
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
#
Copyright (c) 2008 - 2009 NVIDIA Corporation. All rights reserved.
Copyright (C) 2009 Google Inc.
Copyright (C) 2010-2012 Marat Dukhan
Copyright (c) 2010-2017 Benjamin Peterson
Copyright (c) 2010 ActiveState Software Inc.
Copyright (c) 2010 ActiveState Software Inc.
Copyright (c) 2010 Jonathan Hartley <tartley@tartley.com>
Copyright (C) 2011 - 2012 Andrzej Krzemienski.
Copyright (C) 2011 - 2012 Andrzej Krzemienski.
Copyright (c) 2011-2012 NEC Laboratories America (Koray Kavukcuoglu)
Copyright (c) 2011-2013 NYU
Copyright (c) 2011-2013 NYU (Clement Farabet)
Copyright (c) 2011-2014, Andrew Fischer <andrew@ltengsoft.com>
Copyright (c) 2011-2014 Idiap Research Institute (Ronan Collobert)
Copyright (c) 2011-2019 Stephan Brumme. All rights reserved.
// Slicing-by-16 contributed by Bulat Ziganshin
// Tableless bytewise CRC contributed by Hagai Gold
// see http://create.stephan-brumme.com/disclaimer.html
//
Copyright (c) 2011-2019 Stephan Brumme. All rights reserved.
// Slicing-by-16 contributed by Bulat Ziganshin
// Tableless bytewise CRC contributed by Hagai Gold
// see http://create.stephan-brumme.com/disclaimer.html
//
Copyright (c) 2011, Intel Corporation. All rights reserved.
Copyright (c) 2012-2014 Deepmind Technologies (Koray Kavukcuoglu)
Copyright (C) 2012-2016 Intel Corporation. All rights reserved.
Copyright (C) 2012-2016 Intel Corporation. All rights reserved.
Copyright (C) 2012-2017 Georgia Institute of Technology
Copyright (C) 2012 Giovanni Garberoglio
Copyright (C) 2012 Giovanni Garberoglio
Interdisciplinary Laboratory for Computational Science (LISC)
Fondazione Bruno Kessler and University of Trento
via Sommarive, 18
I-38123 Trento (Italy)
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Copyright (c) 2012 Massachusetts Institute of Technology
Copyright (c) 2012 Massachusetts Institute of Technology
Copyright (c) 2012 - present, Victor Zverovich
Copyright(c) 2013, 2014, 2015, the respective contributors
Copyright(c) 2013, 2014, 2015, the respective contributors
All rights reserved.
Copyright (c) 2013-2017, Georgia Institute of Technology
Copyright (c) 2013-2017, Georgia Institute of Technology
All rights reserved.
Copyright (c) 2013-2021 Niels Lohmann
Copyright (c) 2013 Eddy Petri
Copyright (c) 2013 Eddy Petri
# flake8: noqa
Copyright (c) 2013, Ethan Furman.
Copyright (c) 2014-2017 Georgia Institute of Technology
Copyright (c) 2014- Facebook, Inc (Soumith Chintala)
Copyright (c) 2014 Indiana University
Copyright (c) 2014 Indiana University
All rights reserved.
Written by Prof. Gary L. Pavlis, Dept. of Geol. Sci.,
Indiana University, Bloomington, IN
Copyright (c) 2014, The Regents of the University of California (Regents)
All rights reserved.
All other contributions:
Copyright (c) 2014, The Regents of the University of California (Regents)
All rights reserved.
All other contributions:
Copyright (c) 2014, the respective contributors
All rights reserved.
Copyright (c) 2014, the respective contributors
All rights reserved.
Copyright (c) 2015-2016 Advanced Micro Devices, Inc. All rights reserved.
Copyright (c) 2015-2016 Advanced Micro Devices, Inc. All rights reserved.
Copyright(c) 2015, 2016 the respective contributors
All rights reserved.
Copyright(c) 2015, 2016 the respective contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright(c) 2015, 2016 the respective contributors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright (c) 2015-2017 Georgia Institute of Technology
Copyright (c) 2015-2017, Georgia Institute of Technology
All rights reserved.
Copyright (c) 2015-2020, NVIDIA CORPORATION. All rights reserved.
Copyright (c) 2015 Google Inc.
Copyright (c) 2015 Google Inc.
All rights reserved.
All contributions by Yangqing Jia:
Copyright (c) 2015 Google Inc.
All rights reserved.
All contributions by Yangqing Jia:
Copyright (c) 2015 Melissa E. O
Copyright (c) 2015-present libuv project contributors.
Copyright (c) 2015 Yangqing Jia
All rights reserved.
Copyright (c) 2015 Yangqing Jia
All rights reserved.
All contributions by Kakao Brain:
Copyright (c) 2015 Yangqing Jia
All rights reserved.
All contributions by Kakao Brain:
Copyright (c) 2016-2017 Marat Dukhan
Copyright (c) 2016-2021 Viktor Kirilov
Copyright (c) 2016, Bogdan Cristea <cristeab@gmail.com>
Copyright (c) 2016 Facebook Inc.
Copyright (c) 2016- Facebook, Inc (Adam Paszke)
Copyright (c) 2016 Facebook Inc.
All contributions by Google:
Copyright (c) 2016 Facebook Inc.
All contributions by Google:
Copyright (c) 2016 Klemens Morgenstern <klemens.morgenstern@ed-chemnitz.de> and
Copyright (c) 2016 Klemens Morgenstern <klemens.morgenstern@ed-chemnitz.de> and
Copyright (c) 2016-present, Facebook Inc. All rights reserved.
Copyright (c) 2016-present, Facebook, Inc. All rights reserved.
Copyright (c) 2016 Sergey Lyskov and Wenzel Jakob
Copyright (c) 2016 Sergey Lyskov and Wenzel Jakob
Copyright (c) 2016 Trent Houliston <trent@houliston.me> and
Copyright (c) 2016 Trent Houliston <trent@houliston.me> and
Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>
Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>, All rights reserved.
Copyright (c) 2017-2018 Facebook Inc.
Copyright (c) 2017-2021 Huu Nguyen
Copyright (c) 2017-2022 Advanced Micro Devices, Inc. All rights reserved.
Copyright (c) 2017 - 2022 NVIDIA CORPORATION
Copyright (c) 2017 - 2023 NVIDIA CORPORATION
Copyright (c) 2017 AMD Compute Libraries
Copyright (c) 2017 by Contributors
Copyright (c) 2017 by Contributors
* \file dlpack.h
* \brief The common header of DLPack.
*/
#ifndef DLPACK_DLPACK_H_
#define DLPACK_DLPACK_H_
Copyright (c) 2017 Facebook Inc.
Copyright (c) 2017, Facebook Inc.
Copyright (c) 2017 Georgia Institute of Technology
Copyright (c) 2017 Henry F. Schreiner
Copyright (c) 2017 Henry F. Schreiner
Copyright (c) 2017 Jason Rhinelander <jason@imaginary.ca>
Copyright (c) 2017 Jason Rhinelander <jason@imaginary.ca>
Copyright (c) 2017-present, Facebook, Inc. All rights reserved.
Copyright (c) 2017 Wenzel Jakob <wenzel.jakob@epfl.ch>
Copyright (c) 2017 Wenzel Jakob <wenzel.jakob@epfl.ch>
Copyright (c) 2017, Yangqing Jia <me@daggerfs.com>
Copyright (c) 2018-2021 Microsoft Corporation, Daan Leijen
Copyright (c) 2018 Alex Rogozhnikov
Copyright (c) 2018 Alex Rogozhnikov
Copyright (c) 2018 Intel Corporation.
Copyright (C) 2018 Marat Dukhan
Copyright (c) 2018, NVIDIA CORPORATION. All rights reserved.
Copyright (c) 2018 Open Neural Network Exchange
Copyright (c) 2018, Steven Moshier
Copyright (c) 2018, Steven Moshier
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
Copyright (c) 2018, Steven Moshier
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
Copyright (c) 2018, Steven Moshier
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
Copyright (c) 2019 Google LLC
Copyright (c) 2019 Lu Fang
Copyright (c) 2019 NumPy Developers
Copyright (c) 2019 NumPy Developers
Copyright (c) 2020, NVIDIA CORPORATION. All rights reserved.
Copyright (c) 2022 Cruise LLC.
All rights reserved.
Copyright (c) 2022 libcpr and many other contributors
Copyright (c) 2022, NVIDIA CORPORATION. All rights reserved.
Copyright (c) 2023 The pybind Community.
#pragma once
Copyright (c) 2023 The pybind Community.
#pragma once
Copyright (C) Bj
Copyright (C) Bj
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates.
Copyright (c) Facebook, Inc. and its affiliates. All rights reserved.
Copyright (c) Facebook, Inc. and its affiliates. All rights reserved.
Copyright (c) Facebook, Inc. and its affiliates.
// All rights reserved.
//
Copyright (c) Facebook, Inc. and Microsoft Corporation.
Copyright (c) Meta Platforms, Inc. and affiliates
Copyright (c) Meta Platforms, Inc. and affiliates.
Copyright (c) Meta Platforms, Inc. and affiliates.
Copyright (c) Meta Platforms, Inc. and affiliates. All rights reserved.
Copyright (c) Meta Platforms, Inc. and affiliates
# flake8: noqa
from .binary import _apply_native_binary, _is_native_binary
from .core import is_masked_tensor, MaskedTensor
from .passthrough import _apply_pass_through_fn, _is_pass_through_fn
from .reductions import _apply_reduction, _is_reduction
Copyright (c) Meta Platforms, Inc. and affiliates
# flake8: noqa
from .binary import _apply_native_binary, _is_native_binary
from .core import is_masked_tensor, MaskedTensor
from .passthrough import _apply_pass_through_fn, _is_pass_through_fn
from .reductions import _apply_reduction, _is_reduction
Copyright (c) Meta Platforms, Inc. and affiliates
from abc import ABC, abstractmethod
from typing import Optional, Union
import torch
from torch.distributed._tensor import DeviceMesh, DTensor, Replicate, Shard
from torch.distributed.tensor.parallel._utils import (
_prepare_input_validate,
_prepare_output_validate,
_PrepareInputType,
_PrepareOutputType,
Copyright (c) Meta Platforms, Inc. and affiliates
from contextlib import contextmanager
from dataclasses import dataclass
import itertools
import sys
from functools import wraps
from typing import (
Any,
Callable,
Generator,
Iterator,
Tuple,
Dict,
List,
Sequence,
TypeVar,
cast,
Copyright (c) Meta Platforms, Inc. and affiliates
from .core import MaskedTensor
Copyright (c) Meta Platforms, Inc. and affiliates
from dataclasses import dataclass
from typing import Callable, cast, Dict, Iterable, Optional, Sequence, Set, Tuple, Union
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
from dataclasses import dataclass
from typing import cast, List, Optional, Tuple
Copyright (c) Meta Platforms, Inc. and affiliates
from .embedding_ops import * # noqa: F403
from .matrix_ops import * # noqa: F403
from .math_ops import * # noqa: F403
from .tensor_ops import * # noqa: F403
from .pointwise_ops import * # noqa: F403
from .random_ops import * # noqa: F403
Copyright (c) Meta Platforms, Inc. and affiliates
from functools import partial
from typing import Any, Optional, Tuple
import torch
from torch.distributed._tensor import DeviceMesh, DTensor, Replicate, Shard
Copyright (c) Meta Platforms, Inc. and affiliates
from functools import partial
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
from torch.distributed.tensor.parallel.api import parallelize_module
from torch.distributed.tensor.parallel.style import (
ColwiseParallel,
make_input_replicate_1d,
make_input_reshard_replicate,
make_input_shard_1d,
make_input_shard_1d_last_dim,
make_sharded_output_tensor,
make_output_replicate_1d,
make_output_reshard_tensor,
make_output_shard_1d,
make_output_tensor,
PairwiseParallel,
ParallelStyle,
RowwiseParallel,
SequenceParallel,
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast, Dict, List, Optional, Sequence, Tuple
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast, Dict, List, Optional, Sequence, Tuple
import torch
from torch.distributed._tensor._utils import compute_local_shape
from torch.distributed._tensor.op_schema import OpSchema, OutputSharding
from torch.distributed._tensor.ops.utils import prod
from torch.distributed._tensor.placement_types import DTensorSpec
from torch.fx.passes.shape_prop import TensorMetadata
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast, Dict, List, Tuple
import torch
import torch.distributed._tensor.api as dtensor
from torch.distributed._tensor.device_mesh import DeviceMesh
from torch.distributed._tensor.placement_types import (
_Partial,
DTensorSpec,
Placement,
Replicate,
Shard,
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast, List, Optional, Sequence, Tuple
import torch
from torch.distributed._tensor.op_schema import OpSchema, OutputSharding
from torch.distributed._tensor.ops.common_rules import pointwise_rule
from torch.distributed._tensor.ops.utils import register_prop_rule
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import cast, Optional, Sequence
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import Dict, Tuple
from torch.distributed.checkpoint.metadata import (
STATE_DICT_TYPE,
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import Dict, Union
import torch
import torch.nn as nn
import torch.distributed._tensor.random as random
from torch.distributed._tensor import (
DeviceMesh,
distribute_module,
distribute_tensor,
Replicate,
Shard,
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import Optional, Sequence
# Import all builtin dist tensor ops
import torch
import torch.distributed._tensor.ops
import torch.distributed._tensor.random as random
from torch.distributed._tensor._utils import compute_local_shape
from torch.distributed._tensor.api import distribute_module, distribute_tensor, DTensor
from torch.distributed._tensor.device_mesh import (
DeviceMesh,
init_device_mesh,
mesh_resources,
Copyright (c) Meta Platforms, Inc. and affiliates
from typing import Tuple, Union, Sequence, cast
import torch
from torch.distributed._tensor import DeviceMesh
from torch.distributed._tensor import DTensor as DT
from torch.distributed._tensor.ops.utils import prod
from torch.distributed._tensor.placement_types import (
_Partial,
Placement,
Replicate,
Shard,
Copyright (c) Meta Platforms, Inc. and affiliates
# implement matrix related ops for distributed tensor
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
# implement matrix related ops for distributed tensor
import torch
from torch.distributed._tensor.op_schema import OpSchema, OutputSharding
from torch.distributed._tensor.ops.utils import register_prop_rule
Copyright (c) Meta Platforms, Inc. and affiliates
import contextlib
import warnings
from typing import Dict, List, Optional
import torch
import torch.distributed as dist
Copyright (c) Meta Platforms, Inc. and affiliates
import copy
Copyright (c) Meta Platforms, Inc. and affiliates
import dataclasses
from typing import Dict, List, Optional, Sequence, Tuple, Union, cast
from torch.distributed.checkpoint.planner import LoadPlan
Copyright (c) Meta Platforms, Inc. and affiliates
import dataclasses
import io
import logging
import operator
from collections import ChainMap
from functools import reduce
from typing import List, Tuple, Dict, Any, Union, cast
Copyright (c) Meta Platforms, Inc. and affiliates
import dataclasses
import logging
from typing import Dict, List
from torch.distributed.checkpoint.metadata import MetadataIndex
from torch.distributed.checkpoint.planner import SavePlan
Copyright (c) Meta Platforms, Inc. and affiliates
import functools
import operator
from typing import cast, Dict, List, Sequence, Tuple
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
import functools
import operator
from typing import cast, Iterable, List, Sequence, Union
import torch
from torch.distributed._tensor.api import DTensor
from torch.distributed._tensor.placement_types import DTensorSpec, Shard
Copyright (c) Meta Platforms, Inc. and affiliates
import logging
import math
from typing import Dict, List, Optional, Tuple, TYPE_CHECKING, Union
import torch
import torch.distributed._functional_collectives as funcol
Copyright (c) Meta Platforms, Inc. and affiliates
import shutil
import tempfile
from functools import wraps
from typing import Any, Callable, Dict, Optional, Tuple
Copyright (c) Meta Platforms, Inc. and affiliates
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
import torch
from typing import (
Callable,
Collection,
List,
Mapping,
MutableMapping,
Optional,
Tuple,
TypeVar,
Union,
cast,
Copyright (c) Meta Platforms, Inc. and affiliates
import warnings
Copyright (c) Meta Platforms, Inc. and affiliates
import warnings
from typing import Callable, cast, Optional, Sequence, Tuple
import torch
Copyright (c) Meta Platforms, Inc. and affiliates
"""
These are functions that should simply be applied to both mask and data.
Take select or stack as an example. This operation can be applied to
both the mask and data of a MaskedTensor and the result wrapped into
a new MaskedTensor as a result.
Copyright (c) Meta Platforms, Inc. and its affiliates.
Copyright (c) Meta Platforms, Inc. and its affiliates.
Copyright (c) Meta Platforms, Inc. and its affiliates.
Copyright (c) Microsoft Corporation. (The Azure AI Platform team)
Copyright: Contributors to the Pyro project.
Copyright: Contributors to the Pyro project.
Copyright Contributors to the pythoncapi_compat project.
Copyright Contributors to the pythoncapi_compat project.
//
// Homepage:
COPYRIGHT
----------------------------------------------------------------------
Copyright
copyright:
/* Copyright 2005 Robert Kern (robert.kern@gmail.com)
copyright:
# Copyright (c) 2015 Melissa E. O
copyright details. If a contributor wants to further mark
their specific copyright on a particular contribution, they should indicate
copyright details. If a contributor wants to further mark
their specific copyright on a particular contribution, they should indicate
copyright Google Inc. and Sony Mobile Communications AB.
Copyright Joyent, Inc. and other Node contributors. All rights reserved.
Copyright Malte Skarupke 2017.
Copyright Malte Skarupke 2017.
Copyright Michael Park, 2015-2017
Copyright Michael Park, 2015-2017
copyright model: each contributor holds copyright over
their contributions to Caffe. The project versioning records all such
copyright model: each contributor holds copyright over
their contributions to Caffe. The project versioning records all such
Copyright Naoki Shibata and contributors 2010 - 2020.
Copyright Naoki Shibata and contributors 2010 - 2020.
copyright Niels Provos.
copyright Niels Provos. Two clause BSD license.
copyright solely in the commit message of the change when it is
copyright solely in the commit message of the change when it is
copyright the Internet Systems Consortium, Inc., and licensed under the ISC
(C)` or :math:
is the number of classes.
(C)` or :math:
- Output: scalar. If :attr:`reduction` is ``'none'``, then :math:`(N)`.
Examples::
(c) "per-backend instances of customizable functionalities" (e.g. CPU,
// SparseCPU, AutogradCPU)
// (3) "Alias" DispatchKeys (see Note [Alias Dispatch Keys])
//
// (1) Building block keys always correspond to individual bits in a
// DispatchKeySet. They can also be combined in a DispatchKeySet to form actual
// runtime keys. e.g.
// auto dense_cpu_ks = DispatchKeySet({DispatchKey::CPUBit,
// DispatchKey::Dense});
// // The keyset has the runtime dense-cpu key.
// dense_cpu_ks.has(DispatchKey::CPU);
// // And it contains the building block keys too.
// dense_cpu_ks.has(DispatchKey::CPUBit);
// dense_cpu_ks.has(DispatchKey::Dense);
(c)
@register_decomposition(aten.pairwise_distance)
@out_wrapper()
def pairwise_distance(
x1: TensorLikeType,
x2: TensorLikeType,
p: NumberType = 2.0,
eps: NumberType = 1e-6,
keepdim=False,
) -> TensorLikeType:
return torch.linalg.vector_norm(x1 - x2 + eps, ord=p, dim=-1, keepdim=keepdim)
(c)
return
(c)
return Disj(res), counter
(c)
return self._from_dict(counts, self.inclusive)
@staticmethod
def _from_dict(counts: Dict[str, int], inclusive: bool) -> "FunctionCounts":
(c)
self.launchers =
self.lock = threading.Lock()
if os.getenv("TRITON_CACHE_DIR") is None:
(c)
self.push(b)
def DUP_TOP(self, inst):
(c)
self.push(b)
def ROT_FOUR(self, inst):
(c) some initialization has completed
(c)
@staticmethod
def or_(a, b):
(c) (torch.backends.cudnn.__cudnn_version)
assert (
len(args) == 1 or "tensor" in kwargs
), "Expect 1 input to cudnn.is_acceptable"
tensor_variable = args[0] if len(args) > 0 else kwargs["tensor"]
assert isinstance(
tensor_variable, TensorVariable
), "Expect input to cudnn.is_acceptable to be a tensor"
tensor_inp = torch.tensor(
0, dtype=tensor_variable.dtype, device=tensor_variable.device
)
return ConstantVariable(
torch.backends.cudnn.is_acceptable(tensor_inp), **options
(c) Update all references of the old nodes in the original subgraph to refer
# to the corresponding nodes in the new subgraph in the annotations
#
# In the future, we should try to push as much of this functionality into the
# subgraph rewriter as possible, so we don't have to manually copy anything over.
# For more detail, see https://github.com/pytorch/pytorch/issues/100419.
(C) William Swanson, Paul Fultz
# define PYBIND11_EVAL0(...) __VA_ARGS__
# define PYBIND11_EVAL1(...) PYBIND11_EVAL0(PYBIND11_EVAL0(PYBIND11_EVAL0(__VA_ARGS__)))
# define PYBIND11_EVAL2(...) PYBIND11_EVAL1(PYBIND11_EVAL1(PYBIND11_EVAL1(__VA_ARGS__)))
# define PYBIND11_EVAL3(...) PYBIND11_EVAL2(PYBIND11_EVAL2(PYBIND11_EVAL2(__VA_ARGS__)))
# define PYBIND11_EVAL4(...) PYBIND11_EVAL3(PYBIND11_EVAL3(PYBIND11_EVAL3(__VA_ARGS__)))
# define PYBIND11_EVAL(...) PYBIND11_EVAL4(PYBIND11_EVAL4(PYBIND11_EVAL4(__VA_ARGS__)))
# define PYBIND11_MAP_END(...)
# define PYBIND11_MAP_OUT
# define PYBIND11_MAP_COMMA ,
# define PYBIND11_MAP_GET_END() 0, PYBIND11_MAP_END
# define PYBIND11_MAP_NEXT0(test, next, ...) next PYBIND11_MAP_OUT
# define PYBIND11_MAP_NEXT1(test, next) PYBIND11_MAP_NEXT0(test, next, 0)
# define PYBIND11_MAP_NEXT(test, next) PYBIND11_MAP_NEXT1(PYBIND11_MAP_GET_END test, next)
# if defined(_MSC_VER) \
&& !defined(__clang__) // MSVC is not as eager to expand macros, hence this workaround
# define PYBIND11_MAP_LIST_NEXT1(test, next) \
PYBIND11_EVAL0(PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0))
# else
# define PYBIND11_MAP_LIST_NEXT1(test, next) \
PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0)
# endif
# define PYBIND11_MAP_LIST_NEXT(test, next) \
PYBIND11_MAP_LIST_NEXT1(PYBIND11_MAP_GET_END test, next)
# define PYBIND11_MAP_LIST0(f, t, x, peek, ...) \
f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST1)(f, t, peek, __VA_ARGS__)
# define PYBIND11_MAP_LIST1(f, t, x, peek, ...) \
f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST0)(f, t, peek, __VA_ARGS__)
// PYBIND11_MAP_LIST(f, t, a1, a2, ...) expands to f(t, a1), f(t, a2), ...
# define PYBIND11_MAP_LIST(f, t, ...) \
PYBIND11_EVAL(PYBIND11_MAP_LIST1(f, t, __VA_ARGS__, (), 0))
# define PYBIND11_NUMPY_DTYPE(Type, ...) \
::pybind11::detail::npy_format_descriptor<Type>::register_dtype( \
::std::vector<::pybind11::detail::field_descriptor>{ \
PYBIND11_MAP_LIST(PYBIND11_FIELD_DESCRIPTOR, Type, __VA_ARGS__)})
(C) William Swanson, Paul Fultz
# define PYBIND11_EVAL0(...) __VA_ARGS__
# define PYBIND11_EVAL1(...) PYBIND11_EVAL0(PYBIND11_EVAL0(PYBIND11_EVAL0(__VA_ARGS__)))
# define PYBIND11_EVAL2(...) PYBIND11_EVAL1(PYBIND11_EVAL1(PYBIND11_EVAL1(__VA_ARGS__)))
# define PYBIND11_EVAL3(...) PYBIND11_EVAL2(PYBIND11_EVAL2(PYBIND11_EVAL2(__VA_ARGS__)))
# define PYBIND11_EVAL4(...) PYBIND11_EVAL3(PYBIND11_EVAL3(PYBIND11_EVAL3(__VA_ARGS__)))
# define PYBIND11_EVAL(...) PYBIND11_EVAL4(PYBIND11_EVAL4(PYBIND11_EVAL4(__VA_ARGS__)))
# define PYBIND11_MAP_END(...)
# define PYBIND11_MAP_OUT
# define PYBIND11_MAP_COMMA ,
# define PYBIND11_MAP_GET_END() 0, PYBIND11_MAP_END
# define PYBIND11_MAP_NEXT0(test, next, ...) next PYBIND11_MAP_OUT
# define PYBIND11_MAP_NEXT1(test, next) PYBIND11_MAP_NEXT0(test, next, 0)
# define PYBIND11_MAP_NEXT(test, next) PYBIND11_MAP_NEXT1(PYBIND11_MAP_GET_END test, next)
# if defined(_MSC_VER) \
&& !defined(__clang__) // MSVC is not as eager to expand macros, hence this workaround
# define PYBIND11_MAP_LIST_NEXT1(test, next) \
PYBIND11_EVAL0(PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0))
# else
# define PYBIND11_MAP_LIST_NEXT1(test, next) \
PYBIND11_MAP_NEXT0(test, PYBIND11_MAP_COMMA next, 0)
# endif
# define PYBIND11_MAP_LIST_NEXT(test, next) \
PYBIND11_MAP_LIST_NEXT1(PYBIND11_MAP_GET_END test, next)
# define PYBIND11_MAP_LIST0(f, t, x, peek, ...) \
f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST1)(f, t, peek, __VA_ARGS__)
# define PYBIND11_MAP_LIST1(f, t, x, peek, ...) \
f(t, x) PYBIND11_MAP_LIST_NEXT(peek, PYBIND11_MAP_LIST0)(f, t, peek, __VA_ARGS__)
// PYBIND11_MAP_LIST(f, t, a1, a2, ...) expands to f(t, a1), f(t, a2), ...
# define PYBIND11_MAP_LIST(f, t, ...) \
PYBIND11_EVAL(PYBIND11_MAP_LIST1(f, t, __VA_ARGS__, (), 0))
# define PYBIND11_NUMPY_DTYPE(Type, ...) \
::pybind11::detail::npy_format_descriptor<Type>::register_dtype( \
::std::vector<::pybind11::detail::field_descriptor>{ \
PYBIND11_MAP_LIST(PYBIND11_FIELD_DESCRIPTOR, Type, __VA_ARGS__)})
(c) wrapper function, that calls the autograd.Function.forward() and performs the epilogue
#
# The output of (a, b, c) are all written below.
(C) @ W.T @ inv(D),
where :math:`C` is the capacitance matrix :math:`I + W.T @ inv(D) @ W`, to compute the squared
Mahalanobis distance :math:`x.T @ inv(W @ W.T + D) @ x`.
"""
Wt_Dinv = W.mT / D.unsqueeze(-2)
Wt_Dinv_x = _batch_mv(Wt_Dinv, x)
mahalanobis_term1 = (x.pow(2) / D).sum(-1)
mahalanobis_term2 = _batch_mahalanobis(capacitance_tril, Wt_Dinv_x)
return mahalanobis_term1 - mahalanobis_term2
(C) @ W.T @ inv(D)
# where :math:`C` is the capacitance matrix.
Wt_Dinv = (
self._unbroadcasted_cov_factor.mT
/ self._unbroadcasted_cov_diag.unsqueeze(-2)
)
A = torch.linalg.solve_triangular(self._capacitance_tril, Wt_Dinv, upper=False)
precision_matrix = (
torch.diag_embed(self._unbroadcasted_cov_diag.reciprocal()) - A.mT @ A
N/A
requests-oauthlib
2.0.0
(C) Copyright ..." is shown in the HTML footer. Default is True.
Copyright (c) 2014 Kenneth Reitz.
Permission to use, copy, modify, and/or distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
# html_use_opensearch = ''
SciPy
1.15.3
(c) 1995 Ernst Stadlober, Institut fuer Statistitk, TU Graz
*****************************************************************************/
(c) 2000 W. Hoermann
*****************************************************************************/
(C) 2003, C. Bond. All rights reserved.
/* */
/* See http:// www.crbond.com/ */
(c) 2007 W. Hoermann
*****************************************************************************/
(C) ACM, 2011.
(C) Copyright Anton Bikineev 2014
(C) Copyright Antony Polukhin 2022.
(C) Copyright Bruno Lalande 2008.
(C) Copyright Bruno Lalande 2008.
(C) Copyright Christopher Kormanyos 1999 - 2021.
(C) Copyright Daryle Walker 2001-2002.
(C) Copyright Daryle Walker 2001, 2006.
(C) Copyright Eric Ford
(C) Copyright Eric Ford 2001
(C) Copyright Evan Miller 2020.
(C) Copyright Hubert Holin 2001.
(C) Copyright Hubert Holin 2001.
(C) Copyright Hubert Holin 2003.
(C) Copyright Hubert Holin 2003-2005.");
(C) Copyright Hubert Holin and Daryle Walker 2001-2002. Distributed under the Boost
(C) Copyright James Folberth 2022.
(C) Copyright Jeremy Murphy 2015.
(C) Copyright Jeremy William Murphy 2015.
(C) Copyright Jeremy William Murphy 2016.
(C) Copyright Johan Rade 2006.
(C) Copyright John Maddock 2005.
(C) Copyright John Maddock 2005-2006.
(C) Copyright John Maddock 2005-2006.
(C) Copyright John Maddock 2005-2021.
(C) Copyright John Maddock 2006.
(C) Copyright John Maddock 2006.
(C) Copyright John Maddock 2006, 2015
(C) Copyright John Maddock 2006-7.
(C) Copyright John Maddock 2006-7.
(C) Copyright John Maddock 2006-8.
(C) Copyright John Maddock 2007.
(C) Copyright John Maddock 2007.
(C) Copyright John Maddock 2008.
(C) Copyright John Maddock 2008.
(C) Copyright John Maddock 2008 - 2022.
(C) Copyright John Maddock 2009.
(C) Copyright John Maddock 2010.
(C) Copyright John Maddock 2010.
(C) Copyright John Maddock 2013.
(C) Copyright John Maddock 2014.
(C) Copyright John Maddock 2014.
(C) Copyright John Maddock 2015.
(C) Copyright John Maddock 2015.
(C) Copyright John Maddock 2017.
(C) Copyright John Maddock 2018.
(C) Copyright John Maddock 2018.
(C) Copyright John Maddock 2020.
(C) Copyright John Maddock 2021.
(C) Copyright John Maddock 2021.
(C) Copyright John Maddock 2022.
(C) Copyright John Maddock 2023.
(C) Copyright John Maddock 2024.
(C) Copyright John Maddock, 2024
(C) Copyright Matt Borland 2020.
(C) Copyright Matt Borland 2020
(C) Copyright Matt Borland 2021.
(C) Copyright Matt Borland 2021.
(C) Copyright Matt Borland 2021 - 2022.
(C) Copyright Matt Borland 2022.
(C) Copyright Matt Borland 2022.
(C) Copyright Matt Borland 2022
(C) Copyright Matt Borland 2023.
(C) Copyright Matt Borland 2023.
(C) Copyright Matt Borland 2024
(C) Copyright Matt Borland 2024.
(C) Copyright Matt Borland and Nick Thompson 2022.
(C) Copyright Nick Thompson 2017.
(C) Copyright Nick Thompson 2018.
(C) Copyright Nick Thompson 2018
(C) Copyright Nick Thompson, 2018
(C) Copyright Nick Thompson 2019.
(C) Copyright Nick Thompson 2019.
(C) Copyright Nick Thompson, 2019
(C) Copyright Nick Thompson 2020.
(C) Copyright Nick Thompson 2021.
(C) Copyright Nick Thompson 2023.
(C) Copyright Nick Thompson and Matt Borland 2020.
(C) Copyright Nick Thompson, John Maddock 2023.
(C) Copyright Paul A. Bristow 2006.
(C) Copyright Paul A. Bristow 2011
(C) Copyright Paul A. Bristow 2011 (added tests for changesign)
(C) Copyright Victor Ananyev 2021.
Copyright 1984, 1987, 1988, 1992, 2000 by Stephen L. Moshier
*/
Copyright 1984, 1987, 1988, 1992 by Stephen L. Moshier
Copyright 1984, 1987, 1988, 2000 by Stephen L. Moshier
Copyright 1984, 1987, 1988 by Stephen L. Moshier
Copyright 1984, 1987, 1988 by Stephen L. Moshier
Direct inquiries to 30 Frost Street, Cambridge, MA 02140
*/
Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
Copyright 1984, 1987, 1989, 1992, 2000 by Stephen L. Moshier
*/
Copyright 1984, 1987, 1989, 1992 by Stephen L. Moshier
Copyright 1984, 1987, 1989, 1995 by Stephen L. Moshier
*/
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
Copyright 1984, 1987, 1989, 2000 by Stephen L. Moshier
*/
Copyright 1984, 1987, 1989 by Stephen L. Moshier
Copyright 1984, 1987, 1992, 2000 by Stephen L. Moshier
Copyright 1984, 1987, 1993 by Stephen L. Moshier
Copyright 1984, 1987, 1995 by Stephen L. Moshier
Copyright 1984, 1987, 2000 by Stephen L. Moshier
Copyright 1984, 1987 by Stephen L. Moshier
Copyright 1984, 1991 by Stephen L. Moshier
Copyright 1984 - 1994 by Stephen L. Moshier
* *
* Alternatively, we also can use the functions from the Rmath library *
* from the R project for statistical computing, http://www.R-project.org/ *
Copyright 1984, 1995, 2000 by Stephen L. Moshier
Copyright 1984, 1995, 2000 by Stephen L. Moshier
*/
Copyright 1984, 1995 by Stephen L. Moshier
Copyright 1984, 1996 by Stephen L. Moshier
Copyright 1985, 1987, 1989 by Stephen L. Moshier
Copyright 1985, 1987, 2000 by Stephen L. Moshier
Copyright 1985, 1987, 2000 by Stephen L. Moshier
*/
Copyright 1985, 1987 by Stephen L. Moshier
Copyright 1985 by Stephen L. Moshier
Copyright 1987-, A. Volgenant/Amsterdam School of Economics,
Copyright 1991: Dieter Kraft, FHM
Copyright 1997-2008 by Agner Fog.
Copyright 1999 Travis Oliphant
Copyright 2000 by Alan Genz.
Copyright 2002-2008 by Agner Fog.
Copyright 2002-2014 by Agner Fog.
Copyright 2002-2016 The SciPy Developers
Copyright 2002 Gary Strangman. All rights reserved
Copyright 2002 H Lohninger, TU Wein
Copyright 2002 H Lohninger, TU Wein
Copyright 2002 Pearu Peterson all rights reserved
Copyright 2004-2005 by Enthought, Inc.
Copyright 2004-2005 by Enthought, Inc.
Copyright 2004-2008 by Agner Fog.
Copyright 2004-2013 by Agner Fog.
Copyright 2005 Travis Oliphant
Copyright 2006 - 2010 John Maddock and Paul A. Bristow.
Copyright 2006 Johan Rade
Copyright 2006 John Maddock
Copyright 2008 Gautam Sewani
Copyright 2008 Gautam Sewani
Copyright 2008 John Maddock
Copyright 2008 John Maddock
Copyright 2010 Paul A. Bristow
Copyright 2011, 2012 Paul A. Bristow
Copyright 2011 John Maddock
Copyright 2011 John Maddock.
Copyright 2011 Paul A. Bristow
Copyright 2011 Paul A. Bristow
Copyright 2011 Paul A. Bristow To incorporate into Boost.Math
Copyright 2012 John Maddock.
Copyright 2012 John Maddock and Paul A. Bristow.
Copyright 2012 K R Walker
Copyright 2012 Paul A. Bristow with new tests.
Copyright 2013 Andrea Gavana
Author: <andrea.gavana@gmail.com>
Modifications 2014 Andrew Nelson
<andyfaff@gmail.com>
Copyright 2013 Christopher Kormanyos
Copyright 2013 John Maddock
Copyright 2013 Niall Douglas additions for colors and alignment.
Copyright 2013 Nikhar Agrawal
Copyright 2013 Paul A. Bristow
Copyright 2013 Paul A. Bristow additions for more colors and alignments.
Copyright 2013 Paul Bristow
Copyright 2014 Anton Bikineev
Copyright 2014 Christopher Kormanyos
Copyright 2014, Eric W. Moore
Copyright 2014 John Maddock
Copyright 2014 John Maddock. Distributed under the Boost
Copyright 2014 Marco Guazzone (marco.guazzone@gmail.com).
Copyright 2014 Marco Guazzone (marco.guazzone@gmail.com)
Copyright 2014 Paul Bristow
Copyright 2015 John Maddock and Paul A. Bristow.
Copyright 2015 John Maddock.""\n"
Copyright 2015 Ontario Institute for Cancer Research
Copyright 2015 Paul A. Bristow.""\n"
Copyright 2016-2021 Matthew Brett, Isuru Fernando, Matti Picus
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# Redistributions of source code must retain the above copyright notice, this
# list of conditions and the following disclaimer.
# Redistributions in binary form must reproduce the above copyright notice, this
# list of conditions and the following disclaimer in the documentation and/or
# other materials provided with the distribution.
Copyright 2017 John Maddock
Copyright 2017 John Maddock. Distributed under the Boost
Copyright 2017 Two Blue Cubes Ltd. All rights reserved.
Copyright 2018 John Maddock
Copyright 2018 Nico Weber
Copyright 2018 Peter Dimov
Copyright 2018 Ulf Adams
Copyright 2019 John Maddock
Copyright 2019 Paul A. Bristow additions for more control of serif-italic font etc.
Copyright 2020, Madhur Chauhan
Copyright 2020 Matt Borland
Copyright 2021 Paul A. Bristow
Copyright 2021 The fast_float authors
Copyright (2022) National Technology
Copyright (2022) National Technology
// Solutions of Sandia, LLC (NTESS).
Copyright 2024 Christopher Kormanyos
copyright = '2024, Consortium for Python Data API Standards
author = 'Consortium for Python Data API Standards'
import array_api_compat
release = array_api_compat.__version__
Copyright 2024 Matt Borland
Copyright Anne M. Archibald 2008
Copyright A N Other, 2019.\n\n"
};
Copyright A N Other, 2019.
// Table of 32 values with 50 decimal digits precision,
// generated by program fft_sines_table.cpp.
Copyright attribute, return its value
Copyright attributes on this assembly
object[] attributes = Assembly.GetExecutingAssembly().GetCustomAttributes(typeof(AssemblyCopyrightAttribute), false);
Copyright attributes, return an empty string
if (attributes.Length == 0)
return "";
Copyright Benjamin Sobotta 2012
Copyright Benjamin Sobotta 2012.
Copyright Benjamin Sobotta 2012.
Copyright Benjamin Sobotta 2012
copy right boundary of domain
iv_new->ip = iv->x;
iv_new->fip = iv->fx;
/* make shure that we will never use this interval for sampling. */
iv->next->Asqueeze = iv->next->Ahat = iv->next->Ahatr = 0.;
iv->Acum = UNUR_INFINITY;
iv->next-> sq = 0.;
/* we even have to to some additional work */
}
else
/* nothing to do any more */
break;
copyright by Renee Touzin)
under the BSD licence. The following files have been removed from the original library:
Copyright (c) 1992-2013 The University of Tennessee and The University
of Tennessee Research Foundation. All rights
reserved.
Copyright (c) 1993-2019
C.B. Barber
Arlington, MA
Copyright (c) 1993-2019
C.B. Barber
Arlington, MA
Copyright (c) 1993-2019 C.B. Barber.
$Id: //main/2019/qhull/src/libqhull_r/merge_r.c#12 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
*/
Copyright (c) 1993-2019 C.B. Barber.
$Id: //main/2019/qhull/src/libqhull_r/merge_r.h#1 $$Change: 2661 $
$DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/geom2_r.c#15 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
frequently used code goes into geom_r.c
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/geom_r.c#4 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
infrequent code goes into geom2_r.c
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/geom_r.h#1 $$Change: 2661 $
$DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/global_r.c#12 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/io_r.c#7 $$Change: 2683 $
$DateTime: 2019/06/14 16:05:16 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/io_r.h#2 $$Change: 2671 $
$DateTime: 2019/06/06 11:24:01 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/libqhull_r.c#16 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/libqhull_r.h#13 $$Change: 2714 $
$DateTime: 2019/06/28 16:16:13 $$Author: bbarber $
includes function prototypes for libqhull_r.c, geom_r.c, global_r.c, io_r.c, user_r.c
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/mem_r.c#6 $$Change: 2711 $
$DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/mem_r.h#5 $$Change: 2698 $
$DateTime: 2019/06/24 14:52:34 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/poly2_r.c#18 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/poly_r.c#7 $$Change: 2705 $
$DateTime: 2019/06/26 16:34:45 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/poly_r.h#3 $$Change: 2701 $
$DateTime: 2019/06/25 15:24:47 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/qhull_ra.h#1 $$Change: 2661 $
$DateTime: 2019/05/24 20:09:58 $$Author: bbarber $
Notes: grep for ((" and (" to catch fprintf("lkasdjf");
full parens around (x?y:z)
use '#include "libqhull_r/qhull_ra.h"' to avoid name clashes
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/qset_r.c#7 $$Change: 2711 $
$DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/qset_r.h#3 $$Change: 2700 $
$DateTime: 2019/06/25 05:52:18 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/random_r.h#2 $$Change: 2666 $
$DateTime: 2019/05/30 10:11:25 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/stat_r.c#7 $$Change: 2712 $
$DateTime: 2019/06/28 12:57:00 $$Author: bbarber $
*/
Copyright (c) 1993-2019 The Geometry Center.
$Id: //main/2019/qhull/src/libqhull_r/stat_r.h#3 $$Change: 2711 $
$DateTime: 2019/06/27 22:34:56 $$Author: bbarber $
recompile qhull if you change this file
Copyright (c) 1994 by Xerox Corporation. All rights reserved.
*
* THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
* EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
Copyright (C) 1996, 1997, 1998, 1999, 2000 Gerard Jungman, Brian Gough
* *
* adapted by Wolfgang Hoermann and Josef Leydold *
* Department of Statistics and Mathematics, WU Wien, Austria *
Copyright (c) 1996-2008 Rice University.
Copyright (c) 1996-2008 Rice University.
Developed by D.C. Sorensen, R.B. Lehoucq, C. Yang, and K. Maschhoff.
All rights reserved.
Arpack has been renamed to arpack-ng.
Copyright (c) 1996-2008 Rice University.
Developed by D.C. Sorensen, R.B. Lehoucq, C. Yang, and K. Maschhoff.
All rights reserved.
Arpack has been renamed to arpack-ng.
Copyright (c) 1998-2000 Theodore C. Belding
/* University of Michigan Center for the Study of Complex Systems */
/* Ted.Belding@umich.edu) */
/*----------------------------------------------------------------------*/
Copyright (c) 1998-2007, Timothy A. Davis, All Rights Reserved.
Copyright (c) 1998-2007, Timothy A. Davis, All Rights Reserved.
THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
EXPRESSED OR IMPLIED. ANY USE IS AT YOUR OWN RISK.
Copyright (c) 1999, 2000, 2001 North Carolina State University
Copyright (c) 2000-2006, 2010 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2000-2006 Wolfgang Hoermann and Josef Leydold
* Dept. for Statistics, University of Economics, Vienna, Austria *
* *
Copyright (c) 2000-2010 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2000-2013 The University of California Berkeley. All
rights reserved.
Copyright (c) 2000-2022 Wolfgang Hoermann and Josef Leydold
Copyright (c) 2001-2002 Enthought, Inc. 2003-2024, SciPy Developers.
All rights reserved.
Copyright (c) 2001-2002 Enthought, Inc. 2003-2024, SciPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2001, 2002 Enthought, Inc.
#
# All rights reserved.
Copyright (c) 2001, 2002 Enthought, Inc.
#
# All rights reserved.
Copyright (c) 2001-2011 - Scilab Enterprises
Updated by Allan Cornet, Sylvestre Ledru.
Copyright (c) 2001-2011 - Scilab Enterprises
Updated by Allan Cornet, Sylvestre Ledru.
Copyright (c) 2002-2005, Jean-Sebastien Roy (js@jeannot.org)
Copyright (c) 2002-2005, Jean-Sebastien Roy (js@jeannot.org)
Copyright (C) 2002-2017 Free Software Foundation, Inc.
Copyright (c) 2002 Travis Oliphant all rights reserved
Copyright (C) 2003-2005 Peter J. Verveer
Copyright (C) 2003-2005 Peter J. Verveer
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* 3. The name of the author may not be used to endorse or promote
Copyright (C) 2003-2005 Peter J. Verveer
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following
# disclaimer in the documentation and/or other materials provided
# with the distribution.
#
# 3. The name of the author may not be used to endorse or promote
Copyright (C) 2003-2005 Peter J. Verveer
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
3. The name of the author may not be used to endorse or promote
Copyright (C) 2003-2005 Peter J. Verveer
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
#
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
#
# 2. Redistributions in binary form must reproduce the above
# copyright notice, this list of conditions and the following
# disclaimer in the documentation and/or other materials provided
# with the distribution.
#
# 3. The name of the author may not be used to endorse or promote
Copyright (C) 2003, 2007-14 Massachusetts Institute of Technology
For the prev_good_size search:
Copyright (C) 2003, 2007-14 Matteo Frigo
Copyright (c) 2003-2009, The Regents of the University of California,
Copyright (c) 2003-2009, The Regents of the University of California,
through Lawrence Berkeley National Laboratory (subject to receipt of
any required approvals from U.S. Dept. of Energy) All rights reserved.
Copyright (c) 2003, The Regents of the University of California, through
Lawrence Berkeley National Laboratory (subject to receipt of any required
approvals from U.S. Dept. of Energy)
All rights reserved.
Copyright (c) 2004-2005, Jean-Sebastien Roy (js@jeannot.org)
Copyright (c) 2004 David M. Cooke <cookedm@physics.mcmaster.ca>
Copyright (c) 2004 Joel de Guzman http://spirit.sourceforge.net/
Copyright (c) 2004 Joel de Guzman
http://spirit.sourceforge.net/
Copyright (c) 2005-2015, Michele Simionato
Copyright (c) 2005-2022, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2005-2022, NumPy Developers.
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of the NumPy Developers nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2005, Rasmus Munk Larsen, Stanford University
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of Stanford University nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2006-2007, Robert Hetland <hetland@tamu.edu>
Copyright (c) 2006-2007, Robert Hetland <hetland@tamu.edu>
Copyright (c) 2006-2008 Johan Rade
Copyright (c) 2006-2013 The University of Colorado Denver. All rights
reserved.
Copyright (c) 2006-7 John Maddock
Copyright (c) 2006 Johan Rade
Copyright (c) 2006 Johan Rade
Copyright (c) 2006 Johan Rade
Copyright (c) 2006 John Maddock
Copyright (c) 2006 John Maddock
Copyright (c) 2006, Systems Optimization Laboratory
All rights reserved.
Copyright (c) 2006, The Regents of the University of
California, through Lawrence Berkeley National Laboratory (subject to
receipt of any required approvals from the U.S. Dept. of Energy). All
rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
(1) Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
(2) Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
(3) Neither the name of the University of California, Lawrence Berkeley
National Laboratory, U.S. Dept. of Energy nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2006 Xiaogang Zhang
Copyright (c) 2006 Xiaogang Zhang, 2015 John Maddock
Copyright (c) 2006 Xiaogang Zhang, 2015 John Maddock.
Copyright (c) 2007, 2008, Damian Eads
Copyright (c) 2007, 2008, Damian Eads. All rights reserved.
* Adapted for incorporation into Scipy, April 9, 2008.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* - Neither the name of the author nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
Copyright (c) 2007, 2013 John Maddock
Copyright (c) 2007 Cybozu Labs, Inc.
Copyright (c) 2007, Damian Eads. All rights reserved.
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (c) 2007 John Maddock
Copyright (c) 2007 John Maddock
Copyright (c) 2007, John Travers <jtravs@gmail.com>
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of Robert Hetland nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2007, John Travers <jtravs@gmail.com>
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
copyright notice, this list of conditions and the following
disclaimer in the documentation and/or other materials provided
with the distribution.
* Neither the name of Robert Hetland nor the names of any
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
Copyright (c) 2007 - S
Copyright (c) 2007 - S
Copyright (C) 2008, 2009, 2010, 2012 Paul A. Bristow, John Maddock
Copyright (c) 2008-2010 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (C) 2008 Damian Eads
Copyright (c) 2008 Ian Bicking and Contributors
Copyright (c) 2008 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2009-2010 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2009-2011 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2009-2012 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2009-2017 The MathJax Consortium
Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
Copyright (c) 2009 John Maddock
Copyright (c) 2009, Motorola, Inc
Copyright (c) 2009, Motorola, Inc
#
# All Rights Reserved.
Copyright (c) 2009, Motorola, Inc
#
# All Rights Reserved.
Copyright (C) 2009 Pauli Virtanen
Copyright (C) 2009, Pauli Virtanen <pav@iki.fi>
Copyright (c) 2009 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2010-2017 The MathJax Consortium
Copyright (c) 2010-2017 The MathJax Consortium
*
* Part of the MathJax library.
* See http://www.mathjax.org for details.
Copyright (C) 2010-2018 Max-Planck-Society
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2010-2019 Free Software Foundation, Inc.
Copyright (C) 2010-2019 Max-Planck-Society
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2010-2019 Max-Planck-Society
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its contributors may
be used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (C) 2010-2022 Max-Planck-Society
Copyright (C) 2010 David Fong and Michael Saunders
Copyright (c) 2010 - Jordi Guti
Copyright (c) 2010 - Jordi Guti
Copyright (c) 2010, Robert Parrish
Copyright (c) 2010 Thomas P. Robitaille
Copyright (c) 2010 Wolfgang Hoermann and Josef Leydold
* Department of Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2011-2012 Wolfgang Hoermann and Josef Leydold
* Institute for Statistics and Mathematics, WU Wien, Austria *
* *
Copyright (c) 2011-2014, The OpenBLAS Project
Copyright (c) 2011-2015 The MathJax Consortium
Copyright (c) 2011-2017 The MathJax Consortium
Copyright (c) 2011 ashelly.myopenid.com
Copyright (c) 2011 Francois Mauger
Copyright (c) 2011 John Maddock
Copyright (c) 2011 John Maddock
Copyright (c) 2011 John Maddock
/*!
\file
\brief Basic tests of the nonfinite num facets.
Copyright (c) 2011 Paul A. Bristow
Copyright (c) 2011 Paul A. Bristow
Copyright (c) 2011 Paul A. Bristow comments
Copyright (c) 2011 Paul A. Bristow - filename changes for boost-trunk.
Copyright (c) 2011 Paul A. Bristow incorporated Boost.Math
Copyright (c) 2011 Paul A. Bristow To incorporate into Boost.Math
Copyright (c) 2012 Google Inc.
Copyright (c) 2012 Massachusetts Institute of Technology
Copyright (c) 2012 Massachusetts Institute of Technology
Copyright (c) 2012 Paul A. Bristow
Copyright (c) 2013-2017 The MathJax Consortium
Copyright (C) 2013, Alan Genz, All rights reserved.
Copyright (C) 2013, Alan Genz, All rights reserved.
Copyright (C) 2013, Alan Genz, All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided the following conditions are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
# 3. The contributor name(s) may not be used to endorse or promote
Copyright (C) 2013, Alan Genz, All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided the following conditions are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
# 3. The contributor name(s) may not be used to endorse or promote
Copyright (c) 2013 Anton Bikineev
Copyright (c) 2013 Christopher Kormanyos
Copyright (C) 2013 Kenneth L. Ho
Copyright (C) 2013 Pauli Virtanen
Copyright (c) 2014-2017 The MathJax Consortium
Copyright (c) 2014-2022 Jarryd Beck
Copyright (c) 2014 Anton Bikineev
Copyright (c) 2014 John Maddock
Copyright (c) 2014 Mathjax Consortium
Copyright (c) 2015-2017 Martin Hensel
Copyright (c) 2015-2017 The MathJax Consortium
Copyright (c) 2015 John Maddock
Copyright (c) 2015 John Maddock
Copyright (C) 2015, Pauli Virtanen <pav@iki.fi>
Copyright (c) 2016--2017 Felix Lenders
Copyright (c) 2016-2017 The MathJax Consortium
Copyright (C) 2016-2018 ERGO-Code
Copyright (C) 2016-2018 ERGO-Code
Copyright (C) 2016-2018 ERGO-Code
*
* Implementation of doubly linked lists (see [1] section 5.5)
Copyright (C) 2016-2019 ERGO-Code
Copyright (C) 2016-2019 ERGO-Code
Copyright (c) 2016 Wenzel Jakob <wenzel.jakob@epfl.ch>, All rights reserved.
Copyright (c) 2017 John Maddock
Copyright (c) 2017 John Maddock
Copyright (c) 2017, The Chancellor, Masters and Scholars of the University
# of Oxford, and the Chebfun Developers. All rights reserved.
Copyright (c) 2017, The Chancellor, Masters and Scholars of the University
of Oxford, and the Chebfun Developers. All rights reserved.
Copyright (c) 2018-2019 ERGO-Code.
Copyright (c) 2018, Quansight-Labs
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2018, Quansight-Labs
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2018 Sylvain Gubian <sylvain.gubian@pmi.com>,
Copyright (C) 2019-2020 Peter Bell
For the odd-sized DCT-IV transforms:
Copyright (C) 2019 Max-Planck-Society
Copyright (C) 2019 Peter Bell
Copyright (C) 2020-2023 Adam Lugowski
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
Copyright (c) 2020 John Maddock
Copyright (c) 2020 Marco Gorelli
Copyright (c) 2020 Michael Feldmeier
Copyright (c) 2021-04-21 St
Copyright (c) 2021-2024, Tom M. Ragonneau and Zaikun Zhang
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
Copyright (c) 2021 Matt Borland
Copyright (c) 2021 Orson Peters <orsonpeters@gmail.com>
This software is provided 'as-is', without any express or implied warranty. In no event will the
authors be held liable for any damages arising from the use of this software.
Copyright (c) 2021 Orson Peters
This software is provided 'as-is', without any express or implied warranty. In no event will the
authors be held liable for any damages arising from the use of this software.
Copyright (c) 2021 The fast_float authors
Copyright (C) 2022-2023 Adam Lugowski. All rights reserved.
Copyright (C) 2022-2023 Adam Lugowski. All rights reserved.
Copyright (C) 2022 Adam Lugowski. All rights reserved.
Copyright (c) 2022 Consortium for Python Data API Standards
copyright (C) 2022, Robert Kern, All rights reserved.
Copyright (c) 2022 Two Blue Cubes Ltd. All rights reserved.
Copyright (c) 2023 Adam Lugowski
Copyright (C) 2023 Adam Lugowski. All rights reserved.
Copyright (C) 2023 Adam Lugowski
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
Copyright (c) 2024 Consortium for Python Data API Standards
Copyright (c) 2024 HiGHS
Copyright (c) 2024 HiGHS under MIT licence terms
Copyright (c) 2024 Matt Borland
Copyright (C) 2024 SciPy developers
Copyright (C) 2024 SciPy developers
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* a. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* b. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* c. Names of the SciPy Developers may not be used to endorse or promote
Copyright (C) 2024 Tan Ping Liang, Peter Bell
Authors: Martin Reinecke, Peter Bell
Copyright Catch2 Authors
Copyright (C) Benjamin Sobotta 2012
Copyright (C) Damian Eads, 2007-2008.
Copyright (c) Donald Stufft and individual contributors.
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
Copyright (c) Donald Stufft and individual contributors.
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are met:
# 1. Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
copyright: Cephes Math Library Release 2.8: June, 2000
copyright:
*
* Cephes Math Library Release 2.8: June, 2000
Copyright: Christian Lorentzen
Copyright Christopher Kormanyos 2002 - 2011.
Copyright Christopher Kormanyos 2012.
Copyright Christopher Kormanyos 2012, 2013.
Copyright Christopher Kormanyos 2013.
Copyright Christopher Kormanyos 2013.
Copyright Christopher Kormanyos 2013-14, 2020, 2024
Copyright Christopher Kormanyos 2014.
Copyright Christopher Kormanyos 2016.
Copyright Christopher Kormanyos 2020.
Copyright Christopher Kormanyos 2021.
Copyright Christopher Kormanyos 2024.
Copyright Christopher Kormanyos 2024.
Copyright Christopher Kormanyos 2024
Copyright (c) jmc 2007 - 2010")
[assembly:AssemblyTrademarkAttribute("")];
[assembly:AssemblyCultureAttribute("")];
copyright: Copyright 2015 Jon Lund Steffensen. Based on extlinks by
copyright Copyright (C) 2023 Adam Lugowski.
Copyright (C) Piers Lawrence.
Copyright (C) Tyler Reddy, Ross Hemsley, Edd Edmondson,
Copyright Daryle Walker, Hubert Holin, John Maddock 2006 - 2007
Copyright Datasim Education BV 2009-2010
copyright etc.
Copyright Evan Miller 2020.
Copyright Evan Miller 2020
Copyright Evan Miller, 2020
Copyright for the original TNBC Fortran routines:
TRUNCATED-NEWTON METHOD: SUBROUTINES
WRITTEN BY: STEPHEN G. NASH
SCHOOL OF INFORMATION TECHNOLOGY & ENGINEERING
GEORGE MASON UNIVERSITY
FAIRFAX, VA 22030
Copyright Gautam Sewani
Copyright Gautam Sewani 2008
Copyright Hubert Holin 2001.
copyright is acknowledged.
/* */
/* C Contact Information */
/* C Email: j-jin1@uiuc.edu */
/* C Phone: (217) 244-0756 */
/* C Fax: (217) 333-5962 */
/* C Professor Jianming Jin */
/* C Department of Electrical and Computer Engineering */
/* C University of Illinois at Urbana-Champaign */
/* C 461 William L Everitt Laboratory */
/* C 1406 West Green Street */
/* C Urbana, IL 61801-2991 */
Copyright Jeremy Murphy 2016.
Copyright Jeremy W. Murphy 2015.
// This file is written to be included from a Quickbook .qbk document.
// It can be compiled by the C++ compiler, and run. Any output can
// also be added here as comment or included or pasted in elsewhere.
// Caution: this file contains Quickbook markup as well as code
// and comments: don't change any of the special comment markups!
Copyright John Maddock 20
Copyright John Maddock 20010.
Copyright John Maddock 20021.
Copyright John Maddock 2005.
Copyright John Maddock 2005-2006.
Copyright John Maddock 2005-2006, 2011.
Copyright John Maddock 2005-2008.
Copyright John Maddock 2006.
Copyright John Maddock 2006.
Copyright John Maddock 2006
Copyright John Maddock 2006-15.
Copyright John Maddock 2006, 2007
Copyright John Maddock 2006, 2007.
Copyright John Maddock 2006, 2007.
Copyright John Maddock 2006, 2007
Copyright John Maddock 2006, 2007, 2012, 2014.
Copyright John Maddock 2006, 2010.
Copyright John Maddock 2006, 2011.
Copyright John Maddock 2006, 2012.
Copyright John Maddock 2006, 2012.
Copyright John Maddock 2006-7.
Copyright John Maddock 2006-7, 2013-20.
Copyright John Maddock 2007.
Copyright John Maddock 2007.
Copyright John Maddock 2007
Copyright John Maddock 2007, 2014.
Copyright John Maddock 2007-8.
Copyright John Maddock 2008
Copyright John Maddock 2008.
Copyright John Maddock 2008.
Copyright John Maddock 2008
Copyright John Maddock 2008, 2012.
Copyright John Maddock 2008, 2012.
Copyright John Maddock 2009.
Copyright John Maddock 2009
Copyright John Maddock 2010.
Copyright John Maddock 2010.
Copyright John Maddock 2010
Copyright John Maddock 2010, 2012.
Copyright John Maddock 2011.
Copyright John Maddock 2011-2021.
Copyright John Maddock 2012
Copyright John Maddock 2012.
Copyright John Maddock 2012.
Copyright John Maddock 2012
Copyright John Maddock 2012.
// This file is written to be included from a Quickbook .qbk document.
// It can be compiled by the C++ compiler, and run. Any output can
// also be added here as comment or included or pasted in elsewhere.
// Caution: this file contains Quickbook markup as well as code
// and comments: don't change any of the special comment markups!
Copyright John Maddock 2013.
Copyright John Maddock 2013
Copyright John Maddock 2013.
#ifdef _MSC_VER
# pragma warning (disable : 4512)
# pragma warning (disable : 4996)
#endif
Copyright John Maddock 2013.
// This file is written to be included from a Quickbook .qbk document.
// It can be compiled by the C++ compiler, and run. Any output can
// also be added here as comment or included or pasted in elsewhere.
// Caution: this file contains Quickbook markup as well as code
// and comments: don't change any of the special comment markups!
Copyright John Maddock 2014
Copyright John Maddock 2014.
Copyright John Maddock 2014.
Copyright John Maddock 2014
Copyright John Maddock 2015
Copyright John Maddock 2015.
Copyright John Maddock 2015.
Copyright John Maddock 2015
Copyright John Maddock 2016.
Copyright John Maddock 2016.
Copyright John Maddock 2016
Copyright John Maddock 2017.
Copyright John Maddock, 2017
Copyright John Maddock 2018.
Copyright John Maddock 2018.
Copyright John Maddock 2020.
Copyright John Maddock, 2020
Copyright John Maddock 2021.
Copyright John Maddock, 2021
Copyright John Maddock, 2022
Copyright John Maddock 2023.
Copyright John Maddock 2023.
Copyright John Maddock 2023
Copyright John Maddock, 2023
Copyright John Maddock 2024.
Copyright John Maddock 2024.
Copyright John Maddock and Paul A. Bristow 2007";
this.labelCopyright.TextAlign = System.Drawing.ContentAlignment.MiddleLeft;
//
// labelCompanyName
Copyright John Maddock and Paul A. Bristow 2010
Copyright © John Maddock
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]
// Setting ComVisible to false makes the types in this assembly not visible
// to COM components. If you need to access a type in this assembly from
// COM, set the ComVisible attribute to true on that type.
[assembly: ComVisible(false)]
Copyright John Maddock
MessageBox.Show("Statistical Distribution Explorer\n" + helpText);
Copyright John Z. Maddock 2016
Copyright John Z. Maddock 2017
Copyright J.S. Roy (js@jeannot.org), 2002-2005
Copyright Madhur Chauhan 2020.
Copyright Matt Borland 2021.
Copyright Matt Borland 2021.
Copyright Matt Borland 2021
Copyright Matt Borland, 2021
Copyright Matt Borland 2022.
Copyright Matt Borland 2022
Copyright Matt Borland, 2022
Copyright Matt Borland 2023.
Copyright Matt Borland 2023.
Copyright Matt Borland 2023
Copyright Matt Borland, 2023
Copyright Matt Borland 2024
Copyright Matt Borland 2024.
Copyright Matt Borland 2024.
Copyright Matt Borland, 2024
Copyright Matthew Pulver 2018 - 2019.
Copyright Matthew Pulver 2018 - 2019.
Copyright Nakhar Agrawal 2013.
Copyright Nicholas McKibben, 2022
Copyright Nicholas Thompson 2017.
Copyright Nicholas Thompson 2018
Copyright Nick Thompson 2017.
Copyright Nick Thompson, 2017
Copyright Nick Thompson, 2017
Copyright Nick Thompson 2018.
Copyright Nick Thompson, 2018
Copyright Nick Thompson 2019.
Copyright Nick Thompson, 2019
Copyright Nick Thompson, 2019\n"
Copyright Nick Thompson 2020.
Copyright Nick Thompson, 2020
Copyright Nick Thompson, 2021
Copyright Nick Thompson, 2023
Copyright Nick Thompson 2024.
Copyright Nick Thompson, 2024
Copyright Nick Thompson, John Maddock 2020
Copyright Nick Thompson, John Maddock 2020\n"
Copyright Nick Thompson, Matt Borland, 2023
Copyright Nikhar Agrawal 2013-14
Copyright ohn Maddock 2012
Copyright Paul A. 2007, 2010
Copyright Paul A. Bristow
Copyright Paul A. Bristow 2006.
Copyright Paul A. Bristow 2006.
Copyright Paul A. Bristow 2006, 2007.
Copyright Paul A. Bristow 2006, 2007.
Copyright Paul A. Bristow 2006, 2007, 2009, 2010.
Copyright Paul A. Bristow 2006, 2007, 2012.
Copyright Paul A. Bristow 2006, 2007, 2012
Copyright Paul A. Bristow 2006-2011.
Copyright Paul A. Bristow 2006, 2012, 2017.
Copyright Paul A. Bristow 2006, 2017.
Copyright Paul A. Bristow 2006-7.
Copyright Paul A. Bristow 2007.
Copyright Paul A. Bristow 2007
Copyright Paul A. Bristow 2007.
Copyright Paul A. Bristow 2007.
Copyright Paul A. Bristow 2007
Copyright Paul A. Bristow 2007, 2008, 2010
Copyright Paul A. Bristow 2007, 2009
Copyright Paul A. Bristow 2007, 2009.
Copyright Paul A. Bristow 2007, 2009.
Copyright Paul A. Bristow 2007, 2009
Copyright Paul A. Bristow 2007, 2009, 2010
Copyright Paul A. Bristow 2007, 2009, 2010, 2012.
Copyright Paul A. Bristow 2007, 2009, 2010, 2012.
Copyright Paul A. Bristow 2007, 2009, 2010, 2012
Copyright Paul A. Bristow 2007, 2009, 2012.
Copyright Paul A. Bristow 2007, 2010.
Copyright Paul A. Bristow 2007, 2010.
Copyright Paul A. Bristow 2007, 2010
Copyright Paul A. Bristow 2007, 2010, 2012.
Copyright Paul A. Bristow 2007, 2010, 2012, 2014.
Copyright Paul A. Bristow 2007, 2010, 2014, 2016.
Copyright Paul A. Bristow 2007, 2012.
Copyright Paul A. Bristow 2007, 2012.
Copyright Paul A. Bristow 2007, 2012.
Copyright Paul A. Bristow 2007, 2013-14.
Copyright Paul A. Bristow 2008, 2009.
Copyright Paul A. Bristow 2008, 2009, 2012, 2016
Copyright Paul A. Bristow 2008, 2009, 2014.
Copyright Paul A. Bristow 2008, 2010.
Copyright Paul A. Bristow 2008, 2010.
Copyright Paul A. Bristow 2008, 2014.
Copyright Paul A. Bristow 2009
Copyright Paul A. Bristow 2009, 2011
Copyright Paul a. Bristow 2010
Copyright Paul A> Bristow 2010
Copyright Paul A. Bristow 2010
Copyright Paul A. Bristow 2010.
Copyright Paul A. Bristow 2010.
Copyright Paul A. Bristow 2010
Copyright Paul A. Bristow 2010, 2013
Copyright Paul A. Bristow 2010, 2015
Copyright Paul A. Bristow 2011.
Copyright Paul A. Bristow 2011, 2012.
Copyright Paul A. Bristow 2012.
Copyright Paul A. Bristow 2012.
Copyright Paul A. Bristow 2013.
Copyright Paul A. Bristow 2013
Copyright Paul A. Bristow 2014.
Copyright Paul A. Bristow 2014.
Copyright Paul A. Bristow 2014.
Copyright Paul A. Bristow 2014, 2015.
Copyright Paul A. Bristow 2015.
Copyright Paul A. Bristow 2015
Copyright Paul A. Bristow 2015, 2018.
Copyright Paul A. Bristow 2016.
Copyright Paul A. Bristow 2016
Copyright Paul A. Bristow 2016, 2017.
Copyright Paul A. Bristow 2016, 2017, 2018.
Copyright Paul A. Bristow 2016, 2018.
Copyright Paul A. Bristow 2017.
Copyright Paul A. Bristow 2017
Copyright Paul A. Bristow 2017, 2018
Copyright Paul A. Bristow 2017." "\n"
Copyright Paul A. Bristow 2018
Copyright Paul A. Bristow 2019.
Copyright Paul A. Bristow, 2019
Copyright Paul A. Bristow 2021
Copyright Paul Bristow 2006, 2007.
Copyright Paul Bristow 2006, 2007.
Copyright Paul Bristow 2007.
Copyright Paul Bristow 2007.
Copyright Paul Bristow 2007, 2011.
Copyright Paul Bristow 2013.
Copyright Paul Bristow 2014.
Copyright Peter Dimov 2015-2021.
Copyright Rene Rivera 2020.
Copyright Ryan Elandt 2023.
Copyright Takuma Yoshimura 2024.
Copyright \textcopyright\/ Matthew Pulver 2018--2019.
Copyright Thijs van den Berg, 2008.
Copyright Thijs van den Berg, 2008.
Copyright Thomas Dybdahl Ahle, Nick Thompson, Matt Borland, John Maddock, 2023
Copyright Thomas Mang 2010.
Copyright Thomas Mang 2011.
Copyright Thomas Mang 2012.
copyright Xiaogang Zhang.
Copyright Xiaogang Zhang 2006
Copyright Xiaogang Zhang 2006
Copyright: Yosef Meller, 2009
(C) Rasmus Munk Larsen, Stanford, 1999, 2004
c
(C) Rasmus Munk Larsen, Stanford University, 1999, 2004
c
(C) Rasmus Munk Larsen, Stanford University, 2000,2004
c
(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
c
c
c****************************************************************************
c
C This version of MGS is faster on MIPS, UltraSPARC and Itanium.
c Probably because it exposes possibility of using fused multiply-add
c instructions in the inner loop(?).
subroutine cmgs(n,k,V,ldv,vnew,index)
c
c Modified Gram-Schmidt orthogonalization:
(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
c
c
c****************************************************************************
c
C This version of MGS is faster on MIPS, UltraSPARC and Itanium.
c Probably because it exposes possibility of using fused multiply-add
c instructions in the inner loop(?).
subroutine dmgs(n,k,V,ldv,vnew,index)
c
c Modified Gram-Schmidt orthogonalization:
(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
c
c
c****************************************************************************
c
C This version of MGS is faster on MIPS, UltraSPARC and Itanium.
c Probably because it exposes possibility of using fused multiply-add
c instructions in the inner loop(?).
subroutine smgs(n,k,V,ldv,vnew,index)
c
c Modified Gram-Schmidt orthogonalization:
(C) Rasmus Munk Larsen, Stanford University, 2000, 2004
c
c
c****************************************************************************
c
C This version of MGS is faster on MIPS, UltraSPARC and Itanium.
c Probably because it exposes possibility of using fused multiply-add
c instructions in the inner loop(?).
subroutine zmgs(n,k,V,ldv,vnew,index)
c
c Modified Gram-Schmidt orthogonalization:
(C) Rasmus Munk Larsen, Stanford University, 2000,2004
c
subroutine csafescal(n,alpha,x)
c
c Scale the vector x by 1/alpha avoiding unnecessary under- and overflow.
c
c %-----------%
c | Arguments |
c %-----------%
implicit none
integer n
real alpha
complex x(*)
(C) Rasmus Munk Larsen, Stanford University, 2000,2004
c
subroutine dsafescal(n,alpha,x)
c
c Scale the vector x by 1/alpha avoiding unnecessary under- and overflow.
c
c %-----------%
c | Arguments |
c %-----------%
implicit none
integer n
double precision alpha, x(*)
(C) Rasmus Munk Larsen, Stanford University, 2000,2004
c
subroutine ssafescal(n,alpha,x)
c
c Scale the vector x by 1/alpha avoiding unnecessary under- and overflow.
c
c %-----------%
c | Arguments |
c %-----------%
implicit none
integer n
real alpha, x(*)
(C) Rasmus Munk Larsen, Stanford University, 2000,2004
c
subroutine zsafescal(n,alpha,x)
c
c Scale the vector x by 1/alpha avoiding unnecessary under- and overflow.
c
c %-----------%
c | Arguments |
c %-----------%
implicit none
integer n
double precision alpha
complex*16 x(*)
(C) Rasmus Munk Larsen, Stanford University, 2000
c
integer nopx, nreorth, nreorthu, nreorthv, ndot, nitref,
c nrestart, nbsvd, nlandim, nsing
real tmvopx, tgetu0, tupdmu, tupdnu, tintv, tlanbpro,
c treorthu, treorthv, telru, telrv, tbsvd, tnorm2,
c tlansvd, tritzvec, trestart, treorth, tdot
(C) Rasmus Munk Larsen, Stanford University, 2000
c
subroutine clearstat
implicit none
include 'stat.h'
nopx = 0
nreorth = 0
ndot = 0
nitref = 0
nbsvd = 0
nrestart = 0
tmvopx = 0
tgetu0 = 0
tupdmu = 0
tupdnu = 0
tintv = 0
tlanbpro = 0
treorth = 0
treorthu = 0
treorthv = 0
telru = 0
telrv = 0
tbsvd = 0
tnorm2 = 0
tdot = 0
tlansvd = 0
nlandim = 0
nsing = 0
tritzvec = 0
trestart = 0
end
(C) Rasmus Munk Larsen, Stanford University, 2004
(C) Rasmus Munk Larsen, Stanford University, 2004
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
c
c****************************************************************************
C This simple version of MGS is faster on Pentium machines.
(C) Rasmus Munk Larsen, Stanford University, 2004
c
c
c DGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
c orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
c Op(A) = A^H if transa='c'.
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
c
c DGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
c orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
c Op(A) = A^T if transa='t'.
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
c
c SGETU0: Attempt to generate a pseudo-random vector in SPAN(Op(A))
c orthogonal to span(U(:,1:j)), where Op(A) = A if transa='n' and
c Op(A) = A^T if transa='t'.
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
#ifdef _OPENMP
double precision function pdnrm2(n, x, incx)
implicit none
integer n, incx
double precision x(*)
(C) Rasmus Munk Larsen, Stanford University, 2004
c
#ifdef _OPENMP
real function psnrm2(n, x, incx)
implicit none
integer n, incx
real x(*)
(C) Rasmus Munk Larsen, Stanford University, 2004
c
subroutine dbsvdstep(jobu,jobv,m,n,k,sigma,D,E,U,ldu,V,ldv)
c
c Perform one implicit LQ SVD sweep with shift SIGMA.
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
subroutine dgemm_ovwr(transa,m,n,k,alpha,A,lda,beta,B,ldb,
c dwork,ldwork)
c
c compute B <- alpha*op(A)*B + beta*B
c
implicit none
character*1 transa
integer m,n,k,lda,ldb,ldwork
double precision alpha,beta,A(lda,*),B(ldb,*),dwork(ldwork)
integer i,j,l,blocksize
(C) Rasmus Munk Larsen, Stanford University, 2004
c
subroutine sbsvdstep(jobu,jobv,m,n,k,sigma,D,E,U,ldu,V,ldv)
c
c Perform one implicit LQ SVD sweep with shift SIGMA.
c
(C) Rasmus Munk Larsen, Stanford University, 2004
c
subroutine sgemm_ovwr(transa,m,n,k,alpha,A,lda,beta,B,ldb,
c work,lwork)
c
c compute B <- alpha*op(A)*B + beta*B
c
implicit none
character*1 transa
integer m,n,k,lda,ldb,lwork
real alpha,beta,A(lda,*),B(ldb,*),work(lwork)
integer i,j,l,blocksize
(C) Rasmus Munk Larsen, Stanford University, March 2004.
soundfile
0.12.1
(C) Copyright ..." is shown in the HTML footer. Default is True.
copyright': 0x02,
copyright = '2015, Bastian Bechtold, Matthias Geier
# The version info for the project you're documenting, acts as replacement for
# |version| and |release|, also used in various other places throughout the
# built documents.
Copyright (c) 2013, Bastian Bechtold
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of python-soundfile nor the names
of its contributors may be used to endorse or promote products
copyright = True
# If true, an OpenSearch description file will be output, and all pages will
# contain a <link> tag referring to it. The value of this option must be the
# base URL from which the finished HTML is served.
#html_use_opensearch = ''
soxr
0.5.0.post1
(c) 2021 Myungchul Keum
(c) 2024 Myungchul Keum
copyright = '2021-24 Myungchul Keum'
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
Copyright(C) 1996 Takuya OOURA
You may use, copy, modify this code for any purpose and
without fee.
Copyright (C) 2001-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (C) 2002-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (C) 2002-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (C) 2003-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (C) 2004-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (c) 2004 the University Corporation for Atmospheric Research ("UCAR"). All rights reserved.
Copyright (c) 2004 the University Corporation for Atmospheric
Research ("UCAR"). All rights reserved.
Copyright (c) 2004 the University Corporation for Atmospheric
Research ("UCAR"). All rights reserved. Developed by NCAR's
Computational and Information Systems Laboratory, UCAR,
www.cisl.ucar.edu.
Redistribution and use of the Software in source and binary forms,
with or without modification, is permitted provided that the
following conditions are met:
- Neither the names of NCAR's Computational and Information Systems
Copyright (C) 2006-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (c) 2007-13 robs@users.sourceforge.net
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Concurrent Control with "Readers" and "Writers", P.J. Courtois et al, 1971 */
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define PFFFT_DOUBLE 0
#include "pffft-wrap.c"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define SIMD_ALIGNED_FREE free
#define SIMD_ALIGNED_MALLOC malloc
#define PFFFT_SIMD_DISABLE
#define PFFFT_DOUBLE 0
#include "pffft-wrap.c"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 1a: Variant of example 1 using libsamplerate-like bindings. */
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 1: `One-shot' resample a single block of data in memory.
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 2: resample a raw, single-channel, floating-point data stream from
* stdin to stdout.
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 5: Variable-rate resampling. A test signal (held in a buffer) is
* resampled over a wide range of octaves. Resampled data is sent to stdout as
* raw, float32 samples. Choices of 2 test-signals and of 2 ways of varying
* the sample-rate are combined in a command-line option:
*
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if defined __GNUC__
#pragma GCC system_header
#elif defined __SUNPRO_C
#pragma disable_warn
#elif defined _MSC_VER
#pragma warning(push, 1)
#endif
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_filter_included
#define soxr_filter_included
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#ifndef soxr_fifo_included
#define soxr_fifo_included
Copyright (c) 2007-13 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
if (NOT EXISTS "@CMAKE_CURRENT_BINARY_DIR@/install_manifest.txt")
message (FATAL_ERROR "Cannot find install manifest")
endif ()
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include "filter.h"
#include "util32s.h"
#include "rdft_t.h"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <math.h>
#include <libavcodec/avfft.h>
#include "util32s.h"
#include "rdft_t.h"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <stdlib.h>
#include "filter.h"
#define FFT4G_FLOAT
#include "fft4g.c"
#include "soxr-config.h"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <stdlib.h>
#include "filter.h"
#include "fft4g.c"
#include "soxr-config.h"
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <stdlib.h>
#include <math.h>
#include <libavcodec/avfft.h>
#include "filter.h"
#include "rdft_t.h"
Copyright (c) 2007-13 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
math (EXPR quality "43 + (${bits} - 13) / 4")
set (ofile ${irate}-${orate}-${quality}.s32)
#message (STATUS "Output file = [${ofile}]")
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
static int * LSX_FFT_BR;
static DFT_FLOAT * LSX_FFT_SC;
static int FFT_LEN = -1;
static ccrw2_t FFT_CACHE_CCRW;
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
typedef void (* fn_t)(void);
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
void lsx_cdft(int, int, double *, int *, double *);
void lsx_rdft(int, int, double *, int *, double *);
void lsx_ddct(int, int, double *, int *, double *);
void lsx_ddst(int, int, double *, int *, double *);
void lsx_dfct(int, double *, double *, int *, double *);
void lsx_dfst(int, double *, double *, int *, double *);
Copyright (c) 2007-13 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
void ORDERED_CONVOLVE(int n, void * not_used, DFT_FLOAT * a, const DFT_FLOAT * b)
Copyright (c) 2007-13 robs@users.sourceforge.net
These simple examples show the different ways that an application may
interface with soxr. Note that real-world applications may also have to
deal with file-formats, codecs, (more sophisticated) dithering, etc., which
are not covered here.
Copyright (c) 2007-15 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Test 1: exercises soxr_delay and soxr_clear */
Copyright (c) 2007-16 robs@users.sourceforge.net
Copyright (c) 2007-16 robs@users.sourceforge.net
Cmake is the recommended way to configure, build (as either a DLL or a static
library), and install libsoxr for general use on MS-Windows, as on other OSs.
Copyright (c) 2007-16 robs@users.sourceforge.net
INSTALLATION GUIDE CONTENTS
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* AVX support macros */
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details.
*
* Constant-rate resampling common code. */
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Decimate by 2 using a FIR with odd length (LEN). */
/* Input must be preceded and followed by LEN >> 1 samples. */
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define PFFFT_DOUBLE 0
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define PFFFT_DOUBLE 1
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define PFFFT_DOUBLE 1
#include "pffft-wrap.c"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define RATE_CB _soxr_rate32_cb
#define CORE_STR "cr32"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define RATE_CB _soxr_rate32s_cb
#define CORE_STR "cr32s"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define RATE_CB _soxr_rate64_cb
#define CORE_STR "cr64"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#define RATE_CB _soxr_rate64s_cb
#define CORE_STR "cr64s"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 3: extends example 2 with multiple channels, multiple datatypes,
* and other options.
Copyright (c) 2007-16 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
# - Function to find C compiler feature flags
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_cr_included
#define soxr_cr_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_internal_included
#define soxr_internal_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if defined SOXR_LIB
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_math_wrap_included
#define soxr_math_wrap_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_rint_included
#define soxr_rint_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_std_types_included
#define soxr_std_types_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_util32s_included
#define soxr_util32s_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#if !defined soxr_util64s_included
#define soxr_util64s_included
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <assert.h>
#include <string.h>
#include <stdlib.h>
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include "filter.h"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
#include <soxr.h>
#include "rint.h"
#include "../examples/examples-common.h"
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Resample using an interpolated poly-phase FIR with length LEN. */
/* Input must be followed by FIR_LENGTH-1 samples. */
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Resample using a non-interpolated poly-phase FIR with length LEN. */
/* Input must be followed by FIR_LENGTH-1 samples. */
Copyright (c) 2007-16 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
# Sets CMAKE_SYSTEM_PROCESSOR for cross-compiling.
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
static float const half_fir_coefs[] = {
0.471112154f, 0.316907549f, 0.0286963396f, -0.101927032f,
-0.0281272982f, 0.0568029535f, 0.027196876f, -0.0360795942f,
-0.0259313561f, 0.023641162f, 0.0243660538f, -0.0151238564f,
-0.0225440668f, 0.00886927471f, 0.0205146088f, -0.00411434209f,
-0.0183312132f, 0.000458525335f, 0.0160497772f, 0.00233248286f,
-0.0137265989f, -0.0044106884f, 0.011416442f, 0.005885487f,
-0.00917074467f, -0.00684373006f, 0.00703601669f, 0.00736018933f,
-0.00505250698f, -0.00750298261f, 0.00325317131f, 0.00733618346f,
-0.00166298445f, -0.00692082025f, 0.000298598848f, 0.00631493711f,
0.000831644129f, -0.0055731438f, -0.00172737872f, 0.00474591812f,
0.0023955814f, -0.0038788491f, -0.00284969263f, 0.00301194082f,
0.00310854264f, -0.00217906496f, -0.00319514679f, 0.00140761062f,
0.00313542959f, -0.000718361916f, -0.00295694328f, 0.000125607323f,
0.00268763625f, 0.000362527878f, -0.00235472525f, -0.000743552559f,
0.00198371228f, 0.00101991741f, -0.0015975797f, -0.00119820218f,
0.00121618271f, 0.0012882279f, -0.000855849209f, -0.00130214036f,
0.000529184474f, 0.00125350876f, -0.000245067778f, -0.00115647977f,
8.82118676e-06f, 0.00102502052f, 0.000177478031f, -0.000872275256f,
-0.000314572995f, 0.000710055602f, 0.000405526007f, -0.000548470439f,
-0.000455174442f, 0.000395698685f, 0.000469579667f, -0.000257895884f,
-0.000455495078f, 0.000139222702f, 0.000419883982f, -4.19753541e-05f,
-0.00036950051f, -3.32020844e-05f, 0.000310554015f, 8.7050045e-05f,
-0.000248456595f, -0.000121389974f, 0.000187662656f, 0.000138813233f,
-0.000131587954f, -0.000142374865f, 8.26090549e-05f, 0.000135318039f,
-4.21208043e-05f, -0.000120830917f, 1.06505085e-05f, 0.00010185819f,
1.20015129e-05f, -8.09558888e-05f, -2.65925299e-05f, 6.02101571e-05f,
3.42775752e-05f, -4.11911155e-05f, -3.64462477e-05f, 2.49654252e-05f,
3.46090513e-05f, -1.21078107e-05f, -3.03027209e-05f, 2.73562006e-06f,
2.51329043e-05f, 3.66157998e-06f, -2.0990973e-05f, -9.38752332e-06f,
2.07133365e-05f, 3.2060847e-05f, 1.98462364e-05f, 4.90328648e-06f,
-5.28550107e-07f,
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Utility used to help test the library; not for general consumption.
Copyright (c) 2007-16 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Variable-rate resampling. */
Copyright (c) 2007-16 robs@users.sourceforge.net");
puts(" * Licence for this file: LGPL v2.1 See LICENCE for details. */\n");
fir(241, 1, .45, .5, 160, 32, "half_fir_coefs");
fir( 24, .5, .25, .5, 1, 31, "fast_half_fir_coefs");
fir( 20, 12, .9 , 1.5, 160, 58, "coefs0_d");
fir( 12, 6, .45, 1.5, 80, 29, "coefs0_u");
iir( 15, .492, "iir_coefs");
return 0*argc*!argv;
Copyright (c) 2007-16 robs@users.sourceforge.net
rem Licence for this file: LGPL v2.1 See LICENCE for details.
Copyright (c) 2007-16 robs@users.sourceforge.net
rem Licence for this file: LGPL v2.1 See LICENCE for details.
set build=%1
if x%build% == x set build=Release
Copyright (c) 2007-18 robs@users.sourceforge.net
Copyright (c) 2007-18 robs@users.sourceforge.net
Copyright (c) 2007-18 robs@users.sourceforge.net
Copyright (c) 2007-18 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Common includes etc. for the examples. */
Copyright (c) 2007-18 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Example 4: variant of examples 2 & 3, demonstrating I/O with split channels.
Copyright (c) 2007-18 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
# - Find AVCODEC
# Find the installation of this package: include-dirs and libraries.
Copyright (c) 2007-18 robs@users.sourceforge.net
# Licence for this file: LGPL v2.1 See LICENCE for details.
# - Find AVUTIL
# Find the installation of this package: includes and libraries.
Copyright (c) 2007-18 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Wrapper mostly compatible with `libsamplerate'. */
Copyright (c) 2007-18 robs@users.sourceforge.net
The SoX Resampler library `libsoxr' performs one-dimensional sample-rate
conversion -- it may be used, for example, to resample PCM-encoded audio.
For higher-dimensional resampling, such as for visual-image processing, you
should look elsewhere.
Copyright (C) 2008-2011 Erik de Castro Lopo <erikd@mega-nerd.com>
Copyright (c) 2013 Julien Pommier ( pommier@modartt.com )
Copyright (c) 2013 Julien Pommier ( pommier@modartt.com )
Copyright (c) 2013 Julien Pommier ( pommier@modartt.com )
Based on original fortran 77 code from FFTPACKv4 from NETLIB,
authored by Dr Paul Swarztrauber of NCAR, in 1985.
Copyright (c) 2013 robs@users.sourceforge.net
* Licence for this file: LGPL v2.1 See LICENCE for details. */
/* Generate the filter coefficients for variable-rate resampling. */
Copyright (c) 2021 Myungchul Keum
Copyright (C) year name of author
Copyright Takuya OOURA, 1996-2001.
You may use, copy, modify and distribute this code for any
purpose (include commercial use) and without fee. Please
refer to this package when you modify this code.
copyright the
copyright the
sty
1.0.6
Copyright 2018-present Felix Meyer-Wolters
SymPy
1.13.1
Copyright 2016, latex2sympy
Copyright (C) 2001, 2002 Vasil Yaroshevich
Modified Fabian Seoane 2007 for sympy
Copyright (c) 2006-2014 SymPy developers
All rights reserved.
Copyright (c) 2006-2018 SymPy Development Team,
2013-2023 Sergey B Kirpichev
All rights reserved.
Copyright (c) 2006-2023 SymPy Development Team
All rights reserved.
Copyright (C) 2008 Jens Rasch <jyr2000@gmail.com>
Copyright (c) 2009-2023, PyDy Authors
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of this project nor the names of its contributors may be
used to endorse or promote products derived from this software without
specific prior written permission.
Copyright (c) 2014 Matthew Rocklin
All rights reserved.
tensorboard
2.15.2
(c)|0,a.next()
(c)|0,a.next()
:host {
--paper-input-container-label: {
font-size: 14px;
}
--paper-input-container-input: {
font-size: 14px;
(c)|0,c==l.length
(c) < 128)
(c)?a.isNumeric=
attribute vec2 posObj;
attribute vec3 color;
varying vec2 vUv;
varying vec3 vColor;
void main() {
vUv = uv;
vColor = color;
(c)
codepoints.append(codepoint)
for cp in codepoints:
(c)?c:
${o}).`);if(e<r)throw new Error(`batchDims (${r}) must be less than or equal to axis (${e}).`);for(let h=0;h<r;++h)if(n.shape[h]!==t.shape[h])throw new Error(`x.shape[${h}]: ${n.shape[h]} should be equal to indices.shape[${h}]: ${t.shape[h]}.`);let s=n.shape[e],a=[],l=1,c=1,u=1;for(let h=0;h<r;++h)a.push(n.shape[h]),l*=n.shape[h];for(let h=r;h<e;h++)a.push(n.shape[h]),c*=n.shape[h];for(let h=r;h<i;h++)a.push(t.shape[h]);for(let h=e+1;h<o;h++)a.push(n.shape[h]),u*=n.shape[h];return{batchSize:l,sliceSize:u,outerSize:c,dimSize:s,outputShape:a}}function ij(n){try{return n.map(t=>Bl(t))}catch(t){throw new Error(`Failed to decode encoded string bytes into utf-8, error: ${t}`)}}function oj(n){return n.map(t=>Ol(t))}var kn={};So(kn,{nonMaxSuppressionV3Impl:()=>oI,nonMaxSuppressionV4Impl:()=>sI,nonMaxSuppressionV5Impl:()=>aI,whereImpl:()=>nI});function ut(n,t){Array.isArray(n)||(n=[n]),n.forEach(e=>{e!=null&&R.assert(e.dtype!=="complex64",()=>`${t} does not support complex64 tensors in the CPU backend.`)})}var aj=kn.whereImpl,na=class extends Qi{constructor(){super(),this.blockSize=48,this.firstUse=!0,this.data=new Vs(this,ro())}nextDataId(){return na.nextDataId++}write(t,e,r){this.firstUse&&(this.firstUse=!1,ot().get("IS_NODE")&&F.warn(`
============================
Hi there \u{1F44B}. Looks like you are running TensorFlow.js in Node.js. To speed things up dramatically, install our node backend, which binds to TensorFlow C++, by running npm i @tensorflow/tfjs-node, or npm i @tensorflow/tfjs-node-gpu if you have CUDA. Then call require('@tensorflow/tfjs-node'); (-gpu suffix for CUDA) at the start of your program. Visit https://github.com/tensorflow/tfjs-node for more details.
============================`));let i={id:this.nextDataId()};return this.data.set(i,{values:t,dtype:r,refCount:1}),i}makeTensorInfo(t,e,r){let i;if(e==="string"&&r!=null&&r.length>0&&R.isString(r[0])){let o=r.map(s=>R.encodeString(s));i=this.write(o,t,e)}else i=this.write(r,t,e);return{dataId:i,shape:t,dtype:e}}refCount(t){return this.data.has(t)?this.data.get(t).refCount:0}incRef(t){let e=this.data.get(t);e.refCount++}decRef(t){if(this.data.has(t)){let e=this.data.get(t);e.refCount--}}move(t,e,r,i,o){this.data.set(t,{values:e,dtype:i,refCount:o})}numDataIds(){return this.data.numDataIds()}read(t){return Jt(this,null,function*(){return this.readSync(t)})}readSync(t){let{dtype:e,complexTensorInfos:r}=this.data.get(t);if(e==="complex64"){let i=this.readSync(r.real.dataId),o=this.readSync(r.imag.dataId);return F.mergeRealAndImagArrays(i,o)}return this.data.get(t).values}bufferSync(t){let e=this.readSync(t.dataId),r=e;if(t.dtype==="string")try{r=e.map(i=>R.decodeString(i))}catch(i){throw new Error("Failed to decode encoded string bytes into utf-8")}return Xt(t.shape,t.dtype,r)}makeOutput(t,e,r){let i=this.write(t,e,r);return ro().makeTensorFromDataId(i,e,r,this)}disposeData(t,e=!1){if(this.data.has(t)){if(this.data.get(t).refCount--,!e&&this.data.get(t).refCount>0)return!1;let{complexTensorInfos:r}=this.data.get(t);r!=null&&(this.disposeData(r.real.dataId,!0),this.disposeData(r.imag.dataId,!0)),this.data.delete(t)}return!0}disposeIntermediateTensorInfo(t){this.disposeData(t.dataId)}time(t){return Jt(this,null,function*(){let e=R.now();return t(),{kernelMs:R.now()-e}})}memory(){return{unreliable:!0,reasons:["The reported memory is an upper bound. Due to automatic garbage collection, the true allocated memory may be less."]}}where(t){ut([t],"where");let e=this.readSync(t.dataId);return aj(t.shape,e)}dispose(){}floatPrecision(){return 32}epsilon(){return super.epsilon()}};na.nextDataId=0;var D_={};So(D_,{addImpl:()=>x_,bincountImpl:()=>jl,bincountReduceImpl:()=>d1,ceilImpl:()=>v_,concatImpl:()=>f1,expImpl:()=>y_,expm1Impl:()=>__,floorImpl:()=>w_,gatherV2Impl:()=>m1,greaterImpl:()=>S_,lessImpl:()=>C_,linSpaceImpl:()=>g1,logImpl:()=>M_,maxImpl:()=>x1,maximumImpl:()=>E_,minimumImpl:()=>T_,multiplyImpl:()=>op,negImpl:()=>A_,notEqualImpl:()=>I_,prodImpl:()=>k_,rangeImpl:()=>v1,rsqrtImpl:()=>R_,simpleAbsImpl:()=>g_,sliceImpl:()=>P_,squaredDifferenceImpl:()=>N_,stridedSliceImpl:()=>y1,subImpl:()=>L_,tileImpl:()=>b1,topKImpl:()=>_1,transposeImpl:()=>ql,uniqueImpl:()=>w1});function g_(n){let t=new Float32Array(n.length);for(let e=0;e<n.length;++e)t[e]=Math.abs(n[e]);return t}var lj=n=>{let{x:t}=n.inputs,e=n.backend;ut(t,"abs");let r=new Float32Array(R.sizeFromShape(t.shape)),i=e.data.get(t.dataId).values;return r=g_(i),e.makeOutput(r,t.shape,"float32")},uI={kernelName:ym,backendName:"cpu",kernelFunc:lj};function le(n){return(t,e,r,i,o)=>{let s=F.assertAndGetBroadcastShape(t,e),a=s.length,l=R.computeStrides(s),c=R.sizeFromShape(s),u=R.getTypedArrayFromDType(o,c),h=t.length,p=e.length,d=R.computeStrides(t),f=R.computeStrides(e),m=F.getBroadcastDims(t,s),x=F.getBroadcastDims(e,s);if(m.length+x.length===0)for(let g=0;g<u.length;++g)u[g]=n(r[g%r.length],i[g%i.length]);else for(let g=0;g<u.length;++g){let v=R.indexToLoc(g,a,l),b=v.slice(-h);m.forEach(E=>b[E]=0);let y=R.locToIndex(b,h,d),_=v.slice(-p);x.forEach(E=>_[E]=0);let S=R.locToIndex(_,p,f);u[g]=n(r[y],i[S])}return[u,s]}}function sn(n){let{inputs:t,backend:e}=n,{real:r,imag:i}=t,o=e.data.get(r.dataId).values,s=e.data.get(i.dataId).values,a=e.makeTensorInfo(r.shape,"complex64"),l=e.data.get(a.dataId);return l.complexTensorInfos={real:e.makeTensorInfo(r.shape,"float32",o),imag:e.makeTensorInfo(i.shape,"float32",s)},a}var hI={kernelName:Il,backendName:"cpu",kernelFunc:sn};function Wl(n,t,e="float32"){if(e==="complex64"){let i=Wl(n,t,"float32"),o=Wl(n,t,"float32");return sn({inputs:{real:i,imag:o},backend:n})}let r=R.makeZerosTypedArray(R.sizeFromShape(t),e);return n.makeTensorInfo(t,e,r)}function Rn(n){let{inputs:t,backend:e}=n,{x:r}=t;return e.incRef(r.dataId),{dataId:r.dataId,shape:r.shape,dtype:r.dtype}}var pI={kernelName:Do,backendName:"cpu",kernelFunc:Rn};function Pr(n){let{inputs:t,backend:e}=n,{input:r}=t,i=e.data.get(r.dataId).complexTensorInfos.real,o=e.data.get(i.dataId).values;return e.makeTensorInfo(i.shape,i.dtype,o)}var dI={kernelName:Tg,backendName:"cpu",kernelFunc:Pr};function Nr(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{dtype:o}=r;if(o==="complex64"){if(i.dtype==="complex64")return Rn({inputs:{x:i},backend:e});let s=Wl(e,i.shape,i.dtype),a=Nr({inputs:{x:i},backend:e,attrs:{dtype:"float32"}}),l=sn({inputs:{real:a,imag:s},backend:e});return e.disposeIntermediateTensorInfo(s),e.disposeIntermediateTensorInfo(a),l}if(i.dtype==="complex64"){let s=Pr({inputs:{input:i},backend:e}),a=Nr({inputs:{x:s},backend:e,attrs:{dtype:o}});return e.disposeIntermediateTensorInfo(s),a}if(!R.hasEncodingLoss(i.dtype,o)){let s=Rn({inputs:{x:i},backend:e});return{dataId:s.dataId,shape:s.shape,dtype:o}}if(o==="int32"){let s=e.data.get(i.dataId).values,a=Int32Array.from(s);return e.makeTensorInfo(i.shape,"int32",a)}if(o==="bool"){let s=e.data.get(i.dataId).values,a=R.toTypedArray([0],i.dtype),[l,c]=le((u,h)=>u!==h?1:0)(i.shape,[],s,a,"bool");return e.makeTensorInfo(c,"bool",l)}throw new Error(`Error in Cast: failed to cast ${i.dtype} to ${o}`)}var fI={kernelName:Lo,backendName:"cpu",kernelFunc:Nr};function fe(n,t,e,r){return e==null?({inputs:i,backend:o})=>{let{a:s,b:a}=i,l=o;ut([s,a],n);let c=l.data.get(s.dataId).values,u=l.data.get(a.dataId).values,h=r||s.dtype,[p,d]=t(s.shape,a.shape,c,u,h);return l.makeTensorInfo(d,h,p)}:({inputs:i,backend:o})=>{let{a:s,b:a}=i,l=o;if(s.dtype==="complex64"||a.dtype==="complex64"){let c=Nr({inputs:{x:s},backend:l,attrs:{dtype:"complex64"}}),u=l.data.get(c.dataId),h=u.complexTensorInfos.real,p=u.complexTensorInfos.imag,d=l.data.get(h.dataId).values,f=l.data.get(p.dataId).values,m=Nr({inputs:{x:a},backend:l,attrs:{dtype:"complex64"}}),x=l.data.get(m.dataId),g=x.complexTensorInfos.real,v=x.complexTensorInfos.imag,b=l.data.get(g.dataId).values,y=l.data.get(v.dataId).values,[_,S,E]=e(s.shape,a.shape,d,f,b,y),M=l.makeTensorInfo(E,"float32",_),P=l.makeTensorInfo(E,"float32",S),D=sn({inputs:{real:M,imag:P},backend:l});return l.disposeIntermediateTensorInfo(c),l.disposeIntermediateTensorInfo(m),l.disposeIntermediateTensorInfo(M),l.disposeIntermediateTensorInfo(P),D}else{let c=l.data.get(s.dataId).values,u=l.data.get(a.dataId).values,h=r||s.dtype,[p,d]=t(s.shape,a.shape,c,u,h);return l.makeTensorInfo(d,h,p)}}}function Gl(n){return(t,e,r,i,o,s)=>{let a=F.assertAndGetBroadcastShape(t,e),l=R.sizeFromShape(a),c=a.length,u=R.computeStrides(a),h=R.getTypedArrayFromDType("float32",l),p=R.getTypedArrayFromDType("float32",l),d=F.getBroadcastDims(t,a),f=F.getBroadcastDims(e,a),m=F.mergeRealAndImagArrays(r,i),x=F.mergeRealAndImagArrays(o,s),g=t.length,v=R.computeStrides(t),b=e.length,y=R.computeStrides(e);if(d.length+f.length===0)for(let _=0;_<h.length;_++){let S=_%m.length,E=_%x.length,M=n(m[S*2],m[S*2+1],x[E*2],x[E*2+1]);h[_]=M.real,p[_]=M.imag}else for(let _=0;_<h.length;_++){let S=R.indexToLoc(_,c,u),E=S.slice(-g);d.forEach(I=>E[I]=0);let M=R.locToIndex(E,g,v),P=S.slice(-b);f.forEach(I=>P[I]=0);let D=R.locToIndex(P,b,y),w=n(m[M*2],m[M*2+1],x[D*2],x[D*2+1]);h[_]=w.real,p[_]=w.imag}return[h,p,a]}}var x_=le((n,t)=>n+t),cj=Gl((n,t,e,r)=>({real:n+e,imag:t+r})),io=fe(Us,x_,cj),mI={kernelName:Us,backendName:"cpu",kernelFunc:io};function jl(n,t,e,r,i){let o=R.sizeFromShape(r),s=R.makeZerosTypedArray(i,e);for(let a=0;a<n.length;a++){let l=n[a];if(l<0)throw new Error("Input x must be non-negative!");l>=i||(o>0?s[l]+=t[a]:s[l]+=1)}return s}function d1(n,t,e,r=!1){let i=n.shape[0],o=n.shape[1],s=Xt([i,e],t.dtype);for(let a=0;a<i;a++)for(let l=0;l<o;l++){let c=n.get(a,l);if(c<0)throw new Error("Input x must be non-negative!");c>=e||(r?s.set(1,a,c):t.size>0?s.set(s.get(a,c)+t.get(a,l),a,c):s.set(s.get(a,c)+1,a,c))}return s}function Lr(n){return(t,e,r)=>{let i=R.getTypedArrayFromDType(e,t.length);for(let o=0;o<t.length;++o)i[o]=n(t[o],r);return i}}function qt(n,t,e){return({inputs:r,attrs:i,backend:o})=>{let{x:s}=r;if(ut(s,n),s.dtype==="string"||e==="string")throw new Error("unaryKernelFunc does not support string input/output");let a=o,l=a.data.get(s.dataId).values,c=R.sizeFromShape(s.shape),u=e||s.dtype,h=R.getArrayFromDType(u,c);for(let p=0;p<c;++p)h[p]=t(l[p],i);return a.makeTensorInfo(s.shape,u,h)}}function Dr(n,t,e){return({inputs:r,attrs:i,backend:o})=>{let{x:s}=r;if(ut(s,n),s.dtype==="string"||e==="string")throw new Error("unaryKernelFunc does not support string input/output");let a=o,l=a.data.get(s.dataId).values,c=e||s.dtype,u=t(l,c,i);return a.makeTensorInfo(s.shape,c,u)}}var v_=Lr(n=>Math.ceil(n)),uj=Dr(dh,v_),gI={kernelName:dh,backendName:"cpu",kernelFunc:uj};function f1(n,t,e,r){let i=R.getArrayFromDType(e,R.sizeFromShape(t));if(r&&e!=="string"){let o=0;n.forEach(s=>{let a=R.sizeFromShape(s.shape);i.set(s.vals,o),o+=a})}else{let o=0;n.forEach(s=>{let a=e==="string"?F.fromUint8ToStringArray(s.vals):s.vals,l=0;for(let c=0;c<s.shape[0];++c){let u=c*t[1]+o;for(let h=0;h<s.shape[1];++h)i[u+h]=a[l++]}o+=s.shape[1]})}return i}var y_=Lr(n=>Math.exp(n)),b_=Dr(bh,y_),xI={kernelName:bh,backendName:"cpu",kernelFunc:b_};var __=Lr(n=>Math.expm1(n)),hj=Dr(_h,__),vI={kernelName:_h,backendName:"cpu",kernelFunc:hj};var w_=Lr(n=>Math.floor(n)),pj=Dr(wh,w_),yI={kernelName:wh,backendName:"cpu",kernelFunc:pj};function m1(n,t,e){let r=Xt(e,n.dtype);for(let i=0;i<r.size;++i){let s=r.indexToLoc(i).slice(),a=s[0],l=s[2],c=t.locToIndex([a,l]);s[2]=t.values[c];let u=n.locToIndex(s);r.values[i]=n.values[u]}return r}var S_=le((n,t)=>n>t?1:0),dj=fe(Ch,S_,null,"bool"),bI={kernelName:Ch,backendName:"cpu",kernelFunc:dj};var C_=le((n,t)=>n<t?1:0),fj=fe(Ih,C_,null,"bool"),_I={kernelName:Ih,backendName:"cpu",kernelFunc:fj};function g1(n,t,e){let r=(t-n)/(e-1),i=R.makeZerosTypedArray(e,"float32");i[0]=n;for(let o=1;o<i.length;o++)i[o]=i[o-1]+r;return i}var M_=Lr(n=>Math.log(n)),mj=Dr(Rh,M_),wI={kernelName:Rh,backendName:"cpu",kernelFunc:mj};function x1(n,t,e,r){let i=R.getTypedArrayFromDType(r,R.sizeFromShape(e));for(let o=0;o<i.length;++o){let s=o*t,a=n[s];for(let l=0;l<t;++l){let c=n[s+l];c>a&&(a=c)}i[o]=a}return i}var E_=le((n,t)=>Math.max(n,t)),gj=fe(zh,E_),SI={kernelName:zh,backendName:"cpu",kernelFunc:gj};var T_=le((n,t)=>Math.min(n,t)),xj=fe(Fh,T_),CI={kernelName:Fh,backendName:"cpu",kernelFunc:xj};var op=le((n,t)=>n*t),vj=Gl((n,t,e,r)=>({real:n*e-t*r,imag:n*r+t*e})),ra=fe(Gs,op,vj),MI={kernelName:Gs,backendName:"cpu",kernelFunc:ra};function A_(n,t,e){let r=R.createScalarValue(-1,e);return op([],t,r,n,e)}function yj(n){let{inputs:t,backend:e}=n,{x:r}=t;ut(r,"neg");let i=e.data.get(r.dataId).values,[o,s]=A_(i,r.shape,r.dtype);return e.makeTensorInfo(s,r.dtype,o)}var EI={kernelName:vg,backendName:"cpu",kernelFunc:yj};var I_=le((n,t)=>n!==t?1:0),bj=fe(Bh,I_,null,"bool"),TI={kernelName:Bh,backendName:"cpu",kernelFunc:bj};function ql(n,t,e,r,i){let o=t.length,s=R.sizeFromShape(t),a=R.computeStrides(t),l=R.computeStrides(i),c=R.getTypedArrayFromDType(e,R.sizeFromShape(i));for(let u=0;u<s;++u){let h=R.indexToLoc(u,o,a),p=new Array(h.length);for(let f=0;f<p.length;f++)p[f]=h[r[f]];let d=R.locToIndex(p,o,l);c[d]=n[u]}return c}function Ve(n){let{inputs:t,attrs:e,backend:r}=n,{x:i}=t,{perm:o}=e;ut(i,"transpose");let s=i.shape.length,a=new Array(s);for(let h=0;h<a.length;h++)a[h]=i.shape[o[h]];let l=r.data.get(i.dataId).values,c=ql(l,i.shape,i.dtype,o,a);return{dataId:r.write(c,a,i.dtype),shape:a,dtype:i.dtype}}var AI={kernelName:zl,backendName:"cpu",kernelFunc:Ve};function k_(n,t,e,r){let[i,o]=F.computeOutAndReduceShapes(n,r),s=on(t,"int32"),a=R.makeZerosTypedArray(R.sizeFromShape(i),s),l=R.sizeFromShape(o);for(let c=0;c<a.length;++c){let u=c*l,h=1;for(let p=0;p<l;++p)h*=e[u+p];a[c]=h}return{outVals:a,outShape:i,outDtype:s}}function _j(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r;ut(i,"prod");let a=i.shape.length,l=R.parseAxisParam(o,i.shape),c=F.getAxesPermutation(l,a),u=l,h=i,p=[];c!=null&&(h=Ve({inputs:{x:i},backend:e,attrs:{perm:c}}),p.push(h),u=F.getInnerMostAxes(u.length,a));let d=e.data.get(h.dataId).values,{outVals:f,outShape:m,outDtype:x}=k_(h.shape,h.dtype,d,u),g=m;return s&&(g=F.expandShapeToKeepDim(m,l)),p.forEach(v=>e.disposeIntermediateTensorInfo(v)),e.makeTensorInfo(g,x,f)}var II={kernelName:Mg,backendName:"cpu",kernelFunc:_j};function v1(n,t,e,r){let i=n===t,o=n<t&&e<0,s=t<n&&e>1;if(i||o||s)return R.makeZerosTypedArray(0,r);let a=Math.abs(Math.ceil((t-n)/e)),l=R.makeZerosTypedArray(a,r);t<n&&e===1&&(e=-1),l[0]=n;for(let c=1;c<l.length;c++)l[c]=l[c-1]+e;return l}var R_=Lr(n=>1/Math.sqrt(n)),wj=Dr(Uh,R_),kI={kernelName:Uh,backendName:"cpu",kernelFunc:wj};function P_(n,t,e,r,i){let o=In.isSliceContinous(r,t,e),s=R.sizeFromShape(e),a=R.computeStrides(r);if(o){let h=In.computeFlatOffset(t,a);return i==="string"?n.slice(h,h+s):n.subarray(h,h+s)}let l=i==="string"?F.fromUint8ToStringArray(n):n,c=Xt(r,i,l),u=Xt(e,i);for(let h=0;h<u.size;++h){let p=u.indexToLoc(h),d=p.map((f,m)=>f+t[m]);u.set(c.get(...d),...p)}return i==="string"?F.fromStringArrayToUint8(u.values):u.values}function zr(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{begin:o,size:s}=r;ut(i,"slice");let[a,l]=In.parseSliceParams(i,o,s);In.assertParamsValid(i,a,l);let c=e.data.get(i.dataId).values,u=P_(c,a,l,i.shape,i.dtype);return e.makeTensorInfo(l,i.dtype,u)}var RI={kernelName:Dg,backendName:"cpu",kernelFunc:zr};var N_=le((n,t)=>{let e=n-t;return e*e}),Sj=fe(Zh,N_),PI={kernelName:Zh,backendName:"cpu",kernelFunc:Sj};function y1(n,t,e,r){let i=Xt(n,t.dtype);for(let o=0;o<i.size;o++){let s=i.indexToLoc(o),a=new Array(s.length);for(let l=0;l<a.length;l++)a[l]=s[l]*e[l]+r[l];i.set(t.get(...a),...s)}return i}var L_=le((n,t)=>n-t),Cj=Gl((n,t,e,r)=>({real:n-e,imag:t-r})),sp=fe(Xs,L_,Cj),NI={kernelName:Xs,backendName:"cpu",kernelFunc:sp};function b1(n,t){let e=new Array(n.rank);for(let i=0;i<e.length;i++)e[i]=n.shape[i]*t[i];let r=Xt(e,n.dtype);for(let i=0;i<r.values.length;++i){let o=r.indexToLoc(i),s=new Array(n.rank);for(let l=0;l<s.length;l++)s[l]=o[l]%n.shape[l];let a=n.locToIndex(s);r.values[i]=n.values[a]}return r}function _1(n,t,e,r,i){let o=t[t.length-1],[s,a]=[n.length/o,o],l=R.getTypedArrayFromDType(e,s*r),c=R.getTypedArrayFromDType("int32",s*r);for(let h=0;h<s;h++){let p=h*a,d=n.subarray(p,p+a),f=[];for(let v=0;v<d.length;v++)f.push({value:d[v],index:v});f.sort((v,b)=>b.value-v.value);let m=h*r,x=l.subarray(m,m+r),g=c.subarray(m,m+r);for(let v=0;v<r;v++)x[v]=f[v].value,g[v]=f[v].index}let u=t.slice();return u[u.length-1]=r,[Xt(u,e,l),Xt(u,"int32",c)]}function w1(n,t,e,r){let i=R.parseAxisParam(t,e)[0],o=[1,e[0],1];for(let f=0;f<i;f++)o[0]*=e[f];o[1]=e[i];for(let f=i+1;f<e.length;f++)o[2]*=e[f];let s={},a=new Int32Array(e[i]),l=new Ce(o,r,n),c=[],u=o[0]===1&&o[2]===1;for(let f=0;f<e[i];f++){let m;if(u)m=n[f].toString();else{let x=[];for(let g=0;g<o[0];g++)for(let v=0;v<o[2];v++)x.push(l.get(g,f,v));m=x.join(",")}if(s[m]!==void 0)a[f]=s[m];else{let x=Object.keys(s).length;s[m]=x,a[f]=x,c.push(f)}}let h=o.slice();h[1]=Object.keys(s).length;let p=new Ce(h,r);c.forEach((f,m)=>{for(let x=0;x<o[0];x++)for(let g=0;g<o[2];g++)p.set(l.get(x,f,g),x,m,g)});let d=e.slice();return d[i]=h[1],{outputValues:p.values,outputShape:d,indices:a}}c1("cpu",()=>new na,1);var z_=qt(Ws,n=>n>=0?n:Math.exp(n)-1),LI={kernelName:Ws,backendName:"cpu",kernelFunc:z_};function F_(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{alpha:o}=r;ut([i],"leakyRelu");let s=R.sizeFromShape(i.shape),a=e.data.get(i.dataId).values,l=R.getTypedArrayFromDType("float32",s);for(let c=0;c<a.length;c++)l[c]=a[c]<0?o*a[c]:a[c];return e.makeTensorInfo(i.shape,"float32",l)}var DI={kernelName:kl,backendName:"cpu",kernelFunc:F_};var Mj=le((n,t)=>n<0?t*n:n);function O_(n){let{inputs:t,backend:e}=n,{x:r,alpha:i}=t;ut([r,i],"prelu");let o=e.data.get(r.dataId).values,s=e.data.get(i.dataId).values,[a,l]=Mj(r.shape,i.shape,o,s,r.dtype);return e.makeTensorInfo(l,r.dtype,a)}var zI={kernelName:Pl,backendName:"cpu",kernelFunc:O_};var B_=qt(js,n=>Math.max(0,n)),FI={kernelName:js,backendName:"cpu",kernelFunc:B_};var V_=qt(qs,n=>Math.min(Math.max(0,n),6)),OI={kernelName:qs,backendName:"cpu",kernelFunc:V_};function Xl(n,t,e,r,i){if(e==="linear")return Rn({inputs:{x:t},backend:n});if(e==="relu")return B_({inputs:{x:t},backend:n});if(e==="elu")return z_({inputs:{x:t},backend:n});if(e==="relu6")return V_({inputs:{x:t},backend:n});if(e==="prelu")return O_({inputs:{x:t,alpha:r},backend:n});if(e==="leakyrelu")return F_({inputs:{x:t},backend:n,attrs:{alpha:i}});throw new Error(`Activation ${e} has not been implemented for the CPU backend.`)}function ce(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{shape:o}=r,s=R.sizeFromShape(i.shape),a=R.inferFromImplicitShape(o,s),l=R.sizeFromShape(a);R.assert(s===l,()=>`The new shape (${a}) has ${l} elements and the old shape (${i.shape}) has ${s} elements. The new shape and old shape must have the same number of elements.`),e.incRef(i.dataId);let c=e.data.get(i.dataId);if(c.complexTensorInfos!=null){let u=c.complexTensorInfos.real,h=c.complexTensorInfos.imag;u.shape=a,h.shape=a}return{dataId:i.dataId,shape:a,dtype:i.dtype}}var BI={kernelName:Nl,backendName:"cpu",kernelFunc:ce};function H_(n){let{inputs:t,backend:e,attrs:r}=n,{a:i,b:o}=t,{transposeA:s,transposeB:a}=r;ut([i,o],"matMul");let l=i.shape.length,c=o.shape.length,u=s?i.shape[l-2]:i.shape[l-1],h=a?o.shape[c-1]:o.shape[c-2],p=s?i.shape[l-1]:i.shape[l-2],d=a?o.shape[c-2]:o.shape[c-1],f=i.shape.slice(0,-2),m=o.shape.slice(0,-2),x=R.sizeFromShape(f),g=R.sizeFromShape(m),v=x===g||x===1||g===1;R.assert(l>=2&&c>=2&&v,()=>`Error in matMul: the input batch dimensions must either be the same or at least one input batch dimension must be 1. Got input batch dimensions of (${f}) and (${m}).`);let y=(x>g?i.shape.slice(0,-2):o.shape.slice(0,-2)).concat([p,d]);R.assert(u===h,()=>`Error in matMul: inner shapes (${u}) and (${h}) of Tensors with shapes ${i.shape} and ${o.shape} and transposeA=${s} and transposeB=${a} must match.`);let _=s?[x,u,p]:[x,p,u],S=a?[g,d,h]:[g,h,d],E=ce({inputs:{x:i},backend:e,attrs:{shape:_}}),M=ce({inputs:{x:o},backend:e,attrs:{shape:S}}),P=s?E.shape[1]:E.shape[2],D=s?E.shape[2]:E.shape[1],w=a?M.shape[1]:M.shape[2],I=Math.max(x,g),N=e.data.get(E.dataId).values,L=e.data.get(M.dataId).values,O=R.computeStrides(E.shape),z=R.computeStrides(M.shape),[V,$,X]=s?[O[0],1,O[1]]:[O[0],O[1],1],[W,K,Z]=a?[1,z[1],z[0]]:[z[1],1,z[0]],Y=D*w,tt=Xt([I,D,w],E.dtype),q=tt.values,et=e.blockSize;for(let rt=0;rt<I;rt++)for(let at=0;at<D;at+=et)for(let nt=0;nt<w;nt+=et)for(let wt=0;wt<P;wt+=et){let vt=Math.min(at+et,D),it=Math.min(nt+et,w),yt=Math.min(wt+et,P);for(let ct=at;ct<vt;ct++)for(let bt=nt;bt<it;bt++){let gt=0;for(let Rt=wt;Rt<yt;Rt++){let Lt=Math.min(rt,x-1)*V,Yt=Math.min(rt,g-1)*Z,Zt=N[Lt+ct*$+Rt*X],re=L[Rt*W+bt*K+Yt];gt+=Zt*re}q[rt*Y+(ct*w+bt)]+=gt}}return e.disposeIntermediateTensorInfo(E),e.disposeIntermediateTensorInfo(M),e.makeTensorInfo(y,tt.dtype,tt.values)}var VI={kernelName:Al,backendName:"cpu",kernelFunc:H_};function Ej(n){let{inputs:t,backend:e,attrs:r}=n,{a:i,b:o,bias:s,preluActivationWeights:a}=t,{transposeA:l,transposeB:c,activation:u,leakyreluAlpha:h}=r,p,d,f,m=[];p=H_({inputs:{a:i,b:o},attrs:{transposeA:l,transposeB:c},backend:e}),s&&(d=io({inputs:{a:p,b:s},backend:e}),m.push(p),p=d),u&&(f=Xl(e,p,u,a,h),m.push(p),p=f);for(let g of m)e.disposeIntermediateTensorInfo(g);return p}var HI={kernelName:Kg,backendName:"cpu",kernelFunc:Ej};var Tj=qt(sh,n=>Math.acos(n)),$I={kernelName:sh,backendName:"cpu",kernelFunc:Tj};var Aj=qt(ah,n=>Math.acosh(n)),UI={kernelName:ah,backendName:"cpu",kernelFunc:Aj};function Ij(n){let{inputs:t,backend:e}=n,r=t;ut(t,"addN");let i=r.map(a=>e.data.get(a.dataId).values),o=Xt(r[0].shape,r[0].dtype),s=o.values;for(let a=0;a<r.length;a++){let l=i[a];for(let c=0;c<s.length;c++)s[c]+=l[c]}return e.makeTensorInfo(o.shape,o.dtype,o.values)}var WI={kernelName:bm,backendName:"cpu",kernelFunc:Ij};function kj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r;ut(i,"all");let a=R.parseAxisParam(o,i.shape),l=a,c=F.getAxesPermutation(l,i.shape.length),u=i;c!=null&&(u=Ve({inputs:{x:i},backend:e,attrs:{perm:c}}),l=F.getInnerMostAxes(l.length,i.shape.length)),F.assertAxesAreInnerMostDims("all",l,u.shape.length);let[h,p]=F.computeOutAndReduceShapes(u.shape,l),d=R.sizeFromShape(p),f=R.makeZerosTypedArray(R.sizeFromShape(h),u.dtype),m=e.data.get(u.dataId).values;for(let g=0;g<f.length;++g){let v=g*d,b=m[v];for(let y=0;y<d;++y){let _=m[v+y];b=b&&_}f[g]=b}c!=null&&e.disposeIntermediateTensorInfo(u);let x=e.makeTensorInfo(h,u.dtype,f);if(s){let g=F.expandShapeToKeepDim(h,a),v=ce({inputs:{x},backend:e,attrs:{shape:g}});return e.disposeIntermediateTensorInfo(x),v}return x}var GI={kernelName:_m,backendName:"cpu",kernelFunc:kj};function Rj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r;ut(i,"any");let a=R.parseAxisParam(o,i.shape),l=a,c=F.getAxesPermutation(l,i.shape.length),u=i;c!=null&&(u=Ve({inputs:{x:i},backend:e,attrs:{perm:c}}),l=F.getInnerMostAxes(l.length,i.shape.length)),F.assertAxesAreInnerMostDims("any",l,u.shape.length);let[h,p]=F.computeOutAndReduceShapes(u.shape,l),d=R.sizeFromShape(p),f=R.makeZerosTypedArray(R.sizeFromShape(h),u.dtype),m=e.data.get(u.dataId).values;for(let g=0;g<f.length;++g){let v=g*d,b=m[v];for(let y=0;y<d;++y){let _=m[v+y];b=b||_}f[g]=b}c!=null&&e.disposeIntermediateTensorInfo(u);let x=e.makeTensorInfo(h,u.dtype,f);if(s){let g=F.expandShapeToKeepDim(h,a),v=ce({inputs:{x},backend:e,attrs:{shape:g}});return e.disposeIntermediateTensorInfo(x),v}return x}var jI={kernelName:wm,backendName:"cpu",kernelFunc:Rj};function Pj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o}=r;ut(i,"argMax");let s=R.parseAxisParam(o,i.shape),a=F.getAxesPermutation(s,i.shape.length),l=i,c=[];a!=null&&(l=Ve({inputs:{x:i},backend:e,attrs:{perm:a}}),c.push(l),s=F.getInnerMostAxes(s.length,l.shape.length)),s=[s[0]],F.assertAxesAreInnerMostDims("argMax",s,l.shape.length);let[u,h]=F.computeOutAndReduceShapes(l.shape,s),p=R.sizeFromShape(u),d=R.makeZerosTypedArray(p,"int32"),f=R.sizeFromShape(h),m=e.data.get(l.dataId).values;for(let x=0;x<d.length;++x){let g=x*f,v=m[g],b=0;for(let y=0;y<f;++y){let _=m[g+y];_>v&&(v=_,b=y)}d[x]=b}return c.forEach(x=>e.disposeIntermediateTensorInfo(x)),e.makeTensorInfo(u,"int32",d)}var qI={kernelName:Sm,backendName:"cpu",kernelFunc:Pj};function Nj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o}=r;ut(i,"argMin");let s=R.parseAxisParam(o,i.shape),a=F.getAxesPermutation(s,i.shape.length),l=i,c=[];a!=null&&(l=Ve({inputs:{x:i},backend:e,attrs:{perm:a}}),c.push(l),s=F.getInnerMostAxes(s.length,l.shape.length)),s=[s[0]],F.assertAxesAreInnerMostDims("argMin",s,l.shape.length);let[u,h]=F.computeOutAndReduceShapes(l.shape,s),p=R.sizeFromShape(u),d=R.makeZerosTypedArray(p,"int32"),f=R.sizeFromShape(h),m=e.data.get(l.dataId).values;for(let x=0;x<d.length;++x){let g=x*f,v=m[g],b=0;for(let y=0;y<f;++y){let _=m[g+y];_<v&&(v=_,b=y)}d[x]=b}return c.forEach(x=>e.disposeIntermediateTensorInfo(x)),e.makeTensorInfo(u,"int32",d)}var XI={kernelName:Cm,backendName:"cpu",kernelFunc:Nj};var Lj=qt(lh,n=>Math.asin(n)),KI={kernelName:lh,backendName:"cpu",kernelFunc:Lj};var Dj=qt(ch,n=>Math.asinh(n)),YI={kernelName:ch,backendName:"cpu",kernelFunc:Dj};var zj=qt(uh,n=>Math.atan(n)),ZI={kernelName:uh,backendName:"cpu",kernelFunc:zj};var Fj=le((n,t)=>Math.atan2(n,t)),Oj=fe(ph,Fj),JI={kernelName:ph,backendName:"cpu",kernelFunc:Oj};var Bj=qt(hh,n=>Math.atanh(n)),QI={kernelName:hh,backendName:"cpu",kernelFunc:Bj};function Kl(n,t,e,r,i,o){let s=i.strideHeight,a=i.strideWidth,l=i.dilationHeight,c=i.dilationWidth,u=i.effectiveFilterHeight,h=i.effectiveFilterWidth,p=i.padInfo.top,d=i.padInfo.left,f=o==="max"?Number.NEGATIVE_INFINITY:Number.POSITIVE_INFINITY,m=Xt(i.outShape,e),x=m.values,g=i.outShape[1]*i.outShape[2]*i.outShape[3],v=i.outShape[2]*i.outShape[3],b=i.outShape[3];for(let y=0;y<i.batchSize;++y){let _=y*g,S=y*r[0];for(let E=0;E<i.inChannels;++E)for(let M=0;M<i.outHeight;++M){let P=M*s-p,D=Math.max(0,P),w=Math.min(i.inHeight,u+P),I=_+M*v;for(let N=0;N<i.outWidth;++N){let L=N*a-d,O=Math.max(0,L),z=Math.min(i.inWidth,h+L),V=f,$=0,X=0;for(let K=D;K<w;K+=l){let Z=S+K*r[1];for(let Y=O;Y<z;Y+=c){let tt=Z+Y*r[2],q=n[tt+E];o==="max"&&q>V?V=q:o==="avg"&&($+=q,X++)}if(isNaN(V))break}let W=I+N*b+E;x[W]=o==="avg"?$/X:V}}}return m}function S1(n,t,e,r,i=!1,o=!1){let s=Xt(r.outShape,"int32"),a=r.strideHeight,l=r.strideWidth,c=r.dilationHeight,u=r.dilationWidth,h=r.effectiveFilterHeight,p=r.effectiveFilterWidth,d=r.padInfo.top,f=r.padInfo.left,m=Xt(t,e,n);for(let x=0;x<r.batchSize;++x)for(let g=0;g<r.inChannels;++g)for(let v=0;v<r.outHeight;++v){let b=v*a-d,y=b;for(;y<0;)y+=c;let _=Math.min(r.inHeight,h+b);for(let S=0;S<r.outWidth;++S){let E=S*l-f,M=E;for(;M<0;)M+=u;let P=Math.min(r.inWidth,p+E),D=Number.NEGATIVE_INFINITY,w=-1;for(let I=y;I<_;I+=c){let N=I-b;for(let L=M;L<P;L+=u){let O=L-E,z=m.get(x,I,L,g);z>D&&(D=z,i?w=o?((x*r.inHeight+I)*r.inWidth+L)*r.inChannels+g:(I*r.inWidth+L)*r.inChannels+g:w=N*p+O)}}s.set(w,x,v,S,g)}}return s}function C1(n,t,e,r,i,o){let s=i.strideDepth,a=i.strideHeight,l=i.strideWidth,c=i.dilationDepth,u=i.dilationHeight,h=i.dilationWidth,p=i.effectiveFilterDepth,d=i.effectiveFilterHeight,f=i.effectiveFilterWidth,m=i.padInfo.front,x=i.padInfo.top,g=i.padInfo.left,v=o==="max"?Number.NEGATIVE_INFINITY:Number.POSITIVE_INFINITY,b=Xt(i.outShape,e),y=b.values,_=i.outShape[1]*i.outShape[2]*i.outShape[3]*i.outShape[4],S=i.outShape[2]*i.outShape[3]*i.outShape[4],E=i.outShape[3]*i.outShape[4],M=i.outShape[4];for(let P=0;P<i.batchSize;++P){let D=P*_,w=P*r[0];for(let I=0;I<i.inChannels;++I)for(let N=0;N<i.outDepth;++N){let L=N*s-m,O=L;for(;O<0;)O+=c;let z=Math.min(i.inDepth,p+L),V=D+N*S;for(let $=0;$<i.outHeight;++$){let X=$*a-x,W=X;for(;W<0;)W+=u;let K=Math.min(i.inHeight,d+X),Z=V+$*E;for(let Y=0;Y<i.outWidth;++Y){let tt=Y*l-g,q=tt;for(;q<0;)q+=h;let et=Math.min(i.inWidth,f+tt),rt=Z+Y*M,at=v,nt=0,wt=0;for(let it=O;it<z;it+=c){let yt=w+it*r[1];for(let ct=W;ct<K;ct+=u){let bt=yt+ct*r[2];for(let gt=q;gt<et;gt+=h){let Rt=bt+gt*r[3],Lt=n[Rt+I];if(o==="max"&&Lt>at?at=Lt:o==="avg"&&(nt+=Lt,wt++),isNaN(at))break}if(isNaN(at))break}if(isNaN(at))break}let vt=rt+I;y[vt]=o==="avg"?nt/wt:at}}}}return b}function tk(n,t){let e=Xt(t.outShape,"int32"),r=t.strideDepth,i=t.strideHeight,o=t.strideWidth,s=t.dilationDepth,a=t.dilationHeight,l=t.dilationWidth,c=t.effectiveFilterDepth,u=t.effectiveFilterHeight,h=t.effectiveFilterWidth,p=t.padInfo.front,d=t.padInfo.top,f=t.padInfo.left;for(let m=0;m<t.batchSize;++m)for(let x=0;x<t.inChannels;++x)for(let g=0;g<t.outDepth;++g){let v=g*r-p,b=v;for(;b<0;)b+=s;let y=Math.min(t.inDepth,c+v);for(let _=0;_<t.outHeight;++_){let S=_*i-d,E=S;for(;E<0;)E+=a;let M=Math.min(t.inHeight,u+S);for(let P=0;P<t.outWidth;++P){let D=P*o-f,w=D;for(;w<0;)w+=l;let I=Math.min(t.inWidth,h+D),N=Number.NEGATIVE_INFINITY,L=-1;for(let O=b;O<y;O+=s){let z=O-v;for(let V=E;V<M;V+=a){let $=V-S;for(let X=w;X<I;X+=l){let W=X-D,K=n.get(m,O,V,X,x);K>=N&&(N=K,L=z*u*h+$*u+W)}}}e.set(L,m,g,_,P,x)}}}return e}function Vj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t;ut(i,"avgPool");let{filterSize:o,strides:s,pad:a,dimRoundingMode:l}=r,c=1;R.assert(F.eitherStridesOrDilationsAreOne(s,c),()=>`Error in avgPool: Either strides or dilations must be 1. Got strides ${s} and dilations '${c}'`);let u=F.computePool2DInfo(i.shape,o,s,c,a,l),h;if(u.filterWidth===1&&u.filterHeight===1&&R.arraysEqual(u.inShape,u.outShape))h=Rn({inputs:{x:i},backend:e});else{let p=e.data.get(i.dataId).values,d=R.computeStrides(i.shape),f=Kl(p,i.shape,i.dtype,d,u,"avg");h=e.makeTensorInfo(u.outShape,i.dtype,f.values)}return h}var ek={kernelName:Mm,backendName:"cpu",kernelFunc:Vj};function Hj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{filterSize:o,strides:s,pad:a,dimRoundingMode:l,dataFormat:c}=r;ut(i,"avgPool3d");let u=F.computePool3DInfo(i.shape,o,s,1,a,l,c),h=e.data.get(i.dataId).values,p=C1(h,i.shape,i.dtype,R.computeStrides(i.shape),u,"avg");return e.makeTensorInfo(p.shape,"float32",p.values)}var nk={kernelName:Tm,backendName:"cpu",kernelFunc:Hj};function $j(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,input:o}=t,{filterSize:s,strides:a,pad:l,dimRoundingMode:c}=r;ut([i,o],"avgPool3DGrad");let u=F.computePool3DInfo(o.shape,s,a,1,l,c),h=u.strideDepth,p=u.strideHeight,d=u.strideWidth,f=u.filterDepth,m=u.filterHeight,x=u.filterWidth,g=u.dilationDepth,v=u.dilationHeight,b=u.dilationWidth,y=u.effectiveFilterDepth,_=u.effectiveFilterHeight,S=u.effectiveFilterWidth,E=y-1-u.padInfo.front,M=S-1-u.padInfo.left,P=_-1-u.padInfo.top,D=Xt(o.shape,"float32"),w=1/(f*m*x),I=e.bufferSync(i);for(let N=0;N<u.batchSize;++N)for(let L=0;L<u.inChannels;++L)for(let O=0;O<u.inDepth;++O)for(let z=0;z<u.inHeight;++z)for(let V=0;V<u.inWidth;++V){let $=O-E,X=z-P,W=V-M,K=0;for(let Z=0;Z<y;Z+=g){let Y=($+Z)/h;if(!(Y<0||Y>=u.outDepth||Math.floor(Y)!==Y))for(let tt=0;tt<_;tt+=v){let q=(X+tt)/p;if(!(q<0||q>=u.outHeight||Math.floor(q)!==q))for(let et=0;et<S;et+=b){let rt=(W+et)/d;if(rt<0||rt>=u.outWidth||Math.floor(rt)!==rt)continue;K+=I.get(N,Y,q,rt,L)}}}D.set(K*w,N,O,z,V,L)}return e.makeTensorInfo(D.shape,D.dtype,D.values)}var rk={kernelName:Am,backendName:"cpu",kernelFunc:$j};function Uj(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,input:o}=t,s=o;ut([i,o],"avgPoolGrad");let{filterSize:a,strides:l,pad:c}=r,u=F.computePool2DInfo(s.shape,a,l,1,c),h=u.strideHeight,p=u.strideWidth,d=u.filterHeight,f=u.filterWidth,m=u.dilationHeight,x=u.dilationWidth,g=u.effectiveFilterHeight,v=u.effectiveFilterWidth,b=v-1-u.padInfo.left,y=g-1-u.padInfo.top,_=Xt(s.shape,"float32"),S=1/(d*f),E=e.data.get(i.dataId).values,M=Xt(i.shape,"float32",E);for(let P=0;P<u.batchSize;++P)for(let D=0;D<u.inChannels;++D)for(let w=0;w<u.inHeight;++w)for(let I=0;I<u.inWidth;++I){let N=w-y,L=I-b,O=0;for(let z=0;z<g;z+=m){let V=(N+z)/h;if(!(V<0||V>=u.outHeight||Math.floor(V)!==V))for(let $=0;$<v;$+=x){let X=(L+$)/p;if(X<0||X>=u.outWidth||Math.floor(X)!==X)continue;O+=M.get(P,V,X,D)}}_.set(O*S,P,w,I,D)}return e.makeTensorInfo(_.shape,_.dtype,_.values)}var ik={kernelName:Em,backendName:"cpu",kernelFunc:Uj};function Wj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,scale:o,offset:s,mean:a,variance:l}=t;R.assert(a.shape.length===l.shape.length,()=>"Batch normalization gradient requires mean and variance to have equal ranks."),R.assert(s==null||a.shape.length===s.shape.length,()=>"Batch normalization gradient requires mean and offset to have equal ranks."),R.assert(o==null||a.shape.length===o.shape.length,()=>"Batch normalization gradient requires mean and scale to have equal ranks."),ut([i,a,l,o,s],"batchNorm");let{varianceEpsilon:c}=r;c==null&&(c=.001);let u=e.data.get(i.dataId).values,h=e.data.get(a.dataId).values,p=e.data.get(l.dataId).values,d=o?e.data.get(o.dataId).values:new Float32Array([1]),f=s?e.data.get(s.dataId).values:new Float32Array([0]),m=new Float32Array(u.length),x=f.length,g=d.length,v=p.length,b=h.length,y=0,_=0,S=0,E=0;for(let M=0;M<u.length;++M)m[M]=f[y++]+(u[M]-h[_++])*d[S++]/Math.sqrt(p[E++]+c),y>=x&&(y=0),_>=b&&(_=0),S>=g&&(S=0),E>=v&&(E=0);return e.makeTensorInfo(i.shape,i.dtype,m)}var ok={kernelName:tg,backendName:"cpu",kernelFunc:Wj};function Gj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{blockShape:o,crops:s}=r;ut([i],"batchToSpaceND");let a=o.reduce((g,v)=>g*v),l=F.getReshaped(i.shape,o,a),c=F.getPermuted(l.length,o.length),u=F.getReshapedPermuted(i.shape,o,a),h=F.getSliceBeginCoords(s,o.length),p=F.getSliceSize(u,s,o.length),d=ce({inputs:{x:i},backend:e,attrs:{shape:l}}),f=Ve({inputs:{x:d},backend:e,attrs:{perm:c}}),m=ce({inputs:{x:f},backend:e,attrs:{shape:u}}),x=zr({inputs:{x:m},backend:e,attrs:{begin:h,size:p}});return e.disposeIntermediateTensorInfo(d),e.disposeIntermediateTensorInfo(f),e.disposeIntermediateTensorInfo(m),x}var sk={kernelName:Im,backendName:"cpu",kernelFunc:Gj};function jj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,weights:o}=t,{size:s}=r,a=e.data.get(i.dataId).values,l=e.data.get(o.dataId).values,c=jl(a,l,o.dtype,o.shape,s);return e.makeTensorInfo([s],o.dtype,c)}var ak={kernelName:km,backendName:"cpu",kernelFunc:jj};var qj=qt(fh,(n,t)=>{let e=t;return n>e.clipValueMax?e.clipValueMax:n<e.clipValueMin?e.clipValueMin:n}),lk={kernelName:fh,backendName:"cpu",kernelFunc:qj};var Xj=n=>{let{x:t}=n.inputs,e=n.backend,r=new Float32Array(R.sizeFromShape(t.shape)),i=e.data.get(t.dataId),o=i.complexTensorInfos.real,s=i.complexTensorInfos.imag,a=e.data.get(o.dataId).values,l=e.data.get(s.dataId).values;for(let c=0;c<a.length;c++){let u=a[c],h=l[c];r[c]=Math.hypot(u,h)}return e.makeOutput(r,t.shape,"float32")},ck={kernelName:Rm,backendName:"cpu",kernelFunc:Xj};function Mi(n){let{inputs:t,backend:e}=n,{input:r}=t,i=e.data.get(r.dataId).complexTensorInfos.imag,o=e.data.get(i.dataId).values;return e.makeTensorInfo(i.shape,i.dtype,o)}var uk={kernelName:ig,backendName:"cpu",kernelFunc:Mi};function Bo(n){let{inputs:t,backend:e,attrs:r}=n,{axis:i}=r,o=R.parseAxisParam(i,t[0].shape)[0],s=F.computeOutShape(t.map(m=>m.shape),o);if(R.sizeFromShape(s)===0)return e.makeTensorInfo(s,t[0].dtype,[]);let a=t.filter(m=>R.sizeFromShape(m.shape)>0);if(a.length===1)return Rn({inputs:{x:a[0]},backend:e});let l=a.map(m=>m.shape);if(F.assertParamsConsistent(l,o),a[0].dtype==="complex64"){let m=a.map(y=>Pr({inputs:{input:y},backend:e})),x=a.map(y=>Mi({inputs:{input:y},backend:e})),g=Bo({inputs:m,backend:e,attrs:{axis:o}}),v=Bo({inputs:x,backend:e,attrs:{axis:o}}),b=sn({inputs:{real:g,imag:v},backend:e});return m.forEach(y=>e.disposeIntermediateTensorInfo(y)),x.forEach(y=>e.disposeIntermediateTensorInfo(y)),e.disposeIntermediateTensorInfo(g),e.disposeIntermediateTensorInfo(v),b}let c=a.map(m=>{let x=R.sizeFromShape(m.shape.slice(o));return ce({inputs:{x:m},backend:e,attrs:{shape:[-1,x]}})}),u=c.map(m=>({vals:e.data.get(m.dataId).values,shape:m.shape}));s=F.computeOutShape(c.map(m=>m.shape),1);let h=c[0].shape[0]===1,p=f1(u,s,t[0].dtype,h),d=F.computeOutShape(a.map(m=>m.shape),o),f=e.makeTensorInfo(d,t[0].dtype,p);return c.forEach(m=>e.disposeIntermediateTensorInfo(m)),f}var hk={kernelName:Pm,backendName:"cpu",kernelFunc:Bo};function $_(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,filter:o}=t,{strides:s,pad:a,dataFormat:l,dilations:c,dimRoundingMode:u}=r;ut([i,o],"conv2d");let h=F.convertConv2DDataFormat(l),p=F.computeConv2DInfo(i.shape,o.shape,s,c,a,u,!1,h),d=p.filterHeight,f=p.filterWidth,m=p.dilationHeight,x=p.dilationWidth,g=p.padInfo.left,v=p.padInfo.top,b=p.dataFormat==="channelsLast",y=new Ce(p.outShape,i.dtype),_=R.computeStrides(i.shape),S=R.computeStrides(o.shape),E=_[0],M=b?_[1]:_[2],P=b?_[2]:1,D=b?1:_[1],w=y.strides[0],I=b?y.strides[1]:y.strides[2],N=b?y.strides[2]:1,L=b?1:y.strides[1],O=e.data.get(i.dataId).values,z=e.data.get(o.dataId).values,V=y.values;for(let $=0;$<p.batchSize;++$){let X=$*E,W=$*w;for(let K=0;K<p.outHeight;++K){let Z=W+K*I,Y=K*p.strideHeight-v;for(let tt=0;tt<d;++tt){let q=Y+tt*m;if(q<0||q>=p.inHeight)continue;let et=tt*S[0],rt=X+q*M;for(let at=0;at<p.outWidth;++at){let nt=Z+at*N,wt=at*p.strideWidth-g;for(let vt=0;vt<f;++vt){let it=wt+vt*x;if(it<0||it>=p.inWidth)continue;let yt=et+vt*S[1],ct=rt+it*P,bt=yt;for(let gt=0;gt<p.inChannels;++gt){let Rt=O[ct+gt*D];for(let Lt=0;Lt<p.outChannels;++Lt)V[nt+Lt*L]+=Rt*z[bt+Lt];bt+=p.outChannels}}}}}}return e.makeTensorInfo(y.shape,y.dtype,V)}var pk={kernelName:Nm,backendName:"cpu",kernelFunc:$_};function Kj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,dy:o}=t,{strides:s,pad:a,dataFormat:l,dimRoundingMode:c,filterShape:u}=r;ut([i,o],"conv2dBackpropFilter");let h=F.convertConv2DDataFormat(l),p=F.computeConv2DInfo(i.shape,u,s,1,a,c,!1,h),{strideHeight:d,strideWidth:f,filterHeight:m,filterWidth:x}=p,g=p.dataFormat==="channelsLast",v=new Ce(p.filterShape,"float32"),b=p.padInfo.left,y=p.padInfo.top,_=e.data.get(i.dataId).values,S=e.data.get(o.dataId).values,E=new Ce(i.shape,i.dtype,_),M=new Ce(o.shape,o.dtype,S);for(let P=0;P<m;++P){let D=Math.max(0,Math.ceil((y-P)/d)),w=Math.min(p.outHeight,(p.inHeight+y-P)/d);for(let I=0;I<x;++I){let N=Math.max(0,Math.ceil((b-I)/f)),L=Math.min(p.outWidth,(p.inWidth+b-I)/f);for(let O=0;O<p.inChannels;++O)for(let z=0;z<p.outChannels;++z){let V=0;for(let $=0;$<p.batchSize;++$)for(let X=D;X<w;++X){let W=P+X*d-y;for(let K=N;K<L;++K){let Z=I+K*f-b;g?V+=E.get($,W,Z,O)*M.get($,X,K,z):V+=E.get($,O,W,Z)*M.get($,z,X,K)}}v.set(V,P,I,O,z)}}}return e.makeTensorInfo(v.shape,v.dtype,v.values)}var dk={kernelName:Lm,backendName:"cpu",kernelFunc:Kj};function Yj(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,filter:o}=t,{inputShape:s,strides:a,pad:l,dataFormat:c,dimRoundingMode:u}=r;ut([i,o],"conv2dBackpropInput");let h=R.computeStrides(o.shape),p=R.computeStrides(i.shape),d=F.convertConv2DDataFormat(c),f=F.computeConv2DInfo(s,o.shape,a,1,l,u,!1,d),m=new Ce(f.inShape,"float32"),x=m.values,g=e.data.get(i.dataId).values,v=e.data.get(o.dataId).values,[b,y,_]=h,{batchSize:S,filterHeight:E,filterWidth:M,inChannels:P,inHeight:D,inWidth:w,outChannels:I,outHeight:N,outWidth:L,strideHeight:O,strideWidth:z}=f;d=f.dataFormat;let V=E-1-f.padInfo.top,$=M-1-f.padInfo.left,X=d==="channelsLast",W=m.strides[0],K=X?m.strides[1]:m.strides[2],Z=X?m.strides[2]:1,Y=X?1:m.strides[1],tt=p[0],q=X?p[1]:p[2],et=X?p[2]:1,rt=X?1:p[1];for(let at=0;at<S;++at)for(let nt=0;nt<P;++nt)for(let wt=0;wt<D;++wt){let vt=wt-V,it=Math.max(0,Math.ceil(vt/O)),yt=Math.min(N,(E+vt)/O);for(let ct=0;ct<w;++ct){let bt=ct-$,gt=Math.max(0,Math.ceil(bt/z)),Rt=Math.min(L,(M+bt)/z),Lt=0;for(let Zt=it;Zt<yt;++Zt){let re=Zt*O-vt;for(let G=gt;G<Rt;++G){let H=G*z-bt,ht=tt*at+q*Zt+et*G,kt=b*(E-1-re)+y*(M-1-H)+_*nt;for(let Bt=0;Bt<I;++Bt){let ft=g[ht+rt*Bt],Ht=v[kt+Bt];Lt+=ft*Ht}}}let Yt=W*at+K*wt+Z*ct+Y*nt;x[Yt]=Lt}}return e.makeTensorInfo(m.shape,m.dtype,m.values)}var fk={kernelName:Dm,backendName:"cpu",kernelFunc:Yj};function Zj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,filter:o}=t,{strides:s,pad:a,dilations:l}=r;ut([i,o],"conv3d");let c=F.computeConv3DInfo(i.shape,o.shape,s,l,a),{filterDepth:u,filterHeight:h,filterWidth:p,dilationDepth:d,dilationHeight:f,dilationWidth:m,padInfo:x}=c,g=x.front,v=x.left,b=x.top,y=new Ce(c.outShape,i.dtype),_=e.data.get(i.dataId).values,S=e.data.get(o.dataId).values,E=y.values,M=R.computeStrides(i.shape),P=R.computeStrides(o.shape);for(let D=0;D<c.batchSize;++D){let w=D*M[0],I=D*y.strides[0];for(let N=0;N<c.outDepth;++N){let L=I+N*y.strides[1],O=N*c.strideDepth-g;for(let z=0;z<u;++z){let V=O+z*d;if(V<0||V>=c.inDepth)continue;let $=z*P[0],X=w+V*M[1];for(let W=0;W<c.outHeight;++W){let K=L+W*y.strides[2],Z=W*c.strideHeight-b;for(let Y=0;Y<h;++Y){let tt=Z+Y*f;if(tt<0||tt>=c.inHeight)continue;let q=$+Y*P[1],et=X+tt*M[2];for(let rt=0;rt<c.outWidth;++rt){let at=K+rt*c.outChannels,nt=rt*c.strideWidth-v;for(let wt=0;wt<p;++wt){let vt=nt+wt*m;if(vt<0||vt>=c.inWidth)continue;let it=q+wt*P[2],yt=et+vt*c.inChannels,ct=it;for(let bt=0;bt<c.inChannels;++bt){let gt=_[yt+bt];for(let Rt=0;Rt<c.outChannels;++Rt)E[at+Rt]+=gt*S[ct+Rt];ct+=c.outChannels}}}}}}}}return e.makeTensorInfo(y.shape,y.dtype,y.values)}var mk={kernelName:zm,backendName:"cpu",kernelFunc:Zj};function Jj(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,dy:o}=t,{strides:s,pad:a,filterShape:l}=r;ut([i,o],"conv3dBackpropFilterV2");let c=R.computeStrides(i.shape),u=R.computeStrides(o.shape),h=F.computeConv3DInfo(i.shape,l,s,1,a),p=h.strideDepth,d=h.strideHeight,f=h.strideWidth,m=h.filterDepth,x=h.filterHeight,g=h.filterWidth,v=new Ce(h.filterShape,"float32"),b=v.values,[y,_,S,E]=v.strides,M=e.data.get(o.dataId).values,[P,D,w,I]=u,N=e.data.get(i.dataId).values,[L,O,z,V]=c,$=h.padInfo.front,X=h.padInfo.left,W=h.padInfo.top;for(let K=0;K<m;++K){let Z=Math.max(0,Math.ceil(($-K)/p)),Y=Math.min(h.outDepth,(h.inDepth+$-K)/p),tt=K*y;for(let q=0;q<x;++q){let et=Math.max(0,Math.ceil((W-q)/d)),rt=Math.min(h.outHeight,(h.inHeight+W-q)/d),at=q*_+tt;for(let nt=0;nt<g;++nt){let wt=Math.max(0,Math.ceil((X-nt)/f)),vt=Math.min(h.outWidth,(h.inWidth+X-nt)/f),it=nt*S+at;for(let yt=0;yt<h.inChannels;++yt){let ct=yt*E+it;for(let bt=0;bt<h.outChannels;++bt){let gt=0;for(let Rt=0;Rt<h.batchSize;++Rt){let Lt=Rt*L,Yt=Rt*P;for(let Zt=Z;Zt<Y;++Zt){let G=(K+Zt*p-$)*O+Lt,H=Zt*D+Yt;for(let ht=et;ht<rt;++ht){let Bt=(q+ht*d-W)*z+G,ft=ht*w+H;for(let Ht=wt;Ht<vt;++Ht){let mt=(nt+Ht*f-X)*V+Bt,It=Ht*I+ft;gt+=N[mt+yt]*M[It+bt]}}}}b[ct+bt]=gt}}}}}return e.makeTensorInfo(v.shape,v.dtype,v.values)}var gk={kernelName:Fm,backendName:"cpu",kernelFunc:Jj};function Qj(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,filter:o}=t,{pad:s,strides:a,inputShape:l}=r;ut([i],"conv3dBackpropInputV2");let c=R.computeStrides(i.shape),u=R.computeStrides(o.shape),h=F.computeConv3DInfo(l,o.shape,a,1,s),p=new Ce(h.inShape,"float32"),d=p.values,[f,m,x,g]=p.strides,v=e.data.get(i.dataId).values,[b,y,_,S]=c,E=e.data.get(o.dataId).values,[M,P,D,w]=u,{batchSize:I,filterDepth:N,filterHeight:L,filterWidth:O,inChannels:z,inDepth:V,inHeight:$,inWidth:X,outChannels:W,outDepth:K,outHeight:Z,outWidth:Y,strideDepth:tt,strideHeight:q,strideWidth:et}=h,rt=N-1-h.padInfo.front,at=L-1-h.padInfo.top,nt=O-1-h.padInfo.left;for(let wt=0;wt<I;++wt)for(let vt=0;vt<z;++vt)for(let it=0;it<V;++it){let yt=it-rt,ct=Math.max(0,Math.ceil(yt/tt)),bt=Math.min(K,(N+yt)/tt);for(let gt=0;gt<$;++gt){let Rt=gt-at,Lt=Math.max(0,Math.ceil(Rt/q)),Yt=Math.min(Z,(L+Rt)/q);for(let Zt=0;Zt<X;++Zt){let re=Zt-nt,G=Math.max(0,Math.ceil(re/et)),H=Math.min(Y,(O+re)/et),ht=0;for(let kt=ct;kt<bt;++kt){let Bt=kt*tt-yt;for(let ft=Lt;ft<Yt;++ft){let Ht=ft*q-Rt;for(let J=G;J<H;++J){let mt=J*et-re,It=b*wt+y*kt+_*ft+S*J,Wt=M*(N-1-Bt)+P*(L-1-Ht)+D*(O-1-mt)+w*vt;for(let Q=0;Q<W;++Q){let Vt=v[It+Q],zt=E[Wt+Q];ht+=Vt*zt}}}}d[f*wt+m*it+x*gt+g*Zt+vt]=ht}}}return e.makeTensorInfo(p.shape,p.dtype,p.values)}var xk={kernelName:Om,backendName:"cpu",kernelFunc:Qj};var tq=qt(mh,n=>Math.cos(n)),vk={kernelName:mh,backendName:"cpu",kernelFunc:tq};var eq=qt(gh,n=>Math.cosh(n)),yk={kernelName:gh,backendName:"cpu",kernelFunc:eq};function nq(n){let{inputs:t,backend:e,attrs:r}=n,{image:i,boxes:o,boxInd:s}=t,{cropSize:a,method:l,extrapolationValue:c}=r,[u,h,p,d]=i.shape,f=o.shape[0],[m,x]=a,g=Xt([f,m,x,d],"float32"),v=e.data.get(o.dataId).values,b=e.data.get(s.dataId).values,y=e.data.get(i.dataId).values,_=R.computeStrides(i.shape),S=R.computeStrides(g.shape);for(let E=0;E<f;E++){let M=E*4,P=v[M],D=v[M+1],w=v[M+2],I=v[M+3],N=b[E];if(N>=u)continue;let L=m>1?(w-P)*(h-1)/(m-1):0,O=x>1?(I-D)*(p-1)/(x-1):0;for(let z=0;z<m;z++){let V=m>1?P*(h-1)+z*L:.5*(P+w)*(h-1);if(V<0||V>h-1){for(let $=0;$<x;$++)for(let X=0;X<d;X++){let W=X+$*S[2]+z*S[1]+E*S[0];g.values[W]=c}continue}if(l==="bilinear"){let $=Math.floor(V),X=Math.ceil(V),W=V-$;for(let K=0;K<x;K++){let Z=x>1?D*(p-1)+K*O:.5*(D+I)*(p-1);if(Z<0||Z>p-1){for(let et=0;et<d;et++){let rt=et+K*S[2]+z*S[1]+E*S[0];g.values[rt]=c}continue}let Y=Math.floor(Z),tt=Math.ceil(Z),q=Z-Y;for(let et=0;et<d;et++){let rt=et+Y*_[2]+$*_[1]+N*_[0],at=y[rt];rt=et+tt*_[2]+$*_[1]+N*_[0];let nt=y[rt];rt=et+Y*_[2]+X*_[1]+N*_[0];let wt=y[rt];rt=et+tt*_[2]+X*_[1]+N*_[0];let vt=y[rt],it=at+(nt-at)*q,yt=wt+(vt-wt)*q;rt=et+K*S[2]+z*S[1]+E*S[0],g.values[rt]=it+(yt-it)*W}}}else for(let $=0;$<x;++$){let X=x>1?D*(p-1)+$*O:.5*(D+I)*(p-1);if(X<0||X>p-1){for(let Z=0;Z<d;Z++){let Y=Z+$*S[2]+z*S[1]+E*S[0];g.values[Y]=c}continue}let W=Math.round(X),K=Math.round(V);for(let Z=0;Z<d;Z++){let Y=Z+W*_[2]+K*_[1]+N*_[0],tt=Z+$*S[2]+z*S[1]+E*S[0];g.values[tt]=y[Y]}}}}return e.makeTensorInfo(g.shape,g.dtype,g.values)}var bk={kernelName:Vm,backendName:"cpu",kernelFunc:nq};function rq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,exclusive:s,reverse:a}=r;ut(i,"cumsum");let l=F.getAxesPermutation([o],i.shape.length),c=i;l!=null&&(c=Ve({inputs:{x:i},backend:e,attrs:{perm:l}}));let u=F.getInnerMostAxes(1,i.shape.length)[0];if(u!==c.shape.length-1)throw new Error(`backend.cumsum in CPU expects an inner-most axis=${c.shape.length-1} but got axis=${u}`);let h=on(c.dtype,"int32"),p=R.makeZerosTypedArray(R.sizeFromShape(c.shape),h),d=e.data.get(c.dataId).values,f=c.shape[c.shape.length-1],m=a?(g,v)=>g+f-v-1:(g,v)=>g+v;for(let g=0;g<d.length;g+=f)for(let v=0;v<f;v++){let b=m(g,v);if(v===0)p[b]=s?0:d[b];else{let y=m(g,v-1);p[b]=s?d[y]+p[y]:d[b]+p[y]}}let x=e.makeTensorInfo(c.shape,h,p);if(l!=null){let g=F.getUndoAxesPermutation(l),v=Ve({inputs:{x},backend:e,attrs:{perm:g}});return e.disposeIntermediateTensorInfo(x),e.disposeIntermediateTensorInfo(c),v}return x}var _k={kernelName:Bm,backendName:"cpu",kernelFunc:rq};function iq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,weights:o}=t,{size:s,binaryOutput:a}=r;if(i.shape.length===1){let l=e.data.get(i.dataId).values,c=e.data.get(o.dataId).values,u=jl(l,c,o.dtype,o.shape,s);return e.makeTensorInfo([s],o.dtype,u)}else if(i.shape.length===2){let l=e.bufferSync(i),c=e.bufferSync(o),u=d1(l,c,s,a);return e.makeTensorInfo(u.shape,o.dtype,u.values)}throw new Error(`Error in denseBincount: input must be at most rank 2, but got rank${i.shape.length}.`)}var wk={kernelName:Hm,backendName:"cpu",kernelFunc:iq};function oq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{blockSize:o,dataFormat:s}=r;R.assert(s==="NHWC",()=>`Only NHWC dataFormat supported on CPU for depthToSpace. Got ${s}`),R.assert(o>1,()=>`blockSize should be > 1 for depthToSpace, but was: ${o}`);let a=i.shape[0],l=i.shape[1],c=i.shape[2],u=i.shape[3],h=l*o,p=c*o,d=u/(o*o),f=e.data.get(i.dataId).values,m=new Float32Array(a*h*p*d),x=0;for(let g=0;g<a;++g)for(let v=0;v<h;++v){let b=Math.floor(v/o),y=v%o;for(let _=0;_<p;++_){let S=Math.floor(_/o),E=_%o,M=(y*o+E)*d;for(let P=0;P<d;++P){let w=P+M+u*(S+c*(b+l*g));m[x++]=f[w]}}}return e.makeTensorInfo([a,h,p,d],i.dtype,m)}var Sk={kernelName:$m,backendName:"cpu",kernelFunc:oq};function U_(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,filter:o}=t,{strides:s,pad:a,dilations:l,dimRoundingMode:c}=r;ut([i,o],"depthwiseConv2DNative");let u=R.computeStrides(i.shape),h=R.computeStrides(o.shape),p=l;p==null&&(p=[1,1]),R.assert(F.eitherStridesOrDilationsAreOne(s,p),()=>`Error in depthwiseConv2d: Either strides or dilations must be 1. Got strides ${s} and dilations '${p}'`);let d=F.computeConv2DInfo(i.shape,o.shape,s,p,a,c,!0),{filterHeight:f,filterWidth:m,dilationHeight:x,dilationWidth:g,padInfo:v}=d,b=v.left,y=v.top,_=d.outChannels/d.inChannels,S=new Ce(d.outShape,i.dtype),E=e.data.get(i.dataId).values,M=e.data.get(o.dataId).values,P=S.values;for(let D=0;D<d.batchSize;++D){let w=D*u[0],I=D*S.strides[0];for(let N=0;N<d.outHeight;++N){let L=I+N*S.strides[1],O=N*d.strideHeight-b;for(let z=0;z<f;++z){let V=O+z*x;if(V<0||V>=d.inHeight)continue;let $=z*h[0],X=w+V*u[1];for(let W=0;W<d.outWidth;++W){let K=L+W*S.strides[2],Z=W*d.strideWidth-y;for(let Y=0;Y<m;++Y){let tt=Z+Y*g;if(tt<0||tt>=d.inWidth)continue;let q=$+Y*h[1],et=X+tt*d.inChannels,rt=K,at=q;for(let nt=0;nt<d.inChannels;++nt){let wt=E[et+nt];for(let vt=0;vt<_;++vt)P[rt+vt]+=wt*M[at+vt];rt+=_,at+=_}}}}}}return e.makeTensorInfo(S.shape,S.dtype,S.values)}var Ck={kernelName:Um,backendName:"cpu",kernelFunc:U_};function sq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,dy:o}=t,{strides:s,dilations:a,pad:l,dimRoundingMode:c,filterShape:u}=r;ut([i,o],"depthwiseConv2dNativeBackpropFilter");let h=F.computeConv2DInfo(i.shape,u,s,a,l,c,!0),{strideHeight:p,strideWidth:d,filterHeight:f,filterWidth:m}=h,x=new Ce(h.filterShape,"float32"),g=h.padInfo.left,v=h.padInfo.top,b=h.outChannels/h.inChannels,y=e.data.get(i.dataId).values,_=new Ce(i.shape,i.dtype,y),S=e.data.get(o.dataId).values,E=new Ce(o.shape,o.dtype,S);for(let M=0;M<f;++M){let P=Math.max(0,Math.ceil((v-M)/p)),D=Math.min(h.outHeight,(h.inHeight+v-M)/p);for(let w=0;w<m;++w){let I=Math.max(0,Math.ceil((g-w)/d)),N=Math.min(h.outWidth,(h.inWidth+g-w)/d);for(let L=0;L<h.outChannels;++L){let O=Math.trunc(L/b),z=L%b,V=0;for(let $=0;$<h.batchSize;++$)for(let X=P;X<D;++X){let W=M+X*p-v;for(let K=I;K<N;++K){let Z=w+K*d-g;V+=_.get($,W,Z,O)*E.get($,X,K,L)}}x.set(V,M,w,O,z)}}}return e.makeTensorInfo(x.shape,x.dtype,x.values)}var Mk={kernelName:Wm,backendName:"cpu",kernelFunc:sq};function aq(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,filter:o}=t,{strides:s,dilations:a,pad:l,dimRoundingMode:c,inputShape:u}=r;ut([i,o],"depthwiseConv2DNativeBackpropInput");let h=R.computeStrides(i.shape),p=R.computeStrides(o.shape),d=F.computeConv2DInfo(u,o.shape,s,a,l,c,!0),f=new Ce(d.inShape,"float32"),m=f.values,[x,g,v]=f.strides,b=e.data.get(i.dataId).values,[y,_,S]=h,E=e.data.get(o.dataId).values,[M,P,D]=p,{batchSize:w,filterHeight:I,filterWidth:N,inChannels:L,inHeight:O,inWidth:z,outChannels:V,outHeight:$,outWidth:X,strideHeight:W,strideWidth:K}=d,Z=I-1-d.padInfo.top,Y=N-1-d.padInfo.left,tt=V/L;for(let q=0;q<w;++q)for(let et=0;et<L;++et)for(let rt=0;rt<O;++rt){let at=rt-Z,nt=Math.max(0,Math.ceil(at/W)),wt=Math.min($,(I+at)/W);for(let vt=0;vt<z;++vt){let it=vt-Y,yt=Math.max(0,Math.ceil(it/K)),ct=Math.min(X,(N+it)/K),bt=0;for(let gt=nt;gt<wt;++gt){let Rt=gt*W-at;for(let Lt=yt;Lt<ct;++Lt){let Yt=Lt*K-it,Zt=y*q+_*gt+S*Lt,re=M*(I-1-Rt)+P*(N-1-Yt)+D*et;for(let G=0;G<tt;++G){let H=et*tt+G,ht=b[Zt+H],kt=E[re+G];bt+=ht*kt}}}m[x*q+g*rt+v*vt+et]=bt}}return e.makeTensorInfo(f.shape,f.dtype,f.values)}var Ek={kernelName:Gm,backendName:"cpu",kernelFunc:aq};function lq(n){let{inputs:t,backend:e}=n,{x:r}=t,i=R.sizeFromShape(r.shape),o=e.data.get(r.dataId).values,s=Xt([i,i],r.dtype),a=s.values;for(let c=0;c<o.length;c++)a[c*i+c]=o[c];let l=[...r.shape,...r.shape];return e.makeTensorInfo(l,s.dtype,s.values)}var Tk={kernelName:jm,backendName:"cpu",kernelFunc:lq};var Ak={kernelName:qm,backendName:"cpu",kernelFunc:({inputs:n,backend:t,attrs:e})=>{let{x:r,filter:i}=n,{strides:o,pad:s,dilations:a}=e,l=t,c=l.data.get(r.dataId).values,u=r.shape.length,h=l.data.get(i.dataId).values,p=i.shape.length,{batchSize:d,inHeight:f,inWidth:m,inChannels:x,outHeight:g,outWidth:v,padInfo:b,strideHeight:y,strideWidth:_,filterHeight:S,filterWidth:E,dilationHeight:M,dilationWidth:P,outShape:D}=F.computeDilation2DInfo(r.shape,i.shape,o,s,"NHWC",a),w=R.sizeFromShape(D),I=D.length,N=R.getArrayFromDType(r.dtype,w);for(let O=0;O<d;++O)for(let z=0;z<g;++z){let V=z*y-b.top;for(let $=0;$<v;++$){let X=$*_-b.left;for(let W=0;W<x;++W){let K=Number.MIN_SAFE_INTEGER;for(let Y=0;Y<S;++Y){let tt=V+Y*M;if(tt>=0&&tt<f)for(let q=0;q<E;++q){let et=X+q*P;if(et>=0&&et<m){let rt=R.locToIndex([O,tt,et,W],u,R.computeStrides(r.shape)),at=R.locToIndex([Y,q,W],p,R.computeStrides(i.shape)),nt=c[rt]+h[at];nt>K&&(K=nt)}}}let Z=R.locToIndex([O,z,$,W],I,R.computeStrides(D));N[Z]=K}}}return{dataId:l.write(R.toTypedArray(N,r.dtype),D,r.dtype),shape:D,dtype:r.dtype}}};var Ik={kernelName:Mb,backendName:"cpu",kernelFunc:({inputs:n,backend:t,attrs:e})=>{let{x:r,filter:i,dy:o}=n,{strides:s,pad:a,dilations:l}=e,c=t,u=R.toNestedArray(r.shape,c.data.get(r.dataId).values),h=R.toNestedArray(i.shape,c.data.get(i.dataId).values),{batchSize:p,inHeight:d,inWidth:f,inChannels:m,outHeight:x,outWidth:g,padInfo:v,strideHeight:b,strideWidth:y,filterHeight:_,filterWidth:S,dilationHeight:E,dilationWidth:M,outShape:P}=F.computeDilation2DInfo(r.shape,i.shape,s,a,"NHWC",l);R.assert(o.rank===P.length,()=>`Error in ${Mb}, dy must have the same rank as output ${P.length}, but got ${o.rank}`);let D=R.toNestedArray(P,c.data.get(o.dataId).values),w=R.makeZerosNestedTypedArray(i.shape,i.dtype);for(let N=0;N<p;++N)for(let L=0;L<x;++L){let O=L*b-v.top;for(let z=0;z<g;++z){let V=z*y-v.left;for(let $=0;$<m;++$){let X=Number.MIN_SAFE_INTEGER,W=0,K=0;for(let Z=0;Z<_;++Z){let Y=O+Z*E;if(Y>=0&&Y<d)for(let tt=0;tt<S;++tt){let q=V+tt*M;if(q>=0&&q<f){let et=u[N][Y][q][$]+h[Z][tt][$];et>X&&(X=et,W=Z,K=tt)}}}w[W][K][$]+=D[N][L][z][$]}}}return{dataId:c.write(R.toTypedArray(w,r.dtype),i.shape,i.dtype),shape:i.shape,dtype:i.dtype}}};var kk={kernelName:Cb,backendName:"cpu",kernelFunc:({inputs:n,backend:t,attrs:e})=>{let{x:r,filter:i,dy:o}=n,{strides:s,pad:a,dilations:l}=e,c=t,u=R.toNestedArray(r.shape,c.data.get(r.dataId).values),h=R.toNestedArray(i.shape,c.data.get(i.dataId).values),{batchSize:p,inHeight:d,inWidth:f,inChannels:m,outHeight:x,outWidth:g,padInfo:v,strideHeight:b,strideWidth:y,filterHeight:_,filterWidth:S,dilationHeight:E,dilationWidth:M,outShape:P}=F.computeDilation2DInfo(r.shape,i.shape,s,a,"NHWC",l);R.assert(o.rank===P.length,()=>`Error in ${Cb}, dy must have the same rank as output ${P.length}, but got ${o.rank}`);let D=R.toNestedArray(P,c.data.get(o.dataId).values),w=R.makeZerosNestedTypedArray(r.shape,r.dtype);for(let N=0;N<p;++N)for(let L=0;L<x;++L){let O=L*b-v.top;for(let z=0;z<g;++z){let V=z*y-v.left;for(let $=0;$<m;++$){let X=Number.MIN_SAFE_INTEGER,W=O<0?0:O,K=V<0?0:V;for(let Z=0;Z<_;++Z){let Y=O+Z*E;if(Y>=0&&Y<d)for(let tt=0;tt<S;++tt){let q=V+tt*M;if(q>=0&&q<f){let et=u[N][Y][q][$]+h[Z][tt][$];et>X&&(X=et,W=Y,K=q)}}}w[N][W][K][$]+=D[N][L][z][$]}}}return{dataId:c.write(R.toTypedArray(w,r.dtype),r.shape,r.dtype),shape:r.shape,dtype:r.dtype}}};function oo(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r;ut(i,"sum");let a;i.dtype==="bool"?a=Nr({inputs:{x:i},backend:e,attrs:{dtype:"int32"}}):a=Rn({inputs:{x:i},backend:e});let l=a.shape.length,c=R.parseAxisParam(o,a.shape),u=F.getAxesPermutation(c,l),h=c,p=a;u!=null&&(p=Ve({inputs:{x:a},backend:e,attrs:{perm:u}}),h=F.getInnerMostAxes(h.length,l)),F.assertAxesAreInnerMostDims("sum",h,p.shape.length);let[d,f]=F.computeOutAndReduceShapes(p.shape,h),m=F.upcastType(p.dtype,"int32"),x=Wl(e,d,m),g=R.sizeFromShape(f),v=e.data.get(x.dataId).values,b=e.data.get(p.dataId).values;for(let y=0;y<v.length;++y){let _=y*g,S=0;for(let E=0;E<g;++E)S+=b[_+E];v[y]=S}if(s){let y=F.expandShapeToKeepDim(x.shape,c),_=x;x=ce({inputs:{x},backend:e,attrs:{shape:y}}),e.disposeIntermediateTensorInfo(_)}return e.disposeIntermediateTensorInfo(a),u!=null&&e.disposeIntermediateTensorInfo(p),x}var Rk={kernelName:Ll,backendName:"cpu",kernelFunc:oo};function cq(n){let{inputs:t,backend:e,attrs:r}=n,{equation:i}=r,o=t,{allDims:s,summedDims:a,idDims:l}=F.decodeEinsumEquation(i,o.length);F.checkEinsumDimSizes(s.length,l,o);let{path:c,steps:u}=F.getEinsumComputePath(a,l),h=u.length,p=null,d=s.length,f=[];for(let m=0;m<h;++m){for(let x of u[m]){let{permutationIndices:g,expandDims:v}=F.getEinsumPermutation(d,l[x]),b;F.isIdentityPermutation(g)?b=o[x]:(b=Ve({inputs:{x:o[x]},backend:e,attrs:{perm:g}}),f.push(b));let y=b.shape.slice();for(let _=0;_<v.length;++_)y.splice(v[_],0,1);R.arraysEqual(b.shape,y)||(b=ce({inputs:{x:b},backend:e,attrs:{shape:y}}),f.push(b)),p===null?p=b:(p=ra({inputs:{a:b,b:p},backend:e}),f.push(p))}m<h-1&&(c[m]>=0&&(p=oo({inputs:{x:p},backend:e,attrs:{axis:c[m]-(s.length-d),keepDims:!1}}),f.push(p)),d--)}for(let m of f)m!==p&&e.disposeIntermediateTensorInfo(m);return p}var Pk={kernelName:Xm,backendName:"cpu",kernelFunc:cq};function uq(n){let{inputs:t,backend:e}=n,{dy:r,y:i}=t;ut([r,i],"eluGrad");let o=new Float32Array(R.sizeFromShape(i.shape)),s=e.data.get(i.dataId).values,a=e.data.get(r.dataId).values;for(let l=0;l<s.length;++l){let c=s[l];c>=1?o[l]=a[l]:o[l]=a[l]*(c+1)}return e.makeTensorInfo(i.shape,"float32",o)}var Nk={kernelName:Km,backendName:"cpu",kernelFunc:uq};var hq=le((n,t)=>n===t?1:0),W_=fe(yh,hq,null,"bool"),Lk={kernelName:yh,backendName:"cpu",kernelFunc:W_};var pq=F.ERF_P,dq=F.ERF_A1,fq=F.ERF_A2,mq=F.ERF_A3,gq=F.ERF_A4,xq=F.ERF_A5,vq=qt(vh,n=>{let t=Math.sign(n),e=Math.abs(n),r=1/(1+pq*e);return t*(1-((((xq*r+gq)*r+mq)*r+fq)*r+dq)*r*Math.exp(-e*e))}),Dk={kernelName:vh,backendName:"cpu",kernelFunc:vq};function Yl(n){let{inputs:t,backend:e,attrs:r}=n,{input:i}=t,{dim:o}=r,s=i.shape.length,a=i.shape.slice(),l=o;return o<0&&(R.assert(-(s+1)<=o,()=>`Axis must be in the interval [${-(s+1)}, ${s}]`),l=s+o+1),a.splice(l,0,1),ce({inputs:{x:i},backend:e,attrs:{shape:a}})}var zk={kernelName:Ym,backendName:"cpu",kernelFunc:Yl};var yq=le((n,t)=>n/t),ap=fe(xh,yq),lp={kernelName:xh,backendName:"cpu",kernelFunc:ap};function M1(n,t,e){let r=n.shape,i=r[0],o=r[1],s=e.data.get(n.dataId),a=s.complexTensorInfos.real,l=s.complexTensorInfos.imag,c=[i,o],u=R.sizeFromShape(c),h=R.getTypedArrayFromDType("float32",u),p=R.getTypedArrayFromDType("float32",u);for(let x=0;x<i;x++){let g=zr({inputs:{x:a},backend:e,attrs:{begin:[x,0],size:[1,o]}}),v=zr({inputs:{x:l},backend:e,attrs:{begin:[x,0],size:[1,o]}}),b=sn({inputs:{real:g,imag:v},backend:e}),{real:y,imag:_}=bq(b,t,e),S=F.mergeRealAndImagArrays(y,_);for(let E=0;E<o;E++){let M=F.getComplexWithIndex(S,E);h[x*o+E]=M.real,p[x*o+E]=M.imag}e.disposeIntermediateTensorInfo(g),e.disposeIntermediateTensorInfo(v),e.disposeIntermediateTensorInfo(b)}let d=e.makeTensorInfo(c,"float32",h),f=e.makeTensorInfo(c,"float32",p),m=sn({inputs:{real:d,imag:f},backend:e});return e.disposeIntermediateTensorInfo(d),e.disposeIntermediateTensorInfo(f),m}function bq(n,t,e){let r=R.sizeFromShape(n.shape),i=e.data.get(n.dataId),o=e.data.get(i.complexTensorInfos.real.dataId).values,s=e.data.get(i.complexTensorInfos.imag.dataId).values;if(_q(r)){let a=G_(o,s,r,t,e),l=[n.shape[0],n.shape[1]];if(t){let c=e.makeTensorInfo(l,"float32",a.real),u=e.makeTensorInfo(l,"float32",a.imag),h=e.makeTensorInfo([],"float32",R.createScalarValue(r,"float32")),p=Rn({inputs:{x:h},backend:e}),d=lp.kernelFunc({inputs:{a:c,b:h},backend:e}),f=lp.kernelFunc({inputs:{a:u,b:p},backend:e}),m=e.data.get(d.dataId).values,x=e.data.get(f.dataId).values;return e.disposeIntermediateTensorInfo(c),e.disposeIntermediateTensorInfo(u),e.disposeIntermediateTensorInfo(h),e.disposeIntermediateTensorInfo(p),e.disposeIntermediateTensorInfo(d),e.disposeIntermediateTensorInfo(f),{real:m,imag:x}}return a}else{let a=F.mergeRealAndImagArrays(o,s),l=wq(a,r,t);return F.splitRealAndImagArrays(l)}}function _q(n){return(n&n-1)===0}function G_(n,t,e,r,i){if(e===1)return{real:n,imag:t};let o=F.mergeRealAndImagArrays(n,t),s=e/2,a=F.complexWithEvenIndex(o),l=a.real,c=a.imag,u=[l.length],h=i.makeTensorInfo(u,"float32",l),p=i.makeTensorInfo(u,"float32",c),d=sn({inputs:{real:h,imag:p},backend:i}),f=F.complexWithOddIndex(o),m=f.real,x=f.imag,g=[m.length],v=i.makeTensorInfo(g,"float32",m),b=i.makeTensorInfo(g,"float32",x),y=sn({inputs:{real:v,imag:b},backend:i}),_=G_(l,c,s,r,i),S=_.real,E=_.imag,M=[S.length],P=i.makeTensorInfo(M,"float32",S),D=i.makeTensorInfo(M,"float32",E),w=sn({inputs:{real:P,imag:D},backend:i}),I=G_(m,x,s,r,i),N=I.real,L=I.imag,O=[N.length],z=i.makeTensorInfo(O,"float32",N),V=i.makeTensorInfo(O,"float32",L),$=sn({inputs:{real:z,imag:V},backend:i}),X=F.exponents(e,r),W=[X.real.length],K=i.makeTensorInfo(W,"float32",X.real),Z=i.makeTensorInfo(W,"float32",X.imag),Y=sn({inputs:{real:K,imag:Z},backend:i}),tt=ra({inputs:{a:Y,b:$},backend:i}),q=io({inputs:{a:w,b:tt},backend:i}),et=sp({inputs:{a:w,b:tt},backend:i}),rt=Pr({inputs:{input:q},backend:i}),at=Pr({inputs:{input:et},backend:i}),nt=Mi({inputs:{input:q},backend:i}),wt=Mi({inputs:{input:et},backend:i}),vt=Bo({inputs:[rt,at],backend:i,attrs:{axis:0}}),it=Bo({inputs:[nt,wt],backend:i,attrs:{axis:0}}),yt=i.data.get(vt.dataId).values,ct=i.data.get(it.dataId).values;return i.disposeIntermediateTensorInfo(h),i.disposeIntermediateTensorInfo(p),i.disposeIntermediateTensorInfo(d),i.disposeIntermediateTensorInfo(v),i.disposeIntermediateTensorInfo(b),i.disposeIntermediateTensorInfo(y),i.disposeIntermediateTensorInfo(P),i.disposeIntermediateTensorInfo(D),i.disposeIntermediateTensorInfo(w),i.disposeIntermediateTensorInfo(z),i.disposeIntermediateTensorInfo(V),i.disposeIntermediateTensorInfo($),i.disposeIntermediateTensorInfo(K),i.disposeIntermediateTensorInfo(Z),i.disposeIntermediateTensorInfo(Y),i.disposeIntermediateTensorInfo(tt),i.disposeIntermediateTensorInfo(q),i.disposeIntermediateTensorInfo(et),i.disposeIntermediateTensorInfo(rt),i.disposeIntermediateTensorInfo(nt),i.disposeIntermediateTensorInfo(at),i.disposeIntermediateTensorInfo(wt),i.disposeIntermediateTensorInfo(vt),i.disposeIntermediateTensorInfo(it),{real:yt,imag:ct}}function wq(n,t,e){let r=new Float32Array(t*2);for(let i=0;i<t;i++){let o=0,s=0;for(let a=0;a<t;a++){let l=F.exponent(i*a,t,e),c=F.getComplexWithIndex(n,a);o+=c.real*l.real-c.imag*l.imag,s+=c.real*l.imag+c.imag*l.real}e&&(o/=t,s/=t),F.assignToTypedArray(r,o,s,i)}return r}function Sq(n){let{inputs:t,backend:e}=n,{input:r}=t,i=R.sizeFromShape(r.shape),o=r.shape[r.shape.length-1],s=i/o,a=ce({inputs:{x:r},backend:e,attrs:{shape:[s,o]}}),l=M1(a,!1,e),c=ce({inputs:{x:l},backend:e,attrs:{shape:r.shape}});return e.disposeIntermediateTensorInfo(a),e.disposeIntermediateTensorInfo(l),c}var Fk={kernelName:Zm,backendName:"cpu",kernelFunc:Sq};function cp(n){let{backend:t,attrs:e}=n,{shape:r,value:i,dtype:o}=e,s=o||R.inferDtype(i),a=R.getArrayFromDType(s,R.sizeFromShape(r));return Cq(a,i,s),t.makeTensorInfo(r,s,a)}var Ok={kernelName:Jm,backendName:"cpu",kernelFunc:cp};function Cq(n,t,e){n.fill(t)}var Bk={kernelName:Qm,backendName:"cpu",kernelFunc:({inputs:n,attrs:t,backend:e})=>{let{image:r}=n,i=e,o=R.getTypedArrayFromDType(r.dtype,R.sizeFromShape(r.shape)),[s,a,l,c]=r.shape,u=i.data.get(r.dataId).values;for(let p=0;p<s;p++){let d=p*l*a*c;for(let f=0;f<a;f++){let m=f*(l*c);for(let x=0;x<l;x++){let g=x*c;for(let v=0;v<c;v++){let y=[s,f,x,v][2],_=Math.round(l-y),S=d+m+g+v,E=u[S];if(_>=0&&_<l){let M=_*c,P=d+m+M+v;E=u[P]}o[S]=E}}}}return{dataId:i.write(o,r.shape,r.dtype),shape:r.shape,dtype:r.dtype}}};var Mq=le((n,t)=>Math.floor(n/t)),Eq=fe(Sh,Mq,null,"int32"),Vk={kernelName:Sh,backendName:"cpu",kernelFunc:Eq};function Tq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,filter:o,bias:s,preluActivationWeights:a}=t,{strides:l,pad:c,dataFormat:u,dilations:h,dimRoundingMode:p,activation:d,leakyreluAlpha:f}=r,m=$_({inputs:{x:i,filter:o},backend:e,attrs:{strides:l,pad:c,dataFormat:u,dilations:h,dimRoundingMode:p}});if(s){let x=m;m=io({inputs:{a:m,b:s},backend:e}),e.disposeIntermediateTensorInfo(x)}if(d){let x=m;m=Xl(e,m,d,a,f),e.disposeIntermediateTensorInfo(x)}return m}var Hk={kernelName:Yg,backendName:"cpu",kernelFunc:Tq};function Aq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,filter:o,bias:s,preluActivationWeights:a}=t,{strides:l,pad:c,dataFormat:u,dilations:h,dimRoundingMode:p,activation:d,leakyreluAlpha:f}=r,m=U_({inputs:{x:i,filter:o},backend:e,attrs:{strides:l,pad:c,dataFormat:u,dilations:h,dimRoundingMode:p}});if(s){let x=m;m=io({inputs:{a:m,b:s},backend:e}),e.disposeIntermediateTensorInfo(x)}if(d){let x=m;m=Xl(e,m,d,a,f),e.disposeIntermediateTensorInfo(x)}return m}var $k={kernelName:Zg,backendName:"cpu",kernelFunc:Aq};function Iq(n){let{inputs:t,backend:e}=n,{params:r,indices:i}=t,o=R.sizeFromShape(r.shape),s=i.shape,a=s[s.length-1],[l,c,u,h]=F.prepareAndValidate(r,i);if(c===0)return e.makeTensorInfo(l,r.dtype,[]);let p=Xt([c,u],r.dtype),d=e.data.get(i.dataId).values,f=e.data.get(r.dataId).values;for(let m=0;m<c;m++){let x=[],g=0;for(let v=0;v<a;v++){let b=d[m*a+v];g+=b*h[v],x.push(b)}if(g<0||g>=o/u)throw new Error(`Invalid indices: ${x} does not index into ${r.shape}`);for(let v=0;v<u;v++)p.values[m*u+v]=f[g*u+v]}return e.makeTensorInfo(l,p.dtype,p.values)}var Uk={kernelName:ng,backendName:"cpu",kernelFunc:Iq};function kq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,indices:o}=t,{axis:s,batchDims:a}=r;ut([i,o],"gatherV2");let l=a;a==null&&(l=0);let c=R.sizeFromShape(o.shape),u=R.parseAxisParam(s,i.shape)[0],h=F.segment_util.collectGatherOpShapeInfo(i,o,u,l),p=ce({inputs:{x:i},backend:e,attrs:{shape:[h.batchSize,h.outerSize,h.dimSize,h.sliceSize]}}),d=ce({inputs:{x:o},backend:e,attrs:{shape:[h.batchSize,c/h.batchSize]}}),f=[h.batchSize,h.outerSize,c/h.batchSize,h.sliceSize],m=e.bufferSync(d),x=e.bufferSync(p),g=m1(x,m,f);return e.disposeIntermediateTensorInfo(p),e.disposeIntermediateTensorInfo(d),e.makeTensorInfo(h.outputShape,g.dtype,g.values)}var Wk={kernelName:eg,backendName:"cpu",kernelFunc:kq};var Rq=le((n,t)=>n>=t?1:0),Pq=fe(Mh,Rq,null,"bool"),Gk={kernelName:Mh,backendName:"cpu",kernelFunc:Pq};function Nq(n){let{inputs:t,backend:e}=n,{input:r}=t,i=R.sizeFromShape(r.shape),o=r.shape[r.shape.length-1],s=i/o,a=ce({inputs:{x:r},backend:e,attrs:{shape:[s,o]}}),l=M1(a,!0,e),c=ce({inputs:{x:l},backend:e,attrs:{shape:r.shape}});return e.disposeIntermediateTensorInfo(a),e.disposeIntermediateTensorInfo(l),c}var jk={kernelName:rg,backendName:"cpu",kernelFunc:Nq};var Lq=qt(Eh,n=>Number.isFinite(n)?1:0,"bool"),qk={kernelName:Eh,backendName:"cpu",kernelFunc:Lq};var Dq=qt(Th,n=>Math.abs(n)===1/0?1:0,"bool"),Xk={kernelName:Th,backendName:"cpu",kernelFunc:Dq};var zq=qt(Ah,n=>Number.isNaN(n)?1:0,"bool"),Kk={kernelName:Ah,backendName:"cpu",kernelFunc:zq};var Fq=le((n,t)=>n<=t?1:0),Oq=fe(kh,Fq,null,"bool"),Yk={kernelName:kh,backendName:"cpu",kernelFunc:Oq};function Bq(n){let{backend:t,attrs:e}=n,{start:r,stop:i,num:o}=e,s=g1(r,i,o);return t.makeTensorInfo([s.length],"float32",s)}var Zk={kernelName:og,backendName:"cpu",kernelFunc:Bq};var Vq=qt(Ph,n=>Math.log1p(n)),Jk={kernelName:Ph,backendName:"cpu",kernelFunc:Vq};var Hq=le((n,t)=>n&&t),$q=fe(Nh,Hq,null,"bool"),Qk={kernelName:Nh,backendName:"cpu",kernelFunc:$q};var Uq=qt(Lh,n=>n?0:1,"bool"),tR={kernelName:Lh,backendName:"cpu",kernelFunc:Uq};var Wq=le((n,t)=>n||t),Gq=fe(Dh,Wq,null,"bool"),eR={kernelName:Dh,backendName:"cpu",kernelFunc:Gq};function jq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{depthRadius:o,bias:s,alpha:a,beta:l}=r;ut(i,"LRN");let c=i.shape[3],u=c-1,h=e.data.get(i.dataId).values,p=R.sizeFromShape(i.shape),d=new Float32Array(p);function f(m){let x=m%c,g=m-x+Math.max(0,x-o),v=m-x+Math.min(x+o,u),b=0;for(;g<=v;g++){let y=h[g];b+=y*y}return b}for(let m=0;m<p;m++){let x=f(m),g=h[m]*Math.pow(s+a*x,-l);d[m]=g}return e.makeTensorInfo(i.shape,i.dtype,d)}var nR={kernelName:sg,backendName:"cpu",kernelFunc:jq};function qq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,y:o,dy:s}=t,{depthRadius:a,bias:l,alpha:c,beta:u}=r;ut(s,"LRNGrad");let h=R.sizeFromShape(s.shape),p=s.shape[3],d=e.data.get(s.dataId).values,f=e.data.get(i.dataId).values,m=e.data.get(o.dataId).values,x=new Float32Array(h),g=h;for(let v=0;v<g;v++){let b=v%p,y=v-b+Math.max(0,b-a),_=v-b+Math.min(p,b+a+1),S=0;for(let E=y;E<_;E++)S+=Math.pow(f[E],2);S=c*S+l;for(let E=y;E<_;E++){let M=-2*c*u*f[E]*m[v]/S;v===E&&(M+=Math.pow(S,-u)),M*=d[v],x[E]+=M}}return e.makeTensorInfo(s.shape,i.dtype,x)}var rR={kernelName:ag,backendName:"cpu",kernelFunc:qq};function j_(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{reductionIndices:o,keepDims:s}=r,a=e,l=i.shape,c=l.length,u=R.parseAxisParam(o,l),h=u,p=F.getAxesPermutation(h,c),d=a.data.get(i.dataId).values;if(p!=null){let y=new Array(c);for(let _=0;_<y.length;_++)y[_]=l[p[_]];d=ql(d,l,i.dtype,p,y),h=F.getInnerMostAxes(h.length,c),l=y}ut(i,"max"),F.assertAxesAreInnerMostDims("max",h,c);let[f,m]=F.computeOutAndReduceShapes(l,h),x=R.sizeFromShape(m),g=x1(d,x,f,i.dtype),v=a.write(g,f,i.dtype),b=f;return s&&(b=F.expandShapeToKeepDim(f,u)),{dataId:v,shape:b,dtype:i.dtype}}var iR={kernelName:lg,backendName:"cpu",kernelFunc:j_};function Xq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t;ut(i,"maxPool");let{filterSize:o,strides:s,pad:a,dimRoundingMode:l}=r,c=1;R.assert(F.eitherStridesOrDilationsAreOne(s,c),()=>`Error in maxPool: Either strides or dilations must be 1. Got strides ${s} and dilations '${c}'`);let u=F.computePool2DInfo(i.shape,o,s,c,a,l),h;if(u.filterWidth===1&&u.filterHeight===1&&R.arraysEqual(u.inShape,u.outShape))h=Rn({inputs:{x:i},backend:e});else{let p=e.data.get(i.dataId).values,d=R.computeStrides(i.shape),f=Kl(p,i.shape,i.dtype,d,u,"max");h=e.makeTensorInfo(u.outShape,i.dtype,f.values)}return h}var oR={kernelName:cg,backendName:"cpu",kernelFunc:Xq};function Kq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{filterSize:o,strides:s,pad:a,dimRoundingMode:l,dataFormat:c}=r;ut(i,"maxPool3d");let u=F.computePool3DInfo(i.shape,o,s,1,a,l,c),h=e.data.get(i.dataId).values,p=C1(h,i.shape,i.dtype,R.computeStrides(i.shape),u,"max");return e.makeTensorInfo(p.shape,"float32",p.values)}var sR={kernelName:hg,backendName:"cpu",kernelFunc:Kq};function Yq(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,input:o}=t,{filterSize:s,strides:a,pad:l,dimRoundingMode:c}=r;ut([i,o],"maxPool3DGrad");let u=F.computePool3DInfo(o.shape,s,a,1,l,c),h=e.bufferSync(o),p=tk(h,u),d=u.strideDepth,f=u.strideHeight,m=u.strideWidth,x=u.dilationDepth,g=u.dilationHeight,v=u.dilationWidth,b=u.effectiveFilterDepth,y=u.effectiveFilterHeight,_=u.effectiveFilterWidth,S=b-1-u.padInfo.front,E=_-1-u.padInfo.left,M=y-1-u.padInfo.top,P=Xt(o.shape,"float32"),D=e.bufferSync(i);for(let w=0;w<u.batchSize;++w)for(let I=0;I<u.inChannels;++I)for(let N=0;N<u.inDepth;++N)for(let L=0;L<u.inHeight;++L)for(let O=0;O<u.inWidth;++O){let z=N-S,V=L-M,$=O-E,X=0;for(let W=0;W<b;W+=x){let K=(z+W)/d;if(!(K<0||K>=u.outDepth||Math.floor(K)!==K))for(let Z=0;Z<y;Z+=g){let Y=(V+Z)/f;if(!(Y<0||Y>=u.outHeight||Math.floor(Y)!==Y))for(let tt=0;tt<_;tt+=v){let q=($+tt)/m;if(q<0||q>=u.outWidth||Math.floor(q)!==q)continue;let et=b*y*_-1-p.get(w,K,Y,q,I),rt=W*y*_+Z*_+tt,at=et===rt?1:0;if(at===0)continue;X+=D.get(w,K,Y,q,I)*at}}}P.set(X,w,N,L,O,I)}return e.makeTensorInfo(P.shape,P.dtype,P.values)}var aR={kernelName:pg,backendName:"cpu",kernelFunc:Yq};function Zq(n){let{inputs:t,backend:e,attrs:r}=n,{dy:i,input:o,output:s}=t,a=o;ut([o,s],"maxPoolGrad");let{filterSize:l,strides:c,pad:u,dimRoundingMode:h}=r,p=F.computePool2DInfo(a.shape,l,c,1,u,h),d=e.data.get(a.dataId).values,f=Xt(p.outShape,a.dtype,S1(d,a.shape,a.dtype,p).values),m=p.strideHeight,x=p.strideWidth,g=p.dilationHeight,v=p.dilationWidth,b=p.effectiveFilterHeight,y=p.effectiveFilterWidth,_=y-1-p.padInfo.left,S=b-1-p.padInfo.top,E=Xt(a.shape,"float32"),M=e.data.get(i.dataId).values,P=Xt(i.shape,"float32",M);for(let D=0;D<p.batchSize;++D)for(let w=0;w<p.inChannels;++w)for(let I=0;I<p.inHeight;++I)for(let N=0;N<p.inWidth;++N){let L=I-S,O=N-_,z=0;for(let V=0;V<b;V+=g){let $=(L+V)/m;if(!($<0||$>=p.outHeight||Math.floor($)!==$))for(let X=0;X<y;X+=v){let W=(O+X)/x;if(W<0||W>=p.outWidth||Math.floor(W)!==W)continue;let K=b*y-1-f.get(D,$,W,w),Z=V*y+X,Y=K===Z?1:0;if(Y===0)continue;z+=P.get(D,$,W,w)*Y}}E.set(z,D,I,N,w)}return e.makeTensorInfo(E.shape,E.dtype,E.values)}var lR={kernelName:ug,backendName:"cpu",kernelFunc:Zq};function cR(n,t,e,r,i){let o=R.computeStrides(t),s=Kl(n,t,e,o,i,"max"),a=S1(n,t,e,i,!0,r);return[s.values,a.values]}var uR={kernelName:dg,backendName:"cpu",kernelFunc:({inputs:n,attrs:t,backend:e})=>{let{x:r}=n,{filterSize:i,strides:o,pad:s,includeBatchInIndex:a}=t,l=e;ut(r,"MaxPoolWithArgmax");let c=l.data.get(r.dataId).values,u=F.computePool2DInfo(r.shape,i,o,[1,1],s),[h,p]=cR(c,r.shape,r.dtype,a,u),d=l.write(h,u.outShape,r.dtype),f=l.write(p,u.outShape,r.dtype);return[{dataId:d,shape:u.outShape,dtype:r.dtype},{dataId:f,shape:u.outShape,dtype:"int32"}]}};function Jq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r,a=R.parseAxisParam(o,i.shape),c=F.computeOutAndReduceShapes(i.shape,a)[1],u=R.sizeFromShape(c),h=[],p=e.makeTensorInfo([],"float32",new Float32Array([u]));h.push(p);let d=Nr({inputs:{x:i},backend:e,attrs:{dtype:"float32"}});h.push(d);let f=ap({inputs:{a:d,b:p},backend:e});h.push(f);let m=oo({inputs:{x:f},backend:e,attrs:{axis:o,keepDims:s}});return h.forEach(x=>e.disposeIntermediateTensorInfo(x)),m}var hR={kernelName:fg,backendName:"cpu",kernelFunc:Jq};function Qq(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{axis:o,keepDims:s}=r;ut(i,"min");let a=R.parseAxisParam(o,i.shape),l=a,c=F.getAxesPermutation(l,i.shape.length),u=i;c!=null&&(u=Ve({inputs:{x:i},backend:e,attrs:{perm:c}}),l=F.getInnerMostAxes(l.length,i.shape.length)),F.assertAxesAreInnerMostDims("min",l,u.shape.length);let[h,p]=F.computeOutAndReduceShapes(u.shape,l),d=R.sizeFromShape(p),f=R.makeZerosTypedArray(R.sizeFromShape(h),u.dtype),m=e.data.get(u.dataId).values;for(let g=0;g<f.length;++g){let v=g*d,b=m[v];for(let y=0;y<d;++y){let _=m[v+y];_<b&&(b=_)}f[g]=b}c!=null&&e.disposeIntermediateTensorInfo(u);let x=e.makeTensorInfo(h,u.dtype,f);if(s){let g=F.expandShapeToKeepDim(h,a),v=ce({inputs:{x},backend:e,attrs:{shape:g}});return e.disposeIntermediateTensorInfo(x),v}return x}var pR={kernelName:mg,backendName:"cpu",kernelFunc:Qq};function tX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{paddings:o,mode:s}=r;ut(i,"mirrorPad");let a=o.map((b,y)=>b[0]+i.shape[y]+b[1]),l=o.map(b=>b[0]),c=o.map((b,y)=>b[0]+i.shape[y]),u=s==="reflect"?0:1,h=e.data.get(i.dataId).values,p=i.shape.length,d=R.computeStrides(i.shape),f=R.sizeFromShape(a),m=a.length,x=R.computeStrides(a),g=R.getTypedArrayFromDType(i.dtype,f);for(let b=0;b<f;b++){let y=R.indexToLoc(b,m,x);for(let S=0;S<m;S++)y[S]<l[S]?y[S]=l[S]*2-y[S]-u:y[S]>=c[S]&&(y[S]=(c[S]-1)*2-y[S]+u);y=y.map((S,E)=>S-l[E]);let _=R.locToIndex(y,p,d);g[b]=h[_]}return{dataId:e.write(g,a,i.dtype),shape:a,dtype:i.dtype}}var dR={kernelName:gg,backendName:"cpu",kernelFunc:tX};var eX=le((n,t)=>{let e=n%t;return n<0&&t<0||n>=0&&t>=0?e:(e+t)%t}),nX=fe(Oh,eX),fR={kernelName:Oh,backendName:"cpu",kernelFunc:nX};var gR=Jd(JA());function q_(n){let{inputs:t,backend:e,attrs:r}=n,{logits:i}=t,{dim:o}=r,s=i.shape.length,a=o;if(a===-1&&(a=s-1),a!==s-1)throw Error(`Softmax along a non-last dimension is not yet supported. Logits was rank ${s} and dim was ${a}`);let l=R.parseAxisParam([a],i.shape),c=j_({inputs:{x:i},backend:e,attrs:{reductionIndices:l,keepDims:!1}}),u=F.expandShapeToKeepDim(c.shape,l),h=ce({inputs:{x:c},backend:e,attrs:{shape:u}}),p=sp({inputs:{a:i,b:h},backend:e}),d=b_({inputs:{x:p},backend:e}),f=oo({inputs:{x:d},backend:e,attrs:{axis:l,keepDims:!1}}),m=ce({inputs:{x:f},backend:e,attrs:{shape:u}}),x=ap({inputs:{a:d,b:m},backend:e});return e.disposeIntermediateTensorInfo(c),e.disposeIntermediateTensorInfo(h),e.disposeIntermediateTensorInfo(p),e.disposeIntermediateTensorInfo(d),e.disposeIntermediateTensorInfo(f),e.disposeIntermediateTensorInfo(m),x}var mR={kernelName:Fg,backendName:"cpu",kernelFunc:q_};function rX(n){let{inputs:t,backend:e,attrs:r}=n,{logits:i}=t,{numSamples:o,seed:s,normalized:a}=r;ut(i,"multinomial");let l=a?i:q_({inputs:{logits:i},backend:e,attrs:{dim:-1}}),c=l.shape[0],u=l.shape[1],h=e.data.get(l.dataId).values,p=[c,o],d=R.makeZerosTypedArray(R.sizeFromShape(p),"int32");for(let f=0;f<c;++f){let m=f*u,x=new Float32Array(u-1);x[0]=h[m];for(let b=1;b<x.length;++b)x[b]=x[b-1]+h[m+b];let g=gR.alea(s.toString()),v=f*o;for(let b=0;b<o;++b){let y=g();d[v+b]=x.length;for(let _=0;_<x.length;_++)if(y<x[_]){d[v+b]=_;break}}}return a||e.disposeIntermediateTensorInfo(l),e.makeTensorInfo(p,"int32",d)}var xR={kernelName:xg,backendName:"cpu",kernelFunc:rX};var iX=kn.nonMaxSuppressionV3Impl;function oX(n){let{inputs:t,backend:e,attrs:r}=n,{boxes:i,scores:o}=t,{maxOutputSize:s,iouThreshold:a,scoreThreshold:l}=r;ut(i,"NonMaxSuppression");let c=e.data.get(i.dataId).values,u=e.data.get(o.dataId).values,{selectedIndices:h}=iX(c,u,s,a,l);return e.makeTensorInfo([h.length],"int32",new Int32Array(h))}var vR={kernelName:yg,backendName:"cpu",kernelFunc:oX};var sX=kn.nonMaxSuppressionV4Impl;function aX(n){let{inputs:t,backend:e,attrs:r}=n,{boxes:i,scores:o}=t,{maxOutputSize:s,iouThreshold:a,scoreThreshold:l,padToMaxOutputSize:c}=r;ut(i,"NonMaxSuppressionPadded");let u=e.data.get(i.dataId).values,h=e.data.get(o.dataId).values,{selectedIndices:p,validOutputs:d}=sX(u,h,s,a,l,c);return[e.makeTensorInfo([p.length],"int32",new Int32Array(p)),e.makeTensorInfo([],"int32",new Int32Array([d]))]}var yR={kernelName:bg,backendName:"cpu",kernelFunc:aX};var lX=kn.nonMaxSuppressionV5Impl;function cX(n){let{inputs:t,backend:e,attrs:r}=n,{boxes:i,scores:o}=t,{maxOutputSize:s,iouThreshold:a,scoreThreshold:l,softNmsSigma:c}=r;ut(i,"NonMaxSuppressionWithScore");let u=e.data.get(i.dataId).values,h=e.data.get(o.dataId).values,p=s,d=a,f=l,m=c,{selectedIndices:x,selectedScores:g}=lX(u,h,p,d,f,m);return[e.makeTensorInfo([x.length],"int32",new Int32Array(x)),e.makeTensorInfo([g.length],"float32",new Float32Array(g))]}var bR={kernelName:_g,backendName:"cpu",kernelFunc:cX};function uX(n){let{inputs:t,backend:e,attrs:r}=n,{indices:i}=t,{depth:o,onValue:s,offValue:a}=r;ut(i,"oneHot");let l=R.sizeFromShape(i.shape),c=new Float32Array(l*o);c.fill(a);let u=e.data.get(i.dataId).values;for(let h=0;h<l;++h)u[h]>=0&&u[h]<o&&(c[h*o+u[h]]=s);return e.makeTensorInfo([...i.shape,o],"int32",c)}var _R={kernelName:Sg,backendName:"cpu",kernelFunc:uX};function up(n){let{inputs:t,backend:e}=n,{x:r}=t;if(r.dtype==="string")throw new Error("zerosLike is not supported for string tensors");if(r.dtype==="complex64"){let i=Pr({inputs:{input:r},backend:e}),o=up({inputs:{x:i},backend:e}),s=Mi({inputs:{input:r},backend:e}),a=up({inputs:{x:s},backend:e}),l=sn({inputs:{real:o,imag:a},backend:e});return e.disposeIntermediateTensorInfo(i),e.disposeIntermediateTensorInfo(o),e.disposeIntermediateTensorInfo(s),e.disposeIntermediateTensorInfo(a),l}else return cp({backend:e,attrs:{shape:r.shape,value:0,dtype:r.dtype}})}var wR={kernelName:qg,backendName:"cpu",kernelFunc:up};function SR(n){let{inputs:t,backend:e}=n,{x:r}=t;if(r.dtype==="string")throw new Error("onesLike is not supported for string tensors");if(r.dtype==="complex64"){let i=Pr({inputs:{input:r},backend:e}),o=SR({inputs:{x:i},backend:e}),s=Mi({inputs:{input:r},backend:e}),a=up({inputs:{x:s},backend:e}),l=sn({inputs:{real:o,imag:a},backend:e});return e.disposeIntermediateTensorInfo(i),e.disposeIntermediateTensorInfo(o),e.disposeIntermediateTensorInfo(s),e.disposeIntermediateTensorInfo(a),l}else return cp({backend:e,attrs:{shape:r.shape,value:1,dtype:r.dtype}})}var CR={kernelName:wg,backendName:"cpu",kernelFunc:SR};function X_(n){let{inputs:t,backend:e,attrs:r}=n,{axis:i}=r;if(t.length===1)return Yl({inputs:{input:t[0]},backend:e,attrs:{dim:i}});let o=t[0].shape,s=t[0].dtype;t.forEach(u=>{R.assertShapesMatch(o,u.shape,"All tensors passed to stack must have matching shapes"),R.assert(s===u.dtype,()=>"All tensors passed to stack must have matching dtypes")});let a=[],l=t.map(u=>{let h=Yl({inputs:{input:u},backend:e,attrs:{dim:i}});return a.push(h),h}),c=Bo({inputs:l,backend:e,attrs:{axis:i}});return a.forEach(u=>e.disposeIntermediateTensorInfo(u)),c}var MR={kernelName:Cg,backendName:"cpu",kernelFunc:X_};function hX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{paddings:o,constantValue:s}=r;ut(i,"pad");let a=o.map((v,b)=>v[0]+i.shape[b]+v[1]),l=o.map(v=>v[0]),c=e.data.get(i.dataId).values,u=R.sizeFromShape(i.shape),h=i.shape.length,p=R.computeStrides(i.shape),d=R.sizeFromShape(a),f=a.length,m=R.computeStrides(a),x=R.getTypedArrayFromDType(i.dtype,d);s!==0&&x.fill(s);for(let v=0;v<u;v++){let y=R.indexToLoc(v,h,p).map((S,E)=>S+l[E]),_=R.locToIndex(y,f,m);x[_]=c[v]}return{dataId:e.write(x,a,i.dtype),shape:a,dtype:i.dtype}}var E1={kernelName:Rl,backendName:"cpu",kernelFunc:hX};var pX=le((n,t)=>Math.pow(n,t)),dX=fe(Vh,pX),ER={kernelName:Vh,backendName:"cpu",kernelFunc:dX};function fX(n){let{backend:t,attrs:e}=n,{start:r,stop:i,dtype:o,step:s}=e,a=v1(r,i,s,o);return t.makeTensorInfo([a.length],o,a)}var TR={kernelName:Eg,backendName:"cpu",kernelFunc:fX};var mX=qt(Hh,n=>1/n),AR={kernelName:Hh,backendName:"cpu",kernelFunc:mX};function gX(n){let{inputs:t,backend:e,attrs:r}=n,{images:i}=t,{alignCorners:o,halfPixelCenters:s,size:a}=r;ut(i,"resizeBilinear");let l=R.computeStrides(i.shape),[c,u]=a,[h,p,d,f]=i.shape,m=e.data.get(i.dataId).values,x=new Float32Array(R.sizeFromShape([h,c,u,f])),g=[o&&c>1?p-1:p,o&&u>1?d-1:d],v=[o&&c>1?c-1:c,o&&u>1?u-1:u],b=0,y=g[0]/v[0],_=g[1]/v[1];for(let S=0;S<h;S++)for(let E=0;E<c;E++){let M;s?M=y*(E+.5)-.5:M=y*E;let P=Math.max(0,Math.floor(M)),D=M-P,w=Math.min(p-1,Math.ceil(M)),I=S*l[0]+P*l[1],N=S*l[0]+w*l[1];for(let L=0;L<u;L++){let O;s?O=_*(L+.5)-.5:O=_*L;let z=Math.max(0,Math.floor(O)),V=O-z,$=Math.min(d-1,Math.ceil(O)),X=I+z*l[2],W=N+z*l[2],K=I+$*l[2],Z=N+$*l[2];for(let Y=0;Y<f;Y++){let tt=m[X+Y],q=m[W+Y],et=m[K+Y],rt=m[Z+Y],at=tt+(et-tt)*V,nt=q+(rt-q)*V,wt=at+(nt-at)*D;x[b++]=wt}}}return e.makeTensorInfo([h,c,u,f],"float32",x)}var IR={kernelName:kg,backendName:"cpu",kernelFunc:gX};function xX(n){let{inputs:t,backend:e,attrs:r}=n,{images:i,dy:o}=t,{alignCorners:s}=r;ut([o,i],"resizeBilinearGrad");let a=R.computeStrides(i.shape),[l,c,u,h]=i.shape,[,p,d]=o.shape,f=new Float32Array(l*c*u*h),m=[s&&p>1?c-1:c,s&&d>1?u-1:u],x=[s&&p>1?p-1:p,s&&d>1?d-1:d],g=m[0]/x[0],v=m[1]/x[1],b=e.data.get(o.dataId).values,y=0;for(let _=0;_<l;_++){let S=_*a[0];for(let E=0;E<p;E++){let M=E*g,P=Math.floor(M),D=Math.min(Math.ceil(M),c-1),w=S+P*a[1],I=S+D*a[1],N=M-P,L=1-N;for(let O=0;O<d;O++){let z=O*v,V=Math.floor(z),$=Math.min(Math.ceil(z),u-1),X=z-V,W=1-X,K=w+V*a[2],Z=w+$*a[2],Y=I+V*a[2],tt=I+$*a[2],q=L*W,et=L*X,rt=N*W,at=N*X;for(let nt=0;nt<h;nt++){let wt=b[y++];f[K+nt]+=wt*q,f[Z+nt]+=wt*et,f[Y+nt]+=wt*rt,f[tt+nt]+=wt*at}}}}return e.makeTensorInfo([l,u,c,h],"float32",f)}var kR={kernelName:Rg,backendName:"cpu",kernelFunc:xX};function vX(n){let{inputs:t,backend:e,attrs:r}=n,{images:i}=t,{alignCorners:o,halfPixelCenters:s,size:a}=r;ut(i,"resizeNearestNeighbor");let l=R.computeStrides(i.shape),[c,u]=a,[h,p,d,f]=i.shape,m=e.data.get(i.dataId).values,x=new Float32Array(h*c*u*f),g=[o&&c>1?p-1:p,o&&u>1?d-1:d],v=[o&&c>1?c-1:c,o&&u>1?u-1:u],b=g[0]/v[0],y=g[1]/v[1],_=0;for(let S=0;S<h;S++){let E=S*l[0];for(let M=0;M<c;M++){let P=s?b*(M+.5):b*M,D=Math.min(p-1,o?Math.round(P):Math.floor(P));s&&(D=Math.max(0,D));let w=E+D*l[1];for(let I=0;I<u;I++){let N=s?y*(I+.5):y*I,L=Math.min(d-1,o?Math.round(N):Math.floor(N));s&&(L=Math.max(0,L));let O=w+L*l[2];for(let z=0;z<f;z++){let V=m[O+z];x[_++]=V}}}}return e.makeTensorInfo([h,c,u,f],i.dtype,x)}var RR={kernelName:Ag,backendName:"cpu",kernelFunc:vX};function yX(n){let{inputs:t,backend:e,attrs:r}=n,{images:i,dy:o}=t,{alignCorners:s}=r;ut([o,i],"resizeNearestNeighborGrad");let a=R.computeStrides(i.shape),l=R.computeStrides(o.shape),[c,u,h,p]=i.shape,[,d,f]=o.shape,m=new Float32Array(c*u*h*p),x=e.data.get(o.dataId).values,g=[s&&d>1?u-1:u,s&&f>1?h-1:h],v=[s&&d>1?d-1:d,s&&f>1?f-1:f],b=g[0]/v[0],y=g[1]/v[1],_=1/b,S=1/y,E=Math.ceil(_)*2+2,M=Math.ceil(S)*2+2;for(let P=0;P<c;P++){let D=P*a[0];for(let w=0;w<u;w++){let I=D+w*a[1],N=Math.floor(w*_),L=Math.floor(N-E/2);for(let O=0;O<h;O++){let z=I+O*a[2],V=Math.floor(O*S),$=Math.floor(V-M/2);for(let X=0;X<p;X++){let W=0;for(let K=0;K<E;K++){let Z=K+L;if(Z<0||Z>=d)continue;let Y=D+Z*l[1],tt=Z*b,q=Math.min(u-1,s?Math.round(tt):Math.floor(tt));if(w===q)for(let et=0;et<M;et++){let rt=et+$;if(rt<0||rt>=f)continue;let at=Y+rt*l[2],nt=rt*y,wt=Math.min(h-1,s?Math.round(nt):Math.floor(nt));O===wt&&(W+=x[at+X])}}m[z+X]=W}}}}return e.makeTensorInfo(i.shape,i.dtype,m)}var PR={kernelName:Ig,backendName:"cpu",kernelFunc:yX};function bX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{dims:o}=r;ut(i,"reverse");let s=i.shape.length,a=R.parseAxisParam(o,i.shape);if(s===0)return Rn({inputs:{x:i},backend:e});let l=new Ce(i.shape,i.dtype),c=e.bufferSync(i);for(let u=0;u<l.size;u++){let h=l.indexToLoc(u),p=h.slice();a.forEach(d=>p[d]=i.shape[d]-1-p[d]),l.set(c.get(...p),...h)}return e.makeTensorInfo(l.shape,l.dtype,l.values)}var NR={kernelName:Pg,backendName:"cpu",kernelFunc:bX};var LR={kernelName:Xg,backendName:"cpu",kernelFunc:({inputs:n,attrs:t,backend:e})=>{let{image:r}=n,{radians:i,fillValue:o,center:s}=t,a=e,l=R.getTypedArrayFromDType(r.dtype,R.sizeFromShape(r.shape)),[c,u,h,p]=r.shape,[d,f]=F.getImageCenter(s,u,h),m=255,x=Math.sin(i),g=Math.cos(i),v=a.data.get(r.dataId).values;for(let y=0;y<c;y++){let _=y*h*u*p;for(let S=0;S<u;S++){let E=S*(h*p);for(let M=0;M<h;M++){let P=M*p;for(let D=0;D<p;D++){let w=[c,S,M,D],I=w[2],N=w[1],L=(I-d)*g-(N-f)*x,O=(I-d)*x+(N-f)*g;L=Math.round(L+d),O=Math.round(O+f);let z=o;if(typeof o!="number"&&(D===3?z=m:z=o[D]),L>=0&&L<h&&O>=0&&O<u){let $=O*(h*p),X=L*p,W=_+$+X+D;z=v[W]}let V=_+E+P+D;l[V]=z}}}}return{dataId:a.write(l,r.shape,r.dtype),shape:r.shape,dtype:r.dtype}}};var _X=qt($h,n=>{let t=Math.floor(n);return n-t<.5?Math.floor(n):n-t>.5?Math.ceil(n):t%2===0?t:t+1}),DR={kernelName:$h,backendName:"cpu",kernelFunc:_X};function T1(n,t,e,r,i,o,s,a,l,c){let u=[r/i,i],h=n.values,p=t.values;if(r===0)return Xt(e,t.dtype);let d=Xt(u,t.dtype);d.values.fill(l);for(let f=0;f<o;f++){let m=[],x=0;for(let g=0;g<s;g++){let v=h[f*s+g];m.push(v),x+=v*a[g]}if(x<0||x>=r/i)throw new Error(`Invalid indices: ${m} does not index into ${e}`);for(let g=0;g<i;g++)c?d.values[x*i+g]+=p[f*i+g]:d.values[x*i+g]=t.rank===0?p[0]:p[f*i+g]}return d}function wX(n){let{inputs:t,backend:e,attrs:r}=n,{indices:i,updates:o}=t,{shape:s}=r,{sliceRank:a,numUpdates:l,sliceSize:c,strides:u,outputSize:h}=F.calculateShapes(o,i,s),p=!0,d=e.bufferSync(i),f=e.bufferSync(o),m=T1(d,f,s,h,c,l,a,u,0,p);return e.makeTensorInfo(s,m.dtype,m.values)}var zR={kernelName:Ng,backendName:"cpu",kernelFunc:wX};function SX(n){let{inputs:t,backend:e}=n,{condition:r,t:i,e:o}=t;ut([r,i,o],"select");let s=r.shape.length,a=e.data.get(r.dataId).values,l=e.data.get(i.dataId).values,c=e.data.get(o.dataId).values,u=on(i.dtype,o.dtype),h=R.makeZerosTypedArray(R.sizeFromShape(i.shape),u),p=0,d=s===0||s>1||i.shape.length===1?1:R.sizeFromShape(i.shape.slice(1));for(let f=0;f<a.length;f++)for(let m=0;m<d;m++)a[f]===1?h[p++]=l[f]:h[p++]=c[f];return e.makeTensorInfo(i.shape,u,h)}var FR={kernelName:Lg,backendName:"cpu",kernelFunc:SX};var CX=F.SELU_SCALEALPHA,MX=F.SELU_SCALE,EX=qt(Wh,n=>n>=0?MX*n:CX*(Math.exp(n)-1)),OR={kernelName:Wh,backendName:"cpu",kernelFunc:EX};var TX=qt(Xh,n=>1/(1+Math.exp(-n))),BR={kernelName:Xh,backendName:"cpu",kernelFunc:TX};var AX=qt(qh,n=>n<0?-1:n>0?1:0),VR={kernelName:qh,backendName:"cpu",kernelFunc:AX};var IX=qt(Gh,n=>Math.sin(n)),HR={kernelName:Gh,backendName:"cpu",kernelFunc:IX};var kX=qt(jh,n=>Math.sinh(n)),$R={kernelName:jh,backendName:"cpu",kernelFunc:kX};var RX=11920928955078125e-23,UR=Math.log(RX)+2,PX=qt(Kh,n=>{let t=n>-UR,e=n<UR,r=Math.exp(n),i;return e?i=r:t?i=n:i=Math.log(1+r),i}),WR={kernelName:Kh,backendName:"cpu",kernelFunc:PX};function NX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{blockShape:o,paddings:s}=r;ut([i],"spaceToBatchND");let a=R.sizeFromShape(o),l=[[0,0]];l.push(...s);for(let S=1+o.length;S<i.shape.length;++S)l.push([0,0]);let c=E1.kernelFunc({inputs:{x:i},backend:e,attrs:{paddings:l,constantValue:0}}),u=F.getReshaped(c.shape,o,a,!1),h=F.getPermuted(u.length,o.length,!1),p=F.getReshapedPermuted(c.shape,o,a,!1),m=ce({inputs:{x:c},backend:e,attrs:{shape:u}}),v=Ve({inputs:{x:m},backend:e,attrs:{perm:h}}),_=ce({inputs:{x:v},backend:e,attrs:{shape:p}});return e.disposeIntermediateTensorInfo(c),e.disposeIntermediateTensorInfo(m),e.disposeIntermediateTensorInfo(v),_}var GR={kernelName:zg,backendName:"cpu",kernelFunc:NX};function LX(n){let{inputs:t,backend:e,attrs:r}=n,{sparseIndices:i,sparseValues:o,defaultValue:s}=t,{outputShape:a}=r,{sliceRank:l,numUpdates:c,sliceSize:u,strides:h,outputSize:p}=F.calculateShapes(o,i,a),d=!1,f=e.bufferSync(i),m=e.bufferSync(o),x=e.data.get(s.dataId).values[0],g=T1(f,m,a,p,u,c,l,h,x,d);return e.makeTensorInfo(a,g.dtype,g.values)}var jR={kernelName:Bg,backendName:"cpu",kernelFunc:LX};function DX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{numOrSizeSplits:o,axis:s}=r,a=R.parseAxisParam(s,i.shape)[0],l=F.prepareSplitSize(i,o,a),c=new Array(i.shape.length).fill(0),u=i.shape.slice();return l.map(h=>{let p=[...u];p[a]=h;let d=zr({inputs:{x:i},backend:e,attrs:{begin:c,size:p}});return c[a]+=h,d})}var qR={kernelName:Dl,backendName:"cpu",kernelFunc:DX};var zX=qt(Yh,n=>Math.sqrt(n)),XR={kernelName:Yh,backendName:"cpu",kernelFunc:zX};var KR={kernelName:Og,backendName:"cpu",kernelFunc:({inputs:n,backend:t})=>{let{x:e}=n,r=t;ut(e,"square");let i=r.data.get(e.dataId).values,o=new Float32Array(i.length);for(let a=0;a<i.length;++a){let l=i[a];o[a]=l*l}return{dataId:r.write(o,e.shape,e.dtype),shape:e.shape,dtype:e.dtype}}};var FX=qt(Ks,(n,t)=>{let e=t;return isNaN(n)?NaN:n>0?1:e.alpha}),YR={kernelName:Ks,backendName:"cpu",kernelFunc:FX};function OX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{begin:o,end:s,strides:a,beginMask:l,endMask:c,ellipsisMask:u,newAxisMask:h,shrinkAxisMask:p}=r;ut(i,"stridedSlice");let{nonStrided:d,$begin:f,$strides:m,size:x,newShape:g,outShape:v}=In.sliceInfo(i.shape,o,s,a,l,c,u,h,p),b=ce({inputs:{x:i},backend:e,attrs:{shape:g}}),y;if(d){let S=zr({inputs:{x:b},backend:e,attrs:{begin:f,size:x}});y=ce({inputs:{x:S},backend:e,attrs:{shape:v}}),e.disposeIntermediateTensorInfo(S)}else if(v.some(S=>S===0))y=e.makeTensorInfo(v,i.dtype,[]);else{let S=e.bufferSync(b),E=y1(v,S,m,f);y=e.makeTensorInfo(E.shape,E.dtype,E.values)}let _=ce({inputs:{x:y},backend:e,attrs:{shape:v}});return e.disposeIntermediateTensorInfo(b),e.disposeIntermediateTensorInfo(y),_}var ZR={kernelName:Vg,backendName:"cpu",kernelFunc:OX};var BX=qt(Jh,n=>Math.tan(n)),JR={kernelName:Jh,backendName:"cpu",kernelFunc:BX};var VX=qt(Qh,n=>Math.tanh(n)),QR={kernelName:Qh,backendName:"cpu",kernelFunc:VX};function HX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{reps:o}=r;ut(i,"tile");let s=b1(e.bufferSync(i),o);return e.makeTensorInfo(s.shape,s.dtype,s.values)}var tP={kernelName:Hg,backendName:"cpu",kernelFunc:HX};function $X(n){let{inputs:t,backend:e,attrs:r}=n,{x:i}=t,{k:o,sorted:s}=r;ut(i,"topk");let a=e.data.get(i.dataId).values,[l,c]=_1(a,i.shape,i.dtype,o,s);return[e.makeTensorInfo(l.shape,l.dtype,l.values),e.makeTensorInfo(c.shape,c.dtype,c.values)]}var eP={kernelName:$g,backendName:"cpu",kernelFunc:$X};function UX(n){let{inputs:t,attrs:e,backend:r}=n,{image:i,transforms:o}=t,{interpolation:s,fillMode:a,fillValue:l,outputShape:c}=e,[u,h,p,d]=i.shape,[f,m]=c!=null?c:[h,p],x=[u,f,m,d],g=R.computeStrides(i.shape),v=g[0],b=g[1],y=g[2],_=R.getTypedArrayFromDType(i.dtype,R.sizeFromShape(x));_.fill(l);let S=r.data.get(i.dataId).values,E=r.data.get(o.dataId).values;for(let P=0;P<u;++P){let D=o.shape[0]===1?E:E.subarray(P*8,P*8+8);for(let w=0;w<f;++w)for(let I=0;I<m;++I)for(let N=0;N<d;++N){let L,O=D[6]*I+D[7]*w+1;if(O===0)continue;let z=(D[0]*I+D[1]*w+D[2])/O,V=(D[3]*I+D[4]*w+D[5])/O,$=nP(z,p,a),X=nP(V,h,a);switch(s){case"nearest":L=XX(S,h,p,v,b,y,P,X,$,N,l);break;case"bilinear":L=KX(S,h,p,v,b,y,P,X,$,N,l);break;default:throw new Error(`Error in Transform: Expect 'nearest' or 'bilinear', but got ${s}`)}let W=P*v+w*b+I*y+N;_[W]=L}return r.makeTensorInfo(x,i.dtype,_)}return{dataId:r.write(_,x,i.dtype),shape:i.shape,dtype:i.dtype}}var rP={kernelName:Ug,backendName:"cpu",kernelFunc:UX};function nP(n,t,e){switch(e){case"reflect":return WX(n,t);case"wrap":return GX(n,t);case"nearest":return qX(n,t);case"constant":default:return jX(n,t)}}function WX(n,t){let e=n;if(e<0)if(t<=1)e=0;else{let r=2*t;e<r&&(e=r*Math.trunc(-e/r)+e),e=e<-t?e+r:-e-1}else if(e>t-1)if(t<=1)e=0;else{let r=2*t;e-=r*Math.trunc(e/r),e>=t&&(e=r-e-1)}return R.clamp(0,e,t-1)}function GX(n,t){let e=n;if(e<0)if(t<=1)e=0;else{let r=t-1;e+=t*(Math.trunc(-e/r)+1)}else if(e>t-1)if(t<=1)e=0;else{let r=t-1;e-=t*Math.trunc(e/r)}return R.clamp(0,e,t-1)}function jX(n,t){return n}function qX(n,t){return R.clamp(0,n,t-1)}function hp(n,t,e,r,i,o,s,a,l,c,u){let h=s*r+a*i+l*o+c;return 0<=a&&a<t&&0<=l&&l<e?n[h]:u}function XX(n,t,e,r,i,o,s,a,l,c,u){let h=Math.round(a),p=Math.round(l);return hp(n,t,e,r,i,o,s,h,p,c,u)}function KX(n,t,e,r,i,o,s,a,l,c,u){let h=Math.floor(a),p=Math.floor(l),d=h+1,f=p+1,m=(f-l)*hp(n,t,e,r,i,o,s,h,p,c,u)+(l-p)*hp(n,t,e,r,i,o,s,h,f,c,u),x=(f-l)*hp(n,t,e,r,i,o,s,d,p,c,u)+(l-p)*hp(n,t,e,r,i,o,s,d,f,c,u);return(d-a)*m+(a-h)*x}function YX(n){let{inputs:t,attrs:e,backend:r}=n,{axis:i}=e,{x:o}=t;ut(o,"unique");let s=r.data.get(o.dataId).values,{outputValues:a,outputShape:l,indices:c}=w1(s,i,o.shape,o.dtype);return[r.makeTensorInfo(l,o.dtype,a),r.makeTensorInfo([c.length],"int32",c)]}var iP={kernelName:Wg,backendName:"cpu",kernelFunc:YX};function ZX(n){let{inputs:t,backend:e,attrs:r}=n,{value:i}=t,{axis:o}=r;o<0&&(o+=i.shape.length);let s=i.shape.length,a=i.shape[o],l=new Array(s-1),c=0;for(let d=0;d<s;d++)d!==o&&(l[c++]=i.shape[d]);let u=new Array(s).fill(0),h=i.shape.slice();h[o]=1;let p=new Array(a);for(let d=0;d<p.length;d++){u[o]=d;let f=zr({inputs:{x:i},backend:e,attrs:{begin:u,size:h}});p[d]=ce({inputs:{x:f},backend:e,attrs:{shape:l}}),e.disposeIntermediateTensorInfo(f)}return p}var oP={kernelName:Gg,backendName:"cpu",kernelFunc:ZX};function JX(n){let{inputs:t,backend:e,attrs:r}=n,{x:i,segmentIds:o}=t,{numSegments:s}=r;ut(i,"unsortedSegmentSum");let a=i.shape.length,l=o.shape.length,c=[],u=[],h=a-l,p=o;for(let f=0;f<h;++f){let m=Yl({inputs:{input:p},backend:e,attrs:{dim:f+1}});p=m,u.push(m)}for(let f=0;f<s;++f){let m=R.createScalarValue(f,"int32"),x=e.makeTensorInfo([],"int32",m),g=W_({inputs:{a:x,b:p},backend:e}),v=Nr({inputs:{x:g},backend:e,attrs:{dtype:"float32"}}),b=ra({inputs:{a:v,b:i},backend:e}),y=oo({inputs:{x:b},backend:e,attrs:{axis:0,keepDims:!1}});c.push(y),u.push(x),u.push(g),u.push(v),u.push(b),u.push(y)}let d=X_({inputs:c,backend:e,attrs:{axis:0}});return u.forEach(f=>e.disposeIntermediateTensorInfo(f)),d}var sP={kernelName:jg,backendName:"cpu",kernelFunc:JX};var QX=[HI,uI,$I,UI,mI,WI,GI,jI,qI,XI,KI,YI,ZI,JI,QI,ek,nk,rk,ik,VI,ok,sk,ak,fI,gI,lk,hI,ck,hk,dk,fk,pk,gk,xk,mk,vk,yk,bk,_k,wk,Sk,Ck,Mk,Ek,Tk,Ak,kk,Ik,lp,Pk,LI,Nk,Lk,Dk,xI,zk,vI,Fk,Ok,Bk,yI,Vk,Hk,$k,Uk,Wk,bI,Gk,pI,jk,uk,qk,Xk,Kk,DI,_I,Yk,Zk,wI,Jk,Qk,tR,eR,nR,rR,SI,oR,sR,aR,lR,uR,iR,hR,pR,CI,dR,fR,xR,MI,EI,vR,yR,bR,TI,_R,CR,MR,E1,ER,zI,II,TR,dI,AR,FI,OI,BI,IR,kR,RR,PR,NR,LR,DR,kI,zR,FR,OR,BR,VR,HR,$R,RI,mR,WR,GR,jR,qR,XR,KR,PI,YR,ZR,NI,Rk,JR,QR,tP,eP,AI,rP,iP,oP,sP,wR];for(let n of QX)Qg(n);var ia={},K_={alpha:!1,antialias:!1,premultipliedAlpha:!1,preserveDrawingBuffer:!1,depth:!1,stencil:!1,failIfMajorPerformanceCaveat:!0};function aP(n,t){ia[n]=t}function gr(n){if(!(n in ia)){let e=eK(n);if(e!==null)ia[n]=e;else return console.log("Could not get context for WebGL version",n),null}let t=ia[n];return t.isContextLost()?(delete ia[n],gr(n)):(t.disable(t.DEPTH_TEST),t.disable(t.STENCIL_TEST),t.disable(t.BLEND),t.disable(t.DITHER),t.disable(t.POLYGON_OFFSET_FILL),t.disable(t.SAMPLE_COVERAGE),t.enable(t.SCISSOR_TEST),t.enable(t.CULL_FACE),t.cullFace(t.BACK),ia[n])}function tK(n){if(typeof OffscreenCanvas!="undefined"&&n===2)return new OffscreenCanvas(300,150);if(typeof document!="undefined")return document.createElement("canvas");throw new Error("Cannot create a canvas in this context")}function eK(n){if(n!==1&&n!==2)throw new Error("Cannot get WebGL rendering context, WebGL is disabled.");let t=tK(n);return t.addEventListener("webglcontextlost",e=>{e.preventDefault(),delete ia[n]},!1),n===1?t.getContext("webgl",K_)||t.getContext("experimental-webgl",K_):t.getContext("webgl2",K_)}var Vo;(function(n){n[n.DENSE=0]="DENSE",n[n.SHARED_BATCH=1]="SHARED_BATCH"})(Vo||(Vo={}));var Pn;(function(n){n[n.RENDER=0]="RENDER",n[n.UPLOAD=1]="UPLOAD",n[n.PIXELS=2]="PIXELS",n[n.DOWNLOAD=3]="DOWNLOAD"})(Pn||(Pn={}));var vn;(function(n){n[n.UNPACKED_FLOAT16=0]="UNPACKED_FLOAT16",n[n.UNPACKED_FLOAT32=1]="UNPACKED_FLOAT32",n[n.PACKED_4X1_UNSIGNED_BYTE=2]="PACKED_4X1_UNSIGNED_BYTE",n[n.PACKED_2X2_FLOAT32=3]="PACKED_2X2_FLOAT32",n[n.PACKED_2X2_FLOAT16=4]="PACKED_2X2_FLOAT16"})(vn||(vn={}));function oa(n,t){return[t,n]}function lP(n,t){return n*t}function Ho(n){let t=R.sizeFromShape(n),e=Math.ceil(t/4);return R.sizeToSquarishShape(e)}function Ei(n,t){return[Math.max(1,Math.ceil(t/2)),Math.max(1,Math.ceil(n/2))]}function cP(n,t){let[e,r]=Ei(n,t);return e*r*4}function pp(n,t){let e=n,r,i,o,s,a,l,c,u,h,p;return ot().getNumber("WEBGL_VERSION")===2?(r=e.R32F,i=e.R16F,o=e.RGBA16F,s=e.RGBA32F,a=e.RED,c=4,u=1,h=e.HALF_FLOAT,p=e.FLOAT):(r=n.RGBA,i=n.RGBA,o=n.RGBA,s=e.RGBA,a=n.RGBA,c=4,u=4,h=t!=null?t.HALF_FLOAT_OES:null,p=n.FLOAT),l=n.RGBA,{internalFormatFloat:r,internalFormatHalfFloat:i,internalFormatPackedHalfFloat:o,internalFormatPackedFloat:s,textureFormatFloat:a,downloadTextureFormat:l,downloadUnpackNumChannels:c,defaultNumChannels:u,textureTypeHalfFloat:h,textureTypeFloat:p}}function Gt(n,t){let e=t();return ot().getBool("DEBUG")&&nK(n),e}function nK(n){let t=n.getError();if(t!==n.NO_ERROR)throw new Error("WebGL Error: "+oK(n,t))}var rK=596e-10,iK=65504;function uP(n){return!!(ot().getBool("WEBGL_RENDER_FLOAT32_ENABLED")||n===0||rK<Math.abs(n)&&Math.abs(n)<iK)}function oK(n,t){switch(t){case n.NO_ERROR:return"NO_ERROR";case n.INVALID_ENUM:return"INVALID_ENUM";case n.INVALID_VALUE:return"INVALID_VALUE";case n.INVALID_OPERATION:return"INVALID_OPERATION";case n.INVALID_FRAMEBUFFER_OPERATION:return"INVALID_FRAMEBUFFER_OPERATION";case n.OUT_OF_MEMORY:return"OUT_OF_MEMORY";case n.CONTEXT_LOST_WEBGL:return"CONTEXT_LOST_WEBGL";default:return`Unknown error code ${t}`}}function dp(n,t){return so(n,()=>n.getExtension(t),'Extension "'+t+'" not supported on this browser.')}function hP(n,t){let e=so(n,()=>n.createShader(n.VERTEX_SHADER),"Unable to create vertex WebGLShader.");if(Gt(n,()=>n.shaderSource(e,t)),Gt(n,()=>n.compileShader(e)),n.getShaderParameter(e,n.COMPILE_STATUS)===!1)throw console.log(n.getShaderInfoLog(e)),new Error("Failed to compile vertex shader.");return e}function pP(n,t){let e=so(n,()=>n.createShader(n.FRAGMENT_SHADER),"Unable to create fragment WebGLShader.");if(Gt(n,()=>n.shaderSource(e,t)),Gt(n,()=>n.compileShader(e)),n.getShaderParameter(e,n.COMPILE_STATUS)===!1)throw aK(t,n.getShaderInfoLog(e)),new Error("Failed to compile fragment shader.");return e}var sK=/ERROR: [0-9]+:([0-9]+):/g;function aK(n,t){let e=sK.exec(t);if(e==null){console.log(`Couldn't parse line number in error: ${t}`),console.log(n);return}let r=+e[1],i=n.split(`
`),o=i.length.toString().length+2,s=i.map((h,p)=>R.rightPad((p+1).toString(),o)+h),a=0;for(let h=0;h<s.length;h++)a=Math.max(s[h].length,a);let l=s.slice(0,r-1),c=s.slice(r-1,r),u=s.slice(r);console.log(l.join(`
`)),console.log(t.split(`
`)[0]),console.log(`%c ${R.rightPad(c[0],a)}`,"border:1px solid red; background-color:#e3d2d2; color:#a61717"),console.log(u.join(`
`))}function dP(n){return so(n,()=>n.createProgram(),"Unable to create WebGLProgram.")}function fP(n,t){if(Gt(n,()=>n.linkProgram(t)),n.getProgramParameter(t,n.LINK_STATUS)===!1)throw console.log(n.getProgramInfoLog(t)),new Error("Failed to link vertex and fragment shaders.")}function I1(n,t){if(Gt(n,()=>n.validateProgram(t)),n.getProgramParameter(t,n.VALIDATE_STATUS)===!1)throw console.log(n.getProgramInfoLog(t)),new Error("Shader program validation failed.")}function mP(n,t){let e=so(n,()=>n.createBuffer(),"Unable to create WebGLBuffer");return Gt(n,()=>n.bindBuffer(n.ARRAY_BUFFER,e)),Gt(n,()=>n.bufferData(n.ARRAY_BUFFER,t,n.STATIC_DRAW)),e}function gP(n,t){let e=so(n,()=>n.createBuffer(),"Unable to create WebGLBuffer");return Gt(n,()=>n.bindBuffer(n.ELEMENT_ARRAY_BUFFER,e)),Gt(n,()=>n.bufferData(n.ELEMENT_ARRAY_BUFFER,t,n.STATIC_DRAW)),e}function xP(n){return so(n,()=>n.createTexture(),"Unable to create WebGLTexture.")}function vP(n,t){let e=ot().getNumber("WEBGL_MAX_TEXTURE_SIZE");if(n<=0||t<=0){let r=`[${n}x${t}]`;throw new Error("Requested texture size "+r+" is invalid.")}if(n>e||t>e){let r=`[${n}x${t}]`,i=`[${e}x${e}]`;throw new Error("Requested texture size "+r+" greater than WebGL maximum on this browser / GPU "+i+".")}}function yP(n){return so(n,()=>n.createFramebuffer(),"Unable to create WebGLFramebuffer.")}function tw(n,t,e,r,i,o,s){let a=n.getAttribLocation(t,e);return a===-1?!1:(Gt(n,()=>n.bindBuffer(n.ARRAY_BUFFER,r)),Gt(n,()=>n.vertexAttribPointer(a,i,n.FLOAT,!1,o,s)),Gt(n,()=>n.enableVertexAttribArray(a)),!0)}function lK(n,t,e){uK(n,e),Gt(n,()=>n.activeTexture(n.TEXTURE0+e)),Gt(n,()=>n.bindTexture(n.TEXTURE_2D,t))}function bP(n,t,e){return so(n,()=>n.getUniformLocation(t,e),'uniform "'+e+'" not present in program.')}function _P(n,t,e){return n.getUniformLocation(t,e)}function wP(n,t,e,r){Gt(n,()=>lK(n,t,r)),Gt(n,()=>n.uniform1i(e,r))}function k1(n,t,e){Gt(n,()=>n.bindFramebuffer(n.FRAMEBUFFER,e)),Gt(n,()=>n.framebufferTexture2D(n.FRAMEBUFFER,n.COLOR_ATTACHMENT0,n.TEXTURE_2D,t,0))}function ew(n,t){Gt(n,()=>n.bindFramebuffer(n.FRAMEBUFFER,t)),Gt(n,()=>n.framebufferTexture2D(n.FRAMEBUFFER,n.COLOR_ATTACHMENT0,n.TEXTURE_2D,null,0))}function fp(n){let t=n.checkFramebufferStatus(n.FRAMEBUFFER);if(t!==n.FRAMEBUFFER_COMPLETE)throw new Error("Error binding framebuffer: "+cK(n,t))}function cK(n,t){switch(t){case n.FRAMEBUFFER_INCOMPLETE_ATTACHMENT:return"FRAMEBUFFER_INCOMPLETE_ATTACHMENT";case n.FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT:return"FRAMEBUFFER_INCOMPLETE_MISSING_ATTACHMENT";case n.FRAMEBUFFER_INCOMPLETE_DIMENSIONS:return"FRAMEBUFFER_INCOMPLETE_DIMENSIONS";case n.FRAMEBUFFER_UNSUPPORTED:return"FRAMEBUFFER_UNSUPPORTED";default:return`unknown error ${t}`}}function so(n,t,e){let r=Gt(n,()=>t());if(r==null)throw new Error(e);return r}function uK(n,t){let e=n.MAX_COMBINED_TEXTURE_IMAGE_UNITS-1,r=t+n.TEXTURE0;if(r<n.TEXTURE0||r>e){let i=`[gl.TEXTURE0, gl.TEXTURE${e}]`;throw new Error(`textureUnit must be in ${i}.`)}}function $o(n,t=2){return R.sizeFromShape(n.slice(0,n.length-t))}function Uo(n){if(n.length===0)throw Error("Cannot get rows and columns of an empty shape array.");return[n.length>1?n[n.length-2]:1,n[n.length-1]]}function R1(n){let t=[1,1,1];return n.length===0||n.length===1&&n[0]===1||(t=[$o(n),...Uo(n)]),t}function SP(n,t=!1){let e=ot().getNumber("WEBGL_MAX_TEXTURE_SIZE");t&&(e=e*2,n=n.map((i,o)=>o>=n.length-2?R.nearestLargerEven(n[o]):n[o]),n.length===1&&(n=[2,n[0]])),n.length!==2&&(n=R.squeezeShape(n).newShape);let r=R.sizeFromShape(n);if(n.length<=1&&r<=e)return[1,r];if(n.length===2&&n[0]<=e&&n[1]<=e)return n;if(n.length===3&&n[0]*n[1]<=e&&n[2]<=e)return[n[0]*n[1],n[2]];if(n.length===3&&n[0]<=e&&n[1]*n[2]<=e)return[n[0],n[1]*n[2]];if(n.length===4&&n[0]*n[1]*n[2]<=e&&n[3]<=e)return[n[0]*n[1]*n[2],n[3]];if(n.length===4&&n[0]<=e&&n[1]*n[2]*n[3]<=e)return[n[0],n[1]*n[2]*n[3]];if(t){let i=$o(n),o=2,s=2;return n.length&&([o,s]=Uo(n)),r=i*(o/2)*(s/2),R.sizeToSquarishShape(r).map(a=>a*2)}return R.sizeToSquarishShape(r)}function A1(n){return n%2===0}function sa(n,t){if(n=n.slice(-2),t=t.slice(-2),R.arraysEqual(n,t)||!n.length||!t.length||n[0]===0||n[1]===0||t[0]===0||t[1]===0)return!0;if(n.length!==t.length){let e=n.slice(-1)[0],r=t.slice(-1)[0];if(e===r||A1(e)&&A1(r)&&(n[0]===1||t[0]===1))return!0}return n[1]===t[1]&&A1(n[0])&&A1(t[0])}var Z_,J_;function CP(n){if(Z_==null){let t=gr(n);Z_=t.getParameter(t.MAX_TEXTURE_SIZE)}return Z_}function MP(n){if(J_==null){let t=gr(n);J_=t.getParameter(t.MAX_TEXTURE_IMAGE_UNITS)}return Math.min(16,J_)}function EP(n){if(n===0)return 0;let t,e=gr(n);return xr(e,"EXT_disjoint_timer_query_webgl2")&&n===2?t=2:xr(e,"EXT_disjoint_timer_query")?t=1:t=0,t}function xr(n,t){return n.getExtension(t)!=null}function nw(n){try{if(gr(n)!=null)return!0}catch(t){return console.log("Error when getting WebGL context: ",t),!1}return!1}function TP(n){if(n===0)return!1;let t=gr(n);if(n===1){if(!xr(t,"OES_texture_float"))return!1}else if(!xr(t,"EXT_color_buffer_float"))return!1;return Q_(t)}function AP(n){if(n===0)return!1;let t=gr(n);if(n===1){if(!xr(t,"OES_texture_float")||!xr(t,"WEBGL_color_buffer_float"))return!1}else{if(xr(t,"EXT_color_buffer_float"))return Q_(t);let r="EXT_color_buffer_half_float";if(xr(t,r)){let i=t.getExtension(r);return hK(t,i)}return!1}return Q_(t)}function Q_(n){let t=pp(n),e=n.createTexture();n.bindTexture(n.TEXTURE_2D,e);let r=1,i=1;n.texImage2D(n.TEXTURE_2D,0,t.internalFormatFloat,r,i,0,t.textureFormatFloat,t.textureTypeFloat,null);let o=n.createFramebuffer();n.bindFramebuffer(n.FRAMEBUFFER,o),n.framebufferTexture2D(n.FRAMEBUFFER,n.COLOR_ATTACHMENT0,n.TEXTURE_2D,e,0);let s=n.checkFramebufferStatus(n.FRAMEBUFFER)===n.FRAMEBUFFER_COMPLETE;return n.bindTexture(n.TEXTURE_2D,null),n.bindFramebuffer(n.FRAMEBUFFER,null),n.deleteTexture(e),n.deleteFramebuffer(o),s}function hK(n,t){let e=pp(n,t),r=n.createTexture();n.bindTexture(n.TEXTURE_2D,r);let i=1,o=1;n.texImage2D(n.TEXTURE_2D,0,e.internalFormatHalfFloat,i,o,0,e.textureFormatFloat,e.textureTypeHalfFloat,null);let s=n.createFramebuffer();n.bindFramebuffer(n.FRAMEBUFFER,s),n.framebufferTexture2D(n.FRAMEBUFFER,n.COLOR_ATTACHMENT0,n.TEXTURE_2D,r,0);let a=n.checkFramebufferStatus(n.FRAMEBUFFER)===n.FRAMEBUFFER_COMPLETE;return n.bindTexture(n.TEXTURE_2D,null),n.bindFramebuffer(n.FRAMEBUFFER,null),n.deleteTexture(r),n.deleteFramebuffer(s),a}function IP(n){return n!==2?!1:gr(n).fenceSync!=null}function Ti(n,t){Array.isArray(n)||(n=[n]),n.forEach(e=>{e!=null&&R.assert(e.dtype!=="complex64",()=>`${t} does not support complex64 tensors in the WebGL backend.`)})}var te=ot();te.registerFlag("HAS_WEBGL",()=>te.getNumber("WEBGL_VERSION")>0);te.registerFlag("WEBGL_VERSION",()=>nw(2)?2:nw(1)?1:0);te.registerFlag("WEBGL_CHECK_NUMERICAL_PROBLEMS",()=>!1);te.registerFlag("WEBGL_BUFFER_SUPPORTED",()=>te.get("WEBGL_VERSION")===2);te.registerFlag("WEBGL_CPU_FORWARD",()=>!0);te.registerFlag("WEBGL_FORCE_F16_TEXTURES",()=>!1);te.registerFlag("WEBGL_PACK",()=>te.getBool("HAS_WEBGL"));te.registerFlag("WEBGL_PACK_NORMALIZATION",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_CLIP",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_DEPTHWISECONV",()=>!0);te.registerFlag("WEBGL_PACK_BINARY_OPERATIONS",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_UNARY_OPERATIONS",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_ARRAY_OPERATIONS",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_IMAGE_OPERATIONS",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_PACK_REDUCE",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_LAZILY_UNPACK",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_CONV_IM2COL",()=>te.getBool("WEBGL_PACK"));te.registerFlag("WEBGL_MAX_TEXTURE_SIZE",()=>CP(te.getNumber("WEBGL_VERSION")));te.registerFlag("WEBGL_MAX_TEXTURES_IN_SHADER",()=>MP(te.getNumber("WEBGL_VERSION")));te.registerFlag("WEBGL_DISJOINT_QUERY_TIMER_EXTENSION_VERSION",()=>{let n=te.getNumber("WEBGL_VERSION");return n===0?0:EP(n)});te.registerFlag("WEBGL_DISJOINT_QUERY_TIMER_EXTENSION_RELIABLE",()=>te.getNumber("WEBGL_DISJOINT_QUERY_TIMER_EXTENSION_VERSION")>0&&!Fo.isMobile());te.registerFlag("WEBGL_RENDER_FLOAT32_CAPABLE",()=>TP(te.getNumber("WEBGL_VERSION")));te.registerFlag("WEBGL_RENDER_FLOAT32_ENABLED",()=>te.getBool("WEBGL_FORCE_F16_TEXTURES")?!1:te.getBool("WEBGL_RENDER_FLOAT32_CAPABLE"));te.registerFlag("WEBGL_DOWNLOAD_FLOAT_ENABLED",()=>AP(te.getNumber("WEBGL_VERSION")));te.registerFlag("WEBGL_FENCE_API_ENABLED",()=>IP(te.getNumber("WEBGL_VERSION")));te.registerFlag("WEBGL_SIZE_UPLOAD_UNIFORM",()=>te.getBool("WEBGL_RENDER_FLOAT32_ENABLED")?4:0);te.registerFlag("WEBGL_DELETE_TEXTURE_THRESHOLD",()=>-1,n=>{if(n<0&&n!==-1)throw new Error(`WEBGL_DELETE_TEXTURE_THRESHOLD must be -1 (indicating never delete) or at least 0, but got ${n}.`)});te.registerFlag("WEBGL_FLUSH_THRESHOLD",()=>Fo.isMobile()&&te.getBool("IS_CHROME")?1:-1,n=>{if(n<0&&n!==-1)throw new Error(`WEBGL_FLUSH_THRESHOLD must be -1 (indicating never manual flush) or at least 0, but got ${n}.`)});function Le(){let n,t,e,r,i,o,s,a,l,c;return ot().getNumber("WEBGL_VERSION")===2?(n="#version 300 es",t="in",e="out",r="in",i="texture",o="outputColor",s="out vec4 outputColor;",a=`
bool isnan_custom(float val) {
return (val > 0.0 || val < 0.0) ? false : val != 0.0;
(c)?console.warn(
(c)
c = self.stream.char()
# Convert the set of characters consumed to an int.
charAsInt = int("".join(charStack), radix)
(c)
elif c == b">":
return b"".join(attrName), b""
elif c in asciiUppercaseBytes:
(c) for c in characters
if not opposite:
(c) * invWidthScale);
int startDyC = int(floor(startCLerp - float(winWidth / 2)));
// Loop over dy
for (int dyROffset = 0; dyROffset < winHeight; dyROffset++) {
int dyR = dyROffset + startDyR;
(c) * invWidthScale);
int startDyC = int(startCLerp - float(winWidth / 2));
// Loop over dy
for (int dyROffset = 0; dyROffset < winHeight; dyROffset++) {
int dyR = dyROffset + startDyR;
(c)?l._createNotifyingProperty(c):u.notify===
`)}return r&&(n.selector&&(e+=n.selector+" "+u4+`
`),e+=r,n.selector&&(e+=h4+`
`)),e}function KB(n){let t=n[0];return Boolean(t)&&Boolean(t.selector)&&t.selector.indexOf(p4)===0}function YB(n){return n=ZB(n),JB(n)}function ZB(n){return n.replace(Ki.customProp,"").replace(Ki.mixinProp,"")}function JB(n){return n.replace(Ki.mixinApply,"").replace(Ki.varApply,"")}var Xi={STYLE_RULE:1,KEYFRAMES_RULE:7,MEDIA_RULE:4,MIXIN_RULE:1e3},u4="{",h4="}",Ki={comments:/\/\*[^*]*\*+([^/*][^*]*\*+)*\//gim,port:/@import[^;]*;/gim,customProp:/(?:^[^;\-\s}]+)?--[^;{}]*?:[^{};]*?(?:[;\n]|$)/gim,mixinProp:/(?:^[^;\-\s}]+)?--[^;{}]*?:[^{};]*?{[^}]*?}(?:[;\n]|$)?/gim,mixinApply:/@apply\s*\(?[^);]*\)?\s*(?:[;\n]|$)?/gim,varApply:/[^;:]*?:[^;]*?var\([^;]*\)(?:[;\n]|$)?/gim,keyframesRule:/^@[^\s]*keyframes/,multipleSpaces:/\s+/g},p4="--",QB="@media",tV="@";var Ru=/(?:^|[;\s{]\s*)(--[\w-]*?)\s*:\s*(?:((?:'(?:\\'|.)*?'|"(?:\\"|.)*?"|\([^)]*?\)|[^};{])+)|\{([^}]*)\}(?:(?=[;\s}])|$))/gi,rl=/(?:^|\W+)@apply\s*\(?([^);\n]*)\)?/gi;var d4=/@media\s(.*)/;var f4=new Set,eV="shady-unscoped";function m4(n){let t=n.textContent;if(!f4.has(t)){f4.add(t);let e=document.createElement("style");e.setAttribute("shady-unscoped",""),e.textContent=t,document.head.appendChild(e)}}function g4(n){return n.hasAttribute(eV)}function Pu(n,t){return n?(typeof n=="string"&&(n=Zy(n)),t&&il(n,t),Jy(n,nl)):""}function Qy(n){return!n.__cssRules&&n.textContent&&(n.__cssRules=Zy(n.textContent)),n.__cssRules||null}function il(n,t,e,r){if(!n)return;let i=!1,o=n.type;if(r&&o===Xi.MEDIA_RULE){let a=n.selector.match(d4);a&&(window.matchMedia(a[1]).matches||(i=!0))}o===Xi.STYLE_RULE?t(n):e&&o===Xi.KEYFRAMES_RULE?e(n):o===Xi.MIXIN_RULE&&(i=!0);let s=n.rules;if(s&&!i)for(let a=0,l=s.length,c;a<l&&(c=s[a]);a++)il(c,t,e,r)}function nV(n,t){let e=0;for(let r=t,i=n.length;r<i;r++)if(n[r]==="(")e++;else if(n[r]===")"&&--e===0)return r;return-1}function t2(n,t){let e=n.indexOf("var(");if(e===-1)return t(n,"","","");let r=nV(n,e+3),i=n.substring(e+4,r),o=n.substring(0,e),s=t2(n.substring(r+1),t),a=i.indexOf(",");if(a===-1)return t(o,i.trim(),"",s);let l=i.substring(0,a).trim(),c=i.substring(a+1).trim();return t(o,l,c,s)}var vpt=window.ShadyDOM&&window.ShadyDOM.wrap||(n=>n);function x4(n){let t=n.localName,e="",r="";return t?t.indexOf("-")>-1?e=t:(r=t,e=n.getAttribute&&n.getAttribute("is")||""):(e=n.is,r=n.extends),{is:e,typeExtension:r}}function v4(n){let t=[],e=n.querySelectorAll("style");for(let r=0;r<e.length;r++){let i=e[r];g4(i)?ks||(m4(i),i.parentNode.removeChild(i)):(t.push(i.textContent),i.parentNode.removeChild(i))}return t.join("").trim()}var y4="css-build";function rV(n){if(To!==void 0)return To;if(n.__cssBuild===void 0){let t=n.getAttribute(y4);if(t)n.__cssBuild=t;else{let e=iV(n);e!==""&&oV(n),n.__cssBuild=e}}return n.__cssBuild||""}function e2(n){return rV(n)!==""}function iV(n){let t=n.localName==="template"?n.content.firstChild:n.firstChild;if(t instanceof Comment){let e=t.textContent.trim().split(":");if(e[0]===y4)return e[1]}return""}function oV(n){let t=n.localName==="template"?n.content.firstChild:n.firstChild;t.parentNode.removeChild(t)}function Nu(n,t){for(let e in t)e===null?n.style.removeProperty(e):n.style.setProperty(e,t[e])}function bf(n,t){let e=window.getComputedStyle(n).getPropertyValue(t);return e?e.trim():""}function b4(n){let t=rl.test(n)||Ru.test(n);return rl.lastIndex=0,Ru.lastIndex=0,t}var sV=/;\s*/m,aV=/^\s*(initial)|(inherit)\s*$/,_4=/\s*!important/,n2="_-_";var r2=class{constructor(){this._map={}}set(t,e){t=t.trim(),this._map[t]={properties:e,dependants:{}}}get(t){return t=t.trim(),this._map[t]||null}},_f=null,Bn=class{constructor(){this._currentElement=null,this._measureElement=null,this._map=new r2}detectMixin(t){return b4(t)}gatherStyles(t){let e=v4(t.content);if(e){let r=document.createElement("style");return r.textContent=e,t.content.insertBefore(r,t.content.firstChild),r}return null}transformTemplate(t,e){t._gatheredStyle===void 0&&(t._gatheredStyle=this.gatherStyles(t));let r=t._gatheredStyle;return r?this.transformStyle(r,e):null}transformStyle(t,e=""){let r=Qy(t);return this.transformRules(r,e),t.textContent=Pu(r),r}transformCustomStyle(t){let e=Qy(t);return il(e,r=>{r.selector===":root"&&(r.selector="html"),this.transformRule(r)}),t.textContent=Pu(e),e}transformRules(t,e){this._currentElement=e,il(t,r=>{this.transformRule(r)}),this._currentElement=null}transformRule(t){t.cssText=this.transformCssText(t.parsedCssText,t),t.selector===":root"&&(t.selector=":host > *")}transformCssText(t,e){return t=t.replace(Ru,(r,i,o,s)=>this._produceCssProperties(r,i,o,s,e)),this._consumeCssProperties(t,e)}_getInitialValueForProperty(t){return this._measureElement||(this._measureElement=document.createElement("meta"),this._measureElement.setAttribute("apply-shim-measure",""),this._measureElement.style.all="initial",document.head.appendChild(this._measureElement)),window.getComputedStyle(this._measureElement).getPropertyValue(t)}_fallbacksFromPreviousRules(t){let e=t;for(;e.parent;)e=e.parent;let r={},i=!1;return il(e,o=>{i=i||o===t,!i&&o.selector===t.selector&&Object.assign(r,this._cssTextToMap(o.parsedCssText))}),r}_consumeCssProperties(t,e){let r=null;for(;r=rl.exec(t);){let i=r[0],o=r[1],s=r.index,a=s+i.indexOf("@apply"),l=s+i.length,c=t.slice(0,a),u=t.slice(l),h=e?this._fallbacksFromPreviousRules(e):{};Object.assign(h,this._cssTextToMap(c));let p=this._atApplyToCssProperties(o,h);t=`${c}${p}${u}`,rl.lastIndex=s+p.length}return t}_atApplyToCssProperties(t,e){t=t.replace(sV,"");let r=[],i=this._map.get(t);if(i||(this._map.set(t,{}),i=this._map.get(t)),i){this._currentElement&&(i.dependants[this._currentElement]=!0);let o,s,a,l=i.properties;for(o in l)a=e&&e[o],s=[o,": var(",t,n2,o],a&&s.push(",",a.replace(_4,"")),s.push(")"),_4.test(l[o])&&s.push(" !important"),r.push(s.join(""))}return r.join("; ")}_replaceInitialOrInherit(t,e){let r=aV.exec(e);return r&&(r[1]?e=this._getInitialValueForProperty(t):e="apply-shim-inherit"),e}_cssTextToMap(t,e=!1){let r=t.split(";"),i,o,s={};for(let a=0,l,c;a<r.length;a++)l=r[a],l&&(c=l.split(":"),c.length>1&&(i=c[0].trim(),o=c.slice(1).join(":"),e&&(o=this._replaceInitialOrInherit(i,o)),s[i]=o));return s}_invalidateMixinEntry(t){if(!!_f)for(let e in t.dependants)e!==this._currentElement&&_f(e)}_produceCssProperties(t,e,r,i,o){if(r&&t2(r,(x,g)=>{g&&this._map.get(g)&&(i=`@apply ${g};`)}),!i)return t;let s=this._consumeCssProperties(""+i,o),a=t.slice(0,t.indexOf("--")),l=this._cssTextToMap(s,!0),c=l,u=this._map.get(e),h=u&&u.properties;h?c=Object.assign(Object.create(h),l):this._map.set(e,c);let p=[],d,f,m=!1;for(d in c)f=l[d],f===void 0&&(f="initial"),h&&!(d in h)&&(m=!0),p.push(`${e}${n2}${d}: ${f}`);return m&&this._invalidateMixinEntry(u),u&&(u.properties=c),r&&(a=`${t};${a}`),`${a}${p.join("; ")};`}};Bn.prototype.detectMixin=Bn.prototype.detectMixin;Bn.prototype.transformStyle=Bn.prototype.transformStyle;Bn.prototype.transformCustomStyle=Bn.prototype.transformCustomStyle;Bn.prototype.transformRules=Bn.prototype.transformRules;Bn.prototype.transformRule=Bn.prototype.transformRule;Bn.prototype.transformTemplate=Bn.prototype.transformTemplate;Bn.prototype._separator=n2;Object.defineProperty(Bn.prototype,"invalidCallback",{get(){return _f},set(n){_f=n}});var w4=Bn;var lV={},Lu=lV;var wf="_applyShimCurrentVersion",ol="_applyShimNextVersion",Sf="_applyShimValidatingVersion",cV=Promise.resolve();function S4(n){let t=Lu[n];t&&uV(t)}function uV(n){n[wf]=n[wf]||0,n[Sf]=n[Sf]||0,n[ol]=(n[ol]||0)+1}function i2(n){return n[wf]===n[ol]}function C4(n){return!i2(n)&&n[Sf]===n[ol]}function M4(n){n[Sf]=n[ol],n._validating||(n._validating=!0,cV.then(function(){n[wf]=n[ol],n._validating=!1}))}var o2=null,E4=window.HTMLImports&&window.HTMLImports.whenReady||null,s2;function Cf(n){requestAnimationFrame(function(){E4?E4(n):(o2||(o2=new Promise(t=>{s2=t}),document.readyState==="complete"?s2():document.addEventListener("readystatechange",()=>{document.readyState==="complete"&&s2()})),o2.then(function(){n&&n()}))})}var T4="__seenByShadyCSS",Mf="__shadyCSSCachedStyle",Ef=null,Du=null,Tr=class{constructor(){this.customStyles=[],this.enqueued=!1,Cf(()=>{window.ShadyCSS.flushCustomStyles&&window.ShadyCSS.flushCustomStyles()})}enqueueDocumentValidation(){this.enqueued||!Du||(this.enqueued=!0,Cf(Du))}addCustomStyle(t){t[T4]||(t[T4]=!0,this.customStyles.push(t),this.enqueueDocumentValidation())}getStyleForCustomStyle(t){if(t[Mf])return t[Mf];let e;return t.getStyle?e=t.getStyle():e=t,e}processStyles(){let t=this.customStyles;for(let e=0;e<t.length;e++){let r=t[e];if(r[Mf])continue;let i=this.getStyleForCustomStyle(r);if(i){let o=i.__appliedElement||i;Ef&&Ef(o),r[Mf]=o}}return t}};Tr.prototype.addCustomStyle=Tr.prototype.addCustomStyle;Tr.prototype.getStyleForCustomStyle=Tr.prototype.getStyleForCustomStyle;Tr.prototype.processStyles=Tr.prototype.processStyles;Object.defineProperties(Tr.prototype,{transformCallback:{get(){return Ef},set(n){Ef=n}},validateCallback:{get(){return Du},set(n){let t=!1;Du||(t=!0),Du=n,t&&this.enqueueDocumentValidation()}}});var zu=new w4,a2=class{constructor(){this.customStyleInterface=null,zu.invalidCallback=S4}ensure(){this.customStyleInterface||window.ShadyCSS.CustomStyleInterface&&(this.customStyleInterface=window.ShadyCSS.CustomStyleInterface,this.customStyleInterface.transformCallback=t=>{zu.transformCustomStyle(t)},this.customStyleInterface.validateCallback=()=>{requestAnimationFrame(()=>{this.customStyleInterface.enqueued&&this.flushCustomStyles()})})}prepareTemplate(t,e){if(this.ensure(),e2(t))return;Lu[e]=t;let r=zu.transformTemplate(t,e);t._styleAst=r}flushCustomStyles(){if(this.ensure(),!this.customStyleInterface)return;let t=this.customStyleInterface.processStyles();if(!!this.customStyleInterface.enqueued){for(let e=0;e<t.length;e++){let r=t[e],i=this.customStyleInterface.getStyleForCustomStyle(r);i&&zu.transformCustomStyle(i)}this.customStyleInterface.enqueued=!1}}styleSubtree(t,e){if(this.ensure(),e&&Nu(t,e),t.shadowRoot){this.styleElement(t);let r=t.shadowRoot.children||t.shadowRoot.childNodes;for(let i=0;i<r.length;i++)this.styleSubtree(r[i])}else{let r=t.children||t.childNodes;for(let i=0;i<r.length;i++)this.styleSubtree(r[i])}}styleElement(t){this.ensure();let{is:e}=x4(t),r=Lu[e];if(!(r&&e2(r))&&r&&!i2(r)){C4(r)||(this.prepareTemplate(r,e),M4(r));let i=t.shadowRoot;if(i){let o=i.querySelector("style");o&&(o.__cssRules=r._styleAst,o.textContent=Pu(r._styleAst))}}}styleDocument(t){this.ensure(),this.styleSubtree(document.body,t)}};if(!window.ShadyCSS||!window.ShadyCSS.ScopingShim){let n=new a2,t=window.ShadyCSS&&window.ShadyCSS.CustomStyleInterface;window.ShadyCSS={prepareTemplate(e,r,i){n.flushCustomStyles(),n.prepareTemplate(e,r)},prepareTemplateStyles(e,r,i){window.ShadyCSS.prepareTemplate(e,r,i)},prepareTemplateDom(e,r){},styleSubtree(e,r){n.flushCustomStyles(),n.styleSubtree(e,r)},styleElement(e){n.flushCustomStyles(),n.styleElement(e)},styleDocument(e){n.flushCustomStyles(),n.styleDocument(e)},getComputedStyleValue(e,r){return bf(e,r)},flushCustomStyles(){n.flushCustomStyles()},nativeCss:nl,nativeShadow:ks,cssBuild:To,disableRuntime:vf},t&&(window.ShadyCSS.CustomStyleInterface=t)}window.ShadyCSS.ApplyShim=zu;var Jn=class{constructor(){this._asyncModule=null,this._callback=null,this._timer=null}setConfig(t,e){this._asyncModule=t,this._callback=e,this._timer=this._asyncModule.run(()=>{this._timer=null,Fu.delete(this),this._callback()})}cancel(){this.isActive()&&(this._cancelAsync(),Fu.delete(this))}_cancelAsync(){this.isActive()&&(this._asyncModule.cancel(this._timer),this._timer=null)}flush(){this.isActive()&&(this.cancel(),this._callback())}isActive(){return this._timer!=null}static debounce(t,e,r){return t instanceof Jn?t._cancelAsync():t=new Jn,t.setConfig(e,r),t}},Fu=new Set,Ao=function(n){Fu.add(n)},A4=function(){let n=Boolean(Fu.size);return Fu.forEach(t=>{try{t.flush()}catch(e){setTimeout(()=>{throw e})}}),n};var h2=typeof document.head.style.touchAction=="string",Af="__polymerGestures",Tf="__polymerGesturesHandled",c2="__polymerGesturesTouchAction",I4=25,k4=5,pV=2,dV=2500,D4=["mousedown","mousemove","mouseup","click"],fV=[0,1,4,2],mV=function(){try{return new MouseEvent("test",{buttons:1}).buttons===1}catch(n){return!1}}();function p2(n){return D4.indexOf(n)>-1}var d2=!1;(function(){try{let n=Object.defineProperty({},"passive",{get(){d2=!0}});window.addEventListener("test",null,n),window.removeEventListener("test",null,n)}catch(n){}})();function z4(n){if(!(p2(n)||n==="touchend")&&h2&&d2&&j3)return{passive:!0}}var F4=navigator.userAgent.match(/iP(?:[oa]d|hone)|Android/),u2=[],gV={button:!0,input:!0,keygen:!0,meter:!0,output:!0,textarea:!0,progress:!0,select:!0},xV={button:!0,command:!0,fieldset:!0,input:!0,keygen:!0,optgroup:!0,option:!0,select:!0,textarea:!0};function vV(n){return gV[n.localName]||!1}function yV(n){let t=Array.prototype.slice.call(n.labels||[]);if(!t.length){t=[];let e=n.getRootNode();if(n.id){let r=e.querySelectorAll(`label[for = ${n.id}]`);for(let i=0;i<r.length;i++)t.push(r[i])}}return t}var R4=function(n){let t=n.sourceCapabilities;if(!(t&&!t.firesTouchEvents)&&(n[Tf]={skip:!0},n.type==="click")){let e=!1,r=kf(n);for(let i=0;i<r.length;i++){if(r[i].nodeType===Node.ELEMENT_NODE){if(r[i].localName==="label")u2.push(r[i]);else if(vV(r[i])){let o=yV(r[i]);for(let s=0;s<o.length;s++)e=e||u2.indexOf(o[s])>-1}}if(r[i]===Wn.mouse.target)return}if(e)return;n.preventDefault(),n.stopPropagation()}};function P4(n){let t=F4?["click"]:D4;for(let e=0,r;e<t.length;e++)r=t[e],n?(u2.length=0,document.addEventListener(r,R4,!0)):document.removeEventListener(r,R4,!0)}function bV(n){if(!Fy)return;Wn.mouse.mouseIgnoreJob||P4(!0);let t=function(){P4(),Wn.mouse.target=null,Wn.mouse.mouseIgnoreJob=null};Wn.mouse.target=kf(n)[0],Wn.mouse.mouseIgnoreJob=Jn.debounce(Wn.mouse.mouseIgnoreJob,Mo.after(dV),t)}function Ps(n){let t=n.type;if(!p2(t))return!1;if(t==="mousemove"){let e=n.buttons===void 0?1:n.buttons;return n instanceof window.MouseEvent&&!mV&&(e=fV[n.which]||0),Boolean(e&1)}else return(n.button===void 0?0:n.button)===0}function _V(n){if(n.type==="click"){if(n.detail===0)return!0;let t=Yi(n);if(!t.nodeType||t.nodeType!==Node.ELEMENT_NODE)return!0;let e=t.getBoundingClientRect(),r=n.pageX,i=n.pageY;return!(r>=e.left&&r<=e.right&&i>=e.top&&i<=e.bottom)}return!1}var Wn={mouse:{target:null,mouseIgnoreJob:null},touch:{x:0,y:0,id:-1,scrollDecided:!1}};function wV(n){let t="auto",e=kf(n);for(let r=0,i;r<e.length;r++)if(i=e[r],i[c2]){t=i[c2];break}return t}function O4(n,t,e){n.movefn=t,n.upfn=e,document.addEventListener("mousemove",t),document.addEventListener("mouseup",e)}function sl(n){document.removeEventListener("mousemove",n.movefn),document.removeEventListener("mouseup",n.upfn),n.movefn=null,n.upfn=null}Fy&&document.addEventListener("touchend",bV,d2?{passive:!0}:!1);var kf=window.ShadyDOM&&window.ShadyDOM.noPatch?window.ShadyDOM.composedPath:n=>n.composedPath&&n.composedPath()||[],Bu={},Rs=[];function SV(n,t){let e=document.elementFromPoint(n,t),r=e;for(;r&&r.shadowRoot&&!window.ShadyDOM;){let i=r;if(r=r.shadowRoot.elementFromPoint(n,t),i===r)break;r&&(e=r)}return e}function Yi(n){let t=kf(n);return t.length>0?t[0]:n.target}function B4(n){let t,e=n.type,i=n.currentTarget[Af];if(!i)return;let o=i[e];if(!!o){if(!n[Tf]&&(n[Tf]={},e.slice(0,5)==="touch")){n=n;let s=n.changedTouches[0];if(e==="touchstart"&&n.touches.length===1&&(Wn.touch.id=s.identifier),Wn.touch.id!==s.identifier)return;h2||(e==="touchstart"||e==="touchmove")&&CV(n)}if(t=n[Tf],!t.skip){for(let s=0,a;s<Rs.length;s++)a=Rs[s],o[a.name]&&!t[a.name]&&a.flow&&a.flow.start.indexOf(n.type)>-1&&a.reset&&a.reset();for(let s=0,a;s<Rs.length;s++)a=Rs[s],o[a.name]&&!t[a.name]&&(t[a.name]=!0,a[e](n))}}}function CV(n){let t=n.changedTouches[0],e=n.type;if(e==="touchstart")Wn.touch.x=t.clientX,Wn.touch.y=t.clientY,Wn.touch.scrollDecided=!1;else if(e==="touchmove"){if(Wn.touch.scrollDecided)return;Wn.touch.scrollDecided=!0;let r=wV(n),i=!1,o=Math.abs(Wn.touch.x-t.clientX),s=Math.abs(Wn.touch.y-t.clientY);n.cancelable&&(r==="none"?i=!0:r==="pan-x"?i=s>o:r==="pan-y"&&(i=o>s)),i?n.preventDefault():If("track")}}function Rf(n,t,e){return Bu[t]?(MV(n,t,e),!0):!1}function V4(n,t,e){return Bu[t]?(EV(n,t,e),!0):!1}function MV(n,t,e){let r=Bu[t],i=r.deps,o=r.name,s=n[Af];s||(n[Af]=s={});for(let a=0,l,c;a<i.length;a++)l=i[a],!(F4&&p2(l)&&l!=="click")&&(c=s[l],c||(s[l]=c={_count:0}),c._count===0&&n.addEventListener(l,B4,z4(l)),c[o]=(c[o]||0)+1,c._count=(c._count||0)+1);n.addEventListener(t,e),r.touchAction&&Ns(n,r.touchAction)}function EV(n,t,e){let r=Bu[t],i=r.deps,o=r.name,s=n[Af];if(s)for(let a=0,l,c;a<i.length;a++)l=i[a],c=s[l],c&&c[o]&&(c[o]=(c[o]||1)-1,c._count=(c._count||1)-1,c._count===0&&n.removeEventListener(l,B4,z4(l)));n.removeEventListener(t,e)}function f2(n){Rs.push(n);for(let t=0;t<n.emits.length;t++)Bu[n.emits[t]]=n}function TV(n){for(let t=0,e;t<Rs.length;t++){e=Rs[t];for(let r=0,i;r<e.emits.length;r++)if(i=e.emits[r],i===n)return e}return null}function Ns(n,t){h2&&n instanceof HTMLElement&&On.run(()=>{n.style.touchAction=t}),n[c2]=t}function m2(n,t,e){let r=new Event(t,{bubbles:!0,cancelable:!0,composed:!0});if(r.detail=e,Ft(n).dispatchEvent(r),r.defaultPrevented){let i=e.preventer||e.sourceEvent;i&&i.preventDefault&&i.preventDefault()}}function If(n){let t=TV(n);t.info&&(t.info.prevent=!0)}f2({name:"downup",deps:["mousedown","touchstart","touchend"],flow:{start:["mousedown","touchstart"],end:["mouseup","touchend"]},emits:["down","up"],info:{movefn:null,upfn:null},reset:function(){sl(this.info)},mousedown:function(n){if(!Ps(n))return;let t=Yi(n),e=this,r=function(s){Ps(s)||(Ou("up",t,s),sl(e.info))},i=function(s){Ps(s)&&Ou("up",t,s),sl(e.info)};O4(this.info,r,i),Ou("down",t,n)},touchstart:function(n){Ou("down",Yi(n),n.changedTouches[0],n)},touchend:function(n){Ou("up",Yi(n),n.changedTouches[0],n)}});function Ou(n,t,e,r){!t||m2(t,n,{x:e.clientX,y:e.clientY,sourceEvent:e,preventer:r,prevent:function(i){return If(i)}})}f2({name:"track",touchAction:"none",deps:["mousedown","touchstart","touchmove","touchend"],flow:{start:["mousedown","touchstart"],end:["mouseup","touchend"]},emits:["track"],info:{x:0,y:0,state:"start",started:!1,moves:[],addMove:function(n){this.moves.length>pV&&this.moves.shift(),this.moves.push(n)},movefn:null,upfn:null,prevent:!1},reset:function(){this.info.state="start",this.info.started=!1,this.info.moves=[],this.info.x=0,this.info.y=0,this.info.prevent=!1,sl(this.info)},mousedown:function(n){if(!Ps(n))return;let t=Yi(n),e=this,r=function(s){let a=s.clientX,l=s.clientY;N4(e.info,a,l)&&(e.info.state=e.info.started?s.type==="mouseup"?"end":"track":"start",e.info.state==="start"&&If("tap"),e.info.addMove({x:a,y:l}),Ps(s)||(e.info.state="end",sl(e.info)),t&&l2(e.info,t,s),e.info.started=!0)},i=function(s){e.info.started&&r(s),sl(e.info)};O4(this.info,r,i),this.info.x=n.clientX,this.info.y=n.clientY},touchstart:function(n){let t=n.changedTouches[0];this.info.x=t.clientX,this.info.y=t.clientY},touchmove:function(n){let t=Yi(n),e=n.changedTouches[0],r=e.clientX,i=e.clientY;N4(this.info,r,i)&&(this.info.state==="start"&&If("tap"),this.info.addMove({x:r,y:i}),l2(this.info,t,e),this.info.state="track",this.info.started=!0)},touchend:function(n){let t=Yi(n),e=n.changedTouches[0];this.info.started&&(this.info.state="end",this.info.addMove({x:e.clientX,y:e.clientY}),l2(this.info,t,e))}});function N4(n,t,e){if(n.prevent)return!1;if(n.started)return!0;let r=Math.abs(n.x-t),i=Math.abs(n.y-e);return r>=k4||i>=k4}function l2(n,t,e){if(!t)return;let r=n.moves[n.moves.length-2],i=n.moves[n.moves.length-1],o=i.x-n.x,s=i.y-n.y,a,l=0;r&&(a=i.x-r.x,l=i.y-r.y),m2(t,"track",{state:n.state,x:e.clientX,y:e.clientY,dx:o,dy:s,ddx:a,ddy:l,sourceEvent:e,hover:function(){return SV(e.clientX,e.clientY)}})}f2({name:"tap",deps:["mousedown","click","touchstart","touchend"],flow:{start:["mousedown","touchstart"],end:["click","touchend"]},emits:["tap"],info:{x:NaN,y:NaN,prevent:!1},reset:function(){this.info.x=NaN,this.info.y=NaN,this.info.prevent=!1},mousedown:function(n){Ps(n)&&(this.info.x=n.clientX,this.info.y=n.clientY)},click:function(n){Ps(n)&&L4(this.info,n)},touchstart:function(n){let t=n.changedTouches[0];this.info.x=t.clientX,this.info.y=t.clientY},touchend:function(n){L4(this.info,n.changedTouches[0],n)}});function L4(n,t,e){let r=Math.abs(t.clientX-n.x),i=Math.abs(t.clientY-n.y),o=Yi(e||t);!o||xV[o.localName]&&o.hasAttribute("disabled")||(isNaN(r)||isNaN(i)||r<=I4&&i<=I4||_V(t))&&(n.prevent||m2(o,"tap",{x:t.clientX,y:t.clientY,sourceEvent:t,preventer:e}))}var H4=Yi;var Pf=ze(n=>{class t extends n{_addEventListenerToNode(r,i,o){Rf(r,i,o)||super._addEventListenerToNode(r,i,o)}_removeEventListenerFromNode(r,i,o){V4(r,i,o)||super._removeEventListenerFromNode(r,i,o)}}return t});var AV=/:host\(:dir\((ltr|rtl)\)\)/g,IV=':host([dir="$1"])',kV=/([\s\w-#\.\[\]\*]*):dir\((ltr|rtl)\)/g,RV=':host([dir="$2"]) $1',PV=/:dir\((?:ltr|rtl)\)/,U4=Boolean(window.ShadyDOM&&window.ShadyDOM.inUse),Vu=[],Hu=null,g2="";function W4(){g2=document.documentElement.getAttribute("dir")}function G4(n){n.__autoDirOptOut||n.setAttribute("dir",g2)}function j4(){W4(),g2=document.documentElement.getAttribute("dir");for(let n=0;n<Vu.length;n++)G4(Vu[n])}function NV(){Hu&&Hu.takeRecords().length&&j4()}var q4=ze(n=>{U4||Hu||(W4(),Hu=new MutationObserver(j4),Hu.observe(document.documentElement,{attributes:!0,attributeFilter:["dir"]}));let t=df(n);class e extends t{static _processStyleText(i,o){return i=t._processStyleText.call(this,i,o),!U4&&PV.test(i)&&(i=this._replaceDirInCssText(i),this.__activateDir=!0),i}static _replaceDirInCssText(i){let o=i;return o=o.replace(AV,IV),o=o.replace(kV,RV),o}constructor(){super(),this.__autoDirOptOut=!1}ready(){super.ready(),this.__autoDirOptOut=this.hasAttribute("dir")}connectedCallback(){t.prototype.connectedCallback&&super.connectedCallback(),this.constructor.__activateDir&&(NV(),Vu.push(this),G4(this))}disconnectedCallback(){if(t.prototype.disconnectedCallback&&super.disconnectedCallback(),this.constructor.__activateDir){let i=Vu.indexOf(this);i>-1&&Vu.splice(i,1)}}}return e.__activateDir=!1,e});var x2=!1,LV=[],X4=[];function DV(){x2=!0,requestAnimationFrame(function(){x2=!1,zV(LV),setTimeout(function(){FV(X4)})})}function zV(n){for(;n.length;)K4(n.shift())}function FV(n){for(let t=0,e=n.length;t<e;t++)K4(n.shift())}function K4(n){let t=n[0],e=n[1],r=n[2];try{e.apply(t,r)}catch(i){setTimeout(()=>{throw i})}}function al(n,t,e){x2||DV(),X4.push([n,t,e])}function Y4(){document.body.removeAttribute("unresolved")}document.readyState==="interactive"||document.readyState==="complete"?Y4():window.addEventListener("DOMContentLoaded",Y4);function $u(n,t,e){return{index:n,removed:t,addedCount:e}}var Z4=0,J4=1,v2=2,y2=3;function OV(n,t,e,r,i,o){let s=o-i+1,a=e-t+1,l=new Array(s);for(let c=0;c<s;c++)l[c]=new Array(a),l[c][0]=c;for(let c=0;c<a;c++)l[0][c]=c;for(let c=1;c<s;c++)for(let u=1;u<a;u++)if(b2(n[t+u-1],r[i+c-1]))l[c][u]=l[c-1][u-1];else{let h=l[c-1][u]+1,p=l[c][u-1]+1;l[c][u]=h<p?h:p}return l}function BV(n){let t=n.length-1,e=n[0].length-1,r=n[t][e],i=[];for(;t>0||e>0;){if(t==0){i.push(v2),e--;continue}if(e==0){i.push(y2),t--;continue}let o=n[t-1][e-1],s=n[t-1][e],a=n[t][e-1],l;s<a?l=s<o?s:o:l=a<o?a:o,l==o?(o==r?i.push(Z4):(i.push(J4),r=o),t--,e--):l==s?(i.push(y2),t--,r=s):(i.push(v2),e--,r=a)}return i.reverse(),i}function VV(n,t,e,r,i,o){let s=0,a=0,l,c=Math.min(e-t,o-i);if(t==0&&i==0&&(s=HV(n,r,c)),e==n.length&&o==r.length&&(a=$V(n,r,c-s)),t+=s,i+=s,e-=a,o-=a,e-t==0&&o-i==0)return[];if(t==e){for(l=$u(t,[],0);i<o;)l.removed.push(r[i++]);return[l]}else if(i==o)return[$u(t,[],e-t)];let u=BV(OV(n,t,e,r,i,o));l=void 0;let h=[],p=t,d=i;for(let f=0;f<u.length;f++)switch(u[f]){case Z4:l&&(h.push(l),l=void 0),p++,d++;break;case J4:l||(l=$u(p,[],0)),l.addedCount++,p++,l.removed.push(r[d]),d++;break;case v2:l||(l=$u(p,[],0)),l.addedCount++,p++;break;case y2:l||(l=$u(p,[],0)),l.removed.push(r[d]),d++;break}return l&&h.push(l),h}function HV(n,t,e){for(let r=0;r<e;r++)if(!b2(n[r],t[r]))return r;return e}function $V(n,t,e){let r=n.length,i=t.length,o=0;for(;o<e&&b2(n[--r],t[--i]);)o++;return o}function Nf(n,t){return VV(n,0,n.length,t,0,t.length)}function b2(n,t){return n===t}function ll(n){return n.localName==="slot"}var _2=class{static getFlattenedNodes(n){let t=Ft(n);return ll(n)?(n=n,t.assignedNodes({flatten:!0})):Array.from(t.childNodes).map(e=>ll(e)?(e=e,Ft(e).assignedNodes({flatten:!0})):[e]).reduce((e,r)=>e.concat(r),[])}constructor(n,t){this._shadyChildrenObserver=null,this._nativeChildrenObserver=null,this._connected=!1,this._target=n,this.callback=t,this._effectiveNodes=[],this._observer=null,this._scheduled=!1,this._boundSchedule=()=>{this._schedule()},this.connect(),this._schedule()}connect(){ll(this._target)?this._listenSlots([this._target]):Ft(this._target).children&&(this._listenSlots(Ft(this._target).children),window.ShadyDOM?this._shadyChildrenObserver=window.ShadyDOM.observeChildren(this._target,n=>{this._processMutations(n)}):(this._nativeChildrenObserver=new MutationObserver(n=>{this._processMutations(n)}),this._nativeChildrenObserver.observe(this._target,{childList:!0}))),this._connected=!0}disconnect(){ll(this._target)?this._unlistenSlots([this._target]):Ft(this._target).children&&(this._unlistenSlots(Ft(this._target).children),window.ShadyDOM&&this._shadyChildrenObserver?(window.ShadyDOM.unobserveChildren(this._shadyChildrenObserver),this._shadyChildrenObserver=null):this._nativeChildrenObserver&&(this._nativeChildrenObserver.disconnect(),this._nativeChildrenObserver=null)),this._connected=!1}_schedule(){this._scheduled||(this._scheduled=!0,On.run(()=>this.flush()))}_processMutations(n){this._processSlotMutations(n),this.flush()}_processSlotMutations(n){if(n)for(let t=0;t<n.length;t++){let e=n[t];e.addedNodes&&this._listenSlots(e.addedNodes),e.removedNodes&&this._unlistenSlots(e.removedNodes)}}flush(){if(!this._connected)return!1;window.ShadyDOM&&ShadyDOM.flush(),this._nativeChildrenObserver?this._processSlotMutations(this._nativeChildrenObserver.takeRecords()):this._shadyChildrenObserver&&this._processSlotMutations(this._shadyChildrenObserver.takeRecords()),this._scheduled=!1;let n={target:this._target,addedNodes:[],removedNodes:[]},t=this.constructor.getFlattenedNodes(this._target),e=Nf(t,this._effectiveNodes);for(let i=0,o;i<e.length&&(o=e[i]);i++)for(let s=0,a;s<o.removed.length&&(a=o.removed[s]);s++)n.removedNodes.push(a);for(let i=0,o;i<e.length&&(o=e[i]);i++)for(let s=o.index;s<o.index+o.addedCount;s++)n.addedNodes.push(t[s]);this._effectiveNodes=t;let r=!1;return(n.addedNodes.length||n.removedNodes.length)&&(r=!0,this.callback.call(this._target,n)),r}_listenSlots(n){for(let t=0;t<n.length;t++){let e=n[t];ll(e)&&e.addEventListener("slotchange",this._boundSchedule)}}_unlistenSlots(n){for(let t=0;t<n.length;t++){let e=n[t];ll(e)&&e.removeEventListener("slotchange",this._boundSchedule)}}};var jr=function(){let n,t;do n=window.ShadyDOM&&ShadyDOM.flush(),window.ShadyCSS&&window.ShadyCSS.ScopingShim&&window.ShadyCSS.ScopingShim.flush(),t=A4();while(n||t)};var cl=Element.prototype,UV=cl.matches||cl.matchesSelector||cl.mozMatchesSelector||cl.msMatchesSelector||cl.oMatchesSelector||cl.webkitMatchesSelector,S2=function(n,t){return UV.call(n,t)},Ee=class{constructor(t){window.ShadyDOM&&window.ShadyDOM.inUse&&window.ShadyDOM.patch(t),this.node=t}observeNodes(t){return new _2(this.node,t)}unobserveNodes(t){t.disconnect()}notifyObserver(){}deepContains(t){if(Ft(this.node).contains(t))return!0;let e=t,r=t.ownerDocument;for(;e&&e!==r&&e!==this.node;)e=Ft(e).parentNode||Ft(e).host;return e===this.node}getOwnerRoot(){return Ft(this.node).getRootNode()}getDistributedNodes(){return this.node.localName==="slot"?Ft(this.node).assignedNodes({flatten:!0}):[]}getDestinationInsertionPoints(){let t=[],e=Ft(this.node).assignedSlot;for(;e;)t.push(e),e=Ft(e).assignedSlot;return t}importNode(t,e){let r=this.node instanceof Document?this.node:this.node.ownerDocument;return Ft(r).importNode(t,e)}getEffectiveChildNodes(){return _2.getFlattenedNodes(this.node)}queryDistributedElements(t){let e=this.getEffectiveChildNodes(),r=[];for(let i=0,o=e.length,s;i<o&&(s=e[i]);i++)s.nodeType===Node.ELEMENT_NODE&&S2(s,t)&&r.push(s);return r}get activeElement(){let t=this.node;return t._activeElement!==void 0?t._activeElement:t.activeElement}};function WV(n,t){for(let e=0;e<t.length;e++){let r=t[e];n[r]=function(){return this.node[r].apply(this.node,arguments)}}}function Q4(n,t){for(let e=0;e<t.length;e++){let r=t[e];Object.defineProperty(n,r,{get:function(){return this.node[r]},configurable:!0})}}function GV(n,t){for(let e=0;e<t.length;e++){let r=t[e];Object.defineProperty(n,r,{get:function(){return this.node[r]},set:function(i){this.node[r]=i},configurable:!0})}}var Uu=class{constructor(t){this.event=t}get rootTarget(){return this.path[0]}get localTarget(){return this.event.target}get path(){return this.event.composedPath()}};Ee.prototype.cloneNode;Ee.prototype.appendChild;Ee.prototype.insertBefore;Ee.prototype.removeChild;Ee.prototype.replaceChild;Ee.prototype.setAttribute;Ee.prototype.removeAttribute;Ee.prototype.querySelector;Ee.prototype.querySelectorAll;Ee.prototype.parentNode;Ee.prototype.firstChild;Ee.prototype.lastChild;Ee.prototype.nextSibling;Ee.prototype.previousSibling;Ee.prototype.firstElementChild;Ee.prototype.lastElementChild;Ee.prototype.nextElementSibling;Ee.prototype.previousElementSibling;Ee.prototype.childNodes;Ee.prototype.children;Ee.prototype.classList;Ee.prototype.textContent;Ee.prototype.innerHTML;var w2=Ee;if(window.ShadyDOM&&window.ShadyDOM.inUse&&window.ShadyDOM.noPatch&&window.ShadyDOM.Wrapper){class n extends window.ShadyDOM.Wrapper{}Object.getOwnPropertyNames(Ee.prototype).forEach(t=>{t!="activeElement"&&(n.prototype[t]=Ee.prototype[t])}),Q4(n.prototype,["classList"]),w2=n,Object.defineProperties(Uu.prototype,{localTarget:{get(){let t=this.event.currentTarget,e=t&&Ct(t).getOwnerRoot(),r=this.path;for(let i=0;i<r.length;i++){let o=r[i];if(Ct(o).getOwnerRoot()===e)return o}},configurable:!0},path:{get(){return window.ShadyDOM.composedPath(this.event)},configurable:!0}})}else WV(Ee.prototype,["cloneNode","appendChild","insertBefore","removeChild","replaceChild","setAttribute","removeAttribute","querySelector","querySelectorAll"]),Q4(Ee.prototype,["parentNode","firstChild","lastChild","nextSibling","previousSibling","firstElementChild","lastElementChild","nextElementSibling","previousElementSibling","childNodes","children","classList"]),GV(Ee.prototype,["textContent","innerHTML","className"]);var Ct=function(n){if(n=n||document,n instanceof w2||n instanceof Uu)return n;let t=n.__domApi;return t||(n instanceof Event?t=new Uu(n):t=new w2(n),n.__domApi=t),t};var C2=window.ShadyDOM,t5=window.ShadyCSS;function e5(n,t){return Ft(n).getRootNode()===t}function n5(n,t=!1){if(!C2||!t5||!C2.handlesDynamicScoping)return null;let e=t5.ScopingShim;if(!e)return null;let r=e.scopeForNode(n),i=Ft(n).getRootNode(),o=s=>{if(!e5(s,i))return;let a=Array.from(C2.nativeMethods.querySelectorAll.call(s,"*"));a.push(s);for(let l=0;l<a.length;l++){let c=a[l];if(!e5(c,i))continue;let u=e.currentScopeForNode(c);u!==r&&(u!==""&&e.unscopeNode(c,u),e.scopeNode(c,r))}};if(o(n),t){let s=new MutationObserver(a=>{for(let l=0;l<a.length;l++){let c=a[l];for(let u=0;u<c.addedNodes.length;u++){let h=c.addedNodes[u];h.nodeType===Node.ELEMENT_NODE&&o(h)}}});return s.observe(n,{childList:!0,subtree:!0}),s}else return null}var M2="disable-upgrade",E2=n=>{for(;n;){let t=Object.getOwnPropertyDescriptor(n,"observedAttributes");if(t)return t.get;n=Object.getPrototypeOf(n.prototype).constructor}return()=>[]},Rdt=ze(n=>{let t=Eo(n),e=E2(t);class r extends t{constructor(){super(),this.__isUpgradeDisabled}static get observedAttributes(){return e.call(this).concat(M2)}_initializeProperties(){this.hasAttribute(M2)?this.__isUpgradeDisabled=!0:super._initializeProperties()}_enableProperties(){this.__isUpgradeDisabled||super._enableProperties()}_canApplyPropertyDefault(o){return super._canApplyPropertyDefault(o)&&!(this.__isUpgradeDisabled&&this._isPropertyPending(o))}attributeChangedCallback(o,s,a,l){o==M2?this.__isUpgradeDisabled&&a==null&&(super._initializeProperties(),this.__isUpgradeDisabled=!1,Ft(this).isConnected&&super.connectedCallback()):super.attributeChangedCallback(o,s,a,l)}connectedCallback(){this.__isUpgradeDisabled||super.connectedCallback()}disconnectedCallback(){this.__isUpgradeDisabled||super.disconnectedCallback()}}return r});var Lf="disable-upgrade",jV=window.ShadyCSS,Ke=ze(n=>{let t=Pf(Eo(n)),e=mf?t:q4(t),r=E2(e),i={x:"pan-x",y:"pan-y",none:"none",all:"auto"};class o extends e{constructor(){super(),this.isAttached,this.__boundListeners,this._debouncers,this.__isUpgradeDisabled,this.__needsAttributesAtConnected,this._legacyForceObservedAttributes}static get importMeta(){return this.prototype.importMeta}created(){}__attributeReaction(a,l,c){(this.__dataAttributes&&this.__dataAttributes[a]||a===Lf)&&this.attributeChangedCallback(a,l,c,null)}setAttribute(a,l){if(Mu&&!this._legacyForceObservedAttributes){let c=this.getAttribute(a);super.setAttribute(a,l),this.__attributeReaction(a,c,String(l))}else super.setAttribute(a,l)}removeAttribute(a){if(Mu&&!this._legacyForceObservedAttributes){let l=this.getAttribute(a);super.removeAttribute(a),this.__attributeReaction(a,l,null)}else super.removeAttribute(a)}static get observedAttributes(){return Mu&&!this.prototype._legacyForceObservedAttributes?(this.hasOwnProperty(JSCompiler_renameProperty("__observedAttributes",this))||(this.__observedAttributes=[],ff(this.prototype)),this.__observedAttributes):r.call(this).concat(Lf)}_enableProperties(){this.__isUpgradeDisabled||super._enableProperties()}_canApplyPropertyDefault(a){return super._canApplyPropertyDefault(a)&&!(this.__isUpgradeDisabled&&this._isPropertyPending(a))}connectedCallback(){this.__needsAttributesAtConnected&&this._takeAttributes(),this.__isUpgradeDisabled||(super.connectedCallback(),this.isAttached=!0,this.attached())}attached(){}disconnectedCallback(){this.__isUpgradeDisabled||(super.disconnectedCallback(),this.isAttached=!1,this.detached())}detached(){}attributeChangedCallback(a,l,c,u){l!==c&&(a==Lf?this.__isUpgradeDisabled&&c==null&&(this._initializeProperties(),this.__isUpgradeDisabled=!1,Ft(this).isConnected&&this.connectedCallback()):(super.attributeChangedCallback(a,l,c,u),this.attributeChanged(a,l,c)))}attributeChanged(a,l,c){}_initializeProperties(){if(Gi&&this.hasAttribute(Lf))this.__isUpgradeDisabled=!0;else{let a=Object.getPrototypeOf(this);a.hasOwnProperty(JSCompiler_renameProperty("__hasRegisterFinished",a))||(this._registered(),a.__hasRegisterFinished=!0),super._initializeProperties(),this.root=this,this.created(),Mu&&!this._legacyForceObservedAttributes&&(this.hasAttributes()?this._takeAttributes():this.parentNode||(this.__needsAttributesAtConnected=!0)),this._applyListeners()}}_takeAttributes(){let a=this.attributes;for(let l=0,c=a.length;l<c;l++){let u=a[l];this.__attributeReaction(u.name,null,u.value)}}_registered(){}ready(){this._ensureAttributes(),super.ready()}_ensureAttributes(){}_applyListeners(){}serialize(a){return this._serializeValue(a)}deserialize(a,l){return this._deserializeValue(a,l)}reflectPropertyToAttribute(a,l,c){this._propertyToAttribute(a,l,c)}serializeValueToAttribute(a,l,c){this._valueToNodeAttribute(c||this,a,l)}extend(a,l){if(!(a&&l))return a||l;let c=Object.getOwnPropertyNames(l);for(let u=0,h;u<c.length&&(h=c[u]);u++){let p=Object.getOwnPropertyDescriptor(l,h);p&&Object.defineProperty(a,h,p)}return a}mixin(a,l){for(let c in l)a[c]=l[c];return a}chainObject(a,l){return a&&l&&a!==l&&(a.__proto__=l),a}instanceTemplate(a){let l=this.constructor._contentForTemplate(a);return document.importNode(l,!0)}fire(a,l,c){c=c||{},l=l==null?{}:l;let u=new Event(a,{bubbles:c.bubbles===void 0?!0:c.bubbles,cancelable:Boolean(c.cancelable),composed:c.composed===void 0?!0:c.composed});u.detail=l;let h=c.node||this;return Ft(h).dispatchEvent(u),u}listen(a,l,c){a=a||this;let u=this.__boundListeners||(this.__boundListeners=new WeakMap),h=u.get(a);h||(h={},u.set(a,h));let p=l+c;h[p]||(h[p]=this._addMethodEventListenerToNode(a,l,c,this))}unlisten(a,l,c){a=a||this;let u=this.__boundListeners&&this.__boundListeners.get(a),h=l+c,p=u&&u[h];p&&(this._removeEventListenerFromNode(a,l,p),u[h]=null)}setScrollDirection(a,l){Ns(l||this,i[a]||"auto")}$$(a){return this.root.querySelector(a)}get domHost(){let a=Ft(this).getRootNode();return a instanceof DocumentFragment?a.host:a}distributeContent(){let l=Ct(this);window.ShadyDOM&&l.shadowRoot&&ShadyDOM.flush()}getEffectiveChildNodes(){return Ct(this).getEffectiveChildNodes()}queryDistributedElements(a){return Ct(this).queryDistributedElements(a)}getEffectiveChildren(){return this.getEffectiveChildNodes().filter(function(l){return l.nodeType===Node.ELEMENT_NODE})}getEffectiveTextContent(){let a=this.getEffectiveChildNodes(),l=[];for(let c=0,u;u=a[c];c++)u.nodeType!==Node.COMMENT_NODE&&l.push(u.textContent);return l.join("")}queryEffectiveChildren(a){let l=this.queryDistributedElements(a);return l&&l[0]}queryAllEffectiveChildren(a){return this.queryDistributedElements(a)}getContentChildNodes(a){let l=this.root.querySelector(a||"slot");return l?Ct(l).getDistributedNodes():[]}getContentChildren(a){return this.getContentChildNodes(a).filter(function(c){return c.nodeType===Node.ELEMENT_NODE})}isLightDescendant(a){let l=this;return l!==a&&Ft(l).contains(a)&&Ft(l).getRootNode()===Ft(a).getRootNode()}isLocalDescendant(a){return this.root===Ft(a).getRootNode()}scopeSubtree(a,l=!1){return n5(a,l)}getComputedStyleValue(a){return jV.getComputedStyleValue(this,a)}debounce(a,l,c){return this._debouncers=this._debouncers||{},this._debouncers[a]=Jn.debounce(this._debouncers[a],c>0?Mo.after(c):On,l.bind(this))}isDebouncerActive(a){this._debouncers=this._debouncers||{};let l=this._debouncers[a];return!!(l&&l.isActive())}flushDebouncer(a){this._debouncers=this._debouncers||{};let l=this._debouncers[a];l&&l.flush()}cancelDebouncer(a){this._debouncers=this._debouncers||{};let l=this._debouncers[a];l&&l.cancel()}async(a,l){return l>0?Mo.run(a.bind(this),l):~On.run(a.bind(this))}cancelAsync(a){a<0?On.cancel(~a):Mo.cancel(a)}create(a,l){let c=document.createElement(a);if(l)if(c.setProperties)c.setProperties(l);else for(let u in l)c[u]=l[u];return c}elementMatches(a,l){return S2(l||this,a)}toggleAttribute(a,l){let c=this;return arguments.length===3&&(c=arguments[2]),arguments.length==1&&(l=!c.hasAttribute(a)),l?(Ft(c).setAttribute(a,""),!0):(Ft(c).removeAttribute(a),!1)}toggleClass(a,l,c){c=c||this,arguments.length==1&&(l=!c.classList.contains(a)),l?c.classList.add(a):c.classList.remove(a)}transform(a,l){l=l||this,l.style.webkitTransform=a,l.style.transform=a}translate3d(a,l,c,u){u=u||this,this.transform("translate3d("+a+","+l+","+c+")",u)}arrayDelete(a,l){let c;if(Array.isArray(a)){if(c=a.indexOf(l),c>=0)return a.splice(c,1)}else if(c=Fn(this,a).indexOf(l),c>=0)return this.splice(a,c,1);return null}_logger(a,l){switch(Array.isArray(l)&&l.length===1&&Array.isArray(l[0])&&(l=l[0]),a){case"log":case"warn":case"error":console[a](...l)}}_log(...a){this._logger("log",a)}_warn(...a){this._logger("warn",a)}_error(...a){this._logger("error",a)}_logf(a,...l){return["[%s::%s]",this.is,a,...l]}}return o.prototype.is="",o});var qV={attached:!0,detached:!0,ready:!0,created:!0,beforeRegister:!0,registered:!0,attributeChanged:!0,listeners:!0,hostAttributes:!0},o5={attached:!0,detached:!0,ready:!0,created:!0,beforeRegister:!0,registered:!0,attributeChanged:!0,behaviors:!0,_noAccessors:!0},XV=Object.assign({listeners:!0,hostAttributes:!0,properties:!0,observers:!0},o5);function KV(n,t,e){let r=n._noAccessors,i=Object.getOwnPropertyNames(n);for(let o=0;o<i.length;o++){let s=i[o];if(!(s in e))if(r)t[s]=n[s];else{let a=Object.getOwnPropertyDescriptor(n,s);a&&(a.configurable=!0,Object.defineProperty(t,s,a))}}}function YV(n,t,e){for(let r=0;r<t.length;r++)s5(n,t[r],e,XV)}function s5(n,t,e,r){KV(t,n,r);for(let i in qV)t[i]&&(e[i]=e[i]||[],e[i].push(t[i]))}function a5(n,t,e){t=t||[];for(let r=n.length-1;r>=0;r--){let i=n[r];i?Array.isArray(i)?a5(i,t):t.indexOf(i)<0&&(!e||e.indexOf(i)<0)&&t.unshift(i):console.warn("behavior is null, check for missing or 404 import")}return t}function r5(n,t){for(let e in t){let r=n[e],i=t[e];!("value"in i)&&r&&"value"in r?n[e]=Object.assign({value:r.value},i):n[e]=i}}var i5=Ke(HTMLElement);function ZV(n,t,e){let r,i={};class o extends t{static _finalizeClass(){if(!this.hasOwnProperty(JSCompiler_renameProperty("generatedFrom",this)))t._finalizeClass.call(this);else{if(r)for(let l=0,c;l<r.length;l++)c=r[l],c.properties&&this.createProperties(c.properties),c.observers&&this.createObservers(c.observers,c.properties);n.properties&&this.createProperties(n.properties),n.observers&&this.createObservers(n.observers,n.properties),this._prepareTemplate()}}static get properties(){let l={};if(r)for(let c=0;c<r.length;c++)r5(l,r[c].properties);return r5(l,n.properties),l}static get observers(){let l=[];if(r)for(let c=0,u;c<r.length;c++)u=r[c],u.observers&&(l=l.concat(u.observers));return n.observers&&(l=l.concat(n.observers)),l}created(){super.created();let l=i.created;if(l)for(let c=0;c<l.length;c++)l[c].call(this)}_registered(){let l=o.prototype;if(!l.hasOwnProperty(JSCompiler_renameProperty("__hasRegisterFinished",l))){l.__hasRegisterFinished=!0,super._registered(),Gi&&s(l);let c=Object.getPrototypeOf(this),u=i.beforeRegister;if(u)for(let h=0;h<u.length;h++)u[h].call(c);if(u=i.registered,u)for(let h=0;h<u.length;h++)u[h].call(c)}}_applyListeners(){super._applyListeners();let l=i.listeners;if(l)for(let c=0;c<l.length;c++){let u=l[c];if(u)for(let h in u)this._addMethodEventListenerToNode(this,h,u[h])}}_ensureAttributes(){let l=i.hostAttributes;if(l)for(let c=l.length-1;c>=0;c--){let u=l[c];for(let h in u)this._ensureAttribute(h,u[h])}super._ensureAttributes()}ready(){super.ready();let l=i.ready;if(l)for(let c=0;c<l.length;c++)l[c].call(this)}attached(){super.attached();let l=i.attached;if(l)for(let c=0;c<l.length;c++)l[c].call(this)}detached(){super.detached();let l=i.detached;if(l)for(let c=0;c<l.length;c++)l[c].call(this)}attributeChanged(l,c,u){super.attributeChanged();let h=i.attributeChanged;if(h)for(let p=0;p<h.length;p++)h[p].call(this,l,c,u)}}if(e){Array.isArray(e)||(e=[e]);let a=t.prototype.behaviors;r=a5(e,null,a),o.prototype.behaviors=a?a.concat(e):r}let s=a=>{r&&YV(a,r,i),s5(a,n,i,o5)};return Gi||s(o.prototype),o.generatedFrom=n,o}var l5=function(n,t){n||console.warn("Polymer.Class requires `info` argument");let e=t?t(i5):i5;return e=ZV(n,e,n.behaviors),e.is=e.prototype.is=n.is,e};var At=function(n){let t;return typeof n=="function"?t=n:t=At.Class(n),n._legacyForceObservedAttributes&&(t.prototype._legacyForceObservedAttributes=n._legacyForceObservedAttributes),customElements.define(t.is,t),t};At.Class=l5;function T2(n,t,e,r,i){let o;i&&(o=typeof e=="object"&&e!==null,o&&(r=n.__dataTemp[t]));let s=r!==e&&(r===r||e===e);return o&&s&&(n.__dataTemp[t]=e),s}var ul=ze(n=>{class t extends n{_shouldPropertyChange(r,i,o){return T2(this,r,i,o,!0)}}return t}),Df=ze(n=>{class t extends n{static get properties(){return{mutableData:Boolean}}_shouldPropertyChange(r,i,o){return T2(this,r,i,o,this.mutableData)}}return t});ul._mutablePropertyChange=T2;var A2=null;function I2(){return A2}I2.prototype=Object.create(HTMLTemplateElement.prototype,{constructor:{value:I2,writable:!0}});var u5=Is(I2),JV=ul(u5);function QV(n,t){A2=n,Object.setPrototypeOf(n,t.prototype),new t,A2=null}var tH=Is(class{});function k2(n,t){for(let e=0;e<t.length;e++){let r=t[e];if(Boolean(n)!=Boolean(r.__hideTemplateChildren__))if(r.nodeType===Node.TEXT_NODE)n?(r.__polymerTextContent__=r.textContent,r.textContent=""):r.textContent=r.__polymerTextContent__;else if(r.localName==="slot")if(n)r.__polymerReplaced__=document.createComment("hidden-slot"),Ft(Ft(r).parentNode).replaceChild(r.__polymerReplaced__,r);else{let i=r.__polymerReplaced__;i&&Ft(Ft(i).parentNode).replaceChild(r,i)}else r.style&&(n?(r.__polymerDisplay__=r.style.display,r.style.display="none"):r.style.display=r.__polymerDisplay__);r.__hideTemplateChildren__=n,r._showHideChildren&&r._showHideChildren(n)}}var pi=class extends tH{constructor(t){super(),this._configureProperties(t),this.root=this._stampTemplate(this.__dataHost);let e=[];this.children=e;for(let i=this.root.firstChild;i;i=i.nextSibling)e.push(i),i.__templatizeInstance=this;this.__templatizeOwner&&this.__templatizeOwner.__hideTemplateChildren__&&this._showHideChildren(!0);let r=this.__templatizeOptions;(t&&r.instanceProps||!r.instanceProps)&&this._enableProperties()}_configureProperties(t){if(this.__templatizeOptions.forwardHostProp)for(let r in this.__hostProps)this._setPendingProperty(r,this.__dataHost["_host_"+r]);for(let r in t)this._setPendingProperty(r,t[r])}forwardHostProp(t,e){this._setPendingPropertyOrPath(t,e,!1,!0)&&this.__dataHost._enqueueClient(this)}_addEventListenerToNode(t,e,r){if(this._methodHost&&this.__templatizeOptions.parentModel)this._methodHost._addEventListenerToNode(t,e,i=>{i.model=this,r(i)});else{let i=this.__dataHost.__dataHost;i&&i._addEventListenerToNode(t,e,r)}}_showHideChildren(t){k2(t,this.children)}_setUnmanagedPropertyToNode(t,e,r){t.__hideTemplateChildren__&&t.nodeType==Node.TEXT_NODE&&e=="textContent"?t.__polymerTextContent__=r:super._setUnmanagedPropertyToNode(t,e,r)}get parentModel(){let t=this.__parentModel;if(!t){let e;t=this;do t=t.__dataHost.__dataHost;while((e=t.__templatizeOptions)&&!e.parentModel);this.__parentModel=t}return t}dispatchEvent(t){return!0}};pi.prototype.__dataHost;pi.prototype.__templatizeOptions;pi.prototype._methodHost;pi.prototype.__templatizeOwner;pi.prototype.__hostProps;var eH=ul(pi);function c5(n){let t=n.__dataHost;return t&&t._methodHost||t}function nH(n,t,e){let r=e.mutableData?eH:pi;Io.mixin&&(r=Io.mixin(r));let i=class extends r{};return i.prototype.__templatizeOptions=e,i.prototype._bindTemplate(n),oH(i,n,t,e),i}function rH(n,t,e,r){let i=e.forwardHostProp;if(i&&t.hasHostProps){let o=n.localName=="template",s=t.templatizeTemplateClass;if(!s){if(o){let l=e.mutableData?JV:u5;class c extends l{}s=t.templatizeTemplateClass=c}else{let l=n.constructor;class c extends l{}s=t.templatizeTemplateClass=c}let a=t.hostProps;for(let l in a)s.prototype._addPropertyEffect("_host_"+l,s.prototype.PROPERTY_EFFECT_TYPES.PROPAGATE,{fn:iH(l,i)}),s.prototype._createNotifyingProperty("_host_"+l);tf&&r&&lH(t,e,r)}if(n.__dataProto&&Object.assign(n.__data,n.__dataProto),o)QV(n,s),n.__dataTemp={},n.__dataPending=null,n.__dataOld=null,n._enableProperties();else{Object.setPrototypeOf(n,s.prototype);let a=t.hostProps;for(let l in a)if(l="_host_"+l,l in n){let c=n[l];delete n[l],n.__data[l]=c}}}}function iH(n,t){return function(r,i,o){t.call(r.__templatizeOwner,i.substring(6),o[i])}}function oH(n,t,e,r){let i=e.hostProps||{};for(let o in r.instanceProps){delete i[o];let s=r.notifyInstanceProp;s&&n.prototype._addPropertyEffect(o,n.prototype.PROPERTY_EFFECT_TYPES.NOTIFY,{fn:sH(o,s)})}if(r.forwardHostProp&&t.__dataHost)for(let o in i)e.hasHostProps||(e.hasHostProps=!0),n.prototype._addPropertyEffect(o,n.prototype.PROPERTY_EFFECT_TYPES.NOTIFY,{fn:aH()})}function sH(n,t){return function(r,i,o){t.call(r.__templatizeOwner,r,i,o[i])}}function aH(){return function(t,e,r){t.__dataHost._setPendingPropertyOrPath("_host_"+e,r[e],!0,!0)}}function Io(n,t,e){if(Er&&!c5(n))throw new Error("strictTemplatePolicy: template owner not trusted");if(e=e||{},n.__templatizeOwner)throw new Error("A <template> can only be templatized once");n.__templatizeOwner=t;let i=(t?t.constructor:pi)._parseTemplate(n),o=i.templatizeInstanceClass;o||(o=nH(n,i,e),i.templatizeInstanceClass=o);let s=c5(n);rH(n,i,e,s);let a=class extends o{};return a.prototype._methodHost=s,a.prototype.__dataHost=n,a.prototype.__templatizeOwner=t,a.prototype.__hostProps=i.hostProps,a=a,a}function lH(n,t,e){let r=e.constructor._properties,{propertyEffects:i}=n,{instanceProps:o}=t;for(let s in i)if(!r[s]&&!(o&&o[s])){let a=i[s];for(let l=0;l<a.length;l++){let{part:c}=a[l].info;if(!(c.signature&&c.signature.static)){console.warn(`Property '${s}' used in template but not declared in 'properties'; attribute will not be observed.`);break}}}}function zf(n,t){let e;for(;t;)if(e=t.__dataHost?t:t.__templatizeInstance)if(e.__dataHost!=n)t=e.__dataHost;else return e;else t=Ft(t).parentNode;return null}var h5={templatize(n,t){this._templatizerTemplate=n,this.ctor=Io(n,this,{mutableData:Boolean(t),parentModel:this._parentModel,instanceProps:this._instanceProps,forwardHostProp:this._forwardHostPropV2,notifyInstanceProp:this._notifyInstancePropV2})},stamp(n){return new this.ctor(n)},modelForElement(n){return zf(this._templatizerTemplate,n)}};var p5=!1;function hl(){if(Gi&&!As){if(!p5){p5=!0;let n=document.createElement("style");n.textContent="dom-bind,dom-if,dom-repeat{display:none;}",document.head.appendChild(n)}return!0}return!1}var cH=Pf(Df(Is(HTMLElement))),R2=class extends cH{static get observedAttributes(){return["mutable-data"]}constructor(){if(super(),Er)throw new Error("strictTemplatePolicy: dom-bind not allowed");this.root=null,this.$=null,this.__children=null}attributeChangedCallback(t,e,r,i){this.mutableData=!0}connectedCallback(){hl()||(this.style.display="none"),this.render()}disconnectedCallback(){this.__removeChildren()}__insertChildren(){Ft(Ft(this).parentNode).insertBefore(this.root,this)}__removeChildren(){if(this.__children)for(let t=0;t<this.__children.length;t++)this.root.appendChild(this.__children[t])}render(){let t;if(!this.__children){if(t=t||this.querySelector("template"),!t){let e=new MutationObserver(()=>{if(t=this.querySelector("template"),t)e.disconnect(),this.render();else throw new Error("dom-bind requires a <template> child")});e.observe(this,{childList:!0});return}this.root=this._stampTemplate(t),this.$=this.root.$,this.__children=[];for(let e=this.root.firstChild;e;e=e.nextSibling)this.__children[this.__children.length]=e;this._enableProperties()}this.__insertChildren(),this.dispatchEvent(new CustomEvent("dom-change",{bubbles:!0,composed:!0}))}};customElements.define("dom-bind",R2);var uH=Df(Ae),Ff=class extends uH{static get is(){return"dom-repeat"}static get template(){return null}static get properties(){return{items:{type:Array},as:{type:String,value:"item"},indexAs:{type:String,value:"index"},itemsIndexAs:{type:String,value:"itemsIndex"},sort:{type:Function,observer:"__sortChanged"},filter:{type:Function,observer:"__filterChanged"},observe:{type:String,observer:"__observeChanged"},delay:Number,renderedItemCount:{type:Number,notify:!Cu,readOnly:!0},initialCount:{type:Number},targetFramerate:{type:Number,value:20},_targetFrameTime:{type:Number,computed:"__computeFrameTime(targetFramerate)"},notifyDomChange:{type:Boolean},reuseChunkedInstances:{type:Boolean}}}static get observers(){return["__itemsChanged(items.*)"]}constructor(){super(),this.__instances=[],this.__renderDebouncer=null,this.__itemsIdxToInstIdx={},this.__chunkCount=null,this.__renderStartTime=null,this.__itemsArrayChanged=!1,this.__shouldMeasureChunk=!1,this.__shouldContinueChunking=!1,this.__chunkingId=0,this.__sortFn=null,this.__filterFn=null,this.__observePaths=null,this.__ctor=null,this.__isDetached=!0,this.template=null,this._templateInfo}disconnectedCallback(){super.disconnectedCallback(),this.__isDetached=!0;for(let t=0;t<this.__instances.length;t++)this.__detachInstance(t)}connectedCallback(){if(super.connectedCallback(),hl()||(this.style.display="none"),this.__isDetached){this.__isDetached=!1;let t=Ft(Ft(this).parentNode);for(let e=0;e<this.__instances.length;e++)this.__attachInstance(e,t)}}__ensureTemplatized(){if(!this.__ctor){let t=this,e=this.template=t._templateInfo?t:this.querySelector("template");if(!e){let i=new MutationObserver(()=>{if(this.querySelector("template"))i.disconnect(),this.__render();else throw new Error("dom-repeat requires a <template> child")});return i.observe(this,{childList:!0}),!1}let r={};r[this.as]=!0,r[this.indexAs]=!0,r[this.itemsIndexAs]=!0,this.__ctor=Io(e,this,{mutableData:this.mutableData,parentModel:!0,instanceProps:r,forwardHostProp:function(i,o){let s=this.__instances;for(let a=0,l;a<s.length&&(l=s[a]);a++)l.forwardHostProp(i,o)},notifyInstanceProp:function(i,o,s){if(cf(this.as,o)){let a=i[this.itemsIndexAs];o==this.as&&(this.items[a]=s);let l=qi(this.as,`${JSCompiler_renameProperty("items",this)}.${a}`,o);this.notifyPath(l,s)}}})}return!0}__getMethodHost(){return this.__dataHost._methodHost||this.__dataHost}__functionFromPropertyValue(t){if(typeof t=="string"){let e=t,r=this.__getMethodHost();return function(){return r[e].apply(r,arguments)}}return t}__sortChanged(t){this.__sortFn=this.__functionFromPropertyValue(t),this.items&&this.__debounceRender(this.__render)}__filterChanged(t){this.__filterFn=this.__functionFromPropertyValue(t),this.items&&this.__debounceRender(this.__render)}__computeFrameTime(t){return Math.ceil(1e3/t)}__observeChanged(){this.__observePaths=this.observe&&this.observe.replace(".*",".").split(" ")}__handleObservedPaths(t){if(this.__sortFn||this.__filterFn){if(!t)this.__debounceRender(this.__render,this.delay);else if(this.__observePaths){let e=this.__observePaths;for(let r=0;r<e.length;r++)t.indexOf(e[r])===0&&this.__debounceRender(this.__render,this.delay)}}}__itemsChanged(t){this.items&&!Array.isArray(this.items)&&console.warn("dom-repeat expected array for `items`, found",this.items),this.__handleItemPath(t.path,t.value)||(t.path==="items"&&(this.__itemsArrayChanged=!0),this.__debounceRender(this.__render))}__debounceRender(t,e=0){this.__renderDebouncer=Jn.debounce(this.__renderDebouncer,e>0?Mo.after(e):On,t.bind(this)),Ao(this.__renderDebouncer)}render(){this.__debounceRender(this.__render),jr()}__render(){if(!this.__ensureTemplatized())return;let t=this.items||[],e=this.__sortAndFilterItems(t),r=this.__calculateLimit(e.length);this.__updateInstances(t,r,e),this.initialCount&&(this.__shouldMeasureChunk||this.__shouldContinueChunking)&&(cancelAnimationFrame(this.__chunkingId),this.__chunkingId=requestAnimationFrame(()=>this.__continueChunking())),this._setRenderedItemCount(this.__instances.length),(!Cu||this.notifyDomChange)&&this.dispatchEvent(new CustomEvent("dom-change",{bubbles:!0,composed:!0}))}__sortAndFilterItems(t){let e=new Array(t.length);for(let r=0;r<t.length;r++)e[r]=r;return this.__filterFn&&(e=e.filter((r,i,o)=>this.__filterFn(t[r],i,o))),this.__sortFn&&e.sort((r,i)=>this.__sortFn(t[r],t[i])),e}__calculateLimit(t){let e=t,r=this.__instances.length;if(this.initialCount){let i;!this.__chunkCount||this.__itemsArrayChanged&&!this.reuseChunkedInstances?(e=Math.min(t,this.initialCount),i=Math.max(e-r,0),this.__chunkCount=i||1):(i=Math.min(Math.max(t-r,0),this.__chunkCount),e=Math.min(r+i,t)),this.__shouldMeasureChunk=i===this.__chunkCount,this.__shouldContinueChunking=e<t,this.__renderStartTime=performance.now()}return this.__itemsArrayChanged=!1,e}__continueChunking(){if(this.__shouldMeasureChunk){let t=performance.now()-this.__renderStartTime,e=this._targetFrameTime/t;this.__chunkCount=Math.round(this.__chunkCount*e)||1}this.__shouldContinueChunking&&this.__debounceRender(this.__render)}__updateInstances(t,e,r){let i=this.__itemsIdxToInstIdx={},o;for(o=0;o<e;o++){let s=this.__instances[o],a=r[o],l=t[a];i[a]=o,s?(s._setPendingProperty(this.as,l),s._setPendingProperty(this.indexAs,o),s._setPendingProperty(this.itemsIndexAs,a),s._flushProperties()):this.__insertInstance(l,o,a)}for(let s=this.__instances.length-1;s>=o;s--)this.__detachAndRemoveInstance(s)}__detachInstance(t){let e=this.__instances[t],r=Ft(e.root);for(let i=0;i<e.children.length;i++){let o=e.children[i];r.appendChild(o)}return e}__attachInstance(t,e){let r=this.__instances[t];e.insertBefore(r.root,this)}__detachAndRemoveInstance(t){this.__detachInstance(t),this.__instances.splice(t,1)}__stampInstance(t,e,r){let i={};return i[this.as]=t,i[this.indexAs]=e,i[this.itemsIndexAs]=r,new this.__ctor(i)}__insertInstance(t,e,r){let i=this.__stampInstance(t,e,r),o=this.__instances[e+1],s=o?o.children[0]:this;return Ft(Ft(this).parentNode).insertBefore(i.root,s),this.__instances[e]=i,i}_showHideChildren(t){for(let e=0;e<this.__instances.length;e++)this.__instances[e]._showHideChildren(t)}__handleItemPath(t,e){let r=t.slice(6),i=r.indexOf("."),o=i<0?r:r.substring(0,i);if(o==parseInt(o,10)){let s=i<0?"":r.substring(i+1);this.__handleObservedPaths(s);let a=this.__itemsIdxToInstIdx[o],l=this.__instances[a];if(l){let c=this.as+(s?"."+s:"");l._setPendingPropertyOrPath(c,e,!1,!0),l._flushProperties()}return!0}}itemForElement(t){let e=this.modelForElement(t);return e&&e[this.as]}indexForElement(t){let e=this.modelForElement(t);return e&&e[this.indexAs]}modelForElement(t){return zf(this.template,t)}};customElements.define(Ff.is,Ff);var Of=class extends Ae{static get is(){return"dom-if"}static get template(){return null}static get properties(){return{if:{type:Boolean,observer:"__debounceRender"},restamp:{type:Boolean,observer:"__debounceRender"},notifyDomChange:{type:Boolean}}}constructor(){super(),this.__renderDebouncer=null,this._lastIf=!1,this.__hideTemplateChildren__=!1,this.__template,this._templateInfo}__debounceRender(){this.__renderDebouncer=Jn.debounce(this.__renderDebouncer,On,()=>this.__render()),Ao(this.__renderDebouncer)}disconnectedCallback(){super.disconnectedCallback();let t=Ft(this).parentNode;(!t||t.nodeType==Node.DOCUMENT_FRAGMENT_NODE&&!Ft(t).host)&&this.__teardownInstance()}connectedCallback(){super.connectedCallback(),hl()||(this.style.display="none"),this.if&&this.__debounceRender()}__ensureTemplate(){if(!this.__template){let t=this,e=t._templateInfo?t:Ft(t).querySelector("template");if(!e){let r=new MutationObserver(()=>{if(Ft(this).querySelector("template"))r.disconnect(),this.__render();else throw new Error("dom-if requires a <template> child")});return r.observe(this,{childList:!0}),!1}this.__template=e}return!0}__ensureInstance(){let t=Ft(this).parentNode;if(this.__hasInstance()){let e=this.__getInstanceNodes();if(e&&e.length&&Ft(this).previousSibling!==e[e.length-1])for(let i=0,o;i<e.length&&(o=e[i]);i++)Ft(t).insertBefore(o,this)}else{if(!t||!this.__ensureTemplate())return!1;this.__createAndInsertInstance(t)}return!0}render(){jr()}__render(){if(this.if){if(!this.__ensureInstance())return}else this.restamp&&this.__teardownInstance();this._showHideChildren(),(!Cu||this.notifyDomChange)&&this.if!=this._lastIf&&(this.dispatchEvent(new CustomEvent("dom-change",{bubbles:!0,composed:!0})),this._lastIf=this.if)}__hasInstance(){}__getInstanceNodes(){}__createAndInsertInstance(t){}__teardownInstance(){}_showHideChildren(){}},P2=class extends Of{constructor(){super(),this.__instance=null,this.__syncInfo=null}__hasInstance(){return Boolean(this.__instance)}__getInstanceNodes(){return this.__instance.templateInfo.childNodes}__createAndInsertInstance(t){let e=this.__dataHost||this;if(Er&&!this.__dataHost)throw new Error("strictTemplatePolicy: template owner not trusted");let r=e._bindTemplate(this.__template,!0);r.runEffects=(i,o,s)=>{let a=this.__syncInfo;if(this.if)a&&(this.__syncInfo=null,this._showHideChildren(),o=Object.assign(a.changedProps,o)),i(o,s);else if(this.__instance)if(a||(a=this.__syncInfo={runEffects:i,changedProps:{}}),s)for(let l in o){let c=Gr(l);a.changedProps[c]=this.__dataHost[c]}else Object.assign(a.changedProps,o)},this.__instance=e._stampTemplate(this.__template,r),Ft(t).insertBefore(this.__instance,this)}__syncHostProperties(){let t=this.__syncInfo;t&&(this.__syncInfo=null,t.runEffects(t.changedProps,!1))}__teardownInstance(){let t=this.__dataHost||this;this.__instance&&(t._removeBoundDom(this.__instance),this.__instance=null,this.__syncInfo=null)}_showHideChildren(){let t=this.__hideTemplateChildren__||!this.if;this.__instance&&Boolean(this.__instance.__hidden)!==t&&(this.__instance.__hidden=t,k2(t,this.__instance.templateInfo.childNodes)),t||this.__syncHostProperties()}},N2=class extends Of{constructor(){super(),this.__ctor=null,this.__instance=null,this.__invalidProps=null}__hasInstance(){return Boolean(this.__instance)}__getInstanceNodes(){return this.__instance.children}__createAndInsertInstance(t){this.__ctor||(this.__ctor=Io(this.__template,this,{mutableData:!0,forwardHostProp:function(e,r){this.__instance&&(this.if?this.__instance.forwardHostProp(e,r):(this.__invalidProps=this.__invalidProps||Object.create(null),this.__invalidProps[Gr(e)]=!0))}})),this.__instance=new this.__ctor,Ft(t).insertBefore(this.__instance.root,this)}__teardownInstance(){if(this.__instance){let t=this.__instance.children;if(t&&t.length){let e=Ft(t[0]).parentNode;if(e){e=Ft(e);for(let r=0,i;r<t.length&&(i=t[r]);r++)e.removeChild(i)}}this.__invalidProps=null,this.__instance=null}}__syncHostProperties(){let t=this.__invalidProps;if(t){this.__invalidProps=null;for(let e in t)this.__instance._setPendingProperty(e,this.__dataHost[e]);this.__instance._flushProperties()}}_showHideChildren(){let t=this.__hideTemplateChildren__||!this.if;this.__instance&&Boolean(this.__instance.__hidden)!==t&&(this.__instance.__hidden=t,this.__instance._showHideChildren(t)),t||this.__syncHostProperties()}},d5=nf?P2:N2;customElements.define(d5.is,d5);var hH=ze(n=>{let t=Eo(n);class e extends t{static get properties(){return{items:{type:Array},multi:{type:Boolean,value:!1},selected:{type:Object,notify:!0},selectedItem:{type:Object,notify:!0},toggle:{type:Boolean,value:!1}}}static get observers(){return["__updateSelection(multi, items.*)"]}constructor(){super(),this.__lastItems=null,this.__lastMulti=null,this.__selectedMap=null}__updateSelection(i,o){let s=o.path;if(s==JSCompiler_renameProperty("items",this)){let a=o.base||[],l=this.__lastItems,c=this.__lastMulti;if(i!==c&&this.clearSelection(),l){let u=Nf(a,l);this.__applySplices(u)}this.__lastItems=a,this.__lastMulti=i}else if(o.path==`${JSCompiler_renameProperty("items",this)}.splices`)this.__applySplices(o.value.indexSplices);else{let a=s.slice(`${JSCompiler_renameProperty("items",this)}.`.length),l=parseInt(a,10);a.indexOf(".")<0&&a==l&&this.__deselectChangedIdx(l)}}__applySplices(i){let o=this.__selectedMap;for(let a=0;a<i.length;a++){let l=i[a];o.forEach((c,u)=>{c<l.index||(c>=l.index+l.removed.length?o.set(u,c+l.addedCount-l.removed.length):o.set(u,-1))});for(let c=0;c<l.addedCount;c++){let u=l.index+c;o.has(this.items[u])&&o.set(this.items[u],u)}}this.__updateLinks();let s=0;o.forEach((a,l)=>{a<0?(this.multi?this.splice(JSCompiler_renameProperty("selected",this),s,1):this.selected=this.selectedItem=null,o.delete(l)):s++})}__updateLinks(){if(this.__dataLinkedPaths={},this.multi){let i=0;this.__selectedMap.forEach(o=>{o>=0&&this.linkPaths(`${JSCompiler_renameProperty("items",this)}.${o}`,`${JSCompiler_renameProperty("selected",this)}.${i++}`)})}else this.__selectedMap.forEach(i=>{this.linkPaths(JSCompiler_renameProperty("selected",this),`${JSCompiler_renameProperty("items",this)}.${i}`),this.linkPaths(JSCompiler_renameProperty("selectedItem",this),`${JSCompiler_renameProperty("items",this)}.${i}`)})}clearSelection(){this.__dataLinkedPaths={},this.__selectedMap=new Map,this.selected=this.multi?[]:null,this.selectedItem=null}isSelected(i){return this.__selectedMap.has(i)}isIndexSelected(i){return this.isSelected(this.items[i])}__deselectChangedIdx(i){let o=this.__selectedIndexForItemIndex(i);if(o>=0){let s=0;this.__selectedMap.forEach((a,l)=>{o==s++&&this.deselect(l)})}}__selectedIndexForItemIndex(i){let o=this.__dataLinkedPaths[`${JSCompiler_renameProperty("items",this)}.${i}`];if(o)return parseInt(o.slice(`${JSCompiler_renameProperty("selected",this)}.`.length),10)}deselect(i){let o=this.__selectedMap.get(i);if(o>=0){this.__selectedMap.delete(i);let s;this.multi&&(s=this.__selectedIndexForItemIndex(o)),this.__updateLinks(),this.multi?this.splice(JSCompiler_renameProperty("selected",this),s,1):this.selected=this.selectedItem=null}}deselectIndex(i){this.deselect(this.items[i])}select(i){this.selectIndex(this.items.indexOf(i))}selectIndex(i){let o=this.items[i];this.isSelected(o)?this.toggle&&this.deselectIndex(i):(this.multi||this.__selectedMap.clear(),this.__selectedMap.set(o,i),this.__updateLinks(),this.multi?this.push(JSCompiler_renameProperty("selected",this),o):this.selected=this.selectedItem=o)}}return e});var pH=hH(Ae),Bf=class extends pH{static get is(){return"array-selector"}static get template(){return null}};customElements.define(Bf.is,Bf);var Vf=new Tr;window.ShadyCSS||(window.ShadyCSS={prepareTemplate(n,t,e){},prepareTemplateDom(n,t){},prepareTemplateStyles(n,t,e){},styleSubtree(n,t){Vf.processStyles(),Nu(n,t)},styleElement(n){Vf.processStyles()},styleDocument(n){Vf.processStyles(),Nu(document.body,n)},getComputedStyleValue(n,t){return bf(n,t)},flushCustomStyles(){},nativeCss:nl,nativeShadow:ks,cssBuild:To,disableRuntime:vf});window.ShadyCSS.CustomStyleInterface=Vf;var f5="include",dH=window.ShadyCSS.CustomStyleInterface,L2=class extends HTMLElement{constructor(){super(),this._style=null,dH.addCustomStyle(this)}getStyle(){if(this._style)return this._style;let t=this.querySelector("style");if(!t)return null;this._style=t;let e=t.getAttribute(f5);return e&&(t.removeAttribute(f5),t.textContent=zM(e)+t.textContent),this.ownerDocument!==window.document&&window.document.head.appendChild(this),this._style}};window.customElements.define("custom-style",L2);var m5;m5=ul._mutablePropertyChange;var g5={properties:{mutableData:Boolean},_shouldPropertyChange(n,t,e){return m5(this,n,t,e,this.mutableData)}};var ko=Ke(HTMLElement).prototype;var Hf=new Set,di={properties:{_parentResizable:{type:Object,observer:"_parentResizableChanged"},_notifyingDescendant:{type:Boolean,value:!1}},listeners:{"iron-request-resize-notifications":"_onIronRequestResizeNotifications"},created:function(){this._interestedResizables=[],this._boundNotifyResize=this.notifyResize.bind(this),this._boundOnDescendantIronResize=this._onDescendantIronResize.bind(this)},attached:function(){this._requestResizeNotifications()},detached:function(){this._parentResizable?this._parentResizable.stopResizeNotificationsFor(this):(Hf.delete(this),window.removeEventListener("resize",this._boundNotifyResize)),this._parentResizable=null},notifyResize:function(){!this.isAttached||(this._interestedResizables.forEach(function(n){this.resizerShouldNotify(n)&&this._notifyDescendant(n)},this),this._fireResize())},assignParentResizable:function(n){this._parentResizable&&this._parentResizable.stopResizeNotificationsFor(this),this._parentResizable=n,n&&n._interestedResizables.indexOf(this)===-1&&(n._interestedResizables.push(this),n._subscribeIronResize(this))},stopResizeNotificationsFor:function(n){var t=this._interestedResizables.indexOf(n);t>-1&&(this._interestedResizables.splice(t,1),this._unsubscribeIronResize(n))},_subscribeIronResize:function(n){n.addEventListener("iron-resize",this._boundOnDescendantIronResize)},_unsubscribeIronResize:function(n){n.removeEventListener("iron-resize",this._boundOnDescendantIronResize)},resizerShouldNotify:function(n){return!0},_onDescendantIronResize:function(n){if(this._notifyingDescendant){n.stopPropagation();return}As||this._fireResize()},_fireResize:function(){this.fire("iron-resize",null,{node:this,bubbles:!1})},_onIronRequestResizeNotifications:function(n){var t=Ct(n).rootTarget;t!==this&&(t.assignParentResizable(this),this._notifyDescendant(t),n.stopPropagation())},_parentResizableChanged:function(n){n&&window.removeEventListener("resize",this._boundNotifyResize)},_notifyDescendant:function(n){!this.isAttached||(this._notifyingDescendant=!0,n.notifyResize(),this._notifyingDescendant=!1)},_requestResizeNotifications:function(){if(!!this.isAttached)if(document.readyState==="loading"){var n=this._requestResizeNotifications.bind(this);document.addEventListener("readystatechange",function t(){document.removeEventListener("readystatechange",t),n()})}else this._findParent(),this._parentResizable?this._parentResizable._interestedResizables.forEach(function(t){t!==this&&t._findParent()},this):(Hf.forEach(function(t){t!==this&&t._findParent()},this),window.addEventListener("resize",this._boundNotifyResize),this.notifyResize())},_findParent:function(){this.assignParentResizable(null),this.fire("iron-request-resize-notifications",null,{node:this,bubbles:!0,cancelable:!0}),this._parentResizable?Hf.delete(this):Hf.add(this)}};At({_template:dt`
<style>
:host {
display: block;
transition-duration: var(--iron-collapse-transition-duration, 300ms);
/* Safari 10 needs this property prefixed to correctly apply the custom property */
-webkit-transition-duration: var(--iron-collapse-transition-duration, 300ms);
overflow: visible;
(c)?l._createReadOnlyProperty(c,
(c)?l._createReflectedProperty(c):u.reflectToAttribute===
Copyright 2010-2017 Mike Bostock
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the author nor the names of contributors may be used to
endorse or promote products derived from this software without specific prior
written permission.
Copyright 2010-2022 Three.js Authors
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 Google LLC. All Rights Reserved.
Copyright 2017, The TensorFlow Authors.
Copyright 2017 The TensorFlow Authors. All rights reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 Google LLC. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 Google LLC. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2020 Google Inc. All Rights Reserved.
Copyright 2020 Google LLC. All Rights Reserved.
Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Copyright 2020 The TensorFlow Authors. All Rights Reserved.
Copyright 2021 Google LLC. All Rights Reserved.
Copyright 2021 The TensorFlow Authors. All Rights Reserved.
Copyright 2021 The TensorFlow Authors. All Rights Reserved.
Copyright 2022 The TensorFlow Authors. All Rights Reserved.
Copyright 2023 The TensorFlow Authors. All Rights Reserved.
Copyright (c) 2006-2013 James Graham and other contributors
Copyright (c) 2012 by Simon Sapin.
Some rights reserved.
Copyright (c) 2014-2017, Mozilla Foundation
Copyright (c) 2014 The Polymer Project Authors. All rights reserved.
Copyright (c) 2015 Andrej Karpathy
Copyright (c) 2015 The Polymer Project Authors. All rights reserved.
Copyright (c) 2016 The Polymer Project Authors. All rights reserved.
Copyright (c) 2017 The Polymer Project Authors. All rights reserved.
Copyright (c) 2019 The Polymer Project Authors. All rights reserved.
Copyright (c) Microsoft Corporation. All rights reserved.
Copyright (c) Microsoft Corporation. All rights reserved.
*--------------------------------------------------------*/
Copyright (c) Microsoft Corporation. All rights reserved.
Copyright (c) Microsoft Corporation. All rights reserved.
*--------------------------------------------------------*/
define("vs/editor/editor.main.nls", {
"vs/base/browser/ui/actionbar/actionViewItems": [
"{0} ({1})"
copyright: Copyright 2012 by Simon Sapin
(c)
return char
def consumeEntity(self, allowedChar=None, fromAttribute=False):
(c)
# Step 11
while True:
(c)
# Step 5
c = next(data)
# Step 7
if c != b"=":
(c) the file writer was
# reopened by calling `.reopen()` on it, which creates a new
# file but does not clear the tag cache. This is considered
# sufficiently improbable that we don't take extra mitigations.
self._initial_metadata = {} # from tag name to `SummaryMetadata`
def Load(self):
(c) Use FAILED_PRECONDITION if the client should not retry until
the system state has been explicitly fixed. E.g., if an "rmdir"
fails because the directory is non-empty, FAILED_PRECONDITION
should be returned since the client should not retry unless
they have first fixed up the directory by deleting files from it.
(d) Use FAILED_PRECONDITION if the client performs conditional
REST Get/Update/Delete on a resource and the resource on the
server does not match the condition. E.g., conflicting
read-modify-write on the same resource.
"""
FAILED_PRECONDITION = 9
tensorflow-estimator
2.15.0
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Copyright 2016 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2019 The TensorFlow Authors. All Rights Reserved.
Copyright 2023 The TensorFlow Authors. All Rights Reserved.
tensorflow/io
0.37.1
Copyright 2021 The TensorFlow Authors. All Rights Reserved.
tensorflow/tensorboard
0.7.2
Copyright 2020 The TensorFlow Authors. All Rights Reserved.
termcolor-pypi
3.1.0
Copyright (c) 2008-2011 Volvox Development Team
Copyright (c) 2008-2011 Volvox Development Team
tflite-micro
20230726-snapshot-aa945a0f
Copyright 2023 The TensorFlow Authors. All Rights Reserved.
threadpoolctl
3.5.0
Copyright (c) 2017, Intel Corporation)
Copyright (c) 2017, Intel Corporation published under the BSD 3-Clause
Copyright (c) 2019, threadpoolctl contributors
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
tornado
6.4.2
(c) for c in clients
self.assertGreater(len(connected_clients), 0, "all clients failed connecting")
try:
(c) for c in clients
self.assertGreater(len(connected_clients), 0, "all clients failed connecting")
try:
Copyright 2009 Facebook
Copyright 2009 Facebook
Copyright 2011 Facebook
Copyright 2011 Facebook
Copyright 2012 Facebook
Copyright 2012 Facebook
Copyright 2014 Facebook
Copyright 2014 Facebook
Copyright 2015 The Tornado Authors
Copyright 2015 The Tornado Authors
(c)
yield
(c)
yield
tqdm
4.67.0
(c) > 255:
return False
return True
return _supports_unicode(s)
(c) Casper da Costa-Luis
[casperdcl](https://github.com/casperdcl).
* files: tqdm/_tqdm.py
MIT 2016 (c) [PR #96] on behalf of Google Inc.
* files: tqdm/_tqdm.py README.rst .gitignore
(c) Noam Yorav-Raphael, original author.
[PR #96]: https://github.com/tqdm/tqdm/pull/96
Copyright (c) 2013 noamraph
copyright
for their respective work, and release the work under the MIT licence
(text below).
Exceptions or notable authors are listed below
in reverse chronological order:
triton
2.1.0
Copyright 1993-2018 NVIDIA Corporation. All rights reserved.
Copyright (c) 2020 Da Yan @ HKUST
N/A
urllib3
2.2.3
Copyright (c) 2008-2020 Andrey Petrov and contributors.
copyright = f"
# The short X.Y version.
version = urllib3.__version__
# The full version, including alpha/beta/rc tags.
release = version
Werkzeug
3.1.3
copyright: 2007 Pallets
Copyright 2007 Pallets
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
wrapt
1.14.1
Copyright (c) 2013-2022, Graham Dumpleton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
Copyright (c) 2013-2022, Graham Dumpleton
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.