Examples of intersect()

Examples of org.jaitools.imageutils.ROIGeometry.intersect()

610
611
612
613
614
615
616
617
618
619
620
                final ROI footprint = result.getFootprint();
                if (footprint != null) {
                    if (imageROI.contains(footprint.getBounds2D().getBounds())) {
                        imageROI = footprint;
                    } else {
                        imageROI = imageROI.intersect(footprint);
                    }
                }
               
                // ARTIFACTS FILTERING
                if (defaultArtifactsFilterThreshold != Integer.MIN_VALUE && result.isDoFiltering()){
View Full Code Here

Examples of org.libreplan.business.calendars.entities.AvailabilityTimeLine.Interval.intersect()

409
410
411
412
413
414
415
416
417
418
419
                startInclusive, endExclusive);

        List<Interval> result = new ArrayList<Interval>();
        for (Interval each : getIntervalsThisAllocationInterferesWith(criterion)) {
            if (queryInterval.overlaps(each)) {
                result.add(queryInterval.intersect(each));
            }
        }
        return result;
    }
View Full Code Here

Examples of org.neo4j.support.versioning.Range.intersect()

71
72
73
74
75
76
77
78
79
80
81
    @Test
    public void intersectShouldGiveIdentityForSameRange()
    {
        Range range = range( 1, 3 );
        assertEquals( range, range.intersect( range ) );
    }

    ////// union ///////

    @Test
View Full Code Here

Examples of org.pdf4j.saxon.sort.IntHashSet.intersect()

137
138
139
140
141
142
143
144
145
146
147
                    NodeTest elementTest = ((DocumentNodeTest)contextItemType).getElementTest();
                    IntHashSet requiredNames = elementTest.getRequiredNodeNames();
                    if (requiredNames != null) {
                        // check that the name appearing in the step is one of the names allowed by the nodetest
                        IntHashSet selected = test.getRequiredNodeNames();
                        if (selected != null && selected.intersect(requiredNames).isEmpty()) {
                            env.issueWarning("Starting at a document node, the step is selecting an element whose name " +
                                    "is not among the names of child elements permitted for this document node type", this);

                            return Literal.makeEmptySequence();
                        }
View Full Code Here

Examples of org.terasology.math.Rect2i.intersect()

622
623
624
625
626
627
628
629
630
631
632
        Rect2i drawRegion = relativeToAbsolute(region);
        if (!state.cropRegion.overlaps(drawRegion)) {
            return;
        }

        renderer.drawMesh(mesh, material, drawRegion, drawRegion.intersect(state.cropRegion), rotation, offset, scale, state.getAlpha());
    }

    @Override
    public void drawMesh(Mesh mesh, Texture texture, Rect2i region, Quat4f rotation, Vector3f offset, float scale) {
        meshMat.setTexture("texture", texture);
View Full Code Here

Examples of org.tmatesoft.svn.core.SVNMergeRangeList.intersect()

486
487
488
489
490
491
492
493
494
495
496
        for (Iterator pathsIter = mergeInfo1.keySet().iterator(); pathsIter.hasNext();) {
            String path = (String) pathsIter.next();
            SVNMergeRangeList rangeList1 = (SVNMergeRangeList) mergeInfo1.get(path);
            SVNMergeRangeList rangeList2 = (SVNMergeRangeList) mergeInfo2.get(path);
            if (rangeList2 != null) {
                rangeList2 = rangeList2.intersect(rangeList1, true);
                if (!rangeList2.isEmpty()) {
                    mergeInfo.put(path, rangeList2);
                }
            }
        }
View Full Code Here

Examples of pivot.wtk.Bounds.intersect()

430
431
432
433
434
435
436
437
438
439
440
        public void paint(Graphics2D graphics) {
            // Determine the paint bounds
            Bounds paintBounds = new Bounds(0, 0, getWidth(), getHeight());
            Rectangle clipBounds = graphics.getClipBounds();
            if (clipBounds != null) {
                paintBounds.intersect(new Bounds(clipBounds));
            }

            for (NodeView nodeView : nodeViews) {
                Bounds nodeViewBounds = nodeView.getBounds(false);
View Full Code Here

Examples of se.llbit.math.Quad.intersect()

45
46
47
48
49
50
51
52
53
54
55
  };

  public static boolean intersect(Ray ray) {
    Quad quad = quads[ray.getBlockData() % 4];
    ray.t = Double.POSITIVE_INFINITY;
    if (quad.intersect(ray)) {
      float[] color = Texture.ladder.getColor(ray.u, ray.v);
      if (color[3] > Ray.EPSILON) {
        ray.color.set(color);
        ray.n.set(quad.n);
        ray.distance += ray.tNear;
View Full Code Here

Examples of se.llbit.math.Triangle.intersect()

235
236
237
238
239
240
241
242
243
244
245
    int c0 = (0xF & (data >> 16)) % 8;
    int c1 = (0xF & (data >> 20)) % 8;
    int c2 = (0xF & (data >> 24)) % 8;
    int c3 = (0xF & (data >> 28)) % 8;
    Triangle triangle = t012[c0][c1][c2];
    if (triangle.intersect(ray)) {
      ray.n.set(triangle.n);
      ray.n.scale(QuickMath.signum(-ray.d.dot(triangle.n)));
      ray.t = ray.tNear;
      hit = true;
    }
View Full Code Here

Examples of ucar.ma2.Section.intersect()

120
121
122
123
124
125
126
127
128
129
130
          if (dataSection.intersects(want)) // does it intersect ?
            break;
        }

        if (debug)
          System.out.println(" found intersecting dataSection: " + dataSection+" intersect= "+dataSection.intersect(want));

        index = new IndexChunkerTiled(dataSection, want); // new indexer into this chunk
        next = new Chunk( dataChunk.getByteBuffer()); // this does the uncompression

      } catch (InvalidRangeException e) {
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.