489   auto Get = [&Distances, Columns](size_t Column, std::size_t Row) -> char & {  in nearestMatchesForCodepointName()  argument
491     assert(Row < Rows);  in nearestMatchesForCodepointName()
492     return Distances[Row * Columns + Column];  in nearestMatchesForCodepointName()
502   auto VisitNode = [&](const Node &N, std::size_t Row,  in nearestMatchesForCodepointName()
509       Get(0, Row) = Row;  in nearestMatchesForCodepointName()
512         const int Delete = Get(I - 1, Row) + 1;  in nearestMatchesForCodepointName()
513         const int Insert = Get(I, Row - 1) + 1;  in nearestMatchesForCodepointName()
516             Get(I - 1, Row - 1) + (NormalizedName[I - 1] != N.Name[J] ? 1 : 0);  in nearestMatchesForCodepointName()
518         Get(I, Row) = std::min(Insert, std::min(Delete, Replace));  in nearestMatchesForCodepointName()
521       Row++;  in nearestMatchesForCodepointName()
524     unsigned Cost = Get(Columns - 1, Row - 1);  in nearestMatchesForCodepointName()
536         VisitNode(C, Row, VisitNode);  in nearestMatchesForCodepointName()