mean(), anyNA(), and members of "Summary" group generic should "untranspose"

先找出 DelayedArray 物件的 mean()、anyNA() 與 "Summary" 群組泛型的實作，接著檢查 DelayedAperm 與 simplify()。追蹤 issue 中描述的延遲操作主幹，並判斷如何在計算前套用反向 aperm()。當簡化縮短樹狀結構時，這些操作仍能保留其結果，同時避免不必要的延遲轉置，即表示完成。

Delayed transposition (t() or aperm()) significantly slows down block processing of a DelayedMatrix or DelayedArray object. However the result of block-processed operations like mean(), anyNA(), and members of the "Summary" group generic does not change if the input is transposed. So these operations should be smart enough to "untranspose" their input in order to be faster.

The exact algorithm for "untransposing" could be:

• Go up the tree of delayed ops in x until a DelayedAperm op is found. Only climb the trunk of the tree i.e. start from x@seed and go up only if there is exactly 1 "next seed", that is, if the current seed is a DelayedUnaryOp object. Stop on the first DelayedAperm op (i.e. the most recently applied DelayedAperm op), or when the next seed is no longer a DelayedUnaryOp object.
• If no DelayedAperm op was found then there is nothing to do.
• If a DelayedAperm op is found, do y <- aperm(x, ....) where the exact aperm() transformation is the reverse of this DelayedAperm op. The tree trunk in y should be either shorter than the tree trunk in x (if the 2 DelayedAperm ops could be simplified) or longer (if they couldn't). If it's shorter then replace x with y before computing mean(), anyNA(), etc...

The advantage of this algo is that it doesn't need to know anything about the delayed ops found between the root of the tree and the first DelayedAperm op found on the trunk. It just relies on simplify().