disentangled-flash 0.1.0__tar.gz

disentangled_flash-0.1.0/LICENSE

@@ -0,0 +1,176 @@
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

disentangled_flash-0.1.0/PKG-INFO

@@ -0,0 +1,338 @@
+Metadata-Version: 2.4
+Name: disentangled-flash
+Version: 0.1.0
+Summary: Fast exact DeBERTa-style disentangled attention in Triton
+Author-email: Delyan Boychev <delyan.boychev05@gmail.com>
+License-Expression: Apache-2.0
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: torch>=2.7
+Provides-Extra: hf
+Requires-Dist: transformers>=4.57; extra == "hf"
+Requires-Dist: sentencepiece>=0.2; extra == "hf"
+Requires-Dist: protobuf>=4; extra == "hf"
+Provides-Extra: dev
+Requires-Dist: pytest>=8; extra == "dev"
+Requires-Dist: ruff>=0.12; extra == "dev"
+Dynamic: license-file
+
+# DisentangledFlash
+
+[![CI](https://github.com/delyan-boychev/disentangled-flash/actions/workflows/ci.yml/badge.svg)](https://github.com/delyan-boychev/disentangled-flash/actions/workflows/ci.yml)
+[![License](https://img.shields.io/badge/License-Apache%202.0-blue.svg)](LICENSE)
+
+***Fast exact DeBERTa-style disentangled attention in Triton.***
+
+DisentangledFlash is an inference-oriented implementation of bidirectional
+DeBERTa-v2/v3 disentangled self-attention. 
+
+The Triton kernel is inspired by [FlashAttention](https://github.com/Dao-AILab/flash-attention)'s tiling, IO-aware computations, and online softmax without memory materialization, while its relative position encoding implementation is inspired by [FlexAttention](https://pytorch.org/blog/flexattention/). It fuses QK, relative-score lookup, factorized padding-mask application, online softmax, and PV without materializing a `[B, H, L, L]` attention tensor. C2P/P2C projection score GEMMs remain regular PyTorch GEMMs over the pruned active relative-position slots.
+
+The PyTorch-optimized (`torch`) backend is constructed by optimizing operations, employing smart caching techniques, and leveraging fused QKV projection.
+
+
+## Status
+
+- NVIDIA CUDA + Triton
+- inference only
+- DeBERTa-v2/v3-style C2P/P2C disentangled attention
+- FP16, BF16, strict FP32, and optional fast FP32/TF32 mode
+- head dimensions 32, 64, and 128
+- factorized 2-D padding masks
+- prepared fixed-length buckets with dynamic batch size
+- **fused QKV projection is always enabled** for the PyTorch/Triton backends
+
+Training/backward is not implemented. CPU/MPS use the PyTorch backend
+for development/benchmarking, not the Triton kernel.
+
+While currently tailored to DeBERTa-v2/v3, the kernel and caching abstractions are designed to be extensible to other architectures requiring factorized relative-position or disentangled attention schemes in the future.
+
+> [!IMPORTANT]
+> **GPU Compatibility**: The Triton kernel has been validated and benchmarked primarily on the **NVIDIA RTX 6000 Ada** (Compute Capability 8.9). Further testing, benchmarking, and autotuning calibration are required to ensure optimal performance on other GPU models and hardware architectures. **Pull requests, benchmark results, and configurations for other GPUs are highly welcome!**
+
+## Install
+
+Use a PyTorch build appropriate for your CUDA environment, then install this
+repository editable while developing:
+
+```bash
+pip install -e ".[dev]"
+```
+
+For the pretrained Hugging Face MNLI parity benchmark:
+
+```bash
+pip install -e ".[dev,hf]"
+```
+
+`sentencepiece` and `protobuf` are included in the `hf` extra because the
+DeBERTa-v2 tokenizer uses a SentencePiece `spm.model`.
+
+## Hugging Face usage
+
+```python
+from transformers import AutoModelForSequenceClassification
+from disentangled_flash import optimize_deberta
+
+model = (
+    AutoModelForSequenceClassification.from_pretrained("microsoft/deberta-v2-xlarge-mnli")
+    .cuda()
+    .eval()
+)
+
+optimize_deberta(
+    model.deberta,
+    sequence_lengths=[64, 128, 256, 512],
+)
+```
+
+`optimize_deberta()` replaces only the DeBERTa encoder attention path. The
+existing layer output, residual, FFN, convolution, classifier, and checkpoint
+parameter names are preserved.
+
+For lower-level experiments, `enable_deberta_inference(..., backend="optimized")`
+selects the PyTorch backend instead of Triton.
+
+## CUDA benchmark
+
+Attention-only:
+
+```bash
+python -m benchmarks.benchmark_cuda --scope attention
+```
+
+Full encoder:
+
+```bash
+python -m benchmarks.benchmark_cuda \
+  --scope encoder \
+  --implementations original,optimized,triton \
+  --dtypes fp16,fp32 \
+  --output encoder_attention_cuda_results.json
+```
+
+The original backend remains unfused and acts as the reference baseline. The
+PyTorch and Triton backends always use one packed QKV projection.
+
+## Pretrained task parity + speed
+
+The MNLI script loads `microsoft/deberta-v2-xlarge-mnli`, compares the untouched
+Hugging Face model with the same checkpoint using DisentangledFlash, verifies
+logits/probabilities/hidden-state parity, and benchmarks the full classification
+forward. Tokenization and model loading are excluded from timing.
+
+Defaults are batch size 8 and 500 measured iterations:
+
+```bash
+python -m benchmarks.parity_pretrained_mnli
+```
+
+## Hostile CUDA validation
+
+```bash
+python -m validation.validate_cuda
+```
+
+The validation matrix covers FP16/BF16/FP32, boundary sequence lengths, several
+padding patterns, and C2P/P2C position modes while reporting raw max/mean errors.
+
+> [!NOTE]
+> **Test Coverage**: The current test suite is basic and incomplete. Expanding testing to cover more edge cases, parameters, and configurations is actively planned and is work to be done.
+
+## Autotuning
+
+The autotuning is to be optimized in the future as it is currently greedy (evaluating too many configuration candidates). The next step is to run offline calibration sweeps per GPU family to determine and pre-select the fastest block configurations, significantly reducing runtime compilation and tuning overhead.
+
+Do not treat the current candidate table as a universal final table for every GPU.
+
+
+## Results
+
+DisentangledFlash was benchmarked against:
+
+- the original Hugging Face DeBERTa encoder,
+- the PyTorch implementation,
+- and the Triton DisentangledFlash implementation.
+
+The benchmark covers the full 12-layer encoder, not only the isolated attention operator.
+
+### Benchmark configuration
+
+| Parameter | Value |
+|---|---:|
+| Hidden size | 768 |
+| Attention heads | 12 |
+| Head dimension | 64 |
+| Encoder layers | 12 |
+| FFN intermediate size | 3072 |
+| Convolution kernel | 3 |
+| Batch sizes | 1, 8, 16, 32 |
+| Sequence lengths | 16, 32, 64, 128, 256, 384, 512 |
+| Precisions | FP16, strict FP32 |
+| Execution mode | Eager |
+| GPU | NVIDIA RTX 6000 Ada Generation |
+| Compute capability | 8.9 |
+
+> The benchmark snapshot below predates the current always-fused-QKV API and was run with QKV fusion disabled for both the PyTorch and Triton backends. The current DisentangledFlash implementation always uses fused QKV projection.
+
+### Overall encoder speedup
+
+Across all 28 tested `(batch size, sequence length)` configurations per precision:
+
+| Precision | Geomean speedup vs. Hugging Face | Geomean speedup vs. PyTorch impl. | Best speedup vs. PyTorch impl. |
+|---|---:|---:|---:|
+| FP16 | **1.75×** | **1.32×** | **1.97×** |
+| FP32 | **1.56×** | **1.24×** | **1.50×** |
+
+The advantage over the PyTorch implementation increases substantially for longer sequences, where the quadratic attention matrix becomes increasingly expensive.
+
+### FP16 encoder latency
+
+Median end-to-end encoder latency:
+
+| Batch | Seq. length | Hugging Face | PyTorch impl. | DisentangledFlash | vs. HF | vs. PyTorch impl. |
+|---:|---:|---:|---:|---:|---:|---:|
+| 8 | 128 | 6.25 ms | 3.79 ms | **3.27 ms** | **1.91×** | **1.16×** |
+| 8 | 256 | 7.56 ms | 7.09 ms | **5.27 ms** | **1.43×** | **1.34×** |
+| 8 | 384 | 14.16 ms | 14.73 ms | **9.73 ms** | **1.45×** | **1.51×** |
+| 8 | 512 | 21.94 ms | 22.70 ms | **12.03 ms** | **1.82×** | **1.89×** |
+| 16 | 128 | 6.32 ms | 6.18 ms | **4.84 ms** | **1.30×** | **1.27×** |
+| 16 | 256 | 15.40 ms | 16.58 ms | **11.36 ms** | **1.36×** | **1.46×** |
+| 16 | 384 | 30.61 ms | 32.86 ms | **20.61 ms** | **1.48×** | **1.59×** |
+| 16 | 512 | 52.37 ms | 53.44 ms | **27.19 ms** | **1.93×** | **1.97×** |
+| 32 | 128 | 12.50 ms | 13.09 ms | **9.48 ms** | **1.32×** | **1.38×** |
+| 32 | 256 | 33.81 ms | 36.35 ms | **24.61 ms** | **1.37×** | **1.48×** |
+| 32 | 384 | 67.93 ms | 71.55 ms | **41.08 ms** | **1.65×** | **1.74×** |
+| 32 | 512 | 108.11 ms | 110.28 ms | **57.84 ms** | **1.87×** | **1.91×** |
+
+At `B=16, L=512`, DisentangledFlash reduces encoder latency from **53.44 ms to 27.19 ms** relative to the PyTorch path, corresponding to approximately a **49% latency reduction**.
+
+### FP32 encoder latency
+
+Strict FP32 also benefits significantly:
+
+| Batch | Seq. length | Hugging Face | PyTorch impl. | DisentangledFlash | vs. HF | vs. PyTorch impl. |
+|---:|---:|---:|---:|---:|---:|---:|
+| 8 | 128 | 12.86 ms | 11.93 ms | **10.22 ms** | **1.26×** | **1.17×** |
+| 8 | 256 | 27.24 ms | 27.50 ms | **22.73 ms** | **1.20×** | **1.21×** |
+| 8 | 384 | 45.98 ms | 45.91 ms | **34.40 ms** | **1.34×** | **1.33×** |
+| 8 | 512 | 70.78 ms | 69.20 ms | **46.09 ms** | **1.54×** | **1.50×** |
+| 16 | 128 | 25.50 ms | 24.47 ms | **21.11 ms** | **1.21×** | **1.16×** |
+| 16 | 256 | 52.04 ms | 53.26 ms | **41.73 ms** | **1.25×** | **1.28×** |
+| 16 | 384 | 93.33 ms | 93.72 ms | **65.53 ms** | **1.42×** | **1.43×** |
+| 16 | 512 | 137.84 ms | 137.07 ms | **91.96 ms** | **1.50×** | **1.49×** |
+| 32 | 128 | 46.55 ms | 45.94 ms | **38.61 ms** | **1.21×** | **1.19×** |
+| 32 | 256 | 109.15 ms | 110.59 ms | **84.57 ms** | **1.29×** | **1.31×** |
+| 32 | 384 | 183.83 ms | 185.52 ms | **130.02 ms** | **1.41×** | **1.43×** |
+| 32 | 512 | 280.22 ms | 278.36 ms | **187.99 ms** | **1.49×** | **1.48×** |
+
+### Scaling with sequence length
+
+Geometric-mean speedup across all tested batch sizes:
+
+| Sequence length | FP16 vs. HF | FP16 vs. PyTorch impl. | FP32 vs. HF | FP32 vs. PyTorch impl. |
+|---:|---:|---:|---:|---:|
+| 16 | **1.96×** | **1.17×** | **2.10×** | **1.18×** |
+| 32 | **1.89×** | **1.18×** | **1.75×** | **1.17×** |
+| 64 | **1.81×** | **1.15×** | **1.52×** | **1.13×** |
+| 128 | **1.60×** | **1.23×** | **1.38×** | **1.17×** |
+| 256 | **1.52×** | **1.39×** | **1.37×** | **1.27×** |
+| 384 | **1.63×** | **1.48×** | **1.40×** | **1.34×** |
+| 512 | **1.91×** | **1.69×** | **1.55×** | **1.47×** |
+
+The comparison against the PyTorch implementation is particularly useful: both implementations already avoid several pieces of Hugging Face encoder overhead, so the increasing gap at long sequence lengths isolates the benefit of the streaming Triton attention path more clearly.
+
+### Peak GPU memory
+
+At batch size 32, the memory advantage grows with sequence length:
+
+#### FP16
+
+| Sequence length | Hugging Face | PyTorch impl. | DisentangledFlash | Reduction vs. PyTorch impl. |
+|---:|---:|---:|---:|---:|
+| 128 | 0.64 GB | 0.73 GB | **0.70 GB** | 4.2% |
+| 256 | 0.96 GB | 1.10 GB | **0.97 GB** | 12.3% |
+| 384 | 1.45 GB | 1.58 GB | **1.26 GB** | 20.3% |
+| 512 | 2.09 GB | 2.14 GB | **1.55 GB** | **27.3%** |
+
+#### FP32
+
+| Sequence length | Hugging Face | PyTorch impl. | DisentangledFlash | Reduction vs. PyTorch impl. |
+|---:|---:|---:|---:|---:|
+| 128 | 1.25 GB | 1.44 GB | **1.38 GB** | 3.8% |
+| 256 | 1.87 GB | 2.19 GB | **1.92 GB** | 12.2% |
+| 384 | 2.85 GB | 3.13 GB | **2.50 GB** | 20.3% |
+| 512 | 4.12 GB | 4.25 GB | **3.09 GB** | **27.3%** |
+
+This behavior is expected because DisentangledFlash performs tiled streaming softmax and does not materialize the full `[B, H, L, L]` attention score/probability tensor.
+
+### Numerical accuracy
+
+DisentangledFlash was compared directly against the original Hugging Face implementation at both the isolated attention level and across the full 12-layer DeBERTa encoder.
+
+| Precision | Level | Max absolute error | Mean absolute error |
+|---|---|---:|---:|
+| FP16 | Attention | **7.63e-6** | **2.48e-7** |
+| FP16 | Full encoder | **1.56e-2** | **1.12e-3** |
+| FP32 | Attention | **4.89e-9** | **1.79e-10** |
+| FP32 | Full encoder | **7.57e-6** | **6.26e-7** |
+
+The maximum absolute error is the worst observed value across all tested batch-size and sequence-length configurations. The mean absolute error is averaged across the 28 tested configurations for each precision and level.
+
+### Pretrained-model parity
+
+Task-level parity was additionally tested with the pretrained `microsoft/deberta-v2-xlarge-mnli` checkpoint.
+
+The original Hugging Face model and the same checkpoint with its DeBERTa encoder replaced by DisentangledFlash achieved **full task-level parity** on the parity test.
+
+The test verifies:
+
+- final MNLI predictions,
+- classification logits and probabilities,
+- final encoder hidden states,
+- and the complete sequence-classification inference path.
+
+This test exercising a real pretrained DeBERTa model rather than only synthetic attention tensors.
+
+### Test environment
+
+All current CUDA benchmarks and pretrained-model parity tests were run on:
+
+| Component | Configuration |
+|---|---|
+| OS | Ubuntu 24.04.3 LTS |
+| GPU | NVIDIA RTX 6000 Ada Generation |
+| Compute capability | 8.9 |
+| CUDA | 13.0 |
+| PyTorch | 2.13.0+cu13 |
+| Triton | 3.7.1 |
+| Transformers | 5.15.1 |
+| CPU | AMD Ryzen Threadripper PRO 7975WX, 32 cores |
+| System RAM | 512 GB |
+
+Latency numbers above are steady-state measurements. Triton compilation and autotuning startup cost are excluded from the reported p50 latency.
+
+Further validation and benchmarking are needed on other GPU architectures and configurations to guarantee optimal tuning and performance across different hardware.
+
+
+## Attribution
+
+The auditable reference implementation is derived from Hugging Face Transformers
+4.57.6 DeBERTa-v2/v3 modeling code and retains its original Apache-2.0 header.
+See `THIRD_PARTY_NOTICES.md`.
+
+## Citation
+
+If you use DisentangledFlash in your research or project, please cite it as follows:
+
+```bibtex
+@software{boychev2026disentangledflash,
+  author = {Boychev, Delyan},
+  title = {DisentangledFlash: Fast exact DeBERTa-style disentangled attention in Triton},
+  url = {https://github.com/delyan-boychev/disentangled-flash},
+  version = {0.1.0},
+  year = {2026}
+}
+```
+