Hi Thomas, I looked at TopN. The accumulate() of TopN is an O(n*k). Using similar approach for Sort will lead to an O(n^2) complexity. Since we have to sort all elements, we can do it in a single sort call in getOutput().
On Wed, Mar 8, 2017 at 10:09 PM, Thomas Weise <t...@apache.org> wrote: > Look at the existing topN accumulation. It should be a generalization, > where you don't have a limit. > > > On Wed, Mar 8, 2017 at 8:05 AM, AJAY GUPTA <ajaygit...@gmail.com> wrote: > > > Hi, > > > > I would like to propose the Sort Accumulation. The accumulation will be > > responsible for sorting the input POJO stream. The accumulation will > > require a comparator to compare and sort the input tuples. Another > boolean > > parameter "sortDesc" will be used to decide sorting order. > > > > Let me know your views. > > > > Thanks, > > Ajay > > >
