QueryTermVector.cs :  » Search-Engines » dotLucene » Lucene » Net » Search » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » Search Engines » dotLucene 
dotLucene » Lucene » Net » Search » QueryTermVector.cs
/*
 * Copyright 2004 The Apache Software Foundation
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 * http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

using System;
using AnalyzerLucene.Net.Analysis.Analyzer;
using TokenLucene.Net.Analysis.Token;
using TokenStreamLucene.Net.Analysis.TokenStream;
using TermFreqVectorLucene.Net.Index.TermFreqVector;

namespace Lucene.Net.Search{
  
  /// <summary> 
  /// 
  /// 
  /// </summary>
  public class QueryTermVector : TermFreqVector
  {
    private System.String[] terms = new System.String[0];
    private int[] termFreqs = new int[0];
    
    public virtual System.String GetField()
    {
      return null;
    }
    
    /// <summary> </summary>
    /// <param name="queryTerms">The original list of terms from the query, can contain duplicates
    /// </param>
    public QueryTermVector(System.String[] queryTerms)
    {
      
      ProcessTerms(queryTerms);
    }
    
    public QueryTermVector(System.String queryString, Analyzer analyzer)
    {
      if (analyzer != null)
      {
        TokenStream stream = analyzer.TokenStream("", new System.IO.StringReader(queryString));
        if (stream != null)
        {
          Token next = null;
          System.Collections.ArrayList terms = new System.Collections.ArrayList();
          try
          {
            while ((next = stream.Next()) != null)
            {
              terms.Add(next.TermText());
            }
            ProcessTerms((System.String[]) terms.ToArray(typeof(System.String)));
          }
          catch (System.IO.IOException)
          {
          }
        }
      }
    }
    
    private void  ProcessTerms(System.String[] queryTerms)
    {
      if (queryTerms != null)
      {
        System.Array.Sort(queryTerms);
        System.Collections.IDictionary tmpSet = new System.Collections.Hashtable(queryTerms.Length);
        //filter out duplicates
        System.Collections.ArrayList tmpList = new System.Collections.ArrayList(queryTerms.Length);
        System.Collections.ArrayList tmpFreqs = new System.Collections.ArrayList(queryTerms.Length);
        int j = 0;
        for (int i = 0; i < queryTerms.Length; i++)
        {
          System.String term = queryTerms[i];
          System.Object tmpPosition = tmpSet[term];
          if (tmpPosition == null)
          {
            tmpSet[term] = (System.Int32) j++;
            tmpList.Add(term);
            tmpFreqs.Add(1);
          }
          else
          {
                        System.Int32 position = (System.Int32) tmpSet[term];
            System.Int32 integer = (System.Int32) tmpFreqs[position];
            tmpFreqs[position] = (System.Int32) (integer + 1);
          }
        }
        terms = (System.String[]) tmpList.ToArray(typeof(System.String));
        //termFreqs = (int[])tmpFreqs.toArray(termFreqs);
        termFreqs = new int[tmpFreqs.Count];
        int i2 = 0;
        for (System.Collections.IEnumerator iter = tmpFreqs.GetEnumerator(); iter.MoveNext(); )
        {
          System.Int32 integer = (System.Int32) iter.Current;
          termFreqs[i2++] = integer;
        }
      }
    }
    
    public override System.String ToString()
    {
      System.Text.StringBuilder sb = new System.Text.StringBuilder();
      sb.Append('{');
      for (int i = 0; i < terms.Length; i++)
      {
        if (i > 0)
          sb.Append(", ");
        sb.Append(terms[i]).Append('/').Append(termFreqs[i]);
      }
      sb.Append('}');
      return sb.ToString();
    }
    
    
    public virtual int Size()
    {
      return terms.Length;
    }
    
    public virtual System.String[] GetTerms()
    {
      return terms;
    }
    
    public virtual int[] GetTermFrequencies()
    {
      return termFreqs;
    }
    
    public virtual int IndexOf(System.String term)
    {
      int res = System.Array.BinarySearch(terms, term);
      return res >= 0?res:- 1;
    }
    
    public virtual int[] IndexesOf(System.String[] terms, int start, int len)
    {
      int[] res = new int[len];
      
      for (int i = 0; i < len; i++)
      {
        res[i] = IndexOf(terms[i]);
      }
      return res;
    }
  }
}
www.java2v.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.