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