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