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

268 lines
5.3 KiB
Go

//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{}
)
// GeoPointClassArray is adapter for slice of GeoPointClass.
type GeoPointClassArray []GeoPointClass
// Sort sorts slice of GeoPointClass.
func (s GeoPointClassArray) Sort(less func(a, b GeoPointClass) bool) GeoPointClassArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of GeoPointClass.
func (s GeoPointClassArray) SortStable(less func(a, b GeoPointClass) bool) GeoPointClassArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of GeoPointClass.
func (s GeoPointClassArray) Retain(keep func(x GeoPointClass) bool) GeoPointClassArray {
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 GeoPointClassArray) First() (v GeoPointClass, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s GeoPointClassArray) Last() (v GeoPointClass, 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 *GeoPointClassArray) PopFirst() (v GeoPointClass, 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 GeoPointClass
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 *GeoPointClassArray) Pop() (v GeoPointClass, 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
}
// AsGeoPoint returns copy with only GeoPoint constructors.
func (s GeoPointClassArray) AsGeoPoint() (to GeoPointArray) {
for _, elem := range s {
value, ok := elem.(*GeoPoint)
if !ok {
continue
}
to = append(to, *value)
}
return to
}
// AppendOnlyNotEmpty appends only NotEmpty constructors to
// given slice.
func (s GeoPointClassArray) AppendOnlyNotEmpty(to []*GeoPoint) []*GeoPoint {
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 GeoPointClassArray) AsNotEmpty() (to []*GeoPoint) {
return s.AppendOnlyNotEmpty(to)
}
// FirstAsNotEmpty returns first element of slice (if exists).
func (s GeoPointClassArray) FirstAsNotEmpty() (v *GeoPoint, ok bool) {
value, ok := s.First()
if !ok {
return
}
return value.AsNotEmpty()
}
// LastAsNotEmpty returns last element of slice (if exists).
func (s GeoPointClassArray) LastAsNotEmpty() (v *GeoPoint, ok bool) {
value, ok := s.Last()
if !ok {
return
}
return value.AsNotEmpty()
}
// PopFirstAsNotEmpty returns element of slice (if exists).
func (s *GeoPointClassArray) PopFirstAsNotEmpty() (v *GeoPoint, ok bool) {
value, ok := s.PopFirst()
if !ok {
return
}
return value.AsNotEmpty()
}
// PopAsNotEmpty returns element of slice (if exists).
func (s *GeoPointClassArray) PopAsNotEmpty() (v *GeoPoint, ok bool) {
value, ok := s.Pop()
if !ok {
return
}
return value.AsNotEmpty()
}
// GeoPointArray is adapter for slice of GeoPoint.
type GeoPointArray []GeoPoint
// Sort sorts slice of GeoPoint.
func (s GeoPointArray) Sort(less func(a, b GeoPoint) bool) GeoPointArray {
sort.Slice(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// SortStable sorts slice of GeoPoint.
func (s GeoPointArray) SortStable(less func(a, b GeoPoint) bool) GeoPointArray {
sort.SliceStable(s, func(i, j int) bool {
return less(s[i], s[j])
})
return s
}
// Retain filters in-place slice of GeoPoint.
func (s GeoPointArray) Retain(keep func(x GeoPoint) bool) GeoPointArray {
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 GeoPointArray) First() (v GeoPoint, ok bool) {
if len(s) < 1 {
return
}
return s[0], true
}
// Last returns last element of slice (if exists).
func (s GeoPointArray) Last() (v GeoPoint, 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 *GeoPointArray) PopFirst() (v GeoPoint, 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 GeoPoint
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 *GeoPointArray) Pop() (v GeoPoint, 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
}