| /external/freetype/src/cff/ |
| cf2blues.h | 43 * Each zone is defined by a top and bottom edge in character space.
61 * alignment point may be adjusted to the scaled flat edge of
63 * curved edge of a zone.
87 CF2_GhostBottom = 0x1, /* a single bottom edge */
88 CF2_GhostTop = 0x2, /* a single top edge */
89 CF2_PairBottom = 0x4, /* the bottom edge of a stem hint */
90 CF2_PairTop = 0x8, /* the top edge of a stem hint */
91 CF2_Locked = 0x10, /* this edge has been aligned */
93 CF2_Synthetic = 0x20 /* this edge was synthesized */
120 CF2_UInt flags; /* attributes of the edge */
[all...] |
| cf2hints.c | 60 size_t j; /* index of upper hint map edge */
142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints
184 /* Now that ghost hints have been detected, adjust this edge for */
321 csCoord >= hintmap->edge[i + 1].csCoord )
325 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
330 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
332 /* special case for points below first edge: use uniform scale */
333 return FT_MulFix( csCoord - hintmap->edge[0].csCoord,
335 hintmap->edge[0].dsCoord;
341 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor
902 CF2_HintRec edge, invalid; local
[all...] |
| cf2blues.c | 152 * features above or below the last hinted edge. This also gives a
275 /* Search for the nearest flat edge in `FamilyBlues' or */
276 /* `FamilyOtherBlues'. According to the Black Book, any matching edge */
293 /* In a bottom zone, the top edge is the flat edge. */
295 /* Family edge that is within the one pixel threshold. */
301 /* top edge */
319 /* top edge */
330 /* In a top zone, the bottom edge is the flat edge. *
[all...] |
| /external/libgdx/extensions/gdx-box2d/gdx-box2d/src/com/badlogic/gdx/physics/box2d/ |
| JointEdge.java | 19 /** A joint edge is used to connect bodies and joints together in a joint graph where each body is a node and each joint is an
20 * edge. A joint edge belongs to a doubly linked list maintained in each attached body. Each joint has two joint nodes, one for
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
| JointEdge.java | 19 /** A joint edge is used to connect bodies and joints together in a joint graph where each body is a node and each joint is an
20 * edge. A joint edge belongs to a doubly linked list maintained in each attached body. Each joint has two joint nodes, one for
|
| EdgeShape.java | 23 /** A line segment (edge) shape. These can be connected in chains or loops to other edge shapes. The connectivity information is
38 /** Set this as an isolated edge. */
46 /** Set this as an isolated edge. */
106 return Type.Edge;
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cff/ |
| cf2blues.h | 43 * Each zone is defined by a top and bottom edge in character space.
61 * alignment point may be adjusted to the scaled flat edge of
63 * curved edge of a zone.
87 CF2_GhostBottom = 0x1, /* a single bottom edge */
88 CF2_GhostTop = 0x2, /* a single top edge */
89 CF2_PairBottom = 0x4, /* the bottom edge of a stem hint */
90 CF2_PairTop = 0x8, /* the top edge of a stem hint */
91 CF2_Locked = 0x10, /* this edge has been aligned */
93 CF2_Synthetic = 0x20 /* this edge was synthesized */
120 CF2_UInt flags; /* attributes of the edge */
[all...] |
| cf2hints.c | 60 size_t j; /* index of upper hint map edge */
142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints
184 /* Now that ghost hints have been detected, adjust this edge for */
321 csCoord >= hintmap->edge[i + 1].csCoord )
325 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
330 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
332 /* special case for points below first edge: use uniform scale */
333 return FT_MulFix( csCoord - hintmap->edge[0].csCoord,
335 hintmap->edge[0].dsCoord;
341 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor
903 CF2_HintRec edge, invalid; local
[all...] |
| cf2blues.c | 152 * features above or below the last hinted edge. This also gives a
275 /* Search for the nearest flat edge in `FamilyBlues' or */
276 /* `FamilyOtherBlues'. According to the Black Book, any matching edge */
293 /* In a bottom zone, the top edge is the flat edge. */
295 /* Family edge that is within the one pixel threshold. */
301 /* top edge */
319 /* top edge */
330 /* In a top zone, the bottom edge is the flat edge. *
[all...] |
| /external/pdfium/third_party/freetype/src/cff/ |
| cf2blues.h | 43 * Each zone is defined by a top and bottom edge in character space.
61 * alignment point may be adjusted to the scaled flat edge of
63 * curved edge of a zone.
87 CF2_GhostBottom = 0x1, /* a single bottom edge */
88 CF2_GhostTop = 0x2, /* a single top edge */
89 CF2_PairBottom = 0x4, /* the bottom edge of a stem hint */
90 CF2_PairTop = 0x8, /* the top edge of a stem hint */
91 CF2_Locked = 0x10, /* this edge has been aligned */
93 CF2_Synthetic = 0x20 /* this edge was synthesized */
120 CF2_UInt flags; /* attributes of the edge */
[all...] |
| cf2hints.c | 60 size_t j; /* index of upper hint map edge */
142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints
184 /* Now that ghost hints have been detected, adjust this edge for */
321 csCoord >= hintmap->edge[i + 1].csCoord )
325 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
330 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
332 /* special case for points below first edge: use uniform scale */
333 return FT_MulFix( csCoord - hintmap->edge[0].csCoord,
335 hintmap->edge[0].dsCoord;
341 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor
902 CF2_HintRec edge, invalid; local
[all...] |
| cf2blues.c | 152 * features above or below the last hinted edge. This also gives a
275 /* Search for the nearest flat edge in `FamilyBlues' or */
276 /* `FamilyOtherBlues'. According to the Black Book, any matching edge */
293 /* In a bottom zone, the top edge is the flat edge. */
295 /* Family edge that is within the one pixel threshold. */
301 /* top edge */
319 /* top edge */
330 /* In a top zone, the bottom edge is the flat edge. *
[all...] |
| /external/skia/src/core/ |
| SkEdgeBuilder.h | 23 // returns the number of built edges. The array of those edge pointers
36 static Combine CombineVertical(const SkEdge* edge, SkEdge* last);
37 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr);
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/diagram/ |
| simpledom.dot | 10 edge [fontname="Inconsolata, Consolas", fontsize=10, arrowhead=normal]
41 edge [arrowhead=vee]
44 edge [arrowhead="none"]
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btBox2dBox2dCollisionAlgorithm.cpp | 117 // Find intersection point of edge and plane
134 // Find the separation between poly1 and poly2 for a give edge normal on poly1.
163 // Find the max separation between poly1 and poly2 using edge normals from poly1.
175 // Find edge normal on poly1 that has the largest projection onto d.
176 int edge = 0; local
179 edge = (int) dLocal1.maxDot( normals1, count1, maxDot);
181 // Get the separation for the edge normal.
182 btScalar s = EdgeSeparation(poly1, xf1, edge, poly2, xf2);
188 // Check the separation for the previous edge normal.
189 int prevEdge = edge - 1 >= 0 ? edge - 1 : count1 - 1
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/autofit/ |
| afhints.c | 95 /* Get new edge for given axis, direction, and position, */
96 /* without initializing the edge itself. */
106 AF_Edge edge = NULL; local
122 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
152 edge = edges + axis->num_edges;
154 while ( edge > edges )
156 if ( edge[-1].fpos < fpos )
159 /* we want the edge with same position and minor direction */
161 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
164 edge[0] = edge[-1]
533 AF_Edge edge; local
1144 AF_Edge edge = seg->edge; local
1170 AF_Edge edge = seg->edge; local
1225 AF_Edge edge; local
[all...] |
| afhints.h | 86 * edges. An edge corresponds to a single position on the main
177 * Experience has shown that points not part of an edge need to be
225 /* edge hint flags */
230 #define AF_EDGE_NEUTRAL ( 1U << 3 ) /* edge aligns to a neutral blue zone */
257 FT_Byte flags; /* edge/segment flags for this segment */
264 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_
265 AF_Segment edge_next; /* link to next segment in parent edge */
273 AF_Point first; /* first point in edge segment */
274 AF_Point last; /* last point in edge segment *
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| DOTGenerator.java | 131 // make a DOT edge for each transition
133 Transition edge = (Transition) s.transition(i); local
136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions());
139 if ( edge.target instanceof DFAState &&
140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES )
145 st = stlib.getInstanceOf("edge");
146 st.add("label", getEdgeLabel(edge));
148 st.add("target", getStateLabel(edge.target));
151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin'
205 // make a DOT edge for each transitio
208 Transition edge = (Transition) s.transition(i); local
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 95 /* Get new edge for given axis, direction, and position, */
96 /* without initializing the edge itself. */
106 AF_Edge edge = NULL; local
122 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
152 edge = edges + axis->num_edges;
154 while ( edge > edges )
156 if ( edge[-1].fpos < fpos )
159 /* we want the edge with same position and minor direction */
161 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
164 edge[0] = edge[-1]
436 AF_Edge edge; local
1044 AF_Edge edge = seg->edge; local
1070 AF_Edge edge = seg->edge; local
1125 AF_Edge edge; local
[all...] |
| afhints.h | 86 * edges. An edge corresponds to a single position on the main
177 * Experience has shown that points not part of an edge need to be
225 /* edge hint flags */
230 #define AF_EDGE_NEUTRAL ( 1U << 3 ) /* edge aligns to a neutral blue zone */
257 FT_Byte flags; /* edge/segment flags for this segment */
264 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_
265 AF_Segment edge_next; /* link to next segment in parent edge */
273 AF_Point first; /* first point in edge segment */
274 AF_Point last; /* last point in edge segment *
[all...] |
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| HorizontalGridView.java | 120 * Sets the fade out left edge to transparent. Note turn on fading edge is very expensive
135 * Returns true if left edge fading is enabled.
142 * Sets the left edge fading length in pixels.
158 * Returns the left edge fading length in pixels.
165 * Sets the distance in pixels between fading start position and left padding edge.
167 * area. Default value is 0, means that the fading starts from left padding edge.
177 * Returns the distance in pixels between fading start position and left padding edge.
179 * area. Default value is 0, means that the fading starts from left padding edge.
186 * Sets the fade out right edge to transparent. Note turn on fading edge is very expensiv
[all...] |
| /art/runtime/gc/accounting/ |
| bitmap-inl.h | 74 // Left edge.
79 // Right edge. Either unique, or left_edge.
83 // Left edge != right edge.
85 // Traverse left edge.
108 // Right edge is unique.
120 // Right edge handling.
|
| /external/pdfium/xfa/src/fxfa/src/app/ |
| xfa_ffpath.cpp | 67 CXFA_Edge edge = lineObj.GetEdge();
local
68 if (edge.IsExistInXML()) {
69 if (edge.GetPresence() != XFA_ATTRIBUTEENUM_Visible) {
72 lineColor = edge.GetColor();
73 iStrokeType = edge.GetStrokeType();
74 fLineWidth = edge.GetThickness();
75 iCap = edge.GetCapType();
|
| /external/skia/samplecode/ |
| SamplePatch.cpp | 81 static void eval_sheet(const SkPoint edge[], int nu, int nv, int iu, int iv,
96 SkScalar x0 = SkScalarMul(UV, edge[TL].fX) + SkScalarMul(uV, edge[TR].fX) +
97 SkScalarMul(Uv, edge[BL].fX) + SkScalarMul(uv, edge[BR].fX);
98 SkScalar y0 = SkScalarMul(UV, edge[TL].fY) + SkScalarMul(uV, edge[TR].fY) +
99 SkScalarMul(Uv, edge[BL].fY) + SkScalarMul(uv, edge[BR].fY);
101 SkScalar x = SkScalarMul(SK_Scalar1 - v, edge[TL+iu].fX)
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
| btConvexHullComputer.cpp | 428 class Edge;
436 Edge* edges;
507 class Edge
510 Edge* next;
511 Edge* prev;
512 Edge* reverse;
517 ~Edge()
526 void link(Edge* n)
763 Pool<Edge> edgePool;
773 static Orientation getOrientation(const Edge* prev, const Edge* next, const Point32& s, const Point32& t)
[all...] |
