Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:edge (Results 801 - 825 of 3660) sorted by null

<<31323334353637383940>>

/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/
GridLayoutConverter.java	576 * The left edge of the view to be used for placement 578 * @return the left edge x coordinate 585 * The top edge of the view to be used for placement 587 * @return the top edge y coordinate 594 * The right edge of the view to be used for placement 596 * @return the right edge x coordinate 603 * The bottom edge of the view to be used for placement 605 * @return the bottom edge y coordinate 812 // See if this view shares the edge with the removed     [all...]
/bootable/recovery/minzip/
Hash.c	204 break; /* edge case - single-entry table */ 268 break; /* edge case - single-entry table */ 330 break; /* edge case - single-entry table */
/external/ImageMagick/ImageMagick/api/
feature.html	89 <dd>percentage of edge pixels in the lower threshold. </dd> 93 <dd>percentage of edge pixels in the upper threshold. </dd> 141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
/external/ImageMagick/www/api/
feature.php	89 <dd>percentage of edge pixels in the lower threshold. </dd> 93 <dd>percentage of edge pixels in the upper threshold. </dd> 141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
DFA.cs	43 * Any state that has a semantic predicate edge is special; those states 124 // eot[s]>=0 indicates that an EOT edge goes to another 132 // which assumed here that the EOT edge always
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
DFA.cs	44 * Any state that has a semantic predicate edge is special; those states 148 // eot[s]>=0 indicates that an EOT edge goes to another 157 // which assumed here that the EOT edge always
/external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/
rhino-python.extensions	41 Here the "b" token on the left edge signals that a DEDENT is needed 113 at a non left edge. 165 cpos = -1; // pretend EOF always happens at left edge
/external/dbus/dbus/
dbus-socket-set-epoll.c	247 * So, let's set it to be edge-triggered: then the worst case is that 330 * wait for HUP, edge-triggered: 1 354 printf ("wait for HUP, edge-triggered: %d\n", ret);
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
gim_tri_collision.h	166 The transformation is oriented to the triangle normal , and aligned to the 1st edge of this triangle. The position corresponds to vertice 0: 168 - 1st normalized edge corresponds to X axis, 298 //Test with edge 0
/external/libgdx/extensions/gdx-tools/src/com/badlogic/gdx/tools/distancefield/
DistanceFieldGenerator.java	88 * that we'll scan while for a nearby edge. The resulting distance is also normalized 125 * when we are exactly on the edge. 244 " --spread n edge scan distance (default: 1)\n");
/external/libgdx/gdx/src/com/badlogic/gdx/math/
EarClippingTriangulator.java	34 * @author Nicolas Gramlich (optimizations, collinear edge support) 173 // It will be 0 on the edge, which we want to include as well. 174 // note: check the edge defined by p1->p3 first since this fails _far_ more then the other 2 checks.
/external/libjpeg-turbo/
jcprepct.c	12 * and edge expansion steps. 288 * We make the buffer wide enough to allow the downsampler to edge-expand 333 * We make the buffer wide enough to allow the downsampler to edge-expand
/external/libmpeg2/common/
ideint_utils.c	365 * Performs spatial edge adaptive filtering 368 * Performs spatial edge adaptive filtering by detecting edge direction
/external/llvm/lib/Transforms/Scalar/
Sink.cpp	204 // on different code paths. We could split the critical edge, but for now we 208 // We cannot sink a load across a critical edge - there may be stores in 213 // We don't want to sink across a critical edge if we don't dominate the
/external/llvm/lib/Transforms/Utils/
AddDiscriminators.cpp	44 // equally frequent. This, in turn, will consider the edge while.body->if.then 143 /// executed a handful of times (meaning that the entry->if.then edge is 148 /// in turn will make it conclude that the entry->if.then edge is very
/external/mesa3d/src/mesa/tnl/
t_vb_rendertmp.h	303 /* If the primitive does not begin here, the first edge 312 /* If the primitive does not end here, the final edge is 327 /* Don't render the first edge again:
/external/opencv/cv/src/
cvcanny.cpp	160 // 0 - the pixel might belong to an edge 161 // 1 - the pixel can not belong to an edge 162 // 2 - the pixel does belong to an edge
/external/opencv3/3rdparty/libjpeg/
jcprepct.c	10 * and edge expansion steps. 288 * We make the buffer wide enough to allow the downsampler to edge-expand 334 * We make the buffer wide enough to allow the downsampler to edge-expand
/external/opencv3/doc/tutorials/imgproc/imgtrans/hough_lines/
hough_lines.markdown	21 -# To apply the Transform, first an edge detection pre-processing is desirable. 131 - *dst*: Output of the edge detector. It should be a grayscale image (although in fact it 163 - *dst*: Output of the edge detector. It should be a grayscale image (although in fact it
/external/pdfium/third_party/libjpeg/
fpdfapi_jcprepct.c	10 * and edge expansion steps. 286 * We make the buffer wide enough to allow the downsampler to edge-expand 331 * We make the buffer wide enough to allow the downsampler to edge-expand
/external/v8/src/compiler/
escape-analysis-reducer.cc	115 for (Edge edge : node->use_edges()) { 116 PrintF(" #%d", edge.from()->id());
/hardware/bsp/intel/peripheral/libupm/src/grove/
grove.h	395 void installISR(mraa::Edge level, IsrCallback *cb); 397 void installISR(mraa::Edge level, void (*isr)(void *), void *arg); 407 void installISR(mraa::Edge level, void (*isr)(void *), void *arg);
/hardware/intel/img/psb_video/src/
vc1_header.h	104 /* DQDBEDGE specifies which two edges will be quantized with ALTPQUANT when DQPROFILE == 'Double Edge'. */ 106 /* DQSBEDGE specifies which edge will be quantized with ALTPQUANT when DQPROFILE == 'Single Edge'. */
/packages/apps/Gallery2/src/com/android/gallery3d/filtershow/crop/
CropMath.java	89 * If edge point [x, y] in array [x0, y0, x1, y1, ...] is outside of the 90 * image bound rectangle, clamps it to the edge of the rectangle. 92 * @param imageBound the rectangle to clamp edge points to.
/packages/apps/UnifiedEmail/src/com/android/mail/ui/
FolderDisplayer.java	117 * @param foldersHorizontalPadding the padding between the edge of the chip and the text. 218 * innerPadding - the padding between the text and the chip edge. * 219 * overflowPadding - the padding between start of overflow and the chip edge. *

Completed in 1545 milliseconds

<<31323334353637383940>>