Anonymous user
Higher-order functions: Difference between revisions
m
{{header|Lily}} Update for current version.
m (→{{header|REXX}}: changed the comment describing the program.) |
m ({{header|Lily}} Update for current version.) |
||
Line 1,598:
=={{header|Lily}}==
▲<lang lily>define f(x: integer, y: integer)
{
return x
}
var l = [1, 2, 3] # Inferred type: List[Integer].
#
print(l.map(square)) # [1, 4, 9]
#
print(l.map(Integer.to_s)) # ["1", "2", "3"]
# Using a lambda (with the type of 'x' properly inferred).
print(l.map{|x| (x + 1).to_s()}) # ["2", "3", "4"]
# In reverse order using F#-styled pipes.
Boolean.to_i |> [true, false].map |> print
define apply[A, B](value: A, f: Function(A => B)): B
{
return f(
}
# Calling user-defined transformation.
print(apply("123", String.parse_i)) # Some(123)</lang>
=={{header|Lua}}==
|