num_eligible_matches

num_eligible_matches.optmatch.dlist

num_eligible_matches.matrix

num_eligible_matches.InfinitySparseMatrix

num_eligible_matches.BlockedInfinitySparseMatrix

This will return a list of the number of finite entries in a distance
matrix. If the distance has no subgroups, it will be a list of length 1. If
the distance has subgroups (i.e. <code>x</code> is an
<code>BlockedInfinitySparseMatrix</code>, it will be a named list.)

Distance based bipartite matching using minimum cost flow, oriented
to matching of treatment and control groups in observational studies ('Hansen'
and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). 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.

Josh Errickson

optmatch

Functions for Optimal Matching

Ben Hansen

Mark Fredrickson

Josh Buckner

Adam Rauh

num_eligible_matches function

<dl><dt>x</dt>
<dd>Any distance object.</dd></dl>

Arguments

Returns the number of eligible matches for the distance. — num_eligible_matches

<dl>

<dt>x</dt>
<dd>Any distance object.</dd>

</dl>

Returns the number of eligible matches for the distance.

num_eligible_matches: Returns the number of eligible matches for the distance.

Description

Usage

Value

Arguments