eslint-plugin-de-morgan weekly downloads statistics
By azat-io (2 listings) · npm · ESLint plugins
ESLint plugin for transforming negated boolean expressions via De Morgan’s laws
eslint-plugin-de-morgan has 20,268 recorded weekly downloads on npm, a decrease of 30.8% over the past 30 days.
It ranks #749 of 2,251 tracked npm listings by weekly downloads.
Over 90 days, weekly downloads changed by -43.5%.
PluginStats has 121 daily observations since Jun 19, 2026; the latest is from Oct 17, 2026.
About eslint-plugin-de-morgan
ESLint Plugin De Morgan
An ESLint plugin that enforces logical consistency by transforming negated boolean expressions according to De Morgan’s laws.
This plugin automatically rewrites negated conjunctions and disjunctions to improve code clarity and reduce potential logical errors.
Why
In Boolean algebra, De Morgan’s laws are two transformation rules that are both valid rules of inference. They are named after Augustus De Morgan and are fundamental in the fields of mathematics, computer science, and digital logic. The laws state that:
First Law:
_¬(A ∧ B) ≡ (¬A) ∨ (¬B)_
Second Law:
_¬(A ∨ B) ≡ (¬A) ∧ (¬B)_
Using these principles, the plugin provides two ESLint rules:
• no-negated-conjunction — Transforms negated conjunctions (i.e. expressions of the form !(A && B)) into the equivalent disjunction of negations (!A || !B). • no-negated-disjunction — Transforms negated disjunctions (i.e. expressions of the form !(A || B)) into the equivalent conjunction of negations (!A && !B).
These transformations are grounded in Boolean algebra and can help make the logic of your code more explicit and easier to understand.
Why Use De Morgan’s Laws?
De Morgan’s laws are a cornerstone of Boolean algebra and have several practical benefits in programming:
• Clarity: Rewriting complex negations often results in expressions that more clearly communicate the underlying logic. • Avoiding Logical Errors: When dealing with nested logical expressions, small mistakes in the placement of negations can lead to subtle bugs. By enforcing a consistent style based on well-known laws, the plugin helps reduce such errors. • Simplification: In some cases, the transformed expression may be simpler to evaluate and optimize, both for human readers and for compilers / interpreters.
Examples
Base example
Before:
After:
More complex example
Before:
After:
Installation
You'll first need to install ESLint:
Next, install eslint-plugin-de-morgan:
Usage
The easiest way to use eslint-plugin-de-morgan is to use ready-made config.
Flat Config (eslint.config.js)
Legacy Config (.eslintrc.js)
Rules
🔧 Automatically fixable by the --fix CLI option.
| Name | Description | 🔧 |
| no-negated-conjunction | Transforms the negation of a conjunction into the equivalent disjunction | 🔧 | | no-negated-disjunction | Transforms the negation of a disjunction into the equivalent conjunction | 🔧 |
Further Reading
• De Morgan’s Laws • Boolean Algebra
Versioning Policy
This plugin is following Semantic Versioning and ESLint's Semantic Versioning Policy.
Contributing
See Contributing Guide.
License
MIT © Azat S.
Description from the npm listing.
- eslint
- eslint-plugin
- de-morgan
Where eslint-plugin-de-morgan sits in the listing
Each band is one page of 20. Weekly downloads on a log scale. Placement is projected from weekly downloads, so it can differ from the marketplace's own sort order. Hover a dot to see the listing.
Charts
Images: 30d · 1y · all time · 1600×900 dark
Adoption over time
7/30/90-day growth
Filled points are observed values; hollow points come from Internet Archive snapshots of the listing page. Dashed segments span periods with no observations — values between points are not interpolated.
Recent observations
Full history (121)Similar npm ESLint plugins plugins
Data source
Weekly downloads (trailing 7 complete days) come from the official npm downloads API. Downloads include CI and mirrors and are not equivalent to installs or users. npm publishes no ratings.
Listing: https://www.npmjs.com/package/eslint-plugin-de-morgan. First seen Oct 16, 2026; last successful collection Oct 18, 2026. See the methodology.