| /external/chromium_org/v8/src/ |
| heap-snapshot-generator.h | 123 void add_child(HeapGraphEdge* edge) {
124 children_arr()[children_count_++] = edge;
648 void SerializeEdge(HeapGraphEdge* edge, bool first_edge);
|
| /external/icu4c/common/ |
| stringtriebuilder.cpp | 496 Node *edge=equal[--i]; local
497 if(edge!=NULL) {
498 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step);
500 // For all but the rightmost edge, decrement the edge number.
|
| /external/opencv/cv/src/ |
| cvgeometry.cpp | 130 icvCreateCenterNormalLine( CvSubdiv2DEdge edge, double *_a, double *_b, double *_c )
132 CvPoint2D32f org = cvSubdiv2DEdgeOrg( edge )->pt;
133 CvPoint2D32f dst = cvSubdiv2DEdgeDst( edge )->pt;
|
| /ndk/build/core/ |
| definitions-graph.mk | 272 # 0 edge -> ''
273 # 1 edge -> 'x'
279 # zero the incoming edge counter for module $1
283 # increment the incoming edge counter for module $1
287 # decrement the incoming edge counter for module $1
291 # return non-empty if the module $1's incoming edge counter is > 0
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
| sp_setup.c | 52 * Triangle edge info
54 struct edge { struct
59 int lines; /**< number of lines on this edge */
87 struct edge ebot;
88 struct edge etop;
89 struct edge emaj;
283 * edge fields (ebot, emaj, etop).
708 struct edge *eleft,
709 struct edge *eright,
788 /* edge vectors e = v0 - v2, f = v1 - v2 *
[all...] |
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_setup.c | 52 * Triangle edge info
54 struct edge { struct
59 int lines; /**< number of lines on this edge */
87 struct edge ebot;
88 struct edge etop;
89 struct edge emaj;
283 * edge fields (ebot, emaj, etop).
708 struct edge *eleft,
709 struct edge *eright,
788 /* edge vectors e = v0 - v2, f = v1 - v2 *
[all...] |
| /frameworks/ex/widget/java/com/android/ex/widget/ |
| StaggeredGridView.java | 353 // Break fling velocity if we impacted an edge.
421 EdgeEffectCompat edge = deltaY > 0 ? mTopEdge : mBottomEdge; local
422 edge.onPull((float) Math.abs(deltaY) / getHeight());
555 final EdgeEffectCompat edge; local
557 edge = mTopEdge;
559 edge = mBottomEdge;
561 edge.onAbsorb(Math.abs((int) mScroller.getCurrVelocity()));
878 * @param overhang the number of extra pixels to fill beyond the current top edge
[all...] |
| /external/chromium_org/chrome/browser/ui/gtk/ |
| browser_window_gtk.cc | 2046 GdkWindowEdge edge; local
2090 GdkWindowEdge edge; local
[all...] |
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-r4998.js | 73 // The back edge then merges its virtual frame, which incorrectly
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| loopfilter_filters_altivec.asm | 146 ;# Vertical edge filtering requires transposes. For the simple filter,
216 ;# Normal mb vertical edge filter transpose.
474 ;# add outer taps if we have high edge variance
498 ;# only apply wider filter if not high edge variance
640 ;# edge we run into problems. For the loopfilter we require 4 bytes before the mb
1125 lvx v0, r6, r3 ;# v0 = P1 = 16 pels two rows above edge
1126 lvx v1, r5, r3 ;# v1 = P0 = 16 pels one row above edge
1127 lvx v2, 0, r3 ;# v2 = Q0 = 16 pels one row below edge
1128 lvx v3, r4, r3 ;# v3 = Q1 = 16 pels two rows below edge
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-r4998.js | 73 // The back edge then merges its virtual frame, which incorrectly
|
| /hardware/samsung_slsi/exynos5/libcamera2/ |
| fimc-is-metadata.h | 674 struct camera2_edge_ctl edge; member in struct:camera2_ctl
696 struct camera2_edge_dm edge; member in struct:camera2_dm
|
| /hardware/samsung_slsi/exynos5/original-kernel-headers/linux/ |
| fimc-is-metadata.h | 356 /* android.edge */
724 struct camera2_edge_ctl edge; member in struct:camera2_ctl
743 struct camera2_edge_dm edge; member in struct:camera2_dm
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| CellLayout.java | 1677 int[] edge = getEdge(whichEdge); local
[all...] |
| /packages/apps/Launcher3/src/com/android/launcher3/ |
| CellLayout.java | 1652 int[] edge = getEdge(whichEdge); local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_bigmem.py | 481 edge = '-' * size
482 s = ''.join([edge, '%s', edge])
483 del edge
580 edge = '-' * (size // 2)
581 s = ''.join([edge, SUBSTR, edge])
582 del edge
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_bigmem.py | 481 edge = '-' * size
482 s = ''.join([edge, '%s', edge])
483 del edge
580 edge = '-' * (size // 2)
581 s = ''.join([edge, SUBSTR, edge])
582 del edge
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 424 * A vector used to detect cycles in the edge dependecies. It is used
463 * A method that adds an edge from one node to another. An edge
475 void (*addEdge) (struct ANTLR3_TOPO_struct * topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
481 * is only as large as the largest node index you created an edge for. This means
482 * that if you had an input of 32 nodes, but that largest node with an edge
496 * on the previously supplied edge data.
|
| /external/chromium/chrome/browser/ui/gtk/ |
| browser_window_gtk.h | 160 // a window manager "feature" that can prevent this in some edge cases.
405 // it should and sets |edge|.
406 bool GetWindowEdge(int x, int y, GdkWindowEdge* edge);
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 116 static void addEdge (pANTLR3_TOPO topo, ANTLR3_UINT32 edge, ANTLR3_UINT32 dependency);
[all...] |
| /external/opencv/cxcore/include/ |
| cxcore.h | 1243 CvGraphEdge* edge; \/* current edge *\/ member in struct:CvGraphScanner
[all...] |
| cxtypes.h | [all...] |
| /prebuilts/devtools/tools/lib/ |
| jfreechart-1.0.9.jar | |
| /prebuilts/tools/common/jfreechart/ |
| jfreechart-1.0.9.jar | |
| /prebuilts/tools/common/m2/repository/jfree/jfreechart/1.0.9/ |
| jfreechart-1.0.9.jar | |
