% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/matching_lazy.R
\name{lazy_pair_distances}
\alias{lazy_pair_distances}
\title{Compute paired (not cross) distances for specific matched pairs}
\usage{
lazy_pair_distances(spec, matched_rows, matched_cols)
}
\value{
Numeric vector of length length(matched_rows).
}
\description{
Given matched row/column index pairs (as produced by a solve), recomputes
each pair's distance directly from left_mat/right_mat. This is cheap
regardless of n_left/n_right: the number of matched pairs never exceeds
min(n_left, n_right), so this never approaches the O(n*m) cost the lazy
path exists to avoid. Mirrors compute_distance_matrix()'s per-metric
formulas exactly, but pairwise rather than all-pairs.
}
\keyword{internal}
