associative operation

基本解釋

This one is slightly more complicated but uses a Ruby hash (associative array) to simplify the reduction operation (see Listing 5).
雖然此應(yīng)用程序稍微有些復(fù)雜，但是使用 Ruby hash（關(guān)聯(lián)陣列）可簡(jiǎn)化 reduce 操作（請(qǐng)參考清單 5）。
The operation laws including:commutative law , associative law , cancellation law , unity of operation, inverse element, and distributive law between two operations, here we just omit them.
這些運(yùn)算律包括：交換律，結(jié)合律，消去律，運(yùn)算單位元，運(yùn)算逆元，兩個(gè)運(yùn)算之間的分配律等，在此不再一一說明詳細(xì)過程。
This idiom is an example of a mapping operation combined with a reduction or folding operation, whereby an associative operator (such as sum or max) is applied pairwise to a sequence of values.
該做法是與化簡(jiǎn)（reduce）或是折疊（fold）操作結(jié)合在一起的映射（map）操作的一個(gè)例子，某個(gè)關(guān)聯(lián)的運(yùn)算符（比如說sum或是max）憑此來成對(duì)地應(yīng)用一系列的值。