-
Notifications
You must be signed in to change notification settings - Fork 3.8k
/
rank_tmpl.go
143 lines (126 loc) · 3.88 KB
/
rank_tmpl.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
// Copyright 2019 The Cockroach Authors.
//
// 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.
// {{/*
// +build execgen_template
//
// This file is the execgen template for rank.eg.go. It's formatted in a
// special way, so it's both valid Go and a valid text/template input. This
// permits editing this file with editor support.
//
// */}}
package vecbuiltins
import (
"context"
"github.com/cockroachdb/cockroach/pkg/sql/exec"
"github.com/cockroachdb/cockroach/pkg/sql/exec/coldata"
"github.com/cockroachdb/cockroach/pkg/sql/exec/types"
)
// {{/*
// _UPDATE_RANK is the template function for updating the state of rank
// operators.
func _UPDATE_RANK() {
panic("")
}
// _UPDATE_RANK_INCREMENT is the template function for updating the state of
// rank operators.
func _UPDATE_RANK_INCREMENT() {
panic("")
}
// */}}
// {{range .}}
type rankDense__DENSE_HasPartition__PARTITION_Op struct {
input exec.Operator
batch coldata.Batch
// distinctCol is the output column of the chain of ordered distinct
// operators in which true will indicate that a new rank needs to be assigned
// to the corresponding tuple.
distinctCol []bool
outputColIdx int
partitionColIdx int
// rank indicates which rank should be assigned to the next tuple.
rank int64
// rankIncrement indicates by how much rank should be incremented when a
// tuple distinct from the previous one on the ordering columns is seen. It
// is used only in case of a regular rank function (i.e. not dense).
rankIncrement int64
}
var _ exec.Operator = &rankDense__DENSE_HasPartition__PARTITION_Op{}
func (r *rankDense__DENSE_HasPartition__PARTITION_Op) Init() {
r.input.Init()
// RANK and DENSE_RANK start counting from 1. Before we assign the rank to a
// tuple in the batch, we first increment r.rank, so setting this
// rankIncrement to 1 will update r.rank to 1 on the very first tuple (as
// desired).
r.rankIncrement = 1
}
func (r *rankDense__DENSE_HasPartition__PARTITION_Op) Next(ctx context.Context) coldata.Batch {
r.batch = r.input.Next(ctx)
if r.batch.Length() == 0 {
return r.batch
}
// {{ if .HasPartition }}
if r.partitionColIdx == r.batch.Width() {
r.batch.AppendCol(types.Bool)
} else if r.partitionColIdx > r.batch.Width() {
panic("unexpected: column partitionColIdx is neither present nor the next to be appended")
}
partitionCol := r.batch.ColVec(r.partitionColIdx).Bool()
// {{ end }}
if r.outputColIdx == r.batch.Width() {
r.batch.AppendCol(types.Int64)
} else if r.outputColIdx > r.batch.Width() {
panic("unexpected: column outputColIdx is neither present nor the next to be appended")
}
rankCol := r.batch.ColVec(r.outputColIdx).Int64()
sel := r.batch.Selection()
if sel != nil {
for i := uint16(0); i < r.batch.Length(); i++ {
// {{ if .HasPartition }}
if partitionCol[sel[i]] {
r.rank = 1
r.rankIncrement = 1
rankCol[i] = 1
continue
}
// {{end}}
if r.distinctCol[sel[i]] {
_UPDATE_RANK()
rankCol[sel[i]] = r.rank
} else {
rankCol[sel[i]] = r.rank
_UPDATE_RANK_INCREMENT()
}
}
} else {
for i := uint16(0); i < r.batch.Length(); i++ {
// {{ if .HasPartition }}
if partitionCol[i] {
r.rank = 1
r.rankIncrement = 1
rankCol[i] = 1
continue
}
// {{end}}
if r.distinctCol[i] {
_UPDATE_RANK()
rankCol[i] = r.rank
} else {
rankCol[i] = r.rank
_UPDATE_RANK_INCREMENT()
}
}
}
return r.batch
}
// {{end}}