Examples of intersect()

Examples of com.meidusa.amoeba.sqljep.function.Comparative.intersect()

45
46
47
48
49
50
51
52
53
54
55
    if (source == null || limit1 == null || limit2 == null) {
      return (Boolean.FALSE);
    } else {
      if (source instanceof Comparative) {
        Comparative other = (Comparative) source;
        boolean result = other.intersect(
            Comparative.GreaterThanOrEqual, limit1,
            ComparativeComparator.comparator);
        result = result
            && other.intersect(Comparative.LessThanOrEqual, limit2,
                ComparativeComparator.comparator);
View Full Code Here

Examples of com.salesforce.phoenix.query.KeyRange.intersect()

428
429
430
431
432
433
434
435
436
437
438
                    return DEGENERATE_KEY_PARTS;
                }
                if (childSlot.getMinMaxRange() != null) {
                    // TODO: potentially use KeySlot.intersect here. However, we can't intersect the key ranges in the slot
                    // with our minMaxRange, since it spans columns and this would mess up our skip scan.
                    minMaxRange = minMaxRange.intersect(childSlot.getMinMaxRange());
                    for (KeySlot slot : childSlot) {
                        minMaxExtractNodes.addAll(slot.getKeyPart().getExtractNodes());
                    }
                } else {
                    for (KeySlot slot : childSlot) {
View Full Code Here

Examples of com.thinkaurelius.titan.core.attribute.Geoshape.intersect()

27
28
29
30
31
32
33
34
35
36
37
    @Test
    public void testIntersection() {
        for (int i=0;i<50;i++) {
            Geoshape point = Geoshape.point(i,i);
            Geoshape circle = Geoshape.circle(0.0,0.0,point.getPoint().distance(Geoshape.point(0,0).getPoint())+10);
            assertTrue(circle.intersect(point));
            assertTrue(point.intersect(circle));
            assertTrue(circle.intersect(circle));
        }
    }
View Full Code Here

Examples of eas.simulation.spatial.sim2D.physicalSimulation.physicsEngine.net.phys2d.raw.collide.IntersectionGatherer.intersect()

97
98
99
100
101
102
103
104
105
106
107
    sweep.addVerticesToSweep(false, vertsB);
    int[][] collEdgeCands = sweep.getOverlappingEdges();
   
    IntersectionGatherer intGath = new IntersectionGatherer(vertsA, vertsB);
    for ( int i = 0; i < collEdgeCands.length; i++ )
      intGath.intersect(collEdgeCands[i][0], collEdgeCands[i][1]);
   
    Intersection[] intersections = intGath.getIntersections();
   
    return populateContacts(contacts, vertsA, vertsB, intersections);
  }
View Full Code Here

Examples of eas.simulation.spatial.sim2D.physicalSimulation.physicsEngine.net.phys2d.raw.shapes.Line.intersect()

268
269
270
271
272
273
274
275
276
277
278
    end.add(norm);
   
    rightLine.move(bodyA.getPosition());
    leftLine.move(bodyA.getPosition());
    Line normLine = new Line(start,end);
    Vector2f rightPoint = normLine.intersect(rightLine);
    Vector2f leftPoint = normLine.intersect(leftLine);
   
    float dis1 = Float.MAX_VALUE;
    if (rightPoint != null) {
      dis1 = rightPoint.distance(start) - norm.length();
View Full Code Here

Examples of edu.mit.csail.sdg.alloy4compiler.ast.Sig.PrimSig.intersect()

184
185
186
187
188
189
190
191
192
193
194
         */
        ProductType join(ProductType that) {
            int left=types.length, right=that.types.length, n=left+right-2;
            if (left<=1 && right<=1) return zero; // We try to do the best we can, in the face of precondition violation
            if (n<0) throw new OutOfMemoryError(); // This means the addition overflowed!
            final PrimSig a=types[left-1], b=that.types[0], c=a.intersect(b);
            if (c==NONE) return new ProductType(n, c);
            final PrimSig[] types = new PrimSig[n];
            int j=0;
            for(int i=0; i<left-1; i++, j++) { types[j]=this.types[i]; }
            for(int i=1; i<right; i++, j++)  { types[j]=that.types[i]; }
View Full Code Here

Examples of gov.nasa.worldwind.globes.EllipsoidalGlobe.intersect()

464
465
466
467
468
469
470
471
472
473
474
        // Find intersection of screen coord ref-point with globe.
        double x = screenRefPoint.x + dx;
        double y = dragEvent.getMouseEvent().getComponent().getSize().height - screenRefPoint.y + dy - 1;
        Line ray = view.computeRayFromScreenPoint(x, y);
        Intersection inters[] = globe.intersect(ray, refPos.getElevation());

        if (inters != null)
        {
            // Intersection with globe. Move reference point to the intersection point.
            Position p = globe.computePositionFromPoint(inters[0].getIntersectionPoint());
View Full Code Here

Examples of heart.alsvfd.Value.intersect()

296
297
298
299
300
301
302
303
304
305
306
            formulaCertainty = -getMinCF(((SetValue)attributeValue).getValues());
          }
        }else if(op.equals(Formulae.OP_SUPSET)){
          if(logicalValue == true){
            //return the weakest chain element that makes it superset
            SetValue intersection = (SetValue) attributeValue.intersect( v,at.getType());
            formulaCertainty = getMinCF(intersection.getValues());
          }else{
            SetValue comp = getComplement(at, v, wm);
            SetValue intersect = (SetValue) attributeValue.intersect( comp,at.getType());
            // return  how the {Domain\value} is similar to the attribute value
View Full Code Here

Examples of java.awt.geom.Area.intersect()

91
92
93
94
95
96
97
98
99
100
101
        final Area a = new Area(chartEntity.getArea());
        if (buggyDrawArea)
        {
          a.transform(AffineTransform.getTranslateInstance(dataArea.getX(), dataArea.getY()));
        }
        a.intersect(new Area(dataArea));
        graphics2D.draw(a);
      }
      else
      {
        graphics2D.draw(chartEntity.getArea());
View Full Code Here

Examples of java.awt.geom.Area.intersect()

195
196
197
198
199
200
201
202
203
204
205
                        // Depending on the performance cost, we might
                        // want to make it permanent.

                        if (precise) {
                            Area clone = (Area) area.clone();
                            clone.intersect(new Area(omgShape));
                            if (!clone.isEmpty()) {
                                outsideFilter = false;
                            }
                        } else {
                            outsideFilter = false;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.