/external/webkit/Source/WebCore/platform/graphics/ |
FloatPoint.cpp | 88 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection) 100 intersection.setX(p1.x()); 101 intersection.setY(dSlope * intersection.x() + dOffset); 105 intersection.setX(d1.x()); 106 intersection.setY(pSlope * intersection.x() + pOffset); 110 // Find x at intersection, where ys overlap; x = (c' - c) / (m - m') 111 intersection.setX((dOffset - pOffset) / (pSlope - dSlope)); 112 intersection.setY(pSlope * intersection.x() + pOffset) [all...] |
FloatPoint.h | 208 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection);
|
FloatRect.h | 193 inline FloatRect intersection(const FloatRect& a, const FloatRect& b) function in namespace:WebCore
|
/external/chromium/chrome/browser/autofill/ |
form_group.cc | 44 FieldTypeSet a, b, intersection; local 49 std::inserter(intersection, intersection.begin())); 51 // An empty intersection can't have equal values. 52 if (intersection.empty()) 55 for (FieldTypeSet::const_iterator iter = intersection.begin(); 56 iter != intersection.end(); ++iter) { 66 FieldTypeSet a, b, intersection; local 71 std::inserter(intersection, intersection.begin())) [all...] |
/development/tools/emulator/opengl/host/libs/Translator/GLcommon/ |
RangeManip.cpp | 78 Range intersection; 82 // if there is intersection 83 if (r.rangeIntersection(list[i],intersection)) { 88 if (intersection!=old) { // otherwise split: 89 //intersection on right side 90 if(old.getStart() != intersection.getStart()) { 91 list.insert(list.begin(),Range(old.getStart(),intersection.getStart() - old.getStart())); 94 //intersection on left side 95 if(old.getEnd() != intersection.getEnd()) { 96 list.insert(list.begin(),Range(intersection.getEnd(),old.getEnd() - intersection.getEnd())) [all...] |
/external/chromium/chrome/browser/bookmarks/ |
bookmark_index.cc | 207 NodeSet intersection; local 210 std::inserter(intersection, intersection.begin())); 211 if (intersection.empty()) { 215 match->nodes.swap(intersection); 226 NodeSet intersection; local 229 std::inserter(intersection, intersection.begin())); 230 if (!intersection.empty()) { 235 combined_match.nodes.swap(intersection); [all...] |
/external/chromium/chrome/browser/sync/ |
backend_migrator.cc | 117 ModelTypeSet intersection; local 120 std::inserter(intersection, intersection.end())); 122 // The intersection check is to determine if our disable request was 129 (state_ == DISABLING_TYPES && !intersection.empty())) {
|
/external/webkit/Tools/Scripts/ |
webkit-patch | 48 if set(["-v", "--verbose"]).intersection(set(sys.argv)):
|
/external/wpa_supplicant_8/src/p2p/ |
p2p_go_neg.c | 46 struct p2p_channels intersection; local 84 p2p_channels_intersect(own, &dev->channels, &intersection); 86 "peer reg_classes %d intersection reg_classes %d", 89 (int) intersection.reg_classes); 90 if (intersection.reg_classes == 0) { 297 struct p2p_channels *intersection) 313 p2p_channels_includes(intersection, op_reg_class, op_channel)) { 315 "channel (reg_class %u channel %u) from intersection", 325 p2p_channels_includes(intersection, op_reg_class, op_channel)) { 327 "channel (reg_class %u channel %u) from intersection", 585 struct p2p_channels intersection; local 968 struct p2p_channels intersection; local [all...] |
p2p_invitation.c | 116 struct p2p_channels intersection, *channels = NULL; local 200 &intersection); 201 if (!p2p_channels_includes(&intersection, reg_class, channel)) 211 channels = &intersection; 227 &intersection); 231 channels = &intersection;
|
/external/webkit/Source/WebKit2/UIProcess/qt/ |
TiledDrawingAreaTileQt.cpp | 82 IntRect tileDirtyRect = intersection(dirtyRect, m_rect); 111 IntRect target = intersection(rect, m_rect);
|
/external/webkit/Tools/Scripts/webkitpy/common/net/ |
failuremap.py | 69 if revision_set.intersection(
|
/external/webkit/Source/WebCore/platform/graphics/qt/ |
TileQt.cpp | 87 IntRect tileDirtyRect = intersection(dirtyRect, m_rect); 147 IntRect target = intersection(rect, m_rect);
|
/dalvik/dexgen/src/com/android/dexgen/rop/code/ |
RegisterSpecSet.java | 311 * instance. The intersection consists of the pairwise 317 * the intersection; if {@code true}, then the only non-null 337 RegisterSpec intersection = local 339 if (intersection != spec) { 340 specs[i] = intersection;
|
/dalvik/dx/src/com/android/dx/rop/code/ |
RegisterSpecSet.java | 310 * instance. The intersection consists of the pairwise 316 * the intersection; if {@code true}, then the only non-null 336 RegisterSpec intersection = local 338 if (intersection != spec) { 339 specs[i] = intersection;
|
/external/webkit/Source/WebKit2/WebProcess/WebPage/ |
PageOverlay.cpp | 103 IntRect paintRect = intersection(dirtyRect, bounds());
|
/external/chromium/chrome/browser/instant/ |
instant_loader.cc | [all...] |
/external/qemu/distrib/sdl-1.2.12/src/video/ |
SDL_surface.c | 331 * A function to calculate the intersection of two rectangles: 335 SDL_bool SDL_IntersectRect(const SDL_Rect *A, const SDL_Rect *B, SDL_Rect *intersection) 339 /* Horizontal intersection */ 346 intersection->x = Amin; 349 intersection->w = Amax - Amin > 0 ? Amax - Amin : 0; 351 /* Vertical intersection */ 358 intersection->y = Amin; 361 intersection->h = Amax - Amin > 0 ? Amax - Amin : 0; 363 return (intersection->w && intersection->h) [all...] |
/frameworks/base/test-runner/src/android/test/ |
MoreAsserts.java | 197 Set<Object> intersection = new HashSet<Object>(expected); local 198 intersection.retainAll(actual); 203 + "\nIntersection: " + intersection);
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
IncludeOverlay.java | 112 Rectangle h = hole.intersection(r);
|
/sdk/sdkmanager/libs/sdkuilib/src/com/android/sdkuilib/internal/repository/sdkman2/ |
ShellSizeAndPos.java | 71 Rectangle i = area.intersection(r);
|
/external/guava/src/com/google/common/collect/ |
Multisets.java | 327 * Returns an unmodifiable <b>view</b> of the intersection of two multisets. 339 public static <E> Multiset<E> intersection( 351 return Sets.intersection(
|
/external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/ |
PKIXCertPathValidatorSpi.java | 510 PKIXPolicyNode intersection = RFC3280CertPathUtilities.wrapupCertG(certPath, paramsPKIX, userInitialPolicySet, local 513 if ((explicitPolicy > 0) || (intersection != null)) 515 return new PKIXCertPathValidatorResult(trust, intersection, cert.getPublicKey());
|
/external/opencv/cvaux/src/ |
cv3dtracker.cpp | 65 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1, 476 // find the intersection of the two lines (or the points of closest 478 if (!intersection(p1a, p1b, p2a, p2b, r1, r2)) 518 // Find the intersection of two lines, or if they don't intersect, 523 static bool intersection(CvPoint3D32f o1, CvPoint3D32f p1, function
|
/external/webkit/Tools/Scripts/webkitpy/tool/commands/ |
rebaselineserver.py | 273 extensions_to_move = current_extensions.intersection( 276 if extensions_to_move.intersection(
|