Build a name-conflict resolution from exact losing path-claim edges. Each tuple contains the source position, exact name vertex, and change that introduced the alive claim edge being superseded. The constructor fixes the transition flags and rejects an empty or malformed operation.
(
path: impl Into<String>,
surviving_claimant: Position<H>,
losing_claims: impl IntoIterator<Item = (Position<H>, GraphNode<H>, H)>,
)
| 349 | /// that introduced the alive claim edge being superseded. The constructor |
| 350 | /// fixes the transition flags and rejects an empty or malformed operation. |
| 351 | pub fn solve_name_conflict( |
| 352 | path: impl Into<String>, |
| 353 | surviving_claimant: Position<H>, |
| 354 | losing_claims: impl IntoIterator<Item = (Position<H>, GraphNode<H>, H)>, |
| 355 | ) -> Result<Self, String> { |
| 356 | Self::build_name_conflict(path, surviving_claimant, losing_claims, false) |
| 357 | } |
| 358 | |
| 359 | /// Build the inverse of a name-conflict resolution. |
| 360 | /// |
nothing calls this directly
no outgoing calls
no test coverage detected