Skip to content

Commit c951870

Browse files
committed
[chore:meta] Fix markup LaTeX in README.md
1 parent 82171ec commit c951870

File tree

1 file changed

+11
-6
lines changed

1 file changed

+11
-6
lines changed

README.md

Lines changed: 11 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -70,16 +70,21 @@ reliable way to enforce best practices.
7070

7171
## 📈 The Power of Combinatorics
7272

73-
The framework's power lies in its combinatorial architecture. It is built on a small set of primitive "bricks": *
74-
*Selectors** (`S`) that define *what* to find in the code, and **Constraints** (`C`) that define *what condition* to
73+
The framework's power lies in its combinatorial architecture. It is built on a small set of primitive "bricks":
74+
**Selectors** ($S$) that define *what* to find in the code, and **Constraints** ($C$) that define *what condition* to
7575
check.
7676

77-
The number of unique validation rules (`R`) is not a sum, but a product of these components. A single rule can be
77+
The number of unique validation rules ($R$) is not a sum, but a product of these components. A single rule can be
7878
represented as:
79-
$$ R_{\text{single}} = S \times C $$
80-
With approximately 10 types of selectors and 10 types of constraints, this already provides ~100 unique checks. However,
79+
80+
$$R_{\text{single}} = S \times C$$
81+
82+
With approximately $10$ types of selectors and $10$ types of constraints, this already provides ~$100$ unique checks.
83+
However,
8184
the true flexibility comes from logical composition, allowing for a near-infinite number of validation scenarios:
82-
$$ R_{\text{total}} \approx S \times \sum_{k=1}^{|C|} \binom{|C|}{k} = S \times (2^{|C|} - 1) $$
85+
86+
$$R_{\text{total}} \approx S \times \sum_{k=1}^{|C|} \binom{|C|}{k} = S \times (2^{|C|} - 1)$$
87+
8388
This design provides **thousands of potential validation scenarios** out-of-the-box, offering extreme flexibility with
8489
minimal complexity.
8590

0 commit comments

Comments
 (0)