| + | + |
|---|---|
None
+Package |
+Version |
+License |
+Dependencies |
+
|---|---|---|---|
| + | ≥4.0.0 |
++ | None |
+
Additional Python packages needed for testing, code coverage collection and static type checking. These packages are +only needed for developers or on a CI server, thus sub-dependencies are not evaluated further.
+Manually Installing Test Requirements
+Use the tests/requirements.txt file to install all dependencies via pip3. The file will recursively install
+the mandatory dependencies too.
pip3 install -U -r tests/requirements.txt
+Dependency List
+Package |
+Version |
+License |
+Dependencies |
+
|---|---|---|---|
| + | ≥7.4.0 |
++ | Not yet evaluated. |
+
| + | ≥4.1.0 |
++ | Not yet evaluated. |
+
| + | ≥7.3 |
++ | Not yet evaluated. |
+
| + | ≥1.5 |
++ | Not yet evaluated. |
+
| + | ≥4.7.1 |
++ | Not yet evaluated. |
+
| + | ≥4.9 |
++ | Not yet evaluated. |
+
Additional Python packages needed for documentation generation. These packages are only needed for developers or on a +CI server, thus sub-dependencies are not evaluated further.
+Manually Installing Documentation Requirements
+Use the doc/requirements.txt file to install all dependencies via pip3. The file will recursively install
+the mandatory dependencies too.
pip3 install -U -r doc/requirements.txt
+Dependency List
+Package |
+Version |
+License |
+Dependencies |
+
|---|---|---|---|
| + | ≥4.0.0 |
++ | None |
+
| + | ≥5.3.0 |
++ | Not yet evaluated. |
+
| + | ≥0.5.2 |
++ | Not yet evaluated. |
+
| + | ≥0.0.6 |
++ | Not yet evaluated. |
+
| + | ≥1.19.5 |
++ | Not yet evaluated. |
+
Additional Python packages needed for installation package generation. These packages are only needed for developers or +on a CI server, thus sub-dependencies are not evaluated further.
+Manually Installing Packaging Requirements
+Use the build/requirements.txt file to install all dependencies via pip3. The file will recursively
+install the mandatory dependencies too.
pip3 install -U -r build/requirements.txt
+Dependency List
+Package |
+Version |
+License |
+Dependencies |
+
|---|---|---|---|
| + | ≥4.0.0 |
++ | None |
+
| + | ≥0.40.0 |
++ | Not yet evaluated. |
+
Additional Python packages needed for publishing the generated installation package to e.g, PyPI or any equivalent +services. These packages are only needed for maintainers or on a CI server, thus sub-dependencies are not evaluated +further.
+Manually Installing Publishing Requirements
+Use the dist/requirements.txt file to install all dependencies via pip3. The file will recursively
+install the mandatory dependencies too.
pip3 install -U -r dist/requirements.txt
+Dependency List
+Package |
+Version |
+License |
+Dependencies |
+
|---|---|---|---|
| + | ≥0.40.0 |
++ | Not yet evaluated. |
+
| + | ≥4.0.2 |
++ | Not yet evaluated. |
+
Note
+This is a local copy of the Creative Commons - Attribution 4.0 International (CC BY 4.0).
+Attention
+This CC BY 4.0 license applies only to the documentation of this project.
+Creative Commons Corporation (“Creative Commons”) is not a law firm and does not +provide legal services or legal advice. Distribution of Creative Commons public +licenses does not create a lawyer-client or other relationship. Creative Commons +makes its licenses and related information available on an “as-is” basis. +Creative Commons gives no warranties regarding its licenses, any material +licensed under their terms and conditions, or any related information. Creative +Commons disclaims all liability for damages resulting from their use to the +fullest extent possible.
+ +Creative Commons Attribution 4.0 International Public License
+By exercising the Licensed Rights (defined below), You accept and agree to be +bound by the terms and conditions of this Creative Commons Attribution 4.0 +International Public License (“Public License”). To the extent this Public +License may be interpreted as a contract, You are granted the Licensed Rights +in consideration of Your acceptance of these terms and conditions, and the +Licensor grants You such rights in consideration of benefits the Licensor +receives from making the Licensed Material available under these terms and +conditions.
+Adapted Material means material subject to Copyright and Similar +Rights that is derived from or based upon the Licensed Material and in +which the Licensed Material is translated, altered, arranged, transformed, or +otherwise modified in a manner requiring permission under the Copyright and +Similar Rights held by the Licensor. For purposes of this Public License, +where the Licensed Material is a musical work, performance, or sound +recording, Adapted Material is always produced where the Licensed Material +is synched in timed relation with a moving image.
Adapter’s License means the license You apply to Your Copyright and +Similar Rights in Your contributions to Adapted Material in accordance with +the terms and conditions of this Public License.
Copyright and Similar Rights means copyright and/or similar rights +closely related to copyright including, without limitation, performance, +broadcast, sound recording, and Sui Generis Database Rights, without regard +to how the rights are labeled or categorized. For purposes of this Public +License, the rights specified in Section 2(b)(1)-(2) are not Copyright and +Similar Rights.
Effective Technological Measures means those measures that, in the +absence of proper authority, may not be circumvented under laws fulfilling +obligations under Article 11 of the WIPO Copyright Treaty adopted on +December 20, 1996, and/or similar international agreements.
Exceptions and Limitations means fair use, fair dealing, and/or any +other exception or limitation to Copyright and Similar Rights that applies to +Your use of the Licensed Material.
Licensed Material means the artistic or literary work, database, or +other material to which the Licensor applied this Public License.
Licensed Rights means the rights granted to You subject to the terms +and conditions of this Public License, which are limited to all Copyright and +Similar Rights that apply to Your use of the Licensed Material and that the +Licensor has authority to license.
Licensor means the individual(s) or entity(ies) granting rights under +this Public License.
Share means to provide material to the public by any means or process +that requires permission under the Licensed Rights, such as reproduction, +public display, public performance, distribution, dissemination, +communication, or importation, and to make material available to the public +including in ways that members of the public may access the material from a +place and at a time individually chosen by them.
Sui Generis Database Rights means rights other than copyright +resulting from Directive 96/9/EC of the European Parliament and of the +Council of 11 March 1996 on the legal protection of databases, as amended +and/or succeeded, as well as other essentially equivalent rights anywhere +in the world.
You means the individual or entity exercising the Licensed Rights +under this Public License. Your has a corresponding meaning.
License grant.
+Subject to the terms and conditions of this Public License, the Licensor +hereby grants You a worldwide, royalty-free, non-sublicensable, +non-exclusive, irrevocable license to exercise the Licensed Rights in the +Licensed Material to:
++++
+- +
reproduce and Share the Licensed Material, in whole or in part; and
- +
produce, reproduce, and Share Adapted Material.
Exceptions and Limitations. For the avoidance of doubt, where +Exceptions and Limitations apply to Your use, this Public License does not +apply, and You do not need to comply with its terms and conditions.
Term. The term of this Public License is specified in Section 6(a).
Media and formats; technical modifications allowed. The Licensor +authorizes You to exercise the Licensed Rights in all media and formats +whether now known or hereafter created, and to make technical +modifications necessary to do so. The Licensor waives and/or agrees not to +assert any right or authority to forbid You from making technical +modifications necessary to exercise the Licensed Rights, including +technical modifications necessary to circumvent Effective Technological +Measures. For purposes of this Public License, simply making modifications +authorized by this Section 2(a)(4) never produces Adapted Material.
Downstream recipients.
++++
+- +
Offer from the Licensor – Licensed Material. Every recipient of +the Licensed Material automatically receives an offer from the +Licensor to exercise the Licensed Rights under the terms and +conditions of this Public License.
- +
No downstream restrictions. You may not offer or impose any +additional or different terms or conditions on, or apply any Effective +Technological Measures to, the Licensed Material if doing so restricts +exercise of the Licensed Rights by any recipient of the Licensed +Material.
No endorsement. Nothing in this Public License constitutes or may +be construed as permission to assert or imply that You are, or that Your +use of the Licensed Material is, connected with, or sponsored, endorsed, +or granted official status by, the Licensor or others designated to +receive attribution as provided in Section 3(a)(1)(A)(i).
Other rights.
+Moral rights, such as the right of integrity, are not licensed under this +Public License, nor are publicity, privacy, and/or other similar +personality rights; however, to the extent possible, the Licensor waives +and/or agrees not to assert any such rights held by the Licensor to the +limited extent necessary to allow You to exercise the Licensed Rights, but +not otherwise.
Patent and trademark rights are not licensed under this Public License.
To the extent possible, the Licensor waives any right to collect royalties +from You for the exercise of the Licensed Rights, whether directly or +through a collecting society under any voluntary or waivable statutory or +compulsory licensing scheme. In all other cases the Licensor expressly +reserves any right to collect such royalties.
Your exercise of the Licensed Rights is expressly made subject to the following conditions.
+Attribution.
+If You Share the Licensed Material (including in modified form), You must:
++++
+- +
retain the following if it is supplied by the Licensor with the +Licensed Material:
+++
+- +
identification of the creator(s) of the Licensed Material and any +others designated to receive attribution, in any reasonable manner +requested by the Licensor (including by pseudonym if designated);
- +
a copyright notice;
- +
a notice that refers to this Public License;
- +
a notice that refers to the disclaimer of warranties;
- +
a URI or hyperlink to the Licensed Material to the extent reasonably +practicable;
+
+- +
indicate if You modified the Licensed Material and retain an +indication of any previous modifications; and
- +
indicate the Licensed Material is licensed under this Public License, +and include the text of, or the URI or hyperlink to, this Public +License.
You may satisfy the conditions in Section 3(a)(1) in any reasonable manner +based on the medium, means, and context in which You Share the Licensed +Material. For example, it may be reasonable to satisfy the conditions by +providing a URI or hyperlink to a resource that includes the required +information.
If requested by the Licensor, You must remove any of the information +required by Section 3(a)(1)(A) to the extent reasonably practicable.
If You Share Adapted Material You produce, the Adapter’s License You apply +must not prevent recipients of the Adapted Material from complying with +this Public License.
Where the Licensed Rights include Sui Generis Database Rights that apply to Your +use of the Licensed Material:
+for the avoidance of doubt, Section 2(a)(1) grants You the right to extract, +reuse, reproduce, and Share all or a substantial portion of the contents of +the database;
if You include all or a substantial portion of the database contents in a +database in which You have Sui Generis Database Rights, then the database +in which You have Sui Generis Database Rights (but not its individual +contents) is Adapted Material; and
You must comply with the conditions in Section 3(a) if You Share all or a +substantial portion of the contents of the database.
For the avoidance of doubt, this Section 4 supplements and does not replace +Your obligations under this Public License where the Licensed Rights include +other Copyright and Similar Rights.
+Unless otherwise separately undertaken by the Licensor, to the extent +possible, the Licensor offers the Licensed Material as-is and as-available, +and makes no representations or warranties of any kind concerning the +Licensed Material, whether express, implied, statutory, or other. This +includes, without limitation, warranties of title, merchantability, +fitness for a particular purpose, non-infringement, absence of latent or +other defects, accuracy, or the presence or absence of errors, whether or +not known or discoverable. Where disclaimers of warranties are not allowed +in full or in part, this disclaimer may not apply to You.
To the extent possible, in no event will the Licensor be liable to You +on any legal theory (including, without limitation, negligence) or +otherwise for any direct, special, indirect, incidental, consequential, +punitive, exemplary, or other losses, costs, expenses, or damages arising +out of this Public License or use of the Licensed Material, even if the +Licensor has been advised of the possibility of such losses, costs, expenses, +or damages. Where a limitation of liability is not allowed in full or in +part, this limitation may not apply to You.
The disclaimer of warranties and limitation of liability provided above +shall be interpreted in a manner that, to the extent possible, most +closely approximates an absolute disclaimer and waiver of all liability.
This Public License applies for the term of the Copyright and Similar Rights +licensed here. However, if You fail to comply with this Public License, then +Your rights under this Public License terminate automatically.
Where Your right to use the Licensed Material has terminated under +Section 6(a), it reinstates:
+automatically as of the date the violation is cured, provided it is cured +within 30 days of Your discovery of the violation; or
upon express reinstatement by the Licensor.
For the avoidance of doubt, this Section 6(b) does not affect any right the +Licensor may have to seek remedies for Your violations of this Public License.
+For the avoidance of doubt, the Licensor may also offer the Licensed Material +under separate terms or conditions or stop distributing the Licensed Material +at any time; however, doing so will not terminate this Public License.
Sections 1, 5, 6, 7, and 8 survive termination of this Public License.
The Licensor shall not be bound by any additional or different terms or +conditions communicated by You unless expressly agreed.
Any arrangements, understandings, or agreements regarding the Licensed +Material not stated herein are separate from and independent of the terms +and conditions of this Public License.
For the avoidance of doubt, this Public License does not, and shall not be +interpreted to, reduce, limit, restrict, or impose conditions on any use of +the Licensed Material that could lawfully be made without permission under +this Public License.
To the extent possible, if any provision of this Public License is deemed +unenforceable, it shall be automatically reformed to the minimum extent +necessary to make it enforceable. If the provision cannot be reformed, it +shall be severed from this Public License without affecting the +enforceability of the remaining terms and conditions.
No term or condition of this Public License will be waived and no failure to +comply consented to unless expressly agreed to by the Licensor.
Nothing in this Public License constitutes or may be interpreted as a +limitation upon, or waiver of, any privileges and immunities that apply to +the Licensor or You, including from the legal processes of any jurisdiction +or authority.
Creative Commons is not a party to its public licenses. Notwithstanding, +Creative Commons may elect to apply one of its public licenses to material it +publishes and in those instances will be considered the “Licensor.” Except for +the limited purpose of indicating that material is shared under a Creative +Commons public license or as otherwise permitted by the Creative Commons +policies published at creativecommons.org/policies, +Creative Commons does not authorize the use of the trademark “Creative Commons” +or any other trademark or logo of Creative Commons without its prior written +consent including, without limitation, in connection with any unauthorized +modifications to any of its public licenses or any other arrangements, +understandings, or agreements concerning use of licensed material. For the +avoidance of doubt, this paragraph does not form part of the public licenses.
+Creative Commons may be contacted at creativecommons.org
+TBD
+Note
+This is a local copy of the Apache License Version 2.0.
+Attention
+This Apache License, 2.0 applies to all source and configuration files of project, except documentation.
+Version 2.0, January 2004
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+“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.
+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.
+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.
+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:
+You must give any other recipients of the Work or Derivative Works a copy of this License; and
You must cause any modified files to carry prominent notices stating that You changed the files; and
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
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.
+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.
+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.
+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.
+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.
+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.
+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.
+
+# ==================================================================================================================== #
+# ____ _ ____ ____ _ __ __ _ _ #
+# _ __ _ _/ ___| _ _ ___| |_ ___ _ __ ___ | _ \| _ \| | | \/ | ___ __| | ___| | #
+# | '_ \| | | \___ \| | | / __| __/ _ \ '_ ` _ \| |_) | | | | | | |\/| |/ _ \ / _` |/ _ \ | #
+# | |_) | |_| |___) | |_| \__ \ || __/ | | | | | _ <| |_| | |___| | | | (_) | (_| | __/ | #
+# | .__/ \__, |____/ \__, |___/\__\___|_| |_| |_|_| \_\____/|_____|_| |_|\___/ \__,_|\___|_| #
+# |_| |___/ |___/ #
+# ==================================================================================================================== #
+# Authors: #
+# Patrick Lehmann #
+# #
+# License: #
+# ==================================================================================================================== #
+# Copyright 2023-2023 Patrick Lehmann - Boetzingen, Germany #
+# #
+# 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. #
+# #
+# SPDX-License-Identifier: Apache-2.0 #
+# ==================================================================================================================== #
+#
+"""
+An abstract SystemRDL language model.
+
+:copyright: Copyright 2023-2023 Patrick Lehmann - Bötzingen, Germany
+:license: Apache License, Version 2.0
+"""
+from enum import unique, Enum
+from typing import Dict, Union
+
+from pyTooling.Decorators import export
+
+
+__author__ = "Patrick Lehmann"
+__email__ = "Paebbels@gmail.com"
+__copyright__ = "2023-2023, Patrick Lehmann"
+__license__ = "Apache License, Version 2.0"
+__version__ = "0.2.2"
+
+
+
+[docs]
+@export
+@unique
+class SystemRDLVersion(Enum):
+ Any = -1
+
+ SystemRDL2005 = 2005
+ SystemRDL2009 = 2009
+ SystemRDL2012 = 2012
+ SystemRDL2017 = 2017
+
+ Latest = 10000
+
+ __VERSION_MAPPINGS__: Dict[Union[int, str], Enum] = {
+ -1: Any,
+ 5: SystemRDL2005,
+ 9: SystemRDL2009,
+ 12: SystemRDL2012,
+ 17: SystemRDL2017,
+ 2005: SystemRDL2005,
+ 2009: SystemRDL2009,
+ 2012: SystemRDL2012,
+ 2017: SystemRDL2017,
+ 10000: Latest,
+ "Any": Any,
+ "05": SystemRDL2005,
+ "09": SystemRDL2009,
+ "12": SystemRDL2012,
+ "17": SystemRDL2017,
+ "2005": SystemRDL2005,
+ "2009": SystemRDL2009,
+ "2012": SystemRDL2012,
+ "2017": SystemRDL2017,
+ "Latest": SystemRDL2017,
+ }
+
+ def __init__(self, *_):
+ """Patch the embedded MAP dictionary"""
+ cls = self.__class__
+ for k, v in cls.__VERSION_MAPPINGS__.items():
+ if (not isinstance(v, cls)) and (v == self.value):
+ cls.__VERSION_MAPPINGS__[k] = self
+
+ @classmethod
+ def Parse(cls, value: Union[int, str]) -> "SystemRDLVersion":
+ try:
+ return cls.__VERSION_MAPPINGS__[value]
+ except KeyError:
+ raise ValueError(f"Value '{value!s}' cannot be parsed to member of {cls.__name__}.")
+
+
+[docs]
+ def __lt__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is less than the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is less than the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ return self.value < other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+
+[docs]
+ def __le__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is less or equal than the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is less or equal than the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ return self.value <= other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+
+[docs]
+ def __gt__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is greater than the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is greater than the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ return self.value > other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+
+[docs]
+ def __ge__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is greater or equal than the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is greater or equal than the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ return self.value >= other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+
+[docs]
+ def __ne__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is unequal to the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is unequal to the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ return self.value != other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+
+[docs]
+ def __eq__(self, other: Any) -> bool:
+ """
+ Compare two (System)Verilog versions if the version is equal to the second operand.
+
+ :param other: Parameter to compare against.
+ :returns: True if version is equal to the second operand.
+ :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+ """
+ if isinstance(other, SystemRDLVersion):
+ if (self is self.__class__.Any) or (other is self.__class__.Any):
+ return True
+ else:
+ return self.value == other.value
+ else:
+ raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+
+
+ def __str__(self) -> str:
+ """
+ Formats the SystemRDLVersion version to pattern ``SystemRDL'xx``.
+
+ :return: Formatted SystemRDL version.
+ """
+ if self.value == self.Any.value:
+ return "SystemRDL'Any"
+ if self.value == self.Latest.value:
+ return "SystemRDL'Latest"
+
+ year = str(self.value)[-2:]
+ return f"SystemRDL'{year}"
+
+ def __repr__(self) -> str:
+ """
+ Formats the SystemRDL version to pattern ``xxxx``.
+
+ :return: Formatted SystemRDL version.
+ """
+ if self.value == self.Any.value:
+ return "Any"
+ elif self.value == self.Latest.value:
+ return "Latest"
+ else:
+ return str(self.value)
+
+' + + '' + + _("Hide Search Matches") + + "
" + ) + ); + }, + + /** + * helper function to hide the search marks again + */ + hideSearchWords: () => { + document + .querySelectorAll("#searchbox .highlight-link") + .forEach((el) => el.remove()); + document + .querySelectorAll("span.highlighted") + .forEach((el) => el.classList.remove("highlighted")); + localStorage.removeItem("sphinx_highlight_terms") + }, + + initEscapeListener: () => { + // only install a listener if it is really needed + if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) return; + + document.addEventListener("keydown", (event) => { + // bail for input elements + if (BLACKLISTED_KEY_CONTROL_ELEMENTS.has(document.activeElement.tagName)) return; + // bail with special keys + if (event.shiftKey || event.altKey || event.ctrlKey || event.metaKey) return; + if (DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS && (event.key === "Escape")) { + SphinxHighlight.hideSearchWords(); + event.preventDefault(); + } + }); + }, +}; + +_ready(() => { + /* Do not call highlightSearchWords() when we are on the search page. + * It will highlight words from the *previous* search query. + */ + if (typeof Search === "undefined") SphinxHighlight.highlightSearchWords(); + SphinxHighlight.initEscapeListener(); +}); diff --git a/coverage/coverage_html.js b/coverage/coverage_html.js new file mode 100644 index 0000000..5934882 --- /dev/null +++ b/coverage/coverage_html.js @@ -0,0 +1,624 @@ +// Licensed under the Apache License: http://www.apache.org/licenses/LICENSE-2.0 +// For details: https://github.com/nedbat/coveragepy/blob/master/NOTICE.txt + +// Coverage.py HTML report browser code. +/*jslint browser: true, sloppy: true, vars: true, plusplus: true, maxerr: 50, indent: 4 */ +/*global coverage: true, document, window, $ */ + +coverage = {}; + +// General helpers +function debounce(callback, wait) { + let timeoutId = null; + return function(...args) { + clearTimeout(timeoutId); + timeoutId = setTimeout(() => { + callback.apply(this, args); + }, wait); + }; +}; + +function checkVisible(element) { + const rect = element.getBoundingClientRect(); + const viewBottom = Math.max(document.documentElement.clientHeight, window.innerHeight); + const viewTop = 30; + return !(rect.bottom < viewTop || rect.top >= viewBottom); +} + +function on_click(sel, fn) { + const elt = document.querySelector(sel); + if (elt) { + elt.addEventListener("click", fn); + } +} + +// Helpers for table sorting +function getCellValue(row, column = 0) { + const cell = row.cells[column] // nosemgrep: eslint.detect-object-injection + if (cell.childElementCount == 1) { + const child = cell.firstElementChild + if (child instanceof HTMLTimeElement && child.dateTime) { + return child.dateTime + } else if (child instanceof HTMLDataElement && child.value) { + return child.value + } + } + return cell.innerText || cell.textContent; +} + +function rowComparator(rowA, rowB, column = 0) { + let valueA = getCellValue(rowA, column); + let valueB = getCellValue(rowB, column); + if (!isNaN(valueA) && !isNaN(valueB)) { + return valueA - valueB + } + return valueA.localeCompare(valueB, undefined, {numeric: true}); +} + +function sortColumn(th) { + // Get the current sorting direction of the selected header, + // clear state on other headers and then set the new sorting direction + const currentSortOrder = th.getAttribute("aria-sort"); + [...th.parentElement.cells].forEach(header => header.setAttribute("aria-sort", "none")); + if (currentSortOrder === "none") { + th.setAttribute("aria-sort", th.dataset.defaultSortOrder || "ascending"); + } else { + th.setAttribute("aria-sort", currentSortOrder === "ascending" ? "descending" : "ascending"); + } + + const column = [...th.parentElement.cells].indexOf(th) + + // Sort all rows and afterwards append them in order to move them in the DOM + Array.from(th.closest("table").querySelectorAll("tbody tr")) + .sort((rowA, rowB) => rowComparator(rowA, rowB, column) * (th.getAttribute("aria-sort") === "ascending" ? 1 : -1)) + .forEach(tr => tr.parentElement.appendChild(tr) ); +} + +// Find all the elements with data-shortcut attribute, and use them to assign a shortcut key. +coverage.assign_shortkeys = function () { + document.querySelectorAll("[data-shortcut]").forEach(element => { + document.addEventListener("keypress", event => { + if (event.target.tagName.toLowerCase() === "input") { + return; // ignore keypress from search filter + } + if (event.key === element.dataset.shortcut) { + element.click(); + } + }); + }); +}; + +// Create the events for the filter box. +coverage.wire_up_filter = function () { + // Cache elements. + const table = document.querySelector("table.index"); + const table_body_rows = table.querySelectorAll("tbody tr"); + const no_rows = document.getElementById("no_rows"); + + // Observe filter keyevents. + document.getElementById("filter").addEventListener("input", debounce(event => { + // Keep running total of each metric, first index contains number of shown rows + const totals = new Array(table.rows[0].cells.length).fill(0); + // Accumulate the percentage as fraction + totals[totals.length - 1] = { "numer": 0, "denom": 0 }; // nosemgrep: eslint.detect-object-injection + + // Hide / show elements. + table_body_rows.forEach(row => { + if (!row.cells[0].textContent.includes(event.target.value)) { + // hide + row.classList.add("hidden"); + return; + } + + // show + row.classList.remove("hidden"); + totals[0]++; + + for (let column = 1; column < totals.length; column++) { + // Accumulate dynamic totals + cell = row.cells[column] // nosemgrep: eslint.detect-object-injection + if (column === totals.length - 1) { + // Last column contains percentage + const [numer, denom] = cell.dataset.ratio.split(" "); + totals[column]["numer"] += parseInt(numer, 10); // nosemgrep: eslint.detect-object-injection + totals[column]["denom"] += parseInt(denom, 10); // nosemgrep: eslint.detect-object-injection + } else { + totals[column] += parseInt(cell.textContent, 10); // nosemgrep: eslint.detect-object-injection + } + } + }); + + // Show placeholder if no rows will be displayed. + if (!totals[0]) { + // Show placeholder, hide table. + no_rows.style.display = "block"; + table.style.display = "none"; + return; + } + + // Hide placeholder, show table. + no_rows.style.display = null; + table.style.display = null; + + const footer = table.tFoot.rows[0]; + // Calculate new dynamic sum values based on visible rows. + for (let column = 1; column < totals.length; column++) { + // Get footer cell element. + const cell = footer.cells[column]; // nosemgrep: eslint.detect-object-injection + + // Set value into dynamic footer cell element. + if (column === totals.length - 1) { + // Percentage column uses the numerator and denominator, + // and adapts to the number of decimal places. + const match = /\.([0-9]+)/.exec(cell.textContent); + const places = match ? match[1].length : 0; + const { numer, denom } = totals[column]; // nosemgrep: eslint.detect-object-injection + cell.dataset.ratio = `${numer} ${denom}`; + // Check denom to prevent NaN if filtered files contain no statements + cell.textContent = denom + ? `${(numer * 100 / denom).toFixed(places)}%` + : `${(100).toFixed(places)}%`; + } else { + cell.textContent = totals[column]; // nosemgrep: eslint.detect-object-injection + } + } + })); + + // Trigger change event on setup, to force filter on page refresh + // (filter value may still be present). + document.getElementById("filter").dispatchEvent(new Event("input")); +}; + +coverage.INDEX_SORT_STORAGE = "COVERAGE_INDEX_SORT_2"; + +// Loaded on index.html +coverage.index_ready = function () { + coverage.assign_shortkeys(); + coverage.wire_up_filter(); + document.querySelectorAll("[data-sortable] th[aria-sort]").forEach( + th => th.addEventListener("click", e => sortColumn(e.target)) + ); + + // Look for a localStorage item containing previous sort settings: + const stored_list = localStorage.getItem(coverage.INDEX_SORT_STORAGE); + + if (stored_list) { + const {column, direction} = JSON.parse(stored_list); + const th = document.querySelector("[data-sortable]").tHead.rows[0].cells[column]; // nosemgrep: eslint.detect-object-injection + th.setAttribute("aria-sort", direction === "ascending" ? "descending" : "ascending"); + th.click() + } + + // Watch for page unload events so we can save the final sort settings: + window.addEventListener("unload", function () { + const th = document.querySelector('[data-sortable] th[aria-sort="ascending"], [data-sortable] [aria-sort="descending"]'); + if (!th) { + return; + } + localStorage.setItem(coverage.INDEX_SORT_STORAGE, JSON.stringify({ + column: [...th.parentElement.cells].indexOf(th), + direction: th.getAttribute("aria-sort"), + })); + }); + + on_click(".button_prev_file", coverage.to_prev_file); + on_click(".button_next_file", coverage.to_next_file); + + on_click(".button_show_hide_help", coverage.show_hide_help); +}; + +// -- pyfile stuff -- + +coverage.LINE_FILTERS_STORAGE = "COVERAGE_LINE_FILTERS"; + +coverage.pyfile_ready = function () { + // If we're directed to a particular line number, highlight the line. + var frag = location.hash; + if (frag.length > 2 && frag[1] === "t") { + document.querySelector(frag).closest(".n").classList.add("highlight"); + coverage.set_sel(parseInt(frag.substr(2), 10)); + } else { + coverage.set_sel(0); + } + + on_click(".button_toggle_run", coverage.toggle_lines); + on_click(".button_toggle_mis", coverage.toggle_lines); + on_click(".button_toggle_exc", coverage.toggle_lines); + on_click(".button_toggle_par", coverage.toggle_lines); + + on_click(".button_next_chunk", coverage.to_next_chunk_nicely); + on_click(".button_prev_chunk", coverage.to_prev_chunk_nicely); + on_click(".button_top_of_page", coverage.to_top); + on_click(".button_first_chunk", coverage.to_first_chunk); + + on_click(".button_prev_file", coverage.to_prev_file); + on_click(".button_next_file", coverage.to_next_file); + on_click(".button_to_index", coverage.to_index); + + on_click(".button_show_hide_help", coverage.show_hide_help); + + coverage.filters = undefined; + try { + coverage.filters = localStorage.getItem(coverage.LINE_FILTERS_STORAGE); + } catch(err) {} + + if (coverage.filters) { + coverage.filters = JSON.parse(coverage.filters); + } + else { + coverage.filters = {run: false, exc: true, mis: true, par: true}; + } + + for (cls in coverage.filters) { + coverage.set_line_visibilty(cls, coverage.filters[cls]); // nosemgrep: eslint.detect-object-injection + } + + coverage.assign_shortkeys(); + coverage.init_scroll_markers(); + coverage.wire_up_sticky_header(); + + document.querySelectorAll("[id^=ctxs]").forEach( + cbox => cbox.addEventListener("click", coverage.expand_contexts) + ); + + // Rebuild scroll markers when the window height changes. + window.addEventListener("resize", coverage.build_scroll_markers); +}; + +coverage.toggle_lines = function (event) { + const btn = event.target.closest("button"); + const category = btn.value + const show = !btn.classList.contains("show_" + category); + coverage.set_line_visibilty(category, show); + coverage.build_scroll_markers(); + coverage.filters[category] = show; + try { + localStorage.setItem(coverage.LINE_FILTERS_STORAGE, JSON.stringify(coverage.filters)); + } catch(err) {} +}; + +coverage.set_line_visibilty = function (category, should_show) { + const cls = "show_" + category; + const btn = document.querySelector(".button_toggle_" + category); + if (btn) { + if (should_show) { + document.querySelectorAll("#source ." + category).forEach(e => e.classList.add(cls)); + btn.classList.add(cls); + } + else { + document.querySelectorAll("#source ." + category).forEach(e => e.classList.remove(cls)); + btn.classList.remove(cls); + } + } +}; + +// Return the nth line div. +coverage.line_elt = function (n) { + return document.getElementById("t" + n)?.closest("p"); +}; + +// Set the selection. b and e are line numbers. +coverage.set_sel = function (b, e) { + // The first line selected. + coverage.sel_begin = b; + // The next line not selected. + coverage.sel_end = (e === undefined) ? b+1 : e; +}; + +coverage.to_top = function () { + coverage.set_sel(0, 1); + coverage.scroll_window(0); +}; + +coverage.to_first_chunk = function () { + coverage.set_sel(0, 1); + coverage.to_next_chunk(); +}; + +coverage.to_prev_file = function () { + window.location = document.getElementById("prevFileLink").href; +} + +coverage.to_next_file = function () { + window.location = document.getElementById("nextFileLink").href; +} + +coverage.to_index = function () { + location.href = document.getElementById("indexLink").href; +} + +coverage.show_hide_help = function () { + const helpCheck = document.getElementById("help_panel_state") + helpCheck.checked = !helpCheck.checked; +} + +// Return a string indicating what kind of chunk this line belongs to, +// or null if not a chunk. +coverage.chunk_indicator = function (line_elt) { + const classes = line_elt?.className; + if (!classes) { + return null; + } + const match = classes.match(/\bshow_\w+\b/); + if (!match) { + return null; + } + return match[0]; +}; + +coverage.to_next_chunk = function () { + const c = coverage; + + // Find the start of the next colored chunk. + var probe = c.sel_end; + var chunk_indicator, probe_line; + while (true) { + probe_line = c.line_elt(probe); + if (!probe_line) { + return; + } + chunk_indicator = c.chunk_indicator(probe_line); + if (chunk_indicator) { + break; + } + probe++; + } + + // There's a next chunk, `probe` points to it. + var begin = probe; + + // Find the end of this chunk. + var next_indicator = chunk_indicator; + while (next_indicator === chunk_indicator) { + probe++; + probe_line = c.line_elt(probe); + next_indicator = c.chunk_indicator(probe_line); + } + c.set_sel(begin, probe); + c.show_selection(); +}; + +coverage.to_prev_chunk = function () { + const c = coverage; + + // Find the end of the prev colored chunk. + var probe = c.sel_begin-1; + var probe_line = c.line_elt(probe); + if (!probe_line) { + return; + } + var chunk_indicator = c.chunk_indicator(probe_line); + while (probe > 1 && !chunk_indicator) { + probe--; + probe_line = c.line_elt(probe); + if (!probe_line) { + return; + } + chunk_indicator = c.chunk_indicator(probe_line); + } + + // There's a prev chunk, `probe` points to its last line. + var end = probe+1; + + // Find the beginning of this chunk. + var prev_indicator = chunk_indicator; + while (prev_indicator === chunk_indicator) { + probe--; + if (probe <= 0) { + return; + } + probe_line = c.line_elt(probe); + prev_indicator = c.chunk_indicator(probe_line); + } + c.set_sel(probe+1, end); + c.show_selection(); +}; + +// Returns 0, 1, or 2: how many of the two ends of the selection are on +// the screen right now? +coverage.selection_ends_on_screen = function () { + if (coverage.sel_begin === 0) { + return 0; + } + + const begin = coverage.line_elt(coverage.sel_begin); + const end = coverage.line_elt(coverage.sel_end-1); + + return ( + (checkVisible(begin) ? 1 : 0) + + (checkVisible(end) ? 1 : 0) + ); +}; + +coverage.to_next_chunk_nicely = function () { + if (coverage.selection_ends_on_screen() === 0) { + // The selection is entirely off the screen: + // Set the top line on the screen as selection. + + // This will select the top-left of the viewport + // As this is most likely the span with the line number we take the parent + const line = document.elementFromPoint(0, 0).parentElement; + if (line.parentElement !== document.getElementById("source")) { + // The element is not a source line but the header or similar + coverage.select_line_or_chunk(1); + } else { + // We extract the line number from the id + coverage.select_line_or_chunk(parseInt(line.id.substring(1), 10)); + } + } + coverage.to_next_chunk(); +}; + +coverage.to_prev_chunk_nicely = function () { + if (coverage.selection_ends_on_screen() === 0) { + // The selection is entirely off the screen: + // Set the lowest line on the screen as selection. + + // This will select the bottom-left of the viewport + // As this is most likely the span with the line number we take the parent + const line = document.elementFromPoint(document.documentElement.clientHeight-1, 0).parentElement; + if (line.parentElement !== document.getElementById("source")) { + // The element is not a source line but the header or similar + coverage.select_line_or_chunk(coverage.lines_len); + } else { + // We extract the line number from the id + coverage.select_line_or_chunk(parseInt(line.id.substring(1), 10)); + } + } + coverage.to_prev_chunk(); +}; + +// Select line number lineno, or if it is in a colored chunk, select the +// entire chunk +coverage.select_line_or_chunk = function (lineno) { + var c = coverage; + var probe_line = c.line_elt(lineno); + if (!probe_line) { + return; + } + var the_indicator = c.chunk_indicator(probe_line); + if (the_indicator) { + // The line is in a highlighted chunk. + // Search backward for the first line. + var probe = lineno; + var indicator = the_indicator; + while (probe > 0 && indicator === the_indicator) { + probe--; + probe_line = c.line_elt(probe); + if (!probe_line) { + break; + } + indicator = c.chunk_indicator(probe_line); + } + var begin = probe + 1; + + // Search forward for the last line. + probe = lineno; + indicator = the_indicator; + while (indicator === the_indicator) { + probe++; + probe_line = c.line_elt(probe); + indicator = c.chunk_indicator(probe_line); + } + + coverage.set_sel(begin, probe); + } + else { + coverage.set_sel(lineno); + } +}; + +coverage.show_selection = function () { + // Highlight the lines in the chunk + document.querySelectorAll("#source .highlight").forEach(e => e.classList.remove("highlight")); + for (let probe = coverage.sel_begin; probe < coverage.sel_end; probe++) { + coverage.line_elt(probe).querySelector(".n").classList.add("highlight"); + } + + coverage.scroll_to_selection(); +}; + +coverage.scroll_to_selection = function () { + // Scroll the page if the chunk isn't fully visible. + if (coverage.selection_ends_on_screen() < 2) { + const element = coverage.line_elt(coverage.sel_begin); + coverage.scroll_window(element.offsetTop - 60); + } +}; + +coverage.scroll_window = function (to_pos) { + window.scroll({top: to_pos, behavior: "smooth"}); +}; + +coverage.init_scroll_markers = function () { + // Init some variables + coverage.lines_len = document.querySelectorAll("#source > p").length; + + // Build html + coverage.build_scroll_markers(); +}; + +coverage.build_scroll_markers = function () { + const temp_scroll_marker = document.getElementById("scroll_marker") + if (temp_scroll_marker) temp_scroll_marker.remove(); + // Don't build markers if the window has no scroll bar. + if (document.body.scrollHeight <= window.innerHeight) { + return; + } + + const marker_scale = window.innerHeight / document.body.scrollHeight; + const line_height = Math.min(Math.max(3, window.innerHeight / coverage.lines_len), 10); + + let previous_line = -99, last_mark, last_top; + + const scroll_marker = document.createElement("div"); + scroll_marker.id = "scroll_marker"; + document.getElementById("source").querySelectorAll( + "p.show_run, p.show_mis, p.show_exc, p.show_exc, p.show_par" + ).forEach(element => { + const line_top = Math.floor(element.offsetTop * marker_scale); + const line_number = parseInt(element.querySelector(".n a").id.substr(1)); + + if (line_number === previous_line + 1) { + // If this solid missed block just make previous mark higher. + last_mark.style.height = `${line_top + line_height - last_top}px`; + } else { + // Add colored line in scroll_marker block. + last_mark = document.createElement("div"); + last_mark.id = `m${line_number}`; + last_mark.classList.add("marker"); + last_mark.style.height = `${line_height}px`; + last_mark.style.top = `${line_top}px`; + scroll_marker.append(last_mark); + last_top = line_top; + } + + previous_line = line_number; + }); + + // Append last to prevent layout calculation + document.body.append(scroll_marker); +}; + +coverage.wire_up_sticky_header = function () { + const header = document.querySelector("header"); + const header_bottom = ( + header.querySelector(".content h2").getBoundingClientRect().top - + header.getBoundingClientRect().top + ); + + function updateHeader() { + if (window.scrollY > header_bottom) { + header.classList.add("sticky"); + } else { + header.classList.remove("sticky"); + } + } + + window.addEventListener("scroll", updateHeader); + updateHeader(); +}; + +coverage.expand_contexts = function (e) { + var ctxs = e.target.parentNode.querySelector(".ctxs"); + + if (!ctxs.classList.contains("expanded")) { + var ctxs_text = ctxs.textContent; + var width = Number(ctxs_text[0]); + ctxs.textContent = ""; + for (var i = 1; i < ctxs_text.length; i += width) { + key = ctxs_text.substring(i, i + width).trim(); + ctxs.appendChild(document.createTextNode(contexts[key])); + ctxs.appendChild(document.createElement("br")); + } + ctxs.classList.add("expanded"); + } +}; + +document.addEventListener("DOMContentLoaded", () => { + if (document.body.classList.contains("indexfile")) { + coverage.index_ready(); + } else { + coverage.pyfile_ready(); + } +}); diff --git a/coverage/d_c3f0c586f6bd7f38___init___py.html b/coverage/d_c3f0c586f6bd7f38___init___py.html new file mode 100644 index 0000000..314da70 --- /dev/null +++ b/coverage/d_c3f0c586f6bd7f38___init___py.html @@ -0,0 +1,304 @@ + + + + ++ « prev + ^ index + » next + + coverage.py v7.3.2, + created at 2023-11-17 01:20 +0000 +
+ +1# ==================================================================================================================== #
+2# ____ _ ____ ____ _ __ __ _ _ #
+3# _ __ _ _/ ___| _ _ ___| |_ ___ _ __ ___ | _ \| _ \| | | \/ | ___ __| | ___| | #
+4# | '_ \| | | \___ \| | | / __| __/ _ \ '_ ` _ \| |_) | | | | | | |\/| |/ _ \ / _` |/ _ \ | #
+5# | |_) | |_| |___) | |_| \__ \ || __/ | | | | | _ <| |_| | |___| | | | (_) | (_| | __/ | #
+6# | .__/ \__, |____/ \__, |___/\__\___|_| |_| |_|_| \_\____/|_____|_| |_|\___/ \__,_|\___|_| #
+7# |_| |___/ |___/ #
+8# ==================================================================================================================== #
+9# Authors: #
+10# Patrick Lehmann #
+11# #
+12# License: #
+13# ==================================================================================================================== #
+14# Copyright 2023-2023 Patrick Lehmann - Boetzingen, Germany #
+15# #
+16# Licensed under the Apache License, Version 2.0 (the "License"); #
+17# you may not use this file except in compliance with the License. #
+18# You may obtain a copy of the License at #
+19# #
+20# http://www.apache.org/licenses/LICENSE-2.0 #
+21# #
+22# Unless required by applicable law or agreed to in writing, software #
+23# distributed under the License is distributed on an "AS IS" BASIS, #
+24# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. #
+25# See the License for the specific language governing permissions and #
+26# limitations under the License. #
+27# #
+28# SPDX-License-Identifier: Apache-2.0 #
+29# ==================================================================================================================== #
+30#
+31"""
+32An abstract SystemRDL language model.
+ +34:copyright: Copyright 2023-2023 Patrick Lehmann - Bötzingen, Germany
+35:license: Apache License, Version 2.0
+36"""
+37from enum import unique, Enum
+38from typing import Dict, Union
+ +40from pyTooling.Decorators import export
+ + +43__author__ = "Patrick Lehmann"
+44__email__ = "Paebbels@gmail.com"
+45__copyright__ = "2023-2023, Patrick Lehmann"
+46__license__ = "Apache License, Version 2.0"
+47__version__ = "0.2.2"
+ + +50@export
+51@unique
+52class SystemRDLVersion(Enum):
+53 Any = -1
+ +55 SystemRDL2005 = 2005
+56 SystemRDL2009 = 2009
+57 SystemRDL2012 = 2012
+58 SystemRDL2017 = 2017
+ +60 Latest = 10000
+ +62 __VERSION_MAPPINGS__: Dict[Union[int, str], Enum] = {
+63 -1: Any,
+64 5: SystemRDL2005,
+65 9: SystemRDL2009,
+66 12: SystemRDL2012,
+67 17: SystemRDL2017,
+68 2005: SystemRDL2005,
+69 2009: SystemRDL2009,
+70 2012: SystemRDL2012,
+71 2017: SystemRDL2017,
+72 10000: Latest,
+73 "Any": Any,
+74 "05": SystemRDL2005,
+75 "09": SystemRDL2009,
+76 "12": SystemRDL2012,
+77 "17": SystemRDL2017,
+78 "2005": SystemRDL2005,
+79 "2009": SystemRDL2009,
+80 "2012": SystemRDL2012,
+81 "2017": SystemRDL2017,
+82 "Latest": SystemRDL2017,
+83 }
+ +85 def __init__(self, *_):
+86 """Patch the embedded MAP dictionary"""
+87 cls = self.__class__
+88 for k, v in cls.__VERSION_MAPPINGS__.items():
+89 if (not isinstance(v, cls)) and (v == self.value):
+90 cls.__VERSION_MAPPINGS__[k] = self
+ +92 @classmethod
+93 def Parse(cls, value: Union[int, str]) -> "SystemRDLVersion":
+94 try:
+95 return cls.__VERSION_MAPPINGS__[value]
+96 except KeyError:
+97 raise ValueError(f"Value '{value!s}' cannot be parsed to member of {cls.__name__}.")
+ +99 def __lt__(self, other: Any) -> bool:
+100 """
+101 Compare two (System)Verilog versions if the version is less than the second operand.
+ +103 :param other: Parameter to compare against.
+104 :returns: True if version is less than the second operand.
+105 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+106 """
+107 if isinstance(other, SystemRDLVersion):
+108 return self.value < other.value
+109 else:
+110 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +112 def __le__(self, other: Any) -> bool:
+113 """
+114 Compare two (System)Verilog versions if the version is less or equal than the second operand.
+ +116 :param other: Parameter to compare against.
+117 :returns: True if version is less or equal than the second operand.
+118 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+119 """
+120 if isinstance(other, SystemRDLVersion):
+121 return self.value <= other.value
+122 else:
+123 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +125 def __gt__(self, other: Any) -> bool:
+126 """
+127 Compare two (System)Verilog versions if the version is greater than the second operand.
+ +129 :param other: Parameter to compare against.
+130 :returns: True if version is greater than the second operand.
+131 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+132 """
+133 if isinstance(other, SystemRDLVersion):
+134 return self.value > other.value
+135 else:
+136 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +138 def __ge__(self, other: Any) -> bool:
+139 """
+140 Compare two (System)Verilog versions if the version is greater or equal than the second operand.
+ +142 :param other: Parameter to compare against.
+143 :returns: True if version is greater or equal than the second operand.
+144 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+145 """
+146 if isinstance(other, SystemRDLVersion):
+147 return self.value >= other.value
+148 else:
+149 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +151 def __ne__(self, other: Any) -> bool:
+152 """
+153 Compare two (System)Verilog versions if the version is unequal to the second operand.
+ +155 :param other: Parameter to compare against.
+156 :returns: True if version is unequal to the second operand.
+157 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+158 """
+159 if isinstance(other, SystemRDLVersion):
+160 return self.value != other.value
+161 else:
+162 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +164 def __eq__(self, other: Any) -> bool:
+165 """
+166 Compare two (System)Verilog versions if the version is equal to the second operand.
+ +168 :param other: Parameter to compare against.
+169 :returns: True if version is equal to the second operand.
+170 :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`.
+171 """
+172 if isinstance(other, SystemRDLVersion):
+173 if (self is self.__class__.Any) or (other is self.__class__.Any):
+174 return True
+175 else:
+176 return self.value == other.value
+177 else:
+178 raise TypeError("Second operand is not of type 'SystemRDLVersion'.")
+ +180 def __str__(self) -> str:
+181 """
+182 Formats the SystemRDLVersion version to pattern ``SystemRDL'xx``.
+ +184 :return: Formatted SystemRDL version.
+185 """
+186 if self.value == self.Any.value:
+187 return "SystemRDL'Any"
+188 if self.value == self.Latest.value: 188 ↛ 189line 188 didn't jump to line 189, because the condition on line 188 was never true
+189 return "SystemRDL'Latest"
+ +191 year = str(self.value)[-2:]
+192 return f"SystemRDL'{year}"
+ +194 def __repr__(self) -> str:
+195 """
+196 Formats the SystemRDL version to pattern ``xxxx``.
+ +198 :return: Formatted SystemRDL version.
+199 """
+200 if self.value == self.Any.value:
+201 return "Any"
+202 elif self.value == self.Latest.value:
+203 return "Latest"
+204 else:
+205 return str(self.value)
++ coverage.py v7.3.2, + created at 2023-11-17 01:20 +0000 +
+| Module | +statements | +missing | +excluded | +branches | +partial | +coverage | +
|---|---|---|---|---|---|---|
| pySystemRDLModel/__init__.py | +69 | +26 | +0 | +33 | +1 | +56% | +
| Total | +69 | +26 | +0 | +33 | +1 | +56% | +
+ No items found using the specified filter. +
+| + | + |
|
+
|
+
|
+
|
+ + |
+
An abstract SystemRDL language model.
+This package provides a unified abstract language model for SystemRDL. +Projects reading from source files can derive own classes and implement additional logic to create a concrete language +model for their tools.
+Projects consuming pre-processed SystemRDL data (parsed, analyzed or elaborated) can build higher level features +and services on such a model, while supporting multiple frontends.
+TBD
Moved SystemRDLVersion class from pyEDAA.ProjectModel to this new repository.
Patrick Lehmann (Maintainer)
This Python package (source code) is licensed under Apache License 2.0.
+The accompanying documentation is licensed under Creative Commons - Attribution 4.0 (CC-BY 4.0).
This document was generated on 17.Nov 2023 - 01:21.
+Reference of all packages and modules:
+ +pySystemRDLModel¶Classes
+SystemRDLVersion:
+Create a collection of name/value pairs.
Inheritance
+ +Compare two (System)Verilog versions if the version is less than the second operand.
+other (-1) – Parameter to compare against.
+True if version is less than the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
Compare two (System)Verilog versions if the version is less or equal than the second operand.
+other (-1) – Parameter to compare against.
+True if version is less or equal than the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
Compare two (System)Verilog versions if the version is greater than the second operand.
+other (-1) – Parameter to compare against.
+True if version is greater than the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
Compare two (System)Verilog versions if the version is greater or equal than the second operand.
+other (-1) – Parameter to compare against.
+True if version is greater or equal than the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
Compare two (System)Verilog versions if the version is unequal to the second operand.
+other (-1) – Parameter to compare against.
+True if version is unequal to the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
Compare two (System)Verilog versions if the version is equal to the second operand.
+other (-1) – Parameter to compare against.
+True if version is equal to the second operand.
+TypeError – If parameter other is not of type SystemRDLVersion.
pySystemRDLModel", "Static Type Checking Report"], "terms": {"\u00bd": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00bc": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u215b": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00be": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u215c": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u215d": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u215e": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "_": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00b5": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03c9": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00aa": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00ba": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00b9": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00b2": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u00b3": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u212c": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2145": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u212d": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2102": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2146": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03dd": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2130": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2147": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2131": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u02c7": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u210f": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u210b": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2111": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2148": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2110": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2124": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2112": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2133": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2115": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2134": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u210c": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2119": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u210d": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u211a": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u211c": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u211b": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u211d": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03f5": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03d5": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03c5": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03b5": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03f0": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03c6": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03d6": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03f1": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03c2": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u03d1": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "\u2128": [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14], "tbd": [0, 5, 10], "class": [0, 6, 7, 10, 13], "systemrdlvers": [0, 10, 12, 13], "wa": [0, 7, 10], "move": [0, 2, 10], "from": [0, 2, 7, 10], "pyedaa": [0, 10], "projectmodel": [0, 10], "thi": [0, 2, 7, 10], "packag": [0, 10, 12], "librari": 1, "io": 1, "requir": [1, 2, 7], "none": [1, 13], "version": [1, 7, 13], "licens": 1, "pytool": 1, "4": [1, 10], "0": [1, 10], "apach": [1, 10], "2": [1, 10], "addit": [1, 2, 10], "python": [1, 10], "need": [1, 2], "code": [1, 6, 7, 10], "collect": [1, 2, 13], "static": 1, "These": [1, 6], "ar": [1, 2, 6, 7], "develop": 1, "thu": 1, "sub": 1, "evalu": 1, "further": 1, "manual": 1, "instal": 1, "us": [1, 7], "txt": 1, "file": [1, 7, 10], "all": [1, 2, 6, 7, 12], "via": 1, "pip3": [1, 4], "The": [1, 2, 7], "recurs": 1, "mandatori": 1, "too": 1, "u": [1, 4], "r": 1, "list": [1, 7], "pytest": [1, 8], "7": 1, "mit": 1, "Not": [1, 7], "yet": 1, "cov": 1, "1": [1, 13], "3": 1, "mypi": [1, 14], "5": 1, "extens": 1, "psf": 1, "lxml": 1, "9": [1, 2], "bsd": 1, "claus": 1, "gener": [1, 7, 8, 10, 14], "doc": 1, "sphinx_btd_them": 1, "sphinx_fontawesom": 1, "6": 1, "gpl": 1, "sphinx_autodoc_typehint": 1, "19": 1, "build": [1, 10], "wheel": 1, "40": 1, "e": 1, "g": 1, "pypi": 1, "ani": [1, 2, 7], "equival": [1, 2], "servic": [1, 2, 7, 10], "maintain": [1, 10], "dist": 1, "twine": 1, "i": [2, 7, 10, 13], "local": [2, 7], "copi": [2, 7], "cc": [2, 10], "BY": [2, 10], "appli": [2, 7], "onli": [2, 7], "document": [2, 7], "project": [2, 7, 10], "corpor": 2, "law": [2, 7], "firm": 2, "doe": [2, 7], "provid": [2, 7, 10], "legal": [2, 7], "advic": 2, "distribut": [2, 7], "creat": [2, 13], "lawyer": 2, "client": 2, "relationship": 2, "make": [2, 7], "its": [2, 7], "relat": 2, "inform": [2, 7], "avail": [2, 7], "an": [2, 7, 10], "basi": [2, 7], "give": [2, 7], "regard": [2, 7], "materi": 2, "under": [2, 7, 10], "damag": [2, 7], "result": [2, 7], "fullest": 2, "extent": 2, "possibl": [2, 7], "standard": 2, "set": 2, "creator": 2, "holder": 2, "mai": [2, 7], "share": [2, 7], "origin": [2, 7], "work": [2, 7], "authorship": [2, 7], "subject": [2, 7], "copyright": 2, "certain": 2, "specifi": 2, "below": [2, 7], "follow": [2, 7], "consider": 2, "purpos": [2, 7], "exhaust": 2, "do": [2, 7], "form": [2, 7], "part": [2, 7], "our": 2, "licensor": [2, 7], "intend": 2, "those": [2, 7], "author": [2, 7], "permiss": [2, 7], "wai": 2, "otherwis": [2, 7], "restrict": 2, "irrevoc": [2, 7], "should": [2, 7], "read": [2, 10], "understand": 2, "thei": 2, "choos": [2, 7], "befor": 2, "also": [2, 7], "secur": 2, "necessari": 2, "so": 2, "can": [2, 10], "reus": 2, "expect": 2, "clearli": [2, 6], "mark": [2, 7], "includ": [2, 7], "except": [2, 7], "more": [2, 7, 10], "By": 2, "one": [2, 7], "grant": 2, "If": [2, 7, 13], "": [2, 7], "reason": [2, 7], "exampl": [2, 7], "becaus": 2, "applic": [2, 7], "regul": 2, "ha": [2, 7], "still": 2, "have": [2, 6, 7], "A": [2, 7], "special": [2, 7], "request": 2, "ask": 2, "chang": [2, 7], "describ": [2, 4, 7], "although": 2, "you": [2, 7], "encourag": 2, "respect": 2, "where": [2, 7], "exercis": [2, 7], "defin": [2, 7], "accept": 2, "agre": [2, 7], "bound": 2, "To": [2, 7], "contract": [2, 7], "your": [2, 7], "benefit": 2, "receiv": [2, 7], "adapt": 2, "mean": [2, 7], "similar": 2, "deriv": [2, 7, 10], "base": [2, 6, 7], "upon": 2, "which": [2, 7], "translat": [2, 7], "alter": 2, "arrang": [2, 6], "transform": [2, 7], "modifi": [2, 7], "manner": 2, "held": 2, "For": [2, 7], "music": 2, "perform": [2, 7], "sound": 2, "record": 2, "alwai": 2, "produc": 2, "synch": 2, "time": 2, "imag": 2, "contribut": 2, "accord": 2, "close": 2, "without": [2, 7], "broadcast": 2, "how": [2, 7], "label": 2, "categor": 2, "b": 2, "effect": 2, "technolog": 2, "measur": 2, "absenc": 2, "proper": 2, "circumv": 2, "fulfil": 2, "oblig": [2, 7], "articl": 2, "11": 2, "wipo": 2, "treati": 2, "adopt": 2, "decemb": 2, "20": 2, "1996": 2, "agreement": [2, 7], "fair": 2, "deal": 2, "artist": 2, "literari": 2, "individu": [2, 7], "entiti": [2, 7], "process": [2, 10], "reproduct": [2, 7], "displai": [2, 7], "dissemin": 2, "commun": [2, 7], "import": [2, 7], "member": 2, "access": 2, "place": [2, 7], "chosen": 2, "them": 2, "than": [2, 13], "direct": [2, 7], "96": 2, "ec": 2, "european": 2, "parliament": 2, "council": 2, "march": 2, "protect": 2, "amend": 2, "succeed": 2, "well": 2, "essenti": 2, "anywher": 2, "world": 2, "correspond": 2, "herebi": [2, 7], "worldwid": [2, 7], "royalti": [2, 7], "free": [2, 7], "non": [2, 7], "sublicens": [2, 7], "exclus": [2, 7], "reproduc": [2, 7], "whole": [2, 7], "avoid": 2, "doubt": 2, "compli": [2, 7], "media": [2, 7], "format": [2, 7], "technic": 2, "modif": [2, 6, 7], "allow": 2, "whether": [2, 7], "now": 2, "known": 2, "hereaft": 2, "waiv": 2, "assert": [2, 7], "forbid": 2, "simpli": 2, "never": 2, "downstream": 2, "recipi": [2, 7], "offer": [2, 7], "everi": 2, "automat": 2, "No": 2, "impos": 2, "differ": [2, 7], "endors": 2, "noth": [2, 7], "constitut": [2, 7], "constru": [2, 7], "impli": [2, 7], "connect": 2, "sponsor": 2, "offici": 2, "statu": 2, "design": [2, 7], "moral": 2, "integr": 2, "nor": 2, "privaci": 2, "person": 2, "howev": [2, 7], "patent": 2, "trademark": 2, "directli": 2, "through": [2, 7], "societi": 2, "voluntari": 2, "waivabl": 2, "statutori": 2, "compulsori": 2, "scheme": 2, "In": [2, 7], "case": 2, "expressli": 2, "reserv": 2, "made": [2, 7], "must": [2, 7], "retain": [2, 7], "suppli": 2, "identif": [2, 7], "pseudonym": 2, "notic": [2, 7], "refer": [2, 6], "uri": 2, "hyperlink": 2, "practic": 2, "indic": [2, 7], "previou": 2, "text": [2, 7], "satisfi": 2, "medium": [2, 7], "context": 2, "resourc": 2, "remov": 2, "prevent": 2, "extract": 2, "substanti": 2, "portion": 2, "content": [2, 7], "supplement": 2, "replac": [2, 7], "unless": [2, 7], "separ": [2, 7], "undertaken": 2, "represent": 2, "kind": [2, 7], "concern": 2, "express": [2, 7], "titl": [2, 7], "merchant": [2, 7], "fit": [2, 7], "particular": [2, 6, 7], "infring": [2, 7], "latent": 2, "defect": 2, "accuraci": 2, "presenc": 2, "error": 2, "discover": 2, "full": 2, "event": [2, 7], "liabl": [2, 7], "theori": [2, 7], "neglig": [2, 7], "indirect": [2, 7], "incident": [2, 7], "consequenti": [2, 7], "punit": 2, "exemplari": 2, "loss": [2, 7], "cost": 2, "expens": 2, "aris": [2, 7], "out": [2, 7], "even": [2, 7], "been": [2, 7], "advis": [2, 7], "abov": [2, 7], "shall": [2, 6, 7], "most": 2, "approxim": 2, "absolut": 2, "waiver": 2, "here": 2, "fail": 2, "reinstat": 2, "date": [2, 7], "violat": 2, "cure": 2, "within": [2, 7], "30": 2, "dai": 2, "discoveri": 2, "affect": 2, "seek": 2, "remedi": 2, "stop": 2, "surviv": 2, "state": [2, 7], "herein": [2, 7], "independ": 2, "reduc": 2, "could": 2, "lawfulli": 2, "provis": 2, "deem": 2, "unenforc": 2, "reform": 2, "minimum": 2, "enforc": 2, "cannot": [2, 7], "sever": 2, "remain": [2, 7], "failur": [2, 7], "consent": 2, "privileg": 2, "immun": 2, "jurisdict": 2, "parti": [2, 7], "notwithstand": [2, 7], "elect": 2, "publish": 2, "instanc": 2, "consid": 2, "permit": 2, "polici": 2, "creativecommon": 2, "org": [2, 7], "logo": 2, "prior": 2, "written": [2, 7], "unauthor": 2, "paragraph": 2, "contact": 2, "accellera": 3, "ieee": 3, "std": 3, "xxxx": 3, "yyi": 3, "ssc": 3, "systemrdl": [3, 10], "pysystemrdlmodel": [4, 12], "procedur": 4, "name": [6, 7, 13], "semant": 6, "construct": 6, "statement": [6, 7], "declar": 6, "specif": [6, 7], "own": [6, 7, 10], "logic": [6, 10], "hierarchi": 6, "singl": 6, "common": [6, 7, 10], "child": 6, "object": [6, 7], "parent": 6, "comment": [6, 7], "associ": [6, 7], "easi": 6, "tree": 6, "element": 6, "modul": [6, 12, 13], "sourc": [7, 10, 13], "configur": 7, "januari": 7, "2004": 7, "term": 7, "AND": 7, "condit": 7, "FOR": 7, "section": 7, "owner": 7, "union": 7, "act": 7, "other": [7, 13], "control": 7, "power": 7, "caus": 7, "manag": 7, "ii": 7, "ownership": 7, "fifti": 7, "percent": 7, "50": 7, "outstand": 7, "iii": 7, "benefici": 7, "prefer": 7, "softwar": 7, "mechan": 7, "compil": 7, "convers": 7, "type": [7, 13], "attach": 7, "appendix": 7, "editori": 7, "revis": 7, "annot": 7, "elabor": [7, 10], "repres": 7, "mere": 7, "link": 7, "bind": 7, "interfac": 7, "thereof": 7, "intention": 7, "submit": 7, "inclus": 7, "behalf": 7, "electron": 7, "verbal": 7, "sent": 7, "mail": 7, "system": [7, 13], "issu": 7, "track": 7, "discuss": 7, "improv": 7, "exclud": 7, "conspicu": 7, "write": 7, "contributor": 7, "whom": 7, "subsequ": 7, "incorpor": 7, "each": 7, "perpetu": 7, "charg": 7, "prepar": 7, "publicli": 7, "sell": 7, "transfer": 7, "claim": 7, "necessarili": 7, "alon": 7, "combin": 7, "institut": 7, "litig": 7, "against": [7, 13], "cross": 7, "counterclaim": 7, "lawsuit": 7, "alleg": 7, "contributori": 7, "termin": 7, "meet": 7, "carri": 7, "promin": 7, "attribut": [7, 10], "pertain": 7, "readabl": 7, "contain": 7, "least": 7, "along": 7, "wherev": 7, "third": 7, "normal": 7, "appear": 7, "add": 7, "alongsid": 7, "addendum": 7, "explicitli": 7, "supersed": 7, "execut": 7, "trade": 7, "product": 7, "customari": 7, "AS": 7, "OR": 7, "OF": 7, "either": 7, "sole": 7, "respons": 7, "determin": 7, "appropri": 7, "assum": 7, "risk": 7, "tort": 7, "deliber": 7, "grossli": 7, "charact": 7, "inabl": 7, "goodwil": 7, "stoppag": 7, "comput": 7, "malfunct": 7, "commerci": 7, "while": [7, 10], "fee": 7, "support": [7, 10], "indemn": 7, "right": 7, "consist": 7, "indemnifi": 7, "defend": 7, "hold": 7, "harmless": 7, "incur": 7, "boilerpl": 7, "field": 7, "enclos": 7, "bracket": 7, "identifi": 7, "don": 7, "t": 7, "syntax": 7, "we": 7, "recommend": 7, "descript": 7, "same": 7, "print": 7, "page": 7, "easier": 7, "archiv": 7, "yyyi": 7, "complianc": 7, "obtain": 7, "http": 7, "www": 7, "see": 7, "languag": [7, 10], "govern": 7, "placehold": [8, 14], "abstract": 10, "model": 10, "unifi": 10, "implement": 10, "concret": 10, "tool": 10, "consum": 10, "pre": 10, "data": 10, "pars": 10, "analyz": 10, "higher": 10, "level": 10, "featur": 10, "multipl": 10, "frontend": 10, "patrick": 10, "lehmann": 10, "accompani": 10, "creativ": 10, "17": 10, "nov": 10, "01": 10, "21": 10, "__lt__": [12, 13], "__le__": [12, 13], "__gt__": [12, 13], "__ge__": [12, 13], "__ne__": [12, 13], "__eq__": [12, 13], "valu": 13, "pair": 13, "qualnam": 13, "start": 13, "boundari": 13, "inherit": 13, "enum": 13, "compar": 13, "two": 13, "verilog": 13, "less": 13, "second": 13, "operand": 13, "paramet": 13, "return": 13, "bool": 13, "true": 13, "rais": 13, "typeerror": 13, "equal": 13, "greater": 13, "unequ": 13}, "objects": {"": [[13, 0, 0, "-", "pySystemRDLModel"]], "pySystemRDLModel": [[13, 1, 1, "", "SystemRDLVersion"]], "pySystemRDLModel.SystemRDLVersion": [[13, 2, 1, "", "__eq__"], [13, 2, 1, "", "__ge__"], [13, 2, 1, "", "__gt__"], [13, 2, 1, "", "__le__"], [13, 2, 1, "", "__lt__"], [13, 2, 1, "", "__ne__"]]}, "objtypes": {"0": "py:module", "1": "py:class", "2": "py:method"}, "objnames": {"0": ["py", "module", "Python module"], "1": ["py", "class", "Python class"], "2": ["py", "method", "Python method"]}, "titleterms": {"changelog": 0, "upcom": 0, "releas": 0, "19": 0, "06": 0, "2023": [0, 10], "depend": 1, "pysystemrdlmodel": [1, 10, 13], "packag": 1, "unit": 1, "test": 1, "coverag": [1, 8], "type": [1, 14], "check": [1, 14], "option": 1, "sphinx": 1, "document": [1, 10], "publish": 1, "ci": 1, "server": 1, "onli": 1, "creativ": 2, "common": 2, "attribut": 2, "4": [2, 7], "0": [2, 7], "intern": 2, "us": [2, 4, 10], "public": 2, "licens": [2, 7, 10], "section": 2, "1": [2, 7], "definit": [2, 7], "2": [2, 7], "scope": 2, "3": [2, 7], "condit": 2, "sui": 2, "generi": 2, "databas": 2, "right": 2, "5": [2, 7], "disclaim": [2, 7], "warranti": [2, 7], "limit": [2, 7], "liabil": [2, 7], "6": [2, 7], "term": 2, "termin": 2, "7": [2, 7], "other": 2, "8": [2, 7], "interpret": 2, "glossari": 3, "instal": 4, "updat": 4, "pip": 4, "setup": 4, "py": 4, "todo": 4, "modul": [5, 11], "systemrdl": 6, "languag": 6, "model": 6, "design": 6, "goal": [6, 10], "apach": 7, "grant": 7, "copyright": 7, "patent": 7, "redistribut": 7, "submiss": 7, "contribut": 7, "trademark": 7, "9": 7, "accept": 7, "addit": 7, "report": [8, 14], "index": [9, 11], "The": 10, "main": 10, "case": 10, "new": 10, "june": 10, "repositori": 10, "creat": 10, "contributor": 10, "python": 12, "class": 12, "refer": 12, "static": 14}, "envversion": {"sphinx.domains.c": 3, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 9, "sphinx.domains.index": 1, "sphinx.domains.javascript": 3, "sphinx.domains.math": 2, "sphinx.domains.python": 4, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinx.ext.intersphinx": 1, "sphinx.ext.todo": 2, "sphinx.ext.viewcode": 1, "sphinx": 60}, "alltitles": {"ChangeLog": [[0, "changelog"]], "Upcoming Release": [[0, "upcoming-release"]], "19.06.2023": [[0, "id1"]], "Dependency": [[1, "dependency"]], "pySystemRDLModel Package": [[1, "pysystemrdlmodel-package"]], "Unit Testing / Coverage / Type Checking (Optional)": [[1, "unit-testing-coverage-type-checking-optional"]], "Sphinx Documentation (Optional)": [[1, "sphinx-documentation-optional"]], "Packaging (Optional)": [[1, "packaging-optional"]], "Publishing (CI-Server only)": [[1, "publishing-ci-server-only"]], "Creative Commons Attribution 4.0 International": [[2, "creative-commons-attribution-4-0-international"]], "Using Creative Commons Public Licenses": [[2, null]], "Section 1 \u2013 Definitions.": [[2, "section-1-definitions"]], "Section 2 \u2013 Scope.": [[2, "section-2-scope"]], "Section 3 \u2013 License Conditions.": [[2, "section-3-license-conditions"]], "Section 4 \u2013 Sui Generis Database Rights.": [[2, "section-4-sui-generis-database-rights"]], "Section 5 \u2013 Disclaimer of Warranties and Limitation of Liability.": [[2, "section-5-disclaimer-of-warranties-and-limitation-of-liability"]], "Section 6 \u2013 Term and Termination.": [[2, "section-6-term-and-termination"]], "Section 7 \u2013 Other Terms and Conditions.": [[2, "section-7-other-terms-and-conditions"]], "Section 8 \u2013 Interpretation.": [[2, "section-8-interpretation"]], "Glossary": [[3, "glossary"]], "Installation/Updates": [[4, "installation-updates"]], "Using PIP": [[4, "using-pip"]], "Installation using PIP": [[4, "installation-using-pip"]], "Updating using PIP": [[4, "updating-using-pip"]], "Using setup.py": [[4, "using-setup-py"]], "Todo": [[4, "id1"]], "Module": [[5, "module"]], "SystemRDL Language Model": [[6, "systemrdl-language-model"]], "Design Goal": [[6, null]], "Apache License 2.0": [[7, "apache-license-2-0"]], "1. Definitions.": [[7, "definitions"]], "2. Grant of Copyright License.": [[7, "grant-of-copyright-license"]], "3. Grant of Patent License.": [[7, "grant-of-patent-license"]], "4. Redistribution.": [[7, "redistribution"]], "5. Submission of Contributions.": [[7, "submission-of-contributions"]], "6. Trademarks.": [[7, "trademarks"]], "7. Disclaimer of Warranty.": [[7, "disclaimer-of-warranty"]], "8. Limitation of Liability.": [[7, "limitation-of-liability"]], "9. Accepting Warranty or Additional Liability.": [[7, "accepting-warranty-or-additional-liability"]], "Coverage Report": [[8, "coverage-report"]], "Index": [[9, "index"]], "The pySystemRDLModel Documentation": [[10, "the-pysystemrdlmodel-documentation"]], "Main Goals": [[10, "main-goals"]], "Use Cases": [[10, "use-cases"]], "News": [[10, "news"]], "June 2023 - New Repository Created": [[10, "june-2023-new-repository-created"]], "Contributors": [[10, "contributors"]], "License": [[10, "license"]], "Module Index": [[11, "module-index"]], "Python Class Reference": [[12, "python-class-reference"]], "pySystemRDLModel": [[13, "module-pySystemRDLModel"]], "Static Type Checking Report": [[14, "static-type-checking-report"]]}, "indexentries": {"accellera": [[3, "term-Accellera"]], "systemrdl": [[3, "term-SystemRDL"]], "systemrdlversion (class in pysystemrdlmodel)": [[13, "pySystemRDLModel.SystemRDLVersion"]], "__eq__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__eq__"]], "__ge__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__ge__"]], "__gt__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__gt__"]], "__le__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__le__"]], "__lt__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__lt__"]], "__ne__() (pysystemrdlmodel.systemrdlversion method)": [[13, "pySystemRDLModel.SystemRDLVersion.__ne__"]], "module": [[13, "module-pySystemRDLModel"]], "pysystemrdlmodel": [[13, "module-pySystemRDLModel"]]}})
\ No newline at end of file
diff --git a/typing/html/pySystemRDLModel/__init__.py.html b/typing/html/pySystemRDLModel/__init__.py.html
new file mode 100644
index 0000000..f6bed7c
--- /dev/null
+++ b/typing/html/pySystemRDLModel/__init__.py.html
@@ -0,0 +1,467 @@
+
+
+
+
+
+
+1 +2 +3 +4 +5 +6 +7 +8 +9 +10 +11 +12 +13 +14 +15 +16 +17 +18 +19 +20 +21 +22 +23 +24 +25 +26 +27 +28 +29 +30 +31 +32 +33 +34 +35 +36 +37 +38 +39 +40 +41 +42 +43 +44 +45 +46 +47 +48 +49 +50 +51 +52 +53 +54 +55 +56 +57 +58 +59 +60 +61 +62 +63 +64 +65 +66 +67 +68 +69 +70 +71 +72 +73 +74 +75 +76 +77 +78 +79 +80 +81 +82 +83 +84 +85 +86 +87 +88 +89 +90 +91 +92 +93 +94 +95 +96 +97 +98 +99 +100 +101 +102 +103 +104 +105 +106 +107 +108 +109 +110 +111 +112 +113 +114 +115 +116 +117 +118 +119 +120 +121 +122 +123 +124 +125 +126 +127 +128 +129 +130 +131 +132 +133 +134 +135 +136 +137 +138 +139 +140 +141 +142 +143 +144 +145 +146 +147 +148 +149 +150 +151 +152 +153 +154 +155 +156 +157 +158 +159 +160 +161 +162 +163 +164 +165 +166 +167 +168 +169 +170 +171 +172 +173 +174 +175 +176 +177 +178 +179 +180 +181 +182 +183 +184 +185 +186 +187 +188 +189 +190 +191 +192 +193 +194 +195 +196 +197 +198 +199 +200 +201 +202 +203 +204 +205 + |
+# ==================================================================================================================== # +# ____ _ ____ ____ _ __ __ _ _ # +# _ __ _ _/ ___| _ _ ___| |_ ___ _ __ ___ | _ \| _ \| | | \/ | ___ __| | ___| | # +# | '_ \| | | \___ \| | | / __| __/ _ \ '_ ` _ \| |_) | | | | | | |\/| |/ _ \ / _` |/ _ \ | # +# | |_) | |_| |___) | |_| \__ \ || __/ | | | | | _ <| |_| | |___| | | | (_) | (_| | __/ | # +# | .__/ \__, |____/ \__, |___/\__\___|_| |_| |_|_| \_\____/|_____|_| |_|\___/ \__,_|\___|_| # +# |_| |___/ |___/ # +# ==================================================================================================================== # +# Authors: # +# Patrick Lehmann # +# # +# License: # +# ==================================================================================================================== # +# Copyright 2023-2023 Patrick Lehmann - Boetzingen, Germany # +# # +# 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. # +# # +# SPDX-License-Identifier: Apache-2.0 # +# ==================================================================================================================== # +# +""" +An abstract SystemRDL language model. + +:copyright: Copyright 2023-2023 Patrick Lehmann - Bötzingen, Germany +:license: Apache License, Version 2.0 +""" +from enum import unique, Enum +from typing import Dict, Union + +from pyTooling.Decorators import export + + +__author__ = "Patrick Lehmann" +__email__ = "Paebbels@gmail.com" +__copyright__ = "2023-2023, Patrick Lehmann" +__license__ = "Apache License, Version 2.0" +__version__ = "0.2.2" + + +@export +@unique +class SystemRDLVersion(Enum): + Any = -1 + + SystemRDL2005 = 2005 + SystemRDL2009 = 2009 + SystemRDL2012 = 2012 + SystemRDL2017 = 2017 + + Latest = 10000 + + __VERSION_MAPPINGS__: Dict[Union[int, str], Enum] = { + -1: Any, + 5: SystemRDL2005, + 9: SystemRDL2009, + 12: SystemRDL2012, + 17: SystemRDL2017, + 2005: SystemRDL2005, + 2009: SystemRDL2009, + 2012: SystemRDL2012, + 2017: SystemRDL2017, + 10000: Latest, + "Any": Any, + "05": SystemRDL2005, + "09": SystemRDL2009, + "12": SystemRDL2012, + "17": SystemRDL2017, + "2005": SystemRDL2005, + "2009": SystemRDL2009, + "2012": SystemRDL2012, + "2017": SystemRDL2017, + "Latest": SystemRDL2017, + } + + def __init__(self, *_): + """Patch the embedded MAP dictionary""" + cls = self.__class__ + for k, v in cls.__VERSION_MAPPINGS__.items(): + if (not isinstance(v, cls)) and (v == self.value): + cls.__VERSION_MAPPINGS__[k] = self + + @classmethod + def Parse(cls, value: Union[int, str]) -> "SystemRDLVersion": + try: + return cls.__VERSION_MAPPINGS__[value] + except KeyError: + raise ValueError(f"Value '{value!s}' cannot be parsed to member of {cls.__name__}.") + + def __lt__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is less than the second operand. + + :param other: Parameter to compare against. + :returns: True if version is less than the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + return self.value < other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __le__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is less or equal than the second operand. + + :param other: Parameter to compare against. + :returns: True if version is less or equal than the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + return self.value <= other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __gt__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is greater than the second operand. + + :param other: Parameter to compare against. + :returns: True if version is greater than the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + return self.value > other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __ge__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is greater or equal than the second operand. + + :param other: Parameter to compare against. + :returns: True if version is greater or equal than the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + return self.value >= other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __ne__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is unequal to the second operand. + + :param other: Parameter to compare against. + :returns: True if version is unequal to the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + return self.value != other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __eq__(self, other: Any) -> bool: + """ + Compare two (System)Verilog versions if the version is equal to the second operand. + + :param other: Parameter to compare against. + :returns: True if version is equal to the second operand. + :raises TypeError: If parameter ``other`` is not of type :class:`SystemRDLVersion`. + """ + if isinstance(other, SystemRDLVersion): + if (self is self.__class__.Any) or (other is self.__class__.Any): + return True + else: + return self.value == other.value + else: + raise TypeError("Second operand is not of type 'SystemRDLVersion'.") + + def __str__(self) -> str: + """ + Formats the SystemRDLVersion version to pattern ``SystemRDL'xx``. + + :return: Formatted SystemRDL version. + """ + if self.value == self.Any.value: + return "SystemRDL'Any" + if self.value == self.Latest.value: + return "SystemRDL'Latest" + + year = str(self.value)[-2:] + return f"SystemRDL'{year}" + + def __repr__(self) -> str: + """ + Formats the SystemRDL version to pattern ``xxxx``. + + :return: Formatted SystemRDL version. + """ + if self.value == self.Any.value: + return "Any" + elif self.value == self.Latest.value: + return "Latest" + else: + return str(self.value) + |
+
| File | +Imprecision | +Lines | +
|---|---|---|
| Total | +14.63% imprecise | +205 LOC | +
| pySystemRDLModel | +14.63% imprecise | +205 LOC | +