Examples of org.exist.dom.Match

org.exist.dom.Match
Used to track fulltext matches throughout the query. {@link org.exist.storage.TextSearchEngine} will add amatch object to every {@link org.exist.dom.NodeProxy}that triggered a fulltext match for every term matched. The Match object contains the nodeId of the text node that triggered the match, the string value of the matching term and a frequency count, indicating the frequency of the matching term string within the corresponding single text node. All path operations copy existing match objects, i.e. the match objects are copied to the selected descendant or child nodes. This means that every NodeProxy being the direct or indirect result of a fulltext selection will have one or more match objects, indicating which text nodes among its descendant nodes contained a fulltext match. @author wolf

          if(Type.subTypeOf(next.getType(), Type.NODE)) {
              final NodeValue nv = (NodeValue)next;
              if(nv.getImplementationType() != NodeValue.PERSISTENT_NODE)
                {throw new XPathException(this, getName() + " cannot be applied to in-memory nodes.");}
              final NodeProxy np = (NodeProxy)nv;
              Match match = np.getMatches();
              while (match != null) {
                if (match.getNodeId().isDescendantOrSelfOf(np.getNodeId())) {
                  count += match.getFrequency();
                }
                match = match.getNextMatch();
           }
          }
      }
      result = new IntegerValue(count);
    }

View Full Code Here


    private final void processText(MemTreeBuilder builder, NodeProxy proxy, Sequence result, 
            FunctionReference callback, Sequence extraArgs) 
    throws DOMException, XPathException {
        final TextImpl text = (TextImpl) proxy.getNode();
        final Match match = proxy.getMatches();
        int nodeNr;
        if (match == null) {
            nodeNr = builder.characters(text.getXMLString());
            result.add(builder.getDocument().getNode(nodeNr));
        } else {
            List<Match.Offset> offsets = null;
            Match next = match;
            while (next != null) {
                if (next.getNodeId().equals(text.getNodeId())) {
                    if (offsets == null)
                        {offsets = new ArrayList<Match.Offset>();}
                    final int freq = next.getFrequency();
                    for (int i = 0; i < freq; i++) {
                        offsets.add(next.getOffset(i));
                    }
                }
                next = next.getNextMatch();
            }
            
            if (offsets != null) {
                FastQSort.sort(offsets, 0, offsets.size() - 1);

View Full Code Here

      if(val.getImplementationType() == NodeValue.IN_MEMORY_NODE)
        {throw new XPathException(this, getName() + " cannot be applied to in-memory nodes.");}
      final NodeProxy proxy = (NodeProxy)val;  // this is a persistent node, so casting is safe
  
      int freq = 0;
      Match nextMatch = proxy.getMatches();
      // we just count the number of distinct terms matched
      while(nextMatch != null) {
        freq += nextMatch.getFrequency();
        nextMatch = nextMatch.getNextMatch();
      }
      result = new DoubleValue(freq);
    }
    
        if (context.getProfiler().isEnabled())

View Full Code Here


    private final String processAttribute(String data, NodeId nodeId, Match match) {
        if (match == null) {return data;}
        // prepare a regular expression to mark match-terms
        StringBuilder expr = null;
        Match next = match;
        while (next != null) {
            if (next.getNodeId().equals(nodeId)) {
                if (expr == null) {
                    expr = new StringBuilder();
                    expr.append("\\b(");
                }
                if (expr.length() > 5) {expr.append('|');}
                expr.append("");
            }
            next = next.getNextMatch();
        }
        if (expr != null) {
            expr.append(")\\b");
            final Pattern pattern = Pattern.compile(expr.toString(), Pattern.CASE_INSENSITIVE | Pattern.UNICODE_CASE);
            final Matcher matcher = pattern.matcher(data);

View Full Code Here

0 1 2

TOP

Related Classes of org.exist.dom.Match

org.exist.fulltext.FTMatchListener

org.exist.indexing.ngram.NGramIndexWorker

org.exist.indexing.ngram.NGramIndexWorker$NGramMatchListener

org.exist.indexing.ngram.NGramIndexWorker$SearchCallback

org.exist.storage.serializers.NativeSerializer

org.exist.xquery.functions.fn.ExtPhrase

org.exist.xquery.functions.text.HighlightMatches

org.exist.xquery.functions.text.KWICDisplay

org.exist.xquery.functions.text.MatchCount

org.exist.xquery.functions.text.TextRank

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.