| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/pie/ |
| SegmentFormatter.java | 43 // outer edge:
49 // inner edge:
55 // radial edge:
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_deadlock_detector_interface.h | 58 u64 mtx_ctx0; // user mutex context, start of the edge
59 u64 mtx_ctx1; // user mutex context, end of the edge
60 u32 stk[2]; // stack ids for the edge
|
| /external/compiler-rt/test/asan/TestCases/ |
| coverage-levels.cc | 7 // RUN: %clangxx_asan -O1 -fsanitize-coverage=edge %s -o %t
9 // RUN: %clangxx_asan -O1 -fsanitize-coverage=edge -mllvm -sanitizer-coverage-block-threshold=0 %s -o %t
11 // RUN: %clangxx_asan -O1 -fsanitize-coverage=edge,8bit-counters %s -o %t
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
| PolygonShape.java | 44 * edge. */
54 * assumed that the exterior is the the right of each edge. */
60 * order and define a convex polygon. It is assumed that the exterior is the the right of each edge. */
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btTriangleShape.h | 141 //inside check on edge-planes
147 btVector3 edge = pb-pa; local
148 btVector3 edgeNormal = edge.cross(normal);
|
| btTriangleInfoMap.h | 57 ///The btTriangleInfoMap stores edge angle information for some triangles. You can compute this information yourself or using btGenerateInternalEdgeInfo.
60 btScalar m_convexEpsilon;///used to determine if an edge or contact normal is convex, using the dot product
61 btScalar m_planarEpsilon; ///used to determine if a triangle edge is planar with zero angle
63 btScalar m_edgeDistanceThreshold; ///used to determine edge contacts: if the closest distance between a contact point and an edge is smaller than this distance threshold it is considered to "hit the edge"
|
| /external/llvm/include/llvm/Analysis/ |
| LazyValueInfo.h | 52 /// to be true or false on the specified CFG edge.
69 /// constant on the specified edge. Return null if not.
73 /// Inform the analysis cache that we have threaded an edge from
|
| /external/llvm/include/llvm/Support/ |
| GCOV.h | 126 /// readEdgeTag - If cursor points to an edge tag then increment the
252 /// GCOVEdge - Collects edge information.
324 void addSrcEdge(GCOVEdge *Edge) {
325 assert(&Edge->Dst == this); // up to caller to ensure edge is valid
326 SrcEdges.push_back(Edge);
328 void addDstEdge(GCOVEdge *Edge) {
329 assert(&Edge->Src == this); // up to caller to ensure edge is valid
330 // Check if adding this edge causes list to become unsorted
[all...] |
| /external/llvm/lib/CodeGen/ |
| EdgeBundles.cpp | 24 ViewEdgeBundles("view-edge-bundles", cl::Hidden,
25 cl::desc("Pop up a window to show edge bundle graphs"));
29 INITIALIZE_PASS(EdgeBundles, "edge-bundles", "Bundle Machine CFG Edges",
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
184 // The edge does not exist. Create one with the appropriate interference
186 if (edge == G.invalidEdgeId()) {
207 if (G.getEdgeNode1Id(edge) == node2) {
213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
238 G.updateEdgeCosts(edge, std::move(costs));
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
279 assert(edge != G.invalidEdgeId() &&
280 "PBQP error ! The edge should exist !");
284 if (G.getEdgeNode1Id(edge) == node2)
[all...] |
| /external/llvm/test/Analysis/BranchProbabilityInfo/ |
| pr18705.ll | 3 ; Since neither of while.body's out-edges is an exit or a back edge,
7 ; CHECK: edge while.body -> if.then probability is 0x50000000 / 0x80000000 = 62.50%
8 ; CHECK: edge while.body -> if.else probability is 0x30000000 / 0x80000000 = 37.50%
|
| /external/llvm/test/CodeGen/X86/ |
| code_placement_ignore_succ_in_inner_loop.ll | 4 ; Test that when determining the edge probability from a node in an inner loop
46 ; Test that when determining the edge probability from a node in a loop to a
76 ; Test that when determining the edge probability from a node in a loop to a
|
| /external/skia/include/effects/ |
| SkMatrixConvolutionImageFilter.h | 19 effects such as sharpening, blurring, edge detection, etc.
26 kClamp_TileMode = 0, /*!< Clamp to the image's edge pixels. */
27 kRepeat_TileMode, /*!< Wrap around to the image's opposite edge. */
|
| /frameworks/base/core/java/android/view/accessibility/ |
| CaptioningManager.java | 266 * background colors, edge properties, and typeface.
299 /** Unspecified edge type value. */
302 /** Edge type value specifying no character edges. */
305 /** Edge type value specifying uniformly outlined character edges. */
308 /** Edge type value specifying drop-shadowed character edges. */
311 /** Edge type value specifying raised bevel character edges. */
314 /** Edge type value specifying depressed bevel character edges. */
324 * The preferred edge type for video captions, one of:
337 * The preferred edge color for video captions, if using an edge typ
[all...] |
| /frameworks/base/core/tests/coretests/src/android/view/ |
| FocusFinderTest.java | 113 // just below bottom edge
118 // at edge
128 // just below top edge
134 // at top edge
139 // just beyond top edge
150 // just short of right edge
155 // at edge
165 // just short of left edge
171 // at edge
176 // just beyond edge
[all...] |
| /frameworks/base/core/tests/coretests/src/android/widget/listview/arrowscroll/ |
| ListOfThinItemsTest.java | 45 assertTrue("need item height less than fading edge length",
68 assertTrue(prefix + "selected item is below bottom threshold (fading edge or bottom as " +
107 assertTrue(prefix + "selected item is above top threshold (fading edge or top as " +
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/transition/ |
| TransitionHelper.java | 106 public Object createFadeAndShortSlide(int edge);
108 public Object createFadeAndShortSlide(int edge, float distance);
251 public Object createFadeAndShortSlide(int edge) {
256 public Object createFadeAndShortSlide(int edge, float distance) {
578 public Object createFadeAndShortSlide(int edge) {
579 return TransitionHelperApi21.createFadeAndShortSlide(edge);
583 public Object createFadeAndShortSlide(int edge, float distance) {
584 return TransitionHelperApi21.createFadeAndShortSlide(edge, distance);
827 public static Object createFadeAndShortSlide(int edge) {
828 return sImpl.createFadeAndShortSlide(edge);
[all...] |
| /hardware/bsp/intel/peripheral/libupm/src/lcd/ |
| eboled.h | 252 * @param x the left edge
253 * @param y the top edge
254 * @param width sets the right edge
255 * @param height bottom edge
263 * @param x the left edge
264 * @param y the top edge
265 * @param width sets the right edge
266 * @param height bottom edge
275 * @param x the left edge
276 * @param y the top edge
[all...] |
| /hardware/bsp/intel/peripheral/libupm/src/ttp223/ |
| ttp223.h | 103 void installISR(mraa::Edge level, IsrCallback *cb);
105 void installISR(mraa::Edge level, void (*isr)(void *), void *arg);
115 void installISR(mraa::Edge level, void (*isr)(void *), void *arg);
|
| /packages/apps/LegacyCamera/jni/feature_mos/src/mosaic/ |
| Delaunay.h | 33 // Reference for Quad-edge data structure:
108 int triangulate(SEdgeVector **edge, int nsite, int width, int height);
109 void linkNeighbors(SEdgeVector *edge, int nedge, int nsite);
|
| /external/libjpeg-turbo/ |
| transupp.h | 42 * at the bottom, but leaves any partial iMCUs at the right edge untouched.
43 * Similarly flip_v leaves any partial iMCUs at the bottom edge untouched.
45 * and process edge blocks in a way that preserves the equivalence.
51 * (For example, -rot 270 -trim trims only the bottom edge, but -rot 90 -trim
139 JCROP_CODE crop_xoffset_set; /* (negative measures from right edge) */
141 JCROP_CODE crop_yoffset_set; /* (negative measures from bottom edge) */
|
| /external/llvm/docs/ |
| BlockFrequencyTerminology.rst | 19 outgoing edge. These are called branch probabilities. For a given block, the
25 Rather than storing fractions on each edge, we store an integer weight.
27 branch probability associated with a given edge is its own weight divided by
44 A -> B (edge-weight: 7)
45 A -> C (edge-weight: 8)
81 by a cut edge should equal ``UINT64_MAX``. In other words, mass is conserved
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_features_meaning/ |
| py_features_meaning.markdown | 50 but exact location is still difficult. It is because, along the edge, it is same everywhere. Normal
51 to the edge, it is different. So edge is a much better feature compared to flat area, but not good
61 patch, it looks the same. For black patch, it is an edge. If you move it in vertical direction (i.e.
62 along the gradient) it changes. Put along the edge (parallel to edge), it looks the same. And for
|
| /external/opencv3/modules/stitching/src/ |
| motion_estimators.cpp | 55 void operator ()(const GraphEdge &edge) { dists[edge.to] = dists[edge.from] + 1; }
65 void operator ()(const GraphEdge &edge)
67 int pair_idx = edge.from * num_images + edge.to;
70 K_from(0,0) = cameras[edge.from].focal;
71 K_from(1,1) = cameras[edge.from].focal * cameras[edge.from].aspect;
72 K_from(0,2) = cameras[edge.from].ppx
716 std::pair<int,int> edge = *itr; local
[all...] |
| /frameworks/support/core-ui/tests/java/android/support/v4/testutils/ |
| TestUtilsMatchers.java | 101 * Returns a matcher that matches Views that are aligned to the left / start edge of
127 "not aligned to start (left) edge of parent : left=" +
136 "not aligned to start (right) edge of parent : right=" +
147 * Returns a matcher that matches Views that are aligned to the right / end edge of
173 "not aligned to end (right) edge of parent : right=" +
183 "not aligned to end (left) edge of parent : left=" +
|
