HomeSort by relevance Sort by last modified time
    Searched refs:edge (Results 51 - 75 of 298) sorted by null

1 23 4 5 6 7 8 91011>>

  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
ACyclicDFACodeGenerator.java 99 Transition edge = (Transition) s.transition(i); local
100 //System.out.println("edge "+s.stateNumber+"-"+edge.label.toString()+"->"+edge.target.stateNumber);
101 if ( edge.label.getAtom()==Label.EOT ) {
102 // don't generate a real edge for EOT; track alt EOT predicts
104 EOTTarget = (DFAState)edge.target;
108 edge.target.stateNumber+" predicates alt "+
116 List labels = edge.label.getSet().toList();
127 parentGenerator.genLabelExpr(templates,edge,k))
    [all...]
  /external/chromium_org/ui/views/widget/
monitor_win.cc 27 HWND GetTopmostAutoHideTaskbarForEdge(UINT edge, HMONITOR monitor) {
29 APPBARDATA taskbar_data = { sizeof(APPBARDATA), NULL, 0, edge };
  /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/
PolygonShape.h 42 Edge,
47 OffsetPolygonEdge(const FloatPolygonEdge& edge, const FloatSize& offset)
48 : m_vertex1(edge.vertex1() + offset)
49 , m_vertex2(edge.vertex2() + offset)
50 , m_edgeIndex(edge.edgeIndex())
51 , m_basis(Edge)
  /external/freetype/src/autofit/
afhints.c 77 /* Get new edge for given axis, direction, and position. */
87 AF_Edge edge = NULL; local
95 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
119 if ( edge[-1].fpos < fpos )
122 /* we want the edge with same position and minor direction */
124 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
127 edge[0] = edge[-1]
379 AF_Edge edge; local
849 AF_Edge edge = seg->edge; local
875 AF_Edge edge = seg->edge; local
930 AF_Edge edge; local
    [all...]
  /external/chromium_org/third_party/freetype/src/autofit/
afhints.c 66 /* Get new edge for given axis, direction, and position. */
76 AF_Edge edge = NULL; local
84 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
108 if ( edge[-1].fpos < fpos )
111 /* we want the edge with same position and minor direction */
113 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
116 edge[0] = edge[-1]
359 AF_Edge edge; local
827 AF_Edge edge = seg->edge; local
853 AF_Edge edge = seg->edge; local
908 AF_Edge edge; local
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkRegion_path.cpp 344 struct Edge {
355 Edge* fNext;
372 static void find_link(Edge* base, Edge* stop) {
375 if (base->fFlags == Edge::kCompleteLink) {
385 Edge* e = base;
386 if ((base->fFlags & Edge::kY0Link) == 0) {
389 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
392 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
399 if ((base->fFlags & Edge::kY1Link) == 0)
    [all...]
  /external/dropbear/libtomcrypt/src/pk/asn1/der/set/
der_encode_setof.c 20 struct edge { struct
27 struct edge *A = (struct edge *)a, *B = (struct edge *)b;
66 struct edge *edges;
  /external/skia/src/core/
SkRegion_path.cpp 344 struct Edge {
355 Edge* fNext;
372 static void find_link(Edge* base, Edge* stop) {
375 if (base->fFlags == Edge::kCompleteLink) {
385 Edge* e = base;
386 if ((base->fFlags & Edge::kY0Link) == 0) {
389 if ((e->fFlags & Edge::kY1Link) == 0 && y0 == e->fY1) {
392 e->fFlags = SkToU8(e->fFlags | Edge::kY1Link);
399 if ((base->fFlags & Edge::kY1Link) == 0)
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/
MoveHandler.java 49 * different segment types -- the left edge, the right edge, the baseline, the center
210 Segment edge = new Segment(b.y, b.x, b.x2(), null, null, TOP, NO_MARGIN); local
211 List<Match> horizontalMatches = findClosest(edge, mHorizontalEdges);
212 edge = new Segment(b.y2(), b.x, b.x2(), null, null, BOTTOM, NO_MARGIN);
213 addClosest(edge, mHorizontalEdges, horizontalMatches);
215 edge = new Segment(b.x, b.y, b.y2(), null, null, LEFT, NO_MARGIN);
216 List<Match> verticalMatches = findClosest(edge, mVerticalEdges);
217 edge = new Segment(b.x2(), b.y, b.y2(), null, null, RIGHT, NO_MARGIN);
218 addClosest(edge, mVerticalEdges, verticalMatches)
    [all...]
GuidelineHandler.java 95 /** Whether the left edge is being moved/resized */
98 /** Whether the right edge is being moved/resized */
101 /** Whether the top edge is being moved/resized */
104 /** Whether the bottom edge is being moved/resized */
178 * The current match on the left edge, or null if no match or if the left edge is not
184 * The current match on the top edge, or null if no match or if the top edge is not
190 * The current match on the right edge, or null if no match or if the right edge i
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/
JSHeapSnapshot.js 75 function filter(edge) {
76 if (edge.isInvisible())
80 return !edge.isHidden() && !edge.node().isHidden();
88 function filter(edge)
90 return containmentEdgesFilter(edge) && !edge.node().isRoot() && !edge.isWeak();
107 var edge = iter.edge;
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/
FloatRect.h 101 void shiftXEdgeTo(float edge)
103 float delta = edge - x();
104 setX(edge);
107 void shiftMaxXEdgeTo(float edge)
109 float delta = edge - maxX();
112 void shiftYEdgeTo(float edge)
114 float delta = edge - y();
115 setY(edge);
118 void shiftMaxYEdgeTo(float edge)
120 float delta = edge - maxY()
    [all...]
IntRect.h 96 void shiftXEdgeTo(int edge)
98 int delta = edge - x();
99 setX(edge);
102 void shiftMaxXEdgeTo(int edge)
104 int delta = edge - maxX();
107 void shiftYEdgeTo(int edge)
109 int delta = edge - y();
110 setY(edge);
113 void shiftMaxYEdgeTo(int edge)
115 int delta = edge - maxY()
    [all...]
LayoutRect.h 109 void shiftXEdgeTo(LayoutUnit edge)
111 LayoutUnit delta = edge - x();
112 setX(edge);
115 void shiftMaxXEdgeTo(LayoutUnit edge)
117 LayoutUnit delta = edge - maxX();
120 void shiftYEdgeTo(LayoutUnit edge)
122 LayoutUnit delta = edge - y();
123 setY(edge);
126 void shiftMaxYEdgeTo(LayoutUnit edge)
128 LayoutUnit delta = edge - maxY()
    [all...]
FloatPolygon.cpp 135 FloatPolygonEdge* edge = &m_edges[i];
136 m_edgeTree.add(EdgeInterval(edge->minY(), edge->maxY(), edge));
147 const FloatPolygonEdge* edge = static_cast<const FloatPolygonEdge*>(overlappingEdgeIntervals[i].data());
148 ASSERT(edge);
149 result[i] = edge;
  /external/llvm/lib/Transforms/Instrumentation/
OptimalEdgeProfiling.cpp 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===//
10 // This pass instruments the specified program with counters for edge profiling.
11 // Edge profiling can give a reasonable approximation of the hot paths through a
15 #define DEBUG_TYPE "insert-optimal-edge-profiling"
49 return "Optimal Edge Profiler";
55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
56 "Insert optimal instrumentation for edge profiling",
60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling",
61 "Insert optimal instrumentation for edge profiling",
68 inline static void printEdgeCounter(ProfileInfo::Edge e
150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local
    [all...]
  /external/chromium_org/chrome/browser/ui/gtk/
gtk_window_util.cc 85 GdkCursorType GdkWindowEdgeToGdkCursorType(GdkWindowEdge edge) {
86 switch (edge) {
264 GdkWindowEdge* edge) {
283 *edge = GDK_WINDOW_EDGE_NORTH_WEST;
285 *edge = GDK_WINDOW_EDGE_NORTH_EAST;
287 *edge = GDK_WINDOW_EDGE_NORTH;
290 *edge = GDK_WINDOW_EDGE_SOUTH_WEST;
292 *edge = GDK_WINDOW_EDGE_SOUTH_EAST;
294 *edge = GDK_WINDOW_EDGE_SOUTH;
297 *edge = GDK_WINDOW_EDGE_WEST
    [all...]
gtk_window_util.h 26 // the 16 px at the end of each edge triggers diagonal resizing.
39 // Returns the resize cursor corresponding to the window |edge|.
40 GdkCursorType GdkWindowEdgeToGdkCursorType(GdkWindowEdge edge);
50 // a window manager "feature" that can prevent this in some edge cases.
71 // returns true and sets |edge| to the appropriate GdkWindowEdge value.
73 // |top_edge_inset| specifies how much smaller (in px) than the default edge
74 // size the top edge should be, used by browser windows to make it easier to
80 GdkWindowEdge* edge);
  /external/chromium_org/ash/wm/workspace/
snap_sizer.h 27 enum Edge {
42 Edge edge,
47 static void SnapWindow(aura::Window* window, Edge edge);
62 // Returns the target bounds based on the edge and the provided |size_index|.
78 // Returns the target bounds based on the edge and |size_index_|.
81 // Returns true if the specified point is along the edge of the screen.
87 const Edge edge_;
  /external/chromium_org/content/browser/android/
edge_effect.h 27 enum Edge {
35 EdgeEffect(scoped_refptr<cc::Layer> edge, scoped_refptr<cc::Layer> glow);
46 void ApplyToLayers(gfx::SizeF size, Edge edge);
edge_effect.cc 44 // How much dragging should effect the height of the edge image.
77 gfx::Transform ComputeTransform(EdgeEffect::Edge edge,
79 switch (edge) {
104 EdgeEffect::Edge edge,
110 layer->SetTransform(ComputeTransform(edge, size, height));
117 EdgeEffect::EdgeEffect(scoped_refptr<cc::Layer> edge,
119 : edge_(edge)
229 // The edge should always be at least partially visible, regardles
    [all...]
  /external/clang/utils/analyzer/
ubiviz 35 elif action == 'edge':
38 edge = G.new_edge(src,dst)
40 G.set_edge_attribute(edge, attribute[0], attribute[1])
  /external/llvm/utils/
profile.pl 12 # -edge - Enable edge profiling
20 my $ProfilePass = "-insert-edge-profiling";
33 if (/^-?-edge$/) { $ProfilePass = "-insert-edge-profiling"; next; }
47 print " -edge - Enable edge profiling\n";
  /external/libpcap/
gencode.h 221 struct edge { struct
227 struct edge *next; /* link list of incoming edges for a node */
240 struct edge et;
241 struct edge ef;
246 struct edge *in_edges;
  /frameworks/base/core/java/android/gesture/
Gesture.java 142 public Path toPath(int width, int height, int edge, int numSample) {
143 return toPath(null, width, height, edge, numSample);
146 public Path toPath(Path path, int width, int height, int edge, int numSample) {
153 path.addPath(strokes.get(i).toPath(width - 2 * edge, height - 2 * edge, numSample));
180 * @param edge the edge
185 public Bitmap toBitmap(int width, int height, int edge, int numSample, int color) {
189 canvas.translate(edge, edge);
    [all...]

Completed in 2792 milliseconds

1 23 4 5 6 7 8 91011>>