Что значит в golang

Обзор синтаксиса языка Go. Основы

В этой статье я хотел бы описать синтаксис языка Go.Синтаксис языка Go очень похож на C, но с отдельными элементами из Оберона и скриптовых языков.В этой статье я постараюсь подробное объяснение, как создаются переменные, функции и так далее

Я думаю, приступим сразу.

Точка с запятой

Точка с запятой в Go ставится в основном только в конструкциях for, for range, так как компилятор Go ставит точки с запятой автоматически в конце каждой строке.Из-за этого, при построении конструкций и функций нельзя переносить фигурную строчку на новую строку.

Переменные

В Go строгая статическая типизация, а при объявлении в функции — утиная.При создании функции вне функции применяется директива var, которая можно группировать в одну, а в функции — её сокращение :=

Примечание: Go отлично поддерживает Unicode и может создавать название переменных с использованием русского языка.

Пакеты

Пакеты в Go подключаются почти так-же как и переменные, но с использованием директивы import

Использование пакетов

В Go странная видимость переменных.Все переменные являются глобальными, но при использовании переменных и функций из одного пакета в другом, глобальными являются только те, что начинаются с большой буквы

Функции

Функции создаются при помощи директивы func.Структура объявления:

Конструкция if

Конструкция if в Go очень похожа на её аналог в языке C, кроме того, что в ней нет круглых скобок

Конструкция switch

У конструкции есть две версии:
1.Аналог из языка C
2.Уникальную, хотя возможно она есть в других языках
Отличие 2 конструкции от 1 в том, что она не принимает выражение, которое нужно проверять.Лучше просто посмотрите на код.

Конструкция for

Конструкция for в Go аналог конструкции в C, кроме того, что в ней не используются круглые скобки

Это всего лишь основы.В языке Go много хорошего и его функционал не ограничен тем, что написал я.

Введение в язык GoLang для новичков!

Здравствуйте, в этой статье мы познакомимся с базовым синтаксисом языка программирования Go и рассмотрим лучшие ресурсы для его дальнейшего углублённого изучения.

Go — молодой компилируемый многопоточный язык программирования, разработанный Google. Его разработка началась в сентябре 2007 и официально он был представлен уже в 2009 году.

Этот ЯП активно развиваться благодаря тому что его разрабатывают в open-source среде. Язык сразу пришёлся по вкусу многим разработчикам за счёт своей простоты и большого количества высокопроизводительных библиотек.

Go может рассматриваться как попытка создать замену языкам Си и C++ с учётом изменившихся компьютерных технологий и накопленного опыта разработки крупных систем.

В настоящее время Go большими темпами набирает популярность и уже используется многими компаниями. Список некоторых из них:

• Google(ещё бы не использовать своё детище);
• Uber;
• Mozilla;
• Intel;
• Dropbox и ещё множество молодых tech компаний.

Содержание

1. Пишем “Hello World”
2. Переменные
3. Массивы
4. Условные конструкции: if else, switch
5. Цикл for
6. Дальнейшее изучение Go

1. Пишем “Hello World”

“Hello World” — это популярный способ для начала изучения ЯП. Для запуска кода нужно установить SDK. Go SDK можно скачать здесь.

После успешной установки SDK, нам необходимо записать свой первый фрагмент кода в файл с расширением .go и запустить его исполнение в командной строке. Для запуска используют команду: go run file_name.go

Код изображён на картинках, чтоб вы сразу начали писать на Go. Таким образом, те кто будут дублировать код из примеров, смогут быстрее запомнить все описанные ниже конструкции.

Команда fmt.Println() используется для отображения символов в консоли. Буква “P” после fmt. должна быть заглавной и в конце строчки нету точка с запятой!

В дальнейших примерах, для краткости первые три строчки будут скрыты, но вам не стоит их удалять, они нужны для корректного выполнения кода!

2. Переменные

Что же подразумевает термин переменная?

Переменная — это именованное хранилище данных которое мы с вами можем определять. В множестве ЯП также реализованы различные механизмы для хранения данных.

Для создания переменной достаточно написать следующую конструкцию:

Для создания переменной достаточно будет написать ключевое слов var (сокращение от англ. variable — переменная) и её имя. Для присвоения переменной конкретного значения (инициализации) используется знак ‘=’. После него можно указать значение. Например: 123, 3.12, false, “string” и т.д.

Хоть Go и является строго типизированным языком, при инициализации переменных их тип указывать не обязательно (неявная типизация).

В примере присвоим переменным базовые типы данных которые предлагает Go:

Также для инициализации переменных доступен следующий синтаксис:

3. Массивы

Массив(англ. array) — это переменная которая может хранить в себе коллекцию из значений/переменных (одного типа) и предоставлять к ним доступ по индексу(номеру элемента в последовательности). Посмотрим, как инициализировать и объявлять массивы в Go:

Индекс — это номер элемента массива, по которому можно получить его значение, а также изменить его. Нумерация элементов начинается с нуля, соответственно первый элемент будет иметь нулевой индекс. Индекс указывают в квадратных скобках после имени массива.

4. Условные конструкции: if else, switch

Условные конструкции проверяют истинность некоторого логического выражения (a > b, a < b, a == b, a != b и т.д.) и в зависимости от результата проверки (или ) позволяют направить ход программы по одному из описанных путей.

Конструкция if … else

Конструкция if принимает условие — логическое выражение(возвращает значение типа bool). При истинности условия, выполняется блок инструкций внутри скобок.

Блок с else добавляется если указанное условие в if являться ложным и необходимо задать альтернативный ход выполнения.

Если необходимо проверить несколько альтернативных вариантов, после блока с оператором if,можно добавить, любое количество операторов else if.

Конструкция switch

Конструкция switch проверяет значение выражения внутри круглых скобок. После операторов case определяются значения для сравнения. Если значение в switch совпадает со значением из case, код от знака ‘:’ до следующего case оператора или же закрывающей скобки switch, будет выполнен.

В качестве выражения конструкция switch использует переменную a. Ее значение последовательно сравнивается со значениями после операторов case.

Блок default не обязательно указывать, он выполняется если ни один из кейсов не совпал с выражением внутри switch.

5. Цикл for

Циклы позволяют в зависимости от определенного условия выполнять некоторые действия множество раз. В Go есть только один цикл — for, который может принимать разные формы. Посмотрим как определить этот цикл:

Объявление цикла for разбивается на три части:

Первая часть это инициализация счетчика i := 1 . Фактически это объявление переменной, которая будет использоваться лишь внутри цикла. В примере присвоили начальное значение 1.

Вторая часть это условие: i < 10 . Пока это условие истинно, то есть выражение (i < 10) == true , цикл будет продолжаться.

Третья часть это изменение (увеличение/уменьшение) значения счетчика в зависимости от указанного вами действия:

После объявления, внутри кавычек описывается тело цикла. В примере на консоль выводится квадрат числа i.

Цикл из примера сработает только 9 раз, пока значение i не станет равным 10. Каждый отдельный проход цикла по своему телу называется итерацией.

В примере 1 итерация это увеличение значения i на 1.

Также условные конструкции и конструкции циклов могут быть вложенными друг в друга. Рассмотрим пример программы для вывода таблицы умножения:

Перебор массива

Для перебора массивов можно использовать следующую форму цикла for:

for индекс, элемент_по_индексу := range имя_массива < // тело цикла >

Оператор continue используется когда при определенных условиях, нужно завершить текущую итерацию цикла и сразу же перейти к следующей итерации. В пример выше, мы не хотим выводить элементы массива со значением “Nibbles”, в таком случае стоит воспользоваться continue.

Оператор break следует используется если необходимо полностью выйти из цикла и продолжить выполнение кода после него.

Golang: основы для начинающих

Golang, или Go — язык программирования, начало которого было положено в 2007 году сотрудниками компании Google. В этом руководстве по Golang мы рассмотрим, как установить необходимое ПО и написать свою первую программу.

Go поддерживает типобезопасность, возможность динамического ввода данных, а также содержит богатую стандартную библиотеку функций и встроенные типы данных вроде массивов с динамическим размером и ассоциативных массивов.

С помощью механизмов многопоточности Go упрощает распределение вычислений и сетевого взаимодействия, а современные типы данных открывают программисту мир гибкого и модульного кода. Программа быстро компилируется, при этом есть сборщик мусора и поддерживается рефлексия.

Это быстрый, статически типизированный, компилируемый язык, при использовании которого создается впечатление использования динамически типизированного и интерпретируемого языка.

Примечание Вы читаете улучшенную версию некогда выпущенной нами статьи.

Настройка окружения

Для начала скачаем 64-битную версию Go c официального сайта. В зависимости от используемой операционной системы выполняем следующие действия.

UNIX / Linux / MacOS / FreeBSD

Извлекаем скачанный архив в папку /usr/local/go . Например:

Добавляем папку /usr/local/go/bin в переменную окружения PATH :

Windows

Используем MSI файл и следуем инструкциям. По умолчанию инструменты Go размещаются в папке С:\Go . При установке папка C :\Go\bin автоматически добавится в системную переменную PATH .

Чтобы изменения вступили в силу, перезапустим все открытые окна эмуляторов терминала.

Проверяем корректность установки, создав и выполнив файл C:\Projects\Go\test.go :

Выполним этот код и получим следующий результат:

Синтаксис

Пакеты

Каждая программа на языке Go состоит из пакетов (packages). Пакет main — главный, с него начинается выполнение программы. В приведённом выше примере импортируется пакет fmt .

Импорт

Импорт пакетов можно описать двумя способами.

Функции

Общая форма определения функции выглядит следующим образом:

Количество и тип входных аргументов может быть любым. Для примера опишем функцию add с двумя входными параметрами формата int :

Выполним этот код и получим следующий результат:

Переменные

Определение переменной в Go означает передачу компилятору информации о типе данных, а так же о месте и объёме хранилища, которое создаётся для этой переменной. Определять переменные одного типа можно по одному и списком. Общая форма такая:

С помощью оператора var определяем перечень переменных, причём тип данных указываем в конце выражения.

Объявление возможно как на уровне пакета, так и на уровне функции. Рассмотрим пример:

Выполним этот код и получим следующий результат:

Оператор цикла

В языке Go один оператор цикла — это for , который повторяет список инструкций заданное количество раз. Цикл состоит из трёх выражений:

1. Инициализация. Выполняется перед первой итерацией.
2. Условие. Вычисляется перед каждой итерацией.
3. Инкремент. Выполняется после каждой итерации.

Общая форма цикла выглядит так:

При инициализации кратко объявляются переменные, которые доступны только в пределах цикла.

Цикл останавливает свою работу, когда условие принимает значение false .

Примечание В отличие от таких языков, как C, Java и JavaScript, перечисленные выражения цикла не выделяются скобками. В данном случае обязательны лишь фигурные скобки, обрамляющие тело цикла.

Рассмотрим пример программы:

Выполним этот код и получим следующий результат:

Условный оператор

Форма определения условного оператора в Go выглядит следующим образом:

Если выражение в поле условия истинно, код, размещённый между фигурными скобками, выполнится.

Условие описывается значением, переменной или выражением. Например:

• true — выполняется всегда;
• a < 10 — выполняется, когда a меньше 10 ;
• (a < b) || (a < c) — выполняется, когда a меньше b или a меньше c ;
• (a < b) && (a < c) — выполняется, когда a меньше b и a меньше c .

Рассмотрим пример программы:

Выполним этот код и получим следующий результат:

Массивы

Язык программирования Go также поддерживает массивы, которые представляют из себя структуру данных фиксированного размера, состоящую из элементов одного типа. Массивы используются для хранения наборов данных, но полезно подразумевать под ними коллекцию переменных одного типа.

Чтобы объявить массив, необходимо указать тип и требуемое количество элементов следующим образом:

Например, чтобы создать массив balance , состоящий из десяти элементов типа float32 , используем следующее выражение:

Если значения элементов известны, для определения массива допустимо использовать следующую конструкцию:

Длина массива не изменяется, потому что является частью типа данных. Это кажется ограниченным решением, но не волнуйтесь: в Go реализована комфортная работа с массивами.

Рассмотрим пример программы:

Выполним этот код и получим следующий результат:

Срезы

Срезы (Slices) в Go — абстракция над массивами. Хотя встроенных способов увеличить размер массива динамически или сделать вложенный массив в Go нет, срезы убирают это ограничение. Они предоставляют полезные функции и широко используются программистами.

Объявить срез можно как массив, но без указания размера или с помощью функции make :

Размер массива фиксирован, а у среза изменяемый. По сути, срез — более общий вид массива.

Тип []T — срез с элементами типа T .

a[0:5] — срез 5 элементов массива a .

Рассмотрим пример программы:

Выполним этот код и получим следующий результат:

Структуры

Структура (structure) — пользовательский тип данных, который кроме прочего комбинирует элементы разных типов. Чтобы объявить структуру, используем выражения type и struct .

Struct определяет тип данных, которому соответствует два и более элементов.

Type связывает заданное имя с описанием структуры.

Форма описания выглядит следующим образом:

Как только структура типа определена, он может использоваться при объявлении новых переменных:

Чтобы получить доступ к элементам структуры, используем оператор доступа к элементу. Рассмотрим на примере:

Выполним этот код и получим следующий результат:

Чем Golang хорош для начинающих?

Концепция языка Golang разработана на основе опыта решения повседневных задач и не преследует цель сделать прорыв в программировании. Кроме того, Go не реализует ряд функций, которые делают другие языки (C++, Java и Python) настолько мощными. Но есть три причины, чтобы задуматься об использовании этого языка.

Читабельность

Как только привык к синтаксису Go, прочесть чужой код — тривиальная задача.

У каждого человека собственный «правильный» способ делать вещи, поэтому Go навязывает свой стиль программирования. В результате вопросы вроде использования или неиспользования фигурных скобок отпадают, и остаётся только писать код по заданным правилам. Поэтому Golang подходит для начинающих.

Скорость

За короткий промежуток времени можно написать быструю программу.

Производительность работы пакета на Go, возможно, будет меньше, чем при использовании С, зато скорость компиляции для больших программ будет выше. Для большинства проектов — приемлемый компромисс, причём при необходимости достаточно просто переписать код на языке Go.

Меньше ошибок

Большинство ошибок возникают в непроверенном или сложном коде.

Go предоставляет удобные средства для тестирования. Кроме того, строгая типизация устраняет ошибки вроде случайного сравнения количества яблок с количеством груш, которые определяются ещё на этапе компиляции.

Заключение

Если хотите погрузиться глубже в изучение, посмотрите нашу подборку бесплатных книг по знакомству с языком программирования Go, а главное — начните создавать маленькие программы, чтобы на практике понять тонкости языка. Удачи!

The Go Programming Language Specification

This is the reference manual for the Go programming language. The pre-Go1.18 version, without generics, can be found here. For more information and other documents, see golang.org.

Go is a general-purpose language designed with systems programming in mind. It is strongly typed and garbage-collected and has explicit support for concurrent programming. Programs are constructed from packages, whose properties allow efficient management of dependencies.

The syntax is compact and simple to parse, allowing for easy analysis by automatic tools such as integrated development environments.

Notation

The syntax is specified using a variant of Extended Backus-Naur Form (EBNF):

Productions are expressions constructed from terms and the following operators, in increasing precedence:

Lowercase production names are used to identify lexical (terminal) tokens. Non-terminals are in CamelCase. Lexical tokens are enclosed in double quotes «» or back quotes « .

The form a … b represents the set of characters from a through b as alternatives. The horizontal ellipsis … is also used elsewhere in the spec to informally denote various enumerations or code snippets that are not further specified. The character … (as opposed to the three characters . ) is not a token of the Go language.

Source code representation

Source code is Unicode text encoded in UTF-8. The text is not canonicalized, so a single accented code point is distinct from the same character constructed from combining an accent and a letter; those are treated as two code points. For simplicity, this document will use the unqualified term character to refer to a Unicode code point in the source text.

Each code point is distinct; for instance, uppercase and lowercase letters are different characters.

Implementation restriction: For compatibility with other tools, a compiler may disallow the NUL character (U+0000) in the source text.

Implementation restriction: For compatibility with other tools, a compiler may ignore a UTF-8-encoded byte order mark (U+FEFF) if it is the first Unicode code point in the source text. A byte order mark may be disallowed anywhere else in the source.

Characters

The following terms are used to denote specific Unicode character categories:

In The Unicode Standard 8.0, Section 4.5 «General Category» defines a set of character categories. Go treats all characters in any of the Letter categories Lu, Ll, Lt, Lm, or Lo as Unicode letters, and those in the Number category Nd as Unicode digits.

Letters and digits

The underscore character _ (U+005F) is considered a lowercase letter.

Lexical elements

Comments

Comments serve as program documentation. There are two forms:

1. Line comments start with the character sequence // and stop at the end of the line.
2. General comments start with the character sequence /* and stop with the first subsequent character sequence */ .

A comment cannot start inside a rune or string literal, or inside a comment. A general comment containing no newlines acts like a space. Any other comment acts like a newline.

Tokens

Tokens form the vocabulary of the Go language. There are four classes: identifiers, keywords, operators and punctuation, and literals. White space, formed from spaces (U+0020), horizontal tabs (U+0009), carriage returns (U+000D), and newlines (U+000A), is ignored except as it separates tokens that would otherwise combine into a single token. Also, a newline or end of file may trigger the insertion of a semicolon. While breaking the input into tokens, the next token is the longest sequence of characters that form a valid token.

Semicolons

The formal syntax uses semicolons «;» as terminators in a number of productions. Go programs may omit most of these semicolons using the following two rules:

1. When the input is broken into tokens, a semicolon is automatically inserted into the token stream immediately after a line’s final token if that token is
   • an identifier
   • an integer, floating-point, imaginary, rune, or string literal
   • one of the keywords break , continue , fallthrough , or return
   • one of the operators and punctuation ++ , — , ) , ] , or >
2. To allow complex statements to occupy a single line, a semicolon may be omitted before a closing «)» or «>» .

To reflect idiomatic use, code examples in this document elide semicolons using these rules.

Identifiers

Identifiers name program entities such as variables and types. An identifier is a sequence of one or more letters and digits. The first character in an identifier must be a letter.

Some identifiers are predeclared.

Keywords

The following keywords are reserved and may not be used as identifiers.

Operators and punctuation

The following character sequences represent operators (including assignment operators) and punctuation:

Integer literals

An integer literal is a sequence of digits representing an integer constant. An optional prefix sets a non-decimal base: 0b or 0B for binary, 0 , 0o , or 0O for octal, and 0x or 0X for hexadecimal. A single 0 is considered a decimal zero. In hexadecimal literals, letters a through f and A through F represent values 10 through 15.

For readability, an underscore character _ may appear after a base prefix or between successive digits; such underscores do not change the literal’s value.

Floating-point literals

A floating-point literal is a decimal or hexadecimal representation of a floating-point constant.

A decimal floating-point literal consists of an integer part (decimal digits), a decimal point, a fractional part (decimal digits), and an exponent part ( e or E followed by an optional sign and decimal digits). One of the integer part or the fractional part may be elided; one of the decimal point or the exponent part may be elided. An exponent value exp scales the mantissa (integer and fractional part) by 10 exp .

A hexadecimal floating-point literal consists of a 0x or 0X prefix, an integer part (hexadecimal digits), a radix point, a fractional part (hexadecimal digits), and an exponent part ( p or P followed by an optional sign and decimal digits). One of the integer part or the fractional part may be elided; the radix point may be elided as well, but the exponent part is required. (This syntax matches the one given in IEEE 754-2008 §5.12.3.) An exponent value exp scales the mantissa (integer and fractional part) by 2 exp .

For readability, an underscore character _ may appear after a base prefix or between successive digits; such underscores do not change the literal value.

Imaginary literals

An imaginary literal represents the imaginary part of a complex constant. It consists of an integer or floating-point literal followed by the lowercase letter i . The value of an imaginary literal is the value of the respective integer or floating-point literal multiplied by the imaginary unit i.

For backward compatibility, an imaginary literal’s integer part consisting entirely of decimal digits (and possibly underscores) is considered a decimal integer, even if it starts with a leading 0 .

Rune literals

A rune literal represents a rune constant, an integer value identifying a Unicode code point. A rune literal is expressed as one or more characters enclosed in single quotes, as in ‘x’ or ‘\n’ . Within the quotes, any character may appear except newline and unescaped single quote. A single quoted character represents the Unicode value of the character itself, while multi-character sequences beginning with a backslash encode values in various formats.

The simplest form represents the single character within the quotes; since Go source text is Unicode characters encoded in UTF-8, multiple UTF-8-encoded bytes may represent a single integer value. For instance, the literal ‘a’ holds a single byte representing a literal a , Unicode U+0061, value 0x61 , while ‘ä’ holds two bytes ( 0xc3 0xa4 ) representing a literal a -dieresis, U+00E4, value 0xe4 .

Several backslash escapes allow arbitrary values to be encoded as ASCII text. There are four ways to represent the integer value as a numeric constant: \x followed by exactly two hexadecimal digits; \u followed by exactly four hexadecimal digits; \U followed by exactly eight hexadecimal digits, and a plain backslash \ followed by exactly three octal digits. In each case the value of the literal is the value represented by the digits in the corresponding base.

Although these representations all result in an integer, they have different valid ranges. Octal escapes must represent a value between 0 and 255 inclusive. Hexadecimal escapes satisfy this condition by construction. The escapes \u and \U represent Unicode code points so within them some values are illegal, in particular those above 0x10FFFF and surrogate halves.

After a backslash, certain single-character escapes represent special values:

An unrecognized character following a backslash in a rune literal is illegal.

String literals

A string literal represents a string constant obtained from concatenating a sequence of characters. There are two forms: raw string literals and interpreted string literals.

Raw string literals are character sequences between back quotes, as in `foo` . Within the quotes, any character may appear except back quote. The value of a raw string literal is the string composed of the uninterpreted (implicitly UTF-8-encoded) characters between the quotes; in particular, backslashes have no special meaning and the string may contain newlines. Carriage return characters (‘\r’) inside raw string literals are discarded from the raw string value.

Interpreted string literals are character sequences between double quotes, as in "bar" . Within the quotes, any character may appear except newline and unescaped double quote. The text between the quotes forms the value of the literal, with backslash escapes interpreted as they are in rune literals (except that \’ is illegal and \» is legal), with the same restrictions. The three-digit octal ( \ nnn) and two-digit hexadecimal ( \x nn) escapes represent individual bytes of the resulting string; all other escapes represent the (possibly multi-byte) UTF-8 encoding of individual characters. Thus inside a string literal \377 and \xFF represent a single byte of value 0xFF =255, while ÿ , \u00FF , \U000000FF and \xc3\xbf represent the two bytes 0xc3 0xbf of the UTF-8 encoding of character U+00FF.

These examples all represent the same string:

If the source code represents a character as two code points, such as a combining form involving an accent and a letter, the result will be an error if placed in a rune literal (it is not a single code point), and will appear as two code points if placed in a string literal.

Constants

There are boolean constants, rune constants, integer constants, floating-point constants, complex constants, and string constants. Rune, integer, floating-point, and complex constants are collectively called numeric constants.

A constant value is represented by a rune, integer, floating-point, imaginary, or string literal, an identifier denoting a constant, a constant expression, a conversion with a result that is a constant, or the result value of some built-in functions such as unsafe.Sizeof applied to certain values, cap or len applied to some expressions, real and imag applied to a complex constant and complex applied to numeric constants. The boolean truth values are represented by the predeclared constants true and false . The predeclared identifier iota denotes an integer constant.

In general, complex constants are a form of constant expression and are discussed in that section.

Numeric constants represent exact values of arbitrary precision and do not overflow. Consequently, there are no constants denoting the IEEE-754 negative zero, infinity, and not-a-number values.

Constants may be typed or untyped. Literal constants, true , false , iota , and certain constant expressions containing only untyped constant operands are untyped.

A constant may be given a type explicitly by a constant declaration or conversion, or implicitly when used in a variable declaration or an assignment statement or as an operand in an expression. It is an error if the constant value cannot be represented as a value of the respective type. If the type is a type parameter, the constant is converted into a non-constant value of the type parameter.

An untyped constant has a default type which is the type to which the constant is implicitly converted in contexts where a typed value is required, for instance, in a short variable declaration such as i := 0 where there is no explicit type. The default type of an untyped constant is bool , rune , int , float64 , complex128 or string respectively, depending on whether it is a boolean, rune, integer, floating-point, complex, or string constant.

Implementation restriction: Although numeric constants have arbitrary precision in the language, a compiler may implement them using an internal representation with limited precision. That said, every implementation must:

• Represent integer constants with at least 256 bits.
• Represent floating-point constants, including the parts of a complex constant, with a mantissa of at least 256 bits and a signed binary exponent of at least 16 bits.
• Give an error if unable to represent an integer constant precisely.
• Give an error if unable to represent a floating-point or complex constant due to overflow.
• Round to the nearest representable constant if unable to represent a floating-point or complex constant due to limits on precision.

These requirements apply both to literal constants and to the result of evaluating constant expressions.

Variables

A variable is a storage location for holding a value. The set of permissible values is determined by the variable’s type.

A variable declaration or, for function parameters and results, the signature of a function declaration or function literal reserves storage for a named variable. Calling the built-in function new or taking the address of a composite literal allocates storage for a variable at run time. Such an anonymous variable is referred to via a (possibly implicit) pointer indirection.

Structured variables of array, slice, and struct types have elements and fields that may be addressed individually. Each such element acts like a variable.

The static type (or just type) of a variable is the type given in its declaration, the type provided in the new call or composite literal, or the type of an element of a structured variable. Variables of interface type also have a distinct dynamic type, which is the (non-interface) type of the value assigned to the variable at run time (unless the value is the predeclared identifier nil , which has no type). The dynamic type may vary during execution but values stored in interface variables are always assignable to the static type of the variable.

A variable’s value is retrieved by referring to the variable in an expression; it is the most recent value assigned to the variable. If a variable has not yet been assigned a value, its value is the zero value for its type.

Types

A type determines a set of values together with operations and methods specific to those values. A type may be denoted by a type name, if it has one, which must be followed by type arguments if the type is generic. A type may also be specified using a type literal, which composes a type from existing types.

The language predeclares certain type names. Others are introduced with type declarations or type parameter lists. Composite types—array, struct, pointer, function, interface, slice, map, and channel types—may be constructed using type literals.

Predeclared types, defined types, and type parameters are called named types. An alias denotes a named type if the type given in the alias declaration is a named type.

Boolean types

A boolean type represents the set of Boolean truth values denoted by the predeclared constants true and false . The predeclared boolean type is bool ; it is a defined type.

Numeric types

An integer, floating-point, or complex type represents the set of integer, floating-point, or complex values, respectively. They are collectively called numeric types. The predeclared architecture-independent numeric types are:

The value of an n-bit integer is n bits wide and represented using two’s complement arithmetic.

There is also a set of predeclared integer types with implementation-specific sizes:

To avoid portability issues all numeric types are defined types and thus distinct except byte , which is an alias for uint8 , and rune , which is an alias for int32 . Explicit conversions are required when different numeric types are mixed in an expression or assignment. For instance, int32 and int are not the same type even though they may have the same size on a particular architecture.

String types

A string type represents the set of string values. A string value is a (possibly empty) sequence of bytes. The number of bytes is called the length of the string and is never negative. Strings are immutable: once created, it is impossible to change the contents of a string. The predeclared string type is string ; it is a defined type.

The length of a string s can be discovered using the built-in function len . The length is a compile-time constant if the string is a constant. A string’s bytes can be accessed by integer indices 0 through len(s)-1 . It is illegal to take the address of such an element; if s[i] is the i ‘th byte of a string, &s[i] is invalid.

Array types

An array is a numbered sequence of elements of a single type, called the element type. The number of elements is called the length of the array and is never negative.

The length is part of the array’s type; it must evaluate to a non-negative constant representable by a value of type int . The length of array a can be discovered using the built-in function len . The elements can be addressed by integer indices 0 through len(a)-1 . Array types are always one-dimensional but may be composed to form multi-dimensional types.

An array type T may not have an element of type T , or of a type containing T as a component, directly or indirectly, if those containing types are only array or struct types.

Slice types

A slice is a descriptor for a contiguous segment of an underlying array and provides access to a numbered sequence of elements from that array. A slice type denotes the set of all slices of arrays of its element type. The number of elements is called the length of the slice and is never negative. The value of an uninitialized slice is nil .

The length of a slice s can be discovered by the built-in function len ; unlike with arrays it may change during execution. The elements can be addressed by integer indices 0 through len(s)-1 . The slice index of a given element may be less than the index of the same element in the underlying array.

A slice, once initialized, is always associated with an underlying array that holds its elements. A slice therefore shares storage with its array and with other slices of the same array; by contrast, distinct arrays always represent distinct storage.

The array underlying a slice may extend past the end of the slice. The capacity is a measure of that extent: it is the sum of the length of the slice and the length of the array beyond the slice; a slice of length up to that capacity can be created by slicing a new one from the original slice. The capacity of a slice a can be discovered using the built-in function cap(a) .

A new, initialized slice value for a given element type T may be made using the built-in function make , which takes a slice type and parameters specifying the length and optionally the capacity. A slice created with make always allocates a new, hidden array to which the returned slice value refers. That is, executing

produces the same slice as allocating an array and slicing it, so these two expressions are equivalent:

Like arrays, slices are always one-dimensional but may be composed to construct higher-dimensional objects. With arrays of arrays, the inner arrays are, by construction, always the same length; however with slices of slices (or arrays of slices), the inner lengths may vary dynamically. Moreover, the inner slices must be initialized individually.

Struct types

A struct is a sequence of named elements, called fields, each of which has a name and a type. Field names may be specified explicitly (IdentifierList) or implicitly (EmbeddedField). Within a struct, non-blank field names must be unique.

A field declared with a type but no explicit field name is called an embedded field. An embedded field must be specified as a type name T or as a pointer to a non-interface type name *T , and T itself may not be a pointer type. The unqualified type name acts as the field name.

The following declaration is illegal because field names must be unique in a struct type:

A field or method f of an embedded field in a struct x is called promoted if x.f is a legal selector that denotes that field or method f .

Promoted fields act like ordinary fields of a struct except that they cannot be used as field names in composite literals of the struct.

Given a struct type S and a named type T , promoted methods are included in the method set of the struct as follows:

• If S contains an embedded field T , the method sets of S and *S both include promoted methods with receiver T . The method set of *S also includes promoted methods with receiver *T .
• If S contains an embedded field *T , the method sets of S and *S both include promoted methods with receiver T or *T .

A field declaration may be followed by an optional string literal tag, which becomes an attribute for all the fields in the corresponding field declaration. An empty tag string is equivalent to an absent tag. The tags are made visible through a reflection interface and take part in type identity for structs but are otherwise ignored.

A struct type T may not contain a field of type T , or of a type containing T as a component, directly or indirectly, if those containing types are only array or struct types.

Pointer types

A pointer type denotes the set of all pointers to variables of a given type, called the base type of the pointer. The value of an uninitialized pointer is nil .

Function types

A function type denotes the set of all functions with the same parameter and result types. The value of an uninitialized variable of function type is nil .

Within a list of parameters or results, the names (IdentifierList) must either all be present or all be absent. If present, each name stands for one item (parameter or result) of the specified type and all non-blank names in the signature must be unique. If absent, each type stands for one item of that type. Parameter and result lists are always parenthesized except that if there is exactly one unnamed result it may be written as an unparenthesized type.

The final incoming parameter in a function signature may have a type prefixed with . . A function with such a parameter is called variadic and may be invoked with zero or more arguments for that parameter.

Interface types

An interface type defines a type set. A variable of interface type can store a value of any type that is in the type set of the interface. Such a type is said to implement the interface. The value of an uninitialized variable of interface type is nil .

An interface type is specified by a list of interface elements. An interface element is either a method or a type element, where a type element is a union of one or more type terms. A type term is either a single type or a single underlying type.

Basic interfaces

In its most basic form an interface specifies a (possibly empty) list of methods. The type set defined by such an interface is the set of types which implement all of those methods, and the corresponding method set consists exactly of the methods specified by the interface. Interfaces whose type sets can be defined entirely by a list of methods are called basic interfaces.

The name of each explicitly specified method must be unique and not blank.

More than one type may implement an interface. For instance, if two types S1 and S2 have the method set

(where T stands for either S1 or S2 ) then the File interface is implemented by both S1 and S2 , regardless of what other methods S1 and S2 may have or share.

Every type that is a member of the type set of an interface implements that interface. Any given type may implement several distinct interfaces. For instance, all types implement the empty interface which stands for the set of all (non-interface) types:

For convenience, the predeclared type any is an alias for the empty interface.

Similarly, consider this interface specification, which appears within a type declaration to define an interface called Locker :

If S1 and S2 also implement

they implement the Locker interface as well as the File interface.

Embedded interfaces

In a slightly more general form an interface T may use a (possibly qualified) interface type name E as an interface element. This is called embedding interface E in T . The type set of T is the intersection of the type sets defined by T ‘s explicitly declared methods and the type sets of T ’s embedded interfaces. In other words, the type set of T is the set of all types that implement all the explicitly declared methods of T and also all the methods of E .

When embedding interfaces, methods with the same names must have identical signatures.

General interfaces

In their most general form, an interface element may also be an arbitrary type term T , or a term of the form

T specifying the underlying type T , or a union of terms t₁|t₂|…|t_n . Together with method specifications, these elements enable the precise definition of an interface’s type set as follows:

• The type set of the empty interface is the set of all non-interface types.
• The type set of a non-empty interface is the intersection of the type sets of its interface elements.
• The type set of a method specification is the set of all non-interface types whose method sets include that method.
• The type set of a non-interface type term is the set consisting of just that type.
• The type set of a term of the form

The quantification «the set of all non-interface types» refers not just to all (non-interface) types declared in the program at hand, but all possible types in all possible programs, and hence is infinite. Similarly, given the set of all non-interface types that implement a particular method, the intersection of the method sets of those types will contain exactly that method, even if all types in the program at hand always pair that method with another method.

By construction, an interface’s type set never contains an interface type.

In a term of the form

T , the underlying type of T must be itself, and T cannot be an interface.

Union elements denote unions of type sets:

The type T in a term of the form T or

T cannot be a type parameter, and the type sets of all non-interface terms must be pairwise disjoint (the pairwise intersection of the type sets must be empty). Given a type parameter P :

Implementation restriction: A union (with more than one term) cannot contain the predeclared identifier comparable or interfaces that specify methods, or embed comparable or interfaces that specify methods.

Interfaces that are not basic may only be used as type constraints, or as elements of other interfaces used as constraints. They cannot be the types of values or variables, or components of other, non-interface types.

An interface type T may not embed a type element that is, contains, or embeds T , directly or indirectly.

Implementing an interface

A type T implements an interface I if

• T is not an interface and is an element of the type set of I ; or
• T is an interface and the type set of T is a subset of the type set of I .

A value of type T implements an interface if T implements the interface.

Map types

A map is an unordered group of elements of one type, called the element type, indexed by a set of unique keys of another type, called the key type. The value of an uninitialized map is nil .

The comparison operators == and != must be fully defined for operands of the key type; thus the key type must not be a function, map, or slice. If the key type is an interface type, these comparison operators must be defined for the dynamic key values; failure will cause a run-time panic.

The number of map elements is called its length. For a map m , it can be discovered using the built-in function len and may change during execution. Elements may be added during execution using assignments and retrieved with index expressions; they may be removed with the delete built-in function.

A new, empty map value is made using the built-in function make , which takes the map type and an optional capacity hint as arguments:

The initial capacity does not bound its size: maps grow to accommodate the number of items stored in them, with the exception of nil maps. A nil map is equivalent to an empty map except that no elements may be added.

Channel types

A channel provides a mechanism for concurrently executing functions to communicate by sending and receiving values of a specified element type. The value of an uninitialized channel is nil .

The optional <- operator specifies the channel direction, send or receive. If a direction is given, the channel is directional, otherwise it is bidirectional. A channel may be constrained only to send or only to receive by assignment or explicit conversion.

The <- operator associates with the leftmost chan possible:

A new, initialized channel value can be made using the built-in function make , which takes the channel type and an optional capacity as arguments:

The capacity, in number of elements, sets the size of the buffer in the channel. If the capacity is zero or absent, the channel is unbuffered and communication succeeds only when both a sender and receiver are ready. Otherwise, the channel is buffered and communication succeeds without blocking if the buffer is not full (sends) or not empty (receives). A nil channel is never ready for communication.

A channel may be closed with the built-in function close . The multi-valued assignment form of the receive operator reports whether a received value was sent before the channel was closed.

A single channel may be used in send statements, receive operations, and calls to the built-in functions cap and len by any number of goroutines without further synchronization. Channels act as first-in-first-out queues. For example, if one goroutine sends values on a channel and a second goroutine receives them, the values are received in the order sent.

Properties of types and values

Underlying types

Each type T has an underlying type: If T is one of the predeclared boolean, numeric, or string types, or a type literal, the corresponding underlying type is T itself. Otherwise, T ‘s underlying type is the underlying type of the type to which T refers in its declaration. For a type parameter that is the underlying type of its type constraint, which is always an interface.

The underlying type of string , A1 , A2 , B1 , and B2 is string . The underlying type of []B1 , B3 , and B4 is []B1 . The underlying type of P is interface<> .

Core types

Each non-interface type T has a core type, which is the same as the underlying type of T .

An interface T has a core type if one of the following conditions is satisfied:

1. There is a single type U which is the underlying type of all types in the type set of T ; or
2. the type set of T contains only channel types with identical element type E , and all directional channels have the same direction.

No other interfaces have a core type.

The core type of an interface is, depending on the condition that is satisfied, either:

1. the type U ; or
2. the type chan E if T contains only bidirectional channels, or the type chan<- E or <-chan E depending on the direction of the directional channels present.

By definition, a core type is never a defined type, type parameter, or interface type.

Examples of interfaces with core types:

Examples of interfaces without core types:

Some operations (slice expressions, append and copy ) rely on a slightly more loose form of core types which accept byte slices and strings. Specifically, if there are exactly two types, []byte and string , which are the underlying types of all types in the type set of interface T , the core type of T is called bytestring .

Examples of interfaces with bytestring core types:

Note that bytestring is not a real type; it cannot be used to declare variables are compose other types. It exists solely to describe the behavior of some operations that read from a sequence of bytes, which may be a byte slice or a string.

Type identity

Two types are either identical or different.

A named type is always different from any other type. Otherwise, two types are identical if their underlying type literals are structurally equivalent; that is, they have the same literal structure and corresponding components have identical types. In detail:

• Two array types are identical if they have identical element types and the same array length.
• Two slice types are identical if they have identical element types.
• Two struct types are identical if they have the same sequence of fields, and if corresponding fields have the same names, and identical types, and identical tags. Non-exported field names from different packages are always different.
• Two pointer types are identical if they have identical base types.
• Two function types are identical if they have the same number of parameters and result values, corresponding parameter and result types are identical, and either both functions are variadic or neither is. Parameter and result names are not required to match.
• Two interface types are identical if they define the same type set.
• Two map types are identical if they have identical key and element types.
• Two channel types are identical if they have identical element types and the same direction.
• Two instantiated types are identical if their defined types and all type arguments are identical.

Given the declarations

these types are identical:

B0 and B1 are different because they are new types created by distinct type definitions; func(int, float64) *B0 and func(x int, y float64) *[]string are different because B0 is different from []string ; and P1 and P2 are different because they are different type parameters. D0[int, string] and struct < x int; y string >are different because the former is an instantiated defined type while the latter is a type literal (but they are still assignable).

Assignability

A value x of type V is assignable to a variable of type T (» x is assignable to T «) if one of the following conditions applies:

• V and T are identical.
• V and T have identical underlying types but are not type parameters and at least one of V or T is not a named type.
• V and T are channel types with identical element types, V is a bidirectional channel, and at least one of V or T is not a named type.
• T is an interface type, but not a type parameter, and x implements T .
• x is the predeclared identifier nil and T is a pointer, function, slice, map, channel, or interface type, but not a type parameter.
• x is an untyped constantrepresentable by a value of type T .

Additionally, if x ‘s type V or T are type parameters, x is assignable to a variable of type T if one of the following conditions applies:

• x is the predeclared identifier nil , T is a type parameter, and x is assignable to each type in T ‘s type set.
• V is not a named type, T is a type parameter, and x is assignable to each type in T ‘s type set.
• V is a type parameter and T is not a named type, and values of each type in V ‘s type set are assignable to T .

Representability

A constant x is representable by a value of type T , where T is not a type parameter, if one of the following conditions applies:

• x is in the set of values determined by T .
• T is a floating-point type and x can be rounded to T ‘s precision without overflow. Rounding uses IEEE 754 round-to-even rules but with an IEEE negative zero further simplified to an unsigned zero. Note that constant values never result in an IEEE negative zero, NaN, or infinity.
• T is a complex type, and x ‘s components real(x) and imag(x) are representable by values of T ‘s component type ( float32 or float64 ).

If T is a type parameter, x is representable by a value of type T if x is representable by a value of each type in T ‘s type set.

Method sets

The method set of a type determines the methods that can be called on an operand of that type. Every type has a (possibly empty) method set associated with it:

• The method set of a defined type T consists of all methods declared with receiver type T .
• The method set of a pointer to a defined type T (where T is neither a pointer nor an interface) is the set of all methods declared with receiver *T or T .
• The method set of an interface type is the intersection of the method sets of each type in the interface’s type set (the resulting method set is usually just the set of declared methods in the interface).

Further rules apply to structs (and pointer to structs) containing embedded fields, as described in the section on struct types. Any other type has an empty method set.

In a method set, each method must have a unique non-blank method name.

Blocks

A block is a possibly empty sequence of declarations and statements within matching brace brackets.

In addition to explicit blocks in the source code, there are implicit blocks:

1. The universe block encompasses all Go source text.
2. Each package has a package block containing all Go source text for that package.
3. Each file has a file block containing all Go source text in that file.
4. Each «if», «for», and «switch» statement is considered to be in its own implicit block.
5. Each clause in a «switch» or «select» statement acts as an implicit block.

Blocks nest and influence scoping.

Declarations and scope

A declaration binds a non-blank identifier to a constant, type, type parameter, variable, function, label, or package. Every identifier in a program must be declared. No identifier may be declared twice in the same block, and no identifier may be declared in both the file and package block.

The blank identifier may be used like any other identifier in a declaration, but it does not introduce a binding and thus is not declared. In the package block, the identifier init may only be used for init function declarations, and like the blank identifier it does not introduce a new binding.

The scope of a declared identifier is the extent of source text in which the identifier denotes the specified constant, type, variable, function, label, or package.

Go is lexically scoped using blocks:

1. The scope of a predeclared identifier is the universe block.
2. The scope of an identifier denoting a constant, type, variable, or function (but not method) declared at top level (outside any function) is the package block.
3. The scope of the package name of an imported package is the file block of the file containing the import declaration.
4. The scope of an identifier denoting a method receiver, function parameter, or result variable is the function body.
5. The scope of an identifier denoting a type parameter of a function or declared by a method receiver begins after the name of the function and ends at the end of the function body.
6. The scope of an identifier denoting a type parameter of a type begins after the name of the type and ends at the end of the TypeSpec.
7. The scope of a constant or variable identifier declared inside a function begins at the end of the ConstSpec or VarSpec (ShortVarDecl for short variable declarations) and ends at the end of the innermost containing block.
8. The scope of a type identifier declared inside a function begins at the identifier in the TypeSpec and ends at the end of the innermost containing block.

An identifier declared in a block may be redeclared in an inner block. While the identifier of the inner declaration is in scope, it denotes the entity declared by the inner declaration.

The package clause is not a declaration; the package name does not appear in any scope. Its purpose is to identify the files belonging to the same package and to specify the default package name for import declarations.

Label scopes

Labels are declared by labeled statements and are used in the «break», «continue», and «goto» statements. It is illegal to define a label that is never used. In contrast to other identifiers, labels are not block scoped and do not conflict with identifiers that are not labels. The scope of a label is the body of the function in which it is declared and excludes the body of any nested function.

Blank identifier

The blank identifier is represented by the underscore character _ . It serves as an anonymous placeholder instead of a regular (non-blank) identifier and has special meaning in declarations, as an operand, and in assignment statements.

Predeclared identifiers

The following identifiers are implicitly declared in the universe block:

Exported identifiers

An identifier may be exported to permit access to it from another package. An identifier is exported if both:

1. the first character of the identifier’s name is a Unicode uppercase letter (Unicode character category Lu); and
2. the identifier is declared in the package block or it is a field name or method name.

All other identifiers are not exported.

Uniqueness of identifiers

Given a set of identifiers, an identifier is called unique if it is different from every other in the set. Two identifiers are different if they are spelled differently, or if they appear in different packages and are not exported. Otherwise, they are the same.

Constant declarations

A constant declaration binds a list of identifiers (the names of the constants) to the values of a list of constant expressions. The number of identifiers must be equal to the number of expressions, and the nth identifier on the left is bound to the value of the nth expression on the right.

If the type is present, all constants take the type specified, and the expressions must be assignable to that type, which must not be a type parameter. If the type is omitted, the constants take the individual types of the corresponding expressions. If the expression values are untyped constants, the declared constants remain untyped and the constant identifiers denote the constant values. For instance, if the expression is a floating-point literal, the constant identifier denotes a floating-point constant, even if the literal’s fractional part is zero.

Within a parenthesized const declaration list the expression list may be omitted from any but the first ConstSpec. Such an empty list is equivalent to the textual substitution of the first preceding non-empty expression list and its type if any. Omitting the list of expressions is therefore equivalent to repeating the previous list. The number of identifiers must be equal to the number of expressions in the previous list. Together with the iota constant generator this mechanism permits light-weight declaration of sequential values:

Within a constant declaration, the predeclared identifier iota represents successive untyped integer constants. Its value is the index of the respective ConstSpec in that constant declaration, starting at zero. It can be used to construct a set of related constants:

By definition, multiple uses of iota in the same ConstSpec all have the same value:

This last example exploits the implicit repetition of the last non-empty expression list.

Type declarations

A type declaration binds an identifier, the type name, to a type. Type declarations come in two forms: alias declarations and type definitions.

Alias declarations

An alias declaration binds an identifier to the given type.

Within the scope of the identifier, it serves as an alias for the type.

Type definitions

A type definition creates a new, distinct type with the same underlying type and operations as the given type and binds an identifier, the type name, to it.

The new type is called a defined type. It is different from any other type, including the type it is created from.

A defined type may have methods associated with it. It does not inherit any methods bound to the given type, but the method set of an interface type or of elements of a composite type remains unchanged:

Type definitions may be used to define different boolean, numeric, or string types and associate methods with them:

If the type definition specifies type parameters, the type name denotes a generic type. Generic types must be instantiated when they are used.

In a type definition the given type cannot be a type parameter.

A generic type may also have methods associated with it. In this case, the method receivers must declare the same number of type parameters as present in the generic type definition.

Type parameter declarations

A type parameter list declares the type parameters of a generic function or type declaration. The type parameter list looks like an ordinary function parameter list except that the type parameter names must all be present and the list is enclosed in square brackets rather than parentheses.

All non-blank names in the list must be unique. Each name declares a type parameter, which is a new and different named type that acts as a place holder for an (as of yet) unknown type in the declaration. The type parameter is replaced with a type argument upon instantiation of the generic function or type.

Just as each ordinary function parameter has a parameter type, each type parameter has a corresponding (meta-)type which is called its type constraint.

A parsing ambiguity arises when the type parameter list for a generic type declares a single type parameter P with a constraint C such that the text P C forms a valid expression:

In these rare cases, the type parameter list is indistinguishable from an expression and the type declaration is parsed as an array type declaration. To resolve the ambiguity, embed the constraint in an interface or use a trailing comma:

Type parameters may also be declared by the receiver specification of a method declaration associated with a generic type.

Within a type parameter list of a generic type T , a type constraint may not (directly, or indirectly through the type parameter list of another generic type) refer to T .

Type constraints

A type constraint is an interface that defines the set of permissible type arguments for the respective type parameter and controls the operations supported by values of that type parameter.

If the constraint is an interface literal of the form interface where E is an embedded type element (not a method), in a type parameter list the enclosing interface < … >may be omitted for convenience:

The predeclared interface type comparable denotes the set of all non-interface types that are strictly comparable.

Even though interfaces that are not type parameters are comparable, they are not strictly comparable and therefore they do not implement comparable . However, they satisfy comparable .

The comparable interface and interfaces that (directly or indirectly) embed comparable may only be used as type constraints. They cannot be the types of values or variables, or components of other, non-interface types.

Satisfying a type constraint

A type argument T satisfies a type constraint C if T is an element of the type set defined by C ; i.e., if T implements C . As an exception, a strictly comparable type constraint may also be satisfied by a comparable (not necessarily strictly comparable) type argument. More precisely:

A type T satisfies a constraint C if

• T implements C ; or
• C can be written in the form interface < comparable; E >, where E is a basic interface and T is comparable and implements E .

Because of the exception in the constraint satisfaction rule, comparing operands of type parameter type may panic at run-time (even though comparable type parameters are always strictly comparable).

Variable declarations

A variable declaration creates one or more variables, binds corresponding identifiers to them, and gives each a type and an initial value.

If a list of expressions is given, the variables are initialized with the expressions following the rules for assignment statements. Otherwise, each variable is initialized to its zero value.

If a type is present, each variable is given that type. Otherwise, each variable is given the type of the corresponding initialization value in the assignment. If that value is an untyped constant, it is first implicitly converted to its default type; if it is an untyped boolean value, it is first implicitly converted to type bool . The predeclared value nil cannot be used to initialize a variable with no explicit type.

Implementation restriction: A compiler may make it illegal to declare a variable inside a function body if the variable is never used.

Short variable declarations

A short variable declaration uses the syntax:

It is shorthand for a regular variable declaration with initializer expressions but no types:

Short variable declarations may appear only inside functions. In some contexts such as the initializers for «if», «for», or «switch» statements, they can be used to declare local temporary variables.

Function declarations

A function declaration binds an identifier, the function name, to a function.

If the function’s signature declares result parameters, the function body’s statement list must end in a terminating statement.

If the function declaration specifies type parameters, the function name denotes a generic function. A generic function must be instantiated before it can be called or used as a value.

A function declaration without type parameters may omit the body. Such a declaration provides the signature for a function implemented outside Go, such as an assembly routine.

Method declarations

A method is a function with a receiver. A method declaration binds an identifier, the method name, to a method, and associates the method with the receiver’s base type.

The receiver is specified via an extra parameter section preceding the method name. That parameter section must declare a single non-variadic parameter, the receiver. Its type must be a defined type T or a pointer to a defined type T , possibly followed by a list of type parameter names [P1, P2, …] enclosed in square brackets. T is called the receiver base type. A receiver base type cannot be a pointer or interface type and it must be defined in the same package as the method. The method is said to be bound to its receiver base type and the method name is visible only within selectors for type T or *T .

A non-blank receiver identifier must be unique in the method signature. If the receiver’s value is not referenced inside the body of the method, its identifier may be omitted in the declaration. The same applies in general to parameters of functions and methods.

For a base type, the non-blank names of methods bound to it must be unique. If the base type is a struct type, the non-blank method and field names must be distinct.

Given defined type Point the declarations

bind the methods Length and Scale , with receiver type *Point , to the base type Point .

If the receiver base type is a generic type, the receiver specification must declare corresponding type parameters for the method to use. This makes the receiver type parameters available to the method. Syntactically, this type parameter declaration looks like an instantiation of the receiver base type: the type arguments must be identifiers denoting the type parameters being declared, one for each type parameter of the receiver base type. The type parameter names do not need to match their corresponding parameter names in the receiver base type definition, and all non-blank parameter names must be unique in the receiver parameter section and the method signature. The receiver type parameter constraints are implied by the receiver base type definition: corresponding type parameters have corresponding constraints.

Expressions

An expression specifies the computation of a value by applying operators and functions to operands.

Operands

Operands denote the elementary values in an expression. An operand may be a literal, a (possibly qualified) non-blank identifier denoting a constant, variable, or function, or a parenthesized expression.

An operand name denoting a generic function may be followed by a list of type arguments; the resulting operand is an instantiated function.

The blank identifier may appear as an operand only on the left-hand side of an assignment statement.

Implementation restriction: A compiler need not report an error if an operand’s type is a type parameter with an empty type set. Functions with such type parameters cannot be instantiated; any attempt will lead to an error at the instantiation site.

Qualified identifiers

A qualified identifier is an identifier qualified with a package name prefix. Both the package name and the identifier must not be blank.

A qualified identifier accesses an identifier in a different package, which must be imported. The identifier must be exported and declared in the package block of that package.

Composite literals

Composite literals construct new composite values each time they are evaluated. They consist of the type of the literal followed by a brace-bound list of elements. Each element may optionally be preceded by a corresponding key.

The LiteralType’s core type T must be a struct, array, slice, or map type (the syntax enforces this constraint except when the type is given as a TypeName). The types of the elements and keys must be assignable to the respective field, element, and key types of type T ; there is no additional conversion. The key is interpreted as a field name for struct literals, an index for array and slice literals, and a key for map literals. For map literals, all elements must have a key. It is an error to specify multiple elements with the same field name or constant key value. For non-constant map keys, see the section on evaluation order.

For struct literals the following rules apply:

• A key must be a field name declared in the struct type.
• An element list that does not contain any keys must list an element for each struct field in the order in which the fields are declared.
• If any element has a key, every element must have a key.
• An element list that contains keys does not need to have an element for each struct field. Omitted fields get the zero value for that field.
• A literal may omit the element list; such a literal evaluates to the zero value for its type.
• It is an error to specify an element for a non-exported field of a struct belonging to a different package.

Given the declarations

For array and slice literals the following rules apply:

• Each element has an associated integer index marking its position in the array.
• An element with a key uses the key as its index. The key must be a non-negative constant representable by a value of type int ; and if it is typed it must be of integer type.
• An element without a key uses the previous element’s index plus one. If the first element has no key, its index is zero.

Taking the address of a composite literal generates a pointer to a unique variable initialized with the literal’s value.

Note that the zero value for a slice or map type is not the same as an initialized but empty value of the same type. Consequently, taking the address of an empty slice or map composite literal does not have the same effect as allocating a new slice or map value with new.

The length of an array literal is the length specified in the literal type. If fewer elements than the length are provided in the literal, the missing elements are set to the zero value for the array element type. It is an error to provide elements with index values outside the index range of the array. The notation . specifies an array length equal to the maximum element index plus one.

A slice literal describes the entire underlying array literal. Thus the length and capacity of a slice literal are the maximum element index plus one. A slice literal has the form

and is shorthand for a slice operation applied to an array:

Within a composite literal of array, slice, or map type T , elements or map keys that are themselves composite literals may elide the respective literal type if it is identical to the element or key type of T . Similarly, elements or keys that are addresses of composite literals may elide the &T when the element or key type is *T .

A parsing ambiguity arises when a composite literal using the TypeName form of the LiteralType appears as an operand between the keyword and the opening brace of the block of an «if», «for», or «switch» statement, and the composite literal is not enclosed in parentheses, square brackets, or curly braces. In this rare case, the opening brace of the literal is erroneously parsed as the one introducing the block of statements. To resolve the ambiguity, the composite literal must appear within parentheses.

Examples of valid array, slice, and map literals:

Function literals

A function literal represents an anonymous function. Function literals cannot declare type parameters.

A function literal can be assigned to a variable or invoked directly.

Function literals are closures: they may refer to variables defined in a surrounding function. Those variables are then shared between the surrounding function and the function literal, and they survive as long as they are accessible.

Primary expressions

Primary expressions are the operands for unary and binary expressions.

Selectors

For a primary expression x that is not a package name, the selector expression

denotes the field or method f of the value x (or sometimes *x ; see below). The identifier f is called the (field or method) selector; it must not be the blank identifier. The type of the selector expression is the type of f . If x is a package name, see the section on qualified identifiers.

A selector f may denote a field or method f of a type T , or it may refer to a field or method f of a nested embedded field of T . The number of embedded fields traversed to reach f is called its depth in T . The depth of a field or method f declared in T is zero. The depth of a field or method f declared in an embedded field A in T is the depth of f in A plus one.

The following rules apply to selectors:

1. For a value x of type T or *T where T is not a pointer or interface type, x.f denotes the field or method at the shallowest depth in T where there is such an f . If there is not exactly one f with shallowest depth, the selector expression is illegal.
2. For a value x of type I where I is an interface type, x.f denotes the actual method with name f of the dynamic value of x . If there is no method with name f in the method set of I , the selector expression is illegal.
3. As an exception, if the type of x is a defined pointer type and (*x).f is a valid selector expression denoting a field (but not a method), x.f is shorthand for (*x).f .
4. In all other cases, x.f is illegal.
5. If x is of pointer type and has the value nil and x.f denotes a struct field, assigning to or evaluating x.f causes a run-time panic.
6. If x is of interface type and has the value nil , calling or evaluating the method x.f causes a run-time panic.

For example, given the declarations:

but the following is invalid:

Method expressions

If M is in the method set of type T , T.M is a function that is callable as a regular function with the same arguments as M prefixed by an additional argument that is the receiver of the method.

Consider a struct type T with two methods, Mv , whose receiver is of type T , and Mp , whose receiver is of type *T .

yields a function equivalent to Mv but with an explicit receiver as its first argument; it has signature

That function may be called normally with an explicit receiver, so these five invocations are equivalent:

Similarly, the expression

yields a function value representing Mp with signature

For a method with a value receiver, one can derive a function with an explicit pointer receiver, so

yields a function value representing Mv with signature

Such a function indirects through the receiver to create a value to pass as the receiver to the underlying method; the method does not overwrite the value whose address is passed in the function call.

The final case, a value-receiver function for a pointer-receiver method, is illegal because pointer-receiver methods are not in the method set of the value type.

Function values derived from methods are called with function call syntax; the receiver is provided as the first argument to the call. That is, given f := T.Mv , f is invoked as f(t, 7) not t.f(7) . To construct a function that binds the receiver, use a function literal or method value.

It is legal to derive a function value from a method of an interface type. The resulting function takes an explicit receiver of that interface type.

Method values

If the expression x has static type T and M is in the method set of type T , x.M is called a method value. The method value x.M is a function value that is callable with the same arguments as a method call of x.M . The expression x is evaluated and saved during the evaluation of the method value; the saved copy is then used as the receiver in any calls, which may be executed later.

The type T may be an interface or non-interface type.

As in the discussion of method expressions above, consider a struct type T with two methods, Mv , whose receiver is of type T , and Mp , whose receiver is of type *T .

yields a function value of type

These two invocations are equivalent:

Similarly, the expression

yields a function value of type

As with selectors, a reference to a non-interface method with a value receiver using a pointer will automatically dereference that pointer: pt.Mv is equivalent to (*pt).Mv .

As with method calls, a reference to a non-interface method with a pointer receiver using an addressable value will automatically take the address of that value: t.Mp is equivalent to (&t).Mp .

Although the examples above use non-interface types, it is also legal to create a method value from a value of interface type.

Index expressions

A primary expression of the form

denotes the element of the array, pointer to array, slice, string or map a indexed by x . The value x is called the index or map key, respectively. The following rules apply:

If a is neither a map nor a type parameter:

• the index x must be an untyped constant or its core type must be an integer
• a constant index must be non-negative and representable by a value of type int
• a constant index that is untyped is given type int
• the index x is in range if 0 <= x < len(a) , otherwise it is out of range

• a constant index must be in range
• if x is out of range at run time, a run-time panic occurs
• a[x] is the array element at index x and the type of a[x] is the element type of A

For a of pointer to array type:

• a[x] is shorthand for (*a)[x]

• if x is out of range at run time, a run-time panic occurs
• a[x] is the slice element at index x and the type of a[x] is the element type of S

• a constant index must be in range if the string a is also constant
• if x is out of range at run time, a run-time panic occurs
• a[x] is the non-constant byte value at index x and the type of a[x] is byte
• a[x] may not be assigned to

• x ‘s type must be assignable to the key type of M
• if the map contains an entry with key x , a[x] is the map element with key x and the type of a[x] is the element type of M
• if the map is nil or does not contain such an entry, a[x] is the zero value for the element type of M

• The index expression a[x] must be valid for values of all types in P ‘s type set.
• The element types of all types in P ‘s type set must be identical. In this context, the element type of a string type is byte .
• If there is a map type in the type set of P , all types in that type set must be map types, and the respective key types must be all identical.
• a[x] is the array, slice, or string element at index x , or the map element with key x of the type argument that P is instantiated with, and the type of a[x] is the type of the (identical) element types.
• a[x] may not be assigned to if P ‘s type set includes string types.

Otherwise a[x] is illegal.

An index expression on a map a of type map[K]V used in an assignment statement or initialization of the special form

yields an additional untyped boolean value. The value of ok is true if the key x is present in the map, and false otherwise.

Assigning to an element of a nil map causes a run-time panic.

Slice expressions

Slice expressions construct a substring or slice from a string, array, pointer to array, or slice. There are two variants: a simple form that specifies a low and high bound, and a full form that also specifies a bound on the capacity.

Simple slice expressions

The primary expression

constructs a substring or slice. The core type of a must be a string, array, pointer to array, slice, or a bytestring . The indices low and high select which elements of operand a appear in the result. The result has indices starting at 0 and length equal to high — low . After slicing the array a

the slice s has type []int , length 3, capacity 4, and elements

For convenience, any of the indices may be omitted. A missing low index defaults to zero; a missing high index defaults to the length of the sliced operand:

If a is a pointer to an array, a[low : high] is shorthand for (*a)[low : high] .

For arrays or strings, the indices are in range if 0 <= low <= high <= len(a) , otherwise they are out of range. For slices, the upper index bound is the slice capacity cap(a) rather than the length. A constant index must be non-negative and representable by a value of type int ; for arrays or constant strings, constant indices must also be in range. If both indices are constant, they must satisfy low <= high . If the indices are out of range at run time, a run-time panic occurs.

Except for untyped strings, if the sliced operand is a string or slice, the result of the slice operation is a non-constant value of the same type as the operand. For untyped string operands the result is a non-constant value of type string . If the sliced operand is an array, it must be addressable and the result of the slice operation is a slice with the same element type as the array.

If the sliced operand of a valid slice expression is a nil slice, the result is a nil slice. Otherwise, if the result is a slice, it shares its underlying array with the operand.

Full slice expressions

The primary expression

constructs a slice of the same type, and with the same length and elements as the simple slice expression a[low : high] . Additionally, it controls the resulting slice’s capacity by setting it to max — low . Only the first index may be omitted; it defaults to 0. The core type of a must be an array, pointer to array, or slice (but not a string). After slicing the array a

the slice t has type []int , length 2, capacity 4, and elements

As for simple slice expressions, if a is a pointer to an array, a[low : high : max] is shorthand for (*a)[low : high : max] . If the sliced operand is an array, it must be addressable.

The indices are in range if 0 <= low <= high <= max <= cap(a) , otherwise they are out of range. A constant index must be non-negative and representable by a value of type int ; for arrays, constant indices must also be in range. If multiple indices are constant, the constants that are present must be in range relative to each other. If the indices are out of range at run time, a run-time panic occurs.

Type assertions

For an expression x of interface type, but not a type parameter, and a type T , the primary expression

asserts that x is not nil and that the value stored in x is of type T . The notation x.(T) is called a type assertion.

More precisely, if T is not an interface type, x.(T) asserts that the dynamic type of x is identical to the type T . In this case, T must implement the (interface) type of x ; otherwise the type assertion is invalid since it is not possible for x to store a value of type T . If T is an interface type, x.(T) asserts that the dynamic type of x implements the interface T .

If the type assertion holds, the value of the expression is the value stored in x and its type is T . If the type assertion is false, a run-time panic occurs. In other words, even though the dynamic type of x is known only at run time, the type of x.(T) is known to be T in a correct program.

A type assertion used in an assignment statement or initialization of the special form

yields an additional untyped boolean value. The value of ok is true if the assertion holds. Otherwise it is false and the value of v is the zero value for type T . No run-time panic occurs in this case.

Calls

Given an expression f with a core type F of function type,

calls f with arguments a1, a2, … an . Except for one special case, arguments must be single-valued expressions assignable to the parameter types of F and are evaluated before the function is called. The type of the expression is the result type of F . A method invocation is similar but the method itself is specified as a selector upon a value of the receiver type for the method.

If f denotes a generic function, it must be instantiated before it can be called or used as a function value.

In a function call, the function value and arguments are evaluated in the usual order. After they are evaluated, the parameters of the call are passed by value to the function and the called function begins execution. The return parameters of the function are passed by value back to the caller when the function returns.

Calling a nil function value causes a run-time panic.

As a special case, if the return values of a function or method g are equal in number and individually assignable to the parameters of another function or method f , then the call f(g(parameters_of_g)) will invoke f after binding the return values of g to the parameters of f in order. The call of f must contain no parameters other than the call of g , and g must have at least one return value. If f has a final . parameter, it is assigned the return values of g that remain after assignment of regular parameters.

A method call x.m() is valid if the method set of (the type of) x contains m and the argument list can be assigned to the parameter list of m . If x is addressable and &x ‘s method set contains m , x.m() is shorthand for (&x).m() :

There is no distinct method type and there are no method literals.

Passing arguments to . parameters

If f is variadic with a final parameter p of type . T , then within f the type of p is equivalent to type []T . If f is invoked with no actual arguments for p , the value passed to p is nil . Otherwise, the value passed is a new slice of type []T with a new underlying array whose successive elements are the actual arguments, which all must be assignable to T . The length and capacity of the slice is therefore the number of arguments bound to p and may differ for each call site.

Given the function and calls

within Greeting , who will have the value nil in the first call, and []string <"Joe", "Anna", "Eileen">in the second.

If the final argument is assignable to a slice type []T and is followed by . , it is passed unchanged as the value for a . T parameter. In this case no new slice is created.

Given the slice s and call

within Greeting , who will have the same value as s with the same underlying array.

Instantiations

A generic function or type is instantiated by substituting type arguments for the type parameters. Instantiation proceeds in two steps:

1. Each type argument is substituted for its corresponding type parameter in the generic declaration. This substitution happens across the entire function or type declaration, including the type parameter list itself and any types in that list.
2. After substitution, each type argument must satisfy the constraint (instantiated, if necessary) of the corresponding type parameter. Otherwise instantiation fails.

Instantiating a type results in a new non-generic named type; instantiating a function produces a new non-generic function.

For a generic function, type arguments may be provided explicitly, or they may be partially or completely inferred. A generic function that is not called requires a type argument list for instantiation; if the list is partial, all remaining type arguments must be inferrable. A generic function that is called may provide a (possibly partial) type argument list, or may omit it entirely if the omitted type arguments are inferrable from the ordinary (non-type) function arguments.

A partial type argument list cannot be empty; at least the first argument must be present. The list is a prefix of the full list of type arguments, leaving the remaining arguments to be inferred. Loosely speaking, type arguments may be omitted from «right to left».

For a generic type, all type arguments must always be provided explicitly.

Type inference

Missing function type arguments may be inferred by a series of steps, described below. Each step attempts to use known information to infer additional type arguments. Type inference stops as soon as all type arguments are known. After type inference is complete, it is still necessary to substitute all type arguments for type parameters and verify that each type argument implements the relevant constraint; it is possible for an inferred type argument to fail to implement a constraint, in which case instantiation fails.

Type inference is based on

• a type parameter list
• a substitution map M initialized with the known type arguments, if any
• a (possibly empty) list of ordinary function arguments (in case of a function call only)

and then proceeds with the following steps:

1. apply function argument type inference to all typed ordinary function arguments
2. apply constraint type inference
3. apply function argument type inference to all untyped ordinary function arguments using the default type for each of the untyped function arguments
4. apply constraint type inference

If there are no ordinary or untyped function arguments, the respective steps are skipped. Constraint type inference is skipped if the previous step didn’t infer any new type arguments, but it is run at least once if there are missing type arguments.

The substitution map M is carried through all steps, and each step may add entries to M. The process stops as soon as M has a type argument for each type parameter or if an inference step fails. If an inference step fails, or if M is still missing type arguments after the last step, type inference fails.

Type unification

Type inference is based on type unification. A single unification step applies to a substitution map and two types, either or both of which may be or contain type parameters. The substitution map tracks the known (explicitly provided or already inferred) type arguments: the map contains an entry P &RightArrow; A for each type parameter P and corresponding known type argument A . During unification, known type arguments take the place of their corresponding type parameters when comparing types. Unification is the process of finding substitution map entries that make the two types equivalent.

For unification, two types that don’t contain any type parameters from the current type parameter list are equivalent if they are identical, or if they are channel types that are identical ignoring channel direction, or if their underlying types are equivalent.

Unification works by comparing the structure of pairs of types: their structure disregarding type parameters must be identical, and types other than type parameters must be equivalent. A type parameter in one type may match any complete subtype in the other type; each successful match causes an entry to be added to the substitution map. If the structure differs, or types other than type parameters are not equivalent, unification fails.

For example, if T1 and T2 are type parameters, []map[int]bool can be unified with any of the following:

On the other hand, []map[int]bool cannot be unified with any of

As an exception to this general rule, because a defined type D and a type literal L are never equivalent, unification compares the underlying type of D with L instead. For example, given the defined type

and the type literal []E , unification compares []float64 with []E and adds an entry E &RightArrow; float64 to the substitution map.

Function argument type inference

Function argument type inference infers type arguments from function arguments: if a function parameter is declared with a type T that uses type parameters, unifying the type of the corresponding function argument with T may infer type arguments for the type parameters used by T .

For instance, given the generic function

the type argument for Number can be inferred from the function argument vector by unifying the type of vector with the corresponding parameter type: []float64 and []Number match in structure and float64 matches with Number . This adds the entry Number &RightArrow; float64 to the substitution map. Untyped arguments, such as the second function argument 42 here, are ignored in the first round of function argument type inference and only considered if there are unresolved type parameters left.

Inference happens in two separate phases; each phase operates on a specific list of (parameter, argument) pairs:

1. The list Lt contains all (parameter, argument) pairs where the parameter type uses type parameters and where the function argument is typed.
2. The list Lu contains all remaining pairs where the parameter type is a single type parameter. In this list, the respective function arguments are untyped.

Any other (parameter, argument) pair is ignored.

By construction, the arguments of the pairs in Lu are untyped constants (or the untyped boolean result of a comparison). And because default types of untyped values are always predeclared non-composite types, they can never match against a composite type, so it is sufficient to only consider parameter types that are single type parameters.

Each list is processed in a separate phase:

1. In the first phase, the parameter and argument types of each pair in Lt are unified. If unification succeeds for a pair, it may yield new entries that are added to the substitution map M. If unification fails, type inference fails.
2. The second phase considers the entries of list Lu. Type parameters for which the type argument has already been determined are ignored in this phase. For each remaining pair, the parameter type (which is a single type parameter) and the default type of the corresponding untyped argument is unified. If unification fails, type inference fails.

While unification is successful, processing of each list continues until all list elements are considered, even if all type arguments are inferred before the last list element has been processed.

In the example min(1.0, 2) , processing the function argument 1.0 yields the substitution map entry T &RightArrow; float64 . Because processing continues until all untyped arguments are considered, an error is reported. This ensures that type inference does not depend on the order of the untyped arguments.

Constraint type inference

Constraint type inference infers type arguments by considering type constraints. If a type parameter P has a constraint with a core type C , unifying P with C may infer additional type arguments, either the type argument for P , or if that is already known, possibly the type arguments for type parameters used in C .

For instance, consider the type parameter list with type parameters List and Elem :

Constraint type inference can deduce the type of Elem from the type argument for List because Elem is a type parameter in the core type []Elem of List . If the type argument is Bytes :

unifying the underlying type of Bytes with the core type means unifying []byte with []Elem . That unification succeeds and yields the substitution map entry Elem &RightArrow; byte . Thus, in this example, constraint type inference can infer the second type argument from the first one.

Using the core type of a constraint may lose some information: In the (unlikely) case that the constraint’s type set contains a single defined type N , the corresponding core type is N ‘s underlying type rather than N itself. In this case, constraint type inference may succeed but instantiation will fail because the inferred type is not in the type set of the constraint. Thus, constraint type inference uses the adjusted core type of a constraint: if the type set contains a single type, use that type; otherwise use the constraint’s core type.

Generally, constraint type inference proceeds in two phases: Starting with a given substitution map M

1. For all type parameters with an adjusted core type, unify the type parameter with that type. If any unification fails, constraint type inference fails.
2. At this point, some entries in M may map type parameters to other type parameters or to types containing type parameters. For each entry P &RightArrow; A in M where A is or contains type parameters Q for which there exist entries Q &RightArrow; B in M, substitute those Q with the respective B in A . Stop when no further substitution is possible.

The result of constraint type inference is the final substitution map M from type parameters P to type arguments A where no type parameter P appears in any of the A .

For instance, given the type parameter list

and the single provided type argument int for type parameter A , the initial substitution map M contains the entry A &RightArrow; int .

In the first phase, the type parameters B and C are unified with the core type of their respective constraints. This adds the entries B &RightArrow; []C and C &RightArrow; *A to M.

At this point there are two entries in M where the right-hand side is or contains type parameters for which there exists other entries in M: []C and *A . In the second phase, these type parameters are replaced with their respective types. It doesn’t matter in which order this happens. Starting with the state of M after the first phase:

Replace A on the right-hand side of &RightArrow; with int :

Replace C on the right-hand side of &RightArrow; with *int :

At this point no further substitution is possible and the map is full. Therefore, M represents the final map of type parameters to type arguments for the given type parameter list.

Operators

Operators combine operands into expressions.

Comparisons are discussed elsewhere. For other binary operators, the operand types must be identical unless the operation involves shifts or untyped constants. For operations involving constants only, see the section on constant expressions.

Except for shift operations, if one operand is an untyped constant and the other operand is not, the constant is implicitly converted to the type of the other operand.

The right operand in a shift expression must have integer type or be an untyped constant representable by a value of type uint . If the left operand of a non-constant shift expression is an untyped constant, it is first implicitly converted to the type it would assume if the shift expression were replaced by its left operand alone.

Operator precedence

Unary operators have the highest precedence. As the ++ and — operators form statements, not expressions, they fall outside the operator hierarchy. As a consequence, statement *p++ is the same as (*p)++ .

There are five precedence levels for binary operators. Multiplication operators bind strongest, followed by addition operators, comparison operators, && (logical AND), and finally || (logical OR):

Binary operators of the same precedence associate from left to right. For instance, x / y * z is the same as (x / y) * z .

Arithmetic operators

Arithmetic operators apply to numeric values and yield a result of the same type as the first operand. The four standard arithmetic operators ( + , — , * , / ) apply to integer, floating-point, and complex types; + also applies to strings. The bitwise logical and shift operators apply to integers only.

If the operand type is a type parameter, the operator must apply to each type in that type set. The operands are represented as values of the type argument that the type parameter is instantiated with, and the operation is computed with the precision of that type argument. For example, given the function:

the product x * y and the addition s += x * y are computed with float32 or float64 precision, respectively, depending on the type argument for F .

Integer operators

For two integer values x and y , the integer quotient q = x / y and remainder r = x % y satisfy the following relationships:

with x / y truncated towards zero («truncated division»).

The one exception to this rule is that if the dividend x is the most negative value for the int type of x , the quotient q = x / -1 is equal to x (and r = 0 ) due to two’s-complement integer overflow:

If the divisor is a constant, it must not be zero. If the divisor is zero at run time, a run-time panic occurs. If the dividend is non-negative and the divisor is a constant power of 2, the division may be replaced by a right shift, and computing the remainder may be replaced by a bitwise AND operation:

The shift operators shift the left operand by the shift count specified by the right operand, which must be non-negative. If the shift count is negative at run time, a run-time panic occurs. The shift operators implement arithmetic shifts if the left operand is a signed integer and logical shifts if it is an unsigned integer. There is no upper limit on the shift count. Shifts behave as if the left operand is shifted n times by 1 for a shift count of n . As a result, x << 1 is the same as x*2 and x >> 1 is the same as x/2 but truncated towards negative infinity.

For integer operands, the unary operators + , — , and ^ are defined as follows:

Integer overflow

For unsigned integer values, the operations + , — , * , and << are computed modulo 2 n , where n is the bit width of the unsigned integer’s type. Loosely speaking, these unsigned integer operations discard high bits upon overflow, and programs may rely on «wrap around».

For signed integers, the operations + , — , * , / , and << may legally overflow and the resulting value exists and is deterministically defined by the signed integer representation, the operation, and its operands. Overflow does not cause a run-time panic. A compiler may not optimize code under the assumption that overflow does not occur. For instance, it may not assume that x < x + 1 is always true.

Floating-point operators

For floating-point and complex numbers, +x is the same as x , while -x is the negation of x . The result of a floating-point or complex division by zero is not specified beyond the IEEE-754 standard; whether a run-time panic occurs is implementation-specific.

An implementation may combine multiple floating-point operations into a single fused operation, possibly across statements, and produce a result that differs from the value obtained by executing and rounding the instructions individually. An explicit floating-point type conversion rounds to the precision of the target type, preventing fusion that would discard that rounding.

For instance, some architectures provide a «fused multiply and add» (FMA) instruction that computes x*y + z without rounding the intermediate result x*y . These examples show when a Go implementation can use that instruction:

String concatenation

Strings can be concatenated using the + operator or the += assignment operator:

String addition creates a new string by concatenating the operands.

Comparison operators

Comparison operators compare two operands and yield an untyped boolean value.

In any comparison, the first operand must be assignable to the type of the second operand, or vice versa.

The equality operators == and != apply to operands of comparable types. The ordering operators < , <= , > , and >= apply to operands of ordered types. These terms and the result of the comparisons are defined as follows:

• Boolean types are comparable. Two boolean values are equal if they are either both true or both false .
• Integer types are comparable and ordered. Two integer values are compared in the usual way.
• Floating-point types are comparable and ordered. Two floating-point values are compared as defined by the IEEE-754 standard.
• Complex types are comparable. Two complex values u and v are equal if both real(u) == real(v) and imag(u) == imag(v) .
• String types are comparable and ordered. Two string values are compared lexically byte-wise.
• Pointer types are comparable. Two pointer values are equal if they point to the same variable or if both have value nil . Pointers to distinct zero-size variables may or may not be equal.
• Channel types are comparable. Two channel values are equal if they were created by the same call to make or if both have value nil .
• Interface types that are not type parameters are comparable. Two interface values are equal if they have identical dynamic types and equal dynamic values or if both have value nil .
• A value x of non-interface type X and a value t of interface type T can be compared if type X is comparable and X implements T . They are equal if t ‘s dynamic type is identical to X and t ‘s dynamic value is equal to x .
• Struct types are comparable if all their field types are comparable. Two struct values are equal if their corresponding non-blank field values are equal. The fields are compared in source order, and comparison stops as soon as two field values differ (or all fields have been compared).
• Array types are comparable if their array element types are comparable. Two array values are equal if their corresponding element values are equal. The elements are compared in ascending index order, and comparison stops as soon as two element values differ (or all elements have been compared).
• Type parameters are comparable if they are strictly comparable (see below).

A comparison of two interface values with identical dynamic types causes a run-time panic if that type is not comparable. This behavior applies not only to direct interface value comparisons but also when comparing arrays of interface values or structs with interface-valued fields.

Slice, map, and function types are not comparable. However, as a special case, a slice, map, or function value may be compared to the predeclared identifier nil . Comparison of pointer, channel, and interface values to nil is also allowed and follows from the general rules above.

A type is strictly comparable if it is comparable and not an interface type nor composed of interface types. Specifically:

• Boolean, numeric, string, pointer, and channel types are strictly comparable.
• Struct types are strictly comparable if all their field types are strictly comparable.
• Array types are strictly comparable if their array element types are strictly comparable.
• Type parameters are strictly comparable if all types in their type set are strictly comparable.

Logical operators

Logical operators apply to boolean values and yield a result of the same type as the operands. The right operand is evaluated conditionally.

Address operators

For an operand x of type T , the address operation &x generates a pointer of type *T to x . The operand must be addressable, that is, either a variable, pointer indirection, or slice indexing operation; or a field selector of an addressable struct operand; or an array indexing operation of an addressable array. As an exception to the addressability requirement, x may also be a (possibly parenthesized) composite literal. If the evaluation of x would cause a run-time panic, then the evaluation of &x does too.

For an operand x of pointer type *T , the pointer indirection *x denotes the variable of type T pointed to by x . If x is nil , an attempt to evaluate *x will cause a run-time panic.

Receive operator

For an operand ch whose core type is a channel, the value of the receive operation <-ch is the value received from the channel ch . The channel direction must permit receive operations, and the type of the receive operation is the element type of the channel. The expression blocks until a value is available. Receiving from a nil channel blocks forever. A receive operation on a closed channel can always proceed immediately, yielding the element type’s zero value after any previously sent values have been received.

A receive expression used in an assignment statement or initialization of the special form

yields an additional untyped boolean result reporting whether the communication succeeded. The value of ok is true if the value received was delivered by a successful send operation to the channel, or false if it is a zero value generated because the channel is closed and empty.

Conversions

A conversion changes the type of an expression to the type specified by the conversion. A conversion may appear literally in the source, or it may be implied by the context in which an expression appears.

An explicit conversion is an expression of the form T(x) where T is a type and x is an expression that can be converted to type T .

If the type starts with the operator * or <- , or if the type starts with the keyword func and has no result list, it must be parenthesized when necessary to avoid ambiguity:

A constant value x can be converted to type T if x is representable by a value of T . As a special case, an integer constant x can be explicitly converted to a string type using the same rule as for non-constant x .

Converting a constant to a type that is not a type parameter yields a typed constant.

Converting a constant to a type parameter yields a non-constant value of that type, with the value represented as a value of the type argument that the type parameter is instantiated with. For example, given the function:

the conversion P(1.1) results in a non-constant value of type P and the value 1.1 is represented as a float32 or a float64 depending on the type argument for f . Accordingly, if f is instantiated with a float32 type, the numeric value of the expression P(1.1) + 1.2 will be computed with the same precision as the corresponding non-constant float32 addition.

A non-constant value x can be converted to type T in any of these cases:

• x is assignable to T .
• ignoring struct tags (see below), x ‘s type and T are not type parameters but have identicalunderlying types.
• ignoring struct tags (see below), x ‘s type and T are pointer types that are not named types, and their pointer base types are not type parameters but have identical underlying types.
• x ‘s type and T are both integer or floating point types.
• x ‘s type and T are both complex types.
• x is an integer or a slice of bytes or runes and T is a string type.
• x is a string and T is a slice of bytes or runes.
• x is a slice, T is an array or a pointer to an array, and the slice and array types have identical element types.

Additionally, if T or x ‘s type V are type parameters, x can also be converted to type T if one of the following conditions applies:

• Both V and T are type parameters and a value of each type in V ‘s type set can be converted to each type in T ‘s type set.
• Only V is a type parameter and a value of each type in V ‘s type set can be converted to T .
• Only T is a type parameter and x can be converted to each type in T ‘s type set.

Struct tags are ignored when comparing struct types for identity for the purpose of conversion:

Specific rules apply to (non-constant) conversions between numeric types or to and from a string type. These conversions may change the representation of x and incur a run-time cost. All other conversions only change the type but not the representation of x .

There is no linguistic mechanism to convert between pointers and integers. The package unsafe implements this functionality under restricted circumstances.

Conversions between numeric types

For the conversion of non-constant numeric values, the following rules apply:

1. When converting between integer types, if the value is a signed integer, it is sign extended to implicit infinite precision; otherwise it is zero extended. It is then truncated to fit in the result type’s size. For example, if v := uint16(0x10F0) , then uint32(int8(v)) == 0xFFFFFFF0 . The conversion always yields a valid value; there is no indication of overflow.
2. When converting a floating-point number to an integer, the fraction is discarded (truncation towards zero).
3. When converting an integer or floating-point number to a floating-point type, or a complex number to another complex type, the result value is rounded to the precision specified by the destination type. For instance, the value of a variable x of type float32 may be stored using additional precision beyond that of an IEEE-754 32-bit number, but float32(x) represents the result of rounding x ‘s value to 32-bit precision. Similarly, x + 0.1 may use more than 32 bits of precision, but float32(x + 0.1) does not.

In all non-constant conversions involving floating-point or complex values, if the result type cannot represent the value the conversion succeeds but the result value is implementation-dependent.

Conversions to and from a string type

1. Converting a signed or unsigned integer value to a string type yields a string containing the UTF-8 representation of the integer. Values outside the range of valid Unicode code points are converted to «\uFFFD» .
2. Converting a slice of bytes to a string type yields a string whose successive bytes are the elements of the slice.
3. Converting a slice of runes to a string type yields a string that is the concatenation of the individual rune values converted to strings.
4. Converting a value of a string type to a slice of bytes type yields a slice whose successive elements are the bytes of the string.
5. Converting a value of a string type to a slice of runes type yields a slice containing the individual Unicode code points of the string.

Conversions from slice to array or array pointer

Converting a slice to an array yields an array containing the elements of the underlying array of the slice. Similarly, converting a slice to an array pointer yields a pointer to the underlying array of the slice. In both cases, if the length of the slice is less than the length of the array, a run-time panic occurs.

Constant expressions

Constant expressions may contain only constant operands and are evaluated at compile time.

Untyped boolean, numeric, and string constants may be used as operands wherever it is legal to use an operand of boolean, numeric, or string type, respectively.

A constant comparison always yields an untyped boolean constant. If the left operand of a constant shift expression is an untyped constant, the result is an integer constant; otherwise it is a constant of the same type as the left operand, which must be of integer type.

Any other operation on untyped constants results in an untyped constant of the same kind; that is, a boolean, integer, floating-point, complex, or string constant. If the untyped operands of a binary operation (other than a shift) are of different kinds, the result is of the operand’s kind that appears later in this list: integer, rune, floating-point, complex. For example, an untyped integer constant divided by an untyped complex constant yields an untyped complex constant.

Applying the built-in function complex to untyped integer, rune, or floating-point constants yields an untyped complex constant.

Constant expressions are always evaluated exactly; intermediate values and the constants themselves may require precision significantly larger than supported by any predeclared type in the language. The following are legal declarations:

The divisor of a constant division or remainder operation must not be zero:

The values of typed constants must always be accurately representable by values of the constant type. The following constant expressions are illegal:

The mask used by the unary bitwise complement operator ^ matches the rule for non-constants: the mask is all 1s for unsigned constants and -1 for signed and untyped constants.

Implementation restriction: A compiler may use rounding while computing untyped floating-point or complex constant expressions; see the implementation restriction in the section on constants. This rounding may cause a floating-point constant expression to be invalid in an integer context, even if it would be integral when calculated using infinite precision, and vice versa.

Order of evaluation

At package level, initialization dependencies determine the evaluation order of individual initialization expressions in variable declarations. Otherwise, when evaluating the operands of an expression, assignment, or return statement, all function calls, method calls, and communication operations are evaluated in lexical left-to-right order.

For example, in the (function-local) assignment

the function calls and communication happen in the order f() , h() , i() , j() , <-c , g() , and k() . However, the order of those events compared to the evaluation and indexing of x and the evaluation of y is not specified.

At package level, initialization dependencies override the left-to-right rule for individual initialization expressions, but not for operands within each expression:

The function calls happen in the order u() , sqr() , v() , f() , v() , and g() .

Floating-point operations within a single expression are evaluated according to the associativity of the operators. Explicit parentheses affect the evaluation by overriding the default associativity. In the expression x + (y + z) the addition y + z is performed before adding x .

Statements

Statements control execution.

Terminating statements

A terminating statement interrupts the regular flow of control in a block. The following statements are terminating:

1. A «return» or «goto» statement.
2. A call to the built-in function panic .
3. A block in which the statement list ends in a terminating statement.
4. An «if» statement in which:
   • the «else» branch is present, and
   • both branches are terminating statements.
5. A «for» statement in which:
   • there are no «break» statements referring to the «for» statement, and
   • the loop condition is absent, and
   • the «for» statement does not use a range clause.
6. A «switch» statement in which:
   • there are no «break» statements referring to the «switch» statement,
   • there is a default case, and
   • the statement lists in each case, including the default, end in a terminating statement, or a possibly labeled «fallthrough» statement.
7. A «select» statement in which:
   • there are no «break» statements referring to the «select» statement, and
   • the statement lists in each case, including the default if present, end in a terminating statement.
8. A labeled statement labeling a terminating statement.

All other statements are not terminating.

A statement list ends in a terminating statement if the list is not empty and its final non-empty statement is terminating.

Empty statements

The empty statement does nothing.

Labeled statements

A labeled statement may be the target of a goto , break or continue statement.

Expression statements

With the exception of specific built-in functions, function and method calls and receive operations can appear in statement context. Such statements may be parenthesized.

The following built-in functions are not permitted in statement context:

Send statements

A send statement sends a value on a channel. The channel expression’s core type must be a channel, the channel direction must permit send operations, and the type of the value to be sent must be assignable to the channel’s element type.

Both the channel and the value expression are evaluated before communication begins. Communication blocks until the send can proceed. A send on an unbuffered channel can proceed if a receiver is ready. A send on a buffered channel can proceed if there is room in the buffer. A send on a closed channel proceeds by causing a run-time panic. A send on a nil channel blocks forever.

IncDec statements

The «++» and «—» statements increment or decrement their operands by the untyped constant 1 . As with an assignment, the operand must be addressable or a map index expression.

The following assignment statements are semantically equivalent:

Assignment statements

An assignment replaces the current value stored in a variable with a new value specified by an expression. An assignment statement may assign a single value to a single variable, or multiple values to a matching number of variables.

An assignment operation x op = y where op is a binary arithmetic operator is equivalent to x = x op (y) but evaluates x only once. The op = construct is a single token. In assignment operations, both the left- and right-hand expression lists must contain exactly one single-valued expression, and the left-hand expression must not be the blank identifier.

A tuple assignment assigns the individual elements of a multi-valued operation to a list of variables. There are two forms. In the first, the right hand operand is a single multi-valued expression such as a function call, a channel or map operation, or a type assertion. The number of operands on the left hand side must match the number of values. For instance, if f is a function returning two values,

assigns the first value to x and the second to y . In the second form, the number of operands on the left must equal the number of expressions on the right, each of which must be single-valued, and the nth expression on the right is assigned to the nth operand on the left:

The blank identifier provides a way to ignore right-hand side values in an assignment:

The assignment proceeds in two phases. First, the operands of index expressions and pointer indirections (including implicit pointer indirections in selectors) on the left and the expressions on the right are all evaluated in the usual order. Second, the assignments are carried out in left-to-right order.

In assignments, each value must be assignable to the type of the operand to which it is assigned, with the following special cases:

1. Any typed value may be assigned to the blank identifier.
2. If an untyped constant is assigned to a variable of interface type or the blank identifier, the constant is first implicitly converted to its default type.
3. If an untyped boolean value is assigned to a variable of interface type or the blank identifier, it is first implicitly converted to type bool .

If statements

«If» statements specify the conditional execution of two branches according to the value of a boolean expression. If the expression evaluates to true, the «if» branch is executed, otherwise, if present, the «else» branch is executed.

The expression may be preceded by a simple statement, which executes before the expression is evaluated.

Switch statements

«Switch» statements provide multi-way execution. An expression or type is compared to the «cases» inside the «switch» to determine which branch to execute.

There are two forms: expression switches and type switches. In an expression switch, the cases contain expressions that are compared against the value of the switch expression. In a type switch, the cases contain types that are compared against the type of a specially annotated switch expression. The switch expression is evaluated exactly once in a switch statement.

Expression switches

In an expression switch, the switch expression is evaluated and the case expressions, which need not be constants, are evaluated left-to-right and top-to-bottom; the first one that equals the switch expression triggers execution of the statements of the associated case; the other cases are skipped. If no case matches and there is a «default» case, its statements are executed. There can be at most one default case and it may appear anywhere in the «switch» statement. A missing switch expression is equivalent to the boolean value true .

If the switch expression evaluates to an untyped constant, it is first implicitly converted to its default type. The predeclared untyped value nil cannot be used as a switch expression. The switch expression type must be comparable.

If a case expression is untyped, it is first implicitly converted to the type of the switch expression. For each (possibly converted) case expression x and the value t of the switch expression, x == t must be a valid comparison.

In other words, the switch expression is treated as if it were used to declare and initialize a temporary variable t without explicit type; it is that value of t against which each case expression x is tested for equality.

In a case or default clause, the last non-empty statement may be a (possibly labeled) «fallthrough» statement to indicate that control should flow from the end of this clause to the first statement of the next clause. Otherwise control flows to the end of the «switch» statement. A «fallthrough» statement may appear as the last statement of all but the last clause of an expression switch.

The switch expression may be preceded by a simple statement, which executes before the expression is evaluated.

Implementation restriction: A compiler may disallow multiple case expressions evaluating to the same constant. For instance, the current compilers disallow duplicate integer, floating point, or string constants in case expressions.

Type switches

A type switch compares types rather than values. It is otherwise similar to an expression switch. It is marked by a special switch expression that has the form of a type assertion using the keyword type rather than an actual type:

Cases then match actual types T against the dynamic type of the expression x . As with type assertions, x must be of interface type, but not a type parameter, and each non-interface type T listed in a case must implement the type of x . The types listed in the cases of a type switch must all be different.

The TypeSwitchGuard may include a short variable declaration. When that form is used, the variable is declared at the end of the TypeSwitchCase in the implicit block of each clause. In clauses with a case listing exactly one type, the variable has that type; otherwise, the variable has the type of the expression in the TypeSwitchGuard.

Instead of a type, a case may use the predeclared identifier nil ; that case is selected when the expression in the TypeSwitchGuard is a nil interface value. There may be at most one nil case.

Given an expression x of type interface<> , the following type switch:

could be rewritten:

A type parameter or a generic type may be used as a type in a case. If upon instantiation that type turns out to duplicate another entry in the switch, the first matching case is chosen.

The type switch guard may be preceded by a simple statement, which executes before the guard is evaluated.

The «fallthrough» statement is not permitted in a type switch.

For statements

A «for» statement specifies repeated execution of a block. There are three forms: The iteration may be controlled by a single condition, a «for» clause, or a «range» clause.

For statements with single condition

In its simplest form, a «for» statement specifies the repeated execution of a block as long as a boolean condition evaluates to true. The condition is evaluated before each iteration. If the condition is absent, it is equivalent to the boolean value true .

For statements with for clause

A «for» statement with a ForClause is also controlled by its condition, but additionally it may specify an init and a post statement, such as an assignment, an increment or decrement statement. The init statement may be a short variable declaration, but the post statement must not. Variables declared by the init statement are re-used in each iteration.

If non-empty, the init statement is executed once before evaluating the condition for the first iteration; the post statement is executed after each execution of the block (and only if the block was executed). Any element of the ForClause may be empty but the semicolons are required unless there is only a condition. If the condition is absent, it is equivalent to the boolean value true .

For statements with range clause

A «for» statement with a «range» clause iterates through all entries of an array, slice, string or map, or values received on a channel. For each entry it assigns iteration values to corresponding iteration variables if present and then executes the block.

The expression on the right in the «range» clause is called the range expression, its core type must be an array, pointer to an array, slice, string, map, or channel permitting receive operations. As with an assignment, if present the operands on the left must be addressable or map index expressions; they denote the iteration variables. If the range expression is a channel, at most one iteration variable is permitted, otherwise there may be up to two. If the last iteration variable is the blank identifier, the range clause is equivalent to the same clause without that identifier.

The range expression x is evaluated once before beginning the loop, with one exception: if at most one iteration variable is present and len(x) is constant, the range expression is not evaluated.

Function calls on the left are evaluated once per iteration. For each iteration, iteration values are produced as follows if the respective iteration variables are present:

1. For an array, pointer to array, or slice value a , the index iteration values are produced in increasing order, starting at element index 0. If at most one iteration variable is present, the range loop produces iteration values from 0 up to len(a)-1 and does not index into the array or slice itself. For a nil slice, the number of iterations is 0.
2. For a string value, the «range» clause iterates over the Unicode code points in the string starting at byte index 0. On successive iterations, the index value will be the index of the first byte of successive UTF-8-encoded code points in the string, and the second value, of type rune , will be the value of the corresponding code point. If the iteration encounters an invalid UTF-8 sequence, the second value will be 0xFFFD , the Unicode replacement character, and the next iteration will advance a single byte in the string.
3. The iteration order over maps is not specified and is not guaranteed to be the same from one iteration to the next. If a map entry that has not yet been reached is removed during iteration, the corresponding iteration value will not be produced. If a map entry is created during iteration, that entry may be produced during the iteration or may be skipped. The choice may vary for each entry created and from one iteration to the next. If the map is nil , the number of iterations is 0.
4. For channels, the iteration values produced are the successive values sent on the channel until the channel is closed. If the channel is nil , the range expression blocks forever.

The iteration values are assigned to the respective iteration variables as in an assignment statement.

The iteration variables may be declared by the «range» clause using a form of short variable declaration ( := ). In this case their types are set to the types of the respective iteration values and their scope is the block of the «for» statement; they are re-used in each iteration. If the iteration variables are declared outside the «for» statement, after execution their values will be those of the last iteration.

Go statements

A «go» statement starts the execution of a function call as an independent concurrent thread of control, or goroutine, within the same address space.

The expression must be a function or method call; it cannot be parenthesized. Calls of built-in functions are restricted as for expression statements.

The function value and parameters are evaluated as usual in the calling goroutine, but unlike with a regular call, program execution does not wait for the invoked function to complete. Instead, the function begins executing independently in a new goroutine. When the function terminates, its goroutine also terminates. If the function has any return values, they are discarded when the function completes.

Select statements

A «select» statement chooses which of a set of possible send or receive operations will proceed. It looks similar to a «switch» statement but with the cases all referring to communication operations.

A case with a RecvStmt may assign the result of a RecvExpr to one or two variables, which may be declared using a short variable declaration. The RecvExpr must be a (possibly parenthesized) receive operation. There can be at most one default case and it may appear anywhere in the list of cases.

Execution of a «select» statement proceeds in several steps:

1. For all the cases in the statement, the channel operands of receive operations and the channel and right-hand-side expressions of send statements are evaluated exactly once, in source order, upon entering the «select» statement. The result is a set of channels to receive from or send to, and the corresponding values to send. Any side effects in that evaluation will occur irrespective of which (if any) communication operation is selected to proceed. Expressions on the left-hand side of a RecvStmt with a short variable declaration or assignment are not yet evaluated.
2. If one or more of the communications can proceed, a single one that can proceed is chosen via a uniform pseudo-random selection. Otherwise, if there is a default case, that case is chosen. If there is no default case, the «select» statement blocks until at least one of the communications can proceed.
3. Unless the selected case is the default case, the respective communication operation is executed.
4. If the selected case is a RecvStmt with a short variable declaration or an assignment, the left-hand side expressions are evaluated and the received value (or values) are assigned.
5. The statement list of the selected case is executed.

Since communication on nil channels can never proceed, a select with only nil channels and no default case blocks forever.

Return statements

A «return» statement in a function F terminates the execution of F , and optionally provides one or more result values. Any functions deferred by F are executed before F returns to its caller.

In a function without a result type, a «return» statement must not specify any result values.

There are three ways to return values from a function with a result type:

1. The return value or values may be explicitly listed in the «return» statement. Each expression must be single-valued and assignable to the corresponding element of the function’s result type.
2. The expression list in the «return» statement may be a single call to a multi-valued function. The effect is as if each value returned from that function were assigned to a temporary variable with the type of the respective value, followed by a «return» statement listing these variables, at which point the rules of the previous case apply.
3. The expression list may be empty if the function’s result type specifies names for its result parameters. The result parameters act as ordinary local variables and the function may assign values to them as necessary. The «return» statement returns the values of these variables.

Regardless of how they are declared, all the result values are initialized to the zero values for their type upon entry to the function. A «return» statement that specifies results sets the result parameters before any deferred functions are executed.

Implementation restriction: A compiler may disallow an empty expression list in a «return» statement if a different entity (constant, type, or variable) with the same name as a result parameter is in scope at the place of the return.

Break statements

A «break» statement terminates execution of the innermost «for», «switch», or «select» statement within the same function.

If there is a label, it must be that of an enclosing «for», «switch», or «select» statement, and that is the one whose execution terminates.

Continue statements

A «continue» statement begins the next iteration of the innermost enclosing «for» loop by advancing control to the end of the loop block. The «for» loop must be within the same function.

If there is a label, it must be that of an enclosing «for» statement, and that is the one whose execution advances.

Goto statements

A «goto» statement transfers control to the statement with the corresponding label within the same function.

Executing the «goto» statement must not cause any variables to come into scope that were not already in scope at the point of the goto. For instance, this example:

is erroneous because the jump to label L skips the creation of v .

A «goto» statement outside a block cannot jump to a label inside that block. For instance, this example:

is erroneous because the label L1 is inside the «for» statement’s block but the goto is not.

Fallthrough statements

A «fallthrough» statement transfers control to the first statement of the next case clause in an expression «switch» statement. It may be used only as the final non-empty statement in such a clause.

Defer statements

A «defer» statement invokes a function whose execution is deferred to the moment the surrounding function returns, either because the surrounding function executed a return statement, reached the end of its function body, or because the corresponding goroutine is panicking.

The expression must be a function or method call; it cannot be parenthesized. Calls of built-in functions are restricted as for expression statements.

Each time a «defer» statement executes, the function value and parameters to the call are evaluated as usual and saved anew but the actual function is not invoked. Instead, deferred functions are invoked immediately before the surrounding function returns, in the reverse order they were deferred. That is, if the surrounding function returns through an explicit return statement, deferred functions are executed after any result parameters are set by that return statement but before the function returns to its caller. If a deferred function value evaluates to nil , execution panics when the function is invoked, not when the «defer» statement is executed.

For instance, if the deferred function is a function literal and the surrounding function has named result parameters that are in scope within the literal, the deferred function may access and modify the result parameters before they are returned. If the deferred function has any return values, they are discarded when the function completes. (See also the section on handling panics.)

Built-in functions

Built-in functions are predeclared. They are called like any other function but some of them accept a type instead of an expression as the first argument.

The built-in functions do not have standard Go types, so they can only appear in call expressions; they cannot be used as function values.

Close

For an argument ch with a core type that is a channel, the built-in function close records that no more values will be sent on the channel. It is an error if ch is a receive-only channel. Sending to or closing a closed channel causes a run-time panic. Closing the nil channel also causes a run-time panic. After calling close , and after any previously sent values have been received, receive operations will return the zero value for the channel’s type without blocking. The multi-valued receive operation returns a received value along with an indication of whether the channel is closed.

Length and capacity

The built-in functions len and cap take arguments of various types and return a result of type int . The implementation guarantees that the result always fits into an int .

If the argument type is a type parameter P , the call len(e) (or cap(e) respectively) must be valid for each type in P ‘s type set. The result is the length (or capacity, respectively) of the argument whose type corresponds to the type argument with which P was instantiated.

The capacity of a slice is the number of elements for which there is space allocated in the underlying array. At any time the following relationship holds:

The length of a nil slice, map or channel is 0. The capacity of a nil slice or channel is 0.

The expression len(s) is constant if s is a string constant. The expressions len(s) and cap(s) are constants if the type of s is an array or pointer to an array and the expression s does not contain channel receives or (non-constant) function calls; in this case s is not evaluated. Otherwise, invocations of len and cap are not constant and s is evaluated.

Allocation

The built-in function new takes a type T , allocates storage for a variable of that type at run time, and returns a value of type *T pointing to it. The variable is initialized as described in the section on initial values.

allocates storage for a variable of type S , initializes it ( a=0 , b=0.0 ), and returns a value of type *S containing the address of the location.

Making slices, maps and channels

The built-in function make takes a type T , optionally followed by a type-specific list of expressions. The core type of T must be a slice, map or channel. It returns a value of type T (not *T ). The memory is initialized as described in the section on initial values.

Each of the size arguments n and m must be of integer type, have a type set containing only integer types, or be an untyped constant. A constant size argument must be non-negative and representable by a value of type int ; if it is an untyped constant it is given type int . If both n and m are provided and are constant, then n must be no larger than m . For slices and channels, if n is negative or larger than m at run time, a run-time panic occurs.

Calling make with a map type and size hint n will create a map with initial space to hold n map elements. The precise behavior is implementation-dependent.

Appending to and copying slices

The built-in functions append and copy assist in common slice operations. For both functions, the result is independent of whether the memory referenced by the arguments overlaps.

The variadic function append appends zero or more values x to a slice s and returns the resulting slice of the same type as s . The core type of s must be a slice of type []E . The values x are passed to a parameter of type . E and the respective parameter passing rules apply. As a special case, if the core type of s is []byte , append also accepts a second argument with core type bytestring followed by . . This form appends the bytes of the byte slice or string.

If the capacity of s is not large enough to fit the additional values, append allocates a new, sufficiently large underlying array that fits both the existing slice elements and the additional values. Otherwise, append re-uses the underlying array.

Deletion of map elements

The built-in function delete removes the element with key k from a map m . The value k must be assignable to the key type of m .

If the type of m is a type parameter, all types in that type set must be maps, and they must all have identical key types.

If the map m is nil or the element m[k] does not exist, delete is a no-op.

Manipulating complex numbers

Three functions assemble and disassemble complex numbers. The built-in function complex constructs a complex value from a floating-point real and imaginary part, while real and imag extract the real and imaginary parts of a complex value.

The type of the arguments and return value correspond. For complex , the two arguments must be of the same floating-point type and the return type is the complex type with the corresponding floating-point constituents: complex64 for float32 arguments, and complex128 for float64 arguments. If one of the arguments evaluates to an untyped constant, it is first implicitly converted to the type of the other argument. If both arguments evaluate to untyped constants, they must be non-complex numbers or their imaginary parts must be zero, and the return value of the function is an untyped complex constant.

For real and imag , the argument must be of complex type, and the return type is the corresponding floating-point type: float32 for a complex64 argument, and float64 for a complex128 argument. If the argument evaluates to an untyped constant, it must be a number, and the return value of the function is an untyped floating-point constant.

The real and imag functions together form the inverse of complex , so for a value z of a complex type Z , z == Z(complex(real(z), imag(z))) .

If the operands of these functions are all constants, the return value is a constant.

Arguments of type parameter type are not permitted.

Handling panics

Two built-in functions, panic and recover , assist in reporting and handling run-time panics and program-defined error conditions.

While executing a function F , an explicit call to panic or a run-time panic terminates the execution of F . Any functions deferred by F are then executed as usual. Next, any deferred functions run by F ‘s caller are run, and so on up to any deferred by the top-level function in the executing goroutine. At that point, the program is terminated and the error condition is reported, including the value of the argument to panic . This termination sequence is called panicking.

The recover function allows a program to manage behavior of a panicking goroutine. Suppose a function G defers a function D that calls recover and a panic occurs in a function on the same goroutine in which G is executing. When the running of deferred functions reaches D , the return value of D ‘s call to recover will be the value passed to the call of panic . If D returns normally, without starting a new panic , the panicking sequence stops. In that case, the state of functions called between G and the call to panic is discarded, and normal execution resumes. Any functions deferred by G before D are then run and G ‘s execution terminates by returning to its caller.

The return value of recover is nil if any of the following conditions holds:

• panic ‘s argument was nil ;
• the goroutine is not panicking;
• recover was not called directly by a deferred function.

The protect function in the example below invokes the function argument g and protects callers from run-time panics raised by g .

Bootstrapping

Current implementations provide several built-in functions useful during bootstrapping. These functions are documented for completeness but are not guaranteed to stay in the language. They do not return a result.

Implementation restriction: print and println need not accept arbitrary argument types, but printing of boolean, numeric, and string types must be supported.

Packages

Go programs are constructed by linking together packages. A package in turn is constructed from one or more source files that together declare constants, types, variables and functions belonging to the package and which are accessible in all files of the same package. Those elements may be exported and used in another package.

Source file organization

Each source file consists of a package clause defining the package to which it belongs, followed by a possibly empty set of import declarations that declare packages whose contents it wishes to use, followed by a possibly empty set of declarations of functions, types, variables, and constants.

Package clause

A package clause begins each source file and defines the package to which the file belongs.

The PackageName must not be the blank identifier.

A set of files sharing the same PackageName form the implementation of a package. An implementation may require that all source files for a package inhabit the same directory.

Import declarations

An import declaration states that the source file containing the declaration depends on functionality of the imported package (§Program initialization and execution) and enables access to exported identifiers of that package. The import names an identifier (PackageName) to be used for access and an ImportPath that specifies the package to be imported.

The PackageName is used in qualified identifiers to access exported identifiers of the package within the importing source file. It is declared in the file block. If the PackageName is omitted, it defaults to the identifier specified in the package clause of the imported package. If an explicit period ( . ) appears instead of a name, all the package’s exported identifiers declared in that package’s package block will be declared in the importing source file’s file block and must be accessed without a qualifier.

The interpretation of the ImportPath is implementation-dependent but it is typically a substring of the full file name of the compiled package and may be relative to a repository of installed packages.

Implementation restriction: A compiler may restrict ImportPaths to non-empty strings using only characters belonging to Unicode’s L, M, N, P, and S general categories (the Graphic characters without spaces) and may also exclude the characters !»#$%&'()*,:;<=>?[\]^` <|>and the Unicode replacement character U+FFFD.

Consider a compiled a package containing the package clause package math , which exports function Sin , and installed the compiled package in the file identified by «lib/math» . This table illustrates how Sin is accessed in files that import the package after the various types of import declaration.

An import declaration declares a dependency relation between the importing and imported package. It is illegal for a package to import itself, directly or indirectly, or to directly import a package without referring to any of its exported identifiers. To import a package solely for its side-effects (initialization), use the blank identifier as explicit package name:

An example package

Here is a complete Go package that implements a concurrent prime sieve.

Program initialization and execution

The zero value

When storage is allocated for a variable, either through a declaration or a call of new , or when a new value is created, either through a composite literal or a call of make , and no explicit initialization is provided, the variable or value is given a default value. Each element of such a variable or value is set to the zero value for its type: false for booleans, 0 for numeric types, «» for strings, and nil for pointers, functions, interfaces, slices, channels, and maps. This initialization is done recursively, so for instance each element of an array of structs will have its fields zeroed if no value is specified.

These two simple declarations are equivalent:

the following holds:

The same would also be true after

Package initialization

Within a package, package-level variable initialization proceeds stepwise, with each step selecting the variable earliest in declaration order which has no dependencies on uninitialized variables.

More precisely, a package-level variable is considered ready for initialization if it is not yet initialized and either has no initialization expression or its initialization expression has no dependencies on uninitialized variables. Initialization proceeds by repeatedly initializing the next package-level variable that is earliest in declaration order and ready for initialization, until there are no variables ready for initialization.

If any variables are still uninitialized when this process ends, those variables are part of one or more initialization cycles, and the program is not valid.

Multiple variables on the left-hand side of a variable declaration initialized by single (multi-valued) expression on the right-hand side are initialized together: If any of the variables on the left-hand side is initialized, all those variables are initialized in the same step.

For the purpose of package initialization, blank variables are treated like any other variables in declarations.

The declaration order of variables declared in multiple files is determined by the order in which the files are presented to the compiler: Variables declared in the first file are declared before any of the variables declared in the second file, and so on.

Dependency analysis does not rely on the actual values of the variables, only on lexical references to them in the source, analyzed transitively. For instance, if a variable x ‘s initialization expression refers to a function whose body refers to variable y then x depends on y . Specifically:

• A reference to a variable or function is an identifier denoting that variable or function.
• A reference to a method m is a method value or method expression of the form t.m , where the (static) type of t is not an interface type, and the method m is in the method set of t . It is immaterial whether the resulting function value t.m is invoked.
• A variable, function, or method x depends on a variable y if x ‘s initialization expression or body (for functions and methods) contains a reference to y or to a function or method that depends on y .

For example, given the declarations

the initialization order is d , b , c , a . Note that the order of subexpressions in initialization expressions is irrelevant: a = c + b and a = b + c result in the same initialization order in this example.

Dependency analysis is performed per package; only references referring to variables, functions, and (non-interface) methods declared in the current package are considered. If other, hidden, data dependencies exists between variables, the initialization order between those variables is unspecified.

For instance, given the declarations

the variable a will be initialized after b but whether x is initialized before b , between b and a , or after a , and thus also the moment at which sideEffect() is called (before or after x is initialized) is not specified.

Variables may also be initialized using functions named init declared in the package block, with no arguments and no result parameters.

Multiple such functions may be defined per package, even within a single source file. In the package block, the init identifier can be used only to declare init functions, yet the identifier itself is not declared. Thus init functions cannot be referred to from anywhere in a program.

A package with no imports is initialized by assigning initial values to all its package-level variables followed by calling all init functions in the order they appear in the source, possibly in multiple files, as presented to the compiler. If a package has imports, the imported packages are initialized before initializing the package itself. If multiple packages import a package, the imported package will be initialized only once. The importing of packages, by construction, guarantees that there can be no cyclic initialization dependencies.

Package initialization—variable initialization and the invocation of init functions—happens in a single goroutine, sequentially, one package at a time. An init function may launch other goroutines, which can run concurrently with the initialization code. However, initialization always sequences the init functions: it will not invoke the next one until the previous one has returned.

To ensure reproducible initialization behavior, build systems are encouraged to present multiple files belonging to the same package in lexical file name order to a compiler.

Program execution

A complete program is created by linking a single, unimported package called the main package with all the packages it imports, transitively. The main package must have package name main and declare a function main that takes no arguments and returns no value.

Program execution begins by initializing the main package and then invoking the function main . When that function invocation returns, the program exits. It does not wait for other (non- main ) goroutines to complete.

Errors

The predeclared type error is defined as

It is the conventional interface for representing an error condition, with the nil value representing no error. For instance, a function to read data from a file might be defined:

Run-time panics

Execution errors such as attempting to index an array out of bounds trigger a run-time panic equivalent to a call of the built-in function panic with a value of the implementation-defined interface type runtime.Error . That type satisfies the predeclared interface type error . The exact error values that represent distinct run-time error conditions are unspecified.

System considerations

Package unsafe

The built-in package unsafe , known to the compiler and accessible through the import path «unsafe» , provides facilities for low-level programming including operations that violate the type system. A package using unsafe must be vetted manually for type safety and may not be portable. The package provides the following interface:

A Pointer is a pointer type but a Pointer value may not be dereferenced. Any pointer or value of underlying type uintptr can be converted to a type of underlying type Pointer and vice versa. The effect of converting between Pointer and uintptr is implementation-defined.

The functions Alignof and Sizeof take an expression x of any type and return the alignment or size, respectively, of a hypothetical variable v as if v was declared via var v = x .

The function Offsetof takes a (possibly parenthesized) selector s.f , denoting a field f of the struct denoted by s or *s , and returns the field offset in bytes relative to the struct’s address. If f is an embedded field, it must be reachable without pointer indirections through fields of the struct. For a struct s with field f :

Computer architectures may require memory addresses to be aligned; that is, for addresses of a variable to be a multiple of a factor, the variable’s type’s alignment. The function Alignof takes an expression denoting a variable of any type and returns the alignment of the (type of the) variable in bytes. For a variable x :

A (variable of) type T has variable size if T is a type parameter, or if it is an array or struct type containing elements or fields of variable size. Otherwise the size is constant. Calls to Alignof , Offsetof , and Sizeof are compile-time constant expressions of type uintptr if their arguments (or the struct s in the selector expression s.f for Offsetof ) are types of constant size.

The function Add adds len to ptr and returns the updated pointer unsafe.Pointer(uintptr(ptr) + uintptr(len)) . The len argument must be of integer type or an untyped constant. A constant len argument must be representable by a value of type int ; if it is an untyped constant it is given type int . The rules for valid uses of Pointer still apply.

The function Slice returns a slice whose underlying array starts at ptr and whose length and capacity are len . Slice(ptr, len) is equivalent to

except that, as a special case, if ptr is nil and len is zero, Slice returns nil .

The len argument must be of integer type or an untyped constant. A constant len argument must be non-negative and representable by a value of type int ; if it is an untyped constant it is given type int . At run time, if len is negative, or if ptr is nil and len is not zero, a run-time panic occurs.

The function SliceData returns a pointer to the underlying array of the slice argument. If the slice’s capacity cap(slice) is not zero, that pointer is &slice[:1][0] . If slice is nil , the result is nil . Otherwise it is a non- nil pointer to an unspecified memory address.

The function String returns a string value whose underlying bytes start at ptr and whose length is len . The same requirements apply to the ptr and len argument as in the function Slice . If len is zero, the result is the empty string «» . Since Go strings are immutable, the bytes passed to String must not be modified afterwards.

The function StringData returns a pointer to the underlying bytes of the str argument. For an empty string the return value is unspecified, and may be nil . Since Go strings are immutable, the bytes returned by StringData must not be modified.

Size and alignment guarantees

For the numeric types, the following sizes are guaranteed:

The following minimal alignment properties are guaranteed:

1. For a variable x of any type: unsafe.Alignof(x) is at least 1.
2. For a variable x of struct type: unsafe.Alignof(x) is the largest of all the values unsafe.Alignof(x.f) for each field f of x , but at least 1.
3. For a variable x of array type: unsafe.Alignof(x) is the same as the alignment of a variable of the array’s element type.

A struct or array type has size zero if it contains no fields (or elements, respectively) that have a size greater than zero. Two distinct zero-size variables may have the same address in memory.