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 WalletStateClassArray []WalletStateClass
func (s WalletStateClassArray ) Sort (less func (a , b WalletStateClass ) bool ) WalletStateClassArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateClassArray ) SortStable (less func (a , b WalletStateClass ) bool ) WalletStateClassArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateClassArray ) Retain (keep func (x WalletStateClass ) bool ) WalletStateClassArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s WalletStateClassArray ) First () (v WalletStateClass , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s WalletStateClassArray ) Last () (v WalletStateClass , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *WalletStateClassArray ) PopFirst () (v WalletStateClass , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero WalletStateClass
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *WalletStateClassArray ) Pop () (v WalletStateClass , 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 WalletStateClassArray ) AsWalletStateEmpty () (to WalletStateEmptyArray ) {
for _ , elem := range s {
value , ok := elem .(*WalletStateEmpty )
if !ok {
continue
}
to = append (to , *value )
}
return to
}
func (s WalletStateClassArray ) AsWalletState () (to WalletStateArray ) {
for _ , elem := range s {
value , ok := elem .(*WalletState )
if !ok {
continue
}
to = append (to , *value )
}
return to
}
func (s WalletStateClassArray ) AppendOnlyNotEmpty (to []*WalletState ) []*WalletState {
for _ , elem := range s {
value , ok := elem .AsNotEmpty ()
if !ok {
continue
}
to = append (to , value )
}
return to
}
func (s WalletStateClassArray ) AsNotEmpty () (to []*WalletState ) {
return s .AppendOnlyNotEmpty (to )
}
func (s WalletStateClassArray ) FirstAsNotEmpty () (v *WalletState , ok bool ) {
value , ok := s .First ()
if !ok {
return
}
return value .AsNotEmpty ()
}
func (s WalletStateClassArray ) LastAsNotEmpty () (v *WalletState , ok bool ) {
value , ok := s .Last ()
if !ok {
return
}
return value .AsNotEmpty ()
}
func (s *WalletStateClassArray ) PopFirstAsNotEmpty () (v *WalletState , ok bool ) {
value , ok := s .PopFirst ()
if !ok {
return
}
return value .AsNotEmpty ()
}
func (s *WalletStateClassArray ) PopAsNotEmpty () (v *WalletState , ok bool ) {
value , ok := s .Pop ()
if !ok {
return
}
return value .AsNotEmpty ()
}
type WalletStateEmptyArray []WalletStateEmpty
func (s WalletStateEmptyArray ) Sort (less func (a , b WalletStateEmpty ) bool ) WalletStateEmptyArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateEmptyArray ) SortStable (less func (a , b WalletStateEmpty ) bool ) WalletStateEmptyArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateEmptyArray ) Retain (keep func (x WalletStateEmpty ) bool ) WalletStateEmptyArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s WalletStateEmptyArray ) First () (v WalletStateEmpty , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s WalletStateEmptyArray ) Last () (v WalletStateEmpty , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *WalletStateEmptyArray ) PopFirst () (v WalletStateEmpty , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero WalletStateEmpty
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *WalletStateEmptyArray ) Pop () (v WalletStateEmpty , 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 WalletStateArray []WalletState
func (s WalletStateArray ) Sort (less func (a , b WalletState ) bool ) WalletStateArray {
sort .Slice (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateArray ) SortStable (less func (a , b WalletState ) bool ) WalletStateArray {
sort .SliceStable (s , func (i , j int ) bool {
return less (s [i ], s [j ])
})
return s
}
func (s WalletStateArray ) Retain (keep func (x WalletState ) bool ) WalletStateArray {
n := 0
for _ , x := range s {
if keep (x ) {
s [n ] = x
n ++
}
}
s = s [:n ]
return s
}
func (s WalletStateArray ) First () (v WalletState , ok bool ) {
if len (s ) < 1 {
return
}
return s [0 ], true
}
func (s WalletStateArray ) Last () (v WalletState , ok bool ) {
if len (s ) < 1 {
return
}
return s [len (s )-1 ], true
}
func (s *WalletStateArray ) PopFirst () (v WalletState , ok bool ) {
if s == nil || len (*s ) < 1 {
return
}
a := *s
v = a [0 ]
copy (a [0 :], a [1 :])
var zero WalletState
a [len (a )-1 ] = zero
a = a [:len (a )-1 ]
*s = a
return v , true
}
func (s *WalletStateArray ) Pop () (v WalletState , 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.7 . (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 .