896 …er::findCandidateLine(std::vector<size_t> &line, size_t seedLineIdx, bool addRow, Point2f basisVec,  in findCandidateLine()  argument
902   if (addRow)  in findCandidateLine()
924 …ndidateHoles(std::vector<size_t> &above, std::vector<size_t> &below, bool addRow, Point2f basisVec,  in findCandidateHoles()  argument
932   findCandidateLine(above, 0, addRow, -basisVec, aboveSeeds);  in findCandidateHoles()
933   size_t lastIdx = addRow ? holes.size() - 1 : holes[0].size() - 1;  in findCandidateHoles()
934   findCandidateLine(below, lastIdx, addRow, basisVec, belowSeeds);  in findCandidateHoles()
957 …inder::insertWinner(float aboveConfidence, float belowConfidence, float minConfidence, bool addRow,  in insertWinner()  argument
964   if (addRow)  in insertWinner()
1006 float CirclesGridFinder::computeGraphConfidence(const std::vector<Graph> &basisGraphs, bool addRow,  in computeGraphConfidence()  argument
1018       if (!basisGraphs[addRow].areVerticesAdjacent(seeds[i], points[i]))  in computeGraphConfidence()
1038       if (!basisGraphs[!addRow].areVerticesAdjacent(points[i - 1], points[i]))  in computeGraphConfidence()
1052 void CirclesGridFinder::addHolesByGraph(const std::vector<Graph> &basisGraphs, bool addRow, Point2f…  in addHolesByGraph()  argument
1055   findCandidateHoles(above, below, addRow, basisVec, aboveSeeds, belowSeeds);  in addHolesByGraph()
1056   float aboveConfidence = computeGraphConfidence(basisGraphs, addRow, above, aboveSeeds);  in addHolesByGraph()
1057   float belowConfidence = computeGraphConfidence(basisGraphs, addRow, below, belowSeeds);  in addHolesByGraph()
1059 …insertWinner(aboveConfidence, belowConfidence, parameters.minGraphConfidence, addRow, above, below…  in addHolesByGraph()