src/Lucene.Net.Suggest/Suggest/BufferingTermFreqIteratorWrapper.cs

using System.Collections.Generic;
using Lucene.Net.Search.Spell;
using Lucene.Net.Util;

namespace Lucene.Net.Search.Suggest
{

    /*
     * Licensed to the Apache Software Foundation (ASF) under one or more
     * contributor license agreements.  See the NOTICE file distributed with
     * this work for additional information regarding copyright ownership.
     * The ASF licenses this file to You 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.
     */
    /// <summary>
    /// This wrapper buffers incoming elements.
    /// @lucene.experimental
    /// </summary>
    public class BufferingTermFreqIteratorWrapper : TermFreqIterator
    {
        // TODO keep this for now
        /// <summary>
        /// buffered term entries </summary>
        protected internal BytesRefArray entries = new BytesRefArray(Counter.NewCounter());
        /// <summary>
        /// current buffer position </summary>
        protected internal int curPos = -1;
        /// <summary>
        /// buffered weights, parallel with <seealso cref="#entries"/> </summary>
        protected internal long[] freqs = new long[1];
        private readonly BytesRef spare = new BytesRef();
        private readonly IComparer<BytesRef> comp;

        /// <summary>
        /// Creates a new iterator, buffering entries from the specified iterator
        /// </summary>
        public BufferingTermFreqIteratorWrapper(TermFreqIterator source)
        {
            this.comp = source.Comparator;
            BytesRef spare;
            int freqIndex = 0;
            while ((spare = source.Next()) != null)
            {
                entries.Append(spare);
                if (freqIndex >= freqs.Length)
                {
                    freqs = ArrayUtil.Grow(freqs, freqs.Length + 1);
                }
                freqs[freqIndex++] = source.Weight;
            }

        }

        public virtual long Weight
        {
            get { return freqs[curPos]; }
        }

        public BytesRef Next()
        {
            if (++curPos < entries.Size())
            {
                entries.Get(spare, curPos);
                return spare;
            }
            return null;
        }

        public IComparer<BytesRef> Comparator
        {
            get
            {
                return comp;
            }
        }


    }

}