package tg
import (
"context"
"errors"
"fmt"
"sort"
"strings"
"go.uber.org/multierr"
"github.com/gotd/td/bin"
"github.com/gotd/td/tdjson"
"github.com/gotd/td/tdp"
"github.com/gotd/td/tgerr"
)
var (
_ = bin .Buffer {}
_ = context .Background ()
_ = fmt .Stringer (nil )
_ = strings .Builder {}
_ = errors .Is
_ = multierr .AppendInto
_ = sort .Ints
_ = tdp .Format
_ = tgerr .Error {}
_ = tdjson .Encoder {}
)
type InputCollectibleClassArray []InputCollectibleClass
func (s InputCollectibleClassArray ) Sort (less func (a , b InputCollectibleClass ) bool ) InputCollectibleClassArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectibleClassArray ) SortStable (less func (a , b InputCollectibleClass ) bool ) InputCollectibleClassArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectibleClassArray ) Retain (keep func (x InputCollectibleClass ) bool ) InputCollectibleClassArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s InputCollectibleClassArray ) First () (v InputCollectibleClass , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s InputCollectibleClassArray ) Last () (v InputCollectibleClass , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *InputCollectibleClassArray ) PopFirst () (v InputCollectibleClass , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero InputCollectibleClass
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *InputCollectibleClassArray ) Pop () (v InputCollectibleClass , 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
}
func (s InputCollectibleClassArray ) AsInputCollectibleUsername () (to InputCollectibleUsernameArray ) {
for _ , elem := range s {
value , ok := elem .(*InputCollectibleUsername )
if !ok {
continue
}
to = append (to , *value )
}
return to
}
func (s InputCollectibleClassArray ) AsInputCollectiblePhone () (to InputCollectiblePhoneArray ) {
for _ , elem := range s {
value , ok := elem .(*InputCollectiblePhone )
if !ok {
continue
}
to = append (to , *value )
}
return to
}
type InputCollectibleUsernameArray []InputCollectibleUsername
func (s InputCollectibleUsernameArray ) Sort (less func (a , b InputCollectibleUsername ) bool ) InputCollectibleUsernameArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectibleUsernameArray ) SortStable (less func (a , b InputCollectibleUsername ) bool ) InputCollectibleUsernameArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectibleUsernameArray ) Retain (keep func (x InputCollectibleUsername ) bool ) InputCollectibleUsernameArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s InputCollectibleUsernameArray ) First () (v InputCollectibleUsername , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s InputCollectibleUsernameArray ) Last () (v InputCollectibleUsername , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *InputCollectibleUsernameArray ) PopFirst () (v InputCollectibleUsername , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero InputCollectibleUsername
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *InputCollectibleUsernameArray ) Pop () (v InputCollectibleUsername , 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
}
type InputCollectiblePhoneArray []InputCollectiblePhone
func (s InputCollectiblePhoneArray ) Sort (less func (a , b InputCollectiblePhone ) bool ) InputCollectiblePhoneArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectiblePhoneArray ) SortStable (less func (a , b InputCollectiblePhone ) bool ) InputCollectiblePhoneArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s InputCollectiblePhoneArray ) Retain (keep func (x InputCollectiblePhone ) bool ) InputCollectiblePhoneArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s InputCollectiblePhoneArray ) First () (v InputCollectiblePhone , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s InputCollectiblePhoneArray ) Last () (v InputCollectiblePhone , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *InputCollectiblePhoneArray ) PopFirst () (v InputCollectiblePhone , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero InputCollectiblePhone
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *InputCollectiblePhoneArray ) Pop () (v InputCollectiblePhone , 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
}
The pages are generated with Golds v0.8.4 . (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu .
PR and bug reports are welcome and can be submitted to the issue list .
Please follow @zigo_101 (reachable from the left QR code) to get the latest news of Golds .