| /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...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/ |
| FloatPoint.cpp | 119 bool findIntersection(const FloatPoint& p1, const FloatPoint& p2, const FloatPoint& d1, const FloatPoint& d2, FloatPoint& intersection)
131 intersection.setX(p1.x());
132 intersection.setY(dSlope * intersection.x() + dOffset);
136 intersection.setX(d1.x());
137 intersection.setY(pSlope * intersection.x() + pOffset);
141 // Find x at intersection, where ys overlap; x = (c' - c) / (m - m')
142 intersection.setX((dOffset - pOffset) / (pSlope - dSlope));
143 intersection.setY(pSlope * intersection.x() + pOffset)
[all...] |
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/picking/ |
| BresenhamTerrainPicker.java | 99 final Vector3f intersection = new Vector3f(); local
104 checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit);
105 float distance = worldPickRay.origin.distance(intersection);
106 CollisionResult cr = new CollisionResult(intersection, distance);
110 return intersection;
119 // check the triangles of main square for intersection.
121 if (checkTriangles(loc.x, loc.y, workRay, intersection, patch, hit)) {
122 // we found an intersection, so return that!
123 float distance = worldPickRay.origin.distance(intersection);
124 CollisionResult cr = new CollisionResult(intersection, distance)
[all...] |
| /sdk/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/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LookaheadSet.java | 76 public LookaheadSet intersection(LookaheadSet s) { method in class:LookaheadSet
78 LookaheadSet intersection = new LookaheadSet(i); local
79 return intersection;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| PolygonShape.cpp | 142 FloatPoint intersection; local
150 if (prevOffsetEdge.intersection(thisOffsetEdge, intersection))
151 paddedVertices->append(intersection);
163 FloatPoint intersection; local
171 if (prevOffsetEdge.intersection(thisOffsetEdge, intersection))
172 marginVertices->append(intersection);
205 static inline bool getVertexIntersectionVertices(const EdgeIntersection& intersection, FloatPoint& prevVertex, FloatPoint& thisVertex, FloatPoint& nextVertex)
207 if (intersection.type != VertexMinY && intersection.type != VertexMaxY
252 EdgeIntersection intersection; local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| IntervalSet.java | 263 // will be ignored since we are doing this & ~other. The intersection
398 /** Return a new set with the intersection of this set with other. Because
410 IntervalSet intersection = null; local
429 // overlap, add intersection, get next theirs
430 if ( intersection==null ) {
431 intersection = new IntervalSet();
433 intersection.add(mine.intersection(theirs));
437 // overlap, add intersection, get next mine
438 if ( intersection==null )
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| RangeTest.java | 342 assertEquals(range, range.intersection(range));
345 range.intersection(Ranges.open(3, 5));
350 range.intersection(Ranges.closed(0, 2));
358 assertEquals(range, range.intersection(range));
361 range.intersection(Ranges.atMost(3)));
363 range.intersection(Ranges.atLeast(4)));
366 range.intersection(Ranges.lessThan(3));
371 range.intersection(Ranges.greaterThan(4));
378 range.intersection(Ranges.greaterThan(4)));
383 assertEquals(range, range.intersection(range))
[all...] |
| 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(friends, enemies).immutableCopy()
[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_org/chrome/browser/bookmarks/ |
| bookmark_index.cc | 215 NodeSet intersection; local
218 std::inserter(intersection, intersection.begin()));
219 if (intersection.empty()) {
223 match->nodes.swap(intersection);
234 NodeSet intersection; local
237 std::inserter(intersection, intersection.begin()));
238 if (!intersection.empty()) {
243 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/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| RegularContiguousSet.java | 44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
128 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method
|
| /external/jmonkeyengine/engine/src/test/jme3test/terrain/ |
| TerrainTestModifyHeight.java | 105 Vector3f intersection = getWorldIntersection(); local
106 updateHintText(intersection);
110 if (intersection != null) {
111 adjustHeight(intersection, 64, tpf * 60);
114 if (intersection != null) {
115 adjustHeight(intersection, 64, -tpf * 60);
119 if (terrain != null && intersection != null) {
120 float h = terrain.getHeight(new Vector2f(intersection.x, intersection.z));
122 marker.setLocalTranslation(tl.add(new Vector3f(intersection.x, h, intersection.z)) )
[all...] |
| /external/wpa_supplicant_8/src/p2p/ |
| p2p_invitation.c | 164 struct p2p_channels intersection, *channels = NULL; local
225 &intersection);
231 &go, group_bssid, &op_freq, persistent, &intersection);
244 if (!p2p_channels_includes(&intersection, reg_class, channel))
253 channels = &intersection;
272 p2p_channels_includes(&intersection,
284 if (!p2p_channels_includes(&intersection, p2p->op_reg_class,
286 p2p_dbg(p2p, "Initially selected channel (op_class %d channel %d) not in channel intersection - try to reselect",
288 p2p_reselect_channel(p2p, &intersection);
291 if (!p2p_channels_includes(&intersection,
382 struct p2p_channels intersection, *channels = NULL; local
[all...] |
| p2p_go_neg.c | 40 struct p2p_channels intersection; local
76 p2p_channels_intersect(own, &dev->channels, &intersection);
77 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
80 (int) intersection.reg_classes);
81 if (intersection.reg_classes == 0) {
327 * @intersection: Support channel list intersection from local and peer
336 struct p2p_channels *intersection)
346 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
347 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
473 struct p2p_channels intersection; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| ImageBitmap.cpp | 40 IntRect srcRect = intersection(cropRect, IntRect(0, 0, image->width(), image->height()));
58 IntRect srcRect = intersection(cropRect, videoRect);
78 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), canvasSize));
94 IntRect srcRect = intersection(cropRect, IntRect(IntPoint(), data->size()));
113 IntRect srcRect = intersection(cropRect, oldBitmapRect);
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/features/ |
| FeatureUtil.java | 236 intersection(allPresentFeatures, allAbsentFeatures);
281 conflictingFeatures = intersection(newFeatures, earlierFeatures);
292 * Construct a new {@link java.util.Set} that is the intersection
297 public static <T> Set<T> intersection( method in class:FeatureUtil
299 return intersection(new Set[] {set1, set2});
303 * Construct a new {@link java.util.Set} that is the intersection
306 * @return the intersection of the sets
310 public static <T> Set<T> intersection(Set<? extends T> ... sets) { method in class:FeatureUtil
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/models/ |
| test_configuration.py | 165 return reduce(set.intersection, matching_sets.values())
186 if macro_set.intersection(specifier_set) == macro_set:
223 return reduce(set.intersection, [set(specifiers) for specifiers in combination])
228 intersection = iterable[0]
231 intersection = intersection.intersection(item)
232 return union - intersection
|
| /external/eigen/Eigen/src/Eigen2Support/Geometry/ |
| 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/chromium-trace/trace-viewer/build/ |
| check_grit.py | 36 i = set(grit_files).intersection(set(known_images))
|
| check_gyp.py | 31 i = set(gyp_files).intersection(set(known_files))
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/ |
| webkit-patch | 74 if set(["-v", "--verbose"]).intersection(set(sys.argv)):
|
| /external/chromium_org/ui/compositor/ |
| layer_animation_sequence.cc | 180 LayerAnimationElement::AnimatableProperties intersection; local
182 intersection, intersection.begin());
186 return (intersection.size() > 0);
|
| /external/guava/guava/src/com/google/common/collect/ |
| 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
|
