!     Safe'Auxiliary functions(c) Dominik Schrempf, 2020GPL-3.0-or-laterdominik.schrempf@gmail.comunstableportableNone>pava&Calculate the slope between to points. pava(Check if vector is ordered strictly (<). pava,Fill in missing values of an indexed vector. B smooth [-2, 2, 4, 5] [0, 4, 10, 88] = [0, 1, 2, 3, 4, 7, 10, 88] pavaSee  .]Assume that: - the lengths of the provided vectors are equal; - the predictors are ordered. pavaReverse lists in a three-tuple.  Compute least concave majorants(c) Dominik Schrempf, 2020GPL-3.0-or-laterdominik.schrempf@gmail.comunstableportableNone> pavaGreatest convex minorant. Uses the Pool Adjacent Violators Algorithm (PAVA). It is required that the predictors are ordered with no ties, and that the lengths of the vectors are equal.Usage: 6 lcm predictors responses = (indices, values, slopes) pavaSee  .]Assume that: - the lengths of the provided vectors are equal; - the predictors are ordered.  !Compute greatest convex minorants(c) Dominik Schrempf, 2020GPL-3.0-or-laterdominik.schrempf@gmail.comunstableportableNone>pavaGreatest convex minorant. Uses the Pool Adjacent Violators Algorithm (PAVA). It is required that the predictors are ordered with no ties, and that the lengths of the vectors are equal.Usage: 6 gcm predictors responses = (indices, values, slopes) pavaSee .]Assume that: - the lengths of the provided vectors are equal; - the predictors are ordered.     #pava-0.1.0.0-B8tsl6ihZUb35HPGPDcPTp Paths_pavaStatistics.Pava.CommonStatistics.LcmStatistics.Gcmversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileNameslopestrictlyOrderedsmooth unsafeSmoothreverse3lcm unsafeLcmgcm unsafeGcm