-
-
Notifications
You must be signed in to change notification settings - Fork 126
/
tl_help_user_info_slices_gen.go
281 lines (236 loc) · 5.92 KB
/
tl_help_user_info_slices_gen.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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
//go:build !no_gotd_slices
// +build !no_gotd_slices
// Code generated by gotdgen, DO NOT EDIT.
package tg
import (
"context"
"errors"
"fmt"
"sort"
"strings"
"go.uber.org/multierr"
"github.com/gotd/td/bin"
"github.com/gotd/td/tdjson"
"github.com/gotd/td/tdp"
"github.com/gotd/td/tgerr"
)
// No-op definition for keeping imports.
var (
_ = bin.Buffer{}
_ = context.Background()
_ = fmt.Stringer(nil)
_ = strings.Builder{}
_ = errors.Is
_ = multierr.AppendInto
_ = sort.Ints
_ = tdp.Format
_ = tgerr.Error{}
_ = tdjson.Encoder{}
)
// HelpUserInfoClassArray is adapter for slice of HelpUserInfoClass.
type HelpUserInfoClassArray []HelpUserInfoClass
// Sort sorts slice of HelpUserInfoClass.
func (s HelpUserInfoClassArray) Sort(less func(a, b HelpUserInfoClass) bool) HelpUserInfoClassArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of HelpUserInfoClass.
func (s HelpUserInfoClassArray) SortStable(less func(a, b HelpUserInfoClass) bool) HelpUserInfoClassArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of HelpUserInfoClass.
func (s HelpUserInfoClassArray) Retain(keep func(x HelpUserInfoClass) bool) HelpUserInfoClassArray {
n := 0
for _, x := range s {
if keep(x) {
s[n] = x
n++
}
}
s = s[:n]
return s
}
// First returns first element of slice (if exists).
func (s HelpUserInfoClassArray) First() (v HelpUserInfoClass, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s HelpUserInfoClassArray) Last() (v HelpUserInfoClass, ok bool) {
if len(s) < 1 {
return
}
return s[len(s)-1], true
}
// PopFirst returns first element of slice (if exists) and deletes it.
func (s *HelpUserInfoClassArray) PopFirst() (v HelpUserInfoClass, ok bool) {
if s == nil || len(*s) < 1 {
return
}
a := *s
v = a[0]
// Delete by index from SliceTricks.
copy(a[0:], a[1:])
var zero HelpUserInfoClass
a[len(a)-1] = zero
a = a[:len(a)-1]
*s = a
return v, true
}
// Pop returns last element of slice (if exists) and deletes it.
func (s *HelpUserInfoClassArray) Pop() (v HelpUserInfoClass, ok bool) {
if s == nil || len(*s) < 1 {
return
}
a := *s
v = a[len(a)-1]
a = a[:len(a)-1]
*s = a
return v, true
}
// AsHelpUserInfo returns copy with only HelpUserInfo constructors.
func (s HelpUserInfoClassArray) AsHelpUserInfo() (to HelpUserInfoArray) {
for _, elem := range s {
value, ok := elem.(*HelpUserInfo)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// AppendOnlyNotEmpty appends only NotEmpty constructors to
// given slice.
func (s HelpUserInfoClassArray) AppendOnlyNotEmpty(to []*HelpUserInfo) []*HelpUserInfo {
for _, elem := range s {
value, ok := elem.AsNotEmpty()
if !ok {
continue
}
to = append(to, value)
}
return to
}
// AsNotEmpty returns copy with only NotEmpty constructors.
func (s HelpUserInfoClassArray) AsNotEmpty() (to []*HelpUserInfo) {
return s.AppendOnlyNotEmpty(to)
}
// FirstAsNotEmpty returns first element of slice (if exists).
func (s HelpUserInfoClassArray) FirstAsNotEmpty() (v *HelpUserInfo, ok bool) {
value, ok := s.First()
if !ok {
return
}
return value.AsNotEmpty()
}
// LastAsNotEmpty returns last element of slice (if exists).
func (s HelpUserInfoClassArray) LastAsNotEmpty() (v *HelpUserInfo, ok bool) {
value, ok := s.Last()
if !ok {
return
}
return value.AsNotEmpty()
}
// PopFirstAsNotEmpty returns element of slice (if exists).
func (s *HelpUserInfoClassArray) PopFirstAsNotEmpty() (v *HelpUserInfo, ok bool) {
value, ok := s.PopFirst()
if !ok {
return
}
return value.AsNotEmpty()
}
// PopAsNotEmpty returns element of slice (if exists).
func (s *HelpUserInfoClassArray) PopAsNotEmpty() (v *HelpUserInfo, ok bool) {
value, ok := s.Pop()
if !ok {
return
}
return value.AsNotEmpty()
}
// HelpUserInfoArray is adapter for slice of HelpUserInfo.
type HelpUserInfoArray []HelpUserInfo
// Sort sorts slice of HelpUserInfo.
func (s HelpUserInfoArray) Sort(less func(a, b HelpUserInfo) bool) HelpUserInfoArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of HelpUserInfo.
func (s HelpUserInfoArray) SortStable(less func(a, b HelpUserInfo) bool) HelpUserInfoArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of HelpUserInfo.
func (s HelpUserInfoArray) Retain(keep func(x HelpUserInfo) bool) HelpUserInfoArray {
n := 0
for _, x := range s {
if keep(x) {
s[n] = x
n++
}
}
s = s[:n]
return s
}
// First returns first element of slice (if exists).
func (s HelpUserInfoArray) First() (v HelpUserInfo, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s HelpUserInfoArray) Last() (v HelpUserInfo, ok bool) {
if len(s) < 1 {
return
}
return s[len(s)-1], true
}
// PopFirst returns first element of slice (if exists) and deletes it.
func (s *HelpUserInfoArray) PopFirst() (v HelpUserInfo, ok bool) {
if s == nil || len(*s) < 1 {
return
}
a := *s
v = a[0]
// Delete by index from SliceTricks.
copy(a[0:], a[1:])
var zero HelpUserInfo
a[len(a)-1] = zero
a = a[:len(a)-1]
*s = a
return v, true
}
// Pop returns last element of slice (if exists) and deletes it.
func (s *HelpUserInfoArray) Pop() (v HelpUserInfo, ok bool) {
if s == nil || len(*s) < 1 {
return
}
a := *s
v = a[len(a)-1]
a = a[:len(a)-1]
*s = a
return v, true
}
// SortByDate sorts slice of HelpUserInfo by Date.
func (s HelpUserInfoArray) SortByDate() HelpUserInfoArray {
return s.Sort(func(a, b HelpUserInfo) bool {
return a.GetDate() < b.GetDate()
})
}
// SortStableByDate sorts slice of HelpUserInfo by Date.
func (s HelpUserInfoArray) SortStableByDate() HelpUserInfoArray {
return s.SortStable(func(a, b HelpUserInfo) bool {
return a.GetDate() < b.GetDate()
})
}