C# Term.Bytes方法代码示例

 public void Set(Term term)
 {
     if (term == null)
     {
         Reset();
         return;
     }
     Bytes.CopyBytes(term.Bytes());
     Field = String.Intern(term.Field());
     CurrentFieldNumber = -1;
     this.Term = term;
 }

 internal static Term DeepCopyOf(Term other)
 {
     return new Term(other.Field(), BytesRef.DeepCopyOf(other.Bytes()));
 }

 private int CompareAsUTF16(Term term1, Term term2)
 {
     if (term1.Field().Equals(term2.Field()))
     {
         return LegacyComparator.Compare(term1.Bytes(), term2.Bytes());
     }
     else
     {
         return term1.Field().CompareTo(term2.Field());
     }
 }

 /// <summary>
 /// Compare the fields of the terms first, and if not equals return from
 /// compare. If equal compare terms.
 /// </summary>
 /// <param name="term">
 ///          the term to compare. </param>
 /// <param name="termIndex">
 ///          the position of the term in the input to compare </param>
 /// <param name="input">
 ///          the input buffer. </param>
 /// <returns> int. </returns>
 /// <exception cref="IOException"> If there is a low-level I/O error. </exception>
 private int CompareTo(Term term, int termIndex, PagedBytesDataInput input, BytesRef reuse)
 {
     // if term field does not equal mid's field index, then compare fields
     // else if they are equal, compare term's string values...
     int c = CompareField(term, termIndex, input);
     if (c == 0)
     {
         reuse.Length = input.ReadVInt();
         reuse.Grow(reuse.Length);
         input.ReadBytes(reuse.Bytes, 0, reuse.Length);
         return Comparator.Compare(term.Bytes(), reuse);
     }
     return c;
 }

                public override TermStatistics TermStatistics(Term term, TermContext context)
                {
                    Debug.Assert(term != null);
                    long docFreq = 0;
                    long totalTermFreq = 0;
                    for (int nodeID = 0; nodeID < NodeVersions.Length; nodeID++)
                    {
                        TermStatistics subStats;
                        if (nodeID == MyNodeID)
                        {
                            subStats = base.TermStatistics(term, context);
                        }
                        else
                        {
                            TermAndShardVersion key = new TermAndShardVersion(nodeID, NodeVersions[nodeID], term);
                            subStats = OuterInstance.TermStatsCache[key];
                            // We pre-cached during rewrite so all terms
                            // better be here...
                            Debug.Assert(subStats != null);
                        }

                        long nodeDocFreq = subStats.DocFreq();
                        if (docFreq >= 0 && nodeDocFreq >= 0)
                        {
                            docFreq += nodeDocFreq;
                        }
                        else
                        {
                            docFreq = -1;
                        }

                        long nodeTotalTermFreq = subStats.TotalTermFreq();
                        if (totalTermFreq >= 0 && nodeTotalTermFreq >= 0)
                        {
                            totalTermFreq += nodeTotalTermFreq;
                        }
                        else
                        {
                            totalTermFreq = -1;
                        }
                    }

                    return new TermStatistics(term.Bytes(), docFreq, totalTermFreq);
                }

 internal DumbPrefixQuery(TestPrefixRandom outerInstance, Term term)
     : base(term.Field())
 {
     this.OuterInstance = outerInstance;
     Prefix = term.Bytes();
 }