Next Fixed Weight Binary Word
Return the next lexicographic binary word with the same length and one-count, without wraparound; null marks the last fixed-weight word.
Description
Return the next lexicographic binary word with the same length and one-count, without wraparound; null marks the last fixed-weight word.
A fixed-weight successor keeps a binary word's length and number of ones while moving to the next lexical spelling.
When to use this tool
Return the next lexicographic binary word with the same length and one-count, without wraparound; null marks the last fixed-weight word.
- Prepare the supplied word 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 word. 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.word. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Find the final 01 pair, change it to 10 and arrange the remaining suffix zeros before ones. Return word as null when no such pair exists.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| word | word. | Binary text containing only 0 and 1; at most 128 characters |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.word | The word value under the stated formula or text convention. |
{
"input": {
"word": "0011"
},
"output": {
"result": {
"word": "0101"
}
}
}Limitations and assumptions
- There is no wraparound. Empty and terminal words return null rather than a different-weight word.
- 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
Retain the universe size, subset size and ordering convention with a rank. Use rank/unrank pairs from the same convention and distinguish subset masks from lexicographic indexes.
References
Similar or alternative tools
- Fixed Weight Binary Word Rank
Rank a fixed-weight binary word lexicographically by its zero-position combination, using exact zero-based integer text.
- Next Combination Indexes
Return the next lexicographic fixed-size index combination without wrapping; null marks the order boundary.