mirror of
https://github.com/gopl-zh/gopl-zh.github.com.git
synced 2024-12-28 07:46:21 +00:00
443 lines
41 KiB
HTML
443 lines
41 KiB
HTML
|
<!DOCTYPE HTML>
|
|||
|
|
<html lang="zh" class="sidebar-visible no-js light">
|
|||
|
|
<head>
|
|||
|
|
<!-- Book generated using mdBook -->
|
|||
|
|
<meta charset="UTF-8">
|
|||
|
|
<title>Map - Go语言圣经</title>
|
|||
|
|
|
|||
|
|
|
|||
|
|
<!-- Custom HTML head -->
|
|||
|
|
|
|||
|
|
|
|||
|
|
<meta content="text/html; charset=utf-8" http-equiv="Content-Type">
|
|||
|
|
<meta name="description" content="<The Go Programming Language>中文版">
|
|||
|
|
<meta name="viewport" content="width=device-width, initial-scale=1">
|
|||
|
|
<meta name="theme-color" content="#ffffff" />
|
|||
|
|
|
|||
|
|
<link rel="icon" href="../favicon.svg">
|
|||
|
|
<link rel="shortcut icon" href="../favicon.png">
|
|||
|
|
<link rel="stylesheet" href="../css/variables.css">
|
|||
|
|
<link rel="stylesheet" href="../css/general.css">
|
|||
|
|
<link rel="stylesheet" href="../css/chrome.css">
|
|||
|
|
<link rel="stylesheet" href="../css/print.css" media="print">
|
|||
|
|
|
|||
|
|
<!-- Fonts -->
|
|||
|
|
<link rel="stylesheet" href="../FontAwesome/css/font-awesome.css">
|
|||
|
|
<link rel="stylesheet" href="../fonts/fonts.css">
|
|||
|
|
|
|||
|
|
<!-- Highlight.js Stylesheets -->
|
|||
|
|
<link rel="stylesheet" href="../highlight.css">
|
|||
|
|
<link rel="stylesheet" href="../tomorrow-night.css">
|
|||
|
|
<link rel="stylesheet" href="../ayu-highlight.css">
|
|||
|
|
|
|||
|
|
<!-- Custom theme stylesheets -->
|
|||
|
|
<link rel="stylesheet" href="../style.css">
|
|||
|
|
|
|||
|
|
|
|||
|
|
</head>
|
|||
|
|
<body>
|
|||
|
|
<!-- Provide site root to javascript -->
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
var path_to_root = "../";
|
|||
|
|
var default_theme = window.matchMedia("(prefers-color-scheme: dark)").matches ? "navy" : "light";
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<!-- Work around some values being stored in localStorage wrapped in quotes -->
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
try {
|
|||
|
|
var theme = localStorage.getItem('mdbook-theme');
|
|||
|
|
var sidebar = localStorage.getItem('mdbook-sidebar');
|
|||
|
|
|
|||
|
|
if (theme.startsWith('"') && theme.endsWith('"')) {
|
|||
|
|
localStorage.setItem('mdbook-theme', theme.slice(1, theme.length - 1));
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
if (sidebar.startsWith('"') && sidebar.endsWith('"')) {
|
|||
|
|
localStorage.setItem('mdbook-sidebar', sidebar.slice(1, sidebar.length - 1));
|
|||
|
|
}
|
|||
|
|
} catch (e) { }
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<!-- Set the theme before any content is loaded, prevents flash -->
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
var theme;
|
|||
|
|
try { theme = localStorage.getItem('mdbook-theme'); } catch(e) { }
|
|||
|
|
if (theme === null || theme === undefined) { theme = default_theme; }
|
|||
|
|
var html = document.querySelector('html');
|
|||
|
|
html.classList.remove('no-js')
|
|||
|
|
html.classList.remove('light')
|
|||
|
|
html.classList.add(theme);
|
|||
|
|
html.classList.add('js');
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<!-- Hide / unhide sidebar before it is displayed -->
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
var html = document.querySelector('html');
|
|||
|
|
var sidebar = 'hidden';
|
|||
|
|
if (document.body.clientWidth >= 1080) {
|
|||
|
|
try { sidebar = localStorage.getItem('mdbook-sidebar'); } catch(e) { }
|
|||
|
|
sidebar = sidebar || 'visible';
|
|||
|
|
}
|
|||
|
|
html.classList.remove('sidebar-visible');
|
|||
|
|
html.classList.add("sidebar-" + sidebar);
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<nav id="sidebar" class="sidebar" aria-label="Table of contents">
|
|||
|
|
<div class="sidebar-scrollbox">
|
|||
|
|
<ol class="chapter"><li class="chapter-item expanded affix "><a href="../index.html">Go语言圣经</a></li><li class="chapter-item expanded affix "><a href="../preface.html">前言</a></li><li class="chapter-item expanded "><a href="../ch1/ch1.html"><strong aria-hidden="true">1.</strong> 入门</a></li><li><ol class="section"><li class="chapter-item expanded "><a href="../ch1/ch1-01.html"><strong aria-hidden="true">1.1.</strong> Hello, World</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-02.html"><strong aria-hidden="true">1.2.</strong> 命令行参数</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-03.html"><strong aria-hidden="true">1.3.</strong> 查找重复的行</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-04.html"><strong aria-hidden="true">1.4.</strong> GIF动画</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-05.html"><strong aria-hidden="true">1.5.</strong> 获取URL</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-06.html"><strong aria-hidden="true">1.6.</strong> 并发获取多个URL</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-07.html"><strong aria-hidden="true">1.7.</strong> Web服务</a></li><li class="chapter-item expanded "><a href="../ch1/ch1-08.html"><strong aria-hidden="true">1.8.</strong> 本章要点</a></li></ol></li><li class="chapter-item expanded "><a href="../ch2/ch2.html"><strong aria-hidden="true">2.</strong> 程序结构</a></li><li><ol class="section"><li class="chapter-item expanded "><a href="../ch2/ch2-01.html"><strong aria-hidden="true">2.1.</strong> 命名</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-02.html"><strong aria-hidden="true">2.2.</strong> 声明</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-03.html"><strong aria-hidden="true">2.3.</strong> 变量</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-04.html"><strong aria-hidden="true">2.4.</strong> 赋值</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-05.html"><strong aria-hidden="true">2.5.</strong> 类型</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-06.html"><strong aria-hidden="true">2.6.</strong> 包和文件</a></li><li class="chapter-item expanded "><a href="../ch2/ch2-07.html"><strong aria-hidden="true">2.7.</strong> 作用域</a></li></ol></li><li class="chapter-item expanded "><a href="../ch3/ch3.html"><strong aria-hidden="true">3.</strong> 基础数据类型</a></li><li><ol class="section"><li class="chapter-item expanded "><a href="../ch3/ch3-01.html"><strong aria-hidden="true">3.1.</strong> 整型</a></li><li class="chapter-item expanded "><a href="../ch3/ch3-02.html"><strong aria-hidden="true">3.2.</strong> 浮点数</a></li><li class="chapter-item expanded "><a href="../ch3/ch3-03.html"><strong aria-hidden="true">3.3.</strong> 复数</a></li><li class="chapter-item expanded "><a href="../ch3/ch3-04.html"><strong aria-hidden="true">3.4.</strong> 布尔型</a></li><li class="chapter-item expanded "><a href="../ch3/ch3-05.html"><strong aria-hidden="true">3.5.</strong> 字符串</a></li><li class="chapter-item expanded "><a href="../ch3/ch3-06.html"><strong aria-hidden="true">3.6.</strong> 常量</a></li></ol></li><li class="chapter-item expanded "><a href="../ch4/ch4.html"><strong aria-hidden="true">4.</strong> 复合数据类型</a></li><li><ol class="section"><li class="chapter-item expanded "><a href="../ch4/ch4-01.html"><strong aria-hidden="true">4.1.</strong> 数组</a></li><li class="chapter-item expanded "><a href="../ch4/ch4-02.html"><strong aria-hidden="true">4.2.</strong> Slice</a></li><li class="chapter-item expanded "><a href="../ch4/ch4-03.html" class="active"><strong aria-hidden="true">4.3.</strong> Map</a></li><li class="chapter-item expanded "><a href="../ch4/ch4-04.html"><strong aria-hidden="true">4.4.</strong> 结构体</a></li><li class="chapter-item expanded "><a href="../ch4/ch4-05.html"><strong aria-hidden="true">4.5.</strong> JSON</a></li><li class="chapter-item expanded "><a href="../ch4/ch4-06.html"><s
|
|||
|
|
<div id="sidebar-resize-handle" class="sidebar-resize-handle"></div>
|
|||
|
|
</nav>
|
|||
|
|
|
|||
|
|
<div id="page-wrapper" class="page-wrapper">
|
|||
|
|
|
|||
|
|
<div class="page">
|
|||
|
|
|
|||
|
|
<div id="menu-bar-hover-placeholder"></div>
|
|||
|
|
<div id="menu-bar" class="menu-bar sticky bordered">
|
|||
|
|
<div class="left-buttons">
|
|||
|
|
<button id="sidebar-toggle" class="icon-button" type="button" title="Toggle Table of Contents" aria-label="Toggle Table of Contents" aria-controls="sidebar">
|
|||
|
|
<i class="fa fa-bars"></i>
|
|||
|
|
</button>
|
|||
|
|
<button id="theme-toggle" class="icon-button" type="button" title="Change theme" aria-label="Change theme" aria-haspopup="true" aria-expanded="false" aria-controls="theme-list">
|
|||
|
|
<i class="fa fa-paint-brush"></i>
|
|||
|
|
</button>
|
|||
|
|
<ul id="theme-list" class="theme-popup" aria-label="Themes" role="menu">
|
|||
|
|
<li role="none"><button role="menuitem" class="theme" id="light">Light (default)</button></li>
|
|||
|
|
<li role="none"><button role="menuitem" class="theme" id="rust">Rust</button></li>
|
|||
|
|
<li role="none"><button role="menuitem" class="theme" id="coal">Coal</button></li>
|
|||
|
|
<li role="none"><button role="menuitem" class="theme" id="navy">Navy</button></li>
|
|||
|
|
<li role="none"><button role="menuitem" class="theme" id="ayu">Ayu</button></li>
|
|||
|
|
</ul>
|
|||
|
|
<button id="search-toggle" class="icon-button" type="button" title="Search. (Shortkey: s)" aria-label="Toggle Searchbar" aria-expanded="false" aria-keyshortcuts="S" aria-controls="searchbar">
|
|||
|
|
<i class="fa fa-search"></i>
|
|||
|
|
</button>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<h1 class="menu-title">Go语言圣经</h1>
|
|||
|
|
|
|||
|
|
<div class="right-buttons">
|
|||
|
|
<a href="../print.html" title="Print this book" aria-label="Print this book">
|
|||
|
|
<i id="print-button" class="fa fa-print"></i>
|
|||
|
|
</a>
|
|||
|
|
<a href="https://github.com/gopl-zh/gopl-zh.github.com" title="Git repository" aria-label="Git repository">
|
|||
|
|
<i id="git-repository-button" class="fa fa-github"></i>
|
|||
|
|
</a>
|
|||
|
|
<a href="https://github.com/gopl-zh/gopl-zh.github.com/edit/master/./ch4/ch4-03.md" title="Suggest an edit" aria-label="Suggest an edit">
|
|||
|
|
<i id="git-edit-button" class="fa fa-edit"></i>
|
|||
|
|
</a>
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<div id="search-wrapper" class="hidden">
|
|||
|
|
<form id="searchbar-outer" class="searchbar-outer">
|
|||
|
|
<input type="search" id="searchbar" name="searchbar" placeholder="Search this book ..." aria-controls="searchresults-outer" aria-describedby="searchresults-header">
|
|||
|
|
</form>
|
|||
|
|
<div id="searchresults-outer" class="searchresults-outer hidden">
|
|||
|
|
<div id="searchresults-header" class="searchresults-header"></div>
|
|||
|
|
<ul id="searchresults">
|
|||
|
|
</ul>
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<!-- Apply ARIA attributes after the sidebar and the sidebar toggle button are added to the DOM -->
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
document.getElementById('sidebar-toggle').setAttribute('aria-expanded', sidebar === 'visible');
|
|||
|
|
document.getElementById('sidebar').setAttribute('aria-hidden', sidebar !== 'visible');
|
|||
|
|
Array.from(document.querySelectorAll('#sidebar a')).forEach(function(link) {
|
|||
|
|
link.setAttribute('tabIndex', sidebar === 'visible' ? 0 : -1);
|
|||
|
|
});
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
<div id="content" class="content">
|
|||
|
|
<!-- Page table of contents -->
|
|||
|
|
<div class="sidetoc"><nav class="pagetoc"></nav></div>
|
|||
|
|
<main>
|
|||
|
|
<!-- 头部 -->
|
|||
|
|
<ul dir="auto">
|
|||
|
|
<li><em>KusonStack一站式可编程配置技术栈: <a href="https://github.com/KusionStack/kusion">https://github.com/KusionStack/kusion</a></em></li>
|
|||
|
|
<li><em>凹语言™: <a href="https://github.com/wa-lang/wa">https://github.com/wa-lang/wa</a></em></li>
|
|||
|
|
</ul>
|
|||
|
|
<hr>
|
|||
|
|
|
|||
|
|
<h2 id="43-map"><a class="header" href="#43-map">4.3. Map</a></h2>
|
|||
|
|
<p>哈希表是一种巧妙并且实用的数据结构。它是一个无序的key/value对的集合，其中所有的key都是不同的，然后通过给定的key可以在常数时间复杂度内检索、更新或删除对应的value。</p>
|
|||
|
|
<p>在Go语言中，一个map就是一个哈希表的引用，map类型可以写为map[K]V，其中K和V分别对应key和value。map中所有的key都有相同的类型，所有的value也有着相同的类型，但是key和value之间可以是不同的数据类型。其中K对应的key必须是支持==比较运算符的数据类型，所以map可以通过测试key是否相等来判断是否已经存在。虽然浮点数类型也是支持相等运算符比较的，但是将浮点数用做key类型则是一个坏的想法，正如第三章提到的，最坏的情况是可能出现的NaN和任何浮点数都不相等。对于V对应的value数据类型则没有任何的限制。</p>
|
|||
|
|
<p>内置的make函数可以创建一个map：</p>
|
|||
|
|
<pre><code class="language-Go">ages := make(map[string]int) // mapping from strings to ints
|
|||
|
|
</code></pre>
|
|||
|
|
<p>我们也可以用map字面值的语法创建map，同时还可以指定一些最初的key/value：</p>
|
|||
|
|
<pre><code class="language-Go">ages := map[string]int{
|
|||
|
|
"alice": 31,
|
|||
|
|
"charlie": 34,
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>这相当于</p>
|
|||
|
|
<pre><code class="language-Go">ages := make(map[string]int)
|
|||
|
|
ages["alice"] = 31
|
|||
|
|
ages["charlie"] = 34
|
|||
|
|
</code></pre>
|
|||
|
|
<p>因此，另一种创建空的map的表达式是<code>map[string]int{}</code>。</p>
|
|||
|
|
<p>Map中的元素通过key对应的下标语法访问：</p>
|
|||
|
|
<pre><code class="language-Go">ages["alice"] = 32
|
|||
|
|
fmt.Println(ages["alice"]) // "32"
|
|||
|
|
</code></pre>
|
|||
|
|
<p>使用内置的delete函数可以删除元素：</p>
|
|||
|
|
<pre><code class="language-Go">delete(ages, "alice") // remove element ages["alice"]
|
|||
|
|
</code></pre>
|
|||
|
|
<p>所有这些操作是安全的，即使这些元素不在map中也没有关系；如果一个查找失败将返回value类型对应的零值，例如，即使map中不存在“bob”下面的代码也可以正常工作，因为ages["bob"]失败时将返回0。</p>
|
|||
|
|
<pre><code class="language-Go">ages["bob"] = ages["bob"] + 1 // happy birthday!
|
|||
|
|
</code></pre>
|
|||
|
|
<p>而且<code>x += y</code>和<code>x++</code>等简短赋值语法也可以用在map上，所以上面的代码可以改写成</p>
|
|||
|
|
<pre><code class="language-Go">ages["bob"] += 1
|
|||
|
|
</code></pre>
|
|||
|
|
<p>更简单的写法</p>
|
|||
|
|
<pre><code class="language-Go">ages["bob"]++
|
|||
|
|
</code></pre>
|
|||
|
|
<p>但是map中的元素并不是一个变量，因此我们不能对map的元素进行取址操作：</p>
|
|||
|
|
<pre><code class="language-Go">_ = &ages["bob"] // compile error: cannot take address of map element
|
|||
|
|
</code></pre>
|
|||
|
|
<p>禁止对map元素取址的原因是map可能随着元素数量的增长而重新分配更大的内存空间，从而可能导致之前的地址无效。</p>
|
|||
|
|
<p>要想遍历map中全部的key/value对的话，可以使用range风格的for循环实现，和之前的slice遍历语法类似。下面的迭代语句将在每次迭代时设置name和age变量，它们对应下一个键/值对：</p>
|
|||
|
|
<pre><code class="language-Go">for name, age := range ages {
|
|||
|
|
fmt.Printf("%s\t%d\n", name, age)
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>Map的迭代顺序是不确定的，并且不同的哈希函数实现可能导致不同的遍历顺序。在实践中，遍历的顺序是随机的，每一次遍历的顺序都不相同。这是故意的，每次都使用随机的遍历顺序可以强制要求程序不会依赖具体的哈希函数实现。如果要按顺序遍历key/value对，我们必须显式地对key进行排序，可以使用sort包的Strings函数对字符串slice进行排序。下面是常见的处理方式：</p>
|
|||
|
|
<pre><code class="language-Go">import "sort"
|
|||
|
|
|
|||
|
|
var names []string
|
|||
|
|
for name := range ages {
|
|||
|
|
names = append(names, name)
|
|||
|
|
}
|
|||
|
|
sort.Strings(names)
|
|||
|
|
for _, name := range names {
|
|||
|
|
fmt.Printf("%s\t%d\n", name, ages[name])
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>因为我们一开始就知道names的最终大小，因此给slice分配一个合适的大小将会更有效。下面的代码创建了一个空的slice，但是slice的容量刚好可以放下map中全部的key：</p>
|
|||
|
|
<pre><code class="language-Go">names := make([]string, 0, len(ages))
|
|||
|
|
</code></pre>
|
|||
|
|
<p>在上面的第一个range循环中，我们只关心map中的key，所以我们忽略了第二个循环变量。在第二个循环中，我们只关心names中的名字，所以我们使用“_”空白标识符来忽略第一个循环变量，也就是迭代slice时的索引。</p>
|
|||
|
|
<p>map类型的零值是nil，也就是没有引用任何哈希表。</p>
|
|||
|
|
<pre><code class="language-Go">var ages map[string]int
|
|||
|
|
fmt.Println(ages == nil) // "true"
|
|||
|
|
fmt.Println(len(ages) == 0) // "true"
|
|||
|
|
</code></pre>
|
|||
|
|
<p>map上的大部分操作，包括查找、删除、len和range循环都可以安全工作在nil值的map上，它们的行为和一个空的map类似。但是向一个nil值的map存入元素将导致一个panic异常：</p>
|
|||
|
|
<pre><code class="language-Go">ages["carol"] = 21 // panic: assignment to entry in nil map
|
|||
|
|
</code></pre>
|
|||
|
|
<p>在向map存数据前必须先创建map。</p>
|
|||
|
|
<p>通过key作为索引下标来访问map将产生一个value。如果key在map中是存在的，那么将得到与key对应的value；如果key不存在，那么将得到value对应类型的零值，正如我们前面看到的ages["bob"]那样。这个规则很实用，但是有时候可能需要知道对应的元素是否真的是在map之中。例如，如果元素类型是一个数字，你可能需要区分一个已经存在的0，和不存在而返回零值的0，可以像下面这样测试：</p>
|
|||
|
|
<pre><code class="language-Go">age, ok := ages["bob"]
|
|||
|
|
if !ok { /* "bob" is not a key in this map; age == 0. */ }
|
|||
|
|
</code></pre>
|
|||
|
|
<p>你会经常看到将这两个结合起来使用，像这样：</p>
|
|||
|
|
<pre><code class="language-Go">if age, ok := ages["bob"]; !ok { /* ... */ }
|
|||
|
|
</code></pre>
|
|||
|
|
<p>在这种场景下，map的下标语法将产生两个值；第二个是一个布尔值，用于报告元素是否真的存在。布尔变量一般命名为ok，特别适合马上用于if条件判断部分。</p>
|
|||
|
|
<p>和slice一样，map之间也不能进行相等比较；唯一的例外是和nil进行比较。要判断两个map是否包含相同的key和value，我们必须通过一个循环实现：</p>
|
|||
|
|
<pre><code class="language-Go">func equal(x, y map[string]int) bool {
|
|||
|
|
if len(x) != len(y) {
|
|||
|
|
return false
|
|||
|
|
}
|
|||
|
|
for k, xv := range x {
|
|||
|
|
if yv, ok := y[k]; !ok || yv != xv {
|
|||
|
|
return false
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
return true
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>从例子中可以看到如何用!ok来区分元素不存在，与元素存在但为0的。我们不能简单地用xv != y[k]判断，那样会导致在判断下面两个map时产生错误的结果：</p>
|
|||
|
|
<pre><code class="language-Go">// True if equal is written incorrectly.
|
|||
|
|
equal(map[string]int{"A": 0}, map[string]int{"B": 42})
|
|||
|
|
</code></pre>
|
|||
|
|
<p>Go语言中并没有提供一个set类型，但是map中的key也是不相同的，可以用map实现类似set的功能。为了说明这一点，下面的dedup程序读取多行输入，但是只打印第一次出现的行。（它是1.3节中出现的dup程序的变体。）dedup程序通过map来表示所有的输入行所对应的set集合，以确保已经在集合存在的行不会被重复打印。</p>
|
|||
|
|
<p><u><i>gopl.io/ch4/dedup</i></u></p>
|
|||
|
|
<pre><code class="language-Go">func main() {
|
|||
|
|
seen := make(map[string]bool) // a set of strings
|
|||
|
|
input := bufio.NewScanner(os.Stdin)
|
|||
|
|
for input.Scan() {
|
|||
|
|
line := input.Text()
|
|||
|
|
if !seen[line] {
|
|||
|
|
seen[line] = true
|
|||
|
|
fmt.Println(line)
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
if err := input.Err(); err != nil {
|
|||
|
|
fmt.Fprintf(os.Stderr, "dedup: %v\n", err)
|
|||
|
|
os.Exit(1)
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>Go程序员将这种忽略value的map当作一个字符串集合，并非所有<code>map[string]bool</code>类型value都是无关紧要的；有一些则可能会同时包含true和false的值。</p>
|
|||
|
|
<p>有时候我们需要一个map或set的key是slice类型，但是map的key必须是可比较的类型，但是slice并不满足这个条件。不过，我们可以通过两个步骤绕过这个限制。第一步，定义一个辅助函数k，将slice转为map对应的string类型的key，确保只有x和y相等时k(x) == k(y)才成立。然后创建一个key为string类型的map，在每次对map操作时先用k辅助函数将slice转化为string类型。</p>
|
|||
|
|
<p>下面的例子演示了如何使用map来记录提交相同的字符串列表的次数。它使用了fmt.Sprintf函数将字符串列表转换为一个字符串以用于map的key，通过%q参数忠实地记录每个字符串元素的信息：</p>
|
|||
|
|
<pre><code class="language-Go">var m = make(map[string]int)
|
|||
|
|
|
|||
|
|
func k(list []string) string { return fmt.Sprintf("%q", list) }
|
|||
|
|
|
|||
|
|
func Add(list []string) { m[k(list)]++ }
|
|||
|
|
func Count(list []string) int { return m[k(list)] }
|
|||
|
|
</code></pre>
|
|||
|
|
<p>使用同样的技术可以处理任何不可比较的key类型，而不仅仅是slice类型。这种技术对于想使用自定义key比较函数的时候也很有用，例如在比较字符串的时候忽略大小写。同时，辅助函数k(x)也不一定是字符串类型，它可以返回任何可比较的类型，例如整数、数组或结构体等。</p>
|
|||
|
|
<p>这是map的另一个例子，下面的程序用于统计输入中每个Unicode码点出现的次数。虽然Unicode全部码点的数量巨大，但是出现在特定文档中的字符种类并没有多少，使用map可以用比较自然的方式来跟踪那些出现过的字符的次数。</p>
|
|||
|
|
<p><u><i>gopl.io/ch4/charcount</i></u></p>
|
|||
|
|
<pre><code class="language-Go">// Charcount computes counts of Unicode characters.
|
|||
|
|
package main
|
|||
|
|
|
|||
|
|
import (
|
|||
|
|
"bufio"
|
|||
|
|
"fmt"
|
|||
|
|
"io"
|
|||
|
|
"os"
|
|||
|
|
"unicode"
|
|||
|
|
"unicode/utf8"
|
|||
|
|
)
|
|||
|
|
|
|||
|
|
func main() {
|
|||
|
|
counts := make(map[rune]int) // counts of Unicode characters
|
|||
|
|
var utflen [utf8.UTFMax + 1]int // count of lengths of UTF-8 encodings
|
|||
|
|
invalid := 0 // count of invalid UTF-8 characters
|
|||
|
|
|
|||
|
|
in := bufio.NewReader(os.Stdin)
|
|||
|
|
for {
|
|||
|
|
r, n, err := in.ReadRune() // returns rune, nbytes, error
|
|||
|
|
if err == io.EOF {
|
|||
|
|
break
|
|||
|
|
}
|
|||
|
|
if err != nil {
|
|||
|
|
fmt.Fprintf(os.Stderr, "charcount: %v\n", err)
|
|||
|
|
os.Exit(1)
|
|||
|
|
}
|
|||
|
|
if r == unicode.ReplacementChar && n == 1 {
|
|||
|
|
invalid++
|
|||
|
|
continue
|
|||
|
|
}
|
|||
|
|
counts[r]++
|
|||
|
|
utflen[n]++
|
|||
|
|
}
|
|||
|
|
fmt.Printf("rune\tcount\n")
|
|||
|
|
for c, n := range counts {
|
|||
|
|
fmt.Printf("%q\t%d\n", c, n)
|
|||
|
|
}
|
|||
|
|
fmt.Print("\nlen\tcount\n")
|
|||
|
|
for i, n := range utflen {
|
|||
|
|
if i > 0 {
|
|||
|
|
fmt.Printf("%d\t%d\n", i, n)
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
if invalid > 0 {
|
|||
|
|
fmt.Printf("\n%d invalid UTF-8 characters\n", invalid)
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>ReadRune方法执行UTF-8解码并返回三个值：解码的rune字符的值，字符UTF-8编码后的长度，和一个错误值。我们可预期的错误值只有对应文件结尾的io.EOF。如果输入的是无效的UTF-8编码的字符，返回的将是unicode.ReplacementChar表示无效字符，并且编码长度是1。</p>
|
|||
|
|
<p>charcount程序同时打印不同UTF-8编码长度的字符数目。对此，map并不是一个合适的数据结构；因为UTF-8编码的长度总是从1到utf8.UTFMax（最大是4个字节），使用数组将更有效。</p>
|
|||
|
|
<p>作为一个实验，我们用charcount程序对英文版原稿的字符进行了统计。虽然大部分是英语，但是也有一些非ASCII字符。下面是排名前10的非ASCII字符：</p>
|
|||
|
|
<p><img src="../images/ch4-xx-01.png" alt="" /></p>
|
|||
|
|
<p>下面是不同UTF-8编码长度的字符的数目：</p>
|
|||
|
|
<pre><code>len count
|
|||
|
|
1 765391
|
|||
|
|
2 60
|
|||
|
|
3 70
|
|||
|
|
4 0
|
|||
|
|
</code></pre>
|
|||
|
|
<p>Map的value类型也可以是一个聚合类型，比如是一个map或slice。在下面的代码中，图graph的key类型是一个字符串，value类型map[string]bool代表一个字符串集合。从概念上讲，graph将一个字符串类型的key映射到一组相关的字符串集合，它们指向新的graph的key。</p>
|
|||
|
|
<p><u><i>gopl.io/ch4/graph</i></u></p>
|
|||
|
|
<pre><code class="language-Go">var graph = make(map[string]map[string]bool)
|
|||
|
|
|
|||
|
|
func addEdge(from, to string) {
|
|||
|
|
edges := graph[from]
|
|||
|
|
if edges == nil {
|
|||
|
|
edges = make(map[string]bool)
|
|||
|
|
graph[from] = edges
|
|||
|
|
}
|
|||
|
|
edges[to] = true
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
func hasEdge(from, to string) bool {
|
|||
|
|
return graph[from][to]
|
|||
|
|
}
|
|||
|
|
</code></pre>
|
|||
|
|
<p>其中addEdge函数惰性初始化map是一个惯用方式，也就是说在每个值首次作为key时才初始化。hasEdge函数显示了如何让map的零值也能正常工作；即使from到to的边不存在，graph[from][to]依然可以返回一个有意义的结果。</p>
|
|||
|
|
<p><strong>练习 4.8：</strong> 修改charcount程序，使用unicode.IsLetter等相关的函数，统计字母、数字等Unicode中不同的字符类别。</p>
|
|||
|
|
<p><strong>练习 4.9：</strong> 编写一个程序wordfreq程序，报告输入文本中每个单词出现的频率。在第一次调用Scan前先调用input.Split(bufio.ScanWords)函数，这样可以按单词而不是按行输入。</p>
|
|||
|
|
|
|||
|
|
|
|||
|
|
<!-- 公众号 -->
|
|||
|
|
<hr>
|
|||
|
|
<table>
|
|||
|
|
<tr>
|
|||
|
|
<td>
|
|||
|
|
<img width="222px" src="https://chai2010.cn/advanced-go-programming-book/css.png">
|
|||
|
|
</td>
|
|||
|
|
<td>
|
|||
|
|
<img width="222px" src="https://chai2010.cn/advanced-go-programming-book/cch.png">
|
|||
|
|
</td>
|
|||
|
|
</tr>
|
|||
|
|
</table>
|
|||
|
|
|
|||
|
|
<div id="giscus-container"></div>
|
|||
|
|
<footer class="page-footer">
|
|||
|
|
<span>© 2015-2016 | <a href="https://github.com/gopl-zh"> Go语言圣经中文版</a>, 仅学习交流使用</span>
|
|||
|
|
</footer>
|
|||
|
|
</main>
|
|||
|
|
|
|||
|
|
<nav class="nav-wrapper" aria-label="Page navigation">
|
|||
|
|
<!-- Mobile navigation buttons -->
|
|||
|
|
<a rel="prev" href="../ch4/ch4-02.html" class="mobile-nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|||
|
|
<i class="fa fa-angle-left"></i>
|
|||
|
|
</a>
|
|||
|
|
|
|||
|
|
<a rel="next" href="../ch4/ch4-04.html" class="mobile-nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|||
|
|
<i class="fa fa-angle-right"></i>
|
|||
|
|
</a>
|
|||
|
|
|
|||
|
|
<div style="clear: both"></div>
|
|||
|
|
</nav>
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<nav class="nav-wide-wrapper" aria-label="Page navigation">
|
|||
|
|
<a rel="prev" href="../ch4/ch4-02.html" class="nav-chapters previous" title="Previous chapter" aria-label="Previous chapter" aria-keyshortcuts="Left">
|
|||
|
|
<i class="fa fa-angle-left"></i>
|
|||
|
|
</a>
|
|||
|
|
|
|||
|
|
<a rel="next" href="../ch4/ch4-04.html" class="nav-chapters next" title="Next chapter" aria-label="Next chapter" aria-keyshortcuts="Right">
|
|||
|
|
<i class="fa fa-angle-right"></i>
|
|||
|
|
</a>
|
|||
|
|
</nav>
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
<script type="text/javascript">
|
|||
|
|
window.playground_copyable = true;
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
|
|||
|
|
<script src="../elasticlunr.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
<script src="../mark.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
<script src="../searcher.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
|
|||
|
|
<script src="../clipboard.min.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
<script src="../highlight.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
<script src="../book.js" type="text/javascript" charset="utf-8"></script>
|
|||
|
|
<script type="text/javascript" charset="utf-8">
|
|||
|
|
var pagePath = "ch4/ch4-03.md"
|
|||
|
|
</script>
|
|||
|
|
|
|||
|
|
|
|||
|
|
<!-- Custom JS scripts -->
|
|||
|
|
<script type="text/javascript" src="../js/custom.js"></script>
|
|||
|
|
<script type="text/javascript" src="../js/bigPicture.js"></script>
|
|||
|
|
|
|||
|
|
|
|||
|
|
</body>
|
|||
|
|
</html>
|