úÎ×î      JAn arbitrary-precision number between 0.0 and 1.0. To create new numbers,  use  . Each number consist of a  (>= 0) and an  (> 0), so that  its numeric value equals !mantissa x * 2 ^ (1 - exponent x). The constraint G that it must lie between 0.0 and 1.0 is enforced in the constructors. MIt is possible to span a hypothetical tree in this number scheme. Discarding K the last binary digit of the mantissa, which has to be a 1, each digit of L the mantissa denotes a branch in this hypothetical binary tree. So a whole  9 (if it ends with 1) corresponds with a path in a binary  tree. Extracts the mantissa. Extracts the exponent. !The lowest possible number: 0.0. "The highest possible number: 1.0. (The root of a hypothetical binary tree. ! Construct a  from its  and . 3Errors are checked and result in a run-time error. " Construct a  from its  and . !Errors are checked and result in #.  Construct a  from its  and . Errors are not checked.  Construct a - from a list of boolean digits. The exponent  equals the number of digits. 7Compute a number right in the middle of the arguments. (x + y) / 2 %Add digits in front of the mantissa. =Build a number from a list of fixed-width mantissa segments. =Build a number from a list of fixed-width mantissa segments. AGet the left child of the current path in the hypothetical tree. BGet the right child of the current path in the hypothetical tree. =Get the parent of the current path in the hypothetical tree.  Convert a  to a binary representation.  Convert a ! from its binary representation.    $%        sequential-index-0.2Data.SequentialIndexData.SequentialIndex.OpenSequentialIndexmantissaexponentzeroonerootsequentialIndexunsafeSequentialIndex tryFromBoolsbetween prefixBitsbuild buildBits leftChild rightChildparent toByteStringfromByteStringtoClosed fromClosedSI commonBasetrySequentialIndexbase Data.MaybeNothingOSI