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:
@@ -0,0 +1,267 @@
|
||||
//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{}
|
||||
)
|
||||
|
||||
// ContactsContactsClassArray is adapter for slice of ContactsContactsClass.
|
||||
type ContactsContactsClassArray []ContactsContactsClass
|
||||
|
||||
// Sort sorts slice of ContactsContactsClass.
|
||||
func (s ContactsContactsClassArray) Sort(less func(a, b ContactsContactsClass) bool) ContactsContactsClassArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of ContactsContactsClass.
|
||||
func (s ContactsContactsClassArray) SortStable(less func(a, b ContactsContactsClass) bool) ContactsContactsClassArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of ContactsContactsClass.
|
||||
func (s ContactsContactsClassArray) Retain(keep func(x ContactsContactsClass) bool) ContactsContactsClassArray {
|
||||
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 ContactsContactsClassArray) First() (v ContactsContactsClass, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s ContactsContactsClassArray) Last() (v ContactsContactsClass, 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 *ContactsContactsClassArray) PopFirst() (v ContactsContactsClass, 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 ContactsContactsClass
|
||||
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 *ContactsContactsClassArray) Pop() (v ContactsContactsClass, 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
|
||||
}
|
||||
|
||||
// AsContactsContacts returns copy with only ContactsContacts constructors.
|
||||
func (s ContactsContactsClassArray) AsContactsContacts() (to ContactsContactsArray) {
|
||||
for _, elem := range s {
|
||||
value, ok := elem.(*ContactsContacts)
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
to = append(to, *value)
|
||||
}
|
||||
|
||||
return to
|
||||
}
|
||||
|
||||
// AppendOnlyModified appends only Modified constructors to
|
||||
// given slice.
|
||||
func (s ContactsContactsClassArray) AppendOnlyModified(to []*ContactsContacts) []*ContactsContacts {
|
||||
for _, elem := range s {
|
||||
value, ok := elem.AsModified()
|
||||
if !ok {
|
||||
continue
|
||||
}
|
||||
to = append(to, value)
|
||||
}
|
||||
|
||||
return to
|
||||
}
|
||||
|
||||
// AsModified returns copy with only Modified constructors.
|
||||
func (s ContactsContactsClassArray) AsModified() (to []*ContactsContacts) {
|
||||
return s.AppendOnlyModified(to)
|
||||
}
|
||||
|
||||
// FirstAsModified returns first element of slice (if exists).
|
||||
func (s ContactsContactsClassArray) FirstAsModified() (v *ContactsContacts, ok bool) {
|
||||
value, ok := s.First()
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
return value.AsModified()
|
||||
}
|
||||
|
||||
// LastAsModified returns last element of slice (if exists).
|
||||
func (s ContactsContactsClassArray) LastAsModified() (v *ContactsContacts, ok bool) {
|
||||
value, ok := s.Last()
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
return value.AsModified()
|
||||
}
|
||||
|
||||
// PopFirstAsModified returns element of slice (if exists).
|
||||
func (s *ContactsContactsClassArray) PopFirstAsModified() (v *ContactsContacts, ok bool) {
|
||||
value, ok := s.PopFirst()
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
return value.AsModified()
|
||||
}
|
||||
|
||||
// PopAsModified returns element of slice (if exists).
|
||||
func (s *ContactsContactsClassArray) PopAsModified() (v *ContactsContacts, ok bool) {
|
||||
value, ok := s.Pop()
|
||||
if !ok {
|
||||
return
|
||||
}
|
||||
return value.AsModified()
|
||||
}
|
||||
|
||||
// ContactsContactsArray is adapter for slice of ContactsContacts.
|
||||
type ContactsContactsArray []ContactsContacts
|
||||
|
||||
// Sort sorts slice of ContactsContacts.
|
||||
func (s ContactsContactsArray) Sort(less func(a, b ContactsContacts) bool) ContactsContactsArray {
|
||||
sort.Slice(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// SortStable sorts slice of ContactsContacts.
|
||||
func (s ContactsContactsArray) SortStable(less func(a, b ContactsContacts) bool) ContactsContactsArray {
|
||||
sort.SliceStable(s, func(i, j int) bool {
|
||||
return less(s[i], s[j])
|
||||
})
|
||||
return s
|
||||
}
|
||||
|
||||
// Retain filters in-place slice of ContactsContacts.
|
||||
func (s ContactsContactsArray) Retain(keep func(x ContactsContacts) bool) ContactsContactsArray {
|
||||
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 ContactsContactsArray) First() (v ContactsContacts, ok bool) {
|
||||
if len(s) < 1 {
|
||||
return
|
||||
}
|
||||
return s[0], true
|
||||
}
|
||||
|
||||
// Last returns last element of slice (if exists).
|
||||
func (s ContactsContactsArray) Last() (v ContactsContacts, 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 *ContactsContactsArray) PopFirst() (v ContactsContacts, 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 ContactsContacts
|
||||
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 *ContactsContactsArray) Pop() (v ContactsContacts, 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
|
||||
}
|
||||
Reference in New Issue
Block a user