/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | ParametrizedLine.h | 85 Scalar intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane); 132 /** \returns the parameter value of the intersection between \c *this and the given hyperplane 135 inline _Scalar ParametrizedLine<_Scalar, _AmbientDim>::intersection(const Hyperplane<_Scalar, _AmbientDim>& hyperplane) function in class:Eigen::ParametrizedLine
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SetOperationsTest.java | 36 * Unit tests for {@link Sets#union}, {@link Sets#intersection} and 132 return Sets.intersection( 143 return Sets.intersection( 154 return Sets.intersection( 158 .named("intersection of disjoint") 165 return Sets.intersection( 176 return Sets.intersection( 181 .named("intersection with overlap of one") 284 Set<String> frenemies = Sets.intersection(friends, enemies); 288 = Sets.intersection(friend [all...] |
H A D | ContiguousSetTest.java | 267 assertEquals(ImmutableSet.of(), set.intersection(emptySet)); 268 assertEquals(ImmutableSet.of(), emptySet.intersection(set)); 269 assertEquals(ImmutableSet.of(), Ranges.closed(-5, -1).asSet(integers()).intersection( 275 assertEquals(ImmutableSet.of(1, 2, 3), Ranges.open(-1, 4).asSet(integers()).intersection(set)); 276 assertEquals(ImmutableSet.of(1, 2, 3), set.intersection(Ranges.open(-1, 4).asSet(integers())));
|
/external/chromium-trace/trace-viewer/build/ |
H A D | check_grit.py | 36 i = set(grit_files).intersection(set(known_images))
|
H A D | check_gyp.py | 31 i = set(gyp_files).intersection(set(known_files))
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | ClipRect.h | 77 inline ClipRect intersection(const ClipRect& a, const ClipRect& b) function in namespace:blink
|
H A D | RenderLayerClipper.cpp | 80 clipRects.setOverflowClipRect(intersection(newOverflowClip, clipRects.overflowClipRect())); 82 clipRects.setPosClipRect(intersection(newOverflowClip, clipRects.posClipRect())); 87 clipRects.setPosClipRect(intersection(newClip, clipRects.posClipRect())); 88 clipRects.setOverflowClipRect(intersection(newClip, clipRects.overflowClipRect())); 89 clipRects.setFixedClipRect(intersection(newClip, clipRects.fixedClipRect()));
|
/external/chromium_org/third_party/WebKit/Tools/Scripts/ |
H A D | webkit-patch | 74 if set(["-v", "--verbose"]).intersection(set(sys.argv)):
|
/external/deqp/framework/delibs/decpp/ |
H A D | deSTLUtil.cpp | 63 set<int> si = intersection(s1, s2);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | RegularContiguousSet.java | 46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive))) 58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), 64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive))) 130 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:RegularContiguousSet
|
H A D | EmptyContiguousSet.java | 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
H A D | Range.java | 94 * the definition of {@link #intersection}. 290 * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is 295 * <p>Generally, the intersection exists if and only if this range and 298 * <p>The intersection operation has the following properties: 301 * <li>commutative: {@code a.intersection(b)} produces the same result as 302 * {@code b.intersection(a)} 303 * <li>associative: {@code a.intersection(b).intersection(c)} produces the 304 * same result as {@code a.intersection(b.intersection( 313 public Range<C> intersection(Range<C> other) { method in class:Range [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | EmptyContiguousSet.java | 47 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
/external/chromium_org/third_party/freetype/src/cff/ |
H A D | cf2hints.c | 1079 * intersection on the corresponding lines. 1080 * Return false if no intersection is found, or if the intersection is 1090 FT_Vector* intersection ) 1137 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); 1138 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); 1150 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) 1151 intersection->x = u1->x; 1153 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) 1154 intersection 1205 FT_Vector intersection = { 0, 0 }; local [all...] |
/external/freetype/src/cff/ |
H A D | cf2hints.c | 1111 * intersection on the corresponding lines. 1112 * Return false if no intersection is found, or if the intersection is 1122 FT_Vector* intersection ) 1169 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); 1170 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); 1182 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) 1183 intersection->x = u1->x; 1185 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) 1186 intersection 1241 FT_Vector intersection = { 0, 0 }; local [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/cff/ |
H A D | cf2hints.c | 1093 * intersection on the corresponding lines. 1094 * Return false if no intersection is found, or if the intersection is 1104 FT_Vector* intersection ) 1151 intersection->x = u1->x + FT_MulFix( s, u2->x - u1->x ); 1152 intersection->y = u1->y + FT_MulFix( s, u2->y - u1->y ); 1164 cf2_fixedAbs( intersection->x - u1->x ) < glyphpath->snapThreshold ) 1165 intersection->x = u1->x; 1167 cf2_fixedAbs( intersection->y - u1->y ) < glyphpath->snapThreshold ) 1168 intersection 1219 FT_Vector intersection = { 0, 0 }; local [all...] |
/external/chromium_org/chrome/browser/sync/ |
H A D | backend_migrator.cc | 157 const ModelTypeSet intersection = local 159 // This intersection check is to determine if our disable request 161 if (state_ == DISABLING_TYPES && !intersection.Empty()) {
|
/external/chromium_org/third_party/WebKit/Source/bindings/scripts/ |
H A D | compute_global_objects.py | 65 global_keys = GLOBAL_EXTENDED_ATTRIBUTES.intersection(
|
/external/chromium_org/pdf/ |
H A D | paint_aggregator.cc | 168 pp::Rect intersection = local 172 pp::Rect leftover = rect.Subtract(intersection); 181 update_.paint_rects[i] = ScrollPaintRect(intersection, amount);
|
/external/chromium_org/third_party/WebKit/Source/platform/scroll/ |
H A D | ScrollbarThemeMacCommon.mm | 146 context->fillRect(intersection(horizontalOverhangRect, dirtyRect)); 148 context->fillRect(intersection(verticalOverhangRect, dirtyRect)); 215 context->fillRect(intersection(shadowRect, dirtyRect)); 225 context->fillRect(intersection(shadowRect, dirtyRect)); 243 context->fillRect(intersection(shadowRect, dirtyRect)); 253 context->fillRect(intersection(shadowRect, dirtyRect));
|
/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | RegisterSpecSet.java | 310 * instance. The intersection consists of the pairwise 316 * the intersection; if {@code true}, then the only non-null 336 RegisterSpec intersection = 338 if (intersection != spec) { 339 specs[i] = intersection;
|
/external/chromium_org/v8/src/ |
H A D | hydrogen-check-elimination.cc | 393 MapSet intersection = instr->maps()->Intersect( local 395 if (intersection->size() == 0) { 402 entry->maps_ = intersection; 408 if (intersection->size() != instr->maps()->size()) { 420 check->set_maps(intersection); 428 instr->set_maps(intersection); 592 // TODO(bmeurer): Add a predicate here instead of computing the intersection 593 MapSet intersection = le->maps_->Intersect(re->maps_, zone()); local 594 if (intersection->size() > 0) return; 616 MapSet intersection local [all...] |
/external/chromium_org/cc/quads/ |
H A D | draw_polygon.cc | 22 // comparison purposes. The splitting operation will produce intersection points 161 gfx::Point3F* intersection, 173 intersection->SetPoint(line_start.x(), line_start.y(), line_start.z()); 186 intersection->SetPoint(line_start.x() + (v.x() * lerp_factor), 249 // intersection. 251 // which resulted in the line/plane intersection giving us intersections[0]. 257 // We will only have two intersection points because we assume all polygons 268 // We found both intersection points so we're done already. 279 // Since we found both the intersection points, we can begin building the 157 LineIntersectPlane(const gfx::Point3F& line_start, const gfx::Point3F& line_end, const gfx::Point3F& plane_origin, const gfx::Vector3dF& plane_normal, gfx::Point3F* intersection, float distance_threshold) argument
|
/external/chromium_org/remoting/base/ |
H A D | util.cc | 290 webrtc::DesktopRect intersection(a); 291 intersection.IntersectWith(b); 292 return intersection.equals(b);
|
/external/chromium_org/remoting/codec/ |
H A D | video_decoder_vpx.cc | 236 webrtc::DesktopRegion intersection(source_rect); 237 intersection.IntersectWith(updated_region_); 238 if (intersection.is_empty())
|