move gotd fork into repo. (#111)
- update to latest telegram layer - remove some references to fields in tg.Entities that don't exist in the schema - originally added here: https://github.com/beeper/td/commit/820929062a2ba0104397bc01235ab58a9cff780e - referenced here - https://github.com/mautrix/telegramgo/commit/124f0967ed195b5a380c9bd02e170ada9710dde3 - https://github.com/mautrix/telegramgo/commit/4205047aab2e0639217148b5d125bfaab668bd8e
This commit is contained in:
Adam Van Ymeren
GitHub
@@ -0,0 +1,458 @@
|
||||
//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{}
|
||||
)
|
||||
|
||||
// InputWallPaperClassArray is adapter for slice of InputWallPaperClass.
|
||||
type InputWallPaperClassArray []InputWallPaperClass
|
||||
|
||||
// Sort sorts slice of InputWallPaperClass.
|
||||
func (s InputWallPaperClassArray) Sort(less func(a, b InputWallPaperClass) bool) InputWallPaperClassArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of InputWallPaperClass.
|
||||
func (s InputWallPaperClassArray) SortStable(less func(a, b InputWallPaperClass) bool) InputWallPaperClassArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of InputWallPaperClass.
|
||||
func (s InputWallPaperClassArray) Retain(keep func(x InputWallPaperClass) bool) InputWallPaperClassArray {
|
||||
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 InputWallPaperClassArray) First() (v InputWallPaperClass, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s InputWallPaperClassArray) Last() (v InputWallPaperClass, 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 *InputWallPaperClassArray) PopFirst() (v InputWallPaperClass, 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 InputWallPaperClass
|
||||
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 *InputWallPaperClassArray) Pop() (v InputWallPaperClass, 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
|
||||
}
|
||||
|
||||
// AsInputWallPaper returns copy with only InputWallPaper constructors.
|
||||
func (s InputWallPaperClassArray) AsInputWallPaper() (to InputWallPaperArray) {
|
||||
for _, elem := range s {
|
||||
value, ok := elem.(*InputWallPaper)
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
to = append(to, *value)
|
||||
}
|
||||
|
||||
return to
|
||||
}
|
||||
|
||||
// AsInputWallPaperSlug returns copy with only InputWallPaperSlug constructors.
|
||||
func (s InputWallPaperClassArray) AsInputWallPaperSlug() (to InputWallPaperSlugArray) {
|
||||
for _, elem := range s {
|
||||
value, ok := elem.(*InputWallPaperSlug)
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
to = append(to, *value)
|
||||
}
|
||||
|
||||
return to
|
||||
}
|
||||
|
||||
// AsInputWallPaperNoFile returns copy with only InputWallPaperNoFile constructors.
|
||||
func (s InputWallPaperClassArray) AsInputWallPaperNoFile() (to InputWallPaperNoFileArray) {
|
||||
for _, elem := range s {
|
||||
value, ok := elem.(*InputWallPaperNoFile)
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
to = append(to, *value)
|
||||
}
|
||||
|
||||
return to
|
||||
}
|
||||
|
||||
// InputWallPaperArray is adapter for slice of InputWallPaper.
|
||||
type InputWallPaperArray []InputWallPaper
|
||||
|
||||
// Sort sorts slice of InputWallPaper.
|
||||
func (s InputWallPaperArray) Sort(less func(a, b InputWallPaper) bool) InputWallPaperArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of InputWallPaper.
|
||||
func (s InputWallPaperArray) SortStable(less func(a, b InputWallPaper) bool) InputWallPaperArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of InputWallPaper.
|
||||
func (s InputWallPaperArray) Retain(keep func(x InputWallPaper) bool) InputWallPaperArray {
|
||||
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 InputWallPaperArray) First() (v InputWallPaper, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s InputWallPaperArray) Last() (v InputWallPaper, 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 *InputWallPaperArray) PopFirst() (v InputWallPaper, 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 InputWallPaper
|
||||
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 *InputWallPaperArray) Pop() (v InputWallPaper, 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
|
||||
}
|
||||
|
||||
// SortByID sorts slice of InputWallPaper by ID.
|
||||
func (s InputWallPaperArray) SortByID() InputWallPaperArray {
|
||||
return s.Sort(func(a, b InputWallPaper) bool {
|
||||
return a.GetID() < b.GetID()
|
||||
})
|
||||
}
|
||||
|
||||
// SortStableByID sorts slice of InputWallPaper by ID.
|
||||
func (s InputWallPaperArray) SortStableByID() InputWallPaperArray {
|
||||
return s.SortStable(func(a, b InputWallPaper) bool {
|
||||
return a.GetID() < b.GetID()
|
||||
})
|
||||
}
|
||||
|
||||
// FillMap fills constructors to given map.
|
||||
func (s InputWallPaperArray) FillMap(to map[int64]InputWallPaper) {
|
||||
for _, value := range s {
|
||||
to[value.GetID()] = value
|
||||
}
|
||||
}
|
||||
|
||||
// ToMap collects constructors to map.
|
||||
func (s InputWallPaperArray) ToMap() map[int64]InputWallPaper {
|
||||
r := make(map[int64]InputWallPaper, len(s))
|
||||
s.FillMap(r)
|
||||
return r
|
||||
}
|
||||
|
||||
// InputWallPaperSlugArray is adapter for slice of InputWallPaperSlug.
|
||||
type InputWallPaperSlugArray []InputWallPaperSlug
|
||||
|
||||
// Sort sorts slice of InputWallPaperSlug.
|
||||
func (s InputWallPaperSlugArray) Sort(less func(a, b InputWallPaperSlug) bool) InputWallPaperSlugArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of InputWallPaperSlug.
|
||||
func (s InputWallPaperSlugArray) SortStable(less func(a, b InputWallPaperSlug) bool) InputWallPaperSlugArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of InputWallPaperSlug.
|
||||
func (s InputWallPaperSlugArray) Retain(keep func(x InputWallPaperSlug) bool) InputWallPaperSlugArray {
|
||||
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 InputWallPaperSlugArray) First() (v InputWallPaperSlug, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s InputWallPaperSlugArray) Last() (v InputWallPaperSlug, 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 *InputWallPaperSlugArray) PopFirst() (v InputWallPaperSlug, 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 InputWallPaperSlug
|
||||
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 *InputWallPaperSlugArray) Pop() (v InputWallPaperSlug, 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
|
||||
}
|
||||
|
||||
// InputWallPaperNoFileArray is adapter for slice of InputWallPaperNoFile.
|
||||
type InputWallPaperNoFileArray []InputWallPaperNoFile
|
||||
|
||||
// Sort sorts slice of InputWallPaperNoFile.
|
||||
func (s InputWallPaperNoFileArray) Sort(less func(a, b InputWallPaperNoFile) bool) InputWallPaperNoFileArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of InputWallPaperNoFile.
|
||||
func (s InputWallPaperNoFileArray) SortStable(less func(a, b InputWallPaperNoFile) bool) InputWallPaperNoFileArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of InputWallPaperNoFile.
|
||||
func (s InputWallPaperNoFileArray) Retain(keep func(x InputWallPaperNoFile) bool) InputWallPaperNoFileArray {
|
||||
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 InputWallPaperNoFileArray) First() (v InputWallPaperNoFile, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s InputWallPaperNoFileArray) Last() (v InputWallPaperNoFile, 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 *InputWallPaperNoFileArray) PopFirst() (v InputWallPaperNoFile, 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 InputWallPaperNoFile
|
||||
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 *InputWallPaperNoFileArray) Pop() (v InputWallPaperNoFile, 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
|
||||
}
|
||||
|
||||
// SortByID sorts slice of InputWallPaperNoFile by ID.
|
||||
func (s InputWallPaperNoFileArray) SortByID() InputWallPaperNoFileArray {
|
||||
return s.Sort(func(a, b InputWallPaperNoFile) bool {
|
||||
return a.GetID() < b.GetID()
|
||||
})
|
||||
}
|
||||
|
||||
// SortStableByID sorts slice of InputWallPaperNoFile by ID.
|
||||
func (s InputWallPaperNoFileArray) SortStableByID() InputWallPaperNoFileArray {
|
||||
return s.SortStable(func(a, b InputWallPaperNoFile) bool {
|
||||
return a.GetID() < b.GetID()
|
||||
})
|
||||
}
|
||||
|
||||
// FillMap fills constructors to given map.
|
||||
func (s InputWallPaperNoFileArray) FillMap(to map[int64]InputWallPaperNoFile) {
|
||||
for _, value := range s {
|
||||
to[value.GetID()] = value
|
||||
}
|
||||
}
|
||||
|
||||
// ToMap collects constructors to map.
|
||||
func (s InputWallPaperNoFileArray) ToMap() map[int64]InputWallPaperNoFile {
|
||||
r := make(map[int64]InputWallPaperNoFile, len(s))
|
||||
s.FillMap(r)
|
||||
return r
|
||||
}
|
||||
Reference in New Issue
Block a user