/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/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/legacy/src/core/ |
SkEdgeBuilder.cpp | 24 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local 25 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) { 26 fList.push(edge); 28 // TODO: unallocate edge from storage... 33 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local 34 if (edge->setQuadratic(pts, fShiftUp)) { 35 fList.push(edge); 37 // TODO: unallocate edge from storage... 42 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local 43 if (edge->setCubic(pts, NULL, fShiftUp)) [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/Analysis/ |
ProfileDataLoaderPass.cpp | 65 virtual void readEdge(unsigned, ProfileData&, ProfileData::Edge, 92 /// readEdge - Take the value from a profile counter and assign it to an edge. 94 ProfileData &PB, ProfileData::Edge e, 102 DEBUG(dbgs() << "-- Read Edge Counter for " << e 107 /// matchEdges - Link every profile counter with an edge. 131 /// edge into branch weights for each conditional branch (a branch with 2 or 152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); local 153 Weights[s] = (uint32_t)PB.getEdgeWeight(edge); 154 DEBUG(dbgs() << "---- Edge '" << edge << "' has weight [all...] |
PathProfileInfo.cpp | 185 // add block to the block list if it is a real edge 188 // make the back edge the last edge since we are at the end 203 BallLarusEdge* edge = getNextEdge(root, _number); local 205 if( edge && (edge->getType() == BallLarusEdge::BACKEDGE_PHONY || 206 edge->getType() == BallLarusEdge::SPLITEDGE_PHONY) ) 207 return edge->getTarget()->getBlock();
|
ProfileEstimatorPass.cpp | 38 std::map<Edge,double> MinimalWeight; 71 void inline printEdgeWeight(Edge); 101 static void inline printEdgeError(ProfileInfo::Edge e, const char *M) { 102 DEBUG(dbgs() << "-- Edge " << e << " is not calculated, " << M << "\n"); 105 void inline ProfileEstimatorPass::printEdgeWeight(Edge E) { 106 DEBUG(dbgs() << "-- Weight of Edge " << E << ":" 116 // flow, once an edge has a flow assigned this flow is never changed again, 134 Edge edge = getEdge(*bbi,BB); local 135 double w = getEdgeWeight(edge); 205 Edge edge = getEdge(Latch,0); local 267 Edge edge = getEdge(BB,0); local 273 Edge edge = getEdge(BB,*bbi); local 341 Edge edge = getEdge(0,entry); local [all...] |
/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/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/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
SDL_sysevents.cc | 195 BPoint edge; local 196 GetXYOffset(edge.x, edge.y); 197 edge.x += x; 198 edge.y += y; 199 ConvertToScreen(&edge); 200 set_mouse_position((int)edge.x, (int)edge.y);
|
/external/skia/src/core/ |
SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local 27 if (edge->setLine(pts[0], pts[1], fShiftUp)) { 28 fList.push(edge); 30 // TODO: unallocate edge from storage... 35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local 36 if (edge->setQuadratic(pts, fShiftUp)) { 37 fList.push(edge); 39 // TODO: unallocate edge from storage... 44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local 45 if (edge->setCubic(pts, NULL, fShiftUp)) 100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local [all...] |
/external/ceres-solver/internal/ceres/ |
graph_algorithms.h | 174 // empty edge set. We then iterate over the edges of G in decreasing 217 // edge>. Sorting it using the reverse iterators gives us the edges 224 const pair<Vertex, Vertex>& edge = weighted_edges[i].second; local 225 const Vertex vertex1 = edge.first; 226 const Vertex vertex2 = edge.second; 229 // which case adding this edge will violate the degree 2 239 // vertex, and adding this edge will create a cycle. 247 // This edge can be added, add an edge in either direction with
|
/external/bison/src/ |
lalr.c | 162 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local 182 edge[nedges++] = map_goto (stateno, sym); 190 memcpy (reads[i], edge, nedges * sizeof edge[0]); 202 free (edge); 221 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local 263 edge[nedges++] = map_goto (states1[--length], 278 includes[i][j] = edge[j] [all...] |
/external/icu4c/common/ |
stringtriebuilder.cpp | 500 Node *edge=equal[--i]; local 501 if(edge!=NULL) { 502 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step); 504 // For all but the rightmost edge, decrement the edge number.
|
/external/quake/quake/src/QW/client/ |
r_edge.c | 31 this breaks spans at every edge, even hidden ones (bad) 71 void R_LeadingEdge (edge_t *edge); 72 void R_LeadingEdgeBackwards (edge_t *edge); 73 void R_TrailingEdge (surf_t *surf, edge_t *edge); 169 sentinel at the end (actually, this is the active edge table starting at 270 // pull the edge out of the edge list 274 // find out where the edge goes in the edge list 282 // put the edge back into the edge lis 590 edge_t *edge; local 629 edge_t *edge; local [all...] |
/external/quake/quake/src/WinQuake/ |
r_edge.cpp | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge back into the edge list 590 edge_t *edge; local 629 edge_t *edge; local [all...] |
/prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
coretypes.h | 141 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
/prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
coretypes.h | 141 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
/prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
coretypes.h | 141 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|
/prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
coretypes.h | 141 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
|