HomeSort by relevance Sort by last modified time
    Searched refs:getEdge (Results 1 - 25 of 49) sorted by null

1 2

  /frameworks/support/leanback/src/main/java/androidx/leanback/widget/
SingleRow.java 87 edge = mProvider.getEdge(index + 1) + mSpacing + size;
89 edge = mProvider.getEdge(index + 1) - mSpacing - size;
120 edge = mProvider.getEdge(index - 1) - mProvider.getSize(index - 1) - mSpacing;
122 edge = mProvider.getEdge(index - 1) + mProvider.getSize(index - 1) + mSpacing;
147 nearestEdge = mProvider.getEdge(mFirstVisibleIndex)
157 nearestEdge = mProvider.getEdge(mLastVisibleIndex)
180 return mReversedFlow ? mProvider.getEdge(indexLimit) - mProvider.getSize(indexLimit)
181 : mProvider.getEdge(indexLimit);
190 return mReversedFlow ? mProvider.getEdge(indexLimit)
191 : mProvider.getEdge(indexLimit) + mProvider.getSize(indexLimit)
    [all...]
Grid.java 106 int getEdge(int index);
416 boolean offEnd = !mReversedFlow ? mProvider.getEdge(mLastVisibleIndex) >= toLimit
417 : mProvider.getEdge(mLastVisibleIndex) <= toLimit;
437 ? mProvider.getEdge(mFirstVisibleIndex) + size <= toLimit
438 : mProvider.getEdge(mFirstVisibleIndex) - size >= toLimit;
473 edge = mProvider.getEdge(lastPos) - mProvider.getSize(lastPos) - mSpacing;
475 edge = mProvider.getEdge(lastPos) + mProvider.getSize(lastPos) + mSpacing;
501 edge = mProvider.getEdge(firstPos);
503 edge = mProvider.getEdge(firstPos);
StaggeredGrid.java 147 edge = mProvider.getEdge(mFirstVisibleIndex);
185 edge = mProvider.getEdge(itemIndex);
246 int oldFirstEdge = mProvider.getEdge(mFirstIndex);
304 edge = mProvider.getEdge(mLastVisibleIndex);
340 edge = mProvider.getEdge(itemIndex);
379 offset = location - mProvider.getEdge(mLastVisibleIndex);
  /frameworks/support/leanback/src/androidTest/java/androidx/leanback/widget/
SingleRowTest.java 62 assertEquals(mProvider.getEdge(0), 0);
63 assertEquals(mProvider.getEdge(1), 100);
64 assertEquals(mProvider.getEdge(2), 200);
65 assertEquals(mProvider.getEdge(3), 250);
66 assertEquals(mProvider.getEdge(4), 370);
67 assertEquals(mProvider.getEdge(5), 430);
107 assertEquals(mProvider.getEdge(0), 0);
108 assertEquals(mProvider.getEdge(1), -100);
109 assertEquals(mProvider.getEdge(2), -200);
110 assertEquals(mProvider.getEdge(3), -250)
    [all...]
GridTest.java 64 public int getEdge(int index) {
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h 114 EdgeEntry& getEdge(EdgeItr eItr) { return *eItr; }
115 const EdgeEntry& getEdge(ConstEdgeItr eItr) const { return *eItr; }
127 EdgeEntry &ne = getEdge(edgeItr);
219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); }
225 return getEdge(eItr).getCosts();
233 void setEdgeData(EdgeItr eItr, void *data) { getEdge(eItr).setData(data); }
238 void* getEdgeData(EdgeItr eItr) { return getEdge(eItr).getData(); }
283 return getEdge(eItr).getNode1();
290 return getEdge(eItr).getNode2();
298 EdgeEntry &e = getEdge(eItr)
    [all...]
  /external/swiftshader/third_party/LLVM/lib/Analysis/
ProfileInfo.cpp 75 Edge e = getEdge(0, BB);
85 double w = getEdgeWeight(getEdge(P, BB));
102 Edge e = getEdge(BB,0);
109 double w = getEdgeWeight(getEdge(BB, *SI));
260 Edge e = getEdge(BB,*Succ);
300 Edge e = getEdge(Parent,BB);
335 newedge = getEdge(DestBB, e.second);
343 newedge = getEdge(e.first, DestBB);
352 Edge newedge = getEdge(DestBB, DestBB);
376 Edge e = getEdge(FirstBB, SecondBB)
    [all...]
ProfileEstimatorPass.cpp 134 Edge edge = getEdge(*bbi,BB);
205 Edge edge = getEdge(Latch,0);
208 edge = getEdge(Latch, BB);
242 Edge e = getEdge(Parent, Dest);
267 Edge edge = getEdge(BB,0);
273 Edge edge = getEdge(BB,*bbi);
341 Edge edge = getEdge(0,entry);
372 Edge e = getEdge(*bbi,BB);
406 Edge e = getEdge(0,BB);
410 Edge e = getEdge(*predi,BB)
    [all...]
ProfileInfoLoaderPass.cpp 164 readEdge(getEdge(0,&F->getEntryBlock()), Counters);
168 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
185 readEdge(getEdge(0,&F->getEntryBlock()), Counters);
189 readEdge(getEdge(BB,0), Counters);
192 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
ProfileVerifierPass.cpp 104 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(*bbi,BB);
119 typename ProfileInfoT<FType, BType>::Edge E = PI->getEdge(BB,*bbi);
250 DI.inWeight += ReadOrAssert(PI->getEdge(0,BB));
255 DI.inWeight += ReadOrAssert(PI->getEdge(*bpi,BB));
266 double w = PI->getEdgeWeight(PI->getEdge(BB,0));
273 DI.outWeight += ReadOrAssert(PI->getEdge(BB,*bbi));
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 89 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
231 EdgeEntry &NE = getEdge(EId);
519 getEdge(EId).Costs = AllocatedCosts;
531 return getEdge(EId).Costs;
538 return *getEdge(EId).Costs;
542 return getEdge(EId).Metadata;
546 return getEdge(EId).Metadata;
553 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 90 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
187 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
188 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
216 EdgeEntry &NE = getEdge(EId);
500 getEdge(EId).Costs = AllocatedCosts;
512 return getEdge(EId).Costs;
519 return *getEdge(EId).Costs;
523 return getEdge(EId).Metadata;
527 return getEdge(EId).Metadata;
534 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 90 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
187 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
188 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
216 EdgeEntry &NE = getEdge(EId);
500 getEdge(EId).Costs = AllocatedCosts;
512 return getEdge(EId).Costs;
519 return *getEdge(EId).Costs;
523 return getEdge(EId).Metadata;
527 return getEdge(EId).Metadata;
534 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/
Graph.h 88 G.getEdge(AdjEdgeIds.back()).setAdjEdgeIdx(ThisNId, Idx);
190 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; }
191 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
219 EdgeEntry &NE = getEdge(EId);
513 getEdge(EId).Costs = AllocatedCosts;
525 return getEdge(EId).Costs;
532 return *getEdge(EId).Costs;
536 return getEdge(EId).Metadata;
540 return getEdge(EId).Metadata;
547 return getEdge(EId).getN1Id()
    [all...]

Completed in 1080 milliseconds

1 2