Count the parts in the n-digit little-endian binary representation of x.

A part is the length of a substring \(10^*\) composing the necklace. For example the necklace \(10100\) has parts sizes \(2\) and \(3\).

>>> countParts 5 5
[2,3]

Right pad a list with zeros up to a given length.

>>> padUpTo 5 [0,1]
[0,1,0,0,0]

Parse a binary digit, i.e., 0 or 1.

>>> parseString binaryDigit mempty "0"
Success (finite 0)

>>> parseString binaryDigit mempty "1"
Success (finite 1)

>>> parseString binaryDigit mempty "?"
Failure (ErrInfo {_errDoc = (interactive):1:1: error: expected: one, zero
1 | ?<EOF>
  | ^      , _errDeltas = [Columns 0 0]})

Convert a list of nodes to binary necklaces of a given length.

>>> nodesToNecklaces 4 [3,5]
[[1,1,0,0],[1,0,1,0]]

Cycle a vector of length n to produce a vector of length m.

Conceptually take m . cycle, but for Vectors.