模式匹配与守卫
掌握 Erlang 的模式匹配和守卫子句，这是编写表达力强、无需分支的 Erlang 代码的基础。
模式匹配与守卫 是 CoddyKit 上的免费 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课时。 这是第 4 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程共包含 4 节课。
本课时的部分内容尚未翻译，以英文显示。
Matching, Not Assigning
In Erlang = is the match operator, not assignment: it binds left-side variables to right-side values, or fails if they cannot match.
X = 42.
% X is now bound to 42Destructuring Tuples
Pattern matching can destructure compound terms like tuples in a single step, pulling values straight out.
{ok, Value} = {ok, 100}.
% Value is bound to 100Matching Lists
The [Head | Tail] pattern splits a list into its first element and the remaining rest.
[First | Rest] = [1, 2, 3].
% First = 1, Rest = [2, 3]The Pin / Bound Match
Once a variable is bound, reusing it in a pattern matches against its value rather than rebinding it.
X = 5.
{X, Y} = {5, 10}. % matches, Y = 10
{X, Y} = {7, 10}. % fails: X is bound to 5The Underscore Wildcard
The underscore wildcard _ matches anything and binds nothing — use it for parts you do not care about.
{_, Important} = {ignore_me, 99}.
% Important = 99Function Clause Matching
Function clauses are tried top to bottom, choosing the first whose arguments match. This replaces many if/else chains.
describe(0) -> zero;
describe(1) -> one;
describe(_) -> many.What Are Guards?
Guards add extra conditions to a clause with when; the clause fires only if both the pattern and the guard succeed.
classify(N) when N > 0 -> positive;
classify(N) when N < 0 -> negative;
classify(_) -> zero.Allowed Guard Expressions
Guards must be side-effect-free — only comparisons, arithmetic, and type tests like is_integer or is_list are allowed.
kind(X) when is_integer(X) -> int;
kind(X) when is_list(X) -> list;
kind(_) -> other.Combining Guards
Combine guard tests with , for AND and ; for OR.
in_range(X) when X >= 1, X =< 10 -> yes;
in_range(_) -> no.Matching in case
The case expression matches a value against patterns (with optional guards) and returns the branch that fits.
case lists:keyfind(id, 1, List) of
{id, V} -> V;
false -> not_found
end.Why It Matters
Pattern matching and guards make Erlang declarative — you describe data shapes instead of branching, the same skill you will use for messages.
Quick Check
Test your matching knowledge.
Recap
Recap: = matches and binds, you destructure tuples and lists, and function clauses with guards replace manual branching.
用 AI 导师学习 Erlang — 免费
在浏览器中编写并运行真实代码，获得全天候 AI 导师的即时帮助，并在网页或应用中继续学习。
- 课程
- 12
- 课程
- 48
常见问题解答
「模式匹配与守卫」课时是免费的吗？
是的 — 「模式匹配与守卫」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程的其余内容，请升级到 CoddyKit PRO。 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程共包含 4 节课。
「模式匹配与守卫」这节课中我会学到什么？
掌握 Erlang 的模式匹配和守卫子句，这是编写表达力强、无需分支的 Erlang 代码的基础。 你通过在浏览器中直接运行的动手代码来练习 Erlang OTP: Distributed & Fault-Tolerant Systems Programming，全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 需要有经验吗？
无需任何先前经验。CoddyKit 上的 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 4 节课，共 4 节。
「模式匹配与守卫」课时需要多长时间？
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。
我能在这节 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课中编写并运行代码吗？
能。每节 Erlang OTP: Distributed & Fault-Tolerant Systems Programming 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。