Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
  * 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
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS,
 * See the License for the specific language governing permissions and
 * limitations under the License.
package com.facebook.presto.operator.window;
public abstract class RankingWindowFunction
        implements WindowFunction
    protected WindowIndex windowIndex;
    private int currentPeerGroupStart;
    private int currentPosition;
    public final void reset(WindowIndex windowIndex)
        this. = windowIndex;
        this. = -1;
        this. = 0;
    public final void processRow(BlockBuilder outputint peerGroupStartint peerGroupEndint frameStartint frameEnd)
        boolean newPeerGroup = false;
        if (peerGroupStart != ) {
             = peerGroupStart;
            newPeerGroup = true;
        int peerGroupCount = (peerGroupEnd - peerGroupStart) + 1;

Reset state for a new partition (including the first one).
    public void reset()
        // subclasses can override

Process a row by outputting the result of the window function.

This method provides information about the ordering peer group. A peer group is all of the rows that are peers within the specified ordering. Rows are peers if they compare equal to each other using the specified ordering expression. The ordering of rows within a peer group is undefined (otherwise they would not be peers).

output the com.facebook.presto.spi.block.BlockBuilder to use for writing the output row
newPeerGroup if this row starts a new peer group
peerGroupCount the total number of rows in this peer group
currentPosition the current position for this row
    public abstract void processRow(BlockBuilder outputboolean newPeerGroupint peerGroupCountint currentPosition);
New to GrepCode? Check out our FAQ X