WET Dilutes Performance Bottlenecks

Posted jhcelue

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了WET Dilutes Performance Bottlenecks相关的知识,希望对你有一定的参考价值。

WET Dilutes Performance Bottlenecks

Kirk Pepperdine

THE IMPORTANCE OF THE DRY PRINCIPLE (Don’t Repeat Yourself) is that it codifies the idea that every piece of knowledge in a system should have a singular representation. In other words, knowledge should be contained in a single implementation. The antithesis of DRY is WET (Write Every Time). Our code is WET when knowledge is codified in several different implemen- tations. The performance implications of DRY versus WET become very clear when you consider their numerous effects on a performance profile.
Let’s start by considering a feature of our system, say X, that is a CPU bottle- neck. Let’s say feature X consumes 30% of the CPU. Now let’s say that feature X has 10 different implementations. On average, each implementation will consume 3% of the CPU. As this level of CPU utilization isn’t worth worrying about if we are looking for a quick win, it is likely that we’d miss that this fea- ture is our bottleneck. However, let’s say that we somehow recognized feature X as a bottleneck. We are now left with the problem of finding and fixing every single implementation. With WET, we have 10 different implementations that we need to find and fix. With DRY, we would clearly see the 30% CPU utiliza- tion and would have a tenth of the code to fix. And did I mention that we don’t have to spend time hunting down each implementation?


There is one use case where we are often guilty of violating DRY: our use of collections. A common technique to implement a query would be to iterate over the collection and then apply the query in turn to each element:

  public class UsageExample {
        private ArrayList<Customer> allCustomers = new ArrayList<Customer>();
        // ...
        public ArrayList<Customer> findCustomersThatSpendAtLeast(Money amount) {
            ArrayList<Customer> customersOfInterest = new ArrayList<Customer>();
            for (Customer customer: allCustomers) {
                if (customer.spendsAtLeast(amount))

?

customersOfInterest.add(customer);
            }
            return customersOfInterest;
        }
}

By exposing this raw collection to clients, we have violated encapsulation. This not only limits our ability to refactor, but it also forces users of our code to vio- late DRY by having each of them reimplement potentially the same query. This situation can easily be avoided by removing the exposed raw collections from the API. In this example, we can introduce a new, domain-specific collective type called CustomerList. This new class is more semantically in line with our domain. It will act as a natural home for all our queries.
Having this new collection type will also allow us to easily see if these queries are a performance bottleneck. By incorporating the queries into the class, we eliminate the need to expose representation choices, such as ArrayList, to our clients. This gives us the freedom to alter these implementations without fear of violating client contracts:

    public class CustomerList {
        private ArrayList<Customer> customers = new ArrayList<Customer>();
        private SortedList<Customer> customersSortedBySpendingLevel =
                new SortedList<Customer)();
        // ...
        public CustomerList findCustomersThatSpendAtLeast(Money amount) {
return new CustomerList( customersSortedBySpendingLevel.elementsLargerThan(amount));
} }
    public class UsageExample {
        public static void main(String[] args) {
            CustomerList customers = new CustomerList();
            // ...
            CustomerList customersOfInterest =
// ... }
}

customers.findCustomersThatSpendAtLeast(someMinimalAmount);
In this example, adherence to DRY allowed us to introduce an alternate index- ing scheme with SortedList keyed on our customers’ level of spending. More important than the specific details of this particular example, following DRY helped us to find and repair a performance bottleneck that would have been more difficult to find had the code been WET.

以上是关于WET Dilutes Performance Bottlenecks的主要内容,如果未能解决你的问题,请参考以下文章

Codeforces Round #341 Div.2 C. Wet Shark and Flowers

wet 下载jdk 64位

codeforces 621B Wet Shark and Bishops

Codeforces Round #341 (Div. 2) E. Wet Shark and Blocks(矩阵优化DP)

矩阵乘法&&dp加速矩阵的思路(E. Wet Shark and Blocks)

Wet Shark and Bishops(思维)