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

350 lines
8.2 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{}
)
// EncryptedMessageClassArray is adapter for slice of EncryptedMessageClass.
type EncryptedMessageClassArray []EncryptedMessageClass
// Sort sorts slice of EncryptedMessageClass.
func (s EncryptedMessageClassArray) Sort(less func(a, b EncryptedMessageClass) bool) EncryptedMessageClassArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of EncryptedMessageClass.
func (s EncryptedMessageClassArray) SortStable(less func(a, b EncryptedMessageClass) bool) EncryptedMessageClassArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of EncryptedMessageClass.
func (s EncryptedMessageClassArray) Retain(keep func(x EncryptedMessageClass) bool) EncryptedMessageClassArray {
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 EncryptedMessageClassArray) First() (v EncryptedMessageClass, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s EncryptedMessageClassArray) Last() (v EncryptedMessageClass, 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 *EncryptedMessageClassArray) PopFirst() (v EncryptedMessageClass, 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 EncryptedMessageClass
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 *EncryptedMessageClassArray) Pop() (v EncryptedMessageClass, 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 EncryptedMessageClass by Date.
func (s EncryptedMessageClassArray) SortByDate() EncryptedMessageClassArray {
return s.Sort(func(a, b EncryptedMessageClass) bool {
return a.GetDate() < b.GetDate()
})
}
// SortStableByDate sorts slice of EncryptedMessageClass by Date.
func (s EncryptedMessageClassArray) SortStableByDate() EncryptedMessageClassArray {
return s.SortStable(func(a, b EncryptedMessageClass) bool {
return a.GetDate() < b.GetDate()
})
}
// AsEncryptedMessage returns copy with only EncryptedMessage constructors.
func (s EncryptedMessageClassArray) AsEncryptedMessage() (to EncryptedMessageArray) {
for _, elem := range s {
value, ok := elem.(*EncryptedMessage)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// AsEncryptedMessageService returns copy with only EncryptedMessageService constructors.
func (s EncryptedMessageClassArray) AsEncryptedMessageService() (to EncryptedMessageServiceArray) {
for _, elem := range s {
value, ok := elem.(*EncryptedMessageService)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// EncryptedMessageArray is adapter for slice of EncryptedMessage.
type EncryptedMessageArray []EncryptedMessage
// Sort sorts slice of EncryptedMessage.
func (s EncryptedMessageArray) Sort(less func(a, b EncryptedMessage) bool) EncryptedMessageArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of EncryptedMessage.
func (s EncryptedMessageArray) SortStable(less func(a, b EncryptedMessage) bool) EncryptedMessageArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of EncryptedMessage.
func (s EncryptedMessageArray) Retain(keep func(x EncryptedMessage) bool) EncryptedMessageArray {
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 EncryptedMessageArray) First() (v EncryptedMessage, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s EncryptedMessageArray) Last() (v EncryptedMessage, 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 *EncryptedMessageArray) PopFirst() (v EncryptedMessage, 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 EncryptedMessage
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 *EncryptedMessageArray) Pop() (v EncryptedMessage, 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 EncryptedMessage by Date.
func (s EncryptedMessageArray) SortByDate() EncryptedMessageArray {
return s.Sort(func(a, b EncryptedMessage) bool {
return a.GetDate() < b.GetDate()
})
}
// SortStableByDate sorts slice of EncryptedMessage by Date.
func (s EncryptedMessageArray) SortStableByDate() EncryptedMessageArray {
return s.SortStable(func(a, b EncryptedMessage) bool {
return a.GetDate() < b.GetDate()
})
}
// EncryptedMessageServiceArray is adapter for slice of EncryptedMessageService.
type EncryptedMessageServiceArray []EncryptedMessageService
// Sort sorts slice of EncryptedMessageService.
func (s EncryptedMessageServiceArray) Sort(less func(a, b EncryptedMessageService) bool) EncryptedMessageServiceArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of EncryptedMessageService.
func (s EncryptedMessageServiceArray) SortStable(less func(a, b EncryptedMessageService) bool) EncryptedMessageServiceArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of EncryptedMessageService.
func (s EncryptedMessageServiceArray) Retain(keep func(x EncryptedMessageService) bool) EncryptedMessageServiceArray {
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 EncryptedMessageServiceArray) First() (v EncryptedMessageService, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s EncryptedMessageServiceArray) Last() (v EncryptedMessageService, 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 *EncryptedMessageServiceArray) PopFirst() (v EncryptedMessageService, 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 EncryptedMessageService
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 *EncryptedMessageServiceArray) Pop() (v EncryptedMessageService, 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 EncryptedMessageService by Date.
func (s EncryptedMessageServiceArray) SortByDate() EncryptedMessageServiceArray {
return s.Sort(func(a, b EncryptedMessageService) bool {
return a.GetDate() < b.GetDate()
})
}
// SortStableByDate sorts slice of EncryptedMessageService by Date.
func (s EncryptedMessageServiceArray) SortStableByDate() EncryptedMessageServiceArray {
return s.SortStable(func(a, b EncryptedMessageService) bool {
return a.GetDate() < b.GetDate()
})
}