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

308 lines
7.5 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{}
)
// PostInteractionCountersClassArray is adapter for slice of PostInteractionCountersClass.
type PostInteractionCountersClassArray []PostInteractionCountersClass
// Sort sorts slice of PostInteractionCountersClass.
func (s PostInteractionCountersClassArray) Sort(less func(a, b PostInteractionCountersClass) bool) PostInteractionCountersClassArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of PostInteractionCountersClass.
func (s PostInteractionCountersClassArray) SortStable(less func(a, b PostInteractionCountersClass) bool) PostInteractionCountersClassArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of PostInteractionCountersClass.
func (s PostInteractionCountersClassArray) Retain(keep func(x PostInteractionCountersClass) bool) PostInteractionCountersClassArray {
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 PostInteractionCountersClassArray) First() (v PostInteractionCountersClass, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s PostInteractionCountersClassArray) Last() (v PostInteractionCountersClass, 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 *PostInteractionCountersClassArray) PopFirst() (v PostInteractionCountersClass, 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 PostInteractionCountersClass
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 *PostInteractionCountersClassArray) Pop() (v PostInteractionCountersClass, 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
}
// AsPostInteractionCountersMessage returns copy with only PostInteractionCountersMessage constructors.
func (s PostInteractionCountersClassArray) AsPostInteractionCountersMessage() (to PostInteractionCountersMessageArray) {
for _, elem := range s {
value, ok := elem.(*PostInteractionCountersMessage)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// AsPostInteractionCountersStory returns copy with only PostInteractionCountersStory constructors.
func (s PostInteractionCountersClassArray) AsPostInteractionCountersStory() (to PostInteractionCountersStoryArray) {
for _, elem := range s {
value, ok := elem.(*PostInteractionCountersStory)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// PostInteractionCountersMessageArray is adapter for slice of PostInteractionCountersMessage.
type PostInteractionCountersMessageArray []PostInteractionCountersMessage
// Sort sorts slice of PostInteractionCountersMessage.
func (s PostInteractionCountersMessageArray) Sort(less func(a, b PostInteractionCountersMessage) bool) PostInteractionCountersMessageArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of PostInteractionCountersMessage.
func (s PostInteractionCountersMessageArray) SortStable(less func(a, b PostInteractionCountersMessage) bool) PostInteractionCountersMessageArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of PostInteractionCountersMessage.
func (s PostInteractionCountersMessageArray) Retain(keep func(x PostInteractionCountersMessage) bool) PostInteractionCountersMessageArray {
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 PostInteractionCountersMessageArray) First() (v PostInteractionCountersMessage, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s PostInteractionCountersMessageArray) Last() (v PostInteractionCountersMessage, 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 *PostInteractionCountersMessageArray) PopFirst() (v PostInteractionCountersMessage, 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 PostInteractionCountersMessage
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 *PostInteractionCountersMessageArray) Pop() (v PostInteractionCountersMessage, 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
}
// PostInteractionCountersStoryArray is adapter for slice of PostInteractionCountersStory.
type PostInteractionCountersStoryArray []PostInteractionCountersStory
// Sort sorts slice of PostInteractionCountersStory.
func (s PostInteractionCountersStoryArray) Sort(less func(a, b PostInteractionCountersStory) bool) PostInteractionCountersStoryArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of PostInteractionCountersStory.
func (s PostInteractionCountersStoryArray) SortStable(less func(a, b PostInteractionCountersStory) bool) PostInteractionCountersStoryArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of PostInteractionCountersStory.
func (s PostInteractionCountersStoryArray) Retain(keep func(x PostInteractionCountersStory) bool) PostInteractionCountersStoryArray {
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 PostInteractionCountersStoryArray) First() (v PostInteractionCountersStory, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s PostInteractionCountersStoryArray) Last() (v PostInteractionCountersStory, 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 *PostInteractionCountersStoryArray) PopFirst() (v PostInteractionCountersStory, 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 PostInteractionCountersStory
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 *PostInteractionCountersStoryArray) Pop() (v PostInteractionCountersStory, 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
}