Description
Count true membership bits in an explicit set-atom mask.
A finite set records membership, while a multiset also records multiplicity. An ordered set adds an ordering rule, and an interval adds endpoint-closure choices. A witness for one element, a count budget, and equality of complete sets establish different facts.
Count true membership bits in an explicit set-atom mask.
When to use this tool
Use Set Atom Bit Count when you need the stated finite-set, interval, multiplicity, membership, or ordering operation under the given equality convention.
How to use the tool and how it works
- Enter membership. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read memberships. Use the output convention below.
Return memberships as the number of true entries in membership.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| membership | Membership | Required. Array of boolean; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| memberships | Memberships | Required. Safe integer. |
{
"input": {
"membership": [
true,
false,
true
]
},
"output": {
"memberships": 2
}
} Limitations and assumptions
- This counts one element's supplied memberships, not set size, the number of Venn atoms, or a parity-based inclusion result.
- The field tables state structural bounds; the mechanics also specify cross-field constraints. Malformed inputs and unsupported domains cause errors. A successful false flag, empty branch value, or zero placeholder has the meaning stated above and is distinct from an input error.
- Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Signed zero is exported as zero.
Alternative or Complementary methods
Use a full set operation when one element or count cannot establish the required relation. Preserve the distinction between strings, typed scalar atoms, nested sets, ordered lists, and multisets.
References
Similar or alternative tools
- Family Union Support Count
Count union membership from explicit member/family incidences, ignoring duplicate incidences.
- Finite Set Prefix Cover Count Gap
Deduplicate universe and return members absent from covered as missing, with gap equal to that missing count.