Home
last modified time | relevance | path

Searched refs:verticalSegment (Results 1 – 3 of 3) sorted by relevance

/dports/www/chromium-legacy/chromium-88.0.4324.182/android_webview/java/src/org/chromium/android_webview/gfx/
H A DRectUtils.java99 VerticalSegment arr[], int n, VerticalSegment verticalSegment, int capacity) { in insertSorted() argument
103 for (i = n - 1; (i >= 0 && arr[i].compareTo(verticalSegment) > 0); i--) { in insertSorted()
109 arr[insert_index].set(verticalSegment); in insertSorted()
113 VerticalSegment arr[], int n, VerticalSegment verticalSegment) {
114 int pos = Arrays.binarySearch(arr, 0, n, verticalSegment);
133 VerticalSegment verticalSegment = vSegments[i];
134 if (scanCount == 0 && verticalSegment.mSegmentType == SegmentType.START) {
135 start = verticalSegment.mY;
136 } else if (scanCount == 1 && verticalSegment.mSegmentType == SegmentType.END) {
137 coveredPixels += verticalSegment.mY - start;
[all …]
/dports/math/ogdf/OGDF/src/ogdf/layered/
H A DOptimalHierarchyClusterLayout.cpp202 if(!H.verticalSegment(e)) in computeXCoordinates()
293 } while(m_isVirtual[w] && H.verticalSegment(e)); in computeXCoordinates()
/dports/math/ogdf/OGDF/include/ogdf/layered/
H A DExtendedNestingGraph.h323 bool verticalSegment(edge e) const { return m_vertical[e]; } in verticalSegment() function