重构26-Remove Double Negative（去掉双重否定）

尽管我在很多代码中发现了这种严重降低可读性并往往传达错误意图的坏味道，但这种重构本身还是很容易实现的。这种毁灭性的代码所基于的假设导致了错误的代码编写习惯，并最终导致bug。如下例所示：

public class Order {public void Checkout(List<Product> products, Customer customer) {if (!customer.getNotFlagged()) {// the customer account is flagged            // log some errors and return            return;        }// normal order processing    }}public class Customer {public Double Balance;    public Boolean IsNotFlagged;

    public Boolean getNotFlagged() {return Balance < 30d;    }public void setNotFlagged(Boolean notFlagged) {IsNotFlagged = notFlagged;    }}

如你所见，这里的双重否定十分难以理解，我们不得不找出什么才是双重否定所要表达的肯定状态。修改代码是很容易的。如果我们找不到肯定的判断，可以添加一个处理双重否定的假设，而不要在得到结果之后再去验证。

public class Order {public void Checkout(List<Product> products, Customer customer) {if (customer.getFlagged()) {// the customer account is flagged            // log some errors and return            return;        }// normal order processing    }}public class Customer {public Double Balance;    public Boolean IsFlagged;

    public Boolean getFlagged() {return Balance < 30d;    }public void setFlagged(Boolean Flagged) {IsFlagged = Flagged;    }}

来自为知笔记(Wiz)

转载于:https://www.cnblogs.com/jgig11/p/5786447.html

重构26-Remove Double Negative（去掉双重否定）相关推荐

Remove Double Negative（去除双重否定）
WHAT 双重否定的条件语句,可以使用一个肯定的条件语句代替记住:双重否定 = 肯定本次重构涉及到的基本重构手法: Extract Method(提炼方法) Inline Method(内联方法) ...
重构第26天移除双重否定(Remove Double Negative)
理解:"移除双重否定"是指把代码中的双重否定语句修改成简单的肯定语句,这样即让代码可读,同时也给维护带来了方便. 详解:避免双重否定重构本身非常容易实现,但我们却在太多的代码中见过 ...
LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] c++
LeetCode 26 Remove Duplicates from Sorted Array [Array/std::distance/std::unique] <c++> 给出排序好的 ...
26. Remove Duplicates from Sorted Array【easy】
26. Remove Duplicates from Sorted Array[easy] Given a sorted array, remove the duplicates in place s ...
Leet Code OJ 26. Remove Duplicates from Sorted Array [Difficulty: Easy]
题目: Given a sorted array, remove the duplicates in place such that each element appear only once and ...
LeetCode 26. Remove Duplicates from Sorted Array
题目: Given a sorted array, remove the duplicates in place such that each element appear only once and ...
leetcode 283 Move Zeros; 27 Remove Elements; 26 Remove Duplicated from Sorted Array;
int arr[] = {0,1,0,3,12}; //把数组的值赋给vector vector<int> vec(arr, arr+sizeof(arr)/sizeof(int)); 解 ...
leetcode python3 简单题26. Remove Duplicates from Sorted Array
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第二十六题 (1)题目英文: Given a sorted array nums, ...
leetCode #26 Remove Duplicates from Sorted Array
删除相同数字 1 class Solution { 2 public: 3 int removeDuplicates(vector<int>& nums) { 4 int coun ...

重构26-Remove Double Negative（去掉双重否定）

重构26-Remove Double Negative（去掉双重否定）相关推荐

最新文章

热门文章