Higher-order functions: Difference between revisions
Content added Content deleted
| Line 2,643: | Line 2,643: | ||
result := x [ Low ( x ) ] ; |
result := x [ Low ( x ) ] ; |
||
FOR k := Low ( x ) TO High ( x ) DO |
FOR k := Low ( x ) + 1 TO High ( x ) DO |
||
result := f ( result , x [ k ] ) ; |
result := f ( result , x [ k ] ) ; |
||
| Line 2,660: | Line 2,660: | ||
result := x [ Low ( x ) ] ; |
result := x [ Low ( x ) ] ; |
||
FOR k := Low ( x ) TO High ( x ) DO |
FOR k := Low ( x ) + 1 TO High ( x ) DO |
||
result := f ( result , x [ k ] ) ; |
result := f ( result , x [ k ] ) ; |
||
| Line 2,685: | Line 2,685: | ||
BEGIN |
BEGIN |
||
result := x [ High ( x ) ] ; |
|||
FOR k := High ( x ) DOWNTO Low ( x ) DO |
FOR k := High ( x ) - 1 DOWNTO Low ( x ) DO |
||
result := f ( result , x [ k ] ) ; |
result := f ( result , x [ k ] ) ; |
||
| Line 2,705: | Line 2,705: | ||
result := x [ High ( x ) ]; |
result := x [ High ( x ) ]; |
||
FOR k := High ( x ) DOWNTO Low ( x ) DO |
FOR k := High ( x ) - 1 DOWNTO Low ( x ) DO |
||
result := f ( result , x [ k ] ) ; |
result := f ( result , x [ k ] ) ; |
||
END ; |
END ; |
||