An Abstract Description Method of Map-Reduce-Merge Using Haskell

<table><tr><td><table class="algorithm" id="alg10"><tr><td colspan="2"><i>getPair lTablet rTablet = </i></td></tr><tr><td colspan="2"><i> <i> </i>filter </i>(<i>uncurry iterationLogic</i>)                  <i>  – Step  </i>2</td></tr><tr><td colspan="2">  <i>  </i><svg height="14.85" id="M66" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M290 -163h-170v866h170v-28q-79 -7 -94 -19.5t-15 -72.5v-627q0 -59 14.5 -71.5t94.5 -19.5v-28z" id="x5B"></path></g>
</svg>(<i>pairLeft, pairRight</i>) ∣<i> pairLeft  </i><svg height="7.6374998" id="M67" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 21.0625 7.6374998" width="21.0625" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.575)"><path d="M885 230h-727l102 -147l-22 -15q-114 125 -185 187q71 62 185 187l22 -15l-102 -147h727v-50z" id="x2190"></path></g>
</svg><i> toList lTablet, pairRight  </i><svg height="7.6374998" id="M68" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 21.0625 7.6374998" width="21.0625" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.575)"><path d="M885 230h-727l102 -147l-22 -15q-114 125 -185 187q71 62 185 187l22 -15l-102 -147h727v-50z" id="x2190"></path></g>
</svg><i> toList rTablet </i><svg height="14.85" id="M69" style="vertical-align:-1.95624pt" version="1.1" viewbox="0 0 5.9875002 14.85" width="5.9875002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M226 -163h-170v27q79 7 94 20t15 73v627q0 59 -15 72t-94 20v27h170v-866z" id="x5D"></path></g>
</svg> <i> – Step  </i>1</td></tr></table></td></tr></table>

Mathematical Problems in Engineering

alg10

Algorithm 10

Algorithm 10: An Abstract Description Method of Map-Reduce-Merge Using Haskell 