tree/reduce

l o s


Summary

C<span class="arg-ref" arg-i="2">ospan>mbine a<span class="arg-ref" arg-i="1">lspan><span class="arg-ref" arg-i="1">lspan> e<span class="arg-ref" arg-i="1">lspan>ements in <span class="arg-ref" arg-i="1">lspan> using <span class="arg-ref" arg-i="2">ospan>perati<span class="arg-ref" arg-i="2">ospan>n <span class="arg-ref" arg-i="2">ospan> and starting va<span class="arg-ref" arg-i="1">lspan>ue s

Bytecode

Probably only interesting to you if you want to understand more about the Nujel VM or care very much about performance.

(    0 ($get/val 'list/reduce))
(    2 ($get/val 'tree/values))
(    4 ($get/val 'l))
(    6 ($apply 1))
(    8 ($get/val 'o))
(   10 ($get/val 's))
(   12 ($apply 3))
(   14 ($ret))