Home
last modified time | relevance | path

Searched refs:wedges (Results 1 – 6 of 6) sorted by relevance

/external/skia/gm/
Ddashcircle.cpp38 int wedges[] = { 6, 12, 36 }; variable
40 for (int wedge : wedges) {
/external/chromium-trace/catapult/telemetry/third_party/mox3/
Drequirements.txt3 # process, which may cause wedges in the gate later.
Dtest-requirements.txt3 # process, which may cause wedges in the gate later.
/external/chromium-trace/catapult/third_party/mox3/
Drequirements.txt3 # process, which may cause wedges in the gate later.
Dtest-requirements.txt3 # process, which may cause wedges in the gate later.
/external/opencv3/modules/stitching/src/
Dseam_finders.cpp336 std::map<std::pair<int, int>, int> wedges; // weighted edges in findEdges() local
342 wedges[std::make_pair(ci, cj)] = 0; in findEdges()
343 wedges[std::make_pair(cj, ci)] = 0; in findEdges()
357 wedges[std::make_pair(ci, labels_(y, x-1)-1)]++; in findEdges()
358 wedges[std::make_pair(labels_(y, x-1)-1, ci)]++; in findEdges()
363 wedges[std::make_pair(ci, labels_(y-1, x)-1)]++; in findEdges()
364 wedges[std::make_pair(labels_(y-1, x)-1, ci)]++; in findEdges()
369 wedges[std::make_pair(ci, labels_(y, x+1)-1)]++; in findEdges()
370 wedges[std::make_pair(labels_(y, x+1)-1, ci)]++; in findEdges()
375 wedges[std::make_pair(ci, labels_(y+1, x)-1)]++; in findEdges()
[all …]