| /external/skia/src/pathops/ |
| SkPathOpsWinding.cpp | 8 // given a prospective edge, compute its initial winding by projecting a ray
9 // if the ray hits another edge
10 // if the edge doesn't have a winding yet, hop up to that edge and start over
12 // if the edge is unsortable, or
16 // concern : if it is unable to succeed after N tries, try another edge? direction?
17 // if no edge is hit, compute the winding directly
|
| /frameworks/support/design/tests/src/android/support/design/widget/ |
| AppBarWithCollapsingToolbarTest.java | 172 // edge aligned with the bottom of system status bar. If we're running on a device which
342 // Test that the top edge of the image (in the screen coordinates) has "moved" by half
343 // the amount that the top edge of the app bar (in the screen coordinates) has.
356 // Test that the top edge of the image (in the screen coordinates) has "moved" by half
357 // the amount that the top edge of the app bar (in the screen coordinates) has.
371 // Test that the top edge of the image (in the screen coordinates) has "moved" by half
372 // the amount that the top edge of the app bar (in the screen coordinates) has.
|
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.cpp | 129 // Quad-edge manipulation primitives
189 // Quad-edge storage allocation
216 // Edge storage management
622 void CDelaunay::linkNeighbors(SEdgeVector *edge, int nedge, int nsite)
627 sa[i].setNeighbor(edge);
629 for (; edge->first == i && nedge; edge++, nedge--) {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| ConstraintPainter.java | 51 * such as a source node having its top edge constrained to a target node with a given margin.
69 Rect targetBounds = match.edge.node.getBounds();
72 paintConstraint(graphics, type, match.with.node, sourceBounds, match.edge.node,
423 // If however there is a margin on the target edge, it should be drawn like this:
528 // If not, we'll need to indicate a shared edge. This is the edge that separate
558 // Adjust position of source arrow such that it does not sit across edge; it
559 // should point directly at the edge
574 // Draw the line from the source anchor to the shared edge
579 // Draw the line from the target to the horizontal shared edge
[all...] |
| /external/llvm/unittests/ADT/ |
| APIntTest.cpp | 339 int64_t edge = INT64_MIN; local
340 int64_t edgeP1 = edge + 1;
342 auto a = APInt{64, static_cast<uint64_t>(edge), true};
344 EXPECT_TRUE(!a.slt(edge));
345 EXPECT_TRUE( a.sle(edge));
346 EXPECT_TRUE(!a.sgt(edge));
347 EXPECT_TRUE( a.sge(edge));
359 uint64_t edge = 0x4000000000000000; local
360 uint64_t edgeP1 = edge + 1;
361 uint64_t edgeM1 = edge - 1
[all...] |
| SCCIteratorTest.cpp | 111 /// AddEdge - Add an edge from the node with index FromIdx to the node with
118 /// DeleteEdge - Remove the edge (if any) from the node with index FromIdx to
246 // Since SCC considers every node to have an implicit self-edge, we only
247 // create graphs for which every node has a self-edge.
262 // Always add a self-edge.
323 // guaranteed by it: if a node in SCC S1 has an edge to a node in
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
| Collision.java | 169 // Find intersection point of edge and plane
271 // Find the min separating edge.
435 * Find the max separation between poly1 and poly2 using edge normals from poly1.
498 // Get the normal of the reference edge in poly2's frame.
512 // Find the incident edge on poly2.
524 // Build the clip vertices for the incident edge.
572 // Find edge normal of max separation on A - return if separating axis is found
573 // Find edge normal of max separation on B - return if separation axis is found
574 // Choose reference edge as min(minA, minB)
575 // Find incident edge
[all...] |
| /external/ImageMagick/www/api/ |
| morphology.html | 10 <meta http-equiv="X-UA-Compatible" content="IE=edge" />
111 <p>AcquireKernelBuiltIn() returned one of the 'named' built-in types of kernels used for special purposes such as gaussian blurring, skeleton pruning, and edge distance determination.</p>
146 <dd> LoG:{radius},{sigma} "Laplacian of a Gaussian" or "Mexician Hat" Kernel. The supposed ideal edge detection, zero-summing kernel. </dd>
172 <dd> Laplacian:{type} Discrete Lapacian Kernels, (without normalization) Type 0 : 3x3 with center:8 surounded by -1 (8 neighbourhood) Type 1 : 3x3 with center:4 edge:-1 corner:0 (4 neighbourhood) Type 2 : 3x3 with center:4 edge:1 corner:-2 Type 3 : 3x3 with center:4 edge:-2 corner:1 Type 5 : 5x5 laplacian Type 7 : 7x7 laplacian Type 15 : 5x5 LoG (sigma approx 1.4) Type 19 : 9x9 LoG (sigma approx 1.4) </dd>
174 <dd> Sobel:{angle} Sobel 'Edge' convolution kernel (3x3) | -1, 0, 1 | | -2, 0,-2 | | -1, 0, 1 | </dd>
178 <dd> Prewitt:{angle} Prewitt Edge convolution kernel (3x3) | -1, 0, 1 | | -1, 0, 1 | | -1, 0, 1 | </dd>
184 <dd> FreiChen:{angle} Frei-Chen Edge Detector is based on a kernel that is similar to the Sobel Kernel, but is designed to be isotropic. That is it takes into account the distance of the diagonal in the kernel. </dd>
198 <dd> However this kernel is als at the heart of the FreiChen Edge Detection Process which uses a set of 9 specially weighted kernel. These 9 kernels not be normali (…)
[all...] |
| morphology.php | 107 <p>AcquireKernelBuiltIn() returned one of the 'named' built-in types of kernels used for special purposes such as gaussian blurring, skeleton pruning, and edge distance determination.</p>
142 <dd> LoG:{radius},{sigma} "Laplacian of a Gaussian" or "Mexician Hat" Kernel. The supposed ideal edge detection, zero-summing kernel. </dd>
168 <dd> Laplacian:{type} Discrete Lapacian Kernels, (without normalization) Type 0 : 3x3 with center:8 surounded by -1 (8 neighbourhood) Type 1 : 3x3 with center:4 edge:-1 corner:0 (4 neighbourhood) Type 2 : 3x3 with center:4 edge:1 corner:-2 Type 3 : 3x3 with center:4 edge:-2 corner:1 Type 5 : 5x5 laplacian Type 7 : 7x7 laplacian Type 15 : 5x5 LoG (sigma approx 1.4) Type 19 : 9x9 LoG (sigma approx 1.4) </dd>
170 <dd> Sobel:{angle} Sobel 'Edge' convolution kernel (3x3) | -1, 0, 1 | | -2, 0,-2 | | -1, 0, 1 | </dd>
174 <dd> Prewitt:{angle} Prewitt Edge convolution kernel (3x3) | -1, 0, 1 | | -1, 0, 1 | | -1, 0, 1 | </dd>
180 <dd> FreiChen:{angle} Frei-Chen Edge Detector is based on a kernel that is similar to the Sobel Kernel, but is designed to be isotropic. That is it takes into account the distance of the diagonal in the kernel. </dd>
194 <dd> However this kernel is als at the heart of the FreiChen Edge Detection Process which uses a set of 9 specially weighted kernel. These 9 kernels not be normalized, but directly applied to the image. The results is then added together, to produce the intensity of an edge in a specific direction. The square root of the pixel value can then be taken as the cosine of th (…)
[all...] |
| /external/ImageMagick/www/Magick++/ |
| Geometry.html | 30 offsets are measured from the indicated edge of the object to the
31 corresponding edge of the image. The X offset may be specified in the
42 <p>The left edge of the object is to be placed <i>xoffset</i>
43 pixels in from the <em>left edge </em>of the image.</p>
51 <p>The left edge of the object is to be placed outside the image,
52 <i>xoffset</i> pixels out from the <em>left edge </em>of the image.</p>
66 <p>The top edge of the object is to be <i>yoffset</i> pixels
67 <em>below</em> the <em>top edge </em>of the image.</p>
75 <p>The top edge of the object is to be <i>yoffset</i> pixels
76 <em>above</em> the <em>top edge</em> of the image.</p
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 143 /// The incomming values of the PHI node are true for the "If" edge and false
144 /// for the "Then" edge.
155 /// 3 3 = "Flow" block, with back edge to entry block
159 /// The back edge of the "Flow" block is always on the false side of the branch
351 // Test for exit as back edge
357 // Test for sucessors as back edge
405 /// \brief Build the condition for one edge
443 // Normal forward edge
458 // Back edge
469 // Edge from inside a subregion to its entry, ignore i
[all...] |
| CorrelatedValuePropagation.cpp | 189 /// processCmp - See if LazyValueInfo's ability to exploit edge conditions,
225 /// on that edge. Cases that cannot fire no matter what the incoming edge can
226 /// safely be removed. If a case fires on every incoming edge then the entire
249 // value on every incoming edge, equal/not equal being the same each time.
262 // If this was the first edge to be visited, record that all other edges
|
| /external/mesa3d/docs/ |
| conform.html | 161 Polygon Edge test passed.
188 Texture Edge Clamp test passed.
274 Polygon Edge test passed.
301 Texture Edge Clamp test passed.
387 Polygon Edge test passed.
414 Texture Edge Clamp test passed.
500 Polygon Edge test passed.
527 Texture Edge Clamp test passed.
613 Polygon Edge test passed.
640 Texture Edge Clamp test passed
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-node.cc | 72 for (auto edge : node->use_edges()) {
73 CHECK_EQ(node, edge.to());
74 CHECK_EQ(node, edge.from()->InputAt(edge.index()));
75 use_set.insert(edge.from());
121 // Check use edge list.
122 for (auto edge : input->use_edges()) {
123 if (edge.from() == node && edge.to() == input && edge.index() == i)
[all...] |
| /frameworks/base/core/java/android/view/ |
| FocusFinder.java | 349 // edge to be closer to the source's top edge than rect1's bottom edge.
369 * Includes an edge case for an empty rect (which is used in some cases when
431 * @return The distance from the edge furthest in the given direction
432 * of source to the edge nearest in the given direction of dest. If the
456 * edge of source to the far edge of dest. If the
481 * edge of the destination rectangle.
513 * @param deltas Offset from the <x, y> to the edge of the nearest view. Note that this arra
[all...] |
| /frameworks/base/docs/html/guide/topics/sensors/ |
| sensors_position.jd | 273 If the top edge of the device faces magnetic north, the azimuth is 0
274 degrees; if the top edge faces south, the azimuth is 180 degrees. Similarly,
275 if the top edge faces east, the azimuth is 90 degrees, and if the top edge
282 edge closest to you and tilt the top edge of the device toward the ground,
284 moving the top edge of the device away from the ground—causes
292 with the bottom edge closest to you and tilt the left edge of the device
294 direction—moving the right edge of the device toward the ground&mdash
[all...] |
| /packages/apps/DevCamera/src/com/android/devcamera/ |
| Api2Camera.java | 57 * where individual streams and capture options (e.g. edge enhancement,
158 // Set initial Noise and Edge modes.
225 // Clamp to edge is only option.
470 public void setCaptureFlow(Boolean yuv1, Boolean yuv2, Boolean raw10, Boolean nr, Boolean edge, Boolean face) {
477 if (edge) {
483 "Edge " + edgeModeToString(mCaptureEdgeMode)
491 public void setReprocessingFlow(Boolean nr, Boolean edge) {
495 if (edge) {
500 "Edge " + edgeModeToString(mReprocessingEdgeMode)
521 Log.v(TAG, " .. NR=" + mCaptureNoiseMode + " Edge=" + mCaptureEdgeMode + " Face=" + mCaptureFace)
[all...] |
| /packages/apps/Gallery2/src/com/android/photos/views/ |
| GalleryThumbnailView.java | 232 * @param x Left or right edge of the view to add
233 * @param forward If true, align left edge to x and increase position.
234 * If false, align right edge to x and decrease position.
354 // Break fling velocity if we impacted an edge.
422 EdgeEffectCompat edge = deltaX > 0 ? mLeftEdge : mRightEdge; local
423 edge.onPull((float) Math.abs(deltaX) / getWidth());
546 final EdgeEffectCompat edge; local
548 edge = mLeftEdge;
550 edge = mRightEdge;
552 edge.onAbsorb(Math.abs((int) mScroller.getCurrVelocity()))
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/mail/ui/ |
| TwoPaneLayout.java | 108 // the drag to only initiate once it hits the edge of the mini-drawer so that the edge follows
157 // Get the right edge of list and use as left edge coord for shadow
162 // Get the left edge of list and use as right edge coord for shadow
223 // Get the right edge of list and use as left edge coord for shadow
228 // Get the left edge of list and use as right edge coord for shado
[all...] |
| /external/libavc/decoder/ |
| ih264d_structs.h | 731 WORD32 i4_submb_ofst; /** Offset in subMbs from the top left edge */
[all...] |
| /external/libgdx/gdx/jni/gdx2d/ |
| gdx2d.c | 662 #define EDGE_ASSIGN(edge,_x1,_y1,_x2,_y2) \
663 { if (_y2 > _y1) { edge.y1 = _y1; edge.y2 = _y2; edge.x1 = _x1; edge.x2 = _x2; } \
664 else { edge.y2 = _y1; edge.y1 = _y2; edge.x2 = _x1; edge.x1 = _x2; } }
669 struct edge {
struct
[all...] |
| /frameworks/base/core/java/android/text/ |
| TextLine.java | 259 * @param trailing true to measure the trailing edge of the character
260 * before offset, false to measure the leading edge of the character
265 * character edge.
382 * @return the signed width from the start of the run to the leading edge
407 // 1) The caret marks the leading edge of a character. The character
410 // was the previous character, the caret is on its trailing edge.
411 // 2) Take this character/edge and move it in the indicated direction.
412 // This gives you a new character and a new edge.
416 // 4) If the active position is on the trailing edge of the character,
447 // use the position on the trailing edge of the previou
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/ |
| RelativeLayoutConversionHelper.java | 207 // must have been a right edge
246 // must have been a right edge
263 // must have been a bottom edge
425 // See if we have a bottom/right edge to attach the forwards link to
496 // Attach to right/bottom edge of the layout
700 // Determine if the reference is to a known edge
[all...] |
| /external/ImageMagick/ImageMagick/api/ |
| morphology.html | 107 <p>AcquireKernelBuiltIn() returned one of the 'named' built-in types of kernels used for special purposes such as gaussian blurring, skeleton pruning, and edge distance determination.</p>
142 <dd> LoG:{radius},{sigma} "Laplacian of a Gaussian" or "Mexician Hat" Kernel. The supposed ideal edge detection, zero-summing kernel. </dd>
168 <dd> Laplacian:{type} Discrete Lapacian Kernels, (without normalization) Type 0 : 3x3 with center:8 surounded by -1 (8 neighbourhood) Type 1 : 3x3 with center:4 edge:-1 corner:0 (4 neighbourhood) Type 2 : 3x3 with center:4 edge:1 corner:-2 Type 3 : 3x3 with center:4 edge:-2 corner:1 Type 5 : 5x5 laplacian Type 7 : 7x7 laplacian Type 15 : 5x5 LoG (sigma approx 1.4) Type 19 : 9x9 LoG (sigma approx 1.4) </dd>
170 <dd> Sobel:{angle} Sobel 'Edge' convolution kernel (3x3) | -1, 0, 1 | | -2, 0,-2 | | -1, 0, 1 | </dd>
174 <dd> Prewitt:{angle} Prewitt Edge convolution kernel (3x3) | -1, 0, 1 | | -1, 0, 1 | | -1, 0, 1 | </dd>
180 <dd> FreiChen:{angle} Frei-Chen Edge Detector is based on a kernel that is similar to the Sobel Kernel, but is designed to be isotropic. That is it takes into account the distance of the diagonal in the kernel. </dd>
194 <dd> However this kernel is als at the heart of the FreiChen Edge Detection Process which uses a set of 9 specially weighted kernel. These 9 kernels not be normalized, but directly applied to the image. The results is then added together, to produce the intensity of an edge in a specific direction. The square root of the pixel value can then be taken as the cosine of th (…)
[all...] |
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 100 if (!KnownFeasibleEdges.insert(Edge(Source, Dest)).second)
101 return; // This edge is already known to be executable!
103 DEBUG(dbgs() << "Marking Edge Executable: " << Source->getName()
107 // The destination is already executable, but we just made an edge
203 /// isEdgeFeasible - Return true if the control flow edge from the 'From'
259 // If the edge is not yet known to be feasible, it doesn't impact the PHI.
|
