\n re += pl.close\n if (pl.type === '!') {\n negativeLists.push(pl)\n }\n pl.reEnd = re.length\n continue\n\n case '|':\n if (inClass || !patternListStack.length || escaping) {\n re += '\\\\|'\n escaping = false\n continue\n }\n\n clearStateChar()\n re += '|'\n continue\n\n // these are mostly the same in regexp and glob\n case '[':\n // swallow any state-tracking char before the [\n clearStateChar()\n\n if (inClass) {\n re += '\\\\' + c\n continue\n }\n\n inClass = true\n classStart = i\n reClassStart = re.length\n re += c\n continue\n\n case ']':\n // a right bracket shall lose its special\n // meaning and represent itself in\n // a bracket expression if it occurs\n // first in the list. -- POSIX.2 2.8.3.2\n if (i === classStart + 1 || !inClass) {\n re += '\\\\' + c\n escaping = false\n continue\n }\n\n // handle the case where we left a class open.\n // \"[z-a]\" is valid, equivalent to \"\\[z-a\\]\"\n if (inClass) {\n // split where the last [ was, make sure we don't have\n // an invalid re. if so, re-walk the contents of the\n // would-be class to re-translate any characters that\n // were passed through as-is\n // TODO: It would probably be faster to determine this\n // without a try/catch and a new RegExp, but it's tricky\n // to do safely. For now, this is safe and works.\n var cs = pattern.substring(classStart + 1, i)\n try {\n RegExp('[' + cs + ']')\n } catch (er) {\n // not a valid class!\n var sp = this.parse(cs, SUBPARSE)\n re = re.substr(0, reClassStart) + '\\\\[' + sp[0] + '\\\\]'\n hasMagic = hasMagic || sp[1]\n inClass = false\n continue\n }\n }\n\n // finish up the class.\n hasMagic = true\n inClass = false\n re += c\n continue\n\n default:\n // swallow any state char that wasn't consumed\n clearStateChar()\n\n if (escaping) {\n // no need\n escaping = false\n } else if (reSpecials[c]\n && !(c === '^' && inClass)) {\n re += '\\\\'\n }\n\n re += c\n\n } // switch\n } // for\n\n // handle the case where we left a class open.\n // \"[abc\" is valid, equivalent to \"\\[abc\"\n if (inClass) {\n // split where the last [ was, and escape it\n // this is a huge pita. We now have to re-walk\n // the contents of the would-be class to re-translate\n // any characters that were passed through as-is\n cs = pattern.substr(classStart + 1)\n sp = this.parse(cs, SUBPARSE)\n re = re.substr(0, reClassStart) + '\\\\[' + sp[0]\n hasMagic = hasMagic || sp[1]\n }\n\n // handle the case where we had a +( thing at the *end*\n // of the pattern.\n // each pattern list stack adds 3 chars, and we need to go through\n // and escape any | chars that were passed through as-is for the regexp.\n // Go through and escape them, taking care not to double-escape any\n // | chars that were already escaped.\n for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) {\n var tail = re.slice(pl.reStart + pl.open.length)\n this.debug('setting tail', re, pl)\n // maybe some even number of \\, then maybe 1 \\, followed by a |\n tail = tail.replace(/((?:\\\\{2}){0,64})(\\\\?)\\|/g, function (_, $1, $2) {\n if (!$2) {\n // the | isn't already escaped, so escape it.\n $2 = '\\\\'\n }\n\n // need to escape all those slashes *again*, without escaping the\n // one that we need for escaping the | character. As it works out,\n // escaping an even number of slashes can be done by simply repeating\n // it exactly after itself. That's why this trick works.\n //\n // I am sorry that you have to see this.\n return $1 + $1 + $2 + '|'\n })\n\n this.debug('tail=%j\\n %s', tail, tail, pl, re)\n var t = pl.type === '*' ? star\n : pl.type === '?' ? qmark\n : '\\\\' + pl.type\n\n hasMagic = true\n re = re.slice(0, pl.reStart) + t + '\\\\(' + tail\n }\n\n // handle trailing things that only matter at the very end.\n clearStateChar()\n if (escaping) {\n // trailing \\\\\n re += '\\\\\\\\'\n }\n\n // only need to apply the nodot start if the re starts with\n // something that could conceivably capture a dot\n var addPatternStart = false\n switch (re.charAt(0)) {\n case '.':\n case '[':\n case '(': addPatternStart = true\n }\n\n // Hack to work around lack of negative lookbehind in JS\n // A pattern like: *.!(x).!(y|z) needs to ensure that a name\n // like 'a.xyz.yz' doesn't match. So, the first negative\n // lookahead, has to look ALL the way ahead, to the end of\n // the pattern.\n for (var n = negativeLists.length - 1; n > -1; n--) {\n var nl = negativeLists[n]\n\n var nlBefore = re.slice(0, nl.reStart)\n var nlFirst = re.slice(nl.reStart, nl.reEnd - 8)\n var nlLast = re.slice(nl.reEnd - 8, nl.reEnd)\n var nlAfter = re.slice(nl.reEnd)\n\n nlLast += nlAfter\n\n // Handle nested stuff like *(*.js|!(*.json)), where open parens\n // mean that we should *not* include the ) in the bit that is considered\n // \"after\" the negated section.\n var openParensBefore = nlBefore.split('(').length - 1\n var cleanAfter = nlAfter\n for (i = 0; i < openParensBefore; i++) {\n cleanAfter = cleanAfter.replace(/\\)[+*?]?/, '')\n }\n nlAfter = cleanAfter\n\n var dollar = ''\n if (nlAfter === '' && isSub !== SUBPARSE) {\n dollar = '$'\n }\n var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast\n re = newRe\n }\n\n // if the re is not \"\" at this point, then we need to make sure\n // it doesn't match against an empty path part.\n // Otherwise a/* will match a/, which it should not.\n if (re !== '' && hasMagic) {\n re = '(?=.)' + re\n }\n\n if (addPatternStart) {\n re = patternStart + re\n }\n\n // parsing just a piece of a larger pattern.\n if (isSub === SUBPARSE) {\n return [re, hasMagic]\n }\n\n // skip the regexp for non-magical patterns\n // unescape anything in it, though, so that it'll be\n // an exact match against a file etc.\n if (!hasMagic) {\n return globUnescape(pattern)\n }\n\n var flags = options.nocase ? 'i' : ''\n try {\n var regExp = new RegExp('^' + re + '$', flags)\n } catch (er) {\n // If it was an invalid regular expression, then it can't match\n // anything. This trick looks for a character after the end of\n // the string, which is of course impossible, except in multi-line\n // mode, but it's not a /m regex.\n return new RegExp('$.')\n }\n\n regExp._glob = pattern\n regExp._src = re\n\n return regExp\n}\n\nminimatch.makeRe = function (pattern, options) {\n return new Minimatch(pattern, options || {}).makeRe()\n}\n\nMinimatch.prototype.makeRe = makeRe\nfunction makeRe () {\n if (this.regexp || this.regexp === false) return this.regexp\n\n // at this point, this.set is a 2d array of partial\n // pattern strings, or \"**\".\n //\n // It's better to use .match(). This function shouldn't\n // be used, really, but it's pretty convenient sometimes,\n // when you just want to work with a regex.\n var set = this.set\n\n if (!set.length) {\n this.regexp = false\n return this.regexp\n }\n var options = this.options\n\n var twoStar = options.noglobstar ? star\n : options.dot ? twoStarDot\n : twoStarNoDot\n var flags = options.nocase ? 'i' : ''\n\n var re = set.map(function (pattern) {\n return pattern.map(function (p) {\n return (p === GLOBSTAR) ? twoStar\n : (typeof p === 'string') ? regExpEscape(p)\n : p._src\n }).join('\\\\\\/')\n }).join('|')\n\n // must match entire pattern\n // ending in a * or ** will make it less strict.\n re = '^(?:' + re + ')$'\n\n // can match anything, as long as it's not this.\n if (this.negate) re = '^(?!' + re + ').*$'\n\n try {\n this.regexp = new RegExp(re, flags)\n } catch (ex) {\n this.regexp = false\n }\n return this.regexp\n}\n\nminimatch.match = function (list, pattern, options) {\n options = options || {}\n var mm = new Minimatch(pattern, options)\n list = list.filter(function (f) {\n return mm.match(f)\n })\n if (mm.options.nonull && !list.length) {\n list.push(pattern)\n }\n return list\n}\n\nMinimatch.prototype.match = match\nfunction match (f, partial) {\n this.debug('match', f, this.pattern)\n // short-circuit in the case of busted things.\n // comments, etc.\n if (this.comment) return false\n if (this.empty) return f === ''\n\n if (f === '/' && partial) return true\n\n var options = this.options\n\n // windows: need to use /, not \\\n if (path.sep !== '/') {\n f = f.split(path.sep).join('/')\n }\n\n // treat the test path as a set of pathparts.\n f = f.split(slashSplit)\n this.debug(this.pattern, 'split', f)\n\n // just ONE of the pattern sets in this.set needs to match\n // in order for it to be valid. If negating, then just one\n // match means that we have failed.\n // Either way, return on the first hit.\n\n var set = this.set\n this.debug(this.pattern, 'set', set)\n\n // Find the basename of the path by looking for the last non-empty segment\n var filename\n var i\n for (i = f.length - 1; i >= 0; i--) {\n filename = f[i]\n if (filename) break\n }\n\n for (i = 0; i < set.length; i++) {\n var pattern = set[i]\n var file = f\n if (options.matchBase && pattern.length === 1) {\n file = [filename]\n }\n var hit = this.matchOne(file, pattern, partial)\n if (hit) {\n if (options.flipNegate) return true\n return !this.negate\n }\n }\n\n // didn't get any hits. this is success if it's a negative\n // pattern, failure otherwise.\n if (options.flipNegate) return false\n return this.negate\n}\n\n// set partial to true to test if, for example,\n// \"/a/b\" matches the start of \"/*/b/*/d\"\n// Partial means, if you run out of file before you run\n// out of pattern, then that's fine, as long as all\n// the parts match.\nMinimatch.prototype.matchOne = function (file, pattern, partial) {\n var options = this.options\n\n this.debug('matchOne',\n { 'this': this, file: file, pattern: pattern })\n\n this.debug('matchOne', file.length, pattern.length)\n\n for (var fi = 0,\n pi = 0,\n fl = file.length,\n pl = pattern.length\n ; (fi < fl) && (pi < pl)\n ; fi++, pi++) {\n this.debug('matchOne loop')\n var p = pattern[pi]\n var f = file[fi]\n\n this.debug(pattern, p, f)\n\n // should be impossible.\n // some invalid regexp stuff in the set.\n if (p === false) return false\n\n if (p === GLOBSTAR) {\n this.debug('GLOBSTAR', [pattern, p, f])\n\n // \"**\"\n // a/**/b/**/c would match the following:\n // a/b/x/y/z/c\n // a/x/y/z/b/c\n // a/b/x/b/x/c\n // a/b/c\n // To do this, take the rest of the pattern after\n // the **, and see if it would match the file remainder.\n // If so, return success.\n // If not, the ** \"swallows\" a segment, and try again.\n // This is recursively awful.\n //\n // a/**/b/**/c matching a/b/x/y/z/c\n // - a matches a\n // - doublestar\n // - matchOne(b/x/y/z/c, b/**/c)\n // - b matches b\n // - doublestar\n // - matchOne(x/y/z/c, c) -> no\n // - matchOne(y/z/c, c) -> no\n // - matchOne(z/c, c) -> no\n // - matchOne(c, c) yes, hit\n var fr = fi\n var pr = pi + 1\n if (pr === pl) {\n this.debug('** at the end')\n // a ** at the end will just swallow the rest.\n // We have found a match.\n // however, it will not swallow /.x, unless\n // options.dot is set.\n // . and .. are *never* matched by **, for explosively\n // exponential reasons.\n for (; fi < fl; fi++) {\n if (file[fi] === '.' || file[fi] === '..' ||\n (!options.dot && file[fi].charAt(0) === '.')) return false\n }\n return true\n }\n\n // ok, let's see if we can swallow whatever we can.\n while (fr < fl) {\n var swallowee = file[fr]\n\n this.debug('\\nglobstar while', file, fr, pattern, pr, swallowee)\n\n // XXX remove this slice. Just pass the start index.\n if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) {\n this.debug('globstar found match!', fr, fl, swallowee)\n // found a match.\n return true\n } else {\n // can't swallow \".\" or \"..\" ever.\n // can only swallow \".foo\" when explicitly asked.\n if (swallowee === '.' || swallowee === '..' ||\n (!options.dot && swallowee.charAt(0) === '.')) {\n this.debug('dot detected!', file, fr, pattern, pr)\n break\n }\n\n // ** swallows a segment, and continue.\n this.debug('globstar swallow a segment, and continue')\n fr++\n }\n }\n\n // no match was found.\n // However, in partial mode, we can't say this is necessarily over.\n // If there's more *pattern* left, then\n if (partial) {\n // ran out of file\n this.debug('\\n>>> no match, partial?', file, fr, pattern, pr)\n if (fr === fl) return true\n }\n return false\n }\n\n // something other than **\n // non-magic patterns just have to match exactly\n // patterns with magic have been turned into regexps.\n var hit\n if (typeof p === 'string') {\n if (options.nocase) {\n hit = f.toLowerCase() === p.toLowerCase()\n } else {\n hit = f === p\n }\n this.debug('string match', p, f, hit)\n } else {\n hit = f.match(p)\n this.debug('pattern match', p, f, hit)\n }\n\n if (!hit) return false\n }\n\n // Note: ending in / means that we'll get a final \"\"\n // at the end of the pattern. This can only match a\n // corresponding \"\" at the end of the file.\n // If the file ends in /, then it can only match a\n // a pattern that ends in /, unless the pattern just\n // doesn't have any more for it. But, a/b/ should *not*\n // match \"a/b/*\", even though \"\" matches against the\n // [^/]*? pattern, except in partial mode, where it might\n // simply not be reached yet.\n // However, a/b/ should still satisfy a/*\n\n // now either we fell off the end of the pattern, or we're done.\n if (fi === fl && pi === pl) {\n // ran out of pattern and filename at the same time.\n // an exact hit!\n return true\n } else if (fi === fl) {\n // ran out of file, but still had pattern left.\n // this is ok if we're doing the match as part of\n // a glob fs traversal.\n return partial\n } else if (pi === pl) {\n // ran out of pattern, still have file left.\n // this is only acceptable if we're on the very last\n // empty segment of a file with a trailing slash.\n // a/* should match a/b/\n var emptyFileEnd = (fi === fl - 1) && (file[fi] === '')\n return emptyFileEnd\n }\n\n // should be unreachable.\n throw new Error('wtf?')\n}\n\n// replace stuff like \\* with *\nfunction globUnescape (s) {\n return s.replace(/\\\\(.)/g, '$1')\n}\n\nfunction regExpEscape (s) {\n return s.replace(/[-[\\]{}()*+?.,\\\\^$|#\\s]/g, '\\\\$&')\n}\n\n},{\"brace-expansion\":11,\"path\":22}],21:[function(require,module,exports){\nvar wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n\n},{\"wrappy\":29}],22:[function(require,module,exports){\n(function (process){\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// resolves . and .. elements in a path array with directory names there\n// must be no slashes, empty elements, or device names (c:\\) in the array\n// (so also no leading and trailing slashes - it does not distinguish\n// relative and absolute paths)\nfunction normalizeArray(parts, allowAboveRoot) {\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = parts.length - 1; i >= 0; i--) {\n var last = parts[i];\n if (last === '.') {\n parts.splice(i, 1);\n } else if (last === '..') {\n parts.splice(i, 1);\n up++;\n } else if (up) {\n parts.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (allowAboveRoot) {\n for (; up--; up) {\n parts.unshift('..');\n }\n }\n\n return parts;\n}\n\n// Split a filename into [root, dir, basename, ext], unix version\n// 'root' is just a slash, or nothing.\nvar splitPathRe =\n /^(\\/?|)([\\s\\S]*?)((?:\\.{1,2}|[^\\/]+?|)(\\.[^.\\/]*|))(?:[\\/]*)$/;\nvar splitPath = function(filename) {\n return splitPathRe.exec(filename).slice(1);\n};\n\n// path.resolve([from ...], to)\n// posix version\nexports.resolve = function() {\n var resolvedPath = '',\n resolvedAbsolute = false;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path = (i >= 0) ? arguments[i] : process.cwd();\n\n // Skip empty and invalid entries\n if (typeof path !== 'string') {\n throw new TypeError('Arguments to path.resolve must be strings');\n } else if (!path) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charAt(0) === '/';\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) {\n return !!p;\n }), !resolvedAbsolute).join('/');\n\n return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.';\n};\n\n// path.normalize(path)\n// posix version\nexports.normalize = function(path) {\n var isAbsolute = exports.isAbsolute(path),\n trailingSlash = substr(path, -1) === '/';\n\n // Normalize the path\n path = normalizeArray(filter(path.split('/'), function(p) {\n return !!p;\n }), !isAbsolute).join('/');\n\n if (!path && !isAbsolute) {\n path = '.';\n }\n if (path && trailingSlash) {\n path += '/';\n }\n\n return (isAbsolute ? '/' : '') + path;\n};\n\n// posix version\nexports.isAbsolute = function(path) {\n return path.charAt(0) === '/';\n};\n\n// posix version\nexports.join = function() {\n var paths = Array.prototype.slice.call(arguments, 0);\n return exports.normalize(filter(paths, function(p, index) {\n if (typeof p !== 'string') {\n throw new TypeError('Arguments to path.join must be strings');\n }\n return p;\n }).join('/'));\n};\n\n\n// path.relative(from, to)\n// posix version\nexports.relative = function(from, to) {\n from = exports.resolve(from).substr(1);\n to = exports.resolve(to).substr(1);\n\n function trim(arr) {\n var start = 0;\n for (; start < arr.length; start++) {\n if (arr[start] !== '') break;\n }\n\n var end = arr.length - 1;\n for (; end >= 0; end--) {\n if (arr[end] !== '') break;\n }\n\n if (start > end) return [];\n return arr.slice(start, end - start + 1);\n }\n\n var fromParts = trim(from.split('/'));\n var toParts = trim(to.split('/'));\n\n var length = Math.min(fromParts.length, toParts.length);\n var samePartsLength = length;\n for (var i = 0; i < length; i++) {\n if (fromParts[i] !== toParts[i]) {\n samePartsLength = i;\n break;\n }\n }\n\n var outputParts = [];\n for (var i = samePartsLength; i < fromParts.length; i++) {\n outputParts.push('..');\n }\n\n outputParts = outputParts.concat(toParts.slice(samePartsLength));\n\n return outputParts.join('/');\n};\n\nexports.sep = '/';\nexports.delimiter = ':';\n\nexports.dirname = function(path) {\n var result = splitPath(path),\n root = result[0],\n dir = result[1];\n\n if (!root && !dir) {\n // No dirname whatsoever\n return '.';\n }\n\n if (dir) {\n // It has a dirname, strip trailing slash\n dir = dir.substr(0, dir.length - 1);\n }\n\n return root + dir;\n};\n\n\nexports.basename = function(path, ext) {\n var f = splitPath(path)[2];\n // TODO: make this comparison case-insensitive on windows?\n if (ext && f.substr(-1 * ext.length) === ext) {\n f = f.substr(0, f.length - ext.length);\n }\n return f;\n};\n\n\nexports.extname = function(path) {\n return splitPath(path)[3];\n};\n\nfunction filter (xs, f) {\n if (xs.filter) return xs.filter(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n if (f(xs[i], i, xs)) res.push(xs[i]);\n }\n return res;\n}\n\n// String.prototype.substr - negative index don't work in IE8\nvar substr = 'ab'.substr(-1) === 'b'\n ? function (str, start, len) { return str.substr(start, len) }\n : function (str, start, len) {\n if (start < 0) start = str.length + start;\n return str.substr(start, len);\n }\n;\n\n}).call(this,require('_process'))\n},{\"_process\":24}],23:[function(require,module,exports){\n(function (process){\n'use strict';\n\nfunction posix(path) {\n\treturn path.charAt(0) === '/';\n}\n\nfunction win32(path) {\n\t// https://github.com/nodejs/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56\n\tvar splitDeviceRe = /^([a-zA-Z]:|[\\\\\\/]{2}[^\\\\\\/]+[\\\\\\/]+[^\\\\\\/]+)?([\\\\\\/])?([\\s\\S]*?)$/;\n\tvar result = splitDeviceRe.exec(path);\n\tvar device = result[1] || '';\n\tvar isUnc = Boolean(device && device.charAt(1) !== ':');\n\n\t// UNC paths are always absolute\n\treturn Boolean(result[2] || isUnc);\n}\n\nmodule.exports = process.platform === 'win32' ? win32 : posix;\nmodule.exports.posix = posix;\nmodule.exports.win32 = win32;\n\n}).call(this,require('_process'))\n},{\"_process\":24}],24:[function(require,module,exports){\n// shim for using process in browser\nvar process = module.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things. But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals. It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n throw new Error('clearTimeout has not been defined');\n}\n(function () {\n try {\n if (typeof setTimeout === 'function') {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === 'function') {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n} ())\nfunction runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch(e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch(e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n\n\n}\nfunction runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e){\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e){\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n}\n\nfunction drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while(len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\nprocess.prependListener = noop;\nprocess.prependOnceListener = noop;\n\nprocess.listeners = function (name) { return [] }\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\n},{}],25:[function(require,module,exports){\n// Underscore.js 1.8.3\n// http://underscorejs.org\n// (c) 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n// Underscore may be freely distributed under the MIT license.\n\n(function() {\n\n // Baseline setup\n // --------------\n\n // Establish the root object, `window` in the browser, or `exports` on the server.\n var root = this;\n\n // Save the previous value of the `_` variable.\n var previousUnderscore = root._;\n\n // Save bytes in the minified (but not gzipped) version:\n var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;\n\n // Create quick reference variables for speed access to core prototypes.\n var\n push = ArrayProto.push,\n slice = ArrayProto.slice,\n toString = ObjProto.toString,\n hasOwnProperty = ObjProto.hasOwnProperty;\n\n // All **ECMAScript 5** native function implementations that we hope to use\n // are declared here.\n var\n nativeIsArray = Array.isArray,\n nativeKeys = Object.keys,\n nativeBind = FuncProto.bind,\n nativeCreate = Object.create;\n\n // Naked function reference for surrogate-prototype-swapping.\n var Ctor = function(){};\n\n // Create a safe reference to the Underscore object for use below.\n var _ = function(obj) {\n if (obj instanceof _) return obj;\n if (!(this instanceof _)) return new _(obj);\n this._wrapped = obj;\n };\n\n // Export the Underscore object for **Node.js**, with\n // backwards-compatibility for the old `require()` API. If we're in\n // the browser, add `_` as a global object.\n if (typeof exports !== 'undefined') {\n if (typeof module !== 'undefined' && module.exports) {\n exports = module.exports = _;\n }\n exports._ = _;\n } else {\n root._ = _;\n }\n\n // Current version.\n _.VERSION = '1.8.3';\n\n // Internal function that returns an efficient (for current engines) version\n // of the passed-in callback, to be repeatedly applied in other Underscore\n // functions.\n var optimizeCb = function(func, context, argCount) {\n if (context === void 0) return func;\n switch (argCount == null ? 3 : argCount) {\n case 1: return function(value) {\n return func.call(context, value);\n };\n case 2: return function(value, other) {\n return func.call(context, value, other);\n };\n case 3: return function(value, index, collection) {\n return func.call(context, value, index, collection);\n };\n case 4: return function(accumulator, value, index, collection) {\n return func.call(context, accumulator, value, index, collection);\n };\n }\n return function() {\n return func.apply(context, arguments);\n };\n };\n\n // A mostly-internal function to generate callbacks that can be applied\n // to each element in a collection, returning the desired result â either\n // identity, an arbitrary callback, a property matcher, or a property accessor.\n var cb = function(value, context, argCount) {\n if (value == null) return _.identity;\n if (_.isFunction(value)) return optimizeCb(value, context, argCount);\n if (_.isObject(value)) return _.matcher(value);\n return _.property(value);\n };\n _.iteratee = function(value, context) {\n return cb(value, context, Infinity);\n };\n\n // An internal function for creating assigner functions.\n var createAssigner = function(keysFunc, undefinedOnly) {\n return function(obj) {\n var length = arguments.length;\n if (length < 2 || obj == null) return obj;\n for (var index = 1; index < length; index++) {\n var source = arguments[index],\n keys = keysFunc(source),\n l = keys.length;\n for (var i = 0; i < l; i++) {\n var key = keys[i];\n if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key];\n }\n }\n return obj;\n };\n };\n\n // An internal function for creating a new object that inherits from another.\n var baseCreate = function(prototype) {\n if (!_.isObject(prototype)) return {};\n if (nativeCreate) return nativeCreate(prototype);\n Ctor.prototype = prototype;\n var result = new Ctor;\n Ctor.prototype = null;\n return result;\n };\n\n var property = function(key) {\n return function(obj) {\n return obj == null ? void 0 : obj[key];\n };\n };\n\n // Helper for collection methods to determine whether a collection\n // should be iterated as an array or as an object\n // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength\n // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094\n var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;\n var getLength = property('length');\n var isArrayLike = function(collection) {\n var length = getLength(collection);\n return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;\n };\n\n // Collection Functions\n // --------------------\n\n // The cornerstone, an `each` implementation, aka `forEach`.\n // Handles raw objects in addition to array-likes. Treats all\n // sparse array-likes as if they were dense.\n _.each = _.forEach = function(obj, iteratee, context) {\n iteratee = optimizeCb(iteratee, context);\n var i, length;\n if (isArrayLike(obj)) {\n for (i = 0, length = obj.length; i < length; i++) {\n iteratee(obj[i], i, obj);\n }\n } else {\n var keys = _.keys(obj);\n for (i = 0, length = keys.length; i < length; i++) {\n iteratee(obj[keys[i]], keys[i], obj);\n }\n }\n return obj;\n };\n\n // Return the results of applying the iteratee to each element.\n _.map = _.collect = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length,\n results = Array(length);\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n results[index] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n };\n\n // Create a reducing function iterating left or right.\n function createReduce(dir) {\n // Optimized iterator function as using arguments.length\n // in the main function will deoptimize the, see #1991.\n function iterator(obj, iteratee, memo, keys, index, length) {\n for (; index >= 0 && index < length; index += dir) {\n var currentKey = keys ? keys[index] : index;\n memo = iteratee(memo, obj[currentKey], currentKey, obj);\n }\n return memo;\n }\n\n return function(obj, iteratee, memo, context) {\n iteratee = optimizeCb(iteratee, context, 4);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length,\n index = dir > 0 ? 0 : length - 1;\n // Determine the initial value if none is provided.\n if (arguments.length < 3) {\n memo = obj[keys ? keys[index] : index];\n index += dir;\n }\n return iterator(obj, iteratee, memo, keys, index, length);\n };\n }\n\n // **Reduce** builds up a single result from a list of values, aka `inject`,\n // or `foldl`.\n _.reduce = _.foldl = _.inject = createReduce(1);\n\n // The right-associative version of reduce, also known as `foldr`.\n _.reduceRight = _.foldr = createReduce(-1);\n\n // Return the first value which passes a truth test. Aliased as `detect`.\n _.find = _.detect = function(obj, predicate, context) {\n var key;\n if (isArrayLike(obj)) {\n key = _.findIndex(obj, predicate, context);\n } else {\n key = _.findKey(obj, predicate, context);\n }\n if (key !== void 0 && key !== -1) return obj[key];\n };\n\n // Return all the elements that pass a truth test.\n // Aliased as `select`.\n _.filter = _.select = function(obj, predicate, context) {\n var results = [];\n predicate = cb(predicate, context);\n _.each(obj, function(value, index, list) {\n if (predicate(value, index, list)) results.push(value);\n });\n return results;\n };\n\n // Return all the elements for which a truth test fails.\n _.reject = function(obj, predicate, context) {\n return _.filter(obj, _.negate(cb(predicate)), context);\n };\n\n // Determine whether all of the elements match a truth test.\n // Aliased as `all`.\n _.every = _.all = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n if (!predicate(obj[currentKey], currentKey, obj)) return false;\n }\n return true;\n };\n\n // Determine if at least one element in the object matches a truth test.\n // Aliased as `any`.\n _.some = _.any = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = !isArrayLike(obj) && _.keys(obj),\n length = (keys || obj).length;\n for (var index = 0; index < length; index++) {\n var currentKey = keys ? keys[index] : index;\n if (predicate(obj[currentKey], currentKey, obj)) return true;\n }\n return false;\n };\n\n // Determine if the array or object contains a given item (using `===`).\n // Aliased as `includes` and `include`.\n _.contains = _.includes = _.include = function(obj, item, fromIndex, guard) {\n if (!isArrayLike(obj)) obj = _.values(obj);\n if (typeof fromIndex != 'number' || guard) fromIndex = 0;\n return _.indexOf(obj, item, fromIndex) >= 0;\n };\n\n // Invoke a method (with arguments) on every item in a collection.\n _.invoke = function(obj, method) {\n var args = slice.call(arguments, 2);\n var isFunc = _.isFunction(method);\n return _.map(obj, function(value) {\n var func = isFunc ? method : value[method];\n return func == null ? func : func.apply(value, args);\n });\n };\n\n // Convenience version of a common use case of `map`: fetching a property.\n _.pluck = function(obj, key) {\n return _.map(obj, _.property(key));\n };\n\n // Convenience version of a common use case of `filter`: selecting only objects\n // containing specific `key:value` pairs.\n _.where = function(obj, attrs) {\n return _.filter(obj, _.matcher(attrs));\n };\n\n // Convenience version of a common use case of `find`: getting the first object\n // containing specific `key:value` pairs.\n _.findWhere = function(obj, attrs) {\n return _.find(obj, _.matcher(attrs));\n };\n\n // Return the maximum element (or element-based computation).\n _.max = function(obj, iteratee, context) {\n var result = -Infinity, lastComputed = -Infinity,\n value, computed;\n if (iteratee == null && obj != null) {\n obj = isArrayLike(obj) ? obj : _.values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value > result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index, list) {\n computed = iteratee(value, index, list);\n if (computed > lastComputed || computed === -Infinity && result === -Infinity) {\n result = value;\n lastComputed = computed;\n }\n });\n }\n return result;\n };\n\n // Return the minimum element (or element-based computation).\n _.min = function(obj, iteratee, context) {\n var result = Infinity, lastComputed = Infinity,\n value, computed;\n if (iteratee == null && obj != null) {\n obj = isArrayLike(obj) ? obj : _.values(obj);\n for (var i = 0, length = obj.length; i < length; i++) {\n value = obj[i];\n if (value < result) {\n result = value;\n }\n }\n } else {\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index, list) {\n computed = iteratee(value, index, list);\n if (computed < lastComputed || computed === Infinity && result === Infinity) {\n result = value;\n lastComputed = computed;\n }\n });\n }\n return result;\n };\n\n // Shuffle a collection, using the modern version of the\n // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/FisherâYates_shuffle).\n _.shuffle = function(obj) {\n var set = isArrayLike(obj) ? obj : _.values(obj);\n var length = set.length;\n var shuffled = Array(length);\n for (var index = 0, rand; index < length; index++) {\n rand = _.random(0, index);\n if (rand !== index) shuffled[index] = shuffled[rand];\n shuffled[rand] = set[index];\n }\n return shuffled;\n };\n\n // Sample **n** random values from a collection.\n // If **n** is not specified, returns a single random element.\n // The internal `guard` argument allows it to work with `map`.\n _.sample = function(obj, n, guard) {\n if (n == null || guard) {\n if (!isArrayLike(obj)) obj = _.values(obj);\n return obj[_.random(obj.length - 1)];\n }\n return _.shuffle(obj).slice(0, Math.max(0, n));\n };\n\n // Sort the object's values by a criterion produced by an iteratee.\n _.sortBy = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n return _.pluck(_.map(obj, function(value, index, list) {\n return {\n value: value,\n index: index,\n criteria: iteratee(value, index, list)\n };\n }).sort(function(left, right) {\n var a = left.criteria;\n var b = right.criteria;\n if (a !== b) {\n if (a > b || a === void 0) return 1;\n if (a < b || b === void 0) return -1;\n }\n return left.index - right.index;\n }), 'value');\n };\n\n // An internal function used for aggregate \"group by\" operations.\n var group = function(behavior) {\n return function(obj, iteratee, context) {\n var result = {};\n iteratee = cb(iteratee, context);\n _.each(obj, function(value, index) {\n var key = iteratee(value, index, obj);\n behavior(result, value, key);\n });\n return result;\n };\n };\n\n // Groups the object's values by a criterion. Pass either a string attribute\n // to group by, or a function that returns the criterion.\n _.groupBy = group(function(result, value, key) {\n if (_.has(result, key)) result[key].push(value); else result[key] = [value];\n });\n\n // Indexes the object's values by a criterion, similar to `groupBy`, but for\n // when you know that your index values will be unique.\n _.indexBy = group(function(result, value, key) {\n result[key] = value;\n });\n\n // Counts instances of an object that group by a certain criterion. Pass\n // either a string attribute to count by, or a function that returns the\n // criterion.\n _.countBy = group(function(result, value, key) {\n if (_.has(result, key)) result[key]++; else result[key] = 1;\n });\n\n // Safely create a real, live array from anything iterable.\n _.toArray = function(obj) {\n if (!obj) return [];\n if (_.isArray(obj)) return slice.call(obj);\n if (isArrayLike(obj)) return _.map(obj, _.identity);\n return _.values(obj);\n };\n\n // Return the number of elements in an object.\n _.size = function(obj) {\n if (obj == null) return 0;\n return isArrayLike(obj) ? obj.length : _.keys(obj).length;\n };\n\n // Split a collection into two arrays: one whose elements all satisfy the given\n // predicate, and one whose elements all do not satisfy the predicate.\n _.partition = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var pass = [], fail = [];\n _.each(obj, function(value, key, obj) {\n (predicate(value, key, obj) ? pass : fail).push(value);\n });\n return [pass, fail];\n };\n\n // Array Functions\n // ---------------\n\n // Get the first element of an array. Passing **n** will return the first N\n // values in the array. Aliased as `head` and `take`. The **guard** check\n // allows it to work with `_.map`.\n _.first = _.head = _.take = function(array, n, guard) {\n if (array == null) return void 0;\n if (n == null || guard) return array[0];\n return _.initial(array, array.length - n);\n };\n\n // Returns everything but the last entry of the array. Especially useful on\n // the arguments object. Passing **n** will return all the values in\n // the array, excluding the last N.\n _.initial = function(array, n, guard) {\n return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n };\n\n // Get the last element of an array. Passing **n** will return the last N\n // values in the array.\n _.last = function(array, n, guard) {\n if (array == null) return void 0;\n if (n == null || guard) return array[array.length - 1];\n return _.rest(array, Math.max(0, array.length - n));\n };\n\n // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.\n // Especially useful on the arguments object. Passing an **n** will return\n // the rest N values in the array.\n _.rest = _.tail = _.drop = function(array, n, guard) {\n return slice.call(array, n == null || guard ? 1 : n);\n };\n\n // Trim out all falsy values from an array.\n _.compact = function(array) {\n return _.filter(array, _.identity);\n };\n\n // Internal implementation of a recursive `flatten` function.\n var flatten = function(input, shallow, strict, startIndex) {\n var output = [], idx = 0;\n for (var i = startIndex || 0, length = getLength(input); i < length; i++) {\n var value = input[i];\n if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) {\n //flatten current level of array or arguments object\n if (!shallow) value = flatten(value, shallow, strict);\n var j = 0, len = value.length;\n output.length += len;\n while (j < len) {\n output[idx++] = value[j++];\n }\n } else if (!strict) {\n output[idx++] = value;\n }\n }\n return output;\n };\n\n // Flatten out an array, either recursively (by default), or just one level.\n _.flatten = function(array, shallow) {\n return flatten(array, shallow, false);\n };\n\n // Return a version of the array that does not contain the specified value(s).\n _.without = function(array) {\n return _.difference(array, slice.call(arguments, 1));\n };\n\n // Produce a duplicate-free version of the array. If the array has already\n // been sorted, you have the option of using a faster algorithm.\n // Aliased as `unique`.\n _.uniq = _.unique = function(array, isSorted, iteratee, context) {\n if (!_.isBoolean(isSorted)) {\n context = iteratee;\n iteratee = isSorted;\n isSorted = false;\n }\n if (iteratee != null) iteratee = cb(iteratee, context);\n var result = [];\n var seen = [];\n for (var i = 0, length = getLength(array); i < length; i++) {\n var value = array[i],\n computed = iteratee ? iteratee(value, i, array) : value;\n if (isSorted) {\n if (!i || seen !== computed) result.push(value);\n seen = computed;\n } else if (iteratee) {\n if (!_.contains(seen, computed)) {\n seen.push(computed);\n result.push(value);\n }\n } else if (!_.contains(result, value)) {\n result.push(value);\n }\n }\n return result;\n };\n\n // Produce an array that contains the union: each distinct element from all of\n // the passed-in arrays.\n _.union = function() {\n return _.uniq(flatten(arguments, true, true));\n };\n\n // Produce an array that contains every item shared between all the\n // passed-in arrays.\n _.intersection = function(array) {\n var result = [];\n var argsLength = arguments.length;\n for (var i = 0, length = getLength(array); i < length; i++) {\n var item = array[i];\n if (_.contains(result, item)) continue;\n for (var j = 1; j < argsLength; j++) {\n if (!_.contains(arguments[j], item)) break;\n }\n if (j === argsLength) result.push(item);\n }\n return result;\n };\n\n // Take the difference between one array and a number of other arrays.\n // Only the elements present in just the first array will remain.\n _.difference = function(array) {\n var rest = flatten(arguments, true, true, 1);\n return _.filter(array, function(value){\n return !_.contains(rest, value);\n });\n };\n\n // Zip together multiple lists into a single array -- elements that share\n // an index go together.\n _.zip = function() {\n return _.unzip(arguments);\n };\n\n // Complement of _.zip. Unzip accepts an array of arrays and groups\n // each array's elements on shared indices\n _.unzip = function(array) {\n var length = array && _.max(array, getLength).length || 0;\n var result = Array(length);\n\n for (var index = 0; index < length; index++) {\n result[index] = _.pluck(array, index);\n }\n return result;\n };\n\n // Converts lists into objects. Pass either a single array of `[key, value]`\n // pairs, or two parallel arrays of the same length -- one of keys, and one of\n // the corresponding values.\n _.object = function(list, values) {\n var result = {};\n for (var i = 0, length = getLength(list); i < length; i++) {\n if (values) {\n result[list[i]] = values[i];\n } else {\n result[list[i][0]] = list[i][1];\n }\n }\n return result;\n };\n\n // Generator function to create the findIndex and findLastIndex functions\n function createPredicateIndexFinder(dir) {\n return function(array, predicate, context) {\n predicate = cb(predicate, context);\n var length = getLength(array);\n var index = dir > 0 ? 0 : length - 1;\n for (; index >= 0 && index < length; index += dir) {\n if (predicate(array[index], index, array)) return index;\n }\n return -1;\n };\n }\n\n // Returns the first index on an array-like that passes a predicate test\n _.findIndex = createPredicateIndexFinder(1);\n _.findLastIndex = createPredicateIndexFinder(-1);\n\n // Use a comparator function to figure out the smallest index at which\n // an object should be inserted so as to maintain order. Uses binary search.\n _.sortedIndex = function(array, obj, iteratee, context) {\n iteratee = cb(iteratee, context, 1);\n var value = iteratee(obj);\n var low = 0, high = getLength(array);\n while (low < high) {\n var mid = Math.floor((low + high) / 2);\n if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;\n }\n return low;\n };\n\n // Generator function to create the indexOf and lastIndexOf functions\n function createIndexFinder(dir, predicateFind, sortedIndex) {\n return function(array, item, idx) {\n var i = 0, length = getLength(array);\n if (typeof idx == 'number') {\n if (dir > 0) {\n i = idx >= 0 ? idx : Math.max(idx + length, i);\n } else {\n length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;\n }\n } else if (sortedIndex && idx && length) {\n idx = sortedIndex(array, item);\n return array[idx] === item ? idx : -1;\n }\n if (item !== item) {\n idx = predicateFind(slice.call(array, i, length), _.isNaN);\n return idx >= 0 ? idx + i : -1;\n }\n for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {\n if (array[idx] === item) return idx;\n }\n return -1;\n };\n }\n\n // Return the position of the first occurrence of an item in an array,\n // or -1 if the item is not included in the array.\n // If the array is large and already in sort order, pass `true`\n // for **isSorted** to use binary search.\n _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex);\n _.lastIndexOf = createIndexFinder(-1, _.findLastIndex);\n\n // Generate an integer Array containing an arithmetic progression. A port of\n // the native Python `range()` function. See\n // [the Python documentation](http://docs.python.org/library/functions.html#range).\n _.range = function(start, stop, step) {\n if (stop == null) {\n stop = start || 0;\n start = 0;\n }\n step = step || 1;\n\n var length = Math.max(Math.ceil((stop - start) / step), 0);\n var range = Array(length);\n\n for (var idx = 0; idx < length; idx++, start += step) {\n range[idx] = start;\n }\n\n return range;\n };\n\n // Function (ahem) Functions\n // ------------------\n\n // Determines whether to execute a function as a constructor\n // or a normal function with the provided arguments\n var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) {\n if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);\n var self = baseCreate(sourceFunc.prototype);\n var result = sourceFunc.apply(self, args);\n if (_.isObject(result)) return result;\n return self;\n };\n\n // Create a function bound to a given object (assigning `this`, and arguments,\n // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if\n // available.\n _.bind = function(func, context) {\n if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));\n if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');\n var args = slice.call(arguments, 2);\n var bound = function() {\n return executeBound(func, bound, context, this, args.concat(slice.call(arguments)));\n };\n return bound;\n };\n\n // Partially apply a function by creating a version that has had some of its\n // arguments pre-filled, without changing its dynamic `this` context. _ acts\n // as a placeholder, allowing any combination of arguments to be pre-filled.\n _.partial = function(func) {\n var boundArgs = slice.call(arguments, 1);\n var bound = function() {\n var position = 0, length = boundArgs.length;\n var args = Array(length);\n for (var i = 0; i < length; i++) {\n args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i];\n }\n while (position < arguments.length) args.push(arguments[position++]);\n return executeBound(func, bound, this, this, args);\n };\n return bound;\n };\n\n // Bind a number of an object's methods to that object. Remaining arguments\n // are the method names to be bound. Useful for ensuring that all callbacks\n // defined on an object belong to it.\n _.bindAll = function(obj) {\n var i, length = arguments.length, key;\n if (length <= 1) throw new Error('bindAll must be passed function names');\n for (i = 1; i < length; i++) {\n key = arguments[i];\n obj[key] = _.bind(obj[key], obj);\n }\n return obj;\n };\n\n // Memoize an expensive function by storing its results.\n _.memoize = function(func, hasher) {\n var memoize = function(key) {\n var cache = memoize.cache;\n var address = '' + (hasher ? hasher.apply(this, arguments) : key);\n if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);\n return cache[address];\n };\n memoize.cache = {};\n return memoize;\n };\n\n // Delays a function for the given number of milliseconds, and then calls\n // it with the arguments supplied.\n _.delay = function(func, wait) {\n var args = slice.call(arguments, 2);\n return setTimeout(function(){\n return func.apply(null, args);\n }, wait);\n };\n\n // Defers a function, scheduling it to run after the current call stack has\n // cleared.\n _.defer = _.partial(_.delay, _, 1);\n\n // Returns a function, that, when invoked, will only be triggered at most once\n // during a given window of time. Normally, the throttled function will run\n // as much as it can, without ever going more than once per `wait` duration;\n // but if you'd like to disable the execution on the leading edge, pass\n // `{leading: false}`. To disable execution on the trailing edge, ditto.\n _.throttle = function(func, wait, options) {\n var context, args, result;\n var timeout = null;\n var previous = 0;\n if (!options) options = {};\n var later = function() {\n previous = options.leading === false ? 0 : _.now();\n timeout = null;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n };\n return function() {\n var now = _.now();\n if (!previous && options.leading === false) previous = now;\n var remaining = wait - (now - previous);\n context = this;\n args = arguments;\n if (remaining <= 0 || remaining > wait) {\n if (timeout) {\n clearTimeout(timeout);\n timeout = null;\n }\n previous = now;\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n } else if (!timeout && options.trailing !== false) {\n timeout = setTimeout(later, remaining);\n }\n return result;\n };\n };\n\n // Returns a function, that, as long as it continues to be invoked, will not\n // be triggered. The function will be called after it stops being called for\n // N milliseconds. If `immediate` is passed, trigger the function on the\n // leading edge, instead of the trailing.\n _.debounce = function(func, wait, immediate) {\n var timeout, args, context, timestamp, result;\n\n var later = function() {\n var last = _.now() - timestamp;\n\n if (last < wait && last >= 0) {\n timeout = setTimeout(later, wait - last);\n } else {\n timeout = null;\n if (!immediate) {\n result = func.apply(context, args);\n if (!timeout) context = args = null;\n }\n }\n };\n\n return function() {\n context = this;\n args = arguments;\n timestamp = _.now();\n var callNow = immediate && !timeout;\n if (!timeout) timeout = setTimeout(later, wait);\n if (callNow) {\n result = func.apply(context, args);\n context = args = null;\n }\n\n return result;\n };\n };\n\n // Returns the first function passed as an argument to the second,\n // allowing you to adjust arguments, run code before and after, and\n // conditionally execute the original function.\n _.wrap = function(func, wrapper) {\n return _.partial(wrapper, func);\n };\n\n // Returns a negated version of the passed-in predicate.\n _.negate = function(predicate) {\n return function() {\n return !predicate.apply(this, arguments);\n };\n };\n\n // Returns a function that is the composition of a list of functions, each\n // consuming the return value of the function that follows.\n _.compose = function() {\n var args = arguments;\n var start = args.length - 1;\n return function() {\n var i = start;\n var result = args[start].apply(this, arguments);\n while (i--) result = args[i].call(this, result);\n return result;\n };\n };\n\n // Returns a function that will only be executed on and after the Nth call.\n _.after = function(times, func) {\n return function() {\n if (--times < 1) {\n return func.apply(this, arguments);\n }\n };\n };\n\n // Returns a function that will only be executed up to (but not including) the Nth call.\n _.before = function(times, func) {\n var memo;\n return function() {\n if (--times > 0) {\n memo = func.apply(this, arguments);\n }\n if (times <= 1) func = null;\n return memo;\n };\n };\n\n // Returns a function that will be executed at most one time, no matter how\n // often you call it. Useful for lazy initialization.\n _.once = _.partial(_.before, 2);\n\n // Object Functions\n // ----------------\n\n // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.\n var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');\n var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',\n 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];\n\n function collectNonEnumProps(obj, keys) {\n var nonEnumIdx = nonEnumerableProps.length;\n var constructor = obj.constructor;\n var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto;\n\n // Constructor is a special case.\n var prop = 'constructor';\n if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);\n\n while (nonEnumIdx--) {\n prop = nonEnumerableProps[nonEnumIdx];\n if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) {\n keys.push(prop);\n }\n }\n }\n\n // Retrieve the names of an object's own properties.\n // Delegates to **ECMAScript 5**'s native `Object.keys`\n _.keys = function(obj) {\n if (!_.isObject(obj)) return [];\n if (nativeKeys) return nativeKeys(obj);\n var keys = [];\n for (var key in obj) if (_.has(obj, key)) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n };\n\n // Retrieve all the property names of an object.\n _.allKeys = function(obj) {\n if (!_.isObject(obj)) return [];\n var keys = [];\n for (var key in obj) keys.push(key);\n // Ahem, IE < 9.\n if (hasEnumBug) collectNonEnumProps(obj, keys);\n return keys;\n };\n\n // Retrieve the values of an object's properties.\n _.values = function(obj) {\n var keys = _.keys(obj);\n var length = keys.length;\n var values = Array(length);\n for (var i = 0; i < length; i++) {\n values[i] = obj[keys[i]];\n }\n return values;\n };\n\n // Returns the results of applying the iteratee to each element of the object\n // In contrast to _.map it returns an object\n _.mapObject = function(obj, iteratee, context) {\n iteratee = cb(iteratee, context);\n var keys = _.keys(obj),\n length = keys.length,\n results = {},\n currentKey;\n for (var index = 0; index < length; index++) {\n currentKey = keys[index];\n results[currentKey] = iteratee(obj[currentKey], currentKey, obj);\n }\n return results;\n };\n\n // Convert an object into a list of `[key, value]` pairs.\n _.pairs = function(obj) {\n var keys = _.keys(obj);\n var length = keys.length;\n var pairs = Array(length);\n for (var i = 0; i < length; i++) {\n pairs[i] = [keys[i], obj[keys[i]]];\n }\n return pairs;\n };\n\n // Invert the keys and values of an object. The values must be serializable.\n _.invert = function(obj) {\n var result = {};\n var keys = _.keys(obj);\n for (var i = 0, length = keys.length; i < length; i++) {\n result[obj[keys[i]]] = keys[i];\n }\n return result;\n };\n\n // Return a sorted list of the function names available on the object.\n // Aliased as `methods`\n _.functions = _.methods = function(obj) {\n var names = [];\n for (var key in obj) {\n if (_.isFunction(obj[key])) names.push(key);\n }\n return names.sort();\n };\n\n // Extend a given object with all the properties in passed-in object(s).\n _.extend = createAssigner(_.allKeys);\n\n // Assigns a given object with all the own properties in the passed-in object(s)\n // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)\n _.extendOwn = _.assign = createAssigner(_.keys);\n\n // Returns the first key on an object that passes a predicate test\n _.findKey = function(obj, predicate, context) {\n predicate = cb(predicate, context);\n var keys = _.keys(obj), key;\n for (var i = 0, length = keys.length; i < length; i++) {\n key = keys[i];\n if (predicate(obj[key], key, obj)) return key;\n }\n };\n\n // Return a copy of the object only containing the whitelisted properties.\n _.pick = function(object, oiteratee, context) {\n var result = {}, obj = object, iteratee, keys;\n if (obj == null) return result;\n if (_.isFunction(oiteratee)) {\n keys = _.allKeys(obj);\n iteratee = optimizeCb(oiteratee, context);\n } else {\n keys = flatten(arguments, false, false, 1);\n iteratee = function(value, key, obj) { return key in obj; };\n obj = Object(obj);\n }\n for (var i = 0, length = keys.length; i < length; i++) {\n var key = keys[i];\n var value = obj[key];\n if (iteratee(value, key, obj)) result[key] = value;\n }\n return result;\n };\n\n // Return a copy of the object without the blacklisted properties.\n _.omit = function(obj, iteratee, context) {\n if (_.isFunction(iteratee)) {\n iteratee = _.negate(iteratee);\n } else {\n var keys = _.map(flatten(arguments, false, false, 1), String);\n iteratee = function(value, key) {\n return !_.contains(keys, key);\n };\n }\n return _.pick(obj, iteratee, context);\n };\n\n // Fill in a given object with default properties.\n _.defaults = createAssigner(_.allKeys, true);\n\n // Creates an object that inherits from the given prototype object.\n // If additional properties are provided then they will be added to the\n // created object.\n _.create = function(prototype, props) {\n var result = baseCreate(prototype);\n if (props) _.extendOwn(result, props);\n return result;\n };\n\n // Create a (shallow-cloned) duplicate of an object.\n _.clone = function(obj) {\n if (!_.isObject(obj)) return obj;\n return _.isArray(obj) ? obj.slice() : _.extend({}, obj);\n };\n\n // Invokes interceptor with the obj, and then returns obj.\n // The primary purpose of this method is to \"tap into\" a method chain, in\n // order to perform operations on intermediate results within the chain.\n _.tap = function(obj, interceptor) {\n interceptor(obj);\n return obj;\n };\n\n // Returns whether an object has a given set of `key:value` pairs.\n _.isMatch = function(object, attrs) {\n var keys = _.keys(attrs), length = keys.length;\n if (object == null) return !length;\n var obj = Object(object);\n for (var i = 0; i < length; i++) {\n var key = keys[i];\n if (attrs[key] !== obj[key] || !(key in obj)) return false;\n }\n return true;\n };\n\n\n // Internal recursive comparison function for `isEqual`.\n var eq = function(a, b, aStack, bStack) {\n // Identical objects are equal. `0 === -0`, but they aren't identical.\n // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).\n if (a === b) return a !== 0 || 1 / a === 1 / b;\n // A strict comparison is necessary because `null == undefined`.\n if (a == null || b == null) return a === b;\n // Unwrap any wrapped objects.\n if (a instanceof _) a = a._wrapped;\n if (b instanceof _) b = b._wrapped;\n // Compare `[[Class]]` names.\n var className = toString.call(a);\n if (className !== toString.call(b)) return false;\n switch (className) {\n // Strings, numbers, regular expressions, dates, and booleans are compared by value.\n case '[object RegExp]':\n // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')\n case '[object String]':\n // Primitives and their corresponding object wrappers are equivalent; thus, `\"5\"` is\n // equivalent to `new String(\"5\")`.\n return '' + a === '' + b;\n case '[object Number]':\n // `NaN`s are equivalent, but non-reflexive.\n // Object(NaN) is equivalent to NaN\n if (+a !== +a) return +b !== +b;\n // An `egal` comparison is performed for other numeric values.\n return +a === 0 ? 1 / +a === 1 / b : +a === +b;\n case '[object Date]':\n case '[object Boolean]':\n // Coerce dates and booleans to numeric primitive values. Dates are compared by their\n // millisecond representations. Note that invalid dates with millisecond representations\n // of `NaN` are not equivalent.\n return +a === +b;\n }\n\n var areArrays = className === '[object Array]';\n if (!areArrays) {\n if (typeof a != 'object' || typeof b != 'object') return false;\n\n // Objects with different constructors are not equivalent, but `Object`s or `Array`s\n // from different frames are.\n var aCtor = a.constructor, bCtor = b.constructor;\n if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor &&\n _.isFunction(bCtor) && bCtor instanceof bCtor)\n && ('constructor' in a && 'constructor' in b)) {\n return false;\n }\n }\n // Assume equality for cyclic structures. The algorithm for detecting cyclic\n // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.\n\n // Initializing stack of traversed objects.\n // It's done here since we only need them for objects and arrays comparison.\n aStack = aStack || [];\n bStack = bStack || [];\n var length = aStack.length;\n while (length--) {\n // Linear search. Performance is inversely proportional to the number of\n // unique nested structures.\n if (aStack[length] === a) return bStack[length] === b;\n }\n\n // Add the first object to the stack of traversed objects.\n aStack.push(a);\n bStack.push(b);\n\n // Recursively compare objects and arrays.\n if (areArrays) {\n // Compare array lengths to determine if a deep comparison is necessary.\n length = a.length;\n if (length !== b.length) return false;\n // Deep compare the contents, ignoring non-numeric properties.\n while (length--) {\n if (!eq(a[length], b[length], aStack, bStack)) return false;\n }\n } else {\n // Deep compare objects.\n var keys = _.keys(a), key;\n length = keys.length;\n // Ensure that both objects contain the same number of properties before comparing deep equality.\n if (_.keys(b).length !== length) return false;\n while (length--) {\n // Deep compare each member\n key = keys[length];\n if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;\n }\n }\n // Remove the first object from the stack of traversed objects.\n aStack.pop();\n bStack.pop();\n return true;\n };\n\n // Perform a deep comparison to check if two objects are equal.\n _.isEqual = function(a, b) {\n return eq(a, b);\n };\n\n // Is a given array, string, or object empty?\n // An \"empty\" object has no enumerable own-properties.\n _.isEmpty = function(obj) {\n if (obj == null) return true;\n if (isArrayLike(obj) && (_.isArray(obj) || _.isString(obj) || _.isArguments(obj))) return obj.length === 0;\n return _.keys(obj).length === 0;\n };\n\n // Is a given value a DOM element?\n _.isElement = function(obj) {\n return !!(obj && obj.nodeType === 1);\n };\n\n // Is a given value an array?\n // Delegates to ECMA5's native Array.isArray\n _.isArray = nativeIsArray || function(obj) {\n return toString.call(obj) === '[object Array]';\n };\n\n // Is a given variable an object?\n _.isObject = function(obj) {\n var type = typeof obj;\n return type === 'function' || type === 'object' && !!obj;\n };\n\n // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.\n _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {\n _['is' + name] = function(obj) {\n return toString.call(obj) === '[object ' + name + ']';\n };\n });\n\n // Define a fallback version of the method in browsers (ahem, IE < 9), where\n // there isn't any inspectable \"Arguments\" type.\n if (!_.isArguments(arguments)) {\n _.isArguments = function(obj) {\n return _.has(obj, 'callee');\n };\n }\n\n // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,\n // IE 11 (#1621), and in Safari 8 (#1929).\n if (typeof /./ != 'function' && typeof Int8Array != 'object') {\n _.isFunction = function(obj) {\n return typeof obj == 'function' || false;\n };\n }\n\n // Is a given object a finite number?\n _.isFinite = function(obj) {\n return isFinite(obj) && !isNaN(parseFloat(obj));\n };\n\n // Is the given value `NaN`? (NaN is the only number which does not equal itself).\n _.isNaN = function(obj) {\n return _.isNumber(obj) && obj !== +obj;\n };\n\n // Is a given value a boolean?\n _.isBoolean = function(obj) {\n return obj === true || obj === false || toString.call(obj) === '[object Boolean]';\n };\n\n // Is a given value equal to null?\n _.isNull = function(obj) {\n return obj === null;\n };\n\n // Is a given variable undefined?\n _.isUndefined = function(obj) {\n return obj === void 0;\n };\n\n // Shortcut function for checking if an object has a given property directly\n // on itself (in other words, not on a prototype).\n _.has = function(obj, key) {\n return obj != null && hasOwnProperty.call(obj, key);\n };\n\n // Utility Functions\n // -----------------\n\n // Run Underscore.js in *noConflict* mode, returning the `_` variable to its\n // previous owner. Returns a reference to the Underscore object.\n _.noConflict = function() {\n root._ = previousUnderscore;\n return this;\n };\n\n // Keep the identity function around for default iteratees.\n _.identity = function(value) {\n return value;\n };\n\n // Predicate-generating functions. Often useful outside of Underscore.\n _.constant = function(value) {\n return function() {\n return value;\n };\n };\n\n _.noop = function(){};\n\n _.property = property;\n\n // Generates a function for a given object that returns a given property.\n _.propertyOf = function(obj) {\n return obj == null ? function(){} : function(key) {\n return obj[key];\n };\n };\n\n // Returns a predicate for checking whether an object has a given set of\n // `key:value` pairs.\n _.matcher = _.matches = function(attrs) {\n attrs = _.extendOwn({}, attrs);\n return function(obj) {\n return _.isMatch(obj, attrs);\n };\n };\n\n // Run a function **n** times.\n _.times = function(n, iteratee, context) {\n var accum = Array(Math.max(0, n));\n iteratee = optimizeCb(iteratee, context, 1);\n for (var i = 0; i < n; i++) accum[i] = iteratee(i);\n return accum;\n };\n\n // Return a random integer between min and max (inclusive).\n _.random = function(min, max) {\n if (max == null) {\n max = min;\n min = 0;\n }\n return min + Math.floor(Math.random() * (max - min + 1));\n };\n\n // A (possibly faster) way to get the current timestamp as an integer.\n _.now = Date.now || function() {\n return new Date().getTime();\n };\n\n // List of HTML entities for escaping.\n var escapeMap = {\n '&': '&',\n '<': '<',\n '>': '>',\n '\"': '"',\n \"'\": ''',\n '`': '`'\n };\n var unescapeMap = _.invert(escapeMap);\n\n // Functions for escaping and unescaping strings to/from HTML interpolation.\n var createEscaper = function(map) {\n var escaper = function(match) {\n return map[match];\n };\n // Regexes for identifying a key that needs to be escaped\n var source = '(?:' + _.keys(map).join('|') + ')';\n var testRegexp = RegExp(source);\n var replaceRegexp = RegExp(source, 'g');\n return function(string) {\n string = string == null ? '' : '' + string;\n return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;\n };\n };\n _.escape = createEscaper(escapeMap);\n _.unescape = createEscaper(unescapeMap);\n\n // If the value of the named `property` is a function then invoke it with the\n // `object` as context; otherwise, return it.\n _.result = function(object, property, fallback) {\n var value = object == null ? void 0 : object[property];\n if (value === void 0) {\n value = fallback;\n }\n return _.isFunction(value) ? value.call(object) : value;\n };\n\n // Generate a unique integer id (unique within the entire client session).\n // Useful for temporary DOM ids.\n var idCounter = 0;\n _.uniqueId = function(prefix) {\n var id = ++idCounter + '';\n return prefix ? prefix + id : id;\n };\n\n // By default, Underscore uses ERB-style template delimiters, change the\n // following template settings to use alternative delimiters.\n _.templateSettings = {\n evaluate : /<%([\\s\\S]+?)%>/g,\n interpolate : /<%=([\\s\\S]+?)%>/g,\n escape : /<%-([\\s\\S]+?)%>/g\n };\n\n // When customizing `templateSettings`, if you don't want to define an\n // interpolation, evaluation or escaping regex, we need one that is\n // guaranteed not to match.\n var noMatch = /(.)^/;\n\n // Certain characters need to be escaped so that they can be put into a\n // string literal.\n var escapes = {\n \"'\": \"'\",\n '\\\\': '\\\\',\n '\\r': 'r',\n '\\n': 'n',\n '\\u2028': 'u2028',\n '\\u2029': 'u2029'\n };\n\n var escaper = /\\\\|'|\\r|\\n|\\u2028|\\u2029/g;\n\n var escapeChar = function(match) {\n return '\\\\' + escapes[match];\n };\n\n // JavaScript micro-templating, similar to John Resig's implementation.\n // Underscore templating handles arbitrary delimiters, preserves whitespace,\n // and correctly escapes quotes within interpolated code.\n // NB: `oldSettings` only exists for backwards compatibility.\n _.template = function(text, settings, oldSettings) {\n if (!settings && oldSettings) settings = oldSettings;\n settings = _.defaults({}, settings, _.templateSettings);\n\n // Combine delimiters into one regular expression via alternation.\n var matcher = RegExp([\n (settings.escape || noMatch).source,\n (settings.interpolate || noMatch).source,\n (settings.evaluate || noMatch).source\n ].join('|') + '|$', 'g');\n\n // Compile the template source, escaping string literals appropriately.\n var index = 0;\n var source = \"__p+='\";\n text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {\n source += text.slice(index, offset).replace(escaper, escapeChar);\n index = offset + match.length;\n\n if (escape) {\n source += \"'+\\n((__t=(\" + escape + \"))==null?'':_.escape(__t))+\\n'\";\n } else if (interpolate) {\n source += \"'+\\n((__t=(\" + interpolate + \"))==null?'':__t)+\\n'\";\n } else if (evaluate) {\n source += \"';\\n\" + evaluate + \"\\n__p+='\";\n }\n\n // Adobe VMs need the match returned to produce the correct offest.\n return match;\n });\n source += \"';\\n\";\n\n // If a variable is not specified, place data values in local scope.\n if (!settings.variable) source = 'with(obj||{}){\\n' + source + '}\\n';\n\n source = \"var __t,__p='',__j=Array.prototype.join,\" +\n \"print=function(){__p+=__j.call(arguments,'');};\\n\" +\n source + 'return __p;\\n';\n\n try {\n var render = new Function(settings.variable || 'obj', '_', source);\n } catch (e) {\n e.source = source;\n throw e;\n }\n\n var template = function(data) {\n return render.call(this, data, _);\n };\n\n // Provide the compiled source as a convenience for precompilation.\n var argument = settings.variable || 'obj';\n template.source = 'function(' + argument + '){\\n' + source + '}';\n\n return template;\n };\n\n // Add a \"chain\" function. Start chaining a wrapped Underscore object.\n _.chain = function(obj) {\n var instance = _(obj);\n instance._chain = true;\n return instance;\n };\n\n // OOP\n // ---------------\n // If Underscore is called as a function, it returns a wrapped object that\n // can be used OO-style. This wrapper holds altered versions of all the\n // underscore functions. Wrapped objects may be chained.\n\n // Helper function to continue chaining intermediate results.\n var result = function(instance, obj) {\n return instance._chain ? _(obj).chain() : obj;\n };\n\n // Add your own custom functions to the Underscore object.\n _.mixin = function(obj) {\n _.each(_.functions(obj), function(name) {\n var func = _[name] = obj[name];\n _.prototype[name] = function() {\n var args = [this._wrapped];\n push.apply(args, arguments);\n return result(this, func.apply(_, args));\n };\n });\n };\n\n // Add all of the Underscore functions to the wrapper object.\n _.mixin(_);\n\n // Add all mutator Array functions to the wrapper.\n _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n var obj = this._wrapped;\n method.apply(obj, arguments);\n if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];\n return result(this, obj);\n };\n });\n\n // Add all accessor Array functions to the wrapper.\n _.each(['concat', 'join', 'slice'], function(name) {\n var method = ArrayProto[name];\n _.prototype[name] = function() {\n return result(this, method.apply(this._wrapped, arguments));\n };\n });\n\n // Extracts the result from a wrapped and chained object.\n _.prototype.value = function() {\n return this._wrapped;\n };\n\n // Provide unwrapping proxy for some methods used in engine operations\n // such as arithmetic and JSON stringification.\n _.prototype.valueOf = _.prototype.toJSON = _.prototype.value;\n\n _.prototype.toString = function() {\n return '' + this._wrapped;\n };\n\n // AMD registration happens at the end for compatibility with AMD loaders\n // that may not enforce next-turn semantics on modules. Even though general\n // practice for AMD registration is to be anonymous, underscore registers\n // as a named module because, like jQuery, it is a base library that is\n // popular enough to be bundled in a third party lib, but not be part of\n // an AMD load request. Those cases could generate an error when an\n // anonymous define() is called outside of a loader request.\n if (typeof define === 'function' && define.amd) {\n define('underscore', [], function() {\n return _;\n });\n }\n}.call(this));\n\n},{}],26:[function(require,module,exports){\narguments[4][19][0].apply(exports,arguments)\n},{\"dup\":19}],27:[function(require,module,exports){\nmodule.exports = function isBuffer(arg) {\n return arg && typeof arg === 'object'\n && typeof arg.copy === 'function'\n && typeof arg.fill === 'function'\n && typeof arg.readUInt8 === 'function';\n}\n},{}],28:[function(require,module,exports){\n(function (process,global){\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n if (!isString(f)) {\n var objects = [];\n for (var i = 0; i < arguments.length; i++) {\n objects.push(inspect(arguments[i]));\n }\n return objects.join(' ');\n }\n\n var i = 1;\n var args = arguments;\n var len = args.length;\n var str = String(f).replace(formatRegExp, function(x) {\n if (x === '%%') return '%';\n if (i >= len) return x;\n switch (x) {\n case '%s': return String(args[i++]);\n case '%d': return Number(args[i++]);\n case '%j':\n try {\n return JSON.stringify(args[i++]);\n } catch (_) {\n return '[Circular]';\n }\n default:\n return x;\n }\n });\n for (var x = args[i]; i < len; x = args[++i]) {\n if (isNull(x) || !isObject(x)) {\n str += ' ' + x;\n } else {\n str += ' ' + inspect(x);\n }\n }\n return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n // Allow for deprecating things in the process of starting up.\n if (isUndefined(global.process)) {\n return function() {\n return exports.deprecate(fn, msg).apply(this, arguments);\n };\n }\n\n if (process.noDeprecation === true) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (process.throwDeprecation) {\n throw new Error(msg);\n } else if (process.traceDeprecation) {\n console.trace(msg);\n } else {\n console.error(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnviron;\nexports.debuglog = function(set) {\n if (isUndefined(debugEnviron))\n debugEnviron = process.env.NODE_DEBUG || '';\n set = set.toUpperCase();\n if (!debugs[set]) {\n if (new RegExp('\\\\b' + set + '\\\\b', 'i').test(debugEnviron)) {\n var pid = process.pid;\n debugs[set] = function() {\n var msg = exports.format.apply(exports, arguments);\n console.error('%s %d: %s', set, pid, msg);\n };\n } else {\n debugs[set] = function() {};\n }\n }\n return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n // default options\n var ctx = {\n seen: [],\n stylize: stylizeNoColor\n };\n // legacy...\n if (arguments.length >= 3) ctx.depth = arguments[2];\n if (arguments.length >= 4) ctx.colors = arguments[3];\n if (isBoolean(opts)) {\n // legacy...\n ctx.showHidden = opts;\n } else if (opts) {\n // got an \"options\" object\n exports._extend(ctx, opts);\n }\n // set default options\n if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n if (isUndefined(ctx.depth)) ctx.depth = 2;\n if (isUndefined(ctx.colors)) ctx.colors = false;\n if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n if (ctx.colors) ctx.stylize = stylizeWithColor;\n return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n 'bold' : [1, 22],\n 'italic' : [3, 23],\n 'underline' : [4, 24],\n 'inverse' : [7, 27],\n 'white' : [37, 39],\n 'grey' : [90, 39],\n 'black' : [30, 39],\n 'blue' : [34, 39],\n 'cyan' : [36, 39],\n 'green' : [32, 39],\n 'magenta' : [35, 39],\n 'red' : [31, 39],\n 'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n 'special': 'cyan',\n 'number': 'yellow',\n 'boolean': 'yellow',\n 'undefined': 'grey',\n 'null': 'bold',\n 'string': 'green',\n 'date': 'magenta',\n // \"name\": intentionally not styling\n 'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n var style = inspect.styles[styleType];\n\n if (style) {\n return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n '\\u001b[' + inspect.colors[style][1] + 'm';\n } else {\n return str;\n }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n return str;\n}\n\n\nfunction arrayToHash(array) {\n var hash = {};\n\n array.forEach(function(val, idx) {\n hash[val] = true;\n });\n\n return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n // Provide a hook for user-specified inspect functions.\n // Check that value is an object with an inspect function on it\n if (ctx.customInspect &&\n value &&\n isFunction(value.inspect) &&\n // Filter out the util module, it's inspect function is special\n value.inspect !== exports.inspect &&\n // Also filter out any prototype objects using the circular check.\n !(value.constructor && value.constructor.prototype === value)) {\n var ret = value.inspect(recurseTimes, ctx);\n if (!isString(ret)) {\n ret = formatValue(ctx, ret, recurseTimes);\n }\n return ret;\n }\n\n // Primitive types cannot have properties\n var primitive = formatPrimitive(ctx, value);\n if (primitive) {\n return primitive;\n }\n\n // Look up the keys of the object.\n var keys = Object.keys(value);\n var visibleKeys = arrayToHash(keys);\n\n if (ctx.showHidden) {\n keys = Object.getOwnPropertyNames(value);\n }\n\n // IE doesn't make error fields non-enumerable\n // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n if (isError(value)\n && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n return formatError(value);\n }\n\n // Some type of object without properties can be shortcutted.\n if (keys.length === 0) {\n if (isFunction(value)) {\n var name = value.name ? ': ' + value.name : '';\n return ctx.stylize('[Function' + name + ']', 'special');\n }\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n }\n if (isDate(value)) {\n return ctx.stylize(Date.prototype.toString.call(value), 'date');\n }\n if (isError(value)) {\n return formatError(value);\n }\n }\n\n var base = '', array = false, braces = ['{', '}'];\n\n // Make Array say that they are Array\n if (isArray(value)) {\n array = true;\n braces = ['[', ']'];\n }\n\n // Make functions say that they are functions\n if (isFunction(value)) {\n var n = value.name ? ': ' + value.name : '';\n base = ' [Function' + n + ']';\n }\n\n // Make RegExps say that they are RegExps\n if (isRegExp(value)) {\n base = ' ' + RegExp.prototype.toString.call(value);\n }\n\n // Make dates with properties first say the date\n if (isDate(value)) {\n base = ' ' + Date.prototype.toUTCString.call(value);\n }\n\n // Make error with message first say the error\n if (isError(value)) {\n base = ' ' + formatError(value);\n }\n\n if (keys.length === 0 && (!array || value.length == 0)) {\n return braces[0] + base + braces[1];\n }\n\n if (recurseTimes < 0) {\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n } else {\n return ctx.stylize('[Object]', 'special');\n }\n }\n\n ctx.seen.push(value);\n\n var output;\n if (array) {\n output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n } else {\n output = keys.map(function(key) {\n return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n });\n }\n\n ctx.seen.pop();\n\n return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n if (isUndefined(value))\n return ctx.stylize('undefined', 'undefined');\n if (isString(value)) {\n var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"') + '\\'';\n return ctx.stylize(simple, 'string');\n }\n if (isNumber(value))\n return ctx.stylize('' + value, 'number');\n if (isBoolean(value))\n return ctx.stylize('' + value, 'boolean');\n // For some reason typeof null is \"object\", so special case here.\n if (isNull(value))\n return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n var output = [];\n for (var i = 0, l = value.length; i < l; ++i) {\n if (hasOwnProperty(value, String(i))) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n String(i), true));\n } else {\n output.push('');\n }\n }\n keys.forEach(function(key) {\n if (!key.match(/^\\d+$/)) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n key, true));\n }\n });\n return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n var name, str, desc;\n desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n if (desc.get) {\n if (desc.set) {\n str = ctx.stylize('[Getter/Setter]', 'special');\n } else {\n str = ctx.stylize('[Getter]', 'special');\n }\n } else {\n if (desc.set) {\n str = ctx.stylize('[Setter]', 'special');\n }\n }\n if (!hasOwnProperty(visibleKeys, key)) {\n name = '[' + key + ']';\n }\n if (!str) {\n if (ctx.seen.indexOf(desc.value) < 0) {\n if (isNull(recurseTimes)) {\n str = formatValue(ctx, desc.value, null);\n } else {\n str = formatValue(ctx, desc.value, recurseTimes - 1);\n }\n if (str.indexOf('\\n') > -1) {\n if (array) {\n str = str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n').substr(2);\n } else {\n str = '\\n' + str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n');\n }\n }\n } else {\n str = ctx.stylize('[Circular]', 'special');\n }\n }\n if (isUndefined(name)) {\n if (array && key.match(/^\\d+$/)) {\n return str;\n }\n name = JSON.stringify('' + key);\n if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n name = name.substr(1, name.length - 2);\n name = ctx.stylize(name, 'name');\n } else {\n name = name.replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n name = ctx.stylize(name, 'string');\n }\n }\n\n return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n var numLinesEst = 0;\n var length = output.reduce(function(prev, cur) {\n numLinesEst++;\n if (cur.indexOf('\\n') >= 0) numLinesEst++;\n return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n }, 0);\n\n if (length > 60) {\n return braces[0] +\n (base === '' ? '' : base + '\\n ') +\n ' ' +\n output.join(',\\n ') +\n ' ' +\n braces[1];\n }\n\n return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nfunction isArray(ar) {\n return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\n\nfunction isError(e) {\n return isObject(e) &&\n (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n 'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n var d = new Date();\n var time = [pad(d.getHours()),\n pad(d.getMinutes()),\n pad(d.getSeconds())].join(':');\n return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n * prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n // Don't do anything if add isn't an object\n if (!add || !isObject(add)) return origin;\n\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\n}).call(this,require('_process'),typeof global !== \"undefined\" ? global : typeof self !== \"undefined\" ? self : typeof window !== \"undefined\" ? window : {})\n},{\"./support/isBuffer\":27,\"_process\":24,\"inherits\":26}],29:[function(require,module,exports){\n// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n\n},{}]},{},[7])(7)\n});"
},
{
"path": "site/book/index.html",
"content": "\n \n 100 Go Mistakes and How to Avoid Them - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n \n\n\n\n \n \n\n\n100 Go Mistakes and How to Avoid Them \n
\nDescription \nIf you're a Go developer looking to improve your skills, the 100 Go Mistakes and How to Avoid Them book is for you. With a focus on practical examples, this book covers a wide range of topics from concurrency and error handling to testing and code organization. You'll learn to write more idiomatic, efficient, and maintainable code and become a proficient Go developer.
\nRead a summary of the 100 mistakes or the first chapter .
\nQuotes and Ratings \n\n
Krystian (Goodreads user)
\n
This is an exceptional book . Usually, if a book contains either high-quality explanations or is written succinctly, I consider myself lucky to have found it. This one combines these two characteristics, which is super rare . It's another Go book for me and I still had quite a lot of \"a-ha!\" moments while reading it, and all of that without the unnecessary fluff, just straight to the point.
\n
\n
Akash Chetty
\n
The book is completely exceptional , especially the examples carved out for each topic are really great. There is one topic that I struggled to understand is Concurrency but the way it is explained in this book is truly an art of genius.
\n
\n
Neeraj Shah
\n
This should be the required reading for all Golang developers before they touch code in Production ... It's the Golang equivalent of the legendary 'Effective Java' by Joshua Bloch.
\n
\n
Anupam Sengupta
\n
Not having this will be the 101st mistake a Go programmer could make.
\n
\n
\nManning, Goodreads, and Amazon reviews: 4.7/5 avg rating \n \nWhere to Buy? \n\n\n100 Go Mistakes and How to Avoid Them (đŹđ§ edition: paper, digital, or audiobook)
\n\n \n\nGoč¨čŞ100Tips éçşč
ăŤăăăăĄăŞééăă¸ăŽĺŻžĺŚćł (đŻđľ edition: paper or digital)
\n\n \n\n100个GočŻč¨ĺ
¸ĺé误 (đ¨đł edition: paper or digital)
\n\n \n\nGo 100ę°ě§ ě¤ě í¨í´ęłź ě루ě
(đ°đˇ edition: paper or digital)
\n\n \n \n\n
\nCovers (English, Japanese, Chinese, and Korean) \n \nAbout the Author \nTeiva Harsanyi is a senior software engineer at Google. He has worked in various domains, including insurance, transportation, and safety-critical industries like air traffic management. He is passionate about Go and how to design and implement reliable systems.
\n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n \n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
Read the First Chapter - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n \n\n\n\n \n \n\n\nGo: Simple to learn but hard to master \nThis chapter covers
\n\nWhat makes Go an efficient, scalable, and productive language \nExploring why Go is simple to learn but hard to master \nPresenting the common types of mistakes made by developers \n \nMaking mistakes is part of everyoneâs life. As Albert Einstein once said,
\n\n
Albert Einstein
\n
A person who never made a mistake never tried anything new.
\n
What matters in the end isnât the number of mistakes we make, but our capacity to learn from them. This assertion also applies to programming. The seniority we acquire in a language isnât a magical process; it involves making many mistakes and learning from them. The purpose of this book is centered around this idea. It will help you, the reader, become a more proficient Go developer by looking at and learning from 100 common mistakes people make in many areas of the language.
\nThis chapter presents a quick refresher as to why Go has become mainstream over the years. Weâll discuss why, despite Go being considered simple to learn, mastering its nuances can be challenging. Finally, weâll introduce the concepts this book covers.
\nGo outline \nIf you are reading this book, itâs likely that youâre already sold on Go. Therefore, this section provides a brief reminder about what makes Go such a powerful language.
\nSoftware engineering has evolved considerably during the past decades. Most modern systems are no longer written by a single person but by teams consisting of multiple programmersâsometimes even hundreds, if not thousands. Nowadays, code must be readable, expressive, and maintainable to guarantee a systemâs durability over the years. Meanwhile, in our fast-moving world, maximizing agility and reducing the time to market is critical for most organizations. Programming should also follow this trend, and companies strive to ensure that software engineers are as productive as possible when reading, writing, and maintaining code.
\nIn response to these challenges, Google created the Go programming language in 2007. Since then, many organizations have adopted the language to support various use cases: APIs, automation, databases, CLIs (command-line interfaces), and so on. Many today consider Go the language of the cloud.
\nFeature-wise, Go has no type inheritance, no exceptions, no macros, no partial functions, no support for lazy variable evaluation or immutability, no operator overloading, no pattern matching, and on and on. Why are these features missing from the language? The official Go FAQ gives us some insight:
\n\n
Go FAQ
\n
Why does Go not have feature X? Your favorite feature may be missing because it doesnât fit, because it affects compilation speed or clarity of design, or because it would make the fundamental system model too difficult.
\n
Judging the quality of a programming language via its number of features is probably not an accurate metric. At least, itâs not an objective of Go. Instead, Go utilizes a few essential characteristics when adopting a language at scale for an organization. These include the following:
\n\nStability âEven though Go receives frequent updates (including improvements and security patches), it remains a stable language. Some may even consider this one of the best features of the language.Expressivity âWe can define expressivity in a programming language by how naturally and intuitively we can write and read code. A reduced number of keywords and limited ways to solve common problems make Go an expressive language for large codebases.Compilation âAs developers, what can be more exasperating than having to wait for a build to test our application? Targeting fast compilation times has always been a conscious goal for the language designers. This, in turn, enables productivity.Safety âGo is a strong, statically typed language. Hence, it has strict compiletime rules, which ensure the code is type-safe in most cases. \nGo was built from the ground up with solid features such as outstanding concurrency primitives with goroutines and channels. Thereâs not a strong need to rely on external libraries to build efficient concurrent applications. Observing how important concurrency is these days also demonstrates why Go is such a suitable language for the present and probably for the foreseeable future.
\nSome also consider Go a simple language. And, in a sense, this isnât necessarily wrong. For example, a newcomer can learn the languageâs main features in less than a day. So why read a book centered on the concept of mistakes if Go is simple?
\nSimple doesnât mean easy \nThere is a subtle difference between simple and easy. Simple , applied to a technology, means not complicated to learn or understand. However, easy means that we can achieve anything without much effort. Go is simple to learn but not necessarily easy to master.
\nLetâs take concurrency, for example. In 2019, a study focusing on concurrency bugs was published: Understanding Real-World Concurrency Bugs in Go . This study was the first systematic analysis of concurrency bugs. It focused on multiple popular Go repositories such as Docker, gRPC, and Kubernetes. One of the most important takeaways from this study is that most of the blocking bugs are caused by inaccurate use of the message-passing paradigm via channels, despite the belief that message passing is easier to handle and less error-prone than sharing memory.
\nWhat should be an appropriate reaction to such a takeaway? Should we consider that the language designers were wrong about message passing? Should we reconsider how we deal with concurrency in our project? Of course not.
\nItâs not a question of confronting message passing versus sharing memory and determining the winner. However, itâs up to us as Go developers to thoroughly understand how to use concurrency, its implications on modern processors, when to favor one approach over the other, and how to avoid common traps. This example highlights that although a concept such as channels and goroutines can be simple to learn, it isnât an easy topic in practice.
\nThis leitmotifâsimple doesnât mean easyâcan be generalized to many aspects of Go, not only concurrency. Hence, to be proficient Go developers, we must have a thorough understanding of many aspects of the language, which requires time, effort, and mistakes.
\nThis book aims to help accelerate our journey toward proficiency by delving into 100 Go mistakes.
\n100 Go mistakes \nWhy should we read a book about common Go mistakes? Why not deepen our knowledge with an ordinary book that would dig into different topics?
\nIn a 2011 article, neuroscientists proved that the best time for brain growth is when weâre facing mistakes.
\nTo strengthen this facilitative effect, this book accompanies each mistake as much as possible with real-world examples. This book isnât only about theory; it also helps us get better at avoiding mistakes and making more well-informed, conscious decisions because we now understand the rationale behind them.
\n\n
Unknown
\n
Tell me and I forget. Teach me and I remember. Involve me and I learn.
\n
This book presents seven main categories of mistakes. Overall, the mistakes can be classified as
\n\nBugs \nNeedless complexity \nWeaker readability \nSuboptimal or unidiomatic organization \nLack of API convenience \nUnder-optimized code \nLack of productivity \n \nWe introduce each mistake category next.
\nBugs \nThe first type of mistake and probably the most obvious is software bugs. In 2020, a study conducted by Synopsys estimated the cost of software bugs in the U.S. alone to be over $2 trillion.
\nFurthermore, bugs can also lead to tragic impacts. We can, for example, mention cases such as Therac-25, a radiation therapy machine produced by Atomic Energy of Canada Limited (AECL). Because of a race condition, the machine gave its patients radiation doses that were hundreds of times greater than expected, leading to the death of three patients. Hence, software bugs arenât only about money. As developers, we should remember how impactful our jobs are.
\nThis book covers plenty of cases that could lead to various software bugs, including data races, leaks, logic errors, and other defects. Although accurate tests should be a way to discover such bugs as early as possible, we may sometimes miss cases because of different factors such as time constraints or complexity. Therefore, as a Go developer, itâs essential to make sure we avoid common bugs.
\nNeedless complexity \nThe next category of mistakes is related to unnecessary complexity. A significant part of software complexity comes from the fact that, as developers, we strive to think about imaginary futures. Instead of solving concrete problems right now, it can be tempting to build evolutionary software that could tackle whatever future use case arises. However, this leads to more drawbacks than benefits in most cases because it can make a codebase more complex to understand and reason about.
\nGetting back to Go, we can think of plenty of use cases where developers might be tempted to design abstractions for future needs, such as interfaces or generics. This book discusses topics where we should remain careful not to harm a codebase with needless complexity.
\nWeaker readability \nAnother kind of mistake is to weaken readability. As Robert C. Martin wrote in his book Clean Code: A Handbook of Agile Software Craftsmanship , the ratio of time spent reading versus writing is well over 10 to 1. Most of us started to program on solo projects where readability wasnât that important. However, todayâs software engineering is programming with a time dimension: making sure we can still work with and maintain an application months, years, or perhaps even decades later.
\nWhen programming in Go, we can make many mistakes that can harm readability. These mistakes may include nested code, data type representations, or not using named result parameters in some cases. Throughout this book, we will learn how to write readable code and care for future readers (including our future selves).
\nSuboptimal or unidiomatic organization \nBe it while working on a new project or because we acquire inaccurate reflexes, another type of mistake is organizing our code and a project suboptimally and unidiomatically. Such issues can make a project harder to reason about and maintain. This book covers some of these common mistakes in Go. For example, weâll look at how to structure a project and deal with utility packages or init functions. All in all, looking at these mistakes should help us organize our code and projects more efficiently and idiomatically.
\nLack of API convenience \nMaking common mistakes that weaken how convenient an API is for our clients is another type of mistake. If an API isnât user-friendly, it will be less expressive and, hence, harder to understand and more error-prone.
\nWe can think about many situations such as overusing any types, using the wrong creational pattern to deal with options, or blindly applying standard practices from object-oriented programming that affect the usability of our APIs. This book covers common mistakes that prevent us from exposing convenient APIs for our users.
\nUnder-optimized code \nUnder-optimized code is another type of mistake made by developers. It can happen for various reasons, such as not understanding language features or even a lack of fundamental knowledge. Performance is one of the most obvious impacts of this mistake, but not the only one.
\nWe can think about optimizing code for other goals, such as accuracy. For example, this book provides some common techniques to ensure that floating-point operations are accurate. Meanwhile, we will cover plenty of cases that can negatively impact performance code because of poorly parallelized executions, not knowing how to reduce allocations, or the impacts of data alignment, for example. We will tackle optimization via different prisms.
\nLack of productivity \nIn most cases, whatâs the best language we can choose when working on a new project? The one weâre the most productive with. Being comfortable with how a language works and exploiting it to get the best out of it is crucial to reach proficiency.
\nIn this book, we will cover many cases and concrete examples that will help us to be more productive while working in Go. For instance, weâll look at writing efficient tests to ensure that our code works, relying on the standard library to be more effective, and getting the best out of the profiling tools and linters. Now, itâs time to delve into those 100 common Go mistakes.
\nSummary \n\nGo is a modern programming language that enables developer productivity, which is crucial for most companies today. \nGo is simple to learn but not easy to master. This is why we need to deepen our knowledge to make the most effective use of the language. \nLearning via mistakes and concrete examples is a powerful way to be proficient in a language. This book will accelerate our path to proficiency by exploring 100 common mistakes. \n \n\n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n \n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
External Resources - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n\n\n \n \n\n\nExternal Resources \nEnglish \nThe Best Golang Book | Prime Reacts \nVIDEO \n\nBook Review: 100 Go Mistakes (And How to Avoid Them) \nVIDEO \n\nPost
\nThe Most Useful Book for a Go Programmer? \nVIDEO \n\nHow to make mistakes in Go - Go Time #190 \nVIDEO \n\n\nGo is AMAZING \nVIDEO \n\n8LU - 100% Test Coverage \nVIDEO \n\nSome Tips I learned from 100 Mistakes in Go \nPost
\nWhat can be summarized from 100 Go Mistakes? \nPost
\nBook review: 100 Go Mistakes and How to Avoid Them \nPost
\nChinese \n桹庌é
话äšă100 Go Mistakes and How to Avoid Them \nPost
\n100 Go Mistakes é莰 \nPost
\nć为äťäšćžĺźGočŻč¨ďź \nPost
\nJapanese \nćčżčŞăă Goč¨čŞăŽćŹăŽç´šäťďź100 Go Mistakes and How to Avoid Them \nPost
\nă100 Go Mistakes and How to Avoid ThemăăčŞă \nPost
\nPortuguese \nUm ĂTIMO livro para programadores Go \nVIDEO \n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
Common Go Mistakes - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n\n\n \n \n\n\nCommon Go Mistakes \n\nThe Coder Cafe \nIf you enjoyed my book, you may be interested in my latest project: The Coder Cafe , a newsletter for coders.
\n\nFeeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve timeless concepts with your coffee. Written by a Google SWE and published author, we help you grow as an engineer, one coffee at a time.
\n \n
\n \nThis page is a summary of the mistakes in the 100 Go Mistakes and How to Avoid Them book . Meanwhile, it's also open to the community. If you believe that a common Go mistake should be added, please create an issue .
\n
\n\nBeta \nYou're viewing a beta version enriched with significantly more content. However, this version is not yet complete, and I'm looking for volunteers to help me summarize the remaining mistakes (GitHub issue #43 ).
\nProgress:\n
\n \nCode and Project Organization \nUnintended variable shadowing (#1) \n\nTL;DR \nAvoiding shadowed variables can help prevent mistakes like referencing the wrong variable or confusing readers.
\n \nVariable shadowing occurs when a variable name is redeclared in an inner block, but this practice is prone to mistakes. Imposing a rule to forbid shadowed variables depends on personal taste. For example, sometimes it can be convenient to reuse an existing variable name like err for errors. Yet, in general, we should remain cautious because we now know that we can face a scenario where the code compiles, but the variable that receives the value is not the one expected.
\n
\nUnnecessary nested code (#2) \n\nTL;DR \nAvoiding nested levels and keeping the happy path aligned on the left makes building a mental code model easier.
\n \nIn general, the more nested levels a function requires, the more complex it is to read and understand. Letâs see some different applications of this rule to optimize our code for readability:
\n\nWhen an if block returns, we should omit the else block in all cases. For example, we shouldnât write: \n \nif foo () { \n // ... \n return true \n} else { \n // ... \n} \nInstead, we omit the else block like this:
\nif foo () { \n // ... \n return true \n} \n// ... \n\nWe can also follow this logic with a non-happy path: \n \nif s != \"\" { \n // ... \n} else { \n return errors . New ( \"empty string\" ) \n} \nHere, an empty s represents the non-happy path. Hence, we should flip the\n condition like so:
\nif s == \"\" { \n return errors . New ( \"empty string\" ) \n} \n// ... \nWriting readable code is an important challenge for every developer. Striving to reduce the number of nested blocks, aligning the happy path on the left, and returning as early as possible are concrete means to improve our codeâs readability.
\n
\nMisusing init functions (#3) \n\nTL;DR \nWhen initializing variables, remember that init functions have limited error handling and make state handling and testing more complex. In most cases, initializations should be handled as specific functions.
\n \nAn init function is a function used to initialize the state of an application. It takes no arguments and returns no result (a func() function). When a package is initialized, all the constant and variable declarations in the package are evaluated. Then, the init functions are executed.
\nInit functions can lead to some issues:
\n\nThey can limit error management. \nThey can complicate how to implement tests (for example, an external dependency must be set up, which may not be necessary for the scope of unit tests). \nIf the initialization requires us to set a state, that has to be done through global variables. \n \nWe should be cautious with init functions. They can be helpful in some situations, however, such as defining static configuration. Otherwise, and in most cases, we should handle initializations through ad hoc functions.
\n
\nOverusing getters and setters (#4) \n\nTL;DR \nForcing the use of getters and setters isnât idiomatic in Go. Being pragmatic and finding the right balance between efficiency and blindly following certain idioms should be the way to go.
\n \nData encapsulation refers to hiding the values or state of an object. Getters and setters are means to enable encapsulation by providing exported methods on top of unexported object fields.
\nIn Go, there is no automatic support for getters and setters as we see in some languages. It is also considered neither mandatory nor idiomatic to use getters and setters to access struct fields. We shouldnât overwhelm our code with getters and setters on structs if they donât bring any value. We should be pragmatic and strive to find the right balance between efficiency and following idioms that are sometimes considered indisputable in other programming paradigms.
\nRemember that Go is a unique language designed for many characteristics, including simplicity. However, if we find a need for getters and setters or, as mentioned, foresee a future need while guaranteeing forward compatibility, thereâs nothing wrong with using them.
\nInterface pollution (#5) \n\nTL;DR \nAbstractions should be discovered, not created. To prevent unnecessary complexity, create an interface when you need it and not when you foresee needing it, or if you can at least prove the abstraction to be a valid one.
\n \nRead the full section here .
\n
\nInterface on the producer side (#6) \n\nTL;DR \nKeeping interfaces on the client side avoids unnecessary abstractions.
\n \nInterfaces are satisfied implicitly in Go, which tends to be a gamechanger compared to languages with an explicit implementation. In most cases, the approach to follow is similar to what we described in the previous section: abstractions should be discovered, not created . This means that itâs not up to the producer to force a given abstraction for all the clients. Instead, itâs up to the client to decide whether it needs some form of abstraction and then determine the best abstraction level for its needs.
\nAn interface should live on the consumer side in most cases. However, in particular contexts (for example, when we knowânot foreseeâthat an abstraction will be helpful for consumers), we may want to have it on the producer side. If we do, we should strive to keep it as minimal as possible, increasing its reusability potential and making it more easily composable.
\n
\nReturning interfaces (#7) \n\nTL;DR \nTo prevent being restricted in terms of flexibility, a function shouldnât return interfaces but concrete implementations in most cases. Conversely, a function should accept interfaces whenever possible.
\n \nIn most cases, we shouldnât return interfaces but concrete implementations. Otherwise, it can make our design more complex due to package dependencies and can restrict flexibility because all the clients would have to rely on the same abstraction. Again, the conclusion is similar to the previous sections: if we know (not foresee) that an abstraction will be helpful for clients, we can consider returning an interface. Otherwise, we shouldnât force abstractions; they should be discovered by clients. If a client needs to abstract an implementation for whatever reason, it can still do that on the clientâs side.
\nany says nothing (#8)\nTL;DR \nOnly use any if you need to accept or return any possible type, such as json.Marshal. Otherwise, any doesnât provide meaningful information and can lead to compile-time issues by allowing a caller to call methods with any data type.
\n \nThe any type can be helpful if there is a genuine need for accepting or returning any possible type (for instance, when it comes to marshaling or formatting). In general, we should avoid overgeneralizing the code we write at all costs. Perhaps a little bit of duplicated code might occasionally be better if it improves other aspects such as code expressiveness.
\n
\nBeing confused about when to use generics (#9) \n\nTL;DR \nRelying on generics and type parameters can prevent writing boilerplate code to factor out elements or behaviors. However, do not use type parameters prematurely, but only when you see a concrete need for them. Otherwise, they introduce unnecessary abstractions and complexity.
\n \nRead the full section here .
\n
\nNot being aware of the possible problems with type embedding (#10) \n\nTL;DR \nUsing type embedding can also help avoid boilerplate code; however, ensure that doing so doesnât lead to visibility issues where some fields should have remained hidden.
\n \nWhen creating a struct, Go offers the option to embed types. But this can sometimes lead to unexpected behaviors if we donât understand all the implications of type embedding. Throughout this section, we look at how to embed types, what these bring, and the possible issues.
\nIn Go, a struct field is called embedded if itâs declared without a name. For example,
\ntype Foo struct { \n Bar // Embedded field \n} \ntype Bar struct { \n Baz int \n} \nIn the Foo struct, the Bar type is declared without an associated name; hence, itâs an embedded field.
\nWe use embedding to promote the fields and methods of an embedded type. Because Bar contains a Baz field, this field is\npromoted to Foo. Therefore, Baz becomes available from Foo.
\nWhat can we say about type embedding? First, letâs note that itâs rarely a necessity, and it means that whatever the use case, we can probably solve it as well without type embedding. Type embedding is mainly used for convenience: in most cases, to promote behaviors.
\nIf we decide to use type embedding, we need to keep two main constraints in mind:
\n\nIt shouldnât be used solely as some syntactic sugar to simplify accessing a field (such as Foo.Baz() instead of Foo.Bar.Baz()). If this is the only rationale, letâs not embed the inner type and use a field instead. \nIt shouldnât promote data (fields) or a behavior (methods) we want to hide from the outside: for example, if it allows clients to access a locking behavior that should remain private to the struct. \n \nUsing type embedding consciously by keeping these constraints in mind can help avoid boilerplate code with additional forwarding methods. However, letâs make sure we donât do it solely for cosmetics and not promote elements that should remain hidden.
\n
\nNot using the functional options pattern (#11) \n\nTL;DR \nTo handle options conveniently and in an API-friendly manner, use the functional options pattern.
\n \nAlthough there are different implementations with minor variations, the main idea is as follows:
\n\nAn unexported struct holds the configuration: options. \nEach option is a function that returns the same type: type Option func(options *options) error. For example, WithPort accepts an int argument that represents the port and returns an Option type that represents how to update the options struct. \n \n
\ntype options struct { \n port * int \n} \ntype Option func ( options * options ) error \nfunc WithPort ( port int ) Option { \n return func ( options * options ) error { \n if port < 0 { \n return errors . New ( \"port should be positive\" ) \n } \n options . port = & port \n return nil \n } \n} \nfunc NewServer ( addr string , opts ... Option ) ( * http . Server , error ) { \n var options options \n for _ , opt := range opts { \n err := opt ( & options ) \n if err != nil { \n return nil , err \n } \n } \n // At this stage, the options struct is built and contains the config \n // Therefore, we can implement our logic related to port configuration \n var port int \n if options . port == nil { \n port = defaultHTTPPort \n } else { \n if * options . port == 0 { \n port = randomPort () \n } else { \n port = * options . port \n } \n } \n // ... \n} \nThe functional options pattern provides a handy and API-friendly way to handle options. Although the builder pattern can be a valid option, it has some minor downsides (having to pass a config struct that can be empty or a less handy way to handle error management) that tend to make the functional options pattern the idiomatic way to deal with these kind of problems in Go.
\n
\nProject misorganization (project structure and package organization) (#12) \nRegarding the overall organization, there are different schools of thought. For example, should we organize our application by context or by layer? It depends on our preferences. We may favor grouping code per context (such as the customer context, the contract context, etc.), or we may favor following hexagonal architecture principles and group per technical layer. If the decision we make fits our use case, it cannot be a wrong decision, as long as we remain consistent with it.
\nRegarding packages, there are multiple best practices that we should follow. First, we should avoid premature packaging because it might cause us to overcomplicate a project. Sometimes, itâs better to use a simple organization and have our project evolve when we understand what it contains rather than forcing ourselves to make the perfect structure up front.\nGranularity is another essential thing to consider. We should avoid having dozens of nano packages containing only one or two files. If we do, itâs because we have probably missed some logical connections across these packages, making our project harder for readers to understand. Conversely, we should also avoid huge packages that dilute the meaning of a package name.
\nPackage naming should also be considered with care. As we all know (as developers), naming is hard. To help clients understand a Go project, we should name our packages after what they provide, not what they contain. Also, naming should be meaningful. Therefore, a package name should be short, concise, expressive, and, by convention, a single lowercase word.
\nRegarding what to export, the rule is pretty straightforward. We should minimize what should be exported as much as possible to reduce the coupling between packages and keep unnecessary exported elements hidden. If we are unsure whether to export an element or not, we should default to not exporting it. Later, if we discover that we need to export it, we can adjust our code. Letâs also keep in mind some exceptions, such as making fields exported so that a struct can be unmarshaled with encoding/json.
\nOrganizing a project isnât straightforward, but following these rules should help make it easier to maintain. However, remember that consistency is also vital to ease maintainability. Therefore, letâs make sure that we keep things as consistent as possible within a codebase.
\n\nNote \nIn 2023, the Go team has published an official guideline for organizing / structuring a Go project: go.dev/doc/modules/layout
\n \nCreating utility packages (#13) \n\nTL;DR \nNaming is a critical piece of application design. Creating packages such as common, util, and shared doesnât bring much value for the reader. Refactor such packages into meaningful and specific package names.
\n \nAlso, bear in mind that naming a package after what it provides and not what it contains can be an efficient way to increase its expressiveness.
\n
\nIgnoring package name collisions (#14) \n\nTL;DR \nTo avoid naming collisions between variables and packages, leading to confusion or perhaps even bugs, use unique names for each one. If this isnât feasible, use an import alias to change the qualifier to differentiate the package name from the variable name, or think of a better name.
\n \nPackage collisions occur when a variable name collides with an existing package name, preventing the package from being reused. We should prevent variable name collisions to avoid ambiguity. If we face a collision, we should either find another meaningful name or use an import alias.
\nMissing code documentation (#15) \n\nTL;DR \nTo help clients and maintainers understand your codeâs purpose, document exported elements.
\n \nDocumentation is an important aspect of coding. It simplifies how clients can consume an API but can also help in maintaining a project. In Go, we should follow some rules to make our code idiomatic:
\nFirst, every exported element must be documented. Whether it is a structure, an interface, a function, or something else, if itâs exported, it must be documented. The convention is to add comments, starting with the name of the exported element.
\nAs a convention, each comment should be a complete sentence that ends with punctuation. Also bear in mind that when we document a function (or a method), we should highlight what the function intends to do, not how it does it; this belongs to the core of a function and comments, not documentation. Furthermore, the documentation should ideally provide enough information that the consumer does not have to look at our code to understand how to use an exported element.
\nWhen it comes to documenting a variable or a constant, we might be interested in conveying two aspects: its purpose and its content. The former should live as code documentation to be useful for external clients. The latter, though, shouldnât necessarily be public.
\nTo help clients and maintainers understand a packageâs scope, we should also document each package. The convention is to start the comment with // Package followed by the package name. The first line of a package comment should be concise. Thatâs because it will appear in the package. Then, we can provide all the information we need in the following lines.
\nDocumenting our code shouldnât be a constraint. We should take the opportunity to make sure it helps clients and maintainers to understand the purpose of our code.
\nNot using linters (#16) \n\nTL;DR \nTo improve code quality and consistency, use linters and formatters.
\n \nA linter is an automatic tool to analyze code and catch errors. The scope of this section isnât to give an exhaustive list of the existing linters; otherwise, it will become deprecated pretty quickly. But we should understand and remember why linters are essential for most Go projects.
\nHowever, if youâre not a regular user of linters, here is a list that you may want to use daily:
\n\nBesides linters, we should also use code formatters to fix code style. Here is a list of some code formatters for you to try:
\n\nMeanwhile, we should also look at golangci-lint (https://github.com/golangci/golangci-lint ). Itâs a linting tool that provides a facade on top of many useful linters and formatters. Also, it allows running the linters in parallel to improve analysis speed, which is quite handy.
\nLinters and formatters are a powerful way to improve the quality and consistency of our codebase. Letâs take the time to understand which one we should use and make sure we automate their execution (such as a CI or Git precommit hook).
\nData Types \nCreating confusion with octal literals (#17) \n\nTL;DR \nWhen reading existing code, bear in mind that integer literals starting with 0 are octal numbers. Also, to improve readability, make octal integers explicit by prefixing them with 0o.
\n \nOctal numbers start with a 0 (e.g., 010 is equal to 8 in base 10). To improve readability and avoid potential mistakes for future code readers, we should make octal numbers explicit using the 0o prefix (e.g., 0o10).
\nWe should also note the other integer literal representations:
\n\nBinary âUses a 0b or 0B prefix (for example, 0b100 is equal to 4 in base 10)Hexadecimal âUses an 0x or 0X prefix (for example, 0xF is equal to 15 in base 10)Imaginary âUses an i suffix (for example, 3i) \nWe can also use an underscore character (_) as a separator for readability. For example, we can write 1 billion this way: 1_000_000_000. We can also use the underscore character with other representations (for example, 0b00_00_01).
\n
\nNeglecting integer overflows (#18) \n\nTL;DR \nBecause integer overflows and underflows are handled silently in Go, you can implement your own functions to catch them.
\n \nIn Go, an integer overflow that can be detected at compile time generates a compilation error. For example,
\nvar counter int32 = math . MaxInt32 + 1 \n 2147483648 overflows int32\nHowever, at run time, an integer overflow or underflow is silent; this does not lead to an application panic. It is essential to keep this behavior in mind, because it can lead to sneaky bugs (for example, an integer increment or addition of positive integers that leads to a negative result).
\n
\nNot understanding floating-points (#19) \n\nTL;DR \nMaking floating-point comparisons within a given delta can ensure that your code is portable. When performing addition or subtraction, group the operations with a similar order of magnitude to favor accuracy. Also, perform multiplication and division before addition and subtraction.
\n \nIn Go, there are two floating-point types (if we omit imaginary numbers): float32 and float64. The concept of a floating point was invented to solve the major problem with integers: their inability to represent fractional values. To avoid bad surprises, we need to know that floating-point arithmetic is an approximation of real arithmetic.
\nFor that, weâll look at a multiplication example:
\nvar n float32 = 1.0001 \nfmt . Println ( n * n ) \nWe may expect this code to print the result of 1.0001 * 1.0001 = 1.00020001, right? However, running it on most x86 processors prints 1.0002, instead.
\nBecause Goâs float32 and float64 types are approximations, we have to bear a few rules in mind:
\n\nWhen comparing two floating-point numbers, check that their difference is within an acceptable range. \nWhen performing additions or subtractions, group operations with a similar order of magnitude for better accuracy. \nTo favor accuracy, if a sequence of operations requires addition, subtraction, multiplication, or division, perform the multiplication and division operations first. \n \n
\nNot understanding slice length and capacity (#20) \n\nTL;DR \nUnderstanding the difference between slice length and capacity should be part of a Go developerâs core knowledge. The slice length is the number of available elements in the slice, whereas the slice capacity is the number of elements in the backing array.
\n \nRead the full section here .
\n
\nInefficient slice initialization (#21) \n\nTL;DR \nWhen creating a slice, initialize it with a given length or capacity if its length is already known. This reduces the number of allocations and improves performance.
\n \nWhile initializing a slice using make, we can provide a length and an optional capacity. Forgetting to pass an appropriate value for both of these parameters when it makes sense is a widespread mistake. Indeed, it can lead to multiple copies and additional effort for the GC to clean the temporary backing arrays. Performance-wise, thereâs no good reason not to give the Go runtime a helping hand.
\nOur options are to allocate a slice with either a given capacity or a given length. Of these two solutions, we have seen that the second tends to be slightly faster. But using a given capacity and append can be easier to implement and read in some contexts.
\n
\nBeing confused about nil vs. empty slice (#22) \n\nTL;DR \nTo prevent common confusions such as when using the encoding/json or the reflect package, you need to understand the difference between nil and empty slices. Both are zero-length, zero-capacity slices, but only a nil slice doesnât require allocation.
\n \nIn Go, there is a distinction between nil and empty slices. A nil slice is equals to nil, whereas an empty slice has a length of zero. A nil slice is empty, but an empty slice isnât necessarily nil. Meanwhile, a nil slice doesnât require any allocation. We have seen throughout this section how to initialize a slice depending on the context by using
\n\nvar s []string if we arenât sure about the final length and the slice can be empty[]string(nil) as syntactic sugar to create a nil and empty slicemake([]string, length) if the future length is known \nThe last option, []string{}, should be avoided if we initialize the slice without elements. Finally, letâs check whether the libraries we use make the distinctions between nil and empty slices to prevent unexpected behaviors.
\n
\nNot properly checking if a slice is empty (#23) \n\nTL;DR \nTo check if a slice doesnât contain any element, check its length. This check works regardless of whether the slice is nil or empty. The same goes for maps. To design unambiguous APIs, you shouldnât distinguish between nil and empty slices.
\n \nTo determine whether a slice has elements, we can either do it by checking if the slice is nil or if its length is equal to 0. Checking the length is the best option to follow as it will cover both if the slice is empty or if the slice is nil.
\nMeanwhile, when designing interfaces, we should avoid distinguishing nil and empty slices, which leads to subtle programming errors. When returning slices, it should make neither a semantic nor a technical difference if we return a nil or empty slice. Both should mean the same thing for the callers. This principle is the same with maps. To check if a map is empty, check its length, not whether itâs nil.
\n
\nNot making slice copies correctly (#24) \n\nTL;DR \nTo copy one slice to another using the copy built-in function, remember that the number of copied elements corresponds to the minimum between the two sliceâs lengths.
\n \nCopying elements from one slice to another is a reasonably frequent operation. When using copy, we must recall that the number of elements copied to the destination corresponds to the minimum between the two slicesâ lengths. Also bear in mind that other alternatives exist to copy a slice, so we shouldnât be surprised if we find them in a codebase.
\n
\nUnexpected side effects using slice append (#25) \n\nTL;DR \nUsing copy or the full slice expression is a way to prevent append from creating conflicts if two different functions use slices backed by the same array. However, only a slice copy prevents memory leaks if you want to shrink a large slice.
\n \nWhen using slicing, we must remember that we can face a situation leading to unintended side effects. If the resulting slice has a length smaller than its capacity, append can mutate the original slice. If we want to restrict the range of possible side effects, we can use either a slice copy or the full slice expression, which prevents us from doing a copy.
\n\nNote \ns[low:high:max] (full slice expression): This statement creates a slice similar to the one created with s[low:high], except that the resulting sliceâs capacity is equal to max - low.
\n \n
\nSlices and memory leaks (#26) \n\nTL;DR \nWorking with a slice of pointers or structs with pointer fields, you can avoid memory leaks by marking as nil the elements excluded by a slicing operation.
\n \nLeaking capacity \nRemember that slicing a large slice or array can lead to potential high memory consumption. The remaining space wonât be reclaimed by the GC , and we can keep a large backing array despite using only a few elements. Using a slice copy is the solution to prevent such a case.
\n
\nSlice and pointers \nWhen we use the slicing operation with pointers or structs with pointer fields, we need to know that the GC wonât reclaim these elements. In that case, the two options are to either perform a copy or explicitly mark the remaining elements or their fields to nil.
\n
\nInefficient map initialization (#27) \n\nTL;DR \nWhen creating a map, initialize it with a given length if its length is already known. This reduces the number of allocations and improves performance.
\n \nA map provides an unordered collection of key-value pairs in which all the keys are distinct. In Go, a map is based on the hash table data structure. Internally, a hash table is an array of buckets, and each bucket is a pointer to an array of key-value pairs.
\nIf we know up front the number of elements a map will contain, we should create it by providing an initial size. Doing this avoids potential map growth, which is quite heavy computation-wise because it requires reallocating enough space and rebalancing all the elements.
\n
\nMaps and memory leaks (#28) \n\nTL;DR \nA map can always grow in memory, but it never shrinks. Hence, if it leads to some memory issues, you can try different options, such as forcing Go to recreate the map or using pointers.
\n \nRead the full section here .
\n
\nComparing values incorrectly (#29) \n\nTL;DR \nTo compare types in Go, you can use the == and != operators if two types are comparable: Booleans, numerals, strings, pointers, channels, and structs are composed entirely of comparable types. Otherwise, you can either use reflect.DeepEqual and pay the price of reflection or use custom implementations and libraries.
\n \nItâs essential to understand how to use == and != to make comparisons effectively. We can use these operators on operands that are comparable:
\n\nBooleans âCompare whether two Booleans are equal.Numerics (int, float, and complex types) âCompare whether two numerics are equal.Strings âCompare whether two strings are equal.Channels âCompare whether two channels were created by the same call to make or if both are nil.Interfaces âCompare whether two interfaces have identical dynamic types and equal dynamic values or if both are nil.Pointers âCompare whether two pointers point to the same value in memory or if both are nil.Structs and arrays âCompare whether they are composed of similar types. \n\nNote \nWe can also use the ?, >=, <, and > operators with numeric types to compare values and with strings to compare their lexical order.
\n \nIf operands are not comparable (e.g., slices and maps), we have to use other options such as reflection. Reflection is a form of metaprogramming, and it refers to the ability of an application to introspect and modify its structure and behavior. For example, in Go, we can use reflect.DeepEqual. This function reports whether two elements are deeply equal by recursively traversing two values. The elements it accepts are basic types plus arrays, structs, slices, maps, pointers, interfaces, and functions. Yet, the main catch is the performance penalty.
\nIf performance is crucial at run time, implementing our custom method might be the best solution.\nOne additional note: we must remember that the standard library has some existing comparison methods. For example, we can use the optimized bytes.Compare function to compare two slices of bytes. Before implementing a custom method, we need to make sure we donât reinvent the wheel.
\n
\nControl Structures \nIgnoring that elements are copied in range loops (#30) \n\nTL;DR \nThe value element in a range loop is a copy. Therefore, to mutate a struct, for example, access it via its index or via a classic for loop (unless the element or the field you want to modify is a pointer).
\n \nA range loop allows iterating over different data structures:
\n\nString \nArray \nPointer to an array \nSlice \nMap \nReceiving channel \n \nCompared to a classic for loop, a range loop is a convenient way to iterate over all the elements of one of these data structures, thanks to its concise syntax.
\nYet, we should remember that the value element in a range loop is a copy. Therefore, if the value is a struct we need to mutate, we will only update the copy, not the element itself, unless the value or field we modify is a pointer. The favored options are to access the element via the index using a range loop or a classic for loop.
\n
\nIgnoring how arguments are evaluated in range loops (channels and arrays) (#31) \n\nTL;DR \nUnderstanding that the expression passed to the range operator is evaluated only once before the beginning of the loop can help you avoid common mistakes such as inefficient assignment in channel or slice iteration.
\n \nThe range loop evaluates the provided expression only once, before the beginning of the loop, by doing a copy (regardless of the type). We should remember this behavior to avoid common mistakes that might, for example, lead us to access the wrong element. For example:
\na := [ 3 ] int { 0 , 1 , 2 } \nfor i , v := range a { \n a [ 2 ] = 10 \n if i == 2 { \n fmt . Println ( v ) \n } \n} \nThis code updates the last index to 10. However, if we run this code, it does not print 10; it prints 2.
\n
\nrange loops (#32)\nWarning \nThis mistake isn't relevant anymore from Go 1.22 (details ).
\n \nMaking wrong assumptions during map iterations (ordering and map insert during iteration) (#33) \n\nTL;DR \nTo ensure predictable outputs when using maps, remember that a map data structure:
\n \n\nDoesnât order the data by keys \nDoesnât preserve the insertion order \nDoesnât have a deterministic iteration order \nDoesnât guarantee that an element added during an iteration will be produced during this iteration \n \n\n\n
\nIgnoring how the break statement works (#34) \n\nTL;DR \nUsing break or continue with a label enforces breaking a specific statement. This can be helpful with switch or select statements inside loops.
\n \nA break statement is commonly used to terminate the execution of a loop. When loops are used in conjunction with switch or select, developers frequently make the mistake of breaking the wrong statement. For example:
\nfor i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break \n } \n} \nThe break statement doesnât terminate the for loop: it terminates the switch statement, instead. Hence, instead of iterating from 0 to 2, this code iterates from 0 to 4: 0 1 2 3 4.
\nOne essential rule to keep in mind is that a break statement terminates the execution of the innermost for, switch, or select statement. In the previous example, it terminates the switch statement.
\nTo break the loop instead of the switch statement, the most idiomatic way is to use a label:
\nloop : \n for i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break loop \n } \n } \nHere, we associate the loop label with the for loop. Then, because we provide the loop label to the break statement, it breaks the loop, not the switch. Therefore, this new version will print 0 1 2, as we expected.
\n
\nUsing defer inside a loop (#35) \n\nTL;DR \nExtracting loop logic inside a function leads to executing a defer statement at the end of each iteration.
\n \nThe defer statement delays a callâs execution until the surrounding function returns. Itâs mainly used to reduce boilerplate code. For example, if a resource has to be closed eventually, we can use defer to avoid repeating the closure calls before every single return.
\nOne common mistake with defer is to forget that it schedules a function call when the surrounding function returns. For example:
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // Do something with file \n } \n return nil \n} \nThe defer calls are executed not during each loop iteration but when the readFiles function returns. If readFiles doesnât return, the file descriptors will be kept open forever, causing leaks.
\nOne common option to fix this problem is to create a surrounding function after defer, called during each iteration:
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n if err := readFile ( path ); err != nil { \n return err \n } \n } \n return nil \n} \nfunc readFile ( path string ) error { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // Do something with file \n return nil \n} \nAnother solution is to make the readFile function a closure but intrinsically, this remains the same solution: adding another surrounding function to execute the defer calls during each iteration.
\n
\nStrings \nNot understanding the concept of rune (#36) \n\nTL;DR \nUnderstanding that a rune corresponds to the concept of a Unicode code point and that it can be composed of multiple bytes should be part of the Go developerâs core knowledge to work accurately with strings.
\n \nAs runes are everywhere in Go, it's important to understand the following:
\n\nA charset is a set of characters, whereas an encoding describes how to translate a charset into binary. \nIn Go, a string references an immutable slice of arbitrary bytes. \nGo source code is encoded using UTF-8. Hence, all string literals are UTF-8 strings. But because a string can contain arbitrary bytes, if itâs obtained from somewhere else (not the source code), it isnât guaranteed to be based on the UTF-8 encoding. \nA rune corresponds to the concept of a Unicode code point, meaning an item represented by a single value. \nUsing UTF-8, a Unicode code point can be encoded into 1 to 4 bytes. \nUsing len() on a string in Go returns the number of bytes, not the number of runes. \n \n
\nInaccurate string iteration (#37) \n\nTL;DR \nIterating on a string with the range operator iterates on the runes with the index corresponding to the starting index of the runeâs byte sequence. To access a specific rune index (such as the third rune), convert the string into a []rune.
\n \nIterating on a string is a common operation for developers. Perhaps we want to perform an operation for each rune in the string or implement a custom function to search for a specific substring. In both cases, we have to iterate on the different runes of a string. But itâs easy to get confused about how iteration works.
\nFor example, consider the following example:
\ns := \"hĂŞllo\" \nfor i := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , s [ i ]) \n} \nfmt . Printf ( \"len=%d\\n\" , len ( s )) \nLet's highlight three points that might be confusing:
\n\nThe second rune is Ă in the output instead of ĂŞ. \nWe jumped from position 1 to position 3: what is at position 2? \nlen returns a count of 6, whereas s contains only 5 runes. \n \nLetâs start with the last observation. We already mentioned that len returns the number of bytes in a string, not the number of runes. Because we assigned a string literal to s, s is a UTF-8 string. Meanwhile, the special character \"ĂŞ\" isnât encoded in a single byte; it requires 2 bytes. Therefore, calling len(s) returns 6.
\nMeanwhile, in the previous example, we have to understand that we don't iterate over each rune; instead, we iterate over each starting index of a rune:
\n
\nPrinting s[i] doesnât print the ith rune; it prints the UTF-8 representation of the byte at index i. Hence, we printed \"hĂllo\" instead of \"hĂŞllo\".
\nIf we want to print all the different runes, we can either use the value element of the range operator:
\ns := \"hĂŞllo\" \nfor i , r := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \nOr, we can convert the string into a slice of runes and iterate over it:
\ns := \"hĂŞllo\" \nrunes := [] rune ( s ) \nfor i , r := range runes { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \nNote that this solution introduces a run-time overhead compared to the previous one. Indeed, converting a string into a slice of runes requires allocating an additional slice and converting the bytes into runes: an O(n) time complexity with n the number of bytes in the string. Therefore, if we want to iterate over all the runes, we should use the first solution.
\nHowever, if we want to access the ith rune of a string with the first option, we donât have access to the rune index; rather, we know the starting index of a rune in the byte sequence.
\ns := \"hĂŞllo\" \nr := [] rune ( s )[ 4 ] \nfmt . Printf ( \"%c\\n\" , r ) // o \n
\nMisusing trim functions (#38) \n\nTL;DR \nstrings.TrimRight/strings.TrimLeft removes all the trailing/leading runes contained in a given set, whereas strings.TrimSuffix/strings.TrimPrefix returns a string without a provided suffix/prefix.
\n \nFor example:
\nfmt . Println ( strings . TrimRight ( \"123oxo\" , \"xo\" )) \nThe example prints 123:
\n
\nConversely, strings.TrimLeft removes all the leading runes contained in a set.
\nOn the other side, strings.TrimSuffix / strings.TrimPrefix returns a string without the provided trailing suffix / prefix.
\n
\nUnder-optimized strings concatenation (#39) \n\nTL;DR \nConcatenating a list of strings should be done with strings.Builder to prevent allocating a new string during each iteration.
\n \nLetâs consider a concat function that concatenates all the string elements of a slice using the += operator:
\nfunc concat ( values [] string ) string { \n s := \"\" \n for _ , value := range values { \n s += value \n } \n return s \n} \nDuring each iteration, the += operator concatenates s with the value string. At first sight, this function may not look wrong. But with this implementation, we forget one of the core characteristics of a string: its immutability. Therefore, each iteration doesnât update s; it reallocates a new string in memory, which significantly impacts the performance of this function.
\nFortunately, there is a solution to deal with this problem, using strings.Builder:
\nfunc concat ( values [] string ) string { \n sb := strings . Builder {} \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \nDuring each iteration, we constructed the resulting string by calling the WriteString method that appends the content of value to its internal buffer, hence minimizing memory copying.
\n\nNote \nWriteString returns an error as the second output, but we purposely ignore it. Indeed, this method will never return a non-nil error. So whatâs the purpose of this method returning an error as part of its signature? strings.Builder implements the io.StringWriter interface, which contains a single method: WriteString(s string) (n int, err error). Hence, to comply with this interface, WriteString must return an error.
\n \nInternally, strings.Builder holds a byte slice. Each call to WriteString results in a call to append on this slice. There are two impacts. First, this struct shouldnât be used concurrently, as the calls to append would lead to race conditions. The second impact is something that we saw in mistake #21, \"Inefficient slice initialization\" : if the future length of a slice is already known, we should preallocate it. For that purpose, strings.Builder exposes a method Grow(n int) to guarantee space for another n bytes:
\nfunc concat ( values [] string ) string { \n total := 0 \n for i := 0 ; i < len ( values ); i ++ { \n total += len ( values [ i ]) \n } \n sb := strings . Builder {} \n sb . Grow ( total ) ( 2 ) \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \nLetâs run a benchmark to compare the three versions (v1 using +=; v2 using strings.Builder{} without preallocation; and v3 using strings.Builder{} with preallocation). The input slice contains 1,000 strings, and each string contains 1,000 bytes:
\nAs we can see, the latest version is by far the most efficient: 99% faster than v1 and 78% faster than v2.
\nstrings.Builder is the recommended solution to concatenate a list of strings. Usually, this solution should be used within a loop. Indeed, if we just have to concatenate a few strings (such as a name and a surname), using strings.Builder is not recommended as doing so will make the code a bit less readable than using the += operator or fmt.Sprintf.
\n
\nUseless string conversions (#40) \n\nTL;DR \nRemembering that the bytes package offers the same operations as the strings package can help avoid extra byte/string conversions.
\n \nWhen choosing to work with a string or a []byte, most programmers tend to favor strings for convenience. But most I/O is actually done with []byte. For example, io.Reader, io.Writer, and io.ReadAll work with []byte, not strings.
\nWhen weâre wondering whether we should work with strings or []byte, letâs recall that working with []byte isnât necessarily less convenient. Indeed, all the exported functions of the strings package also have alternatives in the bytes package: Split, Count, Contains, Index, and so on. Hence, whether weâre doing I/O or not, we should first check whether we could implement a whole workflow using bytes instead of strings and avoid the price of additional conversions.
\n
\nSubstring and memory leaks (#41) \n\nTL;DR \nUsing copies instead of substrings can prevent memory leaks, as the string returned by a substring operation will be backed by the same byte array.
\n \nIn mistake #26, âSlices and memory leaks,â we saw how slicing a slice or array may lead to memory leak situations. This principle also applies to string and substring operations.
\nWe need to keep two things in mind while using the substring operation in Go. First, the interval provided is based on the number of bytes, not the number of runes. Second, a substring operation may lead to a memory leak as the resulting substring will share the same backing array as the initial string. The solutions to prevent this case from happening are to perform a string copy manually or to use strings.Clone from Go 1.18.
\n
\nFunctions and Methods \nNot knowing which type of receiver to use (#42) \n\nTL;DR \nThe decision whether to use a value or a pointer receiver should be made based on factors such as the type, whether it has to be mutated, whether it contains a field that canât be copied, and how large the object is. When in doubt, use a pointer receiver.
\n \nChoosing between value and pointer receivers isnât always straightforward. Letâs discuss some of the conditions to help us choose.
\nA receiver must be a pointer
\n\nIf the method needs to mutate the receiver. This rule is also valid if the receiver is a slice and a method needs to append elements: \n \ntype slice [] int \nfunc ( s * slice ) add ( element int ) { \n * s = append ( * s , element ) \n} \nA receiver should be a pointer
\n\nIf the receiver is a large object. Using a pointer can make the call more efficient, as doing so prevents making an extensive copy. When in doubt about how large is large, benchmarking can be the solution; itâs pretty much impossible to state a specific size, because it depends on many factors. \n \nA receiver must be a value
\n\nIf we have to enforce a receiverâs immutability. \nIf the receiver is a map, function, or channel. Otherwise, a compilation error\n occurs. \n \nA receiver should be a value
\n\nIf the receiver is a slice that doesnât have to be mutated. \nIf the receiver is a small array or struct that is naturally a value type without mutable fields, such as time.Time. \nIf the receiver is a basic type such as int, float64, or string. \n \nOf course, itâs impossible to be exhaustive, as there will always be edge cases, but this sectionâs goal was to provide guidance to cover most cases. By default, we can choose to go with a value receiver unless thereâs a good reason not to do so. In doubt, we should use a pointer receiver.
\n
\nNever using named result parameters (#43) \n\nTL;DR \nUsing named result parameters can be an efficient way to improve the readability of a function/method, especially if multiple result parameters have the same type. In some cases, this approach can also be convenient because named result parameters are initialized to their zero value. But be cautious about potential side effects.
\n \nWhen we return parameters in a function or a method, we can attach names to these parameters and use them as regular variables. When a result parameter is named, itâs initialized to its zero value when the function/method begins. With named result parameters, we can also call a naked return statement (without arguments). In that case, the current values of the result parameters are used as the returned values.
\nHereâs an example that uses a named result parameter b:
\nfunc f ( a int ) ( b int ) { \n b = a \n return \n} \nIn this example, we attach a name to the result parameter: b. When we call return without arguments, it returns the current value of b.
\nIn some cases, named result parameters can also increase readability: for example, if two parameters have the same type. In other cases, they can also be used for convenience. Therefore, we should use named result parameters sparingly when thereâs a clear benefit.
\n
\nUnintended side effects with named result parameters (#44) \n\nTL;DR \nSee #43 .
\n \nWe mentioned why named result parameters can be useful in some situations. But as these result parameters are initialized to their zero value, using them can sometimes lead to subtle bugs if weâre not careful enough. For example, can you spot whatâs wrong with this code?
\nfunc ( l loc ) getCoordinates ( ctx context . Context , address string ) ( \n lat , lng float32 , err error ) { \n isValid := l . validateAddress ( address ) ( 1 ) \n if ! isValid { \n return 0 , 0 , errors . New ( \"invalid address\" ) \n } \n if ctx . Err () != nil { ( 2 ) \n return 0 , 0 , err \n } \n // Get and return coordinates \n} \nThe error might not be obvious at first glance. Here, the error returned in the if ctx.Err() != nil scope is err. But we havenât assigned any value to the err variable. Itâs still assigned to the zero value of an error type: nil. Hence, this code will always return a nil error.
\nWhen using named result parameters, we must recall that each parameter is initialized to its zero value. As we have seen in this section, this can lead to subtle bugs that arenât always straightforward to spot while reading code. Therefore, letâs remain cautious when using named result parameters, to avoid potential side effects.
\n
\nReturning a nil receiver (#45) \n\nTL;DR \nWhen returning an interface, be cautious about not returning a nil pointer but an explicit nil value. Otherwise, unintended consequences may occur and the caller will receive a non-nil value.
\n \n\n\n
\n\n\nTL;DR \nDesigning functions to receive io.Reader types instead of filenames improves the reusability of a function and makes testing easier.
\n \nAccepting a filename as a function input to read from a file should, in most cases, be considered a code smell (except in specific functions such as os.Open). Indeed, it makes unit tests more complex because we may have to create multiple files. It also reduces the reusability of a function (although not all functions are meant to be reused). Using the io.Reader interface abstracts the data source. Regardless of whether the input is a file, a string, an HTTP request, or a gRPC request, the implementation can be reused and easily tested.
\n
\nIgnoring how defer arguments and receivers are evaluated (argument evaluation, pointer, and value receivers) (#47) \n\nTL;DR \nPassing a pointer to a defer function and wrapping a call inside a closure are two possible solutions to overcome the immediate evaluation of arguments and receivers.
\n \nIn a defer function the arguments are evaluated right away, not once the surrounding function returns. For example, in this code, we always call notify and incrementCounter with the same status: an empty string.
\nconst ( \n StatusSuccess = \"success\" \n StatusErrorFoo = \"error_foo\" \n StatusErrorBar = \"error_bar\" \n) \nfunc f () error { \n var status string \n defer notify ( status ) \n defer incrementCounter ( status ) \n if err := foo (); err != nil { \n status = StatusErrorFoo \n return err \n } \n if err := bar (); err != nil { \n status = StatusErrorBar \n return err \n } \n status = StatusSuccess \n return nil \n} \nIndeed, we call notify(status) and incrementCounter(status) as defer functions. Therefore, Go will delay these calls to be executed once f returns with the current value of status at the stage we used defer, hence passing an empty string.
\nTwo leading options if we want to keep using defer.
\nThe first solution is to pass a string pointer:
\nfunc f () error { \n var status string \n defer notify ( & status ) \n defer incrementCounter ( & status ) \n // The rest of the function unchanged \n} \nUsing defer evaluates the arguments right away: here, the address of status. Yes, status itself is modified throughout the function, but its address remains constant, regardless of the assignments. Hence, if notify or incrementCounter uses the value referenced by the string pointer, it will work as expected. But this solution requires changing the signature of the two functions, which may not always be possible.
\nThereâs another solution: calling a closure (an anonymous function value that references variables from outside its body) as a defer statement:
\nfunc f () error { \n var status string \n defer func () { \n notify ( status ) \n incrementCounter ( status ) \n }() \n // The rest of the function unchanged \n} \nHere, we wrap the calls to both notify and incrementCounter within a closure. This closure references the status variable from outside its body. Therefore, status is evaluated once the closure is executed, not when we call defer. This solution also works and doesnât require notify and incrementCounter to change their signature.
\nLet's also note this behavior applies with method receiver: the receiver is evaluated immediately.
\n
\nError Management \nPanicking (#48) \n\nTL;DR \nUsing panic is an option to deal with errors in Go. However, it should only be used sparingly in unrecoverable conditions: for example, to signal a programmer error or when you fail to load a mandatory dependency.
\n \nIn Go, panic is a built-in function that stops the ordinary flow:
\nfunc main () { \n fmt . Println ( \"a\" ) \n panic ( \"foo\" ) \n fmt . Println ( \"b\" ) \n} \nThis code prints a and then stops before printing b:
\nPanicking in Go should be used sparingly. There are two prominent cases, one to signal a programmer error (e.g., sql.Registernil or has already been register) and another where our application fails to create a mandatory dependency. Hence, exceptional conditions that lead us to stop the application. In most other cases, error management should be done with a function that returns a proper error type as the last return argument.
\n
\nIgnoring when to wrap an error (#49) \n\nTL;DR \nWrapping an error allows you to mark an error and/or provide additional context. However, error wrapping creates potential coupling as it makes the source error available for the caller. If you want to prevent that, donât use error wrapping.
\n \nSince Go 1.13, the %w directive allows us to wrap errors conveniently. Error wrapping is about wrapping or packing an error inside a wrapper container that also makes the source error available. In general, the two main use cases for error wrapping are the following:
\n\nAdding additional context to an error \nMarking an error as a specific error \n \nWhen handling an error, we can decide to wrap it. Wrapping is about adding additional context to an error and/or marking an error as a specific type. If we need to mark an error, we should create a custom error type. However, if we just want to add extra context, we should use fmt.Errorf with the %w directive as it doesnât require creating a new error type. Yet, error wrapping creates potential coupling as it makes the source error available for the caller. If we want to prevent it, we shouldnât use error wrapping but error transformation, for example, using fmt.Errorf with the %v directive.
\n
\nComparing an error type inaccurately (#50) \n\nTL;DR \nIf you use Go 1.13 error wrapping with the %w directive and fmt.Errorf, comparing an error against a type has to be done using errors.As. Otherwise, if the returned error you want to check is wrapped, it will fail the checks.
\n \n\n\n
\nComparing an error value inaccurately (#51) \n\nTL;DR \nIf you use Go 1.13 error wrapping with the %w directive and fmt.Errorf, comparing an error against or a value has to be done using errors.As. Otherwise, if the returned error you want to check is wrapped, it will fail the checks.
\n \nA sentinel error is an error defined as a global variable:
\nimport \"errors\" \nvar ErrFoo = errors . New ( \"foo\" ) \nIn general, the convention is to start with Err followed by the error type: here, ErrFoo. A sentinel error conveys an expected error, an error that clients will expect to check. As general guidelines:
\n\nExpected errors should be designed as error values (sentinel errors): var ErrFoo = errors.New(\"foo\"). \nUnexpected errors should be designed as error types: type BarError struct { ... }, with BarError implementing the error interface. \n \nIf we use error wrapping in our application with the %w directive and fmt.Errorf, checking an error against a specific value should be done using errors.Is instead of ==. Thus, even if the sentinel error is wrapped, errors.Is can recursively unwrap it and compare each error in the chain against the provided value.
\n
\nHandling an error twice (#52) \n\nTL;DR \nIn most situations, an error should be handled only once. Logging an error is handling an error. Therefore, you have to choose between logging or returning an error. In many cases, error wrapping is the solution as it allows you to provide additional context to an error and return the source error.
\n \nHandling an error multiple times is a mistake made frequently by developers, not specifically in Go. This can cause situations where the same error is logged multiple times make debugging harder.
\nLet's remind us that handling an error should be done only once. Logging an error is handling an error. Hence, we should either log or return an error. By doing this, we simplify our code and gain better insights into the error situation. Using error wrapping is the most convenient approach as it allows us to propagate the source error and add context to an error.
\n
\nNot handling an error (#53) \n\nTL;DR \nIgnoring an error, whether during a function call or in a defer function, should be done explicitly using the blank identifier. Otherwise, future readers may be confused about whether it was intentional or a miss.
\n \n
\nNot handling defer errors (#54) \n\nTL;DR \nIn many cases, you shouldnât ignore an error returned by a defer function. Either handle it directly or propagate it to the caller, depending on the context. If you want to ignore it, use the blank identifier.
\n \nConsider the following code:
\nfunc f () { \n // ... \n notify () // Error handling is omitted \n} \nfunc notify () error { \n // ... \n} \nFrom a maintainability perspective, the code can lead to some issues. Letâs consider a new reader looking at it. This reader notices that notify returns an error but that the error isnât handled by the parent function. How can they guess whether or not handling the error was intentional? How can they know whether the previous developer forgot to handle it or did it purposely?
\nFor these reasons, when we want to ignore an error, there's only one way to do it, using the blank identifier (_):
\n\nIn terms of compilation and run time, this approach doesnât change anything compared to the first piece of code. But this new version makes explicit that we arenât interested in the error. Also, we can add a comment that indicates the rationale for why an error is ignored:
\n// At-most once delivery. \n// Hence, it's accepted to miss some of them in case of errors. \n_ = notify () \n
\nConcurrency: Foundations \nMixing up concurrency and parallelism (#55) \n\nTL;DR \nUnderstanding the fundamental differences between concurrency and parallelism is a cornerstone of the Go developerâs knowledge. Concurrency is about structure, whereas parallelism is about execution.
\n \nConcurrency and parallelism are not the same:
\n\nConcurrency is about structure. We can change a sequential implementation into a concurrent one by introducing different steps that separate concurrent goroutines can tackle. \nMeanwhile, parallelism is about execution. We can use parallism at the steps level by adding more parallel goroutines. \n \nIn summary, concurrency provides a structure to solve a problem with parts that may be parallelized. Therefore, concurrency enables parallelism .
\n\n\nThinking concurrency is always faster (#56) \n\nTL;DR \nTo be a proficient developer, you must acknowledge that concurrency isnât always faster. Solutions involving parallelization of minimal workloads may not necessarily be faster than a sequential implementation. Benchmarking sequential versus concurrent solutions should be the way to validate assumptions.
\n \nRead the full section here .
\n
\nBeing puzzled about when to use channels or mutexes (#57) \n\nTL;DR \nBeing aware of goroutine interactions can also be helpful when deciding between channels and mutexes. In general, parallel goroutines require synchronization and hence mutexes. Conversely, concurrent goroutines generally require coordination and orchestration and hence channels.
\n \nGiven a concurrency problem, it may not always be clear whether we can implement a\nsolution using channels or mutexes. Because Go promotes sharing memory by communication, one mistake could be to always force the use of channels, regardless of\nthe use case. However, we should see the two options as complementary.
\nWhen should we use channels or mutexes? We will use the example in the next figure as a backbone. Our example has three different goroutines with specific relationships:
\n\nG1 and G2 are parallel goroutines. They may be two goroutines executing the same function that keeps receiving messages from a channel, or perhaps two goroutines executing the same HTTP handler at the same time. \nOn the other hand, G1 and G3 are concurrent goroutines, as are G2 and G3. All the goroutines are part of an overall concurrent structure, but G1 and G2 perform the first step, whereas G3 does the next step. \n \n\n\nIn general, parallel goroutines have to synchronize : for example, when they need to access or mutate a shared resource such as a slice. Synchronization is enforced with mutexes but not with any channel types (not with buffered channels). Hence, in general, synchronization between parallel goroutines should be achieved via mutexes.
\nConversely, in general, concurrent goroutines have to coordinate and orchestrate . For example, if G3 needs to aggregate results from both G1 and G2, G1 and G2 need to signal to G3 that a new intermediate result is available. This coordination falls under the scope of communicationâtherefore, channels.
\nRegarding concurrent goroutines, thereâs also the case where we want to transfer the ownership of a resource from one step (G1 and G2) to another (G3); for example, if G1 and G2 are enriching a shared resource and at some point, we consider this job as complete. Here, we should use channels to signal that a specific resource is ready and handle the ownership transfer.
\nMutexes and channels have different semantics. Whenever we want to share a state or access a shared resource, mutexes ensure exclusive access to this resource. Conversely, channels are a mechanic for signaling with or without data (chan struct{} or not). Coordination or ownership transfer should be achieved via channels. Itâs important to know whether goroutines are parallel or concurrent because, in general, we need mutexes for parallel goroutines and channels for concurrent ones.
\nNot understanding race problems (data races vs. race conditions and the Go memory model) (#58) \n\nTL;DR \nBeing proficient in concurrency also means understanding that data races and race conditions are different concepts. Data races occur when multiple goroutines simultaneously access the same memory location and at least one of them is writing. Meanwhile, being data-race-free doesnât necessarily mean deterministic execution. When a behavior depends on the sequence or the timing of events that canât be controlled, this is a race condition.
\n \nRace problems can be among the hardest and most insidious bugs a programmer can face. As Go developers, we must understand crucial aspects such as data races and race conditions, their possible impacts, and how to avoid them.
\nData Race \nA data race occurs when two or more goroutines simultaneously access the same memory location and at least one is writing. In this case, the result can be hazardous. Even worse, in some situations, the memory location may end up holding a value containing a meaningless combination of bits.
\nWe can prevent a data race from happening using different techniques. For example:
\n\nUsing the sync/atomic package \nIn synchronizing the two goroutines with an ad hoc data structure like a mutex \nUsing channels to make the two goroutines communicating to ensure that a variable is updated by only one goroutine at a time \n \nRace Condition \nDepending on the operation we want to perform, does a data-race-free application necessarily mean a deterministic result? Not necessarily.
\nA race condition occurs when the behavior depends on the sequence or the timing of events that canât be controlled. Here, the timing of events is the goroutinesâ execution order.
\nIn summary, when we work in concurrent applications, itâs essential to understand that a data race is different from a race condition. A data race occurs when multiple goroutines simultaneously access the same memory location and at least one of them is writing. A data race means unexpected behavior. However, a data-race-free application doesnât necessarily mean deterministic results. An application can be free of data races but still have behavior that depends on uncontrolled events (such as goroutine execution, how fast a message is published to a channel, or how long a call to a database lasts); this is a race condition. Understanding both concepts is crucial to becoming proficient in designing concurrent applications.
\n
\nNot understanding the concurrency impacts of a workload type (#59) \n\nTL;DR \nWhen creating a certain number of goroutines, consider the workload type. Creating CPU-bound goroutines means bounding this number close to the GOMAXPROCS variable (based by default on the number of CPU cores on the host). Creating I/O-bound goroutines depends on other factors, such as the external system.
\n \nIn programming, the execution time of a workload is limited by one of the following:
\n\nThe speed of the CPUâFor example, running a merge sort algorithm. The workload is called CPU-bound. \nThe speed of I/OâFor example, making a REST call or a database query. The workload is called I/O-bound. \nThe amount of available memoryâThe workload is called memory-bound. \n \n\nNote \nThe last is the rarest nowadays, given that memory has become very cheap in recent decades. Hence, this section focuses on the two first workload types: CPU- and I/O-bound.
\n \nIf the workload executed by the workers is I/O-bound, the value mainly depends on the external system. Conversely, if the workload is CPU-bound, the optimal number of goroutines is close to the number of available CPU cores (a best practice can be to use runtime.GOMAXPROCS). Knowing the workload type (I/O or CPU) is crucial when designing concurrent applications.
\n
\nMisunderstanding Go contexts (#60) \n\nTL;DR \nGo contexts are also one of the cornerstones of concurrency in Go. A context allows you to carry a deadline, a cancellation signal, and/or a list of keys-values.
\n \n\n
https://pkg.go.dev/context
\n
A Context carries a deadline, a cancellation signal, and other values across API boundaries.
\n
Deadline \nA deadline refers to a specific point in time determined with one of the following:
\n\nA time.Duration from now (for example, in 250 ms) \nA time.Time (for example, 2023-02-07 00:00:00 UTC) \n \nThe semantics of a deadline convey that an ongoing activity should be stopped if this deadline is met. An activity is, for example, an I/O request or a goroutine waiting to receive a message from a channel.
\nCancellation signals \nAnother use case for Go contexts is to carry a cancellation signal. Letâs imagine that we want to create an application that calls CreateFileWatcher(ctx context.Context, filename string) within another goroutine. This function creates a specific file watcher that keeps reading from a file and catches updates. When the provided context expires or is canceled, this function handles it to close the file descriptor.
\nContext values \nThe last use case for Go contexts is to carry a key-value list. Whatâs the point of having a context carrying a key-value list? Because Go contexts are generic and mainstream, there are infinite use cases.
\nFor example, if we use tracing, we may want different subfunctions to share the same correlation ID. Some developers may consider this ID too invasive to be part of the function signature. In this regard, we could also decide to include it as part of the provided context.
\nCatching a context cancellation \nThe context.Context type exports a Done method that returns a receive-only notification channel: <-chan struct{}. This channel is closed when the work associated with the context should be canceled. For example,
\n\nThe Done channel related to a context created with context.WithCancel is closed when the cancel function is called. \nThe Done channel related to a context created with context.WithDeadline is closed when the deadline has expired. \n \nOne thing to note is that the internal channel should be closed when a context is canceled or has met a deadline, instead of when it receives a specific value, because the closure of a channel is the only channel action that all the consumer goroutines will receive. This way, all the consumers will be notified once a context is canceled or a deadline is reached.
\nIn summary, to be a proficient Go developer, we have to understand what a context is and how to use it. In general, a function that users wait for should take a context, as doing so allows upstream callers to decide when calling this function should be aborted.
\n
\nConcurrency: Practice \nPropagating an inappropriate context (#61) \n\nTL;DR \nUnderstanding the conditions when a context can be canceled should matter when propagating it: for example, an HTTP handler canceling the context when the response has been sent.
\n \nIn many situations, it is recommended to propagate Go contexts. However, context propagation can sometimes lead to subtle bugs, preventing subfunctions from being correctly executed.
\nLetâs consider the following example. We expose an HTTP handler that performs some tasks and returns a response. But just before returning the response, we also want to send it to a Kafka topic. We donât want to penalize the HTTP consumer latency-wise, so we want the publish action to be handled asynchronously within a new goroutine. We assume that we have at our disposal a publish function that accepts a context so the action of publishing a message can be interrupted if the context is canceled, for example. Here is a possible implementation:
\nfunc handler ( w http . ResponseWriter , r * http . Request ) { \n response , err := doSomeTask ( r . Context (), r ) \n if err != nil { \n http . Error ( w , err . Error (), http . StatusInternalServerError ) \n return \n } \n go func () { \n err := publish ( r . Context (), response ) \n // Do something with err \n }() \n writeResponse ( response ) \n} \nWhatâs wrong with this piece of code? We have to know that the context attached to an HTTP request can cancel in different conditions:
\n\nWhen the clientâs connection closes \nIn the case of an HTTP/2 request, when the request is canceled \nWhen the response has been written back to the client \n \nIn the first two cases, we probably handle things correctly. For example, if we get a response from doSomeTask but the client has closed the connection, itâs probably OK to call publish with a context already canceled so the message isnât published. But what about the last case?
\nWhen the response has been written to the client, the context associated with the request will be canceled. Therefore, we are facing a race condition:
\n\nIf the response is written after the Kafka publication, we both return a response and publish a message successfully \nHowever, if the response is written before or during the Kafka publication, the message shouldnât be published. \n \nIn the latter case, calling publish will return an error because we returned the HTTP response quickly.
\n\nNote \nFrom Go 1.21, there is a way to create a new context without cancel. context.WithoutCancel
\n \nIn summary, propagating a context should be done cautiously.
\n
\nStarting a goroutine without knowing when to stop it (#62) \n\nTL;DR \nAvoiding leaks means being mindful that whenever a goroutine is started, you should have a plan to stop it eventually.
\n \nGoroutines are easy and cheap to startâso easy and cheap that we may not necessarily have a plan for when to stop a new goroutine, which can lead to leaks. Not knowing when to stop a goroutine is a design issue and a common concurrency mistake in Go.
\nLetâs discuss a concrete example. We will design an application that needs to watch some external configuration (for example, using a database connection). Hereâs a first implementation:
\nfunc main () { \n newWatcher () \n // Run the application \n} \ntype watcher struct { /* Some resources */ } \nfunc newWatcher () { \n w := watcher {} \n go w . watch () // Creates a goroutine that watches some external configuration \n} \nThe problem with this code is that when the main goroutine exits (perhaps because of an OS signal or because it has a finite workload), the application is stopped. Hence, the resources created by watcher arenât closed gracefully. How can we prevent this from happening?
\nOne option could be to pass to newWatcher a context that will be canceled when main returns:
\nfunc main () { \n ctx , cancel := context . WithCancel ( context . Background ()) \n defer cancel () \n newWatcher ( ctx ) \n // Run the application \n} \nfunc newWatcher ( ctx context . Context ) { \n w := watcher {} \n go w . watch ( ctx ) \n} \nWe propagate the context created to the watch method. When the context is canceled, the watcher struct should close its resources. However, can we guarantee that watch will have time to do so? Absolutely notâand thatâs a design flaw.
\nThe problem is that we used signaling to convey that a goroutine had to be stopped. We didnât block the parent goroutine until the resources had been closed. Letâs make sure we do:
\nfunc main () { \n w := newWatcher () \n defer w . close () \n // Run the application \n} \nfunc newWatcher () watcher { \n w := watcher {} \n go w . watch () \n return w \n} \nfunc ( w watcher ) close () { \n // Close the resources \n} \nInstead of signaling watcher that itâs time to close its resources, we now call this close method, using defer to guarantee that the resources are closed before the application exits.
\nIn summary, letâs be mindful that a goroutine is a resource like any other that must eventually be closed to free memory or other resources. Starting a goroutine without knowing when to stop it is a design issue. Whenever a goroutine is started, we should have a clear plan about when it will stop. Last but not least, if a goroutine creates resources and its lifetime is bound to the lifetime of the application, itâs probably safer to wait for this goroutine to complete before exiting the application. This way, we can ensure that the resources can be freed.
\n
\n\nWarning \nThis mistake isn't relevant anymore from Go 1.22 (details ).
\n \nExpecting a deterministic behavior using select and channels (#64) \n\nTL;DR \nUnderstanding that select with multiple channels chooses the case randomly if multiple options are possible prevents making wrong assumptions that can lead to subtle concurrency bugs.
\n \nOne common mistake made by Go developers while working with channels is to make wrong assumptions about how select behaves with multiple channels.
\nFor example, let's consider the following case (disconnectCh is a unbuffered channel):
\ngo func () { \n for i := 0 ; i < 10 ; i ++ { \n messageCh <- i \n } \n disconnectCh <- struct {}{} \n}() \nfor { \n select { \n case v := <- messageCh : \n fmt . Println ( v ) \n case <- disconnectCh : \n fmt . Println ( \"disconnection, return\" ) \n return \n } \n} \nIf we run this example multiple times, the result will be random:
\nInstead of consuming the 10 messages, we only received a few of them. Whatâs the reason? It lies in the specification of the select statement with multiple channels (https:// go.dev/ref/spec):
\n\n
Quote
\n
If one or more of the communications can proceed, a single one that can proceed is chosen via a uniform pseudo-random selection.
\n
Unlike a switch statement, where the first case with a match wins, the select statement selects randomly if multiple options are possible.
\nThis behavior might look odd at first, but thereâs a good reason for it: to prevent possible starvation. Suppose the first possible communication chosen is based on the source order. In that case, we may fall into a situation where, for example, we only receive from one channel because of a fast sender. To prevent this, the language designers decided to use a random selection.
\nWhen using select with multiple channels, we must remember that if multiple options are possible, the first case in the source order does not automatically win. Instead, Go selects randomly, so thereâs no guarantee about which option will be chosen. To overcome this behavior, in the case of a single producer goroutine, we can use either unbuffered channels or a single channel.
\n
\nNot using notification channels (#65) \n\nTL;DR \nSend notifications using a chan struct{} type.
\n \nChannels are a mechanism for communicating across goroutines via signaling. A signal can be either with or without data.
\nLetâs look at a concrete example. We will create a channel that will notify us whenever a certain disconnection occurs. One idea is to handle it as a chan bool:
\ndisconnectCh := make ( chan bool ) \nNow, letâs say we interact with an API that provides us with such a channel. Because itâs a channel of Booleans, we can receive either true or false messages. Itâs probably clear what true conveys. But what does false mean? Does it mean we havenât been disconnected? And in this case, how frequently will we receive such a signal? Does it mean we have reconnected? Should we even expect to receive false? Perhaps we should only expect to receive true messages.
\nIf thatâs the case, meaning we donât need a specific value to convey some information, we need a channel without data. The idiomatic way to handle it is a channel of empty structs: chan struct{}.
\nNot using nil channels (#66) \n\nTL;DR \nUsing nil channels should be part of your concurrency toolset because it allows you to remove cases from select statements, for example.
\n \nWhat should this code do?
\n\nch is a chan int type. The zero value of a channel being nil, ch is nil. The goroutine wonât panic; however, it will block forever.
\nThe principle is the same if we send a message to a nil channel. This goroutine blocks forever:
\nvar ch chan int \nch <- 0 \nThen whatâs the purpose of Go allowing messages to be received from or sent to a nil channel? For example, we can use nil channels to implement an idiomatic way to merge two channels:
\nfunc merge ( ch1 , ch2 <- chan int ) <- chan int { \n ch := make ( chan int , 1 ) \n go func () { \n for ch1 != nil || ch2 != nil { // Continue if at least one channel isnât nil \n select { \n case v , open := <- ch1 : \n if ! open { \n ch1 = nil // Assign ch1 to a nil channel once closed \n break \n } \n ch <- v \n case v , open := <- ch2 : \n if ! open { \n ch2 = nil // Assigns ch2 to a nil channel once closed \n break \n } \n ch <- v \n } \n } \n close ( ch ) \n }() \n return ch \n} \nThis elegant solution relies on nil channels to somehow remove one case from the select statement.
\nLetâs keep this idea in mind: nil channels are useful in some conditions and should be part of the Go developerâs toolset when dealing with concurrent code.
\n
\nBeing puzzled about channel size (#67) \n\nTL;DR \nCarefully decide on the right channel type to use, given a problem. Only unbuffered channels provide strong synchronization guarantees. For buffered channels, you should have a good reason to specify a channel size other than one.
\n \nAn unbuffered channel is a channel without any capacity. It can be created by either omitting the size or providing a 0 size:
\nch1 := make ( chan int ) \nch2 := make ( chan int , 0 ) \nWith an unbuffered channel (sometimes called a synchronous channel), the sender will block until the receiver receives data from the channel.
\nConversely, a buffered channel has a capacity, and it must be created with a size greater than or equal to 1:
\nch3 := make ( chan int , 1 ) \nWith a buffered channel, a sender can send messages while the channel isnât full. Once the channel is full, it will block until a receiver goroutine receives a message:
\nch3 := make ( chan int , 1 ) \nch3 <- 1 // Non-blocking \nch3 <- 2 // Blocking \nThe first send isnât blocking, whereas the second one is, as the channel is full at this stage.
\nWhat's the main difference between unbuffered and buffered channels:
\n\nAn unbuffered channel enables synchronization. We have the guarantee that two goroutines will be in a known state: one receiving and another sending a message. \nA buffered channel doesnât provide any strong synchronization. Indeed, a producer goroutine can send a message and then continue its execution if the channel isnât full. The only guarantee is that a goroutine wonât receive a message before it is sent. But this is only a guarantee because of causality (you donât drink your coffee before you prepare it). \n \nIf we need a buffered channel, what size should we provide?
\nThe default value we should use for buffered channels is its minimum: 1. So, we may approach the problem from this standpoint: is there any good reason not to use a value of 1? Hereâs a list of possible cases where we should use another size:
\n\nWhile using a worker pooling-like pattern, meaning spinning a fixed number of goroutines that need to send data to a shared channel. In that case, we can tie the channel size to the number of goroutines created. \nWhen using channels for rate-limiting problems. For example, if we need to enforce resource utilization by bounding the number of requests, we should set up the channel size according to the limit. \n \nIf we are outside of these cases, using a different channel size should be done cautiously. Letâs bear in mind that deciding about an accurate queue size isnât an easy problem:
\n\n
Martin Thompson
\n
Queues are typically always close to full or close to empty due to the differences in pace between consumers and producers. They very rarely operate in a balanced middle ground where the rate of production and consumption is evenly matched.
\n
\nTL;DR \nBeing aware that string formatting may lead to calling existing functions means watching out for possible deadlocks and other data races.
\n \nItâs pretty easy to forget the potential side effects of string formatting while working in a concurrent application.
\netcd data racegithub.com/etcd-io/etcd/pull/7816 shows an example of an issue where a map's key was formatted based on a mutable values from a context.
\nDeadlock \nCan you see what the problem is in this code with a Customer struct exposing an UpdateAge method and implementing the fmt.Stringer interface?
\ntype Customer struct { \n mutex sync . RWMutex // Uses a sync.RWMutex to protect concurrent accesses \n id string \n age int \n} \nfunc ( c * Customer ) UpdateAge ( age int ) error { \n c . mutex . Lock () // Locks and defers unlock as we update Customer \n defer c . mutex . Unlock () \n if age < 0 { // Returns an error if age is negative \n return fmt . Errorf ( \"age should be positive for customer %v\" , c ) \n } \n c . age = age \n return nil \n} \nfunc ( c * Customer ) String () string { \n c . mutex . RLock () // Locks and defers unlock as we read Customer \n defer c . mutex . RUnlock () \n return fmt . Sprintf ( \"id %s, age %d\" , c . id , c . age ) \n} \nThe problem here may not be straightforward. If the provided age is negative, we return an error. Because the error is formatted, using the %s directive on the receiver, it will call the String method to format Customer. But because UpdateAge already acquires the mutex lock, the String method wonât be able to acquire it. Hence, this leads to a deadlock situation. If all goroutines are also asleep, it leads to a panic.
\nOne possible solution is to restrict the scope of the mutex lock:
\nfunc ( c * Customer ) UpdateAge ( age int ) error { \n if age < 0 { \n return fmt . Errorf ( \"age should be positive for customer %v\" , c ) \n } \n c . mutex . Lock () \n defer c . mutex . Unlock () \n c . age = age \n return nil \n} \nYet, such an approach isn't always possible. In these conditions, we have to be extremely careful with string formatting.
\nAnother approach is to access the id field directly:
\nfunc ( c * Customer ) UpdateAge ( age int ) error { \n c . mutex . Lock () \n defer c . mutex . Unlock () \n if age < 0 { \n return fmt . Errorf ( \"age should be positive for customer id %s\" , c . id ) \n } \n c . age = age \n return nil \n} \nIn concurrent applications, we should remain cautious about the possible side effects of string formatting.
\n
\nCreating data races with append (#69) \n\nTL;DR \nCalling append isnât always data-race-free; hence, it shouldnât be used concurrently on a shared slice.
\n \nShould adding an element to a slice using append is data-race-free? Spoiler: it depends.
\nDo you believe this example has a data race?
\ns := make ([] int , 1 ) \ngo func () { // In a new goroutine, appends a new element on s \n s1 := append ( s , 1 ) \n fmt . Println ( s1 ) \n}() \ngo func () { // Same \n s2 := append ( s , 1 ) \n fmt . Println ( s2 ) \n}() \nThe answer is no.
\nIn this example, we create a slice with make([]int, 1). The code creates a one-length, one-capacity slice. Thus, because the slice is full, using append in each goroutine returns a slice backed by a new array. It doesnât mutate the existing array; hence, it doesnât lead to a data race.
\nNow, letâs run the same example with a slight change in how we initialize s. Instead of creating a slice with a length of 1, we create it with a length of 0 but a capacity of 1. How about this new example? Does it contain a data race?
\ns := make ([] int , 0 , 1 ) \ngo func () { \n s1 := append ( s , 1 ) \n fmt . Println ( s1 ) \n}() \ngo func () { \n s2 := append ( s , 1 ) \n fmt . Println ( s2 ) \n}() \nThe answer is yes. We create a slice with make([]int, 0, 1). Therefore, the array isnât full. Both goroutines attempt to update the same index of the backing array (index 1), which is a data race.
\nHow can we prevent the data race if we want both goroutines to work on a slice containing the initial elements of s plus an extra element? One solution is to create a copy of s.
\nWe should remember that using append on a shared slice in concurrent applications can lead to a data race. Hence, it should be avoided.
\n
\nUsing mutexes inaccurately with slices and maps (#70) \n\nTL;DR \nRemembering that slices and maps are pointers can prevent common data races.
\n \nLet's implement a Cache struct used to handle caching for customer balances. This struct will contain a map of balances per customer ID and a mutex to protect concurrent accesses:
\ntype Cache struct { \n mu sync . RWMutex \n balances map [ string ] float64 \n} \nNext, we add an AddBalance method that mutates the balances map. The mutation is done in a critical section (within a mutex lock and a mutex unlock):
\nfunc ( c * Cache ) AddBalance ( id string , balance float64 ) { \n c . mu . Lock () \n c . balances [ id ] = balance \n c . mu . Unlock () \n} \nMeanwhile, we have to implement a method to calculate the average balance for all the customers. One idea is to handle a minimal critical section this way:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n balances := c . balances // Creates a copy of the balances map \n c . mu . RUnlock () \n sum := 0. \n for _ , balance := range balances { // Iterates over the copy, outside of the critical section \n sum += balance \n } \n return sum / float64 ( len ( balances )) \n} \nWhat's the problem with this code?
\nIf we run a test using the -race flag with two concurrent goroutines, one calling AddBalance (hence mutating balances) and another calling AverageBalance, a data race occurs. Whatâs the problem here?
\nInternally, a map is a runtime.hmap struct containing mostly metadata (for example, a counter) and a pointer referencing data buckets. So, balances := c.balances doesnât copy the actual data. Therefore, the two goroutines perform operations on the same data set, and one mutates it. Hence, it's a data race.
\nOne possible solution is to protect the whole AverageBalance function:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n defer c . mu . RUnlock () // Unlocks when the function returns \n sum := 0. \n for _ , balance := range c . balances { \n sum += balance \n } \n return sum / float64 ( len ( c . balances )) \n} \nAnother option, if the iteration operation isnât lightweight, is to work on an actual copy of the data and protect only the copy:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n m := maps . Clone ( c . balances ) \n c . mu . RUnlock () \n\n sum := 0. \n for _ , balance := range m { \n sum += balance \n } \n return sum / float64 ( len ( m )) \n} \nOnce we have made a deep copy, we release the mutex. The iterations are done on the copy outside of the critical section.
\nIn summary, we have to be careful with the boundaries of a mutex lock. In this section, we have seen why assigning an existing map (or an existing slice) to a map isnât enough to protect against data races. The new variable, whether a map or a slice, is backed by the same data set. There are two leading solutions to prevent this: protect the whole function, or work on a copy of the actual data. In all cases, letâs be cautious when designing critical sections and make sure the boundaries are accurately defined.
\n
\nMisusing sync.WaitGroup (#71) \n\nTL;DR \nTo accurately use sync.WaitGroup, call the Add method before spinning up goroutines.
\n \nIn the following example, we will initialize a wait group, start three goroutines that will update a counter atomically, and then wait for them to complete. We want to wait for these three goroutines to print the value of the counter (which should be 3):
\nwg := sync . WaitGroup {} \nvar v uint64 \nfor i := 0 ; i < 3 ; i ++ { \n go func () { \n wg . Add ( 1 ) \n atomic . AddUint64 ( & v , 1 ) \n wg . Done () \n }() \n} \nwg . Wait () \nfmt . Println ( v ) \nIf we run this example, we get a non-deterministic value: the code can print any value from 0 to 3. Also, if we enable the -race flag, Go will even catch a data race.
\nThe problem is that wg.Add(1) is called within the newly created goroutine, not in the parent goroutine. Hence, there is no guarantee that we have indicated to the wait group that we want to wait for three goroutines before calling wg.Wait().
\nTo fix this issue, we can call wg.Add before the loop:
\nwg := sync . WaitGroup {} \nvar v uint64 \nwg . Add ( 3 ) \nfor i := 0 ; i < 3 ; i ++ { \n go func () { \n atomic . AddUint64 ( & v , 1 ) \n wg . Done () \n }() \n} \nwg . Wait () \nfmt . Println ( v ) \nOr inside the loop but not in the newly created goroutine:
\nwg := sync . WaitGroup {} \nvar v uint64 \nfor i := 0 ; i < 3 ; i ++ { \n wg . Add ( 1 ) \n go func () { \n atomic . AddUint64 ( & v , 1 ) \n wg . Done () \n }() \n} \nwg . Wait () \nfmt . Println ( v ) \n
\nForgetting about sync.Cond (#72) \n\nTL;DR \nYou can send repeated notifications to multiple goroutines with sync.Cond.
\n \n
\nNot using errgroup (#73) \n\nTL;DR \nYou can synchronize a group of goroutines and handle errors and contexts with the errgroup package.
\n \n
\nCopying a sync type (#74) \n\nTL;DR \nsync types shouldnât be copied.
\n \n
\nStandard Library \nProviding a wrong time duration (#75) \n\nTL;DR \nRemain cautious with functions accepting a time.Duration. Even though passing an integer is allowed, strive to use the time API to prevent any possible confusion.
\n \nMany common functions in the standard library accept a time.Duration, which is an alias for the int64 type. However, one time.Duration unit represents one nanosecond, instead of one millisecond, as commonly seen in other programming languages. As a result, passing numeric types instead of using the time.Duration API can lead to unexpected behavior.
\nA developer with experience in other languages might assume that the following code creates a new time.Ticker that delivers ticks every second, given the value 1000:
\nticker := time . NewTicker ( 1000 ) \nfor { \n select { \n case <- ticker . C : \n // Do something \n } \n} \nHowever, because 1,000 time.Duration units = 1,000 nanoseconds, ticks are delivered every 1,000 nanoseconds = 1 microsecond, not every second as assumed.
\nWe should always use the time.Duration API to avoid confusion and unexpected behavior:\n
ticker = time . NewTicker ( time . Microsecond ) \n// Or \nticker = time . NewTicker ( 1000 * time . Nanosecond ) \n
\n
\ntime.After and memory leaks (#76)\nWarning \nThis mistake isn't relevant anymore from Go 1.23 (details ).
\n \nJSON handling common mistakes (#77) \n\nUnexpected behavior because of type embedding \n \nBe careful about using embedded fields in Go structs. Doing so may lead to sneaky bugs like an embedded time.Time field implementing the json.Marshaler interface, hence overriding the default marshaling behavior.
\n
\n\nJSON and the monotonic clock \n \nWhen comparing two time.Time structs, recall that time.Time contains both a wall clock and a monotonic clock, and the comparison using the == operator is done on both clocks.
\n
\n\nTo avoid wrong assumptions when you provide a map while unmarshaling JSON data, remember that numerics are converted to float64 by default.
\n
\nCommon SQL mistakes (#78) \n\nForgetting that sql.Open doesn't necessarily establish connections to a database \n \nCall the Ping or PingContext method if you need to test your configuration and make sure a database is reachable.
\n
\n\nForgetting about connections pooling \n \nConfigure the database connection parameters for production-grade applications.
\n\nNot using prepared statements \n \nUsing SQL prepared statements makes queries more efficient and more secure.
\n
\n\nMishandling null values \n \nDeal with nullable columns in tables using pointers or sql.NullXXX types.
\n
\n\nNot handling rows iteration errors \n \nCall the Err method of sql.Rows after row iterations to ensure that you havenât missed an error while preparing the next row.
\n
\nNot closing transient resources (HTTP body, sql.Rows, and os.File) (#79) \n\nTL;DR \nEventually close all structs implementing io.Closer to avoid possible leaks.
\n \n
\nForgetting the return statement after replying to an HTTP request (#80) \n\nTL;DR \nTo avoid unexpected behaviors in HTTP handler implementations, make sure you donât miss the return statement if you want a handler to stop after http.Error.
\n \nConsider the following HTTP handler that handles an error from foo using http.Error:
\nfunc handler ( w http . ResponseWriter , req * http . Request ) { \n err := foo ( req ) \n if err != nil { \n http . Error ( w , \"foo\" , http . StatusInternalServerError ) \n } \n _ , _ = w . Write ([] byte ( \"all good\" )) \n w . WriteHeader ( http . StatusCreated ) \n} \nIf we run this code and err != nil, the HTTP response would be:
\n\nThe response contains both the error and success messages, and also the first HTTP status code, 500. There would also be a warning log indicating that we attempted to write the status code multiple times:
\nThe mistake in this code is that http.Error does not stop the handler's execution, which means the success message and status code get written in addition to the error. Beyond an incorrect response, failing to return after writing an error can lead to the unwanted execution of code and unexpected side-effects. The following code adds the return statement following the http.Error and exhibits the desired behavior when ran:
\nfunc handler ( w http . ResponseWriter , req * http . Request ) { \n err := foo ( req ) \n if err != nil { \n http . Error ( w , \"foo\" , http . StatusInternalServerError ) \n return // Adds the return statement \n } \n _ , _ = w . Write ([] byte ( \"all good\" )) \n w . WriteHeader ( http . StatusCreated ) \n} \n
\nUsing the default HTTP client and server (#81) \n\nTL;DR \nFor production-grade applications, donât use the default HTTP client and server implementations. These implementations are missing timeouts and behaviors that should be mandatory in production.
\n \n
\nTesting \n\n\nTL;DR \nCategorizing tests using build flags, environment variables, or short mode makes the testing process more efficient. You can create test categories using build flags or environment variables (for example, unit versus integration tests) and differentiate short from long-running tests to decide which kinds of tests to execute.
\n \n
\nNot enabling the race flag (#83) \n\nTL;DR \nEnabling the -race flag is highly recommended when writing concurrent applications. Doing so allows you to catch potential data races that can lead to software bugs.
\n \nIn Go, the race detector isnât a static analysis tool used during compilation; instead, itâs a tool to find data races that occur at runtime. To enable it, we have to enable the -race flag while compiling or running a test. For example:
\n\nOnce the race detector is enabled, the compiler instruments the code to detect data races. Instrumentation refers to a compiler adding extra instructions: here, tracking all memory accesses and recording when and how they occur.
\nEnabling the race detector adds an overhead in terms of memory and execution time; hence, it's generally recommended to enable it only during local testing or continuous integration, not production.
\nIf a race is detected, Go raises a warning. For example:
\npackage main \nimport ( \n \"fmt\" \n) \nfunc main () { \n i := 0 \n go func () { i ++ }() \n fmt . Println ( i ) \n} \nRunning this code with the -race logs the following warning:
\n================== \n DATA RACE\nWrite at 0x00c000026078 by goroutine 7 : # (1) \n main.main.func1() \n /tmp/app/main.go:9 +0x4e\nPrevious read at 0x00c000026078 by main goroutine: # (2) \n main.main() \n /tmp/app/main.go:10 +0x88\nGoroutine 7 ( running) created at: # (3) \n main.main() \n /tmp/app/main.go:9 +0x7a\n================== \n\nIndicates that goroutine 7 was writing \nIndicates that the main goroutine was reading \nIndicates when the goroutine 7 was created \n \nLetâs make sure we are comfortable reading these messages. Go always logs the following:
\n\nThe concurrent goroutines that are incriminated: here, the main goroutine and goroutine 7. \nWhere accesses occur in the code: in this case, lines 9 and 10. \nWhen these goroutines were created: goroutine 7 was created in main(). \n \nIn addition, if a specific file contains tests that lead to data races, we can exclude it !race build tag:
\n//go:build !race \npackage main \nimport ( \n \"testing\" \n) \nfunc TestFoo ( t * testing . T ) { \n // ... \n} \nNot using test execution modes (parallel and shuffle) (#84) \n\nTL;DR \nUsing the -parallel flag is an efficient way to speed up tests, especially long-running ones. Use the -shuffle flag to help ensure that a test suite doesnât rely on wrong assumptions that could hide bugs.
\n \nNot using table-driven tests (#85) \n\nTL;DR \nTable-driven tests are an efficient way to group a set of similar tests to prevent code duplication and make future updates easier to handle.
\n \n
\nSleeping in unit tests (#86) \n\nTL;DR \nAvoid sleeps using synchronization to make a test less flaky and more robust. If synchronization isnât possible, consider a retry approach.
\n \n
\nNot dealing with the time API efficiently (#87) \n\nTL;DR \nUnderstanding how to deal with functions using the time API is another way to make a test less flaky. You can use standard techniques such as handling the time as part of a hidden dependency or asking clients to provide it.
\n \n
\nNot using testing utility packages (httptest and iotest) (#88) \n\nThe httptest package is helpful for dealing with HTTP applications. It provides a set of utilities to test both clients and servers. \n \n
\n\nThe iotest package helps write io.Reader and test that an application is tolerant to errors. \n \n
\nWriting inaccurate benchmarks (#89) \n\nTL;DR \nRegarding benchmarks:
\n\nUse time methods to preserve the accuracy of a benchmark. \nIncreasing benchtime or using tools such as benchstat can be helpful when dealing with micro-benchmarks. \nBe careful with the results of a micro-benchmark if the system that ends up running the application is different from the one running the micro-benchmark. \nMake sure the function under test leads to a side effect, to prevent compiler optimizations from fooling you about the benchmark results. \nTo prevent the observer effect, force a benchmark to re-create the data used by a CPU-bound function. \n \n \nRead the full section here .
\n
\nNot exploring all the Go testing features (#90) \n\nUse code coverage with the -coverprofile flag to quickly see which part of the code needs more attention.
\n\nTesting from a different package \n \nPlace unit tests in a different package to enforce writing tests that focus on an exposed behavior, not internals.
\n
\n\nHandling errors using the *testing.T variable instead of the classic if err != nil makes code shorter and easier to read.
\n
\n\nYou can use setup and teardown functions to configure a complex environment, such as in the case of integration tests.
\n
\n\n\nTL;DR \nFuzzing is an efficient strategy to detect random, unexpected, or malformed inputs to complex functions and methods in order to discover vulnerabilities, bugs, or even potential crashes.
\n \nCredits: @jeromedoucet
\nOptimizations \nNot understanding CPU caches (#91) \n\nUnderstanding how to use CPU caches is important for optimizing CPU-bound applications because the L1 cache is about 50 to 100 times faster than the main memory.
\n\nBeing conscious of the cache line concept is critical to understanding how to organize data in data-intensive applications. A CPU doesnât fetch memory word by word; instead, it usually copies a memory block to a 64-byte cache line. To get the most out of each individual cache line, enforce spatial locality.
\n
\n\nSlice of structs vs. struct of slices \n \n\n\n
\n\nMaking code predictable for the CPU can also be an efficient way to optimize certain functions. For example, a unit or constant stride is predictable for the CPU, but a non-unit stride (for example, a linked list) isnât predictable.
\n
\n\nCache placement policy \n \nTo avoid a critical stride, hence utilizing only a tiny portion of the cache, be aware that caches are partitioned.
\nWriting concurrent code that leads to false sharing (#92) \n\nTL;DR \nKnowing that lower levels of CPU caches arenât shared across all the cores helps avoid performance-degrading patterns such as false sharing while writing concurrency code. Sharing memory is an illusion.
\n \nRead the full section here .
\n
\nNot taking into account instruction-level parallelism (#93) \n\nTL;DR \nUse ILP to optimize specific parts of your code to allow a CPU to execute as many parallel instructions as possible. Identifying data hazards is one of the main steps.
\n \n
\nNot being aware of data alignment (#94) \n\nTL;DR \nYou can avoid common mistakes by remembering that in Go, basic types are aligned with their own size. For example, keep in mind that reorganizing the fields of a struct by size in descending order can lead to more compact structs (less memory allocation and potentially a better spatial locality).
\n \n
\nNot understanding stack vs. heap (#95) \n\nTL;DR \nUnderstanding the fundamental differences between heap and stack should also be part of your core knowledge when optimizing a Go application. Stack allocations are almost free, whereas heap allocations are slower and rely on the GC to clean the memory.
\n \n
\nNot knowing how to reduce allocations (API change, compiler optimizations, and sync.Pool) (#96) \n\nTL;DR \nReducing allocations is also an essential aspect of optimizing a Go application. This can be done in different ways, such as designing the API carefully to prevent sharing up, understanding the common Go compiler optimizations, and using sync.Pool.
\n \n
\nNot relying on inlining (#97) \n\nTL;DR \nUse the fast-path inlining technique to efficiently reduce the amortized time to call a function.
\n \n\n\nTL;DR \nRely on profiling and the execution tracer to understand how an application performs and the parts to optimize.
\n \nRead the full section here .
\nNot understanding how the GC works (#99) \n\nTL;DR \nUnderstanding how to tune the GC can lead to multiple benefits such as handling sudden load increases more efficiently.
\n \n\nWarning \nThis mistake isn't relevant anymore from Go 1.25 (details ).
\n \n\nThanks to all the contributors:
\n\n
\nPowered by \n
\n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n\n\n\n\n\n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
Japanese Version - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n\n\n \n \n\n\nGoč¨čŞă§ăăăăĄăŞééă \n\nThe Coder Cafe \năăç§ăŽćŹă漽ăăă§ăăă ăăăŞăăç§ăŽćć°ăăă¸ă§ăŻăăŤăăčĺłăăăăăăăăžăăăThe Coder Cafe ăŻăăłăźăăźĺăăŽćĽĺăăĽăźăšăŹăżăźă§ăă
\n\nFeeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
\n \n
\n \năăŽăăźă¸ăŻă100 Go MistakesăăŽĺ
厚ăăžă¨ăăăăŽă§ăăä¸ćšă§ăăłăăĽăăăŁăŤéăăăăăźă¸ă§ăăăăžăăăăăăăĄăŞééăăăć°ăăŤčż˝ĺ ăăăăšăă ă¨ăčăă§ăăă community mistake issue ăä˝ćăăŚăă ăăă
\n
\n\n注ć \nçžĺ¨ă大ĺš
ăŤĺ¤ăăŽăłăłăăłăăčż˝ĺ ăăŚĺźˇĺăăŚăăć°ăăăăźă¸ă§ăłăé˛čŚ§ăăŚăăžăăăăŽăăźă¸ă§ăłăŻăžă éçşä¸ă§ăăĺéĄăčŚă¤ăăĺ ´ĺăŻăŠăăć°čť˝ăŤPRăä˝ćăăŚăă ăăă
\n \năłăźăă¨ăăă¸ă§ăŻăć§ć \nćĺłçă§ăŞăĺ¤ć°ăŽăˇăŁăăźă¤ăłă° (#1) \n\nčŚç´ \nĺ¤ć°ăŽăˇăŁăăźă¤ăłă°ăéżăăăă¨ăŻă誤ăŁăĺ¤ć°ăŽĺç
§ăčŞăżćăŽćˇˇäšąăé˛ăăžăă
\n \nĺ¤ć°ăŽăˇăŁăăźă¤ăłă°ăŻăĺ¤ć°ĺăăăăăŻĺ
ă§ĺ厣č¨ăăăăă¨ă§çăăžăăăăăăŻééăăĺźă辡ăăăăăăăžăăĺ¤ć°ăŽăˇăŁăăźă¤ăłă°ăçŚć˘ăăăăŠăăăŻĺäşşăŽĺĽ˝ăżăŤăăăžăăăă¨ăă°ăă¨ăŠăźăŤĺŻžă㌠err ăŽăăăŞć˘ĺăŽĺ¤ć°ĺăĺĺŠç¨ăăă¨äžżĺŠăŞĺ ´ĺăăăăžăăă¨ăŻăăăăłăźăăŻăłăłăă¤ăŤăăăăăŽăŽăĺ¤ăĺăĺăŁăĺ¤ć°ăäşćăăăăŽă§ăŻăŞăă¨ăăăˇăăŞăŞăŤç´é˘ăăĺŻč˝ć§ăăăăăăĺĺă¨ăăŚĺźăçśă注ćăćăĺż
čŚăăăăžăă
\nă˝ăźăšăłăźă
\nä¸ĺż
čŚăŤăăšăăăăăłăźă (#2) \n\nčŚç´ \năăšăă桹ăăŞăăŞăăăăŤăăăăăăźăăšă塌ĺ´ăŤćăăăă¨ă§ăĄăłăżăŤăłăźăă˘ăăŤăć§çŻăăăă¨ă厚ćăŤăŞăăžăă
\n \nä¸čŹçăŤăé˘ć°ăăă桹ăăăšăăčŚćąăăăťăŠăčŞăă§ç解ăăăă¨ăăăč¤éăŤăŞăăžăăç§ăăĄăŽăłăźăăŽĺŻčŞć§ăćéŠĺăăăăăŤăăăŽăŤăźăŤăŽéŠç¨ćšćłăčŚăŚăăăžăăăă
\n\nif ăăăăŻăčżăăăă¨ăăăăšăŚăŽĺ ´ĺăŤăă㌠else ăăăăŻăççĽăăĺż
čŚăăăăžăă ăă¨ăă°ă揥ăŽăăăŤć¸ăăšăă§ăŻăăăžăăă \nif foo () { \n // ... \n return true \n} else { \n // ... \n} \n䝣ăăăŤă揥ăŽăă㍠else ăăăăŻăççĽăăžăă
\nif foo () { \n // ... \n return true \n} \n// ... \n\năăłăăăăźăăšă§ăăăŽăă¸ăăŻăŤĺžăăă¨ăĺŻč˝ă§ăă \n \nif s != \"\" { \n // ... \n} else { \n return errors . New ( \"empty string\" ) \n} \năăă§ăŻă犺㎠s ăăăłăăăăźăăšă襨ăăžăăăăăăŁăŚă揥ăŽăăăŤćĄäťśăă˛ăŁăăčżăĺż
čŚăăăăžăă
\nif s == \"\" { \n return errors . New ( \"empty string\" ) \n} \n// ... \nčŞăżăăăăłăźăăć¸ăăă¨ăŻăăăšăŚăŽéçşč
ăŤă¨ăŁăŚéčŚăŞčŞ˛éĄă§ăăăăšăăăăăăăăŻăŽć°ăć¸ăăăăĺŞăăăăăăźăăšă塌ĺ´ăŤćăăă§ăăă ăćŠăćťăăă¨ăăăłăźăăŽĺŻčŞć§ăĺä¸ăăăĺ
ˇä˝çăŞć掾ă§ăă
\nă˝ăźăšăłăźă
\ninité˘ć°ăŽčŞ¤ç¨ (#3) \n\nčŚç´ \nĺ¤ć°ăĺćĺăăă¨ăăŻăinité˘ć°ăŽă¨ăŠăźĺŚçăĺśéăăăŚăăăăšăăźăăŽĺŚçă¨ăăšăăăăč¤éăŤăŞăăă¨ăŤćł¨ćăăŚăă ăăăăťă¨ăăŠăŽĺ ´ĺăĺćĺăŻçšĺŽăŽé˘ć°ă¨ăăŚĺŚçăăăăšăă§ăă
\n \ninité˘ć°ăŻăă˘ăăŞăąăźăˇă§ăłăŽăšăăźăăĺćĺăăăăăŤä˝żç¨ăăăé˘ć°ă§ăăĺźć°ăĺăăăçľćăčżăăžăăďź func() é˘ć°ďźăăăăąăźă¸ăĺćĺăăăă¨ăăăăąăźă¸ĺ
ăŽăăšăŚăŽĺŽć°ăăăłĺ¤ć°ăŽĺŽŁč¨ăčŠäžĄăăăžăă揥ăŤăinité˘ć°ăĺŽčĄăăăžăă
\ninité˘ć°ăŻăăă¤ăăŽĺéĄăĺźă辡ăăĺŻč˝ć§ăăăăžăă
\n\nă¨ăŠăźĺŚçăĺśéăăăĺŻč˝ć§ăăăăžăă \năăšăăŽĺŽčŁ
ćšćłăč¤éăŤăŞăĺŻč˝ć§ăăăăžăďźăă¨ăă°ăĺ¤é¨äžĺé˘äżăč¨ĺŽăăĺż
čŚăăăăžăăăĺä˝ăăšăăŽçŻĺ˛ă§ăŻĺż
čŚăŞăĺŻč˝ć§ăăăăžăďźă \nĺćĺă§ăšăăźăăč¨ĺŽăăĺż
čŚăăăĺ ´ĺăŻăă°ăăźăăŤĺ¤ć°ă使ç¨ăăŚčĄăĺż
čŚăăăăžăă \n \ninité˘ć°ăŤăŻćł¨ćăĺż
čŚă§ăăăă ăăéçć§ćăŽĺŽçžŠăŞăŠăçśćłăŤăăŁăŚăŻĺ˝šçŤă¤ĺ ´ĺăăăăžăăăă䝼ĺ¤ăŽăťă¨ăăŠăŽĺ ´ĺăĺćĺĺŚçăŻçšĺŽăŽé˘ć°ăéăăŚčĄăăăăšăă§ăă
\nă˝ăźăšăłăźă
\nă˛ăăżăźă¨ăťăăżăźăŽäšąç¨ (#4) \n\nčŚç´ \nGoč¨čŞă§ăŻăć
Łç¨çăŤă˛ăăżăźă¨ăťăăżăźăŽä˝żç¨ă埡ĺśăăăă¨ăŻăăăžăăăĺŽĺŠăéčŚăăĺšçć§ă¨çšĺŽăŽć
ŁçżăŤĺžăăă¨ă¨ăŽéăŽéŠĺăŞăăŠăłăšăčŚă¤ăăăă¨ăăé˛ăăšăéă§ăăăŻăă§ăă
\n \năăźăżăŽăŤăăťăŤĺă¨ăŻăăŞăă¸ă§ăŻăăŽĺ¤ăžăăŻçść
ăé ăăă¨ăćăăžăăă˛ăăżăźă¨ăťăăżăźăŻăă¨ăŻăšăăźăăăăŚăăŞăăŞăă¸ă§ăŻăăăŁăźăŤăăŽä¸ăŤă¨ăŻăšăăźăăăăăĄă˝ăăăćäžăăăă¨ă§ăŤăăťăŤĺăĺŻč˝ăŤăăć掾ă§ăă
\nGoč¨čŞă§ăŻăä¸é¨ăŽč¨čŞă§čŚăăăăăăŞă˛ăăżăźă¨ăťăăżăźăŽčŞĺăľăăźăăŻăăăžăăăăžăăă˛ăăżăźă¨ăťăăżăźă使ç¨ăăŚć§é ä˝ăăŁăźăŤăăŤă˘ăŻăťăšăăăă¨ăŻĺż
é ă§ăć
Łç¨çă§ăăăăžăăăĺ¤ăăăăăăŞăć§é ä˝ăŽă˛ăăżăźă¨ăťăăżăźă§ăłăźăăĺăăăšăă§ăŻăăăžăăăĺŽĺŠăéčŚăăäťăŽăăă°ăŠăăłă°ăăŠăă¤ă ă§ćăŤăŻč°čŤăŽä˝ĺ°ăăŞăă¨čăăăăŚăăć
ŁçżăŤĺžăăă¨ă¨ăĺšçć§ă¨ăŽéăŽéŠĺăŞăăŠăłăšăčŚă¤ăăăăĺŞăăăšăă§ăă
\nGoč¨čŞăŻăăˇăłăăŤăăĺŤăĺ¤ăăŽçšć§ăčć
ŽăăŚč¨č¨ăăăçŹčŞăŽč¨čŞă§ăăăă¨ăĺżăăŞăă§ăă ăăăăă ăăă˛ăăżăźă¨ăťăăżăźăŽĺż
čŚć§ăčŚă¤ăăŁăĺ ´ĺăăžăăŻĺčż°ăŽăăăŤăĺćšäşćć§ăäżč¨źăăŞăăĺ°ćĽăŽĺż
čŚć§ăäşć¸Źăăăĺ ´ĺăŻăăăăă使ç¨ăăăă¨ăŤĺéĄăŻăăăžăăă
\nă¤ăłăżăă§ăźăšćąć (#5) \n\nčŚç´ \nć˝čąĄĺăŻä˝ćăăăăšăăăŽă§ăŻăŞăăçşčŚăăăăšăăăŽă§ăăä¸ĺż
čŚăŞč¤éăăéżăăăăăŤăă¤ăłăżăă§ăźăšăŻăĺż
čŚăŤăŞăă¨äşć¸Źăăă¨ăă§ăŻăŞăăĺż
čŚăŤăŞăŁăă¨ăăŤä˝ćăăăăĺ°ăŞăă¨ăć˝čąĄĺăćĺšă§ăăăă¨ă訟ćă§ăăĺ ´ĺăŤä˝ćăăŚăă ăăă
\n \nă¤ăłăżăă§ăźăšăŻăăŞăă¸ă§ăŻăăŽĺä˝ăćĺŽăăćšćłăćäžăăžăăč¤ć°ăŽăŞăă¸ă§ăŻăăĺŽčŁ
ă§ăăĺ
ąéé
ăć˝ĺşăăăăăŤăă¤ăłăżăă§ăźăšăŻä˝żç¨ăăăžăăGoč¨čŞăŽă¤ăłăżăă§ăźăšă大ăăç°ăŞăăŽăŻăćéťçăŤćşăăăăăă¨ă§ăăăŞăă¸ă§ăŻă X ăă¤ăłăżăă§ăźăš Y ăĺŽčŁ
ăăŚăăăă¨ă示ă implements ăŽăăăŞć示çăŞăăźăŻăźăăŻăăăžăăă
\nä¸čŹăŤăă¤ăłăżăă§ăźăšă䞥ĺ¤ăăăăăă¨čăăăă丝čŚăŞä˝żç¨äžăŻďźă¤ăăăžăăăăăŻăĺ
ąéăŽĺä˝ăé¤ĺ¤ăăăä˝ăăăŽĺé˘ăä˝ćăăăăăăłĺăçšĺŽăŽĺä˝ăŤĺśéăăă¨ăăăăŽă§ăăăă ăăăăŽăŞăšăăŻăăšăŚă眲çž
ăăŚăăăăă§ăŻăŞăăç´é˘ăăçśćłăŤăăŁăŚăç°ăŞăăžăă
\nĺ¤ăăŽĺ ´ĺăă¤ăłăżăă§ăźăšăŻć˝čąĄĺăăăăăŤä˝ćăăăžăăăăăŚăăăă°ăŠăăłă°ă§ć˝čąĄĺăăă¨ăăŽä¸ťăŞćł¨ćçšăŻăć˝čąĄĺăŻä˝ćăăăăšăă§ăŻăŞăăçşčŚăăăăšăă§ăăă¨ăăăă¨ăčŚăăŚăăăă¨ă§ăăăăŞăăĄăăăăăç´ćĽăŽççąăăŞăéăăăłăźăĺ
ă§ć˝čąĄĺăăšăă§ăŻăŞăă¨ăăăă¨ă§ăăă¤ăłăżăă§ăźăšă使ăŁăŚč¨č¨ăăăŽă§ăŻăŞăăĺ
ˇä˝çăŞăăźăşăĺž
ă¤ăšăă§ăăĺĽăŽč¨ăćšăăăă°ăă¤ăłăżăă§ăźăšăŻĺż
čŚăŤăŞăă¨äşć¸Źăăă¨ăă§ăŻăŞăăĺż
čŚăŤăŞăŁăă¨ăăŤä˝ćăăĺż
čŚăăăăžăă\nă¤ăłăżăă§ăźăšăŽé庌ăŞä˝żç¨ăăăĺ ´ĺăŽä¸ťăŞĺéĄăŻä˝ă§ăăăăăçăăŻăăłăźăăăăźăăăč¤éăŤăŞăăă¨ă§ăă彚ăŤçŤăăŞăéćĽĺç
§ăčż˝ĺ ăăŚăä˝ăŽäžĄĺ¤ăăăăžăăăăăăŻäžĄĺ¤ăŽăŞăć˝čąĄĺăăăăă¨ă§ăăłăźăăčŞăżăç解ăăć¨čŤăăăă¨ăăăăŤĺ°éŁăŤăăžăăă¤ăłăżăă§ăźăšăčż˝ĺ ăăć確ăŞççąăăŞăăă¤ăłăżăă§ăźăšăŤăăŁăŚăłăźăăăŠăŽăăăŤćšĺăăăăăä¸ćçăŞĺ ´ĺăŻăăăŽă¤ăłăżăă§ăźăšăŽçŽçăŤç°č°ăĺąăăĺż
čŚăăăăžăăĺŽčŁ
ăç´ćĽĺźăłĺşăăŽăä¸ă¤ăŽćă§ăă
\năłăźăĺ
ă§ć˝čąĄĺăăă¨ăăŻćł¨ćăĺż
čŚă§ăďźć˝čąĄĺăŻä˝ćăăăŽă§ăŻăŞăăçşčŚăăĺż
čŚăăăăžăďźăĺžă§ĺż
čŚăŤăŞăĺŻč˝ć§ăăăăăŽăčć
ŽăăĺŽç§ăŞć˝čąĄĺăŹăăŤăć¨ć¸ŹăăŚăç§ăăĄă˝ăăăŚă§ă˘éçşč
ăŻăłăźăăăŞăźăăźă¨ăłă¸ăă˘ăŞăłă°ăăăă¨ăăăăăăžăăăťă¨ăăŠăŽĺ ´ĺăăłăźăăä¸ĺż
čŚăŞć˝čąĄĺă§ćąćăăăčŞăżăŤăăăŞăăăăăăŽăăăťăšăŻéżăăăšăă§ăă
\n\n
ăăăťăă¤ăŻ
\n
ă¤ăłăżăă§ăźăšă§ăăśă¤ăłăăăŞăă¤ăłăżăă§ăźăšăčŚă¤ăĺşăă
\n
ć˝čąĄçăŤĺéĄă解湺ăăăă¨ăăăŽă§ăŻăŞăăäťč§Łćąşăăšăăă¨ă解湺ăăžăăăăćĺžăŤéčŚăŞăă¨ă§ăăăă¤ăłăżăă§ăźăšăŤăăŁăŚăłăźăăăŠăŽăăăŤćšĺăăăăăä¸ćçăŞĺ ´ĺăŻăăłăźăăç°Ąç´ ĺăăăăăŤă¤ăłăżăă§ăźăšăĺé¤ăăăă¨ăć¤č¨ăăĺż
čŚăăăă§ăăăă
\nă˝ăźăšăłăźă
\nççŁč
ĺ´ăŽă¤ăłăżăă§ăźăš (#6) \n\nčŚç´ \nă¤ăłăżăă§ăźăšăăŻăŠă¤ă˘ăłăĺ´ă§äżćăăăă¨ă§ä¸ĺż
čŚăŞć˝čąĄĺăĺéżă§ăăžăă
\n \nGoč¨čŞă§ăŻă¤ăłăżăă§ăźăšăćéťçăŤćşăăăăžăăăăăŻăć示çăŞĺŽčŁ
ăćă¤č¨čŞă¨ćŻčźăăŚĺ¤§ăăŞĺ¤ĺăăăăăĺžĺăăăăžăăăťă¨ăăŠăŽĺ ´ĺăĺžăăšăă˘ăăăźăăŻĺăŽăťăŻăˇă§ăłă§čŞŹćăăăăŽââć˝čąĄĺăŻä˝ćăăăŽă§ăŻăŞăăçşčŚăăĺż
čŚăăă ââăŤäźźăŚăăžăăăăăŻăăăšăŚăŽăŻăŠă¤ă˘ăłăăŤĺŻžăăŚçšĺŽăŽć˝čąĄĺă埡ĺśăăăŽăŻççŁč
ăŽĺ˝šĺ˛ă§ăŻăŞăăă¨ăćĺłăăžăă䝣ăăăŤăä˝ăăăŽĺ˝˘ĺźăŽć˝čąĄĺăĺż
čŚăăŠăăăĺ¤ćăăăăŽăăźăşăŤćéŠăŞć˝čąĄĺăŹăăŤăćąşĺŽăăăŽăŻăŻăŠă¤ă˘ăłăăŽč˛Źäťťă§ăă
\năťă¨ăăŠăŽĺ ´ĺăă¤ăłăżăă§ăźăšăŻćśč˛ťč
ĺ´ăŤĺĺ¨ăăĺż
čŚăăăăžăăăă ăăçšĺŽăŽçśćłďźăă¨ăă°ăć˝čąĄĺăćśč˛ťč
ăŤă¨ăŁăŚĺ˝šçŤă¤ăă¨ăăăăŁăŚăăââäşć¸ŹăŻăăŚăăŞăââĺ ´ĺďźă§ăŻăăăăççŁč
ĺ´ă§ä˝żç¨ăăăĺ ´ĺăăăăžăăăăăăĺ ´ĺăĺŻč˝ăŞéăćĺ°éăŤćăăĺĺŠç¨ĺŻč˝ć§ăéŤăăăăç°ĄĺăŤć§ćă§ăăăăăŤĺŞăăăšăă§ăă
\nă˝ăźăšăłăźă
\nă¤ăłăżăă§ăźăšăčżă (#7) \n\nčŚç´ \nćčťć§ăŤĺéĄăăŞăăăăŤăăăăăŤăé˘ć°ăŻăťă¨ăăŠăŽĺ ´ĺăă¤ăłăżăă§ăźăšă§ăŻăŞăĺ
ˇä˝çââăŞĺŽčŁ
ăčżăĺż
čŚăăăăžăăéăŤăé˘ć°ăŻĺŻč˝ăŞéăă¤ăłăżăă§ăźăšăĺăĺ
Ľăăĺż
čŚăăăăžăă
\n \năťă¨ăăŠăŽĺ ´ĺăă¤ăłăżăă§ăźăšă§ăŻăŞăĺ
ˇä˝çăŞĺŽčŁ
ăčżăĺż
čŚăăăăžăăăăă§ăŞăă¨ăăăąăźă¸ăŽäžĺé˘äżăŤăăč¨č¨ăăăŁăăč¤éăŤăŞăăăăšăŚăŽăŻăŠă¤ă˘ăłăăĺăć˝čąĄĺăŤäžĺăăĺż
čŚăăăăăăćčťć§ăŤćŹ ăăĺŻč˝ć§ăăăăžăăçľčŤăŻĺăŽăťăŻăˇă§ăłă¨äźźăŚăăžăăć˝čąĄĺăăŻăŠă¤ă˘ăłăăŤă¨ăŁăŚĺ˝šçŤă¤ăă¨ăďźäşć¸Źăăăă§ăŻăŞăďźăăăŁăŚăăĺ ´ĺăŻăă¤ăłăżăă§ăźăšăčżăăă¨ăć¤č¨ăăŚăăăă§ăăăăăă䝼ĺ¤ăŽĺ ´ĺăŻăć˝čąĄĺă埡ĺśăăšăă§ăŻăăăžăăăăăăăŻăŻăŠă¤ă˘ăłăăŤăăŁăŚçşčŚăăăĺż
čŚăăăăžăăä˝ăăăŽççąă§ăŻăŠă¤ă˘ăłăăĺŽčŁ
ăć˝čąĄĺăăĺż
čŚăăăĺ ´ĺă§ăăăŻăŠă¤ă˘ăłăĺ´ă§ăăăčĄăăă¨ăă§ăăžăă
\nany ăŻä˝ăč¨ăăŞă (#8)\nčŚç´ \njson.Marshal ăŞăŠčăăăăăšăŚăŽĺăĺăĺ
Ľăăăčżăĺż
čŚăăăĺ ´ĺăŤăŽăż any ă使ç¨ăăŚăă ăăăăă䝼ĺ¤ăŽĺ ´ĺăany ăŻćĺłăŽăăć
ĺ ąăćäžăăăĺźăłĺşăĺ
ăäťťćăŽăăźăżĺăŽăĄă˝ăăăĺźăłĺşăăă¨ă訹ĺŻăăăăăăłăłăă¤ăŤćăŤĺéĄăçşçăăĺŻč˝ć§ăăăăžăă
\n \nany ĺăŻăčăăăăăšăŚăŽĺăĺăĺ
Ľăăăčżăĺż
čŚăăăĺ ´ĺďźăă¨ăă°ăăăźăˇăŁăŞăłă°ăăăŠăźăăăăŽĺ ´ĺďźăŤĺ˝šçŤăĄăžăăĺĺă¨ăăŚăłăźăăé庌ăŤä¸čŹĺăăăă¨ăŻä˝ă¨ăăŚăéżăăăšăă§ăăăłăźăăŽčĄ¨çžĺăŞăŠăŽäťăŽĺ´é˘ăĺä¸ăăĺ ´ĺăŻăăłăźăăĺ°ăéč¤ăăăăťăăčŻăăă¨ăăăăžăă
\nă˝ăźăšăłăźă
\nă¸ă§ăăŞăăŻăšăăă¤ä˝żç¨ăăăšăăç解ăăŚăăŞă (#9) \n\nčŚç´ \nă¸ă§ăăŞăăŻăšă¨ĺăăŠăĄăźăżăźăĺŠç¨ăăăă¨ă§ăčŚç´ ăĺä˝ăé¤ĺ¤ăăăăăŽăă¤ăŠăźăăŹăźăăłăźăăéżăăăă¨ăă§ăăžăăăă ăăĺăăŠăĄăźăżăŻććĺ°ćŠăŤä˝żç¨ăăăĺ
ˇä˝çăŞĺż
čŚć§ăăăăŁăĺ ´ĺăŤăŽăżä˝żç¨ăăŚăă ăăăăăă§ăŞăăă°ăä¸ĺż
čŚăŞć˝čąĄĺă¨č¤éăăçăăžăă
\n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nă˝ăźăšăłăźă
\nĺăŽĺăčžźăżă§čľˇăăăăĺéĄăććĄăăŚăăŞă (#10) \n\nčŚç´ \nĺĺăčžźăżă使ç¨ăăă¨ăăă¤ăŠăźăăŹăźăăłăźăăĺéżăăăă¨ăă§ăăžăăăă ăăăăăăăă¨ă§ăä¸é¨ăŽăăŁăźăŤăăé襨示ăŤăăŚăăĺż
čŚăăăĺ ´ĺăŤĺéĄăçşçăăŞăăăăŤăăŚăă ăăă
\n \nć§é ä˝ăä˝ćăăă¨ăăGoč¨čŞăŻĺăĺăčžźăăŞăăˇă§ăłăćäžăăžăăăă ăăĺĺăčžźăżăŽćĺłăăăšăŚç解ăăŚăăŞăă¨ăäşćłĺ¤ăŽĺä˝ăçşçăăĺŻč˝ć§ăăăăžăăăăŽăťăŻăˇă§ăłă§ăŻăĺăĺăčžźăćšćłăăăăăăăăăăŽăăăăłčăăăăĺéĄăŤă¤ăăŚčŚăŚăăăžăă
\nGoč¨čŞă§ăŻăĺĺăŞăă§ĺŽŁč¨ăăăć§é ä˝ăăŁăźăŤăăŻăĺăčžźăżă¨ĺźă°ăăžăăăă¨ăă°ă揥ăŽăăăŞăăŽă§ăă
\ntype Foo struct { \n Bar // ĺăčžźăżăăŁăźăŤă \n} \ntype Bar struct { \n Baz int \n} \nFoo ć§é ä˝ă§ăŻăBar ĺăé˘éŁäťăăăăĺĺăŞăă§ĺŽŁč¨ăăăŚăăžăăăăăăŁăŚăăăăŻĺăčžźăżăăŁăźăŤăă§ăă
\nĺăčžźăżă使ç¨ăăăă¨ă§ăĺăčžźăżĺăŽăăŁăźăŤăă¨ăĄă˝ăăăŻćć źăăžăăBar ăŤăŻ Baz ăăŁăźăŤăăĺŤăžăăŚăăăăăăăŽăăŁăźăŤă㯠Foo ăŤćć źăăžăăăăăăŁăŚăFoo ăă Baz ăĺŠç¨ă§ăăăăăŤăŞăăžăă
\nĺăŽĺăčžźăżăŤă¤ăăŚä˝ăč¨ăăă§ăăăăăăžăăăăăĺż
čŚăŤăŞăăă¨ăŻăťă¨ăăŠăŞăăăŚăźăšăąăźăšăä˝ă§ăăăăăăăĺĺăčžźăżăŞăă§ăĺć§ăŤč§Łćąşă§ăăăă¨ăćĺłăăžăăĺăŽĺăčžźăżăŻä¸ťăŤĺŠäžżć§ăçŽçă¨ăăŚä˝żç¨ăăăžăăăťă¨ăăŠăŽĺ ´ĺăăăăŻĺä˝ăćć źăăăăăŤä˝żç¨ăăăžăă
\nĺĺăčžźăżă使ç¨ăăĺ ´ĺăŻă揥㎠2 ă¤ăŽä¸ťăŞĺśç´ăĺżľé ăŤç˝Žăĺż
čŚăăăăžăă
\n\năăŁăźăŤăă¸ăŽă˘ăŻăťăšăç°Ąç´ ĺăăăăăŽçłčĄŁć§ćă¨ăăŚăŽăżä˝żç¨ăăŞăă§ăă ăăďź Foo.Bar.Baz() ăŽäťŁăă㍠Foo.Baz() ăŞăŠďźă ăăăĺŻä¸ăŽć šć ă§ăăĺ ´ĺăŻăĺ
é¨ĺăĺăčžźăžăă䝣ăăăŤăăŁăźăŤăă使ăăžăăăă \nĺ¤é¨ăăé ăăăăăźăżďźăăŁăźăŤăďźăĺä˝ďźăĄă˝ăăďźăćć źăăŚăŻăŞăăžăăăăă¨ăă°ăć§é ä˝ăŤĺŻžăăŚăăŠă¤ăăźăăŞăžăžăŤăăŚăăĺż
čŚăăăăăăŻĺä˝ăŤăŻăŠă¤ă˘ăłăăă˘ăŻăťăšă§ăăăăăŤăăĺ ´ĺăŞăŠă§ăă \n \năăăăŽĺśç´ăĺżľé ăŤç˝ŽăăŚĺĺăčžźăżăćčçăŤä˝żç¨ăăă¨ăčż˝ĺ ăŽčť˘éăĄă˝ăăăŤăăăă¤ăŠăźăăŹăźăăłăźăăĺéżăăăŽăŤĺ˝šçŤăĄăžăăăă ăăčŚăçŽă ăăçŽçă¨ăăăăé ăăšăčŚç´ ăćć źăăăăăŞăăăăŤćł¨ćăăžăăăă
\nă˝ăźăšăłăźă
\nFunctional Options ăăżăźăłă使ç¨ăăŚăăŞă (#11) \n\nčŚç´ \nAPI ăŤéŠăăćšćłă§ăŞăăˇă§ăłăäžżĺŠăŤĺŚçăăăŤăŻăFunctional Options ăăżăźăłă使ç¨ăăžăăăă
\n \năăžăăžăŞĺŽčŁ
ćšćłăĺĺ¨ăăĺ¤ĺ°ăŽéăăŻăăăžăăă丝ăŞčăćšăŻćŹĄăŽă¨ăăă§ăă
\n\nćŞă¨ăŻăšăăźăăŽć§é ä˝ăŻăŞăăˇă§ăłč¨ĺŽăäżćăăžăă \nĺăŞăăˇă§ăłăŻĺăĺătype Option func(options *options) ă¨ăŠăźăčżăé˘ć°ă§ăăăă¨ăă°ăWithPort ăŻăăźăă襨ă int ĺźć°ăĺăĺăăoptions ć§é ä˝ăŽć´ć°ćšćłă襨ă Option ĺăčżăăžăă \n \n
\ntype options struct { \n port * int \n} \ntype Option func ( options * options ) error \nfunc WithPort ( port int ) Option { \n return func ( options * options ) error { \n if port < 0 { \n return errors . New ( \"port should be positive\" ) \n } \n options . port = & port \n return nil \n } \n} \nfunc NewServer ( addr string , opts ... Option ) ( * http . Server , error ) { \n var options options \n for _ , opt := range opts { \n err := opt ( & options ) \n if err != nil { \n return nil , err \n } \n } \n// ăăŽćŽľéă§ăoptions ć§é ä˝ăć§çŻăăăć§ćăĺŤăžăăžăă \n// ăăăăŁăŚăăăźăč¨ĺŽăŤé˘éŁăăăă¸ăăŻăĺŽčŁ
ă§ăăžăă \n var port int \n if options . port == nil { \n port = defaultHTTPPort \n } else { \n if * options . port == 0 { \n port = randomPort () \n } else { \n port = * options . port \n } \n } \n // ... \n} \nFunctional Options ăăżăźăłăŻăăŞăăˇă§ăłăĺŚçăăăăăŽć蝽㧠API ăăŹăłăăŞăźăŞćšćłăćäžăăžăă Builder ăăżăźăłăŻćĺšăŞăŞăăˇă§ăłă§ăăăăăă¤ăăŽĺ°ăăŞćŹ çšďźçŠşăŽĺŻč˝ć§ăăăć§ćć§é ä˝ă渥ăăŞăăă°ăŞăăŞăăăžăăŻă¨ăŠăźăĺŚçăăćšćłăăăžăäžżĺŠă§ăŻăŞăďźăăăăăăŽç¨ŽăŽĺéĄăŤăă㌠Functional Options ăăżăźăłăGoč¨čŞăŤăăăć
Łç¨çăŞĺŻžĺŚćšćłăŤăŞăĺžĺăăăăžăă
\nă˝ăźăšăłăźă
\n誤ăŁăăăă¸ă§ăŻăć§ć (ăăă¸ă§ăŻăć§é ă¨ăăăąăźă¸ć§ć) (#12) \nĺ
¨ä˝çăŞć§ćăŤé˘ăăŚăŻăăăžăăžăŞčăćšăăăăžăăăă¨ăă°ăă˘ăăŞăąăźăˇă§ăłăăłăłăăăšăăă¨ăŤć´çăăšăăăăăă¨ăăŹă¤ă¤ăźăă¨ăŤć´çăăšăăăăăăŻĺĽ˝ăżăŤăăŁăŚç°ăŞăăžăăăłăłăăăšăďźéĄ§ĺŽ˘ăłăłăăăšăăĺĽç´ăłăłăăăšăăŞăŠďźăă¨ăŤăłăźăăă°ăŤăźăĺăăăă¨ăé¸ăśĺ ´ĺăăăă°ăĺ
č§ĺ˝˘ăŽă˘ăźăăăŻăăŁĺĺăŤĺžăăă¨ă¨ăćčĄĺą¤ăă¨ăŤă°ăŤăźăĺăăăă¨ăé¸ăśĺ ´ĺăăăăžăăç§ăăĄăčĄăćąşĺŽăä¸č˛ŤăăŚăăéăăăăăăŚăźăšăąăźăšăŤéŠĺăăăŞăăăăăééăŁăŚăăăă¨ăŻăăăžăăă
\năăăąăźă¸ăŤé˘ăăŚăŻăĺžăăšăăăšăăăŠăŻăăŁăšăč¤ć°ăăăžăăăžăăăăă¸ă§ăŻăăé庌ăŤč¤éăŤăŞăĺŻč˝ć§ăăăăăăććĺ°ćŠăŞăăăąăźă¸ĺăŻéżăăăšăă§ăăĺ ´ĺăŤăăŁăŚăŻăĺŽç§ăŞć§é ăćĺăăçĄçăŤä˝ăăă¨ăăăăăăĺç´ăŞć§ćă使ç¨ăăăăŽĺ
厚ăç解ăăä¸ă§ăăă¸ă§ăŻăăçşĺąăăăăťăăčŻăĺ ´ĺăăăăžăă\nç˛ĺşŚăčć
ŽăăšăéčŚăŞçšă§ăă 1 ă¤ăžă㯠2 ă¤ăŽăăĄă¤ăŤă ăăĺŤăć°ĺăŽăăăăăąăźă¸ăä˝ćăăăă¨ăŻéżăăăšăă§ăăăăŽĺ ´ĺăăăăăăăăăŽăăăąăźă¸éăŽčŤççăŞćĽçśăŽä¸é¨ăćăč˝ăĄăčŞăżćăŤă¨ăŁăŚăăă¸ă§ăŻăăç解ăăŤăăăŞăăăă§ăăéăŤăăăăąăźă¸ĺăŽćĺłăčăăăăăŞĺˇ¨ĺ¤§ăŞăăăąăźă¸ăéżăăăšăă§ăă
\năăăąăźă¸ăŽĺĺäťăă注ćăăŚčĄăĺż
čŚăăăăžăăďźéçşč
ăŞăďźčŞ°ăăçĽăŁăŚăăăăăŤăĺĺăäťăăăŽăŻéŁăăă§ăăăŻăŠă¤ă˘ăłăă Go ăăă¸ă§ăŻăăç解ăăăăăăăŤăăăăąăźă¸ăŤĺŤăžăăăăŽă§ăŻăŞăăćäžăăăăŽăŤĺşăĽăăŚăăăąăźă¸ăŤĺĺăäťăăĺż
čŚăăăăžăăăžăăăăźăăłă°ăŤăŻćĺłăŽăăăăŽăäťăăĺż
čŚăăăăžăăăăăăŁăŚăăăăąăźă¸ĺăŻçăăç°Ąć˝ă§ă襨çžĺčąăă§ăć
ŁäžăŤăăĺä¸ăŽĺ°ćĺăŤăăĺż
čŚăăăăžăă
\nä˝ăă¨ăŻăšăăźăăăăăŤă¤ăăŚăŽăŤăźăŤăŻé常ăŤç°Ąĺă§ăăăăăąăźă¸éăŽçľĺăć¸ăăăă¨ăŻăšăăźăăăăä¸čŚăŞčŚç´ ăé襨示ăŤăăăăăŤăă¨ăŻăšăăźăăăĺż
čŚăăăăăŽăă§ăăéăćĺ°éăŤćăăĺż
čŚăăăăžăăčŚç´ ăă¨ăŻăšăăźăăăăăŠăăä¸ćăŞĺ ´ĺăŻăăăăŠăŤăă§ă¨ăŻăšăăźăăăŞăăăăŤăăĺż
čŚăăăăžăăĺžă§ă¨ăŻăšăăźăăăĺż
čŚăăăăă¨ăĺ¤ćăăĺ ´ĺăŻăăłăźăă調ć´ă§ăăžăăăžăăć§é ä˝ă encoding/json ă§ă˘ăłăăźăˇăŁăŞăłă°ă§ăăăăăŤăăŁăźăŤăăă¨ăŻăšăăźăăăăŞăŠăăăă¤ăăŽäžĺ¤ăŤăçćăăŚăă ăăă
\năăă¸ă§ăŻăăć§ćăăăŽăŻç°Ąĺă§ăŻăăăžăăăăăăăăŽăŤăźăŤăŤĺžăăă¨ă§çśćă厚ćăŤăŞăăžăăăă ăăäżĺŽć§ă厚ćăŤăăăăăŤăŻä¸č˛Ťć§ăéčŚă§ăăăă¨ăŤćł¨ćăăŚăă ăăăăăăăŁăŚăăłăźăăăźăšĺ
ă§ĺŻč˝ăŞéăä¸č˛Ťć§ăäżă¤ăăăŤăăžăăăă
\n\nčŁčśł \nGo ăăźă 㯠Go ăăă¸ă§ăŻăăŽçľçšĺ/ć§é ĺăŤé˘ăăĺ
ŹĺźăŹă¤ăăŠă¤ăłă 2023 ĺš´ăŤçşčĄăăžăăďź go.dev/doc/modules/layout
\n \năŚăźăăŁăŞăăŁăăăąăźă¸ăŽä˝ć (#13) \n\nčŚç´ \nĺĺäťăăŻă˘ăăŞăąăźăˇă§ăłč¨č¨ăŽéčŚăŞé¨ĺă§ăăcommon ăutil ăshared ăŽăăăŞăăăąăźă¸ăä˝ćăăŚăăčŞăżćăŤăăăťăŠăŽäžĄĺ¤ăăăăăăžăăăăăŽăăăŞăăăąăźă¸ăćĺłăŽăăĺ
ˇä˝çăŞăăăąăźă¸ĺăŤăŞăăĄăŻăżăŞăłă°ăăžăăăă
\n \năžăăăăăąăźă¸ăŤĺŤăžăăăăŽă§ăŻăŞăăăăăąăźă¸ăćäžăăăăŽăŤĺşăĽăăŚăăăąăźă¸ăŤĺĺăäťăăă¨ăăăŽčĄ¨çžĺăéŤăăĺšççăŞćšćłăŤăŞăăă¨ăŤăçćăăŚăă ăăă
\nă˝ăźăšăłăźă
\năăăąăźă¸ĺăŽčĄçŞăçĄčŚăă (#14) \n\nčŚç´ \n桡䚹ăăăăŤăŻăă°ăŤă¤ăŞăăăăăŞăăĺ¤ć°ă¨ăăăąăźă¸éăŽĺĺăŽčĄçŞăĺéżăăăăăŤăăăăăăŤä¸ćăŽĺĺă使ç¨ăăžăăăăăăăä¸ĺŻč˝ăŞĺ ´ĺăŻăă¤ăłăăźăă¨ă¤ăŞă˘ăšă使ç¨ăăŚäżŽéŁžĺăĺ¤ć´ăăŚăăăąăźă¸ĺă¨ĺ¤ć°ĺăĺşĺĽăăăăăăčŻăĺĺăčăăŚăă ăăă
\n \năăăąăźă¸ăŽčĄçŞăŻăĺ¤ć°ĺăć˘ĺăŽăăăąăźă¸ĺă¨čĄçŞăăĺ ´ĺăŤçşçăăăăăąăźă¸ăŽĺĺŠç¨ă匨ăăăăžăăćć§ăăéżăăăăăŤăĺ¤ć°ĺăŽčĄçŞăé˛ăĺż
čŚăăăăžăăčĄçŞăçşçăăĺ ´ĺăŻăĺĽăŽćĺłăŽăăĺĺăčŚă¤ăăăăă¤ăłăăźăă¨ă¤ăŞă˘ăšă使ç¨ăăĺż
čŚăăăăžăă
\năłăźăăŽćçŤ ĺăčĄăăăŚăăŞă (#15) \n\nčŚç´ \năŻăŠă¤ă˘ăłăă¨ăĄăłăăăăłăźăăŽćĺłăç解ă§ăăăăăŤăă¨ăŻăšăăźăăăăčŚç´ ăćçŤ ĺăăžăăăă
\n \nćçŤ ĺăŻăłăźăăŁăłă°ăŽéčŚăŞĺ´é˘ă§ăăăăăŤăăăăŻăŠă¤ă˘ăłăă API ăăăç°ĄĺăŤä˝żç¨ăăăă¨ăă§ăăžăăăăăă¸ă§ăŻăăŽçśćăŤă彚çŤăĄăžăăGoč¨čŞă§ăŻăăłăźăăć
Łç¨çăŞăăŽăŤăăăăăŤăăăă¤ăăŽăŤăźăŤăŤĺžăĺż
čŚăăăăžăă
\năžăăă¨ăŻăšăăźăăăăăăšăŚăŽčŚç´ ăćçŤ ĺăăĺż
čŚăăăăžăăć§é ăă¤ăłăżăă§ăźăšăé˘ć°ăŞăŠăă¨ăŻăšăăźăăăĺ ´ĺăŻćçŤ ĺăăĺż
čŚăăăăžăăć
Łäžă¨ăăŚăă¨ăŻăšăăźăăăăčŚç´ ăŽĺĺăăĺ§ăžăăłăĄăłăăčż˝ĺ ăăžăă
\nć
Łäžă¨ăăŚăĺăłăĄăłăăŻĺĽčŞçšă§çľăăĺŽĺ
¨ăŞćă§ăăĺż
čŚăăăăžăăăžăăé˘ć°ďźăžăăŻăĄă˝ăăďźăćçŤ ĺăăă¨ăăŻăé˘ć°ăăŠăŽăăăŤĺŽčĄăăăă§ăŻăŞăăăăŽé˘ć°ăä˝ăĺŽčĄăăă¤ăăă§ăăăă埡調ăăĺż
čŚăăăăă¨ăŤăçćăăŚăă ăăăăăăŻăăăĽăĄăłăă§ăŻăŞăăé˘ć°ă¨ăłăĄăłăăŤă¤ăăŚă§ăăăăăĽăĄăłăăŻçćłçăŤăŻăĺŠç¨č
ăă¨ăŻăšăăźăăăăčŚç´ ăŽä˝żç¨ćšćłăç解ăăăăăŤăłăźăăčŚăĺż
čŚăăŞăăťăŠĺĺăŞć
ĺ ąăćäžăăĺż
čŚăăăăžăă
\nĺ¤ć°ăžăăŻĺŽć°ăćçŤ ĺăăĺ ´ĺăăăŽçŽçă¨ĺ
厚ă¨ăă 2 ă¤ăŽĺ´é˘ăäźăăăă¨ăéčŚăăăăăžăăăĺč
ăŻăĺ¤é¨ăŻăŠă¤ă˘ăłăăŤă¨ăŁăŚĺ˝šçŤă¤ăăăŤăăłăźăăăăĽăĄăłăă¨ăăŚĺĺ¨ăăĺż
čŚăăăăžăăăă ăăĺžč
ăŻĺż
ăăăĺ
Źéăăăăšăă§ăŻăăăžăăă
\năŻăŠă¤ă˘ăłăă¨ăĄăłăăăăăăąăźă¸ăŽçŽçăç解ă§ăăăăăŤăĺăăăąăźă¸ăăăăĽăĄăłăăăĺż
čŚăăăăžăăć
Łäžă¨ăăŚăăłăĄăłă㯠//Package ă§ĺ§ăžăăăăŽĺžăŤăăăąăźă¸ĺăçśăăžăăăăăąăźă¸ăłăĄăłăăŽćĺăŽčĄăŻăăăăąăźă¸ăŤčĄ¨ç¤şăăăăăç°Ąć˝ăŤăăĺż
čŚăăăăžăăăăăŚă揥ăŽčĄăŤĺż
čŚăŞć
ĺ ąăăăšăŚĺ
Ľĺăăžăă
\năłăźăăćçŤ ĺăăăă¨ăĺśç´ăŤăŞăăšăă§ăŻăăăžăăăăŻăŠă¤ă˘ăłăăăĄăłăăăăłăźăăŽćĺłăç解ăăăŽăŤĺ˝šçŤă¤ĺż
čŚăăăăžăă
\năŞăłăżăźă使ç¨ăăŚăŞă (#16) \n\nčŚç´ \năłăźăăŽĺ質ă¨ä¸č˛Ťć§ăĺä¸ăăăăŤăŻăăŞăłăżăźă¨ăăŠăźăăăżăźă使ç¨ăăžăăă
\n \năŞăłăżăźăŻăăłăźăăĺćăăŚă¨ăŠăźăć¤ĺşăăčŞĺăăźăŤă§ăăăăŽăťăŻăˇă§ăłăŽçŽçăŻăć˘ĺăŽăŞăłăżăźăŽĺŽĺ
¨ăŞăŞăšăăćäžăăăă¨ă§ăŻăăăžăăăăăăăĺ ´ĺăăăăŤä˝żăçŠăŤăŞăăŞăăŞăŁăŚăăžăăăă§ăăăă ăăăťă¨ăăŠăŽ Go ăăă¸ă§ăŻăăŤăŞăłăżăźăä¸ĺŻćŹ ă§ăăă¨ăăăă¨ăŻç解ăăčŚăăŚăăăžăăăă
\n\năŞăłăżăźăŽăťăăŤăăłăźăăšăżă¤ăŤă俎ćŁăăăăăŤăłăźăăăŠăźăăăżăźă使ç¨ăăžăăăă䝼ä¸ăŤăăăă¤ăăŽăłăźăăăŠăźăăăżăźă示ăăžăă
\n\năťă㍠golangci-lint (https://github.com/golangci/golangci-lint ) ă¨ăăăăŽăăăăžăăăăăŻăĺ¤ăăŽäžżĺŠăŞăŞăłăżăźăăăŠăźăăăżăźăŽä¸ăŤăăĄăľăźăăćäžăăăŞăłăăŁăłă°ăăźăŤă§ăăăžăăăŞăłăżăźă丌ĺĺŽčĄăăŚĺćé庌ăĺä¸ăăăăă¨ăă§ăăé常ăŤäžżĺŠă§ăă
\năŞăłăżăźă¨ăăŠăźăăăżăźăŻăăłăźăăăźăšăŽĺ質ă¨ä¸č˛Ťć§ăĺä¸ăăă埡ĺăŞćšćłă§ăăćéăăăăŚăŠăă使ç¨ăăšăăăç解ăăăăăăŽĺŽčĄďź CI ă Git ăăŞăłăăăăăăŻăŞăŠďźăčŞĺĺăăžăăăă
\năăźăżĺ \n8 é˛ć°ăŞăăŠăŤă§ćˇˇäšąăćăăŚăăžă (#17) \n\nčŚç´ \nć˘ĺăŽăłăźăăčŞăă¨ăăŻă 0 ă§ĺ§ăžăć´ć°ăŞăăŠăŤă 8 é˛ć°ă§ăăăă¨ăŤçćăăŚăă ăăăăžăăćĽé čž 0o ăäťăăăă¨ă§8é˛ć°ă§ăăăă¨ăć確ăŤăăčŞăżăăăăĺä¸ăăăžăăăă
\n \n8 é˛ć°ăŻ 0 ă§ĺ§ăžăăžăďźăă¨ăă°ă010 㯠10 é˛ć°ăŽ 8 ăŤç¸ĺ˝ăăžăďźăĺŻčŞć§ăĺä¸ăăăĺ°ćĽăŽăłăźăăŞăźăăźăŽć˝ĺ¨çăŞééăăĺéżăăăŤăŻă 0o ćĽé čžă使ç¨ă㌠8 é˛ć°ă§ăăăă¨ăćăăăŤăăžăăăďźäž: 0o10 ďźă
\näťăŽć´ć°ăŞăăŠăŤčĄ¨çžăŤă注ćăăŚăă ăăă
\n\năă¤ă㪠- ćĽé čž 0b ăăă㯠0B ă使ç¨ăăžăďźăă¨ăă°ă 0b 㯠10 é˛ć°ăŽ 4 ăŤç¸ĺ˝ăăžăďź16é˛ć° - ćĽé čž 0x ăăă㯠0X ă使ç¨ăăžăďźăă¨ăă°ă 0xF 㯠10 é˛ć°ăŽ 15 ăŤç¸ĺ˝ăăžăďźă čć° - ćĽĺ°žčž i ă使ç¨ăăžăďźăă¨ăă°ă 3i ďź \nčŞăżăăăăăăăăŤăĺşĺăćĺă¨ăăŚă˘ăłăăźăšăłă˘ďź _ ďźă使ç¨ăăăă¨ăă§ăăžăăăă¨ăă°ă 10 ĺ㯠1_000_000_000 ăŽăăăŤć¸ăăă¨ăă§ăăžăăă˘ăłăăźăšăłă˘ăŻ 0b)00_00_01 ăŽăăăŤäťăŽčĄ¨çžă¨ä˝ľç¨ăăăă¨ăă§ăăžăă
\nă˝ăźăšăłăźă
\nć´ć°ăŞăźăăźăăăźăçĄčŚăăŚăă (#18) \n\nčŚç´ \nGoč¨čŞă§ăŻć´ć°ăŽăŞăźăăźăăăźă¨ă˘ăłăăźăăăźăčŁĺ´ă§ĺŚçăăăăăăăăăăăăŁăăăăçŹčŞăŽé˘ć°ăĺŽčŁ
ă§ăăžăă
\n \nGoč¨čŞă§ăŻăăłăłăă¤ăŤćăŤć¤ĺşă§ăăć´ć°ăŞăźăăźăăăźăŤăăŁăŚăłăłăă¤ăŤă¨ăŠăźăçćăăăžăăăă¨ăă°ă揥ăŽăăăŤăŞăăžăă
\nvar counter int32 = math . MaxInt32 + 1 \n 2147483648 overflows int32\năă ăăĺŽčĄćăŤăŻăć´ć°ăŽăŞăźăăźăăăźăžăăŻă˘ăłăăźăăăźăŻçşçăăžăăăăăăŤăăŁăŚă˘ăăŞăąăźăˇă§ăłăŽăăăăŻăçşçăăăă¨ăŻăăăžăăăăăŽĺä˝ăŻăăŁăăăŞăă°ďźăă¨ăă°ăč˛ ăŽçľćăŤă¤ăŞăăć´ć°ăŽĺ˘ĺăćŁăŽć´ć°ăŽĺ çŽăŞăŠďźăŤă¤ăŞăăĺŻč˝ć§ăăăăăăé ăŤĺ
ĽăăŚăăăă¨ăéčŚă§ăă
\nă˝ăźăšăłăźă
\n澎ĺĺ°ć°çšăç解ăăŚăăŞă (#19) \n\nčŚç´ \nçšĺŽăŽăăŤăżĺ
ă§ćľŽĺĺ°ć°çšćŻčźăčĄăă¨ăăłăźăăŽç§ťć¤ć§ă確äżă§ăăžăăĺ çŽăžăăŻć¸çŽăĺŽčĄăăă¨ăăŻă粞庌ăĺä¸ăăăăăăŤăĺç¨ĺşŚăŽĺ¤§ăăăŽćźçŽăă°ăŤăźăĺăăŚăă ăăăăžăăäšçŽă¨é¤çŽăŻĺ çŽă¨ć¸çŽăŽĺăŤĺŽčĄăăŚăă ăăă
\n \nGoč¨čŞăŤăŻăďźčć°ăé¤ăăĺ ´ĺďź float32 㨠float64 ă¨ăă 2 ă¤ăŽćľŽĺĺ°ć°çšĺăăăăžăă澎ĺĺ°ć°çšăŽćŚĺżľăŻăĺ°ć°ĺ¤ă襨çžă§ăăŞăă¨ăăć´ć°ăŽĺ¤§ăăŞĺéĄă解湺ăăăăăŤçşćăăăžăăăäşćłĺ¤ăŽäşć
ăéżăăăăăŤă澎ĺĺ°ć°çšćźçŽăŻĺŽéăŽćźçŽăŽčżäźźă§ăăăă¨ăçĽăŁăŚăăĺż
čŚăăăăžăă
\năăŽăăăŤăäšçŽăŽäžăčŚăŚăżăžăăăă
\nvar n float32 = 1.0001 \nfmt . Println ( n * n ) \năăŽăłăźăăŤăăăŚăŻ 1.0001 * 1.0001 = 1.00020001 ă¨ăăçľćăĺşĺăăăăă¨ăćĺž
ăăă¨ćăăžăăăăăăŞăăăăťă¨ăăŠăŽ x86 ăăăťăăľă§ăŻă䝣ăă㍠1.0002 ăĺşĺăăăžăă
\nGoč¨čŞăŽ float32 ăăăł float64 ĺăŻčżäźźĺ¤ă§ăăăăăăăă¤ăăŽăŤăźăŤăĺżľé ăŤç˝Žăĺż
čŚăăăăžăă
\n\n2 ă¤ăŽćľŽĺĺ°ć°çšć°ăćŻčźăăĺ ´ĺăŻăăăŽĺˇŽă訹厚çŻĺ˛ĺ
ă§ăăăă¨ă確čŞăăă \nĺ çŽăžăăŻć¸çŽăĺŽčĄăăĺ ´ĺă粞庌ăéŤăăăăăŤăĺăćĄć°ăŽćźçŽăă°ăŤăźăĺăăă \n粞庌ăéŤăăăăăä¸éŁăŽćźçŽă§ĺ çŽăć¸çŽăäšçŽăé¤çŽăĺż
čŚăŞĺ ´ĺăŻăäšçŽă¨é¤çŽăćĺăŤĺŽčĄăăă \n \nă˝ăźăšăłăźă
\năšăŠă¤ăšăŽéˇăă¨ĺŽšéăç解ăăŚăăŞă (#20) \n\nčŚç´ \nGo éçşč
ăŞăă°ăăšăŠă¤ăšăŽéˇăă¨ĺŽšéăŽéăăç解ăăăšăă§ăăăšăŠă¤ăšăŽéˇăăŻăšăŠă¤ăšĺ
ăŽä˝żç¨ĺŻč˝ăŞčŚç´ ăŽć°ă§ăăăăšăŠă¤ăšăŽĺŽšéăŻăăăăłă°é
ĺĺ
ăŽčŚç´ ăŽć°ă§ăă
\n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nă˝ăźăšăłăźă
\néĺšçăŞăšăŠă¤ăšăŽĺćĺ (#21) \n\nčŚç´ \năšăŠă¤ăšăä˝ćăăă¨ăăéˇăăăă§ăŤăăăŁăŚăăĺ ´ĺăŻăćĺŽăăăéˇăăžăăŻĺŽšéă§ăšăŠă¤ăšăĺćĺăăžăăăăăăăŤăăăĺ˛ăĺ˝ăŚăŽć°ăć¸ăăăăăŠăźăăłăšăĺä¸ăăžăă
\n \nmake ă使ç¨ăăŚăšăŠă¤ăšăĺćĺăăă¨ăăŤăéˇăă¨ăŞăăˇă§ăłăŽĺŽšéăćĺŽă§ăăžăăăăăăŽăăŠăĄăźăżăŽä¸ĄćšăŤéŠĺăŞĺ¤ă渥ăăă¨ăéŠĺ˝ă§ăăăŤăăăăăăăăăăĺżăăăŽăŻăăăăééăă§ăăĺŽéăč¤ć°ăŽăłăăźăĺż
čŚăŤăŞăăä¸ćçăŞăăăăłă°é
ĺăăŻăŞăźăłă˘ăăăăăă㍠GC ăŤčż˝ĺ ăŽĺ´ĺăăăăĺŻč˝ć§ăăăăžăăăăăŠăźăăłăšăŽčŚłçšăăč¨ăă°ăGo ăŠăłăżă¤ă ăŤćă塎ă䟸ăšăŞăççąăŻăăăžăăă
\năŞăăˇă§ăłăŻăćĺŽăăă厚éăžăăŻćĺŽăăăéˇăăŽăšăŠă¤ăšăĺ˛ăĺ˝ăŚăăă¨ă§ăă ăăă 2 ă¤ăŽč§ŁćąşçăŽăăĄă2 çŞçŽăŽč§ŁćąşçăŽćšăăăăăŤéŤéă§ăăĺžĺăăăăă¨ăăăăăžăăăăă ăăçšĺŽăŽĺŽšéă¨čż˝ĺ ă使ç¨ăăă¨ăĺ ´ĺăŤăăŁăŚăŻĺŽčŁ
ă¨čŞăżĺăă厚ćăŤăŞăăă¨ăăăăžăă
\nă˝ăźăšăłăźă
\nnil ă¨çŠşăŽăšăŠă¤ăšă桡ĺăăŚăă (#22) \n\nčŚç´ \nencoding/json ă reflect ăăăąăźă¸ăŞăŠă使ç¨ăăă¨ăăŤăăăă桡䚹ăéżăăăăăŤăŻănil ăšăŠă¤ăšă¨çŠşăŽăšăŠă¤ăšăŽéăăç解ăăĺż
čŚăăăăžăăăŠăĄăăéˇăăźăă厚éăźăăŽăšăŠă¤ăšă§ăăăĺ˛ăĺ˝ăŚăĺż
čŚă¨ăăŞăăŽăŻ nil ăšăŠă¤ăšă ăă§ăă
\n \nGoč¨čŞă§ăŻănil ă¨çŠşăŽăšăŠă¤ăšăŻĺşĺĽăăăžăănil ăšăŠă¤ăšăŻ nil ăŤçăăăŽăŤĺŻžăă犺ăŽăšăŠă¤ăšăŽéˇăăŻăźăă§ăănil ăšăŠă¤ăšăŻçŠşă§ăăă犺ăŽăšăŠă¤ăšăŻĺż
ăăănil ă§ăăă¨ăŻéăăžăăăä¸ćšănil ăšăŠă¤ăšăŤăŻĺ˛ăĺ˝ăŚăŻĺż
čŚăăăžăăăăăŽăťăŻăˇă§ăłĺ
¨ä˝ăéăăŚă䝼ä¸ăŽćšćłă使ç¨ăăăă¨ăŤăăŁăŚăçśćłăŤĺżăăŚăšăŠă¤ăšăĺćĺăăăă¨ăčŚăŚăăžăăă
\n\nćçľçăŞéˇăăä¸ćă§ăšăŠă¤ăšă犺ăŽĺ ´ĺ㯠var s []string \nnil ă¨çŠşăŽăšăŠă¤ăšăä˝ćăăçłčĄŁć§ćă¨ăăŚăŽ []string(nil) \nĺ°ćĽăŽéˇăăăăăŁăŚăăĺ ´ĺ㯠make([]string, length) \n \nčŚç´ ăŞăă§ăšăŠă¤ăšăĺćĺăăĺ ´ĺăćĺžăŽăŞăăˇă§ăł []string{} ăŻéżăăăšăă§ăăćĺžăŤăäşćłĺ¤ăŽĺä˝ăé˛ăăăăŤă使ç¨ăăăŠă¤ăăŠăŞă nil ă¨çŠşăŽăšăŠă¤ăšăĺşĺĽăăŚăăăăŠăăă確čŞăăŚăżăžăăăă
\nă˝ăźăšăłăźă
\năšăŠă¤ăšă犺ăăŠăăăéŠĺăŤç˘şčŞăăŞă (#23) \n\nčŚç´ \năšăŠă¤ăšăŤčŚç´ ăĺŤăžăăŚăăŞăăă¨ă確čŞăăăŤăŻăăăŽéˇăă確čŞăăžăăăăăăăŻăăšăŠă¤ăšă nil ă§ăăă犺ă§ăăăăŤé˘äżăŞăćŠč˝ăăžăăăăăăŤă¤ăăŚăĺć§ă§ăăć確㪠API ăč¨č¨ăăăŤăŻănil ăšăŠă¤ăšă¨çŠşăŽăšăŠă¤ăšăĺşĺĽăăŞăă§ăă ăăă
\n \năšăŠă¤ăšăŤčŚç´ ăăăăăŠăăăĺ¤ćăăăŤăŻăăšăŠă¤ăšă nil ăăŠăăăăžăăŻăăŽéˇăă 0 ăŤçăăăăŠăăă確čŞăăăă¨ă§ĺ¤ćă§ăăžăăăšăŠă¤ăšă犺ă§ăăĺ ´ĺă¨ăšăŠă¤ăšă nil ă§ăăĺ ´ĺăŽä¸ĄćšăăŤăăźă§ăăăăăéˇăă確ăăăăă¨ăćčŻăŽćšćłă§ăă
\nä¸ćšăă¤ăłăżăă§ăźăšăč¨č¨ăăă¨ăăŻă蝽垎ăŞăăă°ăŠăăłă°ă¨ăŠăźă辡ăăăŞăăă nil ăšăŠă¤ăšă¨çŠşăŽăšăŠă¤ăšăĺşĺĽăăŞăăăăŤăăĺż
čŚăăăăžăăăšăŠă¤ăšăčżăă¨ăăŤănil ăžăăŻçŠşăŽăšăŠă¤ăšăčżăăăŠăăăŻăćĺłçăŤăćčĄçăŤăéăăŻăăăžăăăăłăźăŠăźăŤă¨ăŁăŚăŻăŠăĄăăĺăăă¨ăćĺłăăăŻăă§ăăăăŽĺçăŻăăăă§ăĺăă§ăăăăăă犺ăăŠăăă確čŞăăăŤăŻăăăă nil ăăŠăăă§ăŻăŞăăăăŽéˇăă確čŞăăžăăăă
\nă˝ăźăšăłăźă
\năšăŠă¤ăšăŽăłăăźăćŁăăä˝ćăăŚăăŞă (#24) \n\nčŚç´ \nçľăżčžźăżé˘ć° copy ă使ç¨ăăŚăăăšăŠă¤ăšăĺĽăŽăšăŠă¤ăšăŤăłăăźăăăŤăŻăăłăăźăăăčŚç´ ăŽć°ă 2 ă¤ăŽăšăŠă¤ăšăŽéˇăăŽéăŽćĺ°ĺ¤ăŤç¸ĺ˝ăăăă¨ăŤćł¨ćăăŚăă ăăă
\n \nčŚç´ ăăăăšăŠă¤ăšăăĺĽăŽăšăŠă¤ăšăŤăłăăźăăćä˝ăŻăăăŞăé ťçšăŤčĄăăăžăăăłăăźă使ç¨ăăĺ ´ĺăăłăăźĺ
ăŤăłăăźăăăčŚç´ ăŽć°ăŻ 2 ă¤ăŽăšăŠă¤ăšăŽéˇăăŽéăŽćĺ°ĺ¤ăŤç¸ĺ˝ăăăă¨ăŤćł¨ćăăĺż
čŚăăăăžăăăžăăăšăŠă¤ăšăăłăăźăăăăăŽäťăŽäťŁćżć掾ăĺĺ¨ăăăă¨ăŤăçćăăŚăă ăăăăăŽăăăăłăźăăăźăšă§ăăăăčŚă¤ăăŚăéŠăăă¨ăŻăăăžăăă
\nă˝ăźăšăłăźă
\nappend ăŽä˝żç¨ăŤăăäşćłĺ¤ăŽĺŻä˝ç¨ (#25)\nčŚç´ \n2ă¤ăŽç°ăŞăé˘ć°ăĺăé
ĺăŤĺşăĽăăšăŠă¤ăšă使ç¨ăăĺ ´ĺăŤăcopy ăžăăŻĺŽĺ
¨ăšăŠă¤ăšĺźă使ç¨ăăăă¨ă§ append ăŤăăčĄçŞăé˛ăăă¨ăă§ăăžăăăă ăă大ăăŞăšăŠă¤ăšă縎ĺ°ăăĺ ´ĺăăĄă˘ăŞăŞăźăŻăé˛ăăă¨ăă§ăăăŽăŻăšăŠă¤ăšăŽăłăăźă ăă§ăă
\n \năšăŠă¤ăšă使ç¨ăăă¨ăăŻăäşćłĺ¤ăŽĺŻä˝ç¨ăŤă¤ăŞăăçśćłăŤç´é˘ăăĺŻč˝ć§ăăăăă¨ăčŚăăŚăăĺż
čŚăăăăžăăçľćăŽăšăŠă¤ăšăŽéˇăăăăŽĺŽšéăăĺ°ăăĺ ´ĺăčż˝ĺ ăŤăăŁăŚĺ
ăŽăšăŠă¤ăšăĺ¤ć´ăăăĺŻč˝ć§ăăăăžăă辡ăăĺžăĺŻä˝ç¨ăŽçŻĺ˛ăĺśéăăăĺ ´ĺăŻăăšăŠă¤ăšăŽăłăăźăžăăŻĺŽĺ
¨ăšăŠă¤ăšĺźă使ç¨ă§ăăžăăăăăŤăăăăłăăźăĺŽčĄă§ăăŞăăŞăăžăă
\n\nčŁčśł \ns[low:high:max]ďźĺŽĺ
¨ăšăŠă¤ăšĺźďźââăăŽĺ˝äť¤ćăŻă厚éă max - low ăŤçăăăă¨ăé¤ăă°ăs[low:high] ă§ä˝ćăăăăšăŠă¤ăšă¨ĺć§ăŽăšăŠă¤ăšăä˝ćăăžăă
\n \nă˝ăźăšăłăźă
\năšăŠă¤ăšă¨ăĄă˘ăŞăŞăźăŻ (#26) \n\nčŚç´ \năă¤ăłăżăŽăšăŠă¤ăšăžăăŻăă¤ăłăżăăŁăźăŤăăćă¤ć§é ä˝ăćä˝ăăĺ ´ĺăăšăŠă¤ăšćä˝ăŤăăŁăŚé¤ĺ¤ăăăčŚç´ ă nil ă¨ăăăă¨ă§ăĄă˘ăŞăŞăźăŻăĺéżă§ăăžăă
\n \n厚éćźă \n大ăăŞăšăŠă¤ăšăžăăŻé
ĺăăšăŠă¤ăšăăă¨ăăĄă˘ăŞćśč˛ťăéŤăăŞăĺŻč˝ć§ăăăăă¨ăŤćł¨ćăăŚăă ăăăćŽăăŽăšăăźăšăŻ GC ăŤăăŁăŚĺĺŠç¨ăăăăĺ°ć°ăŽčŚç´ ăă使ç¨ăăŞăăŤăăăăăăă大ăăŞăăăăłă°é
ĺăäżćăăăžăăăšăŠă¤ăšăŽăłăăźăăăăă¨ă§ăăăŽăăăŞäşć
ăé˛ăăă¨ăă§ăăžăă
\nă˝ăźăšăłăźă
\năšăŠă¤ăšă¨ăă¤ăłăż \năă¤ăłăżăžăăŻăă¤ăłăżăăŁăźăŤăăĺŤăć§é ä˝ă使ç¨ăăŚăšăŠă¤ăšćä˝ăăăĺ ´ĺăGC ăăăăăŽčŚç´ ăĺĺŠç¨ăăŞăăă¨ăçĽăŁăŚăăĺż
čŚăăăăžăăăăŽĺ ´ĺăŽé¸ćč˘ăŻăăłăăźăĺŽčĄăăăăćŽăăŽčŚç´ ăžăăŻăăŽăăŁăźăŤăăć示ç㍠nil ă¨ăăăă¨ă§ăă
\nă˝ăźăšăłăźă
\néĺšçăŞăăăăŽĺćĺ (#27) \n\nčŚç´ \năăăăä˝ćăăă¨ăăăăŽéˇăăăă§ăŤăăăŁăŚăăĺ ´ĺăŻăćĺŽăăăéˇăă§ĺćĺăăžăăăăăŤăăăĺ˛ăĺ˝ăŚăŽć°ăć¸ăăăăăŠăźăăłăšăĺä¸ăăžăă
\n \năăăăŻăăăźăťĺ¤ăă˘ăŽé ĺşăŞăăłăŹăŻăˇă§ăłăćäžăăžăăăŞăăăăăăăŽăă˘ăŻĺşćăŽăăźăćăĄăžăăGoč¨čŞă§ăŻăăăăăŻăăăˇăĽăăźăăŤăăźăżć§é ăŤĺşăĽăăŚăăžăăĺ
é¨çăŤăŻăăăăˇăĽăăźăăŤăŻăăąăăăŽé
ĺă§ăăăĺăăąăăăŻăăźăťĺ¤ăă˘ăŽé
ĺă¸ăŽăă¤ăłăżă§ăă
\năăăăŤĺŤăžăăčŚç´ ăŽć°ăäşĺăŤăăăŁăŚăăĺ ´ĺăŻăăăŽĺćăľă¤ăşăćĺŽăăŚä˝ćăăĺż
čŚăăăăžăăăăăăŽĺ˘ĺ¤§ăŻăĺĺăŞăšăăźăšăĺĺ˛ăĺ˝ăŚăăăăšăŚăŽčŚç´ ăŽăăŠăłăšăĺ調ć´ăăĺż
čŚăăăăăăč¨çŽéăé常ăŤĺ¤ăăŞăăžăăăăăăŤăăăăăĺéżăăăă¨ăă§ăăžăă
\nă˝ăźăšăłăźă
\năăăă¨ăĄă˘ăŞăŞăźăŻ (#28) \n\nčŚç´ \năăăăŻăĄă˘ăŞĺ
ă§ĺ¸¸ăŤĺ˘ĺ¤§ăăĺŻč˝ć§ăăăăžăăă縎ĺ°ăăăă¨ăŻăăăžăăăăăăăŁăŚăăĄă˘ăŞăŽĺéĄăçşçăăĺ ´ĺăŻăăăăă埡ĺśçăŤĺçćăăăăăă¤ăłăżă使ç¨ăăăăăăŞăŠăăăžăăžăŞć掾ă芌ăăă¨ăă§ăăžăă
\n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nă˝ăźăšăłăźă
\n誤ăŁăćšćłăŤăăĺ¤ăŽćŻčź (#29) \n\nčŚç´ \nGoč¨čŞă§ĺăćŻčźăââăăŤăŻă2 ă¤ăŽĺăćŻčźĺŻč˝ăŞăă°ă== ćźçŽĺ㨠!= ćźçŽĺă使ç¨ă§ăăžăăçĺ˝ĺ¤ăć°ĺ¤ăćĺĺăăă¤ăłăżăăăŁăăŤăăăăłć§é ä˝ăĺŽĺ
¨ăŤćŻčźĺŻč˝ăŞĺă§ć§ćăăăŚăăžăăăă䝼ĺ¤ăŻă reflect.DeepEqual ă使ç¨ăăŚăŞăăŹăŻăˇă§ăłăŽäťŁĺăćŻćăăăçŹčŞăŽĺŽčŁ
ă¨ăŠă¤ăăŠăŞă使ç¨ăăăă¨ăă§ăăžăă
\n \nĺšćçăŤćŻčźăăăŤăŻă == 㨠!= ăŽä˝żç¨ćšćłăç解ăăăă¨ăä¸ĺŻćŹ ă§ăăăăăăŽćźçŽĺăŻăćŻčźĺŻč˝ăŞč˘ŤćźçŽĺă§ä˝żç¨ă§ăăžăă
\n\nçĺ˝ĺ¤ - 2 ă¤ăŽçĺ˝ĺ¤ăçăăăăŠăăăćŻčźăăžăă ć°ĺ¤ (intăfloatăăăăł complex ĺ) - 2 ă¤ăŽć°ĺ¤ăçăăăăŠăăăćŻčźăăžăă ćĺĺ - 2 ă¤ăŽćĺĺăçăăăăŠăăăćŻčźăăžăă ăăŁă㍠- 2 ă¤ăŽăăŁăăŤăĺă make ĺźăłĺşăăŤăăŁăŚä˝ćăăăăăăžăăŻä¸Ąćšă nil ă§ăăăăćŻčźăăžăă ă¤ăłăżăă§ăźăš - 2 ă¤ăŽă¤ăłăżăă§ăźăšăĺăĺçăżă¤ăă¨çăăĺçĺ¤ăćă¤ăăŠăăăăžăăŻä¸Ąćšă nil ă§ăăăăŠăăăćŻčźăăžăă ăă¤ăłăż - 2 ă¤ăŽăă¤ăłăżăăĄă˘ăŞĺ
ăŽĺăĺ¤ăćăăŚăăăăăžăăŻä¸Ąćšă¨ă nil ă§ăăăăćŻčźăăžăă ć§é ä˝ă¨é
ĺ - éĄäźźăăĺă§ć§ćăăăŚăăăăŠăăăćŻčźăăžăă \n\nčŁčśł \n? ă >= ă < ăăăăł > ćźçŽĺăć°ĺ¤ĺă§ä˝żç¨ăăŚĺ¤ăćŻčźăăăăćĺĺă§ĺĺĽé ĺşăćŻčźăăăăăăă¨ăă§ăăžăă
\n \n袍ćźçŽĺăćŻčźă§ăăŞăĺ ´ĺďźăšăŠă¤ăšă¨ăăăăŞăŠďźăăŞăăŹăŻăˇă§ăłăŞăŠăŽäťăŽćšćłăĺŠç¨ăăĺż
čŚăăăăžăăăŞăăŹăŻăˇă§ăłăŻăĄăżăăă°ăŠăăłă°ăŽä¸ç¨Žă§ăăăă˘ăăŞăąăźăˇă§ăłăăăŽć§é ă¨ĺä˝ăĺ
çăăŚĺ¤ć´ăăćŠč˝ăćăăžăăăă¨ăă°ăGoč¨čŞă§ăŻ reflect.DeepEqual ă使ç¨ă§ăăžăăăăŽé˘ć°ăŻă2ă¤ăŽĺ¤ăĺ帰çăŤčŞżăšăăă¨ăŤăăŁăŚă2ă¤ăŽčŚç´ ăĺŽĺ
¨ăŤçăăăăŠăăăĺ ąĺăăžăăĺăĺ
ĽăăăăčŚç´ ăŻăĺşćŹĺăŤĺ ăăŚăé
ĺăć§é ä˝ăăšăŠă¤ăšăăăăăăă¤ăłăżăă¤ăłăżăă§ăźăšăé˘ć°ă§ăăăăăăć大ăŽč˝ă¨ă犴ăŻăăăŠăźăăłăšä¸ăŽăăăŤăăŁă§ăă
\nĺŽčĄćăŽăăăŠăźăăłăšăéčŚăŞĺ ´ĺăŻăçŹčŞăŽăĄă˝ăăăĺŽčŁ
ăăăă¨ăćĺă¨ăŞăĺŻč˝ć§ăăăăžăă
\nčż˝č¨ďźć¨ćşăŠă¤ăăŠăŞăŤăŻć˘ăŤćŻčźăĄă˝ăăăăăă¤ăăăăă¨ăčŚăăŚăăĺż
čŚăăăăžăăăă¨ăă°ăćéŠĺăăă bytes.Compare é˘ć°ă使ç¨ăăŚă2ă¤ăŽăă¤ăăšăŠă¤ăšăćŻčźă§ăăžăăçŹčŞăŽăĄă˝ăăăĺŽčŁ
ăăĺăŤăčťčźŞăŽĺçşćăăăŞăăăăŤăăžăăăă
\nă˝ăźăšăłăźă
\nĺśĺžĄć§é \nčŚç´ ă range ăŤăźăĺ
ă§ăłăăźăăăăă¨ăçĽăăŞă (#30) \n\nčŚç´ \nrange ăŤăźăĺ
㎠value čŚç´ ăŻăłăăźă§ăăăăăăŁăŚăăă¨ăă°ć§é ä˝ăĺ¤ć´ăăăŤăŻăăăŽă¤ăłăăăŻăšăäťăăŚă˘ăŻăťăšăăăăĺžćĽăŽ for ăŤăźăăäťăăŚă˘ăŻăťăšăăžăăăďźĺ¤ć´ăăčŚç´ ăžăăŻăăŁăźăŤăăăă¤ăłăżă§ăăĺ ´ĺăé¤ăďźă
\n \nrange ăŤăźăă使ç¨ăăă¨ăăăžăăžăŞăăźăżć§é ăŤĺ垊ĺŚçăčĄăăă¨ăă§ăăžăă
\n\nćĺĺ \né
ĺ \né
ĺă¸ăŽăă¤ăłăż \năšăŠă¤ăš \năăă \nĺ俥ăăŁă㍠\n \nĺ¤ĺ
¸ç㪠for ăŤăźăă¨ćŻčźăăă¨ărange ăŤăźăăŻăăŽç°Ąć˝ăŞć§ćăŽăăăă§ăăăăăŽăăźăżć§é ăŽăăšăŚăŽčŚç´ ăŤĺ垊ĺŚçăăăăŽăŤäžżĺŠă§ăă
\năă ăărange ăŤăźăĺ
ăŽĺ¤čŚç´ ăŻăłăăźă§ăăăă¨ăčŚăăŚăăĺż
čŚăăăăžăăăăăăŁăŚăĺ¤ăĺ¤ć´ăăĺż
čŚăăăć§é ä˝ăŽĺ ´ĺăĺ¤ć´ăăĺ¤ăžăăŻăăŁăźăŤăăăă¤ăłăżă§ăŞăéăăčŚç´ čŞä˝ă§ăŻăŞăăłăăźăŽăżăć´ć°ăăžăărange ăŤăźăăžăăŻĺžćĽăŽ for ăŤăźăă使ç¨ăăŚă¤ăłăăăŻăšçľçąă§čŚç´ ăŤă˘ăŻăťăšăăăă¨ăć¨ĺĽ¨ăăăžăă
\nă˝ăźăšăłăźă
\nrange ăŤăźăďźăăŁăăŤă¨é
ĺďźă§ăŽĺźć°ăŽčŠäžĄćšćłăçĽăăŞă (#31)\nčŚç´ \nrange ćźçŽĺăŤć¸ĄăăăĺźăŻăŤăźăăŽéĺ§ĺ㍠1 ĺă ăčŠäžĄăăăăă¨ăç解ăăă¨ăăăŁăăŤăžăăŻăšăŠă¤ăšăŽĺ垊ĺŚçăŤăăăéĺšçăŞĺ˛ăĺ˝ăŚăŞăŠăŽăăăăĄăŞééăăĺéżă§ăăžăă
\n \nrange ăŤăźăăŻăďźăżă¤ăăŤé˘äżăŞăďźăłăăźăĺŽčĄăăăă¨ăŤăăăăŤăźăăŽéĺ§ĺăŤăćĺŽăăăĺźă 1 ĺă ăčŠäžĄăăžăăăă¨ăă°ă誤ăŁăčŚç´ ăŤă˘ăŻăťăšăăŚăăžăăă¨ăăăăăŞăăăăĄăŞééăăéżăăăăăŤăăăŽĺä˝ăčŚăăŚăăĺż
čŚăăăăžăăăă¨ăă°
\na := [ 3 ] int { 0 , 1 , 2 } \nfor i , v := range a { \n a [ 2 ] = 10 \n if i == 2 { \n fmt . Println ( v ) \n } \n} \năăŽăłăźăăŻăćĺžăŽă¤ăłăăăŻăšă 10 ăŤć´ć°ăăžăăăăăăăăŽăłăźăăĺŽčĄăăă¨ă10 ăŻĺşĺăăăžăăă 2 ăĺşĺăăăžăă
\nă˝ăźăšăłăźă
\nrange ăŤăźăĺ
ăŤăăăăă¤ăłăżčŚç´ ăŽä˝żç¨ăĺăźă役éżăĺăăŁăŚăăŞă (#32)\nčŚç´ \năăźăŤăŤĺ¤ć°ă使ç¨ăăăăă¤ăłăăăŻăšă使ç¨ăăŚčŚç´ ăŤă˘ăŻăťăšăăă¨ăăŤăźăĺ
ă§ăă¤ăłăżăăłăăźăăéăŽééăăé˛ăăă¨ăă§ăăžăă
\n \nrange ăŤăźăă使ç¨ăăŚăăźăżć§é ăŤĺ垊ĺŚçăć˝ăĺ ´ĺăăăšăŚăŽĺ¤ăĺä¸ăŽä¸ćăŽă˘ăăŹăšăćă¤ä¸ćăŽĺ¤ć°ăŤĺ˛ăĺ˝ăŚăăăăă¨ăćăĺşăăŚăă ăăăăăăŤăĺĺ垊ĺŚçä¸ăŤăăŽĺ¤ć°ăĺç
§ăăăă¤ăłăżăäżĺăăă¨ăĺăčŚç´ ăă¤ăžăćć°ăŽčŚç´ ăĺç
§ăăĺăăă¤ăłăżăäżĺăăăă¨ăŤăŞăăžăăăăŽĺéĄăŻăăŤăźăăŽăšăłăźăĺ
ăŤăăźăŤăŤĺ¤ć°ă埡ĺśçăŤä˝ćăăăăă¤ăłăăăŻăšăäťăăŚăšăŠă¤ăščŚç´ ăĺç
§ăăăă¤ăłăżăä˝ćăăăă¨ă§č§Łćąşă§ăăžăăăŠăĄăăŽč§Łćąşçă§ăĺéĄăăăžăăă
\nă˝ăźăšăłăźă
\năăăăŽĺ垊ĺŚçä¸ăŤčޤăŁă䝎ĺŽăăăďźĺ垊ĺŚçä¸ăŽé ĺşäťăă¨ăăăăŽćżĺ
Ľďź (#33) \n\nčŚç´ \năăăă使ç¨ăăă¨ăăŤäşć¸ŹĺŻč˝ăŞĺşĺăäżč¨źăăăŤăŻăăăăăŽăăźăżć§é ă揥ăŽă¨ăăă§ăăăă¨ăŤćł¨ćăăŚăă ăăă
\n \n\năăźăżăăăźă§ä¸Śăšćżăăžăă \nćżĺ
Ľé ĺşăŻäżćăăăžăă \nĺ垊ĺŚçé ĺşăŻćąşăžăŁăŚăăžăă \năăĺ垊ĺŚçä¸ăŤčż˝ĺ ăăăčŚç´ ăăăŽĺŚçä¸ăŤçćăăăăă¨ăäżč¨źăăžăă \n \n\n\nă˝ăźăšăłăźă
\nbreak ćăăŠăŽăăăŤćŠč˝ăăăăĺăăŁăŚăăŞă (#34)\nčŚç´ \năŠăăŤă¨ break ăžă㯠continue ăŽä˝ľç¨ăŻăçšĺŽăŽĺ˝äť¤ćă埡ĺśçăŤä¸ćăăžăăăăăŻăăŤăźăĺ
㎠switch ăžă㯠select ćă§ĺ˝šçŤăĄăžăă
\n \né常ăbreak ćăŻăŤăźăăŽĺŽčĄăçľäşăăăăăŤä˝żç¨ăăăžăăăŤăźăă switch ăžă㯠select ă¨çľăżĺăăăŚä˝żç¨ââăăăĺ ´ĺăçŽçăŽĺ˝äť¤ćă§ăŻăŞăăŽăŤä¸ćăăăŚăăžăăă¨ăăăăšăăăăă¨ăéçşč
ăŤăŻăăăăăžăăăă¨ăă°
\nfor i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break \n } \n} \nbreak ć㯠for ăŤăźăăçľäşăăăăŽă§ăŻăŞăă䝣ăă㍠switch ćăçľäşăăăžăăăăăăŁăŚăăăŽăłăźă㯠0 ăă 2 ăžă§ăĺ垊ăă䝣ăăăŤă0 ăă 4 ăžă§ăĺ垊ăăžăďź0 1 2 3 4ďźă
\nčŚăăŚăăăšăéčŚăŞăŤăźăŤăŽ1ă¤ăŻă break ćăŻćăĺ
ĺ´ăŽ for ăswitch ăăžă㯠select ćăŽĺŽčĄăçľäşăăă¨ăăăă¨ă§ăăĺăŽäžă§ăŻăswitch ćăçľäşăăžăă
\nswitch ćăŽäťŁăăăŤăŤăźăăä¸ćăăćăć
Łç¨çăŞćšćłăŻăŠăăŤă使ç¨ăăăă¨ă§ăă
\nloop : \n for i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break loop \n } \n } \năăă§ăŻăloop ăŠăăŤă for ăŤăźăăŤé˘éŁäťăăžăă 揥ăŤăbreak ć㍠loop ăŠăăŤăćĺŽăăăŽă§ăswitch ă§ăŻăŞă loop ăä¸ćăăăžăăăăŁăŚăăăŽć°ăăăăźă¸ă§ăłăŻäşćłăŠăă 0 1 2 ăĺşĺăăžăă
\nă˝ăźăšăłăźă
\năŤăźăĺ
㧠defer ă使ç¨ăă (#35) \n\nčŚç´ \né˘ć°ĺ
ăŽăŤăźăăă¸ăăŻăŽć˝ĺşăŻăĺĺ垊ăŽćĺžă§ăŽ defer ćăŽĺŽčĄăŤă¤ăŞăăăžăă
\n \ndefer ćăŻăä¸ä˝ăăăăŻăŽé˘ć°ăćťăăžă§ĺźăłĺşăăŽĺŽčĄăé
ăăăžăăăăăŻä¸ťăŤĺŽĺăłăźăăĺć¸ăăăăăŤä˝żç¨ăăăžăăăă¨ăă°ăăŞă˝ăźăšăćçľçăŤéăăĺż
čŚăăăĺ ´ĺăŻădefer ă使ç¨ăăŚăreturn ăĺŽčĄăăĺăŤăŻăăźă¸ăŁĺźăłĺşăăçš°ăčżăăă¨ăéżăăăă¨ăă§ăăžăă
\ndefer ă§ăăăăăăšăŽ1ă¤ăŻăä¸ä˝ăăă㯠ăŽé˘ć°ăćťăŁăă¨ăăŤé˘ć°ĺźăłĺşăăăšăąă¸ăĽăźăŤăăăăă¨ăĺżăăăă¨ă§ăăăă¨ăă°
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // ăăĄă¤ăŤăŽĺŚçăăă \n } \n return nil \n} \ndefer ĺźăłĺşăăŻăĺăŤăźăĺ垊ä¸ă§ăŻăŞăăreadFiles é˘ć°ăčżăăăă¨ăăŤĺŽčĄăăăžăă readFiles ăčżăăŞăĺ ´ĺăăăĄă¤ăŤč¨čż°ĺăŻć°¸äš
ăŤéăăăžăžăŤăŞăăăŞăźăŻăçşçăăžăă
\năăŽĺéĄă解湺ăăăăăŽä¸čŹçăŞć掾ăŽ1ă¤ăŻă defer ăŽĺžăŤăĺĺ垊ä¸ăŤĺźăłĺşăăăä¸ä˝ăăăăŻăŽé˘ć°ăä˝ćăăăă¨ă§ăă
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n if err := readFile ( path ); err != nil { \n return err \n } \n } \n return nil \n} \nfunc readFile ( path string ) error { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // ăăĄă¤ăŤăŽĺŚçăăă \n return nil \n} \nĺĽăŽč§ŁćąşçăŻăreadFile é˘ć°ăăŻăăźă¸ăŁăŤăăăă¨ă§ăăăćŹčłŞçăŤăŻĺăă§ăăĺĽăŽä¸ä˝ăăăăŻăŽé˘ć°ăčż˝ĺ ăăŚăĺĺ垊ä¸ăŤ defer ĺźăłĺşăăĺŽčĄăăžăă
\nă˝ăźăšăłăźă
\nćĺĺ \năŤăźăłăç解ăăŚăăŞă (#36) \n\nčŚç´ \năŤăźăłă Unicode ăłăźăăă¤ăłăăŽćŚĺżľăŤĺŻžĺżăăč¤ć°ăŽăă¤ăă§ć§ćăăăĺŻč˝ć§ăăăăă¨ăç解ăăăă¨ăŻă Go éçşč
ăćĺĺăćŁç˘şăŤćä˝ăăăăăŤä¸ĺŻćŹ ă§ăă
\n \nGoč¨čŞă§ăŻăŤăźăłăăăăăĺ ´ćăŤä˝żç¨ăăăăăă揥ăŽçšăç解ăăăă¨ăéčŚă§ăă
\n\nćĺăťăăăŻćĺăŽéĺă§ăăăă¨ăłăłăźăăŁăłă°ăŻćĺăťăăăăă¤ăăŞăŤĺ¤ćăăćšćłăč¨čż°ăăžăă \nGoč¨čŞă§ăŻăćĺĺăŻäťťćăŽăă¤ăăŽä¸ĺ¤ăšăŠă¤ăšăĺç
§ăăžăă \nGoč¨čŞăŽă˝ăźăšăłăźă㯠UTF-8 ă§ă¨ăłăłăźăăăăŚăăžăăăăăăŁăŚăăăšăŽćĺĺăŞăăŠăŤăŻ UTF-8 ćĺĺă§ăăăă ăăćĺĺăŤăŻäťťćăŽăă¤ăăĺŤăžăăĺŻč˝ć§ăăăăăăćĺĺăďźă˝ăźăšăłăźăă§ăŻăŞăďźäťăŽĺ ´ćăăĺĺžăăăĺ ´ĺăăăŽćĺĺă UTF-8 ă¨ăłăłăźăăŁăłă°ăŤĺşăĽăăŚăăäżč¨źăŻăăăžăăă \nrune 㯠Unicode ăłăźăăă¤ăłăăŽćŚĺżľăŤĺŻžĺżăăĺä¸ăŽĺ¤ă§čĄ¨ăăăă˘ă¤ăă ăćĺłăăžăăUTF-8 ă使ç¨ăăă¨ăUnicode ăłăźăăă¤ăłăă 1 ď˝ 4 ăă¤ăăŤă¨ăłăłăźăă§ăăžăă \nGoč¨čŞă§ćĺĺăŤĺŻžă㌠len() ă使ç¨ăăă¨ăăŤăźăłć°ă§ăŻăŞăăă¤ăć°ăčżăăăžăă \n \nă˝ăźăšăłăźă
\nćĺĺăŤĺŻžăăä¸ćŁăŞĺ垊ĺŚç (#37) \n\nčŚç´ \nrange ćźçŽĺă使ç¨ăăŚćĺĺăĺ垊ĺŚçăăă¨ăăŤăźăłăŽăă¤ăăˇăźăąăłăšăŽéĺ§ă¤ăłăăăŻăšăŤĺŻžĺżăăă¤ăłăăăŻăšă使ç¨ăăŚăŤăźăłăĺ垊ĺŚçăăăžăăçšĺŽăŽăŤăźăłă¤ăłăăăŻăšďź 3 çŞçŽăŽăŤăźăłăŞăŠďźăŤă˘ăŻăťăšăăăŤăŻăćĺĺă []rune ăŤĺ¤ćăăžăă
\n \nćĺĺăŽĺ垊ĺŚçăŻăéçşč
ăŤă¨ăŁăŚä¸čŹçăŞćä˝ă§ăăăăăăăćĺĺĺ
ăŽĺăŤăźăłăŤĺŻžăăŚćä˝ăĺŽčĄăăăăçšĺŽăŽé¨ĺćĺĺăć¤ç´˘ăăçŹčŞăŽé˘ć°ăĺŽčŁ
ăăĺż
čŚăăăă§ăăăăăŠăĄăăŽĺ ´ĺăăćĺĺăŽç°ăŞăăŤăźăłăĺ垊ĺŚçăăĺż
čŚăăăăžăăăăăăĺ垊ĺŚçăăŠăŽăăăŤćŠč˝ăăăăŤă¤ăăŚăŻĺ°ćăăăăă§ăă
\n揥ăŽäžăčăăŚăżăžăăăă
\ns := \"hĂŞllo\" \nfor i := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , s [ i ]) \n} \nfmt . Printf ( \"len=%d\\n\" , len ( s )) \n桡䚹ăćăĺŻč˝ć§ăŽăă 3 çšăĺăä¸ăăžăăăă
\n\n2 çŞçŽăŽăŤăźăłăŻăĺşĺă§ăŻ ĂŞ ă§ăŻăŞă Ă ăŤăŞăăžăă \nposition 1 ăă position 3 ăŤă¸ăŁăłăăăžăăă position 2 ăŤăŻä˝ăăăăŽă§ăăăăă \nlen 㯠6 ăčżăăžăăăs ăŤăŻ 5 ă¤ăŽăŤăźăłăăĺŤăžăăŚăăžăăă \n \nçľćăŽćĺžăăčŚăŚăăăžăăăălen ăŻăŤăźăłć°ă§ăŻăŞăăćĺĺĺ
ăŽăă¤ăć°ăčżăăă¨ăŻăă§ăŤčż°ăšăžăăăćĺĺăŞăăŠăŤă s ăŤĺ˛ăĺ˝ăŚăŚăăăăăs 㯠UTF-8 ćĺĺă§ăăä¸ćšăçšćŽćĺăĂŞă㯠1 ăă¤ăă§ă¨ăłăłăźăăăăžăăă 2 ăă¤ăĺż
čŚă§ăăăăăăŁăŚălen(s) ăĺźăłĺşă㨠6 ăčżăăăžăă
\nĺăŽäžă§ăŻăĺăŤăźăłăĺ垊ĺŚçăăŚăăŞăăă¨ăç解ăăĺż
čŚăăăăžăă䝣ăăăŤăăŤăźăłăŽĺéĺ§ă¤ăłăăăŻăšăĺ垊ĺŚçăăžăă
\n
\ns[i] ăĺşĺăăŚă i çŞçŽăŽăŤăźăłăŻĺşĺăăăžăăăă¤ăłăăăŻăš i ăŽăă¤ă㎠UTF-8 襨çžăĺşĺăăžăăăăăăŁăŚă hĂŞllo ăŽäťŁăă㍠hĂllo ăĺşĺăăăăžăă
\năăžăăžăŞăŤăźăłćĺăăăšăŚĺşĺăăăĺ ´ĺăŻă range ćźçŽĺ㎠value čŚç´ ă使ç¨ăăăă¨ăă§ăăžăă
\ns := \"hĂŞllo\" \nfor i , r := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \năžăăŻăćĺĺăăŤăźăłăŽăšăŠă¤ăšăŤĺ¤ćăăăăăĺ垊ĺŚçăăăă¨ăă§ăăžăă
\ns := \"hĂŞllo\" \nrunes := [] rune ( s ) \nfor i , r := range runes { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \năăŽč§Łćąşçă§ăŻă䝼ĺăŽč§Łćąşçă¨ćŻčźăăŚĺŽčĄćăŽăŞăźăăźăăăăçşçăăăă¨ăŤćł¨ćăăŚăă ăăăĺŽéăćĺĺăăŤăźăłăŽăšăŠă¤ăšăŤĺ¤ćăăăŤăŻăčż˝ĺ ăŽăšăŠă¤ăšăĺ˛ăĺ˝ăŚăăă¤ăăăŤăźăłăŤĺ¤ćăăĺż
čŚăăăăžăăćĺĺăŽăă¤ăć°ă n ă¨ăăă¨ăćéč¨çŽé㯠O(n) ăŤăŞăăžăăăăăăŁăŚăăăšăŚăŽăŤăźăłăĺ垊ĺŚçăăĺ ´ĺăŻăćĺăŽč§Łćąşçă使ç¨ăăăšăă§ăă
\năă ăăćĺăŽćšćłă使ç¨ăăŚćĺĺ㎠i çŞçŽăŽăŤăźăłăŤă˘ăŻăťăšăăăĺ ´ĺăŻăăŤăźăłă¤ăłăăăŻăšăŤă˘ăŻăťăšă§ăăžăăă䝣ăăăŤăăă¤ăăˇăźăąăłăšĺ
ăŽăŤăźăłăŽéĺ§ă¤ăłăăăŻăšăăăăăžăă
\ns := \"hĂŞllo\" \nr := [] rune ( s )[ 4 ] \nfmt . Printf ( \"%c\\n\" , r ) // o \nă˝ăźăšăłăźă
\ntrim é˘ć°ăŽčŞ¤ç¨ (#38) \n\nčŚç´ \nstrings.TrimRight ăť strings.TrimLeft ăŻăćĺŽăăăăťăăăŤĺŤăžăăăăšăŚăŽćŤĺ°žăťĺ
é ăŽăŤăźăłăĺé¤ăăžăăă strings.TrimSuffix ăť strings.TrimPrefix ăŻăćĺŽăăăćĽĺ°žčžăťćĽé čžăŽăŞăćĺĺăčżăăžăă
\n \năă¨ăă°
\nfmt . Println ( strings . TrimRight ( \"123oxo\" , \"xo\" )) \n㯠123 ăĺşĺăăžă
\n
\néăŤă strings.TrimLeft ăŻăăťăăăŤĺŤăžăăĺ
é ăŽăŤăźăłăăăšăŚĺé¤ăăžăă
\nä¸ćšăstrings.TrimSuffix ăť strings.TrimPrefix ăŻăćĺŽăăăćŤĺ°žăŽćĽĺ°žčžăťćĽé čžăé¤ăăćĺĺăčżăăžăă
\nă˝ăźăšăłăźă
\nćéŠĺăä¸ĺĺăŞćĺĺăŽéŁçľ (#39) \n\nčŚç´ \nćĺĺăŽăŞăšăăŽéŁçľăŻăĺ垊ăă¨ăŤć°ăăćĺĺăĺ˛ăĺ˝ăŚăăăŞăăăăŤăstrings.Builder ă使ç¨ăăŚčĄăĺż
čŚăăăăžăă
\n \n+= ćźçŽĺăç¨ăăŚăšăŠă¤ăšăŽăăšăŚăŽćĺĺčŚç´ ăéŁçľăă concat é˘ć°ăčăăŚăżăžăăăă
\nfunc concat ( values [] string ) string { \n s := \"\" \n for _ , value := range values { \n s += value \n } \n return s \n} \nĺĺ垊ä¸ăŤă += ćźçŽĺ㯠s 㨠value ćĺĺăéŁçľăăžăăä¸čŚăăă¨ăăăŽé˘ć°ăŻééăŁăŚăăŞăăăăŤčŚăăăăăăăžăăăăăăăăăŽĺŽčŁ
ăŻăćĺĺăŽć ¸ă¨ăŞăçšć§ăŽ1ă¤ă§ăăä¸ĺ¤ć§ăĺżăăŚăăžăăăăăăŁăŚăĺĺ垊ă§ăŻ s ăŻć´ć°ăăăžăăăăĄă˘ăŞĺ
ăŤć°ăăćĺĺăĺĺ˛ăĺ˝ăŚăăăăăăăŽé˘ć°ăŽăăăŠăźăăłăšăŤĺ¤§ăăŞĺ˝ąéżăä¸ăăžăă
\n嚸ăăŞăă¨ăŤă strings.Builder ăç¨ăăăă¨ă§ăăăŽĺéĄăŤĺŻžĺŚăă解湺çăăăăžăă
\nfunc concat ( values [] string ) string { \n sb := strings . Builder {} \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \nĺĺ垊ä¸ăŤăvalue ăŽĺ
厚ăĺ
é¨ăăăăĄăŤčż˝ĺ ăă WriteString ăĄă˝ăăăĺźăłĺşăăŚçľćăŽćĺĺăć§çŻăăăĄă˘ăŞăŽăłăăźăćĺ°éăŤćăăăă¨ăă§ăăžăăă
\n\nčŁčśł \nWriteString 㯠2 çŞçŽăŽĺşĺă¨ăăŚă¨ăŠăźăčżăăžăăăćĺłçăŤçĄčŚăăžăăăăĺŽéăăăŽăĄă˝ăă㯠nil ă¨ăŠăźäťĽĺ¤ăčżăăă¨ăŻăăăžăăăă§ăŻăăăŽăĄă˝ăăăăˇă°ăăăŁăŽä¸é¨ă¨ăăŚă¨ăŠăźăčżăçŽçăŻä˝ă§ăăăăăstrings.Builder 㯠io.StringWriter ă¤ăłăżăă§ăźăšăĺŽčŁ
ăăŚăăăăăăŤăŻ WriteString(s string) (n int, err error) ă¨ăă1ă¤ăŽăĄă˝ăăăĺŤăžăăŚăăžăăăăăăŁăŚăăăŽă¤ăłăżăă§ăźăšăŤćşć ăăăŤăŻăWriteString ăŻă¨ăŠăźăčżăăŞăăă°ăŞăăŞăăŽă§ăă
\n \nĺ
é¨çăŤăŻăstrings.Builder ăŻăă¤ăăšăŠă¤ăšăäżćăăžăă WriteString ăĺźăłĺşăăăłăŤăăăŽăšăŠă¤ăšăŤčż˝ĺ ăăĺźăłĺşăăčĄăăăžăăăăăŤăŻ2ă¤ăŽĺ˝ąéżăăăăžăăăžăă append ăŽĺźăłĺşăăčĄçŞçść
ăĺźă辡ăăĺŻč˝ć§ăăăăăăăăŽć§é ä˝ăŻĺćăŤä˝żç¨ăăăăšăă§ăŻăăăžăăă2çŞçŽăŽĺ˝ąéżăŻă éĺšçăŞăšăŠă¤ăšăŽĺćĺ (#21) ă§čŚăăăŽă§ăăăšăŠă¤ăšăŽĺ°ćĽăŽéˇăăăă§ăŤăăăŁăŚăăĺ ´ĺăŻăăăăäşĺăŤĺ˛ăĺ˝ăŚăĺż
čŚăăăăžăăăăŽăăăŤăstrings.Builder ăŻĺĽăŽ n ăă¤ăăŽăăăŽăšăăźăšăäżč¨źăăăĄă˝ăă Grow(n int) ăćăŁăŚăăžăă
\nfunc concat ( values [] string ) string { \n total := 0 \n for i := 0 ; i < len ( values ); i ++ { \n total += len ( values [ i ]) \n } \n sb := strings . Builder {} \n sb . Grow ( total ) ( 2 ) \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \năăłăăăźăŻăĺŽčĄă㌠3 ă¤ăŽăăźă¸ă§ăłďź += ă使ç¨ăă V1 ăäşĺĺ˛ăĺ˝ăŚăŞă㧠strings.Builder{} ă使ç¨ăă V2 ăäşĺĺ˛ăĺ˝ăŚăă㎠strings.Builder{} ă使ç¨ăă V3 ďźăćŻčźăăŚăżăžăăăăĺ
ĽĺăšăŠă¤ăšăŤăŻ 1,000 ĺăŽćĺĺăĺŤăžăăŚăăăĺćĺĺăŤăŻ 1,000 ăă¤ăăĺŤăžăăŚăăžăă
\nă茧ăŽă¨ăăăćć°ăăźă¸ă§ăłăćăĺšççă§ăV1 ăă 99% ăV2 ăă 78% éŤéă§ăă
\nstrings.Builder ăŻăćĺĺăŽăŞăšăăéŁçľăăăăăŽč§Łćąşçă¨ăăŚć¨ĺĽ¨ăăăžăăé常ăăăăŻăŤăźăĺ
ă§ä˝żç¨ăăĺż
čŚăăăăžăăăăă¤ăăŽćĺĺ ďźĺĺă¨ĺ§ăŞăŠďźăéŁçľăăă ăăŽĺ ´ĺă strings.Builder ăŽä˝żç¨ăŻă += ćźçŽĺă fmt.Sprintf ă¨ćŻăšăŚĺŻčŞć§ăä˝ăăŞăăăă§ăă
\nă˝ăźăšăłăźă
\nçĄé§ăŞćĺĺĺ¤ć (#40) \n\nčŚç´ \nbytes ăăăąăźă¸ăŻ strings ăăăąăźă¸ă¨ĺăćä˝ăćäžăăŚăăăăă¨ăčŚăăŚăăă¨ăä˝ĺăŞăă¤ăăťćĺĺĺ¤ćăéżăăăă¨ăă§ăăžăă
\n \nćĺĺăžă㯠[]byte ăćąăăă¨ăé¸ćăăĺ ´ĺăăťă¨ăăŠăŽăăă°ăŠăăźăŻĺŠäžżć§ăŽăăăŤćĺĺă弽ăĺžĺăăăăžăăăăăăăťă¨ăăŠăŽ I/O ăŻĺŽéăŤăŻ []byte ă§čĄăăăžăăăă¨ăă°ăio.Readerăio.Writerăăăăł io.ReadAll ăŻćĺĺă§ăŻăŞă []byte ăĺŚçăăžăă
\nćĺĺ㨠[]byte ăŽăŠăĄăăćąăăšăă迡ăŁăă¨ăă[]byte ăćąăćšăĺż
ăăăé˘ĺă ă¨ăăăăă§ăŻăŞăăă¨ăćăĺşăăŚăă ăăăstrings ăăăąăźă¸ăăă¨ăŻăšăăźăăăăăăšăŚăŽé˘ć°ăŤăŻăbytes ăăăąăźă¸ăŤäťŁćżćŠč˝ăăăăžăă SplităCountăContainsăIndex ăŞăŠă§ăăăăăăŁăŚăI/O ăĺŽčĄăăŚăăăăŠăăăŤé˘äżăŞăăćĺĺăŽäťŁăăăŤăă¤ăă使ç¨ăăŚăŻăźăŻăăăźĺ
¨ä˝ăĺŽčŁ
ă§ăăčż˝ĺ ăŽĺ¤ćăłăšăăĺéżă§ăăăăŠăăăćĺăŤç˘şčŞăăžăăăă
\nă˝ăźăšăłăźă
\né¨ĺćĺĺă¨ăĄă˘ăŞăŞăźăŻ (#41) \n\nčŚç´ \né¨ĺćĺĺăŽäťŁăăăŤăłăăźă使ç¨ăăă¨ăé¨ĺćĺĺćä˝ăŤăăŁăŚčżăăăćĺĺăĺăăă¤ăé
ĺăŤăăŁăŚăľăăźăăăăăăăăĄă˘ăŞăŞăźăŻăé˛ăăă¨ăă§ăăžăă
\n \năšăŠă¤ăšă¨ăĄă˘ăŞăŞăźăŻ (#26) ă§ăŻăăšăŠă¤ăšăžăăŻé
ĺăŽăšăŠă¤ăšăăĄă˘ăŞăŞăźăŻăŽçśćłăĺźă辡ăăĺŻč˝ć§ăăăăă¨ă確čŞăăžăăăăăŽĺĺăŻăćĺĺăăăłé¨ĺćĺĺăŽćä˝ăŤăĺ˝ăŚăŻăžăăžăă
\nGoč¨čŞă§é¨ĺćĺĺćä˝ă使ç¨ăăă¨ăăŻă2 ă¤ăŽăă¨ăŤçćăăĺż
čŚăăăăžăăăžăăćäžăăăééăŻăŤăźăłć°ă§ăŻăŞăăăă¤ăć°ăŤĺşăĽăăŚăăžăă揥ăŤăçľćăŽé¨ĺćĺĺăćĺăŽćĺĺă¨ĺăăăăăłă°é
ĺăĺ
ąćăăăăăé¨ĺćĺĺćä˝ăŤăăăĄă˘ăŞăŞăźăŻăçşçăăĺŻč˝ć§ăăăăžăăăăăé˛ăćšćłăŻăćĺĺăŽăłăăźăćĺă§ĺŽčĄăăăăGo 1.18 ăăĺŽčŁ
ăăăŚăă strings.Clone ă使ç¨ăăăă¨ă§ăă
\nă˝ăźăšăłăźă
\né˘ć°ă¨ăĄă˝ăă \năŠăŽĺăŽăŹăˇăźăăźă使ç¨ăăă°ăăăăăăŁăŚăăŞă (#42) \n\nčŚç´ \nĺ¤ăŹăˇăźăăźă¨ăă¤ăłăżăŹăˇăźăăźăŽăŠăĄăă使ç¨ăăăăŻăăŠăŽĺăŞăŽăăĺ¤ĺăăăĺż
čŚăăăăăŠăăăăłăăźă§ăăŞăăăŁăźăŤăăĺŤăžăăŚăăăăŠăăăăŞăă¸ă§ăŻăăŻăŠăăăă大ăăăŽăăăŞăŠăŽčŚç´ ăŤĺşăĽăăŚćąşĺŽăăĺż
čŚăăăăžăăĺăăăŞăĺ ´ĺăŻăăă¤ăłăżăŹăˇăźăă使ç¨ăăŚăă ăăă
\n \nĺ¤ăŹăˇăźăăźă¨ăă¤ăłăżăŹăˇăźăăźăŽăŠăĄăăé¸ćăăăăŻăĺż
ăăăç°Ąĺă§ăŻăăăžăăăé¸ćăŤĺ˝šçŤă¤ăăă¤ăăŽćĄäťśăŤă¤ăăŚčŞŹćăăžăăăă
\năă¤ăłăżăŹăˇăźăăźă§ăŞăăă°ăŞăăŞă ă¨ă
\n\năĄă˝ăăăăŹăˇăźăăźăĺ¤ĺăăăĺż
čŚăăăĺ ´ĺăăăŽăŤăźăŤăŻăĺ俥ĺ´ăăšăŠă¤ăšă§ăăăăĄă˝ăăăčŚç´ ăčż˝ĺ ăăĺż
čŚăăăĺ ´ĺăŤăćĺšă§ăă \n \ntype slice [] int \nfunc ( s * slice ) add ( element int ) { \n * s = append ( * s , element ) \n} \n\năĄă˝ăăăŹăˇăźăăźăŤăłăăźă§ăăŞăăăŁăźăŤăăĺŤăžăăŚăăĺ ´ĺăsync ăăăąăźă¸ăŽĺé¨ĺăŻăăŽä¸äžăŤăŞăăžăďź sync ĺăŽăłăăź (#74) ăĺç
§ďźă \n \năă¤ăłăżăŹăˇăźăăźă§ăăăšă ă¨ă
\n\năŹăˇăźăăźă大ăăŞăŞăă¸ă§ăŻăăŽĺ ´ĺăăă¤ăłăżă使ç¨ăăă¨ă大čŚć¨ĄăŞăłăăźăŽä˝ćăé˛ć˘ăăăăăăĺźăłĺşăăăăĺšççăŤăŞăăžăăăŠăăăăăŽĺ¤§ăăăŞăŽă確訟ăăŞăĺ ´ĺăŻăăăłăăăźăŻă解湺çăŤăŞăĺŻč˝ć§ăăăăžăăĺ¤ăăŽčŚĺ ăŤäžĺăăăăăçšĺŽăŽăľă¤ăşăćĺŽăăăă¨ăŻăťă¨ăăŠä¸ĺŻč˝ă§ăă \n \nĺ¤ăŹăˇăźăăźă§ăŞăăă°ăŞăăŞă ă¨ă
\n\năŹăˇăźăăźăŽä¸ĺ¤ć§ă埡ĺśăăĺż
čŚăăăĺ ´ĺă \năŹăˇăźăăźăăăăăé˘ć°ăăăŁăăŤăŽĺ ´ĺăăă䝼ĺ¤ăŽĺ ´ĺăŻăłăłăă¤ăŤă¨ăŠăźăçşçăăžăă \n \nĺ¤ăŹăˇăźăăźă§ăăăšă ă¨ă
\n\năŹăˇăźăăźăĺ¤ĺăăăĺż
čŚăŽăŞăăšăŠă¤ăšăŽĺ ´ĺă \năŹăˇăźăăźăătime.Time ăŞăŠăŽĺ°ăăŞé
ĺăžăăŻć§é ä˝ă§ăĺŻĺ¤ăăŁăźăŤăăćăăŞăĺ¤ĺă§ăăĺ ´ĺă \năŹăˇăźăăźă intăfloat64ăăžă㯠string ăŞăŠăŽĺşćŹĺăŽĺ ´ĺă \n \năăĄăăăçšćŽăŞăąăźăšăŻĺ¸¸ăŤĺĺ¨ăăăăăăăšăŚă眲çž
ăăăă¨ăŻä¸ĺŻč˝ă§ăăăăăŽăťăŻăˇă§ăłăŽçŽć¨ăŻăăťă¨ăăŠăŽăąăźăšăăŤăăźăăăăăŽăŹă¤ăăłăšăćäžăăăă¨ă§ăăé常ăŻăăăăăŞăćŁĺ˝ăŞççąăăŞăéăăĺ¤ăŹăˇăźăăźă使ç¨ăăŚééăăăăžăăăĺăăăŞăĺ ´ĺăŻăăă¤ăłăżăŹăˇăźăă使ç¨ăăĺż
čŚăăăăžăă
\nă˝ăźăšăłăźă
\nĺĺäťăçľćăăŠăĄăźăżăăžăŁăă使ç¨ăăŚăăŞă (#43) \n\nčŚç´ \nĺĺäťăçľćăăŠăĄăźăżăźăŽä˝żç¨ăŻăçšăŤč¤ć°ăŽçľćăăŠăĄăźăżăźăĺăĺăćă¤ĺ ´ĺăé˘ć°ăťăĄă˝ăăăŽčŞăżăăăăĺä¸ăăăĺšççăŞćšćłă§ăăĺ ´ĺăŤăăŁăŚăŻăĺĺäťăçľćăăŠăĄăźăżăŻăźăĺ¤ăŤĺćĺăăăăăăăăŽćšćłăäžżĺŠă§ăăăăăă¨ăăăăžăăăă ăć˝ĺ¨çăŞĺŻä˝ç¨ăŤăŻćł¨ćăăŚăă ăăă
\n \né˘ć°ăžăăŻăĄă˝ăăă§ăăŠăĄăźăżăčżăă¨ăăăăăăŽăăŠăĄăźăżăŤĺĺăäťăăŚăé常ăŽĺ¤ć°ă¨ăăŚä˝żç¨ă§ăăžăăçľćăăŠăĄăźăżăźăŤĺĺăäťăăă¨ăé˘ć°ăťăĄă˝ăăăŽéĺ§ćăŤăăŽăăŠăĄăźăżăźăŻăźăĺ¤ăŤĺćĺăăăžăăĺĺäťăçľćăăŠăĄăźăżă使ç¨ăăă¨ă ăăĺşă㎠return ćďźĺźć°ăŞăďź ăĺźăłĺşăăă¨ăă§ăăžăăăăŽĺ ´ĺăçľćăăŠăĄăźăżăŽçžĺ¨ăŽĺ¤ăćťăĺ¤ă¨ăăŚä˝żç¨ăăăžăă
\n䝼ä¸ăŻăĺĺäťăçľćăăŠăĄăźăż b ăç¨ăăäžă§ăă
\nfunc f ( a int ) ( b int ) { \n b = a \n return \n} \năăŽäžă§ăŻăçľćăăŠăĄăźăżăŤĺĺ b ăäťăăŚăăžăăĺźć°ăŞă㧠return ăĺźăłĺşăă¨ăb ăŽçžĺ¨ăŽĺ¤ăčżăăăžăă
\nĺ ´ĺăŤăăŁăŚăŻăĺĺäťăăŽçľćăăŠăĄăźăżăźăŤăăŁăŚĺŻčŞć§ăĺä¸ăăăă¨ăăăăžăăăă¨ăă°ă2 ă¤ăŽăăŠăĄăźăżăźăĺăĺă§ăăĺ ´ĺăŞăŠă§ăăăăŽäťăŤăăĺŠäžżć§ăŽăăăŤç¨ăăăă¨ăă§ăăžăăăăăŤăć確ăŞĺŠçšăăăĺ ´ĺăŻăć
éăŤăŞăăŞăăăĺĺäťăçľćăăŠăĄăźăżă使ç¨ăăăšăă§ăă
\nă˝ăźăšăłăźă
\nĺĺäťăçľćăăŠăĄăźăżăŤăăäşćłĺ¤ăŽĺŻä˝ç¨ (#44) \n\nčŚç´ \n#43 ăĺç
§ăăŚăă ăăă
\n \nĺĺäťăçľćăăŠăĄăźăżăçśćłăŤăăŁăŚăŻĺ˝šçŤă¤ççąăŤă¤ăăŚčŞŹćăăžăăă ăă ăăăăăăŻăźăĺ¤ăŤĺćĺăăăăăăĺĺăŤćł¨ćăăŞăă¨ă蝽垎ăŞăă°ăçşçăăĺŻč˝ć§ăăăăžăăăă¨ăă°ăăăŽăłăźăăŻăŠăăééăŁăŚăăă§ăăăăă
\nfunc ( l loc ) getCoordinates ( ctx context . Context , address string ) ( \n lat , lng float32 , err error ) { \n isValid := l . validateAddress ( address ) ( 1 ) \n if ! isValid { \n return 0 , 0 , errors . New ( \"invalid address\" ) \n } \n if ctx . Err () != nil { ( 2 ) \n return 0 , 0 , err \n } \n // 座ć¨ăĺĺžăăŚčżă \n} \nä¸çĽăăă ăă§ăŻă¨ăŠăźăŻćăăă§ăŻăŞăăăăăăžăăăif ctx.Err() != nil ăšăłăźăă§čżăăăă¨ăŠăźăŻ err ă§ăăăăăăerr ĺ¤ć°ăŤăŻĺ¤ăĺ˛ăĺ˝ăŚăŚăăžăăăerror ĺăŽăźăĺ¤ă nil ăŤĺ˛ăĺ˝ăŚăăăăžăžă§ăăăăăăŁăŚăăăŽăłăźăăŻĺ¸¸ăŤ nil ă¨ăŠăźăčżăăžăă
\nĺĺäťăçľćăăŠăĄăźăżă使ç¨ăăĺ ´ĺăĺăăŠăĄăźăżăŻăźăĺ¤ăŤĺćĺăăăăă¨ăŤćł¨ćăăŚăă ăăăăăŽăťăŻăˇă§ăłă§čŞŹćăăăăăŤăăăăŤăăăčŚă¤ăăăŽăĺż
ăăăç°Ąĺă§ăŻăŞă蝽垎ăŞăă°ăçşçăăĺŻč˝ć§ăăăăžăăăăăŤăć˝ĺ¨çăŞĺŻä˝ç¨ăéżăăăăăŤăĺĺäťăçľćăăŠăĄăźăżăźă使ç¨ăăă¨ăăŻćł¨ćăăŚăă ăăă
\nă˝ăźăšăłăźă
\nnil ăŹăˇăźăăźăčżă (#45) \n\nčŚç´ \nă¤ăłăżăă§ăźăšăčżăă¨ăăŻănil ăă¤ăłăżăčżăăŽă§ăŻăŞăăć示ç㪠nil ĺ¤ăčżăăăăŤćł¨ćăăŚăă ăăăăăăăŞăăă°ăćĺłăăŞăçľćăçşçăăĺźăłĺşăĺ
ă nil ă§ăŻăŞăĺ¤ăĺăĺăĺŻč˝ć§ăăăăžăă
\n \n\n\nă˝ăźăšăłăźă
\né˘ć°ĺ
ĽĺăŤăăĄă¤ăŤĺă使ç¨ăăŚăă (#46) \n\nčŚç´ \năăĄă¤ăŤĺăŽäťŁăă㍠io.Reader ĺăĺăĺăăăăŤé˘ć°ăč¨č¨ăăă¨ăé˘ć°ăŽĺĺŠç¨ć§ăĺä¸ăăăăšăă厚ćăŤăŞăăžăă
\n \năăĄă¤ăŤĺăăăĄă¤ăŤăăčŞăżĺăăăăŽé˘ć°ĺ
Ľĺă¨ăăŚĺăĺ
Ľăăăă¨ăŻăăťă¨ăăŠăŽĺ ´ĺăăăłăźăăŽčăăă¨ăżăŞăăăăšăă§ăďź os.Open ăŞăŠăŽçšĺŽăŽé˘ć°ăé¤ăďźăč¤ć°ăŽăăĄă¤ăŤăä˝ćăăăă¨ăŤăŤăŞăăăăăăăĺä˝ăăšăăăăč¤éăŤăŞăĺŻč˝ć§ăăăăăă§ăăăžăăé˘ć°ăŽĺĺŠç¨ć§ăä˝ä¸ăăžă ďźăă ăăăăšăŚăŽé˘ć°ăĺĺŠç¨ăăăăăă§ăŻăăăžăăďźă io.Reader ă¤ăłăżăă§ăźăšă使ç¨ăăă¨ăăăźăżă˝ăźăšăć˝čąĄĺăăăžăăĺ
ĽĺăăăĄă¤ăŤăćĺĺăHTTP ăŞăŻă¨ăšăăgRPC ăŞăŻă¨ăšăăŽăăăă§ăăăăŤé˘äżăŞăăĺŽčŁ
ăŻĺĺŠç¨ă§ăăç°ĄĺăŤăăšăă§ăăžăă
\nă˝ăźăšăłăźă
\ndefer ĺźć°ă¨ăŹăˇăźăăźăăŠăŽăăăŤčŠäžĄăăăăăçĽăăŞăďźĺźć°ăŽčŠäžĄăăă¤ăłăżăźăăăăłĺ¤ăŹăˇăźăăźďź (#47)\nčŚç´ \năă¤ăłăżă defer é˘ć°ăŤć¸Ąăăă¨ă¨ăĺźăłĺşăăăŻăăźă¸ăŁĺ
ăŤăŠăăăăăă¨ăăĺźć°ă¨ăŹăˇăźăăźăŽĺłćčŠäžĄăĺ
ćăăăăăŤĺŽçžĺŻč˝ăŞč§Łćąşçă§ăă
\n \ndefer é˘ć°ă§ăŻăĺźć°ăŻăä¸ä˝ăăăăŻăŽé˘ć°ăćťăŁăŚăăă§ăŻăŞăăăăăŤčŠäžĄăăăžăăăă¨ăă°ăăăŽăłăźăă§ăŻă常ăŤĺăăšăăźăżăšââ犺ăŽćĺĺââ㧠notify 㨠incrementCounter ăĺźăłĺşăăžăă
\nconst ( \n StatusSuccess = \"success\" \n StatusErrorFoo = \"error_foo\" \n StatusErrorBar = \"error_bar\" \n) \nfunc f () error { \n var status string \n defer notify ( status ) \n defer incrementCounter ( status ) \n if err := foo (); err != nil { \n status = StatusErrorFoo \n return err \n } \n if err := bar (); err != nil { \n status = StatusErrorBar \n return err \n } \n status = StatusSuccess \n return nil \n} \năăăăŤănotify(status) 㨠incrementCounter(status) ă defer é˘ć°ă¨ăăŚĺźăłĺşăăŚăăžăăăăăăŁăŚăGoč¨čŞăŻădefer ă使ç¨ăă掾é㧠f ăăšăăźăżăšăŽçžĺ¨ăŽĺ¤ăčżăă¨ăăăăăŽĺźăłĺşăăŽĺŽčĄăé
ăăă犺ăŽćĺĺă渥ăăžăă
\ndefer ă使ăçśăăăĺ ´ĺăŽä¸ťăŞćšćłăŻ 2 ă¤ăăăžăă
\nćĺăŽč§ŁćąşçăŻćĺĺăă¤ăłăżă渥ăăă¨ă§ăă
\nfunc f () error { \n var status string \n defer notify ( & status ) \n defer incrementCounter ( & status ) \n // é˘ć°ăŽăă䝼ĺ¤ăŽé¨ĺăŻĺ¤ć´ăŞă \n} \ndefer ă使ç¨ăăă¨ăĺźć°ďźăăă§ăŻăšăăźăżăšăŽă˘ăăŹăšďźăăăăŤčŠäžĄăăăžăăăšăăźăżăščŞä˝ăŻé˘ć°ĺ
¨ä˝ă§ĺ¤ć´ăăăžăăăăăŽă˘ăăŹăšăŻĺ˛ăĺ˝ăŚăŤé˘äżăŞăä¸ĺŽăŽăžăžă§ăăăăŁăŚănotify ăžă㯠incrementCounter ăćĺĺăă¤ăłăżăŤăăŁăŚĺç
§ăăăĺ¤ă使ç¨ăăĺ ´ĺăćĺž
ăŠăăăŤĺä˝ăăžăăăă ăăăăŽč§Łćąşçă§ăŻ 2 ă¤ăŽé˘ć°ăŽăˇă°ăăăŁăĺ¤ć´ăăĺż
čŚăăăăăăă常ăŤĺŻč˝ă§ăăă¨ăŻéăăžăăă
\nĺĽăŽč§ŁćąşçăăăăžăââăŻăăźă¸ăŁďźćŹä˝ăŽĺ¤é¨ăăĺ¤ć°ăĺç
§ăăĺżĺé˘ć°ĺ¤ďźă defer ćă¨ăăŚĺźăłĺşăăă¨ă§ăă
\nfunc f () error { \n var status string \n defer func () { \n notify ( status ) \n incrementCounter ( status ) \n }() \n // é˘ć°ăŽăă䝼ĺ¤ăŽé¨ĺăŻĺ¤ć´ăŞă \n} \năăă§ăŻănotify 㨠incrementCounter ăŽä¸ĄćšăŽĺźăłĺşăăăŻăăźă¸ăŁĺ
ăŤăŠăăăăžăăăăŽăŻăăźă¸ăŁăŻăćŹä˝ăŽĺ¤é¨ăăăšăăźăżăšĺ¤ć°ăĺç
§ăăžăăăăăŤăstatus ăŻădefer ăĺźăłĺşăăă¨ăă§ăŻăŞăăăŻăăźă¸ăŁăĺŽčĄăăăă¨ăăŤčŠäžĄăăăžăăăăŽč§ŁćąşçăŻćŁăăćŠč˝ăăä¸ăŤăăˇă°ăăăŁăĺ¤ć´ăăăă㍠notify ă incrementCounter ăĺż
čŚă¨ăăžăăă
\năăŽĺä˝ăŻăĄă˝ăăăŹăˇăźăăźăŤăéŠç¨ăăăăă¨ăŤă注ćăăŚăă ăăăăŹăˇăźăăźăŻăăăŤčŠäžĄăăăžăă
\nă˝ăźăšăłăźă
\nă¨ăŠăźĺŚç \năăă㯠(#48) \n\nčŚç´ \npanic ăŽä˝żç¨ăŻăGoč¨čŞă§ă¨ăŠăźăŤĺŻžĺŚăăăăăŽć掾ă§ăăăă ăăăăăŻĺ垊ä¸č˝ăŞçśćłă§ăŽăżä˝żç¨ăăăăăŤăăŚăă ăăăăă¨ăă°ăăăĽăźăăłă¨ăŠăźăéçĽăăĺ ´ĺăăĺż
é ăŽäžĺé˘äżăŽčŞăżčžźăżăŤĺ¤ąćăăĺ ´ĺăŞăŠă§ăă
\n \nGoč¨čŞă§ăŻăpanic ăŻé常ăŽćľăăĺć˘ăăçľăżčžźăżé˘ć°ă§ăă
\nfunc main () { \n fmt . Println ( \"a\" ) \n panic ( \"foo\" ) \n fmt . Println ( \"b\" ) \n} \năăŽăłăźă㯠a ăĺşĺăăb ăĺşĺăăĺăŤĺć˘ăăžăă
\npanic ăŽä˝żç¨ăŻć
éăŤăăšăă§ăă䝣襨çăŞăąăźăšă 2 ă¤ăăă1 ă¤ăŻăăĽăźăăłă¨ăŠăźăéçĽăăĺ ´ĺďźäž: sql.Registernil ăžăăŻć˘ăŤçťé˛ăăăŚăăĺ ´ĺ㍠panic ă辡ăăăžăďźăăă 1 ă¤ăŻă˘ăăŞăąăźăˇă§ăłăĺż
é ăŽäžĺé˘äżăŽçćăŤĺ¤ąćăăĺ ´ĺă§ăăçľćă¨ăăŚăäžĺ¤çăŤă˘ăăŞăąăźăˇă§ăłăĺć˘ăăžăăăă䝼ĺ¤ăŽăťă¨ăăŠăŽĺ ´ĺăŤăăăŚăŻăă¨ăŠăźĺŚçăŻăćĺžăŽćťăĺźć°ă¨ăăŚéŠĺăŞă¨ăŠăźĺăčżăé˘ć°ăéăăŚčĄăăšăă§ăă
\nă˝ăźăšăłăźă
\nă¨ăŠăźăăŠăăăăšăă¨ăăçĽăăŞă (#49) \n\nčŚç´ \nă¨ăŠăźăăŠăăăăă¨ăă¨ăŠăźăăăźăŻăăăăčż˝ĺ ăŽăłăłăăăšăăćäžăăăă§ăăžăăăă ăăă¨ăŠăźăŠăăăłă°ăŤăăăĺźăłĺşăĺ
ăă˝ăźăšă¨ăŠăźăĺŠç¨ă§ăăăăăŤăŞăăăăć˝ĺ¨çăŞçľĺăçşçăăžăăăăăéżăăăĺ ´ĺăŻăă¨ăŠăźăŠăăăłă°ă使ç¨ăăŞăă§ăă ăăă
\n \nGo 1.13 䝼éă%w ăăŁăŹăŻăăŁăă使ç¨ăăă°ç°ĄĺăŤă¨ăŠăźăăŠăăă§ăăăăăŤăŞăăžăăăă¨ăŠăźăŠăăăłă°ă¨ăŻăă˝ăźăšă¨ăŠăźă使ç¨ă§ăăăăăŤăăăŠăăăźăłăłăăĺ
ă§ă¨ăŠăźăăŠăăăžăăŻăăăŻăăăă¨ă§ăăä¸čŹăŤăă¨ăŠăźăŠăăăłă°ăŽä¸ťăŞä˝żç¨äžăŻćŹĄăŽ 2 ă¤ă§ăă
\n\nă¨ăŠăźăŤăăăŤăłăłăăăšăăĺ ăă \nă¨ăŠăźăçšĺŽăŽă¨ăŠăźă¨ăăŚăăźăŻăă \n \nă¨ăŠăźăĺŚçăăă¨ăăă¨ăŠăźăăŠăăăăăăŠăăăćąşĺŽă§ăăžăăăŠăăăłă°ă¨ăŻăă¨ăŠăźăŤăăăŤăłăłăăăšăăčż˝ĺ ăăăăă¨ăŠăźăçšĺŽăŽăżă¤ăă¨ăăŚăăźăŻăăăăăăă¨ă§ăăă¨ăŠăźăăăźăŻăăĺż
čŚăăăĺ ´ĺăŻăçŹčŞăŽă¨ăŠăźĺăä˝ćăăĺż
čŚăăăăžăăă§ăăăć°ăăŤăłăłăăăšăăĺ ăăăă ăăŽĺ ´ĺăŻăć°ăăă¨ăŠăźĺăä˝ćăăĺż
čŚăăŞăăăă%w ăăŁăŹăŻăăŁăăćĺŽă㌠fmt.Errorf ă使ç¨ăăžăăăăăă ăăă¨ăŠăźăŠăăăłă°ăŤăăăĺźăłĺşăĺ
ăă˝ăźăšă¨ăŠăźăĺŠç¨ă§ăăăăăŤăŞăăăăć˝ĺ¨çăŞçľĺăçăăžăăăăăéżăăăĺ ´ĺăŻăă¨ăŠăźăŽăŠăăăłă°ă§ăŻăŞăăă¨ăŠăźăŽĺ¤ćă使ç¨ăăĺż
čŚăăăăžăăăă¨ăă°ă%v ăăŁăŹăŻăăŁăăćĺŽăă fmt.Errorf ă使ç¨ăăžăă
\nă˝ăźăšăłăźă
\nă¨ăŠăźĺăŽä¸ćŁăŞćŻčź (#50) \n\nčŚç´ \nGo 1.13 ăŽă¨ăŠăźăŠăăăłă°ă %w ăăŁăŹăŻăăŁă㨠fmt.Errorf ă§ä˝żç¨ăăĺ ´ĺăĺăŤĺŻžăăă¨ăŠăźăŽćŻčźăŻ errors.As ăéăăŚčĄăĺż
čŚăăăăžăăăăă§ăŞăăă°ăčżăăăă¨ăŠăźăăŠăăăăăŚăăĺ ´ĺăčŠäžĄăŤĺ¤ąćăăžăă
\n \n\n\nă˝ăźăšăłăźă
\nă¨ăŠăźĺ¤ăŽä¸ćŁăŞćŻčź (#51) \n\nčŚç´ \nGo 1.13 ăŽă¨ăŠăźăŠăăăłă°ă %w ăăŁăŹăŻăăŁă㨠fmt.Errorf ă§ä˝żç¨ăăĺ ´ĺăă¨ăŠăźă¨ĺ¤ăŽćŻčźăŻ errors.As ăéăăŚčĄăĺż
čŚăăăăžăăăăă§ăŞăăă°ăčżăăăă¨ăŠăźăăŠăăăăăŚăăĺ ´ĺăčŠäžĄăŤĺ¤ąćăăžăă
\n \năťăłăăăŤă¨ăŠăźăŻă°ăăźăăŤĺ¤ć°ă¨ăăŚĺŽçžŠăăăă¨ăŠăźăŽăă¨ă§ăă
\n
import \"errors\" \nvar ErrFoo = errors . New ( \"foo\" ) \nErr ă§ĺ§ăăăăŽĺžăŤă¨ăŠăźĺăçśăăžăăăăă§ăŻ ErrFoo ă§ăăăťăłăăăŤă¨ăŠăźăŻăäşćăăă ă¨ăŠăźăă¤ăžăăŻăŠă¤ă˘ăłăă確čŞăăăă¨ăćĺž
ăăă¨ăŠăźăäźăăžăăä¸čŹçăŞăŹă¤ăăŠă¤ăłă¨ăăŚ
\n\näşćăăăă¨ăŠăźăŻă¨ăŠăźĺ¤ďźăťăłăăăŤă¨ăŠăźďźă¨ăăŚč¨č¨ăăĺż
čŚăăăăžăďź var ErrFoo =errors.New(\"foo\")ă \näşćăăŞăă¨ăŠăźăŻă¨ăŠăźĺă¨ăăŚč¨č¨ăăĺż
čŚăăăăžăďź BarError 㯠error ă¤ăłăżăă§ăźăšăĺŽčŁ
ăăä¸ă§ type BarError struct { ... }ă \n \nă˘ăăŞăąăźăˇă§ăłă§ %w ăăŁăŹăŻăăŁă㨠fmt.Errorf ă使ç¨ăăŚă¨ăŠăźăŠăăă使ç¨ăăĺ ´ĺăçšĺŽăŽĺ¤ăŤĺŻžăăă¨ăŠăźăŽăă§ăăŻăŻ == ăŽäťŁăă㍠errors.Is ă使ç¨ăăŚčĄăăžăăăăăăăŤăăŁăŚăăťăłăăăŤă¨ăŠăźăăŠăăăăăŚăăĺ ´ĺă§ăăerrors.Is ăŻăăăĺ帰çăŤă˘ăłăŠăăăăăă§ăźăłĺ
ăŽĺă¨ăŠăźăćäžăăăĺ¤ă¨ćŻčźă§ăăžăă
\nă˝ăźăšăłăźă
\nă¨ăŠăźăŽ 2 ĺĺŚç (#52) \n\nčŚç´ \năťă¨ăăŠăŽĺ ´ĺăă¨ăŠăźăŻ 1 ĺă§ĺŚçăăăăšăă§ăăă¨ăŠăźăăă°ăŤč¨é˛ăăăă¨ăŻăă¨ăŠăźăĺŚçăăăă¨ă§ăăăăŞăăĄăăă°ăŤč¨é˛ăăăă¨ăŠăźăčżăăăé¸ćăăĺż
čŚăăăăžăăĺ¤ăăŽĺ ´ĺăă¨ăŠăźăŠăăăłă°ăŻăă¨ăŠăźăŤčż˝ĺ ăŽăłăłăăăšăăćäžăăă˝ăźăšă¨ăŠăźăčżăăă¨ăă§ăăăăă解湺çăŤăŞăăžăă
\n \nă¨ăŠăźăč¤ć°ĺĺŚçăăăă¨ăŻăçšăŤGoč¨čŞăŤéăăăéçşč
ăé ťçšăŤăăŁăŚăăžăăăšă§ăăăăăŤăăăĺăă¨ăŠăźăč¤ć°ĺăă°ăŤč¨é˛ăăăăăăă°ăĺ°éŁăŤăŞăçśćłăçşçăăĺŻč˝ć§ăăăăžăă
\nă¨ăŠăźĺŚç㯠1 庌ă§ć¸ăžăăšăă ă¨ăăăă¨ăčŚăăŚăăăžăăăăă¨ăŠăźăăă°ăŤč¨é˛ăăăă¨ăŻăă¨ăŠăźăĺŚçăăăă¨ă§ăăă¤ăžăăčĄăăšăăŻăăă°ăŤč¨é˛ăăăăă¨ăŠăźăčżăăăŽăŠăĄăăă ă¨ăăăă¨ă§ăăăăăŤăăăăłăźăăç°Ąç´ ĺăăăă¨ăŠăźăŽçśćłăŤă¤ăăŚăăéŠĺăŞć´ĺŻăĺžăăăžăăă¨ăŠăźăŠăăăłă°ăŻăă˝ăźăšă¨ăŠăźăäźăăă¨ăŠăźăŤăłăłăăăšăăčż˝ĺ ă§ăăăăăćă使ăĺćăŽčŻăć掾ăŤăŞăăžăă
\nă˝ăźăšăłăźă
\nă¨ăŠăźĺŚçăăăŞă (#53) \n\nčŚç´ \né˘ć°ĺźăłĺşăä¸ă§ăăŁăŚăădefer é˘ć°ĺ
ă§ăăŁăŚăăă¨ăŠăźăçĄčŚăăă¨ăăŻăăăŠăłăŻčĺĽĺă使ç¨ăăŚć確ăŤčĄăăšăă§ăăăăăăŞăă¨ăĺ°ćĽăŽčŞăżćăăăăćĺłçă ăŁăăŽăăăăă¨ăăăšă ăŁăăŽăĺ°ćăăĺŻč˝ć§ăăăăžăă
\n \nă˝ăźăšăłăźă
\ndefer ă¨ăŠăźăĺŚçăăŞă (#54)\nčŚç´ \nĺ¤ăăŽĺ ´ĺădefer é˘ć°ăŤăăŁăŚčżăăăă¨ăŠăźăçĄčŚăăšăă§ăŻăăăžăăăçśćłăŤĺżăăŚăç´ćĽĺŚçăăăăĺźăłĺşăĺ
ăŤäźăăžăăăăăăăçĄčŚăăĺ ´ĺăŻăăăŠăłăŻčĺĽĺă使ç¨ăăŚăă ăăă
\n \n揥ăŽăłăźăăčăăŚăżăžăăăă
\nfunc f () { \n // ... \n notify () // ă¨ăŠăźĺŚçăŻççĽăăăŚăăžă \n} \nfunc notify () error { \n // ... \n} \näżĺŽć§ăŽčŚłçšăăăăăŽăłăźăăŻăăă¤ăăŽĺéĄăĺźă辡ăăĺŻč˝ć§ăăăăžăăăăäşşăăăăčŞăăă¨ăčăăŚăżăžăăčŞăżćăŻănotify ăă¨ăŠăźăčżăăŤăăăăăăăăăŽă¨ăŠăźă茪é˘ć°ăŤăăŁăŚĺŚçăăăŞăăă¨ăŤć°ăĽăăžăăă¨ăŠăźĺŚçăćĺłçă§ăăăăŠăăăćăăăŚć¨ć¸Źă§ăăă§ăăăăă䝼ĺăŽéçşč
ăăăăĺŚçăăăŽăĺżăăăŽăăăăă¨ăćĺłçăŤĺŚçăăăŽăăçĽăăă¨ăă§ăăă§ăăăăă
\năăăăŽççąăŤăăăă¨ăŠăźăçĄčŚăăăĺ ´ĺăăăŠăłăŻčĺĽĺďź _ ďźă使ăăťăăăăžăăă
\n\năłăłăă¤ăŤă¨ĺŽčĄćéăŽçšă§ăŻăăăŽćšćłăŻćĺăŽăłăźăé¨ĺă¨ćŻăšăŚä˝ăĺ¤ăăăžăăăăăăăăăŽć°ăăăăźă¸ă§ăłă§ăŻăç§ăăĄăă¨ăŠăźăŤé˘ĺżăăŞăăă¨ăćăăăŤăăŚăăžăăăžăăă¨ăŠăźăçĄčŚăăăççąă示ăăłăĄăłăăčż˝ĺ ăăăă¨ăă§ăăžăă
\n// ć大ă§ă 1 ĺăŽäźé \n// ăăăăăă¨ăŠăźăçşçăăĺ ´ĺăŤăăăăŽä¸é¨ă夹ăăăăă¨ăŻč¨ąĺŽšăăăžă \n_ = notify () \nă˝ăźăšăłăźă
\n丌čĄĺŚçďźĺşç¤ \n丌čĄĺŚçă¨ä¸ŚĺĺŚçăŽćˇˇĺ (#55) \n\nčŚç´ \n丌čĄĺŚçă¨ä¸ŚĺĺŚçăŽĺşćŹçăŞéăăç解ăăăă¨ăŻă Go éçşč
ăŤă¨ăŁăŚĺż
é ă§ăă丌čĄĺŚçăŻć§é ăŤé˘ăăăăŽă§ăăă丌ĺĺŚçăŻĺŽčĄăŤé˘ăăăăŽă§ăă
\n \n丌čĄĺŚçă¨ä¸ŚĺĺŚçăŻĺăă§ăŻăăăžăăă
\n\n丌čĄĺŚçăŻć§é ăŤé˘ăăăăŽă§ăăĺĽă
ăŽä¸ŚčĄă´ăŤăźăăłăĺăçľăăă¨ăă§ăăăăžăăžăŞćŽľéăĺ°ĺ
Ľăăăă¨ă§ăé揥ĺŚçă丌čĄĺŚçăŤĺ¤ć´ă§ăăžăă \n丌ĺĺŚçăŻĺŽčĄăŤé˘ăăăăŽă§ăă丌ĺă´ăŤăźăăłăăăăŤčż˝ĺ ăăăă¨ă§ă掾éăŹăăŤă§ä¸ŚĺĺŚçă使ç¨ă§ăăžăă \n \năžă¨ăăă¨ă丌čĄĺŚçăŻă丌ĺĺă§ăăé¨ĺăăă¤ĺéĄă解湺ăăăăăŽć§é ăćäžăăžăăăăŞăăĄă丌čĄĺŚçăŤăă丌ĺĺŚçăĺŻč˝ ăŤăŞăăžă ă
\n\n\n丌čĄĺŚçăŽăťăă常ăŤćŠăă¨čăăŚăă (#56) \n\nčŚç´ \nç硴ăăéçşč
ăŤăŞăăŤăŻă丌čĄĺŚçăĺż
ăăăéŤéă§ăăă¨ăŻéăăŞăăă¨ăčŞčăăĺż
čŚăăăăžăăćĺ°éăŽăŻăźăŻăăźăăŽä¸ŚĺĺŚçăäź´ă解湺çăŻăĺż
ăăăé揥ĺŚçăăéŤéă§ăăă¨ăŻéăăžăăăé揥ĺŚçă¨ä¸ŚčĄĺŚçăŽăăłăăăźăŻăŻă䝎ĺŽăć¤č¨źăăćšćłă§ăăăšăă§ăă
\n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nă˝ăźăšăłăźă
\năăŁăăŤăžăăŻăăĽăźăăăŻăšăăă¤ä˝żç¨ăăăšăăăŤă¤ăăŚć¸ćăŁăŚăă (#57) \n\nčŚç´ \nă´ăŤăźăăłăŽç¸äşä˝ç¨ăčŞčăăŚăăăă¨ăŻăăăŁăăŤă¨ăăĽăźăăăŻăšăŽăŠăĄăăé¸ćăăăăćąşĺŽăăă¨ăăŤă彚çŤăĄăžăăä¸čŹăŤă丌ĺă´ăŤăźăăłăŤăŻĺćăĺż
čŚă§ăăăăăăăŁăŚăăĽăźăăăŻăšăĺż
čŚă§ăăĺ寞ăŤă丌čĄă´ăŤăźăăłăŻé常ă調ć´ă¨ăŞăźăąăšăăŹăźăˇă§ăłăă¤ăžăăăŁăăŤăĺż
čŚă¨ăăžăă
\n \n丌čĄĺŚçăŽĺéĄăčć
Žăăă¨ăăăŁăăŤăžăăŻăăĽăźăăăŻăšă使ç¨ăă解湺çăĺŽčŁ
ă§ăăăăŠăăăĺż
ăăăć確ă§ăŻăŞăĺŻč˝ć§ăăăăžăăGoč¨čŞăŻé俥ăŤăăăĄă˘ăŞăŽĺ
ąćăäżé˛ăăăăă辡ăăăăééăăŽăăĄăŽä¸ă¤ăŻăăŚăźăšăąăźăšăŤăăăăăăăăŁăăŤăŽä˝żç¨ă常ăŤĺźˇĺśăăăă¨ă§ăăăăăăŞăăă2 ă¤ăŽćšćłăŻčŁĺŽçăŞăăŽă§ăăă¨čŚăŞăăšăă§ăă
\năăŁăăŤăžăăŻăăĽăźăăăŻăšăŻăŠăŽăăăŞĺ ´ĺăŤä˝żç¨ăăĺż
čŚăăăăŽă§ăăăăă揥ăŽĺłăŽäžăăăăŻăăźăłă¨ăăŚä˝żç¨ăăžăăăăŽäžăŤăŻăçšĺŽăŽé˘äżăć㤠3 ă¤ăŽç°ăŞăă´ăŤăźăăłăăăăžăă
\n\nG1 㨠G2 ăŻä¸Śĺă´ăŤăźăăłă§ăăăăŁăăŤăăăĄăăťăźă¸ăĺ俥ăçśăăĺăé˘ć°ăĺŽčĄăă 2 ă¤ăŽă´ăŤăźăăłăăăăăŻĺă HTTP ăăłăăŠăĺćăŤĺŽčĄăă 2 ă¤ăŽă´ăŤăźăăłăăăăăžăăă \nG1 㨠G3 ăŻä¸ŚčĄă´ăŤăźăăłă§ăăăG2 㨠G3 ăĺć§ă§ăăăăšăŚăŽă´ăŤăźăăłăŻĺ
¨ä˝ăŽä¸ŚčĄć§é ăŽä¸é¨ă§ăăăG1 㨠G2 ăćĺăŽăšăăăăĺŽčĄăăG3 ă揥ăŽăšăăăăĺŽčĄăăžăă \n \n\n\nĺĺă¨ăăŚă丌ĺă´ăŤăźăăłăŻăăšăŠă¤ăšăŞăŠăŽĺ
ąćăŞă˝ăźăšăŤă˘ăŻăťăšăăăĺ¤ć´ăăăăăĺż
čŚăăăĺ ´ĺăŞăŠăŤă_ĺć_ăăĺż
čŚăăăăžăăĺćăŻăăĽăźăăăŻăšă§ăŻĺźˇĺśăăăžăăăăŠăŽăăŁăăŤĺă§ă埡ĺśăăăžăăďźăăăăĄăăăăŁăăŤăé¤ăďźăăăăăŁăŚăä¸čŹăŤă丌ĺă´ăŤăźăăłéăŽĺćăŻăăĽăźăăăŻăšăäťăăŚéćăăăĺż
čŚăăăăžăă
\nä¸ćšăä¸čŹăŤă丌čĄă´ăŤăźăăłăŻ 調ć´ăăăłăŞăźăąăšăăŹăźăˇă§ăł ăăăĺż
čŚăăăăžăăăă¨ăă°ăG3 ă G1 㨠G2 ăŽä¸ĄćšăăăŽçľćăéç´ăăĺż
čŚăăăĺ ´ĺăG1 㨠G2 ăŻć°ăăä¸éçľćăĺŠç¨ĺŻč˝ă§ăăăă¨ă G3 ăŤéçĽăăĺż
čŚăăăăžăăăăŽčŞżć´ăŻăłăăĽăăąăźăˇă§ăłăŽçŻĺ˛ăă¤ăžăăăŁăăŤăŤčŠ˛ĺ˝ăăžăă
\n丌čĄă´ăŤăźăăłăŤé˘ăăŚăŻăăŞă˝ăźăšăŽćć樊ăăăăšăăăďźG1 ăăăł G2ďźăăĺĽăŽăšăăăďźG3ďźăŤç§ťçŽĄăăăĺ ´ĺăăăăžăăăă¨ăă°ăG1 㨠G2 ăŤăăŁăŚĺ
ąćăŞă˝ăźăšăčąăăŤăŞăŁăŚăăĺ ´ĺăăăćçšă§ăăŽă¸ă§ăăŻĺŽäşăăă¨čŚăŞăăăžăăăăă§ăŻăăăŁăăŤă使ç¨ăăŚăçšĺŽăŽăŞă˝ăźăšăŽćşĺăă§ăăŚăăăă¨ăéçĽăăćć樊ăŽç§ťčť˘ăĺŚçăăĺż
čŚăăăăžăă
\năăĽăźăăăŻăšă¨ăăŁăăŤăŤăŻç°ăŞăăťăăłăăŁăŻăšăăăăžăăăšăăźăăĺ
ąćăăăă¨ăăăžăăŻĺ
ąćăŞă˝ăźăšăŤă˘ăŻăťăšăăăă¨ăăŻăăăĽăźăăăŻăšăŤăăŁăŚăăŽăŞă˝ăźăšă¸ăŽćäťçă˘ăŻăťăšăäżč¨źăăăžăăĺ寞ăŤăăăŁăăŤăŻăăźăżăŽćçĄďźchan struct{} ăŽćçĄďźăŤé˘äżăŞăăˇă°ăăŤăčĄăäťçľăżă§ăă調ć´ăćć樊ăŽç§ťčť˘ăŻăăŁăăŤăéăăŚčĄăĺż
čŚăăăăžăăă´ăŤăźăăłă丌ĺă丌čĄăăçĽăăă¨ăéčŚă§ăăä¸čŹăŤă丌ĺă´ăŤăźăăłăŤăŻăăĽăźăăăŻăšăĺż
čŚă§ă丌čĄă´ăŤăźăăłăŤăŻăăŁăăŤăĺż
čŚă§ăă
\n獜ĺĺéĄăç解ăăŚăăŞăďźăăźăżçŤśĺă¨çŤśĺçść
ăăăăŚGoč¨čŞăŽăĄă˘ăŞă˘ăăŤďź (#58) \n\nčŚç´ \n丌čĄĺŚçăŤçéăăă¨ăăăă¨ăŻăăăźăżçŤśĺă¨çŤśĺçść
ăç°ăŞăćŚĺżľă§ăăăă¨ăç解ăăăă¨ăćĺłăăžăăăăźăżçŤśĺăŻăč¤ć°ăŽă´ăŤăźăăłăĺăăĄă˘ăŞä˝ç˝ŽăŤĺćăŤă˘ăŻăťăšăăăăŽăăĄăŽĺ°ăŞăă¨ă 1 ă¤ăć¸ăčžźăżăčĄăŁăŚăăĺ ´ĺăŤçşçăăžăăä¸ćšăăăźăżçŤśĺăăŞăăă¨ăĺż
ăăăćąşĺŽçĺŽčĄăćĺłăăăăă§ăŻăăăžăăăĺä˝ăĺśĺžĄă§ăăŞăă¤ăăłăăŽé ĺşăăżă¤ăăłă°ăŤäžĺăăŚăăĺ ´ĺăăăăŻçŤśĺçść
ă§ăă
\n \n獜ĺĺéĄăŻăăăă°ăŠăăźăç´é˘ăăĺŻč˝ć§ăŽăăăă°ăŽä¸ă§ćăĺ°éŁăă¤ćăć˝äźć§ăŽéŤăăă°ăŽ 1 ă¤ă¨ăŞăăžăăGo éçşč
ă¨ăăŚăç§ăăĄăŻăăźăżçŤśĺă¨çŤśĺçść
ăăăăăĺăźăăă役éżăăăăłăăăăĺéżăăćšćłăŞăŠăŽéčŚăŞĺ´é˘ăç解ăăĺż
čŚăăăăžăă
\năăźăżçŤśĺ \năăźăżçŤśĺăŻă2 ă¤äťĽä¸ăŽă´ăŤăźăăłăĺăăĄă˘ăŞä˝ç˝ŽăŤĺćăŤă˘ăŻăťăšăăĺ°ăŞăă¨ă 1 ă¤ăć¸ăčžźăżăčĄăŁăŚăăĺ ´ĺăŤçşçăăžăăăăŽĺ ´ĺăĺąéşăŞçľćăçăăĺŻč˝ć§ăăăăžăăăăăŤćŞăăă¨ăŤăçśćłăŤăăŁăŚăŻăăĄă˘ăŞä˝ç˝ŽăŤçĄćĺłăŞăăăăŽçľăżĺăăăĺŤăĺ¤ăäżćăăăŚăăžăĺŻč˝ć§ăăăăžăă
\năăžăăžăŞććłăé§ä˝żăăŚăăăźăżçŤśĺăŽçşçăé˛ăăă¨ăă§ăăžăăăă¨ăă°
\n\nsync/atomic ăăăąăźă¸ă使ç¨ăă 2 ă¤ăŽă´ăŤăźăăłăĺćăăéăŤăăĽăźăăăŻăšăŽăăăŞçšĺŽăŽçŽçăŽăăăŽăăźăżć§é ăĺŠç¨ăă \năăŁăăŤă使ç¨ă㌠2 ă¤ăŽă´ăŤăźăăłăé俥ăăĺ¤ć°ăä¸ĺşŚăŤ 1 ă¤ăŽă´ăŤăźăăłă ăăŤăăŁăŚć´ć°ăăăăăăŤăă \n \n獜ĺçść
\nĺŽčĄăăăćä˝ăŤĺżăăŚăăăźăżçŤśĺăŽăŞăă˘ăăŞăąăźăˇă§ăłăĺż
ăăăćąşĺŽçăŞçľćăćĺłăăă§ăăăăăăăă¨ăŻăăăžăăă
\n獜ĺçść
ăŻăĺä˝ăĺśĺžĄă§ăăŞăă¤ăăłăăŽăˇăźăąăłăšăžăăŻăżă¤ăăłă°ăŤäžĺăăĺ ´ĺăŤçşçăăžăăăăă§ăŻăă¤ăăłăăŽăżă¤ăăłă°ăă´ăŤăźăăłăŽĺŽčĄé ĺşă§ăă
\năžă¨ăăă¨ă丌čĄĺŚçăŽă˘ăăŞăąăźăˇă§ăłă§ä˝ćĽăăĺ ´ĺăăăźăżçŤśĺăŻçŤśĺçść
ă¨ăŻç°ăŞăăă¨ăç解ăăăă¨ăä¸ĺŻćŹ ă§ăăăăźăżçŤśĺăŻăč¤ć°ăŽă´ăŤăźăăłăĺăăĄă˘ăŞä˝ç˝ŽăŤĺćăŤă˘ăŻăťăšăăăăŽăăĄăŽĺ°ăŞăă¨ă 1 ă¤ăć¸ăčžźăżăčĄăŁăŚăăĺ ´ĺăŤçşçăăžăăăăźăżçŤśĺă¨ăŻăäşćłĺ¤ăŽĺä˝ăćĺłăăžăăăă ăăăăźăżçŤśĺăŽăŞăă˘ăăŞăąăźăˇă§ăłăĺż
ăăăćąşĺŽçăŞçľćăćĺłăăăăă§ăŻăăăžăăăăăźăżçŤśĺăăŞăăŚăăă˘ăăŞăąăźăˇă§ăłăŻĺśĺžĄăăăŚăăŞăă¤ăăłăďźă´ăŤăźăăłăŽĺŽčĄăăăŁăăŤă¸ăŽăĄăăťăźă¸ăŽçşäżĄé庌ăăăźăżăăźăšă¸ăŽĺźăłĺşăăŽçśçśćéăŞăŠďźăŤäžĺăăćĺăćă¤ăă¨ăăăăžăăăăŽĺ ´ĺăŻçŤśĺçść
ă§ăă丌čĄĺŚçăŽă˘ăăŞăąăźăˇă§ăłăŽč¨č¨ăŤç硴ăăăŤăŻă严ćšăŽćŚĺżľăç解ăăăă¨ăččŚă§ăă
\nă˝ăźăšăłăźă
\năŻăźăŻăăźăăżă¤ăăă¨ăŽä¸ŚčĄĺŚçăŽĺ˝ąéżăç解ăăŚăăŞă (#59) \n\nčŚç´ \nä¸ĺŽć°ăŽă´ăŤăźăăłăä˝ćăăă¨ăăŻăăŻăźăŻăăźăăŽăżă¤ăăčć
ŽăăŚăă ăăăCPU ăăŚăłăăŽă´ăŤăźăăłăä˝ćăăă¨ăăăă¨ăŻăăăŽć°ă GOMAXPROCS ĺ¤ć°ďźăăăŠăŤăă§ăŻăăšăä¸ăŽ CPU ăłă˘ăŽć°ăŤĺşăĽăďźăŤčżăĽăăăă¨ăćĺłăăžăăI/O ăăŚăłăăŽă´ăŤăźăăłăŽä˝ćăŻăĺ¤é¨ăˇăšăă ăŞăŠăŽäťăŽčŚĺ ăŤäžĺăăžăă
\n \năăă°ăŠăăłă°ă§ăŻăăŻăźăŻăăźăăŽĺŽčĄćéăŻćŹĄăŽăăăăăŤăăŁăŚĺśéăăăžăă
\n\nCPU ăŽé庌 - ăă¨ăă°ăăăźă¸ă˝ăźăă˘ăŤă´ăŞăşă ăŽĺŽčĄăăăăŤăăăăžăăăăŽăŻăźăŻăăźă㯠CPU ăăŚăłăă¨ĺźă°ăăžăă \nI/O ăŽé庌 - ăă¨ăă°ăREST ĺźăłĺşăăăăźăżăăźăšăŻă¨ăŞăŽĺŽčĄăăăăŤăăăăžăăăăŽăŻăźăŻăăźă㯠I/O ăăŚăłăă¨ĺźă°ăăžăă \nĺŠç¨ĺŻč˝ăŞăĄă˘ăŞăŽé - ăăŽăŻăźăŻăăźăăŻăĄă˘ăŞăăŚăłăă¨ĺźă°ăăžăă \n \n\nčŁčśł \năăć°ĺĺš´ă§ăĄă˘ăŞăé常ăŤĺŽäžĄăŤăŞăŁăăă¨ăčć
Žăăă¨ă 3 ă¤çŽăŻçžĺ¨ă§ăŻćăăžăă§ăăăăăăŁăŚăăăŽăťăŻăˇă§ăłă§ăŻăćĺ㎠2 ă¤ăŽăŻăźăŻăăźăăżă¤ăăCPU ăăŚăłă㨠I/O ăăŚăłăăŤçŚçšăĺ˝ăŚăžăă
\n \năŻăźăŤăźăŤăăŁăŚĺŽčĄăăăăŻăźăŻăăźăă I/O ăăŚăłăă§ăăĺ ´ĺăĺ¤ăŻä¸ťăŤĺ¤é¨ăˇăšăă ăŤäžĺăăžăăéăŤăăŻăźăŻăăźăă CPU ăŤäžĺăăŚăăĺ ´ĺăă´ăŤăźăăłăŽćéŠăŞć°ăŻĺŠç¨ĺŻč˝ăŞ CPU ăłă˘ăŽć°ăŤčżăăŞăăžăďźăăšăăăŠăŻăăŁăšăŻ runtime.GOMAXPROCS ă使ç¨ăăăă¨ă§ăďźă丌čĄĺŚçăŽă˘ăăŞăąăźăˇă§ăłăč¨č¨ăăĺ ´ĺăăŻăźăŻăăźăăŽăżă¤ăďź I/O ăăă㯠CPU ďźăçĽăăă¨ăéčŚă§ăă
\nă˝ăźăšăłăźă
\nGo Context ăŤĺŻžăă誤解 (#60) \n\nčŚç´ \nGo Context ăŻăGoč¨čŞăŽä¸ŚčĄĺŚçăŽĺşç¤ăŽä¸é¨ă§ăăăăžăă Context ă使ç¨ăăă¨ăăăăăŠă¤ăłăăăźă¨ĺ¤ăŽăŞăšăăäżćă§ăăžăă
\n \n\n
https://pkg.go.dev/context
\n
Context ăŻăăăăăŠă¤ăłăăăŁăłăťăŤăˇă°ăăŤăăăŽäťăŽĺ¤ă API ăŽĺ˘çăčśăăŚäźéăăžăă
\n
ăăăăŠă¤ăł \năăăăŠă¤ăłă¨ăŻă揥ăŽăăăăă§ćąşĺŽăăăçšĺŽăŽćçšăćăăžăă
\n\nçžĺ¨ăă㎠time.Duration ďźäžďź250 msďź \ntime.Time ďźäžďź2023-02-07 00:00:00 UTCďź \năăăăŠă¤ăłăŽăťăăłăăŁăŻăšăŻăăăăéăăĺ ´ĺăŻé˛čĄä¸ăŽă˘ăŻăăŁăăăŁăĺć˘ăăĺż
čŚăăăăă¨ăäźăăžăăă˘ăŻăăŁăăăŁă¨ăŻăăă¨ăă°ăăăŁăăŤăăăŽăĄăăťăźă¸ăŽĺ俥ăĺž
ćŠăăŚăă I/O ăŞăŻă¨ăšăăă´ăŤăźăăłă§ăă
\năăŁăłăťăŤăˇă°ă㍠\nGo Context ăŽăă 1 ă¤ăŽä˝żç¨äžăŻăăăŁăłăťăŤăˇă°ăăŤăäźéăăăă¨ă§ăăĺĽăŽă´ăŤăźăăłĺ
㧠CreateFileWatcher(ctx context.Context, filename string) ăĺźăłĺşăă˘ăăŞăąăźăˇă§ăłăä˝ćăăăă¨ăćłĺăăŚăżăžăăăăăăŽé˘ć°ăŻăăăĄă¤ăŤăăčŞăżĺăăçśăăŚć´ć°ăăăŁăăăăçšĺŽăŽăăĄă¤ăŤăŚăŠăăăŁăźăä˝ćăăžăăćäžăăă Context ăćéĺăăŤăŞăăăăŁăłăťăŤăăăă¨ăăăŽé˘ć°ăŻăăăĺŚçăăŚăăĄă¤ăŤč¨čż°ĺăéăăžăă
\nContext Value \nGo Context ăŽćĺžăŽä˝żç¨äžăŻăăăźă¨ĺ¤ăŽăŞăšăăéăśăă¨ă§ăă Context ăŤăăźă¨ĺ¤ăŽăŞăšăăĺŤăăćĺłăŻä˝ă§ăăăăăGo Context ăŻćąç¨çă§ăăăăă使ç¨äžăŻçĄéăŤăăăžăă
\năă¨ăă°ăăăŹăźăšă使ç¨ăăĺ ´ĺăç°ăŞăăľăé˘ć°ăŽéă§ĺăç¸é˘ ID ăĺ
ąćăăăăă¨ăăăăăăăăžăăăä¸é¨ăŽéçşč
ăŻăă㎠ID ăé˘ć°ăˇă°ăăăŁăŽä¸é¨ăŤăăăŤăŻăăžăăŤäžľçĽçă ă¨čăăăăăăăžăăăăăŽçšăŤé˘ăăŚăä¸ăăăă Context ăŽä¸é¨ă¨ăăŚăăăĺŤăăăă¨ăćąşĺŽăăăă¨ăă§ăăžăă
\nContext ăŽăăŁăłăťăŤăăăŁăăăă \ncontext.Context ăżă¤ăăŻăĺ俥ĺ°ç¨ăŽéçĽăăŁă㍠<-chan struct{} ăčżă Done ăĄă˝ăăăă¨ăŻăšăăźăăăžăăăăŽăăŁăăŤăŻă Context ăŤé˘éŁäťăăăăä˝ćĽăăăŁăłăťăŤăăĺż
čŚăăăĺ ´ĺăŤéăăăăžăăăă¨ăă°
\n\ncontext.WithCancelă§ä˝ćăăă Context ăŤé˘éŁăă Done ăăŁăăŤăŻăcancelé˘ć°ăĺźăłĺşăăăă¨éăăăăžăă context.WithDeadlineă§ä˝ćăă Context ăŤé˘éŁăă Done ăăŁăăŤăŻăăăăăŠă¤ăłăéăăă¨éăăăăžăă \n注ćăăšăçšăŽ 1 ă¤ăŻăĺ
é¨ăăŁăăŤăŻăçšĺŽăŽĺ¤ăĺăĺăŁăă¨ăă§ăŻăŞăă Context ăăăŁăłăťăŤăăăă¨ăăăžăăŻăăăăŠă¤ăłăŤéăăă¨ăăŤéăăĺż
čŚăăăă¨ăăăă¨ă§ăăăăŁăăŤăŽăŻăăźăşăŻăăăšăŚăŽćśč˛ťč
ă´ăŤăźăăłăĺăĺăĺŻä¸ăŽăăŁăăŤă˘ăŻăˇă§ăłă§ăăăăă§ăăăăŽăăăŤăăŚă Context ăăăŁăłăťăŤăăăăăăăăăŠă¤ăłăŤéăăă¨ăăăšăŚăŽćśč˛ťč
ăŤéçĽăĺąăăžăă
\năžă¨ăăă¨ăç硴ăă Go éçşč
ăŤăŞăăŤăŻă Context ă¨ăăŽä˝żç¨ćšćłăŤă¤ăăŚç解ăăĺż
čŚăăăăžăăĺĺă¨ăăŚăăŚăźăśăźăĺž
ćŠăăăăăé˘ć°ăŻ Context ăĺĺžăăăšăă§ăăăăăŤăăăä¸ćľăŽĺźăłĺşăĺ
ăăăŽé˘ć°ăăă¤ĺźăłĺşăăăćąşĺŽă§ăăăăăŤăŞăăăă§ăă
\nă˝ăźăšăłăźă
\n丌čĄĺŚçďźĺŽčˇľ \nä¸éŠĺ㪠Context ăĺşăăŚăăžă (#61) \n\nčŚç´ \nContext ăäźćăăéăŤăŻăContext ăăăŁăłăťăŤă§ăăćĄäťśăç解ăăăă¨ăéčŚă§ăăăă¨ăă°ăăŹăšăăłăšăé俥ăăăé㍠HTTP ăăłăăŠă Context ăăăŁăłăťăŤăăă¨ăăŞăŠă§ăă
\n \nĺ¤ăăŽçśćłă§ăŻăGo Context ăäźćăăăă¨ăć¨ĺĽ¨ăăăžăăăă ăăContext ăŽäźćăŤăăŁăŚčť˝ĺžŽăŞăă°ăçşçăăăľăé˘ć°ăćŁăăĺŽčĄăăăŞăăŞăĺ ´ĺăăăăžăă
\n揥ăŽäžăčăăŚăżăžăăăăăăă¤ăăŽăżăšăŻăĺŽčĄăăŚăŹăšăăłăšăčżă HTTP ăăłăăŠăĺ
Źéăăžăăăă ăăăŹăšăăłăšăčżăç´ĺăŤăăăă Kafka ăăăăŻăŤé俥ăăăă¨ćăŁăŚăăžăăHTTP ăłăłăˇăĽăźăăŤăŹă¤ăăłăˇăŽçšă§ăăăŤăăŁă課ăăăăŞăăŽă§ăpublish ă˘ăŻăˇă§ăłăć°ăăă´ăŤăźăăłĺ
ă§éĺćăŤĺŚçăăăă¨čăăŚăăžăăăă¨ăă°ăContext ăăăŁăłăťăŤăăăĺ ´ĺăŤăĄăăťăźă¸ăŽ publish ă˘ăŻăˇă§ăłăä¸ćă§ăăăăăŤăContext ăĺăĺ
Ľăă publish é˘ć°ăčŞçąăŤä˝żăăă¨ăăžăăĺŻč˝ăŞĺŽčŁ
ăŻćŹĄăŽă¨ăăă§ăă
\nfunc handler ( w http . ResponseWriter , r * http . Request ) { \n response , err := doSomeTask ( r . Context (), r ) \n if err != nil { \n http . Error ( w , err . Error (), http . StatusInternalServerError ) \n return \n } \n go func () { \n err := publish ( r . Context (), response ) \n // err ăŽĺŚçăăă \n }() \n writeResponse ( response ) \n} \năăŽăłăźăăŽä˝ăĺéĄăŞăŽă§ăăăăăHTTP ăŞăŻă¨ăšăăŤäťăăă Context ăŻăăăžăăžăŞçśćłă§ăăŁăłăťăŤăăăĺŻč˝ć§ăăăăă¨ăçĽăŁăŚăăĺż
čŚăăăăžăă
\n\năŻăŠă¤ă˘ăłăăŽćĽçśăçľäşăăă¨ă \nHTTP/2ăŞăŻă¨ăšăăŽĺ ´ĺăăŞăŻă¨ăšăăăăŁăłăťăŤăăăă¨ă \năŻăŠă¤ă˘ăłăăŤăŹăšăăłăšăć¸ăćťăăăă¨ă \n \nćĺ㎠2 ă¤ăŽăąăźăšă§ăŻăĺŚçăŻăăăăćŁăăčĄăăăžăăăă¨ăă°ădoSomeTask ăăăŹăšăăłăšăĺăĺăŁăăăŽăŽăăŻăŠă¤ă˘ăłăăćĽçśăéăăĺ ´ĺăăĄăăťăźă¸ă publish ăăăŞăăăăŤăContext ăć˘ăŤăăŁăłăťăŤăăăçść
㧠publish ăĺźăłĺşăăŚăĺéĄăŻăăăă辡ăăžăăăăăăăćĺžăŽăąăźăšăŻăŠăă§ăăăăă
\năŹăšăăłăšăăŻăŠă¤ă˘ăłăăŤć¸ăčžźăžăăă¨ăčŚćąăŤé˘éŁäťăăăă Context ăăăŁăłăťăŤăăăžăăăăăăŁăŚă獜ĺçść
ăŤç´é˘ăăžăă
\n\năŹăšăăłăšă Kafka ㎠publish ĺžăŤć¸ăăăĺ ´ĺăăŹăšăăłăšăčżăăăĄăăťăźă¸ăćŁĺ¸¸ăŤĺ
Źéăăžăă \năă ăăKafka ㎠publish ĺăžă㯠publish ä¸ăŤăŹăšăăłăšăć¸ăăăĺ ´ĺăăĄăăťăźă¸ăŻ publish ăăăăšăă§ăŻăăăžăăă \n \nĺžč
ăŽĺ ´ĺăHTTP ăŹăšăăłăšăăăăŤčżăăŽă§ăpublish ăĺźăłĺşăă¨ă¨ăŠăźăčżăăăžăă
\n\nčŁčśł \nGo 1.21 ăăăŻăăăŁăłăťăŤăăăŤć°ăă Context ăä˝ćăăćšćłăčż˝ĺ ăăăžăăă context.WithoutCancel
\n \năžă¨ăăă¨ăContext ăŽäźćăŻć
éăŤčĄăĺż
čŚăăăăžăă
\nă˝ăźăšăłăźă
\nĺć˘ăăšăă¨ăăçĽăăăŤă´ăŤăźăăłăéĺ§ăăŚăăžă (#62) \n\nčŚç´ \năŞăźăŻăéżăăăă¨ăŻăă´ăŤăźăăłăéĺ§ăăăăăłăŤăćçľçăŤĺć˘ăăĺż
čŚăăăăă¨ăćĺłăăžăă
\n \nă´ăŤăźăăłăŻç°ĄĺăŤčĄăăă¨ăă§ăăžăăé常ăŤç°Ąĺă§ăăăăăć°ăăă´ăŤăźăăłăăă¤ĺć˘ăăăăŤă¤ăăŚăŽč¨çťăĺż
ăăăçŤăŚăŚăăŞăĺŻč˝ć§ăăăăăŞăźăŻăŤă¤ăŞăăăă¨ăăăăžăăă´ăŤăźăăłăăă¤ĺć˘ăăă°ăăăăăăăŞăăŽăŻăGoč¨čŞă§ăăăăč¨č¨ä¸ăŽĺéĄă§ăăă丌čĄĺŚçăŤăăăăăšă§ăă
\nĺ
ˇä˝çăŞäžăŤă¤ăăŚčŞŹćăăžăăăăĺ¤é¨č¨ĺŽďźăăźăżăăźăšćĽçśăŞăŠă使ç¨ăăăăŽăŞăŠďźăçŁčŚăăĺż
čŚăăăă˘ăăŞăąăźăˇă§ăłăč¨č¨ăăžăăăžăă揥ăŽăăăŞĺŽčŁ
ăăăŚăżăžăă
\nfunc main () { \n newWatcher () \n // ă˘ăăŞăąăźăˇă§ăłăĺŽčĄăă \n} \ntype watcher struct { /* ăăă¤ăăŽăŞă˝ăźăš */ } \nfunc newWatcher () { \n w := watcher {} \n go w . watch () // ĺ¤é¨č¨ĺŽăçŁčŚăăă´ăŤăźăăłăä˝ćăă \n} \năăŽăłăźăăŽĺéĄăŻăăĄă¤ăłăŽă´ăŤăźăăłăçľäşăăă¨ďźăăăă OS ăˇă°ăăŤăžăăŻćéăŽăŻăźăŻăăźăăŽăăďźăă˘ăăŞăąăźăˇă§ăłăĺć˘ăăŚăăžăăă¨ă§ăăăăăăŁăŚăăŚăŠăăăŁăźăŤăăŁăŚä˝ćăăăăŞă˝ăźăšăŻćŁĺ¸¸ăŤéăăăăžăăăăăăé˛ăăŤăŻăŠăăăă°ăăă§ăăăăă
\n1 ă¤ăŽćšćłă¨ăăŚăŻămain ăćťăŁăă¨ăăŤăăŁăłăťăŤăăă Context ă newWatcher ăŤć¸Ąăăă¨ăćăăăăžăă
\nfunc main () { \n ctx , cancel := context . WithCancel ( context . Background ()) \n defer cancel () \n newWatcher ( ctx ) \n // ă˘ăăŞăąăźăˇă§ăłăĺŽčĄăă \n} \nfunc newWatcher ( ctx context . Context ) { \n w := watcher {} \n go w . watch ( ctx ) \n} \nä˝ćăă Context ă watch ăĄă˝ăăăŤäźćăăžăăContext ăăăŁăłăťăŤăăăă¨ăăŚăŠăăăŁăźć§é ä˝ăŻăăŽăŞă˝ăźăšăéăăžăăăăăăwatch ăăăăčĄăćéă確ĺŽăŤăăă¨ăŻăăăžăăăăăăŻč¨č¨ä¸ăŽćŹ éĽă§ăă
\nĺéĄăŻăă´ăŤăźăăłăĺć˘ăăĺż
čŚăăăăă¨ăäźăăăăăŤăˇă°ăăŤă使ç¨ăăăă¨ă§ăăăŞă˝ăźăšăéăăăăăžă§ă茪ăŽă´ăŤăźăăłăăăăăŻăăžăăă§ăăăăăăŞăăŞăăăăŤăăžăăăă
\nfunc main () { \n w := newWatcher () \n defer w . close () \n // ă˘ăăŞăąăźăˇă§ăłăĺŽčĄăă \n} \nfunc newWatcher () watcher { \n w := watcher {} \n go w . watch () \n return w \n} \nfunc ( w watcher ) close () { \n // ăŞă˝ăźăšăéăă \n} \năŞă˝ăźăšăéăăćéăŤăŞăŁăăă¨ă watcher ăŤéçĽăă䝣ăăăŤă defer ă使ç¨ăăŚăăŽăclose ăĄă˝ăăăĺźăłĺşăăă˘ăăŞăąăźăˇă§ăłăçľäşăăĺăŤăŞă˝ăźăšă確ĺŽăŤéăăăăăăăŤăăžăă
\năžă¨ăăă¨ăă´ăŤăźăăłăŻäťăŽăŞă˝ăźăšă¨ĺć§ăăĄă˘ăŞăäťăŽăŞă˝ăźăšă解ćžăăăăăŤćçľçăŤéăăĺż
čŚăăăăă¨ăŤćł¨ćăăŚăă ăăăă´ăŤăźăăłăăă¤ĺć˘ăăăăçĽăăăŤéĺ§ăăăŽăŻč¨č¨ä¸ăŽĺéĄă§ăăă´ăŤăźăăłăéĺ§ăăăă¨ăăŻĺ¸¸ăŤăăă¤ĺć˘ăăăăŤă¤ăăŚć確ăŞč¨çťăçŤăŚăĺż
čŚăăăăžăăćĺžăŤăŞăăžăăăăă´ăŤăźăăłăăŞă˝ăźăšăä˝ćăăăăŽćĺšćéăă˘ăăŞăąăźăˇă§ăłăŽĺçśćéăŤăă¤ăłăăăăŚăăĺ ´ĺăŻăă˘ăăŞăąăźăˇă§ăłăçľäşăăĺăŤăăŽă´ăŤăźăăłăĺŽäşăăăŽăĺž
ăŁăćšăăăăă確ĺŽă§ăăăăăăăă¨ă§ăăŞă˝ăźăšăééăăŞă解ćžă§ăăžăă
\nă˝ăźăšăłăźă
\nă´ăŤăźăăłă¨ăŤăźăĺ¤ć°ăŤćł¨ćăăŞă (#63) \n\n注ć \năăŽăăšăŻ Goă1.22 ăăăŻć°ăŤăăĺż
čŚăăăăžăăďźčŠłç´° ďźă
\n \nselect ă¨ăăŁăăŤă使ç¨ăăŚćąşĺŽçĺä˝ăćĺž
ăă (#64)\nčŚç´ \nč¤ć°ăŽăŞăăˇă§ăłăĺŻč˝ăŞĺ ´ĺăč¤ć°ăŽăăŁăăŤă§ select ăăă¨ăąăźăšăăŠăłăă ăŤé¸ćăăăăă¨ăç解ăăă¨ă丌čĄĺŚçăŤăăă蝽垎ăŞăă°ăŤă¤ăŞăăĺŻč˝ć§ăŽăă誤ăŁă䝎ĺŽăçŤăŚăăă¨ăăŞăăŞăăžăă
\n \nGo éçşč
ăăăŁăăŤăćä˝ăăă¨ăăŤăăăăĄăŞééă㎠1 ă¤ăŻăselect ăč¤ć°ăŽăăŁăăŤă§ăŠăŽăăăŤĺä˝ăăăăŤă¤ăăŚčޤăŁăç解ăăăăă¨ă§ăă
\năă¨ăă°ă揥ăŽĺ ´ĺăčăăŚăżăžăăăďź disconnectCh ăŻăăăăĄăŞăăăŁăăŤă§ăďźă
\ngo func () { \n for i := 0 ; i < 10 ; i ++ { \n messageCh <- i \n } \n disconnectCh <- struct {}{} \n}() \nfor { \n select { \n case v := <- messageCh : \n fmt . Println ( v ) \n case <- disconnectCh : \n fmt . Println ( \"disconnection, return\" ) \n return \n } \n} \năăŽäžăč¤ć°ĺĺŽčĄăăĺ ´ĺăçľćăŻăŠăłăă ăŤăŞăăžăă
\năŠăăăăăă 10 éăŽăĄăăťăźă¸ăćśč˛ťăăăŽă§ăŻăŞăăăăŽăăĄăŽć°éă ăăĺ俥ăăžăăăăăăŻăč¤ć°ăŽăăŁăăŤă¨ä˝ľç¨ăăĺ ´ĺ㎠select ćăŽäťć§ăŤăăăăŽă§ăďźhttps:// go.dev/ref/specďźă
\n\n
Quote
\n
1 ă¤äťĽä¸ăŽé俥ăçśčĄă§ăăĺ ´ĺăĺä¸ăŽćŹäźźăŠăłăă é¸ćăŤăăŁăŚăçśčĄă§ăă 1 ă¤ăŽé俥ăé¸ćăăăžăă
\n
ćĺăŤä¸č´ăăăąăźăšăĺŞĺ
ăăă switch ćă¨ăŻç°ăŞăăselect ćăŻč¤ć°ăŽăŞăăˇă§ăłăĺŻč˝ăŞĺ ´ĺăŤăŠăłăă ăŤé¸ćăăžăă
\năăŽĺä˝ăŻćĺăŻĺĽĺŚăŤćăăăăăăăžăăăăăăăăăăŻăšăżăăźăˇă§ăłăé˛ăă¨ăăççąăăăŁăŚăŽăă¨ă§ăăćĺăŤé¸ćăăăé俥ăă˝ăźăšăŽé ĺşăŤĺşăĽăăŚăăă¨ăăžăăăăŽĺ ´ĺăé俥é庌ăéăăăăŤăăă¨ăă° 1 ă¤ăŽăăŁăăŤăăăăĺ俥ă§ăăŞăă¨ăăçśćłăŤéĽăĺŻč˝ć§ăăăăžăăăăăé˛ăăăăŤăGoč¨čŞăŽč¨č¨č
ăŻăŠăłăă é¸ćă使ç¨ăăăă¨ăŤăăžăăă
\nč¤ć°ăŽăăŁăăŤă§ select ă使ç¨ăăĺ ´ĺăč¤ć°ăŽăŞăăˇă§ăłăăăăŞăăă˝ăźăšé ĺşăŽćĺăŽăąăźăšăčŞĺçăŤĺŞĺ
ăăăăăă§ăŻăŞăăă¨ăŤćł¨ćăăĺż
čŚăăăăžăă䝣ăăăŤăGoč¨čŞăŻăŠăłăă ăŤé¸ćăăăăăăŠăŽăŞăăˇă§ăłăé¸ćăăăăăŻäżč¨źăăăžăăăăăŽĺä˝ăĺ
ćăăăŤăŻăĺä¸ăŽççŁč
ă´ăŤăźăăłăŽĺ ´ĺăăăăăĄăŞăăŽăăŁăăŤăžăăŻĺä¸ăŽăăŁăăŤă使ç¨ăăăă¨ăă§ăăžăă
\nă˝ăźăšăłăźă
\néçĽăăŁăăŤă使ç¨ăăŚăăŞă (#65) \n\nčŚç´ \nchan struct{} ĺă使ç¨ăăŚéçĽăé俥ăăžăăăă
\n \năăŁăăŤăŻăăˇă°ăăŤăäťăăŚă´ăŤăźăăłéă§é俥ăăăăăŽăĄăŤăăşă ă§ăăăˇă°ăăŤăŤăŻăăźăżăĺŤăžăăŚăăăăŠăăăŻé˘äżăăăžăăă
\nĺ
ˇä˝çăŞäžăčŚăŚăżăžăăăăé俥ăŽĺćăçşçăăăăłăŤăăăéçĽăăăăŁăăŤăä˝ćăăžăă 1 ă¤ăŽćšćłă¨ăăŚăăăă chan bool ă¨ăăŚćąăăă¨ăćăăăăžăă
\ndisconnectCh := make ( chan bool ) \năăă§ăăăŽăăăŞăăŁăăŤăćäžăă API ă¨ĺŻžčŠąăăă¨ăăžăăăăăŻçĺ˝ĺ¤ăŽăăŁăăŤă§ăăăăătrue ăžă㯠false ăŽăĄăăťăźă¸ăĺ俥ă§ăăžăătrue ăä˝ăäźăăŚăăăăŻăăăăćăăă§ăăăăăăăă false ă¨ăŻä˝ăćĺłăăăŽă§ăăăăăé俥ăĺćăăăŚăăŞăă¨ăăăă¨ă§ăăăăăăăŽĺ ´ĺăăŠăăăăăŽé ťĺşŚă§ăăŽăăăŞăˇă°ăăŤăĺ俥ăăăŽă§ăăăăăăăăăŻĺćĽçśăăă¨ăăăă¨ă§ăăăăăăăăă false ăĺăĺăăă¨ăćĺž
ăăšăăŞăŽă§ăăăăăăăăă true ăĄăăťăźă¸ăĺăĺăăă¨ă ăăćĺž
ăăšăă§ăăăă
\năăŽĺ ´ĺăć
ĺ ąăäźăăăăăŤçšĺŽăŽĺ¤ăŻĺż
čŚăŞăăă¨ăćĺłăăăăźăżăŽ ăŞă ăăŁăăŤăĺż
čŚăŤăŞăăžăăăăăĺŚçăăć
Łç¨çăŞćšćłăŻă犺ăŽć§é ä˝ăŽăăŁăăŤââ chan struct{}ââă使ç¨ăăăă¨ă§ăă
\nnil ăăŁăăŤă使ç¨ăăŚăăŞă (#66) \n\nčŚç´ \nnil ăăŁăăŤă使ç¨ăăăă¨ăŤăăŁăŚăăă¨ăă° select ćăăăąăźăšă ĺé¤ ă§ăăăăă丌čĄĺŚçăčĄăéăŽéĺ
ˇăŽä¸ă¤ă¨ăăŚä˝żăăăăăŤăŞăăšăă§ăă
\n \n揥ăŽăłăźăăŤăăŁăŚä˝ăčĄăăăă§ăăăăă
\n\nch 㯠chan int ĺă§ăăăăŁăăŤăŽăźăĺ¤ăŻ nil ă§ăăăŽă§ă ch 㯠nil ă§ăăă´ăŤăźăăłăŻ panic ă辡ăăăžăăăăă ăăć°¸äš
ăŤăăăăŻăăžăă
\nnil ăăŁăăŤăŤăĄăăťăźă¸ăé俥ăăĺ ´ĺăĺçăŻĺăă§ăă䝼ä¸ăŽă´ăŤăźăăłăŻć°¸äš
ăŤăăăăŻăăžăă
\nvar ch chan int \nch <- 0 \nă§ăŻăGoč¨čŞă nil ăăŁăăŤă¨ăŽéă§ăĄăăťăźă¸ăŽéĺ俥ă訹ĺŻăăçŽçăŻä˝ă§ăăăăăăă¨ăă°ă2 ă¤ăŽăăŁăăŤăăăźă¸ăăć
Łç¨çăŞćšćłăĺŽčŁ
ăăăŽăŤă nil ăăŁăăŤă使ç¨ăăăă¨ăă§ăăžăă
\nfunc merge ( ch1 , ch2 <- chan int ) <- chan int { \n ch := make ( chan int , 1 ) \n go func () { \n for ch1 != nil || ch2 != nil { // ćä˝ă§ăä¸ă¤ăŽăăŁăăŤă nil ă§ăŞăăă°çśčĄăă \n select { \n case v , open := <- ch1 : \n if ! open { \n ch1 = nil // éăăă ch1 ă nil ăăŁăăŤăŤĺ˛ăĺ˝ăŚă \n break \n } \n ch <- v \n case v , open := <- ch2 : \n if ! open { \n ch2 = nil // éăăă ch2 ă nil ăăŁăăŤăŤĺ˛ăĺ˝ăŚă \n break \n } \n ch <- v \n } \n } \n close ( ch ) \n }() \n return ch \n} \năăŽć´çˇ´ăăă解湺çăŻănil ăăŁăăŤăĺŠç¨ăăŚăä˝ăăăŽćšćłă§ select ćăă 1 ă¤ăŽăąăźăšă ĺé¤ ăăžăă
\nnil ăăŁăăŤăŻçśćłăŤăăŁăŚăŻäžżĺŠă§ăăăGo éçşč
ăŻä¸ŚčĄĺŚçăćąăéăŤä˝żăăăŞăăăăăŤăŞăŁăŚăăăšăă§ăă
\nă˝ăźăšăłăźă
\năăŁăăŤăŽĺŽšéăŤă¤ăăŚĺ°ćăăŚăă (#67) \n\nčŚç´ \nĺéĄăçşçăăĺ ´ĺăŻă使ç¨ăăăăŁăăŤăŽĺăć
éăŤćąşĺŽăăŚăă ăăăĺćă埡ĺăŤäżč¨źăăŚăăăăŽăŻăăăăĄăŞăăăŁăăŤăŽăżă§ăă
\n \năăăăĄăăăăŁăăŤäťĽĺ¤ăŽăăŁăăŤăŽĺŽšéăćĺŽăăăŤăŻćŁĺ˝ăŞççąăăăăšăă§ăă
\nćĺĺăăŠăźăăăă§čľˇăăĺžăĺŻä˝ç¨ăĺżăăŚăăžăďź etcd ăăźăżçŤśĺăŽäžă¨ăăăăăăŻďź (#68) \n\nčŚç´ \nćĺĺăŽć¸ĺźč¨ĺŽăć˘ĺăŽé˘ć°ăĺźăłĺşăĺŻč˝ć§ăăăăă¨ăčŞčăăăă¨ăŻăăăăăăăŻăăăŽäťăŽăăźăżçŤśĺăŽĺŻč˝ć§ăŤćł¨ćăăăă¨ăćĺłăăžăă
\n \nă˝ăźăšăłăźă
\nappend ă§ăăźăżçŤśĺă辡ăăăŚăăžă (#69)\nčŚç´ \nappend ăŽĺźăłĺşăăŻĺż
ăăăăăźăżçŤśĺăăŞăăăă§ăŻăăăžăăăăăăŤăĺ
ąćăšăŠă¤ăšä¸ă§ĺćăŤä˝żç¨ăăŚăŻăăăžăăă
\n \nă˝ăźăšăłăźă
\năšăŠă¤ăšă¨ăăăă§ăăĽăźăăăŻăšăćŁăă使ç¨ăăŚăăŞă (#70) \n\nčŚç´ \năšăŠă¤ăšă¨ăăăăŻăă¤ăłăżă§ăăăă¨ăčŚăăŚăăă¨ăĺ
¸ĺçăŞăăźăżçŤśĺăé˛ăăă¨ăă§ăăžăă
\n \nă˝ăźăšăłăźă
\nsync.WaitGroup ăćŁăă使ç¨ăăŚăăŞă (#71)\nčŚç´ \nsync.WaitGroup ăćŁăă使ç¨ăăăŤăŻăă´ăŤăźăăłă辡ĺăăĺ㍠Add ăĄă˝ăăăĺźăłĺşăăžăăăă
\n \nă˝ăźăšăłăźă
\nsync.Cond ăŤă¤ăăŚĺżăăŚăăžă (#72)\nčŚç´ \nsync.Cond ă使ç¨ăăă¨ăč¤ć°ăŽă´ăŤăźăăłăŤçš°ăčżăéçĽăé俥ă§ăăžăă
\n \nă˝ăźăšăłăźă
\nerrgroup ă使ç¨ăăŚăăŞă (#73)\nčŚç´ \nerrgroup ăăăąăźă¸ă使ç¨ăăŚăă´ăŤăźăăłăŽă°ăŤăźăăĺćăăă¨ăŠăźă¨ Context ăĺŚçă§ăăžăă
\n \nă˝ăźăšăłăźă
\nsync ĺăŽăłăăź (#74)\nčŚç´ \nsync ĺăŻăłăăźăăăăšăă§ăŻăăăžăăă
\n \nă˝ăźăšăłăźă
\nć¨ćşăŠă¤ăăŠăŞ \nééăŁăćéăćĺŽăă (#75) \n\nčŚç´ \ntime.Duration ăĺăĺ
Ľăăé˘ć°ăŤăŻćł¨ćăćăŁăŚăă ăăăć´ć°ă渥ăăă¨ăŻč¨ąĺŻăăăŚăăžăăă桡䚹ăćăăŞăăă㍠time API ă使ç¨ăăăăĺŞăăŚăă ăăă
\n \nć¨ćşăŠă¤ăăŠăŞăŽĺ¤ăăŽé˘ć°ăŻăint64 ĺăŽă¨ă¤ăŞă˘ăšă§ăă time.Duration ăĺăĺ
Ľăăžăăăă ăă1 ĺä˝ăŽ time.Duration ăŻăäťăŽăăă°ăŠăăłă°č¨čŞă§ä¸čŹçăŤčŚăăă 1 ăăŞç§ă§ăŻăŞăă1 ăăç§ă襨ăăžăăăăŽçľćătime.Duration API ă使ç¨ăă䝣ăăăŤć°ĺ¤ĺă渥ăă¨ăäşćłĺ¤ăŽĺä˝ăçşçăăĺŻč˝ć§ăăăăžăă
\näťč¨čŞă使ç¨ăăăă¨ăŽăăéçşč
ăŽćšăŻă揥ăŽăłăźăăŤăăŁăŚ 1 ç§ĺ¨ćăŽć°ăă time.Ticker ăçćăăăă¨čăăăăăăăžăăă
\nticker := time . NewTicker ( 1000 ) \nfor { \n select { \n case <- ticker . C : \n // ĺŚçăăă \n } \n} \năăăăŞăăă1,000 time.Duration = 1,000 ăăç§ă§ăăăăăćłĺŽăăăŚăă 1ç§ ă§ăŻăŞăă1,000 ăăç§ = 1 ăă¤ăŻăç§ăŽĺ¨ćăŤăŞăăžăă
\n桡䚹ăäşćłĺ¤ăŽĺä˝ăćăăŞăăăăăă¤ă time.Duration API ă使ç¨ăăăšăă§ăă
\nticker = time . NewTicker ( time . Microsecond ) \n// ăăă㯠\nticker = time . NewTicker ( 1000 * time . Nanosecond ) \nă˝ăźăšăłăźă
\ntime.After ă¨ăĄă˘ăŞăŞăźăŻ (#76)\nčŚç´ \nçš°ăčżăăăé˘ć°ďźăŤăźăă HTTP ăăłăăŠăŞăŠďźă§ time.After ăŽĺźăłĺşăăĺéżăăă¨ăăăźăŻćăŽăĄă˘ăŞćśč˛ťăĺéżă§ăăžăătime.After ăŤăăŁăŚçćăăăăŞă˝ăźăšăŻă timer ăçľäşăăă¨ăăŤăŽăżč§Łćžăăăžăă
\n \nă˝ăźăšăłăźă
\nJSON ĺŚçă§ăăăăĄăŞééă (#77) \n\nĺăŽĺăčžźăżăŤăăäşćłĺ¤ăŽĺä˝ \n \nGo ć§é ä˝ă§ĺăčžźăżăăŁăźăŤăă使ç¨ăăĺ ´ĺăŻćł¨ćăăŚăă ăăă ăŞăăŞă json.Marshaler ă¤ăłăżăă§ăźăšăĺŽčŁ
ăă time.Time ĺăčžźăżăăŁăźăŤăăŽăăăŞăăŁăăăŞăă°ăçşçăăŚăăăăŠăŤăăŽăăźăˇăŁăŞăłă°ĺä˝ăăŞăźăăźăŠă¤ăăăăĺŻč˝ć§ăăăăăă§ăă
\nă˝ăźăšăłăźă
\n\nJSON 㨠monotonic clock \n \n2 ă¤ăŽ time.Time ć§é ä˝ăćŻčźăăĺ ´ĺătime.Time ăŤăŻ wall clock 㨠monotonic clock ăŽä¸ĄćšăĺŤăžăăŚăăă== ćźçŽĺă使ç¨ăăćŻčźăŻä¸ĄćšăŽ clock ăŤĺŻžăăŚčĄăăăăă¨ăćăĺşăăŚăă ăăă
\nă˝ăźăšăłăźă
\n\nJSON ăăźăżăŽă˘ăłăăźăˇăŁăŞăłă°ä¸ăŤăăăăćäžăăă¨ăăŤééăăéżăăăăăŤăć°ĺ¤ăŻăăăŠăŤă㧠float64 ăŤĺ¤ćăăăăă¨ăŤćł¨ćăăŚăă ăăă
\nă˝ăźăšăłăźă
\nSQL ă§ăăăăĄăŞééă (#78) \n\nsql.Open ăĺż
ăăăăăźăżăăźăšă¸ăŽćĽçśă確çŤăăăăă§ăŻăŞăăă¨ăĺżăăŚăă \nč¨ĺŽă芌ăăăăźăżăăźăšăŤă˘ăŻăťăšă§ăăăă¨ă確čŞăăĺż
čŚăăăĺ ´ĺăŻă Ping ăžă㯠PingContext ăĄă˝ăăăĺźăłĺşăăžăăăă
\nă˝ăźăšăłăźă
\n\năłăăŻăˇă§ăłăăźăŞăłă°ăŽăă¨ăĺżăă \n \nĺŽéç¨ć°´ćşăŽă˘ăăŞăąăźăˇă§ăłă§ăŻăăăźăżăăźăšćĽçśăăŠăĄăźăżăč¨ĺŽăăžăăăă
\n\năăŞăă˘ăăšăăźăăĄăłăă使ç¨ăăŚăăŞă \n \nSQL ăŽăăŞăă˘ăăšăăźăăĄăłăă使ç¨ăăă¨ăăŻă¨ăŞăăăĺšççăă¤ç˘şĺŽăŤăŞăăžăă
\nă˝ăźăšăłăźă
\n\nnull ĺ¤ă誤ăŁăćšćłă§ĺŚçăăŚăă \n \năăźăăŤĺ
㎠null ă訹厚ăăăŚăăĺăŻăăă¤ăłăżăžă㯠sql.NullXXX ĺă使ç¨ăăŚĺŚçăăžăăăă
\nă˝ăźăšăłăźă
\n\nčĄăŽĺ垊ĺŚçăŤăăă¨ăŠăźăĺŚçăăŞă \n \nčĄăŽĺ垊ĺŚçăŽĺžăŤ sql.Rows ㎠Err ăĄă˝ăăăĺźăłĺşăăŚă揥ăŽčĄăŽćşĺä¸ăŤă¨ăŠăźăčŚéăăŚăăŞăăă¨ă確čŞăăžăăăă
\nă˝ăźăšăłăźă
\nä¸ćçăŞăŞă˝ăźăšďź HTTP bodyăsql.Rowsăăăăł os.File ďźăéăăŚăăŞă (#79) \n\nčŚç´ \năŞăźăŻăéżăăăăăŤă io.Closer ăĺŽčŁ
ăăŚăăăăšăŚăŽć§é ä˝ăćĺžăŤăŻéăăžăăăă
\n \nă˝ăźăšăłăźă
\nHTTP ăŞăŻă¨ăšăăŤĺżçăăĺžăŽ return ćăĺżăăŚăăžă (#80) \n\nčŚç´ \nHTTP ăăłăăŠăŽĺŽčŁ
ă§ăŽäşćłĺ¤ăŽĺä˝ăéżăăăăăhttp.Error ăŽĺžăŤăăłăăŠăĺć˘ăăăĺ ´ĺăŻăreturn ćăĺżăăŞăăăăŤăăŚăă ăăă
\n \nă˝ăźăšăłăźă
\nć¨ćşăŽ HTTP ăŻăŠă¤ă˘ăłăă¨ăľăźăăźă使ç¨ăăŚăă (#81) \n\nčŚç´ \nĺŽéç¨ć°´ćşăŽă˘ăăŞăąăźăˇă§ăłăćąăăŚăăĺ ´ĺăŻăć¨ćşăŽ HTTP ăŻăŠă¤ă˘ăłăă¨ăľăźăăźăŽĺŽčŁ
ă使ç¨ăăŞăă§ăă ăăăăăăăŽĺŽčŁ
ăŤăŻăăżă¤ă ă˘ăŚăă稟ĺç°ĺ˘ă§ĺż
é ă§ăăăšăĺä˝ăćŹ č˝ăăŚăăžăă
\n \nă˝ăźăšăłăźă
\năăšă \năăšăăĺéĄăăŚăăŞăďźăăŤăăżă°ăç°ĺ˘ĺ¤ć°ăăˇă§ăźăă˘ăźăďź (#82) \n\nčŚç´ \năăŤăăăŠă°ăç°ĺ˘ĺ¤ć°ăăžăăŻăˇă§ăźăă˘ăźăă使ç¨ăăŚăăšăăĺéĄăăă¨ăăăšăăăăťăšăăăĺšççăŤăŞăăžăăăăŤăăăŠă°ăžăăŻç°ĺ˘ĺ¤ć°ă使ç¨ăăŚăăšăăŤăă´ăŞďźăă¨ăă°ăĺä˝ăăšăă¨çľąĺăăšăďźăä˝ćăăçćéăŽăăšăă¨éˇćéăŽăăšăăĺşĺĽăăăă¨ă§ăĺŽčĄăăăăšăăŽç¨ŽéĄăćąşĺŽă§ăăžăă
\n \nă˝ăźăšăłăźă
\n-race ăăŠă°ăćĺšăŤăăŚăăŞă (#83)\nčŚç´ \n丌čĄă˘ăăŞăąăźăˇă§ăłăä˝ćăăĺ ´ĺăŻă -race ăăŠă°ăćĺšăŤăăăă¨ă埡ăăĺ§ăăăžăăăăăăăă¨ă§ăă˝ăăăŚă§ă˘ăŽăă°ăŤă¤ăŞăăĺŻč˝ć§ăŽăăć˝ĺ¨çăŞăăźăżçŤśĺăçşčŚă§ăăăăăŤăŞăăžăă
\n \năăšăĺŽčĄă˘ăźăďź -parallel ăăăł -shuffle ďźă使ç¨ăăŚăăŞă (#84) \n\nčŚç´ \n-parallel ăăŠă°ă使ç¨ăăăŽăŻăçšăŤéˇćéĺŽčĄăăăăăšăăéŤéĺăăăŽăŤĺšćçă§ăă -shuffle ăăŠă°ă使ç¨ăăă¨ăăăšăăšă¤ăźăăăă°ăé ăĺŻč˝ć§ăŽăăééăŁă䝎ĺŽăŤäžĺăăŞăăăăŤăăăă¨ăă§ăăžăă
\n \năăźăăŤé§ĺăăšăă使ç¨ăăŞă (#85) \n\nčŚç´ \năăźăăŤé§ĺăăšăăŻăăłăźăăŽéč¤ăé˛ăăĺ°ćĽăŽć´ć°ăŽĺŚçă厚ćăŤăăăăăŤăä¸éŁăŽéĄäźźăăăăšăăă°ăŤăźăĺăăĺšççăŞćšćłă§ăă
\n \nă˝ăźăšăłăźă
\nĺä˝ăăšăă§ăŽăšăŞăźă (#86) \n\nčŚç´ \năăšăăŽä¸ĺŽĺŽăăăŞăăăăăĺ
ç˘ăŤăăăăăŤăĺćă使ç¨ăăŚăšăŞăźăăĺéżăăžăăăăĺćăä¸ĺŻč˝ăŞĺ ´ĺăŻăăŞăăŠă¤ććłăć¤č¨ăăŚăă ăăă
\n \nă˝ăźăšăłăźă
\ntime API ăĺšççăŤĺŚçă§ăăŚăăŞă (#87) \n\nčŚç´ \ntime API ă使ç¨ăăŚé˘ć°ăĺŚçăăćšćłăç解ăăăă¨ă§ăăăšăăŽä¸ĺŽĺŽăăčť˝ć¸ăăăă¨ăă§ăăžăăé ăăäžĺé˘äżăŽä¸é¨ă¨ă㌠time ăĺŚçăăăăăŻăŠă¤ă˘ăłă㍠time ăćäžăăăăăŤčŚćąăăăăăăŞăŠăć¨ćşçăŞć掾ăĺŠç¨ă§ăăžăă
\n \nă˝ăźăšăłăźă
\năăšăăŤé˘ăăăŚăźăăŁăŞăăŁăăăąăźă¸ďź httptest ăăăł iotest ďźă使ç¨ăăŚăăŞă (#88) \n\nhttptest ăăăąăźă¸ăŻăHTTP ă˘ăăŞăąăźăˇă§ăłăćąăăŽăŤĺ˝šçŤăĄăžăăăŻăŠă¤ă˘ăłăă¨ăľăźăăźăŽä¸ĄćšăăăšăăăăăăŽä¸éŁăŽăŚăźăăŁăŞăăŁăćäžăăžăă \nă˝ăźăšăłăźă
\n\niotest ăăăąăźă¸ăŻăio.Reader ăä˝ćăăă˘ăăŞăąăźăˇă§ăłăŽă¨ăŠăźčć§ăăăšăăăăŽăŤĺ˝šçŤăĄăžăă \nă˝ăźăšăłăźă
\nä¸ćŁç˘şăŞăăłăăăźăŻăŽä˝ć (#89) \n\nčŚç´ \năăłăăăźăŻăŤă¤ăăŚ
\n\năăłăăăźăŻăŽç˛žĺşŚăçśćăăăŤăŻătime ăĄă˝ăăă使ç¨ăăžăăăă \năăłăăżă¤ă ăĺ˘ăăăăbenchstat ăŞăŠăŽăăźăŤă使ç¨ăăăă¨ă§ăăă¤ăŻăăăłăăăźăŻăćąăăăăăŞăăžăă \nă˘ăăŞăąăźăˇă§ăłăćçľçăŤĺŽčĄăăăˇăšăă ăăă¤ăŻăăăłăăăźăŻăĺŽčĄăăăˇăšăă ă¨ç°ăŞăĺ ´ĺăŻăăă¤ăŻăăăłăăăźăŻăŽçľćăŤćł¨ćăăŚăă ăăă \năłăłăă¤ăŠăŽćéŠĺăŤăăŁăŚăăłăăăźăŻăŽçľćă誤éĺăăăŞăăăăăăšă寞蹥ăŽé˘ć°ăĺŻä˝ç¨ăĺźă辡ăăăăăŤăăŚăă ăăă \năŞăăśăźăăźĺšćăé˛ăăŤăŻăCPU ăŤäžĺăăé˘ć°ă使ç¨ăăăăźăżăăăłăăăźăŻăĺçćăăăă埡ĺśăăŚăă ăăă \n \n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nă˝ăźăšăłăźă
\nGoč¨čŞăŽăăšăćŠč˝ăăăšăŚčŠŚăăŚăăŞă (#90) \n\năłăźăăŤăăŹă㸠\n \năłăźăăŽăŠăŽé¨ĺăŤćł¨ćăĺż
čŚăăăăăŤç˘şčŞăăăăăŤă-coverprofile ăăŠă°ăćĺŽăăŚăłăźăăŤăăŹăă¸ă使ç¨ăăžăăăă
\n\nĺĽăŽăăăąăźă¸ăăăŽăăšă \n \nĺ
é¨ă§ăŻăŞăĺ
Źéăăăĺä˝ăŤçŚçšăĺ˝ăŚăăăšăăŽä˝ćă埡ĺśăăăăăŤăĺä˝ăăšăăŻĺĽă
ăŽăăăąăźă¸ăŤé
罎ăăžăăăă
\nă˝ăźăšăłăźă
\n\năŚăźăăŁăŞăăŁé˘ć° \n \nĺžćĽăŽ if err != nil ăŽäťŁăă㍠*testing.T ĺ¤ć°ă使ç¨ăăŚă¨ăŠăźăĺŚçăăă¨ăăłăźăăçăăčŞăżăăăăŞăăžăă
\nă˝ăźăšăłăźă
\n\nsetup ăăăł teardown ćŠč˝ăĺŠç¨ăăŚăçľąĺăăšăăŽĺ ´ĺăŞăŠăč¤éăŞç°ĺ˘ăć§ćă§ăăžăă
\nă˝ăźăšăłăźă
\n\n\nčŚç´ \năăĄă¸ăłă°ăŻăč¤éăŞé˘ć°ăăĄă˝ăăă¸ăŽăŠăłăă ăŞăäşćłĺ¤ăŽăăžăăŻä¸ćŁăŞĺ
Ľĺăć¤ĺşăăčĺźąć§ăăă°ăăăăŤăŻć˝ĺ¨çăŞăŻăŠăăˇăĽăçşčŚăăăŽăŤĺšççă§ăă
\n \n@jeromedoucet ăăăŽăĺĺăŤćčŹăăăăžăă
\nćéŠĺ \nCPU ăăŁăăˇăĽăç解ăăŚăăŞă (#91) \n\nCPU ă˘ăźăăăŻă㣠\n \nL1 ăăŁăăˇăĽăŻăĄă¤ăłăĄă˘ăŞăăăç´ 50 ď˝ 100 ĺéŤéă§ăăăăăCPU ăăŚăłăăŽă˘ăăŞăąăźăˇă§ăłăćéŠĺăăăŤăŻăCPU ăăŁăăˇăĽăŽä˝żç¨ćšćłăç解ăăăă¨ăéčŚă§ăă
\n\năăŁăăˇăĽăŠă¤ăł \n \năăŁăăˇăĽăŠă¤ăłăŽćŚĺżľăćčăăăă¨ăŻăăăźăżéç´ĺă˘ăăŞăąăźăˇă§ăłă§ăăźăżăć´çăăćšćłăç解ăăăŽăŤéčŚă§ăăCPU ăŻăĄă˘ăŞăăŻăźăăă¨ăŤăă§ăăăăžăăă䝣ăăăŤăé常ăŻăĄă˘ăŞăăăăŻă 64 ăă¤ăăŽăăŁăăˇăĽăŠă¤ăłăŤăłăăźăăžăăĺă
ăŽăăŁăăˇăĽăŠă¤ăłăć大éăŤć´ťç¨ăăăŤăŻă犺éçĺąćć§ă埡ĺśăăŚăă ăăă
\nă˝ăźăšăłăźă
\n\nć§é ä˝ăŽăšăŠă¤ăšă¨ăšăŠă¤ăšăŽć§é ä˝ \n \n\n\nă˝ăźăšăłăźă
\n\nCPU ăŤă¨ăŁăŚäşć¸ŹĺŻč˝ăŞăłăźăăŤăăăă¨ăŻăçšĺŽăŽé˘ć°ăćéŠĺăăĺšççăŞćšćłă§ăăăăžăăăă¨ăă°ăăŚăăăăžăăŻĺŽć°ăšăăŠă¤ă㯠CPU ăŤă¨ăŁăŚäşć¸ŹĺŻč˝ă§ăăăéăŚăăăăšăăŠă¤ăďźéŁçľăŞăšăăŞăŠďźăŻäşć¸Źă§ăăžăăă
\nă˝ăźăšăłăźă
\n\năăŁăăˇăĽé
罎ăăŞăˇăź \n \năăŁăăˇăĽăăăźăăŁăˇă§ăłĺăăăŚăăăă¨ăčŞčăăăă¨ă§ăé大ăŞăšăăŠă¤ăăĺéżăăăăŁăăˇăĽăŽăăä¸é¨ăŽăżă使ç¨ăăăăăŤăăăă¨ăă§ăăžăă
\n誤ăŁăĺ
ąćăĺźă辡ăă丌čĄĺŚç(#92) \n\nčŚç´ \nä¸ä˝ăŹăăŤăŽ CPU ăăŁăăˇăĽăăăšăŚăŽăłă˘ă§ĺ
ąćăăăăăă§ăŻăŞăăă¨ăçĽăŁăŚăăă¨ă丌čĄĺŚçăŤăăăăŽčޤăŁăĺ
ąćăŞăŠă§ăăăŠăźăăłăšăä˝ä¸ăăăŚăăžăăă¨ăĺéżă§ăăžăăăĄă˘ăŞăŽĺ
ąćăŻăăăăŞăăŽă§ăă
\n \nă˝ăźăšăłăźă
\nĺ˝äť¤ăŹăăŤăŽä¸Śĺć§ăčć
ŽăăŞă (#93) \n\nčŚç´ \nĺ˝äť¤ăŹăăŤăŽä¸Śĺć§ďźILP ďźă使ç¨ăăŚăłăźăăŽçšĺŽăŽé¨ĺăćéŠĺăăCPU ăă§ăăă ăĺ¤ăăŽĺ˝äť¤ă丌ĺĺŽčĄă§ăăăăăŤăăžăăăă丝ăŞćé ㎠1 ă¤ăŤăăźăżăăśăźăăŽçšĺŽăăăăžăă
\n \nă˝ăźăšăłăźă
\năăźăżăŽé
罎ăćčăăŚăăŞă (#94) \n\nčŚç´ \nGoč¨čŞă§ăŻăĺşćŹĺăŻĺă
ăŽăľă¤ăşăŤĺăăăŚé
罎ăăăăă¨ăčŚăăŚăăăă¨ă§ăăăăăĄăŞééăăéżăăăă¨ăă§ăăžăăăă¨ăă°ăć§é ä˝ăŽăăŁăźăŤăăăľă¤ăşă§éé ăŤĺ硨ćăăă¨ăć§é ä˝ăăăăłăłăăŻăăŤăŞăďźăĄă˘ăŞĺ˛ăĺ˝ăŚăĺ°ăŞăăŞăă犺éçĺąćć§ăĺä¸ăăďźĺŻč˝ć§ăăăăă¨ăŤçćăăŚăă ăăă
\n \nă˝ăźăšăłăźă
\năăźăă¨ăšăżăăŻăŽéăăç解ăăŚăăŞă (#95) \n\nčŚç´ \năăźăă¨ăšăżăăŻăŽĺşćŹçăŞéăăç解ăăăă¨ăăGo ă˘ăăŞăąăźăˇă§ăłăćéŠĺăăéăŤăŻĺ¤§ĺă§ăăăšăżăăŻĺ˛ăĺ˝ăŚăŻĺŽšćăŞăŽăŤĺŻžăăŚăăăźăĺ˛ăĺ˝ăŚăŻé
ăăăĄă˘ăŞăŽăŻăŞăźăłă˘ăă㍠GC ăĺŠç¨ăăžăă
\n \nă˝ăźăšăłăźă
\nĺ˛ăĺ˝ăŚăć¸ăăćšćłăăăăŁăŚăăŞăďź API ăŽĺ¤ć´ăăłăłăă¤ăŠăŽćéŠĺăăăăł sync.Poolďź (#96) \n\nčŚç´ \nĺ˛ăĺ˝ăŚăć¸ăăăă¨ăăGo ă˘ăăŞăąăźăˇă§ăłăćéŠĺăăä¸ă§éčŚă§ăăăăăŻăĺ
ąćăé˛ăăă㍠API ăć
éăŤč¨č¨ăăăä¸čŹç㪠Go ăłăłăă¤ăŠăŽćéŠĺăç解ăăăsync.Pool ă使ç¨ăăăŞăŠăăăžăăžăŞćšćłă§čĄăăă¨ăă§ăăžăă
\n \nă˝ăźăšăłăźă
\nă¤ăłăŠă¤ăłĺąéăăăŚăăŞă (#97) \n\nčŚç´ \năăĄăšăăăšăŽă¤ăłăŠă¤ăłĺććłă使ç¨ăăŚăé˘ć°ăŽĺźăłĺşăăŤăăăĺĺ´ćéăĺšççăŤĺć¸ăăžăăăă
\n \nGoč¨čŞăŽč¨şćăăźăŤăĺŠç¨ăăŚăăŞă (#98) \n\nčŚç´ \năăăăĄă¤ăŞăłă°ă¨ĺŽčĄăăŹăźăľăĺŠç¨ăăŚăă˘ăăŞăąăźăˇă§ăłăŽăăăŠăźăăłăšă¨ćéŠĺăăšăé¨ĺăŤă¤ăăŚç解ăăžăăăă
\n \năťăŻăˇă§ăłĺ
¨ćăŻăăĄă ă
\nGC ăŽäťçľăżăç解ăăŚăăŞă (#99)\nčŚç´ \nGC ăŽčŞżć´ćšćłăç解ăăă¨ăçŞçśăŽč˛ čˇăŽĺ˘ĺ ăăăĺšççăŤĺŚçă§ăăăŞăŠăăăžăăžăŞćŠćľăĺžăăăžăă
\n \nDocker 㨠Kubernetes ä¸ă§Goč¨čŞăĺŽčĄăăăă¨ăŽĺ˝ąéżăç解ăăŚăăŞă (#100) \n\nčŚç´ \nDocker 㨠Kubernetes ăŤăăăă¤ăăé㎠CPU ăšăăăăŞăłă°ăĺéżăăăŤăŻăGoč¨čŞă CFS 寞ĺżă§ăŻăŞăăă¨ăŤçćăăŚăă ăăă
\n \n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n\n\n\n\n\n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
Brazilian Portuguese Version - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n\n\n \n \n\n\nErros comuns de Go \n\nThe Coder Cafe \nSe vocĂŞ gostou do meu livro, talvez se interesse pelo meu novo projeto: The Coder Cafe , uma newsletter diĂĄria para programadores.
\n\nFeeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
\n \n
\n \nEsta pĂĄgina ĂŠ um resumo dos erros do 100 Go Mistakes and How to Avoid Them book . Enquanto isso, tambĂŠm estĂĄ aberto Ă comunidade. Se vocĂŞ acredita que um erro comum do Go deve ser adicionado, crie uma issue .
\n
\n\nBeta \nVocĂŞ estĂĄ visualizando uma versĂŁo beta enriquecida com muito mais conteĂşdo. No entanto, esta versĂŁo ainda nĂŁo estĂĄ completa e estou procurando voluntĂĄrios para me ajudar a resumir os erros restantes (GitHub issue #43 ).
\nProgresso:\n
\n \nCĂłdigo e Organização do Projeto \nSombreamento nĂŁo intencional de variĂĄvel (#1) \n\nTL;DR \nEvitar variĂĄveis ââsombreadas pode ajudar a evitar erros, como fazer referĂŞncia Ă variĂĄvel errada ou confundir os desenvolvedores.
\n \nO sombreamento de variĂĄvel ocorre quando um nome de variĂĄvel ĂŠ redeclarado em um bloco interno, mas essa prĂĄtica estĂĄ sujeita a erros. A imposição de uma regra para proibir variĂĄveis ââobscuras depende do gosto pessoal. Por exemplo, Ă s vezes pode ser conveniente reutilizar um nome de variĂĄvel existente, como err no caso de erros. PorĂŠm, em geral, devemos ser cautelosos porque agora sabemos que podemos enfrentar um cenĂĄrio onde o cĂłdigo compila, mas a variĂĄvel que recebe o valor nĂŁo ĂŠ a esperada.
\n
\nCĂłdigo aninhado desnecessĂĄrio (#2) \n\nTL;DR \nEvitar nĂveis aninhados e manter o caminho feliz alinhado Ă esquerda facilita a construção de um modelo de cĂłdigo mental.
\n \nEm geral, quanto mais nĂveis aninhados uma função exigir, mais complexa serĂĄ sua leitura e compreensĂŁo. Vamos ver algumas aplicaçþes diferentes desta regra para otimizar a legibilidade do nosso cĂłdigo:
\n\nQuando um bloco if retorna, devemos omitir o else em todos os casos. Por exemplo, nĂŁo deverĂamos escrever: \n \nif foo () { \n // ... \n return true \n} else { \n // ... \n} \nEm vez disso, omitimos o bloco else assim:
\nif foo () { \n // ... \n return true \n} \n// ... \n\nTambÊm podemos seguir esta lógica com um caminho não feliz: \n \nif s != \"\" { \n // ... \n} else { \n return errors . New ( \"empty string\" ) \n} \nAqui, um s vazio representa o caminho não feliz. Portanto, devemos inverter a condição assim:
\nif s == \"\" { \n return errors . New ( \"empty string\" ) \n} \n// ... \nEscrever cĂłdigo legĂvel ĂŠ um desafio importante para todo desenvolvedor. Esforçar-se para reduzir o nĂşmero de blocos aninhados, alinhar o caminho feliz Ă esquerda e retornar o mais cedo possĂvel sĂŁo meios concretos para melhorar a legibilidade do nosso cĂłdigo.
\n
\nUso indevido de funçþes init (#3) \n\nTL;DR \nAo inicializar variĂĄveis, lembre-se de que as funçþes init tĂŞm tratamento de erros limitado e tornam o tratamento de estado e os testes mais complexos. Na maioria dos casos, as inicializaçþes devem ser tratadas como funçþes especĂficas.
\n \nUma função init ĂŠ uma função usada para inicializar o estado de um aplicativo. NĂŁo aceita argumentos e nĂŁo retorna nenhum resultado (uma função func()). Quando um pacote ĂŠ inicializado, todas as declaraçþes de constantes e variĂĄveis ââdo pacote sĂŁo avaliadas. EntĂŁo, as funçþes init sĂŁo executadas.
\nAs funçþes de inicialização podem levar a alguns problemas:
\n\nElas podem limitar o gerenciamento de erros. \nElas podem complicar a implementação de testes (por exemplo, uma dependĂŞncia externa deve ser configurada, o que pode nĂŁo ser necessĂĄrio para o escopo dos testes unitĂĄrios). \nSe a inicialização exigir que definamos um estado, isso deverĂĄ ser feito por meio de variĂĄveis ââglobais. \n \nDevemos ser cautelosos com as funçþes init. No entanto, elas podem ser Ăşteis em algumas situaçþes, como na definição de configuração estĂĄtica. Caso contrĂĄrio, e na maioria dos casos, devemos tratar as inicializaçþes atravĂŠs de funçþes ad hoc.
\n
\nUso excessivo de getters e setters (#4) \n\nTL;DR \nForcing the use of getters and setters isnât idiomatic in Go. Being pragmatic and finding the right balance between efficiency and blindly following certain idioms should be the way to go.
\n \nO encapsulamento de dados refere-se a ocultar os valores ou o estado de um objeto. Getters e setters sĂŁo meios de habilitar o encapsulamento, fornecendo mĂŠtodos exportados sobre campos de objetos nĂŁo exportados.
\nNo Go, nĂŁo hĂĄ suporte automĂĄtico para getters e setters como vemos em algumas linguagens. TambĂŠm nĂŁo ĂŠ considerado obrigatĂłrio nem idiomĂĄtico o uso de getters e setters para acessar campos struct. NĂŁo devemos sobrecarregar nosso cĂłdigo com getters e setters em structs se eles nĂŁo trouxerem nenhum valor. DeverĂamos ser pragmĂĄticos e nos esforçar para encontrar o equilĂbrio certo entre eficiĂŞncia e seguir expressĂľes que Ă s vezes sĂŁo consideradas indiscutĂveis em outros paradigmas de programação.
\nLembre-se de que Go ĂŠ uma linguagem Ăşnica projetada para muitas caracterĂsticas, incluindo simplicidade. No entanto, se encontrarmos necessidade de getters e setters ou, como mencionado, prevermos uma necessidade futura e ao mesmo tempo garantirmos a compatibilidade futura, nĂŁo hĂĄ nada de errado em usĂĄ-los.
\nInterface poluidas (#5) \n\nTL;DR \nAbstraçþes devem ser descobertas, não criadas. Para evitar complexidade desnecessåria, crie uma interface quando precisar dela e não quando você prevêr que serå necessåria, ou se puder pelo menos provar que a abstração Ê vålida.
\n \nLeia a seção completa aqui .
\n
\nInterface do lado do producer (#6) \n\nTL;DR \nManter interfaces no lado do cliente evita abstraçþes desnecessårias.
\n \nAs interfaces sĂŁo satisfeitas implicitamente em Go, o que tende a ser um divisor de ĂĄguas em comparação com linguagens com implementação explĂcita. Na maioria dos casos, a abordagem a seguir ĂŠ semelhante Ă que descrevemos na seção anterior: as abstraçþes devem ser descobertas, nĂŁo criadas . Isso significa que nĂŁo cabe ao producer forçar uma determinada abstração para todos os clientes. Em vez disso, cabe ao cliente decidir se precisa de alguma forma de abstração e entĂŁo determinar o melhor nĂvel de abstração para suas necessidades.
\nUma interface deve residir no lado do consumidor na maioria dos casos. Contudo, em contextos especĂficos (por exemplo, quando sabemos â e nĂŁo prevemos â que uma abstração serĂĄ Ăştil para os consumidores), podemos querer tĂŞ-la do lado do procuder. Se o fizermos, devemos nos esforçar para mantĂŞ-lo o mĂnimo possĂvel, aumentando o seu potencial de reutilização e tornando-o mais facilmente combinĂĄvel.
\n
\nInterfaces de retorno (#7) \n\nTL;DR \nPara evitar restriçþes em termos de flexibilidade, uma função nĂŁo deve retornar interfaces, mas implementaçþes concretas na maioria dos casos. Por outro lado, uma função deve aceitar interfaces sempre que possĂvel.
\n \nNa maioria dos casos, nĂŁo devemos retornar interfaces, mas implementaçþes concretas. Caso contrĂĄrio, isso pode tornar nosso design mais complexo devido Ă s dependĂŞncias do pacote e pode restringir a flexibilidade porque todos os clientes teriam que contar com a mesma abstração. Novamente, a conclusĂŁo ĂŠ semelhante Ă s seçþes anteriores: se sabemos (nĂŁo prevemos) que uma abstração serĂĄ Ăştil para os clientes, podemos considerar o retorno de uma interface. Caso contrĂĄrio, nĂŁo deverĂamos forçar abstraçþes; eles devem ser descobertas pelos clientes. Se um cliente precisar abstrair uma implementação por qualquer motivo, ele ainda poderĂĄ fazer isso do lado do cliente.
\nany nĂŁo diz nada (#8)\nTL;DR \nUse apenas any se precisar aceitar ou retornar qualquer tipo possĂvel, como json.Marshal. Caso contrĂĄrio, any nĂŁo fornece informaçþes significativas e pode levar a problemas de tempo de compilação, permitindo que um chamador chame mĂŠtodos com qualquer tipo de dados.
\n \nO tipo any pode ser Ăştil se houver uma necessidade genuĂna de aceitar ou retornar qualquer tipo possĂvel (por exemplo, quando se trata de empacotamento ou formatação). Em geral, devemos evitar a todo custo generalizar demais o cĂłdigo que escrevemos. Talvez um pouco de cĂłdigo duplicado possa ocasionalmente ser melhor se melhorar outros aspectos, como a expressividade do cĂłdigo.
\n
\nFicar confuso sobre quando usar genÊricos (#9) \n\nTL;DR \nDepender de parâmetros genÊricos e de tipo pode impedir a gravação de código clichê (boilerplate) para fatorar elementos ou comportamentos. No entanto, não use parâmetros de tipo prematuramente, mas somente quando você perceber uma necessidade concreta deles. Caso contrårio, introduzem abstraçþes e complexidade desnecessårias.
\n \nLeia a seção completa aqui .
\n
\n\n\nTL;DR \nUsar a incorporação de tipo (type embedding) tambÊm pode ajudar a evitar código clichê (boilerplate); no entanto, certifique-se de que isso não leve a problemas de visibilidade onde alguns campos deveriam ter permanecido ocultos.
\n \nAo criar uma struct, Go oferece a opção de incorporar tipos. Mas isso Ă s vezes pode levar a comportamentos inesperados se nĂŁo compreendermos todas as implicaçþes da incorporação de tipos. Ao longo desta seção, veremos como incorporar tipos, o que eles trazem e os possĂveis problemas.
\nNo Go, um campo struct ĂŠ chamado de incorporado se for declarado sem nome. Por exemplo,
\ntype Foo struct { \n Bar // Embedded field \n} \ntype Bar struct { \n Baz int \n} \nNa estrutura Foo, o tipo Bar ĂŠ declarado sem nome associado; portanto, ĂŠ um campo incorporado.
\nUsamos incorporação para promover os campos e mĂŠtodos de um tipo incorporado. Como Bar contĂŠm um campo Baz, esse campo ĂŠ promovido para Foo. Portanto, Baz fica disponĂvel a partir de Foo.
\nO que podemos dizer sobre a incorporação de tipos? Primeiro, observemos que raramente Ê uma necessidade e significa que, qualquer que seja o caso de uso, provavelmente tambÊm poderemos resolvê-lo sem incorporação de tipo. A incorporação de tipos Ê usada principalmente por conveniência: na maioria dos casos, para promover comportamentos.
\nSe decidirmos usar incorporação de tipo, precisamos ter em mente duas restriçþes principais:
\n\nNão deve ser usado apenas como um açúcar sintåtico para simplificar o acesso a um campo (como Foo.Baz() em vez de Foo.Bar.Baz()). Se esta for a única justificativa, não vamos incorporar o tipo interno e usar um campo. \nNão deve promover dados (campos) ou um comportamento (mÊtodos) que queremos ocultar do exterior: por exemplo, se permitir que os clientes acessem um comportamento de bloqueio que deve permanecer privado da struct. \n \nUsar a incorporação de tipo de forma consciente, mantendo essas restriçþes em mente, pode ajudar a evitar código clichê (boilerplate) com mÊtodos de encaminhamento adicionais. No entanto, vamos garantir que não o fazemos apenas por motivos cosmÊticos e não promovemos elementos que deveriam permanecer ocultos.
\n
\nNão usar o padrão de opçþes funcionais (functional options pattern) (#11) \n\nTL;DR \nPara lidar com opçþes de maneira conveniente e amigåvel à API, use o padrão de opçþes funcionais.
\n \nEmbora existam diferentes implementaçþes com pequenas variaçþes, a ideia principal Ê a seguinte:
\n\nUma estrutura não exportada contÊm a configuração: opçþes. \nCada opção Ê uma função que retorna o mesmo tipo: type Option func(options *options) error. Por exemplo, WithPort aceita um argumento int que representa a porta e retorna um tipo Option que representa como atualizar a struct options. \n \n
\ntype options struct { \n port * int \n} \ntype Option func ( options * options ) error \nfunc WithPort ( port int ) Option { \n return func ( options * options ) error { \n if port < 0 { \n return errors . New ( \"port should be positive\" ) \n } \n options . port = & port \n return nil \n } \n} \nfunc NewServer ( addr string , opts ... Option ) ( * http . Server , error ) { \n var options options \n for _ , opt := range opts { \n err := opt ( & options ) \n if err != nil { \n return nil , err \n } \n } \n // At this stage, the options struct is built and contains the config \n // Therefore, we can implement our logic related to port configuration \n var port int \n if options . port == nil { \n port = defaultHTTPPort \n } else { \n if * options . port == 0 { \n port = randomPort () \n } else { \n port = * options . port \n } \n } \n // ... \n} \nO padrão de opçþes funcionais fornece uma maneira pråtica e amigåvel à API de lidar com opçþes. Embora o padrão do construtor possa ser uma opção vålida, ele tem algumas desvantagens menores (ter que passar uma estrutura de configuração que pode estar vazia ou uma maneira menos pråtica de lidar com o gerenciamento de erros) que tendem a tornar o padrão de opçþes funcionais a maneira idiomåtica de lidar com esse tipo de problema no Go.
\n
\nDesorganização do projeto (estrutura do projeto e organização do pacote) (#12) \nNo que diz respeito Ă organização geral, existem diferentes escolas de pensamento. Por exemplo, devemos organizar a nossa aplicação por contexto ou por camada? Depende de nossas preferĂŞncias. Podemos preferir agrupar o cĂłdigo por contexto (como o contexto do cliente, o contexto do contrato, etc.), ou podemos preferir seguir os princĂpios da arquitetura hexagonal e agrupar por camada tĂŠcnica. Se a decisĂŁo que tomarmos se adequar ao nosso caso de uso, nĂŁo pode ser uma decisĂŁo errada, desde que permaneçamos consistentes com ela.
\nEm relação aos pacotes, existem vĂĄrias prĂĄticas recomendadas que devemos seguir. Primeiro, devemos evitar pacotes prematuros porque podem complicar demais um projeto. Ăs vezes, ĂŠ melhor usar uma organização simples e fazer nosso projeto evoluir quando entendemos o que ele contĂŠm, em vez de nos forçarmos a fazer a estrutura perfeita desde o inĂcio. A granularidade ĂŠ outra coisa essencial a considerar. Devemos evitar dezenas de pacotes nano contendo apenas um ou dois arquivos. Se o fizermos, ĂŠ porque provavelmente perdemos algumas conexĂľes lĂłgicas entre esses pacotes, tornando nosso projeto mais difĂcil de ser compreendido pelos leitores. Por outro lado, tambĂŠm devemos evitar pacotes grandes que diluem o significado do nome de um pacote.
\nA nomenclatura dos pacotes tambĂŠm deve ser considerada com cuidado. Como todos sabemos (como desenvolvedores), nomear ĂŠ difĂcil. Para ajudar os clientes a entender um projeto Go, devemos nomear nossos pacotes de acordo com o que eles fornecem, nĂŁo com o que contĂŞm. AlĂŠm disso, a nomenclatura deve ser significativa. Portanto, o nome de um pacote deve ser curto, conciso, expressivo e, por convenção, uma Ăşnica palavra minĂşscula.
\nQuanto ao que exportar, a regra ĂŠ bastante simples. Devemos minimizar o que deve ser exportado tanto quanto possĂvel para reduzir o acoplamento entre pacotes e manter ocultos os elementos exportados desnecessĂĄrios. Se nĂŁo tivermos certeza se devemos ou nĂŁo exportar um elemento, devemos optar por nĂŁo exportĂĄ-lo. Mais tarde, se descobrirmos que precisamos exportĂĄ-lo, poderemos ajustar nosso cĂłdigo. Vamos tambĂŠm ter em mente algumas exceçþes, como fazer com que os campos sejam exportados para que uma estrutura possa ser desempacotada com encoding/json.
\nOrganizar um projeto nĂŁo ĂŠ simples, mas seguir essas regras deve ajudar a facilitar sua manutenção. No entanto, lembre-se de que a consistĂŞncia tambĂŠm ĂŠ vital para facilitar a manutenção. Portanto, vamos nos certificar de manter as coisas o mais consistentes possĂvel dentro de uma base de cĂłdigo.
\n\nNote \nEm 2023, a equipe Go publicou uma diretriz oficial para organizar/estruturar um projeto Go: go.dev/doc/modules/layout
\n \nCriando pacotes de utilitĂĄrios (#13) \n\nTL;DR \nA nomenclatura ĂŠ uma parte crĂtica do design do aplicativo. Criar pacotes como common, util e shared nĂŁo traz muito valor para o leitor. Refatore esses pacotes em nomes de pacotes significativos e especĂficos.
\n \nAlĂŠm disso, tenha em mente que nomear um pacote com base no que ele fornece e nĂŁo no que ele contĂŠm pode ser uma forma eficiente de aumentar sua expressividade.
\n
\nIgnorando colisĂľes de nomes de pacotes (#14) \n\nTL;DR \nPara evitar colisĂľes de nomes entre variĂĄveis ââe pacotes, levando a confusĂŁo ou talvez atĂŠ bugs, use nomes exclusivos para cada um. Se isso nĂŁo for viĂĄvel, use um alias de importação para alterar o qualificador para diferenciar o nome do pacote do nome da variĂĄvel ou pense em um nome melhor.
\n \nAs colisĂľes de pacotes ocorrem quando um nome de variĂĄvel colide com um nome de pacote existente, impedindo que o pacote seja reutilizado. Devemos evitar colisĂľes de nomes de variĂĄveis ââpara evitar ambiguidade. Se enfrentarmos uma colisĂŁo, devemos encontrar outro nome significativo ou usar um alias de importação.
\nDocumentação de código ausente (#15) \n\nTL;DR \nPara ajudar clientes e mantenedores a entender a finalidade do seu código, documente os elementos exportados.
\n \nA documentação Ê um aspecto importante da programação. Simplifica como os clientes podem consumir uma API, mas tambÊm pode ajudar na manutenção de um projeto. No Go, devemos seguir algumas regras para tornar nosso código idiomåtico:
\nPrimeiro, cada elemento exportado deve ser documentado. Seja uma estrutura, uma interface, uma função ou qualquer outra coisa, se for exportado deve ser documentado. A convenção Ê adicionar comentårios, começando com o nome do elemento exportado.
\nPor convenção, cada comentårio deve ser uma frase completa que termina com pontuação. Tenha tambÊm em mente que quando documentamos uma função (ou um mÊtodo), devemos destacar o que a função pretende fazer, não como o faz; isso pertence ao núcleo de uma função e comentårios, não à documentação. AlÊm disso, o ideal Ê que a documentação forneça informaçþes suficientes para que o consumidor não precise olhar nosso código para entender como usar um elemento exportado.
\nQuando se trata de documentar uma variĂĄvel ou constante, podemos estar interessados ââem transmitir dois aspectos: sua finalidade e seu conteĂşdo. O primeiro deve funcionar como documentação de cĂłdigo para ser Ăştil para clientes externos. Este Ăşltimo, porĂŠm, nĂŁo deveria ser necessariamente pĂşblico.
\nPara ajudar clientes e mantenedores a entender o escopo de um pacote, devemos tambÊm documentar cada pacote. A convenção Ê iniciar o comentårio com // Package seguido do nome do pacote. A primeira linha de um comentårio de pacote deve ser concisa. Isso porque ele aparecerå no pacote. Então, podemos fornecer todas as informaçþes que precisamos nas linhas seguintes.
\nDocumentar nosso código não deve ser uma restrição. Devemos aproveitar a oportunidade para garantir que isso ajude os clientes e mantenedores a entender o propósito do nosso código.
\nNĂŁo usando linters (#16) \n\nTL;DR \nPara melhorar a qualidade e consistĂŞncia do cĂłdigo, use linters e formatadores.
\n \nUm linter Ê uma ferramenta automåtica para analisar código e detectar erros. O escopo desta seção não Ê fornecer uma lista exaustiva dos linters existentes; caso contrårio, ele ficarå obsoleto rapidamente. Mas devemos entender e lembrar por que os linters são essenciais para a maioria dos projetos Go.
\nNo entanto, se vocĂŞ nĂŁo ĂŠ um usuĂĄrio regular de linters, aqui estĂĄ uma lista que vocĂŞ pode usar diariamente:
\n\nAlĂŠm dos linters, tambĂŠm devemos usar formatadores de cĂłdigo para corrigir o estilo do cĂłdigo. Aqui estĂĄ uma lista de alguns formatadores de cĂłdigo para vocĂŞ experimentar:
\n\nEnquanto isso, devemos tambĂŠm dar uma olhada em golangci-lint (https://github.com/golangci/golangci-lint ).\nĂ uma ferramenta de linting que fornece uma fachada sobre muitos linters e formatadores Ăşteis. AlĂŠm disso, permite executar os linters em paralelo para melhorar a velocidade de anĂĄlise, o que ĂŠ bastante Ăştil.
\nLinters e formatadores são uma forma poderosa de melhorar a qualidade e consistência de nossa base de código. Vamos dedicar um tempo para entender qual deles devemos usar e garantir que automatizamos sua execução (como um precommit hook de CI ou Git).
\nTipos de dados \n\n\nTL;DR \nAo ler o cĂłdigo existente, lembre-se de que literais inteiros começando com 0 sĂŁo nĂşmeros octais. AlĂŠm disso, para melhorar a legibilidade, torne os inteiros octais explĂcitos prefixando-os com 0o.
\n \nOs nĂşmeros octais começam com 0 (por exemplo, 010 ĂŠ igual a 8 na base 10). Para melhorar a legibilidade e evitar possĂveis erros para futuros leitores de cĂłdigo, devemos tornar os nĂşmeros octais explĂcitos usando o prefixo 0o (por exemplo, 0o10).
\nDevemos tambÊm observar as outras representaçþes literais inteiras:
\n\nBinĂĄrio âUsa um prefixo 0b ou 0B(por exemplo, 0b100 ĂŠ igual a 4 na base 10)Hexadecimal âUsa um prefixo 0x ou 0X (por exemplo, 0xF ĂŠ igual a 15 na base 10)ImaginĂĄrio âUsa um i sufixo (por exemplo, 3i) \nTambĂŠm podemos usar um caractere de sublinhado (_) como separador para facilitar a leitura. Por exemplo, podemos escrever 1 bilhĂŁo desta forma: 1_000_000_000. TambĂŠm podemos usar o caractere sublinhado com outras representaçþes (por exemplo, 0b00_00_01).
\n
\nNegligenciando estouros de número inteiro (#18) \n\nTL;DR \nComo os overflows e underflows de números inteiros são tratados silenciosamente no Go, você pode implementar suas próprias funçþes para capturå-los.
\n \nNo Go, um estouro de número inteiro que pode ser detectado em tempo de compilação gera um erro de compilação. Por exemplo,
\nvar counter int32 = math . MaxInt32 + 1 \n 2147483648 overflows int32\nNo entanto, em tempo de execução, um overflow ou underflow de inteiro Ê silencioso; isso não leva ao pânico do aplicativo. à essencial ter esse comportamento em mente, pois ele pode levar a bugs sorrateiros (por exemplo, um incremento de número inteiro ou adição de números inteiros positivos que leva a um resultado negativo).
\n
\nNão entendendo os pontos flutuantes (#19) \n\nTL;DR \nFazer comparaçþes de ponto flutuante dentro de um determinado delta pode garantir que seu código seja portåtil. Ao realizar adição ou subtração, agrupe as operaçþes com ordem de grandeza semelhante para favorecer a precisão. AlÊm disso, execute multiplicação e divisão antes da adição e subtração.
\n \nEm Go, existem dois tipos de ponto flutuante (se omitirmos os números imaginårios): float32 e float64. O conceito de ponto flutuante foi inventado para resolver o principal problema dos números inteiros: sua incapacidade de representar valores fracionårios. Para evitar surpresas desagradåveis, precisamos saber que a aritmÊtica de ponto flutuante Ê uma aproximação da aritmÊtica real.
\nPara isso, veremos um exemplo de multiplicação:
\nvar n float32 = 1.0001 \nfmt . Println ( n * n ) \nPodemos esperar que este cĂłdigo imprima o resultado de 1.0001 * 1.0001 = 1,00020001, certo? No entanto, executĂĄ-lo na maioria dos processadores x86 imprime 1.0002.
\nComo os tipos float32 e float64 em Go são aproximaçþes, temos que ter algumas regras em mente:
\n\nAo comparar dois números de ponto flutuante, verifique se a diferença estå dentro de um intervalo aceitåvel. \nAo realizar adiçþes ou subtraçþes, agrupe operaçþes com ordem de magnitude semelhante para melhor precisão. \nPara favorecer a precisão, se uma sequência de operaçþes exigir adição, subtração, multiplicação ou divisão, execute primeiro as operaçþes de multiplicação e divisão. \n \n
\nNĂŁo entendendo o comprimento e a capacidade de slice (#20) \n\nTL;DR \nCompreender a diferença entre comprimento e capacidade da slice deve fazer parte do conhecimento bĂĄsico de um desenvolvedor Go. O comprimento de slice ĂŠ o nĂşmero de elementos disponĂveis na slice, enquanto a capacidade de slice ĂŠ o nĂşmero de elementos na matriz de apoio.
\n \nLeia a seção completa aqui .
\n
\nInicialização de slice ineficiente (#21) \n\nTL;DR \nAo criar uma fatia, inicialize-a com um determinado comprimento ou capacidade se o seu comprimento jå for conhecido. Isso reduz o número de alocaçþes e melhora o desempenho.
\n \nAo inicializar uma fatia usando make, podemos fornecer um comprimento e uma capacidade opcional. Esquecer de passar um valor apropriado para ambos os parâmetros quando faz sentido Ê um erro generalizado. Na verdade, isso pode levar a múltiplas cópias e esforço adicional para o GC limpar as matrizes de apoio temporårias. Em termos de desempenho, não hå uma boa razão para não ajudar o tempo de execução do Go.
\nNossas opçþes são alocar uma fatia com determinada capacidade ou comprimento. Destas duas soluçþes, vimos que a segunda tende a ser um pouco mais råpida. Mas usar uma determinada capacidade e anexar pode ser mais fåcil de implementar e ler em alguns contextos.
\n
\nEstar confuso sobre slice nula vs. slice vazia (#22) \n\nTL;DR \nTo prevent common confusions such as when using the encoding/json or the reflect package, you need to understand the difference between nil and empty slices. Both are zero-length, zero-capacity slices, but only a nil slice doesnât require allocation.
\n \nNo Go, hå uma distinção entre slices nulas e vazias. Uma slice nula Ê igual a nil, enquanto uma slice vazia tem comprimento zero. Uma slice nula estå vazia, mas uma slice vazia não Ê necessariamente nil. Enquanto isso, uma slice nula não requer nenhuma alocação. Vimos ao longo desta seção como inicializar uma slice dependendo do contexto usando
\n\nvar s []string se não tivermos certeza sobre o comprimento final e a fatia pode estar vazia[]string(nil) como açúcar sintåtico para criar uma fatia nula e vaziamake([]string, length) se o comprimento futuro for conhecido \nA última opção, []string{} deve ser evitada se inicializarmos a fatia sem elementos. Finalmente, vamos verificar se as bibliotecas que usamos fazem distinçþes entre fatias nulas e vazias para evitar comportamentos inesperados.
\n
\nNĂŁo verificar corretamente se um slice estĂĄ vazio (#23) \n\nTL;DR \nPara verificar se uma fatia nĂŁo contĂŠm nenhum elemento, verifique seu comprimento. Esta verificação funciona independentemente de o slice estar nil ou vazio. O mesmo vale para maps. Para projetar APIs inequĂvocas, vocĂŞ nĂŁo deve distinguir entre slice nulos e vazios.
\n \nPara determinar se um slice possui elementos, podemos fazê-lo verificando se o slice Ê nulo ou se seu comprimento Ê igual a 0. Verificar o comprimento Ê a melhor opção a seguir, pois cobrirå ambos se o slice estiver vazio ou se o slice Ê nulo.
\nEnquanto isso, ao projetar interfaces, devemos evitar distinguir slices nulos e vazios, o que leva a erros sutis de programação. Ao retornar slices, nĂŁo deve haver diferença semântica nem tĂŠcnica se retornarmos um slice nulo ou vazio. Ambos devem significar a mesma coisa para quem liga. Este princĂpio ĂŠ o mesmo com maps. Para verificar se um map estĂĄ vazio, verifique seu comprimento, nĂŁo se ĂŠ nulo.
\n
\nNĂŁo fazer cĂłpias de slcies corretamente (#24) \n\nTL;DR \nPara copiar um slice para outro usando a função copy, lembre-se que o nĂşmero de elementos copiados corresponde ao mĂnimo entre os comprimentos dos dois slices.
\n \nCopiar elementos de um slice para outro ĂŠ uma operação razoavelmente frequente. Ao utilizar a cĂłpia, devemos lembrar que o nĂşmero de elementos copiados para o destino corresponde ao mĂnimo entre os comprimentos dos dois slices. Tenha tambĂŠm em mente que existem outras alternativas para copiar um slice, por isso nĂŁo devemos nos surpreender se as encontrarmos em uma base de cĂłdigo.
\n
\nEfeitos colaterais inesperados usando o slice append (#25) \n\nTL;DR \nUsar copy ou a expressão de slice completa Ê uma forma de evitar que append crie conflitos se duas funçþes diferentes usarem slices apoiados pela mesmo array. No entanto, apenas uma cópia de slice evita vazamentos de memória se você quiser reduzir um slice grande.
\n \nAo usar o slicing, devemos lembrar que podemos enfrentar uma situação que leva a efeitos colaterais nĂŁo intencionais. Se o slice resultante tiver um comprimento menor que sua capacidade, o acrĂŠscimo poderĂĄ alterar o slice original. Se quisermos restringir a gama de possĂveis efeitos colaterais, podemos usar uma cĂłpia de slice ou a expressĂŁo de slice completa, o que nos impede de fazer uma cĂłpia.
\n\nNote \ns[low:high:max](expressão de slice completo): Esta instrução cria um slice semelhante àquele criado com s[low:high], exceto que a capacidade de slice resultante Ê igual a max - low.
\n \n
\nSlices e vazamentos de memĂłria (#26) \n\nTL;DR \nTrabalhando com um slice de ponteiros ou estruturas com campos de ponteiro, vocĂŞ pode evitar vazamentos de memĂłria marcando como nulos os elementos excluĂdos por uma operação de fatiamento.
\n \nVazamento de capacidade \nLembre-se de que fatiar um slice ou array grande pode levar a um potencial alto consumo de memória. O espaço restante não serå recuperado pelo GC e podemos manter um grande array de apoio, apesar de usarmos apenas alguns elementos. Usar uma cópia em slice Ê a solução para evitar tal caso.
\n
\nSlice e ponteiros \nQuando usamos a operação de fatiamento com ponteiros ou estruturas com campos de ponteiro, precisamos saber que o GC não recuperarå esses elementos. Nesse caso, as duas opçþes são realizar uma cópia ou marcar explicitamente os elementos restantes ou seus campos como nil.
\n
\nInicialização ineficiente do mapa (#27) \n\nTL;DR \nAo criar um mapa, inicialize-o com um determinado comprimento se o seu comprimento jå for conhecido. Isso reduz o número de alocaçþes e melhora o desempenho.
\n \nUm mapa fornece uma coleção não ordenada de pares chave-valor em que todas as chaves são distintas. No Go, um mapa Ê baseado na estrutura de dados da tabela hash. Internamente, uma tabela hash Ê uma matriz de intervalos e cada intervalo Ê um ponteiro para uma matriz de pares de valores-chave.
\nSe soubermos de antemĂŁo o nĂşmero de elementos que um mapa conterĂĄ, devemos criĂĄ-lo fornecendo um tamanho inicial. Fazer isso evita o crescimento potencial do mapa, o que ĂŠ bastante pesado em termos de computação porque requer a realocação de espaço suficiente e o reequilĂbrio de todos os elementos.
\n
\nMapas e vazamentos de memória (#28) \n\nTL;DR \nUm mapa sempre pode crescer na memória, mas nunca diminui. Portanto, se isso causar alguns problemas de memória, você pode tentar diferentes opçþes, como forçar Go a recriar o mapa ou usar ponteiros.
\n \nLeia a seção completa aqui .
\n
\nComparando valores incorretamente (#29) \n\nTL;DR \nPara comparar tipos em Go, você pode usar os operadores == e != se dois tipos forem comparåveis: booleanos, numerais, strings, ponteiros, canais e estruturas são compostos inteiramente de tipos comparåveis. Caso contrårio, você pode usar reflect.DeepEquale pagar o preço da reflexão ou usar implementaçþes e bibliotecas personalizadas.
\n \nà essencial entender como usar == e != para fazer comparaçþes de forma eficaz. Podemos usar esses operadores em operandos comparåveis:
\n\nBooleans âCompara se dois booleanos sĂŁo iguais.Numerics (int, float, and complex types) âCompare se dois nĂşmeros sĂŁo iguais.Strings âCompare se duas strings sĂŁo iguais.Channels âCompare se dois canais foram criados pela mesma chamada a ser feita ou se ambos sĂŁo nulos.Interfaces âCompare se duas interfaces tĂŞm tipos dinâmicos idĂŞnticos e valores dinâmicos iguais ou se ambas sĂŁo nulas.Pointers âCompare se dois ponteiros apontam para o mesmo valor na memĂłria ou se ambos sĂŁo nulos.Structs and arrays âCompare se sĂŁo compostas de tipos semelhantes. \n\nNote \nTambĂŠm podemos usar os operadores ?, >=, < e > com tipos numĂŠricos para comparar valores e com strings para comparar sua ordem lexical.
\n \nSe os operandos nĂŁo forem comparĂĄveis ââ(por exemplo, slices e mapas), teremos que usar outras opçþes, como reflexĂŁo. A reflexĂŁo ĂŠ uma forma de metaprogramação e se refere Ă capacidade de um aplicativo de introspectar e modificar sua estrutura e comportamento. Por exemplo, em Go, podemos usar reflect.DeepEqual. Esta função informa se dois elementos sĂŁo profundamente iguais percorrendo recursivamente dois valores. Os elementos que ele aceita sĂŁo tipos bĂĄsicos mais arrays, estruturas, slices, mapas, ponteiros, interfaces e funçþes. No entanto, o principal problema ĂŠ a penalidade de desempenho.
\nSe o desempenho for crucial em tempo de execução, implementar nosso mÊtodo customizado pode ser a melhor solução. Uma observação adicional: devemos lembrar que a biblioteca padrão possui alguns mÊtodos de comparação existentes. Por exemplo, podemos usar a função bytes.Compare otimizada para comparar duas slices de bytes. Antes de implementar um mÊtodo customizado, precisamos ter certeza de não reinventar a roda.
\n
\nEstruturas de Controle \nIgnorando que os elementos sĂŁo copiados em loops de range (#30) \n\nTL;DR \nO elemento de valor em um loop de range ĂŠ uma cĂłpia. Portanto, para modificar uma struct, por exemplo, acesse-a atravĂŠs de seu Ăndice ou atravĂŠs de um loop for clĂĄssico (a menos que o elemento ou campo que vocĂŞ deseja modificar seja um ponteiro).
\n \nUm range loop permite iterar em diferentes estruturas de dados:
\n\nString \nArray \nPointer to an array \nSlice \nMap \nReceiving channel \n \nComparado a um for loop clåssico, um loop range Ê uma maneira conveniente de iterar todos os elementos de uma dessas estruturas de dados, graças à sua sintaxe concisa.
\nAinda assim, devemos lembrar que o elemento de valor em um range loop ĂŠ uma cĂłpia. Portanto, se o valor for uma estrutura que precisamos sofrer mutação, atualizaremos apenas a cĂłpia, nĂŁo o elemento em si, a menos que o valor ou campo que modificamos seja um ponteiro. As opçþes preferidas sĂŁo acessar o elemento atravĂŠs do Ăndice usando um range loop ou um loop for clĂĄssico.
\n
\nIgnorando como os argumentos sĂŁo avaliados em range loops (canais e arrays) (#31) \n\nTL;DR \nEntender que a expressĂŁo passada ao operador range ĂŠ avaliada apenas uma vez antes do inĂcio do loop pode ajudar a evitar erros comuns, como atribuição ineficiente em canal ou iteração de slice.
\n \nO range loop avalia a expressĂŁo fornecida apenas uma vez, antes do inĂcio do loop, fazendo uma cĂłpia (independentemente do tipo). Devemos lembrar deste comportamento para evitar erros comuns que podem, por exemplo, nos levar a acessar o elemento errado. Por exemplo:
\na := [ 3 ] int { 0 , 1 , 2 } \nfor i , v := range a { \n a [ 2 ] = 10 \n if i == 2 { \n fmt . Println ( v ) \n } \n} \nEste cĂłdigo atualiza o Ăşltimo Ăndice para 10. No entanto, se executarmos este cĂłdigo, ele nĂŁo imprimirĂĄ 10; imprime 2.
\n
\nrange loops (#32)\nWarning \nEste erro nĂŁo ĂŠ mais relevante no Go 1.22 (detalhes ).
\n \nFazendo suposiçþes erradas durante as iteraçþes de maps (ordenação e inserção do mapa durante a iteração) (#33) \n\nTL;DR \nPara garantir resultados previsĂveis ao usar maps, lembre-se de que uma estrutura de dados de mapa:
\n \n\nNĂŁo ordena os dados por chaves \nNĂŁo preserva o pedido de inserção \nNĂŁo tem uma ordem de iteração determinĂstica \nNĂŁo garante que um elemento adicionado durante uma iteração serĂĄ produzido durante esta iteração \n \n\n\n
\nIgnorando como a declaração break funciona (#34) \n\nTL;DR \nUsar break ou continue com um rĂłtulo impĂľe a quebra de uma instrução especĂfica. Isso pode ser Ăştil com instruçþes switch ou select dentro de loops.
\n \nUma instrução break ĂŠ comumente usada para encerrar a execução de um loop. Quando loops sĂŁo usados ââem conjunto com switch ou select, os desenvolvedores frequentemente cometem o erro de quebrar a instrução errada. Por exemplo:
\nfor i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break \n } \n} \nA instrução break não encerra o loop for: em vez disso, ela encerra a instrução switch. Portanto, em vez de iterar de 0 a 2, este código itera de 0 a 4: 0 1 2 3 4.
\nUma regra essencial a ter em mente Ê que uma instrução break encerra a execução da instrução for, switch, ou mais interna select. No exemplo anterior, ele encerra a instrução switch.
\nPara quebrar o loop em vez da instrução switch, a maneira mais idiomåtica Ê usar um rótulo:
\nloop : \n for i := 0 ; i < 5 ; i ++ { \n fmt . Printf ( \"%d \" , i ) \n switch i { \n default : \n case 2 : \n break loop \n } \n } \nAqui, associamos o looprótulo ao for loop. Então, como fornecemos o loop rótulo para a instrução break, ela interrompe o loop, não a opção. Portanto, esta nova versão serå impressa 0 1 2, como esperåvamos.
\n
\nUsando defer dentro de um loop (#35) \n\nTL;DR \nExtrair a lógica do loop dentro de uma função leva à execução de uma instrução defer no final de cada iteração.
\n \nA instrução defer atrasa a execução de uma chamada atÊ que a função circundante retorne. à usado principalmente para reduzir o código padrão. Por exemplo, se um recurso precisar ser fechado eventualmente, podemos usar defer para evitar a repetição das chamadas de fechamento antes de cada return.
\nUm erro comum com defer Ê esquecer que ele agenda uma chamada de função quando a função circundante retorna. Por exemplo:
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // Do something with file \n } \n return nil \n} \nAs chamadas defer não são executadas durante cada iteração do loop, mas quando a função readFiles retorna. Se readFiles não retornar, os descritores de arquivos ficarão abertos para sempre, causando vazamentos.
\nUma opção comum para corrigir esse problema Ê criar uma função circundante após defer, chamada durante cada iteração:
\nfunc readFiles ( ch <- chan string ) error { \n for path := range ch { \n if err := readFile ( path ); err != nil { \n return err \n } \n } \n return nil \n} \nfunc readFile ( path string ) error { \n file , err := os . Open ( path ) \n if err != nil { \n return err \n } \n defer file . Close () \n // Do something with file \n return nil \n} \nOutra solução Ê tornar a função readFile um encerramento, mas intrinsecamente, esta permanece a mesma solução: adicionar outra função circundante para executar as chamadas defer durante cada iteração.
\n
\nStrings \nNĂŁo entendendo o conceito de rune (#36) \n\nTL;DR \nEntender que uma runa corresponde ao conceito de um ponto de cĂłdigo Unicode e que pode ser composta de mĂşltiplos bytes deve fazer parte do conhecimento bĂĄsico do desenvolvedor Go para trabalhar com precisĂŁo com strings.
\n \nComo as runas estĂŁo por toda parte no Go, ĂŠ importante entender o seguinte:
\n\nUm conjunto de caracteres Ê um conjunto de caracteres, enquanto uma codificação descreve como traduzir um conjunto de caracteres em binårio. \nNo Go, uma string faz referência a uma fatia imutåvel de bytes arbitrårios. \nO código-fonte Go Ê codificado usando UTF-8. Portanto, todos os literais de string são strings UTF-8. Mas como uma string pode conter bytes arbitrårios, se for obtida de outro lugar (não do código-fonte), não hå garantia de que seja baseada na codificação UTF-8. \nA rune corresponde ao conceito de ponto de código Unicode, significando um item representado por um único valor. \nUsando UTF-8, um ponto de código Unicode pode ser codificado em 1 a 4 bytes. \nUsar len() na string em Go retorna o número de bytes, não o número de runas. \n \n
\nIteração de string imprecisa (#37) \n\nTL;DR \nIterar em uma string com o operador range itera nas runas com o Ăndice correspondente ao Ăndice inicial da sequĂŞncia de bytes da runa. Para acessar um Ăndice de runa especĂfico (como a terceira runa), converta a string em um arquivo []rune.
\n \nIterar em uma string ĂŠ uma operação comum para desenvolvedores. Talvez queiramos realizar uma operação para cada runa na string ou implementar uma função personalizada para procurar uma substring especĂfica. Em ambos os casos, temos que iterar nas diferentes runas de uma string. Mas ĂŠ fĂĄcil ficar confuso sobre como funciona a iteração.
\nFor example, consider the following example:
\ns := \"hĂŞllo\" \nfor i := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , s [ i ]) \n} \nfmt . Printf ( \"len=%d\\n\" , len ( s )) \nVamos destacar trĂŞs pontos que podem ser confusos:
\n\nA segunda runa ĂŠ Ă na saĂda em vez de ĂŞ. \nSaltamos da posição 1 para a posição 3: o que hĂĄ na posição 2? \nlen retorna uma contagem de 6, enquanto s contĂŠm apenas 5 runas. \n \nVamos começar com a Ăşltima observação. JĂĄ mencionamos que len retorna o nĂşmero de bytes em uma string, nĂŁo o nĂşmero de runas. Como atribuĂmos uma string literal a s, s ĂŠ uma string UTF-8. Enquanto isso, o caractere especial âĂŞâ nĂŁo ĂŠ codificado em um Ăşnico byte; requer 2 bytes. Portanto, chamar len(s) retorna 6.
\nEnquanto isso, no exemplo anterior, temos que entender que nĂŁo repetimos cada runa; em vez disso, iteramos sobre cada Ăndice inicial de uma runa:
\n
\nImprimir s[i] nĂŁo imprime a i-ĂŠsima runa; imprime a representação UTF-8 do byte em index i. Portanto, imprimimos \"hĂllo\" em vez de \"hĂŞllo\".
\nSe quisermos imprimir todas as diferentes runas, podemos usar o elemento value do operador range:
\ns := \"hĂŞllo\" \nfor i , r := range s { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \nOu podemos converter a string em uma fatia de runas e iterar sobre ela:
\ns := \"hêllo\" \nrunes := [] rune ( s ) \nfor i , r := range runes { \n fmt . Printf ( \"position %d: %c\\n\" , i , r ) \n} \nObserve que esta solução introduz uma sobrecarga de tempo de execução em comparação com a anterior. Na verdade, converter uma string em uma fatia de runas requer a alocação de uma fatia adicional e a conversão dos bytes em runas: uma complexidade de tempo O(n) com n o número de bytes na string. Portanto, se quisermos iterar todas as runas, devemos usar a primeira solução.
\nPorĂŠm, se quisermos acessar a i-ĂŠsima runa de uma string com a primeira opção, nĂŁo teremos acesso ao Ăndice da runa; em vez disso, conhecemos o Ăndice inicial de uma runa na sequĂŞncia de bytes.
\ns := \"hĂŞllo\" \nr := [] rune ( s )[ 4 ] \nfmt . Printf ( \"%c\\n\" , r ) // o \n
\nUso indevido de funçþes de trim (#38) \n\nTL;DR \nstrings.TrimRight/strings.TrimLeft remove todas as runas finais/iniciais contidas em um determinado conjunto, enquanto strings.TrimSuffix/strings.TrimPrefix retorna uma string sem um sufixo/prefixo fornecido.
\n \nPor exemplo:
\nfmt . Println ( strings . TrimRight ( \"123oxo\" , \"xo\" )) \nO exemplo imprime 123:
\n
\nPor outro lado, strings.TrimLeft remove todas as runas principais contidas em um conjunto.
\nPor outro lado, strings.TrimSuffix/strings.TrimPrefix retorna uma string sem o sufixo/prefixo final fornecido.
\n
\nConcatenação de strings subotimizada (#39) \n\nTL;DR \nA concatenação de uma lista de strings deve ser feita com strings.Builder para evitar a alocação de uma nova string durante cada iteração.
\n \nVamos considerar uma função concat que concatena todos os elementos string de uma fatia usando o operador +=:
\nfunc concat ( values [] string ) string { \n s := \"\" \n for _ , value := range values { \n s += value \n } \n return s \n} \nDurante cada iteração, o operador += concatena com s a sequĂŞncia de valores. Ă primeira vista, esta função pode nĂŁo parecer errada. Mas com esta implementação, esquecemos uma das principais caracterĂsticas de uma string: a sua imutabilidade. Portanto, cada iteração nĂŁo ĂŠ atualizada s; ele realoca uma nova string na memĂłria, o que impacta significativamente o desempenho desta função.
\nFelizmente, existe uma solução para lidar com esse problema, usando strings.Builder:
\nfunc concat ( values [] string ) string { \n sb := strings . Builder {} \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \nDurante cada iteração, construĂmos a string resultante chamando o mĂŠtodo WriteString que anexa o conteĂşdo do valor ao seu buffer interno, minimizando assim a cĂłpia da memĂłria.
\n\nNote \nWriteString retorna um erro como segunda saĂda, mas nĂłs o ignoramos propositalmente. Na verdade, este mĂŠtodo nunca retornarĂĄ um erro diferente de zero. EntĂŁo, qual ĂŠ o propĂłsito deste mĂŠtodo retornar um erro como parte de sua assinatura? strings.Builder implementa a io.StringWriter interface, que contĂŠm um Ăşnico mĂŠtodo: WriteString(s string) (n int, err error). Portanto, para estar em conformidade com esta interface, WriteString deve retornar um erro.
\n \nInternamente, strings.Builder contÊm uma fatia de bytes. Cada chamada para WriteString resulta em uma chamada para anexar nesta fatia. Existem dois impactos. Primeiro, esta estrutura não deve ser usada simultaneamente, pois as chamadas append levariam a condiçþes de corrida. O segundo impacto Ê algo que vimos no mistake #21, \"Inicialização de slice ineficiente\" : se o comprimento futuro de uma slice jå for conhecido, devemos prÊ-alocå-la. Para isso, strings.Builder expþe um mÊtodo Grow(n int) para garantir espaço para outros n bytes:
\nfunc concat ( values [] string ) string { \n total := 0 \n for i := 0 ; i < len ( values ); i ++ { \n total += len ( values [ i ]) \n } \n sb := strings . Builder {} \n sb . Grow ( total ) ( 2 ) \n for _ , value := range values { \n _ , _ = sb . WriteString ( value ) \n } \n return sb . String () \n} \nVamos executar um benchmark para comparar as três versþes (v1 usando +=; v2 usando strings.Builder{} sem prÊ-alocação; e v3 usando strings.Builder{} com prÊ-alocação). A slice de entrada contÊm 1.000 strings e cada string contÊm 1.000 bytes:
\nComo podemos ver, a versĂŁo mais recente ĂŠ de longe a mais eficiente: 99% mais rĂĄpida que a v1 e 78% mais rĂĄpida que a v2.
\nstrings.Builder ĂŠ a solução recomendada para concatenar uma lista de strings. Normalmente, esta solução deve ser usada dentro de um loop. Na verdade, se precisarmos apenas concatenar algumas strings (como um nome e um sobrenome), o uso strings.Builder nĂŁo ĂŠ recomendado, pois isso tornarĂĄ o cĂłdigo um pouco menos legĂvel do que usar o operador += or fmt.Sprintf.
\n
\nConversþes de string inúteis (#40) \n\nTL;DR \nLembrar que o pacote bytes oferece as mesmas operaçþes que o pacote strings pode ajudar a evitar conversþes extras de bytes/string.
\n \nAo optar por trabalhar com uma string ou um []byte, a maioria dos programadores tende a preferir strings por conveniĂŞncia. Mas a maior parte da E/S ĂŠ realmente feita com []byte. Por exemplo, io.Reader, io.Writer e io.ReadAll trabalham com []byte, nĂŁo com strings.
\nQuando nos perguntamos se devemos trabalhar com strings ou []byte, lembremos que trabalhar com []bytenĂŁo ĂŠ necessariamente menos conveniente. Na verdade, todas as funçþes exportadas do pacote strings tambĂŠm possuem alternativas no pacote bytes: Split, Count, Contains, Index e assim por diante. Portanto, estejamos fazendo I/O ou nĂŁo, devemos primeiro verificar se poderĂamos implementar um fluxo de trabalho completo usando bytes em vez de strings e evitar o preço de conversĂľes adicionais.
\n
\nVazamentos de substring e memória (#41) \n\nTL;DR \nUsar cópias em vez de substrings pode evitar vazamentos de memória, pois a string retornada por uma operação de substring serå apoiada pela mesma matriz de bytes.
\n \nIn mistake #26, âSlices and memory leaks,â we saw how slicing a slice or array may lead to memory leak situations. This principle also applies to string and substring operations.
\nWe need to keep two things in mind while using the substring operation in Go. First, the interval provided is based on the number of bytes, not the number of runes. Second, a substring operation may lead to a memory leak as the resulting substring will share the same backing array as the initial string. The solutions to prevent this case from happening are to perform a string copy manually or to use strings.Clone from Go 1.18.
\n
\nFunctions and Methods \nNão saber que tipo de receptor usar (#42) \n\nTL;DR \nA decisão de usar um valor ou um receptor de ponteiro deve ser tomada com base em fatores como o tipo, se deve sofrer mutação, se contÊm um campo que não pode ser copiado e o tamanho do objeto. Em caso de dúvida, use um receptor de ponteiro.
\n \nChoosing between value and pointer receivers isnât always straightforward. Letâs discuss some of the conditions to help us choose.
\nA receiver must be a pointer
\n\nIf the method needs to mutate the receiver. This rule is also valid if the receiver is a slice and a method needs to append elements: \n \ntype slice [] int \nfunc ( s * slice ) add ( element int ) { \n * s = append ( * s , element ) \n} \nA receiver should be a pointer
\n\nIf the receiver is a large object. Using a pointer can make the call more efficient, as doing so prevents making an extensive copy. When in doubt about how large is large, benchmarking can be the solution; itâs pretty much impossible to state a specific size, because it depends on many factors. \n \nA receiver must be a value
\n\nIf we have to enforce a receiverâs immutability. \nIf the receiver is a map, function, or channel. Otherwise, a compilation error\n occurs. \n \nA receiver should be a value
\n\nIf the receiver is a slice that doesnât have to be mutated. \nIf the receiver is a small array or struct that is naturally a value type without mutable fields, such as time.Time. \nIf the receiver is a basic type such as int, float64, or string. \n \nOf course, itâs impossible to be exhaustive, as there will always be edge cases, but this sectionâs goal was to provide guidance to cover most cases. By default, we can choose to go with a value receiver unless thereâs a good reason not to do so. In doubt, we should use a pointer receiver.
\n
\nNunca usando parâmetros de resultado nomeados (#43) \n\nTL;DR \nUsar parâmetros de resultado nomeados pode ser uma maneira eficiente de melhorar a legibilidade de uma função/mĂŠtodo, especialmente se vĂĄrios parâmetros de resultado tiverem o mesmo tipo. Em alguns casos, esta abordagem tambĂŠm pode ser conveniente porque os parâmetros de resultado nomeados sĂŁo inicializados com seu valor zero. Mas tenha cuidado com os possĂveis efeitos colaterais.
\n \nWhen we return parameters in a function or a method, we can attach names to these parameters and use them as regular variables. When a result parameter is named, itâs initialized to its zero value when the function/method begins. With named result parameters, we can also call a naked return statement (without arguments). In that case, the current values of the result parameters are used as the returned values.
\nHereâs an example that uses a named result parameter b:
\nfunc f ( a int ) ( b int ) { \n b = a \n return \n} \nIn this example, we attach a name to the result parameter: b. When we call return without arguments, it returns the current value of b.
\nIn some cases, named result parameters can also increase readability: for example, if two parameters have the same type. In other cases, they can also be used for convenience. Therefore, we should use named result parameters sparingly when thereâs a clear benefit.
\n
\n\n\nTL;DR \nConsulte #43 .
\n \nWe mentioned why named result parameters can be useful in some situations. But as these result parameters are initialized to their zero value, using them can sometimes lead to subtle bugs if weâre not careful enough. For example, can you spot whatâs wrong with this code?
\nfunc ( l loc ) getCoordinates ( ctx context . Context , address string ) ( \n lat , lng float32 , err error ) { \n isValid := l . validateAddress ( address ) ( 1 ) \n if ! isValid { \n return 0 , 0 , errors . New ( \"invalid address\" ) \n } \n if ctx . Err () != nil { ( 2 ) \n return 0 , 0 , err \n } \n // Get and return coordinates \n} \nThe error might not be obvious at first glance. Here, the error returned in the if ctx.Err() != nil scope is err. But we havenât assigned any value to the err variable. Itâs still assigned to the zero value of an error type: nil. Hence, this code will always return a nil error.
\nWhen using named result parameters, we must recall that each parameter is initialized to its zero value. As we have seen in this section, this can lead to subtle bugs that arenât always straightforward to spot while reading code. Therefore, letâs remain cautious when using named result parameters, to avoid potential side effects.
\n
\nRetornando um receptor nulo (#45) \n\nTL;DR \nAo retornar uma interface, tenha cuidado para nĂŁo retornar um ponteiro nulo, mas um valor nulo explĂcito. Caso contrĂĄrio, poderĂŁo ocorrer consequĂŞncias nĂŁo intencionais e o chamador receberĂĄ um valor diferente de zero.
\n \n\n\n
\nUsando um nome de arquivo como entrada de função (#46) \n\nTL;DR \nProjetar funçþes para receber tipos io.Reader em vez de nomes de arquivos melhora a capacidade de reutilização de uma função e facilita o teste.
\n \nAccepting a filename as a function input to read from a file should, in most cases, be considered a code smell (except in specific functions such as os.Open). Indeed, it makes unit tests more complex because we may have to create multiple files. It also reduces the reusability of a function (although not all functions are meant to be reused). Using the io.Reader interface abstracts the data source. Regardless of whether the input is a file, a string, an HTTP request, or a gRPC request, the implementation can be reused and easily tested.
\n
\nIgnorando como argumentos defer e receptores sĂŁo avaliados (avaliação de argumentos, ponteiros e receptores de valor) (#47) \n\nTL;DR \nPassar um ponteiro para uma função defer e agrupar uma chamada dentro de um closure sĂŁo duas soluçþes possĂveis para superar a avaliação imediata de argumentos e receptores.
\n \nIn a defer function the arguments are evaluated right away, not once the surrounding function returns. For example, in this code, we always call notify and incrementCounter with the same status: an empty string.
\nconst ( \n StatusSuccess = \"success\" \n StatusErrorFoo = \"error_foo\" \n StatusErrorBar = \"error_bar\" \n) \nfunc f () error { \n var status string \n defer notify ( status ) \n defer incrementCounter ( status ) \n if err := foo (); err != nil { \n status = StatusErrorFoo \n return err \n } \n if err := bar (); err != nil { \n status = StatusErrorBar \n return err \n } \n status = StatusSuccess < 5 > \n return nil \n} \nIndeed, we call notify(status) and incrementCounter(status) as defer functions. Therefore, Go will delay these calls to be executed once f returns with the current value of status at the stage we used defer, hence passing an empty string.
\nTwo leading options if we want to keep using defer.
\nThe first solution is to pass a string pointer:
\nfunc f () error { \n var status string \n defer notify ( & status ) \n defer incrementCounter ( & status ) \n // The rest of the function unchanged \n} \nUsing defer evaluates the arguments right away: here, the address of status. Yes, status itself is modified throughout the function, but its address remains constant, regardless of the assignments. Hence, if notify or incrementCounter uses the value referenced by the string pointer, it will work as expected. But this solution requires changing the signature of the two functions, which may not always be possible.
\nThereâs another solution: calling a closure (an anonymous function value that references variables from outside its body) as a defer statement:
\nfunc f () error { \n var status string \n defer func () { \n notify ( status ) \n incrementCounter ( status ) \n }() \n // The rest of the function unchanged \n} \nHere, we wrap the calls to both notify and incrementCounter within a closure. This closure references the status variable from outside its body. Therefore, status is evaluated once the closure is executed, not when we call defer. This solution also works and doesnât require notify and incrementCounter to change their signature.
\nLet's also note this behavior applies with method receiver: the receiver is evaluated immediately.
\n
\nError Management \nPânico (#48) \n\nTL;DR \nUsar panic Ê uma opção para lidar com erros no Go. No entanto, só deve ser usado com moderação em condiçþes irrecuperåveis: por exemplo, para sinalizar um erro do programador ou quando você não consegue carregar uma dependência obrigatória.
\n \nIn Go, panic is a built-in function that stops the ordinary flow:
\nfunc main () { \n fmt . Println ( \"a\" ) \n panic ( \"foo\" ) \n fmt . Println ( \"b\" ) \n} \nThis code prints a and then stops before printing b:
\nPanicking in Go should be used sparingly. There are two prominent cases, one to signal a programmer error (e.g., sql.Registernil or has already been register) and another where our application fails to create a mandatory dependency. Hence, exceptional conditions that lead us to stop the application. In most other cases, error management should be done with a function that returns a proper error type as the last return argument.
\n
\nIgnorando quando embrulhar um erro (#49) \n\nTL;DR \nEmbrulhar um erro permite marcar um erro e/ou fornecer contexto adicional. No entanto, o agrupamento de erros cria um acoplamento potencial, pois disponibiliza o erro de origem para o chamador. Se vocĂŞ quiser evitar isso, nĂŁo use a agrupamento automĂĄtico de erros.
\n \nSince Go 1.13, the %w directive allows us to wrap errors conveniently. Error wrapping is about wrapping or packing an error inside a wrapper container that also makes the source error available. In general, the two main use cases for error wrapping are the following:
\n\nAdding additional context to an error \nMarking an error as a specific error \n \nWhen handling an error, we can decide to wrap it. Wrapping is about adding additional context to an error and/or marking an error as a specific type. If we need to mark an error, we should create a custom error type. However, if we just want to add extra context, we should use fmt.Errorf with the %w directive as it doesnât require creating a new error type. Yet, error wrapping creates potential coupling as it makes the source error available for the caller. If we want to prevent it, we shouldnât use error wrapping but error transformation, for example, using fmt.Errorf with the %v directive.
\n
\n\n\nTL;DR \nSe você usar o agrupamento de erros do Go 1.13 com a diretiva %w e fmt.Errorf, a comparação de um erro com um tipo deverå ser feita usando errors.As. Caso contrårio, se o erro retornado que você deseja verificar for embrulhado, as verificaçþes falharão.
\n \n\n\n
\nComparando um valor de erro incorretamente (#51) \n\nTL;DR \nSe você usar o agrupamento de erros do Go 1.13 com a diretiva %w e fmt.Errorf, a comparação de um erro ou de um valor deverå ser feita usando errors.As. Caso contrårio, se o erro retornado que você deseja verificar for embrulhado, as verificaçþes falharão.
\n \nA sentinel error is an error defined as a global variable:
\nimport \"errors\" \nvar ErrFoo = errors . New ( \"foo\" ) \nIn general, the convention is to start with Err followed by the error type: here, ErrFoo. A sentinel error conveys an expected error, an error that clients will expect to check. As general guidelines:
\n\nExpected errors should be designed as error values (sentinel errors): var ErrFoo = errors.New(\"foo\"). \nUnexpected errors should be designed as error types: type BarError struct { ... }, with BarError implementing the error interface. \n \nIf we use error wrapping in our application with the %w directive and fmt.Errorf, checking an error against a specific value should be done using errors.Is instead of ==. Thus, even if the sentinel error is wrapped, errors.Is can recursively unwrap it and compare each error in the chain against the provided value.
\n
\n\n\nTL;DR \nNa maioria das situaçþes, um erro deve ser tratado apenas uma vez. Registrar um erro Ê tratar um erro. Portanto, você deve escolher entre registrar ou retornar um erro. Em muitos casos, o embrulho automåtico de erros Ê a solução, pois permite fornecer contexto adicional a um erro e retornar o erro de origem.
\n \nHandling an error multiple times is a mistake made frequently by developers, not specifically in Go. This can cause situations where the same error is logged multiple times make debugging harder.
\nLet's remind us that handling an error should be done only once. Logging an error is handling an error. Hence, we should either log or return an error. By doing this, we simplify our code and gain better insights into the error situation. Using error wrapping is the most convenient approach as it allows us to propagate the source error and add context to an error.
\n
\nNão tratando de um erro (#53) \n\nTL;DR \nIgnorar um erro, seja durante uma chamada de função ou em uma função defer, deve ser feito explicitamente usando o identificador em branco. Caso contrårio, os futuros leitores poderão ficar confusos sobre se foi intencional ou um erro.
\n \n
\nNão tratando erros de defer (#54) \n\nTL;DR \nEm muitos casos, você não deve ignorar um erro retornado por uma função defer. Manipule-o diretamente ou propague-o para o chamador, dependendo do contexto. Se você quiser ignorå-lo, use o identificador em branco.
\n \nConsider the following code:
\nfunc f () { \n // ... \n notify () // Error handling is omitted \n} \nfunc notify () error { \n // ... \n} \nFrom a maintainability perspective, the code can lead to some issues. Letâs consider a new reader looking at it. This reader notices that notify returns an error but that the error isnât handled by the parent function. How can they guess whether or not handling the error was intentional? How can they know whether the previous developer forgot to handle it or did it purposely?
\nFor these reasons, when we want to ignore an error, there's only one way to do it, using the blank identifier (_):
\n\nIn terms of compilation and run time, this approach doesnât change anything compared to the first piece of code. But this new version makes explicit that we arenât interested in the error. Also, we can add a comment that indicates the rationale for why an error is ignored:
\n// At-most once delivery. \n// Hence, it's accepted to miss some of them in case of errors. \n_ = notify () \n
\nConcurrency: Foundations \nMisturando simultaneidade e paralelismo (#55) \n\nTL;DR \nCompreender as diferenças fundamentais entre simultaneidade e paralelismo Ê a base do conhecimento do desenvolvedor Go. A simultaneidade tem a ver com estrutura, enquanto o paralelismo tem a ver com execução.
\n \nConcurrency and parallelism are not the same:
\n\nConcurrency is about structure. We can change a sequential implementation into a concurrent one by introducing different steps that separate concurrent goroutines can tackle. \nMeanwhile, parallelism is about execution. We can use parallism at the steps level by adding more parallel goroutines. \n \nIn summary, concurrency provides a structure to solve a problem with parts that may be parallelized. Therefore, concurrency enables parallelism .
\n\n\nPensar que a simultaneidade ĂŠ sempre mais rĂĄpida (#56) \n\nTL;DR \nPara ser um desenvolvedor proficiente, vocĂŞ deve reconhecer que a simultaneidade nem sempre ĂŠ mais rĂĄpida. As soluçþes que envolvem a paralelização de cargas de trabalho mĂnimas podem nĂŁo ser necessariamente mais rĂĄpidas do que uma implementação sequencial. A avaliação comparativa de soluçþes sequenciais versus soluçþes simultâneas deve ser a forma de validar suposiçþes.
\n \nRead the full section here .
\n
\nFicar confuso sobre quando usar canais ou mutexes (#57) \n\nTL;DR \nEstar ciente das interaçþes goroutine tambÊm pode ser útil ao decidir entre canais e mutexes. Em geral, goroutines paralelas requerem sincronização e, portanto, mutexes. Por outro lado, goroutines simultâneas geralmente requerem coordenação e orquestração e, portanto, canais.
\n \nGiven a concurrency problem, it may not always be clear whether we can implement a\nsolution using channels or mutexes. Because Go promotes sharing memory by communication, one mistake could be to always force the use of channels, regardless of\nthe use case. However, we should see the two options as complementary.
\nWhen should we use channels or mutexes? We will use the example in the next figure as a backbone. Our example has three different goroutines with specific relationships:
\n\nG1 and G2 are parallel goroutines. They may be two goroutines executing the same function that keeps receiving messages from a channel, or perhaps two goroutines executing the same HTTP handler at the same time. \nOn the other hand, G1 and G3 are concurrent goroutines, as are G2 and G3. All the goroutines are part of an overall concurrent structure, but G1 and G2 perform the first step, whereas G3 does the next step. \n \n\n\nIn general, parallel goroutines have to synchronize : for example, when they need to access or mutate a shared resource such as a slice. Synchronization is enforced with mutexes but not with any channel types (not with buffered channels). Hence, in general, synchronization between parallel goroutines should be achieved via mutexes.
\nConversely, in general, concurrent goroutines have to coordinate and orchestrate . For example, if G3 needs to aggregate results from both G1 and G2, G1 and G2 need to signal to G3 that a new intermediate result is available. This coordination falls under the scope of communicationâtherefore, channels.
\nRegarding concurrent goroutines, thereâs also the case where we want to transfer the ownership of a resource from one step (G1 and G2) to another (G3); for example, if G1 and G2 are enriching a shared resource and at some point, we consider this job as complete. Here, we should use channels to signal that a specific resource is ready and handle the ownership transfer.
\nMutexes and channels have different semantics. Whenever we want to share a state or access a shared resource, mutexes ensure exclusive access to this resource. Conversely, channels are a mechanic for signaling with or without data (chan struct{} or not). Coordination or ownership transfer should be achieved via channels. Itâs important to know whether goroutines are parallel or concurrent because, in general, we need mutexes for parallel goroutines and channels for concurrent ones.
\nNĂŁo entender os problemas de corrida (corridas de dados vs. condiçþes de corrida e o modelo de memĂłria Go) (#58) \n\nTL;DR \nSer proficiente em simultaneidade tambĂŠm significa compreender que corridas de dados e condiçþes de corrida sĂŁo conceitos diferentes. As corridas de dados ocorrem quando vĂĄrias goroutines acessam simultaneamente o mesmo local de memĂłria e pelo menos uma delas estĂĄ gravando. Enquanto isso, estar livre de disputa de dados nĂŁo significa necessariamente execução determinĂstica. Quando um comportamento depende da sequĂŞncia ou do tempo de eventos que nĂŁo podem ser controlados, esta ĂŠ uma condição de corrida.
\n \nRace problems can be among the hardest and most insidious bugs a programmer can face. As Go developers, we must understand crucial aspects such as data races and race conditions, their possible impacts, and how to avoid them.
\nData Race \nA data race occurs when two or more goroutines simultaneously access the same memory location and at least one is writing. In this case, the result can be hazardous. Even worse, in some situations, the memory location may end up holding a value containing a meaningless combination of bits.
\nWe can prevent a data race from happening using different techniques. For example:
\n\nUsing the sync/atomic package \nIn synchronizing the two goroutines with an ad hoc data structure like a mutex \nUsing channels to make the two goroutines communicating to ensure that a variable is updated by only one goroutine at a time \n \nRace Condition \nDepending on the operation we want to perform, does a data-race-free application necessarily mean a deterministic result? Not necessarily.
\nA race condition occurs when the behavior depends on the sequence or the timing of events that canât be controlled. Here, the timing of events is the goroutinesâ execution order.
\nIn summary, when we work in concurrent applications, itâs essential to understand that a data race is different from a race condition. A data race occurs when multiple goroutines simultaneously access the same memory location and at least one of them is writing. A data race means unexpected behavior. However, a data-race-free application doesnât necessarily mean deterministic results. An application can be free of data races but still have behavior that depends on uncontrolled events (such as goroutine execution, how fast a message is published to a channel, or how long a call to a database lasts); this is a race condition. Understanding both concepts is crucial to becoming proficient in designing concurrent applications.
\n
\nNão compreender os impactos de simultaneidade de um tipo de carga de trabalho (#59) \n\nTL;DR \nAo criar um determinado número de goroutines, considere o tipo de carga de trabalho. Criar goroutines vinculadas à CPU significa limitar esse número próximo à variåvel GOMAXPROCS (baseado por padrão no número de núcleos de CPU no host). A criação de goroutines vinculadas a E/S depende de outros fatores, como o sistema externo.
\n \nIn programming, the execution time of a workload is limited by one of the following:
\n\nThe speed of the CPUâFor example, running a merge sort algorithm. The workload is called CPU-bound. \nThe speed of I/OâFor example, making a REST call or a database query. The workload is called I/O-bound. \nThe amount of available memoryâThe workload is called memory-bound. \n \n\nNote \nThe last is the rarest nowadays, given that memory has become very cheap in recent decades. Hence, this section focuses on the two first workload types: CPU- and I/O-bound.
\n \nIf the workload executed by the workers is I/O-bound, the value mainly depends on the external system. Conversely, if the workload is CPU-bound, the optimal number of goroutines is close to the number of available CPU cores (a best practice can be to use runtime.GOMAXPROCS). Knowing the workload type (I/O or CPU) is crucial when designing concurrent applications.
\n
\nIncompreensĂŁo dos contextos Go (#60) \n\nTL;DR \nOs contextos Go tambĂŠm sĂŁo um dos pilares da simultaneidade em Go. Um contexto permite que vocĂŞ carregue um prazo, um sinal de cancelamento e/ou uma lista de valores-chave.
\n \n\n
https://pkg.go.dev/context
\n
A Context carries a deadline, a cancellation signal, and other values across API boundaries.
\n
Deadline \nA deadline refers to a specific point in time determined with one of the following:
\n\nA time.Duration from now (for example, in 250 ms) \nA time.Time (for example, 2023-02-07 00:00:00 UTC) \n \nThe semantics of a deadline convey that an ongoing activity should be stopped if this deadline is met. An activity is, for example, an I/O request or a goroutine waiting to receive a message from a channel.
\nCancellation signals \nAnother use case for Go contexts is to carry a cancellation signal. Letâs imagine that we want to create an application that calls CreateFileWatcher(ctx context.Context, filename string) within another goroutine. This function creates a specific file watcher that keeps reading from a file and catches updates. When the provided context expires or is canceled, this function handles it to close the file descriptor.
\nContext values \nThe last use case for Go contexts is to carry a key-value list. Whatâs the point of having a context carrying a key-value list? Because Go contexts are generic and mainstream, there are infinite use cases.
\nFor example, if we use tracing, we may want different subfunctions to share the same correlation ID. Some developers may consider this ID too invasive to be part of the function signature. In this regard, we could also decide to include it as part of the provided context.
\nCatching a context cancellation \nThe context.Context type exports a Done method that returns a receive-only notification channel: <-chan struct{}. This channel is closed when the work associated with the context should be canceled. For example,
\n\nThe Done channel related to a context created with context.WithCancel is closed when the cancel function is called. \nThe Done channel related to a context created with context.WithDeadline is closed when the deadline has expired. \n \nOne thing to note is that the internal channel should be closed when a context is canceled or has met a deadline, instead of when it receives a specific value, because the closure of a channel is the only channel action that all the consumer goroutines will receive. This way, all the consumers will be notified once a context is canceled or a deadline is reached.
\nIn summary, to be a proficient Go developer, we have to understand what a context is and how to use it. In general, a function that users wait for should take a context, as doing so allows upstream callers to decide when calling this function should be aborted.
\n
\nConcurrency: Practice \nPropagando um contexto impróprio (#61) \n\nTL;DR \nCompreender as condiçþes em que um contexto pode ser cancelado deve ser importante ao propagå-lo: por exemplo, um manipulador HTTP cancelando o contexto quando a resposta for enviada.
\n \nIn many situations, it is recommended to propagate Go contexts. However, context propagation can sometimes lead to subtle bugs, preventing subfunctions from being correctly executed.
\nLetâs consider the following example. We expose an HTTP handler that performs some tasks and returns a response. But just before returning the response, we also want to send it to a Kafka topic. We donât want to penalize the HTTP consumer latency-wise, so we want the publish action to be handled asynchronously within a new goroutine. We assume that we have at our disposal a publish function that accepts a context so the action of publishing a message can be interrupted if the context is canceled, for example. Here is a possible implementation:
\nfunc handler ( w http . ResponseWriter , r * http . Request ) { \n response , err := doSomeTask ( r . Context (), r ) \n if err != nil { \n http . Error ( w , err . Error (), http . StatusInternalServerError ) \n return \n } \n go func () { \n err := publish ( r . Context (), response ) \n // Do something with err \n }() \n writeResponse ( response ) \n} \nWhatâs wrong with this piece of code? We have to know that the context attached to an HTTP request can cancel in different conditions:
\n\nWhen the clientâs connection closes \nIn the case of an HTTP/2 request, when the request is canceled \nWhen the response has been written back to the client \n \nIn the first two cases, we probably handle things correctly. For example, if we get a response from doSomeTask but the client has closed the connection, itâs probably OK to call publish with a context already canceled so the message isnât published. But what about the last case?
\nWhen the response has been written to the client, the context associated with the request will be canceled. Therefore, we are facing a race condition:
\n\nIf the response is written after the Kafka publication, we both return a response and publish a message successfully \nHowever, if the response is written before or during the Kafka publication, the message shouldnât be published. \n \nIn the latter case, calling publish will return an error because we returned the HTTP response quickly.
\n\nNote \nFrom Go 1.21, there is a way to create a new context without cancel. context.WithoutCancel
\n \nIn summary, propagating a context should be done cautiously.
\n
\nIniciando uma goroutine sem saber quando interrompĂŞ-la (#62) \n\nTL;DR \nEvitar vazamentos significa estar ciente de que sempre que uma goroutine for iniciada, vocĂŞ deve ter um plano para interrompĂŞ-la eventualmente.
\n \nGoroutines are easy and cheap to startâso easy and cheap that we may not necessarily have a plan for when to stop a new goroutine, which can lead to leaks. Not knowing when to stop a goroutine is a design issue and a common concurrency mistake in Go.
\nLetâs discuss a concrete example. We will design an application that needs to watch some external configuration (for example, using a database connection). Hereâs a first implementation:
\nfunc main () { \n newWatcher () \n // Run the application \n} \ntype watcher struct { /* Some resources */ } \nfunc newWatcher () { \n w := watcher {} \n go w . watch () // Creates a goroutine that watches some external configuration \n} \nThe problem with this code is that when the main goroutine exits (perhaps because of an OS signal or because it has a finite workload), the application is stopped. Hence, the resources created by watcher arenât closed gracefully. How can we prevent this from happening?
\nOne option could be to pass to newWatcher a context that will be canceled when main returns:
\nfunc main () { \n ctx , cancel := context . WithCancel ( context . Background ()) \n defer cancel () \n newWatcher ( ctx ) \n // Run the application \n} \nfunc newWatcher ( ctx context . Context ) { \n w := watcher {} \n go w . watch ( ctx ) \n} \nWe propagate the context created to the watch method. When the context is canceled, the watcher struct should close its resources. However, can we guarantee that watch will have time to do so? Absolutely notâand thatâs a design flaw.
\nThe problem is that we used signaling to convey that a goroutine had to be stopped. We didnât block the parent goroutine until the resources had been closed. Letâs make sure we do:
\nfunc main () { \n w := newWatcher () \n defer w . close () \n // Run the application \n} \nfunc newWatcher () watcher { \n w := watcher {} \n go w . watch () \n return w \n} \nfunc ( w watcher ) close () { \n // Close the resources \n} \nInstead of signaling watcher that itâs time to close its resources, we now call this close method, using defer to guarantee that the resources are closed before the application exits.
\nIn summary, letâs be mindful that a goroutine is a resource like any other that must eventually be closed to free memory or other resources. Starting a goroutine without knowing when to stop it is a design issue. Whenever a goroutine is started, we should have a clear plan about when it will stop. Last but not least, if a goroutine creates resources and its lifetime is bound to the lifetime of the application, itâs probably safer to wait for this goroutine to complete before exiting the application. This way, we can ensure that the resources can be freed.
\n
\n\n\nWarning \nEste erro nĂŁo ĂŠ mais relevante no Go 1.22 (detalhes ).
\n \nEsperando um comportamento determinĂstico usando seleção e canais (#64) \n\nTL;DR \nCompreender que com select vĂĄrios canais escolhe o caso aleatoriamente se mĂşltiplas opçþes forem possĂveis evita fazer suposiçþes erradas que podem levar a erros sutis de simultaneidade.
\n \nOne common mistake made by Go developers while working with channels is to make wrong assumptions about how select behaves with multiple channels.
\nFor example, let's consider the following case (disconnectCh is a unbuffered channel):
\ngo func () { \n for i := 0 ; i < 10 ; i ++ { \n messageCh <- i \n } \n disconnectCh <- struct {}{} \n}() \nfor { \n select { \n case v := <- messageCh : \n fmt . Println ( v ) \n case <- disconnectCh : \n fmt . Println ( \"disconnection, return\" ) \n return \n } \n} \nIf we run this example multiple times, the result will be random:
\nInstead of consuming the 10 messages, we only received a few of them. Whatâs the reason? It lies in the specification of the select statement with multiple channels (https:// go.dev/ref/spec):
\n\n
Quote
\n
If one or more of the communications can proceed, a single one that can proceed is chosen via a uniform pseudo-random selection.
\n
Unlike a switch statement, where the first case with a match wins, the select statement selects randomly if multiple options are possible.
\nThis behavior might look odd at first, but thereâs a good reason for it: to prevent possible starvation. Suppose the first possible communication chosen is based on the source order. In that case, we may fall into a situation where, for example, we only receive from one channel because of a fast sender. To prevent this, the language designers decided to use a random selection.
\nWhen using select with multiple channels, we must remember that if multiple options are possible, the first case in the source order does not automatically win. Instead, Go selects randomly, so thereâs no guarantee about which option will be chosen. To overcome this behavior, in the case of a single producer goroutine, we can use either unbuffered channels or a single channel.
\n
\nNão usar canais de notificação (#65) \n\nTL;DR \nEnvie notificaçþes usando um tipo chan struct{}.
\n \nChannels are a mechanism for communicating across goroutines via signaling. A signal can be either with or without data.
\nLetâs look at a concrete example. We will create a channel that will notify us whenever a certain disconnection occurs. One idea is to handle it as a chan bool:
\ndisconnectCh := make ( chan bool ) \nNow, letâs say we interact with an API that provides us with such a channel. Because itâs a channel of Booleans, we can receive either true or false messages. Itâs probably clear what true conveys. But what does false mean? Does it mean we havenât been disconnected? And in this case, how frequently will we receive such a signal? Does it mean we have reconnected? Should we even expect to receive false? Perhaps we should only expect to receive true messages.
\nIf thatâs the case, meaning we donât need a specific value to convey some information, we need a channel without data. The idiomatic way to handle it is a channel of empty structs: chan struct{}.
\nNão usar canais nulos (#66) \n\nTL;DR \nO uso de canais nulos deve fazer parte do seu conjunto de ferramentas de simultaneidade porque permite remover casos de instruçþes select, por exemplo.
\n \nWhat should this code do?
\n\nch is a chan int type. The zero value of a channel being nil, ch is nil. The goroutine wonât panic; however, it will block forever.
\nThe principle is the same if we send a message to a nil channel. This goroutine blocks forever:
\nvar ch chan int \nch <- 0 \nThen whatâs the purpose of Go allowing messages to be received from or sent to a nil channel? For example, we can use nil channels to implement an idiomatic way to merge two channels:
\nfunc merge ( ch1 , ch2 <- chan int ) <- chan int { \n ch := make ( chan int , 1 ) \n go func () { \n for ch1 != nil || ch2 != nil { // Continue if at least one channel isnât nil \n select { \n case v , open := <- ch1 : \n if ! open { \n ch1 = nil // Assign ch1 to a nil channel once closed \n break \n } \n ch <- v \n case v , open := <- ch2 : \n if ! open { \n ch2 = nil // Assigns ch2 to a nil channel once closed \n break \n } \n ch <- v \n } \n } \n close ( ch ) \n }() \n return ch \n} \nThis elegant solution relies on nil channels to somehow remove one case from the select statement.
\nLetâs keep this idea in mind: nil channels are useful in some conditions and should be part of the Go developerâs toolset when dealing with concurrent code.
\n
\n\n\nTL;DR \nDecida cuidadosamente o tipo de canal correto a ser usado, considerando o problema. Somente canais sem buffer oferecem fortes garantias de sincronização. Para canais em buffer, você deve ter um bom motivo para especificar um tamanho de canal diferente de um.
\n \nAn unbuffered channel is a channel without any capacity. It can be created by either omitting the size or providing a 0 size:
\nch1 := make ( chan int ) \nch2 := make ( chan int , 0 ) \nWith an unbuffered channel (sometimes called a synchronous channel), the sender will block until the receiver receives data from the channel.
\nConversely, a buffered channel has a capacity, and it must be created with a size greater than or equal to 1:
\nch3 := make ( chan int , 1 ) \nWith a buffered channel, a sender can send messages while the channel isnât full. Once the channel is full, it will block until a receiver goroutine receives a message:
\nch3 := make ( chan int , 1 ) \nch3 <- 1 // Non-blocking \nch3 <- 2 // Blocking \nThe first send isnât blocking, whereas the second one is, as the channel is full at this stage.
\nWhat's the main difference between unbuffered and buffered channels:
\n\nAn unbuffered channel enables synchronization. We have the guarantee that two goroutines will be in a known state: one receiving and another sending a message. \nA buffered channel doesnât provide any strong synchronization. Indeed, a producer goroutine can send a message and then continue its execution if the channel isnât full. The only guarantee is that a goroutine wonât receive a message before it is sent. But this is only a guarantee because of causality (you donât drink your coffee before you prepare it). \n \nIf we need a buffered channel, what size should we provide?
\nThe default value we should use for buffered channels is its minimum: 1. So, we may approach the problem from this standpoint: is there any good reason not to use a value of 1? Hereâs a list of possible cases where we should use another size:
\n\nWhile using a worker pooling-like pattern, meaning spinning a fixed number of goroutines that need to send data to a shared channel. In that case, we can tie the channel size to the number of goroutines created. \nWhen using channels for rate-limiting problems. For example, if we need to enforce resource utilization by bounding the number of requests, we should set up the channel size according to the limit. \n \nIf we are outside of these cases, using a different channel size should be done cautiously. Letâs bear in mind that deciding about an accurate queue size isnât an easy problem:
\n\n
Martin Thompson
\n
Queues are typically always close to full or close to empty due to the differences in pace between consumers and producers. They very rarely operate in a balanced middle ground where the rate of production and consumption is evenly matched.
\n
\nTL;DR \nEstar ciente de que a formatação de strings pode levar Ă chamada de funçþes existentes significa estar atento a possĂveis impasses e outras disputas de dados.
\n \nItâs pretty easy to forget the potential side effects of string formatting while working in a concurrent application.
\netcd data racegithub.com/etcd-io/etcd/pull/7816 shows an example of an issue where a map's key was formatted based on a mutable values from a context.
\nDeadlock \nCan you see what the problem is in this code with a Customer struct exposing an UpdateAge method and implementing the fmt.Stringer interface?
\ntype Customer struct { \n mutex sync . RWMutex // Uses a sync.RWMutex to protect concurrent accesses \n id string \n age int \n} \nfunc ( c * Customer ) UpdateAge ( age int ) error { \n c . mutex . Lock () // Locks and defers unlock as we update Customer \n defer c . mutex . Unlock () \n if age < 0 { // Returns an error if age is negative \n return fmt . Errorf ( \"age should be positive for customer %v\" , c ) \n } \n c . age = age \n return nil \n} \nfunc ( c * Customer ) String () string { \n c . mutex . RLock () // Locks and defers unlock as we read Customer \n defer c . mutex . RUnlock () \n return fmt . Sprintf ( \"id %s, age %d\" , c . id , c . age ) \n} \nThe problem here may not be straightforward. If the provided age is negative, we return an error. Because the error is formatted, using the %s directive on the receiver, it will call the String method to format Customer. But because UpdateAge already acquires the mutex lock, the String method wonât be able to acquire it. Hence, this leads to a deadlock situation. If all goroutines are also asleep, it leads to a panic.
\nOne possible solution is to restrict the scope of the mutex lock:
\nfunc ( c * Customer ) UpdateAge ( age int ) error { \n if age < 0 { \n return fmt . Errorf ( \"age should be positive for customer %v\" , c ) \n } \n c . mutex . Lock () < 1 > \n defer c . mutex . Unlock () \n c . age = age \n return nil \n} \nYet, such an approach isn't always possible. In these conditions, we have to be extremely careful with string formatting.
\nAnother approach is to access the id field directly:
\nfunc ( c * Customer ) UpdateAge ( age int ) error { \n c . mutex . Lock () \n defer c . mutex . Unlock () \n if age < 0 { \n return fmt . Errorf ( \"age should be positive for customer id %s\" , c . id ) \n } \n c . age = age \n return nil \n} \nIn concurrent applications, we should remain cautious about the possible side effects of string formatting.
\n
\n\n\nTL;DR \nAs chamadas append nem sempre sĂŁo isentas de disputa de dados; portanto, nĂŁo deve ser usado simultaneamente em uma slice compartilhada.
\n \nShould adding an element to a slice using append is data-race-free? Spoiler: it depends.
\nDo you believe this example has a data race?
\ns := make ([] int , 1 ) \ngo func () { // In a new goroutine, appends a new element on s \n s1 := append ( s , 1 ) \n fmt . Println ( s1 ) \n}() \ngo func () { // Same \n s2 := append ( s , 1 ) \n fmt . Println ( s2 ) \n}() \nThe answer is no.
\nIn this example, we create a slice with make([]int, 1). The code creates a one-length, one-capacity slice. Thus, because the slice is full, using append in each goroutine returns a slice backed by a new array. It doesnât mutate the existing array; hence, it doesnât lead to a data race.
\nNow, letâs run the same example with a slight change in how we initialize s. Instead of creating a slice with a length of 1, we create it with a length of 0 but a capacity of 1. How about this new example? Does it contain a data race?
\ns := make ([] int , 0 , 1 ) \ngo func () { \n s1 := append ( s , 1 ) \n fmt . Println ( s1 ) \n}() \ngo func () { \n s2 := append ( s , 1 ) \n fmt . Println ( s2 ) \n}() \nThe answer is yes. We create a slice with make([]int, 0, 1). Therefore, the array isnât full. Both goroutines attempt to update the same index of the backing array (index 1), which is a data race.
\nHow can we prevent the data race if we want both goroutines to work on a slice containing the initial elements of s plus an extra element? One solution is to create a copy of s.
\nWe should remember that using append on a shared slice in concurrent applications can lead to a data race. Hence, it should be avoided.
\n
\n\n\nTL;DR \nLembrar que slices e maps sĂŁo ponteiros pode evitar corridas comuns de dados.
\n \nLet's implement a Cache struct used to handle caching for customer balances. This struct will contain a map of balances per customer ID and a mutex to protect concurrent accesses:
\ntype Cache struct { \n mu sync . RWMutex \n balances map [ string ] float64 \n} \nNext, we add an AddBalance method that mutates the balances map. The mutation is done in a critical section (within a mutex lock and a mutex unlock):
\nfunc ( c * Cache ) AddBalance ( id string , balance float64 ) { \n c . mu . Lock () \n c . balances [ id ] = balance \n c . mu . Unlock () \n} \nMeanwhile, we have to implement a method to calculate the average balance for all the customers. One idea is to handle a minimal critical section this way:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n balances := c . balances // Creates a copy of the balances map \n c . mu . RUnlock () \n sum := 0. \n for _ , balance := range balances { // Iterates over the copy, outside of the critical section \n sum += balance \n } \n return sum / float64 ( len ( balances )) \n} \nWhat's the problem with this code?
\nIf we run a test using the -race flag with two concurrent goroutines, one calling AddBalance (hence mutating balances) and another calling AverageBalance, a data race occurs. Whatâs the problem here?
\nInternally, a map is a runtime.hmap struct containing mostly metadata (for example, a counter) and a pointer referencing data buckets. So, balances := c.balances doesnât copy the actual data. Therefore, the two goroutines perform operations on the same data set, and one mutates it. Hence, it's a data race.
\nOne possible solution is to protect the whole AverageBalance function:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n defer c . mu . RUnlock () // Unlocks when the function returns \n sum := 0. \n for _ , balance := range c . balances { \n sum += balance \n } \n return sum / float64 ( len ( c . balances )) \n} \nAnother option, if the iteration operation isnât lightweight, is to work on an actual copy of the data and protect only the copy:
\nfunc ( c * Cache ) AverageBalance () float64 { \n c . mu . RLock () \n m := make ( map [ string ] float64 , len ( c . balances )) // Copies the map \n for k , v := range c . balances { \n m [ k ] = v \n } \n c . mu . RUnlock () \n sum := 0. \n for _ , balance := range m { \n sum += balance \n } \n return sum / float64 ( len ( m )) \n} \nOnce we have made a deep copy, we release the mutex. The iterations are done on the copy outside of the critical section.
\nIn summary, we have to be careful with the boundaries of a mutex lock. In this section, we have seen why assigning an existing map (or an existing slice) to a map isnât enough to protect against data races. The new variable, whether a map or a slice, is backed by the same data set. There are two leading solutions to prevent this: protect the whole function, or work on a copy of the actual data. In all cases, letâs be cautious when designing critical sections and make sure the boundaries are accurately defined.
\n
\nUso indevido sync.WaitGroup (#71) \n\nTL;DR \nPara usar com precisĂŁo sync.WaitGroup, chame o mĂŠtodo Add antes de ativar goroutines.
\n \n
\nEsquecendo sync.Cond (#72) \n\nTL;DR \nVocê pode enviar notificaçþes repetidas para vårios goroutines com sync.Cond.
\n \n
\nNĂŁo usando errgroup (#73) \n\nTL;DR \nVocĂŞ pode sincronizar um grupo de goroutines e lidar com erros e contextos com o pacote errgroup.
\n \n
\nCopiando um tipo sync (#74) \n\nTL;DR \nTipos sync nĂŁo devem ser copiados.
\n \n
\nStandard Library \nFornecendo uma duração de tempo errada (#75) \n\nTL;DR \nSeja cauteloso com funçþes que aceitam um arquivo time.Duration. Mesmo que a passagem de um nĂşmero inteiro seja permitida, tente usar a API time para evitar qualquer possĂvel confusĂŁo.
\n \nMany common functions in the standard library accept a time.Duration, which is an alias for the int64 type. However, one time.Duration unit represents one nanosecond, instead of one millisecond, as commonly seen in other programming languages. As a result, passing numeric types instead of using the time.Duration API can lead to unexpected behavior.
\nA developer with experience in other languages might assume that the following code creates a new time.Ticker that delivers ticks every second, given the value 1000:
\nticker := time . NewTicker ( 1000 ) \nfor { \n select { \n case <- ticker . C : \n // Do something \n } \n} \nHowever, because 1,000 time.Duration units = 1,000 nanoseconds, ticks are delivered every 1,000 nanoseconds = 1 microsecond, not every second as assumed.
\nWe should always use the time.Duration API to avoid confusion and unexpected behavior:\n
ticker = time . NewTicker ( time . Microsecond ) \n// Or \nticker = time . NewTicker ( 1000 * time . Nanosecond ) \n
\n
\ntime.After e vazamentos de memória (#76)\nTL;DR \nEvitar chamadas para funçþes time.After repetidas (como loops ou manipuladores HTTP) pode evitar pico de consumo de memória. Os recursos criados por time.After são liberados somente quando o cronômetro expira.
\n \nDevelopers often use time.After in loops or HTTP handlers repeatedly to implement the timing function. But it can lead to unintended peak memory consumption due to the delayed release of resources, just like the following code:
\nfunc consumer ( ch <- chan Event ) { \n for { \n select { \n case event := <- ch : \n handle ( event ) \n case <- time . After ( time . Hour ): \n log . Println ( \"warning: no messages received\" ) \n } \n } \n} \nThe source code of the function time.After is as follows:
\nfunc After ( d Duration ) <- chan Time { \n return NewTimer ( d ). C \n} \nAs we see, it returns receive-only channel.
\nWhen time.After is used in a loop or repeated context, a new channel is created in each iteration. If these channels are not properly closed or if their associated timers are not stopped, they can accumulate and consume memory. The resources associated with each timer and channel are only released when the timer expires or the channel is closed.
\nTo avoid this happening, We can use context's timeout setting instead of time.After, like below:
\nfunc consumer ( ch <- chan Event ) { \n for { \n ctx , cancel := context . WithTimeout ( context . Background (), time . Hour ) \n select { \n case event := <- ch : \n cancel () \n handle ( event ) \n case <- ctx . Done (): \n log . Println ( \"warning: no messages received\" ) \n } \n } \n} \nWe can also use time.NewTimer like so:
\nfunc consumer ( ch <- chan Event ) { \n timerDuration := 1 * time . Hour \n timer := time . NewTimer ( timerDuration ) \n for { \n timer . Reset ( timerDuration ) \n select { \n case event := <- ch : \n handle ( event ) \n case <- timer . C : \n log . Println ( \"warning: no messages received\" ) \n } \n } \n} \n
\n\n\nComportamento inesperado devido à incorporação de tipo \n \nTenha cuidado ao usar campos incorporados em estruturas Go. Fazer isso pode levar a bugs sorrateiros, como um campo time.Time incorporado que implementa a interface json.Marshaler, substituindo assim o comportamento de empacotamento padrão.
\n
\n\nJSON e o relógio monotônico \n \nAo comparar duas estruturas time.Time, lembre-se de que time.Time contÊm um relógio de parede e um relógio monotônico, e a comparação usando o operador == Ê feita em ambos os relógios.
\n
\n\nPara evitar suposiçþes erradas ao fornecer um map ao desempacotar (unmarshaling) dados JSON, lembre-se de que os valores numÊricos são convertidos para float64 por padrão.
\n
\nErros comuns de SQL (#78) \n\nEsquecer sql.Open nĂŁo necessariamente estabelece conexĂľes com um banco de dados \n \nEsquecer sql.Open nĂŁo necessariamente estabelece conexĂľes com um banco de dados\n Chame o mĂŠtodo Ping ou PingContext se precisar testar sua configuração e garantir que um banco de dados esteja acessĂvel.
\n
\n\nEsquecendo o pool de conexĂľes \n \nConfigure os parâmetros de conexĂŁo do banco de dados para aplicativos de nĂvel de produção.
\n\nNão usar declaraçþes preparadas \n \nO uso de instruçþes preparadas em SQL torna as consultas mais eficientes e seguras.
\n
\n\nTratamento incorreto de valores nulos \n \nLide com colunas anulĂĄveis ââem tabelas usando ponteiros ou tipos sql.NullXXX.
\n
\n\nNão tratando de erros de iteração de linhas \n \nChame o mÊtodo Err de sql.Rows iteraçþes posteriores à linha para garantir que você não perdeu nenhum erro ao preparar a próxima linha.
\n
\nNĂŁo fechando recursos transitĂłrios (body HTTP, sql.Rows e os.File) (#79) \n\nTL;DR \nEventualmente feche todas as estruturas implementadas io.Closer para evitar possĂveis vazamentos.
\n \n
\nEsquecendo a instrução return após responder a uma solicitação HTTP (#80) \n\nTL;DR \nPara evitar comportamentos inesperados nas implementaçþes do manipulador HTTP, certifique-se de não perder a instrução return se quiser que um manipulador pare após http.Error.
\n \nConsider the following HTTP handler that handles an error from foo using http.Error:
\nfunc handler ( w http . ResponseWriter , req * http . Request ) { \n err := foo ( req ) \n if err != nil { \n http . Error ( w , \"foo\" , http . StatusInternalServerError ) \n } \n _ , _ = w . Write ([] byte ( \"all good\" )) \n w . WriteHeader ( http . StatusCreated ) \n} \nIf we run this code and err != nil, the HTTP response would be:
\n\nThe response contains both the error and success messages, and also the first HTTP status code, 500. There would also be a warning log indicating that we attempted to write the status code multiple times:
\nThe mistake in this code is that http.Error does not stop the handler's execution, which means the success message and status code get written in addition to the error. Beyond an incorrect response, failing to return after writing an error can lead to the unwanted execution of code and unexpected side-effects. The following code adds the return statement following the http.Error and exhibits the desired behavior when ran:
\nfunc handler ( w http . ResponseWriter , req * http . Request ) { \n err := foo ( req ) \n if err != nil { \n http . Error ( w , \"foo\" , http . StatusInternalServerError ) \n return // Adds the return statement \n } \n _ , _ = w . Write ([] byte ( \"all good\" )) \n w . WriteHeader ( http . StatusCreated ) \n} \n
\nUsando o cliente e servidor HTTP padrĂŁo (#81) \n\nTL;DR \nPara aplicativos de nĂvel de produção, nĂŁo use as implementaçþes de cliente e servidor HTTP padrĂŁo. Essas implementaçþes nĂŁo possuem tempos limite e comportamentos que deveriam ser obrigatĂłrios na produção.
\n \n
\nTeste \n\n\nTL;DR \nCategorizar testes usando sinalizadores de construção, variĂĄveis ââde ambiente ou modo curto torna o processo de teste mais eficiente. VocĂŞ pode criar categorias de teste usando sinalizadores de construção ou variĂĄveis ââde ambiente (por exemplo, testes de unidade versus testes de integração) e diferenciar testes curtos de testes de longa duração para decidir quais tipos de testes executar.
\n \n
\nNĂŁo habilitando a bandeira de corrida (#83) \n\nTL;DR \nA ativação do sinalizador -race ĂŠ altamente recomendada ao escrever aplicativos simultâneos. Isso permite que vocĂŞ detecte possĂveis corridas de dados que podem levar a bugs de software.
\n \nIn Go, the race detector isnât a static analysis tool used during compilation; instead, itâs a tool to find data races that occur at runtime. To enable it, we have to enable the -race flag while compiling or running a test. For example:
\n\nOnce the race detector is enabled, the compiler instruments the code to detect data races. Instrumentation refers to a compiler adding extra instructions: here, tracking all memory accesses and recording when and how they occur.
\nEnabling the race detector adds an overhead in terms of memory and execution time; hence, it's generally recommended to enable it only during local testing or continuous integration, not production.
\nIf a race is detected, Go raises a warning. For example:
\npackage main \nimport ( \n \"fmt\" \n) \nfunc main () { \n i := 0 \n go func () { i ++ }() \n fmt . Println ( i ) \n} \nRunnig this code with the -race logs the following warning:
\n================== \n DATA RACE\nWrite at 0x00c000026078 by goroutine 7 : # (1) \n main.main.func1() \n /tmp/app/main.go:9 +0x4e\nPrevious read at 0x00c000026078 by main goroutine: # (2) \n main.main() \n /tmp/app/main.go:10 +0x88\nGoroutine 7 ( running) created at: # (3) \n main.main() \n /tmp/app/main.go:9 +0x7a\n================== \n\nIndicates that goroutine 7 was writing \nIndicates that the main goroutine was reading \nIndicates when the goroutine 7 was created \n \nLetâs make sure we are comfortable reading these messages. Go always logs the following:
\n\nThe concurrent goroutines that are incriminated: here, the main goroutine and goroutine 7. \nWhere accesses occur in the code: in this case, lines 9 and 10. \nWhen these goroutines were created: goroutine 7 was created in main(). \n \nIn addition, if a specific file contains tests that lead to data races, we can exclude it !race build tag:
\n//go:build !race \npackage main \nimport ( \n \"testing\" \n) \nfunc TestFoo ( t * testing . T ) { \n // ... \n} \nNão usar modos de execução de teste (paralelo e aleatório) (#84) \n\nTL;DR \nUsar o sinalizador -parallel Ê uma forma eficiente de acelerar testes, especialmente os de longa duração. Use o sinalizador -shuffle para ajudar a garantir que um conjunto de testes não se baseie em suposiçþes erradas que possam ocultar bugs.
\n \nNão usar testes baseados em tabela (#85) \n\nTL;DR \nOs testes baseados em tabelas são uma maneira eficiente de agrupar um conjunto de testes semelhantes para evitar a duplicação de código e facilitar o manuseio de atualizaçþes futuras.
\n \n
\nDormindo em testes unitĂĄrios (#86) \n\nTL;DR \nEvite interrupçþes usando a sincronização para tornar o teste menos instĂĄvel e mais robusto. Se a sincronização nĂŁo for possĂvel, considere uma abordagem de nova tentativa.
\n \n
\n\n\nTL;DR \nEntender como lidar com funçþes usando a API time Ê outra maneira de tornar um teste menos complicado. Você pode usar tÊcnicas padrão, como lidar com o tempo como parte de uma dependência oculta ou solicitar que os clientes o forneçam.
\n \n
\nNĂŁo usar pacotes de utilitĂĄrios de teste ( httptest e iotest) (#88) \n\nO pacote httptest ĂŠ Ăştil para lidar com aplicativos HTTP. Ele fornece um conjunto de utilitĂĄrios para testar clientes e servidores. \n \n
\n\nO pacote iotest ajuda a escrever io.Reader e testar se um aplicativo ĂŠ tolerante a erros. \n \n
\nEscrevendo benchmarks imprecisos (#89) \n\nTL;DR \nRegarding benchmarks:
\n\nUse mĂŠtodos de tempo para preservar a precisĂŁo de um benchmark. \nAumentar o tempo de teste ou usar ferramentas como o benchstat pode ser Ăştil ao lidar com micro-benchmarks. \nTenha cuidado com os resultados de um micro-benchmark se o sistema que executa o aplicativo for diferente daquele que executa o micro-benchmark. \nCertifique-se de que a função em teste cause um efeito colateral, para evitar que as otimizaçþes do compilador enganem vocĂŞ sobre os resultados do benchmark. \nPara evitar o efeito observador, force um benchmark a recriar os dados usados ââpor uma função vinculada Ă CPU. \n \n \nLeia a seção completa aqui .
\n
\nNão explorando todos os recursos de teste do Go (#90) \n\nUse a cobertura de código com o sinalizador -coverprofile para ver rapidamente qual parte do código precisa de mais atenção.
\n\nTestando de um pacote diferente \n \nColoque os testes unitĂĄrios em um pacote diferente para impor testes de escrita que se concentrem em um comportamento exposto, nĂŁo em internos.
\n
\n\nFunçþes utilitårias \n \nO tratamento de erros usando a variåvel *testing.T em vez do clåssico if err != nil torna o código mais curto e fåcil de ler.
\n
\n\nConfiguração e desmontagem \n \nVocê pode usar funçþes de setup e teardown para configurar um ambiente complexo, como no caso de testes de integração.
\n
\nNão usar fuzzing (erro da comunidade) \n\nTL;DR \nFuzzing Ê uma estratÊgia eficiente para detectar entradas aleatórias, inesperadas ou malformadas em funçþes e mÊtodos complexos, a fim de descobrir vulnerabilidades, bugs ou atÊ mesmo travamentos potenciais.
\n \nCredits: @jeromedoucet
\nOtimizaçþes \nNão entendendo os caches da CPU (#91) \n\nCompreender como usar caches de CPU Ê importante para otimizar aplicativos vinculados à CPU porque o cache L1 Ê cerca de 50 a 100 vezes mais råpido que a memória principal.
\n\nEstar consciente do conceito de linha de cache ĂŠ fundamental para entender como organizar dados em aplicativos com uso intensivo de dados. Uma CPU nĂŁo busca memĂłria palavra por palavra; em vez disso, geralmente copia um bloco de memĂłria para uma linha de cache de 64 bytes. Para aproveitar ao mĂĄximo cada linha de cache individual, imponha a localidade espacial.
\n
\n\nSlice de estruturas vs. estrutura de slices \n \n\n\n
\n\nTornar o cĂłdigo previsĂvel para a CPU tambĂŠm pode ser uma forma eficiente de otimizar certas funçþes. Por exemplo, uma passada unitĂĄria ou constante ĂŠ previsĂvel para a CPU, mas uma passada nĂŁo unitĂĄria (por exemplo, uma lista vinculada) nĂŁo ĂŠ previsĂvel.
\n
\n\nPolĂtica de posicionamento de cache \n \nPara evitar um avanço crĂtico e, portanto, utilizar apenas uma pequena parte do cache, esteja ciente de que os caches sĂŁo particionados.
\nEscrevendo cĂłdigo simultâneo que leva a compartilhamento falso (#92) \n\nTL;DR \nSaber que nĂveis mais baixos de caches de CPU nĂŁo sĂŁo compartilhados entre todos os nĂşcleos ajuda a evitar padrĂľes que degradam o desempenho, como compartilhamento falso ao escrever cĂłdigo de simultaneidade. Compartilhar memĂłria ĂŠ uma ilusĂŁo.
\n \nLeia a seção completa aqui .
\n
\nNĂŁo levando em consideração o paralelismo no nĂvel de instrução (#93) \n\nTL;DR \nUse o ILP para otimizar partes especĂficas do seu cĂłdigo para permitir que uma CPU execute tantas instruçþes paralelas quanto possĂvel. Identificar perigos nos dados ĂŠ uma das etapas principais.
\n \n
\nNão estar ciente do alinhamento dos dados (#94) \n\nTL;DR \nVocê pode evitar erros comuns lembrando que no Go os tipos båsicos são alinhados com seu próprio tamanho. Por exemplo, tenha em mente que reorganizar os campos de uma estrutura por tamanho em ordem decrescente pode levar a estruturas mais compactas (menos alocação de memória e potencialmente uma melhor localidade espacial).
\n \n
\nNão entendendo stack vs. heap (#95) \n\nTL;DR \nCompreender as diferenças fundamentais entre heap e pilha tambÊm deve fazer parte do seu conhecimento båsico ao otimizar um aplicativo Go. As alocaçþes de pilha são quase gratuitas, enquanto as alocaçþes de heap são mais lentas e dependem do GC para limpar a memória.
\n \n
\nNão saber como reduzir alocaçþes (mudança de API, otimizaçþes de compilador e sync.Pool) (#96) \n\nTL;DR \nA redução das alocaçþes tambÊm Ê um aspecto essencial da otimização de um aplicativo Go. Isso pode ser feito de diferentes maneiras, como projetar a API cuidadosamente para evitar compartilhamento, compreender as otimizaçþes comuns do compilador Go e usar sync.Pool.
\n \n
\nNão dependendo do inlining (#97) \n\nTL;DR \nUse a tÊcnica de inlining de caminho råpido para reduzir com eficiência o tempo amortizado para chamar uma função.
\n \nNão usar ferramentas de diagnóstico Go (#98) \n\nTL;DR \nConfie na criação de perfil e no rastreador de execução para entender o desempenho de um aplicativo e as partes a serem otimizadas.
\n \nLeia a seção completa aqui .
\nNĂŁo entendendo como funciona o GC (#99) \n\nTL;DR \nCompreender como ajustar o GC pode levar a vĂĄrios benefĂcios, como lidar com aumentos repentinos de carga com mais eficiĂŞncia.
\n \nNão entendendo os impactos da execução do Go no Docker e Kubernetes (#100) \n\nTL;DR \nPara ajudar a evitar a limitação da CPU quando implantado no Docker e no Kubernetes, lembre-se de que Go não reconhece CFS .
\n \nBy default, GOMAXPROCS is set to the number of OS-apparent logical CPU cores.
\nWhen running some Go code inside Docker and Kubernetes, we must know that Go isn't CFS -aware (github.com/golang/go/issues/33803 ). Therefore, GOMAXPROCS isn't automatically set to the value of spec.containers.resources.limits.cpu (see Kubernetes Resource Management for Pods and Containers ); instead, it's set to the number of logical cores on the host machine. The main implication is that it can lead to an increased tail latency in some specific situations.
\nOne solution is to rely on uber-go/automaxprocs that automatically set GOMAXPROCS to match the Linux container CPU quota.
\n\nThanks to all the contributors:
\n\n
\n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n\n\n\n\n\n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
If you enjoyed my book, you may be interested in my latest project: The Coder Cafe, a newsletter for coders.
Feeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve timeless concepts with your coffee. Written by a Google SWE and published author, we help you grow as an engineer, one coffee at a time.
This page is a summary of the mistakes in the 100 Go Mistakes and How to Avoid Them book. Meanwhile, it's also open to the community. If you believe that a common Go mistake should be added, please create an issue.
Beta You're viewing a beta version enriched with significantly more content. However, this version is not yet complete, and I'm looking for volunteers to help me summarize the remaining mistakes (GitHub issue #43).
Progress:
\"},{\"location\":\"#code-and-project-organization\",\"title\":\"Code and Project Organization\",\"text\":\"\"},{\"location\":\"#unintended-variable-shadowing-1\",\"title\":\"Unintended variable shadowing (#1)\",\"text\":\"TL;DR Avoiding shadowed variables can help prevent mistakes like referencing the wrong variable or confusing readers.
Variable shadowing occurs when a variable name is redeclared in an inner block, but this practice is prone to mistakes. Imposing a rule to forbid shadowed variables depends on personal taste. For example, sometimes it can be convenient to reuse an existing variable name like err for errors. Yet, in general, we should remain cautious because we now know that we can face a scenario where the code compiles, but the variable that receives the value is not the one expected.
Source code
\"},{\"location\":\"#unnecessary-nested-code-2\",\"title\":\"Unnecessary nested code (#2)\",\"text\":\"TL;DR Avoiding nested levels and keeping the happy path aligned on the left makes building a mental code model easier.
In general, the more nested levels a function requires, the more complex it is to read and understand. Let\\u2019s see some different applications of this rule to optimize our code for readability:
When an if block returns, we should omit the else block in all cases. For example, we shouldn\\u2019t write: if foo() {\\n // ...\\n return true\\n} else {\\n // ...\\n}\\nInstead, we omit the else block like this:
if foo() {\\n // ...\\n return true\\n}\\n// ...\\n We can also follow this logic with a non-happy path: if s != \\\"\\\" {\\n // ...\\n} else {\\n return errors.New(\\\"empty string\\\")\\n}\\nHere, an empty s represents the non-happy path. Hence, we should flip the condition like so:
if s == \\\"\\\" {\\n return errors.New(\\\"empty string\\\")\\n}\\n// ...\\nWriting readable code is an important challenge for every developer. Striving to reduce the number of nested blocks, aligning the happy path on the left, and returning as early as possible are concrete means to improve our code\\u2019s readability.
Source code
\"},{\"location\":\"#misusing-init-functions-3\",\"title\":\"Misusing init functions (#3)\",\"text\":\"TL;DR When initializing variables, remember that init functions have limited error handling and make state handling and testing more complex. In most cases, initializations should be handled as specific functions.
An init function is a function used to initialize the state of an application. It takes no arguments and returns no result (a func() function). When a package is initialized, all the constant and variable declarations in the package are evaluated. Then, the init functions are executed.
Init functions can lead to some issues:
They can limit error management. They can complicate how to implement tests (for example, an external dependency must be set up, which may not be necessary for the scope of unit tests). If the initialization requires us to set a state, that has to be done through global variables. We should be cautious with init functions. They can be helpful in some situations, however, such as defining static configuration. Otherwise, and in most cases, we should handle initializations through ad hoc functions.
Source code
\"},{\"location\":\"#overusing-getters-and-setters-4\",\"title\":\"Overusing getters and setters (#4)\",\"text\":\"TL;DR Forcing the use of getters and setters isn\\u2019t idiomatic in Go. Being pragmatic and finding the right balance between efficiency and blindly following certain idioms should be the way to go.
Data encapsulation refers to hiding the values or state of an object. Getters and setters are means to enable encapsulation by providing exported methods on top of unexported object fields.
In Go, there is no automatic support for getters and setters as we see in some languages. It is also considered neither mandatory nor idiomatic to use getters and setters to access struct fields. We shouldn\\u2019t overwhelm our code with getters and setters on structs if they don\\u2019t bring any value. We should be pragmatic and strive to find the right balance between efficiency and following idioms that are sometimes considered indisputable in other programming paradigms.
Remember that Go is a unique language designed for many characteristics, including simplicity. However, if we find a need for getters and setters or, as mentioned, foresee a future need while guaranteeing forward compatibility, there\\u2019s nothing wrong with using them.
\"},{\"location\":\"#interface-pollution-5\",\"title\":\"Interface pollution (#5)\",\"text\":\"TL;DR Abstractions should be discovered, not created. To prevent unnecessary complexity, create an interface when you need it and not when you foresee needing it, or if you can at least prove the abstraction to be a valid one.
Read the full section here.
Source code
\"},{\"location\":\"#interface-on-the-producer-side-6\",\"title\":\"Interface on the producer side (#6)\",\"text\":\"TL;DR Keeping interfaces on the client side avoids unnecessary abstractions.
Interfaces are satisfied implicitly in Go, which tends to be a gamechanger compared to languages with an explicit implementation. In most cases, the approach to follow is similar to what we described in the previous section: abstractions should be discovered, not created. This means that it\\u2019s not up to the producer to force a given abstraction for all the clients. Instead, it\\u2019s up to the client to decide whether it needs some form of abstraction and then determine the best abstraction level for its needs.
An interface should live on the consumer side in most cases. However, in particular contexts (for example, when we know\\u2014not foresee\\u2014that an abstraction will be helpful for consumers), we may want to have it on the producer side. If we do, we should strive to keep it as minimal as possible, increasing its reusability potential and making it more easily composable.
Source code
\"},{\"location\":\"#returning-interfaces-7\",\"title\":\"Returning interfaces (#7)\",\"text\":\"TL;DR To prevent being restricted in terms of flexibility, a function shouldn\\u2019t return interfaces but concrete implementations in most cases. Conversely, a function should accept interfaces whenever possible.
In most cases, we shouldn\\u2019t return interfaces but concrete implementations. Otherwise, it can make our design more complex due to package dependencies and can restrict flexibility because all the clients would have to rely on the same abstraction. Again, the conclusion is similar to the previous sections: if we know (not foresee) that an abstraction will be helpful for clients, we can consider returning an interface. Otherwise, we shouldn\\u2019t force abstractions; they should be discovered by clients. If a client needs to abstract an implementation for whatever reason, it can still do that on the client\\u2019s side.
\"},{\"location\":\"#any-says-nothing-8\",\"title\":\"any says nothing (#8)\",\"text\":\"TL;DR Only use any if you need to accept or return any possible type, such as json.Marshal. Otherwise, any doesn\\u2019t provide meaningful information and can lead to compile-time issues by allowing a caller to call methods with any data type.
The any type can be helpful if there is a genuine need for accepting or returning any possible type (for instance, when it comes to marshaling or formatting). In general, we should avoid overgeneralizing the code we write at all costs. Perhaps a little bit of duplicated code might occasionally be better if it improves other aspects such as code expressiveness.
Source code
\"},{\"location\":\"#being-confused-about-when-to-use-generics-9\",\"title\":\"Being confused about when to use generics (#9)\",\"text\":\"TL;DR Relying on generics and type parameters can prevent writing boilerplate code to factor out elements or behaviors. However, do not use type parameters prematurely, but only when you see a concrete need for them. Otherwise, they introduce unnecessary abstractions and complexity.
Read the full section here.
Source code
\"},{\"location\":\"#not-being-aware-of-the-possible-problems-with-type-embedding-10\",\"title\":\"Not being aware of the possible problems with type embedding (#10)\",\"text\":\"TL;DR Using type embedding can also help avoid boilerplate code; however, ensure that doing so doesn\\u2019t lead to visibility issues where some fields should have remained hidden.
When creating a struct, Go offers the option to embed types. But this can sometimes lead to unexpected behaviors if we don\\u2019t understand all the implications of type embedding. Throughout this section, we look at how to embed types, what these bring, and the possible issues.
In Go, a struct field is called embedded if it\\u2019s declared without a name. For example,
type Foo struct {\\n Bar // Embedded field\\n}\\n\\ntype Bar struct {\\n Baz int\\n}\\nIn the Foo struct, the Bar type is declared without an associated name; hence, it\\u2019s an embedded field.
We use embedding to promote the fields and methods of an embedded type. Because Bar contains a Baz field, this field is promoted to Foo. Therefore, Baz becomes available from Foo.
What can we say about type embedding? First, let\\u2019s note that it\\u2019s rarely a necessity, and it means that whatever the use case, we can probably solve it as well without type embedding. Type embedding is mainly used for convenience: in most cases, to promote behaviors.
If we decide to use type embedding, we need to keep two main constraints in mind:
It shouldn\\u2019t be used solely as some syntactic sugar to simplify accessing a field (such as Foo.Baz() instead of Foo.Bar.Baz()). If this is the only rationale, let\\u2019s not embed the inner type and use a field instead. It shouldn\\u2019t promote data (fields) or a behavior (methods) we want to hide from the outside: for example, if it allows clients to access a locking behavior that should remain private to the struct. Using type embedding consciously by keeping these constraints in mind can help avoid boilerplate code with additional forwarding methods. However, let\\u2019s make sure we don\\u2019t do it solely for cosmetics and not promote elements that should remain hidden.
Source code
\"},{\"location\":\"#not-using-the-functional-options-pattern-11\",\"title\":\"Not using the functional options pattern (#11)\",\"text\":\"TL;DR To handle options conveniently and in an API-friendly manner, use the functional options pattern.
Although there are different implementations with minor variations, the main idea is as follows:
An unexported struct holds the configuration: options. Each option is a function that returns the same type: type Option func(options *options) error. For example, WithPort accepts an int argument that represents the port and returns an Option type that represents how to update the options struct.
type options struct {\\n port *int\\n}\\n\\ntype Option func(options *options) error\\n\\nfunc WithPort(port int) Option {\\n return func(options *options) error {\\n if port < 0 {\\n return errors.New(\\\"port should be positive\\\")\\n }\\n options.port = &port\\n return nil\\n }\\n}\\n\\nfunc NewServer(addr string, opts ...Option) ( *http.Server, error) {\\n var options options\\n for _, opt := range opts {\\n err := opt(&options)\\n if err != nil {\\n return nil, err\\n }\\n }\\n\\n // At this stage, the options struct is built and contains the config\\n // Therefore, we can implement our logic related to port configuration\\n var port int\\n if options.port == nil {\\n port = defaultHTTPPort\\n } else {\\n if *options.port == 0 {\\n port = randomPort()\\n } else {\\n port = *options.port\\n }\\n }\\n\\n // ...\\n}\\nThe functional options pattern provides a handy and API-friendly way to handle options. Although the builder pattern can be a valid option, it has some minor downsides (having to pass a config struct that can be empty or a less handy way to handle error management) that tend to make the functional options pattern the idiomatic way to deal with these kind of problems in Go.
Source code
\"},{\"location\":\"#project-misorganization-project-structure-and-package-organization-12\",\"title\":\"Project misorganization (project structure and package organization) (#12)\",\"text\":\"Regarding the overall organization, there are different schools of thought. For example, should we organize our application by context or by layer? It depends on our preferences. We may favor grouping code per context (such as the customer context, the contract context, etc.), or we may favor following hexagonal architecture principles and group per technical layer. If the decision we make fits our use case, it cannot be a wrong decision, as long as we remain consistent with it.
Regarding packages, there are multiple best practices that we should follow. First, we should avoid premature packaging because it might cause us to overcomplicate a project. Sometimes, it\\u2019s better to use a simple organization and have our project evolve when we understand what it contains rather than forcing ourselves to make the perfect structure up front. Granularity is another essential thing to consider. We should avoid having dozens of nano packages containing only one or two files. If we do, it\\u2019s because we have probably missed some logical connections across these packages, making our project harder for readers to understand. Conversely, we should also avoid huge packages that dilute the meaning of a package name.
Package naming should also be considered with care. As we all know (as developers), naming is hard. To help clients understand a Go project, we should name our packages after what they provide, not what they contain. Also, naming should be meaningful. Therefore, a package name should be short, concise, expressive, and, by convention, a single lowercase word.
Regarding what to export, the rule is pretty straightforward. We should minimize what should be exported as much as possible to reduce the coupling between packages and keep unnecessary exported elements hidden. If we are unsure whether to export an element or not, we should default to not exporting it. Later, if we discover that we need to export it, we can adjust our code. Let\\u2019s also keep in mind some exceptions, such as making fields exported so that a struct can be unmarshaled with encoding/json.
Organizing a project isn\\u2019t straightforward, but following these rules should help make it easier to maintain. However, remember that consistency is also vital to ease maintainability. Therefore, let\\u2019s make sure that we keep things as consistent as possible within a codebase.
Note In 2023, the Go team has published an official guideline for organizing / structuring a Go project: go.dev/doc/modules/layout
\"},{\"location\":\"#creating-utility-packages-13\",\"title\":\"Creating utility packages (#13)\",\"text\":\"TL;DR Naming is a critical piece of application design. Creating packages such as common, util, and shared doesn\\u2019t bring much value for the reader. Refactor such packages into meaningful and specific package names.
Also, bear in mind that naming a package after what it provides and not what it contains can be an efficient way to increase its expressiveness.
Source code
\"},{\"location\":\"#ignoring-package-name-collisions-14\",\"title\":\"Ignoring package name collisions (#14)\",\"text\":\"TL;DR To avoid naming collisions between variables and packages, leading to confusion or perhaps even bugs, use unique names for each one. If this isn\\u2019t feasible, use an import alias to change the qualifier to differentiate the package name from the variable name, or think of a better name.
Package collisions occur when a variable name collides with an existing package name, preventing the package from being reused. We should prevent variable name collisions to avoid ambiguity. If we face a collision, we should either find another meaningful name or use an import alias.
\"},{\"location\":\"#missing-code-documentation-15\",\"title\":\"Missing code documentation (#15)\",\"text\":\"TL;DR To help clients and maintainers understand your code\\u2019s purpose, document exported elements.
Documentation is an important aspect of coding. It simplifies how clients can consume an API but can also help in maintaining a project. In Go, we should follow some rules to make our code idiomatic:
First, every exported element must be documented. Whether it is a structure, an interface, a function, or something else, if it\\u2019s exported, it must be documented. The convention is to add comments, starting with the name of the exported element.
As a convention, each comment should be a complete sentence that ends with punctuation. Also bear in mind that when we document a function (or a method), we should highlight what the function intends to do, not how it does it; this belongs to the core of a function and comments, not documentation. Furthermore, the documentation should ideally provide enough information that the consumer does not have to look at our code to understand how to use an exported element.
When it comes to documenting a variable or a constant, we might be interested in conveying two aspects: its purpose and its content. The former should live as code documentation to be useful for external clients. The latter, though, shouldn\\u2019t necessarily be public.
To help clients and maintainers understand a package\\u2019s scope, we should also document each package. The convention is to start the comment with // Package followed by the package name. The first line of a package comment should be concise. That\\u2019s because it will appear in the package. Then, we can provide all the information we need in the following lines.
Documenting our code shouldn\\u2019t be a constraint. We should take the opportunity to make sure it helps clients and maintainers to understand the purpose of our code.
\"},{\"location\":\"#not-using-linters-16\",\"title\":\"Not using linters (#16)\",\"text\":\"TL;DR To improve code quality and consistency, use linters and formatters.
A linter is an automatic tool to analyze code and catch errors. The scope of this section isn\\u2019t to give an exhaustive list of the existing linters; otherwise, it will become deprecated pretty quickly. But we should understand and remember why linters are essential for most Go projects.
However, if you\\u2019re not a regular user of linters, here is a list that you may want to use daily:
https://golang.org/cmd/vet\\u2014A standard Go analyzer https://github.com/kisielk/errcheck\\u2014An error checker https://github.com/fzipp/gocyclo\\u2014A cyclomatic complexity analyzer https://github.com/jgautheron/goconst\\u2014A repeated string constants analyzer Besides linters, we should also use code formatters to fix code style. Here is a list of some code formatters for you to try:
https://golang.org/cmd/gofmt\\u2014A standard Go code formatter https://godoc.org/golang.org/x/tools/cmd/goimports\\u2014A standard Go imports formatter Meanwhile, we should also look at golangci-lint (https://github.com/golangci/golangci-lint). It\\u2019s a linting tool that provides a facade on top of many useful linters and formatters. Also, it allows running the linters in parallel to improve analysis speed, which is quite handy.
Linters and formatters are a powerful way to improve the quality and consistency of our codebase. Let\\u2019s take the time to understand which one we should use and make sure we automate their execution (such as a CI or Git precommit hook).
\"},{\"location\":\"#data-types\",\"title\":\"Data Types\",\"text\":\"\"},{\"location\":\"#creating-confusion-with-octal-literals-17\",\"title\":\"Creating confusion with octal literals (#17)\",\"text\":\"TL;DR When reading existing code, bear in mind that integer literals starting with 0 are octal numbers. Also, to improve readability, make octal integers explicit by prefixing them with 0o.
Octal numbers start with a 0 (e.g., 010 is equal to 8 in base 10). To improve readability and avoid potential mistakes for future code readers, we should make octal numbers explicit using the 0o prefix (e.g., 0o10).
We should also note the other integer literal representations:
Binary\\u2014Uses a 0b or 0B prefix (for example, 0b100 is equal to 4 in base 10) Hexadecimal\\u2014Uses an 0x or 0X prefix (for example, 0xF is equal to 15 in base 10) Imaginary\\u2014Uses an i suffix (for example, 3i) We can also use an underscore character (_) as a separator for readability. For example, we can write 1 billion this way: 1_000_000_000. We can also use the underscore character with other representations (for example, 0b00_00_01).
Source code
\"},{\"location\":\"#neglecting-integer-overflows-18\",\"title\":\"Neglecting integer overflows (#18)\",\"text\":\"TL;DR Because integer overflows and underflows are handled silently in Go, you can implement your own functions to catch them.
In Go, an integer overflow that can be detected at compile time generates a compilation error. For example,
var counter int32 = math.MaxInt32 + 1\\nconstant 2147483648 overflows int32\\nHowever, at run time, an integer overflow or underflow is silent; this does not lead to an application panic. It is essential to keep this behavior in mind, because it can lead to sneaky bugs (for example, an integer increment or addition of positive integers that leads to a negative result).
Source code
\"},{\"location\":\"#not-understanding-floating-points-19\",\"title\":\"Not understanding floating-points (#19)\",\"text\":\"TL;DR Making floating-point comparisons within a given delta can ensure that your code is portable. When performing addition or subtraction, group the operations with a similar order of magnitude to favor accuracy. Also, perform multiplication and division before addition and subtraction.
In Go, there are two floating-point types (if we omit imaginary numbers): float32 and float64. The concept of a floating point was invented to solve the major problem with integers: their inability to represent fractional values. To avoid bad surprises, we need to know that floating-point arithmetic is an approximation of real arithmetic.
For that, we\\u2019ll look at a multiplication example:
var n float32 = 1.0001\\nfmt.Println(n * n)\\nWe may expect this code to print the result of 1.0001 * 1.0001 = 1.00020001, right? However, running it on most x86 processors prints 1.0002, instead.
Because Go\\u2019s float32 and float64 types are approximations, we have to bear a few rules in mind:
When comparing two floating-point numbers, check that their difference is within an acceptable range. When performing additions or subtractions, group operations with a similar order of magnitude for better accuracy. To favor accuracy, if a sequence of operations requires addition, subtraction, multiplication, or division, perform the multiplication and division operations first. Source code
\"},{\"location\":\"#not-understanding-slice-length-and-capacity-20\",\"title\":\"Not understanding slice length and capacity (#20)\",\"text\":\"TL;DR Understanding the difference between slice length and capacity should be part of a Go developer\\u2019s core knowledge. The slice length is the number of available elements in the slice, whereas the slice capacity is the number of elements in the backing array.
Read the full section here.
Source code
\"},{\"location\":\"#inefficient-slice-initialization-21\",\"title\":\"Inefficient slice initialization (#21)\",\"text\":\"TL;DR When creating a slice, initialize it with a given length or capacity if its length is already known. This reduces the number of allocations and improves performance.
While initializing a slice using make, we can provide a length and an optional capacity. Forgetting to pass an appropriate value for both of these parameters when it makes sense is a widespread mistake. Indeed, it can lead to multiple copies and additional effort for the GC to clean the temporary backing arrays. Performance-wise, there\\u2019s no good reason not to give the Go runtime a helping hand.
Our options are to allocate a slice with either a given capacity or a given length. Of these two solutions, we have seen that the second tends to be slightly faster. But using a given capacity and append can be easier to implement and read in some contexts.
Source code
\"},{\"location\":\"#being-confused-about-nil-vs-empty-slice-22\",\"title\":\"Being confused about nil vs. empty slice (#22)\",\"text\":\"TL;DR To prevent common confusions such as when using the encoding/json or the reflect package, you need to understand the difference between nil and empty slices. Both are zero-length, zero-capacity slices, but only a nil slice doesn\\u2019t require allocation.
In Go, there is a distinction between nil and empty slices. A nil slice is equals to nil, whereas an empty slice has a length of zero. A nil slice is empty, but an empty slice isn\\u2019t necessarily nil. Meanwhile, a nil slice doesn\\u2019t require any allocation. We have seen throughout this section how to initialize a slice depending on the context by using
var s []string if we aren\\u2019t sure about the final length and the slice can be empty[]string(nil) as syntactic sugar to create a nil and empty slicemake([]string, length) if the future length is known The last option, []string{}, should be avoided if we initialize the slice without elements. Finally, let\\u2019s check whether the libraries we use make the distinctions between nil and empty slices to prevent unexpected behaviors.
Source code
\"},{\"location\":\"#not-properly-checking-if-a-slice-is-empty-23\",\"title\":\"Not properly checking if a slice is empty (#23)\",\"text\":\"TL;DR To check if a slice doesn\\u2019t contain any element, check its length. This check works regardless of whether the slice is nil or empty. The same goes for maps. To design unambiguous APIs, you shouldn\\u2019t distinguish between nil and empty slices.
To determine whether a slice has elements, we can either do it by checking if the slice is nil or if its length is equal to 0. Checking the length is the best option to follow as it will cover both if the slice is empty or if the slice is nil.
Meanwhile, when designing interfaces, we should avoid distinguishing nil and empty slices, which leads to subtle programming errors. When returning slices, it should make neither a semantic nor a technical difference if we return a nil or empty slice. Both should mean the same thing for the callers. This principle is the same with maps. To check if a map is empty, check its length, not whether it\\u2019s nil.
Source code
\"},{\"location\":\"#not-making-slice-copies-correctly-24\",\"title\":\"Not making slice copies correctly (#24)\",\"text\":\"TL;DR To copy one slice to another using the copy built-in function, remember that the number of copied elements corresponds to the minimum between the two slice\\u2019s lengths.
Copying elements from one slice to another is a reasonably frequent operation. When using copy, we must recall that the number of elements copied to the destination corresponds to the minimum between the two slices\\u2019 lengths. Also bear in mind that other alternatives exist to copy a slice, so we shouldn\\u2019t be surprised if we find them in a codebase.
Source code
\"},{\"location\":\"#unexpected-side-effects-using-slice-append-25\",\"title\":\"Unexpected side effects using slice append (#25)\",\"text\":\"TL;DR Using copy or the full slice expression is a way to prevent append from creating conflicts if two different functions use slices backed by the same array. However, only a slice copy prevents memory leaks if you want to shrink a large slice.
When using slicing, we must remember that we can face a situation leading to unintended side effects. If the resulting slice has a length smaller than its capacity, append can mutate the original slice. If we want to restrict the range of possible side effects, we can use either a slice copy or the full slice expression, which prevents us from doing a copy.
Note s[low:high:max] (full slice expression): This statement creates a slice similar to the one created with s[low:high], except that the resulting slice\\u2019s capacity is equal to max - low.
Source code
\"},{\"location\":\"#slices-and-memory-leaks-26\",\"title\":\"Slices and memory leaks (#26)\",\"text\":\"TL;DR Working with a slice of pointers or structs with pointer fields, you can avoid memory leaks by marking as nil the elements excluded by a slicing operation.
\"},{\"location\":\"#leaking-capacity\",\"title\":\"Leaking capacity\",\"text\":\"Remember that slicing a large slice or array can lead to potential high memory consumption. The remaining space won\\u2019t be reclaimed by the GC, and we can keep a large backing array despite using only a few elements. Using a slice copy is the solution to prevent such a case.
Source code
\"},{\"location\":\"#slice-and-pointers\",\"title\":\"Slice and pointers\",\"text\":\"When we use the slicing operation with pointers or structs with pointer fields, we need to know that the GC won\\u2019t reclaim these elements. In that case, the two options are to either perform a copy or explicitly mark the remaining elements or their fields to nil.
Source code
\"},{\"location\":\"#inefficient-map-initialization-27\",\"title\":\"Inefficient map initialization (#27)\",\"text\":\"TL;DR When creating a map, initialize it with a given length if its length is already known. This reduces the number of allocations and improves performance.
A map provides an unordered collection of key-value pairs in which all the keys are distinct. In Go, a map is based on the hash table data structure. Internally, a hash table is an array of buckets, and each bucket is a pointer to an array of key-value pairs.
If we know up front the number of elements a map will contain, we should create it by providing an initial size. Doing this avoids potential map growth, which is quite heavy computation-wise because it requires reallocating enough space and rebalancing all the elements.
Source code
\"},{\"location\":\"#maps-and-memory-leaks-28\",\"title\":\"Maps and memory leaks (#28)\",\"text\":\"TL;DR A map can always grow in memory, but it never shrinks. Hence, if it leads to some memory issues, you can try different options, such as forcing Go to recreate the map or using pointers.
Read the full section here.
Source code
\"},{\"location\":\"#comparing-values-incorrectly-29\",\"title\":\"Comparing values incorrectly (#29)\",\"text\":\"TL;DR To compare types in Go, you can use the == and != operators if two types are comparable: Booleans, numerals, strings, pointers, channels, and structs are composed entirely of comparable types. Otherwise, you can either use reflect.DeepEqual and pay the price of reflection or use custom implementations and libraries.
It\\u2019s essential to understand how to use == and != to make comparisons effectively. We can use these operators on operands that are comparable:
Booleans\\u2014Compare whether two Booleans are equal. Numerics (int, float, and complex types)\\u2014Compare whether two numerics are equal. Strings\\u2014Compare whether two strings are equal. Channels\\u2014Compare whether two channels were created by the same call to make or if both are nil. Interfaces\\u2014Compare whether two interfaces have identical dynamic types and equal dynamic values or if both are nil. Pointers\\u2014Compare whether two pointers point to the same value in memory or if both are nil. Structs and arrays\\u2014Compare whether they are composed of similar types. Note We can also use the ?, >=, <, and > operators with numeric types to compare values and with strings to compare their lexical order.
If operands are not comparable (e.g., slices and maps), we have to use other options such as reflection. Reflection is a form of metaprogramming, and it refers to the ability of an application to introspect and modify its structure and behavior. For example, in Go, we can use reflect.DeepEqual. This function reports whether two elements are deeply equal by recursively traversing two values. The elements it accepts are basic types plus arrays, structs, slices, maps, pointers, interfaces, and functions. Yet, the main catch is the performance penalty.
If performance is crucial at run time, implementing our custom method might be the best solution. One additional note: we must remember that the standard library has some existing comparison methods. For example, we can use the optimized bytes.Compare function to compare two slices of bytes. Before implementing a custom method, we need to make sure we don\\u2019t reinvent the wheel.
Source code
\"},{\"location\":\"#control-structures\",\"title\":\"Control Structures\",\"text\":\"\"},{\"location\":\"#ignoring-that-elements-are-copied-in-range-loops-30\",\"title\":\"Ignoring that elements are copied in range loops (#30)\",\"text\":\"TL;DR The value element in a range loop is a copy. Therefore, to mutate a struct, for example, access it via its index or via a classic for loop (unless the element or the field you want to modify is a pointer).
A range loop allows iterating over different data structures:
String Array Pointer to an array Slice Map Receiving channel Compared to a classic for loop, a range loop is a convenient way to iterate over all the elements of one of these data structures, thanks to its concise syntax.
Yet, we should remember that the value element in a range loop is a copy. Therefore, if the value is a struct we need to mutate, we will only update the copy, not the element itself, unless the value or field we modify is a pointer. The favored options are to access the element via the index using a range loop or a classic for loop.
Source code
\"},{\"location\":\"#ignoring-how-arguments-are-evaluated-in-range-loops-channels-and-arrays-31\",\"title\":\"Ignoring how arguments are evaluated in range loops (channels and arrays) (#31)\",\"text\":\"TL;DR Understanding that the expression passed to the range operator is evaluated only once before the beginning of the loop can help you avoid common mistakes such as inefficient assignment in channel or slice iteration.
The range loop evaluates the provided expression only once, before the beginning of the loop, by doing a copy (regardless of the type). We should remember this behavior to avoid common mistakes that might, for example, lead us to access the wrong element. For example:
a := [3]int{0, 1, 2}\\nfor i, v := range a {\\n a[2] = 10\\n if i == 2 {\\n fmt.Println(v)\\n }\\n}\\nThis code updates the last index to 10. However, if we run this code, it does not print 10; it prints 2.
Source code
\"},{\"location\":\"#ignoring-the-impacts-of-using-pointer-elements-in-range-loops-32\",\"title\":\"Ignoring the impacts of using pointer elements in range loops (#32)\",\"text\":\"Warning This mistake isn't relevant anymore from Go 1.22 (details).
\"},{\"location\":\"#making-wrong-assumptions-during-map-iterations-ordering-and-map-insert-during-iteration-33\",\"title\":\"Making wrong assumptions during map iterations (ordering and map insert during iteration) (#33)\",\"text\":\"TL;DR To ensure predictable outputs when using maps, remember that a map data structure:
Doesn\\u2019t order the data by keys Doesn\\u2019t preserve the insertion order Doesn\\u2019t have a deterministic iteration order Doesn\\u2019t guarantee that an element added during an iteration will be produced during this iteration Source code
\"},{\"location\":\"#ignoring-how-the-break-statement-works-34\",\"title\":\"Ignoring how the break statement works (#34)\",\"text\":\"TL;DR Using break or continue with a label enforces breaking a specific statement. This can be helpful with switch or select statements inside loops.
A break statement is commonly used to terminate the execution of a loop. When loops are used in conjunction with switch or select, developers frequently make the mistake of breaking the wrong statement. For example:
for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break\\n }\\n}\\nThe break statement doesn\\u2019t terminate the for loop: it terminates the switch statement, instead. Hence, instead of iterating from 0 to 2, this code iterates from 0 to 4: 0 1 2 3 4.
One essential rule to keep in mind is that a break statement terminates the execution of the innermost for, switch, or select statement. In the previous example, it terminates the switch statement.
To break the loop instead of the switch statement, the most idiomatic way is to use a label:
loop:\\n for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break loop\\n }\\n }\\nHere, we associate the loop label with the for loop. Then, because we provide the loop label to the break statement, it breaks the loop, not the switch. Therefore, this new version will print 0 1 2, as we expected.
Source code
\"},{\"location\":\"#using-defer-inside-a-loop-35\",\"title\":\"Using defer inside a loop (#35)\",\"text\":\"TL;DR Extracting loop logic inside a function leads to executing a defer statement at the end of each iteration.
The defer statement delays a call\\u2019s execution until the surrounding function returns. It\\u2019s mainly used to reduce boilerplate code. For example, if a resource has to be closed eventually, we can use defer to avoid repeating the closure calls before every single return.
One common mistake with defer is to forget that it schedules a function call when the surrounding function returns. For example:
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // Do something with file\\n }\\n return nil\\n}\\nThe defer calls are executed not during each loop iteration but when the readFiles function returns. If readFiles doesn\\u2019t return, the file descriptors will be kept open forever, causing leaks.
One common option to fix this problem is to create a surrounding function after defer, called during each iteration:
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n if err := readFile(path); err != nil {\\n return err\\n }\\n }\\n return nil\\n}\\n\\nfunc readFile(path string) error {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // Do something with file\\n return nil\\n}\\nAnother solution is to make the readFile function a closure but intrinsically, this remains the same solution: adding another surrounding function to execute the defer calls during each iteration.
Source code
\"},{\"location\":\"#strings\",\"title\":\"Strings\",\"text\":\"\"},{\"location\":\"#not-understanding-the-concept-of-rune-36\",\"title\":\"Not understanding the concept of rune (#36)\",\"text\":\"TL;DR Understanding that a rune corresponds to the concept of a Unicode code point and that it can be composed of multiple bytes should be part of the Go developer\\u2019s core knowledge to work accurately with strings.
As runes are everywhere in Go, it's important to understand the following:
A charset is a set of characters, whereas an encoding describes how to translate a charset into binary. In Go, a string references an immutable slice of arbitrary bytes. Go source code is encoded using UTF-8. Hence, all string literals are UTF-8 strings. But because a string can contain arbitrary bytes, if it\\u2019s obtained from somewhere else (not the source code), it isn\\u2019t guaranteed to be based on the UTF-8 encoding. A rune corresponds to the concept of a Unicode code point, meaning an item represented by a single value. Using UTF-8, a Unicode code point can be encoded into 1 to 4 bytes. Using len() on a string in Go returns the number of bytes, not the number of runes. Source code
\"},{\"location\":\"#inaccurate-string-iteration-37\",\"title\":\"Inaccurate string iteration (#37)\",\"text\":\"TL;DR Iterating on a string with the range operator iterates on the runes with the index corresponding to the starting index of the rune\\u2019s byte sequence. To access a specific rune index (such as the third rune), convert the string into a []rune.
Iterating on a string is a common operation for developers. Perhaps we want to perform an operation for each rune in the string or implement a custom function to search for a specific substring. In both cases, we have to iterate on the different runes of a string. But it\\u2019s easy to get confused about how iteration works.
For example, consider the following example:
s := \\\"h\\u00eallo\\\"\\nfor i := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, s[i])\\n}\\nfmt.Printf(\\\"len=%d\\\\n\\\", len(s))\\nposition 0: h\\nposition 1: \\u00c3\\nposition 3: l\\nposition 4: l\\nposition 5: o\\nlen=6\\nLet's highlight three points that might be confusing:
The second rune is \\u00c3 in the output instead of \\u00ea. We jumped from position 1 to position 3: what is at position 2? len returns a count of 6, whereas s contains only 5 runes. Let\\u2019s start with the last observation. We already mentioned that len returns the number of bytes in a string, not the number of runes. Because we assigned a string literal to s, s is a UTF-8 string. Meanwhile, the special character \\\"\\u00ea\\\" isn\\u2019t encoded in a single byte; it requires 2 bytes. Therefore, calling len(s) returns 6.
Meanwhile, in the previous example, we have to understand that we don't iterate over each rune; instead, we iterate over each starting index of a rune:
Printing s[i] doesn\\u2019t print the ith rune; it prints the UTF-8 representation of the byte at index i. Hence, we printed \\\"h\\u00c3llo\\\" instead of \\\"h\\u00eallo\\\".
If we want to print all the different runes, we can either use the value element of the range operator:
s := \\\"h\\u00eallo\\\"\\nfor i, r := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\nOr, we can convert the string into a slice of runes and iterate over it:
s := \\\"h\\u00eallo\\\"\\nrunes := []rune(s)\\nfor i, r := range runes {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\nNote that this solution introduces a run-time overhead compared to the previous one. Indeed, converting a string into a slice of runes requires allocating an additional slice and converting the bytes into runes: an O(n) time complexity with n the number of bytes in the string. Therefore, if we want to iterate over all the runes, we should use the first solution.
However, if we want to access the ith rune of a string with the first option, we don\\u2019t have access to the rune index; rather, we know the starting index of a rune in the byte sequence.
s := \\\"h\\u00eallo\\\"\\nr := []rune(s)[4]\\nfmt.Printf(\\\"%c\\\\n\\\", r) // o\\n Source code
\"},{\"location\":\"#misusing-trim-functions-38\",\"title\":\"Misusing trim functions (#38)\",\"text\":\"TL;DR strings.TrimRight/strings.TrimLeft removes all the trailing/leading runes contained in a given set, whereas strings.TrimSuffix/strings.TrimPrefix returns a string without a provided suffix/prefix.
For example:
fmt.Println(strings.TrimRight(\\\"123oxo\\\", \\\"xo\\\"))\\nThe example prints 123:
Conversely, strings.TrimLeft removes all the leading runes contained in a set.
On the other side, strings.TrimSuffix / strings.TrimPrefix returns a string without the provided trailing suffix / prefix.
Source code
\"},{\"location\":\"#under-optimized-strings-concatenation-39\",\"title\":\"Under-optimized strings concatenation (#39)\",\"text\":\"TL;DR Concatenating a list of strings should be done with strings.Builder to prevent allocating a new string during each iteration.
Let\\u2019s consider a concat function that concatenates all the string elements of a slice using the += operator:
func concat(values []string) string {\\n s := \\\"\\\"\\n for _, value := range values {\\n s += value\\n }\\n return s\\n}\\nDuring each iteration, the += operator concatenates s with the value string. At first sight, this function may not look wrong. But with this implementation, we forget one of the core characteristics of a string: its immutability. Therefore, each iteration doesn\\u2019t update s; it reallocates a new string in memory, which significantly impacts the performance of this function.
Fortunately, there is a solution to deal with this problem, using strings.Builder:
func concat(values []string) string {\\n sb := strings.Builder{}\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\nDuring each iteration, we constructed the resulting string by calling the WriteString method that appends the content of value to its internal buffer, hence minimizing memory copying.
Note WriteString returns an error as the second output, but we purposely ignore it. Indeed, this method will never return a non-nil error. So what\\u2019s the purpose of this method returning an error as part of its signature? strings.Builder implements the io.StringWriter interface, which contains a single method: WriteString(s string) (n int, err error). Hence, to comply with this interface, WriteString must return an error.
Internally, strings.Builder holds a byte slice. Each call to WriteString results in a call to append on this slice. There are two impacts. First, this struct shouldn\\u2019t be used concurrently, as the calls to append would lead to race conditions. The second impact is something that we saw in mistake #21, \\\"Inefficient slice initialization\\\": if the future length of a slice is already known, we should preallocate it. For that purpose, strings.Builder exposes a method Grow(n int) to guarantee space for another n bytes:
func concat(values []string) string {\\n total := 0\\n for i := 0; i < len(values); i++ {\\n total += len(values[i])\\n }\\n\\n sb := strings.Builder{}\\n sb.Grow(total) (2)\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\nLet\\u2019s run a benchmark to compare the three versions (v1 using +=; v2 using strings.Builder{} without preallocation; and v3 using strings.Builder{} with preallocation). The input slice contains 1,000 strings, and each string contains 1,000 bytes:
BenchmarkConcatV1-4 16 72291485 ns/op\\nBenchmarkConcatV2-4 1188 878962 ns/op\\nBenchmarkConcatV3-4 5922 190340 ns/op\\nAs we can see, the latest version is by far the most efficient: 99% faster than v1 and 78% faster than v2.
strings.Builder is the recommended solution to concatenate a list of strings. Usually, this solution should be used within a loop. Indeed, if we just have to concatenate a few strings (such as a name and a surname), using strings.Builder is not recommended as doing so will make the code a bit less readable than using the += operator or fmt.Sprintf.
Source code
\"},{\"location\":\"#useless-string-conversions-40\",\"title\":\"Useless string conversions (#40)\",\"text\":\"TL;DR Remembering that the bytes package offers the same operations as the strings package can help avoid extra byte/string conversions.
When choosing to work with a string or a []byte, most programmers tend to favor strings for convenience. But most I/O is actually done with []byte. For example, io.Reader, io.Writer, and io.ReadAll work with []byte, not strings.
When we\\u2019re wondering whether we should work with strings or []byte, let\\u2019s recall that working with []byte isn\\u2019t necessarily less convenient. Indeed, all the exported functions of the strings package also have alternatives in the bytes package: Split, Count, Contains, Index, and so on. Hence, whether we\\u2019re doing I/O or not, we should first check whether we could implement a whole workflow using bytes instead of strings and avoid the price of additional conversions.
Source code
\"},{\"location\":\"#substring-and-memory-leaks-41\",\"title\":\"Substring and memory leaks (#41)\",\"text\":\"TL;DR Using copies instead of substrings can prevent memory leaks, as the string returned by a substring operation will be backed by the same byte array.
In mistake #26, \\u201cSlices and memory leaks,\\u201d we saw how slicing a slice or array may lead to memory leak situations. This principle also applies to string and substring operations.
We need to keep two things in mind while using the substring operation in Go. First, the interval provided is based on the number of bytes, not the number of runes. Second, a substring operation may lead to a memory leak as the resulting substring will share the same backing array as the initial string. The solutions to prevent this case from happening are to perform a string copy manually or to use strings.Clone from Go 1.18.
Source code
\"},{\"location\":\"#functions-and-methods\",\"title\":\"Functions and Methods\",\"text\":\"\"},{\"location\":\"#not-knowing-which-type-of-receiver-to-use-42\",\"title\":\"Not knowing which type of receiver to use (#42)\",\"text\":\"TL;DR The decision whether to use a value or a pointer receiver should be made based on factors such as the type, whether it has to be mutated, whether it contains a field that can\\u2019t be copied, and how large the object is. When in doubt, use a pointer receiver.
Choosing between value and pointer receivers isn\\u2019t always straightforward. Let\\u2019s discuss some of the conditions to help us choose.
A receiver must be a pointer
If the method needs to mutate the receiver. This rule is also valid if the receiver is a slice and a method needs to append elements: type slice []int\\n\\nfunc (s *slice) add(element int) {\\n *s = append(*s, element)\\n}\\n If the method receiver contains a field that cannot be copied: for example, a type part of the sync package (see #74, \\u201cCopying a sync type\\u201d). A receiver should be a pointer
If the receiver is a large object. Using a pointer can make the call more efficient, as doing so prevents making an extensive copy. When in doubt about how large is large, benchmarking can be the solution; it\\u2019s pretty much impossible to state a specific size, because it depends on many factors. A receiver must be a value
If we have to enforce a receiver\\u2019s immutability. If the receiver is a map, function, or channel. Otherwise, a compilation error occurs. A receiver should be a value
If the receiver is a slice that doesn\\u2019t have to be mutated. If the receiver is a small array or struct that is naturally a value type without mutable fields, such as time.Time. If the receiver is a basic type such as int, float64, or string. Of course, it\\u2019s impossible to be exhaustive, as there will always be edge cases, but this section\\u2019s goal was to provide guidance to cover most cases. By default, we can choose to go with a value receiver unless there\\u2019s a good reason not to do so. In doubt, we should use a pointer receiver.
Source code
\"},{\"location\":\"#never-using-named-result-parameters-43\",\"title\":\"Never using named result parameters (#43)\",\"text\":\"TL;DR Using named result parameters can be an efficient way to improve the readability of a function/method, especially if multiple result parameters have the same type. In some cases, this approach can also be convenient because named result parameters are initialized to their zero value. But be cautious about potential side effects.
When we return parameters in a function or a method, we can attach names to these parameters and use them as regular variables. When a result parameter is named, it\\u2019s initialized to its zero value when the function/method begins. With named result parameters, we can also call a naked return statement (without arguments). In that case, the current values of the result parameters are used as the returned values.
Here\\u2019s an example that uses a named result parameter b:
func f(a int) (b int) {\\n b = a\\n return\\n}\\nIn this example, we attach a name to the result parameter: b. When we call return without arguments, it returns the current value of b.
In some cases, named result parameters can also increase readability: for example, if two parameters have the same type. In other cases, they can also be used for convenience. Therefore, we should use named result parameters sparingly when there\\u2019s a clear benefit.
Source code
\"},{\"location\":\"#unintended-side-effects-with-named-result-parameters-44\",\"title\":\"Unintended side effects with named result parameters (#44)\",\"text\":\"TL;DR See #43.
We mentioned why named result parameters can be useful in some situations. But as these result parameters are initialized to their zero value, using them can sometimes lead to subtle bugs if we\\u2019re not careful enough. For example, can you spot what\\u2019s wrong with this code?
func (l loc) getCoordinates(ctx context.Context, address string) (\\n lat, lng float32, err error) {\\n isValid := l.validateAddress(address) (1)\\n if !isValid {\\n return 0, 0, errors.New(\\\"invalid address\\\")\\n }\\n\\n if ctx.Err() != nil { (2)\\n return 0, 0, err\\n }\\n\\n // Get and return coordinates\\n}\\nThe error might not be obvious at first glance. Here, the error returned in the if ctx.Err() != nil scope is err. But we haven\\u2019t assigned any value to the err variable. It\\u2019s still assigned to the zero value of an error type: nil. Hence, this code will always return a nil error.
When using named result parameters, we must recall that each parameter is initialized to its zero value. As we have seen in this section, this can lead to subtle bugs that aren\\u2019t always straightforward to spot while reading code. Therefore, let\\u2019s remain cautious when using named result parameters, to avoid potential side effects.
Source code
\"},{\"location\":\"#returning-a-nil-receiver-45\",\"title\":\"Returning a nil receiver (#45)\",\"text\":\"TL;DR When returning an interface, be cautious about not returning a nil pointer but an explicit nil value. Otherwise, unintended consequences may occur and the caller will receive a non-nil value.
Source code
\"},{\"location\":\"#using-a-filename-as-a-function-input-46\",\"title\":\"Using a filename as a function input (#46)\",\"text\":\"TL;DR Designing functions to receive io.Reader types instead of filenames improves the reusability of a function and makes testing easier.
Accepting a filename as a function input to read from a file should, in most cases, be considered a code smell (except in specific functions such as os.Open). Indeed, it makes unit tests more complex because we may have to create multiple files. It also reduces the reusability of a function (although not all functions are meant to be reused). Using the io.Reader interface abstracts the data source. Regardless of whether the input is a file, a string, an HTTP request, or a gRPC request, the implementation can be reused and easily tested.
Source code
\"},{\"location\":\"#ignoring-how-defer-arguments-and-receivers-are-evaluated-argument-evaluation-pointer-and-value-receivers-47\",\"title\":\"Ignoring how defer arguments and receivers are evaluated (argument evaluation, pointer, and value receivers) (#47)\",\"text\":\"TL;DR Passing a pointer to a defer function and wrapping a call inside a closure are two possible solutions to overcome the immediate evaluation of arguments and receivers.
In a defer function the arguments are evaluated right away, not once the surrounding function returns. For example, in this code, we always call notify and incrementCounter with the same status: an empty string.
const (\\n StatusSuccess = \\\"success\\\"\\n StatusErrorFoo = \\\"error_foo\\\"\\n StatusErrorBar = \\\"error_bar\\\"\\n)\\n\\nfunc f() error {\\n var status string\\n defer notify(status)\\n defer incrementCounter(status)\\n\\n if err := foo(); err != nil {\\n status = StatusErrorFoo\\n return err\\n }\\n\\n if err := bar(); err != nil {\\n status = StatusErrorBar\\n return err\\n }\\n\\n status = StatusSuccess\\n return nil\\n}\\nIndeed, we call notify(status) and incrementCounter(status) as defer functions. Therefore, Go will delay these calls to be executed once f returns with the current value of status at the stage we used defer, hence passing an empty string.
Two leading options if we want to keep using defer.
The first solution is to pass a string pointer:
func f() error {\\n var status string\\n defer notify(&status) \\n defer incrementCounter(&status)\\n\\n // The rest of the function unchanged\\n}\\nUsing defer evaluates the arguments right away: here, the address of status. Yes, status itself is modified throughout the function, but its address remains constant, regardless of the assignments. Hence, if notify or incrementCounter uses the value referenced by the string pointer, it will work as expected. But this solution requires changing the signature of the two functions, which may not always be possible.
There\\u2019s another solution: calling a closure (an anonymous function value that references variables from outside its body) as a defer statement:
func f() error {\\n var status string\\n defer func() {\\n notify(status)\\n incrementCounter(status)\\n }()\\n\\n // The rest of the function unchanged\\n}\\nHere, we wrap the calls to both notify and incrementCounter within a closure. This closure references the status variable from outside its body. Therefore, status is evaluated once the closure is executed, not when we call defer. This solution also works and doesn\\u2019t require notify and incrementCounter to change their signature.
Let's also note this behavior applies with method receiver: the receiver is evaluated immediately.
Source code
\"},{\"location\":\"#error-management\",\"title\":\"Error Management\",\"text\":\"\"},{\"location\":\"#panicking-48\",\"title\":\"Panicking (#48)\",\"text\":\"TL;DR Using panic is an option to deal with errors in Go. However, it should only be used sparingly in unrecoverable conditions: for example, to signal a programmer error or when you fail to load a mandatory dependency.
In Go, panic is a built-in function that stops the ordinary flow:
func main() {\\n fmt.Println(\\\"a\\\")\\n panic(\\\"foo\\\")\\n fmt.Println(\\\"b\\\")\\n}\\nThis code prints a and then stops before printing b:
a\\npanic: foo\\n\\ngoroutine 1 [running]:\\nmain.main()\\n main.go:7 +0xb3\\nPanicking in Go should be used sparingly. There are two prominent cases, one to signal a programmer error (e.g., sql.Register that panics if the driver is nil or has already been register) and another where our application fails to create a mandatory dependency. Hence, exceptional conditions that lead us to stop the application. In most other cases, error management should be done with a function that returns a proper error type as the last return argument.
Source code
\"},{\"location\":\"#ignoring-when-to-wrap-an-error-49\",\"title\":\"Ignoring when to wrap an error (#49)\",\"text\":\"TL;DR Wrapping an error allows you to mark an error and/or provide additional context. However, error wrapping creates potential coupling as it makes the source error available for the caller. If you want to prevent that, don\\u2019t use error wrapping.
Since Go 1.13, the %w directive allows us to wrap errors conveniently. Error wrapping is about wrapping or packing an error inside a wrapper container that also makes the source error available. In general, the two main use cases for error wrapping are the following:
Adding additional context to an error Marking an error as a specific error When handling an error, we can decide to wrap it. Wrapping is about adding additional context to an error and/or marking an error as a specific type. If we need to mark an error, we should create a custom error type. However, if we just want to add extra context, we should use fmt.Errorf with the %w directive as it doesn\\u2019t require creating a new error type. Yet, error wrapping creates potential coupling as it makes the source error available for the caller. If we want to prevent it, we shouldn\\u2019t use error wrapping but error transformation, for example, using fmt.Errorf with the %v directive.
Source code
\"},{\"location\":\"#comparing-an-error-type-inaccurately-50\",\"title\":\"Comparing an error type inaccurately (#50)\",\"text\":\"TL;DR If you use Go 1.13 error wrapping with the %w directive and fmt.Errorf, comparing an error against a type has to be done using errors.As. Otherwise, if the returned error you want to check is wrapped, it will fail the checks.
Source code
\"},{\"location\":\"#comparing-an-error-value-inaccurately-51\",\"title\":\"Comparing an error value inaccurately (#51)\",\"text\":\"TL;DR If you use Go 1.13 error wrapping with the %w directive and fmt.Errorf, comparing an error against or a value has to be done using errors.As. Otherwise, if the returned error you want to check is wrapped, it will fail the checks.
A sentinel error is an error defined as a global variable:
import \\\"errors\\\"\\n\\nvar ErrFoo = errors.New(\\\"foo\\\")\\nIn general, the convention is to start with Err followed by the error type: here, ErrFoo. A sentinel error conveys an expected error, an error that clients will expect to check. As general guidelines:
Expected errors should be designed as error values (sentinel errors): var ErrFoo = errors.New(\\\"foo\\\"). Unexpected errors should be designed as error types: type BarError struct { ... }, with BarError implementing the error interface. If we use error wrapping in our application with the %w directive and fmt.Errorf, checking an error against a specific value should be done using errors.Is instead of ==. Thus, even if the sentinel error is wrapped, errors.Is can recursively unwrap it and compare each error in the chain against the provided value.
Source code
\"},{\"location\":\"#handling-an-error-twice-52\",\"title\":\"Handling an error twice (#52)\",\"text\":\"TL;DR In most situations, an error should be handled only once. Logging an error is handling an error. Therefore, you have to choose between logging or returning an error. In many cases, error wrapping is the solution as it allows you to provide additional context to an error and return the source error.
Handling an error multiple times is a mistake made frequently by developers, not specifically in Go. This can cause situations where the same error is logged multiple times make debugging harder.
Let's remind us that handling an error should be done only once. Logging an error is handling an error. Hence, we should either log or return an error. By doing this, we simplify our code and gain better insights into the error situation. Using error wrapping is the most convenient approach as it allows us to propagate the source error and add context to an error.
Source code
\"},{\"location\":\"#not-handling-an-error-53\",\"title\":\"Not handling an error (#53)\",\"text\":\"TL;DR Ignoring an error, whether during a function call or in a defer function, should be done explicitly using the blank identifier. Otherwise, future readers may be confused about whether it was intentional or a miss.
Source code
\"},{\"location\":\"#not-handling-defer-errors-54\",\"title\":\"Not handling defer errors (#54)\",\"text\":\"TL;DR In many cases, you shouldn\\u2019t ignore an error returned by a defer function. Either handle it directly or propagate it to the caller, depending on the context. If you want to ignore it, use the blank identifier.
Consider the following code:
func f() {\\n // ...\\n notify() // Error handling is omitted\\n}\\n\\nfunc notify() error {\\n // ...\\n}\\nFrom a maintainability perspective, the code can lead to some issues. Let\\u2019s consider a new reader looking at it. This reader notices that notify returns an error but that the error isn\\u2019t handled by the parent function. How can they guess whether or not handling the error was intentional? How can they know whether the previous developer forgot to handle it or did it purposely?
For these reasons, when we want to ignore an error, there's only one way to do it, using the blank identifier (_):
_ = notify\\nIn terms of compilation and run time, this approach doesn\\u2019t change anything compared to the first piece of code. But this new version makes explicit that we aren\\u2019t interested in the error. Also, we can add a comment that indicates the rationale for why an error is ignored:
// At-most once delivery.\\n// Hence, it's accepted to miss some of them in case of errors.\\n_ = notify()\\n Source code
\"},{\"location\":\"#concurrency-foundations\",\"title\":\"Concurrency: Foundations\",\"text\":\"\"},{\"location\":\"#mixing-up-concurrency-and-parallelism-55\",\"title\":\"Mixing up concurrency and parallelism (#55)\",\"text\":\"TL;DR Understanding the fundamental differences between concurrency and parallelism is a cornerstone of the Go developer\\u2019s knowledge. Concurrency is about structure, whereas parallelism is about execution.
Concurrency and parallelism are not the same:
Concurrency is about structure. We can change a sequential implementation into a concurrent one by introducing different steps that separate concurrent goroutines can tackle. Meanwhile, parallelism is about execution. We can use parallism at the steps level by adding more parallel goroutines. In summary, concurrency provides a structure to solve a problem with parts that may be parallelized. Therefore, concurrency enables parallelism.
\"},{\"location\":\"#thinking-concurrency-is-always-faster-56\",\"title\":\"Thinking concurrency is always faster (#56)\",\"text\":\"TL;DR To be a proficient developer, you must acknowledge that concurrency isn\\u2019t always faster. Solutions involving parallelization of minimal workloads may not necessarily be faster than a sequential implementation. Benchmarking sequential versus concurrent solutions should be the way to validate assumptions.
Read the full section here.
Source code
\"},{\"location\":\"#being-puzzled-about-when-to-use-channels-or-mutexes-57\",\"title\":\"Being puzzled about when to use channels or mutexes (#57)\",\"text\":\"TL;DR Being aware of goroutine interactions can also be helpful when deciding between channels and mutexes. In general, parallel goroutines require synchronization and hence mutexes. Conversely, concurrent goroutines generally require coordination and orchestration and hence channels.
Given a concurrency problem, it may not always be clear whether we can implement a solution using channels or mutexes. Because Go promotes sharing memory by communication, one mistake could be to always force the use of channels, regardless of the use case. However, we should see the two options as complementary.
When should we use channels or mutexes? We will use the example in the next figure as a backbone. Our example has three different goroutines with specific relationships:
G1 and G2 are parallel goroutines. They may be two goroutines executing the same function that keeps receiving messages from a channel, or perhaps two goroutines executing the same HTTP handler at the same time. On the other hand, G1 and G3 are concurrent goroutines, as are G2 and G3. All the goroutines are part of an overall concurrent structure, but G1 and G2 perform the first step, whereas G3 does the next step. In general, parallel goroutines have to synchronize: for example, when they need to access or mutate a shared resource such as a slice. Synchronization is enforced with mutexes but not with any channel types (not with buffered channels). Hence, in general, synchronization between parallel goroutines should be achieved via mutexes.
Conversely, in general, concurrent goroutines have to coordinate and orchestrate. For example, if G3 needs to aggregate results from both G1 and G2, G1 and G2 need to signal to G3 that a new intermediate result is available. This coordination falls under the scope of communication\\u2014therefore, channels.
Regarding concurrent goroutines, there\\u2019s also the case where we want to transfer the ownership of a resource from one step (G1 and G2) to another (G3); for example, if G1 and G2 are enriching a shared resource and at some point, we consider this job as complete. Here, we should use channels to signal that a specific resource is ready and handle the ownership transfer.
Mutexes and channels have different semantics. Whenever we want to share a state or access a shared resource, mutexes ensure exclusive access to this resource. Conversely, channels are a mechanic for signaling with or without data (chan struct{} or not). Coordination or ownership transfer should be achieved via channels. It\\u2019s important to know whether goroutines are parallel or concurrent because, in general, we need mutexes for parallel goroutines and channels for concurrent ones.
\"},{\"location\":\"#not-understanding-race-problems-data-races-vs-race-conditions-and-the-go-memory-model-58\",\"title\":\"Not understanding race problems (data races vs. race conditions and the Go memory model) (#58)\",\"text\":\"TL;DR Being proficient in concurrency also means understanding that data races and race conditions are different concepts. Data races occur when multiple goroutines simultaneously access the same memory location and at least one of them is writing. Meanwhile, being data-race-free doesn\\u2019t necessarily mean deterministic execution. When a behavior depends on the sequence or the timing of events that can\\u2019t be controlled, this is a race condition.
Race problems can be among the hardest and most insidious bugs a programmer can face. As Go developers, we must understand crucial aspects such as data races and race conditions, their possible impacts, and how to avoid them.
\"},{\"location\":\"#data-race\",\"title\":\"Data Race\",\"text\":\"A data race occurs when two or more goroutines simultaneously access the same memory location and at least one is writing. In this case, the result can be hazardous. Even worse, in some situations, the memory location may end up holding a value containing a meaningless combination of bits.
We can prevent a data race from happening using different techniques. For example:
Using the sync/atomic package In synchronizing the two goroutines with an ad hoc data structure like a mutex Using channels to make the two goroutines communicating to ensure that a variable is updated by only one goroutine at a time \"},{\"location\":\"#race-condition\",\"title\":\"Race Condition\",\"text\":\"Depending on the operation we want to perform, does a data-race-free application necessarily mean a deterministic result? Not necessarily.
A race condition occurs when the behavior depends on the sequence or the timing of events that can\\u2019t be controlled. Here, the timing of events is the goroutines\\u2019 execution order.
In summary, when we work in concurrent applications, it\\u2019s essential to understand that a data race is different from a race condition. A data race occurs when multiple goroutines simultaneously access the same memory location and at least one of them is writing. A data race means unexpected behavior. However, a data-race-free application doesn\\u2019t necessarily mean deterministic results. An application can be free of data races but still have behavior that depends on uncontrolled events (such as goroutine execution, how fast a message is published to a channel, or how long a call to a database lasts); this is a race condition. Understanding both concepts is crucial to becoming proficient in designing concurrent applications.
Source code
\"},{\"location\":\"#not-understanding-the-concurrency-impacts-of-a-workload-type-59\",\"title\":\"Not understanding the concurrency impacts of a workload type (#59)\",\"text\":\"TL;DR When creating a certain number of goroutines, consider the workload type. Creating CPU-bound goroutines means bounding this number close to the GOMAXPROCS variable (based by default on the number of CPU cores on the host). Creating I/O-bound goroutines depends on other factors, such as the external system.
In programming, the execution time of a workload is limited by one of the following:
The speed of the CPU\\u2014For example, running a merge sort algorithm. The workload is called CPU-bound. The speed of I/O\\u2014For example, making a REST call or a database query. The workload is called I/O-bound. The amount of available memory\\u2014The workload is called memory-bound. Note The last is the rarest nowadays, given that memory has become very cheap in recent decades. Hence, this section focuses on the two first workload types: CPU- and I/O-bound.
If the workload executed by the workers is I/O-bound, the value mainly depends on the external system. Conversely, if the workload is CPU-bound, the optimal number of goroutines is close to the number of available CPU cores (a best practice can be to use runtime.GOMAXPROCS). Knowing the workload type (I/O or CPU) is crucial when designing concurrent applications.
Source code
\"},{\"location\":\"#misunderstanding-go-contexts-60\",\"title\":\"Misunderstanding Go contexts (#60)\",\"text\":\"TL;DR Go contexts are also one of the cornerstones of concurrency in Go. A context allows you to carry a deadline, a cancellation signal, and/or a list of keys-values.
https://pkg.go.dev/context
A Context carries a deadline, a cancellation signal, and other values across API boundaries.
\"},{\"location\":\"#deadline\",\"title\":\"Deadline\",\"text\":\"A deadline refers to a specific point in time determined with one of the following:
A time.Duration from now (for example, in 250 ms) A time.Time (for example, 2023-02-07 00:00:00 UTC) The semantics of a deadline convey that an ongoing activity should be stopped if this deadline is met. An activity is, for example, an I/O request or a goroutine waiting to receive a message from a channel.
\"},{\"location\":\"#cancellation-signals\",\"title\":\"Cancellation signals\",\"text\":\"Another use case for Go contexts is to carry a cancellation signal. Let\\u2019s imagine that we want to create an application that calls CreateFileWatcher(ctx context.Context, filename string) within another goroutine. This function creates a specific file watcher that keeps reading from a file and catches updates. When the provided context expires or is canceled, this function handles it to close the file descriptor.
\"},{\"location\":\"#context-values\",\"title\":\"Context values\",\"text\":\"The last use case for Go contexts is to carry a key-value list. What\\u2019s the point of having a context carrying a key-value list? Because Go contexts are generic and mainstream, there are infinite use cases.
For example, if we use tracing, we may want different subfunctions to share the same correlation ID. Some developers may consider this ID too invasive to be part of the function signature. In this regard, we could also decide to include it as part of the provided context.
\"},{\"location\":\"#catching-a-context-cancellation\",\"title\":\"Catching a context cancellation\",\"text\":\"The context.Context type exports a Done method that returns a receive-only notification channel: <-chan struct{}. This channel is closed when the work associated with the context should be canceled. For example,
The Done channel related to a context created with context.WithCancel is closed when the cancel function is called. The Done channel related to a context created with context.WithDeadline is closed when the deadline has expired. One thing to note is that the internal channel should be closed when a context is canceled or has met a deadline, instead of when it receives a specific value, because the closure of a channel is the only channel action that all the consumer goroutines will receive. This way, all the consumers will be notified once a context is canceled or a deadline is reached.
In summary, to be a proficient Go developer, we have to understand what a context is and how to use it. In general, a function that users wait for should take a context, as doing so allows upstream callers to decide when calling this function should be aborted.
Source code
\"},{\"location\":\"#concurrency-practice\",\"title\":\"Concurrency: Practice\",\"text\":\"\"},{\"location\":\"#propagating-an-inappropriate-context-61\",\"title\":\"Propagating an inappropriate context (#61)\",\"text\":\"TL;DR Understanding the conditions when a context can be canceled should matter when propagating it: for example, an HTTP handler canceling the context when the response has been sent.
In many situations, it is recommended to propagate Go contexts. However, context propagation can sometimes lead to subtle bugs, preventing subfunctions from being correctly executed.
Let\\u2019s consider the following example. We expose an HTTP handler that performs some tasks and returns a response. But just before returning the response, we also want to send it to a Kafka topic. We don\\u2019t want to penalize the HTTP consumer latency-wise, so we want the publish action to be handled asynchronously within a new goroutine. We assume that we have at our disposal a publish function that accepts a context so the action of publishing a message can be interrupted if the context is canceled, for example. Here is a possible implementation:
func handler(w http.ResponseWriter, r *http.Request) {\\n response, err := doSomeTask(r.Context(), r)\\n if err != nil {\\n http.Error(w, err.Error(), http.StatusInternalServerError)\\n return\\n }\\n go func() {\\n err := publish(r.Context(), response)\\n // Do something with err\\n }()\\n writeResponse(response)\\n}\\nWhat\\u2019s wrong with this piece of code? We have to know that the context attached to an HTTP request can cancel in different conditions:
When the client\\u2019s connection closes In the case of an HTTP/2 request, when the request is canceled When the response has been written back to the client In the first two cases, we probably handle things correctly. For example, if we get a response from doSomeTask but the client has closed the connection, it\\u2019s probably OK to call publish with a context already canceled so the message isn\\u2019t published. But what about the last case?
When the response has been written to the client, the context associated with the request will be canceled. Therefore, we are facing a race condition:
If the response is written after the Kafka publication, we both return a response and publish a message successfully However, if the response is written before or during the Kafka publication, the message shouldn\\u2019t be published. In the latter case, calling publish will return an error because we returned the HTTP response quickly.
Note From Go 1.21, there is a way to create a new context without cancel. context.WithoutCancel returns a copy of parent that is not canceled when parent is canceled.
In summary, propagating a context should be done cautiously.
Source code
\"},{\"location\":\"#starting-a-goroutine-without-knowing-when-to-stop-it-62\",\"title\":\"Starting a goroutine without knowing when to stop it (#62)\",\"text\":\"TL;DR Avoiding leaks means being mindful that whenever a goroutine is started, you should have a plan to stop it eventually.
Goroutines are easy and cheap to start\\u2014so easy and cheap that we may not necessarily have a plan for when to stop a new goroutine, which can lead to leaks. Not knowing when to stop a goroutine is a design issue and a common concurrency mistake in Go.
Let\\u2019s discuss a concrete example. We will design an application that needs to watch some external configuration (for example, using a database connection). Here\\u2019s a first implementation:
func main() {\\n newWatcher()\\n // Run the application\\n}\\n\\ntype watcher struct { /* Some resources */ }\\n\\nfunc newWatcher() {\\n w := watcher{}\\n go w.watch() // Creates a goroutine that watches some external configuration\\n}\\nThe problem with this code is that when the main goroutine exits (perhaps because of an OS signal or because it has a finite workload), the application is stopped. Hence, the resources created by watcher aren\\u2019t closed gracefully. How can we prevent this from happening?
One option could be to pass to newWatcher a context that will be canceled when main returns:
func main() {\\n ctx, cancel := context.WithCancel(context.Background())\\n defer cancel()\\n newWatcher(ctx)\\n // Run the application\\n}\\n\\nfunc newWatcher(ctx context.Context) {\\n w := watcher{}\\n go w.watch(ctx)\\n}\\nWe propagate the context created to the watch method. When the context is canceled, the watcher struct should close its resources. However, can we guarantee that watch will have time to do so? Absolutely not\\u2014and that\\u2019s a design flaw.
The problem is that we used signaling to convey that a goroutine had to be stopped. We didn\\u2019t block the parent goroutine until the resources had been closed. Let\\u2019s make sure we do:
func main() {\\n w := newWatcher()\\n defer w.close()\\n // Run the application\\n}\\n\\nfunc newWatcher() watcher {\\n w := watcher{}\\n go w.watch()\\n return w\\n}\\n\\nfunc (w watcher) close() {\\n // Close the resources\\n}\\nInstead of signaling watcher that it\\u2019s time to close its resources, we now call this close method, using defer to guarantee that the resources are closed before the application exits.
In summary, let\\u2019s be mindful that a goroutine is a resource like any other that must eventually be closed to free memory or other resources. Starting a goroutine without knowing when to stop it is a design issue. Whenever a goroutine is started, we should have a clear plan about when it will stop. Last but not least, if a goroutine creates resources and its lifetime is bound to the lifetime of the application, it\\u2019s probably safer to wait for this goroutine to complete before exiting the application. This way, we can ensure that the resources can be freed.
Source code
\"},{\"location\":\"#not-being-careful-with-goroutines-and-loop-variables-63\",\"title\":\"Not being careful with goroutines and loop variables (#63)\",\"text\":\"Warning This mistake isn't relevant anymore from Go 1.22 (details).
\"},{\"location\":\"#expecting-a-deterministic-behavior-using-select-and-channels-64\",\"title\":\"Expecting a deterministic behavior using select and channels (#64)\",\"text\":\"TL;DR Understanding that select with multiple channels chooses the case randomly if multiple options are possible prevents making wrong assumptions that can lead to subtle concurrency bugs.
One common mistake made by Go developers while working with channels is to make wrong assumptions about how select behaves with multiple channels.
For example, let's consider the following case (disconnectCh is a unbuffered channel):
go func() {\\n for i := 0; i < 10; i++ {\\n messageCh <- i\\n }\\n disconnectCh <- struct{}{}\\n}()\\n\\nfor {\\n select {\\n case v := <-messageCh:\\n fmt.Println(v)\\n case <-disconnectCh:\\n fmt.Println(\\\"disconnection, return\\\")\\n return\\n }\\n}\\nIf we run this example multiple times, the result will be random:
0\\n1\\n2\\ndisconnection, return\\n\\n0\\ndisconnection, return\\nInstead of consuming the 10 messages, we only received a few of them. What\\u2019s the reason? It lies in the specification of the select statement with multiple channels (https:// go.dev/ref/spec):
Quote
If one or more of the communications can proceed, a single one that can proceed is chosen via a uniform pseudo-random selection.
Unlike a switch statement, where the first case with a match wins, the select statement selects randomly if multiple options are possible.
This behavior might look odd at first, but there\\u2019s a good reason for it: to prevent possible starvation. Suppose the first possible communication chosen is based on the source order. In that case, we may fall into a situation where, for example, we only receive from one channel because of a fast sender. To prevent this, the language designers decided to use a random selection.
When using select with multiple channels, we must remember that if multiple options are possible, the first case in the source order does not automatically win. Instead, Go selects randomly, so there\\u2019s no guarantee about which option will be chosen. To overcome this behavior, in the case of a single producer goroutine, we can use either unbuffered channels or a single channel.
Source code
\"},{\"location\":\"#not-using-notification-channels-65\",\"title\":\"Not using notification channels (#65)\",\"text\":\"TL;DR Send notifications using a chan struct{} type.
Channels are a mechanism for communicating across goroutines via signaling. A signal can be either with or without data.
Let\\u2019s look at a concrete example. We will create a channel that will notify us whenever a certain disconnection occurs. One idea is to handle it as a chan bool:
disconnectCh := make(chan bool)\\nNow, let\\u2019s say we interact with an API that provides us with such a channel. Because it\\u2019s a channel of Booleans, we can receive either true or false messages. It\\u2019s probably clear what true conveys. But what does false mean? Does it mean we haven\\u2019t been disconnected? And in this case, how frequently will we receive such a signal? Does it mean we have reconnected? Should we even expect to receive false? Perhaps we should only expect to receive true messages.
If that\\u2019s the case, meaning we don\\u2019t need a specific value to convey some information, we need a channel without data. The idiomatic way to handle it is a channel of empty structs: chan struct{}.
\"},{\"location\":\"#not-using-nil-channels-66\",\"title\":\"Not using nil channels (#66)\",\"text\":\"TL;DR Using nil channels should be part of your concurrency toolset because it allows you to remove cases from select statements, for example.
What should this code do?
var ch chan int\\n<-ch\\nch is a chan int type. The zero value of a channel being nil, ch is nil. The goroutine won\\u2019t panic; however, it will block forever.
The principle is the same if we send a message to a nil channel. This goroutine blocks forever:
var ch chan int\\nch <- 0\\nThen what\\u2019s the purpose of Go allowing messages to be received from or sent to a nil channel? For example, we can use nil channels to implement an idiomatic way to merge two channels:
func merge(ch1, ch2 <-chan int) <-chan int {\\n ch := make(chan int, 1)\\n\\n go func() {\\n for ch1 != nil || ch2 != nil { // Continue if at least one channel isn\\u2019t nil\\n select {\\n case v, open := <-ch1:\\n if !open {\\n ch1 = nil // Assign ch1 to a nil channel once closed\\n break\\n }\\n ch <- v\\n case v, open := <-ch2:\\n if !open {\\n ch2 = nil // Assigns ch2 to a nil channel once closed\\n break\\n }\\n ch <- v\\n }\\n }\\n close(ch)\\n }()\\n\\n return ch\\n}\\nThis elegant solution relies on nil channels to somehow remove one case from the select statement.
Let\\u2019s keep this idea in mind: nil channels are useful in some conditions and should be part of the Go developer\\u2019s toolset when dealing with concurrent code.
Source code
\"},{\"location\":\"#being-puzzled-about-channel-size-67\",\"title\":\"Being puzzled about channel size (#67)\",\"text\":\"TL;DR Carefully decide on the right channel type to use, given a problem. Only unbuffered channels provide strong synchronization guarantees. For buffered channels, you should have a good reason to specify a channel size other than one.
An unbuffered channel is a channel without any capacity. It can be created by either omitting the size or providing a 0 size:
ch1 := make(chan int)\\nch2 := make(chan int, 0)\\nWith an unbuffered channel (sometimes called a synchronous channel), the sender will block until the receiver receives data from the channel.
Conversely, a buffered channel has a capacity, and it must be created with a size greater than or equal to 1:
ch3 := make(chan int, 1)\\nWith a buffered channel, a sender can send messages while the channel isn\\u2019t full. Once the channel is full, it will block until a receiver goroutine receives a message:
ch3 := make(chan int, 1)\\nch3 <-1 // Non-blocking\\nch3 <-2 // Blocking\\nThe first send isn\\u2019t blocking, whereas the second one is, as the channel is full at this stage.
What's the main difference between unbuffered and buffered channels:
An unbuffered channel enables synchronization. We have the guarantee that two goroutines will be in a known state: one receiving and another sending a message. A buffered channel doesn\\u2019t provide any strong synchronization. Indeed, a producer goroutine can send a message and then continue its execution if the channel isn\\u2019t full. The only guarantee is that a goroutine won\\u2019t receive a message before it is sent. But this is only a guarantee because of causality (you don\\u2019t drink your coffee before you prepare it). If we need a buffered channel, what size should we provide?
The default value we should use for buffered channels is its minimum: 1. So, we may approach the problem from this standpoint: is there any good reason not to use a value of 1? Here\\u2019s a list of possible cases where we should use another size:
While using a worker pooling-like pattern, meaning spinning a fixed number of goroutines that need to send data to a shared channel. In that case, we can tie the channel size to the number of goroutines created. When using channels for rate-limiting problems. For example, if we need to enforce resource utilization by bounding the number of requests, we should set up the channel size according to the limit. If we are outside of these cases, using a different channel size should be done cautiously. Let\\u2019s bear in mind that deciding about an accurate queue size isn\\u2019t an easy problem:
Martin Thompson
Queues are typically always close to full or close to empty due to the differences in pace between consumers and producers. They very rarely operate in a balanced middle ground where the rate of production and consumption is evenly matched.
\"},{\"location\":\"#forgetting-about-possible-side-effects-with-string-formatting-68\",\"title\":\"Forgetting about possible side effects with string formatting (#68)\",\"text\":\"TL;DR Being aware that string formatting may lead to calling existing functions means watching out for possible deadlocks and other data races.
It\\u2019s pretty easy to forget the potential side effects of string formatting while working in a concurrent application.
\"},{\"location\":\"#etcd-data-race\",\"title\":\"etcd data race\",\"text\":\"github.com/etcd-io/etcd/pull/7816 shows an example of an issue where a map's key was formatted based on a mutable values from a context.
\"},{\"location\":\"#deadlock\",\"title\":\"Deadlock\",\"text\":\"Can you see what the problem is in this code with a Customer struct exposing an UpdateAge method and implementing the fmt.Stringer interface?
type Customer struct {\\n mutex sync.RWMutex // Uses a sync.RWMutex to protect concurrent accesses\\n id string\\n age int\\n}\\n\\nfunc (c *Customer) UpdateAge(age int) error {\\n c.mutex.Lock() // Locks and defers unlock as we update Customer\\n defer c.mutex.Unlock()\\n\\n if age < 0 { // Returns an error if age is negative\\n return fmt.Errorf(\\\"age should be positive for customer %v\\\", c)\\n }\\n\\n c.age = age\\n return nil\\n}\\n\\nfunc (c *Customer) String() string {\\n c.mutex.RLock() // Locks and defers unlock as we read Customer\\n defer c.mutex.RUnlock()\\n return fmt.Sprintf(\\\"id %s, age %d\\\", c.id, c.age)\\n}\\nThe problem here may not be straightforward. If the provided age is negative, we return an error. Because the error is formatted, using the %s directive on the receiver, it will call the String method to format Customer. But because UpdateAge already acquires the mutex lock, the String method won\\u2019t be able to acquire it. Hence, this leads to a deadlock situation. If all goroutines are also asleep, it leads to a panic.
One possible solution is to restrict the scope of the mutex lock:
func (c *Customer) UpdateAge(age int) error {\\n if age < 0 {\\n return fmt.Errorf(\\\"age should be positive for customer %v\\\", c)\\n }\\n\\n c.mutex.Lock()\\n defer c.mutex.Unlock()\\n\\n c.age = age\\n return nil\\n}\\nYet, such an approach isn't always possible. In these conditions, we have to be extremely careful with string formatting.
Another approach is to access the id field directly:
func (c *Customer) UpdateAge(age int) error {\\n c.mutex.Lock()\\n defer c.mutex.Unlock()\\n\\n if age < 0 {\\n return fmt.Errorf(\\\"age should be positive for customer id %s\\\", c.id)\\n }\\n\\n c.age = age\\n return nil\\n}\\nIn concurrent applications, we should remain cautious about the possible side effects of string formatting.
Source code
\"},{\"location\":\"#creating-data-races-with-append-69\",\"title\":\"Creating data races with append (#69)\",\"text\":\"TL;DR Calling append isn\\u2019t always data-race-free; hence, it shouldn\\u2019t be used concurrently on a shared slice.
Should adding an element to a slice using append is data-race-free? Spoiler: it depends.
Do you believe this example has a data race?
s := make([]int, 1)\\n\\ngo func() { // In a new goroutine, appends a new element on s\\n s1 := append(s, 1)\\n fmt.Println(s1)\\n}()\\n\\ngo func() { // Same\\n s2 := append(s, 1)\\n fmt.Println(s2)\\n}()\\nThe answer is no.
In this example, we create a slice with make([]int, 1). The code creates a one-length, one-capacity slice. Thus, because the slice is full, using append in each goroutine returns a slice backed by a new array. It doesn\\u2019t mutate the existing array; hence, it doesn\\u2019t lead to a data race.
Now, let\\u2019s run the same example with a slight change in how we initialize s. Instead of creating a slice with a length of 1, we create it with a length of 0 but a capacity of 1. How about this new example? Does it contain a data race?
s := make([]int, 0, 1)\\n\\ngo func() { \\n s1 := append(s, 1)\\n fmt.Println(s1)\\n}()\\n\\ngo func() {\\n s2 := append(s, 1)\\n fmt.Println(s2)\\n}()\\nThe answer is yes. We create a slice with make([]int, 0, 1). Therefore, the array isn\\u2019t full. Both goroutines attempt to update the same index of the backing array (index 1), which is a data race.
How can we prevent the data race if we want both goroutines to work on a slice containing the initial elements of s plus an extra element? One solution is to create a copy of s.
We should remember that using append on a shared slice in concurrent applications can lead to a data race. Hence, it should be avoided.
Source code
\"},{\"location\":\"#using-mutexes-inaccurately-with-slices-and-maps-70\",\"title\":\"Using mutexes inaccurately with slices and maps (#70)\",\"text\":\"TL;DR Remembering that slices and maps are pointers can prevent common data races.
Let's implement a Cache struct used to handle caching for customer balances. This struct will contain a map of balances per customer ID and a mutex to protect concurrent accesses:
type Cache struct {\\n mu sync.RWMutex\\n balances map[string]float64\\n}\\nNext, we add an AddBalance method that mutates the balances map. The mutation is done in a critical section (within a mutex lock and a mutex unlock):
func (c *Cache) AddBalance(id string, balance float64) {\\n c.mu.Lock()\\n c.balances[id] = balance\\n c.mu.Unlock()\\n}\\nMeanwhile, we have to implement a method to calculate the average balance for all the customers. One idea is to handle a minimal critical section this way:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n balances := c.balances // Creates a copy of the balances map\\n c.mu.RUnlock()\\n\\n sum := 0.\\n for _, balance := range balances { // Iterates over the copy, outside of the critical section\\n sum += balance\\n }\\n return sum / float64(len(balances))\\n}\\nWhat's the problem with this code?
If we run a test using the -race flag with two concurrent goroutines, one calling AddBalance (hence mutating balances) and another calling AverageBalance, a data race occurs. What\\u2019s the problem here?
Internally, a map is a runtime.hmap struct containing mostly metadata (for example, a counter) and a pointer referencing data buckets. So, balances := c.balances doesn\\u2019t copy the actual data. Therefore, the two goroutines perform operations on the same data set, and one mutates it. Hence, it's a data race.
One possible solution is to protect the whole AverageBalance function:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n defer c.mu.RUnlock() // Unlocks when the function returns\\n\\n sum := 0.\\n for _, balance := range c.balances {\\n sum += balance\\n }\\n return sum / float64(len(c.balances))\\n}\\nAnother option, if the iteration operation isn\\u2019t lightweight, is to work on an actual copy of the data and protect only the copy:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n m := maps.Clone(c.balances)\\n c.mu.RUnlock()\\n\\n sum := 0.\\n for _, balance := range m {\\n sum += balance\\n }\\n return sum / float64(len(m))\\n}\\nOnce we have made a deep copy, we release the mutex. The iterations are done on the copy outside of the critical section.
In summary, we have to be careful with the boundaries of a mutex lock. In this section, we have seen why assigning an existing map (or an existing slice) to a map isn\\u2019t enough to protect against data races. The new variable, whether a map or a slice, is backed by the same data set. There are two leading solutions to prevent this: protect the whole function, or work on a copy of the actual data. In all cases, let\\u2019s be cautious when designing critical sections and make sure the boundaries are accurately defined.
Source code
\"},{\"location\":\"#misusing-syncwaitgroup-71\",\"title\":\"Misusing sync.WaitGroup (#71)\",\"text\":\"TL;DR To accurately use sync.WaitGroup, call the Add method before spinning up goroutines.
In the following example, we will initialize a wait group, start three goroutines that will update a counter atomically, and then wait for them to complete. We want to wait for these three goroutines to print the value of the counter (which should be 3):
wg := sync.WaitGroup{}\\nvar v uint64\\nfor i := 0; i < 3; i++ {\\n go func() {\\n wg.Add(1)\\n atomic.AddUint64(&v, 1)\\n wg.Done()\\n }()\\n}\\nwg.Wait()\\nfmt.Println(v)\\nIf we run this example, we get a non-deterministic value: the code can print any value from 0 to 3. Also, if we enable the -race flag, Go will even catch a data race.
The problem is that wg.Add(1) is called within the newly created goroutine, not in the parent goroutine. Hence, there is no guarantee that we have indicated to the wait group that we want to wait for three goroutines before calling wg.Wait().
To fix this issue, we can call wg.Add before the loop:
wg := sync.WaitGroup{}\\nvar v uint64\\nwg.Add(3)\\nfor i := 0; i < 3; i++ {\\n go func() {\\n atomic.AddUint64(&v, 1)\\n wg.Done()\\n }()\\n}\\nwg.Wait()\\nfmt.Println(v)\\nOr inside the loop but not in the newly created goroutine:
wg := sync.WaitGroup{}\\nvar v uint64\\nfor i := 0; i < 3; i++ {\\n wg.Add(1)\\n go func() {\\n atomic.AddUint64(&v, 1)\\n wg.Done()\\n }()\\n}\\nwg.Wait()\\nfmt.Println(v)\\n Source code
\"},{\"location\":\"#forgetting-about-synccond-72\",\"title\":\"Forgetting about sync.Cond (#72)\",\"text\":\"TL;DR You can send repeated notifications to multiple goroutines with sync.Cond.
Source code
\"},{\"location\":\"#not-using-errgroup-73\",\"title\":\"Not using errgroup (#73)\",\"text\":\"TL;DR You can synchronize a group of goroutines and handle errors and contexts with the errgroup package.
Source code
\"},{\"location\":\"#copying-a-sync-type-74\",\"title\":\"Copying a sync type (#74)\",\"text\":\"TL;DR sync types shouldn\\u2019t be copied.
Source code
\"},{\"location\":\"#standard-library\",\"title\":\"Standard Library\",\"text\":\"\"},{\"location\":\"#providing-a-wrong-time-duration-75\",\"title\":\"Providing a wrong time duration (#75)\",\"text\":\"TL;DR Remain cautious with functions accepting a time.Duration. Even though passing an integer is allowed, strive to use the time API to prevent any possible confusion.
Many common functions in the standard library accept a time.Duration, which is an alias for the int64 type. However, one time.Duration unit represents one nanosecond, instead of one millisecond, as commonly seen in other programming languages. As a result, passing numeric types instead of using the time.Duration API can lead to unexpected behavior.
A developer with experience in other languages might assume that the following code creates a new time.Ticker that delivers ticks every second, given the value 1000:
ticker := time.NewTicker(1000)\\nfor {\\n select {\\n case <-ticker.C:\\n // Do something\\n }\\n}\\nHowever, because 1,000 time.Duration units = 1,000 nanoseconds, ticks are delivered every 1,000 nanoseconds = 1 microsecond, not every second as assumed.
We should always use the time.Duration API to avoid confusion and unexpected behavior:
ticker = time.NewTicker(time.Microsecond)\\n// Or\\nticker = time.NewTicker(1000 * time.Nanosecond)\\n
Source code
\"},{\"location\":\"#timeafter-and-memory-leaks-76\",\"title\":\"time.After and memory leaks (#76)\",\"text\":\"Warning This mistake isn't relevant anymore from Go 1.23 (details).
\"},{\"location\":\"#json-handling-common-mistakes-77\",\"title\":\"JSON handling common mistakes (#77)\",\"text\":\" Unexpected behavior because of type embedding Be careful about using embedded fields in Go structs. Doing so may lead to sneaky bugs like an embedded time.Time field implementing the json.Marshaler interface, hence overriding the default marshaling behavior.
Source code
JSON and the monotonic clock When comparing two time.Time structs, recall that time.Time contains both a wall clock and a monotonic clock, and the comparison using the == operator is done on both clocks.
Source code
To avoid wrong assumptions when you provide a map while unmarshaling JSON data, remember that numerics are converted to float64 by default.
Source code
\"},{\"location\":\"#common-sql-mistakes-78\",\"title\":\"Common SQL mistakes (#78)\",\"text\":\" Forgetting that sql.Open doesn't necessarily establish connections to a database Call the Ping or PingContext method if you need to test your configuration and make sure a database is reachable.
Source code
Forgetting about connections pooling Configure the database connection parameters for production-grade applications.
Not using prepared statements Using SQL prepared statements makes queries more efficient and more secure.
Source code
Deal with nullable columns in tables using pointers or sql.NullXXX types.
Source code
Not handling rows iteration errors Call the Err method of sql.Rows after row iterations to ensure that you haven\\u2019t missed an error while preparing the next row.
Source code
\"},{\"location\":\"#not-closing-transient-resources-http-body-sqlrows-and-osfile-79\",\"title\":\"Not closing transient resources (HTTP body, sql.Rows, and os.File) (#79)\",\"text\":\"TL;DR Eventually close all structs implementing io.Closer to avoid possible leaks.
Source code
\"},{\"location\":\"#forgetting-the-return-statement-after-replying-to-an-http-request-80\",\"title\":\"Forgetting the return statement after replying to an HTTP request (#80)\",\"text\":\"TL;DR To avoid unexpected behaviors in HTTP handler implementations, make sure you don\\u2019t miss the return statement if you want a handler to stop after http.Error.
Consider the following HTTP handler that handles an error from foo using http.Error:
func handler(w http.ResponseWriter, req *http.Request) {\\n err := foo(req)\\n if err != nil {\\n http.Error(w, \\\"foo\\\", http.StatusInternalServerError)\\n }\\n\\n _, _ = w.Write([]byte(\\\"all good\\\"))\\n w.WriteHeader(http.StatusCreated)\\n}\\nIf we run this code and err != nil, the HTTP response would be:
foo\\nall good\\nThe response contains both the error and success messages, and also the first HTTP status code, 500. There would also be a warning log indicating that we attempted to write the status code multiple times:
2023/10/10 16:45:33 http: superfluous response.WriteHeader call from main.handler (main.go:20)\\nThe mistake in this code is that http.Error does not stop the handler's execution, which means the success message and status code get written in addition to the error. Beyond an incorrect response, failing to return after writing an error can lead to the unwanted execution of code and unexpected side-effects. The following code adds the return statement following the http.Error and exhibits the desired behavior when ran:
func handler(w http.ResponseWriter, req *http.Request) {\\n err := foo(req)\\n if err != nil {\\n http.Error(w, \\\"foo\\\", http.StatusInternalServerError)\\n return // Adds the return statement\\n }\\n\\n _, _ = w.Write([]byte(\\\"all good\\\"))\\n w.WriteHeader(http.StatusCreated)\\n}\\n Source code
\"},{\"location\":\"#using-the-default-http-client-and-server-81\",\"title\":\"Using the default HTTP client and server (#81)\",\"text\":\"TL;DR For production-grade applications, don\\u2019t use the default HTTP client and server implementations. These implementations are missing timeouts and behaviors that should be mandatory in production.
Source code
\"},{\"location\":\"#testing\",\"title\":\"Testing\",\"text\":\"\"},{\"location\":\"#not-categorizing-tests-build-tags-environment-variables-and-short-mode-82\",\"title\":\"Not categorizing tests (build tags, environment variables, and short mode) (#82)\",\"text\":\"TL;DR Categorizing tests using build flags, environment variables, or short mode makes the testing process more efficient. You can create test categories using build flags or environment variables (for example, unit versus integration tests) and differentiate short from long-running tests to decide which kinds of tests to execute.
Source code
\"},{\"location\":\"#not-enabling-the-race-flag-83\",\"title\":\"Not enabling the race flag (#83)\",\"text\":\"TL;DR Enabling the -race flag is highly recommended when writing concurrent applications. Doing so allows you to catch potential data races that can lead to software bugs.
In Go, the race detector isn\\u2019t a static analysis tool used during compilation; instead, it\\u2019s a tool to find data races that occur at runtime. To enable it, we have to enable the -race flag while compiling or running a test. For example:
go test -race ./...\\nOnce the race detector is enabled, the compiler instruments the code to detect data races. Instrumentation refers to a compiler adding extra instructions: here, tracking all memory accesses and recording when and how they occur.
Enabling the race detector adds an overhead in terms of memory and execution time; hence, it's generally recommended to enable it only during local testing or continuous integration, not production.
If a race is detected, Go raises a warning. For example:
package main\\n\\nimport (\\n \\\"fmt\\\"\\n)\\n\\nfunc main() {\\n i := 0\\n go func() { i++ }()\\n fmt.Println(i)\\n}\\nRunning this code with the -race logs the following warning:
==================\\nWARNING: DATA RACE\\nWrite at 0x00c000026078 by goroutine 7: # (1)\\n main.main.func1()\\n /tmp/app/main.go:9 +0x4e\\n\\nPrevious read at 0x00c000026078 by main goroutine: # (2)\\n main.main()\\n /tmp/app/main.go:10 +0x88\\n\\nGoroutine 7 (running) created at: # (3)\\n main.main()\\n /tmp/app/main.go:9 +0x7a\\n==================\\n Indicates that goroutine 7 was writing Indicates that the main goroutine was reading Indicates when the goroutine 7 was created Let\\u2019s make sure we are comfortable reading these messages. Go always logs the following:
The concurrent goroutines that are incriminated: here, the main goroutine and goroutine 7. Where accesses occur in the code: in this case, lines 9 and 10. When these goroutines were created: goroutine 7 was created in main(). In addition, if a specific file contains tests that lead to data races, we can exclude it from race detection using the !race build tag:
//go:build !race\\n\\npackage main\\n\\nimport (\\n \\\"testing\\\"\\n)\\n\\nfunc TestFoo(t *testing.T) {\\n // ...\\n}\\nUsing the -parallel flag is an efficient way to speed up tests, especially long-running ones. Use the -shuffle flag to help ensure that a test suite doesn\\u2019t rely on wrong assumptions that could hide bugs.
\"},{\"location\":\"#not-using-table-driven-tests-85\",\"title\":\"Not using table-driven tests (#85)\",\"text\":\"TL;DR Table-driven tests are an efficient way to group a set of similar tests to prevent code duplication and make future updates easier to handle.
Source code
\"},{\"location\":\"#sleeping-in-unit-tests-86\",\"title\":\"Sleeping in unit tests (#86)\",\"text\":\"TL;DR Avoid sleeps using synchronization to make a test less flaky and more robust. If synchronization isn\\u2019t possible, consider a retry approach.
Source code
\"},{\"location\":\"#not-dealing-with-the-time-api-efficiently-87\",\"title\":\"Not dealing with the time API efficiently (#87)\",\"text\":\"TL;DR Understanding how to deal with functions using the time API is another way to make a test less flaky. You can use standard techniques such as handling the time as part of a hidden dependency or asking clients to provide it.
Source code
\"},{\"location\":\"#not-using-testing-utility-packages-httptest-and-iotest-88\",\"title\":\"Not using testing utility packages (httptest and iotest) (#88)\",\"text\":\" The httptest package is helpful for dealing with HTTP applications. It provides a set of utilities to test both clients and servers. Source code
The iotest package helps write io.Reader and test that an application is tolerant to errors. Source code
\"},{\"location\":\"#writing-inaccurate-benchmarks-89\",\"title\":\"Writing inaccurate benchmarks (#89)\",\"text\":\"TL;DR Regarding benchmarks:
Use time methods to preserve the accuracy of a benchmark. Increasing benchtime or using tools such as benchstat can be helpful when dealing with micro-benchmarks. Be careful with the results of a micro-benchmark if the system that ends up running the application is different from the one running the micro-benchmark. Make sure the function under test leads to a side effect, to prevent compiler optimizations from fooling you about the benchmark results. To prevent the observer effect, force a benchmark to re-create the data used by a CPU-bound function. Read the full section here.
Source code
\"},{\"location\":\"#not-exploring-all-the-go-testing-features-90\",\"title\":\"Not exploring all the Go testing features (#90)\",\"text\":\" Use code coverage with the -coverprofile flag to quickly see which part of the code needs more attention.
Testing from a different package Place unit tests in a different package to enforce writing tests that focus on an exposed behavior, not internals.
Source code
Handling errors using the *testing.T variable instead of the classic if err != nil makes code shorter and easier to read.
Source code
You can use setup and teardown functions to configure a complex environment, such as in the case of integration tests.
Source code
\"},{\"location\":\"#not-using-fuzzing-community-mistake\",\"title\":\"Not using fuzzing (community mistake)\",\"text\":\"TL;DR Fuzzing is an efficient strategy to detect random, unexpected, or malformed inputs to complex functions and methods in order to discover vulnerabilities, bugs, or even potential crashes.
Credits: @jeromedoucet
\"},{\"location\":\"#optimizations\",\"title\":\"Optimizations\",\"text\":\"\"},{\"location\":\"#not-understanding-cpu-caches-91\",\"title\":\"Not understanding CPU caches (#91)\",\"text\":\" Understanding how to use CPU caches is important for optimizing CPU-bound applications because the L1 cache is about 50 to 100 times faster than the main memory.
Being conscious of the cache line concept is critical to understanding how to organize data in data-intensive applications. A CPU doesn\\u2019t fetch memory word by word; instead, it usually copies a memory block to a 64-byte cache line. To get the most out of each individual cache line, enforce spatial locality.
Source code
Slice of structs vs. struct of slices Source code
Making code predictable for the CPU can also be an efficient way to optimize certain functions. For example, a unit or constant stride is predictable for the CPU, but a non-unit stride (for example, a linked list) isn\\u2019t predictable.
Source code
To avoid a critical stride, hence utilizing only a tiny portion of the cache, be aware that caches are partitioned.
\"},{\"location\":\"#writing-concurrent-code-that-leads-to-false-sharing-92\",\"title\":\"Writing concurrent code that leads to false sharing (#92)\",\"text\":\"TL;DR Knowing that lower levels of CPU caches aren\\u2019t shared across all the cores helps avoid performance-degrading patterns such as false sharing while writing concurrency code. Sharing memory is an illusion.
Read the full section here.
Source code
\"},{\"location\":\"#not-taking-into-account-instruction-level-parallelism-93\",\"title\":\"Not taking into account instruction-level parallelism (#93)\",\"text\":\"TL;DR Use ILP to optimize specific parts of your code to allow a CPU to execute as many parallel instructions as possible. Identifying data hazards is one of the main steps.
Source code
\"},{\"location\":\"#not-being-aware-of-data-alignment-94\",\"title\":\"Not being aware of data alignment (#94)\",\"text\":\"TL;DR You can avoid common mistakes by remembering that in Go, basic types are aligned with their own size. For example, keep in mind that reorganizing the fields of a struct by size in descending order can lead to more compact structs (less memory allocation and potentially a better spatial locality).
Source code
\"},{\"location\":\"#not-understanding-stack-vs-heap-95\",\"title\":\"Not understanding stack vs. heap (#95)\",\"text\":\"TL;DR Understanding the fundamental differences between heap and stack should also be part of your core knowledge when optimizing a Go application. Stack allocations are almost free, whereas heap allocations are slower and rely on the GC to clean the memory.
Source code
\"},{\"location\":\"#not-knowing-how-to-reduce-allocations-api-change-compiler-optimizations-and-syncpool-96\",\"title\":\"Not knowing how to reduce allocations (API change, compiler optimizations, and sync.Pool) (#96)\",\"text\":\"TL;DR Reducing allocations is also an essential aspect of optimizing a Go application. This can be done in different ways, such as designing the API carefully to prevent sharing up, understanding the common Go compiler optimizations, and using sync.Pool.
Source code
\"},{\"location\":\"#not-relying-on-inlining-97\",\"title\":\"Not relying on inlining (#97)\",\"text\":\"TL;DR Use the fast-path inlining technique to efficiently reduce the amortized time to call a function.
\"},{\"location\":\"#not-using-go-diagnostics-tooling-98\",\"title\":\"Not using Go diagnostics tooling (#98)\",\"text\":\"TL;DR Rely on profiling and the execution tracer to understand how an application performs and the parts to optimize.
Read the full section here.
\"},{\"location\":\"#not-understanding-how-the-gc-works-99\",\"title\":\"Not understanding how the GC works (#99)\",\"text\":\"TL;DR Understanding how to tune the GC can lead to multiple benefits such as handling sudden load increases more efficiently.
\"},{\"location\":\"#not-understanding-the-impacts-of-running-go-in-docker-and-kubernetes-100\",\"title\":\"Not understanding the impacts of running Go in Docker and Kubernetes (#100)\",\"text\":\"Warning This mistake isn't relevant anymore from Go 1.25 (details).
\"},{\"location\":\"#community\",\"title\":\"Community\",\"text\":\"Thanks to all the contributors:
\"},{\"location\":\"#powered-by\",\"title\":\"Powered by\",\"text\":\"\"},{\"location\":\"20-slice/\",\"title\":\"Not understanding slice length and capacity (#20)\",\"text\":\"\"},{\"location\":\"20-slice/#not-understanding-slice-length-and-capacity\",\"title\":\"Not understanding slice length and capacity\",\"text\":\"It\\u2019s pretty common for Go developers to mix slice length and capacity or not understand them thoroughly. Assimilating these two concepts is essential for efficiently handling core operations such as slice initialization and adding elements with append, copying, or slicing. This misunderstanding can lead to using slices suboptimally or even to memory leaks.
In Go, a slice is backed by an array. That means the slice\\u2019s data is stored contiguously in an array data structure. A slice also handles the logic of adding an element if the backing array is full or shrinking the backing array if it\\u2019s almost empty.
Internally, a slice holds a pointer to the backing array plus a length and a capacity. The length is the number of elements the slice contains, whereas the capacity is the number of elements in the backing array, counting from the first element in the slice. Let\\u2019s go through a few examples to make things clearer. First, let\\u2019s initialize a slice with a given length and capacity:
s := make([]int, 3, 6) // Three-length, six-capacity slice\\nThe first argument, representing the length, is mandatory. However, the second argument representing the capacity is optional. Figure 1 shows the result of this code in memory.
Figure 1: A three-length, six-capacity slice. In this case, make creates an array of six elements (the capacity). But because the length was set to 3, Go initializes only the first three elements. Also, because the slice is an []int type, the first three elements are initialized to the zeroed value of an int: 0. The grayed elements are allocated but not yet used.
If we print this slice, we get the elements within the range of the length, [0 0 0]. If we set s[1] to 1, the second element of the slice updates without impacting its length or capacity. Figure 2 illustrates this.
Figure 2: Updating the slice\\u2019s second element: s[1] = 1. However, accessing an element outside the length range is forbidden, even though it\\u2019s already allocated in memory. For example, s[4] = 0 would lead to the following panic:
panic: runtime error: index out of range [4] with length 3\\nHow can we use the remaining space of the slice? By using the append built-in function:
s = append(s, 2)\\nThis code appends to the existing s slice a new element. It uses the first grayed element (which was allocated but not yet used) to store element 2, as figure 3 shows.
Figure 3: Appending an element to s. The length of the slice is updated from 3 to 4 because the slice now contains four elements. Now, what happens if we add three more elements so that the backing array isn\\u2019t large enough?
s = append(s, 3, 4, 5)\\nfmt.Println(s)\\nIf we run this code, we see that the slice was able to cope with our request:
[0 1 0 2 3 4 5]\\nBecause an array is a fixed-size structure, it can store the new elements until element 4. When we want to insert element 5, the array is already full: Go internally creates another array by doubling the capacity, copying all the elements, and then inserting element 5. Figure 4 shows this process.
Figure 4: Because the initial backing array is full, Go creates another array and copies all the elements. The slice now references the new backing array. What will happen to the previous backing array? If it\\u2019s no longer referenced, it\\u2019s eventually freed by the garbage collector (GC) if allocated on the heap. (We discuss heap memory in mistake #95, \\u201cNot understanding stack vs. heap,\\u201d and we look at how the GC works in mistake #99, \\u201cNot understanding how the GC works.\\u201d)
What happens with slicing? Slicing is an operation done on an array or a slice, providing a half-open range; the first index is included, whereas the second is excluded. The following example shows the impact, and figure 5 displays the result in memory:
s1 := make([]int, 3, 6) // Three-length, six-capacity slice\\ns2 := s1[1:3] // Slicing from indices 1 to 3\\n
Figure 5: The slices s1 and s2 reference the same backing array with different lengths and capacities. First, s1 is created as a three-length, six-capacity slice. When s2 is created by slicing s1, both slices reference the same backing array. However, s2 starts from a different index, 1. Therefore, its length and capacity (a two-length, five-capacity slice) differ from s1. If we update s1[1] or s2[0], the change is made to the same array, hence, visible in both slices, as figure 6 shows.
Figure 6: Because s1 and s2 are backed by the same array, updating a common element makes the change visible in both slices. Now, what happens if we append an element to s2? Does the following code change s1 as well?
s2 = append(s2, 2)\\nThe shared backing array is modified, but only the length of s2 changes. Figure 7 shows the result of appending an element to s2.
Figure 7: Appending an element to s2. s1 remains a three-length, six-capacity slice. Therefore, if we print s1 and s2, the added element is only visible for s2:
s1=[0 1 0], s2=[1 0 2]\\nIt\\u2019s important to understand this behavior so that we don\\u2019t make wrong assumptions while using append.
Note In these examples, the backing array is internal and not available directly to the Go developer. The only exception is when a slice is created from slicing an existing array.
One last thing to note: what if we keep appending elements to s2 until the backing array is full? What will the state be, memory-wise? Let\\u2019s add three more elements so that the backing array will not have enough capacity:
s2 = append(s2, 3)\\ns2 = append(s2, 4) // At this stage, the backing is already full\\ns2 = append(s2, 5)\\nThis code leads to creating another backing array. Figure 8 displays the results in memory.
Figure 8: Appending elements to s2 until the backing array is full. s1 and s2 now reference two different arrays. As s1 is still a three-length, six-capacity slice, it still has some available buffer, so it keeps referencing the initial array. Also, the new backing array was made by copying the initial one from the first index of s2. That\\u2019s why the new array starts with element 1, not 0.
To summarize, the slice length is the number of available elements in the slice, whereas the slice capacity is the number of elements in the backing array. Adding an element to a full slice (length == capacity) leads to creating a new backing array with a new capacity, copying all the elements from the previous array, and updating the slice pointer to the new array.
\"},{\"location\":\"28-maps-memory-leaks/\",\"title\":\"Maps and memory leaks (#28)\",\"text\":\"\"},{\"location\":\"28-maps-memory-leaks/#maps-and-memory-leaks\",\"title\":\"Maps and memory leaks\",\"text\":\"When working with maps in Go, we need to understand some important characteristics of how a map grows and shrinks. Let\\u2019s delve into this to prevent issues that can cause memory leaks.
First, to view a concrete example of this problem, let\\u2019s design a scenario where we will work with the following map:
m := make(map[int][128]byte)\\nEach value of m is an array of 128 bytes. We will do the following:
Allocate an empty map. Add 1 million elements. Remove all the elements, and run a Garbage Collection (GC). After each step, we want to print the size of the heap (using a printAlloc utility function). This shows us how this example behaves memory-wise:
func main() {\\n n := 1_000_000\\n m := make(map[int][128]byte)\\n printAlloc()\\n\\n for i := 0; i < n; i++ { // Adds 1 million elements\\n m[i] = [128]byte{}\\n }\\n printAlloc()\\n\\n for i := 0; i < n; i++ { // Deletes 1 million elements\\n delete(m, i)\\n }\\n\\n runtime.GC() // Triggers a manual GC\\n printAlloc()\\n runtime.KeepAlive(m) // Keeps a reference to m so that the map isn\\u2019t collected\\n}\\n\\nfunc printAlloc() {\\n var m runtime.MemStats\\n runtime.ReadMemStats(&m)\\n fmt.Printf(\\\"%d MB\\\\n\\\", m.Alloc/(1024*1024))\\n}\\nWe allocate an empty map, add 1 million elements, remove 1 million elements, and then run a GC. We also make sure to keep a reference to the map using runtime.KeepAlive so that the map isn\\u2019t collected as well. Let\\u2019s run this example:
0 MB <-- After m is allocated\\n461 MB <-- After we add 1 million elements\\n293 MB <-- After we remove 1 million elements\\nWhat can we observe? At first, the heap size is minimal. Then it grows significantly after having added 1 million elements to the map. But if we expected the heap size to decrease after removing all the elements, this isn\\u2019t how maps work in Go. In the end, even though the GC has collected all the elements, the heap size is still 293 MB. So the memory shrunk, but not as we might have expected. What\\u2019s the rationale? We need to delve into how a map works in Go.
A map provides an unordered collection of key-value pairs in which all the keys are distinct. In Go, a map is based on the hash table data structure: an array where each element is a pointer to a bucket of key-value pairs, as shown in figure 1.
Figure 1: A hash table example with a focus on bucket 0. Each bucket is a fixed-size array of eight elements. In the case of an insertion into a bucket that is already full (a bucket overflow), Go creates another bucket of eight elements and links the previous one to it. Figure 2 shows an example:
Figure 2: In case of a bucket overflow, Go allocates a new bucket and links the previous bucket to it. Under the hood, a Go map is a pointer to a runtime.hmap struct. This struct contains multiple fields, including a B field, giving the number of buckets in the map:
type hmap struct {\\n B uint8 // log_2 of # of buckets\\n // (can hold up to loadFactor * 2^B items)\\n // ...\\n}\\nAfter adding 1 million elements, the value of B equals 18, which means 2\\u00b9\\u2078 = 262,144 buckets. When we remove 1 million elements, what\\u2019s the value of B? Still 18. Hence, the map still contains the same number of buckets.
The reason is that the number of buckets in a map cannot shrink. Therefore, removing elements from a map doesn\\u2019t impact the number of existing buckets; it just zeroes the slots in the buckets. A map can only grow and have more buckets; it never shrinks.
In the previous example, we went from 461 MB to 293 MB because the elements were collected, but running the GC didn\\u2019t impact the map itself. Even the number of extra buckets (the buckets created because of overflows) remains the same.
Let\\u2019s take a step back and discuss when the fact that a map cannot shrink can be a problem. Imagine building a cache using a map[int][128]byte. This map holds per customer ID (the int), a sequence of 128 bytes. Now, suppose we want to save the last 1,000 customers. The map size will remain constant, so we shouldn\\u2019t worry about the fact that a map cannot shrink.
However, let\\u2019s say we want to store one hour of data. Meanwhile, our company has decided to have a big promotion for Black Friday: in one hour, we may have millions of customers connected to our system. But a few days after Black Friday, our map will contain the same number of buckets as during the peak time. This explains why we can experience high memory consumption that doesn\\u2019t significantly decrease in such a scenario.
What are the solutions if we don\\u2019t want to manually restart our service to clean the amount of memory consumed by the map? One solution could be to re-create a copy of the current map at a regular pace. For example, every hour, we can build a new map, copy all the elements, and release the previous one. The main drawback of this option is that following the copy and until the next garbage collection, we may consume twice the current memory for a short period.
Another solution would be to change the map type to store an array pointer: map[int]*[128]byte. It doesn\\u2019t solve the fact that we will have a significant number of buckets; however, each bucket entry will reserve the size of a pointer for the value instead of 128 bytes (8 bytes on 64-bit systems and 4 bytes on 32-bit systems).
Coming back to the original scenario, let\\u2019s compare the memory consumption for each map type following each step. The following table shows the comparison.
Step map[int][128]byte map[int]*[128]byte Allocate an empty map 0 MB 0 MB Add 1 million elements 461 MB 182 MB Remove all the elements and run a GC 293 MB 38 MB Note If a key or a value is over 128 bytes, Go won\\u2019t store it directly in the map bucket. Instead, Go stores a pointer to reference the key or the value.
As we have seen, adding n elements to a map and then deleting all the elements means keeping the same number of buckets in memory. So, we must remember that because a Go map can only grow in size, so does its memory consumption. There is no automated strategy to shrink it. If this leads to high memory consumption, we can try different options such as forcing Go to re-create the map or using pointers to check if it can be optimized.
\"},{\"location\":\"5-interface-pollution/\",\"title\":\"Interface pollution (#5)\",\"text\":\"\"},{\"location\":\"5-interface-pollution/#interface-pollution\",\"title\":\"Interface pollution\",\"text\":\"Interfaces are one of the cornerstones of the Go language when designing and structuring our code. However, like many tools or concepts, abusing them is generally not a good idea. Interface pollution is about overwhelming our code with unnecessary abstractions, making it harder to understand. It\\u2019s a common mistake made by developers coming from another language with different habits. Before delving into the topic, let\\u2019s refresh our minds about Go\\u2019s interfaces. Then, we will see when it\\u2019s appropriate to use interfaces and when it may be considered pollution.
\"},{\"location\":\"5-interface-pollution/#concepts\",\"title\":\"Concepts\",\"text\":\"An interface provides a way to specify the behavior of an object. We use interfaces to create common abstractions that multiple objects can implement. What makes Go interfaces so different is that they are satisfied implicitly. There is no explicit keyword like implements to mark that an object X implements interface Y.
To understand what makes interfaces so powerful, we will dig into two popular ones from the standard library: io.Reader and io.Writer. The io package provides abstractions for I/O primitives. Among these abstractions, io.Reader relates to reading data from a data source and io.Writer to writing data to a target, as represented in the next figure:
The io.Reader contains a single Read method:
type Reader interface {\\n Read(p []byte) (n int, err error)\\n}\\nCustom implementations of the io.Reader interface should accept a slice of bytes, filling it with its data and returning either the number of bytes read or an error.
On the other hand, io.Writer defines a single method, Write:
type Writer interface {\\n Write(p []byte) (n int, err error)\\n}\\nCustom implementations of io.Writer should write the data coming from a slice to a target and return either the number of bytes written or an error. Therefore, both interfaces provide fundamental abstractions:
io.Reader reads data from a sourceio.Writer writes data to a target What is the rationale for having these two interfaces in the language? What is the point of creating these abstractions?
Let\\u2019s assume we need to implement a function that should copy the content of one file to another. We could create a specific function that would take as input two *os.File. Or, we can choose to create a more generic function using io.Reader and io.Writer abstractions:
func copySourceToDest(source io.Reader, dest io.Writer) error {\\n // ...\\n}\\nThis function would work with *os.File parameters (as *os.File implements both io.Reader and io.Writer) and any other type that would implement these interfaces. For example, we could create our own io.Writer that writes to a database, and the code would remain the same. It increases the genericity of the function; hence, its reusability.
Furthermore, writing a unit test for this function is easier because, instead of having to handle files, we can use the strings and bytes packages that provide helpful implementations:
func TestCopySourceToDest(t *testing.T) {\\n const input = \\\"foo\\\"\\n source := strings.NewReader(input) // Creates an io.Reader\\n dest := bytes.NewBuffer(make([]byte, 0)) // Creates an io.Writer\\n\\n err := copySourceToDest(source, dest) // Calls copySourceToDest from a *strings.Reader and a *bytes.Buffer\\n if err != nil {\\n t.FailNow()\\n }\\n\\n got := dest.String()\\n if got != input {\\n t.Errorf(\\\"expected: %s, got: %s\\\", input, got)\\n }\\n}\\nIn the example, source is a *strings.Reader, whereas dest is a *bytes.Buffer. Here, we test the behavior of copySourceToDest without creating any files.
While designing interfaces, the granularity (how many methods the interface contains) is also something to keep in mind. A known proverb in Go relates to how big an interface should be:
Rob Pike
The bigger the interface, the weaker the abstraction.
Indeed, adding methods to an interface can decrease its level of reusability. io.Reader and io.Writer are powerful abstractions because they cannot get any simpler. Furthermore, we can also combine fine-grained interfaces to create higher-level abstractions. This is the case with io.ReadWriter, which combines the reader and writer behaviors:
type ReadWriter interface {\\n Reader\\n Writer\\n}\\nAs Einstein said, \\u201cEverything should be made as simple as possible, but no simpler.\\u201d Applied to interfaces, this denotes that finding the perfect granularity for an interface isn\\u2019t necessarily a straightforward process.
Let\\u2019s now discuss common cases where interfaces are recommended.
\"},{\"location\":\"5-interface-pollution/#when-to-use-interfaces\",\"title\":\"When to use interfaces\",\"text\":\"When should we create interfaces in Go? Let\\u2019s look at three concrete use cases where interfaces are usually considered to bring value. Note that the goal isn\\u2019t to be exhaustive because the more cases we add, the more they would depend on the context. However, these three cases should give us a general idea:
Common behavior Decoupling Restricting behavior \"},{\"location\":\"5-interface-pollution/#common-behavior\",\"title\":\"Common behavior\",\"text\":\"The first option we will discuss is to use interfaces when multiple types implement a common behavior. In such a case, we can factor out the behavior inside an interface. If we look at the standard library, we can find many examples of such a use case. For example, sorting a collection can be factored out via three methods:
Retrieving the number of elements in the collection Reporting whether one element must be sorted before another Swapping two elements Hence, the following interface was added to the sort package:
type Interface interface {\\n Len() int // Number of elements\\n Less(i, j int) bool // Checks two elements\\n Swap(i, j int) // Swaps two elements\\n}\\nThis interface has a strong potential for reusability because it encompasses the common behavior to sort any collection that is index-based.
Throughout the sort package, we can find dozens of implementations. If at some point we compute a collection of integers, for example, and we want to sort it, are we necessarily interested in the implementation type? Is it important whether the sorting algorithm is a merge sort or a quicksort? In many cases, we don\\u2019t care. Hence, the sorting behavior can be abstracted, and we can depend on the sort.Interface.
Finding the right abstraction to factor out a behavior can also bring many benefits. For example, the sort package provides utility functions that also rely on sort.Interface, such as checking whether a collection is already sorted. For instance:
func IsSorted(data Interface) bool {\\n n := data.Len()\\n for i := n - 1; i > 0; i-- {\\n if data.Less(i, i-1) {\\n return false\\n }\\n }\\n return true\\n}\\nBecause sort.Interface is the right level of abstraction, it makes it highly valuable.
Let\\u2019s now see another main use case when using interfaces.
\"},{\"location\":\"5-interface-pollution/#decoupling\",\"title\":\"Decoupling\",\"text\":\"Another important use case is about decoupling our code from an implementation. If we rely on an abstraction instead of a concrete implementation, the implementation itself can be replaced with another without even having to change our code. This is the Liskov Substitution Principle (the L in Robert C. Martin\\u2019s SOLID design principles).
One benefit of decoupling can be related to unit testing. Let\\u2019s assume we want to implement a CreateNewCustomer method that creates a new customer and stores it. We decide to rely on the concrete implementation directly (let\\u2019s say a mysql.Store struct):
type CustomerService struct {\\n store mysql.Store // Depends on the concrete implementation\\n}\\n\\nfunc (cs CustomerService) CreateNewCustomer(id string) error {\\n customer := Customer{id: id}\\n return cs.store.StoreCustomer(customer)\\n}\\nNow, what if we want to test this method? Because customerService relies on the actual implementation to store a Customer, we are obliged to test it through integration tests, which requires spinning up a MySQL instance (unless we use an alternative technique such as go-sqlmock, but this isn\\u2019t the scope of this section). Although integration tests are helpful, that\\u2019s not always what we want to do. To give us more flexibility, we should decouple CustomerService from the actual implementation, which can be done via an interface like so:
type customerStorer interface { // Creates a storage abstraction\\n StoreCustomer(Customer) error\\n}\\n\\ntype CustomerService struct {\\n storer customerStorer // Decouples CustomerService from the actual implementation\\n}\\n\\nfunc (cs CustomerService) CreateNewCustomer(id string) error {\\n customer := Customer{id: id}\\n return cs.storer.StoreCustomer(customer)\\n}\\nBecause storing a customer is now done via an interface, this gives us more flexibility in how we want to test the method. For instance, we can:
Use the concrete implementation via integration tests Use a mock (or any kind of test double) via unit tests Or both Let\\u2019s now discuss another use case: to restrict a behavior.
\"},{\"location\":\"5-interface-pollution/#restricting-behavior\",\"title\":\"Restricting behavior\",\"text\":\"The last use case we will discuss can be pretty counterintuitive at first sight. It\\u2019s about restricting a type to a specific behavior. Let\\u2019s imagine we implement a custom configuration package to deal with dynamic configuration. We create a specific container for int configurations via an IntConfig struct that also exposes two methods: Get and Set. Here\\u2019s how that code would look:
type IntConfig struct {\\n // ...\\n}\\n\\nfunc (c *IntConfig) Get() int {\\n // Retrieve configuration\\n}\\n\\nfunc (c *IntConfig) Set(value int) {\\n // Update configuration\\n}\\nNow, suppose we receive an IntConfig that holds some specific configuration, such as a threshold. Yet, in our code, we are only interested in retrieving the configuration value, and we want to prevent updating it. How can we enforce that, semantically, this configuration is read-only, if we don\\u2019t want to change our configuration package? By creating an abstraction that restricts the behavior to retrieving only a config value:
type intConfigGetter interface {\\n Get() int\\n}\\nThen, in our code, we can rely on intConfigGetter instead of the concrete implementation:
type Foo struct {\\n threshold intConfigGetter\\n}\\n\\nfunc NewFoo(threshold intConfigGetter) Foo { // Injects the configuration getter\\n return Foo{threshold: threshold}\\n}\\n\\nfunc (f Foo) Bar() {\\n threshold := f.threshold.Get() // Reads the configuration\\n // ...\\n}\\nIn this example, the configuration getter is injected into the NewFoo factory method. It doesn\\u2019t impact a client of this function because it can still pass an IntConfig struct as it implements intConfigGetter. Then, we can only read the configuration in the Bar method, not modify it. Therefore, we can also use interfaces to restrict a type to a specific behavior for various reasons, such as semantics enforcement.
In this section, we saw three potential use cases where interfaces are generally considered as bringing value: factoring out a common behavior, creating some decoupling, and restricting a type to a certain behavior. Again, this list isn\\u2019t exhaustive, but it should give us a general understanding of when interfaces are helpful in Go.
Now, let\\u2019s finish this section and discuss the problems with interface pollution.
\"},{\"location\":\"5-interface-pollution/#interface-pollution_1\",\"title\":\"Interface pollution\",\"text\":\"It\\u2019s fairly common to see interfaces being overused in Go projects. Perhaps the developer\\u2019s background was C# or Java, and they found it natural to create interfaces before concrete types. However, this isn\\u2019t how things should work in Go.
As we discussed, interfaces are made to create abstractions. And the main caveat when programming meets abstractions is remembering that abstractions should be discovered, not created. What does this mean? It means we shouldn\\u2019t start creating abstractions in our code if there is no immediate reason to do so. We shouldn\\u2019t design with interfaces but wait for a concrete need. Said differently, we should create an interface when we need it, not when we foresee that we could need it.
What\\u2019s the main problem if we overuse interfaces? The answer is that they make the code flow more complex. Adding a useless level of indirection doesn\\u2019t bring any value; it creates a worthless abstraction making the code more difficult to read, understand, and reason about. If we don\\u2019t have a strong reason for adding an interface and it\\u2019s unclear how an interface makes a code better, we should challenge this interface\\u2019s purpose. Why not call the implementation directly?
Note We may also experience performance overhead when calling a method through an interface. It requires a lookup in a hash table\\u2019s data structure to find the concrete type an interface points to. But this isn\\u2019t an issue in many contexts as the overhead is minimal.
In summary, we should be cautious when creating abstractions in our code\\u2014abstractions should be discovered, not created. It\\u2019s common for us, software developers, to overengineer our code by trying to guess what the perfect level of abstraction is, based on what we think we might need later. This process should be avoided because, in most cases, it pollutes our code with unnecessary abstractions, making it more complex to read.
Rob Pike
Don\\u2019t design with interfaces, discover them.
Let\\u2019s not try to solve a problem abstractly but solve what has to be solved now. Last, but not least, if it\\u2019s unclear how an interface makes the code better, we should probably consider removing it to make our code simpler.
\"},{\"location\":\"56-concurrency-faster/\",\"title\":\"Thinking concurrency is always faster (#56)\",\"text\":\"\"},{\"location\":\"56-concurrency-faster/#thinking-concurrency-is-always-faster\",\"title\":\"Thinking concurrency is always faster\",\"text\":\"A misconception among many developers is believing that a concurrent solution is always faster than a sequential one. This couldn\\u2019t be more wrong. The overall performance of a solution depends on many factors, such as the efficiency of our code structure (concurrency), which parts can be tackled in parallel, and the level of contention among the computation units. This post reminds us about some fundamental knowledge of concurrency in Go; then we will see a concrete example where a concurrent solution isn\\u2019t necessarily faster.
\"},{\"location\":\"56-concurrency-faster/#go-scheduling\",\"title\":\"Go Scheduling\",\"text\":\"A thread is the smallest unit of processing that an OS can perform. If a process wants to execute multiple actions simultaneously, it spins up multiple threads. These threads can be:
Concurrent \\u2014 Two or more threads can start, run, and complete in overlapping time periods. Parallel \\u2014 The same task can be executed multiple times at once. The OS is responsible for scheduling the thread\\u2019s processes optimally so that:
All the threads can consume CPU cycles without being starved for too much time. The workload is distributed as evenly as possible among the different CPU cores. Note The word thread can also have a different meaning at a CPU level. Each physical core can be composed of multiple logical cores (the concept of hyper-threading), and a logical core is also called a thread. In this post, when we use the word thread, we mean the unit of processing, not a logical core.
A CPU core executes different threads. When it switches from one thread to another, it executes an operation called context switching. The active thread consuming CPU cycles was in an executing state and moves to a runnable state, meaning it\\u2019s ready to be executed pending an available core. Context switching is considered an expensive operation because the OS needs to save the current execution state of a thread before the switch (such as the current register values).
As Go developers, we can\\u2019t create threads directly, but we can create goroutines, which can be thought of as application-level threads. However, whereas an OS thread is context-switched on and off a CPU core by the OS, a goroutine is context-switched on and off an OS thread by the Go runtime. Also, compared to an OS thread, a goroutine has a smaller memory footprint: 2 KB for goroutines from Go 1.4. An OS thread depends on the OS, but, for example, on Linux/x86\\u201332, the default size is 2 MB (see https://man7.org/linux/man-pages/man3/pthread_create.3.html). Having a smaller size makes context switching faster.
Note Context switching a goroutine versus a thread is about 80% to 90% faster, depending on the architecture.
Let\\u2019s now discuss how the Go scheduler works to overview how goroutines are handled. Internally, the Go scheduler uses the following terminology (see proc.go):
G \\u2014 Goroutine M \\u2014 OS thread (stands for machine) P \\u2014 CPU core (stands for processor) Each OS thread (M) is assigned to a CPU core (P) by the OS scheduler. Then, each goroutine (G) runs on an M. The GOMAXPROCS variable defines the limit of Ms in charge of executing user-level code simultaneously. But if a thread is blocked in a system call (for example, I/O), the scheduler can spin up more Ms. As of Go 1.5, GOMAXPROCS is by default equal to the number of available CPU cores.
A goroutine has a simpler lifecycle than an OS thread. It can be doing one of the following:
Executing \\u2014 The goroutine is scheduled on an M and executing its instructions. Runnable \\u2014 The goroutine is waiting to be in an executing state. Waiting \\u2014 The goroutine is stopped and pending something completing, such as a system call or a synchronization operation (such as acquiring a mutex). There\\u2019s one last stage to understand about the implementation of Go scheduling: when a goroutine is created but cannot be executed yet; for example, all the other Ms are already executing a G. In this scenario, what will the Go runtime do about it? The answer is queuing. The Go runtime handles two kinds of queues: one local queue per P and a global queue shared among all the Ps.
Figure 1 shows a given scheduling situation on a four-core machine with GOMAXPROCS equal to 4. The parts are the logical cores (Ps), goroutines (Gs), OS threads (Ms), local queues, and global queue:
Figure 1: An example of the current state of a Go application executed on a four-core machine. Goroutines that aren\\u2019t in an executing state are either runnable (pending being executed) or waiting (pending a blocking operation) First, we can see five Ms, whereas GOMAXPROCS is set to 4. But as we mentioned, if needed, the Go runtime can create more OS threads than the GOMAXPROCS value.
P0, P1, and P3 are currently busy executing Go runtime threads. But P2 is presently idle as M3 is switched off P2, and there\\u2019s no goroutine to be executed. This isn\\u2019t a good situation because six runnable goroutines are pending being executed, some in the global queue and some in other local queues. How will the Go runtime handle this situation? Here\\u2019s the scheduling implementation in pseudocode (see proc.go):
runtime.schedule() {\\n // Only 1/61 of the time, check the global runnable queue for a G.\\n // If not found, check the local queue.\\n // If not found,\\n // Try to steal from other Ps.\\n // If not, check the global runnable queue.\\n // If not found, poll network.\\n}\\nEvery sixty-first execution, the Go scheduler will check whether goroutines from the global queue are available. If not, it will check its local queue. Meanwhile, if both the global and local queues are empty, the Go scheduler can pick up goroutines from other local queues. This principle in scheduling is called work stealing, and it allows an underutilized processor to actively look for another processor\\u2019s goroutines and steal some.
One last important thing to mention: prior to Go 1.14, the scheduler was cooperative, which meant a goroutine could be context-switched off a thread only in specific blocking cases (for example, channel send or receive, I/O, waiting to acquire a mutex). Since Go 1.14, the Go scheduler is now preemptive: when a goroutine is running for a specific amount of time (10 ms), it will be marked preemptible and can be context-switched off to be replaced by another goroutine. This allows a long-running job to be forced to share CPU time.
Now that we understand the fundamentals of scheduling in Go, let\\u2019s look at a concrete example: implementing a merge sort in a parallel manner.
\"},{\"location\":\"56-concurrency-faster/#parallel-merge-sort\",\"title\":\"Parallel Merge Sort\",\"text\":\"First, let\\u2019s briefly review how the merge sort algorithm works. Then we will implement a parallel version. Note that the objective isn\\u2019t to implement the most efficient version but to support a concrete example showing why concurrency isn\\u2019t always faster.
The merge sort algorithm works by breaking a list repeatedly into two sublists until each sublist consists of a single element and then merging these sublists so that the result is a sorted list (see figure 2). Each split operation splits the list into two sublists, whereas the merge operation merges two sublists into a sorted list.
Figure 2: Applying the merge sort algorithm repeatedly breaks each list into two sublists. Then the algorithm uses a merge operation such that the resulting list is sorted Here is the sequential implementation of this algorithm. We don\\u2019t include all of the code as it\\u2019s not the main point of this section:
func sequentialMergesort(s []int) {\\n if len(s) <= 1 {\\n return\\n }\\n\\n middle := len(s) / 2\\n sequentialMergesort(s[:middle]) // First half\\n sequentialMergesort(s[middle:]) // Second half\\n merge(s, middle) // Merges the two halves\\n}\\n\\nfunc merge(s []int, middle int) {\\n // ...\\n}\\nThis algorithm has a structure that makes it open to concurrency. Indeed, as each sequentialMergesort operation works on an independent set of data that doesn\\u2019t need to be fully copied (here, an independent view of the underlying array using slicing), we could distribute this workload among the CPU cores by spinning up each sequentialMergesort operation in a different goroutine. Let\\u2019s write a first parallel implementation:
func parallelMergesortV1(s []int) {\\n if len(s) <= 1 {\\n return\\n }\\n\\n middle := len(s) / 2\\n\\n var wg sync.WaitGroup\\n wg.Add(2)\\n\\n go func() { // Spins up the first half of the work in a goroutine\\n defer wg.Done()\\n parallelMergesortV1(s[:middle])\\n }()\\n\\n go func() { // Spins up the second half of the work in a goroutine\\n defer wg.Done()\\n parallelMergesortV1(s[middle:])\\n }()\\n\\n wg.Wait()\\n merge(s, middle) // Merges the halves\\n}\\nIn this version, each half of the workload is handled in a separate goroutine. The parent goroutine waits for both parts by using sync.WaitGroup. Hence, we call the Wait method before the merge operation.
We now have a parallel version of the merge sort algorithm. Therefore, if we run a benchmark to compare this version against the sequential one, the parallel version should be faster, correct? Let\\u2019s run it on a four-core machine with 10,000 elements:
Benchmark_sequentialMergesort-4 2278993555 ns/op\\nBenchmark_parallelMergesortV1-4 17525998709 ns/op\\nSurprisingly, the parallel version is almost an order of magnitude slower. How can we explain this result? How is it possible that a parallel version that distributes a workload across four cores is slower than a sequential version running on a single machine? Let\\u2019s analyze the problem.
If we have a slice of, say, 1,024 elements, the parent goroutine will spin up two goroutines, each in charge of handling a half consisting of 512 elements. Each of these goroutines will spin up two new goroutines in charge of handling 256 elements, then 128, and so on, until we spin up a goroutine to compute a single element.
If the workload that we want to parallelize is too small, meaning we\\u2019re going to compute it too fast, the benefit of distributing a job across cores is destroyed: the time it takes to create a goroutine and have the scheduler execute it is much too high compared to directly merging a tiny number of items in the current goroutine. Although goroutines are lightweight and faster to start than threads, we can still face cases where a workload is too small.
So what can we conclude from this result? Does it mean the merge sort algorithm cannot be parallelized? Wait, not so fast.
Let\\u2019s try another approach. Because merging a tiny number of elements within a new goroutine isn\\u2019t efficient, let\\u2019s define a threshold. This threshold will represent how many elements a half should contain in order to be handled in a parallel manner. If the number of elements in the half is fewer than this value, we will handle it sequentially. Here\\u2019s a new version:
const max = 2048 // Defines the threshold\\n\\nfunc parallelMergesortV2(s []int) {\\n if len(s) <= 1 {\\n return\\n }\\n\\n if len(s) <= max {\\n sequentialMergesort(s) // Calls our initial sequential version\\n } else { // If bigger than the threshold, keeps the parallel version\\n middle := len(s) / 2\\n\\n var wg sync.WaitGroup\\n wg.Add(2)\\n\\n go func() {\\n defer wg.Done()\\n parallelMergesortV2(s[:middle])\\n }()\\n\\n go func() {\\n defer wg.Done()\\n parallelMergesortV2(s[middle:])\\n }()\\n\\n wg.Wait()\\n merge(s, middle)\\n }\\n}\\nIf the number of elements in the s slice is smaller than max, we call the sequential version. Otherwise, we keep calling our parallel implementation. Does this approach impact the result? Yes, it does:
Benchmark_sequentialMergesort-4 2278993555 ns/op\\nBenchmark_parallelMergesortV1-4 17525998709 ns/op\\nBenchmark_parallelMergesortV2-4 1313010260 ns/op\\nOur v2 parallel implementation is more than 40% faster than the sequential one, thanks to this idea of defining a threshold to indicate when parallel should be more efficient than sequential.
Note Why did I set the threshold to 2,048? Because it was the optimal value for this specific workload on my machine. In general, such magic values should be defined carefully with benchmarks (running on an execution environment similar to production). It\\u2019s also pretty interesting to note that running the same algorithm in a programming language that doesn\\u2019t implement the concept of goroutines has an impact on the value. For example, running the same example in Java using threads means an optimal value closer to 8,192. This tends to illustrate how goroutines are more efficient than threads.
\"},{\"location\":\"56-concurrency-faster/#conclusion\",\"title\":\"Conclusion\",\"text\":\"We have seen throughout this post the fundamental concepts of scheduling in Go: the differences between a thread and a goroutine and how the Go runtime schedules goroutines. Meanwhile, using the parallel merge sort example, we illustrated that concurrency isn\\u2019t always necessarily faster. As we have seen, spinning up goroutines to handle minimal workloads (merging only a small set of elements) demolishes the benefit we could get from parallelism.
So, where should we go from here? We must keep in mind that concurrency isn\\u2019t always faster and shouldn\\u2019t be considered the default way to go for all problems. First, it makes things more complex. Also, modern CPUs have become incredibly efficient at executing sequential code and predictable code. For example, a superscalar processor can parallelize instruction execution over a single core with high efficiency.
Does this mean we shouldn\\u2019t use concurrency? Of course not. However, it\\u2019s essential to keep these conclusions in mind. If we\\u2019re not sure that a parallel version will be faster, the right approach may be to start with a simple sequential version and build from there using profiling (mistake #98, \\u201cNot using Go diagnostics tooling\\u201d) and benchmarks (mistake #89, \\u201cWriting inaccurate benchmarks\\u201d), for example. It can be the only way to ensure that a concurrent implementation is worth it.
\"},{\"location\":\"89-benchmarks/\",\"title\":\"Writing inaccurate benchmarks (#89)\",\"text\":\"\"},{\"location\":\"89-benchmarks/#writing-inaccurate-benchmarks\",\"title\":\"Writing inaccurate benchmarks\",\"text\":\"In general, we should never guess about performance. When writing optimizations, so many factors may come into play that even if we have a strong opinion about the results, it\\u2019s rarely a bad idea to test them. However, writing benchmarks isn\\u2019t straightforward. It can be pretty simple to write inaccurate benchmarks and make wrong assumptions based on them. The goal of this post is to examine four common and concrete traps leading to inaccuracy:
Not resetting or pausing the timer Making wrong assumptions about micro-benchmarks Not being careful about compiler optimizations Being fooled by the observer effect \"},{\"location\":\"89-benchmarks/#general-concepts\",\"title\":\"General concepts\",\"text\":\"Before discussing these traps, let\\u2019s briefly review how benchmarks work in Go. The skeleton of a benchmark is as follows:
func BenchmarkFoo(b *testing.B) {\\n for i := 0; i < b.N; i++ {\\n foo()\\n }\\n}\\nThe function name starts with the Benchmark prefix. The function under test (foo) is called within the for loop. b.N represents a variable number of iterations. When running a benchmark, Go tries to make it match the requested benchmark time. The benchmark time is set by default to 1 second and can be changed with the -benchtime flag. b.N starts at 1; if the benchmark completes in under 1 second, b.N is increased, and the benchmark runs again until b.N roughly matches benchtime:
$ go test -bench=.\\ncpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkFoo-4 73 16511228 ns/op\\nHere, the benchmark took about 1 second, and foo was executed 73 times, for an average execution time of 16,511,228 nanoseconds. We can change the benchmark time using -benchtime:
$ go test -bench=. -benchtime=2s\\nBenchmarkFoo-4 150 15832169 ns/op\\nfoo was executed roughly twice more than during the previous benchmark.
Next, let\\u2019s look at some common traps.
\"},{\"location\":\"89-benchmarks/#not-resetting-or-pausing-the-timer\",\"title\":\"Not resetting or pausing the timer\",\"text\":\"In some cases, we need to perform operations before the benchmark loop. These operations may take quite a while (for example, generating a large slice of data) and may significantly impact the benchmark results:
func BenchmarkFoo(b *testing.B) {\\n expensiveSetup()\\n for i := 0; i < b.N; i++ {\\n functionUnderTest()\\n }\\n}\\nIn this case, we can use the ResetTimer method before entering the loop:
func BenchmarkFoo(b *testing.B) {\\n expensiveSetup()\\n b.ResetTimer() // Reset the benchmark timer\\n for i := 0; i < b.N; i++ {\\n functionUnderTest()\\n }\\n}\\nCalling ResetTimer zeroes the elapsed benchmark time and memory allocation counters since the beginning of the test. This way, an expensive setup can be discarded from the test results.
What if we have to perform an expensive setup not just once but within each loop iteration?
func BenchmarkFoo(b *testing.B) {\\n for i := 0; i < b.N; i++ {\\n expensiveSetup()\\n functionUnderTest()\\n }\\n}\\nWe can\\u2019t reset the timer, because that would be executed during each loop iteration. But we can stop and resume the benchmark timer, surrounding the call to expensiveSetup:
func BenchmarkFoo(b *testing.B) {\\n for i := 0; i < b.N; i++ {\\n b.StopTimer() // Pause the benchmark timer\\n expensiveSetup()\\n b.StartTimer() // Resume the benchmark timer\\n functionUnderTest()\\n }\\n}\\nHere, we pause the benchmark timer to perform the expensive setup and then resume the timer.
Note There\\u2019s one catch to remember about this approach: if the function under test is too fast to execute compared to the setup function, the benchmark may take too long to complete. The reason is that it would take much longer than 1 second to reach benchtime. Calculating the benchmark time is based solely on the execution time of functionUnderTest. So, if we wait a significant time in each loop iteration, the benchmark will be much slower than 1 second. If we want to keep the benchmark, one possible mitigation is to decrease benchtime.
We must be sure to use the timer methods to preserve the accuracy of a benchmark.
\"},{\"location\":\"89-benchmarks/#making-wrong-assumptions-about-micro-benchmarks\",\"title\":\"Making wrong assumptions about micro-benchmarks\",\"text\":\"A micro-benchmark measures a tiny computation unit, and it can be extremely easy to make wrong assumptions about it. Let\\u2019s say, for example, that we aren\\u2019t sure whether to use atomic.StoreInt32 or atomic.StoreInt64 (assuming that the values we handle will always fit in 32 bits). We want to write a benchmark to compare both functions:
func BenchmarkAtomicStoreInt32(b *testing.B) {\\n var v int32\\n for i := 0; i < b.N; i++ {\\n atomic.StoreInt32(&v, 1)\\n }\\n}\\n\\nfunc BenchmarkAtomicStoreInt64(b *testing.B) {\\n var v int64\\n for i := 0; i < b.N; i++ {\\n atomic.StoreInt64(&v, 1)\\n }\\n}\\nIf we run this benchmark, here\\u2019s some example output:
cpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkAtomicStoreInt32\\nBenchmarkAtomicStoreInt32-4 197107742 5.682 ns/op\\nBenchmarkAtomicStoreInt64\\nBenchmarkAtomicStoreInt64-4 213917528 5.134 ns/op\\nWe could easily take this benchmark for granted and decide to use atomic.StoreInt64 because it appears to be faster. Now, for the sake of doing a fair benchmark, we reverse the order and test atomic.StoreInt64 first, followed by atomic.StoreInt32. Here is some example output:
BenchmarkAtomicStoreInt64\\nBenchmarkAtomicStoreInt64-4 224900722 5.434 ns/op\\nBenchmarkAtomicStoreInt32\\nBenchmarkAtomicStoreInt32-4 230253900 5.159 ns/op\\nThis time, atomic.StoreInt32 has better results. What happened?
In the case of micro-benchmarks, many factors can impact the results, such as machine activity while running the benchmarks, power management, thermal scaling, and better cache alignment of a sequence of instructions. We must remember that many factors, even outside the scope of our Go project, can impact the results.
Note We should make sure the machine executing the benchmark is idle. However, external processes may run in the background, which may affect benchmark results. For that reason, tools such as perflock can limit how much CPU a benchmark can consume. For example, we can run a benchmark with 70% of the total available CPU, giving 30% to the OS and other processes and reducing the impact of the machine activity factor on the results.
One option is to increase the benchmark time using the -benchtime option. Similar to the law of large numbers in probability theory, if we run a benchmark a large number of times, it should tend to approach its expected value (assuming we omit the benefits of instructions caching and similar mechanics).
Another option is to use external tools on top of the classic benchmark tooling. For instance, the benchstat tool, which is part of the golang.org/x repository, allows us to compute and compare statistics about benchmark executions.
Let\\u2019s run the benchmark 10 times using the -count option and pipe the output to a specific file:
$ go test -bench=. -count=10 | tee stats.txt\\ncpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkAtomicStoreInt32-4 234935682 5.124 ns/op\\nBenchmarkAtomicStoreInt32-4 235307204 5.112 ns/op\\n// ...\\nBenchmarkAtomicStoreInt64-4 235548591 5.107 ns/op\\nBenchmarkAtomicStoreInt64-4 235210292 5.090 ns/op\\n// ...\\nWe can then run benchstat on this file:
$ benchstat stats.txt\\nname time/op\\nAtomicStoreInt32-4 5.10ns \\u00b1 1%\\nAtomicStoreInt64-4 5.10ns \\u00b1 1%\\nThe results are the same: both functions take on average 5.10 nanoseconds to complete. We also see the percent variation between the executions of a given benchmark: \\u00b1 1%. This metric tells us that both benchmarks are stable, giving us more confidence in the computed average results. Therefore, instead of concluding that atomic.StoreInt32 is faster or slower, we can conclude that its execution time is similar to that of atomic.StoreInt64 for the usage we tested (in a specific Go version on a particular machine).
In general, we should be cautious about micro-benchmarks. Many factors can significantly impact the results and potentially lead to wrong assumptions. Increasing the benchmark time or repeating the benchmark executions and computing stats with tools such as benchstat can be an efficient way to limit external factors and get more accurate results, leading to better conclusions.
Let\\u2019s also highlight that we should be careful about using the results of a micro-benchmark executed on a given machine if another system ends up running the application. The production system may act quite differently from the one on which we ran the micro-benchmark.
\"},{\"location\":\"89-benchmarks/#not-being-careful-about-compiler-optimizations\",\"title\":\"Not being careful about compiler optimizations\",\"text\":\"Another common mistake related to writing benchmarks is being fooled by compiler optimizations, which can also lead to wrong benchmark assumptions. In this section, we look at Go issue 14813 (https://github.com/golang/go/issues/14813, also discussed by Go project member Dave Cheney) with a population count function (a function that counts the number of bits set to 1):
const m1 = 0x5555555555555555\\nconst m2 = 0x3333333333333333\\nconst m4 = 0x0f0f0f0f0f0f0f0f\\nconst h01 = 0x0101010101010101\\n\\nfunc popcnt(x uint64) uint64 {\\n x -= (x >> 1) & m1\\n x = (x & m2) + ((x >> 2) & m2)\\n x = (x + (x >> 4)) & m4\\n return (x * h01) >> 56\\n}\\nThis function takes and returns a uint64. To benchmark this function, we can write the following:
func BenchmarkPopcnt1(b *testing.B) {\\n for i := 0; i < b.N; i++ {\\n popcnt(uint64(i))\\n }\\n}\\nHowever, if we execute this benchmark, we get a surprisingly low result:
cpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkPopcnt1-4 1000000000 0.2858 ns/op\\nA duration of 0.28 nanoseconds is roughly one clock cycle, so this number is unreasonably low. The problem is that the developer wasn\\u2019t careful enough about compiler optimizations. In this case, the function under test is simple enough to be a candidate for inlining: an optimization that replaces a function call with the body of the called function and lets us prevent a function call, which has a small footprint. Once the function is inlined, the compiler notices that the call has no side effects and replaces it with the following benchmark:
func BenchmarkPopcnt1(b *testing.B) {\\n for i := 0; i < b.N; i++ {\\n // Empty\\n }\\n}\\nThe benchmark is now empty \\u2014 which is why we got a result close to one clock cycle. To prevent this from happening, a best practice is to follow this pattern:
During each loop iteration, assign the result to a local variable (local in the context of the benchmark function). Assign the latest result to a global variable. In our case, we write the following benchmark:
var global uint64 // Define a global variable\\n\\nfunc BenchmarkPopcnt2(b *testing.B) {\\n var v uint64 // Define a local variable\\n for i := 0; i < b.N; i++ {\\n v = popcnt(uint64(i)) // Assign the result to the local variable\\n }\\n global = v // Assign the result to the global variable\\n}\\nglobal is a global variable, whereas v is a local variable whose scope is the benchmark function. During each loop iteration, we assign the result of popcnt to the local variable. Then we assign the latest result to the global variable.
Note Why not assign the result of the popcnt call directly to global to simplify the test? Writing to a global variable is slower than writing to a local variable (these concepts are discussed in 100 Go Mistakes, mistake #95: \\u201cNot understanding stack vs. heap\\u201d). Therefore, we should write each result to a local variable to limit the footprint during each loop iteration.
If we run these two benchmarks, we now get a significant difference in the results:
cpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkPopcnt1-4 1000000000 0.2858 ns/op\\nBenchmarkPopcnt2-4 606402058 1.993 ns/op\\nBenchmarkPopcnt2 is the accurate version of the benchmark. It guarantees that we avoid the inlining optimizations, which can artificially lower the execution time or even remove the call to the function under test. Relying on the results of BenchmarkPopcnt1 could have led to wrong assumptions.
Let\\u2019s remember the pattern to avoid compiler optimizations fooling benchmark results: assign the result of the function under test to a local variable, and then assign the latest result to a global variable. This best practice also prevents us from making incorrect assumptions.
\"},{\"location\":\"89-benchmarks/#being-fooled-by-the-observer-effect\",\"title\":\"Being fooled by the observer effect\",\"text\":\"In physics, the observer effect is the disturbance of an observed system by the act of observation. This effect can also be seen in benchmarks and can lead to wrong assumptions about results. Let\\u2019s look at a concrete example and then try to mitigate it.
We want to implement a function receiving a matrix of int64 elements. This matrix has a fixed number of 512 columns, and we want to compute the total sum of the first eight columns, as shown in figure 1.
Figure 1: Computing the sum of the first eight columns. For the sake of optimizations, we also want to determine whether varying the number of columns has an impact, so we also implement a second function with 513 columns. The implementation is the following:
func calculateSum512(s [][512]int64) int64 {\\n var sum int64\\n for i := 0; i < len(s); i++ { // Iterate over each row\\n for j := 0; j < 8; j++ { // Iterate over the first eight columns\\n sum += s[i][j] // Increment sum\\n }\\n }\\n return sum\\n}\\n\\nfunc calculateSum513(s [][513]int64) int64 {\\n // Same implementation as calculateSum512\\n}\\nWe iterate over each row and then over the first eight columns, and we increment a sum variable that we return. The implementation in calculateSum513 remains the same.
We want to benchmark these functions to decide which one is the most performant given a fixed number of rows:
const rows = 1000\\n\\nvar res int64\\n\\nfunc BenchmarkCalculateSum512(b *testing.B) {\\n var sum int64\\n s := createMatrix512(rows) // Create a matrix of 512 columns\\n b.ResetTimer()\\n for i := 0; i < b.N; i++ {\\n sum = calculateSum512(s) // Create a matrix of 512 columns\\n }\\n res = sum\\n}\\n\\nfunc BenchmarkCalculateSum513(b *testing.B) {\\n var sum int64\\n s := createMatrix513(rows) // Create a matrix of 513 columns\\n b.ResetTimer()\\n for i := 0; i < b.N; i++ {\\n sum = calculateSum513(s) // Calculate the sum\\n }\\n res = sum\\n}\\nWe want to create the matrix only once, to limit the footprint on the results. Therefore, we call createMatrix512 and createMatrix513 outside of the loop. We may expect the results to be similar as again we only want to iterate on the first eight columns, but this isn\\u2019t the case (on my machine):
cpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkCalculateSum512-4 81854 15073 ns/op\\nBenchmarkCalculateSum513-4 161479 7358 ns/op\\nThe second benchmark with 513 columns is about 50% faster. Again, because we iterate only over the first eight columns, this result is quite surprising.
To understand this difference, we need to understand the basics of CPU caches. In a nutshell, a CPU is composed of different caches (usually L1, L2, and L3). These caches reduce the average cost of accessing data from the main memory. In some conditions, the CPU can fetch data from the main memory and copy it to L1. In this case, the CPU tries to fetch into L1 the matrix\\u2019s subset that calculateSum is interested in (the first eight columns of each row). However, the matrix fits in memory in one case (513 columns) but not in the other case (512 columns).
Note This isn\\u2019t in the scope of this post to explain why, but we look at this problem in 100 Go Mistakes, mistake #91: \\u201cNot understanding CPU caches.\\u201d
Coming back to the benchmark, the main issue is that we keep reusing the same matrix in both cases. Because the function is repeated thousands of times, we don\\u2019t measure the function\\u2019s execution when it receives a plain new matrix. Instead, we measure a function that gets a matrix that already has a subset of the cells present in the cache. Therefore, because calculateSum513 leads to fewer cache misses, it has a better execution time.
This is an example of the observer effect. Because we keep observing a repeatedly called CPU-bound function, CPU caching may come into play and significantly affect the results. In this example, to prevent this effect, we should create a matrix during each test instead of reusing one:
func BenchmarkCalculateSum512(b *testing.B) {\\n var sum int64\\n for i := 0; i < b.N; i++ {\\n b.StopTimer()\\n s := createMatrix512(rows) // Create a new matrix during each loop iteration\\n b.StartTimer()\\n sum = calculateSum512(s)\\n }\\n res = sum\\n}\\nA new matrix is now created during each loop iteration. If we run the benchmark again (and adjust benchtime \\u2014 otherwise, it takes too long to execute), the results are closer to each other:
cpu: Intel(R) Core(TM) i5-7360U CPU @ 2.30GHz\\nBenchmarkCalculateSum512-4 1116 33547 ns/op\\nBenchmarkCalculateSum513-4 998 35507 ns/op\\nInstead of making the incorrect assumption that calculateSum513 is faster, we see that both benchmarks lead to similar results when receiving a new matrix.
As we have seen in this post, because we were reusing the same matrix, CPU caches significantly impacted the results. To prevent this, we had to create a new matrix during each loop iteration. In general, we should remember that observing a function under test may lead to significant differences in results, especially in the context of micro-benchmarks of CPU-bound functions where low-level optimizations matter. Forcing a benchmark to re-create data during each iteration can be a good way to prevent this effect.
\"},{\"location\":\"9-generics/\",\"title\":\"Being confused about when to use generics (#9)\",\"text\":\"\"},{\"location\":\"9-generics/#being-confused-about-when-to-use-generics\",\"title\":\"Being confused about when to use generics\",\"text\":\"Generics is a fresh addition to the language. In a nutshell, it allows writing code with types that can be specified later and instantiated when needed. However, it can be pretty easy to be confused about when to use generics and when not to. Throughout this post, we will describe the concept of generics in Go and then delve into common use and misuses.
\"},{\"location\":\"9-generics/#concepts\",\"title\":\"Concepts\",\"text\":\"Consider the following function that extracts all the keys from a map[string]int type:
func getKeys(m map[string]int) []string {\\n var keys []string\\n for k := range m {\\n keys = append(keys, k)\\n }\\n return keys\\n}\\nWhat if we would like to use a similar feature for another map type such as a map[int]string? Before generics, Go developers had a couple of options: using code generation, reflection, or duplicating code.
For example, we could write two functions, one for each map type, or even try to extend getKeys to accept different map types:
func getKeys(m any) ([]any, error) {\\n switch t := m.(type) {\\n default:\\n return nil, fmt.Errorf(\\\"unknown type: %T\\\", t)\\n case map[string]int:\\n var keys []any\\n for k := range t {\\n keys = append(keys, k)\\n }\\n return keys, nil\\n case map[int]string:\\n // Copy the extraction logic\\n }\\n}\\nWe can start noticing a couple of issues:
First, it increases boilerplate code. Indeed, whenever we want to add a case, it will require duplicating the range loop. Meanwhile, the function now accepts an empty interface, which means we are losing some of the benefits of Go being a typed language. Indeed, checking whether a type is supported is done at runtime instead of compile-time. Hence, we also need to return an error if the provided type is unknown. Last but not least, as the key type can be either int or string, we are obliged to return a slice of empty interfaces to factor out key types. This approach increases the effort on the caller-side as the client may also have to perform a type check of the keys or extra conversion. Thanks to generics, we can now refactor this code using type parameters.
Type parameters are generic types we can use with functions and types. For example, the following function accepts a type parameter:
func foo[T any](t T) {\\n // ...\\n}\\nWhen calling foo, we will pass a type argument of any type. Passing a type argument is called instantiation because the work is done at compile time which keeps type safety as part of the core language features and avoids runtime overheads.
Let\\u2019s get back to the getKeys function and use type parameters to write a generic version that would accept any kind of map:
func getKeys[K comparable, V any](m map[K]V) []K {\\n var keys []K\\n for k := range m {\\n keys = append(keys, k)\\n }\\n return keys\\n}\\nTo handle the map, we defined two kinds of type parameters. First, the values can be of any type: V any. However, in Go, the map keys can\\u2019t be of any type. For example, we cannot use slices:
var m map[[]byte]int\\nThis code leads to a compilation error: invalid map key type []byte. Therefore, instead of accepting any key type, we are obliged to restrict type arguments so that the key type meets specific requirements. Here, being comparable (we can use == or !=). Hence, we defined K as comparable instead of any.
Restricting type arguments to match specific requirements is called a constraint. A constraint is an interface type that can contain:
A set of behaviors (methods) But also arbitrary type Let\\u2019s see a concrete example for the latter. Imagine we don\\u2019t want to accept any comparable type for map key type. For instance, we would like to restrict it to either int or string types. We can define a custom constraint this way:
type customConstraint interface {\\n ~int | ~string // Define a custom type that will restrict types to int and string\\n}\\n\\n// Change the type parameter K to be custom\\nfunc getKeys[K customConstraint, V any](m map[K]V) []K {\\n // Same implementation\\n}\\nFirst, we define a customConstraint interface to restrict the types to be either int or string using the union operator | (we will discuss the use of ~ a bit later). Then, K is now a customConstraint instead of a comparable as before.
Now, the signature of getKeys enforces that we can call it with a map of any value type, but the key type has to be an int or a string. For example, on the caller-side:
m = map[string]int{\\n \\\"one\\\": 1,\\n \\\"two\\\": 2,\\n \\\"three\\\": 3,\\n}\\nkeys := getKeys(m)\\nNote that Go can infer that getKeys is called with a string type argument. The previous call was similar to this:
keys := getKeys[string](m)\\nWhat\\u2019s the difference between a constraint using ~int or int? Using int restricts it to that type, whereas ~int restricts all the types whose underlying type is an int.
To illustrate it, let\\u2019s imagine a constraint where we would like to restrict a type to any int type implementing the String() string method:
type customConstraint interface {\\n ~int\\n String() string\\n}\\nUsing this constraint will restrict type arguments to custom types like this one:
type customInt int\\n\\nfunc (i customInt) String() string {\\n return strconv.Itoa(int(i))\\n}\\nAs customInt is an int and implements the String() string method, the customInt type satisfies the constraint defined.
However, if we change the constraint to contain an int instead of an ~int, using customInt would lead to a compilation error because the int type doesn\\u2019t implement String() string.
Let\\u2019s also note the constraints package contains a set of common constraints such as Signed that includes all the signed integer types. Let\\u2019s ensure that a constraint doesn\\u2019t already exist in this package before creating a new one.
So far, we have discussed examples using generics for functions. However, we can also use generics with data structures.
For example, we will create a linked list containing values of any type. Meanwhile, we will write an Add method to append a node:
type Node[T any] struct { // Use type parameter\\n Val T\\n next *Node[T]\\n}\\n\\nfunc (n *Node[T]) Add(next *Node[T]) { // Instantiate type receiver\\n n.next = next\\n}\\nWe use type parameters to define T and use both fields in Node. Regarding the method, the receiver is instantiated. Indeed, because Node is generic, it has to follow also the type parameter defined.
One last thing to note about type parameters: they can\\u2019t be used on methods, only on functions. For example, the following method wouldn\\u2019t compile:
type Foo struct {}\\n\\nfunc (Foo) bar[T any](t T) {}\\n./main.go:29:15: methods cannot have type parameters\\nNow, let\\u2019s delve into concrete cases where we should and shouldn\\u2019t use generics.
\"},{\"location\":\"9-generics/#common-uses-and-misuses\",\"title\":\"Common uses and misuses\",\"text\":\"So when are generics useful? Let\\u2019s discuss a couple of common uses where generics are recommended:
Data structures. For example, we can use generics to factor out the element type if we implement a binary tree, a linked list, or a heap. Functions working with slices, maps, and channels of any type. For example, a function to merge two channels would work with any channel type. Hence, we could use type parameters to factor out the channel type: func merge[T any](ch1, ch2 <-chan T) <-chan T {\\n // ...\\n}\\n Meanwhile, instead of factoring out a type, we can factor out behaviors. For example, the sort package contains functions to sort different slice types such as sort.Ints or sort.Float64s. Using type parameters, we can factor out the sorting behaviors that rely on three methods, Len, Less, and Swap: type sliceFn[T any] struct { // Use type parameter\\n s []T\\n compare func(T, T) bool // Compare two T elements\\n}\\n\\nfunc (s sliceFn[T]) Len() int { return len(s.s) }\\nfunc (s sliceFn[T]) Less(i, j int) bool { return s.compare(s.s[i], s.s[j]) }\\nfunc (s sliceFn[T]) Swap(i, j int) { s.s[i], s.s[j] = s.s[j], s.s[i] }\\nConversely, when is it recommended not to use generics?
When just calling a method of the type argument. For example, consider a function that receives an io.Writer and call the Write method: func foo[T io.Writer](w T) {\\n b := getBytes()\\n _, _ = w.Write(b)\\n}\\n When it makes our code more complex. Generics are never mandatory, and as Go developers, we have been able to live without them for more than a decade. If writing generic functions or structures we figure out that it doesn\\u2019t make our code clearer, we should probably reconsider our decision for this particular use case. \"},{\"location\":\"9-generics/#conclusion\",\"title\":\"Conclusion\",\"text\":\"Though generics can be very helpful in particular conditions, we should be cautious about when to use them and not use them.
In general, when we want to answer when not to use generics, we can find similarities with when not to use interfaces. Indeed, generics introduce a form of abstraction, and we have to remember that unnecessary abstractions introduce complexity.
Let\\u2019s not pollute our code with needless abstractions, and let\\u2019s focus on solving concrete problems for now. It means that we shouldn\\u2019t use type parameters prematurely. Let\\u2019s wait until we are about to write boilerplate code to consider using generics.
\"},{\"location\":\"92-false-sharing/\",\"title\":\"Writing concurrent code that leads to false sharing (#92)\",\"text\":\"\"},{\"location\":\"92-false-sharing/#writing-concurrent-code-that-leads-to-false-sharing\",\"title\":\"Writing concurrent code that leads to false sharing\",\"text\":\"In previous sections, we have discussed the fundamental concepts of CPU caching. We have seen that some specific caches (typically, L1 and L2) aren\\u2019t shared among all the logical cores but are specific to a physical core. This specificity has some concrete impacts such as concurrency and the concept of false sharing, which can lead to a significant performance decrease. Let\\u2019s look at what false sharing is via an example and then see how to prevent it.
In this example, we use two structs, Input and Result:
type Input struct {\\n a int64\\n b int64\\n}\\n\\ntype Result struct {\\n sumA int64\\n sumB int64\\n}\\nThe goal is to implement a count function that receives a slice of Input and computes the following:
The sum of all the Input.a fields into Result.sumA The sum of all the Input.b fields into Result.sumB For the sake of the example, we implement a concurrent solution with one goroutine that computes sumA and another that computes sumB:
func count(inputs []Input) Result {\\n wg := sync.WaitGroup{}\\n wg.Add(2)\\n\\n result := Result{} // Init the result struct\\n\\n go func() {\\n for i := 0; i < len(inputs); i++ {\\n result.sumA += inputs[i].a // Computes sumA\\n }\\n wg.Done()\\n }()\\n\\n go func() {\\n for i := 0; i < len(inputs); i++ {\\n result.sumB += inputs[i].b // Computes sumB\\n }\\n wg.Done()\\n }()\\n\\n wg.Wait()\\n return result\\n}\\nWe spin up two goroutines: one that iterates over each a field and another that iterates over each b field. This example is fine from a concurrency perspective. For instance, it doesn\\u2019t lead to a data race, because each goroutine increments its own variable. But this example illustrates the false sharing concept that degrades expected performance.
Let\\u2019s look at the main memory. Because sumA and sumB are allocated contiguously, in most cases (seven out of eight), both variables are allocated to the same memory block:
In this example, sumA and sumB are part of the same memory block. Now, let\\u2019s assume that the machine contains two cores. In most cases, we should eventually have two threads scheduled on different cores. So if the CPU decides to copy this memory block to a cache line, it is copied twice:
Each block is copied to a cache line on both code 0 and core 1. Both cache lines are replicated because L1D (L1 data) is per core. Recall that in our example, each goroutine updates its own variable: sumA on one side, and sumB on the other side:
Each goroutine updates its own variable. Because these cache lines are replicated, one of the goals of the CPU is to guarantee cache coherency. For example, if one goroutine updates sumA and another reads sumA (after some synchronization), we expect our application to get the latest value.
However, our example doesn\\u2019t do exactly this. Both goroutines access their own variables, not a shared one. We might expect the CPU to know about this and understand that it isn\\u2019t a conflict, but this isn\\u2019t the case. When we write a variable that\\u2019s in a cache, the granularity tracked by the CPU isn\\u2019t the variable: it\\u2019s the cache line.
When a cache line is shared across multiple cores and at least one goroutine is a writer, the entire cache line is invalidated. This happens even if the updates are logically independent (for example, sumA and sumB). This is the problem of false sharing, and it degrades performance.
Note Internally, a CPU uses the MESI protocol to guarantee cache coherency. It tracks each cache line, marking it modified, exclusive, shared, or invalid (MESI).
One of the most important aspects to understand about memory and caching is that sharing memory across cores isn\\u2019t real\\u2014it\\u2019s an illusion. This understanding comes from the fact that we don\\u2019t consider a machine a black box; instead, we try to have mechanical sympathy with underlying levels.
So how do we solve false sharing? There are two main solutions.
The first solution is to use the same approach we\\u2019ve shown but ensure that sumA and sumB aren\\u2019t part of the same cache line. For example, we can update the Result struct to add padding between the fields. Padding is a technique to allocate extra memory. Because an int64 requires an 8-byte allocation and a cache line 64 bytes long, we need 64 \\u2013 8 = 56 bytes of padding:
type Result struct {\\n sumA int64\\n _ [56]byte // Padding\\n sumB int64\\n}\\nThe next figure shows a possible memory allocation. Using padding, sumA and sumB will always be part of different memory blocks and hence different cache lines.
sumA and sumB are part of different memory blocks. If we benchmark both solutions (with and without padding), we see that the padding solution is significantly faster (about 40% on my machine). This is an important improvement that results from the addition of padding between the two fields to prevent false sharing.
The second solution is to rework the structure of the algorithm. For example, instead of having both goroutines share the same struct, we can make them communicate their local result via channels. The result benchmark is roughly the same as with padding.
In summary, we must remember that sharing memory across goroutines is an illusion at the lowest memory levels. False sharing occurs when a cache line is shared across two cores when at least one goroutine is a writer. If we need to optimize an application that relies on concurrency, we should check whether false sharing applies, because this pattern is known to degrade application performance. We can prevent false sharing with either padding or communication.
\"},{\"location\":\"98-profiling-execution-tracing/\",\"title\":\"Not using Go diagnostics tooling (#98)\",\"text\":\"\"},{\"location\":\"98-profiling-execution-tracing/#not-using-go-diagnostics-tooling\",\"title\":\"Not using Go diagnostics tooling\",\"text\":\"Go offers a few excellent diagnostics tools to help us get insights into how an application performs. This post focuses on the most important ones: profiling and the execution tracer. Both tools are so important that they should be part of the core toolset of any Go developer who is interested in optimization. First, let\\u2019s discuss profiling.
\"},{\"location\":\"98-profiling-execution-tracing/#profiling\",\"title\":\"Profiling\",\"text\":\"Profiling provides insights into the execution of an application. It allows us to resolve performance issues, detect contention, locate memory leaks, and more. These insights can be collected via several profiles:
CPU\\u2014 Determines where an application spends its timeGoroutine\\u2014 Reports the stack traces of the ongoing goroutinesHeap\\u2014 Reports heap memory allocation to monitor current memory usage and check for possible memory leaksMutex\\u2014 Reports lock contentions to see the behaviors of the mutexes used in our code and whether an application spends too much time in locking callsBlock\\u2014 Shows where goroutines block waiting on synchronization primitives Profiling is achieved via instrumentation using a tool called a profiler, in Go: pprof. First, let\\u2019s understand how and when to enable pprof; then, we discuss the most critical profile types.
\"},{\"location\":\"98-profiling-execution-tracing/#enabling-pprof\",\"title\":\"Enabling pprof\",\"text\":\"There are several ways to enable pprof. For example, we can use the net/http/pprof package to serve the profiling data via HTTP:
package main\\n\\nimport (\\n \\\"fmt\\\"\\n \\\"log\\\"\\n \\\"net/http\\\"\\n _ \\\"net/http/pprof\\\" // Blank import to pprof\\n)\\n\\nfunc main() {\\n // Exposes an HTTP endpoint\\n http.HandleFunc(\\\"/\\\", func(w http.ResponseWriter, r *http.Request) {\\n fmt.Fprintf(w, \\\"\\\")\\n })\\n log.Fatal(http.ListenAndServe(\\\":80\\\", nil))\\n}\\nImporting net/http/pprof leads to a side effect that allows us to reach the pprof URL: http://host/debug/pprof. Note that enabling pprof is safe even in production (https://go.dev/doc/diagnostics#profiling). The profiles that impact performance, such as CPU profiling, aren\\u2019t enabled by default, nor do they run continuously: they are activated only for a specific period.
Now that we have seen how to expose a pprof endpoint, let\\u2019s discuss the most common profiles.
\"},{\"location\":\"98-profiling-execution-tracing/#cpu-profiling\",\"title\":\"CPU Profiling\",\"text\":\"The CPU profiler relies on the OS and signaling. When it is activated, the application asks the OS to interrupt it every 10 ms by default via a SIGPROF signal. When the application receives a SIGPROF, it suspends the current activity and transfers the execution to the profiler. The profiler collects data such as the current goroutine activity and aggregates execution statistics that we can retrieve. Then it stops, and the execution resumes until the next SIGPROF.
We can access the /debug/pprof/profile endpoint to activate CPU profiling. Accessing this endpoint executes CPU profiling for 30 seconds by default. For 30 seconds, our application is interrupted every 10 ms. Note that we can change these two default values: we can use the seconds parameter to pass to the endpoint how long the profiling should last (for example, /debug/pprof/profile?seconds=15), and we can change the interruption rate (even to less than 10 ms). But in most cases, 10 ms should be enough, and in decreasing this value (meaning increasing the rate), we should be careful not to harm performance. After 30 seconds, we download the results of the CPU profiler.
Note We can also enable the CPU profiler using the -cpuprofile flag, such as when running a benchmark. For example, the following command produces the same type of file that can be downloaded via /debug/ pprof/profile.
$ go test -bench=. -cpuprofile profile.out\\nFrom this file, we can navigate to the results using go tool:
$ go tool pprof -http=:8080 <file>\\nThis command opens a web UI showing the call graph. The next figure shows an example taken from an application. The larger the arrow, the more it was a hot path. We can then navigate into this graph and get execution insights.
Figure 1: The call graph of an application during 30 seconds. For example, the graph in the next figure tells us that during 30 seconds, 0.06 seconds were spent in the decode method (*FetchResponse receiver). Of these 0.06 seconds, 0.02 were spent in RecordBatch.decode and 0.01 in makemap (creating a map).
Figure 2: Example call graph. We can also access this kind of information from the web UI with different representations. For example, the Top view sorts the functions per execution time, and Flame Graph visualizes the execution time hierarchy. The UI can even display the expensive parts of the source code line by line.
Note We can also delve into profiling data via a command line. However, we focus on the web UI in this post.
Thanks to this data, we can get a general idea of how an application behaves:
Too many calls to runtime.mallogc can mean an excessive number of small heap allocations that we can try to minimize. Too much time spent in channel operations or mutex locks can indicate excessive contention that is harming the application\\u2019s performance. Too much time spent on syscall.Read or syscall.Write means the application spends a significant amount of time in Kernel mode. Working on I/O buffering may be an avenue for improvement. These are the kinds of insights we can get from the CPU profiler. It\\u2019s valuable to understand the hottest code path and identify bottlenecks. But it won\\u2019t determine more than the configured rate because the CPU profiler is executed at a fixed pace (by default, 10 ms). To get finer-grained insights, we should use tracing, which we discuss later in this post.
Note We can also attach labels to the different functions. For example, imagine a common function called from different clients. To track the time spent for both clients, we can use pprof.Labels.
\"},{\"location\":\"98-profiling-execution-tracing/#heap-profiling\",\"title\":\"Heap Profiling\",\"text\":\"Heap profiling allows us to get statistics about the current heap usage. Like CPU profiling, heap profiling is sample-based. We can change this rate, but we shouldn\\u2019t be too granular because the more we decrease the rate, the more effort heap profiling will require to collect data. By default, samples are profiled at one allocation for every 512 KB of heap allocation.
If we reach /debug/pprof/heap/, we get raw data that can be hard to read. However, we can download a heap profile using /debug/pprof/heap/?debug=0 and then open it with go tool (the same command as in the previous section) to navigate into the data using the web UI.
The next figure shows an example of a heap graph. Calling the MetadataResponse.decode method leads to allocating 1536 KB of heap data (which represents 6.32% of the total heap). However, 0 out of these 1536 KB were allocated by this function directly, so we need to inspect the second call. The TopicMetadata.decode method allocated 512 KB out of the 1536 KB; the rest \\u2014 1024 KB \\u2014 were allocated in another method.
Figure 3: A heap graph. This is how we can navigate the call chain to understand what part of an application is responsible for most of the heap allocations. We can also look at different sample types:
alloc_objects\\u2014 Total number of objects allocatedalloc_space\\u2014 Total amount of memory allocatedinuse_objects \\u2014 Number of objects allocated and not yet releasedinuse_space\\u2014 Amount of memory allocated and not yet released Another very helpful capability with heap profiling is tracking memory leaks. With a GC-based language, the usual procedure is the following:
Trigger a GC. Download heap data. Wait for a few seconds/minutes. Trigger another GC. Download another heap data. Compare. Forcing a GC before downloading data is a way to prevent false assumptions. For example, if we see a peak of retained objects without running a GC first, we cannot be sure whether it\\u2019s a leak or objects that the next GC will collect.
Using pprof, we can download a heap profile and force a GC in the meantime. The procedure in Go is the following:
Go to /debug/pprof/heap?gc=1 (trigger the GC and download the heap profile). Wait for a few seconds/minutes. Go to /debug/pprof/heap?gc=1 again. Use go tool to compare both heap profiles: $ go tool pprof -http=:8080 -diff_base <file2> <file1>\\nThe next figure shows the kind of data we can access. For example, the amount of heap memory held by the newTopicProducer method (top left) has decreased (\\u2013513 KB). In contrast, the amount held by updateMetadata (bottom right) has increased (+512 KB). Slow increases are normal. The second heap profile may have been calculated in the middle of a service call, for example. We can repeat this process or wait longer; the important part is to track steady increases in allocations of a specific object.
Figure 4: The differences between the two heap profiles. Note Another type of profiling related to the heap is allocs, which reports allocations. Heap profiling shows the current state of the heap memory. To get insights about past memory allocations since the application started, we can use allocations profiling. As discussed, because stack allocations are cheap, they aren\\u2019t part of this profiling, which only focuses on the heap.
\"},{\"location\":\"98-profiling-execution-tracing/#goroutine-profiling\",\"title\":\"Goroutine Profiling\",\"text\":\"The goroutine profile reports the stack trace of all the current goroutines in an application. We can download a file using /debug/pprof/goroutine/?debug=0 and use go tool again. The next figure shows the kind of information we can get.
Figure 5: Goroutine graph. We can see the current state of the application and how many goroutines were created per function. In this case, withRecover has created 296 ongoing goroutines (63%), and 29 were related to a call to responseFeeder.
This kind of information is also beneficial if we suspect goroutine leaks. We can look at goroutine profiler data to know which part of a system is the suspect.
\"},{\"location\":\"98-profiling-execution-tracing/#block-profiling\",\"title\":\"Block Profiling\",\"text\":\"The block profile reports where ongoing goroutines block waiting on synchronization primitives. Possibilities include
Sending or receiving on an unbuffered channel Sending to a full channel Receiving from an empty channel Mutex contention Network or filesystem waits Block profiling also records the amount of time a goroutine has been waiting and is accessible via /debug/pprof/block. This profile can be extremely helpful if we suspect that performance is being harmed by blocking calls.
The block profile isn\\u2019t enabled by default: we have to call runtime.SetBlockProfileRate to enable it. This function controls the fraction of goroutine blocking events that are reported. Once enabled, the profiler will keep collecting data in the background even if we don\\u2019t call the /debug/pprof/block endpoint. Let\\u2019s be cautious if we want to set a high rate so we don\\u2019t harm performance.
Note If we face a deadlock or suspect that goroutines are in a blocked state, the full goroutine stack dump (/debug/pprof/goroutine/?debug=2) creates a dump of all the current goroutine stack traces. This can be helpful as a first analysis step. For example, the following dump shows a Sarama goroutine blocked for 1,420 minutes on a channel-receive operation:
goroutine 2494290 [chan receive, 1420 minutes]:\\ngithub.com/Shopify/sarama.(*syncProducer).SendMessages(0xc00071a090,\\n[CA]{0xc0009bb800, 0xfb, 0xfb})\\n/app/vendor/github.com/Shopify/sarama/sync_producer.go:117 +0x149\\nThe last profile type is related to blocking but only regarding mutexes. If we suspect that our application spends significant time waiting for locking mutexes, thus harming execution, we can use mutex profiling. It\\u2019s accessible via /debug/pprof/mutex.
This profile works in a manner similar to that for blocking. It\\u2019s disabled by default: we have to enable it using runtime.SetMutexProfileFraction, which controls the fraction of mutex contention events reported.
Following are a few additional notes about profiling:
We haven\\u2019t mentioned the threadcreate profile because it\\u2019s been broken since 2013 (https://github.com/golang/go/issues/6104). Be sure to enable only one profiler at a time: for example, do not enable CPU and heap profiling simultaneously. Doing so can lead to erroneous observations. pprof is extensible, and we can create our own custom profiles using pprof.Profile. We have seen the most important profiles that we can enable to help us understand how an application performs and possible avenues for optimization. In general, enabling pprof is recommended, even in production, because in most cases it offers an excellent balance between its footprint and the amount of insight we can get from it. Some profiles, such as the CPU profile, lead to performance penalties but only during the time they are enabled.
Let\\u2019s now look at the execution tracer.
\"},{\"location\":\"98-profiling-execution-tracing/#execution-tracer\",\"title\":\"Execution Tracer\",\"text\":\"The execution tracer is a tool that captures a wide range of runtime events with go tool to make them available for visualization. It is helpful for the following:
Understanding runtime events such as how the GC performs Understanding how goroutines execute Identifying poorly parallelized execution Let\\u2019s try it with an example given the Concurrency isn\\u2019t Always Faster in Go section. We discussed two parallel versions of the merge sort algorithm. The issue with the first version was poor parallelization, leading to the creation of too many goroutines. Let\\u2019s see how the tracer can help us in validating this statement.
We will write a benchmark for the first version and execute it with the -trace flag to enable the execution tracer:
$ go test -bench=. -v -trace=trace.out\\nWe can also download a remote trace file using the /debug/pprof/ trace?debug=0 pprof endpoint.
This command creates a trace.out file that we can open using go tool:
$ go tool trace trace.out\\n2021/11/26 21:36:03 Parsing trace...\\n2021/11/26 21:36:31 Splitting trace...\\n2021/11/26 21:37:00 Opening browser. Trace viewer is listening on\\n http://127.0.0.1:54518\\nThe web browser opens, and we can click View Trace to see all the traces during a specific timeframe, as shown in the next figure. This figure represents about 150 ms. We can see multiple helpful metrics, such as the goroutine count and the heap size. The heap size grows steadily until a GC is triggered. We can also observe the activity of the Go application per CPU core. The timeframe starts with user-level code; then a \\u201cstop the world\\u201d is executed, which occupies the four CPU cores for approximately 40 ms.
Figure 6: Showing goroutine activity and runtime events such as a GC phase. Regarding concurrency, we can see that this version uses all the available CPU cores on the machine. However, the next figure zooms in on a portion of 1 ms. Each bar corresponds to a single goroutine execution. Having too many small bars doesn\\u2019t look right: it means execution that is poorly parallelized.
Figure 7: Too many small bars mean poorly parallelized execution. The next figure zooms even closer to see how these goroutines are orchestrated. Roughly 50% of the CPU time isn\\u2019t spent executing application code. The white spaces represent the time the Go runtime takes to spin up and orchestrate new goroutines.
Figure 8: About 50% of CPU time is spent handling goroutine switches. Let\\u2019s compare this with the second parallel implementation, which was about an order of magnitude faster. The next figure again zooms to a 1 ms timeframe.
Figure 9: The number of white spaces has been significantly reduced, proving that the CPU is more fully occupied. Each goroutine takes more time to execute, and the number of white spaces has been significantly reduced. Hence, the CPU is much more occupied executing application code than it was in the first version. Each millisecond of CPU time is spent more efficiently, explaining the benchmark differences.
Note that the granularity of the traces is per goroutine, not per function like CPU profiling. However, it\\u2019s possible to define user-level tasks to get insights per function or group of functions using the runtime/trace package.
For example, imagine a function that computes a Fibonacci number and then writes it to a global variable using atomic. We can define two different tasks:
var v int64\\n// Creates a fibonacci task\\nctx, fibTask := trace.NewTask(context.Background(), \\\"fibonacci\\\")\\ntrace.WithRegion(ctx, \\\"main\\\", func() {\\n v = fibonacci(10)\\n})\\nfibTask.End()\\n\\n// Creates a store task\\nctx, fibStore := trace.NewTask(ctx, \\\"store\\\")\\ntrace.WithRegion(ctx, \\\"main\\\", func() {\\n atomic.StoreInt64(&result, v)\\n})\\nfibStore.End()\\nUsing go tool, we can get more precise information about how these two tasks perform. In the previous trace UI, we can see the boundaries for each task per goroutine. In User-Defined Tasks, we can follow the duration distribution:
Figure 10: Distribution of user-level tasks. We see that in most cases, the fibonacci task is executed in less than 15 microseconds, whereas the store task takes less than 6309 nanoseconds.
In the previous section, we discussed the kinds of information we can get from CPU profiling. What are the main differences compared to the data we can get from user-level traces?
CPU profiling: Sample-based Per function Doesn\\u2019t go below the sampling rate (10 ms by default) User-level traces: Not sample-based Per-goroutine execution (unless we use the runtime/trace package) Time executions aren\\u2019t bound by any rate In summary, the execution tracer is a powerful tool for understanding how an application performs. As we have seen with the merge sort example, we can identify poorly parallelized execution. However, the tracer\\u2019s granularity remains per goroutine unless we manually use runtime/trace compared to a CPU profile, for example. We can use both profiling and the execution tracer to get the most out of the standard Go diagnostics tools when optimizing an application.
\"},{\"location\":\"book/\",\"title\":\"100 Go Mistakes and How to Avoid Them\",\"text\":\"\"},{\"location\":\"book/#100-go-mistakes-and-how-to-avoid-them\",\"title\":\"100 Go Mistakes and How to Avoid Them\",\"text\":\"\"},{\"location\":\"book/#description\",\"title\":\"Description\",\"text\":\"If you're a Go developer looking to improve your skills, the 100 Go Mistakes and How to Avoid Them book is for you. With a focus on practical examples, this book covers a wide range of topics from concurrency and error handling to testing and code organization. You'll learn to write more idiomatic, efficient, and maintainable code and become a proficient Go developer.
Read a summary of the 100 mistakes or the first chapter.
\"},{\"location\":\"book/#quotes-and-ratings\",\"title\":\"Quotes and Ratings\",\"text\":\"Krystian (Goodreads user)
This is an exceptional book. Usually, if a book contains either high-quality explanations or is written succinctly, I consider myself lucky to have found it. This one combines these two characteristics, which is super rare. It's another Go book for me and I still had quite a lot of \\\"a-ha!\\\" moments while reading it, and all of that without the unnecessary fluff, just straight to the point.
Akash Chetty
The book is completely exceptional, especially the examples carved out for each topic are really great. There is one topic that I struggled to understand is Concurrency but the way it is explained in this book is truly an art of genius.
Neeraj Shah
This should be the required reading for all Golang developers before they touch code in Production... It's the Golang equivalent of the legendary 'Effective Java' by Joshua Bloch.
Anupam Sengupta
Not having this will be the 101st mistake a Go programmer could make.
Manning, Goodreads, and Amazon reviews: 4.7/5 avg rating\"},{\"location\":\"book/#where-to-buy\",\"title\":\"Where to Buy?\",\"text\":\" 100 Go Mistakes and How to Avoid Them (\\ud83c\\uddec\\ud83c\\udde7 edition: paper, digital, or audiobook)
Manning (please make sure to use my personal discount code for -35%: au35har) O\\u2019Reilly Amazon: .com, .co.uk, .de, .fr, .in, .co.jp, .es, .it, .com.br Go\\u8a00\\u8a9e100Tips \\u958b\\u767a\\u8005\\u306b\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u3078\\u306e\\u5bfe\\u51e6\\u6cd5 (\\ud83c\\uddef\\ud83c\\uddf5 edition: paper or digital)
100\\u4e2aGo\\u8bed\\u8a00\\u5178\\u578b\\u9519\\u8bef (\\ud83c\\udde8\\ud83c\\uddf3 edition: paper or digital)
Go 100\\uac00\\uc9c0 \\uc2e4\\uc218 \\ud328\\ud134\\uacfc \\uc194\\ub8e8\\uc158 (\\ud83c\\uddf0\\ud83c\\uddf7 edition: paper or digital)
Covers (English, Japanese, Chinese, and Korean)\"},{\"location\":\"book/#about-the-author\",\"title\":\"About the Author\",\"text\":\"Teiva Harsanyi is a senior software engineer at Google. He has worked in various domains, including insurance, transportation, and safety-critical industries like air traffic management. He is passionate about Go and how to design and implement reliable systems.
\"},{\"location\":\"chapter-1/\",\"title\":\"Read the First Chapter\",\"text\":\"\"},{\"location\":\"chapter-1/#go-simple-to-learn-but-hard-to-master\",\"title\":\"Go: Simple to learn but hard to master\",\"text\":\"This chapter covers
What makes Go an efficient, scalable, and productive language Exploring why Go is simple to learn but hard to master Presenting the common types of mistakes made by developers Making mistakes is part of everyone\\u2019s life. As Albert Einstein once said,
Albert Einstein
A person who never made a mistake never tried anything new.
What matters in the end isn\\u2019t the number of mistakes we make, but our capacity to learn from them. This assertion also applies to programming. The seniority we acquire in a language isn\\u2019t a magical process; it involves making many mistakes and learning from them. The purpose of this book is centered around this idea. It will help you, the reader, become a more proficient Go developer by looking at and learning from 100 common mistakes people make in many areas of the language.
This chapter presents a quick refresher as to why Go has become mainstream over the years. We\\u2019ll discuss why, despite Go being considered simple to learn, mastering its nuances can be challenging. Finally, we\\u2019ll introduce the concepts this book covers.
\"},{\"location\":\"chapter-1/#go-outline\",\"title\":\"Go outline\",\"text\":\"If you are reading this book, it\\u2019s likely that you\\u2019re already sold on Go. Therefore, this section provides a brief reminder about what makes Go such a powerful language.
Software engineering has evolved considerably during the past decades. Most modern systems are no longer written by a single person but by teams consisting of multiple programmers\\u2014sometimes even hundreds, if not thousands. Nowadays, code must be readable, expressive, and maintainable to guarantee a system\\u2019s durability over the years. Meanwhile, in our fast-moving world, maximizing agility and reducing the time to market is critical for most organizations. Programming should also follow this trend, and companies strive to ensure that software engineers are as productive as possible when reading, writing, and maintaining code.
In response to these challenges, Google created the Go programming language in 2007. Since then, many organizations have adopted the language to support various use cases: APIs, automation, databases, CLIs (command-line interfaces), and so on. Many today consider Go the language of the cloud.
Feature-wise, Go has no type inheritance, no exceptions, no macros, no partial functions, no support for lazy variable evaluation or immutability, no operator overloading, no pattern matching, and on and on. Why are these features missing from the language? The official Go FAQ gives us some insight:
Go FAQ
Why does Go not have feature X? Your favorite feature may be missing because it doesn\\u2019t fit, because it affects compilation speed or clarity of design, or because it would make the fundamental system model too difficult.
Judging the quality of a programming language via its number of features is probably not an accurate metric. At least, it\\u2019s not an objective of Go. Instead, Go utilizes a few essential characteristics when adopting a language at scale for an organization. These include the following:
Stability\\u2014Even though Go receives frequent updates (including improvements and security patches), it remains a stable language. Some may even consider this one of the best features of the language. Expressivity\\u2014We can define expressivity in a programming language by how naturally and intuitively we can write and read code. A reduced number of keywords and limited ways to solve common problems make Go an expressive language for large codebases. Compilation\\u2014As developers, what can be more exasperating than having to wait for a build to test our application? Targeting fast compilation times has always been a conscious goal for the language designers. This, in turn, enables productivity. Safety\\u2014Go is a strong, statically typed language. Hence, it has strict compiletime rules, which ensure the code is type-safe in most cases. Go was built from the ground up with solid features such as outstanding concurrency primitives with goroutines and channels. There\\u2019s not a strong need to rely on external libraries to build efficient concurrent applications. Observing how important concurrency is these days also demonstrates why Go is such a suitable language for the present and probably for the foreseeable future.
Some also consider Go a simple language. And, in a sense, this isn\\u2019t necessarily wrong. For example, a newcomer can learn the language\\u2019s main features in less than a day. So why read a book centered on the concept of mistakes if Go is simple?
\"},{\"location\":\"chapter-1/#simple-doesnt-mean-easy\",\"title\":\"Simple doesn\\u2019t mean easy\",\"text\":\"There is a subtle difference between simple and easy. Simple, applied to a technology, means not complicated to learn or understand. However, easy means that we can achieve anything without much effort. Go is simple to learn but not necessarily easy to master.
Let\\u2019s take concurrency, for example. In 2019, a study focusing on concurrency bugs was published: Understanding Real-World Concurrency Bugs in Go. This study was the first systematic analysis of concurrency bugs. It focused on multiple popular Go repositories such as Docker, gRPC, and Kubernetes. One of the most important takeaways from this study is that most of the blocking bugs are caused by inaccurate use of the message-passing paradigm via channels, despite the belief that message passing is easier to handle and less error-prone than sharing memory.
What should be an appropriate reaction to such a takeaway? Should we consider that the language designers were wrong about message passing? Should we reconsider how we deal with concurrency in our project? Of course not.
It\\u2019s not a question of confronting message passing versus sharing memory and determining the winner. However, it\\u2019s up to us as Go developers to thoroughly understand how to use concurrency, its implications on modern processors, when to favor one approach over the other, and how to avoid common traps. This example highlights that although a concept such as channels and goroutines can be simple to learn, it isn\\u2019t an easy topic in practice.
This leitmotif\\u2014simple doesn\\u2019t mean easy\\u2014can be generalized to many aspects of Go, not only concurrency. Hence, to be proficient Go developers, we must have a thorough understanding of many aspects of the language, which requires time, effort, and mistakes.
This book aims to help accelerate our journey toward proficiency by delving into 100 Go mistakes.
\"},{\"location\":\"chapter-1/#100-go-mistakes\",\"title\":\"100 Go mistakes\",\"text\":\"Why should we read a book about common Go mistakes? Why not deepen our knowledge with an ordinary book that would dig into different topics?
In a 2011 article, neuroscientists proved that the best time for brain growth is when we\\u2019re facing mistakes. 1 Haven\\u2019t we all experienced the process of learning from a mistake and recalling that occasion after months or even years, when some context related to it? As presented in another article, by Janet Metcalfe, this happens because mistakes have a facilitative effect. 2 The main idea is that we can remember not only the error but also the context surrounding the mistake. This is one of the reasons why learning from mistakes is so efficient.
To strengthen this facilitative effect, this book accompanies each mistake as much as possible with real-world examples. This book isn\\u2019t only about theory; it also helps us get better at avoiding mistakes and making more well-informed, conscious decisions because we now understand the rationale behind them.
Unknown
Tell me and I forget. Teach me and I remember. Involve me and I learn.
This book presents seven main categories of mistakes. Overall, the mistakes can be classified as
Bugs Needless complexity Weaker readability Suboptimal or unidiomatic organization Lack of API convenience Under-optimized code Lack of productivity We introduce each mistake category next.
\"},{\"location\":\"chapter-1/#bugs\",\"title\":\"Bugs\",\"text\":\"The first type of mistake and probably the most obvious is software bugs. In 2020, a study conducted by Synopsys estimated the cost of software bugs in the U.S. alone to be over $2 trillion. 3
Furthermore, bugs can also lead to tragic impacts. We can, for example, mention cases such as Therac-25, a radiation therapy machine produced by Atomic Energy of Canada Limited (AECL). Because of a race condition, the machine gave its patients radiation doses that were hundreds of times greater than expected, leading to the death of three patients. Hence, software bugs aren\\u2019t only about money. As developers, we should remember how impactful our jobs are.
This book covers plenty of cases that could lead to various software bugs, including data races, leaks, logic errors, and other defects. Although accurate tests should be a way to discover such bugs as early as possible, we may sometimes miss cases because of different factors such as time constraints or complexity. Therefore, as a Go developer, it\\u2019s essential to make sure we avoid common bugs.
\"},{\"location\":\"chapter-1/#needless-complexity\",\"title\":\"Needless complexity\",\"text\":\"The next category of mistakes is related to unnecessary complexity. A significant part of software complexity comes from the fact that, as developers, we strive to think about imaginary futures. Instead of solving concrete problems right now, it can be tempting to build evolutionary software that could tackle whatever future use case arises. However, this leads to more drawbacks than benefits in most cases because it can make a codebase more complex to understand and reason about.
Getting back to Go, we can think of plenty of use cases where developers might be tempted to design abstractions for future needs, such as interfaces or generics. This book discusses topics where we should remain careful not to harm a codebase with needless complexity.
\"},{\"location\":\"chapter-1/#weaker-readability\",\"title\":\"Weaker readability\",\"text\":\"Another kind of mistake is to weaken readability. As Robert C. Martin wrote in his book Clean Code: A Handbook of Agile Software Craftsmanship, the ratio of time spent reading versus writing is well over 10 to 1. Most of us started to program on solo projects where readability wasn\\u2019t that important. However, today\\u2019s software engineering is programming with a time dimension: making sure we can still work with and maintain an application months, years, or perhaps even decades later.
When programming in Go, we can make many mistakes that can harm readability. These mistakes may include nested code, data type representations, or not using named result parameters in some cases. Throughout this book, we will learn how to write readable code and care for future readers (including our future selves).
\"},{\"location\":\"chapter-1/#suboptimal-or-unidiomatic-organization\",\"title\":\"Suboptimal or unidiomatic organization\",\"text\":\"Be it while working on a new project or because we acquire inaccurate reflexes, another type of mistake is organizing our code and a project suboptimally and unidiomatically. Such issues can make a project harder to reason about and maintain. This book covers some of these common mistakes in Go. For example, we\\u2019ll look at how to structure a project and deal with utility packages or init functions. All in all, looking at these mistakes should help us organize our code and projects more efficiently and idiomatically.
\"},{\"location\":\"chapter-1/#lack-of-api-convenience\",\"title\":\"Lack of API convenience\",\"text\":\"Making common mistakes that weaken how convenient an API is for our clients is another type of mistake. If an API isn\\u2019t user-friendly, it will be less expressive and, hence, harder to understand and more error-prone.
We can think about many situations such as overusing any types, using the wrong creational pattern to deal with options, or blindly applying standard practices from object-oriented programming that affect the usability of our APIs. This book covers common mistakes that prevent us from exposing convenient APIs for our users.
\"},{\"location\":\"chapter-1/#under-optimized-code\",\"title\":\"Under-optimized code\",\"text\":\"Under-optimized code is another type of mistake made by developers. It can happen for various reasons, such as not understanding language features or even a lack of fundamental knowledge. Performance is one of the most obvious impacts of this mistake, but not the only one.
We can think about optimizing code for other goals, such as accuracy. For example, this book provides some common techniques to ensure that floating-point operations are accurate. Meanwhile, we will cover plenty of cases that can negatively impact performance code because of poorly parallelized executions, not knowing how to reduce allocations, or the impacts of data alignment, for example. We will tackle optimization via different prisms.
\"},{\"location\":\"chapter-1/#lack-of-productivity\",\"title\":\"Lack of productivity\",\"text\":\"In most cases, what\\u2019s the best language we can choose when working on a new project? The one we\\u2019re the most productive with. Being comfortable with how a language works and exploiting it to get the best out of it is crucial to reach proficiency.
In this book, we will cover many cases and concrete examples that will help us to be more productive while working in Go. For instance, we\\u2019ll look at writing efficient tests to ensure that our code works, relying on the standard library to be more effective, and getting the best out of the profiling tools and linters. Now, it\\u2019s time to delve into those 100 common Go mistakes.
\"},{\"location\":\"chapter-1/#summary\",\"title\":\"Summary\",\"text\":\" Go is a modern programming language that enables developer productivity, which is crucial for most companies today. Go is simple to learn but not easy to master. This is why we need to deepen our knowledge to make the most effective use of the language. Learning via mistakes and concrete examples is a powerful way to be proficient in a language. This book will accelerate our path to proficiency by exploring 100 common mistakes. J. S. Moser, H. S. Schroder, et al., \\u201cMind Your Errors: Evidence for a Neural Mechanism Linking Growth Mindset to Adaptive Posterror Adjustments,\\u201d Psychological Science, vol. 22, no. 12, pp. 1484\\u20131489, Dec. 2011.\\u00a0\\u21a9
J. Metcalfe, \\u201cLearning from Errors,\\u201d Annual Review of Psychology, vol. 68, pp. 465\\u2013489, Jan. 2017.\\u00a0\\u21a9
Synopsys, \\u201cThe Cost of Poor Software Quality in the US: A 2020 Report.\\u201d 2020. https://news.synopsys.com/2021-01-06-Synopsys-Sponsored-CISQ-Research-Estimates-Cost-of-Poor-Software-Quality-in-the-US-2-08-Trillion-in-2020.\\u00a0\\u21a9
\"},{\"location\":\"external/\",\"title\":\"External Resources\",\"text\":\"\"},{\"location\":\"external/#external-resources\",\"title\":\"External Resources\",\"text\":\"\"},{\"location\":\"external/#english\",\"title\":\"English\",\"text\":\"\"},{\"location\":\"external/#the-best-golang-book-prime-reacts\",\"title\":\"The Best Golang Book | Prime Reacts\",\"text\":\"\"},{\"location\":\"external/#book-review-100-go-mistakes-and-how-to-avoid-them\",\"title\":\"Book Review: 100 Go Mistakes (And How to Avoid Them)\",\"text\":\"Post
\"},{\"location\":\"external/#the-most-useful-book-for-a-go-programmer\",\"title\":\"The Most Useful Book for a Go Programmer?\",\"text\":\"\"},{\"location\":\"external/#how-to-make-mistakes-in-go-go-time-190\",\"title\":\"How to make mistakes in Go - Go Time #190\",\"text\":\"\"},{\"location\":\"external/#go-is-amazing\",\"title\":\"Go is AMAZING\",\"text\":\"\"},{\"location\":\"external/#8lu-100-test-coverage\",\"title\":\"8LU - 100% Test Coverage\",\"text\":\"\"},{\"location\":\"external/#some-tips-i-learned-from-100-mistakes-in-go\",\"title\":\"Some Tips I learned from 100 Mistakes in Go\",\"text\":\"Post
\"},{\"location\":\"external/#what-can-be-summarized-from-100-go-mistakes\",\"title\":\"What can be summarized from 100 Go Mistakes?\",\"text\":\"Post
\"},{\"location\":\"external/#book-review-100-go-mistakes-and-how-to-avoid-them_1\",\"title\":\"Book review: 100 Go Mistakes and How to Avoid Them\",\"text\":\"Post
\"},{\"location\":\"external/#chinese\",\"title\":\"Chinese\",\"text\":\"\"},{\"location\":\"external/#100-go-mistakes-and-how-to-avoid-them\",\"title\":\"\\u6df1\\u5ea6\\u9605\\u8bfb\\u4e4b\\u300a100 Go Mistakes and How to Avoid Them\",\"text\":\"Post
\"},{\"location\":\"external/#100-go-mistakes\",\"title\":\"100 Go Mistakes \\u968f\\u8bb0\",\"text\":\"Post
\"},{\"location\":\"external/#go\",\"title\":\"\\u6211\\u4e3a\\u4ec0\\u4e48\\u653e\\u5f03Go\\u8bed\\u8a00\\uff1f\",\"text\":\"Post
\"},{\"location\":\"external/#japanese\",\"title\":\"Japanese\",\"text\":\"\"},{\"location\":\"external/#go100-go-mistakes-and-how-to-avoid-them\",\"title\":\"\\u6700\\u8fd1\\u8aad\\u3093\\u3060Go\\u8a00\\u8a9e\\u306e\\u672c\\u306e\\u7d39\\u4ecb\\uff1a100 Go Mistakes and How to Avoid Them\",\"text\":\"Post
\"},{\"location\":\"external/#100-go-mistakes-and-how-to-avoid-them_1\",\"title\":\"\\u300e100 Go Mistakes and How to Avoid Them\\u300f\\u3092\\u8aad\\u3080\",\"text\":\"Post
\"},{\"location\":\"external/#portuguese\",\"title\":\"Portuguese\",\"text\":\"\"},{\"location\":\"external/#um-otimo-livro-para-programadores-go\",\"title\":\"Um \\u00d3TIMO livro para programadores Go\",\"text\":\"\"},{\"location\":\"ja/\",\"title\":\"Japanese Version\",\"text\":\"\"},{\"location\":\"ja/#go\",\"title\":\"Go\\u8a00\\u8a9e\\u3067\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\",\"text\":\"The Coder Cafe \\u3082\\u3057\\u79c1\\u306e\\u672c\\u3092\\u697d\\u3057\\u3093\\u3067\\u3044\\u305f\\u3060\\u3051\\u305f\\u306a\\u3089\\u3001\\u79c1\\u306e\\u6700\\u65b0\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u306b\\u3082\\u3054\\u8208\\u5473\\u304c\\u3042\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002The Coder Cafe\\u306f\\u3001\\u30b3\\u30fc\\u30c0\\u30fc\\u5411\\u3051\\u306e\\u65e5\\u520a\\u30cb\\u30e5\\u30fc\\u30b9\\u30ec\\u30bf\\u30fc\\u3067\\u3059\\u3002
Feeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
\\u3053\\u306e\\u30da\\u30fc\\u30b8\\u306f\\u300e100 Go Mistakes\\u300f\\u306e\\u5185\\u5bb9\\u3092\\u307e\\u3068\\u3081\\u305f\\u3082\\u306e\\u3067\\u3059\\u3002\\u4e00\\u65b9\\u3067\\u3001\\u30b3\\u30df\\u30e5\\u30cb\\u30c6\\u30a3\\u306b\\u958b\\u304b\\u308c\\u305f\\u30da\\u30fc\\u30b8\\u3067\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u300c\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u300d\\u304c\\u65b0\\u305f\\u306b\\u8ffd\\u52a0\\u3055\\u308c\\u308b\\u3079\\u304d\\u3060\\u3068\\u304a\\u8003\\u3048\\u3067\\u3057\\u305f\\u3089 community mistake issue \\u3092\\u4f5c\\u6210\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u6ce8\\u610f \\u73fe\\u5728\\u3001\\u5927\\u5e45\\u306b\\u591a\\u304f\\u306e\\u30b3\\u30f3\\u30c6\\u30f3\\u30c4\\u3092\\u8ffd\\u52a0\\u3057\\u3066\\u5f37\\u5316\\u3057\\u3066\\u3044\\u308b\\u65b0\\u3057\\u3044\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\u3092\\u95b2\\u89a7\\u3057\\u3066\\u3044\\u307e\\u3059\\u3002\\u3053\\u306e\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\u306f\\u307e\\u3060\\u958b\\u767a\\u4e2d\\u3067\\u3059\\u3002\\u554f\\u984c\\u3092\\u898b\\u3064\\u3051\\u305f\\u5834\\u5408\\u306f\\u3069\\u3046\\u305e\\u6c17\\u8efd\\u306bPR\\u3092\\u4f5c\\u6210\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\"},{\"location\":\"ja/#_1\",\"title\":\"\\u30b3\\u30fc\\u30c9\\u3068\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u69cb\\u6210\",\"text\":\"\"},{\"location\":\"ja/#1\",\"title\":\"\\u610f\\u56f3\\u7684\\u3067\\u306a\\u3044\\u5909\\u6570\\u306e\\u30b7\\u30e3\\u30c9\\u30fc\\u30a4\\u30f3\\u30b0 (#1)\",\"text\":\"\\u8981\\u7d04 \\u5909\\u6570\\u306e\\u30b7\\u30e3\\u30c9\\u30fc\\u30a4\\u30f3\\u30b0\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u306f\\u3001\\u8aa4\\u3063\\u305f\\u5909\\u6570\\u306e\\u53c2\\u7167\\u3084\\u8aad\\u307f\\u624b\\u306e\\u6df7\\u4e71\\u3092\\u9632\\u304e\\u307e\\u3059\\u3002
\\u5909\\u6570\\u306e\\u30b7\\u30e3\\u30c9\\u30fc\\u30a4\\u30f3\\u30b0\\u306f\\u3001\\u5909\\u6570\\u540d\\u304c\\u30d6\\u30ed\\u30c3\\u30af\\u5185\\u3067\\u518d\\u5ba3\\u8a00\\u3055\\u308c\\u308b\\u3053\\u3068\\u3067\\u751f\\u3058\\u307e\\u3059\\u304c\\u3001\\u3053\\u308c\\u306f\\u9593\\u9055\\u3044\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3057\\u3084\\u3059\\u304f\\u3057\\u307e\\u3059\\u3002\\u5909\\u6570\\u306e\\u30b7\\u30e3\\u30c9\\u30fc\\u30a4\\u30f3\\u30b0\\u3092\\u7981\\u6b62\\u3059\\u308b\\u304b\\u3069\\u3046\\u304b\\u306f\\u500b\\u4eba\\u306e\\u597d\\u307f\\u306b\\u3088\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30a8\\u30e9\\u30fc\\u306b\\u5bfe\\u3057\\u3066 err \\u306e\\u3088\\u3046\\u306a\\u65e2\\u5b58\\u306e\\u5909\\u6570\\u540d\\u3092\\u518d\\u5229\\u7528\\u3059\\u308b\\u3068\\u4fbf\\u5229\\u306a\\u5834\\u5408\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3068\\u306f\\u3044\\u3048\\u3001\\u30b3\\u30fc\\u30c9\\u306f\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u3055\\u308c\\u305f\\u3082\\u306e\\u306e\\u3001\\u5024\\u3092\\u53d7\\u3051\\u53d6\\u3063\\u305f\\u5909\\u6570\\u304c\\u4e88\\u671f\\u3057\\u305f\\u3082\\u306e\\u3067\\u306f\\u306a\\u3044\\u3068\\u3044\\u3046\\u30b7\\u30ca\\u30ea\\u30aa\\u306b\\u76f4\\u9762\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u539f\\u5247\\u3068\\u3057\\u3066\\u5f15\\u304d\\u7d9a\\u304d\\u6ce8\\u610f\\u3092\\u6255\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#2\",\"title\":\"\\u4e0d\\u5fc5\\u8981\\u306b\\u30cd\\u30b9\\u30c8\\u3055\\u308c\\u305f\\u30b3\\u30fc\\u30c9 (#2)\",\"text\":\"\\u8981\\u7d04 \\u30cd\\u30b9\\u30c8\\u304c\\u6df1\\u304f\\u306a\\u3089\\u306a\\u3044\\u3088\\u3046\\u306b\\u3057\\u3001\\u30cf\\u30c3\\u30d4\\u30fc\\u30d1\\u30b9\\u3092\\u5de6\\u5074\\u306b\\u63c3\\u3048\\u308b\\u3053\\u3068\\u3067\\u30e1\\u30f3\\u30bf\\u30eb\\u30b3\\u30fc\\u30c9\\u30e2\\u30c7\\u30eb\\u3092\\u69cb\\u7bc9\\u3059\\u308b\\u3053\\u3068\\u304c\\u5bb9\\u6613\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u4e00\\u822c\\u7684\\u306b\\u3001\\u95a2\\u6570\\u304c\\u3088\\u308a\\u6df1\\u3044\\u30cd\\u30b9\\u30c8\\u3092\\u8981\\u6c42\\u3059\\u308b\\u307b\\u3069\\u3001\\u8aad\\u3093\\u3067\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u3088\\u308a\\u8907\\u96d1\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u79c1\\u305f\\u3061\\u306e\\u30b3\\u30fc\\u30c9\\u306e\\u53ef\\u8aad\\u6027\\u3092\\u6700\\u9069\\u5316\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u3053\\u306e\\u30eb\\u30fc\\u30eb\\u306e\\u9069\\u7528\\u65b9\\u6cd5\\u3092\\u898b\\u3066\\u3044\\u304d\\u307e\\u3057\\u3087\\u3046\\u3002
if \\u30d6\\u30ed\\u30c3\\u30af\\u304c\\u8fd4\\u3055\\u308c\\u308b\\u3068\\u304d\\u3001\\u3059\\u3079\\u3066\\u306e\\u5834\\u5408\\u306b\\u304a\\u3044\\u3066 else \\u30d6\\u30ed\\u30c3\\u30af\\u3092\\u7701\\u7565\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 \\u305f\\u3068\\u3048\\u3070\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306b\\u66f8\\u304f\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002 if foo() {\\n // ...\\n return true\\n} else {\\n // ...\\n}\\n\\u4ee3\\u308f\\u308a\\u306b\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306b else \\u30d6\\u30ed\\u30c3\\u30af\\u3092\\u7701\\u7565\\u3057\\u307e\\u3059\\u3002
if foo() {\\n // ...\\n return true\\n}\\n// ...\\n \\u30ce\\u30f3\\u30cf\\u30c3\\u30d4\\u30fc\\u30d1\\u30b9\\u3067\\u3082\\u3053\\u306e\\u30ed\\u30b8\\u30c3\\u30af\\u306b\\u5f93\\u3046\\u3053\\u3068\\u304c\\u53ef\\u80fd\\u3067\\u3059\\u3002 if s != \\\"\\\" {\\n // ...\\n} else {\\n return errors.New(\\\"empty string\\\")\\n}\\n\\u3053\\u3053\\u3067\\u306f\\u3001\\u7a7a\\u306e s \\u304c\\u30ce\\u30f3\\u30cf\\u30c3\\u30d4\\u30fc\\u30d1\\u30b9\\u3092\\u8868\\u3057\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306b\\u6761\\u4ef6\\u3092\\u3072\\u3063\\u304f\\u308a\\u8fd4\\u3059\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
if s == \\\"\\\" {\\n return errors.New(\\\"empty string\\\")\\n}\\n// ...\\n\\u8aad\\u307f\\u3084\\u3059\\u3044\\u30b3\\u30fc\\u30c9\\u3092\\u66f8\\u304f\\u3053\\u3068\\u306f\\u3001\\u3059\\u3079\\u3066\\u306e\\u958b\\u767a\\u8005\\u306b\\u3068\\u3063\\u3066\\u91cd\\u8981\\u306a\\u8ab2\\u984c\\u3067\\u3059\\u3002\\u30cd\\u30b9\\u30c8\\u3055\\u308c\\u305f\\u30d6\\u30ed\\u30c3\\u30af\\u306e\\u6570\\u3092\\u6e1b\\u3089\\u3059\\u3088\\u3046\\u52aa\\u3081\\u3001\\u30cf\\u30c3\\u30d4\\u30fc\\u30d1\\u30b9\\u3092\\u5de6\\u5074\\u306b\\u63c3\\u3048\\u3001\\u3067\\u304d\\u308b\\u3060\\u3051\\u65e9\\u304f\\u623b\\u308b\\u3053\\u3068\\u304c\\u3001\\u30b3\\u30fc\\u30c9\\u306e\\u53ef\\u8aad\\u6027\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u5177\\u4f53\\u7684\\u306a\\u624b\\u6bb5\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#init-3\",\"title\":\"init\\u95a2\\u6570\\u306e\\u8aa4\\u7528 (#3)\",\"text\":\"\\u8981\\u7d04 \\u5909\\u6570\\u3092\\u521d\\u671f\\u5316\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001init\\u95a2\\u6570\\u306e\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u304c\\u5236\\u9650\\u3055\\u308c\\u3066\\u304a\\u308a\\u3001\\u30b9\\u30c6\\u30fc\\u30c8\\u306e\\u51e6\\u7406\\u3068\\u30c6\\u30b9\\u30c8\\u304c\\u3088\\u308a\\u8907\\u96d1\\u306b\\u306a\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u521d\\u671f\\u5316\\u306f\\u7279\\u5b9a\\u306e\\u95a2\\u6570\\u3068\\u3057\\u3066\\u51e6\\u7406\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
init\\u95a2\\u6570\\u306f\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u30b9\\u30c6\\u30fc\\u30c8\\u3092\\u521d\\u671f\\u5316\\u3059\\u308b\\u305f\\u3081\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u308b\\u95a2\\u6570\\u3067\\u3059\\u3002\\u5f15\\u6570\\u3092\\u53d6\\u3089\\u305a\\u3001\\u7d50\\u679c\\u3082\\u8fd4\\u3057\\u307e\\u305b\\u3093\\uff08 func() \\u95a2\\u6570\\uff09\\u3002\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u304c\\u521d\\u671f\\u5316\\u3055\\u308c\\u308b\\u3068\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u5185\\u306e\\u3059\\u3079\\u3066\\u306e\\u5b9a\\u6570\\u304a\\u3088\\u3073\\u5909\\u6570\\u306e\\u5ba3\\u8a00\\u304c\\u8a55\\u4fa1\\u3055\\u308c\\u307e\\u3059\\u3002\\u6b21\\u306b\\u3001init\\u95a2\\u6570\\u304c\\u5b9f\\u884c\\u3055\\u308c\\u307e\\u3059\\u3002
init\\u95a2\\u6570\\u306f\\u3044\\u304f\\u3064\\u304b\\u306e\\u554f\\u984c\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u304c\\u5236\\u9650\\u3055\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 \\u30c6\\u30b9\\u30c8\\u306e\\u5b9f\\u88c5\\u65b9\\u6cd5\\u304c\\u8907\\u96d1\\u306b\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001\\u5916\\u90e8\\u4f9d\\u5b58\\u95a2\\u4fc2\\u3092\\u8a2d\\u5b9a\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u304c\\u3001\\u5358\\u4f53\\u30c6\\u30b9\\u30c8\\u306e\\u7bc4\\u56f2\\u3067\\u306f\\u5fc5\\u8981\\u306a\\u3044\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\uff09\\u3002 \\u521d\\u671f\\u5316\\u3067\\u30b9\\u30c6\\u30fc\\u30c8\\u3092\\u8a2d\\u5b9a\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001\\u30b0\\u30ed\\u30fc\\u30d0\\u30eb\\u5909\\u6570\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 init\\u95a2\\u6570\\u306b\\u306f\\u6ce8\\u610f\\u304c\\u5fc5\\u8981\\u3067\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u9759\\u7684\\u69cb\\u6210\\u306e\\u5b9a\\u7fa9\\u306a\\u3069\\u3001\\u72b6\\u6cc1\\u306b\\u3088\\u3063\\u3066\\u306f\\u5f79\\u7acb\\u3064\\u5834\\u5408\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u521d\\u671f\\u5316\\u51e6\\u7406\\u306f\\u7279\\u5b9a\\u306e\\u95a2\\u6570\\u3092\\u901a\\u3058\\u3066\\u884c\\u308f\\u308c\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#4\",\"title\":\"\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u306e\\u4e71\\u7528 (#4)\",\"text\":\"\\u8981\\u7d04 Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u6163\\u7528\\u7684\\u306b\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u306e\\u4f7f\\u7528\\u3092\\u5f37\\u5236\\u3059\\u308b\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u5b9f\\u5229\\u3092\\u91cd\\u8996\\u3057\\u3001\\u52b9\\u7387\\u6027\\u3068\\u7279\\u5b9a\\u306e\\u6163\\u7fd2\\u306b\\u5f93\\u3046\\u3053\\u3068\\u3068\\u306e\\u9593\\u306e\\u9069\\u5207\\u306a\\u30d0\\u30e9\\u30f3\\u30b9\\u3092\\u898b\\u3064\\u3051\\u308b\\u3053\\u3068\\u304c\\u3001\\u9032\\u3080\\u3079\\u304d\\u9053\\u3067\\u3042\\u308b\\u306f\\u305a\\u3067\\u3059\\u3002
\\u30c7\\u30fc\\u30bf\\u306e\\u30ab\\u30d7\\u30bb\\u30eb\\u5316\\u3068\\u306f\\u3001\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u306e\\u5024\\u307e\\u305f\\u306f\\u72b6\\u614b\\u3092\\u96a0\\u3059\\u3053\\u3068\\u3092\\u6307\\u3057\\u307e\\u3059\\u3002\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u306f\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u3066\\u3044\\u306a\\u3044\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u306e\\u4e0a\\u306b\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u3053\\u3068\\u3067\\u30ab\\u30d7\\u30bb\\u30eb\\u5316\\u3092\\u53ef\\u80fd\\u306b\\u3059\\u308b\\u624b\\u6bb5\\u3067\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u4e00\\u90e8\\u306e\\u8a00\\u8a9e\\u3067\\u898b\\u3089\\u308c\\u308b\\u3088\\u3046\\u306a\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u306e\\u81ea\\u52d5\\u30b5\\u30dd\\u30fc\\u30c8\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u307e\\u305f\\u3001\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u69cb\\u9020\\u4f53\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3059\\u308b\\u3053\\u3068\\u306f\\u5fc5\\u9808\\u3067\\u3082\\u6163\\u7528\\u7684\\u3067\\u3082\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u5024\\u3092\\u3082\\u305f\\u3089\\u3055\\u306a\\u3044\\u69cb\\u9020\\u4f53\\u306e\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u3067\\u30b3\\u30fc\\u30c9\\u3092\\u57cb\\u3081\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u5b9f\\u5229\\u3092\\u91cd\\u8996\\u3057\\u3001\\u4ed6\\u306e\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u30d1\\u30e9\\u30c0\\u30a4\\u30e0\\u3067\\u6642\\u306b\\u306f\\u8b70\\u8ad6\\u306e\\u4f59\\u5730\\u304c\\u306a\\u3044\\u3068\\u8003\\u3048\\u3089\\u308c\\u3066\\u3044\\u308b\\u6163\\u7fd2\\u306b\\u5f93\\u3046\\u3053\\u3068\\u3068\\u3001\\u52b9\\u7387\\u6027\\u3068\\u306e\\u9593\\u306e\\u9069\\u5207\\u306a\\u30d0\\u30e9\\u30f3\\u30b9\\u3092\\u898b\\u3064\\u3051\\u308b\\u3088\\u3046\\u52aa\\u3081\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
Go\\u8a00\\u8a9e\\u306f\\u3001\\u30b7\\u30f3\\u30d7\\u30eb\\u3055\\u3092\\u542b\\u3080\\u591a\\u304f\\u306e\\u7279\\u6027\\u3092\\u8003\\u616e\\u3057\\u3066\\u8a2d\\u8a08\\u3055\\u308c\\u305f\\u72ec\\u81ea\\u306e\\u8a00\\u8a9e\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u5fd8\\u308c\\u306a\\u3044\\u3067\\u304f\\u3060\\u3055\\u3044\\u3002\\u305f\\u3060\\u3057\\u3001\\u30b2\\u30c3\\u30bf\\u30fc\\u3068\\u30bb\\u30c3\\u30bf\\u30fc\\u306e\\u5fc5\\u8981\\u6027\\u304c\\u898b\\u3064\\u304b\\u3063\\u305f\\u5834\\u5408\\u3001\\u307e\\u305f\\u306f\\u524d\\u8ff0\\u306e\\u3088\\u3046\\u306b\\u3001\\u524d\\u65b9\\u4e92\\u63db\\u6027\\u3092\\u4fdd\\u8a3c\\u3057\\u306a\\u304c\\u3089\\u5c06\\u6765\\u306e\\u5fc5\\u8981\\u6027\\u304c\\u4e88\\u6e2c\\u3055\\u308c\\u308b\\u5834\\u5408\\u306f\\u3001\\u305d\\u308c\\u3089\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u306b\\u554f\\u984c\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\"},{\"location\":\"ja/#5\",\"title\":\"\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u6c5a\\u67d3 (#5)\",\"text\":\"\\u8981\\u7d04 \\u62bd\\u8c61\\u5316\\u306f\\u4f5c\\u6210\\u3055\\u308c\\u308b\\u3079\\u304d\\u3082\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u767a\\u898b\\u3055\\u308c\\u308b\\u3079\\u304d\\u3082\\u306e\\u3067\\u3059\\u3002\\u4e0d\\u5fc5\\u8981\\u306a\\u8907\\u96d1\\u3055\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u3001\\u5fc5\\u8981\\u306b\\u306a\\u308b\\u3068\\u4e88\\u6e2c\\u3057\\u305f\\u3068\\u304d\\u3067\\u306f\\u306a\\u304f\\u3001\\u5fc5\\u8981\\u306b\\u306a\\u3063\\u305f\\u3068\\u304d\\u306b\\u4f5c\\u6210\\u3059\\u308b\\u304b\\u3001\\u5c11\\u306a\\u304f\\u3068\\u3082\\u62bd\\u8c61\\u5316\\u304c\\u6709\\u52b9\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u8a3c\\u660e\\u3067\\u304d\\u308b\\u5834\\u5408\\u306b\\u4f5c\\u6210\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u3001\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u306e\\u52d5\\u4f5c\\u3092\\u6307\\u5b9a\\u3059\\u308b\\u65b9\\u6cd5\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002\\u8907\\u6570\\u306e\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u304c\\u5b9f\\u88c5\\u3067\\u304d\\u308b\\u5171\\u901a\\u9805\\u3092\\u62bd\\u51fa\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002Go\\u8a00\\u8a9e\\u306e\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u304c\\u5927\\u304d\\u304f\\u7570\\u306a\\u308b\\u306e\\u306f\\u3001\\u6697\\u9ed9\\u7684\\u306b\\u6e80\\u305f\\u3055\\u308c\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8 X \\u304c\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9 Y \\u3092\\u5b9f\\u88c5\\u3057\\u3066\\u3044\\u308b\\u3053\\u3068\\u3092\\u793a\\u3059 implements \\u306e\\u3088\\u3046\\u306a\\u660e\\u793a\\u7684\\u306a\\u30ad\\u30fc\\u30ef\\u30fc\\u30c9\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u4e00\\u822c\\u306b\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u304c\\u4fa1\\u5024\\u3092\\u3082\\u305f\\u3089\\u3059\\u3068\\u8003\\u3048\\u3089\\u308c\\u308b\\u4e3b\\u8981\\u306a\\u4f7f\\u7528\\u4f8b\\u306f\\uff13\\u3064\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u308c\\u306f\\u3001\\u5171\\u901a\\u306e\\u52d5\\u4f5c\\u3092\\u9664\\u5916\\u3059\\u308b\\u3001\\u4f55\\u3089\\u304b\\u306e\\u5206\\u96e2\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3001\\u304a\\u3088\\u3073\\u578b\\u3092\\u7279\\u5b9a\\u306e\\u52d5\\u4f5c\\u306b\\u5236\\u9650\\u3059\\u308b\\u3068\\u3044\\u3046\\u3082\\u306e\\u3067\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u3053\\u306e\\u30ea\\u30b9\\u30c8\\u306f\\u3059\\u3079\\u3066\\u3092\\u7db2\\u7f85\\u3057\\u3066\\u3044\\u308b\\u308f\\u3051\\u3067\\u306f\\u306a\\u304f\\u3001\\u76f4\\u9762\\u3059\\u308b\\u72b6\\u6cc1\\u306b\\u3088\\u3063\\u3066\\u3082\\u7570\\u306a\\u308a\\u307e\\u3059\\u3002
\\u591a\\u304f\\u306e\\u5834\\u5408\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u62bd\\u8c61\\u5316\\u3059\\u308b\\u305f\\u3081\\u306b\\u4f5c\\u6210\\u3055\\u308c\\u307e\\u3059\\u3002\\u305d\\u3057\\u3066\\u3001\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u3067\\u62bd\\u8c61\\u5316\\u3059\\u308b\\u3068\\u304d\\u306e\\u4e3b\\u306a\\u6ce8\\u610f\\u70b9\\u306f\\u3001\\u62bd\\u8c61\\u5316\\u306f\\u4f5c\\u6210\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u306f\\u306a\\u304f\\u3001\\u767a\\u898b\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u3042\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u3053\\u3068\\u3067\\u3059\\u3002\\u3059\\u306a\\u308f\\u3061\\u3001\\u305d\\u3046\\u3059\\u308b\\u76f4\\u63a5\\u306e\\u7406\\u7531\\u304c\\u306a\\u3044\\u9650\\u308a\\u3001\\u30b3\\u30fc\\u30c9\\u5185\\u3067\\u62bd\\u8c61\\u5316\\u3059\\u3079\\u304d\\u3067\\u306f\\u306a\\u3044\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3059\\u3002\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u4f7f\\u3063\\u3066\\u8a2d\\u8a08\\u3059\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u5177\\u4f53\\u7684\\u306a\\u30cb\\u30fc\\u30ba\\u3092\\u5f85\\u3064\\u3079\\u304d\\u3067\\u3059\\u3002\\u5225\\u306e\\u8a00\\u3044\\u65b9\\u3092\\u3059\\u308c\\u3070\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u5fc5\\u8981\\u306b\\u306a\\u308b\\u3068\\u4e88\\u6e2c\\u3057\\u305f\\u3068\\u304d\\u3067\\u306f\\u306a\\u304f\\u3001\\u5fc5\\u8981\\u306b\\u306a\\u3063\\u305f\\u3068\\u304d\\u306b\\u4f5c\\u6210\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306e\\u904e\\u5ea6\\u306a\\u4f7f\\u7528\\u3092\\u3057\\u305f\\u5834\\u5408\\u306e\\u4e3b\\u306a\\u554f\\u984c\\u306f\\u4f55\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u7b54\\u3048\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u30d5\\u30ed\\u30fc\\u304c\\u3088\\u308a\\u8907\\u96d1\\u306b\\u306a\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u5f79\\u306b\\u7acb\\u305f\\u306a\\u3044\\u9593\\u63a5\\u53c2\\u7167\\u3092\\u8ffd\\u52a0\\u3057\\u3066\\u3082\\u4f55\\u306e\\u4fa1\\u5024\\u3082\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u305d\\u308c\\u306f\\u4fa1\\u5024\\u306e\\u306a\\u3044\\u62bd\\u8c61\\u5316\\u3092\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u8aad\\u307f\\u3001\\u7406\\u89e3\\u3057\\u3001\\u63a8\\u8ad6\\u3059\\u308b\\u3053\\u3068\\u3092\\u3055\\u3089\\u306b\\u56f0\\u96e3\\u306b\\u3057\\u307e\\u3059\\u3002\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u8ffd\\u52a0\\u3059\\u308b\\u660e\\u78ba\\u306a\\u7406\\u7531\\u304c\\u306a\\u304f\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306b\\u3088\\u3063\\u3066\\u30b3\\u30fc\\u30c9\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u6539\\u5584\\u3055\\u308c\\u308b\\u304b\\u304c\\u4e0d\\u660e\\u77ad\\u306a\\u5834\\u5408\\u306f\\u3001\\u305d\\u306e\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306e\\u76ee\\u7684\\u306b\\u7570\\u8b70\\u3092\\u5531\\u3048\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u5b9f\\u88c5\\u3092\\u76f4\\u63a5\\u547c\\u3073\\u51fa\\u3059\\u306e\\u3082\\u4e00\\u3064\\u306e\\u624b\\u3067\\u3059\\u3002
\\u30b3\\u30fc\\u30c9\\u5185\\u3067\\u62bd\\u8c61\\u5316\\u3059\\u308b\\u3068\\u304d\\u306f\\u6ce8\\u610f\\u304c\\u5fc5\\u8981\\u3067\\u3059\\uff08\\u62bd\\u8c61\\u5316\\u306f\\u4f5c\\u6210\\u3059\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u767a\\u898b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\uff09\\u3002\\u5f8c\\u3067\\u5fc5\\u8981\\u306b\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3082\\u306e\\u3092\\u8003\\u616e\\u3057\\u3001\\u5b8c\\u74a7\\u306a\\u62bd\\u8c61\\u5316\\u30ec\\u30d9\\u30eb\\u3092\\u63a8\\u6e2c\\u3057\\u3066\\u3001\\u79c1\\u305f\\u3061\\u30bd\\u30d5\\u30c8\\u30a6\\u30a7\\u30a2\\u958b\\u767a\\u8005\\u306f\\u30b3\\u30fc\\u30c9\\u3092\\u30aa\\u30fc\\u30d0\\u30fc\\u30a8\\u30f3\\u30b8\\u30cb\\u30a2\\u30ea\\u30f3\\u30b0\\u3059\\u308b\\u3053\\u3068\\u304c\\u3088\\u304f\\u3042\\u308a\\u307e\\u3059\\u3002\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u30b3\\u30fc\\u30c9\\u304c\\u4e0d\\u5fc5\\u8981\\u306a\\u62bd\\u8c61\\u5316\\u3067\\u6c5a\\u67d3\\u3055\\u308c\\u3001\\u8aad\\u307f\\u306b\\u304f\\u304f\\u306a\\u308b\\u305f\\u3081\\u3001\\u3053\\u306e\\u30d7\\u30ed\\u30bb\\u30b9\\u306f\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30ed\\u30d6\\u30fb\\u30d1\\u30a4\\u30af
\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3067\\u30c7\\u30b6\\u30a4\\u30f3\\u3059\\u308b\\u306a\\u3002\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u898b\\u3064\\u3051\\u51fa\\u305b\\u3002
\\u62bd\\u8c61\\u7684\\u306b\\u554f\\u984c\\u3092\\u89e3\\u6c7a\\u3057\\u3088\\u3046\\u3068\\u3059\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u4eca\\u89e3\\u6c7a\\u3059\\u3079\\u304d\\u3053\\u3068\\u3092\\u89e3\\u6c7a\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u6700\\u5f8c\\u306b\\u91cd\\u8981\\u306a\\u3053\\u3068\\u3067\\u3059\\u304c\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306b\\u3088\\u3063\\u3066\\u30b3\\u30fc\\u30c9\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u6539\\u5584\\u3055\\u308c\\u308b\\u304b\\u304c\\u4e0d\\u660e\\u77ad\\u306a\\u5834\\u5408\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u7c21\\u7d20\\u5316\\u3059\\u308b\\u305f\\u3081\\u306b\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u524a\\u9664\\u3059\\u308b\\u3053\\u3068\\u3092\\u691c\\u8a0e\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3067\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#6\",\"title\":\"\\u751f\\u7523\\u8005\\u5074\\u306e\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9 (#6)\",\"text\":\"\\u8981\\u7d04 \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u5074\\u3067\\u4fdd\\u6301\\u3059\\u308b\\u3053\\u3068\\u3067\\u4e0d\\u5fc5\\u8981\\u306a\\u62bd\\u8c61\\u5316\\u3092\\u56de\\u907f\\u3067\\u304d\\u307e\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u304c\\u6697\\u9ed9\\u7684\\u306b\\u6e80\\u305f\\u3055\\u308c\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u3001\\u660e\\u793a\\u7684\\u306a\\u5b9f\\u88c5\\u3092\\u6301\\u3064\\u8a00\\u8a9e\\u3068\\u6bd4\\u8f03\\u3057\\u3066\\u5927\\u304d\\u306a\\u5909\\u5316\\u3092\\u3082\\u305f\\u3089\\u3059\\u50be\\u5411\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u5f93\\u3046\\u3079\\u304d\\u30a2\\u30d7\\u30ed\\u30fc\\u30c1\\u306f\\u524d\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u3067\\u8aac\\u660e\\u3057\\u305f\\u3082\\u306e\\u2015\\u2015\\u62bd\\u8c61\\u5316\\u306f\\u4f5c\\u6210\\u3059\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u767a\\u898b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u2015\\u2015\\u306b\\u4f3c\\u3066\\u3044\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u3001\\u3059\\u3079\\u3066\\u306e\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u5bfe\\u3057\\u3066\\u7279\\u5b9a\\u306e\\u62bd\\u8c61\\u5316\\u3092\\u5f37\\u5236\\u3059\\u308b\\u306e\\u306f\\u751f\\u7523\\u8005\\u306e\\u5f79\\u5272\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002\\u4ee3\\u308f\\u308a\\u306b\\u3001\\u4f55\\u3089\\u304b\\u306e\\u5f62\\u5f0f\\u306e\\u62bd\\u8c61\\u5316\\u304c\\u5fc5\\u8981\\u304b\\u3069\\u3046\\u304b\\u3092\\u5224\\u65ad\\u3057\\u3001\\u305d\\u306e\\u30cb\\u30fc\\u30ba\\u306b\\u6700\\u9069\\u306a\\u62bd\\u8c61\\u5316\\u30ec\\u30d9\\u30eb\\u3092\\u6c7a\\u5b9a\\u3059\\u308b\\u306e\\u306f\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306e\\u8cac\\u4efb\\u3067\\u3059\\u3002
\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306f\\u6d88\\u8cbb\\u8005\\u5074\\u306b\\u5b58\\u5728\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u7279\\u5b9a\\u306e\\u72b6\\u6cc1\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001\\u62bd\\u8c61\\u5316\\u304c\\u6d88\\u8cbb\\u8005\\u306b\\u3068\\u3063\\u3066\\u5f79\\u7acb\\u3064\\u3053\\u3068\\u304c\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u2015\\u2015\\u4e88\\u6e2c\\u306f\\u3057\\u3066\\u3044\\u306a\\u3044\\u2015\\u2015\\u5834\\u5408\\uff09\\u3067\\u306f\\u3001\\u305d\\u308c\\u3092\\u751f\\u7523\\u8005\\u5074\\u3067\\u4f7f\\u7528\\u3057\\u305f\\u3044\\u5834\\u5408\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u3046\\u3057\\u305f\\u5834\\u5408\\u3001\\u53ef\\u80fd\\u306a\\u9650\\u308a\\u6700\\u5c0f\\u9650\\u306b\\u6291\\u3048\\u3001\\u518d\\u5229\\u7528\\u53ef\\u80fd\\u6027\\u3092\\u9ad8\\u3081\\u3001\\u3088\\u308a\\u7c21\\u5358\\u306b\\u69cb\\u6210\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u52aa\\u3081\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#7\",\"title\":\"\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u8fd4\\u3059 (#7)\",\"text\":\"\\u8981\\u7d04 \\u67d4\\u8edf\\u6027\\u306b\\u554f\\u984c\\u304c\\u306a\\u3044\\u3088\\u3046\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u95a2\\u6570\\u306f\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3067\\u306f\\u306a\\u304f\\u5177\\u4f53\\u7684\\u200b\\u200b\\u306a\\u5b9f\\u88c5\\u3092\\u8fd4\\u3059\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u9006\\u306b\\u3001\\u95a2\\u6570\\u306f\\u53ef\\u80fd\\u306a\\u9650\\u308a\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u53d7\\u3051\\u5165\\u308c\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3067\\u306f\\u306a\\u304f\\u5177\\u4f53\\u7684\\u306a\\u5b9f\\u88c5\\u3092\\u8fd4\\u3059\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u3046\\u3067\\u306a\\u3044\\u3068\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u4f9d\\u5b58\\u95a2\\u4fc2\\u306b\\u3088\\u308a\\u8a2d\\u8a08\\u304c\\u3044\\u3063\\u305d\\u3046\\u8907\\u96d1\\u306b\\u306a\\u308a\\u3001\\u3059\\u3079\\u3066\\u306e\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c\\u540c\\u3058\\u62bd\\u8c61\\u5316\\u306b\\u4f9d\\u5b58\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u67d4\\u8edf\\u6027\\u306b\\u6b20\\u3051\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u7d50\\u8ad6\\u306f\\u524d\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u3068\\u4f3c\\u3066\\u3044\\u307e\\u3059\\u3002\\u62bd\\u8c61\\u5316\\u304c\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u3068\\u3063\\u3066\\u5f79\\u7acb\\u3064\\u3053\\u3068\\u304c\\uff08\\u4e88\\u6e2c\\u3055\\u308c\\u308b\\u3067\\u306f\\u306a\\u304f\\uff09\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u8fd4\\u3059\\u3053\\u3068\\u3092\\u691c\\u8a0e\\u3057\\u3066\\u3082\\u3088\\u3044\\u3067\\u3057\\u3087\\u3046\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u5834\\u5408\\u306f\\u3001\\u62bd\\u8c61\\u5316\\u3092\\u5f37\\u5236\\u3059\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u305d\\u308c\\u3089\\u306f\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u3088\\u3063\\u3066\\u767a\\u898b\\u3055\\u308c\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u4f55\\u3089\\u304b\\u306e\\u7406\\u7531\\u3067\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c\\u5b9f\\u88c5\\u3092\\u62bd\\u8c61\\u5316\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u3067\\u3082\\u3001\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u5074\\u3067\\u305d\\u308c\\u3092\\u884c\\u3046\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#any-8\",\"title\":\"any \\u306f\\u4f55\\u3082\\u8a00\\u308f\\u306a\\u3044 (#8)\",\"text\":\"\\u8981\\u7d04 json.Marshal \\u306a\\u3069\\u8003\\u3048\\u3046\\u308b\\u3059\\u3079\\u3066\\u306e\\u578b\\u3092\\u53d7\\u3051\\u5165\\u308c\\u308b\\u304b\\u8fd4\\u3059\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306b\\u306e\\u307f any \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u5834\\u5408\\u3001any \\u306f\\u610f\\u5473\\u306e\\u3042\\u308b\\u60c5\\u5831\\u3092\\u63d0\\u4f9b\\u305b\\u305a\\u3001\\u547c\\u3073\\u51fa\\u3057\\u5143\\u304c\\u4efb\\u610f\\u306e\\u30c7\\u30fc\\u30bf\\u578b\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3059\\u3053\\u3068\\u3092\\u8a31\\u53ef\\u3059\\u308b\\u305f\\u3081\\u3001\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u6642\\u306b\\u554f\\u984c\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
any \\u578b\\u306f\\u3001\\u8003\\u3048\\u3046\\u308b\\u3059\\u3079\\u3066\\u306e\\u578b\\u3092\\u53d7\\u3051\\u5165\\u308c\\u308b\\u304b\\u8fd4\\u3059\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001\\u30de\\u30fc\\u30b7\\u30e3\\u30ea\\u30f3\\u30b0\\u3084\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30c8\\u306e\\u5834\\u5408\\uff09\\u306b\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002\\u539f\\u5247\\u3068\\u3057\\u3066\\u30b3\\u30fc\\u30c9\\u3092\\u904e\\u5ea6\\u306b\\u4e00\\u822c\\u5316\\u3059\\u308b\\u3053\\u3068\\u306f\\u4f55\\u3068\\u3057\\u3066\\u3082\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u30b3\\u30fc\\u30c9\\u306e\\u8868\\u73fe\\u529b\\u306a\\u3069\\u306e\\u4ed6\\u306e\\u5074\\u9762\\u304c\\u5411\\u4e0a\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u5c11\\u3057\\u91cd\\u8907\\u3055\\u305b\\u305f\\u307b\\u3046\\u304c\\u826f\\u3044\\u3053\\u3068\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#9\",\"title\":\"\\u30b8\\u30a7\\u30cd\\u30ea\\u30c3\\u30af\\u30b9\\u3092\\u3044\\u3064\\u4f7f\\u7528\\u3059\\u308b\\u3079\\u304d\\u304b\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#9)\",\"text\":\"\\u8981\\u7d04 \\u30b8\\u30a7\\u30cd\\u30ea\\u30c3\\u30af\\u30b9\\u3068\\u578b\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u3092\\u5229\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u8981\\u7d20\\u3084\\u52d5\\u4f5c\\u3092\\u9664\\u5916\\u3059\\u308b\\u305f\\u3081\\u306e\\u30dc\\u30a4\\u30e9\\u30fc\\u30d7\\u30ec\\u30fc\\u30c8\\u30b3\\u30fc\\u30c9\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u578b\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306f\\u6642\\u671f\\u5c1a\\u65e9\\u306b\\u4f7f\\u7528\\u305b\\u305a\\u3001\\u5177\\u4f53\\u7684\\u306a\\u5fc5\\u8981\\u6027\\u304c\\u308f\\u304b\\u3063\\u305f\\u5834\\u5408\\u306b\\u306e\\u307f\\u4f7f\\u7528\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u305d\\u3046\\u3067\\u306a\\u3051\\u308c\\u3070\\u3001\\u4e0d\\u5fc5\\u8981\\u306a\\u62bd\\u8c61\\u5316\\u3068\\u8907\\u96d1\\u3055\\u304c\\u751f\\u3058\\u307e\\u3059\\u3002
\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#10\",\"title\":\"\\u578b\\u306e\\u57cb\\u3081\\u8fbc\\u307f\\u3067\\u8d77\\u3053\\u308a\\u3046\\u308b\\u554f\\u984c\\u3092\\u628a\\u63e1\\u3057\\u3066\\u3044\\u306a\\u3044 (#10)\",\"text\":\"\\u8981\\u7d04 \\u578b\\u57cb\\u3081\\u8fbc\\u307f\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30dc\\u30a4\\u30e9\\u30fc\\u30d7\\u30ec\\u30fc\\u30c8\\u30b3\\u30fc\\u30c9\\u3092\\u56de\\u907f\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u305d\\u3046\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u4e00\\u90e8\\u306e\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u975e\\u8868\\u793a\\u306b\\u3057\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306b\\u554f\\u984c\\u304c\\u767a\\u751f\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u69cb\\u9020\\u4f53\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3068\\u304d\\u3001Go\\u8a00\\u8a9e\\u306f\\u578b\\u3092\\u57cb\\u3081\\u8fbc\\u3080\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u578b\\u57cb\\u3081\\u8fbc\\u307f\\u306e\\u610f\\u5473\\u3092\\u3059\\u3079\\u3066\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044\\u3068\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u3067\\u306f\\u3001\\u578b\\u3092\\u57cb\\u3081\\u8fbc\\u3080\\u65b9\\u6cd5\\u3001\\u305d\\u308c\\u304c\\u3082\\u305f\\u3089\\u3059\\u3082\\u306e\\u3001\\u304a\\u3088\\u3073\\u8003\\u3048\\u3089\\u308c\\u308b\\u554f\\u984c\\u306b\\u3064\\u3044\\u3066\\u898b\\u3066\\u3044\\u304d\\u307e\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u540d\\u524d\\u306a\\u3057\\u3067\\u5ba3\\u8a00\\u3055\\u308c\\u305f\\u69cb\\u9020\\u4f53\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u306f\\u3001\\u57cb\\u3081\\u8fbc\\u307f\\u3068\\u547c\\u3070\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306a\\u3082\\u306e\\u3067\\u3059\\u3002
type Foo struct {\\n Bar // \\u57cb\\u3081\\u8fbc\\u307f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\n}\\n\\ntype Bar struct {\\n Baz int\\n}\\nFoo \\u69cb\\u9020\\u4f53\\u3067\\u306f\\u3001Bar \\u578b\\u304c\\u95a2\\u9023\\u4ed8\\u3051\\u3089\\u308c\\u305f\\u540d\\u524d\\u306a\\u3057\\u3067\\u5ba3\\u8a00\\u3055\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3053\\u308c\\u306f\\u57cb\\u3081\\u8fbc\\u307f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3067\\u3059\\u3002
\\u57cb\\u3081\\u8fbc\\u307f\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u57cb\\u3081\\u8fbc\\u307f\\u578b\\u306e\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3068\\u30e1\\u30bd\\u30c3\\u30c9\\u306f\\u6607\\u683c\\u3057\\u307e\\u3059\\u3002Bar \\u306b\\u306f Baz \\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u308b\\u305f\\u3081\\u3001\\u3053\\u306e\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u306f Foo \\u306b\\u6607\\u683c\\u3057\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001Foo \\u304b\\u3089 Baz \\u3092\\u5229\\u7528\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u578b\\u306e\\u57cb\\u3081\\u8fbc\\u307f\\u306b\\u3064\\u3044\\u3066\\u4f55\\u304c\\u8a00\\u3048\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u307e\\u305a\\u3001\\u3053\\u308c\\u304c\\u5fc5\\u8981\\u306b\\u306a\\u308b\\u3053\\u3068\\u306f\\u307b\\u3068\\u3093\\u3069\\u306a\\u304f\\u3001\\u30e6\\u30fc\\u30b9\\u30b1\\u30fc\\u30b9\\u304c\\u4f55\\u3067\\u3042\\u308c\\u3001\\u304a\\u305d\\u3089\\u304f\\u578b\\u57cb\\u3081\\u8fbc\\u307f\\u306a\\u3057\\u3067\\u3082\\u540c\\u69d8\\u306b\\u89e3\\u6c7a\\u3067\\u304d\\u308b\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002\\u578b\\u306e\\u57cb\\u3081\\u8fbc\\u307f\\u306f\\u4e3b\\u306b\\u5229\\u4fbf\\u6027\\u3092\\u76ee\\u7684\\u3068\\u3057\\u3066\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u305d\\u308c\\u306f\\u52d5\\u4f5c\\u3092\\u6607\\u683c\\u3059\\u308b\\u305f\\u3081\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002
\\u578b\\u57cb\\u3081\\u8fbc\\u307f\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u6b21\\u306e 2 \\u3064\\u306e\\u4e3b\\u306a\\u5236\\u7d04\\u3092\\u5ff5\\u982d\\u306b\\u7f6e\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3078\\u306e\\u30a2\\u30af\\u30bb\\u30b9\\u3092\\u7c21\\u7d20\\u5316\\u3059\\u308b\\u305f\\u3081\\u306e\\u7cd6\\u8863\\u69cb\\u6587\\u3068\\u3057\\u3066\\u306e\\u307f\\u4f7f\\u7528\\u3057\\u306a\\u3044\\u3067\\u304f\\u3060\\u3055\\u3044\\uff08 Foo.Bar.Baz() \\u306e\\u4ee3\\u308f\\u308a\\u306b Foo.Baz() \\u306a\\u3069\\uff09\\u3002 \\u3053\\u308c\\u304c\\u552f\\u4e00\\u306e\\u6839\\u62e0\\u3067\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001\\u5185\\u90e8\\u578b\\u3092\\u57cb\\u3081\\u8fbc\\u307e\\u305a\\u3001\\u4ee3\\u308f\\u308a\\u306b\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u4f7f\\u3044\\u307e\\u3057\\u3087\\u3046\\u3002 \\u5916\\u90e8\\u304b\\u3089\\u96a0\\u3057\\u305f\\u3044\\u30c7\\u30fc\\u30bf\\uff08\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\uff09\\u3084\\u52d5\\u4f5c\\uff08\\u30e1\\u30bd\\u30c3\\u30c9\\uff09\\u3092\\u6607\\u683c\\u3057\\u3066\\u306f\\u306a\\u308a\\u307e\\u305b\\u3093\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u69cb\\u9020\\u4f53\\u306b\\u5bfe\\u3057\\u3066\\u30d7\\u30e9\\u30a4\\u30d9\\u30fc\\u30c8\\u306a\\u307e\\u307e\\u306b\\u3057\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u30ed\\u30c3\\u30af\\u52d5\\u4f5c\\u306b\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c\\u30a2\\u30af\\u30bb\\u30b9\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3059\\u308b\\u5834\\u5408\\u306a\\u3069\\u3067\\u3059\\u3002 \\u3053\\u308c\\u3089\\u306e\\u5236\\u7d04\\u3092\\u5ff5\\u982d\\u306b\\u7f6e\\u3044\\u3066\\u578b\\u57cb\\u3081\\u8fbc\\u307f\\u3092\\u610f\\u8b58\\u7684\\u306b\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u8ffd\\u52a0\\u306e\\u8ee2\\u9001\\u30e1\\u30bd\\u30c3\\u30c9\\u306b\\u3088\\u308b\\u30dc\\u30a4\\u30e9\\u30fc\\u30d7\\u30ec\\u30fc\\u30c8\\u30b3\\u30fc\\u30c9\\u3092\\u56de\\u907f\\u3059\\u308b\\u306e\\u306b\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u898b\\u305f\\u76ee\\u3060\\u3051\\u3092\\u76ee\\u7684\\u3068\\u3057\\u305f\\u308a\\u3001\\u96a0\\u3059\\u3079\\u304d\\u8981\\u7d20\\u3092\\u6607\\u683c\\u3057\\u305f\\u308a\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u6ce8\\u610f\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#functional-options-11\",\"title\":\"Functional Options \\u30d1\\u30bf\\u30fc\\u30f3\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#11)\",\"text\":\"\\u8981\\u7d04 API \\u306b\\u9069\\u3057\\u305f\\u65b9\\u6cd5\\u3067\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u3092\\u4fbf\\u5229\\u306b\\u51e6\\u7406\\u3059\\u308b\\u306b\\u306f\\u3001Functional Options \\u30d1\\u30bf\\u30fc\\u30f3\\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u3055\\u307e\\u3056\\u307e\\u306a\\u5b9f\\u88c5\\u65b9\\u6cd5\\u304c\\u5b58\\u5728\\u3057\\u3001\\u591a\\u5c11\\u306e\\u9055\\u3044\\u306f\\u3042\\u308a\\u307e\\u3059\\u304c\\u3001\\u4e3b\\u306a\\u8003\\u3048\\u65b9\\u306f\\u6b21\\u306e\\u3068\\u304a\\u308a\\u3067\\u3059\\u3002
\\u672a\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u306e\\u69cb\\u9020\\u4f53\\u306f\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u8a2d\\u5b9a\\u3092\\u4fdd\\u6301\\u3057\\u307e\\u3059\\u3002 \\u5404\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u306f\\u540c\\u3058\\u578b\\u3001type Option func(options *options) \\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u95a2\\u6570\\u3067\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001WithPort \\u306f\\u30dd\\u30fc\\u30c8\\u3092\\u8868\\u3059 int \\u5f15\\u6570\\u3092\\u53d7\\u3051\\u53d6\\u308a\\u3001options \\u69cb\\u9020\\u4f53\\u306e\\u66f4\\u65b0\\u65b9\\u6cd5\\u3092\\u8868\\u3059 Option \\u578b\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u3002
type options struct {\\n port *int\\n}\\n\\ntype Option func(options *options) error\\n\\nfunc WithPort(port int) Option {\\n return func(options *options) error {\\n if port < 0 {\\n return errors.New(\\\"port should be positive\\\")\\n }\\n options.port = &port\\n return nil\\n }\\n}\\n\\nfunc NewServer(addr string, opts ...Option) ( *http.Server, error) {\\n var options options\\n for _, opt := range opts { \\n err := opt(&options) \\n if err != nil {\\n return nil, err\\n }\\n }\\n\\n// \\u3053\\u306e\\u6bb5\\u968e\\u3067\\u3001options \\u69cb\\u9020\\u4f53\\u304c\\u69cb\\u7bc9\\u3055\\u308c\\u3001\\u69cb\\u6210\\u304c\\u542b\\u307e\\u308c\\u307e\\u3059\\u3002\\n// \\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u30dd\\u30fc\\u30c8\\u8a2d\\u5b9a\\u306b\\u95a2\\u9023\\u3059\\u308b\\u30ed\\u30b8\\u30c3\\u30af\\u3092\\u5b9f\\u88c5\\u3067\\u304d\\u307e\\u3059\\u3002\\n var port int\\n if options.port == nil {\\n port = defaultHTTPPort\\n } else {\\n if *options.port == 0 {\\n port = randomPort()\\n } else {\\n port = *options.port\\n }\\n }\\n\\n // ...\\n}\\nFunctional Options \\u30d1\\u30bf\\u30fc\\u30f3\\u306f\\u3001\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u3092\\u51e6\\u7406\\u3059\\u308b\\u305f\\u3081\\u306e\\u624b\\u8efd\\u3067 API \\u30d5\\u30ec\\u30f3\\u30c9\\u30ea\\u30fc\\u306a\\u65b9\\u6cd5\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002 Builder \\u30d1\\u30bf\\u30fc\\u30f3\\u306f\\u6709\\u52b9\\u306a\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u3067\\u3059\\u304c\\u3001\\u3044\\u304f\\u3064\\u304b\\u306e\\u5c0f\\u3055\\u306a\\u6b20\\u70b9\\uff08\\u7a7a\\u306e\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u69cb\\u6210\\u69cb\\u9020\\u4f53\\u3092\\u6e21\\u3055\\u306a\\u3051\\u308c\\u3070\\u306a\\u3089\\u306a\\u3044\\u3001\\u307e\\u305f\\u306f\\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3059\\u308b\\u65b9\\u6cd5\\u304c\\u3042\\u307e\\u308a\\u4fbf\\u5229\\u3067\\u306f\\u306a\\u3044\\uff09\\u304c\\u3042\\u308a\\u3001\\u3053\\u306e\\u7a2e\\u306e\\u554f\\u984c\\u306b\\u304a\\u3044\\u3066 Functional Options \\u30d1\\u30bf\\u30fc\\u30f3\\u304cGo\\u8a00\\u8a9e\\u306b\\u304a\\u3051\\u308b\\u6163\\u7528\\u7684\\u306a\\u5bfe\\u51e6\\u65b9\\u6cd5\\u306b\\u306a\\u308b\\u50be\\u5411\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#12\",\"title\":\"\\u8aa4\\u3063\\u305f\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u69cb\\u6210 (\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u69cb\\u9020\\u3068\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u69cb\\u6210) (#12)\",\"text\":\"\\u5168\\u4f53\\u7684\\u306a\\u69cb\\u6210\\u306b\\u95a2\\u3057\\u3066\\u306f\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u8003\\u3048\\u65b9\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3054\\u3068\\u306b\\u6574\\u7406\\u3059\\u3079\\u304d\\u304b\\u3001\\u305d\\u308c\\u3068\\u3082\\u30ec\\u30a4\\u30e4\\u30fc\\u3054\\u3068\\u306b\\u6574\\u7406\\u3059\\u3079\\u304d\\u304b\\u3001\\u305d\\u308c\\u306f\\u597d\\u307f\\u306b\\u3088\\u3063\\u3066\\u7570\\u306a\\u308a\\u307e\\u3059\\u3002\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\uff08\\u9867\\u5ba2\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3001\\u5951\\u7d04\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u306a\\u3069\\uff09\\u3054\\u3068\\u306b\\u30b3\\u30fc\\u30c9\\u3092\\u30b0\\u30eb\\u30fc\\u30d7\\u5316\\u3059\\u308b\\u3053\\u3068\\u3092\\u9078\\u3076\\u5834\\u5408\\u3082\\u3042\\u308c\\u3070\\u3001\\u516d\\u89d2\\u5f62\\u306e\\u30a2\\u30fc\\u30ad\\u30c6\\u30af\\u30c1\\u30e3\\u539f\\u5247\\u306b\\u5f93\\u3046\\u3053\\u3068\\u3068\\u3001\\u6280\\u8853\\u5c64\\u3054\\u3068\\u306b\\u30b0\\u30eb\\u30fc\\u30d7\\u5316\\u3059\\u308b\\u3053\\u3068\\u3092\\u9078\\u3076\\u5834\\u5408\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u79c1\\u305f\\u3061\\u304c\\u884c\\u3046\\u6c7a\\u5b9a\\u304c\\u4e00\\u8cab\\u3057\\u3066\\u3044\\u308b\\u9650\\u308a\\u3001\\u305d\\u308c\\u304c\\u30e6\\u30fc\\u30b9\\u30b1\\u30fc\\u30b9\\u306b\\u9069\\u5408\\u3059\\u308b\\u306a\\u3089\\u3001\\u305d\\u308c\\u304c\\u9593\\u9055\\u3063\\u3066\\u3044\\u308b\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u95a2\\u3057\\u3066\\u306f\\u3001\\u5f93\\u3046\\u3079\\u304d\\u30d9\\u30b9\\u30c8\\u30d7\\u30e9\\u30af\\u30c6\\u30a3\\u30b9\\u304c\\u8907\\u6570\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305a\\u3001\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u304c\\u904e\\u5ea6\\u306b\\u8907\\u96d1\\u306b\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u6642\\u671f\\u5c1a\\u65e9\\u306a\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u5316\\u306f\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u5834\\u5408\\u306b\\u3088\\u3063\\u3066\\u306f\\u3001\\u5b8c\\u74a7\\u306a\\u69cb\\u9020\\u3092\\u6700\\u521d\\u304b\\u3089\\u7121\\u7406\\u306b\\u4f5c\\u308d\\u3046\\u3068\\u3059\\u308b\\u3088\\u308a\\u3082\\u3001\\u5358\\u7d14\\u306a\\u69cb\\u6210\\u3092\\u4f7f\\u7528\\u3057\\u3001\\u305d\\u306e\\u5185\\u5bb9\\u3092\\u7406\\u89e3\\u3057\\u305f\\u4e0a\\u3067\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u3092\\u767a\\u5c55\\u3055\\u305b\\u308b\\u307b\\u3046\\u304c\\u826f\\u3044\\u5834\\u5408\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 \\u7c92\\u5ea6\\u3082\\u8003\\u616e\\u3059\\u3079\\u304d\\u91cd\\u8981\\u306a\\u70b9\\u3067\\u3059\\u3002 1 \\u3064\\u307e\\u305f\\u306f 2 \\u3064\\u306e\\u30d5\\u30a1\\u30a4\\u30eb\\u3060\\u3051\\u3092\\u542b\\u3080\\u6570\\u5341\\u306e\\u30ca\\u30ce\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3053\\u3068\\u306f\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u305d\\u306e\\u5834\\u5408\\u3001\\u304a\\u305d\\u3089\\u304f\\u3053\\u308c\\u3089\\u306e\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u9593\\u306e\\u8ad6\\u7406\\u7684\\u306a\\u63a5\\u7d9a\\u306e\\u4e00\\u90e8\\u304c\\u629c\\u3051\\u843d\\u3061\\u3001\\u8aad\\u307f\\u624b\\u306b\\u3068\\u3063\\u3066\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u304c\\u7406\\u89e3\\u3057\\u306b\\u304f\\u304f\\u306a\\u308b\\u304b\\u3089\\u3067\\u3059\\u3002\\u9006\\u306b\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u306e\\u610f\\u5473\\u3092\\u8584\\u3081\\u308b\\u3088\\u3046\\u306a\\u5de8\\u5927\\u306a\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3082\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u540d\\u524d\\u4ed8\\u3051\\u3082\\u6ce8\\u610f\\u3057\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\uff08\\u958b\\u767a\\u8005\\u306a\\u3089\\uff09\\u8ab0\\u3082\\u304c\\u77e5\\u3063\\u3066\\u3044\\u308b\\u3088\\u3046\\u306b\\u3001\\u540d\\u524d\\u3092\\u4ed8\\u3051\\u308b\\u306e\\u306f\\u96e3\\u3057\\u3044\\u3067\\u3059\\u3002\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c Go \\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u3092\\u7406\\u89e3\\u3057\\u3084\\u3059\\u3044\\u3088\\u3046\\u306b\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u542b\\u307e\\u308c\\u308b\\u3082\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u63d0\\u4f9b\\u3059\\u308b\\u3082\\u306e\\u306b\\u57fa\\u3065\\u3044\\u3066\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u540d\\u524d\\u3092\\u4ed8\\u3051\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305f\\u3001\\u30cd\\u30fc\\u30df\\u30f3\\u30b0\\u306b\\u306f\\u610f\\u5473\\u306e\\u3042\\u308b\\u3082\\u306e\\u3092\\u4ed8\\u3051\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u306f\\u77ed\\u304f\\u3001\\u7c21\\u6f54\\u3067\\u3001\\u8868\\u73fe\\u529b\\u8c4a\\u304b\\u3067\\u3001\\u6163\\u4f8b\\u306b\\u3088\\u308a\\u5358\\u4e00\\u306e\\u5c0f\\u6587\\u5b57\\u306b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u4f55\\u3092\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u304b\\u306b\\u3064\\u3044\\u3066\\u306e\\u30eb\\u30fc\\u30eb\\u306f\\u975e\\u5e38\\u306b\\u7c21\\u5358\\u3067\\u3059\\u3002\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u9593\\u306e\\u7d50\\u5408\\u3092\\u6e1b\\u3089\\u3057\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u308b\\u4e0d\\u8981\\u306a\\u8981\\u7d20\\u3092\\u975e\\u8868\\u793a\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3082\\u306e\\u3092\\u3067\\u304d\\u308b\\u9650\\u308a\\u6700\\u5c0f\\u9650\\u306b\\u6291\\u3048\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u8981\\u7d20\\u3092\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u304b\\u3069\\u3046\\u304b\\u4e0d\\u660e\\u306a\\u5834\\u5408\\u306f\\u3001\\u30c7\\u30d5\\u30a9\\u30eb\\u30c8\\u3067\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u5f8c\\u3067\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u304c\\u5224\\u660e\\u3057\\u305f\\u5834\\u5408\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u8abf\\u6574\\u3067\\u304d\\u307e\\u3059\\u3002\\u307e\\u305f\\u3001\\u69cb\\u9020\\u4f53\\u3092 encoding/json \\u3067\\u30a2\\u30f3\\u30de\\u30fc\\u30b7\\u30e3\\u30ea\\u30f3\\u30b0\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u306a\\u3069\\u3001\\u3044\\u304f\\u3064\\u304b\\u306e\\u4f8b\\u5916\\u306b\\u3082\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u3092\\u69cb\\u6210\\u3059\\u308b\\u306e\\u306f\\u7c21\\u5358\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u304c\\u3001\\u3053\\u308c\\u3089\\u306e\\u30eb\\u30fc\\u30eb\\u306b\\u5f93\\u3046\\u3053\\u3068\\u3067\\u7dad\\u6301\\u304c\\u5bb9\\u6613\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u4fdd\\u5b88\\u6027\\u3092\\u5bb9\\u6613\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u306f\\u4e00\\u8cab\\u6027\\u3082\\u91cd\\u8981\\u3067\\u3042\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u30b3\\u30fc\\u30c9\\u30d9\\u30fc\\u30b9\\u5185\\u3067\\u53ef\\u80fd\\u306a\\u9650\\u308a\\u4e00\\u8cab\\u6027\\u3092\\u4fdd\\u3064\\u3088\\u3046\\u306b\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u88dc\\u8db3 Go \\u30c1\\u30fc\\u30e0\\u306f Go \\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u306e\\u7d44\\u7e54\\u5316/\\u69cb\\u9020\\u5316\\u306b\\u95a2\\u3059\\u308b\\u516c\\u5f0f\\u30ac\\u30a4\\u30c9\\u30e9\\u30a4\\u30f3\\u3092 2023 \\u5e74\\u306b\\u767a\\u884c\\u3057\\u307e\\u3057\\u305f\\uff1a go.dev/doc/modules/layout
\"},{\"location\":\"ja/#13\",\"title\":\"\\u30e6\\u30fc\\u30c6\\u30a3\\u30ea\\u30c6\\u30a3\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u4f5c\\u6210 (#13)\",\"text\":\"\\u8981\\u7d04 \\u540d\\u524d\\u4ed8\\u3051\\u306f\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u8a2d\\u8a08\\u306e\\u91cd\\u8981\\u306a\\u90e8\\u5206\\u3067\\u3059\\u3002common \\u3001util \\u3001shared \\u306e\\u3088\\u3046\\u306a\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u4f5c\\u6210\\u3057\\u3066\\u3082\\u3001\\u8aad\\u307f\\u624b\\u306b\\u305d\\u308c\\u307b\\u3069\\u306e\\u4fa1\\u5024\\u3092\\u3082\\u305f\\u3089\\u3057\\u307e\\u305b\\u3093\\u3002\\u3053\\u306e\\u3088\\u3046\\u306a\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u610f\\u5473\\u306e\\u3042\\u308b\\u5177\\u4f53\\u7684\\u306a\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u306b\\u30ea\\u30d5\\u30a1\\u30af\\u30bf\\u30ea\\u30f3\\u30b0\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u307e\\u305f\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u542b\\u307e\\u308c\\u308b\\u3082\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u304c\\u63d0\\u4f9b\\u3059\\u308b\\u3082\\u306e\\u306b\\u57fa\\u3065\\u3044\\u3066\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u540d\\u524d\\u3092\\u4ed8\\u3051\\u308b\\u3068\\u3001\\u305d\\u306e\\u8868\\u73fe\\u529b\\u3092\\u9ad8\\u3081\\u308b\\u52b9\\u7387\\u7684\\u306a\\u65b9\\u6cd5\\u306b\\u306a\\u308b\\u3053\\u3068\\u306b\\u3082\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#14\",\"title\":\"\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u306e\\u885d\\u7a81\\u3092\\u7121\\u8996\\u3059\\u308b (#14)\",\"text\":\"\\u8981\\u7d04 \\u6df7\\u4e71\\u3001\\u3055\\u3089\\u306b\\u306f\\u30d0\\u30b0\\u306b\\u3064\\u306a\\u304c\\u308a\\u304b\\u306d\\u306a\\u3044\\u3001\\u5909\\u6570\\u3068\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u9593\\u306e\\u540d\\u524d\\u306e\\u885d\\u7a81\\u3092\\u56de\\u907f\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u305d\\u308c\\u305e\\u308c\\u306b\\u4e00\\u610f\\u306e\\u540d\\u524d\\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u3053\\u308c\\u304c\\u4e0d\\u53ef\\u80fd\\u306a\\u5834\\u5408\\u306f\\u3001\\u30a4\\u30f3\\u30dd\\u30fc\\u30c8\\u30a8\\u30a4\\u30ea\\u30a2\\u30b9\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u4fee\\u98fe\\u5b50\\u3092\\u5909\\u66f4\\u3057\\u3066\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u3068\\u5909\\u6570\\u540d\\u3092\\u533a\\u5225\\u3059\\u308b\\u304b\\u3001\\u3088\\u308a\\u826f\\u3044\\u540d\\u524d\\u3092\\u8003\\u3048\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u885d\\u7a81\\u306f\\u3001\\u5909\\u6570\\u540d\\u304c\\u65e2\\u5b58\\u306e\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u3068\\u885d\\u7a81\\u3059\\u308b\\u5834\\u5408\\u306b\\u767a\\u751f\\u3057\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u518d\\u5229\\u7528\\u304c\\u59a8\\u3052\\u3089\\u308c\\u307e\\u3059\\u3002\\u66d6\\u6627\\u3055\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u5909\\u6570\\u540d\\u306e\\u885d\\u7a81\\u3092\\u9632\\u3050\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u885d\\u7a81\\u304c\\u767a\\u751f\\u3057\\u305f\\u5834\\u5408\\u306f\\u3001\\u5225\\u306e\\u610f\\u5473\\u306e\\u3042\\u308b\\u540d\\u524d\\u3092\\u898b\\u3064\\u3051\\u308b\\u304b\\u3001\\u30a4\\u30f3\\u30dd\\u30fc\\u30c8\\u30a8\\u30a4\\u30ea\\u30a2\\u30b9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#15\",\"title\":\"\\u30b3\\u30fc\\u30c9\\u306e\\u6587\\u7ae0\\u5316\\u304c\\u884c\\u308f\\u308c\\u3066\\u3044\\u306a\\u3044 (#15)\",\"text\":\"\\u8981\\u7d04 \\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3068\\u30e1\\u30f3\\u30c6\\u30ca\\u304c\\u30b3\\u30fc\\u30c9\\u306e\\u610f\\u56f3\\u3092\\u7406\\u89e3\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u8981\\u7d20\\u3092\\u6587\\u7ae0\\u5316\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u6587\\u7ae0\\u5316\\u306f\\u30b3\\u30fc\\u30c7\\u30a3\\u30f3\\u30b0\\u306e\\u91cd\\u8981\\u306a\\u5074\\u9762\\u3067\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c API \\u3092\\u3088\\u308a\\u7c21\\u5358\\u306b\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u304c\\u3001\\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u306e\\u7dad\\u6301\\u306b\\u3082\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u6163\\u7528\\u7684\\u306a\\u3082\\u306e\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u3044\\u304f\\u3064\\u304b\\u306e\\u30eb\\u30fc\\u30eb\\u306b\\u5f93\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u307e\\u305a\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u3059\\u3079\\u3066\\u306e\\u8981\\u7d20\\u3092\\u6587\\u7ae0\\u5316\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u69cb\\u9020\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3001\\u95a2\\u6570\\u306a\\u3069\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3059\\u308b\\u5834\\u5408\\u306f\\u6587\\u7ae0\\u5316\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u6163\\u4f8b\\u3068\\u3057\\u3066\\u3001\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u8981\\u7d20\\u306e\\u540d\\u524d\\u304b\\u3089\\u59cb\\u307e\\u308b\\u30b3\\u30e1\\u30f3\\u30c8\\u3092\\u8ffd\\u52a0\\u3057\\u307e\\u3059\\u3002
\\u6163\\u4f8b\\u3068\\u3057\\u3066\\u3001\\u5404\\u30b3\\u30e1\\u30f3\\u30c8\\u306f\\u53e5\\u8aad\\u70b9\\u3067\\u7d42\\u308f\\u308b\\u5b8c\\u5168\\u306a\\u6587\\u3067\\u3042\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305f\\u3001\\u95a2\\u6570\\uff08\\u307e\\u305f\\u306f\\u30e1\\u30bd\\u30c3\\u30c9\\uff09\\u3092\\u6587\\u7ae0\\u5316\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u95a2\\u6570\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u5b9f\\u884c\\u3059\\u308b\\u304b\\u3067\\u306f\\u306a\\u304f\\u3001\\u305d\\u306e\\u95a2\\u6570\\u304c\\u4f55\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u3064\\u3082\\u308a\\u3067\\u3042\\u308b\\u304b\\u3092\\u5f37\\u8abf\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u306b\\u3082\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u3053\\u308c\\u306f\\u30c9\\u30ad\\u30e5\\u30e1\\u30f3\\u30c8\\u3067\\u306f\\u306a\\u304f\\u3001\\u95a2\\u6570\\u3068\\u30b3\\u30e1\\u30f3\\u30c8\\u306b\\u3064\\u3044\\u3066\\u3067\\u3059\\u3002\\u30c9\\u30ad\\u30e5\\u30e1\\u30f3\\u30c8\\u306f\\u7406\\u60f3\\u7684\\u306b\\u306f\\u3001\\u5229\\u7528\\u8005\\u304c\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u8981\\u7d20\\u306e\\u4f7f\\u7528\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u305f\\u3081\\u306b\\u30b3\\u30fc\\u30c9\\u3092\\u898b\\u308b\\u5fc5\\u8981\\u304c\\u306a\\u3044\\u307b\\u3069\\u5341\\u5206\\u306a\\u60c5\\u5831\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u5909\\u6570\\u307e\\u305f\\u306f\\u5b9a\\u6570\\u3092\\u6587\\u7ae0\\u5316\\u3059\\u308b\\u5834\\u5408\\u3001\\u305d\\u306e\\u76ee\\u7684\\u3068\\u5185\\u5bb9\\u3068\\u3044\\u3046 2 \\u3064\\u306e\\u5074\\u9762\\u3092\\u4f1d\\u3048\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002\\u524d\\u8005\\u306f\\u3001\\u5916\\u90e8\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u3068\\u3063\\u3066\\u5f79\\u7acb\\u3064\\u3088\\u3046\\u306b\\u3001\\u30b3\\u30fc\\u30c9\\u30c9\\u30ad\\u30e5\\u30e1\\u30f3\\u30c8\\u3068\\u3057\\u3066\\u5b58\\u5728\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u5f8c\\u8005\\u306f\\u5fc5\\u305a\\u3057\\u3082\\u516c\\u958b\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3068\\u30e1\\u30f3\\u30c6\\u30ca\\u304c\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u76ee\\u7684\\u3092\\u7406\\u89e3\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3001\\u5404\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u30c9\\u30ad\\u30e5\\u30e1\\u30f3\\u30c8\\u3059\\u308b\\u5fc5\\u8981\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u6163\\u4f8b\\u3068\\u3057\\u3066\\u3001\\u30b3\\u30e1\\u30f3\\u30c8\\u306f //Package \\u3067\\u59cb\\u307e\\u308a\\u3001\\u305d\\u306e\\u5f8c\\u306b\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u540d\\u304c\\u7d9a\\u304d\\u307e\\u3059\\u3002\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u30b3\\u30e1\\u30f3\\u30c8\\u306e\\u6700\\u521d\\u306e\\u884c\\u306f\\u3001\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u8868\\u793a\\u3055\\u308c\\u308b\\u305f\\u3081\\u7c21\\u6f54\\u306b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u3057\\u3066\\u3001\\u6b21\\u306e\\u884c\\u306b\\u5fc5\\u8981\\u306a\\u60c5\\u5831\\u3092\\u3059\\u3079\\u3066\\u5165\\u529b\\u3057\\u307e\\u3059\\u3002
\\u30b3\\u30fc\\u30c9\\u3092\\u6587\\u7ae0\\u5316\\u3059\\u308b\\u3053\\u3068\\u304c\\u5236\\u7d04\\u306b\\u306a\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3084\\u30e1\\u30f3\\u30c6\\u30ca\\u304c\\u30b3\\u30fc\\u30c9\\u306e\\u610f\\u56f3\\u3092\\u7406\\u89e3\\u3059\\u308b\\u306e\\u306b\\u5f79\\u7acb\\u3064\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#16\",\"title\":\"\\u30ea\\u30f3\\u30bf\\u30fc\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u306a\\u3044 (#16)\",\"text\":\"\\u8981\\u7d04 \\u30b3\\u30fc\\u30c9\\u306e\\u54c1\\u8cea\\u3068\\u4e00\\u8cab\\u6027\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u306b\\u306f\\u3001\\u30ea\\u30f3\\u30bf\\u30fc\\u3068\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc\\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046
\\u30ea\\u30f3\\u30bf\\u30fc\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u3092\\u5206\\u6790\\u3057\\u3066\\u30a8\\u30e9\\u30fc\\u3092\\u691c\\u51fa\\u3059\\u308b\\u81ea\\u52d5\\u30c4\\u30fc\\u30eb\\u3067\\u3059\\u3002\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u306e\\u76ee\\u7684\\u306f\\u3001\\u65e2\\u5b58\\u306e\\u30ea\\u30f3\\u30bf\\u30fc\\u306e\\u5b8c\\u5168\\u306a\\u30ea\\u30b9\\u30c8\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u3053\\u3068\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u305d\\u3046\\u3057\\u305f\\u5834\\u5408\\u3001\\u3059\\u3050\\u306b\\u4f7f\\u3044\\u7269\\u306b\\u306a\\u3089\\u306a\\u304f\\u306a\\u3063\\u3066\\u3057\\u307e\\u3046\\u304b\\u3089\\u3067\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e Go \\u30d7\\u30ed\\u30b8\\u30a7\\u30af\\u30c8\\u306b\\u30ea\\u30f3\\u30bf\\u30fc\\u304c\\u4e0d\\u53ef\\u6b20\\u3067\\u3042\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u306f\\u7406\\u89e3\\u3057\\u3001\\u899a\\u3048\\u3066\\u304a\\u304d\\u307e\\u3057\\u3087\\u3046\\u3002
https://golang.org/cmd/vet\\u2015\\u2015Go\\u8a00\\u8a9e\\u306e\\u6a19\\u6e96\\u30b3\\u30fc\\u30c9\\u30a2\\u30ca\\u30e9\\u30a4\\u30b6\\u30fc https://github.com/kisielk/errcheck\\u2015\\u2015\\u30a8\\u30e9\\u30fc\\u30c1\\u30a7\\u30c3\\u30ab\\u30fc https://github.com/fzipp/gocyclo\\u2015\\u2015\\u5faa\\u74b0\\u7684\\u8907\\u96d1\\u5ea6\\u30a2\\u30ca\\u30e9\\u30a4\\u30b6\\u30fc https://github.com/jgautheron/goconst\\u2015\\u2015\\u8907\\u6570\\u56de\\u4f7f\\u7528\\u6587\\u5b57\\u5217\\u30a2\\u30ca\\u30e9\\u30a4\\u30b6\\u30fc \\u30ea\\u30f3\\u30bf\\u30fc\\u306e\\u307b\\u304b\\u306b\\u3001\\u30b3\\u30fc\\u30c9\\u30b9\\u30bf\\u30a4\\u30eb\\u3092\\u4fee\\u6b63\\u3059\\u308b\\u305f\\u3081\\u306b\\u30b3\\u30fc\\u30c9\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc\\u3082\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u4ee5\\u4e0b\\u306b\\u3001\\u3044\\u304f\\u3064\\u304b\\u306e\\u30b3\\u30fc\\u30c9\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc\\u3092\\u793a\\u3057\\u307e\\u3059\\u3002
https://golang.org/cmd/gofmt\\u2015\\u2015Go\\u8a00\\u8a9e\\u306e\\u6a19\\u6e96\\u30b3\\u30fc\\u30c9\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc https://godoc.org/golang.org/x/tools/cmd/goimports\\u2015\\u2015Go\\u8a00\\u8a9e\\u306e\\u6a19\\u6e96\\u30a4\\u30f3\\u30dd\\u30fc\\u30c8\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc \\u307b\\u304b\\u306b golangci-lint (https://github.com/golangci/golangci-lint) \\u3068\\u3044\\u3046\\u3082\\u306e\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u3001\\u591a\\u304f\\u306e\\u4fbf\\u5229\\u306a\\u30ea\\u30f3\\u30bf\\u30fc\\u3084\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc\\u306e\\u4e0a\\u306b\\u30d5\\u30a1\\u30b5\\u30fc\\u30c9\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u30ea\\u30f3\\u30c6\\u30a3\\u30f3\\u30b0\\u30c4\\u30fc\\u30eb\\u3067\\u3059\\u3002\\u307e\\u305f\\u3001\\u30ea\\u30f3\\u30bf\\u30fc\\u3092\\u4e26\\u5217\\u5b9f\\u884c\\u3057\\u3066\\u5206\\u6790\\u901f\\u5ea6\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u3001\\u975e\\u5e38\\u306b\\u4fbf\\u5229\\u3067\\u3059\\u3002
\\u30ea\\u30f3\\u30bf\\u30fc\\u3068\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30bf\\u30fc\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u30d9\\u30fc\\u30b9\\u306e\\u54c1\\u8cea\\u3068\\u4e00\\u8cab\\u6027\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u5f37\\u529b\\u306a\\u65b9\\u6cd5\\u3067\\u3059\\u3002\\u6642\\u9593\\u3092\\u304b\\u3051\\u3066\\u3069\\u308c\\u3092\\u4f7f\\u7528\\u3059\\u3079\\u304d\\u304b\\u3092\\u7406\\u89e3\\u3057\\u3001\\u305d\\u308c\\u3089\\u306e\\u5b9f\\u884c\\uff08 CI \\u3084 Git \\u30d7\\u30ea\\u30b3\\u30df\\u30c3\\u30c8\\u30d5\\u30c3\\u30af\\u306a\\u3069\\uff09\\u3092\\u81ea\\u52d5\\u5316\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\"},{\"location\":\"ja/#_2\",\"title\":\"\\u30c7\\u30fc\\u30bf\\u578b\",\"text\":\"\"},{\"location\":\"ja/#8-17\",\"title\":\"8 \\u9032\\u6570\\u30ea\\u30c6\\u30e9\\u30eb\\u3067\\u6df7\\u4e71\\u3092\\u62db\\u3044\\u3066\\u3057\\u307e\\u3046 (#17)\",\"text\":\"\\u8981\\u7d04 \\u65e2\\u5b58\\u306e\\u30b3\\u30fc\\u30c9\\u3092\\u8aad\\u3080\\u3068\\u304d\\u306f\\u3001 0 \\u3067\\u59cb\\u307e\\u308b\\u6574\\u6570\\u30ea\\u30c6\\u30e9\\u30eb\\u304c 8 \\u9032\\u6570\\u3067\\u3042\\u308b\\u3053\\u3068\\u306b\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u307e\\u305f\\u3001\\u63a5\\u982d\\u8f9e 0o \\u3092\\u4ed8\\u3051\\u308b\\u3053\\u3068\\u30678\\u9032\\u6570\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u660e\\u78ba\\u306b\\u3057\\u3001\\u8aad\\u307f\\u3084\\u3059\\u3055\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u307e\\u3057\\u3087\\u3046\\u3002
8 \\u9032\\u6570\\u306f 0 \\u3067\\u59cb\\u307e\\u308a\\u307e\\u3059\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001010 \\u306f 10 \\u9032\\u6570\\u306e 8 \\u306b\\u76f8\\u5f53\\u3057\\u307e\\u3059\\uff09\\u3002\\u53ef\\u8aad\\u6027\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u3001\\u5c06\\u6765\\u306e\\u30b3\\u30fc\\u30c9\\u30ea\\u30fc\\u30c0\\u30fc\\u306e\\u6f5c\\u5728\\u7684\\u306a\\u9593\\u9055\\u3044\\u3092\\u56de\\u907f\\u3059\\u308b\\u306b\\u306f\\u3001 0o \\u63a5\\u982d\\u8f9e\\u3092\\u4f7f\\u7528\\u3057\\u3066 8 \\u9032\\u6570\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u660e\\u3089\\u304b\\u306b\\u3057\\u307e\\u3057\\u3087\\u3046\\uff08\\u4f8b: 0o10 \\uff09\\u3002
\\u4ed6\\u306e\\u6574\\u6570\\u30ea\\u30c6\\u30e9\\u30eb\\u8868\\u73fe\\u306b\\u3082\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30d0\\u30a4\\u30ca\\u30ea - \\u63a5\\u982d\\u8f9e 0b \\u3042\\u308b\\u3044\\u306f 0B \\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3059\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001 0b \\u306f 10 \\u9032\\u6570\\u306e 4 \\u306b\\u76f8\\u5f53\\u3057\\u307e\\u3059\\uff09 16\\u9032\\u6570 - \\u63a5\\u982d\\u8f9e 0x \\u3042\\u308b\\u3044\\u306f 0X \\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3059\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001 0xF \\u306f 10 \\u9032\\u6570\\u306e 15 \\u306b\\u76f8\\u5f53\\u3057\\u307e\\u3059\\uff09\\u3002 \\u865a\\u6570 - \\u63a5\\u5c3e\\u8f9e i \\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3059\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001 3i \\uff09 \\u8aad\\u307f\\u3084\\u3059\\u304f\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u533a\\u5207\\u308a\\u6587\\u5b57\\u3068\\u3057\\u3066\\u30a2\\u30f3\\u30c0\\u30fc\\u30b9\\u30b3\\u30a2\\uff08 _ \\uff09\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001 10 \\u5104\\u306f 1_000_000_000 \\u306e\\u3088\\u3046\\u306b\\u66f8\\u304f\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u30a2\\u30f3\\u30c0\\u30fc\\u30b9\\u30b3\\u30a2\\u306f 0b)00_00_01 \\u306e\\u3088\\u3046\\u306b\\u4ed6\\u306e\\u8868\\u73fe\\u3068\\u4f75\\u7528\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#18\",\"title\":\"\\u6574\\u6570\\u30aa\\u30fc\\u30d0\\u30fc\\u30d5\\u30ed\\u30fc\\u3092\\u7121\\u8996\\u3057\\u3066\\u3044\\u308b (#18)\",\"text\":\"\\u8981\\u7d04 Go\\u8a00\\u8a9e\\u3067\\u306f\\u6574\\u6570\\u306e\\u30aa\\u30fc\\u30d0\\u30fc\\u30d5\\u30ed\\u30fc\\u3068\\u30a2\\u30f3\\u30c0\\u30fc\\u30d5\\u30ed\\u30fc\\u304c\\u88cf\\u5074\\u3067\\u51e6\\u7406\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u305d\\u308c\\u3089\\u3092\\u30ad\\u30e3\\u30c3\\u30c1\\u3059\\u308b\\u72ec\\u81ea\\u306e\\u95a2\\u6570\\u3092\\u5b9f\\u88c5\\u3067\\u304d\\u307e\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u6642\\u306b\\u691c\\u51fa\\u3067\\u304d\\u308b\\u6574\\u6570\\u30aa\\u30fc\\u30d0\\u30fc\\u30d5\\u30ed\\u30fc\\u306b\\u3088\\u3063\\u3066\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u30a8\\u30e9\\u30fc\\u304c\\u751f\\u6210\\u3055\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
var counter int32 = math.MaxInt32 + 1\\nconstant 2147483648 overflows int32\\n\\u305f\\u3060\\u3057\\u3001\\u5b9f\\u884c\\u6642\\u306b\\u306f\\u3001\\u6574\\u6570\\u306e\\u30aa\\u30fc\\u30d0\\u30fc\\u30d5\\u30ed\\u30fc\\u307e\\u305f\\u306f\\u30a2\\u30f3\\u30c0\\u30fc\\u30d5\\u30ed\\u30fc\\u306f\\u767a\\u751f\\u3057\\u307e\\u305b\\u3093\\u3002\\u3053\\u308c\\u306b\\u3088\\u3063\\u3066\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u30d1\\u30cb\\u30c3\\u30af\\u304c\\u767a\\u751f\\u3059\\u308b\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u3053\\u306e\\u52d5\\u4f5c\\u306f\\u3084\\u3063\\u304b\\u3044\\u306a\\u30d0\\u30b0\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001\\u8ca0\\u306e\\u7d50\\u679c\\u306b\\u3064\\u306a\\u304c\\u308b\\u6574\\u6570\\u306e\\u5897\\u5206\\u3084\\u6b63\\u306e\\u6574\\u6570\\u306e\\u52a0\\u7b97\\u306a\\u3069\\uff09\\u306b\\u3064\\u306a\\u304c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u982d\\u306b\\u5165\\u308c\\u3066\\u304a\\u304f\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#19\",\"title\":\"\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#19)\",\"text\":\"\\u8981\\u7d04 \\u7279\\u5b9a\\u306e\\u30c7\\u30eb\\u30bf\\u5185\\u3067\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u6bd4\\u8f03\\u3092\\u884c\\u3046\\u3068\\u3001\\u30b3\\u30fc\\u30c9\\u306e\\u79fb\\u690d\\u6027\\u3092\\u78ba\\u4fdd\\u3067\\u304d\\u307e\\u3059\\u3002\\u52a0\\u7b97\\u307e\\u305f\\u306f\\u6e1b\\u7b97\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u7cbe\\u5ea6\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u305f\\u3081\\u306b\\u3001\\u540c\\u7a0b\\u5ea6\\u306e\\u5927\\u304d\\u3055\\u306e\\u6f14\\u7b97\\u3092\\u30b0\\u30eb\\u30fc\\u30d7\\u5316\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u307e\\u305f\\u3001\\u4e57\\u7b97\\u3068\\u9664\\u7b97\\u306f\\u52a0\\u7b97\\u3068\\u6e1b\\u7b97\\u306e\\u524d\\u306b\\u5b9f\\u884c\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
Go\\u8a00\\u8a9e\\u306b\\u306f\\u3001\\uff08\\u865a\\u6570\\u3092\\u9664\\u3044\\u305f\\u5834\\u5408\\uff09 float32 \\u3068 float64 \\u3068\\u3044\\u3046 2 \\u3064\\u306e\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u578b\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u306e\\u6982\\u5ff5\\u306f\\u3001\\u5c0f\\u6570\\u5024\\u3092\\u8868\\u73fe\\u3067\\u304d\\u306a\\u3044\\u3068\\u3044\\u3046\\u6574\\u6570\\u306e\\u5927\\u304d\\u306a\\u554f\\u984c\\u3092\\u89e3\\u6c7a\\u3059\\u308b\\u305f\\u3081\\u306b\\u767a\\u660e\\u3055\\u308c\\u307e\\u3057\\u305f\\u3002\\u4e88\\u60f3\\u5916\\u306e\\u4e8b\\u614b\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u6f14\\u7b97\\u306f\\u5b9f\\u969b\\u306e\\u6f14\\u7b97\\u306e\\u8fd1\\u4f3c\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u77e5\\u3063\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u305d\\u306e\\u305f\\u3081\\u306b\\u3001\\u4e57\\u7b97\\u306e\\u4f8b\\u3092\\u898b\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002
var n float32 = 1.0001\\nfmt.Println(n * n)\\n\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306b\\u304a\\u3044\\u3066\\u306f 1.0001 * 1.0001 = 1.00020001 \\u3068\\u3044\\u3046\\u7d50\\u679c\\u304c\\u51fa\\u529b\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u671f\\u5f85\\u3059\\u308b\\u3068\\u601d\\u3044\\u307e\\u3059\\u3002\\u3057\\u304b\\u3057\\u306a\\u304c\\u3089\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e x86 \\u30d7\\u30ed\\u30bb\\u30c3\\u30b5\\u3067\\u306f\\u3001\\u4ee3\\u308f\\u308a\\u306b 1.0002 \\u304c\\u51fa\\u529b\\u3055\\u308c\\u307e\\u3059\\u3002
Go\\u8a00\\u8a9e\\u306e float32 \\u304a\\u3088\\u3073 float64 \\u578b\\u306f\\u8fd1\\u4f3c\\u5024\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001\\u3044\\u304f\\u3064\\u304b\\u306e\\u30eb\\u30fc\\u30eb\\u3092\\u5ff5\\u982d\\u306b\\u7f6e\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
2 \\u3064\\u306e\\u6d6e\\u52d5\\u5c0f\\u6570\\u70b9\\u6570\\u3092\\u6bd4\\u8f03\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u305d\\u306e\\u5dee\\u304c\\u8a31\\u5bb9\\u7bc4\\u56f2\\u5185\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u78ba\\u8a8d\\u3059\\u308b\\u3002 \\u52a0\\u7b97\\u307e\\u305f\\u306f\\u6e1b\\u7b97\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u5834\\u5408\\u3001\\u7cbe\\u5ea6\\u3092\\u9ad8\\u3081\\u308b\\u305f\\u3081\\u306b\\u3001\\u540c\\u3058\\u6841\\u6570\\u306e\\u6f14\\u7b97\\u3092\\u30b0\\u30eb\\u30fc\\u30d7\\u5316\\u3059\\u308b\\u3002 \\u7cbe\\u5ea6\\u3092\\u9ad8\\u3081\\u308b\\u305f\\u3081\\u3001\\u4e00\\u9023\\u306e\\u6f14\\u7b97\\u3067\\u52a0\\u7b97\\u3001\\u6e1b\\u7b97\\u3001\\u4e57\\u7b97\\u3001\\u9664\\u7b97\\u304c\\u5fc5\\u8981\\u306a\\u5834\\u5408\\u306f\\u3001\\u4e57\\u7b97\\u3068\\u9664\\u7b97\\u3092\\u6700\\u521d\\u306b\\u5b9f\\u884c\\u3059\\u308b\\u3002 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#20\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u3068\\u5bb9\\u91cf\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#20)\",\"text\":\"\\u8981\\u7d04 Go \\u958b\\u767a\\u8005\\u306a\\u3089\\u3070\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u3068\\u5bb9\\u91cf\\u306e\\u9055\\u3044\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u306f\\u30b9\\u30e9\\u30a4\\u30b9\\u5185\\u306e\\u4f7f\\u7528\\u53ef\\u80fd\\u306a\\u8981\\u7d20\\u306e\\u6570\\u3067\\u3042\\u308a\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u5bb9\\u91cf\\u306f\\u30d0\\u30c3\\u30ad\\u30f3\\u30b0\\u914d\\u5217\\u5185\\u306e\\u8981\\u7d20\\u306e\\u6570\\u3067\\u3059\\u3002
\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#21\",\"title\":\"\\u975e\\u52b9\\u7387\\u306a\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u521d\\u671f\\u5316 (#21)\",\"text\":\"\\u8981\\u7d04 \\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3068\\u304d\\u3001\\u9577\\u3055\\u304c\\u3059\\u3067\\u306b\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u9577\\u3055\\u307e\\u305f\\u306f\\u5bb9\\u91cf\\u3067\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u521d\\u671f\\u5316\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u5272\\u308a\\u5f53\\u3066\\u306e\\u6570\\u304c\\u6e1b\\u308a\\u3001\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u304c\\u5411\\u4e0a\\u3057\\u307e\\u3059\\u3002
make \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u521d\\u671f\\u5316\\u3059\\u308b\\u3068\\u304d\\u306b\\u3001\\u9577\\u3055\\u3068\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u306e\\u5bb9\\u91cf\\u3092\\u6307\\u5b9a\\u3067\\u304d\\u307e\\u3059\\u3002\\u3053\\u308c\\u3089\\u306e\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306e\\u4e21\\u65b9\\u306b\\u9069\\u5207\\u306a\\u5024\\u3092\\u6e21\\u3059\\u3053\\u3068\\u304c\\u9069\\u5f53\\u3067\\u3042\\u308b\\u306b\\u3082\\u304b\\u304b\\u308f\\u3089\\u305a\\u3001\\u305d\\u308c\\u3092\\u5fd8\\u308c\\u308b\\u306e\\u306f\\u3088\\u304f\\u3042\\u308b\\u9593\\u9055\\u3044\\u3067\\u3059\\u3002\\u5b9f\\u969b\\u3001\\u8907\\u6570\\u306e\\u30b3\\u30d4\\u30fc\\u304c\\u5fc5\\u8981\\u306b\\u306a\\u308a\\u3001\\u4e00\\u6642\\u7684\\u306a\\u30d0\\u30c3\\u30ad\\u30f3\\u30b0\\u914d\\u5217\\u3092\\u30af\\u30ea\\u30fc\\u30f3\\u30a2\\u30c3\\u30d7\\u3059\\u308b\\u305f\\u3081\\u306b GC \\u306b\\u8ffd\\u52a0\\u306e\\u52b4\\u529b\\u304c\\u304b\\u304b\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u306e\\u89b3\\u70b9\\u304b\\u3089\\u8a00\\u3048\\u3070\\u3001Go \\u30e9\\u30f3\\u30bf\\u30a4\\u30e0\\u306b\\u624b\\u3092\\u5dee\\u3057\\u4f38\\u3079\\u306a\\u3044\\u7406\\u7531\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u5bb9\\u91cf\\u307e\\u305f\\u306f\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u9577\\u3055\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u5272\\u308a\\u5f53\\u3066\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002 \\u3053\\u308c\\u3089 2 \\u3064\\u306e\\u89e3\\u6c7a\\u7b56\\u306e\\u3046\\u3061\\u30012 \\u756a\\u76ee\\u306e\\u89e3\\u6c7a\\u7b56\\u306e\\u65b9\\u304c\\u308f\\u305a\\u304b\\u306b\\u9ad8\\u901f\\u3067\\u3042\\u308b\\u50be\\u5411\\u304c\\u3042\\u308b\\u3053\\u3068\\u304c\\u308f\\u304b\\u308a\\u307e\\u3057\\u305f\\u3002\\u305f\\u3060\\u3057\\u3001\\u7279\\u5b9a\\u306e\\u5bb9\\u91cf\\u3068\\u8ffd\\u52a0\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u5834\\u5408\\u306b\\u3088\\u3063\\u3066\\u306f\\u5b9f\\u88c5\\u3068\\u8aad\\u307f\\u53d6\\u308a\\u304c\\u5bb9\\u6613\\u306b\\u306a\\u308b\\u3053\\u3068\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#nil-22\",\"title\":\"nil \\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u6df7\\u540c\\u3057\\u3066\\u3044\\u308b (#22)\",\"text\":\"\\u8981\\u7d04 encoding/json \\u3084 reflect \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306a\\u3069\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u304d\\u306b\\u3088\\u304f\\u3042\\u308b\\u6df7\\u4e71\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u306f\\u3001nil \\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9055\\u3044\\u3092\\u7406\\u89e3\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3069\\u3061\\u3089\\u3082\\u9577\\u3055\\u30bc\\u30ed\\u3001\\u5bb9\\u91cf\\u30bc\\u30ed\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3067\\u3059\\u304c\\u3001\\u5272\\u308a\\u5f53\\u3066\\u3092\\u5fc5\\u8981\\u3068\\u3057\\u306a\\u3044\\u306e\\u306f nil \\u30b9\\u30e9\\u30a4\\u30b9\\u3060\\u3051\\u3067\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001nil \\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306f\\u533a\\u5225\\u3055\\u308c\\u307e\\u3059\\u3002nil \\u30b9\\u30e9\\u30a4\\u30b9\\u306f nil \\u306b\\u7b49\\u3057\\u3044\\u306e\\u306b\\u5bfe\\u3057\\u3001\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u306f\\u30bc\\u30ed\\u3067\\u3059\\u3002nil \\u30b9\\u30e9\\u30a4\\u30b9\\u306f\\u7a7a\\u3067\\u3059\\u304c\\u3001\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306f\\u5fc5\\u305a\\u3057\\u3082nil \\u3067\\u3042\\u308b\\u3068\\u306f\\u9650\\u308a\\u307e\\u305b\\u3093\\u3002\\u4e00\\u65b9\\u3001nil \\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u306f\\u5272\\u308a\\u5f53\\u3066\\u306f\\u5fc5\\u8981\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u4f53\\u3092\\u901a\\u3057\\u3066\\u3001\\u4ee5\\u4e0b\\u306e\\u65b9\\u6cd5\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u306b\\u3088\\u3063\\u3066\\u3001\\u72b6\\u6cc1\\u306b\\u5fdc\\u3058\\u3066\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u521d\\u671f\\u5316\\u3059\\u308b\\u3053\\u3068\\u3092\\u898b\\u3066\\u304d\\u307e\\u3057\\u305f\\u3002
\\u6700\\u7d42\\u7684\\u306a\\u9577\\u3055\\u304c\\u4e0d\\u660e\\u3067\\u30b9\\u30e9\\u30a4\\u30b9\\u304c\\u7a7a\\u306e\\u5834\\u5408\\u306f var s []string nil \\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u7cd6\\u8863\\u69cb\\u6587\\u3068\\u3057\\u3066\\u306e []string(nil) \\u5c06\\u6765\\u306e\\u9577\\u3055\\u304c\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f make([]string, length) \\u8981\\u7d20\\u306a\\u3057\\u3067\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u521d\\u671f\\u5316\\u3059\\u308b\\u5834\\u5408\\u3001\\u6700\\u5f8c\\u306e\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3 []string{} \\u306f\\u907f\\u3051\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u6700\\u5f8c\\u306b\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u3092\\u9632\\u3050\\u305f\\u3081\\u306b\\u3001\\u4f7f\\u7528\\u3059\\u308b\\u30e9\\u30a4\\u30d6\\u30e9\\u30ea\\u304c nil \\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u533a\\u5225\\u3057\\u3066\\u3044\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u78ba\\u8a8d\\u3057\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#23\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u304c\\u7a7a\\u304b\\u3069\\u3046\\u304b\\u3092\\u9069\\u5207\\u306b\\u78ba\\u8a8d\\u3057\\u306a\\u3044 (#23)\",\"text\":\"\\u8981\\u7d04 \\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u8981\\u7d20\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u306a\\u3044\\u3053\\u3068\\u3092\\u78ba\\u8a8d\\u3059\\u308b\\u306b\\u306f\\u3001\\u305d\\u306e\\u9577\\u3055\\u3092\\u78ba\\u8a8d\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u3053\\u308c\\u306f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u304c nil \\u3067\\u3042\\u308b\\u304b\\u7a7a\\u3067\\u3042\\u308b\\u304b\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\u6a5f\\u80fd\\u3057\\u307e\\u3059\\u3002\\u30de\\u30c3\\u30d7\\u306b\\u3064\\u3044\\u3066\\u3082\\u540c\\u69d8\\u3067\\u3059\\u3002\\u660e\\u78ba\\u306a API \\u3092\\u8a2d\\u8a08\\u3059\\u308b\\u306b\\u306f\\u3001nil \\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u533a\\u5225\\u3057\\u306a\\u3044\\u3067\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u8981\\u7d20\\u304c\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u5224\\u65ad\\u3059\\u308b\\u306b\\u306f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u304c nil \\u304b\\u3069\\u3046\\u304b\\u3001\\u307e\\u305f\\u306f\\u305d\\u306e\\u9577\\u3055\\u304c 0 \\u306b\\u7b49\\u3057\\u3044\\u304b\\u3069\\u3046\\u304b\\u3092\\u78ba\\u8a8d\\u3059\\u308b\\u3053\\u3068\\u3067\\u5224\\u65ad\\u3067\\u304d\\u307e\\u3059\\u3002\\u30b9\\u30e9\\u30a4\\u30b9\\u304c\\u7a7a\\u3067\\u3042\\u308b\\u5834\\u5408\\u3068\\u30b9\\u30e9\\u30a4\\u30b9\\u304c nil \\u3067\\u3042\\u308b\\u5834\\u5408\\u306e\\u4e21\\u65b9\\u3092\\u30ab\\u30d0\\u30fc\\u3067\\u304d\\u308b\\u305f\\u3081\\u3001\\u9577\\u3055\\u3092\\u78ba\\u304b\\u3081\\u308b\\u3053\\u3068\\u304c\\u6700\\u826f\\u306e\\u65b9\\u6cd5\\u3067\\u3059\\u3002
\\u4e00\\u65b9\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u8a2d\\u8a08\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u8efd\\u5fae\\u306a\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u30a8\\u30e9\\u30fc\\u3092\\u8d77\\u3053\\u3055\\u306a\\u3044\\u3088\\u3046 nil \\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u533a\\u5225\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u8fd4\\u3059\\u3068\\u304d\\u306b\\u3001nil \\u307e\\u305f\\u306f\\u7a7a\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u8fd4\\u3059\\u304b\\u3069\\u3046\\u304b\\u306f\\u3001\\u610f\\u5473\\u7684\\u306b\\u3082\\u6280\\u8853\\u7684\\u306b\\u3082\\u9055\\u3044\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u30b3\\u30fc\\u30e9\\u30fc\\u306b\\u3068\\u3063\\u3066\\u306f\\u3069\\u3061\\u3089\\u3082\\u540c\\u3058\\u3053\\u3068\\u3092\\u610f\\u5473\\u3059\\u308b\\u306f\\u305a\\u3067\\u3059\\u3002\\u3053\\u306e\\u539f\\u7406\\u306f\\u30de\\u30c3\\u30d7\\u3067\\u3082\\u540c\\u3058\\u3067\\u3059\\u3002\\u30de\\u30c3\\u30d7\\u304c\\u7a7a\\u304b\\u3069\\u3046\\u304b\\u3092\\u78ba\\u8a8d\\u3059\\u308b\\u306b\\u306f\\u3001\\u305d\\u308c\\u304c nil \\u304b\\u3069\\u3046\\u304b\\u3067\\u306f\\u306a\\u304f\\u3001\\u305d\\u306e\\u9577\\u3055\\u3092\\u78ba\\u8a8d\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#24\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u30b3\\u30d4\\u30fc\\u3092\\u6b63\\u3057\\u304f\\u4f5c\\u6210\\u3057\\u3066\\u3044\\u306a\\u3044 (#24)\",\"text\":\"\\u8981\\u7d04 \\u7d44\\u307f\\u8fbc\\u307f\\u95a2\\u6570 copy \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3042\\u308b\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u5225\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u30b3\\u30d4\\u30fc\\u3059\\u308b\\u306b\\u306f\\u3001\\u30b3\\u30d4\\u30fc\\u3055\\u308c\\u308b\\u8981\\u7d20\\u306e\\u6570\\u304c 2 \\u3064\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u306e\\u9593\\u306e\\u6700\\u5c0f\\u5024\\u306b\\u76f8\\u5f53\\u3059\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u8981\\u7d20\\u3092\\u3042\\u308b\\u30b9\\u30e9\\u30a4\\u30b9\\u304b\\u3089\\u5225\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u30b3\\u30d4\\u30fc\\u3059\\u308b\\u64cd\\u4f5c\\u306f\\u3001\\u304b\\u306a\\u308a\\u983b\\u7e41\\u306b\\u884c\\u308f\\u308c\\u307e\\u3059\\u3002\\u30b3\\u30d4\\u30fc\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u30b3\\u30d4\\u30fc\\u5148\\u306b\\u30b3\\u30d4\\u30fc\\u3055\\u308c\\u308b\\u8981\\u7d20\\u306e\\u6570\\u306f 2 \\u3064\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u306e\\u9593\\u306e\\u6700\\u5c0f\\u5024\\u306b\\u76f8\\u5f53\\u3059\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u30b3\\u30d4\\u30fc\\u3059\\u308b\\u305f\\u3081\\u306e\\u4ed6\\u306e\\u4ee3\\u66ff\\u624b\\u6bb5\\u304c\\u5b58\\u5728\\u3059\\u308b\\u3053\\u3068\\u306b\\u3082\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u305d\\u306e\\u305f\\u3081\\u3001\\u30b3\\u30fc\\u30c9\\u30d9\\u30fc\\u30b9\\u3067\\u305d\\u308c\\u3089\\u3092\\u898b\\u3064\\u3051\\u3066\\u3082\\u9a5a\\u304f\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#append-25\",\"title\":\"append \\u306e\\u4f7f\\u7528\\u306b\\u3088\\u308b\\u4e88\\u60f3\\u5916\\u306e\\u526f\\u4f5c\\u7528 (#25)\",\"text\":\"\\u8981\\u7d04 2\\u3064\\u306e\\u7570\\u306a\\u308b\\u95a2\\u6570\\u304c\\u540c\\u3058\\u914d\\u5217\\u306b\\u57fa\\u3065\\u304f\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u306b\\u3001copy \\u307e\\u305f\\u306f\\u5b8c\\u5168\\u30b9\\u30e9\\u30a4\\u30b9\\u5f0f\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067 append \\u306b\\u3088\\u308b\\u885d\\u7a81\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u5927\\u304d\\u306a\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u7e2e\\u5c0f\\u3059\\u308b\\u5834\\u5408\\u3001\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u308b\\u306e\\u306f\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u30b3\\u30d4\\u30fc\\u3060\\u3051\\u3067\\u3059\\u3002
\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u526f\\u4f5c\\u7528\\u306b\\u3064\\u306a\\u304c\\u308b\\u72b6\\u6cc1\\u306b\\u76f4\\u9762\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u7d50\\u679c\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u9577\\u3055\\u304c\\u305d\\u306e\\u5bb9\\u91cf\\u3088\\u308a\\u5c0f\\u3055\\u3044\\u5834\\u5408\\u3001\\u8ffd\\u52a0\\u306b\\u3088\\u3063\\u3066\\u5143\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u304c\\u5909\\u66f4\\u3055\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u8d77\\u3053\\u308a\\u5f97\\u308b\\u526f\\u4f5c\\u7528\\u306e\\u7bc4\\u56f2\\u3092\\u5236\\u9650\\u3057\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u30b3\\u30d4\\u30fc\\u307e\\u305f\\u306f\\u5b8c\\u5168\\u30b9\\u30e9\\u30a4\\u30b9\\u5f0f\\u3092\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u30b3\\u30d4\\u30fc\\u3092\\u5b9f\\u884c\\u3067\\u304d\\u306a\\u304f\\u306a\\u308a\\u307e\\u3059\\u3002
\\u88dc\\u8db3 s[low:high:max]\\uff08\\u5b8c\\u5168\\u30b9\\u30e9\\u30a4\\u30b9\\u5f0f\\uff09\\u2015\\u2015\\u3053\\u306e\\u547d\\u4ee4\\u6587\\u306f\\u3001\\u5bb9\\u91cf\\u304c max - low \\u306b\\u7b49\\u3057\\u3044\\u3053\\u3068\\u3092\\u9664\\u3051\\u3070\\u3001s[low:high] \\u3067\\u4f5c\\u6210\\u3055\\u308c\\u305f\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u540c\\u69d8\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4f5c\\u6210\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#26\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af (#26)\",\"text\":\"\\u8981\\u7d04 \\u30dd\\u30a4\\u30f3\\u30bf\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u307e\\u305f\\u306f\\u30dd\\u30a4\\u30f3\\u30bf\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u6301\\u3064\\u69cb\\u9020\\u4f53\\u3092\\u64cd\\u4f5c\\u3059\\u308b\\u5834\\u5408\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u64cd\\u4f5c\\u306b\\u3088\\u3063\\u3066\\u9664\\u5916\\u3055\\u308c\\u305f\\u8981\\u7d20\\u3092 nil \\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af\\u3092\\u56de\\u907f\\u3067\\u304d\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#_3\",\"title\":\"\\u5bb9\\u91cf\\u6f0f\\u308c\",\"text\":\"\\u5927\\u304d\\u306a\\u30b9\\u30e9\\u30a4\\u30b9\\u307e\\u305f\\u306f\\u914d\\u5217\\u3092\\u30b9\\u30e9\\u30a4\\u30b9\\u3059\\u308b\\u3068\\u3001\\u30e1\\u30e2\\u30ea\\u6d88\\u8cbb\\u304c\\u9ad8\\u304f\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u6b8b\\u308a\\u306e\\u30b9\\u30da\\u30fc\\u30b9\\u306f GC \\u306b\\u3088\\u3063\\u3066\\u518d\\u5229\\u7528\\u3055\\u308c\\u305a\\u3001\\u5c11\\u6570\\u306e\\u8981\\u7d20\\u3057\\u304b\\u4f7f\\u7528\\u3057\\u306a\\u3044\\u306b\\u3082\\u304b\\u304b\\u308f\\u3089\\u305a\\u3001\\u5927\\u304d\\u306a\\u30d0\\u30c3\\u30ad\\u30f3\\u30b0\\u914d\\u5217\\u304c\\u4fdd\\u6301\\u3055\\u308c\\u307e\\u3059\\u3002\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u30b3\\u30d4\\u30fc\\u3092\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u3053\\u306e\\u3088\\u3046\\u306a\\u4e8b\\u614b\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_4\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30dd\\u30a4\\u30f3\\u30bf\",\"text\":\"\\u30dd\\u30a4\\u30f3\\u30bf\\u307e\\u305f\\u306f\\u30dd\\u30a4\\u30f3\\u30bf\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u542b\\u3080\\u69cb\\u9020\\u4f53\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30b9\\u30e9\\u30a4\\u30b9\\u64cd\\u4f5c\\u3092\\u3059\\u308b\\u5834\\u5408\\u3001GC \\u304c\\u3053\\u308c\\u3089\\u306e\\u8981\\u7d20\\u3092\\u518d\\u5229\\u7528\\u3057\\u306a\\u3044\\u3053\\u3068\\u3092\\u77e5\\u3063\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u306e\\u5834\\u5408\\u306e\\u9078\\u629e\\u80a2\\u306f\\u3001\\u30b3\\u30d4\\u30fc\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u304b\\u3001\\u6b8b\\u308a\\u306e\\u8981\\u7d20\\u307e\\u305f\\u306f\\u305d\\u306e\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u660e\\u793a\\u7684\\u306b nil \\u3068\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#27\",\"title\":\"\\u975e\\u52b9\\u7387\\u306a\\u30de\\u30c3\\u30d7\\u306e\\u521d\\u671f\\u5316 (#27)\",\"text\":\"\\u8981\\u7d04 \\u30de\\u30c3\\u30d7\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3068\\u304d\\u3001\\u305d\\u306e\\u9577\\u3055\\u304c\\u3059\\u3067\\u306b\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u9577\\u3055\\u3067\\u521d\\u671f\\u5316\\u3057\\u307e\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u5272\\u308a\\u5f53\\u3066\\u306e\\u6570\\u304c\\u6e1b\\u308a\\u3001\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u304c\\u5411\\u4e0a\\u3057\\u307e\\u3059\\u3002
\\u30de\\u30c3\\u30d7\\u306f\\u3001\\u30ad\\u30fc\\u30fb\\u5024\\u30da\\u30a2\\u306e\\u9806\\u5e8f\\u306a\\u3057\\u30b3\\u30ec\\u30af\\u30b7\\u30e7\\u30f3\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002\\u306a\\u304a\\u3001\\u305d\\u308c\\u305e\\u308c\\u306e\\u30da\\u30a2\\u306f\\u56fa\\u6709\\u306e\\u30ad\\u30fc\\u3092\\u6301\\u3061\\u307e\\u3059\\u3002Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u30de\\u30c3\\u30d7\\u306f\\u30cf\\u30c3\\u30b7\\u30e5\\u30c6\\u30fc\\u30d6\\u30eb\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u306b\\u57fa\\u3065\\u3044\\u3066\\u3044\\u307e\\u3059\\u3002\\u5185\\u90e8\\u7684\\u306b\\u306f\\u3001\\u30cf\\u30c3\\u30b7\\u30e5\\u30c6\\u30fc\\u30d6\\u30eb\\u306f\\u30d0\\u30b1\\u30c3\\u30c8\\u306e\\u914d\\u5217\\u3067\\u3042\\u308a\\u3001\\u5404\\u30d0\\u30b1\\u30c3\\u30c8\\u306f\\u30ad\\u30fc\\u30fb\\u5024\\u30da\\u30a2\\u306e\\u914d\\u5217\\u3078\\u306e\\u30dd\\u30a4\\u30f3\\u30bf\\u3067\\u3059\\u3002
\\u30de\\u30c3\\u30d7\\u306b\\u542b\\u307e\\u308c\\u308b\\u8981\\u7d20\\u306e\\u6570\\u304c\\u4e8b\\u524d\\u306b\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u305d\\u306e\\u521d\\u671f\\u30b5\\u30a4\\u30ba\\u3092\\u6307\\u5b9a\\u3057\\u3066\\u4f5c\\u6210\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30de\\u30c3\\u30d7\\u306e\\u5897\\u5927\\u306f\\u3001\\u5341\\u5206\\u306a\\u30b9\\u30da\\u30fc\\u30b9\\u3092\\u518d\\u5272\\u308a\\u5f53\\u3066\\u3057\\u3001\\u3059\\u3079\\u3066\\u306e\\u8981\\u7d20\\u306e\\u30d0\\u30e9\\u30f3\\u30b9\\u3092\\u518d\\u8abf\\u6574\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u8a08\\u7b97\\u91cf\\u304c\\u975e\\u5e38\\u306b\\u591a\\u304f\\u306a\\u308a\\u307e\\u3059\\u304c\\u3001\\u3053\\u308c\\u306b\\u3088\\u308a\\u305d\\u308c\\u3092\\u56de\\u907f\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#28\",\"title\":\"\\u30de\\u30c3\\u30d7\\u3068\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af (#28)\",\"text\":\"\\u8981\\u7d04 \\u30de\\u30c3\\u30d7\\u306f\\u30e1\\u30e2\\u30ea\\u5185\\u3067\\u5e38\\u306b\\u5897\\u5927\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u304c\\u3001\\u7e2e\\u5c0f\\u3059\\u308b\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u30e1\\u30e2\\u30ea\\u306e\\u554f\\u984c\\u304c\\u767a\\u751f\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u30de\\u30c3\\u30d7\\u3092\\u5f37\\u5236\\u7684\\u306b\\u518d\\u751f\\u6210\\u3057\\u305f\\u308a\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u308a\\u3059\\u308b\\u306a\\u3069\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u624b\\u6bb5\\u3092\\u8a66\\u3059\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#29\",\"title\":\"\\u8aa4\\u3063\\u305f\\u65b9\\u6cd5\\u306b\\u3088\\u308b\\u5024\\u306e\\u6bd4\\u8f03 (#29)\",\"text\":\"\\u8981\\u7d04 Go\\u8a00\\u8a9e\\u3067\\u578b\\u3092\\u6bd4\\u8f03\\u3059\\u200b\\u200b\\u308b\\u306b\\u306f\\u30012 \\u3064\\u306e\\u578b\\u304c\\u6bd4\\u8f03\\u53ef\\u80fd\\u306a\\u3089\\u3070\\u3001== \\u6f14\\u7b97\\u5b50\\u3068 != \\u6f14\\u7b97\\u5b50\\u3092\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002\\u771f\\u507d\\u5024\\u3001\\u6570\\u5024\\u3001\\u6587\\u5b57\\u5217\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u3001\\u304a\\u3088\\u3073\\u69cb\\u9020\\u4f53\\u304c\\u5b8c\\u5168\\u306b\\u6bd4\\u8f03\\u53ef\\u80fd\\u306a\\u578b\\u3067\\u69cb\\u6210\\u3055\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306f\\u3001 reflect.DeepEqual \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30ea\\u30d5\\u30ec\\u30af\\u30b7\\u30e7\\u30f3\\u306e\\u4ee3\\u511f\\u3092\\u652f\\u6255\\u3046\\u304b\\u3001\\u72ec\\u81ea\\u306e\\u5b9f\\u88c5\\u3068\\u30e9\\u30a4\\u30d6\\u30e9\\u30ea\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u52b9\\u679c\\u7684\\u306b\\u6bd4\\u8f03\\u3059\\u308b\\u306b\\u306f\\u3001 == \\u3068 != \\u306e\\u4f7f\\u7528\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u4e0d\\u53ef\\u6b20\\u3067\\u3059\\u3002\\u3053\\u308c\\u3089\\u306e\\u6f14\\u7b97\\u5b50\\u306f\\u3001\\u6bd4\\u8f03\\u53ef\\u80fd\\u306a\\u88ab\\u6f14\\u7b97\\u5b50\\u3067\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002
\\u771f\\u507d\\u5024 - 2 \\u3064\\u306e\\u771f\\u507d\\u5024\\u304c\\u7b49\\u3057\\u3044\\u304b\\u3069\\u3046\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u6570\\u5024 (int\\u3001float\\u3001\\u304a\\u3088\\u3073 complex \\u578b) - 2 \\u3064\\u306e\\u6570\\u5024\\u304c\\u7b49\\u3057\\u3044\\u304b\\u3069\\u3046\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u6587\\u5b57\\u5217 - 2 \\u3064\\u306e\\u6587\\u5b57\\u5217\\u304c\\u7b49\\u3057\\u3044\\u304b\\u3069\\u3046\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u30c1\\u30e3\\u30cd\\u30eb - 2 \\u3064\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u304c\\u540c\\u3058 make \\u547c\\u3073\\u51fa\\u3057\\u306b\\u3088\\u3063\\u3066\\u4f5c\\u6210\\u3055\\u308c\\u305f\\u304b\\u3001\\u307e\\u305f\\u306f\\u4e21\\u65b9\\u304c nil \\u3067\\u3042\\u308b\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9 - 2 \\u3064\\u306e\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u304c\\u540c\\u3058\\u52d5\\u7684\\u30bf\\u30a4\\u30d7\\u3068\\u7b49\\u3057\\u3044\\u52d5\\u7684\\u5024\\u3092\\u6301\\u3064\\u304b\\u3069\\u3046\\u304b\\u3001\\u307e\\u305f\\u306f\\u4e21\\u65b9\\u304c nil \\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u30dd\\u30a4\\u30f3\\u30bf - 2 \\u3064\\u306e\\u30dd\\u30a4\\u30f3\\u30bf\\u304c\\u30e1\\u30e2\\u30ea\\u5185\\u306e\\u540c\\u3058\\u5024\\u3092\\u6307\\u3057\\u3066\\u3044\\u308b\\u304b\\u3001\\u307e\\u305f\\u306f\\u4e21\\u65b9\\u3068\\u3082 nil \\u3067\\u3042\\u308b\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u69cb\\u9020\\u4f53\\u3068\\u914d\\u5217 - \\u985e\\u4f3c\\u3057\\u305f\\u578b\\u3067\\u69cb\\u6210\\u3055\\u308c\\u3066\\u3044\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u6bd4\\u8f03\\u3057\\u307e\\u3059\\u3002 \\u88dc\\u8db3 ? \\u3001 >= \\u3001 < \\u3001\\u304a\\u3088\\u3073 > \\u6f14\\u7b97\\u5b50\\u3092\\u6570\\u5024\\u578b\\u3067\\u4f7f\\u7528\\u3057\\u3066\\u5024\\u3092\\u6bd4\\u8f03\\u3057\\u305f\\u308a\\u3001\\u6587\\u5b57\\u5217\\u3067\\u5b57\\u53e5\\u9806\\u5e8f\\u3092\\u6bd4\\u8f03\\u3057\\u305f\\u308a\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002
\\u88ab\\u6f14\\u7b97\\u5b50\\u304c\\u6bd4\\u8f03\\u3067\\u304d\\u306a\\u3044\\u5834\\u5408\\uff08\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30de\\u30c3\\u30d7\\u306a\\u3069\\uff09\\u3001\\u30ea\\u30d5\\u30ec\\u30af\\u30b7\\u30e7\\u30f3\\u306a\\u3069\\u306e\\u4ed6\\u306e\\u65b9\\u6cd5\\u3092\\u5229\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30ea\\u30d5\\u30ec\\u30af\\u30b7\\u30e7\\u30f3\\u306f\\u30e1\\u30bf\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u306e\\u4e00\\u7a2e\\u3067\\u3042\\u308a\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u305d\\u306e\\u69cb\\u9020\\u3068\\u52d5\\u4f5c\\u3092\\u5185\\u7701\\u3057\\u3066\\u5909\\u66f4\\u3059\\u308b\\u6a5f\\u80fd\\u3092\\u6307\\u3057\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001Go\\u8a00\\u8a9e\\u3067\\u306f reflect.DeepEqual \\u3092\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002\\u3053\\u306e\\u95a2\\u6570\\u306f\\u30012\\u3064\\u306e\\u5024\\u3092\\u518d\\u5e30\\u7684\\u306b\\u8abf\\u3079\\u308b\\u3053\\u3068\\u306b\\u3088\\u3063\\u3066\\u30012\\u3064\\u306e\\u8981\\u7d20\\u304c\\u5b8c\\u5168\\u306b\\u7b49\\u3057\\u3044\\u304b\\u3069\\u3046\\u304b\\u3092\\u5831\\u544a\\u3057\\u307e\\u3059\\u3002\\u53d7\\u3051\\u5165\\u308c\\u3089\\u308c\\u308b\\u8981\\u7d20\\u306f\\u3001\\u57fa\\u672c\\u578b\\u306b\\u52a0\\u3048\\u3066\\u3001\\u914d\\u5217\\u3001\\u69cb\\u9020\\u4f53\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u3001\\u30de\\u30c3\\u30d7\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u3001\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3001\\u95a2\\u6570\\u3067\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001\\u6700\\u5927\\u306e\\u843d\\u3068\\u3057\\u7a74\\u306f\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u4e0a\\u306e\\u30da\\u30ca\\u30eb\\u30c6\\u30a3\\u3067\\u3059\\u3002
\\u5b9f\\u884c\\u6642\\u306e\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u304c\\u91cd\\u8981\\u306a\\u5834\\u5408\\u306f\\u3001\\u72ec\\u81ea\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u5b9f\\u88c5\\u3059\\u308b\\u3053\\u3068\\u304c\\u6700\\u5584\\u3068\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u8ffd\\u8a18\\uff1a\\u6a19\\u6e96\\u30e9\\u30a4\\u30d6\\u30e9\\u30ea\\u306b\\u306f\\u65e2\\u306b\\u6bd4\\u8f03\\u30e1\\u30bd\\u30c3\\u30c9\\u304c\\u3044\\u304f\\u3064\\u304b\\u3042\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u6700\\u9069\\u5316\\u3055\\u308c\\u305f bytes.Compare \\u95a2\\u6570\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30012\\u3064\\u306e\\u30d0\\u30a4\\u30c8\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u6bd4\\u8f03\\u3067\\u304d\\u307e\\u3059\\u3002\\u72ec\\u81ea\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u5b9f\\u88c5\\u3059\\u308b\\u524d\\u306b\\u3001\\u8eca\\u8f2a\\u306e\\u518d\\u767a\\u660e\\u3092\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_5\",\"title\":\"\\u5236\\u5fa1\\u69cb\\u9020\",\"text\":\"\"},{\"location\":\"ja/#range-30\",\"title\":\"\\u8981\\u7d20\\u304c range \\u30eb\\u30fc\\u30d7\\u5185\\u3067\\u30b3\\u30d4\\u30fc\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u77e5\\u3089\\u306a\\u3044 (#30)\",\"text\":\"\\u8981\\u7d04 range \\u30eb\\u30fc\\u30d7\\u5185\\u306e value \\u8981\\u7d20\\u306f\\u30b3\\u30d4\\u30fc\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u305f\\u3068\\u3048\\u3070\\u69cb\\u9020\\u4f53\\u3092\\u5909\\u66f4\\u3059\\u308b\\u306b\\u306f\\u3001\\u305d\\u306e\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092\\u4ecb\\u3057\\u3066\\u30a2\\u30af\\u30bb\\u30b9\\u3059\\u308b\\u304b\\u3001\\u5f93\\u6765\\u306e for \\u30eb\\u30fc\\u30d7\\u3092\\u4ecb\\u3057\\u3066\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u307e\\u3057\\u3087\\u3046\\uff08\\u5909\\u66f4\\u3059\\u308b\\u8981\\u7d20\\u307e\\u305f\\u306f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u304c\\u30dd\\u30a4\\u30f3\\u30bf\\u3067\\u3042\\u308b\\u5834\\u5408\\u3092\\u9664\\u304f\\uff09\\u3002
range \\u30eb\\u30fc\\u30d7\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u306b\\u53cd\\u5fa9\\u51e6\\u7406\\u3092\\u884c\\u3046\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u6587\\u5b57\\u5217 \\u914d\\u5217 \\u914d\\u5217\\u3078\\u306e\\u30dd\\u30a4\\u30f3\\u30bf \\u30b9\\u30e9\\u30a4\\u30b9 \\u30de\\u30c3\\u30d7 \\u53d7\\u4fe1\\u30c1\\u30e3\\u30cd\\u30eb \\u53e4\\u5178\\u7684\\u306a for \\u30eb\\u30fc\\u30d7\\u3068\\u6bd4\\u8f03\\u3059\\u308b\\u3068\\u3001range \\u30eb\\u30fc\\u30d7\\u306f\\u305d\\u306e\\u7c21\\u6f54\\u306a\\u69cb\\u6587\\u306e\\u304a\\u304b\\u3052\\u3067\\u3001\\u3053\\u308c\\u3089\\u306e\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u306e\\u3059\\u3079\\u3066\\u306e\\u8981\\u7d20\\u306b\\u53cd\\u5fa9\\u51e6\\u7406\\u3092\\u3059\\u308b\\u306e\\u306b\\u4fbf\\u5229\\u3067\\u3059\\u3002
\\u305f\\u3060\\u3057\\u3001range \\u30eb\\u30fc\\u30d7\\u5185\\u306e\\u5024\\u8981\\u7d20\\u306f\\u30b3\\u30d4\\u30fc\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u5024\\u3092\\u5909\\u66f4\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u69cb\\u9020\\u4f53\\u306e\\u5834\\u5408\\u3001\\u5909\\u66f4\\u3059\\u308b\\u5024\\u307e\\u305f\\u306f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u304c\\u30dd\\u30a4\\u30f3\\u30bf\\u3067\\u306a\\u3044\\u9650\\u308a\\u3001\\u8981\\u7d20\\u81ea\\u4f53\\u3067\\u306f\\u306a\\u304f\\u30b3\\u30d4\\u30fc\\u306e\\u307f\\u3092\\u66f4\\u65b0\\u3057\\u307e\\u3059\\u3002range \\u30eb\\u30fc\\u30d7\\u307e\\u305f\\u306f\\u5f93\\u6765\\u306e for \\u30eb\\u30fc\\u30d7\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u7d4c\\u7531\\u3067\\u8981\\u7d20\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3059\\u308b\\u3053\\u3068\\u304c\\u63a8\\u5968\\u3055\\u308c\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#range-31\",\"title\":\"range \\u30eb\\u30fc\\u30d7\\uff08\\u30c1\\u30e3\\u30cd\\u30eb\\u3068\\u914d\\u5217\\uff09\\u3067\\u306e\\u5f15\\u6570\\u306e\\u8a55\\u4fa1\\u65b9\\u6cd5\\u3092\\u77e5\\u3089\\u306a\\u3044 (#31)\",\"text\":\"\\u8981\\u7d04 range \\u6f14\\u7b97\\u5b50\\u306b\\u6e21\\u3055\\u308c\\u308b\\u5f0f\\u306f\\u30eb\\u30fc\\u30d7\\u306e\\u958b\\u59cb\\u524d\\u306b 1 \\u56de\\u3060\\u3051\\u8a55\\u4fa1\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3068\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u307e\\u305f\\u306f\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u53cd\\u5fa9\\u51e6\\u7406\\u306b\\u304a\\u3051\\u308b\\u975e\\u52b9\\u7387\\u306a\\u5272\\u308a\\u5f53\\u3066\\u306a\\u3069\\u306e\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u3092\\u56de\\u907f\\u3067\\u304d\\u307e\\u3059\\u3002
range \\u30eb\\u30fc\\u30d7\\u306f\\u3001\\uff08\\u30bf\\u30a4\\u30d7\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\uff09\\u30b3\\u30d4\\u30fc\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u3053\\u3068\\u306b\\u3088\\u308a\\u3001\\u30eb\\u30fc\\u30d7\\u306e\\u958b\\u59cb\\u524d\\u306b\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u5f0f\\u3092 1 \\u56de\\u3060\\u3051\\u8a55\\u4fa1\\u3057\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u8aa4\\u3063\\u305f\\u8981\\u7d20\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u3066\\u3057\\u307e\\u3046\\u3001\\u3068\\u3044\\u3046\\u3088\\u3046\\u306a\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u3053\\u306e\\u52d5\\u4f5c\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070
a := [3]int{0, 1, 2}\\nfor i, v := range a {\\n a[2] = 10\\n if i == 2 {\\n fmt.Println(v)\\n }\\n}\\n\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f\\u3001\\u6700\\u5f8c\\u306e\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092 10 \\u306b\\u66f4\\u65b0\\u3057\\u307e\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u3068\\u300110 \\u306f\\u51fa\\u529b\\u3055\\u308c\\u307e\\u305b\\u3093\\u3002 2 \\u304c\\u51fa\\u529b\\u3055\\u308c\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#range-32\",\"title\":\"range \\u30eb\\u30fc\\u30d7\\u5185\\u306b\\u304a\\u3051\\u308b\\u30dd\\u30a4\\u30f3\\u30bf\\u8981\\u7d20\\u306e\\u4f7f\\u7528\\u304c\\u53ca\\u307c\\u3059\\u5f71\\u97ff\\u3092\\u5206\\u304b\\u3063\\u3066\\u3044\\u306a\\u3044 (#32)\",\"text\":\"\\u8981\\u7d04 \\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u304b\\u3001\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u8981\\u7d20\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3059\\u308b\\u3068\\u3001\\u30eb\\u30fc\\u30d7\\u5185\\u3067\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u30b3\\u30d4\\u30fc\\u3059\\u308b\\u969b\\u306e\\u9593\\u9055\\u3044\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
range \\u30eb\\u30fc\\u30d7\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u306b\\u53cd\\u5fa9\\u51e6\\u7406\\u3092\\u65bd\\u3059\\u5834\\u5408\\u3001\\u3059\\u3079\\u3066\\u306e\\u5024\\u304c\\u5358\\u4e00\\u306e\\u4e00\\u610f\\u306e\\u30a2\\u30c9\\u30ec\\u30b9\\u3092\\u6301\\u3064\\u4e00\\u610f\\u306e\\u5909\\u6570\\u306b\\u5272\\u308a\\u5f53\\u3066\\u3089\\u308c\\u308b\\u3053\\u3068\\u3092\\u601d\\u3044\\u51fa\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u3086\\u3048\\u306b\\u3001\\u5404\\u53cd\\u5fa9\\u51e6\\u7406\\u4e2d\\u306b\\u3053\\u306e\\u5909\\u6570\\u3092\\u53c2\\u7167\\u3059\\u308b\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u4fdd\\u5b58\\u3059\\u308b\\u3068\\u3001\\u540c\\u3058\\u8981\\u7d20\\u3001\\u3064\\u307e\\u308a\\u6700\\u65b0\\u306e\\u8981\\u7d20\\u3092\\u53c2\\u7167\\u3059\\u308b\\u540c\\u3058\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u4fdd\\u5b58\\u3059\\u308b\\u3053\\u3068\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u3053\\u306e\\u554f\\u984c\\u306f\\u3001\\u30eb\\u30fc\\u30d7\\u306e\\u30b9\\u30b3\\u30fc\\u30d7\\u5185\\u306b\\u30ed\\u30fc\\u30ab\\u30eb\\u5909\\u6570\\u3092\\u5f37\\u5236\\u7684\\u306b\\u4f5c\\u6210\\u3059\\u308b\\u304b\\u3001\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092\\u4ecb\\u3057\\u3066\\u30b9\\u30e9\\u30a4\\u30b9\\u8981\\u7d20\\u3092\\u53c2\\u7167\\u3059\\u308b\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3053\\u3068\\u3067\\u89e3\\u6c7a\\u3067\\u304d\\u307e\\u3059\\u3002\\u3069\\u3061\\u3089\\u306e\\u89e3\\u6c7a\\u7b56\\u3067\\u3082\\u554f\\u984c\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#33\",\"title\":\"\\u30de\\u30c3\\u30d7\\u306e\\u53cd\\u5fa9\\u51e6\\u7406\\u4e2d\\u306b\\u8aa4\\u3063\\u305f\\u4eee\\u5b9a\\u3092\\u3059\\u308b\\uff08\\u53cd\\u5fa9\\u51e6\\u7406\\u4e2d\\u306e\\u9806\\u5e8f\\u4ed8\\u3051\\u3068\\u30de\\u30c3\\u30d7\\u306e\\u633f\\u5165\\uff09 (#33)\",\"text\":\"\\u8981\\u7d04 \\u30de\\u30c3\\u30d7\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u304d\\u306b\\u4e88\\u6e2c\\u53ef\\u80fd\\u306a\\u51fa\\u529b\\u3092\\u4fdd\\u8a3c\\u3059\\u308b\\u306b\\u306f\\u3001\\u30de\\u30c3\\u30d7\\u306e\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u304c\\u6b21\\u306e\\u3068\\u304a\\u308a\\u3067\\u3042\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30c7\\u30fc\\u30bf\\u3092\\u30ad\\u30fc\\u3067\\u4e26\\u3079\\u66ff\\u3048\\u307e\\u305b\\u3093 \\u633f\\u5165\\u9806\\u5e8f\\u306f\\u4fdd\\u6301\\u3055\\u308c\\u307e\\u305b\\u3093 \\u53cd\\u5fa9\\u51e6\\u7406\\u9806\\u5e8f\\u306f\\u6c7a\\u307e\\u3063\\u3066\\u3044\\u307e\\u305b\\u3093 \\u3042\\u308b\\u53cd\\u5fa9\\u51e6\\u7406\\u4e2d\\u306b\\u8ffd\\u52a0\\u3055\\u308c\\u305f\\u8981\\u7d20\\u304c\\u305d\\u306e\\u51e6\\u7406\\u4e2d\\u306b\\u751f\\u6210\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u4fdd\\u8a3c\\u3057\\u307e\\u305b\\u3093 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#break-34\",\"title\":\"break \\u6587\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u6a5f\\u80fd\\u3059\\u308b\\u304b\\u3092\\u5206\\u304b\\u3063\\u3066\\u3044\\u306a\\u3044 (#34)\",\"text\":\"\\u8981\\u7d04 \\u30e9\\u30d9\\u30eb\\u3068 break \\u307e\\u305f\\u306f continue \\u306e\\u4f75\\u7528\\u306f\\u3001\\u7279\\u5b9a\\u306e\\u547d\\u4ee4\\u6587\\u3092\\u5f37\\u5236\\u7684\\u306b\\u4e2d\\u65ad\\u3057\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u3001\\u30eb\\u30fc\\u30d7\\u5185\\u306e switch \\u307e\\u305f\\u306f select \\u6587\\u3067\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002
\\u901a\\u5e38\\u3001break \\u6587\\u306f\\u30eb\\u30fc\\u30d7\\u306e\\u5b9f\\u884c\\u3092\\u7d42\\u4e86\\u3059\\u308b\\u305f\\u3081\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002\\u30eb\\u30fc\\u30d7\\u304c switch \\u307e\\u305f\\u306f select \\u3068\\u7d44\\u307f\\u5408\\u308f\\u305b\\u3066\\u4f7f\\u7528\\u200b\\u200b\\u3055\\u308c\\u308b\\u5834\\u5408\\u3001\\u76ee\\u7684\\u306e\\u547d\\u4ee4\\u6587\\u3067\\u306f\\u306a\\u3044\\u306e\\u306b\\u4e2d\\u65ad\\u3055\\u305b\\u3066\\u3057\\u307e\\u3046\\u3001\\u3068\\u3044\\u3046\\u30df\\u30b9\\u3092\\u3059\\u308b\\u3053\\u3068\\u304c\\u958b\\u767a\\u8005\\u306b\\u306f\\u3088\\u304f\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070
for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break\\n }\\n}\\nbreak \\u6587\\u306f for \\u30eb\\u30fc\\u30d7\\u3092\\u7d42\\u4e86\\u3055\\u305b\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u4ee3\\u308f\\u308a\\u306b switch \\u6587\\u3092\\u7d42\\u4e86\\u3055\\u305b\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f 0 \\u304b\\u3089 2 \\u307e\\u3067\\u3092\\u53cd\\u5fa9\\u3059\\u308b\\u4ee3\\u308f\\u308a\\u306b\\u30010 \\u304b\\u3089 4 \\u307e\\u3067\\u3092\\u53cd\\u5fa9\\u3057\\u307e\\u3059\\uff080 1 2 3 4\\uff09\\u3002
\\u899a\\u3048\\u3066\\u304a\\u304f\\u3079\\u304d\\u91cd\\u8981\\u306a\\u30eb\\u30fc\\u30eb\\u306e1\\u3064\\u306f\\u3001 break \\u6587\\u306f\\u6700\\u3082\\u5185\\u5074\\u306e for \\u3001switch \\u3001\\u307e\\u305f\\u306f select \\u6587\\u306e\\u5b9f\\u884c\\u3092\\u7d42\\u4e86\\u3059\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3059\\u3002\\u524d\\u306e\\u4f8b\\u3067\\u306f\\u3001switch \\u6587\\u3092\\u7d42\\u4e86\\u3057\\u307e\\u3059\\u3002
switch \\u6587\\u306e\\u4ee3\\u308f\\u308a\\u306b\\u30eb\\u30fc\\u30d7\\u3092\\u4e2d\\u65ad\\u3059\\u308b\\u6700\\u3082\\u6163\\u7528\\u7684\\u306a\\u65b9\\u6cd5\\u306f\\u30e9\\u30d9\\u30eb\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
loop:\\n for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break loop\\n }\\n }\\n\\u3053\\u3053\\u3067\\u306f\\u3001loop \\u30e9\\u30d9\\u30eb\\u3092 for \\u30eb\\u30fc\\u30d7\\u306b\\u95a2\\u9023\\u4ed8\\u3051\\u307e\\u3059\\u3002 \\u6b21\\u306b\\u3001break \\u6587\\u306b loop \\u30e9\\u30d9\\u30eb\\u3092\\u6307\\u5b9a\\u3059\\u308b\\u306e\\u3067\\u3001switch \\u3067\\u306f\\u306a\\u304f loop \\u304c\\u4e2d\\u65ad\\u3055\\u308c\\u307e\\u3059\\u3002\\u3088\\u3063\\u3066\\u3001\\u3053\\u306e\\u65b0\\u3057\\u3044\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\u306f\\u4e88\\u60f3\\u3069\\u304a\\u308a 0 1 2 \\u3092\\u51fa\\u529b\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#defer-35\",\"title\":\"\\u30eb\\u30fc\\u30d7\\u5185\\u3067 defer \\u3092\\u4f7f\\u7528\\u3059\\u308b (#35)\",\"text\":\"\\u8981\\u7d04 \\u95a2\\u6570\\u5185\\u306e\\u30eb\\u30fc\\u30d7\\u30ed\\u30b8\\u30c3\\u30af\\u306e\\u62bd\\u51fa\\u306f\\u3001\\u5404\\u53cd\\u5fa9\\u306e\\u6700\\u5f8c\\u3067\\u306e defer \\u6587\\u306e\\u5b9f\\u884c\\u306b\\u3064\\u306a\\u304c\\u308a\\u307e\\u3059\\u3002
defer \\u6587\\u306f\\u3001\\u4e0a\\u4f4d\\u30d6\\u30ed\\u30c3\\u30af\\u306e\\u95a2\\u6570\\u304c\\u623b\\u308b\\u307e\\u3067\\u547c\\u3073\\u51fa\\u3057\\u306e\\u5b9f\\u884c\\u3092\\u9045\\u3089\\u305b\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u4e3b\\u306b\\u5b9a\\u578b\\u30b3\\u30fc\\u30c9\\u3092\\u524a\\u6e1b\\u3059\\u308b\\u305f\\u3081\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u6700\\u7d42\\u7684\\u306b\\u9589\\u3058\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001defer \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3001return \\u3092\\u5b9f\\u884c\\u3059\\u308b\\u524d\\u306b\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u547c\\u3073\\u51fa\\u3057\\u3092\\u7e70\\u308a\\u8fd4\\u3059\\u3053\\u3068\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
defer \\u3067\\u3088\\u304f\\u3042\\u308b\\u30df\\u30b9\\u306e1\\u3064\\u306f\\u3001\\u4e0a\\u4f4d\\u30d6\\u30ed\\u30c3\\u30af \\u306e\\u95a2\\u6570\\u304c\\u623b\\u3063\\u305f\\u3068\\u304d\\u306b\\u95a2\\u6570\\u547c\\u3073\\u51fa\\u3057\\u304c\\u30b9\\u30b1\\u30b8\\u30e5\\u30fc\\u30eb\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u5fd8\\u308c\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // \\u30d5\\u30a1\\u30a4\\u30eb\\u306e\\u51e6\\u7406\\u3092\\u3059\\u308b\\n }\\n return nil\\n}\\ndefer \\u547c\\u3073\\u51fa\\u3057\\u306f\\u3001\\u5404\\u30eb\\u30fc\\u30d7\\u53cd\\u5fa9\\u4e2d\\u3067\\u306f\\u306a\\u304f\\u3001readFiles \\u95a2\\u6570\\u304c\\u8fd4\\u3055\\u308c\\u305f\\u3068\\u304d\\u306b\\u5b9f\\u884c\\u3055\\u308c\\u307e\\u3059\\u3002 readFiles \\u304c\\u8fd4\\u3089\\u306a\\u3044\\u5834\\u5408\\u3001\\u30d5\\u30a1\\u30a4\\u30eb\\u8a18\\u8ff0\\u5b50\\u306f\\u6c38\\u4e45\\u306b\\u958b\\u3044\\u305f\\u307e\\u307e\\u306b\\u306a\\u308a\\u3001\\u30ea\\u30fc\\u30af\\u304c\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002
\\u3053\\u306e\\u554f\\u984c\\u3092\\u89e3\\u6c7a\\u3059\\u308b\\u305f\\u3081\\u306e\\u4e00\\u822c\\u7684\\u306a\\u624b\\u6bb5\\u306e1\\u3064\\u306f\\u3001 defer \\u306e\\u5f8c\\u306b\\u3001\\u5404\\u53cd\\u5fa9\\u4e2d\\u306b\\u547c\\u3073\\u51fa\\u3055\\u308c\\u308b\\u4e0a\\u4f4d\\u30d6\\u30ed\\u30c3\\u30af\\u306e\\u95a2\\u6570\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n if err := readFile(path); err != nil {\\n return err\\n }\\n }\\n return nil\\n}\\n\\nfunc readFile(path string) error {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // \\u30d5\\u30a1\\u30a4\\u30eb\\u306e\\u51e6\\u7406\\u3092\\u3059\\u308b\\n return nil\\n}\\n\\u5225\\u306e\\u89e3\\u6c7a\\u7b56\\u306f\\u3001readFile \\u95a2\\u6570\\u3092\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u306b\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u304c\\u3001\\u672c\\u8cea\\u7684\\u306b\\u306f\\u540c\\u3058\\u3067\\u3059\\u3002\\u5225\\u306e\\u4e0a\\u4f4d\\u30d6\\u30ed\\u30c3\\u30af\\u306e\\u95a2\\u6570\\u3092\\u8ffd\\u52a0\\u3057\\u3066\\u3001\\u5404\\u53cd\\u5fa9\\u4e2d\\u306b defer \\u547c\\u3073\\u51fa\\u3057\\u3092\\u5b9f\\u884c\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_6\",\"title\":\"\\u6587\\u5b57\\u5217\",\"text\":\"\"},{\"location\":\"ja/#36\",\"title\":\"\\u30eb\\u30fc\\u30f3\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#36)\",\"text\":\"\\u8981\\u7d04 \\u30eb\\u30fc\\u30f3\\u304c Unicode \\u30b3\\u30fc\\u30c9\\u30dd\\u30a4\\u30f3\\u30c8\\u306e\\u6982\\u5ff5\\u306b\\u5bfe\\u5fdc\\u3057\\u3001\\u8907\\u6570\\u306e\\u30d0\\u30a4\\u30c8\\u3067\\u69cb\\u6210\\u3055\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001 Go \\u958b\\u767a\\u8005\\u304c\\u6587\\u5b57\\u5217\\u3092\\u6b63\\u78ba\\u306b\\u64cd\\u4f5c\\u3059\\u308b\\u305f\\u3081\\u306b\\u4e0d\\u53ef\\u6b20\\u3067\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u30eb\\u30fc\\u30f3\\u304c\\u3042\\u3089\\u3086\\u308b\\u5834\\u6240\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u6b21\\u306e\\u70b9\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002
\\u6587\\u5b57\\u30bb\\u30c3\\u30c8\\u306f\\u6587\\u5b57\\u306e\\u96c6\\u5408\\u3067\\u3059\\u304c\\u3001\\u30a8\\u30f3\\u30b3\\u30fc\\u30c7\\u30a3\\u30f3\\u30b0\\u306f\\u6587\\u5b57\\u30bb\\u30c3\\u30c8\\u3092\\u30d0\\u30a4\\u30ca\\u30ea\\u306b\\u5909\\u63db\\u3059\\u308b\\u65b9\\u6cd5\\u3092\\u8a18\\u8ff0\\u3057\\u307e\\u3059\\u3002 Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u6587\\u5b57\\u5217\\u306f\\u4efb\\u610f\\u306e\\u30d0\\u30a4\\u30c8\\u306e\\u4e0d\\u5909\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u53c2\\u7167\\u3057\\u307e\\u3059\\u3002 Go\\u8a00\\u8a9e\\u306e\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9\\u306f UTF-8 \\u3067\\u30a8\\u30f3\\u30b3\\u30fc\\u30c9\\u3055\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3059\\u3079\\u306e\\u6587\\u5b57\\u5217\\u30ea\\u30c6\\u30e9\\u30eb\\u306f UTF-8 \\u6587\\u5b57\\u5217\\u3067\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u6587\\u5b57\\u5217\\u306b\\u306f\\u4efb\\u610f\\u306e\\u30d0\\u30a4\\u30c8\\u304c\\u542b\\u307e\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u6587\\u5b57\\u5217\\u304c\\uff08\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9\\u3067\\u306f\\u306a\\u3044\\uff09\\u4ed6\\u306e\\u5834\\u6240\\u304b\\u3089\\u53d6\\u5f97\\u3055\\u308c\\u305f\\u5834\\u5408\\u3001\\u305d\\u306e\\u6587\\u5b57\\u5217\\u304c UTF-8 \\u30a8\\u30f3\\u30b3\\u30fc\\u30c7\\u30a3\\u30f3\\u30b0\\u306b\\u57fa\\u3065\\u3044\\u3066\\u3044\\u308b\\u4fdd\\u8a3c\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002 rune \\u306f Unicode \\u30b3\\u30fc\\u30c9\\u30dd\\u30a4\\u30f3\\u30c8\\u306e\\u6982\\u5ff5\\u306b\\u5bfe\\u5fdc\\u3057\\u3001\\u5358\\u4e00\\u306e\\u5024\\u3067\\u8868\\u3055\\u308c\\u308b\\u30a2\\u30a4\\u30c6\\u30e0\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002UTF-8 \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001Unicode \\u30b3\\u30fc\\u30c9\\u30dd\\u30a4\\u30f3\\u30c8\\u3092 1 \\uff5e 4 \\u30d0\\u30a4\\u30c8\\u306b\\u30a8\\u30f3\\u30b3\\u30fc\\u30c9\\u3067\\u304d\\u307e\\u3059\\u3002 Go\\u8a00\\u8a9e\\u3067\\u6587\\u5b57\\u5217\\u306b\\u5bfe\\u3057\\u3066 len() \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30eb\\u30fc\\u30f3\\u6570\\u3067\\u306f\\u306a\\u304f\\u30d0\\u30a4\\u30c8\\u6570\\u304c\\u8fd4\\u3055\\u308c\\u307e\\u3059\\u3002 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#37\",\"title\":\"\\u6587\\u5b57\\u5217\\u306b\\u5bfe\\u3059\\u308b\\u4e0d\\u6b63\\u306a\\u53cd\\u5fa9\\u51e6\\u7406 (#37)\",\"text\":\"\\u8981\\u7d04 range \\u6f14\\u7b97\\u5b50\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u6587\\u5b57\\u5217\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3059\\u308b\\u3068\\u3001\\u30eb\\u30fc\\u30f3\\u306e\\u30d0\\u30a4\\u30c8\\u30b7\\u30fc\\u30b1\\u30f3\\u30b9\\u306e\\u958b\\u59cb\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u306b\\u5bfe\\u5fdc\\u3059\\u308b\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30eb\\u30fc\\u30f3\\u304c\\u53cd\\u5fa9\\u51e6\\u7406\\u3055\\u308c\\u307e\\u3059\\u3002\\u7279\\u5b9a\\u306e\\u30eb\\u30fc\\u30f3\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\uff08 3 \\u756a\\u76ee\\u306e\\u30eb\\u30fc\\u30f3\\u306a\\u3069\\uff09\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3059\\u308b\\u306b\\u306f\\u3001\\u6587\\u5b57\\u5217\\u3092 []rune \\u306b\\u5909\\u63db\\u3057\\u307e\\u3059\\u3002
\\u6587\\u5b57\\u5217\\u306e\\u53cd\\u5fa9\\u51e6\\u7406\\u306f\\u3001\\u958b\\u767a\\u8005\\u306b\\u3068\\u3063\\u3066\\u4e00\\u822c\\u7684\\u306a\\u64cd\\u4f5c\\u3067\\u3059\\u3002\\u304a\\u305d\\u3089\\u304f\\u3001\\u6587\\u5b57\\u5217\\u5185\\u306e\\u5404\\u30eb\\u30fc\\u30f3\\u306b\\u5bfe\\u3057\\u3066\\u64cd\\u4f5c\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u304b\\u3001\\u7279\\u5b9a\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u3092\\u691c\\u7d22\\u3059\\u308b\\u72ec\\u81ea\\u306e\\u95a2\\u6570\\u3092\\u5b9f\\u88c5\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3067\\u3057\\u3087\\u3046\\u3002\\u3069\\u3061\\u3089\\u306e\\u5834\\u5408\\u3082\\u3001\\u6587\\u5b57\\u5217\\u306e\\u7570\\u306a\\u308b\\u30eb\\u30fc\\u30f3\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001\\u53cd\\u5fa9\\u51e6\\u7406\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u6a5f\\u80fd\\u3059\\u308b\\u304b\\u306b\\u3064\\u3044\\u3066\\u306f\\u56f0\\u60d1\\u3057\\u3084\\u3059\\u3044\\u3067\\u3059\\u3002
\\u6b21\\u306e\\u4f8b\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002
s := \\\"h\\u00eallo\\\"\\nfor i := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, s[i])\\n}\\nfmt.Printf(\\\"len=%d\\\\n\\\", len(s))\\nposition 0: h\\nposition 1: \\u00c3\\nposition 3: l\\nposition 4: l\\nposition 5: o\\nlen=6\\n\\u6df7\\u4e71\\u3092\\u62db\\u304f\\u53ef\\u80fd\\u6027\\u306e\\u3042\\u308b 3 \\u70b9\\u3092\\u53d6\\u308a\\u4e0a\\u3052\\u307e\\u3057\\u3087\\u3046\\u3002
2 \\u756a\\u76ee\\u306e\\u30eb\\u30fc\\u30f3\\u306f\\u3001\\u51fa\\u529b\\u3067\\u306f \\u00ea \\u3067\\u306f\\u306a\\u304f \\u00c3 \\u306b\\u306a\\u308a\\u307e\\u3059\\u3002 position 1 \\u304b\\u3089 position 3 \\u306b\\u30b8\\u30e3\\u30f3\\u30d7\\u3057\\u307e\\u3057\\u305f\\u3002 position 2 \\u306b\\u306f\\u4f55\\u304c\\u3042\\u308b\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002 len \\u306f 6 \\u3092\\u8fd4\\u3057\\u307e\\u3059\\u304c\\u3001s \\u306b\\u306f 5 \\u3064\\u306e\\u30eb\\u30fc\\u30f3\\u3057\\u304b\\u542b\\u307e\\u308c\\u3066\\u3044\\u307e\\u305b\\u3093\\u3002 \\u7d50\\u679c\\u306e\\u6700\\u5f8c\\u304b\\u3089\\u898b\\u3066\\u3044\\u304d\\u307e\\u3057\\u3087\\u3046\\u3002len \\u306f\\u30eb\\u30fc\\u30f3\\u6570\\u3067\\u306f\\u306a\\u304f\\u3001\\u6587\\u5b57\\u5217\\u5185\\u306e\\u30d0\\u30a4\\u30c8\\u6570\\u3092\\u8fd4\\u3059\\u3053\\u3068\\u306f\\u3059\\u3067\\u306b\\u8ff0\\u3079\\u307e\\u3057\\u305f\\u3002\\u6587\\u5b57\\u5217\\u30ea\\u30c6\\u30e9\\u30eb\\u3092 s \\u306b\\u5272\\u308a\\u5f53\\u3066\\u3066\\u3044\\u308b\\u305f\\u3081\\u3001s \\u306f UTF-8 \\u6587\\u5b57\\u5217\\u3067\\u3059\\u3002\\u4e00\\u65b9\\u3001\\u7279\\u6b8a\\u6587\\u5b57\\u300c\\u00ea\\u300d\\u306f 1 \\u30d0\\u30a4\\u30c8\\u3067\\u30a8\\u30f3\\u30b3\\u30fc\\u30c9\\u3055\\u308c\\u307e\\u305b\\u3093\\u3002 2 \\u30d0\\u30a4\\u30c8\\u5fc5\\u8981\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001len(s) \\u3092\\u547c\\u3073\\u51fa\\u3059\\u3068 6 \\u304c\\u8fd4\\u3055\\u308c\\u307e\\u3059\\u3002
\\u524d\\u306e\\u4f8b\\u3067\\u306f\\u3001\\u5404\\u30eb\\u30fc\\u30f3\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3057\\u3066\\u3044\\u306a\\u3044\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u4ee3\\u308f\\u308a\\u306b\\u3001\\u30eb\\u30fc\\u30f3\\u306e\\u5404\\u958b\\u59cb\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3057\\u307e\\u3059\\u3002
s[i] \\u3092\\u51fa\\u529b\\u3057\\u3066\\u3082 i \\u756a\\u76ee\\u306e\\u30eb\\u30fc\\u30f3\\u306f\\u51fa\\u529b\\u3055\\u308c\\u307e\\u305b\\u3093\\u3002\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9 i \\u306e\\u30d0\\u30a4\\u30c8\\u306e UTF-8 \\u8868\\u73fe\\u3092\\u51fa\\u529b\\u3057\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001 h\\u00eallo \\u306e\\u4ee3\\u308f\\u308a\\u306b h\\u00c3llo \\u3092\\u51fa\\u529b\\u304c\\u3055\\u308c\\u307e\\u3059\\u3002
\\u3055\\u307e\\u3056\\u307e\\u306a\\u30eb\\u30fc\\u30f3\\u6587\\u5b57\\u3092\\u3059\\u3079\\u3066\\u51fa\\u529b\\u3057\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001 range \\u6f14\\u7b97\\u5b50\\u306e value \\u8981\\u7d20\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
s := \\\"h\\u00eallo\\\"\\nfor i, r := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\n\\u307e\\u305f\\u306f\\u3001\\u6587\\u5b57\\u5217\\u3092\\u30eb\\u30fc\\u30f3\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u5909\\u63db\\u3057\\u3001\\u305d\\u308c\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002
s := \\\"h\\u00eallo\\\"\\nrunes := []rune(s)\\nfor i, r := range runes {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\n\\u3053\\u306e\\u89e3\\u6c7a\\u7b56\\u3067\\u306f\\u3001\\u4ee5\\u524d\\u306e\\u89e3\\u6c7a\\u7b56\\u3068\\u6bd4\\u8f03\\u3057\\u3066\\u5b9f\\u884c\\u6642\\u306e\\u30aa\\u30fc\\u30d0\\u30fc\\u30d8\\u30c3\\u30c9\\u304c\\u767a\\u751f\\u3059\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u5b9f\\u969b\\u3001\\u6587\\u5b57\\u5217\\u3092\\u30eb\\u30fc\\u30f3\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u5909\\u63db\\u3059\\u308b\\u306b\\u306f\\u3001\\u8ffd\\u52a0\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u5272\\u308a\\u5f53\\u3066\\u3001\\u30d0\\u30a4\\u30c8\\u3092\\u30eb\\u30fc\\u30f3\\u306b\\u5909\\u63db\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u6587\\u5b57\\u5217\\u306e\\u30d0\\u30a4\\u30c8\\u6570\\u3092 n \\u3068\\u3059\\u308b\\u3068\\u3001\\u6642\\u9593\\u8a08\\u7b97\\u91cf\\u306f O(n) \\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3059\\u3079\\u3066\\u306e\\u30eb\\u30fc\\u30f3\\u3092\\u53cd\\u5fa9\\u51e6\\u7406\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u6700\\u521d\\u306e\\u89e3\\u6c7a\\u7b56\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u305f\\u3060\\u3057\\u3001\\u6700\\u521d\\u306e\\u65b9\\u6cd5\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u6587\\u5b57\\u5217\\u306e i \\u756a\\u76ee\\u306e\\u30eb\\u30fc\\u30f3\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001\\u30eb\\u30fc\\u30f3\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3067\\u304d\\u307e\\u305b\\u3093\\u3002\\u4ee3\\u308f\\u308a\\u306b\\u3001\\u30d0\\u30a4\\u30c8\\u30b7\\u30fc\\u30b1\\u30f3\\u30b9\\u5185\\u306e\\u30eb\\u30fc\\u30f3\\u306e\\u958b\\u59cb\\u30a4\\u30f3\\u30c7\\u30c3\\u30af\\u30b9\\u304c\\u308f\\u304b\\u308a\\u307e\\u3059\\u3002
s := \\\"h\\u00eallo\\\"\\nr := []rune(s)[4]\\nfmt.Printf(\\\"%c\\\\n\\\", r) // o\\n\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#trim-38\",\"title\":\"trim \\u95a2\\u6570\\u306e\\u8aa4\\u7528 (#38)\",\"text\":\"\\u8981\\u7d04 strings.TrimRight \\u30fb strings.TrimLeft \\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u30bb\\u30c3\\u30c8\\u306b\\u542b\\u307e\\u308c\\u308b\\u3059\\u3079\\u3066\\u306e\\u672b\\u5c3e\\u30fb\\u5148\\u982d\\u306e\\u30eb\\u30fc\\u30f3\\u3092\\u524a\\u9664\\u3057\\u307e\\u3059\\u304c\\u3001 strings.TrimSuffix \\u30fb strings.TrimPrefix \\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u63a5\\u5c3e\\u8f9e\\u30fb\\u63a5\\u982d\\u8f9e\\u306e\\u306a\\u3044\\u6587\\u5b57\\u5217\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u3002
\\u305f\\u3068\\u3048\\u3070
fmt.Println(strings.TrimRight(\\\"123oxo\\\", \\\"xo\\\"))\\n\\u306f 123 \\u3092\\u51fa\\u529b\\u3057\\u307e\\u3059
\\u9006\\u306b\\u3001 strings.TrimLeft \\u306f\\u3001\\u30bb\\u30c3\\u30c8\\u306b\\u542b\\u307e\\u308c\\u308b\\u5148\\u982d\\u306e\\u30eb\\u30fc\\u30f3\\u3092\\u3059\\u3079\\u3066\\u524a\\u9664\\u3057\\u307e\\u3059\\u3002
\\u4e00\\u65b9\\u3001strings.TrimSuffix \\u30fb strings.TrimPrefix \\u306f\\u3001\\u6307\\u5b9a\\u3055\\u308c\\u305f\\u672b\\u5c3e\\u306e\\u63a5\\u5c3e\\u8f9e\\u30fb\\u63a5\\u982d\\u8f9e\\u3092\\u9664\\u3044\\u305f\\u6587\\u5b57\\u5217\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#39\",\"title\":\"\\u6700\\u9069\\u5316\\u304c\\u4e0d\\u5341\\u5206\\u306a\\u6587\\u5b57\\u5217\\u306e\\u9023\\u7d50 (#39)\",\"text\":\"\\u8981\\u7d04 \\u6587\\u5b57\\u5217\\u306e\\u30ea\\u30b9\\u30c8\\u306e\\u9023\\u7d50\\u306f\\u3001\\u53cd\\u5fa9\\u3054\\u3068\\u306b\\u65b0\\u3057\\u3044\\u6587\\u5b57\\u5217\\u304c\\u5272\\u308a\\u5f53\\u3066\\u3089\\u308c\\u306a\\u3044\\u3088\\u3046\\u306b\\u3001strings.Builder \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
+= \\u6f14\\u7b97\\u5b50\\u3092\\u7528\\u3044\\u3066\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u3059\\u3079\\u3066\\u306e\\u6587\\u5b57\\u5217\\u8981\\u7d20\\u3092\\u9023\\u7d50\\u3059\\u308b concat \\u95a2\\u6570\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002
func concat(values []string) string {\\n s := \\\"\\\"\\n for _, value := range values {\\n s += value\\n }\\n return s\\n}\\n\\u5404\\u53cd\\u5fa9\\u4e2d\\u306b\\u3001 += \\u6f14\\u7b97\\u5b50\\u306f s \\u3068 value \\u6587\\u5b57\\u5217\\u3092\\u9023\\u7d50\\u3057\\u307e\\u3059\\u3002\\u4e00\\u898b\\u3059\\u308b\\u3068\\u3001\\u3053\\u306e\\u95a2\\u6570\\u306f\\u9593\\u9055\\u3063\\u3066\\u3044\\u306a\\u3044\\u3088\\u3046\\u306b\\u898b\\u3048\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002\\u3057\\u304b\\u3057\\u3001\\u3053\\u306e\\u5b9f\\u88c5\\u306f\\u3001\\u6587\\u5b57\\u5217\\u306e\\u6838\\u3068\\u306a\\u308b\\u7279\\u6027\\u306e1\\u3064\\u3067\\u3042\\u308b\\u4e0d\\u5909\\u6027\\u3092\\u5fd8\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u5404\\u53cd\\u5fa9\\u3067\\u306f s \\u306f\\u66f4\\u65b0\\u3055\\u308c\\u307e\\u305b\\u3093\\u3002\\u30e1\\u30e2\\u30ea\\u5185\\u306b\\u65b0\\u3057\\u3044\\u6587\\u5b57\\u5217\\u3092\\u518d\\u5272\\u308a\\u5f53\\u3066\\u3059\\u308b\\u305f\\u3081\\u3001\\u3053\\u306e\\u95a2\\u6570\\u306e\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u306b\\u5927\\u304d\\u306a\\u5f71\\u97ff\\u3092\\u4e0e\\u3048\\u307e\\u3059\\u3002
\\u5e78\\u3044\\u306a\\u3053\\u3068\\u306b\\u3001 strings.Builder \\u3092\\u7528\\u3044\\u308b\\u3053\\u3068\\u3067\\u3001\\u3053\\u306e\\u554f\\u984c\\u306b\\u5bfe\\u51e6\\u3059\\u308b\\u89e3\\u6c7a\\u7b56\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
func concat(values []string) string {\\n sb := strings.Builder{}\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\n\\u5404\\u53cd\\u5fa9\\u4e2d\\u306b\\u3001value \\u306e\\u5185\\u5bb9\\u3092\\u5185\\u90e8\\u30d0\\u30c3\\u30d5\\u30a1\\u306b\\u8ffd\\u52a0\\u3059\\u308b WriteString \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3057\\u3066\\u7d50\\u679c\\u306e\\u6587\\u5b57\\u5217\\u3092\\u69cb\\u7bc9\\u3057\\u3001\\u30e1\\u30e2\\u30ea\\u306e\\u30b3\\u30d4\\u30fc\\u3092\\u6700\\u5c0f\\u9650\\u306b\\u6291\\u3048\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3057\\u305f\\u3002
\\u88dc\\u8db3 WriteString \\u306f 2 \\u756a\\u76ee\\u306e\\u51fa\\u529b\\u3068\\u3057\\u3066\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u304c\\u3001\\u610f\\u56f3\\u7684\\u306b\\u7121\\u8996\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u5b9f\\u969b\\u3001\\u3053\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u306f nil \\u30a8\\u30e9\\u30fc\\u4ee5\\u5916\\u3092\\u8fd4\\u3059\\u3053\\u3068\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u3067\\u306f\\u3001\\u3053\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u304c\\u30b7\\u30b0\\u30cd\\u30c1\\u30e3\\u306e\\u4e00\\u90e8\\u3068\\u3057\\u3066\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u76ee\\u7684\\u306f\\u4f55\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002strings.Builder \\u306f io.StringWriter \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u5b9f\\u88c5\\u3057\\u3066\\u304a\\u308a\\u3001\\u3053\\u308c\\u306b\\u306f WriteString(s string) (n int, err error) \\u3068\\u3044\\u30461\\u3064\\u306e\\u30e1\\u30bd\\u30c3\\u30c9\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3053\\u306e\\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u306b\\u6e96\\u62e0\\u3059\\u308b\\u306b\\u306f\\u3001WriteString \\u306f\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3055\\u306a\\u3051\\u308c\\u3070\\u306a\\u3089\\u306a\\u3044\\u306e\\u3067\\u3059\\u3002
\\u5185\\u90e8\\u7684\\u306b\\u306f\\u3001strings.Builder \\u306f\\u30d0\\u30a4\\u30c8\\u30b9\\u30e9\\u30a4\\u30b9\\u3092\\u4fdd\\u6301\\u3057\\u307e\\u3059\\u3002 WriteString \\u3092\\u547c\\u3073\\u51fa\\u3059\\u305f\\u3073\\u306b\\u3001\\u3053\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u8ffd\\u52a0\\u3059\\u308b\\u547c\\u3073\\u51fa\\u3057\\u304c\\u884c\\u308f\\u308c\\u307e\\u3059\\u3002\\u3053\\u308c\\u306b\\u306f2\\u3064\\u306e\\u5f71\\u97ff\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305a\\u3001 append \\u306e\\u547c\\u3073\\u51fa\\u3057\\u304c\\u885d\\u7a81\\u72b6\\u614b\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u305f\\u3081\\u3001\\u3053\\u306e\\u69cb\\u9020\\u4f53\\u306f\\u540c\\u6642\\u306b\\u4f7f\\u7528\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u30022\\u756a\\u76ee\\u306e\\u5f71\\u97ff\\u306f\\u3001 \\u975e\\u52b9\\u7387\\u306a\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u521d\\u671f\\u5316 (#21) \\u3067\\u898b\\u305f\\u3082\\u306e\\u3067\\u3059\\u3002\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u5c06\\u6765\\u306e\\u9577\\u3055\\u304c\\u3059\\u3067\\u306b\\u308f\\u304b\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u305d\\u308c\\u3092\\u4e8b\\u524d\\u306b\\u5272\\u308a\\u5f53\\u3066\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u306e\\u305f\\u3081\\u306b\\u3001strings.Builder \\u306f\\u5225\\u306e n \\u30d0\\u30a4\\u30c8\\u306e\\u305f\\u3081\\u306e\\u30b9\\u30da\\u30fc\\u30b9\\u3092\\u4fdd\\u8a3c\\u3059\\u308b\\u30e1\\u30bd\\u30c3\\u30c9 Grow(n int) \\u3092\\u6301\\u3063\\u3066\\u3044\\u307e\\u3059\\u3002
func concat(values []string) string {\\n total := 0\\n for i := 0; i < len(values); i++ {\\n total += len(values[i])\\n }\\n\\n sb := strings.Builder{}\\n sb.Grow(total) (2)\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\n\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u3092\\u5b9f\\u884c\\u3057\\u3066 3 \\u3064\\u306e\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\uff08 += \\u3092\\u4f7f\\u7528\\u3057\\u305f V1 \\u3001\\u4e8b\\u524d\\u5272\\u308a\\u5f53\\u3066\\u306a\\u3057\\u3067 strings.Builder{} \\u3092\\u4f7f\\u7528\\u3057\\u305f V2 \\u3001\\u4e8b\\u524d\\u5272\\u308a\\u5f53\\u3066\\u3042\\u308a\\u306e strings.Builder{} \\u3092\\u4f7f\\u7528\\u3057\\u305f V3 \\uff09\\u3092\\u6bd4\\u8f03\\u3057\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002\\u5165\\u529b\\u30b9\\u30e9\\u30a4\\u30b9\\u306b\\u306f 1,000 \\u500b\\u306e\\u6587\\u5b57\\u5217\\u304c\\u542b\\u307e\\u308c\\u3066\\u304a\\u308a\\u3001\\u5404\\u6587\\u5b57\\u5217\\u306b\\u306f 1,000 \\u30d0\\u30a4\\u30c8\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u307e\\u3059\\u3002
BenchmarkConcatV1-4 16 72291485 ns/op\\nBenchmarkConcatV2-4 1188 878962 ns/op\\nBenchmarkConcatV3-4 5922 190340 ns/op\\n\\u3054\\u89a7\\u306e\\u3068\\u304a\\u308a\\u3001\\u6700\\u65b0\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\u304c\\u6700\\u3082\\u52b9\\u7387\\u7684\\u3067\\u3001V1 \\u3088\\u308a 99% \\u3001V2 \\u3088\\u308a 78% \\u9ad8\\u901f\\u3067\\u3059\\u3002
strings.Builder \\u306f\\u3001\\u6587\\u5b57\\u5217\\u306e\\u30ea\\u30b9\\u30c8\\u3092\\u9023\\u7d50\\u3059\\u308b\\u305f\\u3081\\u306e\\u89e3\\u6c7a\\u7b56\\u3068\\u3057\\u3066\\u63a8\\u5968\\u3055\\u308c\\u307e\\u3059\\u3002\\u901a\\u5e38\\u3001\\u3053\\u308c\\u306f\\u30eb\\u30fc\\u30d7\\u5185\\u3067\\u4f7f\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3044\\u304f\\u3064\\u304b\\u306e\\u6587\\u5b57\\u5217 \\uff08\\u540d\\u524d\\u3068\\u59d3\\u306a\\u3069\\uff09\\u3092\\u9023\\u7d50\\u3059\\u308b\\u3060\\u3051\\u306e\\u5834\\u5408\\u3001 strings.Builder \\u306e\\u4f7f\\u7528\\u306f\\u3001 += \\u6f14\\u7b97\\u5b50\\u3084 fmt.Sprintf \\u3068\\u6bd4\\u3079\\u3066\\u53ef\\u8aad\\u6027\\u304c\\u4f4e\\u304f\\u306a\\u308b\\u304b\\u3089\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#40\",\"title\":\"\\u7121\\u99c4\\u306a\\u6587\\u5b57\\u5217\\u5909\\u63db (#40)\",\"text\":\"\\u8981\\u7d04 bytes \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306f strings \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3068\\u540c\\u3058\\u64cd\\u4f5c\\u3092\\u63d0\\u4f9b\\u3057\\u3066\\u304f\\u308c\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u3068\\u3001\\u4f59\\u5206\\u306a\\u30d0\\u30a4\\u30c8\\u30fb\\u6587\\u5b57\\u5217\\u5909\\u63db\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u6587\\u5b57\\u5217\\u307e\\u305f\\u306f []byte \\u3092\\u6271\\u3046\\u3053\\u3068\\u3092\\u9078\\u629e\\u3059\\u308b\\u5834\\u5408\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e\\u30d7\\u30ed\\u30b0\\u30e9\\u30de\\u30fc\\u306f\\u5229\\u4fbf\\u6027\\u306e\\u305f\\u3081\\u306b\\u6587\\u5b57\\u5217\\u3092\\u597d\\u3080\\u50be\\u5411\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e I/O \\u306f\\u5b9f\\u969b\\u306b\\u306f []byte \\u3067\\u884c\\u308f\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001io.Reader\\u3001io.Writer\\u3001\\u304a\\u3088\\u3073 io.ReadAll \\u306f\\u6587\\u5b57\\u5217\\u3067\\u306f\\u306a\\u304f []byte \\u3092\\u51e6\\u7406\\u3057\\u307e\\u3059\\u3002
\\u6587\\u5b57\\u5217\\u3068 []byte \\u306e\\u3069\\u3061\\u3089\\u3092\\u6271\\u3046\\u3079\\u304d\\u304b\\u8ff7\\u3063\\u305f\\u3068\\u304d\\u3001[]byte \\u3092\\u6271\\u3046\\u65b9\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u9762\\u5012\\u3060\\u3068\\u3044\\u3046\\u308f\\u3051\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u3092\\u601d\\u3044\\u51fa\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002strings \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u304b\\u3089\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u305f\\u3059\\u3079\\u3066\\u306e\\u95a2\\u6570\\u306b\\u306f\\u3001bytes \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u4ee3\\u66ff\\u6a5f\\u80fd\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002 Split\\u3001Count\\u3001Contains\\u3001Index \\u306a\\u3069\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001I/O \\u3092\\u5b9f\\u884c\\u3057\\u3066\\u3044\\u308b\\u304b\\u3069\\u3046\\u304b\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\u3001\\u6587\\u5b57\\u5217\\u306e\\u4ee3\\u308f\\u308a\\u306b\\u30d0\\u30a4\\u30c8\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30ef\\u30fc\\u30af\\u30d5\\u30ed\\u30fc\\u5168\\u4f53\\u3092\\u5b9f\\u88c5\\u3067\\u304d\\u3001\\u8ffd\\u52a0\\u306e\\u5909\\u63db\\u30b3\\u30b9\\u30c8\\u3092\\u56de\\u907f\\u3067\\u304d\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u6700\\u521d\\u306b\\u78ba\\u8a8d\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#41\",\"title\":\"\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u3068\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af (#41)\",\"text\":\"\\u8981\\u7d04 \\u90e8\\u5206\\u6587\\u5b57\\u5217\\u306e\\u4ee3\\u308f\\u308a\\u306b\\u30b3\\u30d4\\u30fc\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u64cd\\u4f5c\\u306b\\u3088\\u3063\\u3066\\u8fd4\\u3055\\u308c\\u308b\\u6587\\u5b57\\u5217\\u304c\\u540c\\u3058\\u30d0\\u30a4\\u30c8\\u914d\\u5217\\u306b\\u3088\\u3063\\u3066\\u30b5\\u30dd\\u30fc\\u30c8\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af (#26) \\u3067\\u306f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u307e\\u305f\\u306f\\u914d\\u5217\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u304c\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af\\u306e\\u72b6\\u6cc1\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u78ba\\u8a8d\\u3057\\u307e\\u3057\\u305f\\u3002\\u3053\\u306e\\u539f\\u5247\\u306f\\u3001\\u6587\\u5b57\\u5217\\u304a\\u3088\\u3073\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u306e\\u64cd\\u4f5c\\u306b\\u3082\\u5f53\\u3066\\u306f\\u307e\\u308a\\u307e\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u64cd\\u4f5c\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u304d\\u306f\\u30012 \\u3064\\u306e\\u3053\\u3068\\u306b\\u7559\\u610f\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u307e\\u305a\\u3001\\u63d0\\u4f9b\\u3055\\u308c\\u308b\\u9593\\u9694\\u306f\\u30eb\\u30fc\\u30f3\\u6570\\u3067\\u306f\\u306a\\u304f\\u3001\\u30d0\\u30a4\\u30c8\\u6570\\u306b\\u57fa\\u3065\\u3044\\u3066\\u3044\\u307e\\u3059\\u3002\\u6b21\\u306b\\u3001\\u7d50\\u679c\\u306e\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u304c\\u6700\\u521d\\u306e\\u6587\\u5b57\\u5217\\u3068\\u540c\\u3058\\u30d0\\u30c3\\u30ad\\u30f3\\u30b0\\u914d\\u5217\\u3092\\u5171\\u6709\\u3059\\u308b\\u305f\\u3081\\u3001\\u90e8\\u5206\\u6587\\u5b57\\u5217\\u64cd\\u4f5c\\u306b\\u3088\\u308a\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3053\\u308c\\u3092\\u9632\\u3050\\u65b9\\u6cd5\\u306f\\u3001\\u6587\\u5b57\\u5217\\u306e\\u30b3\\u30d4\\u30fc\\u3092\\u624b\\u52d5\\u3067\\u5b9f\\u884c\\u3059\\u308b\\u304b\\u3001Go 1.18 \\u304b\\u3089\\u5b9f\\u88c5\\u3055\\u308c\\u3066\\u3044\\u308b strings.Clone \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_7\",\"title\":\"\\u95a2\\u6570\\u3068\\u30e1\\u30bd\\u30c3\\u30c9\",\"text\":\"\"},{\"location\":\"ja/#42\",\"title\":\"\\u3069\\u306e\\u578b\\u306e\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3092\\u4f7f\\u7528\\u3059\\u308c\\u3070\\u3088\\u3044\\u304b\\u308f\\u304b\\u3063\\u3066\\u3044\\u306a\\u3044 (#42)\",\"text\":\"\\u8981\\u7d04 \\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3068\\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306e\\u3069\\u3061\\u3089\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u304b\\u306f\\u3001\\u3069\\u306e\\u578b\\u306a\\u306e\\u304b\\u3001\\u5909\\u5316\\u3055\\u305b\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3001\\u30b3\\u30d4\\u30fc\\u3067\\u304d\\u306a\\u3044\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u308b\\u304b\\u3069\\u3046\\u304b\\u3001\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u306f\\u3069\\u308c\\u304f\\u3089\\u3044\\u5927\\u304d\\u3044\\u306e\\u304b\\u3001\\u306a\\u3069\\u306e\\u8981\\u7d20\\u306b\\u57fa\\u3065\\u3044\\u3066\\u6c7a\\u5b9a\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u5206\\u304b\\u3089\\u306a\\u3044\\u5834\\u5408\\u306f\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3068\\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306e\\u3069\\u3061\\u3089\\u3092\\u9078\\u629e\\u3059\\u308b\\u304b\\u306f\\u3001\\u5fc5\\u305a\\u3057\\u3082\\u7c21\\u5358\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u9078\\u629e\\u306b\\u5f79\\u7acb\\u3064\\u3044\\u304f\\u3064\\u304b\\u306e\\u6761\\u4ef6\\u306b\\u3064\\u3044\\u3066\\u8aac\\u660e\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3067\\u306a\\u3051\\u308c\\u3070\\u306a\\u3089\\u306a\\u3044 \\u3068\\u304d
\\u30e1\\u30bd\\u30c3\\u30c9\\u304c\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3092\\u5909\\u5316\\u3055\\u305b\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u3002\\u3053\\u306e\\u30eb\\u30fc\\u30eb\\u306f\\u3001\\u53d7\\u4fe1\\u5074\\u304c\\u30b9\\u30e9\\u30a4\\u30b9\\u3067\\u3042\\u308a\\u3001\\u30e1\\u30bd\\u30c3\\u30c9\\u304c\\u8981\\u7d20\\u3092\\u8ffd\\u52a0\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306b\\u3082\\u6709\\u52b9\\u3067\\u3059\\u3002 type slice []int\\n\\nfunc (s *slice) add(element int) {\\n *s = append(*s, element)\\n}\\n \\u30e1\\u30bd\\u30c3\\u30c9\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306b\\u30b3\\u30d4\\u30fc\\u3067\\u304d\\u306a\\u3044\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u3002sync \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306e\\u578b\\u90e8\\u5206\\u306f\\u305d\\u306e\\u4e00\\u4f8b\\u306b\\u306a\\u308a\\u307e\\u3059\\uff08 sync \\u578b\\u306e\\u30b3\\u30d4\\u30fc (#74) \\u3092\\u53c2\\u7167\\uff09\\u3002 \\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3067\\u3042\\u308b\\u3079\\u304d \\u3068\\u304d
\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c\\u5927\\u304d\\u306a\\u30aa\\u30d6\\u30b8\\u30a7\\u30af\\u30c8\\u306e\\u5834\\u5408\\u3002\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u5927\\u898f\\u6a21\\u306a\\u30b3\\u30d4\\u30fc\\u306e\\u4f5c\\u6210\\u304c\\u9632\\u6b62\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u547c\\u3073\\u51fa\\u3057\\u304c\\u3088\\u308a\\u52b9\\u7387\\u7684\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u3069\\u308c\\u304f\\u3089\\u3044\\u306e\\u5927\\u304d\\u3055\\u306a\\u306e\\u304b\\u78ba\\u8a3c\\u304c\\u306a\\u3044\\u5834\\u5408\\u306f\\u3001\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u304c\\u89e3\\u6c7a\\u7b56\\u306b\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u591a\\u304f\\u306e\\u8981\\u56e0\\u306b\\u4f9d\\u5b58\\u3059\\u308b\\u305f\\u3081\\u3001\\u7279\\u5b9a\\u306e\\u30b5\\u30a4\\u30ba\\u3092\\u6307\\u5b9a\\u3059\\u308b\\u3053\\u3068\\u306f\\u307b\\u3068\\u3093\\u3069\\u4e0d\\u53ef\\u80fd\\u3067\\u3059\\u3002 \\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3067\\u306a\\u3051\\u308c\\u3070\\u306a\\u3089\\u306a\\u3044 \\u3068\\u304d
\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306e\\u4e0d\\u5909\\u6027\\u3092\\u5f37\\u5236\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u3002 \\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c\\u30de\\u30c3\\u30d7\\u3001\\u95a2\\u6570\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u5834\\u5408\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u5834\\u5408\\u306f\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u30a8\\u30e9\\u30fc\\u304c\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002 \\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3067\\u3042\\u308b\\u3079\\u304d \\u3068\\u304d
\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c\\u5909\\u5316\\u3055\\u305b\\u308b\\u5fc5\\u8981\\u306e\\u306a\\u3044\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u5834\\u5408\\u3002 \\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c\\u3001time.Time \\u306a\\u3069\\u306e\\u5c0f\\u3055\\u306a\\u914d\\u5217\\u307e\\u305f\\u306f\\u69cb\\u9020\\u4f53\\u3067\\u3001\\u53ef\\u5909\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u6301\\u305f\\u306a\\u3044\\u5024\\u578b\\u3067\\u3042\\u308b\\u5834\\u5408\\u3002 \\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c int\\u3001float64\\u3001\\u307e\\u305f\\u306f string \\u306a\\u3069\\u306e\\u57fa\\u672c\\u578b\\u306e\\u5834\\u5408\\u3002 \\u3082\\u3061\\u308d\\u3093\\u3001\\u7279\\u6b8a\\u306a\\u30b1\\u30fc\\u30b9\\u306f\\u5e38\\u306b\\u5b58\\u5728\\u3059\\u308b\\u305f\\u3081\\u3001\\u3059\\u3079\\u3066\\u3092\\u7db2\\u7f85\\u3059\\u308b\\u3053\\u3068\\u306f\\u4e0d\\u53ef\\u80fd\\u3067\\u3059\\u304c\\u3001\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u306e\\u76ee\\u6a19\\u306f\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e\\u30b1\\u30fc\\u30b9\\u3092\\u30ab\\u30d0\\u30fc\\u3059\\u308b\\u305f\\u3081\\u306e\\u30ac\\u30a4\\u30c0\\u30f3\\u30b9\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u901a\\u5e38\\u306f\\u3001\\u305d\\u3046\\u3057\\u306a\\u3044\\u6b63\\u5f53\\u306a\\u7406\\u7531\\u304c\\u306a\\u3044\\u9650\\u308a\\u3001\\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u9593\\u9055\\u3044\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u5206\\u304b\\u3089\\u306a\\u3044\\u5834\\u5408\\u306f\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u30ec\\u30b7\\u30fc\\u30d0\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#43\",\"title\":\"\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u307e\\u3063\\u305f\\u304f\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#43)\",\"text\":\"\\u8981\\u7d04 \\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u306e\\u4f7f\\u7528\\u306f\\u3001\\u7279\\u306b\\u8907\\u6570\\u306e\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u304c\\u540c\\u3058\\u578b\\u3092\\u6301\\u3064\\u5834\\u5408\\u3001\\u95a2\\u6570\\u30fb\\u30e1\\u30bd\\u30c3\\u30c9\\u306e\\u8aad\\u307f\\u3084\\u3059\\u3055\\u3092\\u5411\\u4e0a\\u3055\\u305b\\u308b\\u52b9\\u7387\\u7684\\u306a\\u65b9\\u6cd5\\u3067\\u3059\\u3002\\u5834\\u5408\\u306b\\u3088\\u3063\\u3066\\u306f\\u3001\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306f\\u30bc\\u30ed\\u5024\\u306b\\u521d\\u671f\\u5316\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u3053\\u306e\\u65b9\\u6cd5\\u304c\\u4fbf\\u5229\\u3067\\u3059\\u3089\\u3042\\u308b\\u3053\\u3068\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u6f5c\\u5728\\u7684\\u306a\\u526f\\u4f5c\\u7528\\u306b\\u306f\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u95a2\\u6570\\u307e\\u305f\\u306f\\u30e1\\u30bd\\u30c3\\u30c9\\u3067\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u8fd4\\u3059\\u3068\\u304d\\u3001\\u3053\\u308c\\u3089\\u306e\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306b\\u540d\\u524d\\u3092\\u4ed8\\u3051\\u3066\\u3001\\u901a\\u5e38\\u306e\\u5909\\u6570\\u3068\\u3057\\u3066\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u306b\\u540d\\u524d\\u3092\\u4ed8\\u3051\\u308b\\u3068\\u3001\\u95a2\\u6570\\u30fb\\u30e1\\u30bd\\u30c3\\u30c9\\u306e\\u958b\\u59cb\\u6642\\u306b\\u305d\\u306e\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u306f\\u30bc\\u30ed\\u5024\\u306b\\u521d\\u671f\\u5316\\u3055\\u308c\\u307e\\u3059\\u3002\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001 \\u3080\\u304d\\u51fa\\u3057\\u306e return \\u6587\\uff08\\u5f15\\u6570\\u306a\\u3057\\uff09 \\u3092\\u547c\\u3073\\u51fa\\u3059\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002\\u305d\\u306e\\u5834\\u5408\\u3001\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306e\\u73fe\\u5728\\u306e\\u5024\\u304c\\u623b\\u308a\\u5024\\u3068\\u3057\\u3066\\u4f7f\\u7528\\u3055\\u308c\\u307e\\u3059\\u3002
\\u4ee5\\u4e0b\\u306f\\u3001\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf b \\u3092\\u7528\\u3044\\u305f\\u4f8b\\u3067\\u3059\\u3002
func f(a int) (b int) {\\n b = a\\n return\\n}\\n\\u3053\\u306e\\u4f8b\\u3067\\u306f\\u3001\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306b\\u540d\\u524d b \\u3092\\u4ed8\\u3051\\u3066\\u3044\\u307e\\u3059\\u3002\\u5f15\\u6570\\u306a\\u3057\\u3067 return \\u3092\\u547c\\u3073\\u51fa\\u3059\\u3068\\u3001b \\u306e\\u73fe\\u5728\\u306e\\u5024\\u304c\\u8fd4\\u3055\\u308c\\u307e\\u3059\\u3002
\\u5834\\u5408\\u306b\\u3088\\u3063\\u3066\\u306f\\u3001\\u540d\\u524d\\u4ed8\\u304d\\u306e\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u306b\\u3088\\u3063\\u3066\\u53ef\\u8aad\\u6027\\u304c\\u5411\\u4e0a\\u3059\\u308b\\u3053\\u3068\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u30012 \\u3064\\u306e\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u304c\\u540c\\u3058\\u578b\\u3067\\u3042\\u308b\\u5834\\u5408\\u306a\\u3069\\u3067\\u3059\\u3002\\u305d\\u306e\\u4ed6\\u306b\\u3082\\u3001\\u5229\\u4fbf\\u6027\\u306e\\u305f\\u3081\\u306b\\u7528\\u3044\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u3086\\u3048\\u306b\\u3001\\u660e\\u78ba\\u306a\\u5229\\u70b9\\u304c\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001\\u614e\\u91cd\\u306b\\u306a\\u308a\\u306a\\u304c\\u3089\\u3082\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#44\",\"title\":\"\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306b\\u3088\\u308b\\u4e88\\u60f3\\u5916\\u306e\\u526f\\u4f5c\\u7528 (#44)\",\"text\":\"\\u8981\\u7d04 #43 \\u3092\\u53c2\\u7167\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u304c\\u72b6\\u6cc1\\u306b\\u3088\\u3063\\u3066\\u306f\\u5f79\\u7acb\\u3064\\u7406\\u7531\\u306b\\u3064\\u3044\\u3066\\u8aac\\u660e\\u3057\\u307e\\u3057\\u305f\\u3002 \\u305f\\u3060\\u3057\\u3001\\u3053\\u308c\\u3089\\u306f\\u30bc\\u30ed\\u5024\\u306b\\u521d\\u671f\\u5316\\u3055\\u308c\\u308b\\u305f\\u3081\\u3001\\u5341\\u5206\\u306b\\u6ce8\\u610f\\u3057\\u306a\\u3044\\u3068\\u3001\\u8efd\\u5fae\\u306a\\u30d0\\u30b0\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f\\u3069\\u3053\\u304c\\u9593\\u9055\\u3063\\u3066\\u3044\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002
func (l loc) getCoordinates(ctx context.Context, address string) (\\n lat, lng float32, err error) {\\n isValid := l.validateAddress(address) (1)\\n if !isValid {\\n return 0, 0, errors.New(\\\"invalid address\\\")\\n }\\n\\n if ctx.Err() != nil { (2)\\n return 0, 0, err\\n }\\n\\n // \\u5ea7\\u6a19\\u3092\\u53d6\\u5f97\\u3057\\u3066\\u8fd4\\u3059\\n}\\n\\u4e00\\u77a5\\u3057\\u305f\\u3060\\u3051\\u3067\\u306f\\u30a8\\u30e9\\u30fc\\u306f\\u660e\\u3089\\u304b\\u3067\\u306f\\u306a\\u3044\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002if ctx.Err() != nil \\u30b9\\u30b3\\u30fc\\u30d7\\u3067\\u8fd4\\u3055\\u308c\\u308b\\u30a8\\u30e9\\u30fc\\u306f err \\u3067\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001err \\u5909\\u6570\\u306b\\u306f\\u5024\\u3092\\u5272\\u308a\\u5f53\\u3066\\u3066\\u3044\\u307e\\u305b\\u3093\\u3002error \\u578b\\u306e\\u30bc\\u30ed\\u5024\\u3001 nil \\u306b\\u5272\\u308a\\u5f53\\u3066\\u3089\\u308c\\u305f\\u307e\\u307e\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f\\u5e38\\u306b nil \\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u3002
\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u5404\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u306f\\u30bc\\u30ed\\u5024\\u306b\\u521d\\u671f\\u5316\\u3055\\u308c\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u3067\\u8aac\\u660e\\u3057\\u305f\\u3088\\u3046\\u306b\\u3001\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u898b\\u3064\\u3051\\u308b\\u306e\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u7c21\\u5358\\u3067\\u306f\\u306a\\u3044\\u8efd\\u5fae\\u306a\\u30d0\\u30b0\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3086\\u3048\\u306b\\u3001\\u6f5c\\u5728\\u7684\\u306a\\u526f\\u4f5c\\u7528\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u540d\\u524d\\u4ed8\\u304d\\u7d50\\u679c\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u30fc\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u304d\\u306f\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#nil-45\",\"title\":\"nil \\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u3092\\u8fd4\\u3059 (#45)\",\"text\":\"\\u8981\\u7d04 \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u8fd4\\u3059\\u3068\\u304d\\u306f\\u3001nil \\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u8fd4\\u3059\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u660e\\u793a\\u7684\\u306a nil \\u5024\\u3092\\u8fd4\\u3059\\u3088\\u3046\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u305d\\u3046\\u3057\\u306a\\u3051\\u308c\\u3070\\u3001\\u610f\\u56f3\\u3057\\u306a\\u3044\\u7d50\\u679c\\u304c\\u767a\\u751f\\u3057\\u3001\\u547c\\u3073\\u51fa\\u3057\\u5143\\u304c nil \\u3067\\u306f\\u306a\\u3044\\u5024\\u3092\\u53d7\\u3051\\u53d6\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#46\",\"title\":\"\\u95a2\\u6570\\u5165\\u529b\\u306b\\u30d5\\u30a1\\u30a4\\u30eb\\u540d\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u308b (#46)\",\"text\":\"\\u8981\\u7d04 \\u30d5\\u30a1\\u30a4\\u30eb\\u540d\\u306e\\u4ee3\\u308f\\u308a\\u306b io.Reader \\u578b\\u3092\\u53d7\\u3051\\u53d6\\u308b\\u3088\\u3046\\u306b\\u95a2\\u6570\\u3092\\u8a2d\\u8a08\\u3059\\u308b\\u3068\\u3001\\u95a2\\u6570\\u306e\\u518d\\u5229\\u7528\\u6027\\u304c\\u5411\\u4e0a\\u3057\\u3001\\u30c6\\u30b9\\u30c8\\u304c\\u5bb9\\u6613\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u30d5\\u30a1\\u30a4\\u30eb\\u540d\\u3092\\u30d5\\u30a1\\u30a4\\u30eb\\u304b\\u3089\\u8aad\\u307f\\u53d6\\u308b\\u305f\\u3081\\u306e\\u95a2\\u6570\\u5165\\u529b\\u3068\\u3057\\u3066\\u53d7\\u3051\\u5165\\u308c\\u308b\\u3053\\u3068\\u306f\\u3001\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u300c\\u30b3\\u30fc\\u30c9\\u306e\\u81ed\\u3044\\u300d\\u3068\\u307f\\u306a\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u3059\\uff08 os.Open \\u306a\\u3069\\u306e\\u7279\\u5b9a\\u306e\\u95a2\\u6570\\u3092\\u9664\\u304f\\uff09\\u3002\\u8907\\u6570\\u306e\\u30d5\\u30a1\\u30a4\\u30eb\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3053\\u3068\\u306b\\u306b\\u306a\\u308b\\u304b\\u3082\\u3057\\u308c\\u305a\\u3001\\u5358\\u4f53\\u30c6\\u30b9\\u30c8\\u304c\\u3088\\u308a\\u8907\\u96d1\\u306b\\u306a\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u304b\\u3089\\u3067\\u3059\\u3002\\u307e\\u305f\\u3001\\u95a2\\u6570\\u306e\\u518d\\u5229\\u7528\\u6027\\u3082\\u4f4e\\u4e0b\\u3057\\u307e\\u3059 \\uff08\\u305f\\u3060\\u3057\\u3001\\u3059\\u3079\\u3066\\u306e\\u95a2\\u6570\\u304c\\u518d\\u5229\\u7528\\u3055\\u308c\\u308b\\u308f\\u3051\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\uff09\\u3002 io.Reader \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30c7\\u30fc\\u30bf\\u30bd\\u30fc\\u30b9\\u304c\\u62bd\\u8c61\\u5316\\u3055\\u308c\\u307e\\u3059\\u3002\\u5165\\u529b\\u304c\\u30d5\\u30a1\\u30a4\\u30eb\\u3001\\u6587\\u5b57\\u5217\\u3001HTTP \\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u3001gRPC \\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u306e\\u3044\\u305a\\u308c\\u3067\\u3042\\u308b\\u304b\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\u3001\\u5b9f\\u88c5\\u306f\\u518d\\u5229\\u7528\\u3067\\u304d\\u3001\\u7c21\\u5358\\u306b\\u30c6\\u30b9\\u30c8\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#defer-47\",\"title\":\"defer \\u5f15\\u6570\\u3068\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u304c\\u3069\\u306e\\u3088\\u3046\\u306b\\u8a55\\u4fa1\\u3055\\u308c\\u308b\\u304b\\u3092\\u77e5\\u3089\\u306a\\u3044\\uff08\\u5f15\\u6570\\u306e\\u8a55\\u4fa1\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u30fc\\u3001\\u304a\\u3088\\u3073\\u5024\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\uff09 (#47)\",\"text\":\"\\u8981\\u7d04 \\u30dd\\u30a4\\u30f3\\u30bf\\u3092 defer \\u95a2\\u6570\\u306b\\u6e21\\u3059\\u3053\\u3068\\u3068\\u3001\\u547c\\u3073\\u51fa\\u3057\\u3092\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u5185\\u306b\\u30e9\\u30c3\\u30d7\\u3059\\u308b\\u3053\\u3068\\u304c\\u3001\\u5f15\\u6570\\u3068\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306e\\u5373\\u6642\\u8a55\\u4fa1\\u3092\\u514b\\u670d\\u3059\\u308b\\u305f\\u3081\\u306b\\u5b9f\\u73fe\\u53ef\\u80fd\\u306a\\u89e3\\u6c7a\\u7b56\\u3067\\u3059\\u3002
defer \\u95a2\\u6570\\u3067\\u306f\\u3001\\u5f15\\u6570\\u306f\\u3001\\u4e0a\\u4f4d\\u30d6\\u30ed\\u30c3\\u30af\\u306e\\u95a2\\u6570\\u304c\\u623b\\u3063\\u3066\\u304b\\u3089\\u3067\\u306f\\u306a\\u304f\\u3001\\u3059\\u3050\\u306b\\u8a55\\u4fa1\\u3055\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u3067\\u306f\\u3001\\u5e38\\u306b\\u540c\\u3058\\u30b9\\u30c6\\u30fc\\u30bf\\u30b9\\u2015\\u2015\\u7a7a\\u306e\\u6587\\u5b57\\u5217\\u2015\\u2015\\u3067 notify \\u3068 incrementCounter \\u3092\\u547c\\u3073\\u51fa\\u3057\\u307e\\u3059\\u3002
const (\\n StatusSuccess = \\\"success\\\"\\n StatusErrorFoo = \\\"error_foo\\\"\\n StatusErrorBar = \\\"error_bar\\\"\\n)\\n\\nfunc f() error {\\n var status string\\n defer notify(status)\\n defer incrementCounter(status)\\n\\n if err := foo(); err != nil {\\n status = StatusErrorFoo\\n return err\\n }\\n\\n if err := bar(); err != nil {\\n status = StatusErrorBar\\n return err\\n }\\n\\n status = StatusSuccess\\n return nil\\n}\\n\\u305f\\u3057\\u304b\\u306b\\u3001notify(status) \\u3068 incrementCounter(status) \\u3092 defer \\u95a2\\u6570\\u3068\\u3057\\u3066\\u547c\\u3073\\u51fa\\u3057\\u3066\\u3044\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001Go\\u8a00\\u8a9e\\u306f\\u3001defer \\u3092\\u4f7f\\u7528\\u3057\\u305f\\u6bb5\\u968e\\u3067 f \\u304c\\u30b9\\u30c6\\u30fc\\u30bf\\u30b9\\u306e\\u73fe\\u5728\\u306e\\u5024\\u3092\\u8fd4\\u3059\\u3068\\u3001\\u3053\\u308c\\u3089\\u306e\\u547c\\u3073\\u51fa\\u3057\\u306e\\u5b9f\\u884c\\u3092\\u9045\\u3089\\u305b\\u3001\\u7a7a\\u306e\\u6587\\u5b57\\u5217\\u3092\\u6e21\\u3057\\u307e\\u3059\\u3002
defer \\u3092\\u4f7f\\u3044\\u7d9a\\u3051\\u305f\\u3044\\u5834\\u5408\\u306e\\u4e3b\\u306a\\u65b9\\u6cd5\\u306f 2 \\u3064\\u3042\\u308a\\u307e\\u3059\\u3002
\\u6700\\u521d\\u306e\\u89e3\\u6c7a\\u7b56\\u306f\\u6587\\u5b57\\u5217\\u30dd\\u30a4\\u30f3\\u30bf\\u3092\\u6e21\\u3059\\u3053\\u3068\\u3067\\u3059\\u3002
func f() error {\\n var status string\\n defer notify(&status) \\n defer incrementCounter(&status)\\n\\n // \\u95a2\\u6570\\u306e\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u90e8\\u5206\\u306f\\u5909\\u66f4\\u306a\\u3057\\n}\\ndefer \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u5f15\\u6570\\uff08\\u3053\\u3053\\u3067\\u306f\\u30b9\\u30c6\\u30fc\\u30bf\\u30b9\\u306e\\u30a2\\u30c9\\u30ec\\u30b9\\uff09\\u304c\\u3059\\u3050\\u306b\\u8a55\\u4fa1\\u3055\\u308c\\u307e\\u3059\\u3002\\u30b9\\u30c6\\u30fc\\u30bf\\u30b9\\u81ea\\u4f53\\u306f\\u95a2\\u6570\\u5168\\u4f53\\u3067\\u5909\\u66f4\\u3055\\u308c\\u307e\\u3059\\u304c\\u3001\\u305d\\u306e\\u30a2\\u30c9\\u30ec\\u30b9\\u306f\\u5272\\u308a\\u5f53\\u3066\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\u4e00\\u5b9a\\u306e\\u307e\\u307e\\u3067\\u3059\\u3002\\u3088\\u3063\\u3066\\u3001notify \\u307e\\u305f\\u306f incrementCounter \\u304c\\u6587\\u5b57\\u5217\\u30dd\\u30a4\\u30f3\\u30bf\\u306b\\u3088\\u3063\\u3066\\u53c2\\u7167\\u3055\\u308c\\u308b\\u5024\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u671f\\u5f85\\u3069\\u304a\\u308a\\u306b\\u52d5\\u4f5c\\u3057\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u3053\\u306e\\u89e3\\u6c7a\\u7b56\\u3067\\u306f 2 \\u3064\\u306e\\u95a2\\u6570\\u306e\\u30b7\\u30b0\\u30cd\\u30c1\\u30e3\\u3092\\u5909\\u66f4\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u3001\\u305d\\u308c\\u304c\\u5e38\\u306b\\u53ef\\u80fd\\u3067\\u3042\\u308b\\u3068\\u306f\\u9650\\u308a\\u307e\\u305b\\u3093\\u3002
\\u5225\\u306e\\u89e3\\u6c7a\\u7b56\\u304c\\u3042\\u308a\\u307e\\u3059\\u2015\\u2015\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\uff08\\u672c\\u4f53\\u306e\\u5916\\u90e8\\u304b\\u3089\\u5909\\u6570\\u3092\\u53c2\\u7167\\u3059\\u308b\\u533f\\u540d\\u95a2\\u6570\\u5024\\uff09\\u3092 defer \\u6587\\u3068\\u3057\\u3066\\u547c\\u3073\\u51fa\\u3059\\u3053\\u3068\\u3067\\u3059\\u3002
func f() error {\\n var status string\\n defer func() {\\n notify(status)\\n incrementCounter(status)\\n }()\\n\\n // \\u95a2\\u6570\\u306e\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u90e8\\u5206\\u306f\\u5909\\u66f4\\u306a\\u3057\\n}\\n\\u3053\\u3053\\u3067\\u306f\\u3001notify \\u3068 incrementCounter \\u306e\\u4e21\\u65b9\\u306e\\u547c\\u3073\\u51fa\\u3057\\u3092\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u5185\\u306b\\u30e9\\u30c3\\u30d7\\u3057\\u307e\\u3059\\u3002\\u3053\\u306e\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u306f\\u3001\\u672c\\u4f53\\u306e\\u5916\\u90e8\\u304b\\u3089\\u30b9\\u30c6\\u30fc\\u30bf\\u30b9\\u5909\\u6570\\u3092\\u53c2\\u7167\\u3057\\u307e\\u3059\\u3002\\u3086\\u3048\\u306b\\u3001status \\u306f\\u3001defer \\u3092\\u547c\\u3073\\u51fa\\u3057\\u305f\\u3068\\u304d\\u3067\\u306f\\u306a\\u304f\\u3001\\u30af\\u30ed\\u30fc\\u30b8\\u30e3\\u304c\\u5b9f\\u884c\\u3055\\u308c\\u305f\\u3068\\u304d\\u306b\\u8a55\\u4fa1\\u3055\\u308c\\u307e\\u3059\\u3002\\u3053\\u306e\\u89e3\\u6c7a\\u7b56\\u306f\\u6b63\\u3057\\u304f\\u6a5f\\u80fd\\u3059\\u308b\\u4e0a\\u306b\\u3001\\u30b7\\u30b0\\u30cd\\u30c1\\u30e3\\u3092\\u5909\\u66f4\\u3059\\u308b\\u305f\\u3081\\u306b notify \\u3084 incrementCounter \\u3092\\u5fc5\\u8981\\u3068\\u3057\\u307e\\u305b\\u3093\\u3002
\\u3053\\u306e\\u52d5\\u4f5c\\u306f\\u30e1\\u30bd\\u30c3\\u30c9\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306b\\u3082\\u9069\\u7528\\u3055\\u308c\\u308b\\u3053\\u3068\\u306b\\u3082\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u30ec\\u30b7\\u30fc\\u30d0\\u30fc\\u306f\\u3059\\u3050\\u306b\\u8a55\\u4fa1\\u3055\\u308c\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_8\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\",\"text\":\"\"},{\"location\":\"ja/#48\",\"title\":\"\\u30d1\\u30cb\\u30c3\\u30af (#48)\",\"text\":\"\\u8981\\u7d04 panic \\u306e\\u4f7f\\u7528\\u306f\\u3001Go\\u8a00\\u8a9e\\u3067\\u30a8\\u30e9\\u30fc\\u306b\\u5bfe\\u51e6\\u3059\\u308b\\u305f\\u3081\\u306e\\u624b\\u6bb5\\u3067\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u3053\\u308c\\u306f\\u56de\\u5fa9\\u4e0d\\u80fd\\u306a\\u72b6\\u6cc1\\u3067\\u306e\\u307f\\u4f7f\\u7528\\u3059\\u308b\\u3088\\u3046\\u306b\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30d2\\u30e5\\u30fc\\u30de\\u30f3\\u30a8\\u30e9\\u30fc\\u3092\\u901a\\u77e5\\u3059\\u308b\\u5834\\u5408\\u3084\\u3001\\u5fc5\\u9808\\u306e\\u4f9d\\u5b58\\u95a2\\u4fc2\\u306e\\u8aad\\u307f\\u8fbc\\u307f\\u306b\\u5931\\u6557\\u3057\\u305f\\u5834\\u5408\\u306a\\u3069\\u3067\\u3059\\u3002
Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001panic \\u306f\\u901a\\u5e38\\u306e\\u6d41\\u308c\\u3092\\u505c\\u6b62\\u3059\\u308b\\u7d44\\u307f\\u8fbc\\u307f\\u95a2\\u6570\\u3067\\u3059\\u3002
func main() {\\n fmt.Println(\\\"a\\\")\\n panic(\\\"foo\\\")\\n fmt.Println(\\\"b\\\")\\n}\\n\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f a \\u3092\\u51fa\\u529b\\u3057\\u3001b \\u3092\\u51fa\\u529b\\u3059\\u308b\\u524d\\u306b\\u505c\\u6b62\\u3057\\u307e\\u3059\\u3002
a\\npanic: foo\\n\\ngoroutine 1 [running]:\\nmain.main()\\n main.go:7 +0xb3\\npanic \\u306e\\u4f7f\\u7528\\u306f\\u614e\\u91cd\\u306b\\u3059\\u3079\\u304d\\u3067\\u3059\\u3002\\u4ee3\\u8868\\u7684\\u306a\\u30b1\\u30fc\\u30b9\\u304c 2 \\u3064\\u3042\\u308a\\u30011 \\u3064\\u306f\\u30d2\\u30e5\\u30fc\\u30de\\u30f3\\u30a8\\u30e9\\u30fc\\u3092\\u901a\\u77e5\\u3059\\u308b\\u5834\\u5408\\uff08\\u4f8b: sql.Register\\u30c9\\u30e9\\u30a4\\u30d0\\u30fc\\u304c nil \\u307e\\u305f\\u306f\\u65e2\\u306b\\u767b\\u9332\\u3055\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u306b panic \\u3092\\u8d77\\u3053\\u3057\\u307e\\u3059\\uff09\\u3001\\u3082\\u3046 1 \\u3064\\u306f\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u5fc5\\u9808\\u306e\\u4f9d\\u5b58\\u95a2\\u4fc2\\u306e\\u751f\\u6210\\u306b\\u5931\\u6557\\u3057\\u305f\\u5834\\u5408\\u3067\\u3059\\u3002\\u7d50\\u679c\\u3068\\u3057\\u3066\\u3001\\u4f8b\\u5916\\u7684\\u306b\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u505c\\u6b62\\u3057\\u307e\\u3059\\u3002\\u305d\\u308c\\u4ee5\\u5916\\u306e\\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u306b\\u304a\\u3044\\u3066\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u306f\\u3001\\u6700\\u5f8c\\u306e\\u623b\\u308a\\u5f15\\u6570\\u3068\\u3057\\u3066\\u9069\\u5207\\u306a\\u30a8\\u30e9\\u30fc\\u578b\\u3092\\u8fd4\\u3059\\u95a2\\u6570\\u3092\\u901a\\u3058\\u3066\\u884c\\u3046\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#49\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u3092\\u30e9\\u30c3\\u30d7\\u3059\\u3079\\u304d\\u3068\\u304d\\u3092\\u77e5\\u3089\\u306a\\u3044 (#49)\",\"text\":\"\\u8981\\u7d04 \\u30a8\\u30e9\\u30fc\\u3092\\u30e9\\u30c3\\u30d7\\u3059\\u308b\\u3068\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u30de\\u30fc\\u30af\\u3057\\u305f\\u308a\\u3001\\u8ffd\\u52a0\\u306e\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u63d0\\u4f9b\\u3057\\u305f\\u308a\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u306b\\u3088\\u308a\\u3001\\u547c\\u3073\\u51fa\\u3057\\u5143\\u304c\\u30bd\\u30fc\\u30b9\\u30a8\\u30e9\\u30fc\\u3092\\u5229\\u7528\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308b\\u305f\\u3081\\u3001\\u6f5c\\u5728\\u7684\\u306a\\u7d50\\u5408\\u304c\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002\\u305d\\u308c\\u3092\\u907f\\u3051\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3092\\u4f7f\\u7528\\u3057\\u306a\\u3044\\u3067\\u304f\\u3060\\u3055\\u3044\\u3002
Go 1.13 \\u4ee5\\u964d\\u3001%w \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3092\\u4f7f\\u7528\\u3059\\u308c\\u3070\\u7c21\\u5358\\u306b\\u30a8\\u30e9\\u30fc\\u3092\\u30e9\\u30c3\\u30d7\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308a\\u307e\\u3057\\u305f\\u3002\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3068\\u306f\\u3001\\u30bd\\u30fc\\u30b9\\u30a8\\u30e9\\u30fc\\u3082\\u4f7f\\u7528\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3059\\u308b\\u30e9\\u30c3\\u30d1\\u30fc\\u30b3\\u30f3\\u30c6\\u30ca\\u5185\\u3067\\u30a8\\u30e9\\u30fc\\u3092\\u30e9\\u30c3\\u30d7\\u307e\\u305f\\u306f\\u30d1\\u30c3\\u30af\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u4e00\\u822c\\u306b\\u3001\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u306e\\u4e3b\\u306a\\u4f7f\\u7528\\u4f8b\\u306f\\u6b21\\u306e 2 \\u3064\\u3067\\u3059\\u3002
\\u30a8\\u30e9\\u30fc\\u306b\\u3055\\u3089\\u306b\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u52a0\\u3048\\u308b \\u30a8\\u30e9\\u30fc\\u3092\\u7279\\u5b9a\\u306e\\u30a8\\u30e9\\u30fc\\u3068\\u3057\\u3066\\u30de\\u30fc\\u30af\\u3059\\u308b \\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3059\\u308b\\u3068\\u304d\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u30e9\\u30c3\\u30d7\\u3059\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u6c7a\\u5b9a\\u3067\\u304d\\u307e\\u3059\\u3002\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3068\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u306b\\u3055\\u3089\\u306b\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u8ffd\\u52a0\\u3057\\u305f\\u308a\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u7279\\u5b9a\\u306e\\u30bf\\u30a4\\u30d7\\u3068\\u3057\\u3066\\u30de\\u30fc\\u30af\\u3057\\u305f\\u308a\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u30a8\\u30e9\\u30fc\\u3092\\u30de\\u30fc\\u30af\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001\\u72ec\\u81ea\\u306e\\u30a8\\u30e9\\u30fc\\u578b\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3067\\u3059\\u304c\\u3001\\u65b0\\u305f\\u306b\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u52a0\\u3048\\u305f\\u3044\\u3060\\u3051\\u306e\\u5834\\u5408\\u306f\\u3001\\u65b0\\u3057\\u3044\\u30a8\\u30e9\\u30fc\\u578b\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u306a\\u3044\\u305f\\u3081\\u3001%w \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3092\\u6307\\u5b9a\\u3057\\u3066 fmt.Errorf \\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u305f\\u3060\\u3057\\u3001\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u306b\\u3088\\u308a\\u3001\\u547c\\u3073\\u51fa\\u3057\\u5143\\u304c\\u30bd\\u30fc\\u30b9\\u30a8\\u30e9\\u30fc\\u3092\\u5229\\u7528\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308b\\u305f\\u3081\\u3001\\u6f5c\\u5728\\u7684\\u306a\\u7d50\\u5408\\u304c\\u751f\\u3058\\u307e\\u3059\\u3002\\u305d\\u308c\\u3092\\u907f\\u3051\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u306e\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3067\\u306f\\u306a\\u304f\\u3001\\u30a8\\u30e9\\u30fc\\u306e\\u5909\\u63db\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001%v \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3092\\u6307\\u5b9a\\u3057\\u305f fmt.Errorf \\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#50\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u578b\\u306e\\u4e0d\\u6b63\\u306a\\u6bd4\\u8f03 (#50)\",\"text\":\"\\u8981\\u7d04 Go 1.13 \\u306e\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3092 %w \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3068 fmt.Errorf \\u3067\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u578b\\u306b\\u5bfe\\u3059\\u308b\\u30a8\\u30e9\\u30fc\\u306e\\u6bd4\\u8f03\\u306f errors.As \\u3092\\u901a\\u3058\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u3046\\u3067\\u306a\\u3051\\u308c\\u3070\\u3001\\u8fd4\\u3055\\u308c\\u305f\\u30a8\\u30e9\\u30fc\\u304c\\u30e9\\u30c3\\u30d7\\u3055\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u3001\\u8a55\\u4fa1\\u306b\\u5931\\u6557\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#51\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u5024\\u306e\\u4e0d\\u6b63\\u306a\\u6bd4\\u8f03 (#51)\",\"text\":\"\\u8981\\u7d04 Go 1.13 \\u306e\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u3092 %w \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3068 fmt.Errorf \\u3067\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u30a8\\u30e9\\u30fc\\u3068\\u5024\\u306e\\u6bd4\\u8f03\\u306f errors.As \\u3092\\u901a\\u3058\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u3046\\u3067\\u306a\\u3051\\u308c\\u3070\\u3001\\u8fd4\\u3055\\u308c\\u305f\\u30a8\\u30e9\\u30fc\\u304c\\u30e9\\u30c3\\u30d7\\u3055\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u3001\\u8a55\\u4fa1\\u306b\\u5931\\u6557\\u3057\\u307e\\u3059\\u3002
\\u30bb\\u30f3\\u30c1\\u30cd\\u30eb\\u30a8\\u30e9\\u30fc\\u306f\\u30b0\\u30ed\\u30fc\\u30d0\\u30eb\\u5909\\u6570\\u3068\\u3057\\u3066\\u5b9a\\u7fa9\\u3055\\u308c\\u305f\\u30a8\\u30e9\\u30fc\\u306e\\u3053\\u3068\\u3067\\u3059\\u3002
import \\\"errors\\\"\\n\\nvar ErrFoo = errors.New(\\\"foo\\\")\\nErr \\u3067\\u59cb\\u3081\\u3001\\u305d\\u306e\\u5f8c\\u306b\\u30a8\\u30e9\\u30fc\\u578b\\u3092\\u7d9a\\u3051\\u307e\\u3059\\u3002\\u3053\\u3053\\u3067\\u306f ErrFoo \\u3067\\u3059\\u3002\\u30bb\\u30f3\\u30c1\\u30cd\\u30eb\\u30a8\\u30e9\\u30fc\\u306f\\u3001\\u4e88\\u671f\\u3055\\u308c\\u308b \\u30a8\\u30e9\\u30fc\\u3001\\u3064\\u307e\\u308a\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c\\u78ba\\u8a8d\\u3059\\u308b\\u3053\\u3068\\u3092\\u671f\\u5f85\\u3059\\u308b\\u30a8\\u30e9\\u30fc\\u3092\\u4f1d\\u3048\\u307e\\u3059\\u3002\\u4e00\\u822c\\u7684\\u306a\\u30ac\\u30a4\\u30c9\\u30e9\\u30a4\\u30f3\\u3068\\u3057\\u3066
\\u4e88\\u671f\\u3055\\u308c\\u308b\\u30a8\\u30e9\\u30fc\\u306f\\u30a8\\u30e9\\u30fc\\u5024\\uff08\\u30bb\\u30f3\\u30c1\\u30cd\\u30eb\\u30a8\\u30e9\\u30fc\\uff09\\u3068\\u3057\\u3066\\u8a2d\\u8a08\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\uff1a var ErrFoo =errors.New(\\\"foo\\\")\\u3002 \\u4e88\\u671f\\u3057\\u306a\\u3044\\u30a8\\u30e9\\u30fc\\u306f\\u30a8\\u30e9\\u30fc\\u578b\\u3068\\u3057\\u3066\\u8a2d\\u8a08\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\uff1a BarError \\u306f error \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u5b9f\\u88c5\\u3057\\u305f\\u4e0a\\u3067 type BarError struct { ... }\\u3002 \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3067 %w \\u30c7\\u30a3\\u30ec\\u30af\\u30c6\\u30a3\\u30d6\\u3068 fmt.Errorf \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d7\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u7279\\u5b9a\\u306e\\u5024\\u306b\\u5bfe\\u3059\\u308b\\u30a8\\u30e9\\u30fc\\u306e\\u30c1\\u30a7\\u30c3\\u30af\\u306f == \\u306e\\u4ee3\\u308f\\u308a\\u306b errors.Is \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u884c\\u3044\\u307e\\u3057\\u3087\\u3046\\u3002\\u305d\\u308c\\u306b\\u3088\\u3063\\u3066\\u3001\\u30bb\\u30f3\\u30c1\\u30cd\\u30eb\\u30a8\\u30e9\\u30fc\\u304c\\u30e9\\u30c3\\u30d7\\u3055\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u3067\\u3082\\u3001errors.Is \\u306f\\u305d\\u308c\\u3092\\u518d\\u5e30\\u7684\\u306b\\u30a2\\u30f3\\u30e9\\u30c3\\u30d7\\u3057\\u3001\\u30c1\\u30a7\\u30fc\\u30f3\\u5185\\u306e\\u5404\\u30a8\\u30e9\\u30fc\\u3092\\u63d0\\u4f9b\\u3055\\u308c\\u305f\\u5024\\u3068\\u6bd4\\u8f03\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#2-52\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u306e 2 \\u56de\\u51e6\\u7406 (#52)\",\"text\":\"\\u8981\\u7d04 \\u307b\\u3068\\u3093\\u3069\\u306e\\u5834\\u5408\\u3001\\u30a8\\u30e9\\u30fc\\u306f 1 \\u56de\\u3067\\u51e6\\u7406\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u30a8\\u30e9\\u30fc\\u3092\\u30ed\\u30b0\\u306b\\u8a18\\u9332\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u3059\\u306a\\u308f\\u3061\\u3001\\u30ed\\u30b0\\u306b\\u8a18\\u9332\\u3059\\u308b\\u304b\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u304b\\u3092\\u9078\\u629e\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u591a\\u304f\\u306e\\u5834\\u5408\\u3001\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u306b\\u8ffd\\u52a0\\u306e\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u63d0\\u4f9b\\u3057\\u3001\\u30bd\\u30fc\\u30b9\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u3053\\u3068\\u304c\\u3067\\u304d\\u308b\\u305f\\u3081\\u3001\\u89e3\\u6c7a\\u7b56\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u30a8\\u30e9\\u30fc\\u3092\\u8907\\u6570\\u56de\\u51e6\\u7406\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u7279\\u306bGo\\u8a00\\u8a9e\\u306b\\u9650\\u3089\\u305a\\u3001\\u958b\\u767a\\u8005\\u304c\\u983b\\u7e41\\u306b\\u3084\\u3063\\u3066\\u3057\\u307e\\u3046\\u30df\\u30b9\\u3067\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u540c\\u3058\\u30a8\\u30e9\\u30fc\\u304c\\u8907\\u6570\\u56de\\u30ed\\u30b0\\u306b\\u8a18\\u9332\\u3055\\u308c\\u3001\\u30c7\\u30d0\\u30c3\\u30b0\\u304c\\u56f0\\u96e3\\u306b\\u306a\\u308b\\u72b6\\u6cc1\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u306f 1 \\u5ea6\\u3067\\u6e08\\u307e\\u3059\\u3079\\u304d\\u3060\\u3068\\u3044\\u3046\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304d\\u307e\\u3057\\u3087\\u3046\\u3002\\u30a8\\u30e9\\u30fc\\u3092\\u30ed\\u30b0\\u306b\\u8a18\\u9332\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u3064\\u307e\\u308a\\u3001\\u884c\\u3046\\u3079\\u304d\\u306f\\u3001\\u30ed\\u30b0\\u306b\\u8a18\\u9332\\u3059\\u308b\\u304b\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u304b\\u306e\\u3069\\u3061\\u3089\\u304b\\u3060\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u30b3\\u30fc\\u30c9\\u304c\\u7c21\\u7d20\\u5316\\u3055\\u308c\\u3001\\u30a8\\u30e9\\u30fc\\u306e\\u72b6\\u6cc1\\u306b\\u3064\\u3044\\u3066\\u3088\\u308a\\u9069\\u5207\\u306a\\u6d1e\\u5bdf\\u304c\\u5f97\\u3089\\u308c\\u307e\\u3059\\u3002\\u30a8\\u30e9\\u30fc\\u30e9\\u30c3\\u30d4\\u30f3\\u30b0\\u306f\\u3001\\u30bd\\u30fc\\u30b9\\u30a8\\u30e9\\u30fc\\u3092\\u4f1d\\u3048\\u3001\\u30a8\\u30e9\\u30fc\\u306b\\u30b3\\u30f3\\u30c6\\u30ad\\u30b9\\u30c8\\u3092\\u8ffd\\u52a0\\u3067\\u304d\\u308b\\u305f\\u3081\\u3001\\u6700\\u3082\\u4f7f\\u3044\\u52dd\\u624b\\u306e\\u826f\\u3044\\u624b\\u6bb5\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#53\",\"title\":\"\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u3092\\u3057\\u306a\\u3044 (#53)\",\"text\":\"\\u8981\\u7d04 \\u95a2\\u6570\\u547c\\u3073\\u51fa\\u3057\\u4e2d\\u3067\\u3042\\u3063\\u3066\\u3082\\u3001defer \\u95a2\\u6570\\u5185\\u3067\\u3042\\u3063\\u3066\\u3082\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u7121\\u8996\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u30d6\\u30e9\\u30f3\\u30af\\u8b58\\u5225\\u5b50\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u660e\\u78ba\\u306b\\u884c\\u3046\\u3079\\u304d\\u3067\\u3059\\u3002\\u305d\\u3046\\u3057\\u306a\\u3044\\u3068\\u3001\\u5c06\\u6765\\u306e\\u8aad\\u307f\\u624b\\u304c\\u305d\\u308c\\u304c\\u610f\\u56f3\\u7684\\u3060\\u3063\\u305f\\u306e\\u304b\\u3001\\u305d\\u308c\\u3068\\u3082\\u30df\\u30b9\\u3060\\u3063\\u305f\\u306e\\u304b\\u56f0\\u60d1\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#defer-54\",\"title\":\"defer \\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3057\\u306a\\u3044 (#54)\",\"text\":\"\\u8981\\u7d04 \\u591a\\u304f\\u306e\\u5834\\u5408\\u3001defer \\u95a2\\u6570\\u306b\\u3088\\u3063\\u3066\\u8fd4\\u3055\\u308c\\u308b\\u30a8\\u30e9\\u30fc\\u3092\\u7121\\u8996\\u3059\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u72b6\\u6cc1\\u306b\\u5fdc\\u3058\\u3066\\u3001\\u76f4\\u63a5\\u51e6\\u7406\\u3059\\u308b\\u304b\\u3001\\u547c\\u3073\\u51fa\\u3057\\u5143\\u306b\\u4f1d\\u3048\\u307e\\u3057\\u3087\\u3046\\u3002\\u3053\\u308c\\u3092\\u7121\\u8996\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001\\u30d6\\u30e9\\u30f3\\u30af\\u8b58\\u5225\\u5b50\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u6b21\\u306e\\u30b3\\u30fc\\u30c9\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002
func f() {\\n // ...\\n notify() // \\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u306f\\u7701\\u7565\\u3055\\u308c\\u3066\\u3044\\u307e\\u3059\\n}\\n\\nfunc notify() error {\\n // ...\\n}\\n\\u4fdd\\u5b88\\u6027\\u306e\\u89b3\\u70b9\\u304b\\u3089\\u3001\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306f\\u3044\\u304f\\u3064\\u304b\\u306e\\u554f\\u984c\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3042\\u308b\\u4eba\\u304c\\u3053\\u308c\\u3092\\u8aad\\u3080\\u3053\\u3068\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3059\\u3002\\u8aad\\u307f\\u624b\\u306f\\u3001notify \\u304c\\u30a8\\u30e9\\u30fc\\u3092\\u8fd4\\u3059\\u306b\\u3082\\u304b\\u304b\\u308f\\u3089\\u305a\\u3001\\u305d\\u306e\\u30a8\\u30e9\\u30fc\\u304c\\u89aa\\u95a2\\u6570\\u306b\\u3088\\u3063\\u3066\\u51e6\\u7406\\u3055\\u308c\\u306a\\u3044\\u3053\\u3068\\u306b\\u6c17\\u3065\\u304d\\u307e\\u3059\\u3002\\u30a8\\u30e9\\u30fc\\u51e6\\u7406\\u304c\\u610f\\u56f3\\u7684\\u3067\\u3042\\u308b\\u304b\\u3069\\u3046\\u304b\\u3092\\u679c\\u305f\\u3057\\u3066\\u63a8\\u6e2c\\u3067\\u304d\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u4ee5\\u524d\\u306e\\u958b\\u767a\\u8005\\u304c\\u305d\\u308c\\u3092\\u51e6\\u7406\\u3059\\u308b\\u306e\\u3092\\u5fd8\\u308c\\u305f\\u306e\\u304b\\u3001\\u305d\\u308c\\u3068\\u3082\\u610f\\u56f3\\u7684\\u306b\\u51e6\\u7406\\u3057\\u305f\\u306e\\u304b\\u3092\\u77e5\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002
\\u3053\\u308c\\u3089\\u306e\\u7406\\u7531\\u306b\\u3088\\u308a\\u3001\\u30a8\\u30e9\\u30fc\\u3092\\u7121\\u8996\\u3057\\u305f\\u3044\\u5834\\u5408\\u3001\\u30d6\\u30e9\\u30f3\\u30af\\u8b58\\u5225\\u5b50\\uff08 _ \\uff09\\u3092\\u4f7f\\u3046\\u307b\\u304b\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
_ = notify\\n\\u30b3\\u30f3\\u30d1\\u30a4\\u30eb\\u3068\\u5b9f\\u884c\\u6642\\u9593\\u306e\\u70b9\\u3067\\u306f\\u3001\\u3053\\u306e\\u65b9\\u6cd5\\u306f\\u6700\\u521d\\u306e\\u30b3\\u30fc\\u30c9\\u90e8\\u5206\\u3068\\u6bd4\\u3079\\u3066\\u4f55\\u3082\\u5909\\u308f\\u308a\\u307e\\u305b\\u3093\\u3002\\u3057\\u304b\\u3057\\u3001\\u3053\\u306e\\u65b0\\u3057\\u3044\\u30d0\\u30fc\\u30b8\\u30e7\\u30f3\\u3067\\u306f\\u3001\\u79c1\\u305f\\u3061\\u304c\\u30a8\\u30e9\\u30fc\\u306b\\u95a2\\u5fc3\\u304c\\u306a\\u3044\\u3053\\u3068\\u3092\\u660e\\u3089\\u304b\\u306b\\u3057\\u3066\\u3044\\u307e\\u3059\\u3002\\u307e\\u305f\\u3001\\u30a8\\u30e9\\u30fc\\u304c\\u7121\\u8996\\u3055\\u308c\\u308b\\u7406\\u7531\\u3092\\u793a\\u3059\\u30b3\\u30e1\\u30f3\\u30c8\\u3092\\u8ffd\\u52a0\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002
// \\u6700\\u5927\\u3067\\u3082 1 \\u56de\\u306e\\u4f1d\\u9054 \\n// \\u305d\\u308c\\u3086\\u3048\\u3001\\u30a8\\u30e9\\u30fc\\u304c\\u767a\\u751f\\u3057\\u305f\\u5834\\u5408\\u306b\\u305d\\u308c\\u3089\\u306e\\u4e00\\u90e8\\u304c\\u5931\\u308f\\u308c\\u308b\\u3053\\u3068\\u306f\\u8a31\\u5bb9\\u3055\\u308c\\u307e\\u3059\\n_ = notify()\\n\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_9\",\"title\":\"\\u4e26\\u884c\\u51e6\\u7406\\uff1a\\u57fa\\u790e\",\"text\":\"\"},{\"location\":\"ja/#55\",\"title\":\"\\u4e26\\u884c\\u51e6\\u7406\\u3068\\u4e26\\u5217\\u51e6\\u7406\\u306e\\u6df7\\u540c (#55)\",\"text\":\"\\u8981\\u7d04 \\u4e26\\u884c\\u51e6\\u7406\\u3068\\u4e26\\u5217\\u51e6\\u7406\\u306e\\u57fa\\u672c\\u7684\\u306a\\u9055\\u3044\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001 Go \\u958b\\u767a\\u8005\\u306b\\u3068\\u3063\\u3066\\u5fc5\\u9808\\u3067\\u3059\\u3002\\u4e26\\u884c\\u51e6\\u7406\\u306f\\u69cb\\u9020\\u306b\\u95a2\\u3059\\u308b\\u3082\\u306e\\u3067\\u3059\\u304c\\u3001\\u4e26\\u5217\\u51e6\\u7406\\u306f\\u5b9f\\u884c\\u306b\\u95a2\\u3059\\u308b\\u3082\\u306e\\u3067\\u3059\\u3002
\\u4e26\\u884c\\u51e6\\u7406\\u3068\\u4e26\\u5217\\u51e6\\u7406\\u306f\\u540c\\u3058\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u4e26\\u884c\\u51e6\\u7406\\u306f\\u69cb\\u9020\\u306b\\u95a2\\u3059\\u308b\\u3082\\u306e\\u3067\\u3059\\u3002\\u5225\\u3005\\u306e\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u53d6\\u308a\\u7d44\\u3080\\u3053\\u3068\\u304c\\u3067\\u304d\\u308b\\u3055\\u307e\\u3056\\u307e\\u306a\\u6bb5\\u968e\\u3092\\u5c0e\\u5165\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u9010\\u6b21\\u51e6\\u7406\\u3092\\u4e26\\u884c\\u51e6\\u7406\\u306b\\u5909\\u66f4\\u3067\\u304d\\u307e\\u3059\\u3002 \\u4e26\\u5217\\u51e6\\u7406\\u306f\\u5b9f\\u884c\\u306b\\u95a2\\u3059\\u308b\\u3082\\u306e\\u3067\\u3059\\u3002\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u3055\\u3089\\u306b\\u8ffd\\u52a0\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u6bb5\\u968e\\u30ec\\u30d9\\u30eb\\u3067\\u4e26\\u5217\\u51e6\\u7406\\u3092\\u4f7f\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002 \\u307e\\u3068\\u3081\\u308b\\u3068\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306f\\u3001\\u4e26\\u5217\\u5316\\u3067\\u304d\\u308b\\u90e8\\u5206\\u3092\\u3082\\u3064\\u554f\\u984c\\u3092\\u89e3\\u6c7a\\u3059\\u308b\\u305f\\u3081\\u306e\\u69cb\\u9020\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002\\u3059\\u306a\\u308f\\u3061\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306b\\u3088\\u308a\\u4e26\\u5217\\u51e6\\u7406\\u304c\\u53ef\\u80fd \\u306b\\u306a\\u308a\\u307e\\u3059 \\u3002
\"},{\"location\":\"ja/#56\",\"title\":\"\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u307b\\u3046\\u304c\\u5e38\\u306b\\u65e9\\u3044\\u3068\\u8003\\u3048\\u3066\\u3044\\u308b (#56)\",\"text\":\"\\u8981\\u7d04 \\u719f\\u7df4\\u3057\\u305f\\u958b\\u767a\\u8005\\u306b\\u306a\\u308b\\u306b\\u306f\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u9ad8\\u901f\\u3067\\u3042\\u308b\\u3068\\u306f\\u9650\\u3089\\u306a\\u3044\\u3053\\u3068\\u3092\\u8a8d\\u8b58\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u6700\\u5c0f\\u9650\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306e\\u4e26\\u5217\\u51e6\\u7406\\u3092\\u4f34\\u3046\\u89e3\\u6c7a\\u7b56\\u306f\\u3001\\u5fc5\\u305a\\u3057\\u3082\\u9010\\u6b21\\u51e6\\u7406\\u3088\\u308a\\u9ad8\\u901f\\u3067\\u3042\\u308b\\u3068\\u306f\\u9650\\u308a\\u307e\\u305b\\u3093\\u3002\\u9010\\u6b21\\u51e6\\u7406\\u3068\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306f\\u3001\\u4eee\\u5b9a\\u3092\\u691c\\u8a3c\\u3059\\u308b\\u65b9\\u6cd5\\u3067\\u3042\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#57\",\"title\":\"\\u30c1\\u30e3\\u30cd\\u30eb\\u307e\\u305f\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3092\\u3044\\u3064\\u4f7f\\u7528\\u3059\\u308b\\u3079\\u304d\\u304b\\u306b\\u3064\\u3044\\u3066\\u6238\\u60d1\\u3063\\u3066\\u3044\\u308b (#57)\",\"text\":\"\\u8981\\u7d04 \\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u76f8\\u4e92\\u4f5c\\u7528\\u3092\\u8a8d\\u8b58\\u3057\\u3066\\u3044\\u308b\\u3053\\u3068\\u306f\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u3068\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u306e\\u3069\\u3061\\u3089\\u3092\\u9078\\u629e\\u3059\\u308b\\u304b\\u3092\\u6c7a\\u5b9a\\u3059\\u308b\\u3068\\u304d\\u306b\\u3082\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002\\u4e00\\u822c\\u306b\\u3001\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306b\\u306f\\u540c\\u671f\\u304c\\u5fc5\\u8981\\u3067\\u3042\\u308a\\u3001\\u3057\\u305f\\u304c\\u3063\\u3066\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u304c\\u5fc5\\u8981\\u3067\\u3059\\u3002\\u53cd\\u5bfe\\u306b\\u3001\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u901a\\u5e38\\u3001\\u8abf\\u6574\\u3068\\u30aa\\u30fc\\u30b1\\u30b9\\u30c8\\u30ec\\u30fc\\u30b7\\u30e7\\u30f3\\u3001\\u3064\\u307e\\u308a\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u5fc5\\u8981\\u3068\\u3057\\u307e\\u3059\\u3002
\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u554f\\u984c\\u3092\\u8003\\u616e\\u3059\\u308b\\u3068\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u307e\\u305f\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u89e3\\u6c7a\\u7b56\\u3092\\u5b9f\\u88c5\\u3067\\u304d\\u308b\\u304b\\u3069\\u3046\\u304b\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u660e\\u78ba\\u3067\\u306f\\u306a\\u3044\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002Go\\u8a00\\u8a9e\\u306f\\u901a\\u4fe1\\u306b\\u3088\\u308b\\u30e1\\u30e2\\u30ea\\u306e\\u5171\\u6709\\u3092\\u4fc3\\u9032\\u3059\\u308b\\u305f\\u3081\\u3001\\u8d77\\u3053\\u308a\\u3046\\u308b\\u9593\\u9055\\u3044\\u306e\\u3046\\u3061\\u306e\\u4e00\\u3064\\u306f\\u3001\\u30e6\\u30fc\\u30b9\\u30b1\\u30fc\\u30b9\\u306b\\u304b\\u304b\\u308f\\u3089\\u305a\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u4f7f\\u7528\\u3092\\u5e38\\u306b\\u5f37\\u5236\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u3057\\u304b\\u3057\\u306a\\u304c\\u3089\\u30012 \\u3064\\u306e\\u65b9\\u6cd5\\u306f\\u88dc\\u5b8c\\u7684\\u306a\\u3082\\u306e\\u3067\\u3042\\u308b\\u3068\\u898b\\u306a\\u3059\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30c1\\u30e3\\u30cd\\u30eb\\u307e\\u305f\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u306f\\u3069\\u306e\\u3088\\u3046\\u306a\\u5834\\u5408\\u306b\\u4f7f\\u7528\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u6b21\\u306e\\u56f3\\u306e\\u4f8b\\u3092\\u30d0\\u30c3\\u30af\\u30dc\\u30fc\\u30f3\\u3068\\u3057\\u3066\\u4f7f\\u7528\\u3057\\u307e\\u3059\\u3002\\u3053\\u306e\\u4f8b\\u306b\\u306f\\u3001\\u7279\\u5b9a\\u306e\\u95a2\\u4fc2\\u3092\\u6301\\u3064 3 \\u3064\\u306e\\u7570\\u306a\\u308b\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
G1 \\u3068 G2 \\u306f\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3067\\u3059\\u3002\\u30c1\\u30e3\\u30cd\\u30eb\\u304b\\u3089\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u53d7\\u4fe1\\u3057\\u7d9a\\u3051\\u308b\\u540c\\u3058\\u95a2\\u6570\\u3092\\u5b9f\\u884c\\u3059\\u308b 2 \\u3064\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3001\\u3042\\u308b\\u3044\\u306f\\u540c\\u3058 HTTP \\u30cf\\u30f3\\u30c9\\u30e9\\u3092\\u540c\\u6642\\u306b\\u5b9f\\u884c\\u3059\\u308b 2 \\u3064\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002 G1 \\u3068 G3 \\u306f\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3067\\u3042\\u308a\\u3001G2 \\u3068 G3 \\u3082\\u540c\\u69d8\\u3067\\u3059\\u3002\\u3059\\u3079\\u3066\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u5168\\u4f53\\u306e\\u4e26\\u884c\\u69cb\\u9020\\u306e\\u4e00\\u90e8\\u3067\\u3059\\u304c\\u3001G1 \\u3068 G2 \\u304c\\u6700\\u521d\\u306e\\u30b9\\u30c6\\u30c3\\u30d7\\u3092\\u5b9f\\u884c\\u3057\\u3001G3 \\u304c\\u6b21\\u306e\\u30b9\\u30c6\\u30c3\\u30d7\\u3092\\u5b9f\\u884c\\u3057\\u307e\\u3059\\u3002 \\u539f\\u5247\\u3068\\u3057\\u3066\\u3001\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u3001\\u30b9\\u30e9\\u30a4\\u30b9\\u306a\\u3069\\u306e\\u5171\\u6709\\u30ea\\u30bd\\u30fc\\u30b9\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u305f\\u308a\\u5909\\u66f4\\u3057\\u305f\\u308a\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306a\\u3069\\u306b\\u3001_\\u540c\\u671f_\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u540c\\u671f\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3067\\u306f\\u5f37\\u5236\\u3055\\u308c\\u307e\\u3059\\u304c\\u3001\\u3069\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u578b\\u3067\\u3082\\u5f37\\u5236\\u3055\\u308c\\u307e\\u305b\\u3093\\uff08\\u30d0\\u30c3\\u30d5\\u30a1\\u3042\\u308a\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u9664\\u304f\\uff09\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u4e00\\u822c\\u306b\\u3001\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u9593\\u306e\\u540c\\u671f\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3092\\u4ecb\\u3057\\u3066\\u9054\\u6210\\u3055\\u308c\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u4e00\\u65b9\\u3001\\u4e00\\u822c\\u306b\\u3001\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f \\u8abf\\u6574\\u304a\\u3088\\u3073\\u30aa\\u30fc\\u30b1\\u30b9\\u30c8\\u30ec\\u30fc\\u30b7\\u30e7\\u30f3 \\u3092\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001G3 \\u304c G1 \\u3068 G2 \\u306e\\u4e21\\u65b9\\u304b\\u3089\\u306e\\u7d50\\u679c\\u3092\\u96c6\\u7d04\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u3001G1 \\u3068 G2 \\u306f\\u65b0\\u3057\\u3044\\u4e2d\\u9593\\u7d50\\u679c\\u304c\\u5229\\u7528\\u53ef\\u80fd\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092 G3 \\u306b\\u901a\\u77e5\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3053\\u306e\\u8abf\\u6574\\u306f\\u30b3\\u30df\\u30e5\\u30cb\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u7bc4\\u56f2\\u3001\\u3064\\u307e\\u308a\\u30c1\\u30e3\\u30cd\\u30eb\\u306b\\u8a72\\u5f53\\u3057\\u307e\\u3059\\u3002
\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306b\\u95a2\\u3057\\u3066\\u306f\\u3001\\u30ea\\u30bd\\u30fc\\u30b9\\u306e\\u6240\\u6709\\u6a29\\u3092\\u3042\\u308b\\u30b9\\u30c6\\u30c3\\u30d7\\uff08G1 \\u304a\\u3088\\u3073 G2\\uff09\\u304b\\u3089\\u5225\\u306e\\u30b9\\u30c6\\u30c3\\u30d7\\uff08G3\\uff09\\u306b\\u79fb\\u7ba1\\u3057\\u305f\\u3044\\u5834\\u5408\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001G1 \\u3068 G2 \\u306b\\u3088\\u3063\\u3066\\u5171\\u6709\\u30ea\\u30bd\\u30fc\\u30b9\\u304c\\u8c4a\\u304b\\u306b\\u306a\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u3001\\u3042\\u308b\\u6642\\u70b9\\u3067\\u3053\\u306e\\u30b8\\u30e7\\u30d6\\u306f\\u5b8c\\u4e86\\u3057\\u305f\\u3068\\u898b\\u306a\\u3055\\u308c\\u307e\\u3059\\u3002\\u3053\\u3053\\u3067\\u306f\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3001\\u7279\\u5b9a\\u306e\\u30ea\\u30bd\\u30fc\\u30b9\\u306e\\u6e96\\u5099\\u304c\\u3067\\u304d\\u3066\\u3044\\u308b\\u3053\\u3068\\u3092\\u901a\\u77e5\\u3057\\u3001\\u6240\\u6709\\u6a29\\u306e\\u79fb\\u8ee2\\u3092\\u51e6\\u7406\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3068\\u30c1\\u30e3\\u30cd\\u30eb\\u306b\\u306f\\u7570\\u306a\\u308b\\u30bb\\u30de\\u30f3\\u30c6\\u30a3\\u30af\\u30b9\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30b9\\u30c6\\u30fc\\u30c8\\u3092\\u5171\\u6709\\u3057\\u305f\\u3044\\u3068\\u304d\\u3001\\u307e\\u305f\\u306f\\u5171\\u6709\\u30ea\\u30bd\\u30fc\\u30b9\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u305f\\u3044\\u3068\\u304d\\u306f\\u3001\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u306b\\u3088\\u3063\\u3066\\u3053\\u306e\\u30ea\\u30bd\\u30fc\\u30b9\\u3078\\u306e\\u6392\\u4ed6\\u7684\\u30a2\\u30af\\u30bb\\u30b9\\u304c\\u4fdd\\u8a3c\\u3055\\u308c\\u307e\\u3059\\u3002\\u53cd\\u5bfe\\u306b\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u30c7\\u30fc\\u30bf\\u306e\\u6709\\u7121\\uff08chan struct{} \\u306e\\u6709\\u7121\\uff09\\u306b\\u95a2\\u4fc2\\u306a\\u304f\\u30b7\\u30b0\\u30ca\\u30eb\\u3092\\u884c\\u3046\\u4ed5\\u7d44\\u307f\\u3067\\u3059\\u3002\\u8abf\\u6574\\u3084\\u6240\\u6709\\u6a29\\u306e\\u79fb\\u8ee2\\u306f\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u901a\\u3058\\u3066\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u4e26\\u5217\\u304b\\u4e26\\u884c\\u304b\\u3092\\u77e5\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002\\u4e00\\u822c\\u306b\\u3001\\u4e26\\u5217\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306b\\u306f\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u304c\\u5fc5\\u8981\\u3067\\u3001\\u4e26\\u884c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306b\\u306f\\u30c1\\u30e3\\u30cd\\u30eb\\u304c\\u5fc5\\u8981\\u3067\\u3059\\u3002
\"},{\"location\":\"ja/#go-58\",\"title\":\"\\u7af6\\u5408\\u554f\\u984c\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044\\uff08\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3068\\u7af6\\u5408\\u72b6\\u614b\\u3001\\u305d\\u3057\\u3066Go\\u8a00\\u8a9e\\u306e\\u30e1\\u30e2\\u30ea\\u30e2\\u30c7\\u30eb\\uff09 (#58)\",\"text\":\"\\u8981\\u7d04 \\u4e26\\u884c\\u51e6\\u7406\\u306b\\u719f\\u9054\\u3059\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u306f\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3068\\u7af6\\u5408\\u72b6\\u614b\\u304c\\u7570\\u306a\\u308b\\u6982\\u5ff5\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u3082\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306f\\u3001\\u8907\\u6570\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u540c\\u3058\\u30e1\\u30e2\\u30ea\\u4f4d\\u7f6e\\u306b\\u540c\\u6642\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u3001\\u305d\\u306e\\u3046\\u3061\\u306e\\u5c11\\u306a\\u304f\\u3068\\u3082 1 \\u3064\\u304c\\u66f8\\u304d\\u8fbc\\u307f\\u3092\\u884c\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306b\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002\\u4e00\\u65b9\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u304c\\u306a\\u3044\\u3053\\u3068\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u6c7a\\u5b9a\\u7684\\u5b9f\\u884c\\u3092\\u610f\\u5473\\u3059\\u308b\\u308f\\u3051\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u52d5\\u4f5c\\u304c\\u5236\\u5fa1\\u3067\\u304d\\u306a\\u3044\\u30a4\\u30d9\\u30f3\\u30c8\\u306e\\u9806\\u5e8f\\u3084\\u30bf\\u30a4\\u30df\\u30f3\\u30b0\\u306b\\u4f9d\\u5b58\\u3057\\u3066\\u3044\\u308b\\u5834\\u5408\\u3001\\u3053\\u308c\\u306f\\u7af6\\u5408\\u72b6\\u614b\\u3067\\u3059\\u3002
\\u7af6\\u5408\\u554f\\u984c\\u306f\\u3001\\u30d7\\u30ed\\u30b0\\u30e9\\u30de\\u30fc\\u304c\\u76f4\\u9762\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u306e\\u3042\\u308b\\u30d0\\u30b0\\u306e\\u4e2d\\u3067\\u6700\\u3082\\u56f0\\u96e3\\u304b\\u3064\\u6700\\u3082\\u6f5c\\u4f0f\\u6027\\u306e\\u9ad8\\u3044\\u30d0\\u30b0\\u306e 1 \\u3064\\u3068\\u306a\\u308a\\u307e\\u3059\\u3002Go \\u958b\\u767a\\u8005\\u3068\\u3057\\u3066\\u3001\\u79c1\\u305f\\u3061\\u306f\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3068\\u7af6\\u5408\\u72b6\\u614b\\u3001\\u305d\\u308c\\u3089\\u304c\\u53ca\\u307c\\u3057\\u3046\\u308b\\u5f71\\u97ff\\u3001\\u304a\\u3088\\u3073\\u305d\\u308c\\u3089\\u3092\\u56de\\u907f\\u3059\\u308b\\u65b9\\u6cd5\\u306a\\u3069\\u306e\\u91cd\\u8981\\u306a\\u5074\\u9762\\u3092\\u7406\\u89e3\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#_10\",\"title\":\"\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\",\"text\":\"\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306f\\u30012 \\u3064\\u4ee5\\u4e0a\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u540c\\u3058\\u30e1\\u30e2\\u30ea\\u4f4d\\u7f6e\\u306b\\u540c\\u6642\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u3001\\u5c11\\u306a\\u304f\\u3068\\u3082 1 \\u3064\\u304c\\u66f8\\u304d\\u8fbc\\u307f\\u3092\\u884c\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306b\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002\\u3053\\u306e\\u5834\\u5408\\u3001\\u5371\\u967a\\u306a\\u7d50\\u679c\\u304c\\u751f\\u3058\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3055\\u3089\\u306b\\u60aa\\u3044\\u3053\\u3068\\u306b\\u3001\\u72b6\\u6cc1\\u306b\\u3088\\u3063\\u3066\\u306f\\u3001\\u30e1\\u30e2\\u30ea\\u4f4d\\u7f6e\\u306b\\u7121\\u610f\\u5473\\u306a\\u30d3\\u30c3\\u30c8\\u306e\\u7d44\\u307f\\u5408\\u308f\\u305b\\u3092\\u542b\\u3080\\u5024\\u304c\\u4fdd\\u6301\\u3055\\u308c\\u3066\\u3057\\u307e\\u3046\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u3055\\u307e\\u3056\\u307e\\u306a\\u624b\\u6cd5\\u3092\\u99c6\\u4f7f\\u3057\\u3066\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306e\\u767a\\u751f\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070
sync/atomic \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u4f7f\\u7528\\u3059\\u308b 2 \\u3064\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u540c\\u671f\\u3059\\u308b\\u969b\\u306b\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u306e\\u3088\\u3046\\u306a\\u7279\\u5b9a\\u306e\\u76ee\\u7684\\u306e\\u305f\\u3081\\u306e\\u30c7\\u30fc\\u30bf\\u69cb\\u9020\\u3092\\u5229\\u7528\\u3059\\u308b \\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u3066 2 \\u3064\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u901a\\u4fe1\\u3057\\u3001\\u5909\\u6570\\u304c\\u4e00\\u5ea6\\u306b 1 \\u3064\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3060\\u3051\\u306b\\u3088\\u3063\\u3066\\u66f4\\u65b0\\u3055\\u308c\\u308b\\u3088\\u3046\\u306b\\u3059\\u308b \"},{\"location\":\"ja/#_11\",\"title\":\"\\u7af6\\u5408\\u72b6\\u614b\",\"text\":\"\\u5b9f\\u884c\\u3057\\u305f\\u3044\\u64cd\\u4f5c\\u306b\\u5fdc\\u3058\\u3066\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306e\\u306a\\u3044\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u6c7a\\u5b9a\\u7684\\u306a\\u7d50\\u679c\\u3092\\u610f\\u5473\\u3059\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u305d\\u3046\\u3068\\u306f\\u3044\\u3048\\u307e\\u305b\\u3093\\u3002
\\u7af6\\u5408\\u72b6\\u614b\\u306f\\u3001\\u52d5\\u4f5c\\u304c\\u5236\\u5fa1\\u3067\\u304d\\u306a\\u3044\\u30a4\\u30d9\\u30f3\\u30c8\\u306e\\u30b7\\u30fc\\u30b1\\u30f3\\u30b9\\u307e\\u305f\\u306f\\u30bf\\u30a4\\u30df\\u30f3\\u30b0\\u306b\\u4f9d\\u5b58\\u3059\\u308b\\u5834\\u5408\\u306b\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002\\u3053\\u3053\\u3067\\u306f\\u3001\\u30a4\\u30d9\\u30f3\\u30c8\\u306e\\u30bf\\u30a4\\u30df\\u30f3\\u30b0\\u304c\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u5b9f\\u884c\\u9806\\u5e8f\\u3067\\u3059\\u3002
\\u307e\\u3068\\u3081\\u308b\\u3068\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3067\\u4f5c\\u696d\\u3059\\u308b\\u5834\\u5408\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306f\\u7af6\\u5408\\u72b6\\u614b\\u3068\\u306f\\u7570\\u306a\\u308b\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u4e0d\\u53ef\\u6b20\\u3067\\u3059\\u3002\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306f\\u3001\\u8907\\u6570\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u540c\\u3058\\u30e1\\u30e2\\u30ea\\u4f4d\\u7f6e\\u306b\\u540c\\u6642\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3057\\u3001\\u305d\\u306e\\u3046\\u3061\\u306e\\u5c11\\u306a\\u304f\\u3068\\u3082 1 \\u3064\\u304c\\u66f8\\u304d\\u8fbc\\u307f\\u3092\\u884c\\u3063\\u3066\\u3044\\u308b\\u5834\\u5408\\u306b\\u767a\\u751f\\u3057\\u307e\\u3059\\u3002\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3068\\u306f\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306e\\u306a\\u3044\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u5fc5\\u305a\\u3057\\u3082\\u6c7a\\u5b9a\\u7684\\u306a\\u7d50\\u679c\\u3092\\u610f\\u5473\\u3059\\u308b\\u308f\\u3051\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u304c\\u306a\\u304f\\u3066\\u3082\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306f\\u5236\\u5fa1\\u3055\\u308c\\u3066\\u3044\\u306a\\u3044\\u30a4\\u30d9\\u30f3\\u30c8\\uff08\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u5b9f\\u884c\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u3078\\u306e\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u306e\\u767a\\u4fe1\\u901f\\u5ea6\\u3001\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u3078\\u306e\\u547c\\u3073\\u51fa\\u3057\\u306e\\u7d99\\u7d9a\\u6642\\u9593\\u306a\\u3069\\uff09\\u306b\\u4f9d\\u5b58\\u3059\\u308b\\u6319\\u52d5\\u3092\\u6301\\u3064\\u3053\\u3068\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u305d\\u306e\\u5834\\u5408\\u306f\\u7af6\\u5408\\u72b6\\u614b\\u3067\\u3059\\u3002\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u8a2d\\u8a08\\u306b\\u719f\\u7df4\\u3059\\u308b\\u306b\\u306f\\u3001\\u4e21\\u65b9\\u306e\\u6982\\u5ff5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u809d\\u8981\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#59\",\"title\":\"\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u30bf\\u30a4\\u30d7\\u3054\\u3068\\u306e\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u5f71\\u97ff\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#59)\",\"text\":\"\\u8981\\u7d04 \\u4e00\\u5b9a\\u6570\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3068\\u304d\\u306f\\u3001\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306e\\u30bf\\u30a4\\u30d7\\u3092\\u8003\\u616e\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002CPU \\u30d0\\u30a6\\u30f3\\u30c9\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u306f\\u3001\\u3053\\u306e\\u6570\\u3092 GOMAXPROCS \\u5909\\u6570\\uff08\\u30c7\\u30d5\\u30a9\\u30eb\\u30c8\\u3067\\u306f\\u30db\\u30b9\\u30c8\\u4e0a\\u306e CPU \\u30b3\\u30a2\\u306e\\u6570\\u306b\\u57fa\\u3065\\u304f\\uff09\\u306b\\u8fd1\\u3065\\u3051\\u308b\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002I/O \\u30d0\\u30a6\\u30f3\\u30c9\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u4f5c\\u6210\\u306f\\u3001\\u5916\\u90e8\\u30b7\\u30b9\\u30c6\\u30e0\\u306a\\u3069\\u306e\\u4ed6\\u306e\\u8981\\u56e0\\u306b\\u4f9d\\u5b58\\u3057\\u307e\\u3059\\u3002
\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u3067\\u306f\\u3001\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306e\\u5b9f\\u884c\\u6642\\u9593\\u306f\\u6b21\\u306e\\u3044\\u305a\\u308c\\u304b\\u306b\\u3088\\u3063\\u3066\\u5236\\u9650\\u3055\\u308c\\u307e\\u3059\\u3002
CPU \\u306e\\u901f\\u5ea6 - \\u305f\\u3068\\u3048\\u3070\\u3001\\u30de\\u30fc\\u30b8\\u30bd\\u30fc\\u30c8\\u30a2\\u30eb\\u30b4\\u30ea\\u30ba\\u30e0\\u306e\\u5b9f\\u884c\\u304c\\u3053\\u308c\\u306b\\u3042\\u305f\\u308a\\u307e\\u3059\\u3002\\u3053\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306f CPU \\u30d0\\u30a6\\u30f3\\u30c9\\u3068\\u547c\\u3070\\u308c\\u307e\\u3059\\u3002 I/O \\u306e\\u901f\\u5ea6 - \\u305f\\u3068\\u3048\\u3070\\u3001REST \\u547c\\u3073\\u51fa\\u3057\\u3084\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u30af\\u30a8\\u30ea\\u306e\\u5b9f\\u884c\\u304c\\u3053\\u308c\\u306b\\u3042\\u305f\\u308a\\u307e\\u3059\\u3002\\u3053\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306f I/O \\u30d0\\u30a6\\u30f3\\u30c9\\u3068\\u547c\\u3070\\u308c\\u307e\\u3059\\u3002 \\u5229\\u7528\\u53ef\\u80fd\\u306a\\u30e1\\u30e2\\u30ea\\u306e\\u91cf - \\u3053\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306f\\u30e1\\u30e2\\u30ea\\u30d0\\u30a6\\u30f3\\u30c9\\u3068\\u547c\\u3070\\u308c\\u307e\\u3059\\u3002 \\u88dc\\u8db3 \\u3053\\u3053\\u6570\\u5341\\u5e74\\u3067\\u30e1\\u30e2\\u30ea\\u304c\\u975e\\u5e38\\u306b\\u5b89\\u4fa1\\u306b\\u306a\\u3063\\u305f\\u3053\\u3068\\u3092\\u8003\\u616e\\u3059\\u308b\\u3068\\u3001 3 \\u3064\\u76ee\\u306f\\u73fe\\u5728\\u3067\\u306f\\u6700\\u3082\\u307e\\u308c\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u3053\\u306e\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u3067\\u306f\\u3001\\u6700\\u521d\\u306e 2 \\u3064\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u30bf\\u30a4\\u30d7\\u3001CPU \\u30d0\\u30a6\\u30f3\\u30c9\\u3068 I/O \\u30d0\\u30a6\\u30f3\\u30c9\\u306b\\u7126\\u70b9\\u3092\\u5f53\\u3066\\u307e\\u3059\\u3002
\\u30ef\\u30fc\\u30ab\\u30fc\\u306b\\u3088\\u3063\\u3066\\u5b9f\\u884c\\u3055\\u308c\\u308b\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u304c I/O \\u30d0\\u30a6\\u30f3\\u30c9\\u3067\\u3042\\u308b\\u5834\\u5408\\u3001\\u5024\\u306f\\u4e3b\\u306b\\u5916\\u90e8\\u30b7\\u30b9\\u30c6\\u30e0\\u306b\\u4f9d\\u5b58\\u3057\\u307e\\u3059\\u3002\\u9006\\u306b\\u3001\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u304c CPU \\u306b\\u4f9d\\u5b58\\u3057\\u3066\\u3044\\u308b\\u5834\\u5408\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u6700\\u9069\\u306a\\u6570\\u306f\\u5229\\u7528\\u53ef\\u80fd\\u306a CPU \\u30b3\\u30a2\\u306e\\u6570\\u306b\\u8fd1\\u304f\\u306a\\u308a\\u307e\\u3059\\uff08\\u30d9\\u30b9\\u30c8\\u30d7\\u30e9\\u30af\\u30c6\\u30a3\\u30b9\\u306f runtime.GOMAXPROCS \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\uff09\\u3002\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u8a2d\\u8a08\\u3059\\u308b\\u5834\\u5408\\u3001\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306e\\u30bf\\u30a4\\u30d7\\uff08 I/O \\u3042\\u308b\\u3044\\u306f CPU \\uff09\\u3092\\u77e5\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#go-context-60\",\"title\":\"Go Context \\u306b\\u5bfe\\u3059\\u308b\\u8aa4\\u89e3 (#60)\",\"text\":\"\\u8981\\u7d04 Go Context \\u306f\\u3001Go\\u8a00\\u8a9e\\u306e\\u4e26\\u884c\\u51e6\\u7406\\u306e\\u57fa\\u790e\\u306e\\u4e00\\u90e8\\u3067\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002 Context \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u3001\\u30ad\\u30fc\\u3068\\u5024\\u306e\\u30ea\\u30b9\\u30c8\\u3092\\u4fdd\\u6301\\u3067\\u304d\\u307e\\u3059\\u3002
https://pkg.go.dev/context
Context \\u306f\\u3001\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u3001\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u30b7\\u30b0\\u30ca\\u30eb\\u3001\\u305d\\u306e\\u4ed6\\u306e\\u5024\\u3092 API \\u306e\\u5883\\u754c\\u3092\\u8d8a\\u3048\\u3066\\u4f1d\\u9054\\u3057\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#_12\",\"title\":\"\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\",\"text\":\"\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u3068\\u306f\\u3001\\u6b21\\u306e\\u3044\\u305a\\u308c\\u304b\\u3067\\u6c7a\\u5b9a\\u3055\\u308c\\u308b\\u7279\\u5b9a\\u306e\\u6642\\u70b9\\u3092\\u6307\\u3057\\u307e\\u3059\\u3002
\\u73fe\\u5728\\u304b\\u3089\\u306e time.Duration \\uff08\\u4f8b\\uff1a250 ms\\uff09 time.Time \\uff08\\u4f8b\\uff1a2023-02-07 00:00:00 UTC\\uff09 \\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u306e\\u30bb\\u30de\\u30f3\\u30c6\\u30a3\\u30af\\u30b9\\u306f\\u3001\\u3053\\u308c\\u3092\\u904e\\u304e\\u305f\\u5834\\u5408\\u306f\\u9032\\u884c\\u4e2d\\u306e\\u30a2\\u30af\\u30c6\\u30a3\\u30d3\\u30c6\\u30a3\\u3092\\u505c\\u6b62\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u4f1d\\u3048\\u307e\\u3059\\u3002\\u30a2\\u30af\\u30c6\\u30a3\\u30d3\\u30c6\\u30a3\\u3068\\u306f\\u3001\\u305f\\u3068\\u3048\\u3070\\u3001\\u30c1\\u30e3\\u30cd\\u30eb\\u304b\\u3089\\u306e\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u306e\\u53d7\\u4fe1\\u3092\\u5f85\\u6a5f\\u3057\\u3066\\u3044\\u308b I/O \\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u3084\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3067\\u3059\\u3002
\"},{\"location\":\"ja/#_13\",\"title\":\"\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u30b7\\u30b0\\u30ca\\u30eb\",\"text\":\"Go Context \\u306e\\u3082\\u3046 1 \\u3064\\u306e\\u4f7f\\u7528\\u4f8b\\u306f\\u3001\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u30b7\\u30b0\\u30ca\\u30eb\\u3092\\u4f1d\\u9001\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002\\u5225\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u5185\\u3067 CreateFileWatcher(ctx context.Context, filename string) \\u3092\\u547c\\u3073\\u51fa\\u3059\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u3053\\u3068\\u3092\\u60f3\\u50cf\\u3057\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002\\u3053\\u306e\\u95a2\\u6570\\u306f\\u3001\\u30d5\\u30a1\\u30a4\\u30eb\\u304b\\u3089\\u8aad\\u307f\\u53d6\\u308a\\u3092\\u7d9a\\u3051\\u3066\\u66f4\\u65b0\\u3092\\u30ad\\u30e3\\u30c3\\u30c1\\u3059\\u308b\\u7279\\u5b9a\\u306e\\u30d5\\u30a1\\u30a4\\u30eb\\u30a6\\u30a9\\u30c3\\u30c1\\u30e3\\u30fc\\u3092\\u4f5c\\u6210\\u3057\\u307e\\u3059\\u3002\\u63d0\\u4f9b\\u3055\\u308c\\u305f Context \\u304c\\u671f\\u9650\\u5207\\u308c\\u306b\\u306a\\u308b\\u304b\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u308b\\u3068\\u3001\\u3053\\u306e\\u95a2\\u6570\\u306f\\u305d\\u308c\\u3092\\u51e6\\u7406\\u3057\\u3066\\u30d5\\u30a1\\u30a4\\u30eb\\u8a18\\u8ff0\\u5b50\\u3092\\u9589\\u3058\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#context-value\",\"title\":\"Context Value\",\"text\":\"Go Context \\u306e\\u6700\\u5f8c\\u306e\\u4f7f\\u7528\\u4f8b\\u306f\\u3001\\u30ad\\u30fc\\u3068\\u5024\\u306e\\u30ea\\u30b9\\u30c8\\u3092\\u904b\\u3076\\u3053\\u3068\\u3067\\u3059\\u3002 Context \\u306b\\u30ad\\u30fc\\u3068\\u5024\\u306e\\u30ea\\u30b9\\u30c8\\u3092\\u542b\\u3081\\u308b\\u610f\\u5473\\u306f\\u4f55\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002Go Context \\u306f\\u6c4e\\u7528\\u7684\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001\\u4f7f\\u7528\\u4f8b\\u306f\\u7121\\u9650\\u306b\\u3042\\u308a\\u307e\\u3059\\u3002
\\u305f\\u3068\\u3048\\u3070\\u3001\\u30c8\\u30ec\\u30fc\\u30b9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u7570\\u306a\\u308b\\u30b5\\u30d6\\u95a2\\u6570\\u306e\\u9593\\u3067\\u540c\\u3058\\u76f8\\u95a2 ID \\u3092\\u5171\\u6709\\u3057\\u305f\\u3044\\u3053\\u3068\\u304c\\u3042\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002\\u4e00\\u90e8\\u306e\\u958b\\u767a\\u8005\\u306f\\u3001\\u3053\\u306e ID \\u3092\\u95a2\\u6570\\u30b7\\u30b0\\u30cd\\u30c1\\u30e3\\u306e\\u4e00\\u90e8\\u306b\\u3059\\u308b\\u306b\\u306f\\u3042\\u307e\\u308a\\u306b\\u4fb5\\u7565\\u7684\\u3060\\u3068\\u8003\\u3048\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002\\u3053\\u306e\\u70b9\\u306b\\u95a2\\u3057\\u3066\\u3001\\u4e0e\\u3048\\u3089\\u308c\\u305f Context \\u306e\\u4e00\\u90e8\\u3068\\u3057\\u3066\\u305d\\u308c\\u3092\\u542b\\u3081\\u308b\\u3053\\u3068\\u3092\\u6c7a\\u5b9a\\u3059\\u308b\\u3053\\u3068\\u3082\\u3067\\u304d\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#context\",\"title\":\"Context \\u306e\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3092\\u30ad\\u30e3\\u30c3\\u30c1\\u3059\\u308b\",\"text\":\"context.Context \\u30bf\\u30a4\\u30d7\\u306f\\u3001\\u53d7\\u4fe1\\u5c02\\u7528\\u306e\\u901a\\u77e5\\u30c1\\u30e3\\u30cd\\u30eb <-chan struct{} \\u3092\\u8fd4\\u3059 Done \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u30a8\\u30af\\u30b9\\u30dd\\u30fc\\u30c8\\u3057\\u307e\\u3059\\u3002\\u3053\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u3001 Context \\u306b\\u95a2\\u9023\\u4ed8\\u3051\\u3089\\u308c\\u305f\\u4f5c\\u696d\\u3092\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306b\\u9589\\u3058\\u3089\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070
context.WithCancel\\u3067\\u4f5c\\u6210\\u3055\\u308c\\u305f Context \\u306b\\u95a2\\u9023\\u3059\\u308b Done \\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u3001cancel\\u95a2\\u6570\\u304c\\u547c\\u3073\\u51fa\\u3055\\u308c\\u308b\\u3068\\u9589\\u3058\\u3089\\u308c\\u307e\\u3059\\u3002 context.WithDeadline\\u3067\\u4f5c\\u6210\\u3057\\u305f Context \\u306b\\u95a2\\u9023\\u3059\\u308b Done \\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u3001\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u3092\\u904e\\u304e\\u308b\\u3068\\u9589\\u3058\\u3089\\u308c\\u307e\\u3059\\u3002 \\u6ce8\\u610f\\u3059\\u3079\\u304d\\u70b9\\u306e 1 \\u3064\\u306f\\u3001\\u5185\\u90e8\\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u3001\\u7279\\u5b9a\\u306e\\u5024\\u3092\\u53d7\\u3051\\u53d6\\u3063\\u305f\\u3068\\u304d\\u3067\\u306f\\u306a\\u304f\\u3001 Context \\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u305f\\u3068\\u304d\\u3001\\u307e\\u305f\\u306f\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u306b\\u9054\\u3057\\u305f\\u3068\\u304d\\u306b\\u9589\\u3058\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3059\\u3002\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u30af\\u30ed\\u30fc\\u30ba\\u306f\\u3001\\u3059\\u3079\\u3066\\u306e\\u6d88\\u8cbb\\u8005\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u53d7\\u3051\\u53d6\\u308b\\u552f\\u4e00\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u30a2\\u30af\\u30b7\\u30e7\\u30f3\\u3067\\u3042\\u308b\\u305f\\u3081\\u3067\\u3059\\u3002\\u3053\\u306e\\u3088\\u3046\\u306b\\u3057\\u3066\\u3001 Context \\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u308b\\u304b\\u3001\\u30c7\\u30c3\\u30c9\\u30e9\\u30a4\\u30f3\\u306b\\u9054\\u3059\\u308b\\u3068\\u3001\\u3059\\u3079\\u3066\\u306e\\u6d88\\u8cbb\\u8005\\u306b\\u901a\\u77e5\\u304c\\u5c4a\\u304d\\u307e\\u3059\\u3002
\\u307e\\u3068\\u3081\\u308b\\u3068\\u3001\\u719f\\u7df4\\u3057\\u305f Go \\u958b\\u767a\\u8005\\u306b\\u306a\\u308b\\u306b\\u306f\\u3001 Context \\u3068\\u305d\\u306e\\u4f7f\\u7528\\u65b9\\u6cd5\\u306b\\u3064\\u3044\\u3066\\u7406\\u89e3\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u539f\\u5247\\u3068\\u3057\\u3066\\u3001\\u30e6\\u30fc\\u30b6\\u30fc\\u304c\\u5f85\\u6a5f\\u3055\\u305b\\u3089\\u308c\\u308b\\u95a2\\u6570\\u306f Context \\u3092\\u53d6\\u5f97\\u3059\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002\\u3053\\u308c\\u306b\\u3088\\u308a\\u3001\\u4e0a\\u6d41\\u306e\\u547c\\u3073\\u51fa\\u3057\\u5143\\u304c\\u3053\\u306e\\u95a2\\u6570\\u3092\\u3044\\u3064\\u547c\\u3073\\u51fa\\u3059\\u304b\\u3092\\u6c7a\\u5b9a\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308b\\u304b\\u3089\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_14\",\"title\":\"\\u4e26\\u884c\\u51e6\\u7406\\uff1a\\u5b9f\\u8df5\",\"text\":\"\"},{\"location\":\"ja/#context-61\",\"title\":\"\\u4e0d\\u9069\\u5207\\u306a Context \\u3092\\u5e83\\u3081\\u3066\\u3057\\u307e\\u3046 (#61)\",\"text\":\"\\u8981\\u7d04 Context \\u3092\\u4f1d\\u64ad\\u3059\\u308b\\u969b\\u306b\\u306f\\u3001Context \\u3092\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3067\\u304d\\u308b\\u6761\\u4ef6\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u304c\\u9001\\u4fe1\\u3055\\u308c\\u305f\\u969b\\u306b HTTP \\u30cf\\u30f3\\u30c9\\u30e9\\u304c Context \\u3092\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3059\\u308b\\u3068\\u304d\\u306a\\u3069\\u3067\\u3059\\u3002
\\u591a\\u304f\\u306e\\u72b6\\u6cc1\\u3067\\u306f\\u3001Go Context \\u3092\\u4f1d\\u64ad\\u3059\\u308b\\u3053\\u3068\\u304c\\u63a8\\u5968\\u3055\\u308c\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001Context \\u306e\\u4f1d\\u64ad\\u306b\\u3088\\u3063\\u3066\\u8efd\\u5fae\\u306a\\u30d0\\u30b0\\u304c\\u767a\\u751f\\u3057\\u3001\\u30b5\\u30d6\\u95a2\\u6570\\u304c\\u6b63\\u3057\\u304f\\u5b9f\\u884c\\u3055\\u308c\\u306a\\u304f\\u306a\\u308b\\u5834\\u5408\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u6b21\\u306e\\u4f8b\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002\\u3044\\u304f\\u3064\\u304b\\u306e\\u30bf\\u30b9\\u30af\\u3092\\u5b9f\\u884c\\u3057\\u3066\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u3092\\u8fd4\\u3059 HTTP \\u30cf\\u30f3\\u30c9\\u30e9\\u3092\\u516c\\u958b\\u3057\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u3001\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u3092\\u8fd4\\u3059\\u76f4\\u524d\\u306b\\u3001\\u305d\\u308c\\u3092 Kafka \\u30c8\\u30d4\\u30c3\\u30af\\u306b\\u9001\\u4fe1\\u3057\\u305f\\u3044\\u3068\\u601d\\u3063\\u3066\\u3044\\u307e\\u3059\\u3002HTTP \\u30b3\\u30f3\\u30b7\\u30e5\\u30fc\\u30de\\u306b\\u30ec\\u30a4\\u30c6\\u30f3\\u30b7\\u306e\\u70b9\\u3067\\u30da\\u30ca\\u30eb\\u30c6\\u30a3\\u3092\\u8ab2\\u3057\\u305f\\u304f\\u306a\\u3044\\u306e\\u3067\\u3001publish \\u30a2\\u30af\\u30b7\\u30e7\\u30f3\\u3092\\u65b0\\u3057\\u3044\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u5185\\u3067\\u975e\\u540c\\u671f\\u306b\\u51e6\\u7406\\u3057\\u305f\\u3044\\u3068\\u8003\\u3048\\u3066\\u3044\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001Context \\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u305f\\u5834\\u5408\\u306b\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u306e publish \\u30a2\\u30af\\u30b7\\u30e7\\u30f3\\u3092\\u4e2d\\u65ad\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3001Context \\u3092\\u53d7\\u3051\\u5165\\u308c\\u308b publish \\u95a2\\u6570\\u3092\\u81ea\\u7531\\u306b\\u4f7f\\u3048\\u308b\\u3068\\u3057\\u307e\\u3059\\u3002\\u53ef\\u80fd\\u306a\\u5b9f\\u88c5\\u306f\\u6b21\\u306e\\u3068\\u304a\\u308a\\u3067\\u3059\\u3002
func handler(w http.ResponseWriter, r *http.Request) {\\n response, err := doSomeTask(r.Context(), r)\\n if err != nil {\\n http.Error(w, err.Error(), http.StatusInternalServerError)\\n return\\n }\\n go func() {\\n err := publish(r.Context(), response)\\n // err \\u306e\\u51e6\\u7406\\u3092\\u3059\\u308b\\n }()\\n writeResponse(response)\\n}\\n\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306e\\u4f55\\u304c\\u554f\\u984c\\u306a\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002HTTP \\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u306b\\u4ed8\\u3055\\u308c\\u305f Context \\u306f\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u72b6\\u6cc1\\u3067\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u77e5\\u3063\\u3066\\u304a\\u304f\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306e\\u63a5\\u7d9a\\u304c\\u7d42\\u4e86\\u3057\\u305f\\u3068\\u304d HTTP/2\\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u306e\\u5834\\u5408\\u3001\\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u305f\\u3068\\u304d \\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u304c\\u66f8\\u304d\\u623b\\u3055\\u308c\\u305f\\u3068\\u304d \\u6700\\u521d\\u306e 2 \\u3064\\u306e\\u30b1\\u30fc\\u30b9\\u3067\\u306f\\u3001\\u51e6\\u7406\\u306f\\u304a\\u305d\\u3089\\u304f\\u6b63\\u3057\\u304f\\u884c\\u308f\\u308c\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001doSomeTask \\u304b\\u3089\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u3092\\u53d7\\u3051\\u53d6\\u3063\\u305f\\u3082\\u306e\\u306e\\u3001\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u304c\\u63a5\\u7d9a\\u3092\\u9589\\u3058\\u305f\\u5834\\u5408\\u3001\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u304c publish \\u3055\\u308c\\u306a\\u3044\\u3088\\u3046\\u306b\\u3001Context \\u304c\\u65e2\\u306b\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u305f\\u72b6\\u614b\\u3067 publish \\u3092\\u547c\\u3073\\u51fa\\u3057\\u3066\\u3082\\u554f\\u984c\\u306f\\u304a\\u305d\\u3089\\u304f\\u8d77\\u304d\\u307e\\u305b\\u3093\\u3002\\u3057\\u304b\\u3057\\u3001\\u6700\\u5f8c\\u306e\\u30b1\\u30fc\\u30b9\\u306f\\u3069\\u3046\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002
\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u304c\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b\\u66f8\\u304d\\u8fbc\\u307e\\u308c\\u308b\\u3068\\u3001\\u8981\\u6c42\\u306b\\u95a2\\u9023\\u4ed8\\u3051\\u3089\\u308c\\u305f Context \\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u307e\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u7af6\\u5408\\u72b6\\u614b\\u306b\\u76f4\\u9762\\u3057\\u307e\\u3059\\u3002
\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u304c Kafka \\u306e publish \\u5f8c\\u306b\\u66f8\\u304b\\u308c\\u305f\\u5834\\u5408\\u3001\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u3092\\u8fd4\\u3057\\u3001\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u6b63\\u5e38\\u306b\\u516c\\u958b\\u3057\\u307e\\u3059\\u3002 \\u305f\\u3060\\u3057\\u3001Kafka \\u306e publish \\u524d\\u307e\\u305f\\u306f publish \\u4e2d\\u306b\\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u304c\\u66f8\\u304b\\u308c\\u305f\\u5834\\u5408\\u3001\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u306f publish \\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002 \\u5f8c\\u8005\\u306e\\u5834\\u5408\\u3001HTTP \\u30ec\\u30b9\\u30dd\\u30f3\\u30b9\\u3092\\u3059\\u3050\\u306b\\u8fd4\\u3059\\u306e\\u3067\\u3001publish \\u3092\\u547c\\u3073\\u51fa\\u3059\\u3068\\u30a8\\u30e9\\u30fc\\u304c\\u8fd4\\u3055\\u308c\\u307e\\u3059\\u3002
\\u88dc\\u8db3 Go 1.21 \\u304b\\u3089\\u306f\\u3001\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u305b\\u305a\\u306b\\u65b0\\u3057\\u3044 Context \\u3092\\u4f5c\\u6210\\u3059\\u308b\\u65b9\\u6cd5\\u304c\\u8ffd\\u52a0\\u3055\\u308c\\u307e\\u3057\\u305f\\u3002 context.WithoutCancel \\u306f\\u3001\\u89aa\\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u305f\\u3068\\u304d\\u306b\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u3066\\u3044\\u306a\\u3044\\u89aa\\u306e\\u30b3\\u30d4\\u30fc\\u3092\\u8fd4\\u3057\\u307e\\u3059\\u3002
\\u307e\\u3068\\u3081\\u308b\\u3068\\u3001Context \\u306e\\u4f1d\\u64ad\\u306f\\u614e\\u91cd\\u306b\\u884c\\u3046\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#62\",\"title\":\"\\u505c\\u6b62\\u3059\\u3079\\u304d\\u3068\\u304d\\u3092\\u77e5\\u3089\\u305a\\u306b\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u958b\\u59cb\\u3057\\u3066\\u3057\\u307e\\u3046 (#62)\",\"text\":\"\\u8981\\u7d04 \\u30ea\\u30fc\\u30af\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u306f\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u958b\\u59cb\\u3055\\u308c\\u308b\\u305f\\u3073\\u306b\\u3001\\u6700\\u7d42\\u7684\\u306b\\u505c\\u6b62\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002
\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u7c21\\u5358\\u306b\\u884c\\u3046\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u975e\\u5e38\\u306b\\u7c21\\u5358\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001\\u65b0\\u3057\\u3044\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u3044\\u3064\\u505c\\u6b62\\u3059\\u308b\\u304b\\u306b\\u3064\\u3044\\u3066\\u306e\\u8a08\\u753b\\u3092\\u5fc5\\u305a\\u3057\\u3082\\u7acb\\u3066\\u3066\\u3044\\u306a\\u3044\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u3001\\u30ea\\u30fc\\u30af\\u306b\\u3064\\u306a\\u304c\\u308b\\u3053\\u3068\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u3044\\u3064\\u505c\\u6b62\\u3059\\u308c\\u3070\\u3088\\u3044\\u304b\\u308f\\u304b\\u3089\\u306a\\u3044\\u306e\\u306f\\u3001Go\\u8a00\\u8a9e\\u3067\\u3088\\u304f\\u3042\\u308b\\u8a2d\\u8a08\\u4e0a\\u306e\\u554f\\u984c\\u3067\\u3042\\u308a\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306b\\u304a\\u3051\\u308b\\u30df\\u30b9\\u3067\\u3059\\u3002
\\u5177\\u4f53\\u7684\\u306a\\u4f8b\\u306b\\u3064\\u3044\\u3066\\u8aac\\u660e\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u5916\\u90e8\\u8a2d\\u5b9a\\uff08\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u63a5\\u7d9a\\u306a\\u3069\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u3082\\u306e\\u306a\\u3069\\uff09\\u3092\\u76e3\\u8996\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u8a2d\\u8a08\\u3057\\u307e\\u3059\\u3002\\u307e\\u305a\\u3001\\u6b21\\u306e\\u3088\\u3046\\u306a\\u5b9f\\u88c5\\u3092\\u3057\\u3066\\u307f\\u307e\\u3059\\u3002
func main() {\\n newWatcher()\\n // \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u5b9f\\u884c\\u3059\\u308b\\n}\\n\\ntype watcher struct { /* \\u3044\\u304f\\u3064\\u304b\\u306e\\u30ea\\u30bd\\u30fc\\u30b9 */ }\\n\\nfunc newWatcher() {\\n w := watcher{}\\n go w.watch() // \\u5916\\u90e8\\u8a2d\\u5b9a\\u3092\\u76e3\\u8996\\u3059\\u308b\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u4f5c\\u6210\\u3059\\u308b\\n}\\n\\u3053\\u306e\\u30b3\\u30fc\\u30c9\\u306e\\u554f\\u984c\\u306f\\u3001\\u30e1\\u30a4\\u30f3\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u7d42\\u4e86\\u3059\\u308b\\u3068\\uff08\\u304a\\u305d\\u3089\\u304f OS \\u30b7\\u30b0\\u30ca\\u30eb\\u307e\\u305f\\u306f\\u6709\\u9650\\u306e\\u30ef\\u30fc\\u30af\\u30ed\\u30fc\\u30c9\\u306e\\u305f\\u3081\\uff09\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u505c\\u6b62\\u3057\\u3066\\u3057\\u307e\\u3046\\u3053\\u3068\\u3067\\u3059\\u3002\\u3057\\u305f\\u304c\\u3063\\u3066\\u3001\\u30a6\\u30a9\\u30c3\\u30c1\\u30e3\\u30fc\\u306b\\u3088\\u3063\\u3066\\u4f5c\\u6210\\u3055\\u308c\\u305f\\u30ea\\u30bd\\u30fc\\u30b9\\u306f\\u6b63\\u5e38\\u306b\\u9589\\u3058\\u3089\\u308c\\u307e\\u305b\\u3093\\u3002\\u3053\\u308c\\u3092\\u9632\\u3050\\u306b\\u306f\\u3069\\u3046\\u3059\\u308c\\u3070\\u3088\\u3044\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002
1 \\u3064\\u306e\\u65b9\\u6cd5\\u3068\\u3057\\u3066\\u306f\\u3001main \\u304c\\u623b\\u3063\\u305f\\u3068\\u304d\\u306b\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u308b Context \\u3092 newWatcher \\u306b\\u6e21\\u3059\\u3053\\u3068\\u304c\\u6319\\u3052\\u3089\\u308c\\u307e\\u3059\\u3002
func main() {\\n ctx, cancel := context.WithCancel(context.Background())\\n defer cancel()\\n newWatcher(ctx)\\n // \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u5b9f\\u884c\\u3059\\u308b\\n}\\n\\nfunc newWatcher(ctx context.Context) {\\n w := watcher{}\\n go w.watch(ctx)\\n}\\n\\u4f5c\\u6210\\u3057\\u305f Context \\u3092 watch \\u30e1\\u30bd\\u30c3\\u30c9\\u306b\\u4f1d\\u64ad\\u3057\\u307e\\u3059\\u3002Context \\u304c\\u30ad\\u30e3\\u30f3\\u30bb\\u30eb\\u3055\\u308c\\u308b\\u3068\\u3001\\u30a6\\u30a9\\u30c3\\u30c1\\u30e3\\u30fc\\u69cb\\u9020\\u4f53\\u306f\\u305d\\u306e\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u9589\\u3058\\u307e\\u3059\\u3002\\u3057\\u304b\\u3057\\u3001watch \\u304c\\u305d\\u308c\\u3092\\u884c\\u3046\\u6642\\u9593\\u304c\\u78ba\\u5b9f\\u306b\\u3042\\u308b\\u3068\\u306f\\u3044\\u3048\\u307e\\u305b\\u3093\\u3002\\u3053\\u308c\\u306f\\u8a2d\\u8a08\\u4e0a\\u306e\\u6b20\\u9665\\u3067\\u3059\\u3002
\\u554f\\u984c\\u306f\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u505c\\u6b62\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u4f1d\\u3048\\u308b\\u305f\\u3081\\u306b\\u30b7\\u30b0\\u30ca\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u3053\\u3068\\u3067\\u3059\\u3002\\u30ea\\u30bd\\u30fc\\u30b9\\u304c\\u9589\\u3058\\u3089\\u308c\\u308b\\u307e\\u3067\\u3001\\u89aa\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u30d6\\u30ed\\u30c3\\u30af\\u3057\\u307e\\u305b\\u3093\\u3067\\u3057\\u305f\\u3002\\u305d\\u3046\\u306a\\u3089\\u306a\\u3044\\u3088\\u3046\\u306b\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
func main() {\\n w := newWatcher()\\n defer w.close()\\n // \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u5b9f\\u884c\\u3059\\u308b\\n}\\n\\nfunc newWatcher() watcher {\\n w := watcher{}\\n go w.watch()\\n return w\\n}\\n\\nfunc (w watcher) close() {\\n // \\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u9589\\u3058\\u308b\\n}\\n\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u9589\\u3058\\u308b\\u6642\\u9593\\u306b\\u306a\\u3063\\u305f\\u3053\\u3068\\u3092 watcher \\u306b\\u901a\\u77e5\\u3059\\u308b\\u4ee3\\u308f\\u308a\\u306b\\u3001 defer \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3053\\u306e\\u3000close \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3057\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u304c\\u7d42\\u4e86\\u3059\\u308b\\u524d\\u306b\\u30ea\\u30bd\\u30fc\\u30b9\\u304c\\u78ba\\u5b9f\\u306b\\u9589\\u3058\\u3089\\u308c\\u308b\\u3088\\u3046\\u306b\\u3057\\u307e\\u3059\\u3002
\\u307e\\u3068\\u3081\\u308b\\u3068\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u4ed6\\u306e\\u30ea\\u30bd\\u30fc\\u30b9\\u3068\\u540c\\u69d8\\u3001\\u30e1\\u30e2\\u30ea\\u3084\\u4ed6\\u306e\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u89e3\\u653e\\u3059\\u308b\\u305f\\u3081\\u306b\\u6700\\u7d42\\u7684\\u306b\\u9589\\u3058\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u3044\\u3064\\u505c\\u6b62\\u3059\\u308b\\u304b\\u3092\\u77e5\\u3089\\u305a\\u306b\\u958b\\u59cb\\u3059\\u308b\\u306e\\u306f\\u8a2d\\u8a08\\u4e0a\\u306e\\u554f\\u984c\\u3067\\u3059\\u3002\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u958b\\u59cb\\u3055\\u308c\\u308b\\u3068\\u304d\\u306f\\u5e38\\u306b\\u3001\\u3044\\u3064\\u505c\\u6b62\\u3059\\u308b\\u304b\\u306b\\u3064\\u3044\\u3066\\u660e\\u78ba\\u306a\\u8a08\\u753b\\u3092\\u7acb\\u3066\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u6700\\u5f8c\\u306b\\u306a\\u308a\\u307e\\u3057\\u305f\\u304c\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u4f5c\\u6210\\u3057\\u3001\\u305d\\u306e\\u6709\\u52b9\\u671f\\u9593\\u304c\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u5b58\\u7d9a\\u671f\\u9593\\u306b\\u30d0\\u30a4\\u30f3\\u30c9\\u3055\\u308c\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u7d42\\u4e86\\u3059\\u308b\\u524d\\u306b\\u305d\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u304c\\u5b8c\\u4e86\\u3059\\u308b\\u306e\\u3092\\u5f85\\u3063\\u305f\\u65b9\\u304c\\u304a\\u305d\\u3089\\u304f\\u78ba\\u5b9f\\u3067\\u3059\\u3002\\u305d\\u3046\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u30ea\\u30bd\\u30fc\\u30b9\\u3092\\u9593\\u9055\\u3044\\u306a\\u304f\\u89e3\\u653e\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#63\",\"title\":\"\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3068\\u30eb\\u30fc\\u30d7\\u5909\\u6570\\u306b\\u6ce8\\u610f\\u3057\\u306a\\u3044 (#63)\",\"text\":\"\\u6ce8\\u610f \\u3053\\u306e\\u30df\\u30b9\\u306f Go\\u30001.22 \\u304b\\u3089\\u306f\\u6c17\\u306b\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u305b\\u3093\\uff08\\u8a73\\u7d30\\uff09\\u3002
\"},{\"location\":\"ja/#select-64\",\"title\":\"select \\u3068\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u6c7a\\u5b9a\\u7684\\u52d5\\u4f5c\\u3092\\u671f\\u5f85\\u3059\\u308b (#64)\",\"text\":\"\\u8981\\u7d04 \\u8907\\u6570\\u306e\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u304c\\u53ef\\u80fd\\u306a\\u5834\\u5408\\u3001\\u8907\\u6570\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3067 select \\u3059\\u308b\\u3068\\u30b1\\u30fc\\u30b9\\u304c\\u30e9\\u30f3\\u30c0\\u30e0\\u306b\\u9078\\u629e\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3068\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306b\\u304a\\u3051\\u308b\\u8efd\\u5fae\\u306a\\u30d0\\u30b0\\u306b\\u3064\\u306a\\u304c\\u308b\\u53ef\\u80fd\\u6027\\u306e\\u3042\\u308b\\u8aa4\\u3063\\u305f\\u4eee\\u5b9a\\u3092\\u7acb\\u3066\\u308b\\u3053\\u3068\\u304c\\u306a\\u304f\\u306a\\u308a\\u307e\\u3059\\u3002
Go \\u958b\\u767a\\u8005\\u304c\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u64cd\\u4f5c\\u3059\\u308b\\u3068\\u304d\\u306b\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u306e 1 \\u3064\\u306f\\u3001select \\u304c\\u8907\\u6570\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3067\\u3069\\u306e\\u3088\\u3046\\u306b\\u52d5\\u4f5c\\u3059\\u308b\\u304b\\u306b\\u3064\\u3044\\u3066\\u8aa4\\u3063\\u305f\\u7406\\u89e3\\u3092\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
\\u305f\\u3068\\u3048\\u3070\\u3001\\u6b21\\u306e\\u5834\\u5408\\u3092\\u8003\\u3048\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\uff08 disconnectCh \\u306f\\u30d0\\u30c3\\u30d5\\u30a1\\u306a\\u3057\\u30c1\\u30e3\\u30cd\\u30eb\\u3067\\u3059\\uff09\\u3002
go func() {\\n for i := 0; i < 10; i++ {\\n messageCh <- i\\n }\\n disconnectCh <- struct{}{}\\n}()\\n\\nfor {\\n select {\\n case v := <-messageCh:\\n fmt.Println(v)\\n case <-disconnectCh:\\n fmt.Println(\\\"disconnection, return\\\")\\n return\\n }\\n}\\n\\u3053\\u306e\\u4f8b\\u3092\\u8907\\u6570\\u56de\\u5b9f\\u884c\\u3057\\u305f\\u5834\\u5408\\u3001\\u7d50\\u679c\\u306f\\u30e9\\u30f3\\u30c0\\u30e0\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
0\\n1\\n2\\ndisconnection, return\\n\\n0\\ndisconnection, return\\n\\u3069\\u3046\\u3044\\u3046\\u308f\\u3051\\u304b 10 \\u901a\\u306e\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u6d88\\u8cbb\\u3059\\u308b\\u306e\\u3067\\u306f\\u306a\\u304f\\u3001\\u305d\\u306e\\u3046\\u3061\\u306e\\u6570\\u901a\\u3060\\u3051\\u3092\\u53d7\\u4fe1\\u3057\\u307e\\u3057\\u305f\\u3002\\u3053\\u308c\\u306f\\u3001\\u8907\\u6570\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3068\\u4f75\\u7528\\u3057\\u305f\\u5834\\u5408\\u306e select \\u6587\\u306e\\u4ed5\\u69d8\\u306b\\u3088\\u308b\\u3082\\u306e\\u3067\\u3059\\uff08https:// go.dev/ref/spec\\uff09\\u3002
Quote
1 \\u3064\\u4ee5\\u4e0a\\u306e\\u901a\\u4fe1\\u3092\\u7d9a\\u884c\\u3067\\u304d\\u308b\\u5834\\u5408\\u3001\\u5747\\u4e00\\u306e\\u64ec\\u4f3c\\u30e9\\u30f3\\u30c0\\u30e0\\u9078\\u629e\\u306b\\u3088\\u3063\\u3066\\u3001\\u7d9a\\u884c\\u3067\\u304d\\u308b 1 \\u3064\\u306e\\u901a\\u4fe1\\u304c\\u9078\\u629e\\u3055\\u308c\\u307e\\u3059\\u3002
\\u6700\\u521d\\u306b\\u4e00\\u81f4\\u3057\\u305f\\u30b1\\u30fc\\u30b9\\u304c\\u512a\\u5148\\u3055\\u308c\\u308b switch \\u6587\\u3068\\u306f\\u7570\\u306a\\u308a\\u3001select \\u6587\\u306f\\u8907\\u6570\\u306e\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u304c\\u53ef\\u80fd\\u306a\\u5834\\u5408\\u306b\\u30e9\\u30f3\\u30c0\\u30e0\\u306b\\u9078\\u629e\\u3057\\u307e\\u3059\\u3002
\\u3053\\u306e\\u52d5\\u4f5c\\u306f\\u6700\\u521d\\u306f\\u5947\\u5999\\u306b\\u601d\\u3048\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002\\u3057\\u304b\\u3057\\u3001\\u3053\\u308c\\u306f\\u30b9\\u30bf\\u30d9\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u9632\\u3050\\u3068\\u3044\\u3046\\u7406\\u7531\\u304c\\u3042\\u3063\\u3066\\u306e\\u3053\\u3068\\u3067\\u3059\\u3002\\u6700\\u521d\\u306b\\u9078\\u629e\\u3055\\u308c\\u305f\\u901a\\u4fe1\\u304c\\u30bd\\u30fc\\u30b9\\u306e\\u9806\\u5e8f\\u306b\\u57fa\\u3065\\u3044\\u3066\\u3044\\u308b\\u3068\\u3057\\u307e\\u3059\\u3002\\u305d\\u306e\\u5834\\u5408\\u3001\\u9001\\u4fe1\\u901f\\u5ea6\\u304c\\u901f\\u3044\\u305f\\u3081\\u306b\\u3001\\u305f\\u3068\\u3048\\u3070 1 \\u3064\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u304b\\u3089\\u3057\\u304b\\u53d7\\u4fe1\\u3067\\u304d\\u306a\\u3044\\u3068\\u3044\\u3046\\u72b6\\u6cc1\\u306b\\u9665\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u3053\\u308c\\u3092\\u9632\\u3050\\u305f\\u3081\\u306b\\u3001Go\\u8a00\\u8a9e\\u306e\\u8a2d\\u8a08\\u8005\\u306f\\u30e9\\u30f3\\u30c0\\u30e0\\u9078\\u629e\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u306b\\u3057\\u307e\\u3057\\u305f\\u3002
\\u8907\\u6570\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3067 select \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u3001\\u8907\\u6570\\u306e\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u304c\\u3042\\u308b\\u306a\\u3089\\u3001\\u30bd\\u30fc\\u30b9\\u9806\\u5e8f\\u306e\\u6700\\u521d\\u306e\\u30b1\\u30fc\\u30b9\\u304c\\u81ea\\u52d5\\u7684\\u306b\\u512a\\u5148\\u3055\\u308c\\u308b\\u308f\\u3051\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002\\u4ee3\\u308f\\u308a\\u306b\\u3001Go\\u8a00\\u8a9e\\u306f\\u30e9\\u30f3\\u30c0\\u30e0\\u306b\\u9078\\u629e\\u3059\\u308b\\u305f\\u3081\\u3001\\u3069\\u306e\\u30aa\\u30d7\\u30b7\\u30e7\\u30f3\\u304c\\u9078\\u629e\\u3055\\u308c\\u308b\\u304b\\u306f\\u4fdd\\u8a3c\\u3055\\u308c\\u307e\\u305b\\u3093\\u3002\\u3053\\u306e\\u52d5\\u4f5c\\u3092\\u514b\\u670d\\u3059\\u308b\\u306b\\u306f\\u3001\\u5358\\u4e00\\u306e\\u751f\\u7523\\u8005\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u5834\\u5408\\u3001\\u30d0\\u30c3\\u30d5\\u30a1\\u306a\\u3057\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u307e\\u305f\\u306f\\u5358\\u4e00\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#65\",\"title\":\"\\u901a\\u77e5\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#65)\",\"text\":\"\\u8981\\u7d04 chan struct{} \\u578b\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u901a\\u77e5\\u3092\\u9001\\u4fe1\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u3001\\u30b7\\u30b0\\u30ca\\u30eb\\u3092\\u4ecb\\u3057\\u3066\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u9593\\u3067\\u901a\\u4fe1\\u3059\\u308b\\u305f\\u3081\\u306e\\u30e1\\u30ab\\u30cb\\u30ba\\u30e0\\u3067\\u3059\\u3002\\u30b7\\u30b0\\u30ca\\u30eb\\u306b\\u306f\\u30c7\\u30fc\\u30bf\\u304c\\u542b\\u307e\\u308c\\u3066\\u3044\\u308b\\u304b\\u3069\\u3046\\u304b\\u306f\\u95a2\\u4fc2\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u5177\\u4f53\\u7684\\u306a\\u4f8b\\u3092\\u898b\\u3066\\u307f\\u307e\\u3057\\u3087\\u3046\\u3002\\u901a\\u4fe1\\u306e\\u5207\\u65ad\\u304c\\u767a\\u751f\\u3059\\u308b\\u305f\\u3073\\u306b\\u305d\\u308c\\u3092\\u901a\\u77e5\\u3059\\u308b\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f5c\\u6210\\u3057\\u307e\\u3059\\u3002 1 \\u3064\\u306e\\u65b9\\u6cd5\\u3068\\u3057\\u3066\\u3001\\u3053\\u308c\\u3092 chan bool \\u3068\\u3057\\u3066\\u6271\\u3046\\u3053\\u3068\\u304c\\u6319\\u3052\\u3089\\u308c\\u307e\\u3059\\u3002
disconnectCh := make(chan bool)\\n\\u3053\\u3053\\u3067\\u3001\\u305d\\u306e\\u3088\\u3046\\u306a\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u63d0\\u4f9b\\u3059\\u308b API \\u3068\\u5bfe\\u8a71\\u3059\\u308b\\u3068\\u3057\\u307e\\u3059\\u3002\\u3053\\u308c\\u306f\\u771f\\u507d\\u5024\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001true \\u307e\\u305f\\u306f false \\u306e\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u53d7\\u4fe1\\u3067\\u304d\\u307e\\u3059\\u3002true \\u304c\\u4f55\\u3092\\u4f1d\\u3048\\u3066\\u3044\\u308b\\u304b\\u306f\\u304a\\u305d\\u3089\\u304f\\u660e\\u3089\\u304b\\u3067\\u3057\\u3087\\u3046\\u3002\\u3057\\u304b\\u3057\\u3001 false \\u3068\\u306f\\u4f55\\u3092\\u610f\\u5473\\u3059\\u308b\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u901a\\u4fe1\\u304c\\u5207\\u65ad\\u3055\\u308c\\u3066\\u3044\\u306a\\u3044\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u305d\\u306e\\u5834\\u5408\\u3001\\u3069\\u308c\\u304f\\u3089\\u3044\\u306e\\u983b\\u5ea6\\u3067\\u305d\\u306e\\u3088\\u3046\\u306a\\u30b7\\u30b0\\u30ca\\u30eb\\u3092\\u53d7\\u4fe1\\u3059\\u308b\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u3042\\u308b\\u3044\\u306f\\u518d\\u63a5\\u7d9a\\u3057\\u305f\\u3068\\u3044\\u3046\\u3053\\u3068\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u305d\\u3082\\u305d\\u3082 false \\u3092\\u53d7\\u3051\\u53d6\\u308b\\u3053\\u3068\\u3092\\u671f\\u5f85\\u3059\\u3079\\u304d\\u306a\\u306e\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u304a\\u305d\\u3089\\u304f true \\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u53d7\\u3051\\u53d6\\u308b\\u3053\\u3068\\u3060\\u3051\\u3092\\u671f\\u5f85\\u3059\\u3079\\u304d\\u3067\\u3057\\u3087\\u3046\\u3002
\\u305d\\u306e\\u5834\\u5408\\u3001\\u60c5\\u5831\\u3092\\u4f1d\\u3048\\u308b\\u305f\\u3081\\u306b\\u7279\\u5b9a\\u306e\\u5024\\u306f\\u5fc5\\u8981\\u306a\\u3044\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u3001\\u30c7\\u30fc\\u30bf\\u306e \\u306a\\u3044 \\u30c1\\u30e3\\u30cd\\u30eb\\u304c\\u5fc5\\u8981\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u3053\\u308c\\u3092\\u51e6\\u7406\\u3059\\u308b\\u6163\\u7528\\u7684\\u306a\\u65b9\\u6cd5\\u306f\\u3001\\u7a7a\\u306e\\u69cb\\u9020\\u4f53\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u2015\\u2015 chan struct{}\\u2015\\u2015\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3059\\u3002
\"},{\"location\":\"ja/#nil-66\",\"title\":\"nil \\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#66)\",\"text\":\"\\u8981\\u7d04 nil \\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u306b\\u3088\\u3063\\u3066\\u3001\\u305f\\u3068\\u3048\\u3070 select \\u6587\\u304b\\u3089\\u30b1\\u30fc\\u30b9\\u3092 \\u524a\\u9664 \\u3067\\u304d\\u308b\\u305f\\u3081\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u3092\\u884c\\u3046\\u969b\\u306e\\u9053\\u5177\\u306e\\u4e00\\u3064\\u3068\\u3057\\u3066\\u4f7f\\u3048\\u308b\\u3088\\u3046\\u306b\\u306a\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\\u6b21\\u306e\\u30b3\\u30fc\\u30c9\\u306b\\u3088\\u3063\\u3066\\u4f55\\u304c\\u884c\\u308f\\u308c\\u308b\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002
var ch chan int\\n<-ch\\nch \\u306f chan int \\u578b\\u3067\\u3059\\u3002\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u30bc\\u30ed\\u5024\\u306f nil \\u3067\\u3042\\u308b\\u306e\\u3067\\u3001 ch \\u306f nil \\u3067\\u3059\\u3002\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f panic \\u3092\\u8d77\\u3053\\u3057\\u307e\\u305b\\u3093\\u3002\\u305f\\u3060\\u3057\\u3001\\u6c38\\u4e45\\u306b\\u30d6\\u30ed\\u30c3\\u30af\\u3057\\u307e\\u3059\\u3002
nil \\u30c1\\u30e3\\u30cd\\u30eb\\u306b\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u3092\\u9001\\u4fe1\\u3059\\u308b\\u5834\\u5408\\u3082\\u539f\\u7406\\u306f\\u540c\\u3058\\u3067\\u3059\\u3002\\u4ee5\\u4e0b\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306f\\u6c38\\u4e45\\u306b\\u30d6\\u30ed\\u30c3\\u30af\\u3057\\u307e\\u3059\\u3002
var ch chan int\\nch <- 0\\n\\u3067\\u306f\\u3001Go\\u8a00\\u8a9e\\u304c nil \\u30c1\\u30e3\\u30cd\\u30eb\\u3068\\u306e\\u9593\\u3067\\u30e1\\u30c3\\u30bb\\u30fc\\u30b8\\u306e\\u9001\\u53d7\\u4fe1\\u3092\\u8a31\\u53ef\\u3059\\u308b\\u76ee\\u7684\\u306f\\u4f55\\u3067\\u3057\\u3087\\u3046\\u304b\\u3002\\u305f\\u3068\\u3048\\u3070\\u30012 \\u3064\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u30de\\u30fc\\u30b8\\u3059\\u308b\\u6163\\u7528\\u7684\\u306a\\u65b9\\u6cd5\\u3092\\u5b9f\\u88c5\\u3059\\u308b\\u306e\\u306b\\u3001 nil \\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
func merge(ch1, ch2 <-chan int) <-chan int {\\n ch := make(chan int, 1)\\n\\n go func() {\\n for ch1 != nil || ch2 != nil { // \\u6700\\u4f4e\\u3067\\u3082\\u4e00\\u3064\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u304c nil \\u3067\\u306a\\u3051\\u308c\\u3070\\u7d9a\\u884c\\u3059\\u308b\\n select {\\n case v, open := <-ch1:\\n if !open {\\n ch1 = nil // \\u9589\\u3058\\u305f\\u3089 ch1 \\u3092 nil \\u30c1\\u30e3\\u30cd\\u30eb\\u306b\\u5272\\u308a\\u5f53\\u3066\\u308b\\n break\\n }\\n ch <- v\\n case v, open := <-ch2:\\n if !open {\\n ch2 = nil // \\u9589\\u3058\\u305f\\u3089 ch2 \\u3092 nil \\u30c1\\u30e3\\u30cd\\u30eb\\u306b\\u5272\\u308a\\u5f53\\u3066\\u308b\\n break\\n }\\n ch <- v\\n }\\n }\\n close(ch)\\n }()\\n\\n return ch\\n}\\n\\u3053\\u306e\\u6d17\\u7df4\\u3055\\u308c\\u305f\\u89e3\\u6c7a\\u7b56\\u306f\\u3001nil \\u30c1\\u30e3\\u30cd\\u30eb\\u3092\\u5229\\u7528\\u3057\\u3066\\u3001\\u4f55\\u3089\\u304b\\u306e\\u65b9\\u6cd5\\u3067 select \\u6587\\u304b\\u3089 1 \\u3064\\u306e\\u30b1\\u30fc\\u30b9\\u3092 \\u524a\\u9664 \\u3057\\u307e\\u3059\\u3002
nil \\u30c1\\u30e3\\u30cd\\u30eb\\u306f\\u72b6\\u6cc1\\u306b\\u3088\\u3063\\u3066\\u306f\\u4fbf\\u5229\\u3067\\u3042\\u308a\\u3001Go \\u958b\\u767a\\u8005\\u306f\\u4e26\\u884c\\u51e6\\u7406\\u3092\\u6271\\u3046\\u969b\\u306b\\u4f7f\\u3044\\u3053\\u306a\\u305b\\u308b\\u3088\\u3046\\u306b\\u306a\\u3063\\u3066\\u304a\\u304f\\u3079\\u304d\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#67\",\"title\":\"\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u5bb9\\u91cf\\u306b\\u3064\\u3044\\u3066\\u56f0\\u60d1\\u3057\\u3066\\u3044\\u308b (#67)\",\"text\":\"\\u8981\\u7d04 \\u554f\\u984c\\u304c\\u767a\\u751f\\u3057\\u305f\\u5834\\u5408\\u306f\\u3001\\u4f7f\\u7528\\u3059\\u308b\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u578b\\u3092\\u614e\\u91cd\\u306b\\u6c7a\\u5b9a\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u540c\\u671f\\u3092\\u5f37\\u529b\\u306b\\u4fdd\\u8a3c\\u3057\\u3066\\u304f\\u308c\\u308b\\u306e\\u306f\\u30d0\\u30c3\\u30d5\\u30a1\\u306a\\u3057\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u307f\\u3067\\u3059\\u3002
\\u30d0\\u30c3\\u30d5\\u30a1\\u3042\\u308a\\u30c1\\u30e3\\u30cd\\u30eb\\u4ee5\\u5916\\u306e\\u30c1\\u30e3\\u30cd\\u30eb\\u306e\\u5bb9\\u91cf\\u3092\\u6307\\u5b9a\\u3059\\u308b\\u306b\\u306f\\u6b63\\u5f53\\u306a\\u7406\\u7531\\u304c\\u3042\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
\"},{\"location\":\"ja/#etcd-68\",\"title\":\"\\u6587\\u5b57\\u5217\\u30d5\\u30a9\\u30fc\\u30de\\u30c3\\u30c8\\u3067\\u8d77\\u3053\\u308a\\u5f97\\u308b\\u526f\\u4f5c\\u7528\\u3092\\u5fd8\\u308c\\u3066\\u3057\\u307e\\u3046\\uff08 etcd \\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306e\\u4f8b\\u3068\\u30c7\\u30c3\\u30c9\\u30ed\\u30c3\\u30af\\uff09 (#68)\",\"text\":\"\\u8981\\u7d04 \\u6587\\u5b57\\u5217\\u306e\\u66f8\\u5f0f\\u8a2d\\u5b9a\\u304c\\u65e2\\u5b58\\u306e\\u95a2\\u6570\\u304c\\u547c\\u3073\\u51fa\\u3059\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u3092\\u8a8d\\u8b58\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u30c7\\u30c3\\u30c9\\u30ed\\u30c3\\u30af\\u3084\\u305d\\u306e\\u4ed6\\u306e\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u306e\\u53ef\\u80fd\\u6027\\u306b\\u6ce8\\u610f\\u3059\\u308b\\u3053\\u3068\\u3092\\u610f\\u5473\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#append-69\",\"title\":\"append \\u3067\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3092\\u8d77\\u3053\\u3057\\u3066\\u3057\\u307e\\u3046 (#69)\",\"text\":\"\\u8981\\u7d04 append \\u306e\\u547c\\u3073\\u51fa\\u3057\\u306f\\u5fc5\\u305a\\u3057\\u3082\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u304c\\u306a\\u3044\\u308f\\u3051\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002\\u3086\\u3048\\u306b\\u3001\\u5171\\u6709\\u30b9\\u30e9\\u30a4\\u30b9\\u4e0a\\u3067\\u540c\\u6642\\u306b\\u4f7f\\u7528\\u3057\\u3066\\u306f\\u3044\\u3051\\u307e\\u305b\\u3093\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#70\",\"title\":\"\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30de\\u30c3\\u30d7\\u3067\\u30df\\u30e5\\u30fc\\u30c6\\u30c3\\u30af\\u30b9\\u3092\\u6b63\\u3057\\u304f\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#70)\",\"text\":\"\\u8981\\u7d04 \\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30de\\u30c3\\u30d7\\u306f\\u30dd\\u30a4\\u30f3\\u30bf\\u3067\\u3042\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u3068\\u3001\\u5178\\u578b\\u7684\\u306a\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3092\\u9632\\u3050\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#syncwaitgroup-71\",\"title\":\"sync.WaitGroup \\u3092\\u6b63\\u3057\\u304f\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#71)\",\"text\":\"\\u8981\\u7d04 sync.WaitGroup \\u3092\\u6b63\\u3057\\u304f\\u4f7f\\u7528\\u3059\\u308b\\u306b\\u306f\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u3092\\u8d77\\u52d5\\u3059\\u308b\\u524d\\u306b Add \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#synccond-72\",\"title\":\"sync.Cond \\u306b\\u3064\\u3044\\u3066\\u5fd8\\u308c\\u3066\\u3057\\u307e\\u3046 (#72)\",\"text\":\"\\u8981\\u7d04 sync.Cond \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u8907\\u6570\\u306e\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306b\\u7e70\\u308a\\u8fd4\\u3057\\u901a\\u77e5\\u3092\\u9001\\u4fe1\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#errgroup-73\",\"title\":\"errgroup \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#73)\",\"text\":\"\\u8981\\u7d04 errgroup \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3001\\u30b4\\u30eb\\u30fc\\u30c1\\u30f3\\u306e\\u30b0\\u30eb\\u30fc\\u30d7\\u3092\\u540c\\u671f\\u3057\\u3001\\u30a8\\u30e9\\u30fc\\u3068 Context \\u3092\\u51e6\\u7406\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#sync-74\",\"title\":\"sync \\u578b\\u306e\\u30b3\\u30d4\\u30fc (#74)\",\"text\":\"\\u8981\\u7d04 sync \\u578b\\u306f\\u30b3\\u30d4\\u30fc\\u3055\\u308c\\u308b\\u3079\\u304d\\u3067\\u306f\\u3042\\u308a\\u307e\\u305b\\u3093\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_15\",\"title\":\"\\u6a19\\u6e96\\u30e9\\u30a4\\u30d6\\u30e9\\u30ea\",\"text\":\"\"},{\"location\":\"ja/#75\",\"title\":\"\\u9593\\u9055\\u3063\\u305f\\u6642\\u9593\\u3092\\u6307\\u5b9a\\u3059\\u308b (#75)\",\"text\":\"\\u8981\\u7d04 time.Duration \\u3092\\u53d7\\u3051\\u5165\\u308c\\u308b\\u95a2\\u6570\\u306b\\u306f\\u6ce8\\u610f\\u3092\\u6255\\u3063\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002\\u6574\\u6570\\u3092\\u6e21\\u3059\\u3053\\u3068\\u306f\\u8a31\\u53ef\\u3055\\u308c\\u3066\\u3044\\u307e\\u3059\\u304c\\u3001\\u6df7\\u4e71\\u3092\\u62db\\u304b\\u306a\\u3044\\u3088\\u3046\\u306b time API \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3088\\u3046\\u52aa\\u3081\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u6a19\\u6e96\\u30e9\\u30a4\\u30d6\\u30e9\\u30ea\\u306e\\u591a\\u304f\\u306e\\u95a2\\u6570\\u306f\\u3001int64 \\u578b\\u306e\\u30a8\\u30a4\\u30ea\\u30a2\\u30b9\\u3067\\u3042\\u308b time.Duration \\u3092\\u53d7\\u3051\\u5165\\u308c\\u307e\\u3059\\u3002\\u305f\\u3060\\u3057\\u30011 \\u5358\\u4f4d\\u306e time.Duration \\u306f\\u3001\\u4ed6\\u306e\\u30d7\\u30ed\\u30b0\\u30e9\\u30df\\u30f3\\u30b0\\u8a00\\u8a9e\\u3067\\u4e00\\u822c\\u7684\\u306b\\u898b\\u3089\\u308c\\u308b 1 \\u30df\\u30ea\\u79d2\\u3067\\u306f\\u306a\\u304f\\u30011 \\u30ca\\u30ce\\u79d2\\u3092\\u8868\\u3057\\u307e\\u3059\\u3002\\u305d\\u306e\\u7d50\\u679c\\u3001time.Duration API \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u4ee3\\u308f\\u308a\\u306b\\u6570\\u5024\\u578b\\u3092\\u6e21\\u3059\\u3068\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u304c\\u767a\\u751f\\u3059\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u4ed6\\u8a00\\u8a9e\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u3053\\u3068\\u306e\\u3042\\u308b\\u958b\\u767a\\u8005\\u306e\\u65b9\\u306f\\u3001\\u6b21\\u306e\\u30b3\\u30fc\\u30c9\\u306b\\u3088\\u3063\\u3066 1 \\u79d2\\u5468\\u671f\\u306e\\u65b0\\u3057\\u3044 time.Ticker \\u304c\\u751f\\u6210\\u3055\\u308c\\u308b\\u3068\\u8003\\u3048\\u308b\\u304b\\u3082\\u3057\\u308c\\u307e\\u305b\\u3093\\u3002
ticker := time.NewTicker(1000)\\nfor {\\n select {\\n case <-ticker.C:\\n // \\u51e6\\u7406\\u3092\\u3059\\u308b\\n }\\n}\\n\\u3057\\u304b\\u3057\\u306a\\u304c\\u3089\\u30011,000 time.Duration = 1,000 \\u30ca\\u30ce\\u79d2\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001\\u60f3\\u5b9a\\u3055\\u308c\\u3066\\u3044\\u308b 1\\u79d2 \\u3067\\u306f\\u306a\\u304f\\u30011,000 \\u30ca\\u30ce\\u79d2 = 1 \\u30de\\u30a4\\u30af\\u30ed\\u79d2\\u306e\\u5468\\u671f\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u6df7\\u4e71\\u3084\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u3092\\u62db\\u304b\\u306a\\u3044\\u3088\\u3046\\u3001\\u3044\\u3064\\u3082 time.Duration API \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3079\\u304d\\u3067\\u3059\\u3002
ticker = time.NewTicker(time.Microsecond)\\n// \\u3082\\u3057\\u304f\\u306f\\nticker = time.NewTicker(1000 * time.Nanosecond)\\n\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#timeafter-76\",\"title\":\"time.After \\u3068\\u30e1\\u30e2\\u30ea\\u30ea\\u30fc\\u30af (#76)\",\"text\":\"\\u8981\\u7d04 \\u7e70\\u308a\\u8fd4\\u3055\\u308c\\u308b\\u95a2\\u6570\\uff08\\u30eb\\u30fc\\u30d7\\u3084 HTTP \\u30cf\\u30f3\\u30c9\\u30e9\\u306a\\u3069\\uff09\\u3067 time.After \\u306e\\u547c\\u3073\\u51fa\\u3057\\u3092\\u56de\\u907f\\u3059\\u308b\\u3068\\u3001\\u30d4\\u30fc\\u30af\\u6642\\u306e\\u30e1\\u30e2\\u30ea\\u6d88\\u8cbb\\u3092\\u56de\\u907f\\u3067\\u304d\\u307e\\u3059\\u3002time.After \\u306b\\u3088\\u3063\\u3066\\u751f\\u6210\\u3055\\u308c\\u305f\\u30ea\\u30bd\\u30fc\\u30b9\\u306f\\u3001 timer \\u304c\\u7d42\\u4e86\\u3057\\u305f\\u3068\\u304d\\u306b\\u306e\\u307f\\u89e3\\u653e\\u3055\\u308c\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#json-77\",\"title\":\"JSON \\u51e6\\u7406\\u3067\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044 (#77)\",\"text\":\" \\u578b\\u306e\\u57cb\\u3081\\u8fbc\\u307f\\u306b\\u3088\\u308b\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c Go \\u69cb\\u9020\\u4f53\\u3067\\u57cb\\u3081\\u8fbc\\u307f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u5834\\u5408\\u306f\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002 \\u306a\\u305c\\u306a\\u3089 json.Marshaler \\u30a4\\u30f3\\u30bf\\u30d5\\u30a7\\u30fc\\u30b9\\u3092\\u5b9f\\u88c5\\u3059\\u308b time.Time \\u57cb\\u3081\\u8fbc\\u307f\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u306e\\u3088\\u3046\\u306a\\u3084\\u3063\\u304b\\u3044\\u306a\\u30d0\\u30b0\\u304c\\u767a\\u751f\\u3057\\u3066\\u3001\\u30c7\\u30d5\\u30a9\\u30eb\\u30c8\\u306e\\u30de\\u30fc\\u30b7\\u30e3\\u30ea\\u30f3\\u30b0\\u52d5\\u4f5c\\u304c\\u30aa\\u30fc\\u30d0\\u30fc\\u30e9\\u30a4\\u30c9\\u3055\\u308c\\u308b\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u304b\\u3089\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
JSON \\u3068 monotonic clock 2 \\u3064\\u306e time.Time \\u69cb\\u9020\\u4f53\\u3092\\u6bd4\\u8f03\\u3059\\u308b\\u5834\\u5408\\u3001time.Time \\u306b\\u306f wall clock \\u3068 monotonic clock \\u306e\\u4e21\\u65b9\\u304c\\u542b\\u307e\\u308c\\u3066\\u304a\\u308a\\u3001== \\u6f14\\u7b97\\u5b50\\u3092\\u4f7f\\u7528\\u3057\\u305f\\u6bd4\\u8f03\\u306f\\u4e21\\u65b9\\u306e clock \\u306b\\u5bfe\\u3057\\u3066\\u884c\\u308f\\u308c\\u308b\\u3053\\u3068\\u3092\\u601d\\u3044\\u51fa\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
any \\u306e\\u30de\\u30c3\\u30d7 JSON \\u30c7\\u30fc\\u30bf\\u306e\\u30a2\\u30f3\\u30de\\u30fc\\u30b7\\u30e3\\u30ea\\u30f3\\u30b0\\u4e2d\\u306b\\u30de\\u30c3\\u30d7\\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u3068\\u304d\\u306b\\u9593\\u9055\\u3044\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001\\u6570\\u5024\\u306f\\u30c7\\u30d5\\u30a9\\u30eb\\u30c8\\u3067 float64 \\u306b\\u5909\\u63db\\u3055\\u308c\\u308b\\u3053\\u3068\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#sql-78\",\"title\":\"SQL \\u3067\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044 (#78)\",\"text\":\" sql.Open \\u304c\\u5fc5\\u305a\\u3057\\u3082\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u3078\\u306e\\u63a5\\u7d9a\\u3092\\u78ba\\u7acb\\u3059\\u308b\\u308f\\u3051\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u3092\\u5fd8\\u308c\\u3066\\u3044\\u308b \\u8a2d\\u5b9a\\u3092\\u8a66\\u3057\\u3001\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u306b\\u30a2\\u30af\\u30bb\\u30b9\\u3067\\u304d\\u308b\\u3053\\u3068\\u3092\\u78ba\\u8a8d\\u3059\\u308b\\u5fc5\\u8981\\u304c\\u3042\\u308b\\u5834\\u5408\\u306f\\u3001 Ping \\u307e\\u305f\\u306f PingContext \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u30b3\\u30cd\\u30af\\u30b7\\u30e7\\u30f3\\u30d7\\u30fc\\u30ea\\u30f3\\u30b0\\u306e\\u3053\\u3068\\u3092\\u5fd8\\u308c\\u308b \\u5b9f\\u904b\\u7528\\u6c34\\u6e96\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3067\\u306f\\u3001\\u30c7\\u30fc\\u30bf\\u30d9\\u30fc\\u30b9\\u63a5\\u7d9a\\u30d1\\u30e9\\u30e1\\u30fc\\u30bf\\u3092\\u8a2d\\u5b9a\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30d7\\u30ea\\u30da\\u30a2\\u30c9\\u30b9\\u30c6\\u30fc\\u30c8\\u30e1\\u30f3\\u30c8\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 SQL \\u306e\\u30d7\\u30ea\\u30da\\u30a2\\u30c9\\u30b9\\u30c6\\u30fc\\u30c8\\u30e1\\u30f3\\u30c8\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30af\\u30a8\\u30ea\\u304c\\u3088\\u308a\\u52b9\\u7387\\u7684\\u304b\\u3064\\u78ba\\u5b9f\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
null \\u5024\\u3092\\u8aa4\\u3063\\u305f\\u65b9\\u6cd5\\u3067\\u51e6\\u7406\\u3057\\u3066\\u3044\\u308b \\u30c6\\u30fc\\u30d6\\u30eb\\u5185\\u306e null \\u304c\\u8a31\\u5bb9\\u3055\\u308c\\u3066\\u3044\\u308b\\u5217\\u306f\\u3001\\u30dd\\u30a4\\u30f3\\u30bf\\u307e\\u305f\\u306f sql.NullXXX \\u578b\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u51e6\\u7406\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u884c\\u306e\\u53cd\\u5fa9\\u51e6\\u7406\\u306b\\u3088\\u308b\\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3057\\u306a\\u3044 \\u884c\\u306e\\u53cd\\u5fa9\\u51e6\\u7406\\u306e\\u5f8c\\u306b sql.Rows \\u306e Err \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u547c\\u3073\\u51fa\\u3057\\u3066\\u3001\\u6b21\\u306e\\u884c\\u306e\\u6e96\\u5099\\u4e2d\\u306b\\u30a8\\u30e9\\u30fc\\u3092\\u898b\\u9003\\u3057\\u3066\\u3044\\u306a\\u3044\\u3053\\u3068\\u3092\\u78ba\\u8a8d\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#http-bodysqlrows-osfile-79\",\"title\":\"\\u4e00\\u6642\\u7684\\u306a\\u30ea\\u30bd\\u30fc\\u30b9\\uff08 HTTP body\\u3001sql.Rows\\u3001\\u304a\\u3088\\u3073 os.File \\uff09\\u3092\\u9589\\u3058\\u3066\\u3044\\u306a\\u3044 (#79)\",\"text\":\"\\u8981\\u7d04 \\u30ea\\u30fc\\u30af\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u306b\\u3001 io.Closer \\u3092\\u5b9f\\u88c5\\u3057\\u3066\\u3044\\u308b\\u3059\\u3079\\u3066\\u306e\\u69cb\\u9020\\u4f53\\u3092\\u6700\\u5f8c\\u306b\\u306f\\u9589\\u3058\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#http-return-80\",\"title\":\"HTTP \\u30ea\\u30af\\u30a8\\u30b9\\u30c8\\u306b\\u5fdc\\u7b54\\u3057\\u305f\\u5f8c\\u306e return \\u6587\\u3092\\u5fd8\\u308c\\u3066\\u3057\\u307e\\u3046 (#80)\",\"text\":\"\\u8981\\u7d04 HTTP \\u30cf\\u30f3\\u30c9\\u30e9\\u306e\\u5b9f\\u88c5\\u3067\\u306e\\u4e88\\u60f3\\u5916\\u306e\\u52d5\\u4f5c\\u3092\\u907f\\u3051\\u308b\\u305f\\u3081\\u3001http.Error \\u306e\\u5f8c\\u306b\\u30cf\\u30f3\\u30c9\\u30e9\\u3092\\u505c\\u6b62\\u3057\\u305f\\u3044\\u5834\\u5408\\u306f\\u3001return \\u6587\\u3092\\u5fd8\\u308c\\u306a\\u3044\\u3088\\u3046\\u306b\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#http-81\",\"title\":\"\\u6a19\\u6e96\\u306e HTTP \\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3068\\u30b5\\u30fc\\u30d0\\u30fc\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u308b (#81)\",\"text\":\"\\u8981\\u7d04 \\u5b9f\\u904b\\u7528\\u6c34\\u6e96\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6c42\\u3081\\u3066\\u3044\\u308b\\u5834\\u5408\\u306f\\u3001\\u6a19\\u6e96\\u306e HTTP \\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3068\\u30b5\\u30fc\\u30d0\\u30fc\\u306e\\u5b9f\\u88c5\\u3092\\u4f7f\\u7528\\u3057\\u306a\\u3044\\u3067\\u304f\\u3060\\u3055\\u3044\\u3002\\u3053\\u308c\\u3089\\u306e\\u5b9f\\u88c5\\u306b\\u306f\\u3001\\u30bf\\u30a4\\u30e0\\u30a2\\u30a6\\u30c8\\u3084\\u7a3c\\u50cd\\u74b0\\u5883\\u3067\\u5fc5\\u9808\\u3067\\u3042\\u308b\\u3079\\u304d\\u52d5\\u4f5c\\u304c\\u6b20\\u843d\\u3057\\u3066\\u3044\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#_16\",\"title\":\"\\u30c6\\u30b9\\u30c8\",\"text\":\"\"},{\"location\":\"ja/#82\",\"title\":\"\\u30c6\\u30b9\\u30c8\\u3092\\u5206\\u985e\\u3057\\u3066\\u3044\\u306a\\u3044\\uff08\\u30d3\\u30eb\\u30c9\\u30bf\\u30b0\\u3001\\u74b0\\u5883\\u5909\\u6570\\u3001\\u30b7\\u30e7\\u30fc\\u30c8\\u30e2\\u30fc\\u30c9\\uff09 (#82)\",\"text\":\"\\u8981\\u7d04 \\u30d3\\u30eb\\u30c9\\u30d5\\u30e9\\u30b0\\u3001\\u74b0\\u5883\\u5909\\u6570\\u3001\\u307e\\u305f\\u306f\\u30b7\\u30e7\\u30fc\\u30c8\\u30e2\\u30fc\\u30c9\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30c6\\u30b9\\u30c8\\u3092\\u5206\\u985e\\u3059\\u308b\\u3068\\u3001\\u30c6\\u30b9\\u30c8\\u30d7\\u30ed\\u30bb\\u30b9\\u304c\\u3088\\u308a\\u52b9\\u7387\\u7684\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002\\u30d3\\u30eb\\u30c9\\u30d5\\u30e9\\u30b0\\u307e\\u305f\\u306f\\u74b0\\u5883\\u5909\\u6570\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30c6\\u30b9\\u30c8\\u30ab\\u30c6\\u30b4\\u30ea\\uff08\\u305f\\u3068\\u3048\\u3070\\u3001\\u5358\\u4f53\\u30c6\\u30b9\\u30c8\\u3068\\u7d71\\u5408\\u30c6\\u30b9\\u30c8\\uff09\\u3092\\u4f5c\\u6210\\u3057\\u3001\\u77ed\\u671f\\u9593\\u306e\\u30c6\\u30b9\\u30c8\\u3068\\u9577\\u6642\\u9593\\u306e\\u30c6\\u30b9\\u30c8\\u3092\\u533a\\u5225\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u5b9f\\u884c\\u3059\\u308b\\u30c6\\u30b9\\u30c8\\u306e\\u7a2e\\u985e\\u3092\\u6c7a\\u5b9a\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#-race-83\",\"title\":\"-race \\u30d5\\u30e9\\u30b0\\u3092\\u6709\\u52b9\\u306b\\u3057\\u3066\\u3044\\u306a\\u3044 (#83)\",\"text\":\"\\u8981\\u7d04 \\u4e26\\u884c\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u4f5c\\u6210\\u3059\\u308b\\u5834\\u5408\\u306f\\u3001 -race \\u30d5\\u30e9\\u30b0\\u3092\\u6709\\u52b9\\u306b\\u3059\\u308b\\u3053\\u3068\\u3092\\u5f37\\u304f\\u304a\\u52e7\\u3081\\u3057\\u307e\\u3059\\u3002\\u305d\\u3046\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u30bd\\u30d5\\u30c8\\u30a6\\u30a7\\u30a2\\u306e\\u30d0\\u30b0\\u306b\\u3064\\u306a\\u304c\\u308b\\u53ef\\u80fd\\u6027\\u306e\\u3042\\u308b\\u6f5c\\u5728\\u7684\\u306a\\u30c7\\u30fc\\u30bf\\u7af6\\u5408\\u3092\\u767a\\u898b\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u306a\\u308a\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#-parallel-shuffle-84\",\"title\":\"\\u30c6\\u30b9\\u30c8\\u5b9f\\u884c\\u30e2\\u30fc\\u30c9\\uff08 -parallel \\u304a\\u3088\\u3073 -shuffle \\uff09\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#84)\",\"text\":\"\\u8981\\u7d04 -parallel \\u30d5\\u30e9\\u30b0\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u306e\\u306f\\u3001\\u7279\\u306b\\u9577\\u6642\\u9593\\u5b9f\\u884c\\u3055\\u308c\\u308b\\u30c6\\u30b9\\u30c8\\u3092\\u9ad8\\u901f\\u5316\\u3059\\u308b\\u306e\\u306b\\u52b9\\u679c\\u7684\\u3067\\u3059\\u3002 -shuffle \\u30d5\\u30e9\\u30b0\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3068\\u3001\\u30c6\\u30b9\\u30c8\\u30b9\\u30a4\\u30fc\\u30c8\\u304c\\u30d0\\u30b0\\u3092\\u96a0\\u3059\\u53ef\\u80fd\\u6027\\u306e\\u3042\\u308b\\u9593\\u9055\\u3063\\u305f\\u4eee\\u5b9a\\u306b\\u4f9d\\u5b58\\u3057\\u306a\\u3044\\u3088\\u3046\\u306b\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#85\",\"title\":\"\\u30c6\\u30fc\\u30d6\\u30eb\\u99c6\\u52d5\\u30c6\\u30b9\\u30c8\\u3092\\u4f7f\\u7528\\u3057\\u306a\\u3044 (#85)\",\"text\":\"\\u8981\\u7d04 \\u30c6\\u30fc\\u30d6\\u30eb\\u99c6\\u52d5\\u30c6\\u30b9\\u30c8\\u306f\\u3001\\u30b3\\u30fc\\u30c9\\u306e\\u91cd\\u8907\\u3092\\u9632\\u304e\\u3001\\u5c06\\u6765\\u306e\\u66f4\\u65b0\\u306e\\u51e6\\u7406\\u3092\\u5bb9\\u6613\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u4e00\\u9023\\u306e\\u985e\\u4f3c\\u3057\\u305f\\u30c6\\u30b9\\u30c8\\u3092\\u30b0\\u30eb\\u30fc\\u30d7\\u5316\\u3059\\u308b\\u52b9\\u7387\\u7684\\u306a\\u65b9\\u6cd5\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#86\",\"title\":\"\\u5358\\u4f53\\u30c6\\u30b9\\u30c8\\u3067\\u306e\\u30b9\\u30ea\\u30fc\\u30d7 (#86)\",\"text\":\"\\u8981\\u7d04 \\u30c6\\u30b9\\u30c8\\u306e\\u4e0d\\u5b89\\u5b9a\\u3055\\u3092\\u306a\\u304f\\u3057\\u3001\\u3088\\u308a\\u5805\\u7262\\u306b\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u540c\\u671f\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30b9\\u30ea\\u30fc\\u30d7\\u3092\\u56de\\u907f\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u540c\\u671f\\u304c\\u4e0d\\u53ef\\u80fd\\u306a\\u5834\\u5408\\u306f\\u3001\\u30ea\\u30c8\\u30e9\\u30a4\\u624b\\u6cd5\\u3092\\u691c\\u8a0e\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#time-api-87\",\"title\":\"time API \\u3092\\u52b9\\u7387\\u7684\\u306b\\u51e6\\u7406\\u3067\\u304d\\u3066\\u3044\\u306a\\u3044 (#87)\",\"text\":\"\\u8981\\u7d04 time API \\u3092\\u4f7f\\u7528\\u3057\\u3066\\u95a2\\u6570\\u3092\\u51e6\\u7406\\u3059\\u308b\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u30c6\\u30b9\\u30c8\\u306e\\u4e0d\\u5b89\\u5b9a\\u3055\\u3092\\u8efd\\u6e1b\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u96a0\\u308c\\u305f\\u4f9d\\u5b58\\u95a2\\u4fc2\\u306e\\u4e00\\u90e8\\u3068\\u3057\\u3066 time \\u3092\\u51e6\\u7406\\u3057\\u305f\\u308a\\u3001\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u306b time \\u3092\\u63d0\\u4f9b\\u3059\\u308b\\u3088\\u3046\\u306b\\u8981\\u6c42\\u3057\\u305f\\u308a\\u3059\\u308b\\u306a\\u3069\\u3001\\u6a19\\u6e96\\u7684\\u306a\\u624b\\u6bb5\\u3092\\u5229\\u7528\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#httptest-iotest-88\",\"title\":\"\\u30c6\\u30b9\\u30c8\\u306b\\u95a2\\u3059\\u308b\\u30e6\\u30fc\\u30c6\\u30a3\\u30ea\\u30c6\\u30a3\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\uff08 httptest \\u304a\\u3088\\u3073 iotest \\uff09\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#88)\",\"text\":\" httptest \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306f\\u3001HTTP \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6271\\u3046\\u306e\\u306b\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002\\u30af\\u30e9\\u30a4\\u30a2\\u30f3\\u30c8\\u3068\\u30b5\\u30fc\\u30d0\\u30fc\\u306e\\u4e21\\u65b9\\u3092\\u30c6\\u30b9\\u30c8\\u3059\\u308b\\u305f\\u3081\\u306e\\u4e00\\u9023\\u306e\\u30e6\\u30fc\\u30c6\\u30a3\\u30ea\\u30c6\\u30a3\\u3092\\u63d0\\u4f9b\\u3057\\u307e\\u3059\\u3002 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
iotest \\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306f\\u3001io.Reader \\u3092\\u4f5c\\u6210\\u3057\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u30a8\\u30e9\\u30fc\\u8010\\u6027\\u3092\\u30c6\\u30b9\\u30c8\\u3059\\u308b\\u306e\\u306b\\u5f79\\u7acb\\u3061\\u307e\\u3059\\u3002 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#89\",\"title\":\"\\u4e0d\\u6b63\\u78ba\\u306a\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306e\\u4f5c\\u6210 (#89)\",\"text\":\"\\u8981\\u7d04 \\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306b\\u3064\\u3044\\u3066
\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306e\\u7cbe\\u5ea6\\u3092\\u7dad\\u6301\\u3059\\u308b\\u306b\\u306f\\u3001time \\u30e1\\u30bd\\u30c3\\u30c9\\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002 \\u30d9\\u30f3\\u30c1\\u30bf\\u30a4\\u30e0\\u3092\\u5897\\u3084\\u3059\\u304b\\u3001benchstat \\u306a\\u3069\\u306e\\u30c4\\u30fc\\u30eb\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u30de\\u30a4\\u30af\\u30ed\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u304c\\u6271\\u3044\\u3084\\u3059\\u304f\\u306a\\u308a\\u307e\\u3059\\u3002 \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6700\\u7d42\\u7684\\u306b\\u5b9f\\u884c\\u3059\\u308b\\u30b7\\u30b9\\u30c6\\u30e0\\u304c\\u30de\\u30a4\\u30af\\u30ed\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u30b7\\u30b9\\u30c6\\u30e0\\u3068\\u7570\\u306a\\u308b\\u5834\\u5408\\u306f\\u3001\\u30de\\u30a4\\u30af\\u30ed\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306e\\u7d50\\u679c\\u306b\\u6ce8\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002 \\u30b3\\u30f3\\u30d1\\u30a4\\u30e9\\u306e\\u6700\\u9069\\u5316\\u306b\\u3088\\u3063\\u3066\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u306e\\u7d50\\u679c\\u304c\\u8aa4\\u9b54\\u5316\\u3055\\u308c\\u306a\\u3044\\u3088\\u3046\\u3001\\u30c6\\u30b9\\u30c8\\u5bfe\\u8c61\\u306e\\u95a2\\u6570\\u304c\\u526f\\u4f5c\\u7528\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u3088\\u3046\\u306b\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002 \\u30aa\\u30d6\\u30b6\\u30fc\\u30d0\\u30fc\\u52b9\\u679c\\u3092\\u9632\\u3050\\u306b\\u306f\\u3001CPU \\u306b\\u4f9d\\u5b58\\u3059\\u308b\\u95a2\\u6570\\u304c\\u4f7f\\u7528\\u3059\\u308b\\u30c7\\u30fc\\u30bf\\u3092\\u30d9\\u30f3\\u30c1\\u30de\\u30fc\\u30af\\u304c\\u518d\\u751f\\u6210\\u3059\\u308b\\u3088\\u3046\\u5f37\\u5236\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002 \\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#go-90\",\"title\":\"Go\\u8a00\\u8a9e\\u306e\\u30c6\\u30b9\\u30c8\\u6a5f\\u80fd\\u3092\\u3059\\u3079\\u3066\\u8a66\\u3057\\u3066\\u3044\\u306a\\u3044 (#90)\",\"text\":\" \\u30b3\\u30fc\\u30c9\\u30ab\\u30d0\\u30ec\\u30c3\\u30b8 \\u30b3\\u30fc\\u30c9\\u306e\\u3069\\u306e\\u90e8\\u5206\\u306b\\u6ce8\\u610f\\u304c\\u5fc5\\u8981\\u304b\\u3092\\u3059\\u3050\\u306b\\u78ba\\u8a8d\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001-coverprofile \\u30d5\\u30e9\\u30b0\\u3092\\u6307\\u5b9a\\u3057\\u3066\\u30b3\\u30fc\\u30c9\\u30ab\\u30d0\\u30ec\\u30c3\\u30b8\\u3092\\u4f7f\\u7528\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u5225\\u306e\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u304b\\u3089\\u306e\\u30c6\\u30b9\\u30c8 \\u5185\\u90e8\\u3067\\u306f\\u306a\\u304f\\u516c\\u958b\\u3055\\u308c\\u305f\\u52d5\\u4f5c\\u306b\\u7126\\u70b9\\u3092\\u5f53\\u3066\\u305f\\u30c6\\u30b9\\u30c8\\u306e\\u4f5c\\u6210\\u3092\\u5f37\\u5236\\u3059\\u308b\\u305f\\u3081\\u306b\\u3001\\u5358\\u4f53\\u30c6\\u30b9\\u30c8\\u306f\\u5225\\u3005\\u306e\\u30d1\\u30c3\\u30b1\\u30fc\\u30b8\\u306b\\u914d\\u7f6e\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u30e6\\u30fc\\u30c6\\u30a3\\u30ea\\u30c6\\u30a3\\u95a2\\u6570 \\u5f93\\u6765\\u306e if err != nil \\u306e\\u4ee3\\u308f\\u308a\\u306b *testing.T \\u5909\\u6570\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30a8\\u30e9\\u30fc\\u3092\\u51e6\\u7406\\u3059\\u308b\\u3068\\u3001\\u30b3\\u30fc\\u30c9\\u304c\\u77ed\\u304f\\u3001\\u8aad\\u307f\\u3084\\u3059\\u304f\\u306a\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
setup \\u304a\\u3088\\u3073 teardown \\u6a5f\\u80fd\\u3092\\u5229\\u7528\\u3057\\u3066\\u3001\\u7d71\\u5408\\u30c6\\u30b9\\u30c8\\u306e\\u5834\\u5408\\u306a\\u3069\\u3001\\u8907\\u96d1\\u306a\\u74b0\\u5883\\u3092\\u69cb\\u6210\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#community-mistake\",\"title\":\"\\u30d5\\u30a1\\u30b8\\u30f3\\u30b0\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044\\uff08community mistake\\uff09\",\"text\":\"\\u8981\\u7d04 \\u30d5\\u30a1\\u30b8\\u30f3\\u30b0\\u306f\\u3001\\u8907\\u96d1\\u306a\\u95a2\\u6570\\u3084\\u30e1\\u30bd\\u30c3\\u30c9\\u3078\\u306e\\u30e9\\u30f3\\u30c0\\u30e0\\u306a\\u3001\\u4e88\\u60f3\\u5916\\u306e\\u3001\\u307e\\u305f\\u306f\\u4e0d\\u6b63\\u306a\\u5165\\u529b\\u3092\\u691c\\u51fa\\u3057\\u3001\\u8106\\u5f31\\u6027\\u3001\\u30d0\\u30b0\\u3001\\u3055\\u3089\\u306b\\u306f\\u6f5c\\u5728\\u7684\\u306a\\u30af\\u30e9\\u30c3\\u30b7\\u30e5\\u3092\\u767a\\u898b\\u3059\\u308b\\u306e\\u306b\\u52b9\\u7387\\u7684\\u3067\\u3059\\u3002
@jeromedoucet \\u3055\\u3093\\u306e\\u3054\\u5354\\u529b\\u306b\\u611f\\u8b1d\\u3044\\u305f\\u3057\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#_17\",\"title\":\"\\u6700\\u9069\\u5316\",\"text\":\"\"},{\"location\":\"ja/#cpu-91\",\"title\":\"CPU \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#91)\",\"text\":\" CPU \\u30a2\\u30fc\\u30ad\\u30c6\\u30af\\u30c1\\u30e3 L1 \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u306f\\u30e1\\u30a4\\u30f3\\u30e1\\u30e2\\u30ea\\u3088\\u308a\\u3082\\u7d04 50 \\uff5e 100 \\u500d\\u9ad8\\u901f\\u3067\\u3042\\u308b\\u305f\\u3081\\u3001CPU \\u30d0\\u30a6\\u30f3\\u30c9\\u306e\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6700\\u9069\\u5316\\u3059\\u308b\\u306b\\u306f\\u3001CPU \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u306e\\u4f7f\\u7528\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u304c\\u91cd\\u8981\\u3067\\u3059\\u3002
\\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u30e9\\u30a4\\u30f3 \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u30e9\\u30a4\\u30f3\\u306e\\u6982\\u5ff5\\u3092\\u610f\\u8b58\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u30c7\\u30fc\\u30bf\\u96c6\\u7d04\\u578b\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3067\\u30c7\\u30fc\\u30bf\\u3092\\u6574\\u7406\\u3059\\u308b\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u306e\\u306b\\u91cd\\u8981\\u3067\\u3059\\u3002CPU \\u306f\\u30e1\\u30e2\\u30ea\\u3092\\u30ef\\u30fc\\u30c9\\u3054\\u3068\\u306b\\u30d5\\u30a7\\u30c3\\u30c1\\u3057\\u307e\\u305b\\u3093\\u3002\\u4ee3\\u308f\\u308a\\u306b\\u3001\\u901a\\u5e38\\u306f\\u30e1\\u30e2\\u30ea\\u30d6\\u30ed\\u30c3\\u30af\\u3092 64 \\u30d0\\u30a4\\u30c8\\u306e\\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u30e9\\u30a4\\u30f3\\u306b\\u30b3\\u30d4\\u30fc\\u3057\\u307e\\u3059\\u3002\\u500b\\u3005\\u306e\\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u30e9\\u30a4\\u30f3\\u3092\\u6700\\u5927\\u9650\\u306b\\u6d3b\\u7528\\u3059\\u308b\\u306b\\u306f\\u3001\\u7a7a\\u9593\\u7684\\u5c40\\u6240\\u6027\\u3092\\u5f37\\u5236\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u69cb\\u9020\\u4f53\\u306e\\u30b9\\u30e9\\u30a4\\u30b9\\u3068\\u30b9\\u30e9\\u30a4\\u30b9\\u306e\\u69cb\\u9020\\u4f53 \\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u4e88\\u6e2c\\u53ef\\u80fd\\u6027 CPU \\u306b\\u3068\\u3063\\u3066\\u4e88\\u6e2c\\u53ef\\u80fd\\u306a\\u30b3\\u30fc\\u30c9\\u306b\\u3059\\u308b\\u3053\\u3068\\u306f\\u3001\\u7279\\u5b9a\\u306e\\u95a2\\u6570\\u3092\\u6700\\u9069\\u5316\\u3059\\u308b\\u52b9\\u7387\\u7684\\u306a\\u65b9\\u6cd5\\u3067\\u3082\\u3042\\u308a\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u30e6\\u30cb\\u30c3\\u30c8\\u307e\\u305f\\u306f\\u5b9a\\u6570\\u30b9\\u30c8\\u30e9\\u30a4\\u30c9\\u306f CPU \\u306b\\u3068\\u3063\\u3066\\u4e88\\u6e2c\\u53ef\\u80fd\\u3067\\u3059\\u304c\\u3001\\u975e\\u30e6\\u30cb\\u30c3\\u30c8\\u30b9\\u30c8\\u30e9\\u30a4\\u30c9\\uff08\\u9023\\u7d50\\u30ea\\u30b9\\u30c8\\u306a\\u3069\\uff09\\u306f\\u4e88\\u6e2c\\u3067\\u304d\\u307e\\u305b\\u3093\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u914d\\u7f6e\\u30dd\\u30ea\\u30b7\\u30fc \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u304c\\u30d1\\u30fc\\u30c6\\u30a3\\u30b7\\u30e7\\u30f3\\u5316\\u3055\\u308c\\u3066\\u3044\\u308b\\u3053\\u3068\\u3092\\u8a8d\\u8b58\\u3059\\u308b\\u3053\\u3068\\u3067\\u3001\\u91cd\\u5927\\u306a\\u30b9\\u30c8\\u30e9\\u30a4\\u30c9\\u3092\\u56de\\u907f\\u3057\\u3001\\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u306e\\u3054\\u304f\\u4e00\\u90e8\\u306e\\u307f\\u3092\\u4f7f\\u7528\\u3059\\u308b\\u3088\\u3046\\u306b\\u3059\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#92\",\"title\":\"\\u8aa4\\u3063\\u305f\\u5171\\u6709\\u3092\\u5f15\\u304d\\u8d77\\u3053\\u3059\\u4e26\\u884c\\u51e6\\u7406(#92)\",\"text\":\"\\u8981\\u7d04 \\u4e0b\\u4f4d\\u30ec\\u30d9\\u30eb\\u306e CPU \\u30ad\\u30e3\\u30c3\\u30b7\\u30e5\\u304c\\u3059\\u3079\\u3066\\u306e\\u30b3\\u30a2\\u3067\\u5171\\u6709\\u3055\\u308c\\u308b\\u308f\\u3051\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u3092\\u77e5\\u3063\\u3066\\u304a\\u304f\\u3068\\u3001\\u4e26\\u884c\\u51e6\\u7406\\u306b\\u304a\\u3051\\u308b\\u306e\\u8aa4\\u3063\\u305f\\u5171\\u6709\\u306a\\u3069\\u3067\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u3092\\u4f4e\\u4e0b\\u3055\\u305b\\u3066\\u3057\\u307e\\u3046\\u3053\\u3068\\u3092\\u56de\\u907f\\u3067\\u304d\\u307e\\u3059\\u3002\\u30e1\\u30e2\\u30ea\\u306e\\u5171\\u6709\\u306f\\u3042\\u308a\\u3048\\u306a\\u3044\\u306e\\u3067\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#93\",\"title\":\"\\u547d\\u4ee4\\u30ec\\u30d9\\u30eb\\u306e\\u4e26\\u5217\\u6027\\u3092\\u8003\\u616e\\u3057\\u306a\\u3044 (#93)\",\"text\":\"\\u8981\\u7d04 \\u547d\\u4ee4\\u30ec\\u30d9\\u30eb\\u306e\\u4e26\\u5217\\u6027\\uff08ILP\\uff09\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u30b3\\u30fc\\u30c9\\u306e\\u7279\\u5b9a\\u306e\\u90e8\\u5206\\u3092\\u6700\\u9069\\u5316\\u3057\\u3001CPU \\u304c\\u3067\\u304d\\u308b\\u3060\\u3051\\u591a\\u304f\\u306e\\u547d\\u4ee4\\u3092\\u4e26\\u5217\\u5b9f\\u884c\\u3067\\u304d\\u308b\\u3088\\u3046\\u306b\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002\\u4e3b\\u306a\\u624b\\u9806\\u306e 1 \\u3064\\u306b\\u30c7\\u30fc\\u30bf\\u30cf\\u30b6\\u30fc\\u30c9\\u306e\\u7279\\u5b9a\\u304c\\u3042\\u308a\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#94\",\"title\":\"\\u30c7\\u30fc\\u30bf\\u306e\\u914d\\u7f6e\\u3092\\u610f\\u8b58\\u3057\\u3066\\u3044\\u306a\\u3044 (#94)\",\"text\":\"\\u8981\\u7d04 Go\\u8a00\\u8a9e\\u3067\\u306f\\u3001\\u57fa\\u672c\\u578b\\u306f\\u5404\\u3005\\u306e\\u30b5\\u30a4\\u30ba\\u306b\\u5408\\u308f\\u305b\\u3066\\u914d\\u7f6e\\u3055\\u308c\\u308b\\u3053\\u3068\\u3092\\u899a\\u3048\\u3066\\u304a\\u304f\\u3053\\u3068\\u3067\\u3001\\u3042\\u308a\\u304c\\u3061\\u306a\\u9593\\u9055\\u3044\\u3092\\u907f\\u3051\\u308b\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002\\u305f\\u3068\\u3048\\u3070\\u3001\\u69cb\\u9020\\u4f53\\u306e\\u30d5\\u30a3\\u30fc\\u30eb\\u30c9\\u3092\\u30b5\\u30a4\\u30ba\\u3067\\u964d\\u9806\\u306b\\u518d\\u7de8\\u6210\\u3059\\u308b\\u3068\\u3001\\u69cb\\u9020\\u4f53\\u304c\\u3088\\u308a\\u30b3\\u30f3\\u30d1\\u30af\\u30c8\\u306b\\u306a\\u308b\\uff08\\u30e1\\u30e2\\u30ea\\u5272\\u308a\\u5f53\\u3066\\u304c\\u5c11\\u306a\\u304f\\u306a\\u308a\\u3001\\u7a7a\\u9593\\u7684\\u5c40\\u6240\\u6027\\u304c\\u5411\\u4e0a\\u3059\\u308b\\uff09\\u53ef\\u80fd\\u6027\\u304c\\u3042\\u308b\\u3053\\u3068\\u306b\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#95\",\"title\":\"\\u30d2\\u30fc\\u30d7\\u3068\\u30b9\\u30bf\\u30c3\\u30af\\u306e\\u9055\\u3044\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#95)\",\"text\":\"\\u8981\\u7d04 \\u30d2\\u30fc\\u30d7\\u3068\\u30b9\\u30bf\\u30c3\\u30af\\u306e\\u57fa\\u672c\\u7684\\u306a\\u9055\\u3044\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3053\\u3068\\u3082\\u3001Go \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6700\\u9069\\u5316\\u3059\\u308b\\u969b\\u306b\\u306f\\u5927\\u5207\\u3067\\u3059\\u3002\\u30b9\\u30bf\\u30c3\\u30af\\u5272\\u308a\\u5f53\\u3066\\u306f\\u5bb9\\u6613\\u306a\\u306e\\u306b\\u5bfe\\u3057\\u3066\\u3001\\u30d2\\u30fc\\u30d7\\u5272\\u308a\\u5f53\\u3066\\u306f\\u9045\\u304f\\u3001\\u30e1\\u30e2\\u30ea\\u306e\\u30af\\u30ea\\u30fc\\u30f3\\u30a2\\u30c3\\u30d7\\u306b GC \\u3092\\u5229\\u7528\\u3057\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#api-syncpool-96\",\"title\":\"\\u5272\\u308a\\u5f53\\u3066\\u3092\\u6e1b\\u3089\\u3059\\u65b9\\u6cd5\\u304c\\u308f\\u304b\\u3063\\u3066\\u3044\\u306a\\u3044\\uff08 API \\u306e\\u5909\\u66f4\\u3001\\u30b3\\u30f3\\u30d1\\u30a4\\u30e9\\u306e\\u6700\\u9069\\u5316\\u3001\\u304a\\u3088\\u3073 sync.Pool\\uff09 (#96)\",\"text\":\"\\u8981\\u7d04 \\u5272\\u308a\\u5f53\\u3066\\u3092\\u6e1b\\u3089\\u3059\\u3053\\u3068\\u3082\\u3001Go \\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u3092\\u6700\\u9069\\u5316\\u3059\\u308b\\u4e0a\\u3067\\u91cd\\u8981\\u3067\\u3059\\u3002\\u3053\\u308c\\u306f\\u3001\\u5171\\u6709\\u3092\\u9632\\u3050\\u305f\\u3081\\u306b API \\u3092\\u614e\\u91cd\\u306b\\u8a2d\\u8a08\\u3059\\u308b\\u3001\\u4e00\\u822c\\u7684\\u306a Go \\u30b3\\u30f3\\u30d1\\u30a4\\u30e9\\u306e\\u6700\\u9069\\u5316\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3001sync.Pool \\u3092\\u4f7f\\u7528\\u3059\\u308b\\u306a\\u3069\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u65b9\\u6cd5\\u3067\\u884c\\u3046\\u3053\\u3068\\u304c\\u3067\\u304d\\u307e\\u3059\\u3002
\\u30bd\\u30fc\\u30b9\\u30b3\\u30fc\\u30c9
\"},{\"location\":\"ja/#97\",\"title\":\"\\u30a4\\u30f3\\u30e9\\u30a4\\u30f3\\u5c55\\u958b\\u3092\\u3057\\u3066\\u3044\\u306a\\u3044 (#97)\",\"text\":\"\\u8981\\u7d04 \\u30d5\\u30a1\\u30b9\\u30c8\\u30d1\\u30b9\\u306e\\u30a4\\u30f3\\u30e9\\u30a4\\u30f3\\u5316\\u624b\\u6cd5\\u3092\\u4f7f\\u7528\\u3057\\u3066\\u3001\\u95a2\\u6570\\u306e\\u547c\\u3073\\u51fa\\u3057\\u306b\\u304b\\u304b\\u308b\\u511f\\u5374\\u6642\\u9593\\u3092\\u52b9\\u7387\\u7684\\u306b\\u524a\\u6e1b\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\"},{\"location\":\"ja/#go-98\",\"title\":\"Go\\u8a00\\u8a9e\\u306e\\u8a3a\\u65ad\\u30c4\\u30fc\\u30eb\\u3092\\u5229\\u7528\\u3057\\u3066\\u3044\\u306a\\u3044 (#98)\",\"text\":\"\\u8981\\u7d04 \\u30d7\\u30ed\\u30d5\\u30a1\\u30a4\\u30ea\\u30f3\\u30b0\\u3068\\u5b9f\\u884c\\u30c8\\u30ec\\u30fc\\u30b5\\u3092\\u5229\\u7528\\u3057\\u3066\\u3001\\u30a2\\u30d7\\u30ea\\u30b1\\u30fc\\u30b7\\u30e7\\u30f3\\u306e\\u30d1\\u30d5\\u30a9\\u30fc\\u30de\\u30f3\\u30b9\\u3068\\u6700\\u9069\\u5316\\u3059\\u3079\\u304d\\u90e8\\u5206\\u306b\\u3064\\u3044\\u3066\\u7406\\u89e3\\u3057\\u307e\\u3057\\u3087\\u3046\\u3002
\\u30bb\\u30af\\u30b7\\u30e7\\u30f3\\u5168\\u6587\\u306f\\u3053\\u3061\\u3089\\u3002
\"},{\"location\":\"ja/#gc-99\",\"title\":\"GC \\u306e\\u4ed5\\u7d44\\u307f\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#99)\",\"text\":\"\\u8981\\u7d04 GC \\u306e\\u8abf\\u6574\\u65b9\\u6cd5\\u3092\\u7406\\u89e3\\u3059\\u308b\\u3068\\u3001\\u7a81\\u7136\\u306e\\u8ca0\\u8377\\u306e\\u5897\\u52a0\\u3092\\u3088\\u308a\\u52b9\\u7387\\u7684\\u306b\\u51e6\\u7406\\u3067\\u304d\\u308b\\u306a\\u3069\\u3001\\u3055\\u307e\\u3056\\u307e\\u306a\\u6069\\u6075\\u304c\\u5f97\\u3089\\u308c\\u307e\\u3059\\u3002
\"},{\"location\":\"ja/#docker-kubernetes-go-100\",\"title\":\"Docker \\u3068 Kubernetes \\u4e0a\\u3067Go\\u8a00\\u8a9e\\u3092\\u5b9f\\u884c\\u3059\\u308b\\u3053\\u3068\\u306e\\u5f71\\u97ff\\u3092\\u7406\\u89e3\\u3057\\u3066\\u3044\\u306a\\u3044 (#100)\",\"text\":\"\\u8981\\u7d04 Docker \\u3068 Kubernetes \\u306b\\u30c7\\u30d7\\u30ed\\u30a4\\u3059\\u308b\\u969b\\u306e CPU \\u30b9\\u30ed\\u30c3\\u30c8\\u30ea\\u30f3\\u30b0\\u3092\\u56de\\u907f\\u3059\\u308b\\u306b\\u306f\\u3001Go\\u8a00\\u8a9e\\u304c CFS \\u5bfe\\u5fdc\\u3067\\u306f\\u306a\\u3044\\u3053\\u3068\\u306b\\u7559\\u610f\\u3057\\u3066\\u304f\\u3060\\u3055\\u3044\\u3002
\"},{\"location\":\"pt-br/\",\"title\":\"Brazilian Portuguese Version\",\"text\":\"\"},{\"location\":\"pt-br/#erros-comuns-de-go\",\"title\":\"Erros comuns de Go\",\"text\":\"The Coder Cafe Se voc\\u00ea gostou do meu livro, talvez se interesse pelo meu novo projeto: The Coder Cafe, uma newsletter di\\u00e1ria para programadores.
Feeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
Esta p\\u00e1gina \\u00e9 um resumo dos erros do 100 Go Mistakes and How to Avoid Them book. Enquanto isso, tamb\\u00e9m est\\u00e1 aberto \\u00e0 comunidade. Se voc\\u00ea acredita que um erro comum do Go deve ser adicionado, crie uma issue.
Beta Voc\\u00ea est\\u00e1 visualizando uma vers\\u00e3o beta enriquecida com muito mais conte\\u00fado. No entanto, esta vers\\u00e3o ainda n\\u00e3o est\\u00e1 completa e estou procurando volunt\\u00e1rios para me ajudar a resumir os erros restantes (GitHub issue #43).
Progresso:
\"},{\"location\":\"pt-br/#codigo-e-organizacao-do-projeto\",\"title\":\"C\\u00f3digo e Organiza\\u00e7\\u00e3o do Projeto\",\"text\":\"\"},{\"location\":\"pt-br/#sombreamento-nao-intencional-de-variavel-1\",\"title\":\"Sombreamento n\\u00e3o intencional de vari\\u00e1vel (#1)\",\"text\":\"TL;DR Evitar vari\\u00e1veis \\u200b\\u200bsombreadas pode ajudar a evitar erros, como fazer refer\\u00eancia \\u00e0 vari\\u00e1vel errada ou confundir os desenvolvedores.
O sombreamento de vari\\u00e1vel ocorre quando um nome de vari\\u00e1vel \\u00e9 redeclarado em um bloco interno, mas essa pr\\u00e1tica est\\u00e1 sujeita a erros. A imposi\\u00e7\\u00e3o de uma regra para proibir vari\\u00e1veis \\u200b\\u200bobscuras depende do gosto pessoal. Por exemplo, \\u00e0s vezes pode ser conveniente reutilizar um nome de vari\\u00e1vel existente, como err no caso de erros. Por\\u00e9m, em geral, devemos ser cautelosos porque agora sabemos que podemos enfrentar um cen\\u00e1rio onde o c\\u00f3digo compila, mas a vari\\u00e1vel que recebe o valor n\\u00e3o \\u00e9 a esperada.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#codigo-aninhado-desnecessario-2\",\"title\":\"C\\u00f3digo aninhado desnecess\\u00e1rio (#2)\",\"text\":\"TL;DR Evitar n\\u00edveis aninhados e manter o caminho feliz alinhado \\u00e0 esquerda facilita a constru\\u00e7\\u00e3o de um modelo de c\\u00f3digo mental.
Em geral, quanto mais n\\u00edveis aninhados uma fun\\u00e7\\u00e3o exigir, mais complexa ser\\u00e1 sua leitura e compreens\\u00e3o. Vamos ver algumas aplica\\u00e7\\u00f5es diferentes desta regra para otimizar a legibilidade do nosso c\\u00f3digo:
Quando um bloco if retorna, devemos omitir o else em todos os casos. Por exemplo, n\\u00e3o dever\\u00edamos escrever: if foo() {\\n // ...\\n return true\\n} else {\\n // ...\\n}\\nEm vez disso, omitimos o bloco else assim:
if foo() {\\n // ...\\n return true\\n}\\n// ...\\n Tamb\\u00e9m podemos seguir esta l\\u00f3gica com um caminho n\\u00e3o feliz: if s != \\\"\\\" {\\n // ...\\n} else {\\n return errors.New(\\\"empty string\\\")\\n}\\nAqui, um s vazio representa o caminho n\\u00e3o feliz. Portanto, devemos inverter a condi\\u00e7\\u00e3o assim:
if s == \\\"\\\" {\\n return errors.New(\\\"empty string\\\")\\n}\\n// ...\\nEscrever c\\u00f3digo leg\\u00edvel \\u00e9 um desafio importante para todo desenvolvedor. Esfor\\u00e7ar-se para reduzir o n\\u00famero de blocos aninhados, alinhar o caminho feliz \\u00e0 esquerda e retornar o mais cedo poss\\u00edvel s\\u00e3o meios concretos para melhorar a legibilidade do nosso c\\u00f3digo.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#uso-indevido-de-funcoes-init-3\",\"title\":\"Uso indevido de fun\\u00e7\\u00f5es init (#3)\",\"text\":\"TL;DR Ao inicializar vari\\u00e1veis, lembre-se de que as fun\\u00e7\\u00f5es init t\\u00eam tratamento de erros limitado e tornam o tratamento de estado e os testes mais complexos. Na maioria dos casos, as inicializa\\u00e7\\u00f5es devem ser tratadas como fun\\u00e7\\u00f5es espec\\u00edficas.
Uma fun\\u00e7\\u00e3o init \\u00e9 uma fun\\u00e7\\u00e3o usada para inicializar o estado de um aplicativo. N\\u00e3o aceita argumentos e n\\u00e3o retorna nenhum resultado (uma fun\\u00e7\\u00e3o func()). Quando um pacote \\u00e9 inicializado, todas as declara\\u00e7\\u00f5es de constantes e vari\\u00e1veis \\u200b\\u200bdo pacote s\\u00e3o avaliadas. Ent\\u00e3o, as fun\\u00e7\\u00f5es init s\\u00e3o executadas.
As fun\\u00e7\\u00f5es de inicializa\\u00e7\\u00e3o podem levar a alguns problemas:
Elas podem limitar o gerenciamento de erros. Elas podem complicar a implementa\\u00e7\\u00e3o de testes (por exemplo, uma depend\\u00eancia externa deve ser configurada, o que pode n\\u00e3o ser necess\\u00e1rio para o escopo dos testes unit\\u00e1rios). Se a inicializa\\u00e7\\u00e3o exigir que definamos um estado, isso dever\\u00e1 ser feito por meio de vari\\u00e1veis \\u200b\\u200bglobais. Devemos ser cautelosos com as fun\\u00e7\\u00f5es init. No entanto, elas podem ser \\u00fateis em algumas situa\\u00e7\\u00f5es, como na defini\\u00e7\\u00e3o de configura\\u00e7\\u00e3o est\\u00e1tica. Caso contr\\u00e1rio, e na maioria dos casos, devemos tratar as inicializa\\u00e7\\u00f5es atrav\\u00e9s de fun\\u00e7\\u00f5es ad hoc.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#uso-excessivo-de-getters-e-setters-4\",\"title\":\"Uso excessivo de getters e setters (#4)\",\"text\":\"TL;DR Forcing the use of getters and setters isn\\u2019t idiomatic in Go. Being pragmatic and finding the right balance between efficiency and blindly following certain idioms should be the way to go.
O encapsulamento de dados refere-se a ocultar os valores ou o estado de um objeto. Getters e setters s\\u00e3o meios de habilitar o encapsulamento, fornecendo m\\u00e9todos exportados sobre campos de objetos n\\u00e3o exportados.
No Go, n\\u00e3o h\\u00e1 suporte autom\\u00e1tico para getters e setters como vemos em algumas linguagens. Tamb\\u00e9m n\\u00e3o \\u00e9 considerado obrigat\\u00f3rio nem idiom\\u00e1tico o uso de getters e setters para acessar campos struct. N\\u00e3o devemos sobrecarregar nosso c\\u00f3digo com getters e setters em structs se eles n\\u00e3o trouxerem nenhum valor. Dever\\u00edamos ser pragm\\u00e1ticos e nos esfor\\u00e7ar para encontrar o equil\\u00edbrio certo entre efici\\u00eancia e seguir express\\u00f5es que \\u00e0s vezes s\\u00e3o consideradas indiscut\\u00edveis em outros paradigmas de programa\\u00e7\\u00e3o.
Lembre-se de que Go \\u00e9 uma linguagem \\u00fanica projetada para muitas caracter\\u00edsticas, incluindo simplicidade. No entanto, se encontrarmos necessidade de getters e setters ou, como mencionado, prevermos uma necessidade futura e ao mesmo tempo garantirmos a compatibilidade futura, n\\u00e3o h\\u00e1 nada de errado em us\\u00e1-los.
\"},{\"location\":\"pt-br/#interface-poluidas-5\",\"title\":\"Interface poluidas (#5)\",\"text\":\"TL;DR Abstra\\u00e7\\u00f5es devem ser descobertas, n\\u00e3o criadas. Para evitar complexidade desnecess\\u00e1ria, crie uma interface quando precisar dela e n\\u00e3o quando voc\\u00ea prev\\u00ear que ser\\u00e1 necess\\u00e1ria, ou se puder pelo menos provar que a abstra\\u00e7\\u00e3o \\u00e9 v\\u00e1lida.
Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#interface-do-lado-do-producer-6\",\"title\":\"Interface do lado do producer (#6)\",\"text\":\"TL;DR Manter interfaces no lado do cliente evita abstra\\u00e7\\u00f5es desnecess\\u00e1rias.
As interfaces s\\u00e3o satisfeitas implicitamente em Go, o que tende a ser um divisor de \\u00e1guas em compara\\u00e7\\u00e3o com linguagens com implementa\\u00e7\\u00e3o expl\\u00edcita. Na maioria dos casos, a abordagem a seguir \\u00e9 semelhante \\u00e0 que descrevemos na se\\u00e7\\u00e3o anterior: as abstra\\u00e7\\u00f5es devem ser descobertas, n\\u00e3o criadas. Isso significa que n\\u00e3o cabe ao producer for\\u00e7ar uma determinada abstra\\u00e7\\u00e3o para todos os clientes. Em vez disso, cabe ao cliente decidir se precisa de alguma forma de abstra\\u00e7\\u00e3o e ent\\u00e3o determinar o melhor n\\u00edvel de abstra\\u00e7\\u00e3o para suas necessidades.
Uma interface deve residir no lado do consumidor na maioria dos casos. Contudo, em contextos espec\\u00edficos (por exemplo, quando sabemos \\u2013 e n\\u00e3o prevemos \\u2013 que uma abstra\\u00e7\\u00e3o ser\\u00e1 \\u00fatil para os consumidores), podemos querer t\\u00ea-la do lado do procuder. Se o fizermos, devemos nos esfor\\u00e7ar para mant\\u00ea-lo o m\\u00ednimo poss\\u00edvel, aumentando o seu potencial de reutiliza\\u00e7\\u00e3o e tornando-o mais facilmente combin\\u00e1vel.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#interfaces-de-retorno-7\",\"title\":\"Interfaces de retorno (#7)\",\"text\":\"TL;DR Para evitar restri\\u00e7\\u00f5es em termos de flexibilidade, uma fun\\u00e7\\u00e3o n\\u00e3o deve retornar interfaces, mas implementa\\u00e7\\u00f5es concretas na maioria dos casos. Por outro lado, uma fun\\u00e7\\u00e3o deve aceitar interfaces sempre que poss\\u00edvel.
Na maioria dos casos, n\\u00e3o devemos retornar interfaces, mas implementa\\u00e7\\u00f5es concretas. Caso contr\\u00e1rio, isso pode tornar nosso design mais complexo devido \\u00e0s depend\\u00eancias do pacote e pode restringir a flexibilidade porque todos os clientes teriam que contar com a mesma abstra\\u00e7\\u00e3o. Novamente, a conclus\\u00e3o \\u00e9 semelhante \\u00e0s se\\u00e7\\u00f5es anteriores: se sabemos (n\\u00e3o prevemos) que uma abstra\\u00e7\\u00e3o ser\\u00e1 \\u00fatil para os clientes, podemos considerar o retorno de uma interface. Caso contr\\u00e1rio, n\\u00e3o dever\\u00edamos for\\u00e7ar abstra\\u00e7\\u00f5es; eles devem ser descobertas pelos clientes. Se um cliente precisar abstrair uma implementa\\u00e7\\u00e3o por qualquer motivo, ele ainda poder\\u00e1 fazer isso do lado do cliente.
\"},{\"location\":\"pt-br/#any-nao-diz-nada-8\",\"title\":\"any n\\u00e3o diz nada (#8)\",\"text\":\"TL;DR Use apenas any se precisar aceitar ou retornar qualquer tipo poss\\u00edvel, como json.Marshal. Caso contr\\u00e1rio, any n\\u00e3o fornece informa\\u00e7\\u00f5es significativas e pode levar a problemas de tempo de compila\\u00e7\\u00e3o, permitindo que um chamador chame m\\u00e9todos com qualquer tipo de dados.
O tipo any pode ser \\u00fatil se houver uma necessidade genu\\u00edna de aceitar ou retornar qualquer tipo poss\\u00edvel (por exemplo, quando se trata de empacotamento ou formata\\u00e7\\u00e3o). Em geral, devemos evitar a todo custo generalizar demais o c\\u00f3digo que escrevemos. Talvez um pouco de c\\u00f3digo duplicado possa ocasionalmente ser melhor se melhorar outros aspectos, como a expressividade do c\\u00f3digo.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ficar-confuso-sobre-quando-usar-genericos-9\",\"title\":\"Ficar confuso sobre quando usar gen\\u00e9ricos (#9)\",\"text\":\"TL;DR Depender de par\\u00e2metros gen\\u00e9ricos e de tipo pode impedir a grava\\u00e7\\u00e3o de c\\u00f3digo clich\\u00ea (boilerplate) para fatorar elementos ou comportamentos. No entanto, n\\u00e3o use par\\u00e2metros de tipo prematuramente, mas somente quando voc\\u00ea perceber uma necessidade concreta deles. Caso contr\\u00e1rio, introduzem abstra\\u00e7\\u00f5es e complexidade desnecess\\u00e1rias.
Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-estar-ciente-dos-possiveis-problemas-com-a-incorporacao-de-tipos-10\",\"title\":\"N\\u00e3o estar ciente dos poss\\u00edveis problemas com a incorpora\\u00e7\\u00e3o de tipos (#10)\",\"text\":\"TL;DR Usar a incorpora\\u00e7\\u00e3o de tipo (type embedding) tamb\\u00e9m pode ajudar a evitar c\\u00f3digo clich\\u00ea (boilerplate); no entanto, certifique-se de que isso n\\u00e3o leve a problemas de visibilidade onde alguns campos deveriam ter permanecido ocultos.
Ao criar uma struct, Go oferece a op\\u00e7\\u00e3o de incorporar tipos. Mas isso \\u00e0s vezes pode levar a comportamentos inesperados se n\\u00e3o compreendermos todas as implica\\u00e7\\u00f5es da incorpora\\u00e7\\u00e3o de tipos. Ao longo desta se\\u00e7\\u00e3o, veremos como incorporar tipos, o que eles trazem e os poss\\u00edveis problemas.
No Go, um campo struct \\u00e9 chamado de incorporado se for declarado sem nome. Por exemplo,
type Foo struct {\\n Bar // Embedded field\\n}\\n\\ntype Bar struct {\\n Baz int\\n}\\nNa estrutura Foo, o tipo Bar \\u00e9 declarado sem nome associado; portanto, \\u00e9 um campo incorporado.
Usamos incorpora\\u00e7\\u00e3o para promover os campos e m\\u00e9todos de um tipo incorporado. Como Bar cont\\u00e9m um campo Baz, esse campo \\u00e9 promovido para Foo. Portanto, Baz fica dispon\\u00edvel a partir de Foo.
O que podemos dizer sobre a incorpora\\u00e7\\u00e3o de tipos? Primeiro, observemos que raramente \\u00e9 uma necessidade e significa que, qualquer que seja o caso de uso, provavelmente tamb\\u00e9m poderemos resolv\\u00ea-lo sem incorpora\\u00e7\\u00e3o de tipo. A incorpora\\u00e7\\u00e3o de tipos \\u00e9 usada principalmente por conveni\\u00eancia: na maioria dos casos, para promover comportamentos.
Se decidirmos usar incorpora\\u00e7\\u00e3o de tipo, precisamos ter em mente duas restri\\u00e7\\u00f5es principais:
N\\u00e3o deve ser usado apenas como um a\\u00e7\\u00facar sint\\u00e1tico para simplificar o acesso a um campo (como Foo.Baz() em vez de Foo.Bar.Baz()). Se esta for a \\u00fanica justificativa, n\\u00e3o vamos incorporar o tipo interno e usar um campo. N\\u00e3o deve promover dados (campos) ou um comportamento (m\\u00e9todos) que queremos ocultar do exterior: por exemplo, se permitir que os clientes acessem um comportamento de bloqueio que deve permanecer privado da struct. Usar a incorpora\\u00e7\\u00e3o de tipo de forma consciente, mantendo essas restri\\u00e7\\u00f5es em mente, pode ajudar a evitar c\\u00f3digo clich\\u00ea (boilerplate) com m\\u00e9todos de encaminhamento adicionais. No entanto, vamos garantir que n\\u00e3o o fazemos apenas por motivos cosm\\u00e9ticos e n\\u00e3o promovemos elementos que deveriam permanecer ocultos.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-usar-o-padrao-de-opcoes-funcionais-functional-options-pattern-11\",\"title\":\"N\\u00e3o usar o padr\\u00e3o de op\\u00e7\\u00f5es funcionais (functional options pattern) (#11)\",\"text\":\"TL;DR Para lidar com op\\u00e7\\u00f5es de maneira conveniente e amig\\u00e1vel \\u00e0 API, use o padr\\u00e3o de op\\u00e7\\u00f5es funcionais.
Embora existam diferentes implementa\\u00e7\\u00f5es com pequenas varia\\u00e7\\u00f5es, a ideia principal \\u00e9 a seguinte:
Uma estrutura n\\u00e3o exportada cont\\u00e9m a configura\\u00e7\\u00e3o: op\\u00e7\\u00f5es. Cada op\\u00e7\\u00e3o \\u00e9 uma fun\\u00e7\\u00e3o que retorna o mesmo tipo: type Option func(options *options) error. Por exemplo, WithPort aceita um argumento int que representa a porta e retorna um tipo Option que representa como atualizar a struct options.
type options struct {\\n port *int\\n}\\n\\ntype Option func(options *options) error\\n\\nfunc WithPort(port int) Option {\\n return func(options *options) error {\\n if port < 0 {\\n return errors.New(\\\"port should be positive\\\")\\n }\\n options.port = &port\\n return nil\\n }\\n}\\n\\nfunc NewServer(addr string, opts ...Option) ( *http.Server, error) {\\n var options options\\n for _, opt := range opts {\\n err := opt(&options)\\n if err != nil {\\n return nil, err\\n }\\n }\\n\\n // At this stage, the options struct is built and contains the config\\n // Therefore, we can implement our logic related to port configuration\\n var port int\\n if options.port == nil {\\n port = defaultHTTPPort\\n } else {\\n if *options.port == 0 {\\n port = randomPort()\\n } else {\\n port = *options.port\\n }\\n }\\n\\n // ...\\n}\\nO padr\\u00e3o de op\\u00e7\\u00f5es funcionais fornece uma maneira pr\\u00e1tica e amig\\u00e1vel \\u00e0 API de lidar com op\\u00e7\\u00f5es. Embora o padr\\u00e3o do construtor possa ser uma op\\u00e7\\u00e3o v\\u00e1lida, ele tem algumas desvantagens menores (ter que passar uma estrutura de configura\\u00e7\\u00e3o que pode estar vazia ou uma maneira menos pr\\u00e1tica de lidar com o gerenciamento de erros) que tendem a tornar o padr\\u00e3o de op\\u00e7\\u00f5es funcionais a maneira idiom\\u00e1tica de lidar com esse tipo de problema no Go.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#desorganizacao-do-projeto-estrutura-do-projeto-e-organizacao-do-pacote-12\",\"title\":\"Desorganiza\\u00e7\\u00e3o do projeto (estrutura do projeto e organiza\\u00e7\\u00e3o do pacote) (#12)\",\"text\":\"No que diz respeito \\u00e0 organiza\\u00e7\\u00e3o geral, existem diferentes escolas de pensamento. Por exemplo, devemos organizar a nossa aplica\\u00e7\\u00e3o por contexto ou por camada? Depende de nossas prefer\\u00eancias. Podemos preferir agrupar o c\\u00f3digo por contexto (como o contexto do cliente, o contexto do contrato, etc.), ou podemos preferir seguir os princ\\u00edpios da arquitetura hexagonal e agrupar por camada t\\u00e9cnica. Se a decis\\u00e3o que tomarmos se adequar ao nosso caso de uso, n\\u00e3o pode ser uma decis\\u00e3o errada, desde que permane\\u00e7amos consistentes com ela.
Em rela\\u00e7\\u00e3o aos pacotes, existem v\\u00e1rias pr\\u00e1ticas recomendadas que devemos seguir. Primeiro, devemos evitar pacotes prematuros porque podem complicar demais um projeto. \\u00c0s vezes, \\u00e9 melhor usar uma organiza\\u00e7\\u00e3o simples e fazer nosso projeto evoluir quando entendemos o que ele cont\\u00e9m, em vez de nos for\\u00e7armos a fazer a estrutura perfeita desde o in\\u00edcio. A granularidade \\u00e9 outra coisa essencial a considerar. Devemos evitar dezenas de pacotes nano contendo apenas um ou dois arquivos. Se o fizermos, \\u00e9 porque provavelmente perdemos algumas conex\\u00f5es l\\u00f3gicas entre esses pacotes, tornando nosso projeto mais dif\\u00edcil de ser compreendido pelos leitores. Por outro lado, tamb\\u00e9m devemos evitar pacotes grandes que diluem o significado do nome de um pacote.
A nomenclatura dos pacotes tamb\\u00e9m deve ser considerada com cuidado. Como todos sabemos (como desenvolvedores), nomear \\u00e9 dif\\u00edcil. Para ajudar os clientes a entender um projeto Go, devemos nomear nossos pacotes de acordo com o que eles fornecem, n\\u00e3o com o que cont\\u00eam. Al\\u00e9m disso, a nomenclatura deve ser significativa. Portanto, o nome de um pacote deve ser curto, conciso, expressivo e, por conven\\u00e7\\u00e3o, uma \\u00fanica palavra min\\u00fascula.
Quanto ao que exportar, a regra \\u00e9 bastante simples. Devemos minimizar o que deve ser exportado tanto quanto poss\\u00edvel para reduzir o acoplamento entre pacotes e manter ocultos os elementos exportados desnecess\\u00e1rios. Se n\\u00e3o tivermos certeza se devemos ou n\\u00e3o exportar um elemento, devemos optar por n\\u00e3o export\\u00e1-lo. Mais tarde, se descobrirmos que precisamos export\\u00e1-lo, poderemos ajustar nosso c\\u00f3digo. Vamos tamb\\u00e9m ter em mente algumas exce\\u00e7\\u00f5es, como fazer com que os campos sejam exportados para que uma estrutura possa ser desempacotada com encoding/json.
Organizar um projeto n\\u00e3o \\u00e9 simples, mas seguir essas regras deve ajudar a facilitar sua manuten\\u00e7\\u00e3o. No entanto, lembre-se de que a consist\\u00eancia tamb\\u00e9m \\u00e9 vital para facilitar a manuten\\u00e7\\u00e3o. Portanto, vamos nos certificar de manter as coisas o mais consistentes poss\\u00edvel dentro de uma base de c\\u00f3digo.
Note Em 2023, a equipe Go publicou uma diretriz oficial para organizar/estruturar um projeto Go: go.dev/doc/modules/layout
\"},{\"location\":\"pt-br/#criando-pacotes-de-utilitarios-13\",\"title\":\"Criando pacotes de utilit\\u00e1rios (#13)\",\"text\":\"TL;DR A nomenclatura \\u00e9 uma parte cr\\u00edtica do design do aplicativo. Criar pacotes como common, util e shared n\\u00e3o traz muito valor para o leitor. Refatore esses pacotes em nomes de pacotes significativos e espec\\u00edficos.
Al\\u00e9m disso, tenha em mente que nomear um pacote com base no que ele fornece e n\\u00e3o no que ele cont\\u00e9m pode ser uma forma eficiente de aumentar sua expressividade.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-colisoes-de-nomes-de-pacotes-14\",\"title\":\"Ignorando colis\\u00f5es de nomes de pacotes (#14)\",\"text\":\"TL;DR Para evitar colis\\u00f5es de nomes entre vari\\u00e1veis \\u200b\\u200be pacotes, levando a confus\\u00e3o ou talvez at\\u00e9 bugs, use nomes exclusivos para cada um. Se isso n\\u00e3o for vi\\u00e1vel, use um alias de importa\\u00e7\\u00e3o para alterar o qualificador para diferenciar o nome do pacote do nome da vari\\u00e1vel ou pense em um nome melhor.
As colis\\u00f5es de pacotes ocorrem quando um nome de vari\\u00e1vel colide com um nome de pacote existente, impedindo que o pacote seja reutilizado. Devemos evitar colis\\u00f5es de nomes de vari\\u00e1veis \\u200b\\u200bpara evitar ambiguidade. Se enfrentarmos uma colis\\u00e3o, devemos encontrar outro nome significativo ou usar um alias de importa\\u00e7\\u00e3o.
\"},{\"location\":\"pt-br/#documentacao-de-codigo-ausente-15\",\"title\":\"Documenta\\u00e7\\u00e3o de c\\u00f3digo ausente (#15)\",\"text\":\"TL;DR Para ajudar clientes e mantenedores a entender a finalidade do seu c\\u00f3digo, documente os elementos exportados.
A documenta\\u00e7\\u00e3o \\u00e9 um aspecto importante da programa\\u00e7\\u00e3o. Simplifica como os clientes podem consumir uma API, mas tamb\\u00e9m pode ajudar na manuten\\u00e7\\u00e3o de um projeto. No Go, devemos seguir algumas regras para tornar nosso c\\u00f3digo idiom\\u00e1tico:
Primeiro, cada elemento exportado deve ser documentado. Seja uma estrutura, uma interface, uma fun\\u00e7\\u00e3o ou qualquer outra coisa, se for exportado deve ser documentado. A conven\\u00e7\\u00e3o \\u00e9 adicionar coment\\u00e1rios, come\\u00e7ando com o nome do elemento exportado.
Por conven\\u00e7\\u00e3o, cada coment\\u00e1rio deve ser uma frase completa que termina com pontua\\u00e7\\u00e3o. Tenha tamb\\u00e9m em mente que quando documentamos uma fun\\u00e7\\u00e3o (ou um m\\u00e9todo), devemos destacar o que a fun\\u00e7\\u00e3o pretende fazer, n\\u00e3o como o faz; isso pertence ao n\\u00facleo de uma fun\\u00e7\\u00e3o e coment\\u00e1rios, n\\u00e3o \\u00e0 documenta\\u00e7\\u00e3o. Al\\u00e9m disso, o ideal \\u00e9 que a documenta\\u00e7\\u00e3o forne\\u00e7a informa\\u00e7\\u00f5es suficientes para que o consumidor n\\u00e3o precise olhar nosso c\\u00f3digo para entender como usar um elemento exportado.
Quando se trata de documentar uma vari\\u00e1vel ou constante, podemos estar interessados \\u200b\\u200bem transmitir dois aspectos: sua finalidade e seu conte\\u00fado. O primeiro deve funcionar como documenta\\u00e7\\u00e3o de c\\u00f3digo para ser \\u00fatil para clientes externos. Este \\u00faltimo, por\\u00e9m, n\\u00e3o deveria ser necessariamente p\\u00fablico.
Para ajudar clientes e mantenedores a entender o escopo de um pacote, devemos tamb\\u00e9m documentar cada pacote. A conven\\u00e7\\u00e3o \\u00e9 iniciar o coment\\u00e1rio com // Package seguido do nome do pacote. A primeira linha de um coment\\u00e1rio de pacote deve ser concisa. Isso porque ele aparecer\\u00e1 no pacote. Ent\\u00e3o, podemos fornecer todas as informa\\u00e7\\u00f5es que precisamos nas linhas seguintes.
Documentar nosso c\\u00f3digo n\\u00e3o deve ser uma restri\\u00e7\\u00e3o. Devemos aproveitar a oportunidade para garantir que isso ajude os clientes e mantenedores a entender o prop\\u00f3sito do nosso c\\u00f3digo.
\"},{\"location\":\"pt-br/#nao-usando-linters-16\",\"title\":\"N\\u00e3o usando linters (#16)\",\"text\":\"TL;DR Para melhorar a qualidade e consist\\u00eancia do c\\u00f3digo, use linters e formatadores.
Um linter \\u00e9 uma ferramenta autom\\u00e1tica para analisar c\\u00f3digo e detectar erros. O escopo desta se\\u00e7\\u00e3o n\\u00e3o \\u00e9 fornecer uma lista exaustiva dos linters existentes; caso contr\\u00e1rio, ele ficar\\u00e1 obsoleto rapidamente. Mas devemos entender e lembrar por que os linters s\\u00e3o essenciais para a maioria dos projetos Go.
No entanto, se voc\\u00ea n\\u00e3o \\u00e9 um usu\\u00e1rio regular de linters, aqui est\\u00e1 uma lista que voc\\u00ea pode usar diariamente:
https://golang.org/cmd/vet\\u2014A standard Go analyzer https://github.com/kisielk/errcheck\\u2014An error checker https://github.com/fzipp/gocyclo\\u2014A cyclomatic complexity analyzer https://github.com/jgautheron/goconst\\u2014A repeated string constants analyzer Al\\u00e9m dos linters, tamb\\u00e9m devemos usar formatadores de c\\u00f3digo para corrigir o estilo do c\\u00f3digo. Aqui est\\u00e1 uma lista de alguns formatadores de c\\u00f3digo para voc\\u00ea experimentar:
https://golang.org/cmd/gofmt\\u2014A standard Go code formatter https://godoc.org/golang.org/x/tools/cmd/goimports\\u2014A standard Go imports formatter Enquanto isso, devemos tamb\\u00e9m dar uma olhada em golangci-lint (https://github.com/golangci/golangci-lint). \\u00c9 uma ferramenta de linting que fornece uma fachada sobre muitos linters e formatadores \\u00fateis. Al\\u00e9m disso, permite executar os linters em paralelo para melhorar a velocidade de an\\u00e1lise, o que \\u00e9 bastante \\u00fatil.
Linters e formatadores s\\u00e3o uma forma poderosa de melhorar a qualidade e consist\\u00eancia de nossa base de c\\u00f3digo. Vamos dedicar um tempo para entender qual deles devemos usar e garantir que automatizamos sua execu\\u00e7\\u00e3o (como um precommit hook de CI ou Git).
\"},{\"location\":\"pt-br/#tipos-de-dados\",\"title\":\"Tipos de dados\",\"text\":\"\"},{\"location\":\"pt-br/#criando-confusao-com-literais-octais-17\",\"title\":\"Criando confus\\u00e3o com literais octais (#17)\",\"text\":\"TL;DR Ao ler o c\\u00f3digo existente, lembre-se de que literais inteiros come\\u00e7ando com 0 s\\u00e3o n\\u00fameros octais. Al\\u00e9m disso, para melhorar a legibilidade, torne os inteiros octais expl\\u00edcitos prefixando-os com 0o.
Os n\\u00fameros octais come\\u00e7am com 0 (por exemplo, 010 \\u00e9 igual a 8 na base 10). Para melhorar a legibilidade e evitar poss\\u00edveis erros para futuros leitores de c\\u00f3digo, devemos tornar os n\\u00fameros octais expl\\u00edcitos usando o prefixo 0o (por exemplo, 0o10).
Devemos tamb\\u00e9m observar as outras representa\\u00e7\\u00f5es literais inteiras:
Bin\\u00e1rio\\u2014Usa um prefixo 0b ou 0B(por exemplo, 0b100 \\u00e9 igual a 4 na base 10) Hexadecimal\\u2014Usa um prefixo 0x ou 0X (por exemplo, 0xF \\u00e9 igual a 15 na base 10) Imagin\\u00e1rio\\u2014Usa um i sufixo (por exemplo, 3i) Tamb\\u00e9m podemos usar um caractere de sublinhado (_) como separador para facilitar a leitura. Por exemplo, podemos escrever 1 bilh\\u00e3o desta forma: 1_000_000_000. Tamb\\u00e9m podemos usar o caractere sublinhado com outras representa\\u00e7\\u00f5es (por exemplo, 0b00_00_01).
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#negligenciando-estouros-de-numero-inteiro-18\",\"title\":\"Negligenciando estouros de n\\u00famero inteiro (#18)\",\"text\":\"TL;DR Como os overflows e underflows de n\\u00fameros inteiros s\\u00e3o tratados silenciosamente no Go, voc\\u00ea pode implementar suas pr\\u00f3prias fun\\u00e7\\u00f5es para captur\\u00e1-los.
No Go, um estouro de n\\u00famero inteiro que pode ser detectado em tempo de compila\\u00e7\\u00e3o gera um erro de compila\\u00e7\\u00e3o. Por exemplo,
var counter int32 = math.MaxInt32 + 1\\nconstant 2147483648 overflows int32\\nNo entanto, em tempo de execu\\u00e7\\u00e3o, um overflow ou underflow de inteiro \\u00e9 silencioso; isso n\\u00e3o leva ao p\\u00e2nico do aplicativo. \\u00c9 essencial ter esse comportamento em mente, pois ele pode levar a bugs sorrateiros (por exemplo, um incremento de n\\u00famero inteiro ou adi\\u00e7\\u00e3o de n\\u00fameros inteiros positivos que leva a um resultado negativo).
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-entendendo-os-pontos-flutuantes-19\",\"title\":\"N\\u00e3o entendendo os pontos flutuantes (#19)\",\"text\":\"TL;DR Fazer compara\\u00e7\\u00f5es de ponto flutuante dentro de um determinado delta pode garantir que seu c\\u00f3digo seja port\\u00e1til. Ao realizar adi\\u00e7\\u00e3o ou subtra\\u00e7\\u00e3o, agrupe as opera\\u00e7\\u00f5es com ordem de grandeza semelhante para favorecer a precis\\u00e3o. Al\\u00e9m disso, execute multiplica\\u00e7\\u00e3o e divis\\u00e3o antes da adi\\u00e7\\u00e3o e subtra\\u00e7\\u00e3o.
Em Go, existem dois tipos de ponto flutuante (se omitirmos os n\\u00fameros imagin\\u00e1rios): float32 e float64. O conceito de ponto flutuante foi inventado para resolver o principal problema dos n\\u00fameros inteiros: sua incapacidade de representar valores fracion\\u00e1rios. Para evitar surpresas desagrad\\u00e1veis, precisamos saber que a aritm\\u00e9tica de ponto flutuante \\u00e9 uma aproxima\\u00e7\\u00e3o da aritm\\u00e9tica real.
Para isso, veremos um exemplo de multiplica\\u00e7\\u00e3o:
var n float32 = 1.0001\\nfmt.Println(n * n)\\nPodemos esperar que este c\\u00f3digo imprima o resultado de 1.0001 * 1.0001 = 1,00020001, certo? No entanto, execut\\u00e1-lo na maioria dos processadores x86 imprime 1.0002.
Como os tipos float32 e float64 em Go s\\u00e3o aproxima\\u00e7\\u00f5es, temos que ter algumas regras em mente:
Ao comparar dois n\\u00fameros de ponto flutuante, verifique se a diferen\\u00e7a est\\u00e1 dentro de um intervalo aceit\\u00e1vel. Ao realizar adi\\u00e7\\u00f5es ou subtra\\u00e7\\u00f5es, agrupe opera\\u00e7\\u00f5es com ordem de magnitude semelhante para melhor precis\\u00e3o. Para favorecer a precis\\u00e3o, se uma sequ\\u00eancia de opera\\u00e7\\u00f5es exigir adi\\u00e7\\u00e3o, subtra\\u00e7\\u00e3o, multiplica\\u00e7\\u00e3o ou divis\\u00e3o, execute primeiro as opera\\u00e7\\u00f5es de multiplica\\u00e7\\u00e3o e divis\\u00e3o. C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-entendendo-o-comprimento-e-a-capacidade-de-slice-20\",\"title\":\"N\\u00e3o entendendo o comprimento e a capacidade de slice (#20)\",\"text\":\"TL;DR Compreender a diferen\\u00e7a entre comprimento e capacidade da slice deve fazer parte do conhecimento b\\u00e1sico de um desenvolvedor Go. O comprimento de slice \\u00e9 o n\\u00famero de elementos dispon\\u00edveis na slice, enquanto a capacidade de slice \\u00e9 o n\\u00famero de elementos na matriz de apoio.
Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#inicializacao-de-slice-ineficiente-21\",\"title\":\"Inicializa\\u00e7\\u00e3o de slice ineficiente (#21)\",\"text\":\"TL;DR Ao criar uma fatia, inicialize-a com um determinado comprimento ou capacidade se o seu comprimento j\\u00e1 for conhecido. Isso reduz o n\\u00famero de aloca\\u00e7\\u00f5es e melhora o desempenho.
Ao inicializar uma fatia usando make, podemos fornecer um comprimento e uma capacidade opcional. Esquecer de passar um valor apropriado para ambos os par\\u00e2metros quando faz sentido \\u00e9 um erro generalizado. Na verdade, isso pode levar a m\\u00faltiplas c\\u00f3pias e esfor\\u00e7o adicional para o GC limpar as matrizes de apoio tempor\\u00e1rias. Em termos de desempenho, n\\u00e3o h\\u00e1 uma boa raz\\u00e3o para n\\u00e3o ajudar o tempo de execu\\u00e7\\u00e3o do Go.
Nossas op\\u00e7\\u00f5es s\\u00e3o alocar uma fatia com determinada capacidade ou comprimento. Destas duas solu\\u00e7\\u00f5es, vimos que a segunda tende a ser um pouco mais r\\u00e1pida. Mas usar uma determinada capacidade e anexar pode ser mais f\\u00e1cil de implementar e ler em alguns contextos.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#estar-confuso-sobre-slice-nula-vs-slice-vazia-22\",\"title\":\"Estar confuso sobre slice nula vs. slice vazia (#22)\",\"text\":\"TL;DR To prevent common confusions such as when using the encoding/json or the reflect package, you need to understand the difference between nil and empty slices. Both are zero-length, zero-capacity slices, but only a nil slice doesn\\u2019t require allocation.
No Go, h\\u00e1 uma distin\\u00e7\\u00e3o entre slices nulas e vazias. Uma slice nula \\u00e9 igual a nil, enquanto uma slice vazia tem comprimento zero. Uma slice nula est\\u00e1 vazia, mas uma slice vazia n\\u00e3o \\u00e9 necessariamente nil. Enquanto isso, uma slice nula n\\u00e3o requer nenhuma aloca\\u00e7\\u00e3o. Vimos ao longo desta se\\u00e7\\u00e3o como inicializar uma slice dependendo do contexto usando
var s []string se n\\u00e3o tivermos certeza sobre o comprimento final e a fatia pode estar vazia[]string(nil) como a\\u00e7\\u00facar sint\\u00e1tico para criar uma fatia nula e vaziamake([]string, length) se o comprimento futuro for conhecido A \\u00faltima op\\u00e7\\u00e3o, []string{} deve ser evitada se inicializarmos a fatia sem elementos. Finalmente, vamos verificar se as bibliotecas que usamos fazem distin\\u00e7\\u00f5es entre fatias nulas e vazias para evitar comportamentos inesperados.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-verificar-corretamente-se-um-slice-esta-vazio-23\",\"title\":\"N\\u00e3o verificar corretamente se um slice est\\u00e1 vazio (#23)\",\"text\":\"TL;DR Para verificar se uma fatia n\\u00e3o cont\\u00e9m nenhum elemento, verifique seu comprimento. Esta verifica\\u00e7\\u00e3o funciona independentemente de o slice estar nil ou vazio. O mesmo vale para maps. Para projetar APIs inequ\\u00edvocas, voc\\u00ea n\\u00e3o deve distinguir entre slice nulos e vazios.
Para determinar se um slice possui elementos, podemos faz\\u00ea-lo verificando se o slice \\u00e9 nulo ou se seu comprimento \\u00e9 igual a 0. Verificar o comprimento \\u00e9 a melhor op\\u00e7\\u00e3o a seguir, pois cobrir\\u00e1 ambos se o slice estiver vazio ou se o slice \\u00e9 nulo.
Enquanto isso, ao projetar interfaces, devemos evitar distinguir slices nulos e vazios, o que leva a erros sutis de programa\\u00e7\\u00e3o. Ao retornar slices, n\\u00e3o deve haver diferen\\u00e7a sem\\u00e2ntica nem t\\u00e9cnica se retornarmos um slice nulo ou vazio. Ambos devem significar a mesma coisa para quem liga. Este princ\\u00edpio \\u00e9 o mesmo com maps. Para verificar se um map est\\u00e1 vazio, verifique seu comprimento, n\\u00e3o se \\u00e9 nulo.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-fazer-copias-de-slcies-corretamente-24\",\"title\":\"N\\u00e3o fazer c\\u00f3pias de slcies corretamente (#24)\",\"text\":\"TL;DR Para copiar um slice para outro usando a fun\\u00e7\\u00e3o copy, lembre-se que o n\\u00famero de elementos copiados corresponde ao m\\u00ednimo entre os comprimentos dos dois slices.
Copiar elementos de um slice para outro \\u00e9 uma opera\\u00e7\\u00e3o razoavelmente frequente. Ao utilizar a c\\u00f3pia, devemos lembrar que o n\\u00famero de elementos copiados para o destino corresponde ao m\\u00ednimo entre os comprimentos dos dois slices. Tenha tamb\\u00e9m em mente que existem outras alternativas para copiar um slice, por isso n\\u00e3o devemos nos surpreender se as encontrarmos em uma base de c\\u00f3digo.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#efeitos-colaterais-inesperados-usando-o-slice-append-25\",\"title\":\"Efeitos colaterais inesperados usando o slice append (#25)\",\"text\":\"TL;DR Usar copy ou a express\\u00e3o de slice completa \\u00e9 uma forma de evitar que append crie conflitos se duas fun\\u00e7\\u00f5es diferentes usarem slices apoiados pela mesmo array. No entanto, apenas uma c\\u00f3pia de slice evita vazamentos de mem\\u00f3ria se voc\\u00ea quiser reduzir um slice grande.
Ao usar o slicing, devemos lembrar que podemos enfrentar uma situa\\u00e7\\u00e3o que leva a efeitos colaterais n\\u00e3o intencionais. Se o slice resultante tiver um comprimento menor que sua capacidade, o acr\\u00e9scimo poder\\u00e1 alterar o slice original. Se quisermos restringir a gama de poss\\u00edveis efeitos colaterais, podemos usar uma c\\u00f3pia de slice ou a express\\u00e3o de slice completa, o que nos impede de fazer uma c\\u00f3pia.
Note s[low:high:max](express\\u00e3o de slice completo): Esta instru\\u00e7\\u00e3o cria um slice semelhante \\u00e0quele criado com s[low:high], exceto que a capacidade de slice resultante \\u00e9 igual a max - low.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#slices-e-vazamentos-de-memoria-26\",\"title\":\"Slices e vazamentos de mem\\u00f3ria (#26)\",\"text\":\"TL;DR Trabalhando com um slice de ponteiros ou estruturas com campos de ponteiro, voc\\u00ea pode evitar vazamentos de mem\\u00f3ria marcando como nulos os elementos exclu\\u00eddos por uma opera\\u00e7\\u00e3o de fatiamento.
\"},{\"location\":\"pt-br/#vazamento-de-capacidade\",\"title\":\"Vazamento de capacidade\",\"text\":\"Lembre-se de que fatiar um slice ou array grande pode levar a um potencial alto consumo de mem\\u00f3ria. O espa\\u00e7o restante n\\u00e3o ser\\u00e1 recuperado pelo GC e podemos manter um grande array de apoio, apesar de usarmos apenas alguns elementos. Usar uma c\\u00f3pia em slice \\u00e9 a solu\\u00e7\\u00e3o para evitar tal caso.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#slice-e-ponteiros\",\"title\":\"Slice e ponteiros\",\"text\":\"Quando usamos a opera\\u00e7\\u00e3o de fatiamento com ponteiros ou estruturas com campos de ponteiro, precisamos saber que o GC n\\u00e3o recuperar\\u00e1 esses elementos. Nesse caso, as duas op\\u00e7\\u00f5es s\\u00e3o realizar uma c\\u00f3pia ou marcar explicitamente os elementos restantes ou seus campos como nil.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#inicializacao-ineficiente-do-mapa-27\",\"title\":\"Inicializa\\u00e7\\u00e3o ineficiente do mapa (#27)\",\"text\":\"TL;DR Ao criar um mapa, inicialize-o com um determinado comprimento se o seu comprimento j\\u00e1 for conhecido. Isso reduz o n\\u00famero de aloca\\u00e7\\u00f5es e melhora o desempenho.
Um mapa fornece uma cole\\u00e7\\u00e3o n\\u00e3o ordenada de pares chave-valor em que todas as chaves s\\u00e3o distintas. No Go, um mapa \\u00e9 baseado na estrutura de dados da tabela hash. Internamente, uma tabela hash \\u00e9 uma matriz de intervalos e cada intervalo \\u00e9 um ponteiro para uma matriz de pares de valores-chave.
Se soubermos de antem\\u00e3o o n\\u00famero de elementos que um mapa conter\\u00e1, devemos cri\\u00e1-lo fornecendo um tamanho inicial. Fazer isso evita o crescimento potencial do mapa, o que \\u00e9 bastante pesado em termos de computa\\u00e7\\u00e3o porque requer a realoca\\u00e7\\u00e3o de espa\\u00e7o suficiente e o reequil\\u00edbrio de todos os elementos.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#mapas-e-vazamentos-de-memoria-28\",\"title\":\"Mapas e vazamentos de mem\\u00f3ria (#28)\",\"text\":\"TL;DR Um mapa sempre pode crescer na mem\\u00f3ria, mas nunca diminui. Portanto, se isso causar alguns problemas de mem\\u00f3ria, voc\\u00ea pode tentar diferentes op\\u00e7\\u00f5es, como for\\u00e7ar Go a recriar o mapa ou usar ponteiros.
Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#comparando-valores-incorretamente-29\",\"title\":\"Comparando valores incorretamente (#29)\",\"text\":\"TL;DR Para comparar tipos em Go, voc\\u00ea pode usar os operadores == e != se dois tipos forem compar\\u00e1veis: booleanos, numerais, strings, ponteiros, canais e estruturas s\\u00e3o compostos inteiramente de tipos compar\\u00e1veis. Caso contr\\u00e1rio, voc\\u00ea pode usar reflect.DeepEquale pagar o pre\\u00e7o da reflex\\u00e3o ou usar implementa\\u00e7\\u00f5es e bibliotecas personalizadas.
\\u00c9 essencial entender como usar == e != para fazer compara\\u00e7\\u00f5es de forma eficaz. Podemos usar esses operadores em operandos compar\\u00e1veis:
Booleans\\u2014Compara se dois booleanos s\\u00e3o iguais. Numerics (int, float, and complex types)\\u2014Compare se dois n\\u00fameros s\\u00e3o iguais. Strings\\u2014Compare se duas strings s\\u00e3o iguais. Channels\\u2014Compare se dois canais foram criados pela mesma chamada a ser feita ou se ambos s\\u00e3o nulos. Interfaces\\u2014Compare se duas interfaces t\\u00eam tipos din\\u00e2micos id\\u00eanticos e valores din\\u00e2micos iguais ou se ambas s\\u00e3o nulas. Pointers\\u2014Compare se dois ponteiros apontam para o mesmo valor na mem\\u00f3ria ou se ambos s\\u00e3o nulos. Structs and arrays\\u2014Compare se s\\u00e3o compostas de tipos semelhantes. Note Tamb\\u00e9m podemos usar os operadores ?, >=, < e > com tipos num\\u00e9ricos para comparar valores e com strings para comparar sua ordem lexical.
Se os operandos n\\u00e3o forem compar\\u00e1veis \\u200b\\u200b(por exemplo, slices e mapas), teremos que usar outras op\\u00e7\\u00f5es, como reflex\\u00e3o. A reflex\\u00e3o \\u00e9 uma forma de metaprograma\\u00e7\\u00e3o e se refere \\u00e0 capacidade de um aplicativo de introspectar e modificar sua estrutura e comportamento. Por exemplo, em Go, podemos usar reflect.DeepEqual. Esta fun\\u00e7\\u00e3o informa se dois elementos s\\u00e3o profundamente iguais percorrendo recursivamente dois valores. Os elementos que ele aceita s\\u00e3o tipos b\\u00e1sicos mais arrays, estruturas, slices, mapas, ponteiros, interfaces e fun\\u00e7\\u00f5es. No entanto, o principal problema \\u00e9 a penalidade de desempenho.
Se o desempenho for crucial em tempo de execu\\u00e7\\u00e3o, implementar nosso m\\u00e9todo customizado pode ser a melhor solu\\u00e7\\u00e3o. Uma observa\\u00e7\\u00e3o adicional: devemos lembrar que a biblioteca padr\\u00e3o possui alguns m\\u00e9todos de compara\\u00e7\\u00e3o existentes. Por exemplo, podemos usar a fun\\u00e7\\u00e3o bytes.Compare otimizada para comparar duas slices de bytes. Antes de implementar um m\\u00e9todo customizado, precisamos ter certeza de n\\u00e3o reinventar a roda.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#estruturas-de-controle\",\"title\":\"Estruturas de Controle\",\"text\":\"\"},{\"location\":\"pt-br/#ignorando-que-os-elementos-sao-copiados-em-loops-de-range-30\",\"title\":\"Ignorando que os elementos s\\u00e3o copiados em loops de range (#30)\",\"text\":\"TL;DR O elemento de valor em um loop de range \\u00e9 uma c\\u00f3pia. Portanto, para modificar uma struct, por exemplo, acesse-a atrav\\u00e9s de seu \\u00edndice ou atrav\\u00e9s de um loop for cl\\u00e1ssico (a menos que o elemento ou campo que voc\\u00ea deseja modificar seja um ponteiro).
Um range loop permite iterar em diferentes estruturas de dados:
String Array Pointer to an array Slice Map Receiving channel Comparado a um for loop cl\\u00e1ssico, um loop range \\u00e9 uma maneira conveniente de iterar todos os elementos de uma dessas estruturas de dados, gra\\u00e7as \\u00e0 sua sintaxe concisa.
Ainda assim, devemos lembrar que o elemento de valor em um range loop \\u00e9 uma c\\u00f3pia. Portanto, se o valor for uma estrutura que precisamos sofrer muta\\u00e7\\u00e3o, atualizaremos apenas a c\\u00f3pia, n\\u00e3o o elemento em si, a menos que o valor ou campo que modificamos seja um ponteiro. As op\\u00e7\\u00f5es preferidas s\\u00e3o acessar o elemento atrav\\u00e9s do \\u00edndice usando um range loop ou um loop for cl\\u00e1ssico.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-como-os-argumentos-sao-avaliados-em-range-loops-canais-e-arrays-31\",\"title\":\"Ignorando como os argumentos s\\u00e3o avaliados em range loops (canais e arrays) (#31)\",\"text\":\"TL;DR Entender que a express\\u00e3o passada ao operador range \\u00e9 avaliada apenas uma vez antes do in\\u00edcio do loop pode ajudar a evitar erros comuns, como atribui\\u00e7\\u00e3o ineficiente em canal ou itera\\u00e7\\u00e3o de slice.
O range loop avalia a express\\u00e3o fornecida apenas uma vez, antes do in\\u00edcio do loop, fazendo uma c\\u00f3pia (independentemente do tipo). Devemos lembrar deste comportamento para evitar erros comuns que podem, por exemplo, nos levar a acessar o elemento errado. Por exemplo:
a := [3]int{0, 1, 2}\\nfor i, v := range a {\\n a[2] = 10\\n if i == 2 {\\n fmt.Println(v)\\n }\\n}\\nEste c\\u00f3digo atualiza o \\u00faltimo \\u00edndice para 10. No entanto, se executarmos este c\\u00f3digo, ele n\\u00e3o imprimir\\u00e1 10; imprime 2.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-os-impactos-do-uso-de-elementos-ponteiros-em-range-loops-32\",\"title\":\"Ignorando os impactos do uso de elementos ponteiros em range loops (#32)\",\"text\":\"Warning Este erro n\\u00e3o \\u00e9 mais relevante no Go 1.22 (detalhes).
\"},{\"location\":\"pt-br/#fazendo-suposicoes-erradas-durante-as-iteracoes-de-maps-ordenacao-e-insercao-do-mapa-durante-a-iteracao-33\",\"title\":\"Fazendo suposi\\u00e7\\u00f5es erradas durante as itera\\u00e7\\u00f5es de maps (ordena\\u00e7\\u00e3o e inser\\u00e7\\u00e3o do mapa durante a itera\\u00e7\\u00e3o) (#33)\",\"text\":\"TL;DR Para garantir resultados previs\\u00edveis ao usar maps, lembre-se de que uma estrutura de dados de mapa:
N\\u00e3o ordena os dados por chaves N\\u00e3o preserva o pedido de inser\\u00e7\\u00e3o N\\u00e3o tem uma ordem de itera\\u00e7\\u00e3o determin\\u00edstica N\\u00e3o garante que um elemento adicionado durante uma itera\\u00e7\\u00e3o ser\\u00e1 produzido durante esta itera\\u00e7\\u00e3o C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-como-a-declaracao-break-funciona-34\",\"title\":\"Ignorando como a declara\\u00e7\\u00e3o break funciona (#34)\",\"text\":\"TL;DR Usar break ou continue com um r\\u00f3tulo imp\\u00f5e a quebra de uma instru\\u00e7\\u00e3o espec\\u00edfica. Isso pode ser \\u00fatil com instru\\u00e7\\u00f5es switch ou select dentro de loops.
Uma instru\\u00e7\\u00e3o break \\u00e9 comumente usada para encerrar a execu\\u00e7\\u00e3o de um loop. Quando loops s\\u00e3o usados \\u200b\\u200bem conjunto com switch ou select, os desenvolvedores frequentemente cometem o erro de quebrar a instru\\u00e7\\u00e3o errada. Por exemplo:
for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break\\n }\\n}\\nA instru\\u00e7\\u00e3o break n\\u00e3o encerra o loop for: em vez disso, ela encerra a instru\\u00e7\\u00e3o switch. Portanto, em vez de iterar de 0 a 2, este c\\u00f3digo itera de 0 a 4: 0 1 2 3 4.
Uma regra essencial a ter em mente \\u00e9 que uma instru\\u00e7\\u00e3o break encerra a execu\\u00e7\\u00e3o da instru\\u00e7\\u00e3o for, switch, ou mais interna select. No exemplo anterior, ele encerra a instru\\u00e7\\u00e3o switch.
Para quebrar o loop em vez da instru\\u00e7\\u00e3o switch, a maneira mais idiom\\u00e1tica \\u00e9 usar um r\\u00f3tulo:
loop:\\n for i := 0; i < 5; i++ {\\n fmt.Printf(\\\"%d \\\", i)\\n\\n switch i {\\n default:\\n case 2:\\n break loop\\n }\\n }\\nAqui, associamos o loopr\\u00f3tulo ao for loop. Ent\\u00e3o, como fornecemos o loop r\\u00f3tulo para a instru\\u00e7\\u00e3o break, ela interrompe o loop, n\\u00e3o a op\\u00e7\\u00e3o. Portanto, esta nova vers\\u00e3o ser\\u00e1 impressa 0 1 2, como esper\\u00e1vamos.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#usando-defer-dentro-de-um-loop-35\",\"title\":\"Usando defer dentro de um loop (#35)\",\"text\":\"TL;DR Extrair a l\\u00f3gica do loop dentro de uma fun\\u00e7\\u00e3o leva \\u00e0 execu\\u00e7\\u00e3o de uma instru\\u00e7\\u00e3o defer no final de cada itera\\u00e7\\u00e3o.
A instru\\u00e7\\u00e3o defer atrasa a execu\\u00e7\\u00e3o de uma chamada at\\u00e9 que a fun\\u00e7\\u00e3o circundante retorne. \\u00c9 usado principalmente para reduzir o c\\u00f3digo padr\\u00e3o. Por exemplo, se um recurso precisar ser fechado eventualmente, podemos usar defer para evitar a repeti\\u00e7\\u00e3o das chamadas de fechamento antes de cada return.
Um erro comum com defer \\u00e9 esquecer que ele agenda uma chamada de fun\\u00e7\\u00e3o quando a fun\\u00e7\\u00e3o circundante retorna. Por exemplo:
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // Do something with file\\n }\\n return nil\\n}\\nAs chamadas defer n\\u00e3o s\\u00e3o executadas durante cada itera\\u00e7\\u00e3o do loop, mas quando a fun\\u00e7\\u00e3o readFiles retorna. Se readFiles n\\u00e3o retornar, os descritores de arquivos ficar\\u00e3o abertos para sempre, causando vazamentos.
Uma op\\u00e7\\u00e3o comum para corrigir esse problema \\u00e9 criar uma fun\\u00e7\\u00e3o circundante ap\\u00f3s defer, chamada durante cada itera\\u00e7\\u00e3o:
func readFiles(ch <-chan string) error {\\n for path := range ch {\\n if err := readFile(path); err != nil {\\n return err\\n }\\n }\\n return nil\\n}\\n\\nfunc readFile(path string) error {\\n file, err := os.Open(path)\\n if err != nil {\\n return err\\n }\\n\\n defer file.Close()\\n\\n // Do something with file\\n return nil\\n}\\nOutra solu\\u00e7\\u00e3o \\u00e9 tornar a fun\\u00e7\\u00e3o readFile um encerramento, mas intrinsecamente, esta permanece a mesma solu\\u00e7\\u00e3o: adicionar outra fun\\u00e7\\u00e3o circundante para executar as chamadas defer durante cada itera\\u00e7\\u00e3o.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#strings\",\"title\":\"Strings\",\"text\":\"\"},{\"location\":\"pt-br/#nao-entendendo-o-conceito-de-rune-36\",\"title\":\"N\\u00e3o entendendo o conceito de rune (#36)\",\"text\":\"TL;DR Entender que uma runa corresponde ao conceito de um ponto de c\\u00f3digo Unicode e que pode ser composta de m\\u00faltiplos bytes deve fazer parte do conhecimento b\\u00e1sico do desenvolvedor Go para trabalhar com precis\\u00e3o com strings.
Como as runas est\\u00e3o por toda parte no Go, \\u00e9 importante entender o seguinte:
Um conjunto de caracteres \\u00e9 um conjunto de caracteres, enquanto uma codifica\\u00e7\\u00e3o descreve como traduzir um conjunto de caracteres em bin\\u00e1rio. No Go, uma string faz refer\\u00eancia a uma fatia imut\\u00e1vel de bytes arbitr\\u00e1rios. O c\\u00f3digo-fonte Go \\u00e9 codificado usando UTF-8. Portanto, todos os literais de string s\\u00e3o strings UTF-8. Mas como uma string pode conter bytes arbitr\\u00e1rios, se for obtida de outro lugar (n\\u00e3o do c\\u00f3digo-fonte), n\\u00e3o h\\u00e1 garantia de que seja baseada na codifica\\u00e7\\u00e3o UTF-8. A rune corresponde ao conceito de ponto de c\\u00f3digo Unicode, significando um item representado por um \\u00fanico valor. Usando UTF-8, um ponto de c\\u00f3digo Unicode pode ser codificado em 1 a 4 bytes. Usar len() na string em Go retorna o n\\u00famero de bytes, n\\u00e3o o n\\u00famero de runas. C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#iteracao-de-string-imprecisa-37\",\"title\":\"Itera\\u00e7\\u00e3o de string imprecisa (#37)\",\"text\":\"TL;DR Iterar em uma string com o operador range itera nas runas com o \\u00edndice correspondente ao \\u00edndice inicial da sequ\\u00eancia de bytes da runa. Para acessar um \\u00edndice de runa espec\\u00edfico (como a terceira runa), converta a string em um arquivo []rune.
Iterar em uma string \\u00e9 uma opera\\u00e7\\u00e3o comum para desenvolvedores. Talvez queiramos realizar uma opera\\u00e7\\u00e3o para cada runa na string ou implementar uma fun\\u00e7\\u00e3o personalizada para procurar uma substring espec\\u00edfica. Em ambos os casos, temos que iterar nas diferentes runas de uma string. Mas \\u00e9 f\\u00e1cil ficar confuso sobre como funciona a itera\\u00e7\\u00e3o.
For example, consider the following example:
s := \\\"h\\u00eallo\\\"\\nfor i := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, s[i])\\n}\\nfmt.Printf(\\\"len=%d\\\\n\\\", len(s))\\nposition 0: h\\nposition 1: \\u00c3\\nposition 3: l\\nposition 4: l\\nposition 5: o\\nlen=6\\nVamos destacar tr\\u00eas pontos que podem ser confusos:
A segunda runa \\u00e9 \\u00c3 na sa\\u00edda em vez de \\u00ea. Saltamos da posi\\u00e7\\u00e3o 1 para a posi\\u00e7\\u00e3o 3: o que h\\u00e1 na posi\\u00e7\\u00e3o 2? len retorna uma contagem de 6, enquanto s cont\\u00e9m apenas 5 runas. Vamos come\\u00e7ar com a \\u00faltima observa\\u00e7\\u00e3o. J\\u00e1 mencionamos que len retorna o n\\u00famero de bytes em uma string, n\\u00e3o o n\\u00famero de runas. Como atribu\\u00edmos uma string literal a s, s \\u00e9 uma string UTF-8. Enquanto isso, o caractere especial \\u201c\\u00ea\\u201d n\\u00e3o \\u00e9 codificado em um \\u00fanico byte; requer 2 bytes. Portanto, chamar len(s) retorna 6.
Enquanto isso, no exemplo anterior, temos que entender que n\\u00e3o repetimos cada runa; em vez disso, iteramos sobre cada \\u00edndice inicial de uma runa:
Imprimir s[i] n\\u00e3o imprime a i-\\u00e9sima runa; imprime a representa\\u00e7\\u00e3o UTF-8 do byte em index i. Portanto, imprimimos \\\"h\\u00c3llo\\\" em vez de \\\"h\\u00eallo\\\".
Se quisermos imprimir todas as diferentes runas, podemos usar o elemento value do operador range:
s := \\\"h\\u00eallo\\\"\\nfor i, r := range s {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\nOu podemos converter a string em uma fatia de runas e iterar sobre ela:
s := \\\"h\\u00eallo\\\"\\nrunes := []rune(s)\\nfor i, r := range runes {\\n fmt.Printf(\\\"position %d: %c\\\\n\\\", i, r)\\n}\\nObserve que esta solu\\u00e7\\u00e3o introduz uma sobrecarga de tempo de execu\\u00e7\\u00e3o em compara\\u00e7\\u00e3o com a anterior. Na verdade, converter uma string em uma fatia de runas requer a aloca\\u00e7\\u00e3o de uma fatia adicional e a convers\\u00e3o dos bytes em runas: uma complexidade de tempo O(n) com n o n\\u00famero de bytes na string. Portanto, se quisermos iterar todas as runas, devemos usar a primeira solu\\u00e7\\u00e3o.
Por\\u00e9m, se quisermos acessar a i-\\u00e9sima runa de uma string com a primeira op\\u00e7\\u00e3o, n\\u00e3o teremos acesso ao \\u00edndice da runa; em vez disso, conhecemos o \\u00edndice inicial de uma runa na sequ\\u00eancia de bytes.
s := \\\"h\\u00eallo\\\"\\nr := []rune(s)[4]\\nfmt.Printf(\\\"%c\\\\n\\\", r) // o\\n C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#uso-indevido-de-funcoes-de-trim-38\",\"title\":\"Uso indevido de fun\\u00e7\\u00f5es de trim (#38)\",\"text\":\"TL;DR strings.TrimRight/strings.TrimLeft remove todas as runas finais/iniciais contidas em um determinado conjunto, enquanto strings.TrimSuffix/strings.TrimPrefix retorna uma string sem um sufixo/prefixo fornecido.
Por exemplo:
fmt.Println(strings.TrimRight(\\\"123oxo\\\", \\\"xo\\\"))\\nO exemplo imprime 123:
Por outro lado, strings.TrimLeft remove todas as runas principais contidas em um conjunto.
Por outro lado, strings.TrimSuffix/strings.TrimPrefix retorna uma string sem o sufixo/prefixo final fornecido.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#concatenacao-de-strings-subotimizada-39\",\"title\":\"Concatena\\u00e7\\u00e3o de strings subotimizada (#39)\",\"text\":\"TL;DR A concatena\\u00e7\\u00e3o de uma lista de strings deve ser feita com strings.Builder para evitar a aloca\\u00e7\\u00e3o de uma nova string durante cada itera\\u00e7\\u00e3o.
Vamos considerar uma fun\\u00e7\\u00e3o concat que concatena todos os elementos string de uma fatia usando o operador +=:
func concat(values []string) string {\\n s := \\\"\\\"\\n for _, value := range values {\\n s += value\\n }\\n return s\\n}\\nDurante cada itera\\u00e7\\u00e3o, o operador += concatena com s a sequ\\u00eancia de valores. \\u00c0 primeira vista, esta fun\\u00e7\\u00e3o pode n\\u00e3o parecer errada. Mas com esta implementa\\u00e7\\u00e3o, esquecemos uma das principais caracter\\u00edsticas de uma string: a sua imutabilidade. Portanto, cada itera\\u00e7\\u00e3o n\\u00e3o \\u00e9 atualizada s; ele realoca uma nova string na mem\\u00f3ria, o que impacta significativamente o desempenho desta fun\\u00e7\\u00e3o.
Felizmente, existe uma solu\\u00e7\\u00e3o para lidar com esse problema, usando strings.Builder:
func concat(values []string) string {\\n sb := strings.Builder{}\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\nDurante cada itera\\u00e7\\u00e3o, constru\\u00edmos a string resultante chamando o m\\u00e9todo WriteString que anexa o conte\\u00fado do valor ao seu buffer interno, minimizando assim a c\\u00f3pia da mem\\u00f3ria.
Note WriteString retorna um erro como segunda sa\\u00edda, mas n\\u00f3s o ignoramos propositalmente. Na verdade, este m\\u00e9todo nunca retornar\\u00e1 um erro diferente de zero. Ent\\u00e3o, qual \\u00e9 o prop\\u00f3sito deste m\\u00e9todo retornar um erro como parte de sua assinatura? strings.Builder implementa a io.StringWriter interface, que cont\\u00e9m um \\u00fanico m\\u00e9todo: WriteString(s string) (n int, err error). Portanto, para estar em conformidade com esta interface, WriteString deve retornar um erro.
Internamente, strings.Builder cont\\u00e9m uma fatia de bytes. Cada chamada para WriteString resulta em uma chamada para anexar nesta fatia. Existem dois impactos. Primeiro, esta estrutura n\\u00e3o deve ser usada simultaneamente, pois as chamadas append levariam a condi\\u00e7\\u00f5es de corrida. O segundo impacto \\u00e9 algo que vimos no mistake #21, \\\"Inicializa\\u00e7\\u00e3o de slice ineficiente\\\": se o comprimento futuro de uma slice j\\u00e1 for conhecido, devemos pr\\u00e9-aloc\\u00e1-la. Para isso, strings.Builder exp\\u00f5e um m\\u00e9todo Grow(n int) para garantir espa\\u00e7o para outros n bytes:
func concat(values []string) string {\\n total := 0\\n for i := 0; i < len(values); i++ {\\n total += len(values[i])\\n }\\n\\n sb := strings.Builder{}\\n sb.Grow(total) (2)\\n for _, value := range values {\\n _, _ = sb.WriteString(value)\\n }\\n return sb.String()\\n}\\nVamos executar um benchmark para comparar as tr\\u00eas vers\\u00f5es (v1 usando +=; v2 usando strings.Builder{} sem pr\\u00e9-aloca\\u00e7\\u00e3o; e v3 usando strings.Builder{} com pr\\u00e9-aloca\\u00e7\\u00e3o). A slice de entrada cont\\u00e9m 1.000 strings e cada string cont\\u00e9m 1.000 bytes:
BenchmarkConcatV1-4 16 72291485 ns/op\\nBenchmarkConcatV2-4 1188 878962 ns/op\\nBenchmarkConcatV3-4 5922 190340 ns/op\\nComo podemos ver, a vers\\u00e3o mais recente \\u00e9 de longe a mais eficiente: 99% mais r\\u00e1pida que a v1 e 78% mais r\\u00e1pida que a v2.
strings.Builder \\u00e9 a solu\\u00e7\\u00e3o recomendada para concatenar uma lista de strings. Normalmente, esta solu\\u00e7\\u00e3o deve ser usada dentro de um loop. Na verdade, se precisarmos apenas concatenar algumas strings (como um nome e um sobrenome), o uso strings.Builder n\\u00e3o \\u00e9 recomendado, pois isso tornar\\u00e1 o c\\u00f3digo um pouco menos leg\\u00edvel do que usar o operador += or fmt.Sprintf.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#conversoes-de-string-inuteis-40\",\"title\":\"Convers\\u00f5es de string in\\u00fateis (#40)\",\"text\":\"TL;DR Lembrar que o pacote bytes oferece as mesmas opera\\u00e7\\u00f5es que o pacote strings pode ajudar a evitar convers\\u00f5es extras de bytes/string.
Ao optar por trabalhar com uma string ou um []byte, a maioria dos programadores tende a preferir strings por conveni\\u00eancia. Mas a maior parte da E/S \\u00e9 realmente feita com []byte. Por exemplo, io.Reader, io.Writer e io.ReadAll trabalham com []byte, n\\u00e3o com strings.
Quando nos perguntamos se devemos trabalhar com strings ou []byte, lembremos que trabalhar com []byten\\u00e3o \\u00e9 necessariamente menos conveniente. Na verdade, todas as fun\\u00e7\\u00f5es exportadas do pacote strings tamb\\u00e9m possuem alternativas no pacote bytes: Split, Count, Contains, Index e assim por diante. Portanto, estejamos fazendo I/O ou n\\u00e3o, devemos primeiro verificar se poder\\u00edamos implementar um fluxo de trabalho completo usando bytes em vez de strings e evitar o pre\\u00e7o de convers\\u00f5es adicionais.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#vazamentos-de-substring-e-memoria-41\",\"title\":\"Vazamentos de substring e mem\\u00f3ria (#41)\",\"text\":\"TL;DR Usar c\\u00f3pias em vez de substrings pode evitar vazamentos de mem\\u00f3ria, pois a string retornada por uma opera\\u00e7\\u00e3o de substring ser\\u00e1 apoiada pela mesma matriz de bytes.
In mistake #26, \\u201cSlices and memory leaks,\\u201d we saw how slicing a slice or array may lead to memory leak situations. This principle also applies to string and substring operations.
We need to keep two things in mind while using the substring operation in Go. First, the interval provided is based on the number of bytes, not the number of runes. Second, a substring operation may lead to a memory leak as the resulting substring will share the same backing array as the initial string. The solutions to prevent this case from happening are to perform a string copy manually or to use strings.Clone from Go 1.18.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#functions-and-methods\",\"title\":\"Functions and Methods\",\"text\":\"\"},{\"location\":\"pt-br/#nao-saber-que-tipo-de-receptor-usar-42\",\"title\":\"N\\u00e3o saber que tipo de receptor usar (#42)\",\"text\":\"TL;DR A decis\\u00e3o de usar um valor ou um receptor de ponteiro deve ser tomada com base em fatores como o tipo, se deve sofrer muta\\u00e7\\u00e3o, se cont\\u00e9m um campo que n\\u00e3o pode ser copiado e o tamanho do objeto. Em caso de d\\u00favida, use um receptor de ponteiro.
Choosing between value and pointer receivers isn\\u2019t always straightforward. Let\\u2019s discuss some of the conditions to help us choose.
A receiver must be a pointer
If the method needs to mutate the receiver. This rule is also valid if the receiver is a slice and a method needs to append elements: type slice []int\\n\\nfunc (s *slice) add(element int) {\\n *s = append(*s, element)\\n}\\n If the method receiver contains a field that cannot be copied: for example, a type part of the sync package (see #74, \\u201cCopying a sync type\\u201d). A receiver should be a pointer
If the receiver is a large object. Using a pointer can make the call more efficient, as doing so prevents making an extensive copy. When in doubt about how large is large, benchmarking can be the solution; it\\u2019s pretty much impossible to state a specific size, because it depends on many factors. A receiver must be a value
If we have to enforce a receiver\\u2019s immutability. If the receiver is a map, function, or channel. Otherwise, a compilation error occurs. A receiver should be a value
If the receiver is a slice that doesn\\u2019t have to be mutated. If the receiver is a small array or struct that is naturally a value type without mutable fields, such as time.Time. If the receiver is a basic type such as int, float64, or string. Of course, it\\u2019s impossible to be exhaustive, as there will always be edge cases, but this section\\u2019s goal was to provide guidance to cover most cases. By default, we can choose to go with a value receiver unless there\\u2019s a good reason not to do so. In doubt, we should use a pointer receiver.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nunca-usando-parametros-de-resultado-nomeados-43\",\"title\":\"Nunca usando par\\u00e2metros de resultado nomeados (#43)\",\"text\":\"TL;DR Usar par\\u00e2metros de resultado nomeados pode ser uma maneira eficiente de melhorar a legibilidade de uma fun\\u00e7\\u00e3o/m\\u00e9todo, especialmente se v\\u00e1rios par\\u00e2metros de resultado tiverem o mesmo tipo. Em alguns casos, esta abordagem tamb\\u00e9m pode ser conveniente porque os par\\u00e2metros de resultado nomeados s\\u00e3o inicializados com seu valor zero. Mas tenha cuidado com os poss\\u00edveis efeitos colaterais.
When we return parameters in a function or a method, we can attach names to these parameters and use them as regular variables. When a result parameter is named, it\\u2019s initialized to its zero value when the function/method begins. With named result parameters, we can also call a naked return statement (without arguments). In that case, the current values of the result parameters are used as the returned values.
Here\\u2019s an example that uses a named result parameter b:
func f(a int) (b int) {\\n b = a\\n return\\n}\\nIn this example, we attach a name to the result parameter: b. When we call return without arguments, it returns the current value of b.
In some cases, named result parameters can also increase readability: for example, if two parameters have the same type. In other cases, they can also be used for convenience. Therefore, we should use named result parameters sparingly when there\\u2019s a clear benefit.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#efeitos-colaterais-nao-intencionais-com-parametros-de-resultado-nomeados-44\",\"title\":\"Efeitos colaterais n\\u00e3o intencionais com par\\u00e2metros de resultado nomeados (#44)\",\"text\":\"TL;DR Consulte #43.
We mentioned why named result parameters can be useful in some situations. But as these result parameters are initialized to their zero value, using them can sometimes lead to subtle bugs if we\\u2019re not careful enough. For example, can you spot what\\u2019s wrong with this code?
func (l loc) getCoordinates(ctx context.Context, address string) (\\n lat, lng float32, err error) {\\n isValid := l.validateAddress(address) (1)\\n if !isValid {\\n return 0, 0, errors.New(\\\"invalid address\\\")\\n }\\n\\n if ctx.Err() != nil { (2)\\n return 0, 0, err\\n }\\n\\n // Get and return coordinates\\n}\\nThe error might not be obvious at first glance. Here, the error returned in the if ctx.Err() != nil scope is err. But we haven\\u2019t assigned any value to the err variable. It\\u2019s still assigned to the zero value of an error type: nil. Hence, this code will always return a nil error.
When using named result parameters, we must recall that each parameter is initialized to its zero value. As we have seen in this section, this can lead to subtle bugs that aren\\u2019t always straightforward to spot while reading code. Therefore, let\\u2019s remain cautious when using named result parameters, to avoid potential side effects.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#retornando-um-receptor-nulo-45\",\"title\":\"Retornando um receptor nulo (#45)\",\"text\":\"TL;DR Ao retornar uma interface, tenha cuidado para n\\u00e3o retornar um ponteiro nulo, mas um valor nulo expl\\u00edcito. Caso contr\\u00e1rio, poder\\u00e3o ocorrer consequ\\u00eancias n\\u00e3o intencionais e o chamador receber\\u00e1 um valor diferente de zero.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#usando-um-nome-de-arquivo-como-entrada-de-funcao-46\",\"title\":\"Usando um nome de arquivo como entrada de fun\\u00e7\\u00e3o (#46)\",\"text\":\"TL;DR Projetar fun\\u00e7\\u00f5es para receber tipos io.Reader em vez de nomes de arquivos melhora a capacidade de reutiliza\\u00e7\\u00e3o de uma fun\\u00e7\\u00e3o e facilita o teste.
Accepting a filename as a function input to read from a file should, in most cases, be considered a code smell (except in specific functions such as os.Open). Indeed, it makes unit tests more complex because we may have to create multiple files. It also reduces the reusability of a function (although not all functions are meant to be reused). Using the io.Reader interface abstracts the data source. Regardless of whether the input is a file, a string, an HTTP request, or a gRPC request, the implementation can be reused and easily tested.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-como-argumentos-defer-e-receptores-sao-avaliados-avaliacao-de-argumentos-ponteiros-e-receptores-de-valor-47\",\"title\":\"Ignorando como argumentos defer e receptores s\\u00e3o avaliados (avalia\\u00e7\\u00e3o de argumentos, ponteiros e receptores de valor) (#47)\",\"text\":\"TL;DR Passar um ponteiro para uma fun\\u00e7\\u00e3o defer e agrupar uma chamada dentro de um closure s\\u00e3o duas solu\\u00e7\\u00f5es poss\\u00edveis para superar a avalia\\u00e7\\u00e3o imediata de argumentos e receptores.
In a defer function the arguments are evaluated right away, not once the surrounding function returns. For example, in this code, we always call notify and incrementCounter with the same status: an empty string.
const (\\n StatusSuccess = \\\"success\\\"\\n StatusErrorFoo = \\\"error_foo\\\"\\n StatusErrorBar = \\\"error_bar\\\"\\n)\\n\\nfunc f() error {\\n var status string\\n defer notify(status)\\n defer incrementCounter(status)\\n\\n if err := foo(); err != nil {\\n status = StatusErrorFoo\\n return err\\n }\\n\\n if err := bar(); err != nil {\\n status = StatusErrorBar\\n return err\\n }\\n\\n status = StatusSuccess <5>\\n return nil\\n}\\nIndeed, we call notify(status) and incrementCounter(status) as defer functions. Therefore, Go will delay these calls to be executed once f returns with the current value of status at the stage we used defer, hence passing an empty string.
Two leading options if we want to keep using defer.
The first solution is to pass a string pointer:
func f() error {\\n var status string\\n defer notify(&status) \\n defer incrementCounter(&status)\\n\\n // The rest of the function unchanged\\n}\\nUsing defer evaluates the arguments right away: here, the address of status. Yes, status itself is modified throughout the function, but its address remains constant, regardless of the assignments. Hence, if notify or incrementCounter uses the value referenced by the string pointer, it will work as expected. But this solution requires changing the signature of the two functions, which may not always be possible.
There\\u2019s another solution: calling a closure (an anonymous function value that references variables from outside its body) as a defer statement:
func f() error {\\n var status string\\n defer func() {\\n notify(status)\\n incrementCounter(status)\\n }()\\n\\n // The rest of the function unchanged\\n}\\nHere, we wrap the calls to both notify and incrementCounter within a closure. This closure references the status variable from outside its body. Therefore, status is evaluated once the closure is executed, not when we call defer. This solution also works and doesn\\u2019t require notify and incrementCounter to change their signature.
Let's also note this behavior applies with method receiver: the receiver is evaluated immediately.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#error-management\",\"title\":\"Error Management\",\"text\":\"\"},{\"location\":\"pt-br/#panico-48\",\"title\":\"P\\u00e2nico (#48)\",\"text\":\"TL;DR Usar panic \\u00e9 uma op\\u00e7\\u00e3o para lidar com erros no Go. No entanto, s\\u00f3 deve ser usado com modera\\u00e7\\u00e3o em condi\\u00e7\\u00f5es irrecuper\\u00e1veis: por exemplo, para sinalizar um erro do programador ou quando voc\\u00ea n\\u00e3o consegue carregar uma depend\\u00eancia obrigat\\u00f3ria.
In Go, panic is a built-in function that stops the ordinary flow:
func main() {\\n fmt.Println(\\\"a\\\")\\n panic(\\\"foo\\\")\\n fmt.Println(\\\"b\\\")\\n}\\nThis code prints a and then stops before printing b:
a\\npanic: foo\\n\\ngoroutine 1 [running]:\\nmain.main()\\n main.go:7 +0xb3\\nPanicking in Go should be used sparingly. There are two prominent cases, one to signal a programmer error (e.g., sql.Register that panics if the driver is nil or has already been register) and another where our application fails to create a mandatory dependency. Hence, exceptional conditions that lead us to stop the application. In most other cases, error management should be done with a function that returns a proper error type as the last return argument.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ignorando-quando-embrulhar-um-erro-49\",\"title\":\"Ignorando quando embrulhar um erro (#49)\",\"text\":\"TL;DR Embrulhar um erro permite marcar um erro e/ou fornecer contexto adicional. No entanto, o agrupamento de erros cria um acoplamento potencial, pois disponibiliza o erro de origem para o chamador. Se voc\\u00ea quiser evitar isso, n\\u00e3o use a agrupamento autom\\u00e1tico de erros.
Since Go 1.13, the %w directive allows us to wrap errors conveniently. Error wrapping is about wrapping or packing an error inside a wrapper container that also makes the source error available. In general, the two main use cases for error wrapping are the following:
Adding additional context to an error Marking an error as a specific error When handling an error, we can decide to wrap it. Wrapping is about adding additional context to an error and/or marking an error as a specific type. If we need to mark an error, we should create a custom error type. However, if we just want to add extra context, we should use fmt.Errorf with the %w directive as it doesn\\u2019t require creating a new error type. Yet, error wrapping creates potential coupling as it makes the source error available for the caller. If we want to prevent it, we shouldn\\u2019t use error wrapping but error transformation, for example, using fmt.Errorf with the %v directive.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#comparando-um-tipo-de-erro-de-forma-imprecisa-50\",\"title\":\"Comparando um tipo de erro de forma imprecisa (#50)\",\"text\":\"TL;DR Se voc\\u00ea usar o agrupamento de erros do Go 1.13 com a diretiva %w e fmt.Errorf, a compara\\u00e7\\u00e3o de um erro com um tipo dever\\u00e1 ser feita usando errors.As. Caso contr\\u00e1rio, se o erro retornado que voc\\u00ea deseja verificar for embrulhado, as verifica\\u00e7\\u00f5es falhar\\u00e3o.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#comparando-um-valor-de-erro-incorretamente-51\",\"title\":\"Comparando um valor de erro incorretamente (#51)\",\"text\":\"TL;DR Se voc\\u00ea usar o agrupamento de erros do Go 1.13 com a diretiva %w e fmt.Errorf, a compara\\u00e7\\u00e3o de um erro ou de um valor dever\\u00e1 ser feita usando errors.As. Caso contr\\u00e1rio, se o erro retornado que voc\\u00ea deseja verificar for embrulhado, as verifica\\u00e7\\u00f5es falhar\\u00e3o.
A sentinel error is an error defined as a global variable:
import \\\"errors\\\"\\n\\nvar ErrFoo = errors.New(\\\"foo\\\")\\nIn general, the convention is to start with Err followed by the error type: here, ErrFoo. A sentinel error conveys an expected error, an error that clients will expect to check. As general guidelines:
Expected errors should be designed as error values (sentinel errors): var ErrFoo = errors.New(\\\"foo\\\"). Unexpected errors should be designed as error types: type BarError struct { ... }, with BarError implementing the error interface. If we use error wrapping in our application with the %w directive and fmt.Errorf, checking an error against a specific value should be done using errors.Is instead of ==. Thus, even if the sentinel error is wrapped, errors.Is can recursively unwrap it and compare each error in the chain against the provided value.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#lidando-com-um-erro-duas-vezes-52\",\"title\":\"Lidando com um erro duas vezes (#52)\",\"text\":\"TL;DR Na maioria das situa\\u00e7\\u00f5es, um erro deve ser tratado apenas uma vez. Registrar um erro \\u00e9 tratar um erro. Portanto, voc\\u00ea deve escolher entre registrar ou retornar um erro. Em muitos casos, o embrulho autom\\u00e1tico de erros \\u00e9 a solu\\u00e7\\u00e3o, pois permite fornecer contexto adicional a um erro e retornar o erro de origem.
Handling an error multiple times is a mistake made frequently by developers, not specifically in Go. This can cause situations where the same error is logged multiple times make debugging harder.
Let's remind us that handling an error should be done only once. Logging an error is handling an error. Hence, we should either log or return an error. By doing this, we simplify our code and gain better insights into the error situation. Using error wrapping is the most convenient approach as it allows us to propagate the source error and add context to an error.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-tratando-de-um-erro-53\",\"title\":\"N\\u00e3o tratando de um erro (#53)\",\"text\":\"TL;DR Ignorar um erro, seja durante uma chamada de fun\\u00e7\\u00e3o ou em uma fun\\u00e7\\u00e3o defer, deve ser feito explicitamente usando o identificador em branco. Caso contr\\u00e1rio, os futuros leitores poder\\u00e3o ficar confusos sobre se foi intencional ou um erro.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-tratando-erros-de-defer-54\",\"title\":\"N\\u00e3o tratando erros de defer (#54)\",\"text\":\"TL;DR Em muitos casos, voc\\u00ea n\\u00e3o deve ignorar um erro retornado por uma fun\\u00e7\\u00e3o defer. Manipule-o diretamente ou propague-o para o chamador, dependendo do contexto. Se voc\\u00ea quiser ignor\\u00e1-lo, use o identificador em branco.
Consider the following code:
func f() {\\n // ...\\n notify() // Error handling is omitted\\n}\\n\\nfunc notify() error {\\n // ...\\n}\\nFrom a maintainability perspective, the code can lead to some issues. Let\\u2019s consider a new reader looking at it. This reader notices that notify returns an error but that the error isn\\u2019t handled by the parent function. How can they guess whether or not handling the error was intentional? How can they know whether the previous developer forgot to handle it or did it purposely?
For these reasons, when we want to ignore an error, there's only one way to do it, using the blank identifier (_):
_ = notify\\nIn terms of compilation and run time, this approach doesn\\u2019t change anything compared to the first piece of code. But this new version makes explicit that we aren\\u2019t interested in the error. Also, we can add a comment that indicates the rationale for why an error is ignored:
// At-most once delivery.\\n// Hence, it's accepted to miss some of them in case of errors.\\n_ = notify()\\n C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#concurrency-foundations\",\"title\":\"Concurrency: Foundations\",\"text\":\"\"},{\"location\":\"pt-br/#misturando-simultaneidade-e-paralelismo-55\",\"title\":\"Misturando simultaneidade e paralelismo (#55)\",\"text\":\"TL;DR Compreender as diferen\\u00e7as fundamentais entre simultaneidade e paralelismo \\u00e9 a base do conhecimento do desenvolvedor Go. A simultaneidade tem a ver com estrutura, enquanto o paralelismo tem a ver com execu\\u00e7\\u00e3o.
Concurrency and parallelism are not the same:
Concurrency is about structure. We can change a sequential implementation into a concurrent one by introducing different steps that separate concurrent goroutines can tackle. Meanwhile, parallelism is about execution. We can use parallism at the steps level by adding more parallel goroutines. In summary, concurrency provides a structure to solve a problem with parts that may be parallelized. Therefore, concurrency enables parallelism.
\"},{\"location\":\"pt-br/#pensar-que-a-simultaneidade-e-sempre-mais-rapida-56\",\"title\":\"Pensar que a simultaneidade \\u00e9 sempre mais r\\u00e1pida (#56)\",\"text\":\"TL;DR Para ser um desenvolvedor proficiente, voc\\u00ea deve reconhecer que a simultaneidade nem sempre \\u00e9 mais r\\u00e1pida. As solu\\u00e7\\u00f5es que envolvem a paraleliza\\u00e7\\u00e3o de cargas de trabalho m\\u00ednimas podem n\\u00e3o ser necessariamente mais r\\u00e1pidas do que uma implementa\\u00e7\\u00e3o sequencial. A avalia\\u00e7\\u00e3o comparativa de solu\\u00e7\\u00f5es sequenciais versus solu\\u00e7\\u00f5es simult\\u00e2neas deve ser a forma de validar suposi\\u00e7\\u00f5es.
Read the full section here.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ficar-confuso-sobre-quando-usar-canais-ou-mutexes-57\",\"title\":\"Ficar confuso sobre quando usar canais ou mutexes (#57)\",\"text\":\"TL;DR Estar ciente das intera\\u00e7\\u00f5es goroutine tamb\\u00e9m pode ser \\u00fatil ao decidir entre canais e mutexes. Em geral, goroutines paralelas requerem sincroniza\\u00e7\\u00e3o e, portanto, mutexes. Por outro lado, goroutines simult\\u00e2neas geralmente requerem coordena\\u00e7\\u00e3o e orquestra\\u00e7\\u00e3o e, portanto, canais.
Given a concurrency problem, it may not always be clear whether we can implement a solution using channels or mutexes. Because Go promotes sharing memory by communication, one mistake could be to always force the use of channels, regardless of the use case. However, we should see the two options as complementary.
When should we use channels or mutexes? We will use the example in the next figure as a backbone. Our example has three different goroutines with specific relationships:
G1 and G2 are parallel goroutines. They may be two goroutines executing the same function that keeps receiving messages from a channel, or perhaps two goroutines executing the same HTTP handler at the same time. On the other hand, G1 and G3 are concurrent goroutines, as are G2 and G3. All the goroutines are part of an overall concurrent structure, but G1 and G2 perform the first step, whereas G3 does the next step. In general, parallel goroutines have to synchronize: for example, when they need to access or mutate a shared resource such as a slice. Synchronization is enforced with mutexes but not with any channel types (not with buffered channels). Hence, in general, synchronization between parallel goroutines should be achieved via mutexes.
Conversely, in general, concurrent goroutines have to coordinate and orchestrate. For example, if G3 needs to aggregate results from both G1 and G2, G1 and G2 need to signal to G3 that a new intermediate result is available. This coordination falls under the scope of communication\\u2014therefore, channels.
Regarding concurrent goroutines, there\\u2019s also the case where we want to transfer the ownership of a resource from one step (G1 and G2) to another (G3); for example, if G1 and G2 are enriching a shared resource and at some point, we consider this job as complete. Here, we should use channels to signal that a specific resource is ready and handle the ownership transfer.
Mutexes and channels have different semantics. Whenever we want to share a state or access a shared resource, mutexes ensure exclusive access to this resource. Conversely, channels are a mechanic for signaling with or without data (chan struct{} or not). Coordination or ownership transfer should be achieved via channels. It\\u2019s important to know whether goroutines are parallel or concurrent because, in general, we need mutexes for parallel goroutines and channels for concurrent ones.
\"},{\"location\":\"pt-br/#nao-entender-os-problemas-de-corrida-corridas-de-dados-vs-condicoes-de-corrida-e-o-modelo-de-memoria-go-58\",\"title\":\"N\\u00e3o entender os problemas de corrida (corridas de dados vs. condi\\u00e7\\u00f5es de corrida e o modelo de mem\\u00f3ria Go) (#58)\",\"text\":\"TL;DR Ser proficiente em simultaneidade tamb\\u00e9m significa compreender que corridas de dados e condi\\u00e7\\u00f5es de corrida s\\u00e3o conceitos diferentes. As corridas de dados ocorrem quando v\\u00e1rias goroutines acessam simultaneamente o mesmo local de mem\\u00f3ria e pelo menos uma delas est\\u00e1 gravando. Enquanto isso, estar livre de disputa de dados n\\u00e3o significa necessariamente execu\\u00e7\\u00e3o determin\\u00edstica. Quando um comportamento depende da sequ\\u00eancia ou do tempo de eventos que n\\u00e3o podem ser controlados, esta \\u00e9 uma condi\\u00e7\\u00e3o de corrida.
Race problems can be among the hardest and most insidious bugs a programmer can face. As Go developers, we must understand crucial aspects such as data races and race conditions, their possible impacts, and how to avoid them.
\"},{\"location\":\"pt-br/#data-race\",\"title\":\"Data Race\",\"text\":\"A data race occurs when two or more goroutines simultaneously access the same memory location and at least one is writing. In this case, the result can be hazardous. Even worse, in some situations, the memory location may end up holding a value containing a meaningless combination of bits.
We can prevent a data race from happening using different techniques. For example:
Using the sync/atomic package In synchronizing the two goroutines with an ad hoc data structure like a mutex Using channels to make the two goroutines communicating to ensure that a variable is updated by only one goroutine at a time \"},{\"location\":\"pt-br/#race-condition\",\"title\":\"Race Condition\",\"text\":\"Depending on the operation we want to perform, does a data-race-free application necessarily mean a deterministic result? Not necessarily.
A race condition occurs when the behavior depends on the sequence or the timing of events that can\\u2019t be controlled. Here, the timing of events is the goroutines\\u2019 execution order.
In summary, when we work in concurrent applications, it\\u2019s essential to understand that a data race is different from a race condition. A data race occurs when multiple goroutines simultaneously access the same memory location and at least one of them is writing. A data race means unexpected behavior. However, a data-race-free application doesn\\u2019t necessarily mean deterministic results. An application can be free of data races but still have behavior that depends on uncontrolled events (such as goroutine execution, how fast a message is published to a channel, or how long a call to a database lasts); this is a race condition. Understanding both concepts is crucial to becoming proficient in designing concurrent applications.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-compreender-os-impactos-de-simultaneidade-de-um-tipo-de-carga-de-trabalho-59\",\"title\":\"N\\u00e3o compreender os impactos de simultaneidade de um tipo de carga de trabalho (#59)\",\"text\":\"TL;DR Ao criar um determinado n\\u00famero de goroutines, considere o tipo de carga de trabalho. Criar goroutines vinculadas \\u00e0 CPU significa limitar esse n\\u00famero pr\\u00f3ximo \\u00e0 vari\\u00e1vel GOMAXPROCS (baseado por padr\\u00e3o no n\\u00famero de n\\u00facleos de CPU no host). A cria\\u00e7\\u00e3o de goroutines vinculadas a E/S depende de outros fatores, como o sistema externo.
In programming, the execution time of a workload is limited by one of the following:
The speed of the CPU\\u2014For example, running a merge sort algorithm. The workload is called CPU-bound. The speed of I/O\\u2014For example, making a REST call or a database query. The workload is called I/O-bound. The amount of available memory\\u2014The workload is called memory-bound. Note The last is the rarest nowadays, given that memory has become very cheap in recent decades. Hence, this section focuses on the two first workload types: CPU- and I/O-bound.
If the workload executed by the workers is I/O-bound, the value mainly depends on the external system. Conversely, if the workload is CPU-bound, the optimal number of goroutines is close to the number of available CPU cores (a best practice can be to use runtime.GOMAXPROCS). Knowing the workload type (I/O or CPU) is crucial when designing concurrent applications.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#incompreensao-dos-contextos-go-60\",\"title\":\"Incompreens\\u00e3o dos contextos Go (#60)\",\"text\":\"TL;DR Os contextos Go tamb\\u00e9m s\\u00e3o um dos pilares da simultaneidade em Go. Um contexto permite que voc\\u00ea carregue um prazo, um sinal de cancelamento e/ou uma lista de valores-chave.
https://pkg.go.dev/context
A Context carries a deadline, a cancellation signal, and other values across API boundaries.
\"},{\"location\":\"pt-br/#deadline\",\"title\":\"Deadline\",\"text\":\"A deadline refers to a specific point in time determined with one of the following:
A time.Duration from now (for example, in 250 ms) A time.Time (for example, 2023-02-07 00:00:00 UTC) The semantics of a deadline convey that an ongoing activity should be stopped if this deadline is met. An activity is, for example, an I/O request or a goroutine waiting to receive a message from a channel.
\"},{\"location\":\"pt-br/#cancellation-signals\",\"title\":\"Cancellation signals\",\"text\":\"Another use case for Go contexts is to carry a cancellation signal. Let\\u2019s imagine that we want to create an application that calls CreateFileWatcher(ctx context.Context, filename string) within another goroutine. This function creates a specific file watcher that keeps reading from a file and catches updates. When the provided context expires or is canceled, this function handles it to close the file descriptor.
\"},{\"location\":\"pt-br/#context-values\",\"title\":\"Context values\",\"text\":\"The last use case for Go contexts is to carry a key-value list. What\\u2019s the point of having a context carrying a key-value list? Because Go contexts are generic and mainstream, there are infinite use cases.
For example, if we use tracing, we may want different subfunctions to share the same correlation ID. Some developers may consider this ID too invasive to be part of the function signature. In this regard, we could also decide to include it as part of the provided context.
\"},{\"location\":\"pt-br/#catching-a-context-cancellation\",\"title\":\"Catching a context cancellation\",\"text\":\"The context.Context type exports a Done method that returns a receive-only notification channel: <-chan struct{}. This channel is closed when the work associated with the context should be canceled. For example,
The Done channel related to a context created with context.WithCancel is closed when the cancel function is called. The Done channel related to a context created with context.WithDeadline is closed when the deadline has expired. One thing to note is that the internal channel should be closed when a context is canceled or has met a deadline, instead of when it receives a specific value, because the closure of a channel is the only channel action that all the consumer goroutines will receive. This way, all the consumers will be notified once a context is canceled or a deadline is reached.
In summary, to be a proficient Go developer, we have to understand what a context is and how to use it. In general, a function that users wait for should take a context, as doing so allows upstream callers to decide when calling this function should be aborted.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#concurrency-practice\",\"title\":\"Concurrency: Practice\",\"text\":\"\"},{\"location\":\"pt-br/#propagando-um-contexto-improprio-61\",\"title\":\"Propagando um contexto impr\\u00f3prio (#61)\",\"text\":\"TL;DR Compreender as condi\\u00e7\\u00f5es em que um contexto pode ser cancelado deve ser importante ao propag\\u00e1-lo: por exemplo, um manipulador HTTP cancelando o contexto quando a resposta for enviada.
In many situations, it is recommended to propagate Go contexts. However, context propagation can sometimes lead to subtle bugs, preventing subfunctions from being correctly executed.
Let\\u2019s consider the following example. We expose an HTTP handler that performs some tasks and returns a response. But just before returning the response, we also want to send it to a Kafka topic. We don\\u2019t want to penalize the HTTP consumer latency-wise, so we want the publish action to be handled asynchronously within a new goroutine. We assume that we have at our disposal a publish function that accepts a context so the action of publishing a message can be interrupted if the context is canceled, for example. Here is a possible implementation:
func handler(w http.ResponseWriter, r *http.Request) {\\n response, err := doSomeTask(r.Context(), r)\\n if err != nil {\\n http.Error(w, err.Error(), http.StatusInternalServerError)\\n return\\n }\\n go func() {\\n err := publish(r.Context(), response)\\n // Do something with err\\n }()\\n writeResponse(response)\\n}\\nWhat\\u2019s wrong with this piece of code? We have to know that the context attached to an HTTP request can cancel in different conditions:
When the client\\u2019s connection closes In the case of an HTTP/2 request, when the request is canceled When the response has been written back to the client In the first two cases, we probably handle things correctly. For example, if we get a response from doSomeTask but the client has closed the connection, it\\u2019s probably OK to call publish with a context already canceled so the message isn\\u2019t published. But what about the last case?
When the response has been written to the client, the context associated with the request will be canceled. Therefore, we are facing a race condition:
If the response is written after the Kafka publication, we both return a response and publish a message successfully However, if the response is written before or during the Kafka publication, the message shouldn\\u2019t be published. In the latter case, calling publish will return an error because we returned the HTTP response quickly.
Note From Go 1.21, there is a way to create a new context without cancel. context.WithoutCancel returns a copy of parent that is not canceled when parent is canceled.
In summary, propagating a context should be done cautiously.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#iniciando-uma-goroutine-sem-saber-quando-interrompe-la-62\",\"title\":\"Iniciando uma goroutine sem saber quando interromp\\u00ea-la (#62)\",\"text\":\"TL;DR Evitar vazamentos significa estar ciente de que sempre que uma goroutine for iniciada, voc\\u00ea deve ter um plano para interromp\\u00ea-la eventualmente.
Goroutines are easy and cheap to start\\u2014so easy and cheap that we may not necessarily have a plan for when to stop a new goroutine, which can lead to leaks. Not knowing when to stop a goroutine is a design issue and a common concurrency mistake in Go.
Let\\u2019s discuss a concrete example. We will design an application that needs to watch some external configuration (for example, using a database connection). Here\\u2019s a first implementation:
func main() {\\n newWatcher()\\n // Run the application\\n}\\n\\ntype watcher struct { /* Some resources */ }\\n\\nfunc newWatcher() {\\n w := watcher{}\\n go w.watch() // Creates a goroutine that watches some external configuration\\n}\\nThe problem with this code is that when the main goroutine exits (perhaps because of an OS signal or because it has a finite workload), the application is stopped. Hence, the resources created by watcher aren\\u2019t closed gracefully. How can we prevent this from happening?
One option could be to pass to newWatcher a context that will be canceled when main returns:
func main() {\\n ctx, cancel := context.WithCancel(context.Background())\\n defer cancel()\\n newWatcher(ctx)\\n // Run the application\\n}\\n\\nfunc newWatcher(ctx context.Context) {\\n w := watcher{}\\n go w.watch(ctx)\\n}\\nWe propagate the context created to the watch method. When the context is canceled, the watcher struct should close its resources. However, can we guarantee that watch will have time to do so? Absolutely not\\u2014and that\\u2019s a design flaw.
The problem is that we used signaling to convey that a goroutine had to be stopped. We didn\\u2019t block the parent goroutine until the resources had been closed. Let\\u2019s make sure we do:
func main() {\\n w := newWatcher()\\n defer w.close()\\n // Run the application\\n}\\n\\nfunc newWatcher() watcher {\\n w := watcher{}\\n go w.watch()\\n return w\\n}\\n\\nfunc (w watcher) close() {\\n // Close the resources\\n}\\nInstead of signaling watcher that it\\u2019s time to close its resources, we now call this close method, using defer to guarantee that the resources are closed before the application exits.
In summary, let\\u2019s be mindful that a goroutine is a resource like any other that must eventually be closed to free memory or other resources. Starting a goroutine without knowing when to stop it is a design issue. Whenever a goroutine is started, we should have a clear plan about when it will stop. Last but not least, if a goroutine creates resources and its lifetime is bound to the lifetime of the application, it\\u2019s probably safer to wait for this goroutine to complete before exiting the application. This way, we can ensure that the resources can be freed.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-ter-cuidado-com-goroutines-e-variaveis-de-loop-63\",\"title\":\"N\\u00e3o ter cuidado com goroutines e vari\\u00e1veis \\u200b\\u200bde loop (#63)\",\"text\":\"Warning Este erro n\\u00e3o \\u00e9 mais relevante no Go 1.22 (detalhes).
\"},{\"location\":\"pt-br/#esperando-um-comportamento-deterministico-usando-selecao-e-canais-64\",\"title\":\"Esperando um comportamento determin\\u00edstico usando sele\\u00e7\\u00e3o e canais (#64)\",\"text\":\"TL;DR Compreender que com select v\\u00e1rios canais escolhe o caso aleatoriamente se m\\u00faltiplas op\\u00e7\\u00f5es forem poss\\u00edveis evita fazer suposi\\u00e7\\u00f5es erradas que podem levar a erros sutis de simultaneidade.
One common mistake made by Go developers while working with channels is to make wrong assumptions about how select behaves with multiple channels.
For example, let's consider the following case (disconnectCh is a unbuffered channel):
go func() {\\n for i := 0; i < 10; i++ {\\n messageCh <- i\\n }\\n disconnectCh <- struct{}{}\\n}()\\n\\nfor {\\n select {\\n case v := <-messageCh:\\n fmt.Println(v)\\n case <-disconnectCh:\\n fmt.Println(\\\"disconnection, return\\\")\\n return\\n }\\n}\\nIf we run this example multiple times, the result will be random:
0\\n1\\n2\\ndisconnection, return\\n\\n0\\ndisconnection, return\\nInstead of consuming the 10 messages, we only received a few of them. What\\u2019s the reason? It lies in the specification of the select statement with multiple channels (https:// go.dev/ref/spec):
Quote
If one or more of the communications can proceed, a single one that can proceed is chosen via a uniform pseudo-random selection.
Unlike a switch statement, where the first case with a match wins, the select statement selects randomly if multiple options are possible.
This behavior might look odd at first, but there\\u2019s a good reason for it: to prevent possible starvation. Suppose the first possible communication chosen is based on the source order. In that case, we may fall into a situation where, for example, we only receive from one channel because of a fast sender. To prevent this, the language designers decided to use a random selection.
When using select with multiple channels, we must remember that if multiple options are possible, the first case in the source order does not automatically win. Instead, Go selects randomly, so there\\u2019s no guarantee about which option will be chosen. To overcome this behavior, in the case of a single producer goroutine, we can use either unbuffered channels or a single channel.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-usar-canais-de-notificacao-65\",\"title\":\"N\\u00e3o usar canais de notifica\\u00e7\\u00e3o (#65)\",\"text\":\"TL;DR Envie notifica\\u00e7\\u00f5es usando um tipo chan struct{}.
Channels are a mechanism for communicating across goroutines via signaling. A signal can be either with or without data.
Let\\u2019s look at a concrete example. We will create a channel that will notify us whenever a certain disconnection occurs. One idea is to handle it as a chan bool:
disconnectCh := make(chan bool)\\nNow, let\\u2019s say we interact with an API that provides us with such a channel. Because it\\u2019s a channel of Booleans, we can receive either true or false messages. It\\u2019s probably clear what true conveys. But what does false mean? Does it mean we haven\\u2019t been disconnected? And in this case, how frequently will we receive such a signal? Does it mean we have reconnected? Should we even expect to receive false? Perhaps we should only expect to receive true messages.
If that\\u2019s the case, meaning we don\\u2019t need a specific value to convey some information, we need a channel without data. The idiomatic way to handle it is a channel of empty structs: chan struct{}.
\"},{\"location\":\"pt-br/#nao-usar-canais-nulos-66\",\"title\":\"N\\u00e3o usar canais nulos (#66)\",\"text\":\"TL;DR O uso de canais nulos deve fazer parte do seu conjunto de ferramentas de simultaneidade porque permite remover casos de instru\\u00e7\\u00f5es select, por exemplo.
What should this code do?
var ch chan int\\n<-ch\\nch is a chan int type. The zero value of a channel being nil, ch is nil. The goroutine won\\u2019t panic; however, it will block forever.
The principle is the same if we send a message to a nil channel. This goroutine blocks forever:
var ch chan int\\nch <- 0\\nThen what\\u2019s the purpose of Go allowing messages to be received from or sent to a nil channel? For example, we can use nil channels to implement an idiomatic way to merge two channels:
func merge(ch1, ch2 <-chan int) <-chan int {\\n ch := make(chan int, 1)\\n\\n go func() {\\n for ch1 != nil || ch2 != nil { // Continue if at least one channel isn\\u2019t nil\\n select {\\n case v, open := <-ch1:\\n if !open {\\n ch1 = nil // Assign ch1 to a nil channel once closed\\n break\\n }\\n ch <- v\\n case v, open := <-ch2:\\n if !open {\\n ch2 = nil // Assigns ch2 to a nil channel once closed\\n break\\n }\\n ch <- v\\n }\\n }\\n close(ch)\\n }()\\n\\n return ch\\n}\\nThis elegant solution relies on nil channels to somehow remove one case from the select statement.
Let\\u2019s keep this idea in mind: nil channels are useful in some conditions and should be part of the Go developer\\u2019s toolset when dealing with concurrent code.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#ficar-intrigado-com-o-tamanho-do-canal-67\",\"title\":\"Ficar intrigado com o tamanho do canal (#67)\",\"text\":\"TL;DR Decida cuidadosamente o tipo de canal correto a ser usado, considerando o problema. Somente canais sem buffer oferecem fortes garantias de sincroniza\\u00e7\\u00e3o. Para canais em buffer, voc\\u00ea deve ter um bom motivo para especificar um tamanho de canal diferente de um.
An unbuffered channel is a channel without any capacity. It can be created by either omitting the size or providing a 0 size:
ch1 := make(chan int)\\nch2 := make(chan int, 0)\\nWith an unbuffered channel (sometimes called a synchronous channel), the sender will block until the receiver receives data from the channel.
Conversely, a buffered channel has a capacity, and it must be created with a size greater than or equal to 1:
ch3 := make(chan int, 1)\\nWith a buffered channel, a sender can send messages while the channel isn\\u2019t full. Once the channel is full, it will block until a receiver goroutine receives a message:
ch3 := make(chan int, 1)\\nch3 <-1 // Non-blocking\\nch3 <-2 // Blocking\\nThe first send isn\\u2019t blocking, whereas the second one is, as the channel is full at this stage.
What's the main difference between unbuffered and buffered channels:
An unbuffered channel enables synchronization. We have the guarantee that two goroutines will be in a known state: one receiving and another sending a message. A buffered channel doesn\\u2019t provide any strong synchronization. Indeed, a producer goroutine can send a message and then continue its execution if the channel isn\\u2019t full. The only guarantee is that a goroutine won\\u2019t receive a message before it is sent. But this is only a guarantee because of causality (you don\\u2019t drink your coffee before you prepare it). If we need a buffered channel, what size should we provide?
The default value we should use for buffered channels is its minimum: 1. So, we may approach the problem from this standpoint: is there any good reason not to use a value of 1? Here\\u2019s a list of possible cases where we should use another size:
While using a worker pooling-like pattern, meaning spinning a fixed number of goroutines that need to send data to a shared channel. In that case, we can tie the channel size to the number of goroutines created. When using channels for rate-limiting problems. For example, if we need to enforce resource utilization by bounding the number of requests, we should set up the channel size according to the limit. If we are outside of these cases, using a different channel size should be done cautiously. Let\\u2019s bear in mind that deciding about an accurate queue size isn\\u2019t an easy problem:
Martin Thompson
Queues are typically always close to full or close to empty due to the differences in pace between consumers and producers. They very rarely operate in a balanced middle ground where the rate of production and consumption is evenly matched.
\"},{\"location\":\"pt-br/#esquecendo-os-possiveis-efeitos-colaterais-da-formatacao-de-strings-68\",\"title\":\"Esquecendo os poss\\u00edveis efeitos colaterais da formata\\u00e7\\u00e3o de strings (#68)\",\"text\":\"TL;DR Estar ciente de que a formata\\u00e7\\u00e3o de strings pode levar \\u00e0 chamada de fun\\u00e7\\u00f5es existentes significa estar atento a poss\\u00edveis impasses e outras disputas de dados.
It\\u2019s pretty easy to forget the potential side effects of string formatting while working in a concurrent application.
\"},{\"location\":\"pt-br/#etcd-data-race\",\"title\":\"etcd data race\",\"text\":\"github.com/etcd-io/etcd/pull/7816 shows an example of an issue where a map's key was formatted based on a mutable values from a context.
\"},{\"location\":\"pt-br/#deadlock\",\"title\":\"Deadlock\",\"text\":\"Can you see what the problem is in this code with a Customer struct exposing an UpdateAge method and implementing the fmt.Stringer interface?
type Customer struct {\\n mutex sync.RWMutex // Uses a sync.RWMutex to protect concurrent accesses\\n id string\\n age int\\n}\\n\\nfunc (c *Customer) UpdateAge(age int) error {\\n c.mutex.Lock() // Locks and defers unlock as we update Customer\\n defer c.mutex.Unlock()\\n\\n if age < 0 { // Returns an error if age is negative\\n return fmt.Errorf(\\\"age should be positive for customer %v\\\", c)\\n }\\n\\n c.age = age\\n return nil\\n}\\n\\nfunc (c *Customer) String() string {\\n c.mutex.RLock() // Locks and defers unlock as we read Customer\\n defer c.mutex.RUnlock()\\n return fmt.Sprintf(\\\"id %s, age %d\\\", c.id, c.age)\\n}\\nThe problem here may not be straightforward. If the provided age is negative, we return an error. Because the error is formatted, using the %s directive on the receiver, it will call the String method to format Customer. But because UpdateAge already acquires the mutex lock, the String method won\\u2019t be able to acquire it. Hence, this leads to a deadlock situation. If all goroutines are also asleep, it leads to a panic.
One possible solution is to restrict the scope of the mutex lock:
func (c *Customer) UpdateAge(age int) error {\\n if age < 0 {\\n return fmt.Errorf(\\\"age should be positive for customer %v\\\", c)\\n }\\n\\n c.mutex.Lock() <1>\\n defer c.mutex.Unlock()\\n\\n c.age = age\\n return nil\\n}\\nYet, such an approach isn't always possible. In these conditions, we have to be extremely careful with string formatting.
Another approach is to access the id field directly:
func (c *Customer) UpdateAge(age int) error {\\n c.mutex.Lock()\\n defer c.mutex.Unlock()\\n\\n if age < 0 {\\n return fmt.Errorf(\\\"age should be positive for customer id %s\\\", c.id)\\n }\\n\\n c.age = age\\n return nil\\n}\\nIn concurrent applications, we should remain cautious about the possible side effects of string formatting.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#criando-corridas-de-dados-com-acrescimo-69\",\"title\":\"Criando corridas de dados com acr\\u00e9scimo (#69)\",\"text\":\"TL;DR As chamadas append nem sempre s\\u00e3o isentas de disputa de dados; portanto, n\\u00e3o deve ser usado simultaneamente em uma slice compartilhada.
Should adding an element to a slice using append is data-race-free? Spoiler: it depends.
Do you believe this example has a data race?
s := make([]int, 1)\\n\\ngo func() { // In a new goroutine, appends a new element on s\\n s1 := append(s, 1)\\n fmt.Println(s1)\\n}()\\n\\ngo func() { // Same\\n s2 := append(s, 1)\\n fmt.Println(s2)\\n}()\\nThe answer is no.
In this example, we create a slice with make([]int, 1). The code creates a one-length, one-capacity slice. Thus, because the slice is full, using append in each goroutine returns a slice backed by a new array. It doesn\\u2019t mutate the existing array; hence, it doesn\\u2019t lead to a data race.
Now, let\\u2019s run the same example with a slight change in how we initialize s. Instead of creating a slice with a length of 1, we create it with a length of 0 but a capacity of 1. How about this new example? Does it contain a data race?
s := make([]int, 0, 1)\\n\\ngo func() { \\n s1 := append(s, 1)\\n fmt.Println(s1)\\n}()\\n\\ngo func() {\\n s2 := append(s, 1)\\n fmt.Println(s2)\\n}()\\nThe answer is yes. We create a slice with make([]int, 0, 1). Therefore, the array isn\\u2019t full. Both goroutines attempt to update the same index of the backing array (index 1), which is a data race.
How can we prevent the data race if we want both goroutines to work on a slice containing the initial elements of s plus an extra element? One solution is to create a copy of s.
We should remember that using append on a shared slice in concurrent applications can lead to a data race. Hence, it should be avoided.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#usando-mutexes-imprecisamente-com-slices-e-maps-70\",\"title\":\"Usando mutexes imprecisamente com slices e maps (#70)\",\"text\":\"TL;DR Lembrar que slices e maps s\\u00e3o ponteiros pode evitar corridas comuns de dados.
Let's implement a Cache struct used to handle caching for customer balances. This struct will contain a map of balances per customer ID and a mutex to protect concurrent accesses:
type Cache struct {\\n mu sync.RWMutex\\n balances map[string]float64\\n}\\nNext, we add an AddBalance method that mutates the balances map. The mutation is done in a critical section (within a mutex lock and a mutex unlock):
func (c *Cache) AddBalance(id string, balance float64) {\\n c.mu.Lock()\\n c.balances[id] = balance\\n c.mu.Unlock()\\n}\\nMeanwhile, we have to implement a method to calculate the average balance for all the customers. One idea is to handle a minimal critical section this way:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n balances := c.balances // Creates a copy of the balances map\\n c.mu.RUnlock()\\n\\n sum := 0.\\n for _, balance := range balances { // Iterates over the copy, outside of the critical section\\n sum += balance\\n }\\n return sum / float64(len(balances))\\n}\\nWhat's the problem with this code?
If we run a test using the -race flag with two concurrent goroutines, one calling AddBalance (hence mutating balances) and another calling AverageBalance, a data race occurs. What\\u2019s the problem here?
Internally, a map is a runtime.hmap struct containing mostly metadata (for example, a counter) and a pointer referencing data buckets. So, balances := c.balances doesn\\u2019t copy the actual data. Therefore, the two goroutines perform operations on the same data set, and one mutates it. Hence, it's a data race.
One possible solution is to protect the whole AverageBalance function:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n defer c.mu.RUnlock() // Unlocks when the function returns\\n\\n sum := 0.\\n for _, balance := range c.balances {\\n sum += balance\\n }\\n return sum / float64(len(c.balances))\\n}\\nAnother option, if the iteration operation isn\\u2019t lightweight, is to work on an actual copy of the data and protect only the copy:
func (c *Cache) AverageBalance() float64 {\\n c.mu.RLock()\\n m := make(map[string]float64, len(c.balances)) // Copies the map\\n for k, v := range c.balances {\\n m[k] = v\\n }\\n c.mu.RUnlock()\\n\\n sum := 0.\\n for _, balance := range m {\\n sum += balance\\n }\\n return sum / float64(len(m))\\n}\\nOnce we have made a deep copy, we release the mutex. The iterations are done on the copy outside of the critical section.
In summary, we have to be careful with the boundaries of a mutex lock. In this section, we have seen why assigning an existing map (or an existing slice) to a map isn\\u2019t enough to protect against data races. The new variable, whether a map or a slice, is backed by the same data set. There are two leading solutions to prevent this: protect the whole function, or work on a copy of the actual data. In all cases, let\\u2019s be cautious when designing critical sections and make sure the boundaries are accurately defined.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#uso-indevido-syncwaitgroup-71\",\"title\":\"Uso indevido sync.WaitGroup (#71)\",\"text\":\"TL;DR Para usar com precis\\u00e3o sync.WaitGroup, chame o m\\u00e9todo Add antes de ativar goroutines.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#esquecendo-synccond-72\",\"title\":\"Esquecendo sync.Cond (#72)\",\"text\":\"TL;DR Voc\\u00ea pode enviar notifica\\u00e7\\u00f5es repetidas para v\\u00e1rios goroutines com sync.Cond.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-usando-errgroup-73\",\"title\":\"N\\u00e3o usando errgroup (#73)\",\"text\":\"TL;DR Voc\\u00ea pode sincronizar um grupo de goroutines e lidar com erros e contextos com o pacote errgroup.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#copiando-um-tipo-sync-74\",\"title\":\"Copiando um tipo sync (#74)\",\"text\":\"TL;DR Tipos sync n\\u00e3o devem ser copiados.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#standard-library\",\"title\":\"Standard Library\",\"text\":\"\"},{\"location\":\"pt-br/#fornecendo-uma-duracao-de-tempo-errada-75\",\"title\":\"Fornecendo uma dura\\u00e7\\u00e3o de tempo errada (#75)\",\"text\":\"TL;DR Seja cauteloso com fun\\u00e7\\u00f5es que aceitam um arquivo time.Duration. Mesmo que a passagem de um n\\u00famero inteiro seja permitida, tente usar a API time para evitar qualquer poss\\u00edvel confus\\u00e3o.
Many common functions in the standard library accept a time.Duration, which is an alias for the int64 type. However, one time.Duration unit represents one nanosecond, instead of one millisecond, as commonly seen in other programming languages. As a result, passing numeric types instead of using the time.Duration API can lead to unexpected behavior.
A developer with experience in other languages might assume that the following code creates a new time.Ticker that delivers ticks every second, given the value 1000:
ticker := time.NewTicker(1000)\\nfor {\\n select {\\n case <-ticker.C:\\n // Do something\\n }\\n}\\nHowever, because 1,000 time.Duration units = 1,000 nanoseconds, ticks are delivered every 1,000 nanoseconds = 1 microsecond, not every second as assumed.
We should always use the time.Duration API to avoid confusion and unexpected behavior:
ticker = time.NewTicker(time.Microsecond)\\n// Or\\nticker = time.NewTicker(1000 * time.Nanosecond)\\n
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#timeafter-e-vazamentos-de-memoria-76\",\"title\":\"time.After e vazamentos de mem\\u00f3ria (#76)\",\"text\":\"TL;DR Evitar chamadas para fun\\u00e7\\u00f5es time.After repetidas (como loops ou manipuladores HTTP) pode evitar pico de consumo de mem\\u00f3ria. Os recursos criados por time.After s\\u00e3o liberados somente quando o cron\\u00f4metro expira.
Developers often use time.After in loops or HTTP handlers repeatedly to implement the timing function. But it can lead to unintended peak memory consumption due to the delayed release of resources, just like the following code:
func consumer(ch <-chan Event) {\\n for {\\n select {\\n case event := <-ch:\\n handle(event)\\n case <-time.After(time.Hour):\\n log.Println(\\\"warning: no messages received\\\")\\n }\\n }\\n}\\nThe source code of the function time.After is as follows:
func After(d Duration) <-chan Time {\\n return NewTimer(d).C\\n}\\nAs we see, it returns receive-only channel.
When time.After is used in a loop or repeated context, a new channel is created in each iteration. If these channels are not properly closed or if their associated timers are not stopped, they can accumulate and consume memory. The resources associated with each timer and channel are only released when the timer expires or the channel is closed.
To avoid this happening, We can use context's timeout setting instead of time.After, like below:
func consumer(ch <-chan Event) {\\n for {\\n ctx, cancel := context.WithTimeout(context.Background(), time.Hour)\\n select {\\n case event := <-ch:\\n cancel()\\n handle(event)\\n case <-ctx.Done():\\n log.Println(\\\"warning: no messages received\\\")\\n }\\n }\\n}\\nWe can also use time.NewTimer like so:
func consumer(ch <-chan Event) {\\n timerDuration := 1 * time.Hour\\n timer := time.NewTimer(timerDuration)\\n\\n for {\\n timer.Reset(timerDuration)\\n select {\\n case event := <-ch:\\n handle(event)\\n case <-timer.C:\\n log.Println(\\\"warning: no messages received\\\")\\n }\\n }\\n}\\n C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#lidando-com-erros-comuns-json-77\",\"title\":\"Lidando com erros comuns JSON (#77)\",\"text\":\" Comportamento inesperado devido \\u00e0 incorpora\\u00e7\\u00e3o de tipo Tenha cuidado ao usar campos incorporados em estruturas Go. Fazer isso pode levar a bugs sorrateiros, como um campo time.Time incorporado que implementa a interface json.Marshaler, substituindo assim o comportamento de empacotamento padr\\u00e3o.
C\\u00f3digo fonte
JSON e o rel\\u00f3gio monot\\u00f4nico Ao comparar duas estruturas time.Time, lembre-se de que time.Time cont\\u00e9m um rel\\u00f3gio de parede e um rel\\u00f3gio monot\\u00f4nico, e a compara\\u00e7\\u00e3o usando o operador == \\u00e9 feita em ambos os rel\\u00f3gios.
C\\u00f3digo fonte
Para evitar suposi\\u00e7\\u00f5es erradas ao fornecer um map ao desempacotar (unmarshaling) dados JSON, lembre-se de que os valores num\\u00e9ricos s\\u00e3o convertidos para float64 por padr\\u00e3o.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#erros-comuns-de-sql-78\",\"title\":\"Erros comuns de SQL (#78)\",\"text\":\" Esquecer sql.Open n\\u00e3o necessariamente estabelece conex\\u00f5es com um banco de dados Esquecer sql.Open n\\u00e3o necessariamente estabelece conex\\u00f5es com um banco de dados Chame o m\\u00e9todo Ping ou PingContext se precisar testar sua configura\\u00e7\\u00e3o e garantir que um banco de dados esteja acess\\u00edvel.
C\\u00f3digo fonte
Esquecendo o pool de conex\\u00f5es Configure os par\\u00e2metros de conex\\u00e3o do banco de dados para aplicativos de n\\u00edvel de produ\\u00e7\\u00e3o.
N\\u00e3o usar declara\\u00e7\\u00f5es preparadas O uso de instru\\u00e7\\u00f5es preparadas em SQL torna as consultas mais eficientes e seguras.
C\\u00f3digo fonte
Tratamento incorreto de valores nulos Lide com colunas anul\\u00e1veis \\u200b\\u200bem tabelas usando ponteiros ou tipos sql.NullXXX.
C\\u00f3digo fonte
N\\u00e3o tratando de erros de itera\\u00e7\\u00e3o de linhas Chame o m\\u00e9todo Err de sql.Rows itera\\u00e7\\u00f5es posteriores \\u00e0 linha para garantir que voc\\u00ea n\\u00e3o perdeu nenhum erro ao preparar a pr\\u00f3xima linha.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-fechando-recursos-transitorios-body-http-sqlrows-e-osfile-79\",\"title\":\"N\\u00e3o fechando recursos transit\\u00f3rios (body HTTP, sql.Rows e os.File) (#79)\",\"text\":\"TL;DR Eventualmente feche todas as estruturas implementadas io.Closer para evitar poss\\u00edveis vazamentos.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#esquecendo-a-instrucao-return-apos-responder-a-uma-solicitacao-http-80\",\"title\":\"Esquecendo a instru\\u00e7\\u00e3o return ap\\u00f3s responder a uma solicita\\u00e7\\u00e3o HTTP (#80)\",\"text\":\"TL;DR Para evitar comportamentos inesperados nas implementa\\u00e7\\u00f5es do manipulador HTTP, certifique-se de n\\u00e3o perder a instru\\u00e7\\u00e3o return se quiser que um manipulador pare ap\\u00f3s http.Error.
Consider the following HTTP handler that handles an error from foo using http.Error:
func handler(w http.ResponseWriter, req *http.Request) {\\n err := foo(req)\\n if err != nil {\\n http.Error(w, \\\"foo\\\", http.StatusInternalServerError)\\n }\\n\\n _, _ = w.Write([]byte(\\\"all good\\\"))\\n w.WriteHeader(http.StatusCreated)\\n}\\nIf we run this code and err != nil, the HTTP response would be:
foo\\nall good\\nThe response contains both the error and success messages, and also the first HTTP status code, 500. There would also be a warning log indicating that we attempted to write the status code multiple times:
2023/10/10 16:45:33 http: superfluous response.WriteHeader call from main.handler (main.go:20)\\nThe mistake in this code is that http.Error does not stop the handler's execution, which means the success message and status code get written in addition to the error. Beyond an incorrect response, failing to return after writing an error can lead to the unwanted execution of code and unexpected side-effects. The following code adds the return statement following the http.Error and exhibits the desired behavior when ran:
func handler(w http.ResponseWriter, req *http.Request) {\\n err := foo(req)\\n if err != nil {\\n http.Error(w, \\\"foo\\\", http.StatusInternalServerError)\\n return // Adds the return statement\\n }\\n\\n _, _ = w.Write([]byte(\\\"all good\\\"))\\n w.WriteHeader(http.StatusCreated)\\n}\\n C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#usando-o-cliente-e-servidor-http-padrao-81\",\"title\":\"Usando o cliente e servidor HTTP padr\\u00e3o (#81)\",\"text\":\"TL;DR Para aplicativos de n\\u00edvel de produ\\u00e7\\u00e3o, n\\u00e3o use as implementa\\u00e7\\u00f5es de cliente e servidor HTTP padr\\u00e3o. Essas implementa\\u00e7\\u00f5es n\\u00e3o possuem tempos limite e comportamentos que deveriam ser obrigat\\u00f3rios na produ\\u00e7\\u00e3o.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#teste\",\"title\":\"Teste\",\"text\":\"\"},{\"location\":\"pt-br/#nao-categorizar-testes-tags-de-construcao-variaveis-de-ambiente-e-modo-abreviado-82\",\"title\":\"N\\u00e3o categorizar testes (tags de constru\\u00e7\\u00e3o, vari\\u00e1veis \\u200b\\u200bde ambiente e modo abreviado) (#82)\",\"text\":\"TL;DR Categorizar testes usando sinalizadores de constru\\u00e7\\u00e3o, vari\\u00e1veis \\u200b\\u200bde ambiente ou modo curto torna o processo de teste mais eficiente. Voc\\u00ea pode criar categorias de teste usando sinalizadores de constru\\u00e7\\u00e3o ou vari\\u00e1veis \\u200b\\u200bde ambiente (por exemplo, testes de unidade versus testes de integra\\u00e7\\u00e3o) e diferenciar testes curtos de testes de longa dura\\u00e7\\u00e3o para decidir quais tipos de testes executar.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-habilitando-a-bandeira-de-corrida-83\",\"title\":\"N\\u00e3o habilitando a bandeira de corrida (#83)\",\"text\":\"TL;DR A ativa\\u00e7\\u00e3o do sinalizador -race \\u00e9 altamente recomendada ao escrever aplicativos simult\\u00e2neos. Isso permite que voc\\u00ea detecte poss\\u00edveis corridas de dados que podem levar a bugs de software.
In Go, the race detector isn\\u2019t a static analysis tool used during compilation; instead, it\\u2019s a tool to find data races that occur at runtime. To enable it, we have to enable the -race flag while compiling or running a test. For example:
go test -race ./...\\nOnce the race detector is enabled, the compiler instruments the code to detect data races. Instrumentation refers to a compiler adding extra instructions: here, tracking all memory accesses and recording when and how they occur.
Enabling the race detector adds an overhead in terms of memory and execution time; hence, it's generally recommended to enable it only during local testing or continuous integration, not production.
If a race is detected, Go raises a warning. For example:
package main\\n\\nimport (\\n \\\"fmt\\\"\\n)\\n\\nfunc main() {\\n i := 0\\n go func() { i++ }()\\n fmt.Println(i)\\n}\\nRunnig this code with the -race logs the following warning:
==================\\nWARNING: DATA RACE\\nWrite at 0x00c000026078 by goroutine 7: # (1)\\n main.main.func1()\\n /tmp/app/main.go:9 +0x4e\\n\\nPrevious read at 0x00c000026078 by main goroutine: # (2)\\n main.main()\\n /tmp/app/main.go:10 +0x88\\n\\nGoroutine 7 (running) created at: # (3)\\n main.main()\\n /tmp/app/main.go:9 +0x7a\\n==================\\n Indicates that goroutine 7 was writing Indicates that the main goroutine was reading Indicates when the goroutine 7 was created Let\\u2019s make sure we are comfortable reading these messages. Go always logs the following:
The concurrent goroutines that are incriminated: here, the main goroutine and goroutine 7. Where accesses occur in the code: in this case, lines 9 and 10. When these goroutines were created: goroutine 7 was created in main(). In addition, if a specific file contains tests that lead to data races, we can exclude it from race detection using the !race build tag:
//go:build !race\\n\\npackage main\\n\\nimport (\\n \\\"testing\\\"\\n)\\n\\nfunc TestFoo(t *testing.T) {\\n // ...\\n}\\nUsar o sinalizador -parallel \\u00e9 uma forma eficiente de acelerar testes, especialmente os de longa dura\\u00e7\\u00e3o. Use o sinalizador -shuffle para ajudar a garantir que um conjunto de testes n\\u00e3o se baseie em suposi\\u00e7\\u00f5es erradas que possam ocultar bugs.
\"},{\"location\":\"pt-br/#nao-usar-testes-baseados-em-tabela-85\",\"title\":\"N\\u00e3o usar testes baseados em tabela (#85)\",\"text\":\"TL;DR Os testes baseados em tabelas s\\u00e3o uma maneira eficiente de agrupar um conjunto de testes semelhantes para evitar a duplica\\u00e7\\u00e3o de c\\u00f3digo e facilitar o manuseio de atualiza\\u00e7\\u00f5es futuras.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#dormindo-em-testes-unitarios-86\",\"title\":\"Dormindo em testes unit\\u00e1rios (#86)\",\"text\":\"TL;DR Evite interrup\\u00e7\\u00f5es usando a sincroniza\\u00e7\\u00e3o para tornar o teste menos inst\\u00e1vel e mais robusto. Se a sincroniza\\u00e7\\u00e3o n\\u00e3o for poss\\u00edvel, considere uma abordagem de nova tentativa.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-lidar-com-a-api-de-tempo-de-forma-eficiente-87\",\"title\":\"N\\u00e3o lidar com a API de tempo de forma eficiente (#87)\",\"text\":\"TL;DR Entender como lidar com fun\\u00e7\\u00f5es usando a API time \\u00e9 outra maneira de tornar um teste menos complicado. Voc\\u00ea pode usar t\\u00e9cnicas padr\\u00e3o, como lidar com o tempo como parte de uma depend\\u00eancia oculta ou solicitar que os clientes o forne\\u00e7am.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-usar-pacotes-de-utilitarios-de-teste-httptest-e-iotest-88\",\"title\":\"N\\u00e3o usar pacotes de utilit\\u00e1rios de teste ( httptest e iotest) (#88)\",\"text\":\" O pacote httptest \\u00e9 \\u00fatil para lidar com aplicativos HTTP. Ele fornece um conjunto de utilit\\u00e1rios para testar clientes e servidores. C\\u00f3digo fonte
O pacote iotest ajuda a escrever io.Reader e testar se um aplicativo \\u00e9 tolerante a erros. C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#escrevendo-benchmarks-imprecisos-89\",\"title\":\"Escrevendo benchmarks imprecisos (#89)\",\"text\":\"TL;DR Regarding benchmarks:
Use m\\u00e9todos de tempo para preservar a precis\\u00e3o de um benchmark. Aumentar o tempo de teste ou usar ferramentas como o benchstat pode ser \\u00fatil ao lidar com micro-benchmarks. Tenha cuidado com os resultados de um micro-benchmark se o sistema que executa o aplicativo for diferente daquele que executa o micro-benchmark. Certifique-se de que a fun\\u00e7\\u00e3o em teste cause um efeito colateral, para evitar que as otimiza\\u00e7\\u00f5es do compilador enganem voc\\u00ea sobre os resultados do benchmark. Para evitar o efeito observador, force um benchmark a recriar os dados usados \\u200b\\u200bpor uma fun\\u00e7\\u00e3o vinculada \\u00e0 CPU. Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-explorando-todos-os-recursos-de-teste-do-go-90\",\"title\":\"N\\u00e3o explorando todos os recursos de teste do Go (#90)\",\"text\":\" Cobertura de c\\u00f3digo Use a cobertura de c\\u00f3digo com o sinalizador -coverprofile para ver rapidamente qual parte do c\\u00f3digo precisa de mais aten\\u00e7\\u00e3o.
Testando de um pacote diferente Coloque os testes unit\\u00e1rios em um pacote diferente para impor testes de escrita que se concentrem em um comportamento exposto, n\\u00e3o em internos.
C\\u00f3digo fonte
Fun\\u00e7\\u00f5es utilit\\u00e1rias O tratamento de erros usando a vari\\u00e1vel *testing.T em vez do cl\\u00e1ssico if err != nil torna o c\\u00f3digo mais curto e f\\u00e1cil de ler.
C\\u00f3digo fonte
Configura\\u00e7\\u00e3o e desmontagem Voc\\u00ea pode usar fun\\u00e7\\u00f5es de setup e teardown para configurar um ambiente complexo, como no caso de testes de integra\\u00e7\\u00e3o.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-usar-fuzzing-erro-da-comunidade\",\"title\":\"N\\u00e3o usar fuzzing (erro da comunidade)\",\"text\":\"TL;DR Fuzzing \\u00e9 uma estrat\\u00e9gia eficiente para detectar entradas aleat\\u00f3rias, inesperadas ou malformadas em fun\\u00e7\\u00f5es e m\\u00e9todos complexos, a fim de descobrir vulnerabilidades, bugs ou at\\u00e9 mesmo travamentos potenciais.
Credits: @jeromedoucet
\"},{\"location\":\"pt-br/#otimizacoes\",\"title\":\"Otimiza\\u00e7\\u00f5es\",\"text\":\"\"},{\"location\":\"pt-br/#nao-entendendo-os-caches-da-cpu-91\",\"title\":\"N\\u00e3o entendendo os caches da CPU (#91)\",\"text\":\" Compreender como usar caches de CPU \\u00e9 importante para otimizar aplicativos vinculados \\u00e0 CPU porque o cache L1 \\u00e9 cerca de 50 a 100 vezes mais r\\u00e1pido que a mem\\u00f3ria principal.
Estar consciente do conceito de linha de cache \\u00e9 fundamental para entender como organizar dados em aplicativos com uso intensivo de dados. Uma CPU n\\u00e3o busca mem\\u00f3ria palavra por palavra; em vez disso, geralmente copia um bloco de mem\\u00f3ria para uma linha de cache de 64 bytes. Para aproveitar ao m\\u00e1ximo cada linha de cache individual, imponha a localidade espacial.
C\\u00f3digo fonte
Slice de estruturas vs. estrutura de slices C\\u00f3digo fonte
Tornar o c\\u00f3digo previs\\u00edvel para a CPU tamb\\u00e9m pode ser uma forma eficiente de otimizar certas fun\\u00e7\\u00f5es. Por exemplo, uma passada unit\\u00e1ria ou constante \\u00e9 previs\\u00edvel para a CPU, mas uma passada n\\u00e3o unit\\u00e1ria (por exemplo, uma lista vinculada) n\\u00e3o \\u00e9 previs\\u00edvel.
C\\u00f3digo fonte
Pol\\u00edtica de posicionamento de cache Para evitar um avan\\u00e7o cr\\u00edtico e, portanto, utilizar apenas uma pequena parte do cache, esteja ciente de que os caches s\\u00e3o particionados.
\"},{\"location\":\"pt-br/#escrevendo-codigo-simultaneo-que-leva-a-compartilhamento-falso-92\",\"title\":\"Escrevendo c\\u00f3digo simult\\u00e2neo que leva a compartilhamento falso (#92)\",\"text\":\"TL;DR Saber que n\\u00edveis mais baixos de caches de CPU n\\u00e3o s\\u00e3o compartilhados entre todos os n\\u00facleos ajuda a evitar padr\\u00f5es que degradam o desempenho, como compartilhamento falso ao escrever c\\u00f3digo de simultaneidade. Compartilhar mem\\u00f3ria \\u00e9 uma ilus\\u00e3o.
Leia a se\\u00e7\\u00e3o completa aqui.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-levando-em-consideracao-o-paralelismo-no-nivel-de-instrucao-93\",\"title\":\"N\\u00e3o levando em considera\\u00e7\\u00e3o o paralelismo no n\\u00edvel de instru\\u00e7\\u00e3o (#93)\",\"text\":\"TL;DR Use o ILP para otimizar partes espec\\u00edficas do seu c\\u00f3digo para permitir que uma CPU execute tantas instru\\u00e7\\u00f5es paralelas quanto poss\\u00edvel. Identificar perigos nos dados \\u00e9 uma das etapas principais.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-estar-ciente-do-alinhamento-dos-dados-94\",\"title\":\"N\\u00e3o estar ciente do alinhamento dos dados (#94)\",\"text\":\"TL;DR Voc\\u00ea pode evitar erros comuns lembrando que no Go os tipos b\\u00e1sicos s\\u00e3o alinhados com seu pr\\u00f3prio tamanho. Por exemplo, tenha em mente que reorganizar os campos de uma estrutura por tamanho em ordem decrescente pode levar a estruturas mais compactas (menos aloca\\u00e7\\u00e3o de mem\\u00f3ria e potencialmente uma melhor localidade espacial).
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-entendendo-stack-vs-heap-95\",\"title\":\"N\\u00e3o entendendo stack vs. heap (#95)\",\"text\":\"TL;DR Compreender as diferen\\u00e7as fundamentais entre heap e pilha tamb\\u00e9m deve fazer parte do seu conhecimento b\\u00e1sico ao otimizar um aplicativo Go. As aloca\\u00e7\\u00f5es de pilha s\\u00e3o quase gratuitas, enquanto as aloca\\u00e7\\u00f5es de heap s\\u00e3o mais lentas e dependem do GC para limpar a mem\\u00f3ria.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-saber-como-reduzir-alocacoes-mudanca-de-api-otimizacoes-de-compilador-e-syncpool-96\",\"title\":\"N\\u00e3o saber como reduzir aloca\\u00e7\\u00f5es (mudan\\u00e7a de API, otimiza\\u00e7\\u00f5es de compilador e sync.Pool) (#96)\",\"text\":\"TL;DR A redu\\u00e7\\u00e3o das aloca\\u00e7\\u00f5es tamb\\u00e9m \\u00e9 um aspecto essencial da otimiza\\u00e7\\u00e3o de um aplicativo Go. Isso pode ser feito de diferentes maneiras, como projetar a API cuidadosamente para evitar compartilhamento, compreender as otimiza\\u00e7\\u00f5es comuns do compilador Go e usar sync.Pool.
C\\u00f3digo fonte
\"},{\"location\":\"pt-br/#nao-dependendo-do-inlining-97\",\"title\":\"N\\u00e3o dependendo do inlining (#97)\",\"text\":\"TL;DR Use a t\\u00e9cnica de inlining de caminho r\\u00e1pido para reduzir com efici\\u00eancia o tempo amortizado para chamar uma fun\\u00e7\\u00e3o.
\"},{\"location\":\"pt-br/#nao-usar-ferramentas-de-diagnostico-go-98\",\"title\":\"N\\u00e3o usar ferramentas de diagn\\u00f3stico Go (#98)\",\"text\":\"TL;DR Confie na cria\\u00e7\\u00e3o de perfil e no rastreador de execu\\u00e7\\u00e3o para entender o desempenho de um aplicativo e as partes a serem otimizadas.
Leia a se\\u00e7\\u00e3o completa aqui.
\"},{\"location\":\"pt-br/#nao-entendendo-como-funciona-o-gc-99\",\"title\":\"N\\u00e3o entendendo como funciona o GC (#99)\",\"text\":\"TL;DR Compreender como ajustar o GC pode levar a v\\u00e1rios benef\\u00edcios, como lidar com aumentos repentinos de carga com mais efici\\u00eancia.
\"},{\"location\":\"pt-br/#nao-entendendo-os-impactos-da-execucao-do-go-no-docker-e-kubernetes-100\",\"title\":\"N\\u00e3o entendendo os impactos da execu\\u00e7\\u00e3o do Go no Docker e Kubernetes (#100)\",\"text\":\"TL;DR Para ajudar a evitar a limita\\u00e7\\u00e3o da CPU quando implantado no Docker e no Kubernetes, lembre-se de que Go n\\u00e3o reconhece CFS.
By default, GOMAXPROCS is set to the number of OS-apparent logical CPU cores.
When running some Go code inside Docker and Kubernetes, we must know that Go isn't CFS-aware (github.com/golang/go/issues/33803). Therefore, GOMAXPROCS isn't automatically set to the value of spec.containers.resources.limits.cpu (see Kubernetes Resource Management for Pods and Containers); instead, it's set to the number of logical cores on the host machine. The main implication is that it can lead to an increased tail latency in some specific situations.
One solution is to rely on uber-go/automaxprocs that automatically set GOMAXPROCS to match the Linux container CPU quota.
\"},{\"location\":\"pt-br/#community\",\"title\":\"Community\",\"text\":\"Thanks to all the contributors:
\"},{\"location\":\"zh/\",\"title\":\"Chinese (Simplified) Version\",\"text\":\"\"},{\"location\":\"zh/#100-go\",\"title\":\"100 \\u4e2a Go \\u5e38\\u89c1\\u9519\\u8bef\\u53ca\\u5982\\u4f55\\u907f\\u514d\",\"text\":\"The Coder Cafe \\u5982\\u679c\\u60a8\\u559c\\u6b22\\u6211\\u7684\\u4e66\\uff0c\\u60a8\\u53ef\\u80fd\\u4f1a\\u5bf9\\u6211\\u7684\\u6700\\u65b0\\u9879\\u76ee\\u611f\\u5174\\u8da3\\uff1aThe Coder Cafe\\uff0c\\u8fd9\\u662f\\u4e00\\u4e2a\\u4e3a\\u7a0b\\u5e8f\\u5458\\u63d0\\u4f9b\\u7684\\u6bcf\\u65e5\\u7b80\\u62a5\\u3002
Feeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
\"},{\"location\":\"zh/#_1\",\"title\":\"\\u4ee3\\u7801\\u53ca\\u5de5\\u7a0b\\u7ec4\\u7ec7\",\"text\":\"\"},{\"location\":\"zh/#1\",\"title\":\"\\u610f\\u5916\\u7684\\u53d8\\u91cf\\u9690\\u85cf (#1)\",\"text\":\"\\u907f\\u514d\\u53d8\\u91cf\\u9690\\u85cf\\uff08\\u5916\\u90e8\\u4f5c\\u7528\\u57df\\u53d8\\u91cf\\u88ab\\u5185\\u90e8\\u4f5c\\u7528\\u57df\\u540c\\u540d\\u53d8\\u91cf\\u9690\\u85cf\\uff09\\uff0c\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u53d8\\u91cf\\u5f15\\u7528\\u9519\\u8bef\\uff0c\\u6709\\u52a9\\u4e8e\\u4ed6\\u4eba\\u9605\\u8bfb\\u7406\\u89e3\\u3002
\"},{\"location\":\"zh/#2\",\"title\":\"\\u4e0d\\u5fc5\\u8981\\u7684\\u4ee3\\u7801\\u5d4c\\u5957 (#2)\",\"text\":\"\\u907f\\u514d\\u4e0d\\u5fc5\\u8981\\u7684\\u3001\\u8fc7\\u591a\\u7684\\u5d4c\\u5957\\u5c42\\u6b21\\uff0c\\u5e76\\u4e14\\u8ba9\\u6b63\\u5e38\\u4ee3\\u7801\\u8def\\u5f84\\u5c3d\\u91cf\\u5de6\\u5bf9\\u9f50\\uff08\\u800c\\u4e0d\\u662f\\u653e\\u5728\\u5206\\u652f\\u8def\\u5f84\\u4e2d\\uff09\\uff0c\\u6709\\u52a9\\u4e8e\\u6784\\u5efa\\u53ef\\u8bfb\\u6027\\u66f4\\u597d\\u7684\\u4ee3\\u7801\\u3002
\"},{\"location\":\"zh/#init-3\",\"title\":\"\\u8bef\\u7528 init \\u51fd\\u6570 (#3)\",\"text\":\"\\u521d\\u59cb\\u5316\\u53d8\\u91cf\\u65f6\\uff0c\\u8bf7\\u8bb0\\u4f4f init \\u51fd\\u6570\\u5177\\u6709\\u6709\\u9650\\u7684\\u9519\\u8bef\\u5904\\u7406\\u80fd\\u529b\\uff0c\\u5e76\\u4e14\\u4f1a\\u4f7f\\u72b6\\u6001\\u5904\\u7406\\u548c\\u6d4b\\u8bd5\\u53d8\\u5f97\\u66f4\\u52a0\\u590d\\u6742\\u3002\\u5728\\u5927\\u591a\\u6570\\u60c5\\u51b5\\u4e0b\\uff0c\\u521d\\u59cb\\u5316\\u5e94\\u8be5\\u4f5c\\u4e3a\\u7279\\u5b9a\\u51fd\\u6570\\u6765\\u5904\\u7406\\u3002
\"},{\"location\":\"zh/#getterssetters-4\",\"title\":\"\\u6ee5\\u7528 getters/setters (#4)\",\"text\":\"\\u5728 Go \\u8bed\\u8a00\\u4e2d\\uff0c\\u5f3a\\u5236\\u4f7f\\u7528 getter \\u548c setter \\u65b9\\u6cd5\\u5e76\\u4e0d\\u7b26\\u5408 Go \\u60ef\\u4f8b\\u3002\\u5728\\u5b9e\\u8df5\\u4e2d\\uff0c\\u5e94\\u8be5\\u627e\\u5230\\u6548\\u7387\\u548c\\u76f2\\u76ee\\u9075\\u5faa\\u67d0\\u4e9b\\u60ef\\u7528\\u6cd5\\u4e4b\\u95f4\\u7684\\u5e73\\u8861\\u70b9\\u3002
\"},{\"location\":\"zh/#5\",\"title\":\"\\u63a5\\u53e3\\u6c61\\u67d3 (#5)\",\"text\":\"\\u62bd\\u8c61\\u5e94\\u8be5\\u88ab\\u53d1\\u73b0\\uff0c\\u800c\\u4e0d\\u662f\\u88ab\\u521b\\u9020\\u3002\\u4e3a\\u4e86\\u907f\\u514d\\u4e0d\\u5fc5\\u8981\\u7684\\u590d\\u6742\\u6027\\uff0c\\u9700\\u8981\\u65f6\\u624d\\u521b\\u5efa\\u63a5\\u53e3\\uff0c\\u800c\\u4e0d\\u662f\\u9884\\u89c1\\u5230\\u9700\\u8981\\u5b83\\uff0c\\u6216\\u8005\\u81f3\\u5c11\\u53ef\\u4ee5\\u8bc1\\u660e\\u8fd9\\u79cd\\u62bd\\u8c61\\u662f\\u6709\\u4ef7\\u503c\\u7684\\u3002
\"},{\"location\":\"zh/#6\",\"title\":\"\\u5c06\\u63a5\\u53e3\\u5b9a\\u4e49\\u5728\\u5b9e\\u73b0\\u65b9\\u4e00\\u4fa7 (#6)\",\"text\":\"\\u5c06\\u63a5\\u53e3\\u4fdd\\u7559\\u5728\\u5f15\\u7528\\u65b9\\u4e00\\u4fa7\\uff08\\u800c\\u4e0d\\u662f\\u5b9e\\u73b0\\u65b9\\u4e00\\u4fa7\\uff09\\u53ef\\u4ee5\\u907f\\u514d\\u4e0d\\u5fc5\\u8981\\u7684\\u62bd\\u8c61\\u3002
\"},{\"location\":\"zh/#7\",\"title\":\"\\u5c06\\u63a5\\u53e3\\u4f5c\\u4e3a\\u8fd4\\u56de\\u503c (#7)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d\\u5728\\u7075\\u6d3b\\u6027\\u65b9\\u9762\\u53d7\\u5230\\u9650\\u5236\\uff0c\\u5927\\u591a\\u6570\\u60c5\\u51b5\\u4e0b\\u51fd\\u6570\\u4e0d\\u5e94\\u8be5\\u8fd4\\u56de\\u63a5\\u53e3\\uff0c\\u800c\\u5e94\\u8be5\\u8fd4\\u56de\\u5177\\u4f53\\u7684\\u5b9e\\u73b0\\u3002\\u76f8\\u53cd\\uff0c\\u51fd\\u6570\\u5e94\\u8be5\\u5c3d\\u53ef\\u80fd\\u5730\\u4f7f\\u7528\\u63a5\\u53e3\\u4f5c\\u4e3a\\u53c2\\u6570\\u3002
\"},{\"location\":\"zh/#any-8\",\"title\":\"any \\u6ca1\\u4f20\\u9012\\u4efb\\u4f55\\u4fe1\\u606f (#8)\",\"text\":\"\\u53ea\\u6709\\u5728\\u9700\\u8981\\u63a5\\u53d7\\u6216\\u8fd4\\u56de\\u4efb\\u610f\\u7c7b\\u578b\\u65f6\\uff0c\\u624d\\u4f7f\\u7528 any\\uff0c\\u4f8b\\u5982 json.Marshal\\u3002\\u5176\\u4ed6\\u60c5\\u51b5\\u4e0b\\uff0c\\u56e0\\u4e3a any \\u4e0d\\u63d0\\u4f9b\\u6709\\u610f\\u4e49\\u7684\\u4fe1\\u606f\\uff0c\\u53ef\\u80fd\\u4f1a\\u5bfc\\u81f4\\u7f16\\u8bd1\\u65f6\\u95ee\\u9898\\uff0c\\u5982\\u5141\\u8bb8\\u8c03\\u7528\\u8005\\u8c03\\u7528\\u65b9\\u6cd5\\u5904\\u7406\\u4efb\\u610f\\u7c7b\\u578b\\u6570\\u636e\\u3002
\"},{\"location\":\"zh/#9\",\"title\":\"\\u56f0\\u60d1\\u4f55\\u65f6\\u8be5\\u7528\\u8303\\u578b (#9)\",\"text\":\"\\u4f7f\\u7528\\u6cdb\\u578b\\uff0c\\u53ef\\u4ee5\\u901a\\u8fc7\\u7c7b\\u578b\\u53c2\\u6570\\u5206\\u79bb\\u5177\\u4f53\\u7684\\u6570\\u636e\\u7c7b\\u578b\\u548c\\u884c\\u4e3a\\uff0c\\u907f\\u514d\\u5199\\u5f88\\u591a\\u91cd\\u590d\\u5ea6\\u5f88\\u9ad8\\u7684\\u4ee3\\u7801\\u3002\\u7136\\u800c\\uff0c\\u4e0d\\u8981\\u8fc7\\u65e9\\u5730\\u4f7f\\u7528\\u6cdb\\u578b\\u3001\\u7c7b\\u578b\\u53c2\\u6570\\uff0c\\u53ea\\u6709\\u5728\\u4f60\\u770b\\u5230\\u771f\\u6b63\\u9700\\u8981\\u65f6\\u624d\\u4f7f\\u7528\\u3002\\u5426\\u5219\\uff0c\\u5b83\\u4eec\\u4f1a\\u5f15\\u5165\\u4e0d\\u5fc5\\u8981\\u7684\\u62bd\\u8c61\\u548c\\u590d\\u6742\\u6027\\u3002
\"},{\"location\":\"zh/#10\",\"title\":\"\\u672a\\u610f\\u8bc6\\u5230\\u7c7b\\u578b\\u5d4c\\u5957\\u7684\\u53ef\\u80fd\\u95ee\\u9898 (#10)\",\"text\":\"\\u4f7f\\u7528\\u7c7b\\u578b\\u5d4c\\u5957\\u4e5f\\u53ef\\u4ee5\\u907f\\u514d\\u5199\\u4e00\\u4e9b\\u91cd\\u590d\\u4ee3\\u7801\\uff0c\\u7136\\u800c\\uff0c\\u5728\\u4f7f\\u7528\\u65f6\\u9700\\u8981\\u786e\\u4fdd\\u4e0d\\u4f1a\\u5bfc\\u81f4\\u4e0d\\u5408\\u7406\\u7684\\u53ef\\u89c1\\u6027\\u95ee\\u9898\\uff0c\\u6bd4\\u5982\\u6709\\u4e9b\\u5b57\\u6bb5\\u5e94\\u8be5\\u5bf9\\u5916\\u9690\\u85cf\\u4e0d\\u5e94\\u8be5\\u88ab\\u66b4\\u9732\\u3002
\"},{\"location\":\"zh/#function-option-11\",\"title\":\"\\u4e0d\\u4f7f\\u7528 function option \\u6a21\\u5f0f (#11)\",\"text\":\"\\u4e3a\\u4e86\\u8bbe\\u8ba1\\u5e76\\u63d0\\u4f9b\\u66f4\\u53cb\\u597d\\u7684 API\\uff08\\u53ef\\u9009\\u53c2\\u6570\\uff09\\uff0c\\u4e3a\\u4e86\\u66f4\\u597d\\u5730\\u5904\\u7406\\u9009\\u9879\\uff0c\\u5e94\\u8be5\\u4f7f\\u7528 function option \\u6a21\\u5f0f\\u3002
\"},{\"location\":\"zh/#12\",\"title\":\"\\u5de5\\u7a0b\\u7ec4\\u7ec7\\u4e0d\\u5408\\u7406 (\\u5de5\\u7a0b\\u7ed3\\u6784\\u548c\\u5305\\u7684\\u7ec4\\u7ec7) (#12)\",\"text\":\"\\u9075\\u5faa\\u50cf project-layout \\u7684\\u5efa\\u8bae\\u6765\\u7ec4\\u7ec7 Go \\u5de5\\u7a0b\\u662f\\u4e00\\u4e2a\\u4e0d\\u9519\\u7684\\u65b9\\u6cd5\\uff0c\\u5c24\\u5176\\u662f\\u4f60\\u6b63\\u5728\\u5bfb\\u627e\\u4e00\\u4e9b\\u7c7b\\u4f3c\\u7684\\u7ecf\\u9a8c\\u3001\\u60ef\\u4f8b\\u6765\\u7ec4\\u7ec7\\u4e00\\u4e2a\\u65b0\\u7684 Go \\u5de5\\u7a0b\\u7684\\u65f6\\u5019\\u3002
\"},{\"location\":\"zh/#13\",\"title\":\"\\u521b\\u5efa\\u5de5\\u5177\\u5305 (#13)\",\"text\":\"\\u547d\\u540d\\u662f\\u8f6f\\u4ef6\\u8bbe\\u8ba1\\u5f00\\u53d1\\u4e2d\\u975e\\u5e38\\u91cd\\u8981\\u7684\\u4e00\\u4e2a\\u90e8\\u5206\\uff0c\\u521b\\u5efa\\u4e00\\u4e9b\\u540d\\u5982 common\\u3001util\\u3001shared \\u4e4b\\u7c7b\\u7684\\u5305\\u540d\\u5e76\\u4e0d\\u4f1a\\u7ed9\\u8bfb\\u8005\\u5e26\\u6765\\u592a\\u5927\\u4ef7\\u503c\\uff0c\\u5e94\\u8be5\\u5c06\\u8fd9\\u4e9b\\u5305\\u540d\\u91cd\\u6784\\u4e3a\\u66f4\\u6e05\\u6670\\u3001\\u66f4\\u5177\\u4f53\\u7684\\u5305\\u540d\\u3002
\"},{\"location\":\"zh/#14\",\"title\":\"\\u5ffd\\u7565\\u4e86\\u5305\\u540d\\u51b2\\u7a81 (#14)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d\\u53d8\\u91cf\\u540d\\u548c\\u5305\\u540d\\u4e4b\\u95f4\\u7684\\u51b2\\u7a81\\uff0c\\u5bfc\\u81f4\\u6df7\\u6dc6\\u6216\\u751a\\u81f3\\u9519\\u8bef\\uff0c\\u5e94\\u4e3a\\u6bcf\\u4e2a\\u53d8\\u91cf\\u548c\\u5305\\u4f7f\\u7528\\u552f\\u4e00\\u7684\\u540d\\u79f0\\u3002\\u5982\\u679c\\u8fd9\\u4e0d\\u53ef\\u884c\\uff0c\\u53ef\\u4ee5\\u8003\\u8651\\u4f7f\\u7528\\u5bfc\\u5165\\u522b\\u540d import importAlias 'importPath' \\u4ee5\\u533a\\u5206\\u5305\\u540d\\u548c\\u53d8\\u91cf\\u540d\\uff0c\\u6216\\u8005\\u8003\\u8651\\u4e00\\u4e2a\\u66f4\\u597d\\u7684\\u53d8\\u91cf\\u540d\\u3002
\"},{\"location\":\"zh/#15\",\"title\":\"\\u4ee3\\u7801\\u7f3a\\u5c11\\u6587\\u6863 (#15)\",\"text\":\"\\u4e3a\\u4e86\\u8ba9\\u4f7f\\u7528\\u65b9\\u3001\\u7ef4\\u62a4\\u4eba\\u5458\\u80fd\\u66f4\\u6e05\\u6670\\u5730\\u4e86\\u89e3\\u4f60\\u7684\\u4ee3\\u7801\\u7684\\u610f\\u56fe\\uff0c\\u5bfc\\u51fa\\u7684\\u5143\\u7d20\\uff08\\u51fd\\u6570\\u3001\\u7c7b\\u578b\\u3001\\u5b57\\u6bb5\\uff09\\u9700\\u8981\\u6dfb\\u52a0\\u6ce8\\u91ca\\u3002
\"},{\"location\":\"zh/#linters-16\",\"title\":\"\\u4e0d\\u4f7f\\u7528 linters \\u68c0\\u67e5 (#16)\",\"text\":\"\\u4e3a\\u4e86\\u6539\\u5584\\u4ee3\\u7801\\u8d28\\u91cf\\u3001\\u6574\\u4f53\\u4ee3\\u7801\\u7684\\u4e00\\u81f4\\u6027\\uff0c\\u5e94\\u8be5\\u4f7f\\u7528 linters \\u548c formatters\\u3002
\"},{\"location\":\"zh/#_2\",\"title\":\"\\u6570\\u636e\\u7c7b\\u578b\",\"text\":\"\"},{\"location\":\"zh/#17\",\"title\":\"\\u516b\\u8fdb\\u5236\\u5b57\\u9762\\u91cf\\u5f15\\u53d1\\u7684\\u56f0\\u60d1 (#17)\",\"text\":\"\\u5728\\u9605\\u8bfb\\u73b0\\u6709\\u4ee3\\u7801\\u65f6\\uff0c\\u8bf7\\u8bb0\\u4f4f\\u4ee5 0 \\u5f00\\u5934\\u7684\\u6574\\u6570\\u5b57\\u9762\\u91cf\\u662f\\u516b\\u8fdb\\u5236\\u6570\\u3002\\u6b64\\u5916\\uff0c\\u4e3a\\u4e86\\u63d0\\u9ad8\\u53ef\\u8bfb\\u6027\\uff0c\\u53ef\\u4ee5\\u901a\\u8fc7\\u5728\\u524d\\u9762\\u52a0\\u4e0a 0o \\u6765\\u663e\\u5f0f\\u5730\\u8868\\u793a\\u516b\\u8fdb\\u5236\\u6574\\u6570\\u3002
\"},{\"location\":\"zh/#18\",\"title\":\"\\u672a\\u6ce8\\u610f\\u53ef\\u80fd\\u7684\\u6574\\u6570\\u6ea2\\u51fa (#18)\",\"text\":\"\\u5728 Go \\u4e2d\\u6574\\u6570\\u4e0a\\u6ea2\\u51fa\\u548c\\u4e0b\\u6ea2\\u662f\\u9759\\u9ed8\\u5904\\u7406\\u7684\\uff0c\\u6240\\u4ee5\\u4f60\\u53ef\\u4ee5\\u5b9e\\u73b0\\u81ea\\u5df1\\u7684\\u51fd\\u6570\\u6765\\u6355\\u83b7\\u5b83\\u4eec\\u3002
\"},{\"location\":\"zh/#19\",\"title\":\"\\u6ca1\\u6709\\u900f\\u5f7b\\u7406\\u89e3\\u6d6e\\u70b9\\u6570 (#19)\",\"text\":\"\\u6bd4\\u8f83\\u6d6e\\u70b9\\u6570\\u65f6\\uff0c\\u901a\\u8fc7\\u6bd4\\u8f83\\u4e8c\\u8005\\u7684 delta \\u503c\\u662f\\u5426\\u4ecb\\u4e8e\\u4e00\\u5b9a\\u7684\\u8303\\u56f4\\u5185\\uff0c\\u80fd\\u8ba9\\u4f60\\u5199\\u51fa\\u53ef\\u79fb\\u690d\\u6027\\u66f4\\u597d\\u7684\\u4ee3\\u7801\\u3002
\\u5728\\u8fdb\\u884c\\u52a0\\u6cd5\\u6216\\u51cf\\u6cd5\\u65f6\\uff0c\\u5c06\\u5177\\u6709\\u76f8\\u4f3c\\u6570\\u91cf\\u7ea7\\u7684\\u64cd\\u4f5c\\u5206\\u6210\\u540c\\u4e00\\u7ec4\\u4ee5\\u63d0\\u9ad8\\u7cbe\\u5ea6 (\\u8fc7\\u65e9\\u6307\\u6570\\u5bf9\\u9f50\\u4e22\\u5931\\u7cbe\\u5ea6)\\u3002\\u6b64\\u5916\\uff0c\\u5728\\u8fdb\\u884c\\u52a0\\u6cd5\\u548c\\u51cf\\u6cd5\\u4e4b\\u524d\\uff0c\\u5e94\\u5148\\u8fdb\\u884c\\u4e58\\u6cd5\\u548c\\u9664\\u6cd5 (\\u52a0\\u51cf\\u6cd5\\u8bef\\u5dee\\u4f1a\\u88ab\\u4e58\\u9664\\u653e\\u5927)\\u3002
\"},{\"location\":\"zh/#slice-20\",\"title\":\"\\u4e0d\\u7406\\u89e3 slice \\u7684\\u957f\\u5ea6\\u548c\\u5bb9\\u91cf (#20)\",\"text\":\"\\u7406\\u89e3 slice \\u7684\\u957f\\u5ea6\\u548c\\u5bb9\\u91cf\\u7684\\u533a\\u522b\\uff0c\\u662f\\u4e00\\u4e2a Go \\u5f00\\u53d1\\u8005\\u7684\\u6838\\u5fc3\\u77e5\\u8bc6\\u70b9\\u4e4b\\u4e00\\u3002slice \\u7684\\u957f\\u5ea6\\u6307\\u7684\\u662f slice \\u5df2\\u7ecf\\u5b58\\u50a8\\u7684\\u5143\\u7d20\\u7684\\u6570\\u91cf\\uff0c\\u800c\\u5bb9\\u91cf\\u6307\\u7684\\u662f slice \\u5f53\\u524d\\u5e95\\u5c42\\u5f00\\u8f9f\\u7684\\u6570\\u7ec4\\u6700\\u591a\\u80fd\\u5bb9\\u7eb3\\u7684\\u5143\\u7d20\\u7684\\u6570\\u91cf\\u3002
\"},{\"location\":\"zh/#slice-21\",\"title\":\"\\u4e0d\\u9ad8\\u6548\\u7684 slice \\u521d\\u59cb\\u5316 (#21)\",\"text\":\"\\u5f53\\u521b\\u5efa\\u4e00\\u4e2a slice \\u65f6\\uff0c\\u5982\\u679c\\u5176\\u957f\\u5ea6\\u53ef\\u4ee5\\u9884\\u5148\\u786e\\u5b9a\\uff0c\\u90a3\\u4e48\\u53ef\\u4ee5\\u5728\\u5b9a\\u4e49\\u65f6\\u6307\\u5b9a\\u5b83\\u7684\\u957f\\u5ea6\\u548c\\u5bb9\\u91cf\\u3002\\u8fd9\\u53ef\\u4ee5\\u6539\\u5584\\u540e\\u671f append \\u65f6\\u4e00\\u6b21\\u6216\\u8005\\u591a\\u6b21\\u7684\\u5185\\u5b58\\u5206\\u914d\\u64cd\\u4f5c\\uff0c\\u4ece\\u800c\\u6539\\u5584\\u6027\\u80fd\\u3002\\u5bf9\\u4e8e map \\u7684\\u521d\\u59cb\\u5316\\u4e5f\\u662f\\u5982\\u6b64\\u3002
\"},{\"location\":\"zh/#nil-slice-22\",\"title\":\"\\u56f0\\u60d1\\u4e8e nil \\u548c\\u7a7a slice (#22)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d\\u5e38\\u89c1\\u7684\\u5bf9 nil \\u548c empty slice \\u5904\\u7406\\u884c\\u4e3a\\u7684\\u6df7\\u6dc6\\uff0c\\u4f8b\\u5982\\u5728\\u4f7f\\u7528 encoding/json \\u6216 reflect \\u5305\\u65f6\\uff0c\\u4f60\\u9700\\u8981\\u7406\\u89e3 nil \\u548c empty slice \\u7684\\u533a\\u522b\\u3002\\u4e24\\u8005\\u90fd\\u662f\\u957f\\u5ea6\\u4e3a\\u96f6\\u3001\\u5bb9\\u91cf\\u4e3a\\u96f6\\u7684\\u5207\\u7247\\uff0c\\u4f46\\u662f nil \\u5207\\u7247\\u4e0d\\u9700\\u8981\\u5206\\u914d\\u5185\\u5b58\\u3002
\"},{\"location\":\"zh/#slice-23\",\"title\":\"\\u6ca1\\u6709\\u9002\\u5f53\\u68c0\\u67e5 slice \\u662f\\u5426\\u4e3a\\u7a7a (#23)\",\"text\":\"\\u68c0\\u67e5\\u4e00\\u4e2a slice \\u662f\\u5426\\u5305\\u542b\\u4efb\\u4f55\\u5143\\u7d20\\uff0c\\u53ef\\u4ee5\\u68c0\\u67e5\\u5176\\u957f\\u5ea6\\uff0c\\u4e0d\\u7ba1 slice \\u662f nil \\u8fd8\\u662f empty\\uff0c\\u68c0\\u67e5\\u957f\\u5ea6\\u90fd\\u662f\\u6709\\u6548\\u7684\\u3002\\u8fd9\\u4e2a\\u68c0\\u67e5\\u65b9\\u6cd5\\u4e5f\\u9002\\u7528\\u4e8e map\\u3002
\\u4e3a\\u4e86\\u8bbe\\u8ba1\\u66f4\\u660e\\u786e\\u7684 API\\uff0cAPI \\u4e0d\\u5e94\\u533a\\u5206 nil \\u548c\\u7a7a\\u5207\\u7247\\u3002
\"},{\"location\":\"zh/#slice-24\",\"title\":\"\\u6ca1\\u6709\\u6b63\\u786e\\u62f7\\u8d1d slice (#24)\",\"text\":\"\\u4f7f\\u7528 copy \\u62f7\\u8d1d\\u4e00\\u4e2a slice \\u5143\\u7d20\\u5230\\u53e6\\u4e00\\u4e2a slice \\u65f6\\uff0c\\u9700\\u8981\\u8bb0\\u5f97\\uff0c\\u5b9e\\u9645\\u62f7\\u8d1d\\u7684\\u5143\\u7d20\\u6570\\u91cf\\u662f\\u4e8c\\u8005 slice \\u957f\\u5ea6\\u4e2d\\u7684\\u8f83\\u5c0f\\u503c\\u3002
\"},{\"location\":\"zh/#slice-append-25\",\"title\":\"slice append \\u5e26\\u6765\\u7684\\u9884\\u671f\\u4e4b\\u5916\\u7684\\u526f\\u4f5c\\u7528 (#25)\",\"text\":\"\\u5982\\u679c\\u4e24\\u4e2a\\u4e0d\\u540c\\u7684\\u51fd\\u6570\\u64cd\\u4f5c\\u7684 slice \\u590d\\u7528\\u4e86\\u76f8\\u540c\\u7684\\u5e95\\u5c42\\u6570\\u7ec4\\uff0c\\u5b83\\u4eec\\u5bf9 slice \\u6267\\u884c append \\u64cd\\u4f5c\\u65f6\\u53ef\\u80fd\\u4f1a\\u4ea7\\u751f\\u51b2\\u7a81\\u3002\\u4f7f\\u7528 copy \\u6765\\u5b8c\\u6574\\u590d\\u5236\\u4e00\\u4e2a slice \\u6216\\u8005\\u4f7f\\u7528\\u5b8c\\u6574\\u7684 slice \\u8868\\u8fbe\\u5f0f [low:high:max] \\u9650\\u5236\\u6700\\u5927\\u5bb9\\u91cf\\uff0c\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u4ea7\\u751f\\u51b2\\u7a81\\u3002\\u5f53\\u60f3\\u5bf9\\u4e00\\u4e2a\\u5927 slice \\u8fdb\\u884c shrink \\u64cd\\u4f5c\\u65f6\\uff0c\\u4e24\\u79cd\\u65b9\\u5f0f\\u4e2d\\uff0c\\u53ea\\u6709 copy \\u624d\\u53ef\\u4ee5\\u907f\\u514d\\u5185\\u5b58\\u6cc4\\u6f0f\\u3002
\"},{\"location\":\"zh/#slice-26\",\"title\":\"slice \\u548c\\u5185\\u5b58\\u6cc4\\u6f0f (#26)\",\"text\":\"\\u5bf9\\u4e8e slice \\u5143\\u7d20\\u4e3a\\u6307\\u9488\\uff0c\\u6216\\u8005 slice \\u5143\\u7d20\\u4e3a struct \\u4f46\\u662f\\u8be5 struct \\u542b\\u6709\\u6307\\u9488\\u5b57\\u6bb5\\uff0c\\u5f53\\u901a\\u8fc7 slice[low:high] \\u64cd\\u4f5c\\u53d6 subslice \\u65f6\\uff0c\\u5bf9\\u4e8e\\u90a3\\u4e9b\\u4e0d\\u53ef\\u8bbf\\u95ee\\u7684\\u5143\\u7d20\\u53ef\\u4ee5\\u663e\\u5f0f\\u8bbe\\u7f6e\\u4e3a nil \\u6765\\u907f\\u514d\\u5185\\u5b58\\u6cc4\\u9732\\u3002
\"},{\"location\":\"zh/#map-27\",\"title\":\"\\u4e0d\\u9ad8\\u6548\\u7684 map \\u521d\\u59cb\\u5316 (#27)\",\"text\":\"\\u89c1 #21.
\"},{\"location\":\"zh/#map-28\",\"title\":\"map \\u548c\\u5185\\u5b58\\u6cc4\\u6f0f (#28)\",\"text\":\"\\u4e00\\u4e2a map \\u7684 buckets \\u5360\\u7528\\u7684\\u5185\\u5b58\\u53ea\\u4f1a\\u589e\\u957f\\uff0c\\u4e0d\\u4f1a\\u7f29\\u51cf\\u3002\\u56e0\\u6b64\\uff0c\\u5982\\u679c\\u5b83\\u5bfc\\u81f4\\u4e86\\u4e00\\u4e9b\\u5185\\u5b58\\u5360\\u7528\\u7684\\u95ee\\u9898\\uff0c\\u4f60\\u9700\\u8981\\u5c1d\\u8bd5\\u4e0d\\u540c\\u7684\\u65b9\\u5f0f\\u6765\\u89e3\\u51b3\\uff0c\\u6bd4\\u5982\\u91cd\\u65b0\\u521b\\u5efa\\u4e00\\u4e2a map \\u4ee3\\u66ff\\u539f\\u6765\\u7684\\uff08\\u539f\\u6765\\u7684 map \\u4f1a\\u88ab GC \\u6389\\uff09\\uff0c\\u6216\\u8005 map[keyType]valueType \\u4e2d\\u7684 valueType \\u4f7f\\u7528\\u6307\\u9488\\u4ee3\\u66ff\\u957f\\u5ea6\\u56fa\\u5b9a\\u7684\\u6570\\u7ec4\\u6216\\u8005 sliceHeader \\u6765\\u7f13\\u89e3\\u8fc7\\u591a\\u7684\\u5185\\u5b58\\u5360\\u7528\\u3002
\"},{\"location\":\"zh/#29\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u7684\\u503c\\u6bd4\\u8f83 (#29)\",\"text\":\"Go \\u4e2d\\u6bd4\\u8f83\\u4e24\\u4e2a\\u7c7b\\u578b\\u503c\\u65f6\\uff0c\\u5982\\u679c\\u662f\\u53ef\\u6bd4\\u8f83\\u7c7b\\u578b\\uff0c\\u90a3\\u4e48\\u53ef\\u4ee5\\u4f7f\\u7528 == \\u6216\\u8005 != \\u8fd0\\u7b97\\u7b26\\u8fdb\\u884c\\u6bd4\\u8f83\\uff0c\\u6bd4\\u5982\\uff1abooleans\\u3001numerals\\u3001strings\\u3001pointers\\u3001channels\\uff0c\\u4ee5\\u53ca\\u5b57\\u6bb5\\u5168\\u90e8\\u662f\\u53ef\\u6bd4\\u8f83\\u7c7b\\u578b\\u7684 structs\\u3002\\u5176\\u4ed6\\u60c5\\u51b5\\u4e0b\\uff0c\\u4f60\\u53ef\\u4ee5\\u4f7f\\u7528 reflect.DeepEqual \\u6765\\u6bd4\\u8f83\\uff0c\\u7528\\u53cd\\u5c04\\u7684\\u8bdd\\u4f1a\\u727a\\u7272\\u4e00\\u70b9\\u6027\\u80fd\\uff0c\\u4e5f\\u53ef\\u4ee5\\u4f7f\\u7528\\u81ea\\u5b9a\\u4e49\\u7684\\u5b9e\\u73b0\\u548c\\u5176\\u4ed6\\u5e93\\u6765\\u5b8c\\u6210\\u3002
\"},{\"location\":\"zh/#_3\",\"title\":\"\\u63a7\\u5236\\u7ed3\\u6784\",\"text\":\"\"},{\"location\":\"zh/#range-30\",\"title\":\"\\u5ffd\\u7565\\u4e86 range \\u5faa\\u73af\\u53d8\\u91cf\\u662f\\u4e00\\u4e2a\\u62f7\\u8d1d (#30)\",\"text\":\"range \\u5faa\\u73af\\u4e2d\\u7684\\u5faa\\u73af\\u53d8\\u91cf\\u662f\\u904d\\u5386\\u5bb9\\u5668\\u4e2d\\u5143\\u7d20\\u503c\\u7684\\u4e00\\u4e2a\\u62f7\\u8d1d\\u3002\\u56e0\\u6b64\\uff0c\\u5982\\u679c\\u5143\\u7d20\\u503c\\u662f\\u4e00\\u4e2a struct \\u5e76\\u4e14\\u60f3\\u5728 range \\u4e2d\\u4fee\\u6539\\u5b83\\uff0c\\u53ef\\u4ee5\\u901a\\u8fc7\\u7d22\\u5f15\\u503c\\u6765\\u8bbf\\u95ee\\u5e76\\u4fee\\u6539\\u5b83\\uff0c\\u6216\\u8005\\u4f7f\\u7528\\u7ecf\\u5178\\u7684 for \\u5faa\\u73af+\\u7d22\\u5f15\\u503c\\u7684\\u5199\\u6cd5\\uff08\\u9664\\u975e\\u904d\\u5386\\u7684\\u5143\\u7d20\\u662f\\u4e00\\u4e2a\\u6307\\u9488\\uff09\\u3002
\"},{\"location\":\"zh/#range-channels-arrays-31\",\"title\":\"\\u5ffd\\u7565\\u4e86 range \\u5faa\\u73af\\u4e2d\\u8fed\\u4ee3\\u76ee\\u6807\\u503c\\u7684\\u8ba1\\u7b97\\u65b9\\u5f0f (channels \\u548c arrays) (#31)\",\"text\":\"\\u4f20\\u9012\\u7ed9 range \\u64cd\\u4f5c\\u7684\\u8fed\\u4ee3\\u76ee\\u6807\\u5bf9\\u5e94\\u7684\\u8868\\u8fbe\\u5f0f\\u7684\\u503c\\uff0c\\u53ea\\u4f1a\\u5728\\u5faa\\u73af\\u6267\\u884c\\u524d\\u88ab\\u8ba1\\u7b97\\u4e00\\u6b21\\uff0c\\u7406\\u89e3\\u8fd9\\u4e2a\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u72af\\u4e00\\u4e9b\\u5e38\\u89c1\\u7684\\u9519\\u8bef\\uff0c\\u4f8b\\u5982\\u4e0d\\u9ad8\\u6548\\u7684 channel \\u8d4b\\u503c\\u64cd\\u4f5c\\u548c slice \\u8fed\\u4ee3\\u64cd\\u4f5c\\u3002
\"},{\"location\":\"zh/#range-32\",\"title\":\"\\u5ffd\\u7565\\u4e86 range \\u5faa\\u73af\\u4e2d\\u6307\\u9488\\u5143\\u7d20\\u7684\\u5f71\\u54cd (#32)\",\"text\":\"\\u8fd9\\u91cc\\u5176\\u5b9e\\u5f3a\\u8c03\\u7684\\u662f range \\u8fed\\u4ee3\\u8fc7\\u7a0b\\u4e2d\\uff0c\\u8fed\\u4ee3\\u53d8\\u91cf\\u5b9e\\u9645\\u4e0a\\u662f\\u4e00\\u4e2a\\u62f7\\u8d1d\\u3002\\u5047\\u8bbe\\u7ed9\\u53e6\\u5916\\u4e00\\u4e2a\\u5bb9\\u5668\\u5143\\u7d20\\uff08\\u6307\\u9488\\u7c7b\\u578b\\uff09\\u8d4b\\u503c\\uff0c\\u4e14\\u9700\\u8981\\u5bf9\\u8fed\\u4ee3\\u53d8\\u91cf\\u53d6\\u5730\\u5740\\u8f6c\\u6362\\u6210\\u6307\\u9488\\u518d\\u8d4b\\u503c\\u7684\\u8bdd\\uff0c\\u8fd9\\u91cc\\u6f5c\\u85cf\\u7740\\u4e00\\u4e2a\\u9519\\u8bef\\uff0c\\u5c31\\u662f for \\u5faa\\u73af\\u8fed\\u4ee3\\u53d8\\u91cf\\u662f per-variable-per-loop \\u800c\\u4e0d\\u662f per-variable-per-iteration\\u3002\\u5982\\u679c\\u662f\\u901a\\u8fc7\\u5c40\\u90e8\\u53d8\\u91cf\\uff08\\u7528\\u8fed\\u4ee3\\u53d8\\u91cf\\u6765\\u521d\\u59cb\\u5316\\uff09\\u6216\\u8005\\u4f7f\\u7528\\u7d22\\u5f15\\u503c\\u6765\\u76f4\\u63a5\\u5f15\\u7528\\u8fed\\u4ee3\\u7684\\u5143\\u7d20\\uff0c\\u5c06\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u62f7\\u8d1d\\u6307\\u9488(\\u8fed\\u4ee3\\u53d8\\u91cf\\u7684\\u5730\\u5740)\\u4e4b\\u7c7b\\u7684 bug\\u3002
\"},{\"location\":\"zh/#map-33\",\"title\":\"map \\u8fed\\u4ee3\\u8fc7\\u7a0b\\u4e2d\\u7684\\u9519\\u8bef\\u5047\\u8bbe\\uff08\\u904d\\u5386\\u987a\\u5e8f\\u548c\\u8fed\\u4ee3\\u8fc7\\u7a0b\\u4e2d\\u63d2\\u5165\\uff09(#33)\",\"text\":\"\\u4f7f\\u7528 map \\u65f6\\uff0c\\u4e3a\\u4e86\\u80fd\\u5f97\\u5230\\u786e\\u5b9a\\u4e00\\u81f4\\u7684\\u7ed3\\u679c\\uff0c\\u5e94\\u8be5\\u8bb0\\u4f4f Go \\u4e2d\\u7684 map \\u6570\\u636e\\u7ed3\\u6784\\uff1a * \\u4e0d\\u4f1a\\u6309\\u7167 key \\u5bf9 data \\u8fdb\\u884c\\u6392\\u5e8f\\uff0c\\u904d\\u5386\\u65f6 key \\u4e0d\\u662f\\u6709\\u5e8f\\u7684\\uff1b * \\u904d\\u5386\\u65f6\\u7684\\u987a\\u5e8f\\uff0c\\u4e5f\\u4e0d\\u662f\\u6309\\u7167\\u63d2\\u5165\\u65f6\\u7684\\u987a\\u5e8f\\uff1b * \\u6ca1\\u6709\\u4e00\\u4e2a\\u786e\\u5b9a\\u6027\\u7684\\u904d\\u5386\\u987a\\u5e8f\\uff0c\\u6bcf\\u6b21\\u904d\\u5386\\u987a\\u5e8f\\u662f\\u4e0d\\u540c\\u7684\\uff1b * \\u4e0d\\u80fd\\u4fdd\\u8bc1\\u8fed\\u4ee3\\u8fc7\\u7a0b\\u4e2d\\u65b0\\u63d2\\u5165\\u7684\\u5143\\u7d20\\uff0c\\u5728\\u5f53\\u524d\\u8fed\\u4ee3\\u4e2d\\u80fd\\u591f\\u88ab\\u904d\\u5386\\u5230\\uff1b
\"},{\"location\":\"zh/#break-34\",\"title\":\"\\u5ffd\\u7565\\u4e86 break \\u8bed\\u53e5\\u662f\\u5982\\u4f55\\u5de5\\u4f5c\\u7684 (#34)\",\"text\":\"\\u914d\\u5408 label \\u4f7f\\u7528 break \\u548c continue\\uff0c\\u80fd\\u591f\\u8df3\\u8fc7\\u4e00\\u4e2a\\u7279\\u5b9a\\u7684\\u8bed\\u53e5\\uff0c\\u5728\\u67d0\\u4e9b\\u5faa\\u73af\\u4e2d\\u5b58\\u5728 switch \\u548c select \\u8bed\\u53e5\\u7684\\u573a\\u666f\\u4e2d\\u5c31\\u6bd4\\u8f83\\u6709\\u5e2e\\u52a9\\u3002
\"},{\"location\":\"zh/#defer-35\",\"title\":\"\\u5728\\u5faa\\u73af\\u4e2d\\u4f7f\\u7528 defer (#35)\",\"text\":\"\\u5728\\u5faa\\u73af\\u4e2d\\u4f7f\\u7528 defer \\u4e0d\\u80fd\\u5728\\u6bcf\\u8f6e\\u8fed\\u4ee3\\u7ed3\\u675f\\u65f6\\u6267\\u884c defer \\u8bed\\u53e5\\uff0c\\u4f46\\u662f\\u5c06\\u5faa\\u73af\\u903b\\u8f91\\u63d0\\u53d6\\u5230\\u51fd\\u6570\\u5185\\u90e8\\u4f1a\\u5728\\u6bcf\\u6b21\\u8fed\\u4ee3\\u7ed3\\u675f\\u65f6\\u6267\\u884c defer \\u8bed\\u53e5\\u3002
\"},{\"location\":\"zh/#_4\",\"title\":\"\\u5b57\\u7b26\\u4e32\",\"text\":\"\"},{\"location\":\"zh/#rune-36\",\"title\":\"\\u6ca1\\u6709\\u7406\\u89e3 rune (#36)\",\"text\":\"\\u7406\\u89e3 rune \\u7c7b\\u578b\\u5bf9\\u5e94\\u7684\\u662f\\u4e00\\u4e2a unicode \\u7801\\u70b9\\uff0c\\u6bcf\\u4e00\\u4e2a unicode \\u7801\\u70b9\\u5176\\u5b9e\\u662f\\u4e00\\u4e2a\\u591a\\u5b57\\u8282\\u7684\\u5e8f\\u5217\\uff0c\\u4e0d\\u662f\\u4e00\\u4e2a byte\\u3002\\u8fd9\\u5e94\\u8be5\\u662f Go \\u5f00\\u53d1\\u8005\\u7684\\u6838\\u5fc3\\u77e5\\u8bc6\\u70b9\\u4e4b\\u4e00\\uff0c\\u7406\\u89e3\\u4e86\\u8fd9\\u4e2a\\u6709\\u52a9\\u4e8e\\u66f4\\u51c6\\u786e\\u5730\\u5904\\u7406\\u5b57\\u7b26\\u4e32\\u3002
\"},{\"location\":\"zh/#37\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u7684\\u5b57\\u7b26\\u4e32\\u904d\\u5386 (#37)\",\"text\":\"\\u4f7f\\u7528 range \\u64cd\\u4f5c\\u7b26\\u5bf9\\u4e00\\u4e2a string \\u8fdb\\u884c\\u904d\\u5386\\u5b9e\\u9645\\u4e0a\\u662f\\u5bf9 string \\u5bf9\\u5e94\\u7684 []rune \\u8fdb\\u884c\\u904d\\u5386\\uff0c\\u8fed\\u4ee3\\u53d8\\u91cf\\u4e2d\\u7684\\u7d22\\u5f15\\u503c\\uff0c\\u8868\\u793a\\u7684\\u5f53\\u524d rune \\u5bf9\\u5e94\\u7684 []rune \\u5728\\u6574\\u4e2a []rune(string) \\u4e2d\\u7684\\u8d77\\u59cb\\u7d22\\u5f15\\u3002\\u5982\\u679c\\u8981\\u8bbf\\u95ee string \\u4e2d\\u7684\\u67d0\\u4e00\\u4e2a rune\\uff08\\u6bd4\\u5982\\u7b2c\\u4e09\\u4e2a\\uff09\\uff0c\\u9996\\u5148\\u8981\\u5c06\\u5b57\\u7b26\\u4e32\\u8f6c\\u6362\\u4e3a []rune \\u7136\\u540e\\u518d\\u6309\\u7d22\\u5f15\\u503c\\u8bbf\\u95ee\\u3002
\"},{\"location\":\"zh/#trim-38\",\"title\":\"\\u8bef\\u7528 trim \\u51fd\\u6570 (#38)\",\"text\":\"strings.TrimRight/strings.TrimLeft \\u79fb\\u9664\\u5728\\u5b57\\u7b26\\u4e32\\u5c3e\\u90e8\\u6216\\u8005\\u5f00\\u5934\\u51fa\\u73b0\\u7684\\u4e00\\u4e9b runes\\uff0c\\u51fd\\u6570\\u4f1a\\u6307\\u5b9a\\u4e00\\u4e2a rune \\u96c6\\u5408\\uff0c\\u51fa\\u73b0\\u5728\\u96c6\\u5408\\u4e2d\\u7684 rune \\u5c06\\u88ab\\u4ece\\u5b57\\u7b26\\u4e32\\u79fb\\u9664\\u3002\\u800c strings.TrimSuffix/strings.TrimPrefix \\u662f\\u79fb\\u9664\\u5b57\\u7b26\\u4e32\\u7684\\u4e00\\u4e2a\\u540e\\u7f00/\\u524d\\u7f00\\u3002
\"},{\"location\":\"zh/#39\",\"title\":\"\\u4e0d\\u7ecf\\u4f18\\u5316\\u7684\\u5b57\\u7b26\\u4e32\\u62fc\\u63a5\\u64cd\\u4f5c (#39)\",\"text\":\"\\u5bf9\\u4e00\\u4e2a\\u5b57\\u7b26\\u4e32\\u5217\\u8868\\u8fdb\\u884c\\u904d\\u5386\\u62fc\\u63a5\\u64cd\\u4f5c\\uff0c\\u5e94\\u8be5\\u901a\\u8fc7 strings.Builder \\u6765\\u5b8c\\u6210\\uff0c\\u4ee5\\u907f\\u514d\\u6bcf\\u6b21\\u8fed\\u4ee3\\u62fc\\u63a5\\u65f6\\u90fd\\u5206\\u914d\\u4e00\\u4e2a\\u65b0\\u7684 string \\u5bf9\\u8c61\\u51fa\\u6765\\u3002
\"},{\"location\":\"zh/#40\",\"title\":\"\\u65e0\\u7528\\u7684\\u5b57\\u7b26\\u4e32\\u8f6c\\u6362 (#40)\",\"text\":\"bytes \\u5305\\u63d0\\u4f9b\\u4e86\\u4e00\\u4e9b\\u548c strings \\u5305\\u76f8\\u4f3c\\u7684\\u64cd\\u4f5c\\uff0c\\u53ef\\u4ee5\\u5e2e\\u52a9\\u907f\\u514d []byte/string \\u4e4b\\u95f4\\u7684\\u8f6c\\u6362\\u3002
\"},{\"location\":\"zh/#41\",\"title\":\"\\u5b50\\u5b57\\u7b26\\u4e32\\u548c\\u5185\\u5b58\\u6cc4\\u6f0f (#41)\",\"text\":\"\\u4f7f\\u7528\\u4e00\\u4e2a\\u5b50\\u5b57\\u7b26\\u4e32\\u7684\\u62f7\\u8d1d\\uff0c\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u5185\\u5b58\\u6cc4\\u6f0f\\uff0c\\u56e0\\u4e3a\\u5bf9\\u4e00\\u4e2a\\u5b57\\u7b26\\u4e32\\u7684 s[low:high] \\u64cd\\u4f5c\\u8fd4\\u56de\\u7684\\u5b50\\u5b57\\u7b26\\u4e32\\uff0c\\u5176\\u4f7f\\u7528\\u4e86\\u548c\\u539f\\u5b57\\u7b26\\u4e32 s \\u76f8\\u540c\\u7684\\u5e95\\u5c42\\u6570\\u7ec4\\u3002
\"},{\"location\":\"zh/#_5\",\"title\":\"\\u51fd\\u6570\\u548c\\u65b9\\u6cd5\",\"text\":\"\"},{\"location\":\"zh/#42\",\"title\":\"\\u4e0d\\u77e5\\u9053\\u4f7f\\u7528\\u54ea\\u79cd\\u63a5\\u6536\\u5668\\u7c7b\\u578b (#42)\",\"text\":\"\\u5bf9\\u4e8e\\u63a5\\u6536\\u5668\\u7c7b\\u578b\\u662f\\u91c7\\u7528 value \\u7c7b\\u578b\\u8fd8\\u662f pointer \\u7c7b\\u578b\\uff0c\\u5e94\\u8be5\\u53d6\\u51b3\\u4e8e\\u4e0b\\u9762\\u8fd9\\u51e0\\u79cd\\u56e0\\u7d20\\uff0c\\u6bd4\\u5982\\uff1a\\u65b9\\u6cd5\\u5185\\u662f\\u5426\\u4f1a\\u5bf9\\u5b83\\u8fdb\\u884c\\u4fee\\u6539\\uff0c\\u5b83\\u662f\\u5426\\u5305\\u542b\\u4e86\\u4e00\\u4e2a\\u4e0d\\u80fd\\u88ab\\u62f7\\u8d1d\\u7684\\u5b57\\u6bb5\\uff0c\\u4ee5\\u53ca\\u5b83\\u8868\\u793a\\u7684\\u5bf9\\u8c61\\u6709\\u591a\\u5927\\u3002\\u5982\\u679c\\u6709\\u7591\\u95ee\\uff0c\\u63a5\\u6536\\u5668\\u53ef\\u4ee5\\u8003\\u8651\\u4f7f\\u7528 pointer \\u7c7b\\u578b\\u3002
\"},{\"location\":\"zh/#43\",\"title\":\"\\u4ece\\u4e0d\\u4f7f\\u7528\\u547d\\u540d\\u7684\\u8fd4\\u56de\\u503c (#43)\",\"text\":\"\\u4f7f\\u7528\\u547d\\u540d\\u7684\\u8fd4\\u56de\\u503c\\uff0c\\u662f\\u4e00\\u79cd\\u6709\\u6548\\u6539\\u5584\\u51fd\\u6570\\u3001\\u65b9\\u6cd5\\u53ef\\u8bfb\\u6027\\u7684\\u65b9\\u6cd5\\uff0c\\u7279\\u522b\\u662f\\u8fd4\\u56de\\u503c\\u5217\\u8868\\u4e2d\\u6709\\u591a\\u4e2a\\u7c7b\\u578b\\u76f8\\u540c\\u7684\\u53c2\\u6570\\u3002\\u53e6\\u5916\\uff0c\\u56e0\\u4e3a\\u8fd4\\u56de\\u503c\\u5217\\u8868\\u4e2d\\u7684\\u53c2\\u6570\\u662f\\u7ecf\\u8fc7\\u96f6\\u503c\\u521d\\u59cb\\u5316\\u8fc7\\u7684\\uff0c\\u67d0\\u4e9b\\u573a\\u666f\\u4e0b\\u4e5f\\u4f1a\\u7b80\\u5316\\u51fd\\u6570\\u3001\\u65b9\\u6cd5\\u7684\\u5b9e\\u73b0\\u3002\\u4f46\\u662f\\u9700\\u8981\\u6ce8\\u610f\\u5b83\\u7684\\u4e00\\u4e9b\\u6f5c\\u5728\\u526f\\u4f5c\\u7528\\u3002
\"},{\"location\":\"zh/#44\",\"title\":\"\\u4f7f\\u7528\\u547d\\u540d\\u7684\\u8fd4\\u56de\\u503c\\u65f6\\u9884\\u671f\\u5916\\u7684\\u526f\\u4f5c\\u7528 (#44)\",\"text\":\"\\u89c1 #43.
\\u4f7f\\u7528\\u547d\\u540d\\u7684\\u8fd4\\u56de\\u503c\\uff0c\\u56e0\\u4e3a\\u5b83\\u5df2\\u7ecf\\u88ab\\u521d\\u59cb\\u5316\\u4e86\\u96f6\\u503c\\uff0c\\u9700\\u8981\\u6ce8\\u610f\\u5728\\u67d0\\u4e9b\\u60c5\\u51b5\\u4e0b\\u5f02\\u5e38\\u8fd4\\u56de\\u65f6\\u662f\\u5426\\u9700\\u8981\\u7ed9\\u5b83\\u8d4b\\u4e88\\u4e00\\u4e2a\\u4e0d\\u540c\\u7684\\u503c\\uff0c\\u6bd4\\u5982\\u8fd4\\u56de\\u503c\\u5217\\u8868\\u5b9a\\u4e49\\u4e86\\u4e00\\u4e2a\\u6709\\u540d\\u53c2\\u6570 err error\\uff0c\\u9700\\u8981\\u6ce8\\u610f return err \\u65f6\\u662f\\u5426\\u6b63\\u786e\\u5730\\u5bf9 err \\u8fdb\\u884c\\u4e86\\u8d4b\\u503c\\u3002
\"},{\"location\":\"zh/#nil-45\",\"title\":\"\\u8fd4\\u56de\\u4e00\\u4e2a nil \\u63a5\\u6536\\u5668 (#45)\",\"text\":\"\\u5f53\\u8fd4\\u56de\\u4e00\\u4e2a interface \\u53c2\\u6570\\u65f6\\uff0c\\u9700\\u8981\\u5c0f\\u5fc3\\uff0c\\u4e0d\\u8981\\u8fd4\\u56de\\u4e00\\u4e2a nil \\u6307\\u9488\\uff0c\\u800c\\u662f\\u5e94\\u8be5\\u663e\\u5f0f\\u8fd4\\u56de\\u4e00\\u4e2a nil \\u503c\\u3002\\u5426\\u5219\\uff0c\\u53ef\\u80fd\\u4f1a\\u53d1\\u751f\\u4e00\\u4e9b\\u9884\\u671f\\u5916\\u7684\\u95ee\\u9898\\uff0c\\u56e0\\u4e3a\\u8c03\\u7528\\u65b9\\u4f1a\\u6536\\u5230\\u4e00\\u4e2a\\u975e nil \\u7684\\u503c\\u3002
\"},{\"location\":\"zh/#46\",\"title\":\"\\u4f7f\\u7528\\u6587\\u4ef6\\u540d\\u4f5c\\u4e3a\\u51fd\\u6570\\u5165\\u53c2 (#46)\",\"text\":\"\\u8bbe\\u8ba1\\u51fd\\u6570\\u65f6\\u4f7f\\u7528 io.Reader \\u7c7b\\u578b\\u4f5c\\u4e3a\\u5165\\u53c2\\uff0c\\u800c\\u4e0d\\u662f\\u6587\\u4ef6\\u540d\\uff0c\\u5c06\\u6709\\u52a9\\u4e8e\\u6539\\u5584\\u51fd\\u6570\\u7684\\u53ef\\u590d\\u7528\\u6027\\u3001\\u6613\\u6d4b\\u8bd5\\u6027\\u3002
\"},{\"location\":\"zh/#defer-value-47\",\"title\":\"\\u5ffd\\u7565 defer \\u8bed\\u53e5\\u4e2d\\u53c2\\u6570\\u3001\\u63a5\\u6536\\u5668\\u503c\\u7684\\u8ba1\\u7b97\\u65b9\\u5f0f (\\u53c2\\u6570\\u503c\\u8ba1\\u7b97, \\u6307\\u9488, \\u548c value \\u7c7b\\u578b\\u63a5\\u6536\\u5668) (#47)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d defer \\u8bed\\u53e5\\u6267\\u884c\\u65f6\\u5c31\\u7acb\\u5373\\u5bf9 defer \\u8981\\u6267\\u884c\\u7684\\u51fd\\u6570\\u7684\\u53c2\\u6570\\u8fdb\\u884c\\u8ba1\\u7b97\\uff0c\\u53ef\\u4ee5\\u8003\\u8651\\u5c06\\u8981\\u6267\\u884c\\u7684\\u51fd\\u6570\\u653e\\u5230\\u95ed\\u5305\\u91cc\\u9762\\uff0c\\u7136\\u540e\\u901a\\u8fc7\\u6307\\u9488\\u4f20\\u9012\\u53c2\\u6570\\u7ed9\\u95ed\\u5305\\u5185\\u51fd\\u6570\\uff08\\u6216\\u8005\\u901a\\u8fc7\\u95ed\\u5305\\u6355\\u83b7\\u5916\\u90e8\\u53d8\\u91cf\\uff09\\uff0c\\u6765\\u89e3\\u51b3\\u8fd9\\u4e2a\\u95ee\\u9898\\u3002
\"},{\"location\":\"zh/#_6\",\"title\":\"\\u9519\\u8bef\\u7ba1\\u7406\",\"text\":\"\"},{\"location\":\"zh/#panicking-48\",\"title\":\"Panicking (#48)\",\"text\":\"\\u4f7f\\u7528 panic \\u662f Go \\u4e2d\\u4e00\\u79cd\\u5904\\u7406\\u9519\\u8bef\\u7684\\u65b9\\u5f0f\\uff0c\\u4f46\\u662f\\u53ea\\u80fd\\u5728\\u9047\\u5230\\u4e0d\\u53ef\\u6062\\u590d\\u7684\\u9519\\u8bef\\u65f6\\u4f7f\\u7528\\uff0c\\u4f8b\\u5982\\uff1a\\u901a\\u77e5\\u5f00\\u53d1\\u4eba\\u5458\\u4e00\\u4e2a\\u5f3a\\u4f9d\\u8d56\\u7684\\u6a21\\u5757\\u52a0\\u8f7d\\u5931\\u8d25\\u4e86\\u3002
\"},{\"location\":\"zh/#error-49\",\"title\":\"\\u672a\\u8003\\u8651\\u4f55\\u65f6\\u624d\\u5e94\\u8be5\\u5305\\u88c5 error (#49)\",\"text\":\"Wrapping\\uff08\\u5305\\u88c5\\uff09\\u9519\\u8bef\\u5141\\u8bb8\\u60a8\\u6807\\u8bb0\\u9519\\u8bef\\u3001\\u63d0\\u4f9b\\u989d\\u5916\\u7684\\u4e0a\\u4e0b\\u6587\\u4fe1\\u606f\\u3002\\u7136\\u800c\\uff0c\\u5305\\u88c5\\u9519\\u8bef\\u4f1a\\u521b\\u5efa\\u6f5c\\u5728\\u7684\\u8026\\u5408\\uff0c\\u56e0\\u4e3a\\u5b83\\u4f7f\\u5f97\\u539f\\u6765\\u7684\\u9519\\u8bef\\u5bf9\\u8c03\\u7528\\u8005\\u53ef\\u89c1\\u3002\\u5982\\u679c\\u60a8\\u60f3\\u8981\\u9632\\u6b62\\u8fd9\\u79cd\\u60c5\\u51b5\\uff0c\\u8bf7\\u4e0d\\u8981\\u4f7f\\u7528\\u5305\\u88c5\\u9519\\u8bef\\u7684\\u65b9\\u5f0f\\u3002
\"},{\"location\":\"zh/#50\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u7684\\u9519\\u8bef\\u7c7b\\u578b\\u6bd4\\u8f83 (#50)\",\"text\":\"\\u5982\\u679c\\u4f60\\u4f7f\\u7528 Go 1.13 \\u5f15\\u5165\\u7684\\u7279\\u6027 fmt.Errorf + %w \\u6765\\u5305\\u88c5\\u4e00\\u4e2a\\u9519\\u8bef\\uff0c\\u5f53\\u8fdb\\u884c\\u9519\\u8bef\\u6bd4\\u8f83\\u65f6\\uff0c\\u5982\\u679c\\u60f3\\u5224\\u65ad\\u8be5\\u5305\\u88c5\\u540e\\u7684\\u9519\\u8bef\\u662f\\u4e0d\\u662f\\u6307\\u5b9a\\u7684\\u9519\\u8bef\\u7c7b\\u578b\\uff0c\\u5c31\\u9700\\u8981\\u4f7f\\u7528 errors.As\\uff0c\\u5982\\u679c\\u60f3\\u5224\\u65ad\\u662f\\u4e0d\\u662f\\u6307\\u5b9a\\u7684 error \\u5bf9\\u8c61\\u5c31\\u9700\\u8981\\u7528 errors.Is\\u3002
\"},{\"location\":\"zh/#51\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u7684\\u9519\\u8bef\\u5bf9\\u8c61\\u503c\\u6bd4\\u8f83 (#51)\",\"text\":\"\\u89c1 #50.
\\u4e3a\\u4e86\\u8868\\u8fbe\\u4e00\\u4e2a\\u9884\\u671f\\u5185\\u7684\\u9519\\u8bef\\uff0c\\u8bf7\\u4f7f\\u7528\\u9519\\u8bef\\u503c\\u7684\\u65b9\\u5f0f\\uff0c\\u5e76\\u901a\\u8fc7 == \\u6216\\u8005 errors.Is \\u6765\\u6bd4\\u8f83\\u3002\\u800c\\u5bf9\\u4e8e\\u610f\\u5916\\u9519\\u8bef\\uff0c\\u5219\\u5e94\\u4f7f\\u7528\\u7279\\u5b9a\\u7684\\u9519\\u8bef\\u7c7b\\u578b\\uff08\\u53ef\\u4ee5\\u901a\\u8fc7 errors.As \\u6765\\u6bd4\\u8f83\\uff09\\u3002
\"},{\"location\":\"zh/#52\",\"title\":\"\\u4e24\\u6b21\\u5904\\u7406\\u540c\\u4e00\\u4e2a\\u9519\\u8bef (#52)\",\"text\":\"\\u5927\\u591a\\u6570\\u60c5\\u51b5\\u4e0b\\uff0c\\u9519\\u8bef\\u4ec5\\u9700\\u8981\\u5904\\u7406\\u4e00\\u6b21\\u3002\\u6253\\u5370\\u9519\\u8bef\\u65e5\\u5fd7\\u4e5f\\u662f\\u4e00\\u79cd\\u9519\\u8bef\\u5904\\u7406\\u3002\\u56e0\\u6b64\\uff0c\\u5f53\\u51fd\\u6570\\u5185\\u53d1\\u751f\\u9519\\u8bef\\u65f6\\uff0c\\u5e94\\u8be5\\u5728\\u6253\\u5370\\u65e5\\u5fd7\\u548c\\u8fd4\\u56de\\u9519\\u8bef\\u4e2d\\u9009\\u62e9\\u5176\\u4e2d\\u4e00\\u79cd\\u3002\\u5305\\u88c5\\u9519\\u8bef\\u4e5f\\u53ef\\u4ee5\\u63d0\\u4f9b\\u95ee\\u9898\\u53d1\\u751f\\u7684\\u989d\\u5916\\u4e0a\\u4e0b\\u6587\\u4fe1\\u606f\\uff0c\\u4e5f\\u5305\\u62ec\\u4e86\\u539f\\u6765\\u7684\\u9519\\u8bef\\uff08\\u53ef\\u8003\\u8651\\u4ea4\\u7ed9\\u8c03\\u7528\\u65b9\\u8d1f\\u8d23\\u6253\\u65e5\\u5fd7\\uff09\\u3002
\"},{\"location\":\"zh/#53\",\"title\":\"\\u4e0d\\u5904\\u7406\\u9519\\u8bef (#53)\",\"text\":\"\\u4e0d\\u7ba1\\u662f\\u5728\\u51fd\\u6570\\u8c03\\u7528\\u65f6\\uff0c\\u8fd8\\u662f\\u5728\\u4e00\\u4e2a defer \\u51fd\\u6570\\u6267\\u884c\\u65f6\\uff0c\\u5982\\u679c\\u60f3\\u8981\\u5ffd\\u7565\\u4e00\\u4e2a\\u9519\\u8bef\\uff0c\\u5e94\\u8be5\\u663e\\u5f0f\\u5730\\u901a\\u8fc7 _ \\u6765\\u5ffd\\u7565\\uff08\\u53ef\\u6ce8\\u660e\\u5ffd\\u7565\\u7684\\u539f\\u56e0\\uff09\\u3002\\u5426\\u5219\\uff0c\\u5c06\\u6765\\u7684\\u8bfb\\u8005\\u5c31\\u4f1a\\u611f\\u89c9\\u5230\\u56f0\\u60d1\\uff0c\\u5ffd\\u7565\\u8fd9\\u4e2a\\u9519\\u8bef\\u662f\\u6709\\u610f\\u4e3a\\u4e4b\\u8fd8\\u662f\\u65e0\\u610f\\u4e2d\\u6f0f\\u6389\\u4e86\\u3002
\"},{\"location\":\"zh/#defer-54\",\"title\":\"\\u4e0d\\u5904\\u7406 defer \\u4e2d\\u7684\\u9519\\u8bef (#54)\",\"text\":\"\\u5927\\u591a\\u6570\\u60c5\\u51b5\\u4e0b\\uff0c\\u4f60\\u4e0d\\u5e94\\u8be5\\u5ffd\\u7565 defer \\u51fd\\u6570\\u6267\\u884c\\u65f6\\u8fd4\\u56de\\u7684\\u9519\\u8bef\\uff0c\\u6216\\u8005\\u663e\\u5f0f\\u5904\\u7406\\u5b83\\uff0c\\u6216\\u8005\\u5c06\\u5b83\\u4f20\\u9012\\u7ed9\\u8c03\\u7528\\u65b9\\u5904\\u7406\\uff0c\\u53ef\\u4ee5\\u6839\\u636e\\u60c5\\u666f\\u8fdb\\u884c\\u9009\\u62e9\\u3002\\u5982\\u679c\\u4f60\\u786e\\u5b9a\\u8981\\u5ffd\\u7565\\u8fd9\\u4e2a\\u9519\\u8bef\\uff0c\\u8bf7\\u663e\\u5f0f\\u4f7f\\u7528 _ \\u6765\\u5ffd\\u7565\\u3002
\"},{\"location\":\"zh/#_7\",\"title\":\"\\u5e76\\u53d1\\u7f16\\u7a0b: \\u57fa\\u7840\",\"text\":\"\"},{\"location\":\"zh/#55\",\"title\":\"\\u6df7\\u6dc6\\u5e76\\u53d1\\u548c\\u5e76\\u884c (#55)\",\"text\":\"\\u7406\\u89e3\\u5e76\\u53d1\\uff08concurrency\\uff09\\u3001\\u5e76\\u884c\\uff08parallelism\\uff09\\u4e4b\\u95f4\\u7684\\u672c\\u8d28\\u533a\\u522b\\u662f Go \\u5f00\\u53d1\\u4eba\\u5458\\u5fc5\\u987b\\u8981\\u638c\\u63e1\\u7684\\u3002\\u5e76\\u53d1\\u662f\\u5173\\u4e8e\\u7ed3\\u6784\\u8bbe\\u8ba1\\u4e0a\\u7684\\uff0c\\u5e76\\u884c\\u662f\\u5173\\u4e8e\\u5177\\u4f53\\u6267\\u884c\\u4e0a\\u7684\\u3002
\"},{\"location\":\"zh/#56\",\"title\":\"\\u8ba4\\u4e3a\\u5e76\\u53d1\\u603b\\u662f\\u66f4\\u5feb (#56)\",\"text\":\"\\u8981\\u6210\\u4e3a\\u4e00\\u540d\\u719f\\u7ec3\\u7684\\u5f00\\u53d1\\u4eba\\u5458\\uff0c\\u60a8\\u5fc5\\u987b\\u610f\\u8bc6\\u5230\\u5e76\\u975e\\u6240\\u6709\\u573a\\u666f\\u4e0b\\u90fd\\u662f\\u5e76\\u53d1\\u7684\\u65b9\\u6848\\u66f4\\u5feb\\u3002\\u5bf9\\u4e8e\\u4efb\\u52a1\\u4e2d\\u7684\\u6700\\u5c0f\\u5de5\\u4f5c\\u8d1f\\u8f7d\\u90e8\\u5206\\uff0c\\u5bf9\\u5b83\\u4eec\\u8fdb\\u884c\\u5e76\\u884c\\u5316\\u5904\\u7406\\u5e76\\u4e0d\\u4e00\\u5b9a\\u5c31\\u6709\\u660e\\u663e\\u6536\\u76ca\\u6216\\u8005\\u6bd4\\u4e32\\u884c\\u5316\\u65b9\\u6848\\u66f4\\u5feb\\u3002\\u5bf9\\u4e32\\u884c\\u5316\\u3001\\u5e76\\u53d1\\u65b9\\u6848\\u8fdb\\u884c benchmark \\u6d4b\\u8bd5\\uff0c\\u662f\\u9a8c\\u8bc1\\u5047\\u8bbe\\u7684\\u597d\\u529e\\u6cd5\\u3002
\"},{\"location\":\"zh/#channels-mutexes-57\",\"title\":\"\\u4e0d\\u6e05\\u695a\\u4f55\\u65f6\\u4f7f\\u7528 channels \\u6216 mutexes (#57)\",\"text\":\"\\u4e86\\u89e3 goroutine \\u4e4b\\u95f4\\u7684\\u4ea4\\u4e92\\u4e5f\\u53ef\\u4ee5\\u5728\\u9009\\u62e9\\u4f7f\\u7528 channels \\u6216 mutexes \\u65f6\\u6709\\u6240\\u5e2e\\u52a9\\u3002\\u4e00\\u822c\\u6765\\u8bf4\\uff0c\\u5e76\\u884c\\u7684 goroutine \\u9700\\u8981\\u540c\\u6b65\\uff0c\\u56e0\\u6b64\\u9700\\u8981\\u4f7f\\u7528 mutexes\\u3002\\u76f8\\u53cd\\uff0c\\u5e76\\u53d1\\u7684 goroutine \\u901a\\u5e38\\u9700\\u8981\\u534f\\u8c03\\u548c\\u7f16\\u6392\\uff0c\\u56e0\\u6b64\\u9700\\u8981\\u4f7f\\u7528 channels\\u3002
\"},{\"location\":\"zh/#vs-go-58\",\"title\":\"\\u4e0d\\u660e\\u767d\\u7ade\\u6001\\u95ee\\u9898 (\\u6570\\u636e\\u7ade\\u6001 vs. \\u7ade\\u6001\\u6761\\u4ef6\\u548c Go \\u5185\\u5b58\\u6a21\\u578b) (#58)\",\"text\":\"\\u638c\\u63e1\\u5e76\\u53d1\\u610f\\u5473\\u7740\\u8981\\u8ba4\\u8bc6\\u5230\\u6570\\u636e\\u7ade\\u4e89\\uff08data races\\uff09\\u548c\\u7ade\\u6001\\u6761\\u4ef6\\uff08race conditions\\uff09\\u662f\\u4e24\\u4e2a\\u4e0d\\u540c\\u7684\\u6982\\u5ff5\\u3002\\u6570\\u636e\\u7ade\\u4e89\\uff0c\\u6307\\u7684\\u662f\\u6709\\u591a\\u4e2a goroutines \\u540c\\u65f6\\u8bbf\\u95ee\\u76f8\\u540c\\u5185\\u5b58\\u533a\\u57df\\u65f6\\uff0c\\u7f3a\\u4e4f\\u5fc5\\u8981\\u7684\\u540c\\u6b65\\u63a7\\u5236\\uff0c\\u4e14\\u5176\\u4e2d\\u81f3\\u5c11\\u6709\\u4e00\\u4e2a goroutine \\u6267\\u884c\\u7684\\u662f\\u5199\\u64cd\\u4f5c\\u3002\\u540c\\u65f6\\u8981\\u8ba4\\u8bc6\\u5230\\uff0c\\u6ca1\\u6709\\u53d1\\u751f\\u6570\\u636e\\u7ade\\u4e89\\u4e0d\\u4ee3\\u8868\\u7a0b\\u5e8f\\u7684\\u6267\\u884c\\u662f\\u786e\\u5b9a\\u6027\\u7684\\u3001\\u6ca1\\u95ee\\u9898\\u7684\\u3002\\u5f53\\u5728\\u67d0\\u4e2a\\u7279\\u5b9a\\u7684\\u64cd\\u4f5c\\u987a\\u5e8f\\u6216\\u8005\\u7279\\u5b9a\\u7684\\u4e8b\\u4ef6\\u53d1\\u751f\\u987a\\u5e8f\\u4e0b\\uff0c\\u5982\\u679c\\u6700\\u7ec8\\u7684\\u884c\\u4e3a\\u662f\\u4e0d\\u53ef\\u63a7\\u7684\\uff0c\\u8fd9\\u5c31\\u662f\\u7ade\\u6001\\u6761\\u4ef6\\u3002
ps\\uff1a\\u6570\\u636e\\u7ade\\u4e89\\u662f\\u7ade\\u6001\\u6761\\u4ef6\\u7684\\u5b50\\u96c6\\uff0c\\u7ade\\u6001\\u6761\\u4ef6\\u4e0d\\u4ec5\\u5c40\\u9650\\u4e8e\\u8bbf\\u5b58\\u672a\\u540c\\u6b65\\uff0c\\u5b83\\u53ef\\u4ee5\\u53d1\\u751f\\u5728\\u66f4\\u9ad8\\u7684\\u5c42\\u9762\\u3002go test -race \\u68c0\\u6d4b\\u7684\\u662f\\u6570\\u636e\\u7ade\\u4e89\\uff0c\\u9700\\u8981\\u540c\\u6b65\\u6765\\u89e3\\u51b3\\uff0c\\u800c\\u5f00\\u53d1\\u8005\\u8fd8\\u9700\\u8981\\u5173\\u6ce8\\u9762\\u66f4\\u5e7f\\u7684\\u7ade\\u6001\\u6761\\u4ef6\\uff0c\\u5b83\\u9700\\u8981\\u5bf9\\u591a\\u4e2a goroutines \\u7684\\u6267\\u884c\\u8fdb\\u884c\\u7f16\\u6392\\u3002
\\u7406\\u89e3 Go \\u7684\\u5185\\u5b58\\u6a21\\u578b\\u4ee5\\u53ca\\u6709\\u5173\\u987a\\u5e8f\\u548c\\u540c\\u6b65\\u7684\\u5e95\\u5c42\\u4fdd\\u8bc1\\u662f\\u9632\\u6b62\\u53ef\\u80fd\\u7684\\u6570\\u636e\\u7ade\\u4e89\\u548c\\u7ade\\u6001\\u6761\\u4ef6\\u7684\\u5173\\u952e\\u3002
\"},{\"location\":\"zh/#59\",\"title\":\"\\u4e0d\\u7406\\u89e3\\u4e0d\\u540c\\u5de5\\u4f5c\\u8d1f\\u8f7d\\u7c7b\\u578b\\u5bf9\\u5e76\\u53d1\\u7684\\u5f71\\u54cd (#59)\",\"text\":\"\\u5f53\\u521b\\u5efa\\u4e00\\u5b9a\\u6570\\u91cf\\u7684 goroutines \\u65f6\\uff0c\\u9700\\u8981\\u8003\\u8651\\u5de5\\u4f5c\\u8d1f\\u8f7d\\u7684\\u7c7b\\u578b\\u3002\\u5982\\u679c\\u5de5\\u4f5c\\u8d1f\\u8f7d\\u662f CPU \\u5bc6\\u96c6\\u578b\\u7684\\uff0c\\u90a3\\u4e48 goroutines \\u6570\\u91cf\\u5e94\\u8be5\\u63a5\\u8fd1\\u4e8e GOMAXPROCS \\u7684\\u503c\\uff08\\u8be5\\u503c\\u53d6\\u51b3\\u4e8e\\u4e3b\\u673a\\u5904\\u7406\\u5668\\u6838\\u5fc3\\u6570\\uff09\\u3002\\u5982\\u679c\\u5de5\\u4f5c\\u8d1f\\u8f7d\\u662f IO \\u5bc6\\u96c6\\u578b\\u7684\\uff0cgoroutines \\u6570\\u91cf\\u5c31\\u9700\\u8981\\u8003\\u8651\\u591a\\u79cd\\u56e0\\u7d20\\uff0c\\u6bd4\\u5982\\u5916\\u90e8\\u7cfb\\u7edf\\uff08\\u8003\\u8651\\u8bf7\\u6c42\\u3001\\u54cd\\u5e94\\u901f\\u7387\\uff09\\u3002
\"},{\"location\":\"zh/#go-contexts-60\",\"title\":\"\\u8bef\\u89e3\\u4e86 Go contexts (#60)\",\"text\":\"Go \\u7684\\u4e0a\\u4e0b\\u6587\\uff08context\\uff09\\u4e5f\\u662f Go \\u5e76\\u53d1\\u7f16\\u7a0b\\u7684\\u57fa\\u77f3\\u4e4b\\u4e00\\u3002\\u4e0a\\u4e0b\\u6587\\u5141\\u8bb8\\u60a8\\u643a\\u5e26\\u622a\\u6b62\\u65f6\\u95f4\\u3001\\u53d6\\u6d88\\u4fe1\\u53f7\\u548c\\u952e\\u503c\\u5217\\u8868\\u3002
\"},{\"location\":\"zh/#_8\",\"title\":\"\\u5e76\\u53d1\\u7f16\\u7a0b: \\u5b9e\\u8df5\",\"text\":\"\"},{\"location\":\"zh/#context-61\",\"title\":\"\\u4f20\\u9012\\u4e0d\\u5408\\u9002\\u7684 context (#61)\",\"text\":\"\\u5f53\\u6211\\u4eec\\u4f20\\u9012\\u4e86\\u4e00\\u4e2a context\\uff0c\\u6211\\u4eec\\u9700\\u8981\\u77e5\\u9053\\u8fd9\\u4e2a context \\u4ec0\\u4e48\\u65f6\\u5019\\u53ef\\u4ee5\\u88ab\\u53d6\\u6d88\\uff0c\\u8fd9\\u70b9\\u5f88\\u91cd\\u8981\\uff0c\\u4f8b\\u5982\\uff1a\\u4e00\\u4e2a HTTP \\u8bf7\\u6c42\\u5904\\u7406\\u5668\\u5728\\u53d1\\u9001\\u5b8c\\u54cd\\u5e94\\u540e\\u53d6\\u6d88 context\\u3002
ps: \\u5b9e\\u9645\\u4e0a context \\u8868\\u8fbe\\u7684\\u662f\\u4e00\\u4e2a\\u52a8\\u4f5c\\u53ef\\u4ee5\\u6301\\u7eed\\u591a\\u4e45\\u4e4b\\u540e\\u88ab\\u505c\\u6b62\\u3002
\"},{\"location\":\"zh/#goroutine-62\",\"title\":\"\\u542f\\u52a8\\u4e86\\u4e00\\u4e2a goroutine \\u4f46\\u662f\\u4e0d\\u77e5\\u9053\\u5b83\\u4f55\\u65f6\\u4f1a\\u505c\\u6b62 (#62)\",\"text\":\"\\u907f\\u514d goroutine \\u6cc4\\u6f0f\\uff0c\\u8981\\u6709\\u8fd9\\u79cd\\u610f\\u8bc6\\uff0c\\u5f53\\u521b\\u5efa\\u5e76\\u542f\\u52a8\\u4e00\\u4e2a goroutine \\u7684\\u65f6\\u5019\\uff0c\\u5e94\\u8be5\\u6709\\u5bf9\\u5e94\\u7684\\u8bbe\\u8ba1\\u8ba9\\u5b83\\u80fd\\u6b63\\u5e38\\u9000\\u51fa\\u3002
\"},{\"location\":\"zh/#goroutines-63\",\"title\":\"\\u4e0d\\u6ce8\\u610f\\u5904\\u7406 goroutines \\u548c\\u5faa\\u73af\\u4e2d\\u7684\\u8fed\\u4ee3\\u53d8\\u91cf (#63)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d goroutines \\u548c\\u5faa\\u73af\\u4e2d\\u7684\\u8fed\\u4ee3\\u53d8\\u91cf\\u95ee\\u9898\\uff0c\\u53ef\\u4ee5\\u8003\\u8651\\u521b\\u5efa\\u5c40\\u90e8\\u53d8\\u91cf\\u5e76\\u5c06\\u8fed\\u4ee3\\u53d8\\u91cf\\u8d4b\\u503c\\u7ed9\\u5c40\\u90e8\\u53d8\\u91cf\\uff0c\\u6216\\u8005 goroutines \\u8c03\\u7528\\u5e26\\u53c2\\u6570\\u7684\\u51fd\\u6570\\uff0c\\u5c06\\u8fed\\u4ee3\\u53d8\\u91cf\\u503c\\u4f5c\\u4e3a\\u53c2\\u6570\\u503c\\u4f20\\u5165\\uff0c\\u6765\\u4ee3\\u66ff goroutines \\u8c03\\u7528\\u95ed\\u5305\\u3002
\"},{\"location\":\"zh/#select-channels-64\",\"title\":\"\\u4f7f\\u7528 select + channels \\u65f6\\u8bef\\u4ee5\\u4e3a\\u5206\\u652f\\u9009\\u62e9\\u987a\\u5e8f\\u662f\\u786e\\u5b9a\\u7684 (#64)\",\"text\":\"\\u8981\\u660e\\u767d\\uff0cselect \\u591a\\u4e2a channels \\u65f6\\uff0c\\u5982\\u679c\\u591a\\u4e2a channels \\u4e0a\\u7684\\u64cd\\u4f5c\\u90fd\\u5c31\\u7eea\\uff0c\\u90a3\\u4e48\\u4f1a\\u968f\\u673a\\u9009\\u62e9\\u4e00\\u4e2a case \\u5206\\u652f\\u6765\\u6267\\u884c\\uff0c\\u56e0\\u6b64\\u8981\\u907f\\u514d\\u6709\\u5206\\u652f\\u9009\\u62e9\\u987a\\u5e8f\\u662f\\u4ece\\u4e0a\\u5230\\u4e0b\\u7684\\u8fd9\\u79cd\\u9519\\u8bef\\u9884\\u8bbe\\uff0c\\u8fd9\\u53ef\\u80fd\\u4f1a\\u5bfc\\u81f4\\u8bbe\\u8ba1\\u4e0a\\u7684 bug\\u3002
\"},{\"location\":\"zh/#channels-65\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u4f7f\\u7528\\u901a\\u77e5 channels (#65)\",\"text\":\"\\u53d1\\u9001\\u901a\\u77e5\\u65f6\\u4f7f\\u7528 chan struct{} \\u7c7b\\u578b\\u3002
ps: \\u5148\\u660e\\u767d\\u4ec0\\u4e48\\u662f\\u901a\\u77e5 channels\\uff0c\\u4e00\\u4e2a\\u901a\\u77e5 channels \\u6307\\u7684\\u662f\\u53ea\\u662f\\u7528\\u6765\\u505a\\u901a\\u77e5\\uff0c\\u800c\\u5176\\u4e2d\\u4f20\\u9012\\u7684\\u6570\\u636e\\u6ca1\\u6709\\u610f\\u4e49\\uff0c\\u6216\\u8005\\u7406\\u89e3\\u6210\\u4e0d\\u4f20\\u9012\\u6570\\u636e\\u7684 channels\\uff0c\\u8fd9\\u79cd\\u79f0\\u4e3a\\u901a\\u77e5 channels\\u3002\\u5176\\u4e2d\\u4f20\\u9012\\u7684\\u6570\\u636e\\u7684\\u7c7b\\u578b\\u4e3a struct{} \\u66f4\\u5408\\u9002\\u3002
\"},{\"location\":\"zh/#nil-channels-66\",\"title\":\"\\u4e0d\\u4f7f\\u7528 nil channels (#66)\",\"text\":\"\\u4f7f\\u7528 nil channels \\u5e94\\u8be5\\u662f\\u5e76\\u53d1\\u5904\\u7406\\u65b9\\u5f0f\\u4e2d\\u7684\\u4e00\\u90e8\\u5206\\uff0c\\u4f8b\\u5982\\uff0c\\u5b83\\u80fd\\u591f\\u5e2e\\u52a9\\u7981\\u7528 select \\u8bed\\u53e5\\u4e2d\\u7684\\u7279\\u5b9a\\u7684\\u5206\\u652f\\u3002
\"},{\"location\":\"zh/#channel-size-67\",\"title\":\"\\u4e0d\\u6e05\\u695a\\u8be5\\u5982\\u4f55\\u786e\\u5b9a channel size (#67)\",\"text\":\"\\u6839\\u636e\\u6307\\u5b9a\\u7684\\u573a\\u666f\\u4ed4\\u7ec6\\u8bc4\\u4f30\\u5e94\\u8be5\\u4f7f\\u7528\\u54ea\\u4e00\\u79cd channel \\u7c7b\\u578b\\uff08\\u5e26\\u7f13\\u51b2\\u7684\\uff0c\\u4e0d\\u5e26\\u7f13\\u51b2\\u7684\\uff09\\u3002\\u53ea\\u6709\\u4e0d\\u5e26\\u7f13\\u51b2\\u7684 channels \\u53ef\\u4ee5\\u63d0\\u4f9b\\u5f3a\\u540c\\u6b65\\u4fdd\\u8bc1\\u3002
\\u4f7f\\u7528\\u5e26\\u7f13\\u51b2\\u7684 channels \\u65f6\\u5982\\u679c\\u4e0d\\u786e\\u5b9a size \\u8be5\\u5982\\u4f55\\u8bbe\\u7f6e\\uff0c\\u53ef\\u4ee5\\u5148\\u8bbe\\u4e3a 1\\uff0c\\u5982\\u679c\\u6709\\u5408\\u7406\\u7684\\u7406\\u7531\\u518d\\u53bb\\u6307\\u5b9a channels size\\u3002
ps: \\u6839\\u636e disruptor \\u8fd9\\u4e2a\\u9ad8\\u6027\\u80fd\\u5185\\u5b58\\u6d88\\u606f\\u961f\\u5217\\u7684\\u5b9e\\u8df5\\uff0c\\u5728\\u67d0\\u79cd\\u8bfb\\u5199 pacing \\u4e0b\\uff0c\\u961f\\u5217\\u8981\\u4e48\\u6ee1\\u8981\\u4e48\\u7a7a\\uff0c\\u4e0d\\u5927\\u53ef\\u80fd\\u5904\\u4e8e\\u67d0\\u79cd\\u4ecb\\u4e8e\\u4e2d\\u95f4\\u7684\\u7a33\\u6001\\u3002
\"},{\"location\":\"zh/#etcd-68\",\"title\":\"\\u5fd8\\u8bb0\\u4e86\\u5b57\\u7b26\\u4e32\\u683c\\u5f0f\\u5316\\u53ef\\u80fd\\u5e26\\u6765\\u7684\\u526f\\u4f5c\\u7528\\uff08\\u4f8b\\u5982 etcd \\u6570\\u636e\\u7ade\\u4e89\\u548c\\u6b7b\\u9501\\uff09(#68)\",\"text\":\"\\u610f\\u8bc6\\u5230\\u5b57\\u7b26\\u4e32\\u683c\\u5f0f\\u5316\\u53ef\\u80fd\\u4f1a\\u5bfc\\u81f4\\u8c03\\u7528\\u73b0\\u6709\\u51fd\\u6570\\uff0c\\u8fd9\\u610f\\u5473\\u7740\\u9700\\u8981\\u6ce8\\u610f\\u53ef\\u80fd\\u7684\\u6b7b\\u9501\\u548c\\u5176\\u4ed6\\u6570\\u636e\\u7ade\\u4e89\\u95ee\\u9898\\u3002
ps: \\u6838\\u5fc3\\u662f\\u8981\\u5173\\u6ce8 fmt.Sprintf + %v \\u8fdb\\u884c\\u5b57\\u7b26\\u4e32\\u683c\\u5f0f\\u5316\\u65f6 %v \\u5177\\u4f53\\u5230\\u4e0d\\u540c\\u7684\\u7c7b\\u578b\\u503c\\u65f6\\uff0c\\u5b9e\\u9645\\u4e0a\\u6267\\u884c\\u7684\\u64cd\\u4f5c\\u662f\\u4ec0\\u4e48\\u3002\\u6bd4\\u5982 %v \\u8fd9\\u4e2a placeholder \\u5bf9\\u5e94\\u7684\\u503c\\u662f\\u4e00\\u4e2a context.Context\\uff0c\\u90a3\\u4e48\\u4f1a\\u5c31\\u904d\\u5386\\u5176\\u901a\\u8fc7 context.WithValue \\u9644\\u52a0\\u5728\\u5176\\u4e2d\\u7684 values\\uff0c\\u8fd9\\u4e2a\\u8fc7\\u7a0b\\u53ef\\u80fd\\u6d89\\u53ca\\u5230\\u6570\\u636e\\u7ade\\u4e89\\u95ee\\u9898\\u3002\\u4e66\\u4e2d\\u63d0\\u53ca\\u7684\\u53e6\\u4e00\\u4e2a\\u5bfc\\u81f4\\u6b7b\\u9501\\u7684\\u6848\\u4f8b\\u672c\\u8d28\\u4e0a\\u4e5f\\u662f\\u4e00\\u6837\\u7684\\u95ee\\u9898\\uff0c\\u53ea\\u4e0d\\u8fc7\\u53c8\\u989d\\u5916\\u7275\\u626f\\u5230\\u4e86 sync.RWMutex \\u4e0d\\u53ef\\u91cd\\u5165\\u7684\\u95ee\\u9898\\u3002
\"},{\"location\":\"zh/#append-69\",\"title\":\"\\u4f7f\\u7528 append \\u4e0d\\u5f53\\u5bfc\\u81f4\\u6570\\u636e\\u7ade\\u4e89 (#69)\",\"text\":\"\\u8c03\\u7528 append \\u4e0d\\u603b\\u662f\\u6ca1\\u6709\\u6570\\u636e\\u7ade\\u4e89\\u7684\\uff0c\\u56e0\\u6b64\\u4e0d\\u8981\\u5728\\u4e00\\u4e2a\\u5171\\u4eab\\u7684 slice \\u4e0a\\u5e76\\u53d1\\u5730\\u6267\\u884c append\\u3002
\"},{\"location\":\"zh/#mutexes-slicesmaps-70\",\"title\":\"\\u8bef\\u7528 mutexes \\u548c slices\\u3001maps (#70)\",\"text\":\"\\u8bf7\\u8bb0\\u4f4f slices \\u548c maps \\u662f\\u5f15\\u7528\\u7c7b\\u578b\\uff0c\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u5e38\\u89c1\\u7684\\u6570\\u636e\\u7ade\\u4e89\\u95ee\\u9898\\u3002
ps: \\u8fd9\\u91cc\\u5b9e\\u9645\\u662f\\u56e0\\u4e3a\\u9519\\u8bef\\u7406\\u89e3\\u4e86 slices \\u548c maps\\uff0c\\u5bfc\\u81f4\\u5199\\u51fa\\u4e86\\u9519\\u8bef\\u5730\\u62f7\\u8d1d slices \\u548c maps \\u7684\\u4ee3\\u7801\\uff0c\\u8fdb\\u800c\\u5bfc\\u81f4\\u9501\\u4fdd\\u62a4\\u65e0\\u6548\\u3001\\u51fa\\u73b0\\u6570\\u636e\\u7ade\\u4e89\\u95ee\\u9898\\u3002
\"},{\"location\":\"zh/#syncwaitgroup-71\",\"title\":\"\\u8bef\\u7528 sync.WaitGroup (#71)\",\"text\":\"\\u6b63\\u786e\\u5730\\u4f7f\\u7528 sync.WaitGroup \\u9700\\u8981\\u5728\\u542f\\u52a8 goroutines \\u4e4b\\u524d\\u5148\\u8c03\\u7528 Add \\u65b9\\u6cd5\\u3002
\"},{\"location\":\"zh/#synccond-72\",\"title\":\"\\u5fd8\\u8bb0\\u4f7f\\u7528 sync.Cond (#72)\",\"text\":\"\\u4f60\\u53ef\\u4ee5\\u4f7f\\u7528 sync.Cond \\u5411\\u591a\\u4e2a goroutines \\u53d1\\u9001\\u91cd\\u590d\\u7684\\u901a\\u77e5\\u3002
\"},{\"location\":\"zh/#errgroup-73\",\"title\":\"\\u4e0d\\u4f7f\\u7528 errgroup (#73)\",\"text\":\"\\u4f60\\u53ef\\u4ee5\\u4f7f\\u7528 errgroup \\u5305\\u6765\\u540c\\u6b65\\u4e00\\u7ec4 goroutines \\u5e76\\u5904\\u7406\\u9519\\u8bef\\u548c\\u4e0a\\u4e0b\\u6587\\u3002
\"},{\"location\":\"zh/#sync-74\",\"title\":\"\\u62f7\\u8d1d\\u4e00\\u4e2a sync \\u4e0b\\u7684\\u7c7b\\u578b (#74)\",\"text\":\"sync \\u5305\\u4e0b\\u7684\\u7c7b\\u578b\\u4e0d\\u5e94\\u8be5\\u88ab\\u62f7\\u8d1d\\u3002
\"},{\"location\":\"zh/#_9\",\"title\":\"\\u6807\\u51c6\\u5e93\",\"text\":\"\"},{\"location\":\"zh/#timeduration-75\",\"title\":\"\\u4f7f\\u7528\\u4e86\\u9519\\u8bef\\u7684 time.Duration (#75)\",\"text\":\"\\u6ce8\\u610f\\u6709\\u4e9b\\u51fd\\u6570\\u63a5\\u6536\\u4e00\\u4e2a time.Duration \\u7c7b\\u578b\\u7684\\u53c2\\u6570\\u65f6\\uff0c\\u5c3d\\u7ba1\\u76f4\\u63a5\\u4f20\\u9012\\u4e00\\u4e2a\\u6574\\u6570\\u662f\\u53ef\\u4ee5\\u7684\\uff0c\\u4f46\\u6700\\u597d\\u8fd8\\u662f\\u4f7f\\u7528 time API \\u4e2d\\u7684\\u65b9\\u6cd5\\u6765\\u4f20\\u9012 duration\\uff0c\\u4ee5\\u907f\\u514d\\u53ef\\u80fd\\u9020\\u6210\\u7684\\u56f0\\u60d1\\u548c bug\\u3002
ps: \\u91cd\\u70b9\\u662f\\u6ce8\\u610f time.Duration \\u5b9a\\u4e49\\u7684\\u662f nanoseconds \\u6570\\u3002
\"},{\"location\":\"zh/#timeafter-76\",\"title\":\"time.After \\u548c\\u5185\\u5b58\\u6cc4\\u6f0f (#76)\",\"text\":\"\\u907f\\u514d\\u5728\\u91cd\\u590d\\u6267\\u884c\\u5f88\\u591a\\u6b21\\u7684\\u51fd\\u6570\\uff08\\u5982\\u5faa\\u73af\\u4e2d\\u6216 HTTP \\u5904\\u7406\\u51fd\\u6570\\uff09\\u4e2d\\u8c03\\u7528 time.After\\uff0c\\u8fd9\\u53ef\\u4ee5\\u907f\\u514d\\u5185\\u5b58\\u5cf0\\u503c\\u6d88\\u8017\\u3002\\u7531 time.After \\u521b\\u5efa\\u7684\\u8d44\\u6e90\\u4ec5\\u5728\\u8ba1\\u65f6\\u5668\\u8d85\\u65f6\\u624d\\u4f1a\\u88ab\\u91ca\\u653e\\u3002
\"},{\"location\":\"zh/#json-77\",\"title\":\"JSON \\u5904\\u7406\\u4e2d\\u7684\\u5e38\\u89c1\\u9519\\u8bef (#77)\",\"text\":\" \\u7c7b\\u578b\\u5d4c\\u5957\\u5bfc\\u81f4\\u7684\\u9884\\u6599\\u5916\\u7684\\u884c\\u4e3a \\u8981\\u5f53\\u5fc3\\u5728 Go \\u7ed3\\u6784\\u4f53\\u4e2d\\u5d4c\\u5165\\u5b57\\u6bb5\\uff0c\\u8fd9\\u6837\\u505a\\u53ef\\u80fd\\u4f1a\\u5bfc\\u81f4\\u8bf8\\u5982\\u5d4c\\u5165\\u7684 time.Time \\u5b57\\u6bb5\\u5b9e\\u73b0 json.Marshaler \\u63a5\\u53e3\\uff0c\\u4ece\\u800c\\u8986\\u76d6\\u9ed8\\u8ba4\\u7684 JSON \\u5e8f\\u5217\\u3002
JSON \\u548c\\u5355\\u8c03\\u65f6\\u949f \\u5f53\\u5bf9\\u4e24\\u4e2a time.Time \\u7c7b\\u578b\\u503c\\u8fdb\\u884c\\u6bd4\\u8f83\\u65f6\\uff0c\\u9700\\u8981\\u8bb0\\u4f4f time.Time \\u5305\\u542b\\u4e86\\u4e00\\u4e2a\\u5899\\u4e0a\\u65f6\\u949f\\uff08wall clock\\uff09\\u548c\\u4e00\\u4e2a\\u5355\\u8c03\\u65f6\\u949f \\uff08monotonic clock\\uff09\\uff0c\\u800c\\u4f7f\\u7528 == \\u8fd0\\u7b97\\u7b26\\u8fdb\\u884c\\u6bd4\\u8f83\\u65f6\\u4f1a\\u540c\\u65f6\\u6bd4\\u8f83\\u8fd9\\u4e24\\u4e2a\\u3002
Map \\u952e\\u5bf9\\u5e94\\u503c\\u4e3a any \\u5f53\\u63d0\\u4f9b\\u4e00\\u4e2a map \\u7528\\u6765 unmarshal JSON \\u6570\\u636e\\u65f6\\uff0c\\u4e3a\\u4e86\\u907f\\u514d\\u4e0d\\u786e\\u5b9a\\u7684 value \\u7ed3\\u6784\\u6211\\u4eec\\u4f1a\\u4f7f\\u7528 any \\u6765\\u4f5c\\u4e3a value \\u7684\\u7c7b\\u578b\\u800c\\u4e0d\\u662f\\u5b9a\\u4e49\\u4e00\\u4e2a struct\\uff0c\\u8fd9\\u79cd\\u60c5\\u51b5\\u4e0b\\u9700\\u8981\\u8bb0\\u5f97\\u6570\\u503c\\u9ed8\\u8ba4\\u4f1a\\u88ab\\u8f6c\\u6362\\u4e3a float64\\u3002
\"},{\"location\":\"zh/#sql-78\",\"title\":\"\\u5e38\\u89c1\\u7684 SQL \\u9519\\u8bef (#78)\",\"text\":\" \\u5fd8\\u8bb0\\u4e86 sql.Open \\u5e76\\u6ca1\\u6709\\u4e0e db \\u670d\\u52a1\\u5668\\u5efa\\u7acb\\u5b9e\\u9645\\u8fde\\u63a5 \\u9700\\u8981\\u8c03\\u7528 Ping \\u6216\\u8005 PingContext \\u65b9\\u6cd5\\u6765\\u6d4b\\u8bd5\\u914d\\u7f6e\\u5e76\\u786e\\u4fdd\\u6570\\u636e\\u5e93\\u662f\\u53ef\\u8fbe\\u7684\\u3002
\\u5fd8\\u8bb0\\u4e86\\u4f7f\\u7528\\u8fde\\u63a5\\u6c60 \\u4f5c\\u4e3a\\u751f\\u4ea7\\u7ea7\\u522b\\u7684\\u5e94\\u7528\\uff0c\\u8bbf\\u95ee\\u6570\\u636e\\u5e93\\u65f6\\u5e94\\u8be5\\u5173\\u6ce8\\u914d\\u7f6e\\u6570\\u636e\\u5e93\\u8fde\\u63a5\\u6c60\\u53c2\\u6570\\u3002
\\u6ca1\\u6709\\u4f7f\\u7528 prepared \\u8bed\\u53e5 \\u4f7f\\u7528 SQL prepared \\u8bed\\u53e5\\u80fd\\u591f\\u8ba9\\u67e5\\u8be2\\u66f4\\u52a0\\u9ad8\\u6548\\u548c\\u5b89\\u5168\\u3002
\\u8bef\\u5904\\u7406 null \\u503c \\u4f7f\\u7528 sql.NullXXX \\u7c7b\\u578b\\u5904\\u7406\\u8868\\u4e2d\\u7684\\u53ef\\u7a7a\\u5217\\u3002
\\u4e0d\\u5904\\u7406\\u884c\\u8fed\\u4ee3\\u65f6\\u7684\\u9519\\u8bef \\u8c03\\u7528 sql.Rows \\u7684 Err \\u65b9\\u6cd5\\u6765\\u786e\\u4fdd\\u5728\\u51c6\\u5907\\u4e0b\\u4e00\\u4e2a\\u884c\\u65f6\\u6ca1\\u6709\\u9057\\u6f0f\\u9519\\u8bef\\u3002
\"},{\"location\":\"zh/#http-sqlrows-osfile-79\",\"title\":\"\\u4e0d\\u5173\\u95ed\\u4e34\\u65f6\\u8d44\\u6e90\\uff08HTTP \\u8bf7\\u6c42\\u4f53\\u3001sql.Rows \\u548c os.File\\uff09 (#79)\",\"text\":\"\\u6700\\u7ec8\\u8981\\u6ce8\\u610f\\u5173\\u95ed\\u6240\\u6709\\u5b9e\\u73b0 io.Closer \\u63a5\\u53e3\\u7684\\u7ed3\\u6784\\u4f53\\uff0c\\u4ee5\\u907f\\u514d\\u53ef\\u80fd\\u7684\\u6cc4\\u6f0f\\u3002
\"},{\"location\":\"zh/#http-80\",\"title\":\"\\u54cd\\u5e94 HTTP \\u8bf7\\u6c42\\u540e\\u6ca1\\u6709\\u8fd4\\u56de\\u8bed\\u53e5 (#80)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d\\u5728 HTTP \\u5904\\u7406\\u51fd\\u6570\\u4e2d\\u51fa\\u73b0\\u67d0\\u4e9b\\u610f\\u5916\\u7684\\u95ee\\u9898\\uff0c\\u5982\\u679c\\u60f3\\u5728\\u53d1\\u751f http.Error \\u540e\\u8ba9 HTTP \\u5904\\u7406\\u51fd\\u6570\\u505c\\u6b62\\uff0c\\u90a3\\u4e48\\u5c31\\u4e0d\\u8981\\u5fd8\\u8bb0\\u4f7f\\u7528 return \\u8bed\\u53e5\\u6765\\u963b\\u6b62\\u540e\\u7eed\\u4ee3\\u7801\\u7684\\u6267\\u884c\\u3002
\"},{\"location\":\"zh/#http-client-server-81\",\"title\":\"\\u76f4\\u63a5\\u4f7f\\u7528\\u9ed8\\u8ba4\\u7684 HTTP client \\u548c server (#81)\",\"text\":\"\\u5bf9\\u4e8e\\u751f\\u4ea7\\u7ea7\\u522b\\u7684\\u5e94\\u7528\\uff0c\\u4e0d\\u8981\\u4f7f\\u7528\\u9ed8\\u8ba4\\u7684 HTTP client \\u548c server \\u5b9e\\u73b0\\u3002\\u8fd9\\u4e9b\\u5b9e\\u73b0\\u7f3a\\u5c11\\u8d85\\u65f6\\u548c\\u751f\\u4ea7\\u73af\\u5883\\u4e2d\\u5e94\\u8be5\\u5f3a\\u5236\\u4f7f\\u7528\\u7684\\u884c\\u4e3a\\u3002
\"},{\"location\":\"zh/#_10\",\"title\":\"\\u6d4b\\u8bd5\",\"text\":\"\"},{\"location\":\"zh/#build-tags-82\",\"title\":\"\\u4e0d\\u5bf9\\u6d4b\\u8bd5\\u8fdb\\u884c\\u5206\\u7c7b \\uff08build tags, \\u73af\\u5883\\u53d8\\u91cf\\uff0c\\u77ed\\u6a21\\u5f0f\\uff09(#82)\",\"text\":\"\\u5bf9\\u6d4b\\u8bd5\\u8fdb\\u884c\\u5fc5\\u8981\\u7684\\u5206\\u7c7b\\uff0c\\u53ef\\u4ee5\\u501f\\u52a9 build tags\\u3001\\u73af\\u5883\\u53d8\\u91cf\\u4ee5\\u53ca\\u77ed\\u6a21\\u5f0f\\uff0c\\u6765\\u4f7f\\u5f97\\u6d4b\\u8bd5\\u8fc7\\u7a0b\\u66f4\\u52a0\\u9ad8\\u6548\\u3002\\u4f60\\u53ef\\u4ee5\\u4f7f\\u7528 build tags \\u6216\\u73af\\u5883\\u53d8\\u91cf\\u6765\\u521b\\u5efa\\u6d4b\\u8bd5\\u7c7b\\u522b\\uff08\\u4f8b\\u5982\\u5355\\u5143\\u6d4b\\u8bd5\\u4e0e\\u96c6\\u6210\\u6d4b\\u8bd5\\uff09\\uff0c\\u5e76\\u533a\\u5206\\u77ed\\u6d4b\\u8bd5\\u4e0e\\u957f\\u65f6\\u95f4\\u6d4b\\u8bd5\\uff0c\\u6765\\u51b3\\u5b9a\\u6267\\u884c\\u54ea\\u79cd\\u7c7b\\u578b\\u7684\\u3002
ps: \\u4e86\\u89e3\\u4e0b go build tags\\uff0c\\u4ee5\\u53ca go test -short\\u3002
\"},{\"location\":\"zh/#race-83\",\"title\":\"\\u4e0d\\u6253\\u5f00 race \\u5f00\\u5173 (#83)\",\"text\":\"\\u6253\\u5f00 -race \\u5f00\\u5173\\u5728\\u7f16\\u5199\\u5e76\\u53d1\\u5e94\\u7528\\u65f6\\u975e\\u5e38\\u91cd\\u8981\\u3002\\u8fd9\\u80fd\\u5e2e\\u52a9\\u4f60\\u6355\\u83b7\\u53ef\\u80fd\\u7684\\u6570\\u636e\\u7ade\\u4e89\\uff0c\\u4ece\\u800c\\u907f\\u514d\\u8f6f\\u4ef6 bug\\u3002
\"},{\"location\":\"zh/#parallel-shuffle-84\",\"title\":\"\\u4e0d\\u6253\\u5f00\\u6d4b\\u8bd5\\u7684\\u6267\\u884c\\u6a21\\u5f0f\\u5f00\\u5173 (parallel \\u548c shuffle) (#84)\",\"text\":\"\\u6253\\u5f00\\u5f00\\u5173 -parallel \\u6709\\u52a9\\u4e8e\\u52a0\\u901f\\u6d4b\\u8bd5\\u7684\\u6267\\u884c\\uff0c\\u7279\\u522b\\u662f\\u6d4b\\u8bd5\\u4e2d\\u5305\\u542b\\u4e00\\u4e9b\\u9700\\u8981\\u957f\\u671f\\u8fd0\\u884c\\u7684\\u7528\\u4f8b\\u7684\\u65f6\\u5019\\u3002
\\u6253\\u5f00\\u5f00\\u5173 -shuffle \\u80fd\\u591f\\u6253\\u4e71\\u6d4b\\u8bd5\\u7528\\u4f8b\\u6267\\u884c\\u7684\\u987a\\u5e8f\\uff0c\\u907f\\u514d\\u4e00\\u4e2a\\u6d4b\\u8bd5\\u4f9d\\u8d56\\u4e8e\\u67d0\\u4e9b\\u4e0d\\u7b26\\u5408\\u771f\\u5b9e\\u60c5\\u51b5\\u7684\\u9884\\u8bbe\\uff0c\\u6709\\u52a9\\u4e8e\\u53ca\\u65e9\\u66b4\\u9732 bug\\u3002
\"},{\"location\":\"zh/#85\",\"title\":\"\\u4e0d\\u4f7f\\u7528\\u8868\\u9a71\\u52a8\\u7684\\u6d4b\\u8bd5 (#85)\",\"text\":\"\\u8868\\u9a71\\u52a8\\u7684\\u6d4b\\u8bd5\\u662f\\u4e00\\u79cd\\u6709\\u6548\\u7684\\u65b9\\u5f0f\\uff0c\\u53ef\\u4ee5\\u5c06\\u4e00\\u7ec4\\u76f8\\u4f3c\\u7684\\u6d4b\\u8bd5\\u5206\\u7ec4\\u5728\\u4e00\\u8d77\\uff0c\\u4ee5\\u907f\\u514d\\u4ee3\\u7801\\u91cd\\u590d\\u548c\\u4f7f\\u672a\\u6765\\u7684\\u66f4\\u65b0\\u66f4\\u5bb9\\u6613\\u5904\\u7406\\u3002
\"},{\"location\":\"zh/#sleep-86\",\"title\":\"\\u5728\\u5355\\u5143\\u6d4b\\u8bd5\\u4e2d\\u6267\\u884c sleep \\u64cd\\u4f5c (#86)\",\"text\":\"\\u4f7f\\u7528\\u540c\\u6b65\\u7684\\u65b9\\u5f0f\\u3001\\u907f\\u514d sleep\\uff0c\\u6765\\u5c3d\\u91cf\\u51cf\\u5c11\\u6d4b\\u8bd5\\u7684\\u4e0d\\u7a33\\u5b9a\\u6027\\u548c\\u63d0\\u9ad8\\u9c81\\u68d2\\u6027\\u3002\\u5982\\u679c\\u65e0\\u6cd5\\u4f7f\\u7528\\u540c\\u6b65\\u624b\\u6bb5,\\u53ef\\u4ee5\\u8003\\u8651\\u91cd\\u8bd5\\u7684\\u65b9\\u5f0f\\u3002
\"},{\"location\":\"zh/#time-api-87\",\"title\":\"\\u6ca1\\u6709\\u9ad8\\u6548\\u5730\\u5904\\u7406 time API (#87)\",\"text\":\"\\u7406\\u89e3\\u5982\\u4f55\\u5904\\u7406\\u4f7f\\u7528 time API \\u7684\\u51fd\\u6570\\uff0c\\u662f\\u4f7f\\u6d4b\\u8bd5\\u66f4\\u52a0\\u7a33\\u5b9a\\u7684\\u53e6\\u4e00\\u79cd\\u65b9\\u5f0f\\u3002\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528\\u6807\\u51c6\\u6280\\u672f\\uff0c\\u4f8b\\u5982\\u5c06\\u65f6\\u95f4\\u4f5c\\u4e3a\\u9690\\u85cf\\u4f9d\\u8d56\\u9879\\u7684\\u4e00\\u90e8\\u5206\\u6765\\u5904\\u7406\\uff0c\\u6216\\u8005\\u8981\\u6c42\\u5ba2\\u6237\\u7aef\\u63d0\\u4f9b\\u65f6\\u95f4\\u3002
\"},{\"location\":\"zh/#httptest-iotest-88\",\"title\":\"\\u4e0d\\u4f7f\\u7528\\u6d4b\\u8bd5\\u76f8\\u5173\\u7684\\u5de5\\u5177\\u5305 (httptest \\u548c iotest) (#88)\",\"text\":\"\\u8fd9\\u4e2a httptest \\u5305\\u5bf9\\u5904\\u7406 HTTP \\u5e94\\u7528\\u7a0b\\u5e8f\\u5f88\\u6709\\u5e2e\\u52a9\\u3002\\u5b83\\u63d0\\u4f9b\\u4e86\\u4e00\\u7ec4\\u5b9e\\u7528\\u7a0b\\u5e8f\\u6765\\u6d4b\\u8bd5\\u5ba2\\u6237\\u7aef\\u548c\\u670d\\u52a1\\u5668\\u3002
\\u8fd9\\u4e2a iotest \\u5305\\u6709\\u52a9\\u4e8e\\u7f16\\u5199 io.Reader \\u5e76\\u6d4b\\u8bd5\\u5e94\\u7528\\u7a0b\\u5e8f\\u662f\\u5426\\u80fd\\u591f\\u5bb9\\u5fcd\\u9519\\u8bef\\u3002
\"},{\"location\":\"zh/#89\",\"title\":\"\\u4e0d\\u6b63\\u786e\\u7684\\u57fa\\u51c6\\u6d4b\\u8bd5 (#89)\",\"text\":\" \\u4e0d\\u8981\\u91cd\\u7f6e\\u6216\\u8005\\u6682\\u505c timer \\u4f7f\\u7528 time \\u65b9\\u6cd5\\u6765\\u4fdd\\u6301\\u57fa\\u51c6\\u6d4b\\u8bd5\\u7684\\u51c6\\u786e\\u6027\\u3002
\\u505a\\u51fa\\u9519\\u8bef\\u7684\\u5fae\\u57fa\\u51c6\\u6d4b\\u8bd5\\u5047\\u8bbe \\u589e\\u52a0 benchtime \\u6216\\u8005\\u4f7f\\u7528 benchstat \\u7b49\\u5de5\\u5177\\u53ef\\u4ee5\\u6709\\u52a9\\u4e8e\\u5fae\\u57fa\\u51c6\\u6d4b\\u8bd5\\u3002
\\u5c0f\\u5fc3\\u5fae\\u57fa\\u51c6\\u6d4b\\u8bd5\\u7684\\u7ed3\\u679c\\uff0c\\u5982\\u679c\\u6700\\u7ec8\\u8fd0\\u884c\\u5e94\\u7528\\u7a0b\\u5e8f\\u7684\\u7cfb\\u7edf\\u4e0e\\u8fd0\\u884c\\u5fae\\u57fa\\u51c6\\u6d4b\\u8bd5\\u7684\\u7cfb\\u7edf\\u4e0d\\u540c\\u3002
\\u5bf9\\u7f16\\u8bd1\\u671f\\u4f18\\u5316\\u8981\\u8db3\\u591f\\u5c0f\\u5fc3 \\u786e\\u4fdd\\u6d4b\\u8bd5\\u51fd\\u6570\\u662f\\u5426\\u4f1a\\u4ea7\\u751f\\u4e00\\u4e9b\\u526f\\u4f5c\\u7528\\uff0c\\u9632\\u6b62\\u7f16\\u8bd1\\u5668\\u4f18\\u5316\\u6b3a\\u9a97\\u4f60\\u5f97\\u5230\\u7684\\u57fa\\u51c6\\u6d4b\\u8bd5\\u7ed3\\u679c\\u3002
\\u88ab\\u89c2\\u5bdf\\u8005\\u6548\\u5e94\\u6240\\u6b3a\\u9a97 \\u4e3a\\u4e86\\u907f\\u514d\\u88ab\\u89c2\\u5bdf\\u8005\\u6548\\u5e94\\u6b3a\\u9a97\\uff0c\\u5f3a\\u5236\\u91cd\\u65b0\\u521b\\u5efaCPU\\u5bc6\\u96c6\\u578b\\u51fd\\u6570\\u4f7f\\u7528\\u7684\\u6570\\u636e\\u3002
\"},{\"location\":\"zh/#go-test-90\",\"title\":\"\\u6ca1\\u6709\\u53bb\\u63a2\\u7d22 go test \\u6240\\u6709\\u7684\\u7279\\u6027 (#90)\",\"text\":\" \\u4ee3\\u7801\\u8986\\u76d6\\u7387 \\u4f7f\\u7528 -coverprofile \\u53c2\\u6570\\u53ef\\u4ee5\\u5feb\\u901f\\u67e5\\u770b\\u4ee3\\u7801\\u7684\\u6d4b\\u8bd5\\u8986\\u76d6\\u60c5\\u51b5\\uff0c\\u65b9\\u4fbf\\u5feb\\u901f\\u67e5\\u770b\\u54ea\\u4e2a\\u90e8\\u5206\\u9700\\u8981\\u66f4\\u591a\\u7684\\u5173\\u6ce8\\u3002
\\u5728\\u4e0d\\u540c\\u7684\\u5305\\u4e2d\\u6267\\u884c\\u6d4b\\u8bd5 \\u5355\\u5143\\u6d4b\\u8bd5\\u7ec4\\u7ec7\\u5230\\u4e00\\u4e2a\\u72ec\\u7acb\\u7684\\u5305\\u4e2d\\uff0c\\u5bf9\\u4e8e\\u5bf9\\u5916\\u5c42\\u66b4\\u9732\\u7684\\u63a5\\u53e3\\uff0c\\u9700\\u8981\\u5199\\u4e00\\u4e9b\\u6d4b\\u8bd5\\u7528\\u4f8b\\u3002\\u6d4b\\u8bd5\\u5e94\\u8be5\\u5173\\u6ce8\\u516c\\u5f00\\u7684\\u884c\\u4e3a\\uff0c\\u800c\\u975e\\u5185\\u90e8\\u5b9e\\u73b0\\u7ec6\\u8282\\u3002
\\u5904\\u7406\\u9519\\u8bef\\u65f6\\uff0c\\u4f7f\\u7528 *testing.T \\u53d8\\u91cf\\u800c\\u4e0d\\u662f\\u7ecf\\u5178\\u7684 if err != nil \\u53ef\\u4ee5\\u8ba9\\u4ee3\\u7801\\u66f4\\u52a0\\u7b80\\u6d01\\u6613\\u8bfb\\u3002
\\u8bbe\\u7f6e\\u548c\\u9500\\u6bc1 \\u4f60\\u53ef\\u4ee5\\u4f7f\\u7528 setup \\u548c teardown \\u51fd\\u6570\\u6765\\u914d\\u7f6e\\u4e00\\u4e2a\\u590d\\u6742\\u7684\\u73af\\u5883\\uff0c\\u6bd4\\u5982\\u5728\\u96c6\\u6210\\u6d4b\\u8bd5\\u7684\\u60c5\\u51b5\\u4e0b\\u3002
\"},{\"location\":\"zh/#_11\",\"title\":\"\\u4e0d\\u4f7f\\u7528\\u6a21\\u7cca\\u6d4b\\u8bd5 (\\u793e\\u533a\\u53cd\\u9988\\u9519\\u8bef)\",\"text\":\"\\u6a21\\u7cca\\u6d4b\\u8bd5\\u662f\\u4e00\\u79cd\\u9ad8\\u6548\\u7684\\u7b56\\u7565\\uff0c\\u4f7f\\u7528\\u5b83\\u80fd\\u68c0\\u6d4b\\u51fa\\u968f\\u673a\\u3001\\u610f\\u6599\\u5916\\u7684\\u548c\\u4e00\\u4e9b\\u6076\\u610f\\u7684\\u6570\\u636e\\u8f93\\u5165\\uff0c\\u6765\\u5b8c\\u6210\\u4e00\\u4e9b\\u590d\\u6742\\u7684\\u64cd\\u4f5c\\u3002
\\u89c1: @jeromedoucet
\"},{\"location\":\"zh/#_12\",\"title\":\"\\u4f18\\u5316\\u6280\\u672f\",\"text\":\"\"},{\"location\":\"zh/#cpu-cache-91\",\"title\":\"\\u4e0d\\u7406\\u89e3 CPU cache (#91)\",\"text\":\" \\u7406\\u89e3 CPU \\u7f13\\u5b58\\u7684\\u4f7f\\u7528\\u5bf9\\u4e8e\\u4f18\\u5316 CPU \\u5bc6\\u96c6\\u578b\\u5e94\\u7528\\u5f88\\u91cd\\u8981\\uff0c\\u56e0\\u4e3a L1 \\u7f13\\u5b58\\u6bd4\\u4e3b\\u5b58\\u5feb 50 \\u5230 100 \\u500d\\u3002
\\u610f\\u8bc6\\u5230 cache line \\u6982\\u5ff5\\u5bf9\\u4e8e\\u7406\\u89e3\\u5982\\u4f55\\u5728\\u6570\\u636e\\u5bc6\\u96c6\\u578b\\u5e94\\u7528\\u4e2d\\u7ec4\\u7ec7\\u6570\\u636e\\u975e\\u5e38\\u5173\\u952e\\u3002CPU \\u5e76\\u4e0d\\u662f\\u4e00\\u4e2a\\u4e00\\u4e2a\\u5b57\\u6765\\u83b7\\u53d6\\u5185\\u5b58\\u3002\\u76f8\\u53cd\\uff0c\\u5b83\\u901a\\u5e38\\u590d\\u5236\\u4e00\\u4e2a 64 \\u5b57\\u8282\\u957f\\u5ea6\\u7684 cache line\\u3002\\u4e3a\\u4e86\\u83b7\\u5f97\\u6bcf\\u4e2a cache line \\u7684\\u6700\\u5927\\u6548\\u7528\\uff0c\\u9700\\u8981\\u5b9e\\u65bd\\u7a7a\\u95f4\\u5c40\\u90e8\\u6027\\u3002
\\u63d0\\u9ad8 CPU \\u6267\\u884c\\u4ee3\\u7801\\u65f6\\u7684\\u53ef\\u9884\\u6d4b\\u6027\\uff0c\\u4e5f\\u662f\\u4f18\\u5316\\u67d0\\u4e9b\\u51fd\\u6570\\u7684\\u4e00\\u4e2a\\u6709\\u6548\\u65b9\\u6cd5\\u3002\\u6bd4\\u5982\\uff0c\\u56fa\\u5b9a\\u6b65\\u957f\\u6216\\u8fde\\u7eed\\u8bbf\\u95ee\\u5bf9 CPU \\u6765\\u8bf4\\u662f\\u53ef\\u9884\\u6d4b\\u7684\\uff0c\\u4f46\\u975e\\u8fde\\u7eed\\u8bbf\\u95ee\\uff08\\u4f8b\\u5982\\u94fe\\u8868\\uff09\\u5c31\\u662f\\u4e0d\\u53ef\\u9884\\u6d4b\\u7684\\u3002
cache \\u653e\\u7f6e\\u7b56\\u7565 \\u8981\\u6ce8\\u610f\\u73b0\\u4ee3\\u7f13\\u5b58\\u662f\\u5206\\u533a\\u7684\\uff08set associative placement\\uff0c\\u7ec4\\u76f8\\u8fde\\u6620\\u5c04\\uff09\\uff0c\\u8981\\u6ce8\\u610f\\u907f\\u514d\\u4f7f\\u7528 critical stride\\uff0c\\u8fd9\\u79cd\\u6b65\\u957f\\u60c5\\u51b5\\u4e0b\\u53ea\\u80fd\\u5229\\u7528 cache \\u7684\\u4e00\\u5c0f\\u90e8\\u5206\\u3002
critical stride\\uff0c\\u8fd9\\u79cd\\u7c7b\\u578b\\u7684\\u6b65\\u957f\\uff0c\\u6307\\u7684\\u662f\\u5185\\u5b58\\u8bbf\\u95ee\\u7684\\u6b65\\u957f\\u521a\\u597d\\u7b49\\u4e8e cache \\u5927\\u5c0f\\u3002\\u8fd9\\u79cd\\u60c5\\u51b5\\u4e0b\\uff0c\\u53ea\\u6709\\u5c11\\u90e8\\u5206 cacheline \\u88ab\\u5229\\u7528\\u3002
\"},{\"location\":\"zh/#false-sharing-92\",\"title\":\"\\u5199\\u7684\\u5e76\\u53d1\\u5904\\u7406\\u903b\\u8f91\\u4f1a\\u5bfc\\u81f4 false sharing (#92)\",\"text\":\"\\u4e86\\u89e3 CPU \\u7f13\\u5b58\\u7684\\u8f83\\u4f4e\\u5c42\\u7684 L1\\u3001L2 cache \\u4e0d\\u4f1a\\u5728\\u6240\\u6709\\u6838\\u95f4\\u5171\\u4eab\\uff0c\\u7f16\\u5199\\u5e76\\u53d1\\u5904\\u7406\\u903b\\u8f91\\u65f6\\u80fd\\u907f\\u514d\\u5199\\u51fa\\u4e00\\u4e9b\\u964d\\u4f4e\\u6027\\u80fd\\u7684\\u95ee\\u9898\\uff0c\\u6bd4\\u5982\\u4f2a\\u5171\\u4eab\\uff08false sharing\\uff09\\u3002\\u5185\\u5b58\\u5171\\u4eab\\u53ea\\u662f\\u4e00\\u79cd\\u5047\\u8c61\\u3002
\"},{\"location\":\"zh/#93\",\"title\":\"\\u6ca1\\u6709\\u8003\\u8651\\u6307\\u4ee4\\u7ea7\\u7684\\u5e76\\u884c (#93)\",\"text\":\"\\u4f7f\\u7528\\u6307\\u4ee4\\u7ea7\\u5e76\\u884c\\uff08ILP\\uff09\\u4f18\\u5316\\u4ee3\\u7801\\u7684\\u7279\\u5b9a\\u90e8\\u5206\\uff0c\\u4ee5\\u5141\\u8bb8 CPU \\u5c3d\\u53ef\\u80fd\\u6267\\u884c\\u66f4\\u591a\\u53ef\\u4ee5\\u5e76\\u884c\\u6267\\u884c\\u7684\\u6307\\u4ee4\\u3002\\u8bc6\\u522b\\u6307\\u4ee4\\u7684\\u6570\\u636e\\u4f9d\\u8d56\\u95ee\\u9898\\uff08data hazards\\uff09\\u662f\\u4e3b\\u8981\\u6b65\\u9aa4\\u4e4b\\u4e00\\u3002
\"},{\"location\":\"zh/#94\",\"title\":\"\\u4e0d\\u4e86\\u89e3\\u6570\\u636e\\u5bf9\\u9f50 (#94)\",\"text\":\"\\u8bb0\\u4f4f Go \\u4e2d\\u57fa\\u672c\\u7c7b\\u578b\\u4e0e\\u5176\\u81ea\\u8eab\\u5927\\u5c0f\\u5bf9\\u9f50\\uff0c\\u4f8b\\u5982\\uff0c\\u6309\\u5927\\u5c0f\\u964d\\u5e8f\\u91cd\\u65b0\\u7ec4\\u7ec7\\u7ed3\\u6784\\u4f53\\u7684\\u5b57\\u6bb5\\u53ef\\u4ee5\\u5f62\\u6210\\u66f4\\u7d27\\u51d1\\u7684\\u7ed3\\u6784\\u4f53\\uff08\\u51cf\\u5c11\\u5185\\u5b58\\u5206\\u914d\\uff0c\\u66f4\\u597d\\u7684\\u7a7a\\u95f4\\u5c40\\u90e8\\u6027\\uff09\\uff0c\\u8fd9\\u6709\\u52a9\\u4e8e\\u907f\\u514d\\u4e00\\u4e9b\\u5e38\\u89c1\\u7684\\u9519\\u8bef\\u3002
\"},{\"location\":\"zh/#stack-vs-heap-95\",\"title\":\"\\u4e0d\\u4e86\\u89e3 stack vs. heap (#95)\",\"text\":\"\\u4e86\\u89e3\\u5806\\u548c\\u6808\\u4e4b\\u95f4\\u7684\\u533a\\u522b\\u662f\\u5f00\\u53d1\\u4eba\\u5458\\u7684\\u6838\\u5fc3\\u77e5\\u8bc6\\u70b9\\uff0c\\u7279\\u522b\\u662f\\u8981\\u53bb\\u4f18\\u5316\\u4e00\\u4e2a Go \\u7a0b\\u5e8f\\u65f6\\u3002\\u6808\\u5206\\u914d\\u7684\\u5f00\\u9500\\u51e0\\u4e4e\\u4e3a\\u96f6\\uff0c\\u800c\\u5806\\u5206\\u914d\\u5219\\u8f83\\u6162\\uff0c\\u5e76\\u4e14\\u4f9d\\u8d56 GC \\u6765\\u6e05\\u7406\\u5185\\u5b58\\u3002
\"},{\"location\":\"zh/#api-syncpool-96\",\"title\":\"\\u4e0d\\u77e5\\u9053\\u5982\\u4f55\\u51cf\\u5c11\\u5185\\u5b58\\u5206\\u914d\\u6b21\\u6570\\uff08API \\u8c03\\u6574\\uff0c\\u7f16\\u8bd1\\u5668\\u4f18\\u5316\\u548c sync.Pool\\uff09 (#96)\",\"text\":\"\\u51cf\\u5c11\\u5185\\u5b58\\u5206\\u914d\\u6b21\\u6570\\u4e5f\\u662f\\u4f18\\u5316 Go \\u5e94\\u7528\\u7684\\u4e00\\u4e2a\\u91cd\\u8981\\u65b9\\u9762\\u3002\\u8fd9\\u53ef\\u4ee5\\u901a\\u8fc7\\u4e0d\\u540c\\u7684\\u65b9\\u5f0f\\u6765\\u5b9e\\u73b0\\uff0c\\u6bd4\\u5982\\u4ed4\\u7ec6\\u8bbe\\u8ba1 API \\u6765\\u907f\\u514d\\u4e0d\\u5fc5\\u8981\\u7684\\u62f7\\u8d1d\\uff0c\\u4ee5\\u53ca\\u4f7f\\u7528 sync.Pool \\u6765\\u5bf9\\u5206\\u914d\\u5bf9\\u8c61\\u8fdb\\u884c\\u6c60\\u5316\\u3002
\"},{\"location\":\"zh/#97\",\"title\":\"\\u4e0d\\u6ce8\\u610f\\u4f7f\\u7528\\u5185\\u8054 (#97)\",\"text\":\"\\u4f7f\\u7528\\u5feb\\u901f\\u8def\\u5f84\\u7684\\u5185\\u8054\\u6280\\u672f\\u6765\\u66f4\\u52a0\\u6709\\u6548\\u5730\\u51cf\\u5c11\\u8c03\\u7528\\u51fd\\u6570\\u7684\\u644a\\u9500\\u65f6\\u95f4\\u3002
\"},{\"location\":\"zh/#go-98\",\"title\":\"\\u4e0d\\u4f7f\\u7528 Go \\u95ee\\u9898\\u8bca\\u65ad\\u5de5\\u5177 (#98)\",\"text\":\"\\u4e86\\u89e3 Go profiling \\u5de5\\u5177\\u3001\\u6267\\u884c\\u65f6 tracer \\u6765\\u8f85\\u52a9\\u5224\\u65ad\\u4e00\\u4e2a\\u5e94\\u7528\\u7a0b\\u5e8f\\u662f\\u5426\\u6b63\\u5e38\\uff0c\\u4ee5\\u53ca\\u5217\\u51fa\\u9700\\u8981\\u4f18\\u5316\\u7684\\u90e8\\u5206\\u3002
\"},{\"location\":\"zh/#gc-99\",\"title\":\"\\u4e0d\\u7406\\u89e3 GC \\u662f\\u5982\\u4f55\\u5de5\\u4f5c\\u7684 (#99)\",\"text\":\"\\u7406\\u89e3\\u5982\\u4f55\\u8c03\\u4f18 GC \\u80fd\\u591f\\u5e26\\u6765\\u5f88\\u591a\\u6536\\u76ca\\uff0c\\u4f8b\\u5982\\u6709\\u52a9\\u4e8e\\u66f4\\u9ad8\\u6548\\u5730\\u5904\\u7406\\u7a81\\u589e\\u7684\\u8d1f\\u8f7d\\u3002
\"},{\"location\":\"zh/#docker-k8s-go-100\",\"title\":\"\\u4e0d\\u4e86\\u89e3 Docker \\u6216\\u8005 K8S \\u5bf9\\u8fd0\\u884c\\u7684 Go \\u5e94\\u7528\\u7684\\u6027\\u80fd\\u5f71\\u54cd (#100)\",\"text\":\"\\u4e3a\\u4e86\\u907f\\u514d CPU throttling\\uff08CPU \\u9650\\u9891\\uff09\\u95ee\\u9898\\uff0c\\u5f53\\u6211\\u4eec\\u5728 Docker \\u548c Kubernetes \\u90e8\\u7f72\\u5e94\\u7528\\u65f6\\uff0c\\u8981\\u77e5\\u9053 Go \\u8bed\\u8a00\\u5bf9 CFS\\uff08\\u5b8c\\u5168\\u516c\\u5e73\\u8c03\\u5ea6\\u5668\\uff09\\u65e0\\u611f\\u77e5\\u3002
\"}]}"
},
{
"path": "site/sitemap.xml",
"content": "\n\n \n https://100go.co/ \n 2025-09-24 \n \n \n https://100go.co/20-slice/ \n 2025-09-24 \n \n \n https://100go.co/28-maps-memory-leaks/ \n 2025-09-24 \n \n \n https://100go.co/5-interface-pollution/ \n 2025-09-24 \n \n \n https://100go.co/56-concurrency-faster/ \n 2025-09-24 \n \n \n https://100go.co/89-benchmarks/ \n 2025-09-24 \n \n \n https://100go.co/9-generics/ \n 2025-09-24 \n \n \n https://100go.co/92-false-sharing/ \n 2025-09-24 \n \n \n https://100go.co/98-profiling-execution-tracing/ \n 2025-09-24 \n \n \n https://100go.co/book/ \n 2025-09-24 \n \n \n https://100go.co/chapter-1/ \n 2025-09-24 \n \n \n https://100go.co/external/ \n 2025-09-24 \n \n \n https://100go.co/ja/ \n 2025-09-24 \n \n \n https://100go.co/pt-br/ \n 2025-09-24 \n \n \n https://100go.co/zh/ \n 2025-09-24 \n \n "
},
{
"path": "site/stylesheets/extra.css",
"content": ".md-typeset figure img {\n display: inline;\n}\n\n.md-typeset .admonition,\n.md-typeset details {\n font-size: 15px\n}\n"
},
{
"path": "site/zh/index.html",
"content": "\n \n Chinese (Simplified) Version - 100 Go Mistakes and How to Avoid Them \n \n \n \n \n \n
\n \n \n \n\n \n\n\n \n \n \n \n \n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n
\n
\n \n \n\n\n \n \n\n\n100 个 Go 常č§é误ĺĺŚä˝éżĺ
\n\nThe Coder Cafe \nĺŚćć¨ĺ揢ćç䚌ďźć¨ĺŻč˝äźĺŻšćçćć°éĄšçŽćĺ
´čśŁďźThe Coder Cafe ďźčżćŻä¸ä¸Şä¸şç¨ĺşĺćäžçćŻćĽçŽćĽă
\n\nFeeling overwhelmed by the endless stream of tech content? At The Coder Cafe, we serve one essential concept for coders. Written by a senior software engineer at Google, it's perfectly brewed for your morning coffee, helping you grow your skills deeply.
\n \n
\n \n
\n䝣ç ĺ塼ç¨çťçť \nćĺ¤çĺééč (#1) \néżĺ
ĺééčďźĺ¤é¨ä˝ç¨ĺĺé袍ĺ
é¨ä˝ç¨ĺĺĺĺééčďźďźćĺŠäşéżĺ
ĺéĺźç¨é误ďźćĺŠäşäťäşşé
话ç解ă
\nä¸ĺż
čŚç䝣ç ĺľĺĽ (#2) \néżĺ
ä¸ĺż
čŚçăčżĺ¤çĺľĺĽĺąćŹĄďźĺšśä¸čŽŠćŁĺ¸¸äťŁç 衯ĺžĺ°˝é塌寚é˝ďźčä¸ćŻćžĺ¨ĺćŻčˇŻĺžä¸ďźďźćĺŠäşćĺťşĺŻčŻťć§ć´ĺĽ˝ç䝣ç ă
\nčŻŻç¨ init ĺ˝ć° (#3) \nĺĺ§ĺĺéćśďźčŻˇčŽ°ä˝ init ĺ˝ć°ĺ
ˇććéçé误ĺ¤çč˝ĺďźĺšśä¸äźä˝żçśćĺ¤çĺćľčŻĺĺžć´ĺ ĺ¤ćăĺ¨ĺ¤§ĺ¤ć°ć
ĺľä¸ďźĺĺ§ĺĺşčŻĽä˝ä¸şçšĺŽĺ˝ć°ćĽĺ¤çă
\n\nĺ¨ Go čŻč¨ä¸ďźĺźşĺśä˝żç¨ getter ĺ setter ćšćłĺšśä¸çŹŚĺ Go ćŻäžăĺ¨ĺŽčˇľä¸ďźĺşčŻĽćžĺ°ćçĺç˛çŽéľĺžŞćäşćŻç¨ćłäšé´ç嚳襥çšă
\nćĽĺŁćąĄć (#5) \nć˝čąĄĺşčŻĽč˘Ťĺç°ďźčä¸ćŻč˘Ťĺé ă为äşéżĺ
ä¸ĺż
čŚçĺ¤ćć§ďźéčŚćśćĺĺťşćĽĺŁďźčä¸ćŻé˘č§ĺ°éčŚĺŽďźćč
čłĺ°ĺŻäťĽčŻćčżç§ć˝čąĄćŻć䝡ĺźçă
\nĺ°ćĽĺŁĺŽäšĺ¨ĺŽç°ćšä¸äž§ (#6) \nĺ°ćĽĺŁäżçĺ¨ĺźç¨ćšä¸äž§ďźčä¸ćŻĺŽç°ćšä¸äž§ďźĺŻäťĽéżĺ
ä¸ĺż
čŚçć˝čąĄă
\nĺ°ćĽĺŁä˝ä¸şčżĺĺź (#7) \n为äşéżĺ
ĺ¨çľć´ťć§ćšé˘ĺĺ°éĺśďźĺ¤§ĺ¤ć°ć
ĺľä¸ĺ˝ć°ä¸ĺşčŻĽčżĺćĽĺŁďźčĺşčŻĽčżĺĺ
ˇä˝çĺŽç°ăç¸ĺďźĺ˝ć°ĺşčŻĽĺ°˝ĺŻč˝ĺ°ä˝żç¨ćĽĺŁä˝ä¸şĺć°ă
\nany ć˛Ąäź éäťťä˝äżĄćŻ (#8)ĺŞćĺ¨éčŚćĽĺćčżĺäťťćçąťĺćśďźćä˝żç¨ anyďźäžĺŚ json.Marshalăĺ
śäťć
ĺľä¸ďźĺ 为 any ä¸ćäžććäšç俥ćŻďźĺŻč˝äźĺŻźč´çźčŻćśéŽé˘ďźĺŚĺ
莸č°ç¨č
č°ç¨ćšćłĺ¤çäťťćçąťĺć°ćŽă
\n\n使ç¨ćłĺďźĺŻäťĽéčżçąťĺĺć°ĺ猝ĺ
ˇä˝çć°ćŽçąťĺĺčĄä¸şďźéżĺ
ĺĺžĺ¤éĺ¤ĺşŚĺžéŤç䝣ç ăçśčďźä¸čŚčżćŠĺ°ä˝żç¨ćłĺăçąťĺĺć°ďźĺŞćĺ¨ä˝ çĺ°çćŁéčŚćść使ç¨ăĺŚĺďźĺŽäťŹäźĺźĺ
Ľä¸ĺż
čŚçć˝čąĄĺĺ¤ćć§ă
\nćŞćčŻĺ°çąťĺĺľĺĽçĺŻč˝éŽé˘ (#10) \n使ç¨çąťĺĺľĺĽäšĺŻäťĽéżĺ
ĺä¸äşéĺ¤äťŁç ďźçśčďźĺ¨ä˝żç¨ćśéčŚçĄŽäżä¸äźĺŻźč´ä¸ĺççĺŻč§ć§éŽé˘ďźćŻĺŚćäşĺ掾ĺşčŻĽĺŻšĺ¤éčä¸ĺşčŻĽč˘Ťć´é˛ă
\nä¸ä˝żç¨ function option ć¨Ąĺź (#11) \n为äşčŽžčŽĄĺšśćäžć´ĺ弽ç APIďźĺŻéĺć°ďźďźä¸şäşć´ĺĽ˝ĺ°ĺ¤çé饚ďźĺşčŻĽä˝żç¨ function option 樥ĺźă
\n塼ç¨çťçťä¸ĺç (塼ç¨çťćĺĺ
ççťçť) (#12) \néľĺžŞĺ project-layout ç坺莎ćĽçťçť Go 塼ç¨ćŻä¸ä¸Şä¸éçćšćłďźĺ°¤ĺ
śćŻä˝ ćŁĺ¨ĺŻťćžä¸äşçąťäźźççťéŞăćŻäžćĽçťçťä¸ä¸Şć°ç Go 塼ç¨çćśĺă
\nĺ坺塼ĺ
ˇĺ
(#13) \nĺ˝ĺćŻč˝ŻäťśčŽžčŽĄĺźĺä¸é常éčŚçä¸ä¸Şé¨ĺďźĺĺťşä¸äşĺĺŚ commonăutilăshared äšçąťçĺ
ĺĺšśä¸äźçťčŻťč
希ćĽĺ¤Şĺ¤§äťˇĺźďźĺşčŻĽĺ°čżäşĺ
ĺéć为ć´ć¸
ć°ăć´ĺ
ˇä˝çĺ
ĺă
\nĺż˝çĽäşĺ
ĺĺ˛çŞ (#14) \n为äşéżĺ
ĺéĺĺĺ
ĺäšé´çĺ˛çŞďźĺŻźč´ćˇˇćˇćçčłé误ďźĺşä¸şćŻä¸Şĺéĺĺ
使ç¨ĺŻä¸çĺ称ăĺŚćčżä¸ĺŻčĄďźĺŻäťĽčč使ç¨ĺŻźĺ
ĽĺŤĺ import importAlias 'importPath' 䝼ĺşĺĺ
ĺĺĺéĺďźćč
ččä¸ä¸Şć´ĺĽ˝çĺéĺă
\n䝣ç çźşĺ°ć楣 (#15) \n为äşčŽŠä˝żç¨ćšăçť´ć¤äşşĺč˝ć´ć¸
ć°ĺ°äşč§Łä˝ ç䝣ç çćĺžďźĺŻźĺşçĺ
ç´ ďźĺ˝ć°ăçąťĺăĺ掾ďźéčŚćˇťĺ 注éă
\nä¸ä˝żç¨ linters ćŁćĽ (#16) \n为äşćšĺ䝣ç č´¨éăć´ä˝äťŁç çä¸č´ć§ďźĺşčŻĽä˝żç¨ linters ĺ formattersă
\nć°ćŽçąťĺ \nĺ
Ťčżĺśĺé˘éĺźĺçĺ°ć (#17) \nĺ¨é
话ç°ć䝣ç ćśďźčŻˇčŽ°ä˝äťĽ 0 ĺźĺ¤´çć´ć°ĺé˘éćŻĺ
Ťčżĺść°ăć¤ĺ¤ďźä¸şäşćéŤĺŻčŻťć§ďźĺŻäťĽéčżĺ¨ĺé˘ĺ ä¸ 0o ćĽćžĺźĺ°čĄ¨ç¤şĺ
Ťčżĺść´ć°ă
\nćŞćł¨ćĺŻč˝çć´ć°ćş˘ĺş (#18) \nĺ¨ Go ä¸ć´ć°ä¸ćş˘ĺşĺä¸ćş˘ćŻééťĺ¤ççďźćäťĽä˝ ĺŻäťĽĺŽç°čŞĺˇąçĺ˝ć°ćĽćčˇĺŽäťŹă
\n沥ćé彝ç解澎çšć° (#19) \nćŻčžćľŽçšć°ćśďźéčżćŻčžäşč
ç delta ĺźćŻĺŚäťäşä¸ĺŽçčĺ´ĺ
ďźč˝čŽŠä˝ ĺĺşĺŻç§ťć¤ć§ć´ĺĽ˝ç䝣ç ă
\nĺ¨čżčĄĺ ćłćĺćłćśďźĺ°ĺ
ˇćç¸äźźć°é级çćä˝ĺćĺä¸çťäťĽćéŤç˛žĺşŚ (čżćŠćć°ĺŻšé˝ä¸˘ĺ¤ąç˛žĺşŚ)ăć¤ĺ¤ďźĺ¨čżčĄĺ ćłĺĺćłäšĺďźĺşĺ
čżčĄäšćłĺé¤ćł (ĺ ĺćłčŻŻĺˇŽäźč˘Ťäšé¤ćžĺ¤§)ă
\n\nç解 slice çéżĺşŚĺ厚éçĺşĺŤďźćŻä¸ä¸Ş Go ĺźĺč
çć ¸ĺżçĽčŻçšäšä¸ăslice çéżĺşŚćçćŻ slice 塲çťĺĺ¨çĺ
ç´ çć°éďźč厚éćçćŻ slice ĺ˝ĺĺşĺąĺźčžçć°çťćĺ¤č˝ĺŽšçşłçĺ
ç´ çć°éă
\nä¸éŤćç slice ĺĺ§ĺ (#21) \nĺ˝ĺĺťşä¸ä¸Ş slice ćśďźĺŚćĺ
śéżĺşŚĺŻäťĽé˘ĺ
祎ĺŽďźéŁäšĺŻäťĽĺ¨ĺŽäšćśćĺŽĺŽçéżĺşŚĺ厚éăčżĺŻäťĽćšĺĺć append ćśä¸ćŹĄćč
ĺ¤ćŹĄçĺ
ĺĺé
ćä˝ďźäťčćšĺć§č˝ăĺŻšäş map çĺĺ§ĺäšćŻĺŚć¤ă
\nĺ°ćäş nil ĺ犺 slice (#22) \n为äşéżĺ
常č§ç寚 nil ĺ empty slice ĺ¤çčĄä¸şç桡ćˇďźäžĺŚĺ¨ä˝żç¨ encoding/json ć reflect ĺ
ćśďźä˝ éčŚç解 nil ĺ empty slice çĺşĺŤă两č
é˝ćŻéżĺşŚä¸şéśă厚é为éśçĺçďźä˝ćŻ nil ĺçä¸éčŚĺé
ĺ
ĺă
\n沥ćéĺ˝ćŁćĽ slice ćŻĺŚä¸şçŠş (#23) \nćŁćĽä¸ä¸Ş slice ćŻĺŚĺ
ĺŤäťťä˝ĺ
ç´ ďźĺŻäťĽćŁćĽĺ
śéżĺşŚďźä¸çŽĄ slice ćŻ nil čżćŻ emptyďźćŁćĽéżĺşŚé˝ćŻććçăčżä¸ŞćŁćĽćšćłäšéç¨äş mapă
\n为äşčŽžčŽĄć´ć祎ç APIďźAPI ä¸ĺşĺşĺ nil ĺ犺ĺçă
\n沥ććŁçĄŽćˇč´ slice (#24) \nä˝żç¨ copy ćˇč´ä¸ä¸Ş slice ĺ
ç´ ĺ°ĺŚä¸ä¸Ş slice ćśďźéčŚčŽ°ĺžďźĺŽé
ćˇč´çĺ
ç´ ć°éćŻäşč
slice éżĺşŚä¸çčžĺ°ĺźă
\nslice append 希ćĽçé˘ćäšĺ¤çĺŻä˝ç¨ (#25) \nĺŚć两个ä¸ĺçĺ˝ć°ćä˝ç slice ĺ¤ç¨äşç¸ĺçĺşĺąć°çťďźĺŽäťŹĺŻš slice ć§čĄ append ćä˝ćśĺŻč˝äźäş§çĺ˛çŞăä˝żç¨ copy ćĽĺŽć´ĺ¤ĺśä¸ä¸Ş slice ćč
使ç¨ĺŽć´ç slice čĄ¨čžžĺź [low:high:max] éĺść大厚éďźćĺŠäşéżĺ
产çĺ˛çŞăĺ˝ćłĺŻšä¸ä¸Şĺ¤§ slice čżčĄ shrink ćä˝ćśďźä¸¤ç§ćšĺźä¸ďźĺŞć copy ćĺŻäťĽéżĺ
ĺ
ĺćłćźă
\nslice ĺĺ
ĺćłćź (#26) \nĺŻšäş slice ĺ
ç´ ä¸şćéďźćč
slice ĺ
ç´ ä¸ş struct ä˝ćŻčŻĽ struct ĺŤććéĺ掾ďźĺ˝éčż slice[low:high] ćä˝ĺ subslice ćśďźĺŻšäşéŁäşä¸ĺŻčŽżéŽçĺ
ç´ ĺŻäťĽćžĺźčŽžç˝Žä¸ş nil ćĽéżĺ
ĺ
ĺćłé˛ă
\nä¸éŤćç map ĺĺ§ĺ (#27) \nč§ #21 .
\n\nä¸ä¸Ş map ç buckets ĺ ç¨çĺ
ĺĺŞäźĺ˘éżďźä¸äźçźŠĺăĺ ć¤ďźĺŚćĺŽĺŻźč´äşä¸äşĺ
ĺĺ ç¨çéŽé˘ďźä˝ éčŚĺ°čŻä¸ĺçćšĺźćĽč§ŁĺłďźćŻĺŚéć°ĺĺťşä¸ä¸Ş map 䝣ćżĺćĽçďźĺćĽç map äźč˘Ť GC ćďźďźćč
map[keyType]valueType ä¸ç valueType 使ç¨ćé䝣ćżéżĺşŚĺşĺŽçć°çťćč
sliceHeader ćĽçźč§Łčżĺ¤çĺ
ĺĺ ç¨ă
\nä¸ćŁçĄŽçĺźćŻčž (#29) \nGo ä¸ćŻčžä¸¤ä¸ŞçąťĺĺźćśďźĺŚććŻĺŻćŻčžçąťĺďźéŁäšĺŻäťĽä˝żç¨ == ćč
!= čżçŽçŹŚčżčĄćŻčžďźćŻĺŚďźbooleansănumeralsăstringsăpointersăchannelsďźäťĽĺĺ掾ĺ
¨é¨ćŻĺŻćŻčžçąťĺç structsăĺ
śäťć
ĺľä¸ďźä˝ ĺŻäťĽä˝żç¨ reflect.DeepEqual ćĽćŻčžďźç¨ĺĺ°çčŻäźçşç˛ä¸çšć§č˝ďźäšĺŻäťĽä˝żç¨čŞĺŽäšçĺŽç°ĺĺ
śäťĺşćĽĺŽćă
\nć§ĺśçťć \nĺż˝çĽäş range 垪çŻĺéćŻä¸ä¸Şćˇč´ (#30) \nrange 垪çŻä¸ç垪çŻĺéćŻéĺ厚ĺ¨ä¸ĺ
ç´ ĺźçä¸ä¸Şćˇč´ăĺ ć¤ďźĺŚćĺ
ç´ ĺźćŻä¸ä¸Ş struct ĺšśä¸ćłĺ¨ range ä¸äżŽćšĺŽďźĺŻäťĽéčżç´˘ĺźĺźćĽčŽżéŽĺšśäżŽćšĺŽďźćč
使ç¨çťĺ
¸ç for 垪çŻ+ç´˘ĺźĺźçĺćłďźé¤ééĺçĺ
ç´ ćŻä¸ä¸Şćéďźă
\nĺż˝çĽäş range 垪çŻä¸čżäťŁçŽć ĺźç莥çŽćšĺź (channels ĺ arrays) (#31) \näź éçť range ćä˝çčżäťŁçŽć 寚ĺşç襨螞ĺźçĺźďźĺŞäźĺ¨ĺžŞçŻć§čĄĺ袍莥çŽä¸ćŹĄďźç解čżä¸ŞćĺŠäşéżĺ
çŻä¸äşĺ¸¸č§çé误ďźäžĺŚä¸éŤćç channel čľĺźćä˝ĺ slice čżäťŁćä˝ă
\nĺż˝çĽäş range 垪çŻä¸ćéĺ
ç´ ç役ĺ (#32) \nčżéĺ
śĺŽĺźşč°çćŻ range čżäťŁčżç¨ä¸ďźčżäťŁĺéĺŽé
ä¸ćŻä¸ä¸Şćˇč´ăĺ莞çťĺŚĺ¤ä¸ä¸ŞĺŽšĺ¨ĺ
ç´ ďźćéçąťĺďźčľĺźďźä¸éčŚĺŻščżäťŁĺéĺĺ°ĺ轏ć˘ććéĺčľĺźçčŻďźčżéć˝čçä¸ä¸Şé误ďźĺ°ąćŻ for 垪çŻčżäťŁĺéćŻ per-variable-per-loop čä¸ćŻ per-variable-per-iterationăĺŚććŻéčżĺąé¨ĺéďźç¨čżäťŁĺéćĽĺĺ§ĺďźćč
使ç¨ç´˘ĺźĺźćĽç´ćĽĺźç¨čżäťŁçĺ
ç´ ďźĺ°ćĺŠäşéżĺ
ćˇč´ćé(čżäťŁĺéçĺ°ĺ)äšçąťç bugă
\nmap čżäťŁčżç¨ä¸çé误ĺ莞ďźéĺ饺ĺşĺčżäťŁčżç¨ä¸ćĺ
Ľďź(#33) \nä˝żç¨ map ćśďźä¸şäşč˝ĺžĺ°çĄŽĺŽä¸č´ççťćďźĺşčŻĽčŽ°ä˝ Go ä¸ç map ć°ćŽçťćďź\n* ä¸äźćç
§ key 寚 data čżčĄćĺşďźéĺćś key ä¸ćŻćĺşçďź\n* éĺćśç饺ĺşďźäšä¸ćŻćç
§ćĺ
Ľćśç饺ĺşďź\n* 沥ćä¸ä¸ŞçĄŽĺŽć§çéĺ饺ĺşďźćŻćŹĄéĺ饺ĺşćŻä¸ĺçďź\n* ä¸č˝äżčŻčżäťŁčżç¨ä¸ć°ćĺ
Ľçĺ
ç´ ďźĺ¨ĺ˝ĺčżäťŁä¸č˝ĺ¤č˘Ťéĺĺ°ďź
\nĺż˝çĽäş break čŻĺĽćŻĺŚä˝ĺˇĽä˝ç (#34) \né
ĺ label ä˝żç¨ break ĺ continueďźč˝ĺ¤čˇłčżä¸ä¸ŞçšĺŽçčŻĺĽďźĺ¨ćäşĺžŞçŻä¸ĺĺ¨ switch ĺ select čŻĺĽçĺşćŻä¸ĺ°ąćŻčžć帎ĺŠă
\nĺ¨ĺžŞçŻä¸ä˝żç¨ defer (#35) \nĺ¨ĺžŞçŻä¸ä˝żç¨ defer ä¸č˝ĺ¨ćŻč˝ŽčżäťŁçťććść§čĄ defer čŻĺĽďźä˝ćŻĺ°ĺžŞçŻéťčžćĺĺ°ĺ˝ć°ĺ
é¨äźĺ¨ćŻćŹĄčżäťŁçťććść§čĄ defer čŻĺĽă
\nĺ珌串 \n沥ćç解 rune (#36) \nç解 rune çąťĺ寚ĺşçćŻä¸ä¸Ş unicode ç çšďźćŻä¸ä¸Ş unicode ç çšĺ
śĺŽćŻä¸ä¸Şĺ¤ĺčçĺşĺďźä¸ćŻä¸ä¸Ş byteăčżĺşčŻĽćŻ Go ĺźĺč
çć ¸ĺżçĽčŻçšäšä¸ďźç解äşčżä¸ŞćĺŠäşć´ĺ祎ĺ°ĺ¤çĺ珌串ă
\nä¸ćŁçĄŽçĺ珌串éĺ (#37) \nä˝żç¨ range ćä˝çŹŚĺŻšä¸ä¸Ş string čżčĄéĺĺŽé
ä¸ćŻĺŻš string 寚ĺşç []rune čżčĄéĺďźčżäťŁĺéä¸çç´˘ĺźĺźďźčĄ¨ç¤şçĺ˝ĺ rune 寚ĺşç []rune ĺ¨ć´ä¸Ş []rune(string) ä¸ç辡ĺ§ç´˘ĺźăĺŚćčŚčŽżéŽ string ä¸çćä¸ä¸Ş runeďźćŻĺŚçŹŹä¸ä¸ŞďźďźéŚĺ
čŚĺ°ĺ珌串轏ć˘ä¸ş []rune çśĺĺćç´˘ĺźĺźčŽżéŽă
\nčŻŻç¨ trim ĺ˝ć° (#38) \nstrings.TrimRight/strings.TrimLeft 秝é¤ĺ¨ĺ珌串尞é¨ćč
ĺźĺ¤´ĺşç°çä¸äş runesďźĺ˝ć°äźćĺŽä¸ä¸Ş rune éĺďźĺşç°ĺ¨éĺä¸ç rune ĺ°č˘Ťäťĺ珌串秝é¤ăč strings.TrimSuffix/strings.TrimPrefix ćŻç§ťé¤ĺ珌串çä¸ä¸Şĺçź/ĺçźă
\nä¸çťäźĺçĺ珌串ćźćĽćä˝ (#39) \n寚ä¸ä¸Şĺ珌串ĺ襨čżčĄéĺćźćĽćä˝ďźĺşčŻĽéčż strings.Builder ćĽĺŽćďźäťĽéżĺ
ćŻćŹĄčżäťŁćźćĽćśé˝ĺé
ä¸ä¸Şć°ç string 寚蹥ĺşćĽă
\nć ç¨çĺçŹŚä¸˛č˝Źć˘ (#40) \nbytes ĺ
ćäžäşä¸äşĺ strings ĺ
ç¸äźźçćä˝ďźĺŻäťĽĺ¸ŽĺŠéżĺ
[]byte/string äšé´ç轏ć˘ă
\nĺĺ珌串ĺĺ
ĺćłćź (#41) \n使ç¨ä¸ä¸Şĺĺ珌串çćˇč´ďźćĺŠäşéżĺ
ĺ
ĺćłćźďźĺ 为寚ä¸ä¸Şĺ珌串ç s[low:high] ćä˝čżĺçĺĺ珌串ďźĺ
śä˝żç¨äşĺĺĺ珌串 s ç¸ĺçĺşĺąć°çťă
\nĺ˝ć°ĺćšćł \nä¸çĽé使ç¨ĺŞç§ćĽćśĺ¨çąťĺ (#42) \n寚äşćĽćśĺ¨çąťĺćŻéç¨ value çąťĺčżćŻ pointer çąťĺďźĺşčŻĽĺĺłäşä¸é˘čżĺ ç§ĺ ç´ ďźćŻĺŚďźćšćłĺ
ćŻĺŚäźĺŻšĺŽčżčĄäżŽćšďźĺŽćŻĺŚĺ
ĺŤäşä¸ä¸Şä¸č˝č˘Ťćˇč´çĺ掾ďźäťĽĺĺŽčĄ¨ç¤şç寚蹥ćĺ¤ĺ¤§ăĺŚććçéŽďźćĽćśĺ¨ĺŻäťĽččä˝żç¨ pointer çąťĺă
\näťä¸ä˝żç¨ĺ˝ĺçčżĺĺź (#43) \n使ç¨ĺ˝ĺçčżĺĺźďźćŻä¸ç§ćććšĺĺ˝ć°ăćšćłĺŻčŻťć§çćšćłďźçšĺŤćŻčżĺĺźĺ襨ä¸ćĺ¤ä¸Şçąťĺç¸ĺçĺć°ăĺŚĺ¤ďźĺ 为čżĺĺźĺ襨ä¸çĺć°ćŻçťčżéśĺźĺĺ§ĺčżçďźćäşĺşćŻä¸äšäźçŽĺĺ˝ć°ăćšćłçĺŽç°ăä˝ćŻéčŚćł¨ćĺŽçä¸äşć˝ĺ¨ĺŻä˝ç¨ă
\n使ç¨ĺ˝ĺçčżĺĺźćśé˘ćĺ¤çĺŻä˝ç¨ (#44) \nč§ #43 .
\n使ç¨ĺ˝ĺçčżĺĺźďźĺ 为ĺŽĺˇ˛çťč˘Ťĺĺ§ĺäşéśĺźďźéčŚćł¨ćĺ¨ćäşć
ĺľä¸ĺźĺ¸¸čżĺćśćŻĺŚéčŚçťĺŽčľäşä¸ä¸Şä¸ĺçĺźďźćŻĺŚčżĺĺźĺ襨ĺŽäšäşä¸ä¸Şćĺĺć° err errorďźéčŚćł¨ć return err ćśćŻĺŚćŁçĄŽĺ°ĺŻš err čżčĄäşčľĺźă
\nčżĺä¸ä¸Ş nil ćĽćśĺ¨ (#45) \nĺ˝čżĺä¸ä¸Ş interface ĺć°ćśďźéčŚĺ°ĺżďźä¸čŚčżĺä¸ä¸Ş nil ćéďźčćŻĺşčŻĽćžĺźčżĺä¸ä¸Ş nil ĺźăĺŚĺďźĺŻč˝äźĺçä¸äşé˘ćĺ¤çéŽé˘ďźĺ 为č°ç¨ćšäźćśĺ°ä¸ä¸Şé nil çĺźă
\n使ç¨ćäťśĺä˝ä¸şĺ˝ć°ĺ
Ľĺ (#46) \n莞莥ĺ˝ć°ćśä˝żç¨ io.Reader çąťĺä˝ä¸şĺ
Ľĺďźčä¸ćŻćäťśĺďźĺ°ćĺŠäşćšĺĺ˝ć°çĺŻĺ¤ç¨ć§ăććľčŻć§ă
\nĺż˝çĽ defer čŻĺĽä¸ĺć°ăćĽćśĺ¨ĺźç莥çŽćšĺź (ĺć°ĺźčŽĄçŽ, ćé, ĺ value çąťĺćĽćśĺ¨) (#47) \n为äşéżĺ
defer čŻĺĽć§čĄćśĺ°ąçŤĺłĺŻš defer čŚć§čĄçĺ˝ć°çĺć°čżčĄčŽĄçŽďźĺŻäťĽččĺ°čŚć§čĄçĺ˝ć°ćžĺ°éĺ
éé˘ďźçśĺéčżćéäź éĺć°çťéĺ
ĺ
ĺ˝ć°ďźćč
éčżéĺ
ćčˇĺ¤é¨ĺéďźďźćĽč§Łĺłčżä¸ŞéŽé˘ă
\né误玥ç \nPanicking (#48) \nä˝żç¨ panic ćŻ Go ä¸ä¸ç§ĺ¤çé误çćšĺźďźä˝ćŻĺŞč˝ĺ¨éĺ°ä¸ĺŻć˘ĺ¤çé误ćśä˝żç¨ďźäžĺŚďźéçĽĺźĺäşşĺä¸ä¸Şĺźşäžčľç樥ĺĺ 载夹贼äşă
\nćŞččä˝ćśćĺşčŻĽĺ
čŁ
error (#49) \nWrappingďźĺ
čŁ
ďźé误ĺ
莸ć¨ć 莰é误ăćäžé˘ĺ¤çä¸ä¸ć俥ćŻăçśčďźĺ
čŁ
é误äźĺĺťşć˝ĺ¨çčŚĺďźĺ 为ĺŽä˝żĺžĺćĽçé误寚č°ç¨č
ĺŻč§ăĺŚćć¨ćłčŚé˛ć˘čżç§ć
ĺľďźčŻˇä¸čŚä˝żç¨ĺ
čŁ
é误çćšĺźă
\nä¸ćŁçĄŽçé误繝ĺćŻčž (#50) \nĺŚćä˝ ä˝żç¨ Go 1.13 ĺźĺ
Ľççšć§ fmt.Errorf + %w ćĽĺ
čŁ
ä¸ä¸Şé误ďźĺ˝čżčĄé误ćŻčžćśďźĺŚććłĺ¤ć诼ĺ
čŁ
ĺçé误ćŻä¸ćŻćĺŽçé误繝ĺďźĺ°ąéčŚä˝żç¨ errors.AsďźĺŚććłĺ¤ććŻä¸ćŻćĺŽç error 寚蹥尹éčŚç¨ errors.Isă
\nä¸ćŁçĄŽçé误寚蹥ĺźćŻčž (#51) \nč§ #50 .
\n为äşčĄ¨čžžä¸ä¸Şé˘ćĺ
çé误ďźčŻˇä˝żç¨é误ĺźçćšĺźďźĺšśéčż == ćč
errors.Is ćĽćŻčžăč寚äşćĺ¤é误ďźĺĺşä˝żç¨çšĺŽçé误繝ĺďźĺŻäťĽéčż errors.As ćĽćŻčžďźă
\n两揥ĺ¤çĺä¸ä¸Şé误 (#52) \n大ĺ¤ć°ć
ĺľä¸ďźé误äť
éčŚĺ¤çä¸ćŹĄăćĺ°é误ćĽĺżäšćŻä¸ç§é误ĺ¤çăĺ ć¤ďźĺ˝ĺ˝ć°ĺ
ĺçé误ćśďźĺşčŻĽĺ¨ćĺ°ćĽĺżĺčżĺé误ä¸éćŠĺ
śä¸ä¸ç§ăĺ
čŁ
é误äšĺŻäťĽćäžéŽé˘ĺççé˘ĺ¤ä¸ä¸ć俥ćŻďźäšĺ
ćŹäşĺćĽçé误ďźĺŻčč交çťč°ç¨ćšč´č´ŁććĽĺżďźă
\nä¸ĺ¤çé误 (#53) \nä¸çŽĄćŻĺ¨ĺ˝ć°č°ç¨ćśďźčżćŻĺ¨ä¸ä¸Ş defer ĺ˝ć°ć§čĄćśďźĺŚććłčŚĺż˝çĽä¸ä¸Şé误ďźĺşčŻĽćžĺźĺ°éčż _ ćĽĺż˝çĽďźĺŻćł¨ćĺż˝çĽçĺĺ ďźăĺŚĺďźĺ°ćĽç话č
ĺ°ąäźćč§ĺ°ĺ°ćďźĺż˝çĽčżä¸Şé误ćŻćć为äščżćŻć ćä¸ćźćäşă
\nä¸ĺ¤ç defer ä¸çé误 (#54) \n大ĺ¤ć°ć
ĺľä¸ďźä˝ ä¸ĺşčŻĽĺż˝çĽ defer ĺ˝ć°ć§čĄćśčżĺçé误ďźćč
ćžĺźĺ¤çĺŽďźćč
ĺ°ĺŽäź éçťč°ç¨ćšĺ¤çďźĺŻäťĽć šćŽć
ćŻčżčĄéćŠăĺŚćä˝ çĄŽĺŽčŚĺż˝çĽčżä¸Şé误ďźčŻˇćžĺźä˝żç¨ _ ćĽĺż˝çĽă
\nĺšśĺçźç¨: ĺşçĄ \n桡ćˇĺšśĺĺĺšśčĄ (#55) \nç解嚜ĺďźconcurrencyďźăĺšśčĄďźparallelismďźäšé´çćŹč´¨ĺşĺŤćŻ Go ĺźĺäşşĺĺż
饝čŚććĄçăĺšśĺćŻĺ
łäşçťć莞莥ä¸çďźĺšśčĄćŻĺ
łäşĺ
ˇä˝ć§čĄä¸çă
\n\nčŚć为ä¸ĺççťçĺźĺäşşĺďźć¨ĺż
饝ćčŻĺ°ĺšśéććĺşćŻä¸é˝ćŻĺšśĺçćšćĄć´ĺżŤă寚äşäťťĺĄä¸çćĺ°ĺˇĽä˝č´č˝˝é¨ĺďźĺŻšĺŽäťŹčżčĄĺšśčĄĺĺ¤çĺšśä¸ä¸ĺŽĺ°ąćććžćśçćč
ćŻä¸˛čĄĺćšćĄć´ĺżŤă寚串čĄĺăĺšśĺćšćĄčżčĄ benchmark ćľčŻďźćŻéŞčŻĺ莞ç弽ĺćłă
\nä¸ć¸
ćĽä˝ćśä˝żç¨ channels ć mutexes (#57) \näşč§Ł goroutine äšé´ç交äşäšĺŻäťĽĺ¨éćŠä˝żç¨ channels ć mutexes ćśćć帎ĺŠăä¸čŹćĽčŻ´ďźĺšśčĄç goroutine éčŚĺćĽďźĺ ć¤éčŚä˝żç¨ mutexesăç¸ĺďźĺšśĺç goroutine é常éčŚĺč°ĺçźćďźĺ ć¤éčŚä˝żç¨ channelsă
\nä¸ćç˝çŤćéŽé˘ (ć°ćŽçŤć vs. çŤććĄäťśĺ Go ĺ
ĺ樥ĺ) (#58) \nććĄĺšśĺćĺłçčŚčŽ¤čŻĺ°ć°ćŽçŤäşďźdata racesďźĺçŤććĄäťśďźrace conditionsďźćŻä¸¤ä¸Şä¸ĺçćŚĺżľăć°ćŽçŤäşďźćçćŻćĺ¤ä¸Ş goroutines ĺćśčŽżéŽç¸ĺĺ
ĺĺşĺćśďźçźşäšĺż
čŚçĺćĽć§ĺśďźä¸ĺ
śä¸čłĺ°ćä¸ä¸Ş goroutine ć§čĄçćŻĺćä˝ăĺćśčŚčŽ¤čŻĺ°ďźć˛Ąćĺçć°ćŽçŤäşä¸äťŁčĄ¨ç¨ĺşçć§čĄćŻçĄŽĺŽć§çă沥éŽé˘çăĺ˝ĺ¨ć个çšĺŽçćä˝éĄşĺşćč
çšĺŽçäşäťśĺç饺ĺşä¸ďźĺŚććçťçčĄä¸şćŻä¸ĺŻć§çďźčżĺ°ąćŻçŤććĄäťśă
\n\npsďźć°ćŽçŤäşćŻçŤććĄäťśçĺéďźçŤććĄäťśä¸äť
ĺąéäşčŽżĺćŞĺćĽďźĺŽĺŻäťĽĺçĺ¨ć´éŤçĺąé˘ăgo test -race ćŁćľçćŻć°ćŽçŤäşďźéčŚĺćĽćĽč§Łĺłďźčĺźĺč
čżéčŚĺ
łćł¨é˘ć´ĺšżççŤććĄäťśďźĺŽéčŚĺŻšĺ¤ä¸Ş goroutines çć§čĄčżčĄçźćă
\n \nç解 Go çĺ
ĺ樥ĺ䝼ĺćĺ
łéĄşĺşĺĺćĽçĺşĺąäżčŻćŻé˛ć˘ĺŻč˝çć°ćŽçŤäşĺçŤććĄäťśçĺ
łéŽă
\nä¸ç解ä¸ĺ塼ä˝č´č˝˝çąťĺ寚嚜ĺç役ĺ (#59) \nĺ˝ĺĺťşä¸ĺŽć°éç goroutines ćśďźéčŚčč塼ä˝č´č˝˝ççąťĺăĺŚć塼ä˝č´č˝˝ćŻ CPU ĺŻéĺçďźéŁäš goroutines ć°éĺşčŻĽćĽčżäş GOMAXPROCS çĺźďźčŻĽĺźĺĺłäşä¸ťćşĺ¤çĺ¨ć ¸ĺżć°ďźăĺŚć塼ä˝č´č˝˝ćŻ IO ĺŻéĺçďźgoroutines ć°éĺ°ąéčŚččĺ¤ç§ĺ ç´ ďźćŻĺŚĺ¤é¨çłťçťďźčč诡ćąăĺĺşéçďźă
\nčŻŻč§Łäş Go contexts (#60) \nGo çä¸ä¸ćďźcontextďźäšćŻ Go ĺšśĺçźç¨çĺşçłäšä¸ăä¸ä¸ćĺ
莸ć¨ćşĺ¸ŚćŞć˘ćśé´ăĺćśäżĄĺˇĺéŽĺźĺ襨ă
\nĺšśĺçźç¨: ĺŽčˇľ \näź éä¸ĺéç context (#61) \nĺ˝ćäťŹäź éäşä¸ä¸Ş contextďźć䝏éčŚçĽéčżä¸Ş context äťäšćśĺĺŻäťĽč˘ŤĺćśďźčżçšĺžéčŚďźäžĺŚďźä¸ä¸Ş HTTP 诡ćąĺ¤çĺ¨ĺ¨ĺéĺŽĺĺşĺĺćś contextă
\n\nps: ĺŽé
ä¸ context 襨螞çćŻä¸ä¸Şĺ¨ä˝ĺŻäťĽćçťĺ¤äš
äšĺ袍ĺć˘ă
\n \nĺŻĺ¨äşä¸ä¸Ş goroutine ä˝ćŻä¸çĽéĺŽä˝ćśäźĺć˘ (#62) \néżĺ
goroutine ćłćźďźčŚćčżç§ćčŻďźĺ˝ĺĺťşĺšśĺŻĺ¨ä¸ä¸Ş goroutine çćśĺďźĺşčŻĽć寚ĺşç莞莥莊ĺŽč˝ćŁĺ¸¸éĺşă
\nä¸ćł¨ćĺ¤ç goroutines ĺ垪çŻä¸çčżäťŁĺé (#63) \n为äşéżĺ
goroutines ĺ垪çŻä¸çčżäťŁĺééŽé˘ďźĺŻäťĽččĺĺťşĺąé¨ĺéĺšśĺ°čżäťŁĺéčľĺźçťĺąé¨ĺéďźćč
goroutines č°ç¨ĺ¸Śĺć°çĺ˝ć°ďźĺ°čżäťŁĺéĺźä˝ä¸şĺć°ĺźäź ĺ
ĽďźćĽäťŁćż goroutines č°ç¨éĺ
ă
\nä˝żç¨ select + channels ćśčŻŻäťĽä¸şĺćŻéćŠéĄşĺşćŻçĄŽĺŽç (#64) \nčŚćç˝ďźselect ĺ¤ä¸Ş channels ćśďźĺŚćĺ¤ä¸Ş channels ä¸çćä˝é˝ĺ°ąçťŞďźéŁäšäźéćşéćŠä¸ä¸Ş case ĺćŻćĽć§čĄďźĺ ć¤čŚéżĺ
ćĺćŻéćŠéĄşĺşćŻäťä¸ĺ°ä¸çčżç§é误é˘čŽžďźčżĺŻč˝äźĺŻźč´čŽžčŽĄä¸ç bugă
\nä¸ćŁçĄŽä˝żç¨éçĽ channels (#65) \nĺééçĽćśä˝żç¨ chan struct{} çąťĺă
\n\nps: ĺ
ćç˝äťäšćŻéçĽ channelsďźä¸ä¸ŞéçĽ channels ćçćŻĺŞćŻç¨ćĽĺéçĽďźčĺ
śä¸äź éçć°ćŽć˛Ąććäšďźćč
ç解ćä¸äź éć°ćŽç channelsďźčżç§ç§°ä¸şéçĽ channelsăĺ
śä¸äź éçć°ćŽççąťĺ为 struct{} ć´ĺéă
\n \nä¸ä˝żç¨ nil channels (#66) \nä˝żç¨ nil channels ĺşčŻĽćŻĺšśĺĺ¤çćšĺźä¸çä¸é¨ĺďźäžĺŚďźĺŽč˝ĺ¤ĺ¸ŽĺŠçŚç¨ select čŻĺĽä¸ççšĺŽçĺćŻă
\nä¸ć¸
ćĽčŻĽĺŚä˝çĄŽĺŽ channel size (#67) \nć šćŽćĺŽçĺşćŻäťçťčŻäź°ĺşčŻĽä˝żç¨ĺŞä¸ç§ channel çąťĺďźĺ¸Śçźĺ˛çďźä¸ĺ¸Śçźĺ˛çďźăĺŞćä¸ĺ¸Śçźĺ˛ç channels ĺŻäťĽćäžĺźşĺćĽäżčŻă
\n使ç¨ĺ¸Śçźĺ˛ç channels ćśĺŚćä¸çĄŽĺŽ size 诼ĺŚä˝čŽžç˝ŽďźĺŻäťĽĺ
莞为 1ďźĺŚććĺççççąĺĺťćĺŽ channels sizeă
\n\nps: ć šćŽ disruptor čżä¸ŞéŤć§č˝ĺ
ĺćśćŻéĺçĺŽčˇľďźĺ¨ćç§čŻťĺ pacing ä¸ďźéĺčŚäšćťĄčŚäšçŠşďźä¸ĺ¤§ĺŻč˝ĺ¤äşćç§äťäşä¸é´ç稳ćă
\n \nĺżčŽ°äşĺçŹŚä¸˛ć źĺźĺĺŻč˝ĺ¸ŚćĽçĺŻä˝ç¨ďźäžĺŚ etcd ć°ćŽçŤäşĺćťéďź(#68) \nćčŻĺ°ĺçŹŚä¸˛ć źĺźĺĺŻč˝äźĺŻźč´č°ç¨ç°ćĺ˝ć°ďźčżćĺłçéčŚćł¨ćĺŻč˝çćťéĺĺ
śäťć°ćŽçŤäşéŽé˘ă
\n\nps: ć ¸ĺżćŻčŚĺ
łćł¨ fmt.Sprintf + %v čżčĄĺçŹŚä¸˛ć źĺźĺćś %v ĺ
ˇä˝ĺ°ä¸ĺççąťĺĺźćśďźĺŽé
ä¸ć§čĄçćä˝ćŻäťäšăćŻĺŚ %v čżä¸Ş placeholder 寚ĺşçĺźćŻä¸ä¸Ş context.ContextďźéŁäšäźĺ°ąéĺĺ
śéčż context.WithValue éĺ ĺ¨ĺ
śä¸ç valuesďźčżä¸Şčżç¨ĺŻč˝ćśĺĺ°ć°ćŽçŤäşéŽé˘ă䚌ä¸ćĺçĺŚä¸ä¸ŞĺŻźč´ćťéçćĄäžćŹč´¨ä¸äšćŻä¸ć ˇçéŽé˘ďźĺŞä¸čżĺé˘ĺ¤çľćŻĺ°äş sync.RWMutex ä¸ĺŻéĺ
ĽçéŽé˘ă
\n \nä˝żç¨ append ä¸ĺ˝ĺŻźč´ć°ćŽçŤäş (#69) \nč°ç¨ append ä¸ćťćŻć˛Ąćć°ćŽçŤäşçďźĺ ć¤ä¸čŚĺ¨ä¸ä¸Şĺ
ąäşŤç slice ä¸ĺšśĺĺ°ć§čĄ appendă
\nčŻŻç¨ mutexes ĺ slicesămaps (#70) \nčŻˇčŽ°ä˝ slices ĺ maps ćŻĺźç¨çąťĺďźćĺŠäşéżĺ
常č§çć°ćŽçŤäşéŽé˘ă
\n\nps: čżéĺŽé
ćŻĺ 为é误çč§Łäş slices ĺ mapsďźĺŻźč´ĺĺşäşé误ĺ°ćˇč´ slices ĺ maps ç䝣ç ďźčżč察č´éäżć¤ć ćăĺşç°ć°ćŽçŤäşéŽé˘ă
\n \nčŻŻç¨ sync.WaitGroup (#71) \nćŁçĄŽĺ°ä˝żç¨ sync.WaitGroup éčŚĺ¨ĺŻĺ¨ goroutines äšĺĺ
č°ç¨ Add ćšćłă
\nĺżčŽ°ä˝żç¨ sync.Cond (#72) \nä˝ ĺŻäťĽä˝żç¨ sync.Cond ĺĺ¤ä¸Ş goroutines ĺééĺ¤çéçĽă
\nä¸ä˝żç¨ errgroup (#73) \nä˝ ĺŻäťĽä˝żç¨ errgroup ĺ
ćĽĺćĽä¸çť goroutines ĺšśĺ¤çé误ĺä¸ä¸ćă
\nćˇč´ä¸ä¸Ş sync ä¸ççąťĺ (#74) \nsync ĺ
ä¸ççąťĺä¸ĺşčŻĽč˘Ťćˇč´ă
\nć ĺĺş \n使ç¨äşé误ç time.Duration (#75) \n注ććäşĺ˝ć°ćĽćśä¸ä¸Ş time.Duration çąťĺçĺć°ćśďźĺ°˝çŽĄç´ćĽäź éä¸ä¸Şć´ć°ćŻĺŻäťĽçďźä˝ć弽čżćŻä˝żç¨ time API ä¸çćšćłćĽäź é durationďźäťĽéżĺ
ĺŻč˝é ćçĺ°ćĺ bugă
\n\nps: éçšćŻćł¨ć time.Duration ĺŽäšçćŻ nanoseconds ć°ă
\n \ntime.After ĺĺ
ĺćłćź (#76)éżĺ
ĺ¨éĺ¤ć§čĄĺžĺ¤ćŹĄçĺ˝ć°ďźĺŚĺžŞçŻä¸ć HTTP ĺ¤çĺ˝ć°ďźä¸č°ç¨ time.AfterďźčżĺŻäťĽéżĺ
ĺ
ĺĺł°ĺźćśčăçą time.After ĺĺťşçčľćşäť
ĺ¨čŽĄćśĺ¨čś
ćśćäźč˘Ťéćžă
\nJSON ĺ¤çä¸ç常č§é误 (#77) \n\nçąťĺĺľĺĽĺŻźč´çé˘ćĺ¤çčĄä¸ş \n \nčŚĺ˝ĺżĺ¨ Go çťćä˝ä¸ĺľĺ
Ľĺ掾ďźčżć ˇĺĺŻč˝äźĺŻźč´čŻ¸ĺŚĺľĺ
Ľç time.Time ĺ掾ĺŽç° json.Marshaler ćĽĺŁďźäťččŚçéťčŽ¤ç JSON ĺşĺă
\n\nĺ˝ĺŻšä¸¤ä¸Ş time.Time çąťĺĺźčżčĄćŻčžćśďźéčŚčŽ°ä˝ time.Time ĺ
ĺŤäşä¸ä¸Şĺ˘ä¸ćśéďźwall clockďźĺä¸ä¸Şĺč°ćśé ďźmonotonic clockďźďźčä˝żç¨ == čżçŽçŹŚčżčĄćŻčžćśäźĺćśćŻčžčżä¸¤ä¸Şă
\n\nMap éŽĺŻšĺşĺźä¸ş any \n \nĺ˝ćäžä¸ä¸Ş map ç¨ćĽ unmarshal JSON ć°ćŽćśďźä¸şäşéżĺ
ä¸çĄŽĺŽç value çťćć䝏äźä˝żç¨ any ćĽä˝ä¸ş value ççąťĺčä¸ćŻĺŽäšä¸ä¸Ş structďźčżç§ć
ĺľä¸éčŚčŽ°ĺžć°ĺźéťčŽ¤äźč˘Ťč˝Źć˘ä¸ş float64ă
\n常č§ç SQL é误 (#78) \n\nĺżčŽ°äş sql.Open 嚜沥ćä¸ db ćĺĄĺ¨ĺťşçŤĺŽé
čżćĽ \n \néčŚč°ç¨ Ping ćč
PingContext ćšćłćĽćľčŻé
罎嚜祎äżć°ćŽĺşćŻĺŻčžžçă
\n\nĺżčŽ°äşä˝żç¨čżćĽćą \n \nä˝ä¸şç产级ĺŤçĺşç¨ďźčŽżéŽć°ćŽĺşćśĺşčŻĽĺ
łćł¨é
罎ć°ćŽĺşčżćĽćą ĺć°ă
\n\n沥ćä˝żç¨ prepared čŻĺĽ \n \nä˝żç¨ SQL prepared čŻĺĽč˝ĺ¤čŽŠćĽčŻ˘ć´ĺ éŤćĺĺŽĺ
¨ă
\n\nä˝żç¨ sql.NullXXX çąťĺĺ¤ç襨ä¸çĺŻçŠşĺă
\n\nä¸ĺ¤çčĄčżäťŁćśçé误 \n \nč°ç¨ sql.Rows ç Err ćšćłćĽçĄŽäżĺ¨ĺĺ¤ä¸ä¸ä¸ŞčĄćść˛Ąćéćźé误ă
\nä¸ĺ
łé临ćśčľćşďźHTTP 诡ćąä˝ăsql.Rows ĺ os.Fileďź (#79) \nćçťčŚćł¨ćĺ
łéććĺŽç° io.Closer ćĽĺŁççťćä˝ďźäťĽéżĺ
ĺŻč˝çćłćźă
\nĺĺş HTTP 诡ćąĺ沥ćčżĺčŻĺĽ (#80) \n为äşéżĺ
ĺ¨ HTTP ĺ¤çĺ˝ć°ä¸ĺşç°ćäşćĺ¤çéŽé˘ďźĺŚććłĺ¨ĺç http.Error ĺ莊 HTTP ĺ¤çĺ˝ć°ĺć˘ďźéŁäšĺ°ąä¸čŚĺżčŽ°ä˝żç¨ return čŻĺĽćĽéťć˘ĺçťäťŁç çć§čĄă
\nç´ćĽä˝żç¨éťčŽ¤ç HTTP client ĺ server (#81) \n寚äşç产级ĺŤçĺşç¨ďźä¸čŚä˝żç¨éťčŽ¤ç HTTP client ĺ server ĺŽç°ăčżäşĺŽç°çźşĺ°čś
ćśĺç产çŻĺ˘ä¸ĺşčŻĽĺźşĺśä˝żç¨çčĄä¸şă
\nćľčŻ \n\n寚ćľčŻčżčĄĺż
čŚçĺçąťďźĺŻäťĽĺĺŠ build tagsăçŻĺ˘ĺé䝼ĺç樥ĺźďźćĽä˝żĺžćľčŻčżç¨ć´ĺ éŤćăä˝ ĺŻäťĽä˝żç¨ build tags ćçŻĺ˘ĺéćĽĺĺťşćľčŻçąťĺŤďźäžĺŚĺĺ
ćľčŻä¸éććľčŻďźďźĺšśĺşĺçćľčŻä¸éżćśé´ćľčŻďźćĽĺłĺŽć§čĄĺŞç§çąťĺçă
\n\nps: äşč§Łä¸ go build tagsďźäťĽĺ go test -shortă
\n \nä¸ćĺź race ĺźĺ
ł (#83) \nćĺź -race ĺźĺ
łĺ¨çźĺĺšśĺĺşç¨ćśé常éčŚăčżč˝ĺ¸ŽĺŠä˝ ćčˇĺŻč˝çć°ćŽçŤäşďźäťčéżĺ
软䝜 bugă
\nä¸ćĺźćľčŻçć§čĄć¨Ąĺźĺźĺ
ł (parallel ĺ shuffle) (#84) \nćĺźĺźĺ
ł -parallel ćĺŠäşĺ éćľčŻçć§čĄďźçšĺŤćŻćľčŻä¸ĺ
ĺŤä¸äşéčŚéżćčżčĄçç¨äžçćśĺă
\nćĺźĺźĺ
ł -shuffle č˝ĺ¤ćäšąćľčŻç¨äžć§čĄç饺ĺşďźéżĺ
ä¸ä¸ŞćľčŻäžčľäşćäşä¸çŹŚĺçĺŽć
ĺľçé˘čŽžďźćĺŠäşĺćŠć´é˛ bugă
\nä¸ä˝żç¨čĄ¨éŠąĺ¨çćľčŻ (#85) \n襨銹ĺ¨çćľčŻćŻä¸ç§ććçćšĺźďźĺŻäťĽĺ°ä¸çťç¸äźźçćľčŻĺçťĺ¨ä¸čľˇďźäťĽéżĺ
䝣ç éĺ¤ĺ使ćŞćĽçć´ć°ć´ĺŽšćĺ¤çă
\nĺ¨ĺĺ
ćľčŻä¸ć§čĄ sleep ćä˝ (#86) \n使ç¨ĺćĽçćšĺźăéżĺ
sleepďźćĽĺ°˝éĺĺ°ćľčŻçä¸ç¨łĺŽć§ĺćéŤé˛ćŁć§ăĺŚćć ćłä˝żç¨ĺćĽć掾,ĺŻäťĽččéčŻçćšĺźă
\n沥ćéŤćĺ°ĺ¤ç time API (#87) \nç解ĺŚä˝ĺ¤çä˝żç¨ time API çĺ˝ć°ďźćŻä˝żćľčŻć´ĺ 稳ĺŽçĺŚä¸ç§ćšĺźăć¨ĺŻäťĽä˝żç¨ć ĺććŻďźäžĺŚĺ°ćśé´ä˝ä¸şéčäžčľéĄšçä¸é¨ĺćĽĺ¤çďźćč
čŚćąĺŽ˘ćˇçŤŻćäžćśé´ă
\nä¸ä˝żç¨ćľčŻç¸ĺ
łç塼ĺ
ˇĺ
(httptest ĺ iotest) (#88) \nčżä¸Ş httptest ĺ
寚ĺ¤ç HTTP ĺşç¨ç¨ĺşĺžć帎ĺŠăĺŽćäžäşä¸çťĺŽç¨ç¨ĺşćĽćľčŻĺŽ˘ćˇçŤŻĺćĺĄĺ¨ă
\nčżä¸Ş iotest ĺ
ćĺŠäşçźĺ io.Reader ĺšśćľčŻĺşç¨ç¨ĺşćŻĺŚč˝ĺ¤ĺŽšĺżé误ă
\n\n\nä¸čŚé罎ćč
ćĺ timer \n \nä˝żç¨ time ćšćłćĽäżćĺşĺćľčŻçĺ祎ć§ă
\n\nĺĺşé误ç垎ĺşĺćľčŻĺ莞 \n \nĺ˘ĺ benchtime ćč
ä˝żç¨ benchstat ç塼ĺ
ˇĺŻäťĽćĺŠäşĺžŽĺşĺćľčŻă
\nĺ°ĺżĺžŽĺşĺćľčŻççťćďźĺŚććçťčżčĄĺşç¨ç¨ĺşççłťçťä¸čżčĄĺžŽĺşĺćľčŻççłťçťä¸ĺă
\n\n寚çźčŻćäźĺčŚčśłĺ¤ĺ°ĺż \n \n祎äżćľčŻĺ˝ć°ćŻĺŚäźäş§çä¸äşĺŻä˝ç¨ďźé˛ć˘çźčŻĺ¨äźĺ揺éŞä˝ ĺžĺ°çĺşĺćľčŻçťćă
\n\n袍č§ĺŻč
ćĺşććŹşéŞ \n \n为äşéżĺ
袍č§ĺŻč
ćĺşćŹşéŞďźĺźşĺśéć°ĺĺťşCPUĺŻéĺĺ˝ć°ä˝żç¨çć°ćŽă
\n沥ćĺťć˘ç´˘ go test ććççšć§ (#90) \n\nä˝żç¨ -coverprofile ĺć°ĺŻäťĽĺżŤéćĽç䝣ç çćľčŻčŚçć
ĺľďźćšäžżĺżŤéćĽçĺŞä¸Şé¨ĺéčŚć´ĺ¤çĺ
łćł¨ă
\n\nĺ¨ä¸ĺçĺ
ä¸ć§čĄćľčŻ \n \nĺĺ
ćľčŻçťçťĺ°ä¸ä¸ŞçŹçŤçĺ
ä¸ďźĺŻšäşĺŻšĺ¤ĺąć´é˛çćĽĺŁďźéčŚĺä¸äşćľčŻç¨äžăćľčŻĺşčŻĽĺ
łćł¨ĺ
ŹĺźçčĄä¸şďźčéĺ
é¨ĺŽç°çťčă
\n\nĺ¤çé误ćśďźä˝żç¨ *testing.T ĺéčä¸ćŻçťĺ
¸ç if err != nil ĺŻäťĽčŽŠäťŁç ć´ĺ çŽć´ć话ă
\n\nä˝ ĺŻäťĽä˝żç¨ setup ĺ teardown ĺ˝ć°ćĽé
罎ä¸ä¸Şĺ¤ćççŻĺ˘ďźćŻĺŚĺ¨éććľčŻçć
ĺľä¸ă
\nä¸ä˝żç¨ć¨ĄçłćľčŻ (礞ĺşĺéŚé误) \n樥çłćľčŻćŻä¸ç§éŤćçççĽďźä˝żç¨ĺŽč˝ćŁćľĺşéćşăććĺ¤çĺä¸äşćśćçć°ćŽčžĺ
ĽďźćĽĺŽćä¸äşĺ¤ćçćä˝ă
\nč§: @jeromedoucet
\näźĺććŻ \nä¸ç解 CPU cache (#91) \n\nç解 CPU çźĺç使ç¨ĺŻšäşäźĺ CPU ĺŻéĺĺşç¨ĺžéčŚďźĺ 为 L1 çźĺćŻä¸ťĺ忍 50 ĺ° 100 ĺă
\n\nćčŻĺ° cache line ćŚĺżľĺŻšäşç解ĺŚä˝ĺ¨ć°ćŽĺŻéĺĺşç¨ä¸çťçťć°ćŽé常ĺ
łéŽăCPU ĺšśä¸ćŻä¸ä¸Şä¸ä¸ŞĺćĽčˇĺĺ
ĺăç¸ĺďźĺŽé常ĺ¤ĺśä¸ä¸Ş 64 ĺčéżĺşŚç cache lineă为äşčˇĺžćŻä¸Ş cache line çć大ćç¨ďźéčŚĺŽć˝çŠşé´ĺąé¨ć§ă
\n\nćéŤ CPU ć§čĄäťŁç ćśçĺŻé˘ćľć§ďźäšćŻäźĺćäşĺ˝ć°çä¸ä¸ŞćććšćłăćŻĺŚďźĺşĺŽćĽéżćčżçťčŽżéŽĺŻš CPU ćĽčŻ´ćŻĺŻé˘ćľçďźä˝éčżçťčŽżéŽďźäžĺŚéžčĄ¨ďźĺ°ąćŻä¸ĺŻé˘ćľçă
\n\nčŚćł¨ćç°äťŁçźĺćŻĺĺşçďźset associative placementďźçťç¸čżć ĺ°ďźďźčŚćł¨ćéżĺ
ä˝żç¨ critical strideďźčżç§ćĽéżć
ĺľä¸ĺŞč˝ĺŠç¨ cache çä¸ĺ°é¨ĺă
\n\ncritical strideďźčżç§çąťĺçćĽéżďźćçćŻĺ
ĺ莿éŽçćĽéżĺ弽çäş cache 大ĺ°ăčżç§ć
ĺľä¸ďźĺŞćĺ°é¨ĺ cacheline 袍ĺŠç¨ă
\n \nĺçĺšśĺĺ¤çéťčžäźĺŻźč´ false sharing (#92) \näşč§Ł CPU çźĺçčžä˝ĺąç L1ăL2 cache ä¸äźĺ¨ććć ¸é´ĺ
ąäşŤďźçźĺĺšśĺĺ¤çéťčžćśč˝éżĺ
ĺĺşä¸äşéä˝ć§č˝çéŽé˘ďźćŻĺŚäźŞĺ
ąäşŤďźfalse sharingďźăĺ
ĺĺ
ąäşŤĺŞćŻä¸ç§ĺ蹥ă
\n沥ćččć䝤级çĺšśčĄ (#93) \n使ç¨ć䝤级嚜čĄďźILP ďźäźĺ䝣ç ççšĺŽé¨ĺďźäťĽĺ
莸 CPU ĺ°˝ĺŻč˝ć§čĄć´ĺ¤ĺŻäťĽĺšśčĄć§čĄçć䝤ăčŻĺŤć䝤çć°ćŽäžčľéŽé˘ďźdata hazardsďźćŻä¸ťčŚćĽéޤäšä¸ă
\nä¸äşč§Łć°ćŽĺŻšé˝ (#94) \nčŽ°ä˝ Go ä¸ĺşćŹçąťĺä¸ĺ
śčŞčşŤĺ¤§ĺ°ĺŻšé˝ďźäžĺŚďźć大ĺ°éĺşéć°çťçťçťćä˝çĺ掾ĺŻäťĽĺ˝˘ćć´ç´§ĺççťćä˝ďźĺĺ°ĺ
ĺĺé
ďźć´ĺĽ˝ç犺é´ĺąé¨ć§ďźďźčżćĺŠäşéżĺ
ä¸äşĺ¸¸č§çé误ă
\nä¸äşč§Ł stack vs. heap (#95) \näşč§Łĺ ĺć äšé´çĺşĺŤćŻĺźĺäşşĺçć ¸ĺżçĽčŻçšďźçšĺŤćŻčŚĺťäźĺä¸ä¸Ş Go ç¨ĺşćśăć ĺé
çĺźéĺ äšä¸şéśďźčĺ ĺé
ĺčžć
˘ďźĺšśä¸äžčľ GC ćĽć¸
çĺ
ĺă
\nä¸çĽéĺŚä˝ĺĺ°ĺ
ĺĺé
揥ć°ďźAPI č°ć´ďźçźčŻĺ¨äźĺĺ sync.Poolďź (#96) \nĺĺ°ĺ
ĺĺé
揥ć°äšćŻäźĺ Go ĺşç¨çä¸ä¸ŞéčŚćšé˘ăčżĺŻäťĽéčżä¸ĺçćšĺźćĽĺŽç°ďźćŻĺŚäťçťčŽžčŽĄ API ćĽéżĺ
ä¸ĺż
čŚçćˇč´ďźäťĽĺä˝żç¨ sync.Pool ćĽĺŻšĺé
寚蹥čżčĄćą ĺă
\nä¸ćł¨ć使ç¨ĺ
č (#97) \n使ç¨ĺżŤé衯ĺžçĺ
čććŻćĽć´ĺ ććĺ°ĺĺ°č°ç¨ĺ˝ć°çćéćśé´ă
\n\näşč§Ł Go profiling 塼ĺ
ˇăć§čĄćś tracer ćĽčž
ĺŠĺ¤ćä¸ä¸Şĺşç¨ç¨ĺşćŻĺŚćŁĺ¸¸ďźäťĽĺĺĺşéčŚäźĺçé¨ĺă
\nä¸ç解 GC ćŻĺŚä˝ĺˇĽä˝ç (#99) \nç解ĺŚä˝č°äź GC č˝ĺ¤ĺ¸ŚćĽĺžĺ¤ćśçďźäžĺŚćĺŠäşć´éŤćĺ°ĺ¤ççŞĺ˘çč´č˝˝ă
\nä¸äşč§Ł Docker ćč
K8S 寚čżčĄç Go ĺşç¨çć§č˝ĺ˝ąĺ (#100) \n为äşéżĺ
CPU throttlingďźCPU éé˘ďźéŽé˘ďźĺ˝ćäťŹĺ¨ Docker ĺ Kubernetes é¨ç˝˛ĺşç¨ćśďźčŚçĽé Go čŻč¨ĺŻš CFS ďźĺŽĺ
¨ĺ
Źĺšłč°ĺşŚĺ¨ďźć ćçĽă
\n\n\n\n\n\n\n\n \n \n\n\n\n \n\n\n\n\n\n\n\n\n\n\n \n \n
\n \n \n\n
\n \n \n \n
![\"\"](\"../img/thecodercafe.png\")