SBTNode[T] = tuple[p: T, q: T, r: T, s: T, depth: T]

CPLIB_MATH_STERN_BROCOT_TREE = 1

proc ancestor[T](a, b, k: T): Option[SBTNode[T]]

proc ancestor[T](now: SBTNode[T]; k: T): Option[SBTNode[T]]

proc continued_fraction_expansion[T](a, b: T): seq[T]

proc decode_path[T](path: seq[(char, T)]): SBTNode[T]

proc den[T](x: SBTNode[T]): T

proc encode_path[T](a, b: T): seq[(char, T)]

proc encode_path[T](now: SBTNode[T]): seq[(char, T)]

proc get_bounds[T](is_ok: proc (x: SBTNode[T]): bool; n: T): SBTNode[T]

proc get_range[T](a, b: T): (T, T, T, T)

proc get_range[T](node: SBTNode[T]): (T, T, T, T)

proc get_range_fraction[T](node: SBTNode[T]): (Fraction[T], Fraction[T])

proc initAuxiliaryWeightedTree(v: openArray[SBTNode[int]]): WeightedUnDirectedTableGraph[
    SBTNode[int], int] {....raises: [KeyError], tags: [].}

proc LCA[T](a, b, c, d: T): SBTNode[T]

proc LCA[T](a, b: SBTNode[T]): SBTNode[T]

proc max_less_with_den_at_most[T](x: SBTNode[T]; m: T): SBTNode[T]

proc min_greater_with_den_at_most[T](x: SBTNode[T]; m: T): SBTNode[T]

proc move_left[T](now: SBTNode[T]; d: T): SBTNode[T]

proc move_right[T](now: SBTNode[T]; d: T): SBTNode[T]

proc num[T](x: SBTNode[T]): T

proc sbt_inf(): SBTNode[int] {....raises: [], tags: [].}

proc sbt_inf[T](typ: typedesc[T]): SBTNode[T]

proc sbt_root(): SBTNode[int] {....raises: [], tags: [].}

proc sbt_root[T](typ: typedesc[T]): SBTNode[T]

proc sbt_zero(): SBTNode[int] {....raises: [], tags: [].}

proc sbt_zero[T](typ: typedesc[T]): SBTNode[T]

proc to_fraction_tuple[T](x: SBTNode[T]): (T, T)

proc to_SBTNode[T](a, b: T): SBTNode[T]