Searched refs:pair2 (Results 1 – 12 of 12) sorted by relevance
/external/clang/test/CodeGenCXX/ |
D | constructor-init.cpp | 184 struct pair2 { struct 193 pair2 &operator=(const pair2&) = default; 201 pair2 &operator=(pair2&&) = default; 225 pair2(pair2&&) = default; 227 pair2(const pair2&) = default; 235 void foo(const pair &x, const pair2 &x2) { in foo() 237 pair2 y2(x2); in foo() 238 pair2 y2m(static_cast<pair2&&>(y2)); in foo() 241 y2m = static_cast<pair2&&>(y2); in foo()
|
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/ |
D | Pair.java | 35 public int compareTo(Pair pair2) { in compareTo() argument 36 if (this.proxyIdA < pair2.proxyIdA) { in compareTo() 40 if (this.proxyIdA == pair2.proxyIdA) { in compareTo() 41 return proxyIdB < pair2.proxyIdB ? -1 : proxyIdB == pair2.proxyIdB ? 0 : 1; in compareTo()
|
/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
D | b2BroadPhase.h | 137 b2Pair* pair2 = (b2Pair*) elem2; in b2PairCompareQSort() local 139 if (pair1->proxyIdA < pair2->proxyIdA) in b2PairCompareQSort() 144 if (pair1->proxyIdA == pair2->proxyIdA) in b2PairCompareQSort() 146 if( pair1->proxyIdB < pair2->proxyIdB ) { in b2PairCompareQSort() 149 else if(pair1->proxyIdB > pair2->proxyIdB) { in b2PairCompareQSort() 163 inline bool b2PairLessThan(const b2Pair& pair1, const b2Pair& pair2) in b2PairLessThan() argument 165 if (pair1.proxyIdA < pair2.proxyIdA) in b2PairLessThan() 170 if (pair1.proxyIdA == pair2.proxyIdA) in b2PairLessThan() 172 return pair1.proxyIdB < pair2.proxyIdB; in b2PairLessThan()
|
/external/pdfium/third_party/freetype/src/type1/ |
D | t1afm.c | 90 AFM_KernPair pair2 = (AFM_KernPair)b; in compare_kern_pairs() local 93 FT_ULong index2 = KERN_INDEX( pair2->index1, pair2->index2 ); in compare_kern_pairs()
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/type1/ |
D | t1afm.c | 90 AFM_KernPair pair2 = (AFM_KernPair)b; in compare_kern_pairs() local 93 FT_ULong index2 = KERN_INDEX( pair2->index1, pair2->index2 ); in compare_kern_pairs()
|
/external/lzma/CPP/7zip/UI/Common/ |
D | Update.cpp | 792 CUpdatePair2 &pair2 = updatePairs2[i]; in Compress() local 794 if (pair2.NewProps && pair2.DirIndex >= 0) in Compress() 795 ft2 = &dirItems.Items[pair2.DirIndex].MTime; in Compress() 796 else if (pair2.UseArcProps && pair2.ArcIndex >= 0) in Compress() 797 ft2 = &arcItems[pair2.ArcIndex].MTime; in Compress()
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/pfr/ |
D | pfrtypes.h | 205 FT_UInt32 pair2; member
|
D | pfrload.c | 673 item->pair2 = PFR_KERN_INDEX( char1, char2 ); in pfr_extra_item_load_kerning_pairs() 687 item->pair2 = PFR_KERN_INDEX( char1, char2 ); in pfr_extra_item_load_kerning_pairs()
|
D | pfrobjs.c | 510 if ( pair >= item->pair1 && pair <= item->pair2 ) in pfr_face_get_kerning()
|
/external/freetype/src/pfr/ |
D | pfrload.c | 573 item->pair2 = PFR_KERN_INDEX( char1, char2 ); in pfr_extra_item_load_kerning_pairs() 587 item->pair2 = PFR_KERN_INDEX( char1, char2 ); in pfr_extra_item_load_kerning_pairs()
|
/external/pdfium/core/src/fxge/win32/ |
D | fx_win32_gdipext.cpp | 1081 int pair2 = pairs[i * 2 + 1]; in IsSmallTriangle() local 1082 FX_FLOAT x1 = points[pair1].X, x2 = points[pair2].X; in IsSmallTriangle() 1083 FX_FLOAT y1 = points[pair1].Y, y2 = points[pair2].Y; in IsSmallTriangle()
|
/external/valgrind/helgrind/ |
D | libhb_core.c | 4102 const ULong_n_EC* pair2 ) in cmp__ULong_n_EC__by_ULong() argument 4104 if (pair1->ull < pair2->ull) return -1; in cmp__ULong_n_EC__by_ULong() 4105 if (pair1->ull > pair2->ull) return 1; in cmp__ULong_n_EC__by_ULong()
|