Files
mautrix-telegram/pkg/gotd/tg/tl_help_user_info_slices_gen.go
T
2025-06-27 20:03:37 -07:00

282 lines
6.0 KiB
Go
Generated

//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"
"go.mau.fi/mautrix-telegram/pkg/gotd/bin"
"go.mau.fi/mautrix-telegram/pkg/gotd/tdjson"
"go.mau.fi/mautrix-telegram/pkg/gotd/tdp"
"go.mau.fi/mautrix-telegram/pkg/gotd/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()
})
}