C# 9: New `and`, `or`, and `not` Keywords for Pattern Matching

栏目: IT技术 · 发布时间: 5年前

内容简介:Though it may sound like our occasionalApril Fools Day joke, C# 9 is looking to addIn order to make pattern matching more flexible and powerful, C#’s designers want to add the concept of conjunctive, disjunctive, and negated patterns. Superficially, they l

Though it may sound like our occasionalApril Fools Day joke, C# 9 is looking to add and , or , and not to its list of keywords. Specifically, for use in pattern matching.

In order to make pattern matching more flexible and powerful, C#’s designers want to add the concept of conjunctive, disjunctive, and negated patterns. Superficially, they look just like Boolean operations where you want to match on both patterns (conjunctive), either pattern (disjunctive) or not match on a pattern (negated).

And that’s the problem. If you are working with Booleans, the && and || operators would be ambiguous; the compiler wouldn’t be able to determine if they are referring to values or patterns. To illustrate this idea, consider this disjunctive pattern:

if (myBool is true or false)

This would be interpreted as “true if myBool equals true or if myBool equals false”.

If we use the && and || operators for combining patterns, then we get this syntax:

if (myBool is true || false)

But this statement already means “true if myBool equals the result of (true or false)”. Or to simplify it, “true if myBool equals true”. Which is a completely different result than what we’d get with above disjunctive pattern.

Hence the new and, or, and not keywords are necessary to avoid ambiguity. You can learn more about them in Champion "and, or, and not patterns" . In the C# 9 feature status they are marked as being merged into the master branch.

One question frequently raised is whether or not the same variable can be declared multiple times. For example,

if ((e1, e2) is (0, int x) or (int x, 0))
{
    M(x);
}

In this theoretical example, the variable x is either e1 or e2 . This would be the equivalent of writing,

case (0, int x):
case (int x, 0):
    M(x);

In fact, you would have to declare x in both patterns for x to be definitely assigned . If you used the below code instead, either x or y wouldn’t have a value.

if ((e1, e2) is (0, int x) or (int y, 0))
{
    M(x);
    M(y);
}

In order to this problem, the current proposal says,

beneath a not or or, pattern variables may not be declared.

This may be reconsidered in future versions of C#.


以上所述就是小编给大家介绍的《C# 9: New `and`, `or`, and `not` Keywords for Pattern Matching》,希望对大家有所帮助,如果大家有任何疑问请给我留言,小编会及时回复大家的。在此也非常感谢大家对 码农网 的支持!

查看所有标签

猜你喜欢:

本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们

解码宇宙

解码宇宙

(美) 塞费 / 隋竹梅 / 上海科技教育出版社 / 2010-4 / 26.00元

《解码宇宙:新信息科学看天地万物》:宇宙,或许就是一台庞大的计算机。这是查尔斯·塞费在《解码宇宙:新信息科学看天地万物》中对宇宙做出的结论。作者从信息的特点开始谈起,详细论述了信息论和量子计算,向我们展示了一种不可思议的拜占庭式宇宙的情景,涉及生命的本质、热力学、相对论、量子力学、黑洞、多重宇宙,直至宇宙的命运。《解码宇宙:新信息科学看天地万物》资料翔实,内容丰富多彩,思路清晰,观点明确,读后使人......一起来看看 《解码宇宙》 这本书的介绍吧!

HTML 编码/解码
HTML 编码/解码

HTML 编码/解码

XML、JSON 在线转换
XML、JSON 在线转换

在线XML、JSON转换工具

HSV CMYK 转换工具
HSV CMYK 转换工具

HSV CMYK互换工具