Examples of Term

aima.core.logic.fol.parsing.ast.Term
@author Ravi Mohan @author Ciaran O'Reilly
alice.tuprolog.Term
com.asakusafw.compiler.flow.stage.ShuffleModel.Term
com.asakusafw.vocabulary.model.Joined.Term
com.asakusafw.vocabulary.model.Summarized.Term
com.esri.ontology.service.catalog.Term
Term.
com.google.devtools.moe.client.parser.Term
A Term in the MOE Expression Language. An identifier with optional parameters. E.g., "foo" or "internal(revision=45)" @author dbentley@google.com (Daniel Bentley)
com.googlecode.prolog_cafe.lang.Term
com.knowgate.hipergate.Term

Thesauri Term
@author Sergio Montoro Ten @version 4.0
com.redhat.ceylon.compiler.typechecker.tree.Tree.Term
com.senseidb.search.client.req.Term

Matches documents that have fields that contain a term (not analyzed). The term query maps to Sensei TermQuery. The following matches documents where the user field contains the term kimchy:
edu.mayo.bmi.guoqian.claml.Term
3.org/2001/XMLSchema}anyType"> <attGroup ref="{}attlist.Term"/> </restriction> </complexContent> </complexType> </element>
edu.pitt.dbmi.nlp.noble.terminology.Term
This class describes a term. A string representation of a Concept @author tseytlin
edu.pitt.terminology.lexicon.Term
This class describes a term. A string representation of a Concept @author tseytlin
it.unimi.dsi.mg4j.query.nodes.Term
A node representing a single term. @author Sebastiano Vigna
jason.asSyntax.Term
jp.ac.kobe_u.cs.prolog.lang.Term
The superclass of classes for term structures. The subclasses of Term must override the unify method. @author Mutsunori Banbara (banbara@kobe-u.ac.jp) @author Naoyuki Tamura (tamura@kobe-u.ac.jp) @version 1.0
jpl.Term
lupos.gui.operatorgraph.visualeditor.visualrif.util.Term
net.sf.kpex.prolog.Term
Top element of the Prolog term hierarchy. Describes a simple or compound ter like: X,a,13,f(X,s(X)),[a,s(X),b,c], a:-b,c(X,X),d, etc.
org.apache.beehive.netui.script.el.Term
org.apache.cassandra.cql3.Term
A term parsed from a CQL statement.
org.apache.lucene.index.Term
A Term represents a word from text. This is the unit of search. It is composed of two elements, the text of the word, as a string, and the name of the field that the text occurred in. Note that terms may represent more than words from text fields, but also things like dates, email addresses, urls, etc.
org.apache.oodt.cas.catalog.term.Term
@author bfoster @version $Revision$
A ingestable or queriable item
org.apache.solr.client.solrj.response.TermsResponse.Term
org.atomojo.app.client.Term
@author alex
org.atomojo.app.db.Term
@author alex
org.biojava.ontology.Term
A term in an ontology. This has an {@link org.biojava.bio.Annotation Annotation}which can be used for storing additional human-displayable information. It is strongly recommended that the Annotation is not used for any machine-readable data -- this should be represented by relations in the ontology instead.
Terms are things that represent things. They are the same sort of thing as a Java object or a prolog atom. A sub-set of terms are themselves relations. This means that they are used to describe associations between pairs of terms. Since all terms can be described, it is possible (and indeed encouraged) to describe relations. As a minimum, you should consider saying if they are identity or partial order relations, or if they are transitive, reflexive, symmetrical, anti-symmetrical or anything else you know about them. This gives the inference engine some chance of working out what is going on.
@author Thomas Down @author Matthew Pocock @since 1.4 @see org.biojavax.ontology.ComparableTerm
org.emftrace.metamodel.EMFfitModel.Term
org.jboss.dna.graph.query.model.FullTextSearch.Term
org.jboss.gwt.circuit.sample.calculator.Term
org.jfree.formula.lvalues.Term
An term is a list of LValues connected by operators. For the sake of efficiency, this is not stored as tree. We store the term as a list in the following format: (headValue)(OP value)* ... @author Thomas Morgner
org.mizartools.dli.Term
org.modeshape.jcr.query.model.FullTextSearch.Term
org.openbel.framework.common.model.Term
}
@author Anthony Bargnesi {@code }
org.pentaho.reporting.libraries.formula.lvalues.Term
An term is a list of LValues connected by operators. For the sake of efficiency, this is not stored as tree. We store the term as a list in the following format: (headValue)(OP value)* ... @author Thomas Morgner
org.renjin.stats.internals.models.Term
org.semanticweb.HermiT.model.Term
Represents a term in a DL clause.
org.springframework.data.mongodb.core.query.Term
A {@link Term} defines one or multiple words {@link Type#WORD} or phrases {@link Type#PHRASE} to be used in thecontext of full text search. @author Christoph Strobl @since 1.6
ra.Term
@author Jacek Sroka
stanfordlogic.prover.Term
@author Based on code by Team Camembert: David Haley, Pierre-Yves Laligand
uk.ac.ucl.panda.utility.structure.Term
A Term represents a word from text. This is the unit of search. It is composed of two elements, the text of the word, as a string, and the name of the field that the text occured in, an interned string. Note that terms may represent more than words from text fields, but also things like dates, email addresses, urls, etc.
wyautl_old.lang.DefaultInterpretation.Term

Examples of org.apache.lucene.index.Term

  public void testWildcardQuery() throws ParseException {
    doConvert(new WildcardQuery(new Term("*", "m**")));
  }


  public void testPrefixQuery() throws ParseException {
    doConvert(new PrefixQuery(new Term("tags", "h")));
  }

View Full Code Here

Examples of org.apache.lucene.index.Term

    doConvert(new PrefixQuery(new Term("tags", "h")));
  }


  public void testBooleanQuery() throws ParseException {
    BooleanQuery bq = new BooleanQuery();
    Query q1 = new TermQuery(new Term("tags", "h*"));
    BooleanClause bc = new BooleanClause(q1, BooleanClause.Occur.MUST);
    bq.add(bc);
    doConvert(bq);
  }

View Full Code Here

Examples of org.apache.lucene.index.Term

    doConvert(bq);
  }


  public void testPhraseQuery() throws ParseException {
    PhraseQuery pq = new PhraseQuery();
    pq.add(new Term("tags", "h*"));
    pq.add(new Term("tags", "x*"));
    doConvert(pq);
  }

View Full Code Here

Examples of org.apache.lucene.index.Term

//      qstr = "project manager";
      String[] terms = qstr.split(" ");
      BooleanQuery q = new BooleanQuery();
    for(String s : terms)
    {
      q.add( new TermQuery(new Term("b",s)), Occur.MUST);
    }
//      q.add(new MatchAllDocsQuery(), Occur.MUST);
      req.setQuery(q);//new TermQuery(new Term("b",qstr)));
      BrowseSelection sel = new BrowseSelection("ccid");
      sel.addValue("0000001384");

View Full Code Here

Examples of org.apache.lucene.index.Term

    // Read the terms
    if (!fieldsToReadSet.isEmpty()) {
      try {
        TermEnum termEnum = indexReader.terms();
        while (termEnum.next()) {
          Term term = termEnum.term();
          String field = term.field();
          if (fieldsToReadSet.contains(field)) {
            // This is a value of a wanted field
            ArrayList valueList = (ArrayList) resultMap.get(field);
            valueList.add(term.text());
          }
        }
      } catch (IOException exc) {
        throw new RegainException("Reading terms from index failed", exc);
      }

View Full Code Here

Examples of org.apache.lucene.index.Term

    }
    
    private class TermDocIdSet extends DocIdSet{
      final Term term;
      TermDocIdSet(String name,String val){
        term = new Term(name,val);
      }

View Full Code Here

Examples of org.apache.lucene.index.Term

      maxIDList.add(-1);
      freqList.add(0);
    t++;
    try {
      termDocs = reader.termDocs();
      termEnum = reader.terms(new Term(_indexFieldName, ""));
      do {
        if (termEnum == null)
          break;
        Term term = termEnum.term();
        if (term == null || !_indexFieldName.equals(term.field()))
          break;


        // store term text
        // we expect that there is at most one term per document
        if (t > MAX_VAL_COUNT) {
          throw new IOException("maximum number of value cannot exceed: "
              + MAX_VAL_COUNT);
        }
        String val = term.text();
        mterms.add(val);
        int bit = (0x00000001 << (t-1));
        termDocs.seek(termEnum);
        //freqList.add(termEnum.docFreq());  // removed because the df doesn't take into account the num of deletedDocs
        int df = 0;

View Full Code Here

Examples of org.apache.lucene.index.Term

    if (oDir.exists()) {
      File[] aSegments = oDir.listFiles();
      if (null!=aSegments) {
      if (aSegments.length>0) {
          IndexReader oReader = IndexReader.open(sDirectory);
          int iDeleted = oReader.deleteDocuments(new Term("container", sFolder));
          oReader.close();
      } // fi 
      } // fi
    } else {
      FileSystem oFS = new FileSystem();

View Full Code Here

Examples of org.apache.lucene.index.Term

    if (DebugFile.trace)
      DebugFile.writeln("new IndexWriter(...)");


  if (!bNewIndex) {
      IndexReader oIRdr = IndexReader.open(sDirectory);
      oIRdr.deleteDocuments(new Term("guid",sGuid));
      oIRdr.close();
  }


    IndexWriter oIWrt = new IndexWriter(sDirectory, (Analyzer) oAnalyzer.newInstance(), bNewIndex);

View Full Code Here

Examples of org.apache.lucene.index.Term


    BugRecord[] aRetArr;


  BooleanQuery oQry = new BooleanQuery();


  oQry.add(new TermQuery(new Term("workarea",sWorkArea)),BooleanClause.Occur.MUST);


    if (null!=sProjectGUID)
    if (sProjectGUID.length()>0)
      oQry.add(new TermQuery(new Term("container",sProjectGUID)),BooleanClause.Occur.MUST);


    if (null!=sWrittenBy)
      if (sWrittenBy.length()>0)
      oQry.add(new TermQuery(new Term("writer",sWrittenBy)),BooleanClause.Occur.MUST);


    if (null!=sReportedBy)
      if (sReportedBy.length()>0)
      oQry.add(new TermQuery(new Term("author",sReportedBy)),BooleanClause.Occur.MUST);


    if (null!=sTitle)
      if (sTitle.length()>0)
      oQry.add(new TermQuery(new Term("title",sTitle)),BooleanClause.Occur.MUST);


    if (null!=sType)
      if (sType.length()>0)
      oQry.add(new TermQuery(new Term("type",sType)),BooleanClause.Occur.MUST);


    if (null!=sStatus)
      if (sStatus.length()>0)
      oQry.add(new TermQuery(new Term("status",sStatus)),BooleanClause.Occur.MUST);


    if (null!=sPriority)
      if (sPriority.length()>0)
      oQry.add(new TermQuery(new Term("priority",sPriority)),BooleanClause.Occur.MUST);


    if (null!=sSeverity)
      if (sSeverity.length()>0)
      oQry.add(new TermQuery(new Term("severity",sSeverity)),BooleanClause.Occur.MUST);


    if (dtFromDate!=null && dtToDate!=null)
    oQry.add(new RangeQuery(new Term("created",DateTools.dateToString(dtFromDate, DateTools.Resolution.DAY)),
                  new Term("created",DateTools.dateToString(dtToDate, DateTools.Resolution.DAY)), true), BooleanClause.Occur.MUST);    
    else if (dtFromDate!=null)
    oQry.add(new RangeQuery(new Term("created",DateTools.dateToString(dtFromDate, DateTools.Resolution.DAY)),
                  new Term("created",DateTools.dateToString(new Date(299,11,31), DateTools.Resolution.DAY)), true), BooleanClause.Occur.MUST);    
    else if (dtToDate!=null)
    oQry.add(new RangeQuery(new Term("created",DateTools.dateToString(new Date(79,11,31), DateTools.Resolution.DAY)),
                  new Term("created",DateTools.dateToString(dtToDate, DateTools.Resolution.DAY)), true), BooleanClause.Occur.MUST);
    if (null!=sText)
      if (sText.length()>0)
      oQry.add(new TermQuery(new Term("text",sText)),BooleanClause.Occur.SHOULD);


    if (null!=sComments)
      if (sComments.length()>0)
      oQry.add(new TermQuery(new Term("comments",sComments)),BooleanClause.Occur.SHOULD);


  String sSegments = Gadgets.chomp(sLuceneIndexPath,File.separator)+"k_bugs"+File.separator+sWorkArea;  
    if (DebugFile.trace) DebugFile.writeln("new IndexSearcher("+sSegments+")");
    IndexSearcher oSearch = new IndexSearcher(sSegments);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.