labels.tooltip_logout=Logout
labels.advance=Pencarian Lanjutan
labels.advance_search_title=Pencarian Lanjutan
labels.advance_search_must_queries=dengan semua kata
labels.advance_search_phrase_query=dengan frasa yang tepat
labels.advance_search_should_queries=dengan setidaknya satu dari kata
labels.advance_search_not_queries=tanpa kata
labels.advance_search_filetype=Jenis berkas
labels.advance_search_filetype_default=Format apa pun

pkg bytes, func Map(func(int32) int32, []uint8) []uint8
pkg bytes, func NewBuffer([]uint8) *Buffer
pkg bytes, func NewBufferString(string) *Buffer
pkg bytes, func NewReader([]uint8) *Reader
pkg bytes, func Repeat([]uint8, int) []uint8
pkg bytes, func Replace([]uint8, []uint8, []uint8, int) []uint8
pkg bytes, func Runes([]uint8) []int32
pkg bytes, func Split([]uint8, []uint8) [][]uint8

pkg regexp/syntax, const ErrInvalidPerlOp = "invalid or unsupported Perl syntax"
pkg regexp/syntax, const ErrInvalidRepeatOp = "invalid nested repetition operator"
pkg regexp/syntax, const ErrInvalidRepeatSize = "invalid repeat count"
pkg regexp/syntax, const ErrInvalidUTF8 = "invalid UTF-8"
pkg regexp/syntax, const ErrMissingBracket = "missing closing ]"
pkg regexp/syntax, const ErrMissingParen = "missing closing )"

<p>
When solving type equations from type constraints,
solving one equation may infer additional type arguments,
which in turn may enable solving other equations that depend
on those type arguments.
Type inference repeats type unification as long as new type
arguments are inferred.
</p>

<h3 id="Operators">Operators</h3>

<p>
Operators combine operands into expressions.
</p>

<pre class="ebnf">