Interfaces in Go

An interface type defines some (type) requirements. All non-interface types satisfying these requirements form a type set, which is called the type set of the interface type.

The requirements defined for an interface type are expressed by embedding some interface elements in the interface type. Currently (Go 1.20), there are two kinds of interface elements, method elements and type elements.

• A method element presents as a method specification. A method specification embedded in an interface type may not use the blank identifier _ as its name.
• A type element may be a type name, a type literal, an approximation type, or a type union. The current article doesn't talk much about the latter two and only talks about type names and literals which denote interface types.

For example, the predeclared error interface type, which definition is shown below, embeds a method specification Error() string. In the definition, interface{...} is called an interface type literal and the word interface are a keyword in Go.

type error interface {
        Error() string
}

We may also say the error interface type (directly) specified a method Error() string. Its type set is composed of all non-interface types which have a method with the specification Error() string. In theory, the type set is infinite. Surely, for a specified Go project, it is finite.

The following are some other interface type definitions and alias declarations.

// This interface directly specifies two methods and
// embeds two other interface types, one of which
// is a type name and the other is a type literal.
type ReadWriteCloser = interface {
	Read(buf []byte) (n int, err error)
	Write(buf []byte) (n int, err error)
	error                      // a type name
	interface{ Close() error } // a type literal
}

// This interface embeds an approximation type. Its type
// set inlcudes all types whose underlying type is []byte.
type AnyByteSlice = interface {
	~[]byte
}

// This interface embeds a type union. Its type set inlcudes
// 6 types: uint, uint8, uint16, uint32, uint64 and uintptr.
type Unsigned interface {
	uint | uint8 | uint16 | uint32 | uint64 | uintptr
}

Embedding an interface type (denoted by either a type name or a type literal) in another one is equivalent to (recursively) expanding the elements in the former into the latter. For example, the interface type denoted by the type alias ReadWriteCloser is equivalent to the interface type denoted by the following literal, which directly specifies four methods.

interface {
	Read(buf []byte) (n int, err error)
	Write(buf []byte) (n int, err error)
	Error() string
	Close() error
}

The type set of the above interface type is composed of all non-interface types which at least have the four methods specified by the interface type. The type set is also infinite. It is definitely a subset of the type set of error interface type.

Please note that, before Go 1.18, only interface type names may be embedded in interface types.

The interface types shown in the following code are all called blank interface types, which embeds nothing.

// The unnamed blank interface type.
interface{}
	
// Nothing is a defined blank interface type.
type Nothing interface{}

In fact, Go 1.18 introduced a predeclared alias, any, which denotes the blank interface type interface{}.

The type set of a blank interface type is composed of all non-interface types.

Each type has a method set associated with it.

• For a non-interface type, its method set is composed of the specifications of all the methods (either explicit or implicit ones) declared for it.
• For an interface type, its method set is composed of all the method specifications it specifies, either directly or indirectly through embedding other types.

In the examples shown in the last section,

• the method set of the interface type denoted by ReadWriteCloser contains four methods.
• the method set of the predeclared interface type error contains only one method.
• the method set of a blank interface type is empty.

For convenience, the method set of a type is often also called the method set of any value of the type.

Basic interface types are the interface types which may be used as value types. A non-basic interface type is also called a constraint-only interface type.

Currently (Go 1.20), every basic interface type could be defined entirely by a method set (may be empty). In other words, a basic interface type doesn't need type elements to be defined.

In the examples shown in the section before the last, the interface type denoted by alias ReadWriteCloser is a basic type, but the Unsigned interface type and the type denoted by alias AnyByteSlice are not. The latter two are both constraint-only interface types.

Blank interface types and the predeclared error interface type are also all basic interface types.

Two unnamed basic interface types are identical if their method sets are identical. Please note, non-exported method names (which start with lower-case letters), from different packages will be always viewed as two different method names, even if the two method names themselves are the same.

If a non-interface type is contained in the type set of an interface type, then we say the non-interface type implements the interface type. If the type set of an interface type is a subset of another interface type, then we say the former one implements the latter one.

An interface type always implements itself, as a type set is always a subset (or superset) of itself. Similarly, two interface types with the same method set implement each other. In fact, two unnamed interface types are identical if their type sets are identical.

If a type T implements an interface type X, then the method set of T must be superset of X, whether T is an interface type or an non-interface type. Generally, not vice versa. But if X is a basic interface, then vice versa. For example, in the examples provided in a previous section, the interface type denoted by ReadWriteCloser implements the error interface type.

Implementations are all implicit in Go. The compiler does not require implementation relations to be specified in code explicitly. There is not an implements keyword in Go. Go compilers will check the implementation relations automatically as needed.

For example, in the following example, the method sets of struct pointer type *Book, integer type MyInt and pointer type *MyInt all contain the method specification About() string, so they all implement the above mentioned interface type Aboutable.

type Aboutable interface {
	About() string
}

type Book struct {
	name string
	// more other fields ...
}

func (book *Book) About() string {
	return "Book: " + book.name
}

type MyInt int

func (MyInt) About() string {
	return "I'm a custom integer value"
}

The implicit implementation design makes it possible to let types defined in other library packages, such as standard packages, passively implement some interface types declared in user packages. For example, if we declare an interface type as the following one, then the type DB and type Tx declared in the database/sql standard package will both implement the interface type automatically, for they both have the three corresponding methods specified in the interface.

import "database/sql"

...

type DatabaseStorer interface {
	Exec(query string, args ...interface{}) (sql.Result, error)
	Prepare(query string) (*sql.Stmt, error)
	Query(query string, args ...interface{}) (*sql.Rows, error)
}

Note, as the type set of a blank interface type is composed of all non-interface types, so all types implement any blank interface type. This is an important fact in Go.

Again, currently (Go 1.20), the types of interface values must be basic interface types. In the remaining contents of the current article, when a value type is mentioned, the value type may be non-interface type or a basic interface type. It is never a constraint-only interface type.

We can view each interface value as a box to encapsulate a non-interface value. To box/encapsulate a non-interface value into an interface value, the type of the non-interface value must implement the type of the interface value.

If a type T implements a (basic) interface type I, then any value of type T can be implicitly converted to type I. In other words, any value of type T is assignable to (modifiable) values of type I. When a T value is converted (assigned) to an I value,

• if type T is a non-interface type, then a copy of the T value is boxed (or encapsulated) into the result (or destination) I value. The time complexity of the copy is O(n), where n is the size of copied T value.
• if type T is also an interface type, then a copy of the value boxed in the T value is boxed (or encapsulated) into the result (or destination) I value. The standard Go compiler makes an optimization here, so the time complexity of the copy is O(1), instead of O(n).

The type information of the boxed value is also stored in the result (or destination) interface value. (This will be further explained below.)

When a value is boxed in an interface value, the value is called the dynamic value of the interface value. The type of the dynamic value is called the dynamic type of the interface value.

The direct part of the dynamic value of an interface value is immutable, though we can replace the dynamic value of an interface value with another dynamic value.

In Go, the zero values of any interface type are represented by the predeclared nil identifier. Nothing is boxed in a nil interface value. Assigning an untyped nil to an interface value will clear the dynamic value boxed in the interface value.

(Note, the zero values of many non-interface types in Go are also represented by nil in Go. Non-interface nil values can also be boxed in interface values. An interface value boxing a nil non-interface value still boxes something, so it is not a nil interface value.)

As any type implements all blank interface types, so any non-interface value can be boxed in (or assigned to) a blank interface value. For this reason, blank interface types can be viewed as the any type in many other languages.

When an untyped value (except untyped nil values) is assigned to a blank interface value, the untyped value will be first converted to its default type. (In other words, we can think the untyped value is deduced as a value of its default type).

Let's view an example which demonstrates some assignments with interface values as the destinations.

package main

import "fmt"

type Aboutable interface {
	About() string
}

// Type *Book implements Aboutable.
type Book struct {
	name string
}
func (book *Book) About() string {
	return "Book: " + book.name
}

func main() {
	// A *Book value is boxed into an
	// interface value of type Aboutable.
	var a Aboutable = &Book{"Go 101"}
	fmt.Println(a) // &{Go 101}

	// i is a blank interface value.
	var i interface{} = &Book{"Rust 101"}
	fmt.Println(i) // &{Rust 101}

	// Aboutable implements interface{}.
	i = a
	fmt.Println(i) // &{Go 101}
}

Please note, the prototype of the fmt.Println function used many times in previous articles is

func Println(a ...interface{}) (n int, err error)

This is why a fmt.Println function calls can take arguments of any types.

The following is another example which shows how a blank interface value is used to box values of any non-interface type.

package main

import "fmt"

func main() {
	var i interface{}
	i = []int{1, 2, 3}
	fmt.Println(i) // [1 2 3]
	i = map[string]int{"Go": 2012}
	fmt.Println(i) // map[Go:2012]
	i = true
	fmt.Println(i) // true
	i = 1
	fmt.Println(i) // 1
	i = "abc"
	fmt.Println(i) // abc

	// Clear the boxed value in interface value i.
	i = nil
	fmt.Println(i) // <nil>
}

Go compilers will build a global table which contains the information of each type at compile time. The information includes what kind a type is, what methods and fields a type owns, what the element type of a container type is, type sizes, etc. The global table will be loaded into memory when a program starts.

At run time, when a non-interface value is boxed into an interface value, the Go runtime (at least for the standard Go runtime) will analyze and build the implementation information for the type pair of the two values, and store the implementation information in the interface value. The implementation information for each non-interface type and interface type pair will only be built once and cached in a global map for execution efficiency consideration. The number of entries of the global map never decreases. In fact, a non-nil interface value just uses an internal pointer field which references a cached implementation information entry.

The implementation information for each (interface type, dynamic type) pair includes two pieces of information:

1. the information of the dynamic type (a non-interface type)
2. and a method table (a slice) which stores all the corresponding methods specified by the interface type and declared for the non-interface type (the dynamic type).

These two pieces of information are essential for implementing two important features in Go:

1. The dynamic type information is the key to implement reflection in Go.
2. The method table information is the key to implement polymorphism (polymorphism will be explained in the next section).

An example:

package main

import "fmt"

type Filter interface {
	About() string
	Process([]int) []int
}

// UniqueFilter is used to remove duplicate numbers.
type UniqueFilter struct{}
func (UniqueFilter) About() string {
	return "remove duplicate numbers"
}
func (UniqueFilter) Process(inputs []int) []int {
	outs := make([]int, 0, len(inputs))
	pusheds := make(map[int]bool)
	for _, n := range inputs {
		if !pusheds[n] {
			pusheds[n] = true
			outs = append(outs, n)
		}
	}
	return outs
}

// MultipleFilter is used to keep only
// the numbers which are multiples of
// the MultipleFilter as an int value.
type MultipleFilter int
func (mf MultipleFilter) About() string {
	return fmt.Sprintf("keep multiples of %v", mf)
}
func (mf MultipleFilter) Process(inputs []int) []int {
	var outs = make([]int, 0, len(inputs))
	for _, n := range inputs {
		if n % int(mf) == 0 {
			outs = append(outs, n)
		}
	}
	return outs
}

// With the help of polymorphism, only one
// "filterAndPrint" function is needed.
func filterAndPrint(fltr Filter, unfiltered []int) []int {
	// Calling the methods of "fltr" will call the
	// methods of the value boxed in "fltr" actually.
	filtered := fltr.Process(unfiltered)
	fmt.Println(fltr.About() + ":\n\t", filtered)
	return filtered
}

func main() {
	numbers := []int{12, 7, 21, 12, 12, 26, 25, 21, 30}
	fmt.Println("before filtering:\n\t", numbers)

	// Three non-interface values are boxed into
	// three Filter interface slice element values.
	filters := []Filter{
		UniqueFilter{},
		MultipleFilter(2),
		MultipleFilter(3),
	}

	// Each slice element will be assigned to the
	// local variable "fltr" (of interface type
	// Filter) one by one. The value boxed in each
	// element will also be copied into "fltr".
	for _, fltr := range filters {
		numbers = filterAndPrint(fltr, numbers)
	}
}

The output:

before filtering:
	 [12 7 21 12 12 26 25 21 30]
remove duplicate numbers:
	 [12 7 21 26 25 30]
keep multiples of 2:
	 [12 26 30]
keep multiples of 3:
	 [12 30]

In the above example, polymorphism makes it unnecessary to write one filterAndPrint function for each filter type.

Besides the above benefit, polymorphism also makes it possible for the developers of a library code package to declare an exported interface type and declare a function (or method) which has a parameter of the interface type, so that a user of the package can declare a type, which implements the interface type, in user code and pass arguments of the user type to calls to the function (or method). The developers of the code package don't need to care about how the user type is declared, as long as the user type satisfies the behaviors specified by the interface type declared in the library code package.

There are four kinds of interface-value-involving value conversion cases in Go:

1. convert a non-interface value to an interface value, where the type of the non-interface value must implement the type of the interface value.
2. convert an interface value to an interface value, where the type of the source interface value must implement the type of the destination interface value.
3. convert an interface value to a non-interface value, where the type of the non-interface value must implement the type of the interface value.
4. convert an interface value to an interface value, where the type of the source interface value doesn't implement the destination interface type, but the dynamic type of the source interface value might implement the destination interface type.

We have already explained the first two kinds of cases. They both require that the source value type implements the destination interface type. The convertibility for the first two are verified at compile time.

Here will explain the later two kinds of cases. The convertibility for the later two are verified at run time, by using a syntax called type assertion. In fact, the syntax also applies to the second kind of conversion in our above list.

The form of a type assertion expression is i.(T), where i is an interface value and T is a type name or a type literal. Type T must be

• either an arbitrary non-interface type,
• or an arbitrary interface type.

In a type assertion i.(T), i is called the asserted value and T is called the asserted type. A type assertion might succeed or fail.

• In the case of T being a non-interface type, if the dynamic type of i exists and is identical to T, then the assertion will succeed, otherwise, the assertion will fail. When the assertion succeeds, the evaluation result of the assertion is a copy of the dynamic value of i. We can view assertions of this kind as value unboxing attempts.
• In the case of T being an interface type, if the dynamic type of i exists and implements T, then the assertion will succeed, otherwise, the assertion will fail. When the assertion succeeds, a copy of the dynamic value of i will be boxed into a T value and the T value will be used as the evaluation result of the assertion.

When a type assertion fails, its evaluation result is a zero value of the asserted type.

By the rules described above, if the asserted value in a type assertion is a nil interface value, then the assertion will always fail.

For most scenarios, a type assertion is used as a single-value expression. However, when a type assertion is used as the only source value expression in an assignment, it can result in a second optional untyped boolean value and be viewed as a multi-value expression. The second optional untyped boolean value indicates whether or not the type assertion succeeds.

Note, if a type assertion fails and the type assertion is used as a single-value expression (the second optional bool result is absent), then a panic will occur.

An example which shows how to use type assertions (asserted types are non-interface types):

package main

import "fmt"

func main() {
	// Compiler will deduce the type of 123 as int.
	var x interface{} = 123

	// Case 1:
	n, ok := x.(int)
	fmt.Println(n, ok) // 123 true
	n = x.(int)
	fmt.Println(n) // 123

	// Case 2:
	a, ok := x.(float64)
	fmt.Println(a, ok) // 0 false

	// Case 3:
	a = x.(float64) // will panic
}

Another example which shows how to use type assertions (asserted types are interface types):

package main

import "fmt"

type Writer interface {
	Write(buf []byte) (int, error)
}

type DummyWriter struct{}
func (DummyWriter) Write(buf []byte) (int, error) {
	return len(buf), nil
}

func main() {
	var x interface{} = DummyWriter{}
	var y interface{} = "abc"
	// Now the dynamic type of y is "string".
	var w Writer
	var ok bool

	// Type DummyWriter implements both
	// Writer and interface{}.
	w, ok = x.(Writer)
	fmt.Println(w, ok) // {} true
	x, ok = w.(interface{})
	fmt.Println(x, ok) // {} true

	// The dynamic type of y is "string",
	// which doesn't implement Writer.
	w, ok = y.(Writer)
	fmt.Println(w, ok) //  false
	w = y.(Writer)     // will panic
}

In fact, for an interface value i with a dynamic type T, the method call i.m(...) is equivalent to the method call i.(T).m(...).

The type-switch code block syntax may be the weirdest syntax in Go. It can be viewed as the enhanced version of type assertion. A type-switch code block is in some way similar to a switch-case control flow code block. It looks like:

switch aSimpleStatement; v := x.(type) {
case TypeA:
	...
case TypeB, TypeC:
	...
case nil:
	...
default:
	...
}

The aSimpleStatement; portion is optional in a type-switch code block. aSimpleStatement must be a simple statement. x must be an interface value and it is called the asserted value. v is called the assertion result, it must be present in a short variable declaration form.

Each case keyword in a type-switch block can be followed by the predeclared nil identifier or a comma-separated list composed of at least one type name and type literal. None of such items (nil, type names and type literals) may be duplicate in the same type-switch code block.

If the type denoted by a type name or type literal following a case keyword in a type-switch code block is not an interface type, then it must implement the interface type of the asserted value.

Here is an example in which a type-switch control flow code block is used.

package main

import "fmt"

func main() {
	values := []interface{}{
		456, "abc", true, 0.33, int32(789),
		[]int{1, 2, 3}, map[int]bool{}, nil,
	}
	for _, x := range values {
		// Here, v is declared once, but it denotes
		// different variables in different branches.
		switch v := x.(type) {
		case []int: // a type literal
			// The type of v is "[]int" in this branch.
			fmt.Println("int slice:", v)
		case string: // one type name
			// The type of v is "string" in this branch.
			fmt.Println("string:", v)
		case int, float64, int32: // multiple type names
			// The type of v is "interface{}",
			// the same as x in this branch.
			fmt.Println("number:", v)
		case nil:
			// The type of v is "interface{}",
			// the same as x in this branch.
			fmt.Println(v)
		default:
			// The type of v is "interface{}",
			// the same as x in this branch.
			fmt.Println("others:", v)
		}
		// Note, each variable denoted by v in the
		// last three branches is a copy of x.
	}
}

The output:

number: 456
string: abc
others: true
number: 0.33
number: 789
int slice: [1 2 3]
others: map[]
<nil>

The above example is equivalent to the following in logic:

package main

import "fmt"

func main() {
	values := []interface{}{
		456, "abc", true, 0.33, int32(789),
		[]int{1, 2, 3}, map[int]bool{}, nil,
	}
	for _, x := range values {
		if v, ok := x.([]int); ok {
			fmt.Println("int slice:", v)
		} else if v, ok := x.(string); ok {
			fmt.Println("string:", v)
		} else if x == nil {
			v := x
			fmt.Println(v)
		} else {
			_, isInt := x.(int)
			_, isFloat64 := x.(float64)
			_, isInt32 := x.(int32)
			if isInt || isFloat64 || isInt32 {
				v := x
				fmt.Println("number:", v)
			} else {
				v := x
				fmt.Println("others:", v)
			}
		}
	}
}

type-switch code blocks are similar to switch-case code blocks in some aspects.

• Like switch-case blocks, in a type-switch code block, there can be at most one default branch.
• Like switch-case blocks, in a type-switch code block, if the default branch is present, it can be the last branch, the first branch, or a middle branch.
• Like switch-case blocks, a type-switch code block may not contain any branches, it will be viewed as a no-op.

But, unlike switch-case code blocks, fallthrough statements can't be used within branch blocks of a type-switch code block.

There are two cases of comparisons involving interface values:

1. comparisons between a non-interface value and an interface value.
2. comparisons between two interface values.

For the first case, the type of the non-interface value must implement the type (assume it is I) of the interface value, so the non-interface value can be converted to (boxed into) an interface value of I. This means a comparison between a non-interface value and an interface value can be translated to a comparison between two interface values. So below only comparisons between two interface values will be explained.

Comparing two interface values is comparing their respective dynamic types and dynamic values actually.

The steps of comparing two interface values (with the == operator):

1. if one of the two interface values is a nil interface value, then the comparison result is whether or not the other interface value is also a nil interface value.
2. if the dynamic types of the two interface values are two different types, then the comparison result is false.
3. in the case where the dynamic types of the two interface values are the same type,
   • if the same dynamic type is an incomparable type, a panic will occur.
   • otherwise, the comparison result is the result of comparing the dynamic values of the two interface values.

In short, two interface values are equal only if one of the following conditions are satisfied.

1. They are both nil interface values.
2. Their dynamic types are identical and comparable, and their dynamic values are equal to each other.

By the rules, two interface values which dynamic values are both nil may be not equal. An example:

package main

import "fmt"

func main() {
	var a, b, c interface{} = "abc", 123, "a"+"b"+"c"
	// A case of step 2.
	fmt.Println(a == b) // false
	// A case of step 3.
	fmt.Println(a == c) // true

	var x *int = nil
	var y *bool = nil
	var ix, iy interface{} = x, y
	var i interface{} = nil
	// A case of step 2.
	fmt.Println(ix == iy) // false
	// A case of step 1.
	fmt.Println(ix == i) // false
	// A case of step 1.
	fmt.Println(iy == i) // false

	// []int is an incomparable type
	var s []int = nil
	i = s
	// A case of step 1.
	fmt.Println(i == nil) // false
	// A case of step 3.
	fmt.Println(i == i) // will panic
}

For example, sometimes, we may need to convert a []string value to []interface{} type. Unlike some other languages, there is no direct way to make the conversion. We must make the conversion manually in a loop:

package main

import "fmt"

func main() {
	words := []string{
		"Go", "is", "a", "high",
		"efficient", "language.",
	}

	// The prototype of fmt.Println function is
	// func Println(a ...interface{}) (n int, err error).
	// So words... can't be passed to it as the argument.

	// fmt.Println(words...) // not compile

	// Convert the []string value to []interface{}.
	iw := make([]interface{}, 0, len(words))
	for _, w := range words {
		iw = append(iw, w)
	}
	fmt.Println(iw...) // compiles okay
}

For each method with name m in the method set defined by an interface type I, compilers will implicitly declare a function named I.m, which has one more input parameter, of type I, than method m. The extra parameter is the first input parameter of function I.m. Assume i is an interface value of I, then the method call i.m(...) is equivalent to the function call I.m(i, ...).

An example:

package main

import "fmt"

type I interface {
	m(int)bool
}

type T string
func (t T) m(n int) bool {
	return len(t) > n
}

func main() {
	var i I = T("gopher")
	fmt.Println(i.m(5))                        // true
	fmt.Println(I.m(i, 5))                     // true
	fmt.Println(interface{m(int)bool}.m(i, 5)) // true

	// The following lines compile okay,
	// but will panic at run time.
	I(nil).m(5)
	I.m(nil, 5)
	interface {m(int) bool}.m(nil, 5)
}

• Go 101에 대해 - 이 책이 쓰여진 이유
• 감사의 말

• Go 소개 - Go를 배우는 가치
• Go 툴체인 - Go 프로그램을 컴파일하고 실행하는 방법

• Go 코드에 익숙해지기
  • 소스 코드 요소 소개
  • 키워드와 식별자
  • 기본 자료형과 기본 값 리터럴
  • 상수와 변수 - 무형성(untyped) 값과 자료형 추론 소개를 포함
  • 일반 연산자 - 더 많은 자료형 추론 규칙 소개를 포함
  • 함수 선언과 호출
  • 코드 패키지와 패키지 들여오기
  • 표현식, 구문과 단순 구문
  • 기본 흐름 제어
  • 고루틴, 지연된 함수 호출과 패닉/복구

• Go 자료형 체계
  • Go 자료형 체계 개요 - Go 프로그래밍 숙달을 위해 반드시 읽어봐야 하는
  • 포인터
  • 구조체
  • 변수 - Go 변수에 대한 더 깊은 이해
  • 배열, 슬라이스와 맵 - 1급 객체 컨테이너 자료형
  • 문자열
  • 함수 - 함수 자료형과 값, 가변 인자 함수
  • 채널 - Go에서 동시성 동기화를 하는 방법
  • 메서드
  • 인터페이스 - 리플렉션과 다형성을 하는 값 상자
  • 자료형 임베딩 - 자료형을 확장하는 방법
  • 자료형에 안전하지 않는 포인터
  • 제네릭 - 합성 자료형의 사용과 읽는 법
  • 리플렉션 - reflect 표준 패키지

• 특별 주제
  • 개행 규칙
  • 지연된 함수 호출 더 알아보기
  • 패닉/복구 사용 사례
  • 패닉/복구 메커니즘에 대한 고찰 - 함수 호출 종료 단계를 포함
  • 코드 블록과 식별자 스코프
  • 표현식 평가 순서
  • Go의 값 복사 비용
  • 경계 검사 제거(BCE)

• 동시성 프로그래밍
  • 동시성 동기화 개요
  • 채널 사용 사례
  • 채널을 깔끔하게 닫는 방법
  • 기타 동시성 동기화 기술 - sync 표준 패키지
  • 원자적 연산 - sync/atomic 표준 패키지
  • Go의 메모리 순서 보장
  • 흔히들 저지르는 동시성 프로그래밍 실수들

• 메모리 관련
  • 메모리 블록
  • 메모리 레이아웃
  • 메모리 누수 시나리오

• 일부 요약
  • 몇 가지 간단한 요약
  • Go의 nil
  • 값 변환, 할당과 비교 규칙
  • 구문/의미 예외
  • Go Details 101
  • Go FAQ 101
  • Go Tips 101

• 더 많은 토픽