| /external/pdfium/xfa/fwl/theme/ |
| cfwl_edittp.cpp | 27 CXFA_Edge edge = borderUI.GetEdge(0); local
28 if (edge) {
29 cr = edge.GetColor();
30 fWidth = edge.GetThickness();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 28 /** the edge of the dragged node that is matched */
31 /** the "other" edge that the dragged edge is matched with */
32 public final Segment edge; field in class:Match
50 * @param edge the "other" edge that the dragged edge is matched with
51 * @param with the edge of the dragged node that is matched
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
59 this.edge = edge
[all...] |
| 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...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim
53 s->edge(s->priv, TRUE);
75 s->edge(s->priv, FALSE);
|
| /external/pdfium/xfa/fxfa/parser/ |
| cxfa_box.cpp | 36 CXFA_Edge edge = local
37 CXFA_Edge(pNode->GetProperty(i, XFA_Element::Edge, i == 0));
38 if (edge || i == 0) {
39 (*strokes)[j] = edge;
93 return m_pNode->CountChildren(XFA_Element::Edge);
98 m_pNode ? m_pNode->GetProperty(nIndex, XFA_Element::Edge, nIndex == 0)
|
| /system/update_engine/payload_generator/ |
| cycle_breaker.cc | 39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
85 // add a subgraph_ edge
110 Edge min_edge = make_pair(stack_[0], stack_[1]);
115 Edge edge = make_pair(*it, *(it + 1)); local
116 if (cut_edges_.find(edge) != cut_edges_.end()) {
120 uint64_t edge_weight = graph_utils::EdgeWeight(subgraph_, edge);
123 min_edge = edge;
148 Edge edge = make_pair(*(it - 1), *it) local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 98 * It can yield states that have only a single edge on EOT to an accept
105 * for keyword versus ID as the state with EOT edge emanating from it will
106 * also have another edge.
192 Transition edge = (Transition) d.transition(i); local
193 DFAState edgeTarget = ((DFAState)edge.target);
196 edge.label.toString(d.dfa.nfa.grammar)+"->"+
221 Transition edge = (Transition) d.transition(i); local
222 DFAState edgeTarget = ((DFAState)edge.target);
225 edge.label.toString(d.dfa.nfa.grammar)+"->"+
228 // if only one edge coming out, it is EOT, and target is accept prun
[all...] |
| LL1DFA.java | 39 * predicates to resolve edge set collisions.
43 * an LL(1) DFA. One edge per set.
87 IntervalSet edge = (IntervalSet)it.next(); local
88 List<Integer> alts = edgeMap.get(edge);
90 //System.out.println(edge+" -> "+alts);
93 Label e = getLabelForSet(edge);
|
| /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/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| 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/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/opencv/cvaux/src/ |
| cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ) local
[all...] |
| /external/pdfium/xfa/fxfa/app/ |
| xfa_ffpath.cpp | 69 CXFA_Edge edge = lineObj.GetEdge(); local
70 if (edge) {
71 if (edge.GetPresence() != XFA_ATTRIBUTEENUM_Visible)
74 lineColor = edge.GetColor();
75 iStrokeType = edge.GetStrokeType();
76 fLineWidth = edge.GetThickness();
77 iCap = edge.GetCapType();
|
| xfa_ffpushbutton.cpp | 123 CXFA_Edge edge = border.GetEdge(0); local
124 return edge.GetThickness();
|
| /external/swiftshader/third_party/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/v8/src/compiler/ |
| control-equivalence.cc | 103 Edge edge = *entry.input; local
104 Node* input = edge.to();
106 if (NodeProperties::IsControlEdge(edge)) {
133 Edge edge = *entry.use; local
134 Node* use = edge.from();
136 if (NodeProperties::IsControlEdge(edge)) {
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/widget/ |
| StaggeredGridDefault.java | 25 * Returns the max edge value of item (visible or cached) in a row. This
33 int edge = mProvider.getEdge(mFirstVisibleIndex); local
35 return edge;
39 edge += loc.offset;
41 return edge;
45 int edge = mProvider.getEdge(mLastVisibleIndex); local
48 return edge + loc.size;
51 edge -= loc.offset;
54 return edge + loc.size;
62 * Returns the min edge value of item (visible or cached) in a row. Thi
70 int edge = mProvider.getEdge(mLastVisibleIndex); local
83 int edge = mProvider.getEdge(mFirstVisibleIndex); local
105 int edge = mProvider.getEdge(indexLimit); local
157 int edge = mProvider.getEdge(indexLimit); local
[all...] |
| SingleRow.java | 81 int edge; local
83 edge = mReversedFlow ? Integer.MIN_VALUE : Integer.MAX_VALUE;
87 edge = mProvider.getEdge(index + 1) + mSpacing + size;
89 edge = mProvider.getEdge(index + 1) - mSpacing - size;
93 mProvider.addItem(mTmpItem[0], index, size, 0, edge);
114 int edge; local
116 edge = mReversedFlow ? Integer.MAX_VALUE : Integer.MIN_VALUE;
120 edge = mProvider.getEdge(index - 1) - mProvider.getSize(index - 1) - mSpacing;
122 edge = mProvider.getEdge(index - 1) + mProvider.getSize(index - 1) + mSpacing;
126 mProvider.addItem(mTmpItem[0], index, size, 0, edge);
[all...] |
| /packages/apps/DocumentsUI/src/com/android/documentsui/ |
| DrawerController.java | 123 View edge = layout.findViewById(R.id.drawer_edge); local
124 edge.setOnDragListener(new ItemDragListener<>(this, SPRING_TIMEOUT));
|
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) {
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
25 if (edge->fWinding == last->fWinding) {
26 if (edge->fLastY + 1 == last->fFirstY) {
27 last->fFirstY = edge->fFirstY;
30 if (edge->fFirstY == last->fLastY + 1) {
31 last->fLastY = edge->fLastY;
36 if (edge->fFirstY == last->fFirstY) {
37 if (edge->fLastY == last->fLastY) {
40 if (edge->fLastY < last->fLastY)
124 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); local
142 SkEdge* edge = fAlloc.make<SkEdge>(); local
164 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); local
171 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); local
182 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); local
189 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); local
255 char* edge = fAnalyticAA ? (char*)fAlloc.makeArrayDefault<SkAnalyticEdge>(maxEdgeCount) local
[all...] |
| /frameworks/data-binding/compiler/src/main/java/android/databinding/tool/solver/ |
| ExecutionPath.java | 80 ExecutionBranch edge = new ExecutionBranch(path, pred, expectedValue); local
87 mTrueBranch = edge;
93 mFalseBranch = edge;
|
| /frameworks/support/design/jvm-tests/src/android/support/design/widget/ |
| DirectedAcyclicGraphTest.java | 66 final TestNode edge = new TestNode("edge"); local
69 mGraph.addNode(edge);
70 mGraph.addEdge(node, edge);
76 final TestNode edge = new TestNode("edge"); local
78 // Add the node, but not the edge node
82 mGraph.addEdge(node, edge);
88 final TestNode edge = new TestNode("edge"); local
102 final TestNode edge = new TestNode("edge"); local
118 final TestNode edge = new TestNode("edge"); local
137 final TestNode edge = new TestNode("edge"); local
153 final TestNode edge = new TestNode("edge"); local
[all...] |
| /bionic/libc/kernel/uapi/linux/ |
| pps.h | 77 int edge; member in struct:pps_bind_args
|
| /development/ndk/platforms/android-21/include/linux/ |
| pps.h | 77 int edge; member in struct:pps_bind_args
|
