dist_digest

<p>Distance object to hash. Must be one of
<code>InfinitySparseMatrix</code>, <code>BlockedInfinitySparseMatrix</code>,
<code>DenseMatrix</code>, <code>matrix</code>, or <code>distmatch.dlist</code>.</p>

dist

<p>(Internal) Remove the call before digesting a distance so things
like omitting caliper and calling caliper=NULL give the same digest
#</p>

internal

Distance based bipartite matching using the RELAX-IV minimum cost flow solver,
oriented to matching of treatment and control groups in observational
studies. Routines are provided to generate distances from generalised linear models (propensity
score matching), formulas giving variables on which to limit matched distances, stratified or
exact matching directives, or calipers, alone or in combination.

dist_digest: (Internal) Remove the call before digesting a distance so things like omitting caliper and calling caliper=NULL give the same digest #

Description

Usage

Arguments

Value