Source File
	tl_input_rich_message_slices_gen.go

Belonging Package
	github.com/gotd/td/tg

//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"

	"github.com/gotd/td/bin"
	"github.com/gotd/td/tdjson"
	"github.com/gotd/td/tdp"
	"github.com/gotd/td/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{}
)

// InputRichMessageClassArray is adapter for slice of InputRichMessageClass.
type InputRichMessageClassArray []InputRichMessageClass

// Sort sorts slice of InputRichMessageClass.
func (s InputRichMessageClassArray) Sort(less func(a, b InputRichMessageClass) bool) InputRichMessageClassArray {
	sort.Slice(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// SortStable sorts slice of InputRichMessageClass.
func (s InputRichMessageClassArray) SortStable(less func(a, b InputRichMessageClass) bool) InputRichMessageClassArray {
	sort.SliceStable(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// Retain filters in-place slice of InputRichMessageClass.
func (s InputRichMessageClassArray) Retain(keep func(x InputRichMessageClass) bool) InputRichMessageClassArray {
	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 InputRichMessageClassArray) First() (v InputRichMessageClass, ok bool) {
	if len(s) < 1 {
		return
	}
	return s[0], true
}

// Last returns last element of slice (if exists).
func (s InputRichMessageClassArray) Last() (v InputRichMessageClass, 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 *InputRichMessageClassArray) PopFirst() (v InputRichMessageClass, 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 InputRichMessageClass
	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 *InputRichMessageClassArray) Pop() (v InputRichMessageClass, 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
}

// AsInputRichMessage returns copy with only InputRichMessage constructors.
func (s InputRichMessageClassArray) AsInputRichMessage() (to InputRichMessageArray) {
	for _, elem := range s {
		value, ok := elem.(*InputRichMessage)
		if !ok {
			continue
		}
		to = append(to, *value)
	}

	return to
}

// AsInputRichMessageHTML returns copy with only InputRichMessageHTML constructors.
func (s InputRichMessageClassArray) AsInputRichMessageHTML() (to InputRichMessageHTMLArray) {
	for _, elem := range s {
		value, ok := elem.(*InputRichMessageHTML)
		if !ok {
			continue
		}
		to = append(to, *value)
	}

	return to
}

// AsInputRichMessageMarkdown returns copy with only InputRichMessageMarkdown constructors.
func (s InputRichMessageClassArray) AsInputRichMessageMarkdown() (to InputRichMessageMarkdownArray) {
	for _, elem := range s {
		value, ok := elem.(*InputRichMessageMarkdown)
		if !ok {
			continue
		}
		to = append(to, *value)
	}

	return to
}

// InputRichMessageArray is adapter for slice of InputRichMessage.
type InputRichMessageArray []InputRichMessage

// Sort sorts slice of InputRichMessage.
func (s InputRichMessageArray) Sort(less func(a, b InputRichMessage) bool) InputRichMessageArray {
	sort.Slice(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// SortStable sorts slice of InputRichMessage.
func (s InputRichMessageArray) SortStable(less func(a, b InputRichMessage) bool) InputRichMessageArray {
	sort.SliceStable(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// Retain filters in-place slice of InputRichMessage.
func (s InputRichMessageArray) Retain(keep func(x InputRichMessage) bool) InputRichMessageArray {
	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 InputRichMessageArray) First() (v InputRichMessage, ok bool) {
	if len(s) < 1 {
		return
	}
	return s[0], true
}

// Last returns last element of slice (if exists).
func (s InputRichMessageArray) Last() (v InputRichMessage, 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 *InputRichMessageArray) PopFirst() (v InputRichMessage, 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 InputRichMessage
	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 *InputRichMessageArray) Pop() (v InputRichMessage, 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
}

// InputRichMessageHTMLArray is adapter for slice of InputRichMessageHTML.
type InputRichMessageHTMLArray []InputRichMessageHTML

// Sort sorts slice of InputRichMessageHTML.
func (s InputRichMessageHTMLArray) Sort(less func(a, b InputRichMessageHTML) bool) InputRichMessageHTMLArray {
	sort.Slice(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// SortStable sorts slice of InputRichMessageHTML.
func (s InputRichMessageHTMLArray) SortStable(less func(a, b InputRichMessageHTML) bool) InputRichMessageHTMLArray {
	sort.SliceStable(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// Retain filters in-place slice of InputRichMessageHTML.
func (s InputRichMessageHTMLArray) Retain(keep func(x InputRichMessageHTML) bool) InputRichMessageHTMLArray {
	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 InputRichMessageHTMLArray) First() (v InputRichMessageHTML, ok bool) {
	if len(s) < 1 {
		return
	}
	return s[0], true
}

// Last returns last element of slice (if exists).
func (s InputRichMessageHTMLArray) Last() (v InputRichMessageHTML, 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 *InputRichMessageHTMLArray) PopFirst() (v InputRichMessageHTML, 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 InputRichMessageHTML
	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 *InputRichMessageHTMLArray) Pop() (v InputRichMessageHTML, 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
}

// InputRichMessageMarkdownArray is adapter for slice of InputRichMessageMarkdown.
type InputRichMessageMarkdownArray []InputRichMessageMarkdown

// Sort sorts slice of InputRichMessageMarkdown.
func (s InputRichMessageMarkdownArray) Sort(less func(a, b InputRichMessageMarkdown) bool) InputRichMessageMarkdownArray {
	sort.Slice(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// SortStable sorts slice of InputRichMessageMarkdown.
func (s InputRichMessageMarkdownArray) SortStable(less func(a, b InputRichMessageMarkdown) bool) InputRichMessageMarkdownArray {
	sort.SliceStable(s, func(i, j int) bool {
		return less(s[i], s[j])
	})
	return s
}

// Retain filters in-place slice of InputRichMessageMarkdown.
func (s InputRichMessageMarkdownArray) Retain(keep func(x InputRichMessageMarkdown) bool) InputRichMessageMarkdownArray {
	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 InputRichMessageMarkdownArray) First() (v InputRichMessageMarkdown, ok bool) {
	if len(s) < 1 {
		return
	}
	return s[0], true
}

// Last returns last element of slice (if exists).
func (s InputRichMessageMarkdownArray) Last() (v InputRichMessageMarkdown, 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 *InputRichMessageMarkdownArray) PopFirst() (v InputRichMessageMarkdown, 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 InputRichMessageMarkdown
	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 *InputRichMessageMarkdownArray) Pop() (v InputRichMessageMarkdown, 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.