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