Examples of intersect()


Examples of org.apache.cxf.ws.policy.Intersector.intersect()

        NestedPrimitiveAssertion na = (NestedPrimitiveAssertion)a;
        NestedPrimitiveAssertion nb = (NestedPrimitiveAssertion)b;       
       
        Intersector intersector = new Intersector(assertionBuilderRegistry);
       
        Policy nested = intersector.intersect(na.getNested(), nb.getNested());       
        if (null == nested) {
            return  null;
        }
       
        NestedPrimitiveAssertion compatible =
View Full Code Here

Examples of org.apache.harmony.awt.ClipRegion.intersect()

        Rectangle visibleRect = getComponentVisibleRect(effectiveRoot, new Rectangle(effectiveRoot.getWidth(), effectiveRoot.getHeight()));
        if (rect instanceof ClipRegion) {
            ClipRegion repaintRegion = (ClipRegion)rect;
            repaintRegion.convertRegion(this, effectiveRoot);
            repaintRegion.intersect(visibleRect);

            if (repaintRegion.isEmpty()) {
                return;
            }
View Full Code Here

Examples of org.apache.harmony.awt.gl.MultiRectArea.intersect()

        r.translate(x, y);
        MultiRectArea ret = parent.getObscuredRegion(r);
        if (ret != null) {
            parent.addObscuredRegions(ret, this);
            ret.translate(-x, -y);
            ret.intersect(new Rectangle(0, 0, w, h));
        }
        return ret;
    }

    private void readObject(ObjectInputStream stream) throws IOException,
View Full Code Here

Examples of org.apache.lucene.index.Terms.intersect()

      }
      BytesRef term;
      int ord = 0;

      Automaton automaton = new RegExp(".*", RegExp.NONE).toAutomaton();   
      final TermsEnum termsEnum2 = terms.intersect(new CompiledAutomaton(automaton, false, false), null);

      while((term = termsEnum.next()) != null) {
        BytesRef term2 = termsEnum2.next();
        assertNotNull(term2);
        assertEquals(term, term2);
View Full Code Here

Examples of org.apache.phoenix.query.KeyRange.intersect()

                }
                // FIXME: get rid of this min/max range BS now that a key range can span multiple columns
                if (childSlot.getMinMaxRange() != null) { // Only set if in initial pk position
                    // 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 org.apache.pivot.wtk.Bounds.intersect()

        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 = paintBounds.intersect(new Bounds(clipBounds));
            }

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

Examples of org.apache.xmlbeans.QNameSet.intersect()

                            result.setWildcardSet(wcset.union(result.getWildcardSet()));
                            result.setWildcardProcess(wcprocess);
                        }
                        else
                        {
                            result.setWildcardSet(wcset.intersect(result.getWildcardSet()));
                            // keep old process
                        }
                    }
                    break;
                }
View Full Code Here

Examples of org.apache.xmlbeans.QNameSetBuilder.intersect()

        if (canloop && deterministic && !excludenext.isDisjoint(start))
        {
            // we have a possible looping nondeterminism.
            // let's take some time now to see if it's actually caused
            // by non-unique-particle-attribute or not.
            QNameSet suspectSet = excludenext.intersect(start);
           
            // compute the set of all particles that could start this group
            Map startMap = new HashMap();
            particlesMatchingStart(partImpl, suspectSet, startMap, new QNameSetBuilder());
           
View Full Code Here

Examples of org.cipres.treebase.domain.search.TreeSearchResults.intersect()

    if (newRes == null || newRes.isEmpty()) {
      addMessage(request, "No matching trees found");
    } else {
      if (oldRes == null) {
        oldRes = new TreeSearchResults(newRes);
      } else { oldRes.intersect(newRes); }
    }
    saveSearchResults(request, oldRes);
    LOGGER.info("doSearch '" + searchType + "' after intersection: " + oldRes.size() + " result(s)");

    return new ModelAndView("search/treeTopSearch", Constants.RESULT_SET, oldRes);
View Full Code Here

Examples of org.dbwiki.data.query.condition.TimestampEvaluationResult.intersect()

    TimestampEvaluationResult evalResult = new TimestampEvaluationResult();
   
    for (WhereCondition condition : _conditions) {
      TimeSequence timestamp = condition.evalTimestamp(nodeSet);
      if (timestamp != null) {
        evalResult.intersect(timestamp);
        if (evalResult.timestamp().isEmpty()) {
          return null;
        }
      } else {
        return null;
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.