الخرائط والبنى وثوابت البيانات

package main

import (
	"fmt"
	"sort"
)

func main() {
	counts := map[string]int{"pear": 2, "apple": 0}
	_, present := counts["missing"]
	keys := make([]string, 0, len(counts))
	for key := range counts {
		keys = append(keys, key)
	}
	sort.Strings(keys)
	for _, key := range keys {
		fmt.Printf("%s=%d\n", key, counts[key])
	}
	fmt.Println("missing present", present)
}

apple=0
pear=2
missing present false

يثبت الفرز apple قبل pear؛ ويبلغ البحث الغائب false.

package main

import "fmt"

type Record struct {
	Name   string
	Scores []int
}

func main() {
	original := Record{Name: "Ada", Scores: []int{1, 2}}
	copied := original
	copied.Name = "Bo"
	copied.Scores[0] = 9
	fmt.Println(original.Name, original.Scores, copied.Name, copied.Scores)
}

Ada [9 2] Bo [9 2]

الاسمان قيمتا حقل مستقلتان بينما تبقى الدرجات مشتركة.