Bit String Contained Mask Check
Check exact equal-width bit-mask left containment in right at each string position; no implicit padding or integer coercion.
Description
Check exact equal-width bit-mask left containment in right at each string position; no implicit padding or integer coercion.
A left mask is contained in a right mask when every left-side set bit is also set on the right.
When to use this tool
Check exact equal-width bit-mask left containment in right at each string position; no implicit padding or integer coercion.
- Prepare the supplied left, right fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter left, right. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.holds. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Require equal-length binary strings. Check every position and return holds when a left one always corresponds to a right one.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| left | left. | Binary text containing only 0 and 1; at most 128 characters |
| right | right. | Binary text containing only 0 and 1; at most 128 characters |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.holds | True exactly when the stated property passes; it does not establish other properties. |
{
"input": {
"left": "100",
"right": "110"
},
"output": {
"result": {
"holds": true
}
}
}Limitations and assumptions
- The relation is directional: extra right-side ones are allowed. It concerns literal positions rather than numeric ordering.
- Every bitstring is at most 128 characters and contains only literal zero and one.
- All declared input fields are required and unexpected top-level fields are rejected. Numbers must be finite; lists are limited to 128 entries and ordinary text fields to 8,192 UTF-16 code units, with tighter limits where stated.
- JSON text inputs must parse within bounded nesting and size limits. Numeric outputs outside the safe finite range are rejected; large exact integer results use decimal strings. Indexes and half-open spans are zero-based unless a rank is explicitly described as one-based.
Alternative or Complementary methods
Choose a packed-integer or textual-bit representation deliberately before combining operations. Preserve the documented index direction, width and exclusive boundaries; do not substitute a rank query for select.
References
Similar or alternative tools
- Bit String Disjoint Mask Check
Check exact equal-width bit-mask disjointness at each string position; no implicit padding or integer coercion.
- Bit String Mask Replacement
Replace bit positions only where an equal-width explicit mask has one; preserve all unmasked source positions.