Built-ins for sequences
chunk
This built-in splits a sequence into multiple sequences of the size given with the 1st parameter to the built-in (like mySeq?chunk(3)
). The result is the sequence of these sequences. The last sequence is possibly shorter than the given size, unless the 2nd parameter is given (like mySeq?chunk(3, '-')
), that is the item used to make up the size of the last sequence to the given size. Example:
The output will be:
This built in is mostly for outputting sequnces in tabular/columnar format. When used with HTML tables, the 2nd parameter is often "\xA0"
(that is the code of the no-break space character, also known as “nbsp”), so the border of the empty TD-s will not be missing.
The 1st parameter must be a number that is at least 1. If the number is not integer, it will be silently rounded down to integer (i.e. both 3.1 and 3.9 will be rounded to 3). The 2nd parameter can be of any type and value.
drop_while
Returns a new sequence that contains the elements from the input sequence starting with from the first element that does not match the parameter predicate (condition). After that, all elements are included, regardless if they match the predicate or not. See the filter
built-in for more details about parameters, and other details, but note that the condition in filter
has opposite meaning (what to keep, instead of what to drop).
Example and comparison with filter
:
As you can see, drop_while
has stopped dropping the elements once it ran into the first element that didn’t match the predicate (x > 0
). On the other hand, filter keeps the elements that match the same predicate, and it doesn’t stop.
See also: take_while built-in
filter
Returns a new sequence that only contains the elements for which the parameter condition (the predicate) returns true
. For example:
This built-in has a single required parameter, the predicate (filter condition, what to keep). The predicate can be specified in 3 ways:
-
As a single argument lambda expression:
element -> predicate
. In that,element
is the variable name with which you can refer to the current element in thepredicate
, and thepredicate
is an arbitrarily complex expression that must return a boolean value (true
orfalse
). An example this was shown above. Note again the predicates can be arbitrarily complex, like the predicate inproducts?filter(product -> product.discounted && !user.hasBought(product))
. -
As a function or method that has a single argument, and returns boolean. For example, the “Negatives” example above could be implemented like this:
Note how we just referred to the function by name, and did not call it. Similarly, if you have a Java object called utils
in the data-model, and it has a boolean isNegative(Number n)
method, then you could use that like xs?filter(utils.isNegative)
.
Remember, the condition (predicate) that you specify tells what to keep, not what to filter out! That is, the element will be in the result sequence when you return
true
, not when you returnfalse
. (It’s like the WHERE condition in SQL, if you know that.)
While filter
is most often used in the list directive, naturally it can be used anywhere where a filtered sequence is needed, and so this works as well:
Note however, that for a very long sequences, the above solution can consume significantly more memory. That’s because <list seq?filter(pred) ...>
is optimized to do filtering without building an intermediate filtered sequence, while the n above example, assign
will first build the whole filtered sequence in memory, and we pass that filtered sequence later to list
. But again, this only matters for very long sequences.
See also: take_while built-in, drop_while built-in
Lazy evaluation and its consequences
Identical rules apply to these built-ins as well: map(mapper), take_while(predicate), drop_while(predicate).
To optimize processing, filter
might delays fetching the elements of the input sequence, and applying the predicate on them. But it’s guaranteed that those operations are not delayed past the point where the execution of the directive or interpolation, whose parameter contains the seq?filter(predicate)
, is finished. Some examples:
-
In the case of
<list seq?filter(predicate) ...>nested content</#list>
, when the execution enters thenested content
, it’s not true that all elements ofseq
was already consumed and filtered. Consuming and filteringseq
is instead done bit by bit aslist
repeats the nested content. But it’s guaranteed that past the</#list>
tag (the end of the execution of thelist
directive), there are no delayed readings ofseq
, or delayed evaluation of thepredicate
. So avoid changing a such variable (or other system state) in the nested content oflist
, which influences the result of thepredicate
. Doing so could change the filtering for the rest of theseq
. -
In the case of
<#assign filteredSeq = seq?filter(predicate)>
it’s guaranteed that all elements ofseq
were processed, and thuspredicate
won’t be evaluated after theassign
directive. -
In the case of
${seq?filter(predicate)?join(', ')}
it’s guaranteed that all elements ofseq
were processed, and thuspredicate
won’t be evaluated after theassign
directive.
Inside expressions however, there’s no promise regarding when the elements are consumed and when the predicate is evaluated. Like in the case of seq?filter(predicate1)?filter(predicate2)
, it’s not guaranteed that predicate1
will only be evaluated before predicate2
. (Most likely they will be called alternately: predicate1
for the 1st element, then predicate2
for the 1st element, then predicate1
for the 2nd element, then predicate2
for the 2nd element, and so on.)
If you pass a filtered sequence to a custom directive (a macro) or function or method, as in <@myMacro seq?filter(predicate) />
or myFunction(seq?filter(predicate))
, then it’s guaranteed that the filtering is not delayed past the point when the custom directive/function/method is invoked. That is, your macro/function/method will aways receive a fully constructed filtered sequence.
Also note that in it’s not guaranteed that all elements of the input sequence will be read, and therefore that the predicate will be evaluated for all elements. Some examples of such cases:
-
You may break out from
<list seq?filter(predicate) ...>
before it reaches the last element, in which case the rest of theseq
elements won’t be fetched and filtered. -
In the case of
seq?filter(predicate)[2]
, which reads the 3rd element of the filtered sequence, FreeMarker stops fetching and filtering the elements ofseq
when we have found the 3rd element that matches thepredicate
. -
In the case of
seq?filter(predicate)?size != 0
, which tells whether the filtered sequence is non-empty, we stop fetching and filtering the elements ofseq
when we have found the 1st element that matches thepredicate
. (That’s certainly surprising as?size
needs to process the whole sequence to tell the size. But in this case FreeMarker notices that we don’t really need the exact size.)
Filtering missing (null
) values
The argument to a lambda expression can hold the missing (Java null
) value, and reading such value will not fall back to a higher scope. Thus, something like seq?filter(it -> it??)
, which filters out missing element from the sequence, will work reliably.
first
Returns the first item of the sequence. Thus value?first
is the same as value[0]
, except that value?first
also works if value
doesn’t support getting items with numerical index, but still supports to be listed (i.e., with FTL collection values).
If the sequence or collection is empty, the result will be a missing value (as in empty?first!'No item was found'
).
join
Concatenates the items of a sequence to a single string, with the given separator. For example:
will output:
Sequence items that are not strings will be converted to string with the same conversion rules as of ${...}
(except, of course, no automatic escaping is applied at this stage).
?join(...)
can have up to 3 parameters:
-
Separator, required: The string that is inserted between items
-
Empty value, defaults to
""
(empty string): The value used if the sequence contains no items. -
List ending, defaults to
""
(empty string): The value printed after the last value, if the list sequence wasn’t empty.
So this (where []
means an empty sequence):
will output:
last
The last subvariable of the sequence. Template processing will die with error if the sequence is empty.
map
Returns an new sequence where all elements are replaced with the result of the parameter lambda, function, or method. For example, you have a list of user objects in users
, but instead you need a list of user names in variable, then you could do this:
The parameter work like the parameter of the with filter built-in, except that the lambda/function/method you specify can return values of any type.
Regarding lazy evaluation, and handling of very long inputs, it also works on the same way as the filter built-in.
min, max
Returns the smaller (min
) or greatest (max
) item of the sequence (or collection). The items must be either all numbers, or all date/time values of the same kind (date-only, time-only, date-time), or else a comparison error will occur. These are the same restrictions as for the < and > operators.
Missing items (i.e. null
-s) will be silently ignored. If the sequence is empty or it only contains missing (null
) items, the result itself will be missing.
Example:
reverse
The sequence with reversed order.
seq_contains
The
seq_
prefix is required in the built-in name to differentiate it from thecontains
built-in that searches a substring in a string (since a variable can be both string and sequence on the same time).
Tells if the sequence contains the specified value (according the == operator of the template language). It has 1 parameter, the value to find. Example:
The output will be:
To find the value the built-in uses FreeMarker’s comparison rules (as if you was using == operator), except that comparing two values of different types or of types for which FreeMarker doesn’t support comparison will not cause error, just will be evaluated as the two values are not equal. Thus, you can use it only to find scalar values (i.e. string, number, boolean or date/time values). For other types the result will be always false
.
For fault tolerance, this built-in also works with collections.
seq_index_of
The
seq_
prefix is required in the built-in name to differentiate it from theindex_of
built-in that searches a substring in a string (since a variable can be both string and sequence on the same time).
Returns the index of the first occurrence of a value in the sequence, or -1 if the sequence doesn’t contain the specified value. The value to find is specified as the first parameter. For example this template:
will output this:
To find the value the built-in uses FreeMarker’s comparison rules (as if you was using == operator), except that comparing two values of different types or of types for which FreeMarker doesn’t support comparison will not cause error, just will be evaluated as the two values are not equal. Thus, you can use it only to find scalar values (i.e. string, number, boolean or date/time values). For other types the result will be always -1
.
The index where the searching is started can be optionally given as the 2nd parameter. This may be useful if the same item can occur for multiple times in the same sequence. There is no restriction on the numerical value of the second parameter: if it is negative, it has the same effect as if it were zero, and if it is greater than the length of the sequence, it has the same effect as if it were equal to the length of the sequence. Decimal values will be truncated to integers. For example:
will output this:
seq_last_index_of
The
seq_
prefix is required in the built-in name to differentiate it from thelast_index_of
built-in that searches a substring in a string (since a variable can be both string and sequence on the same time).
Returns the index of the last occurrence of a value in the sequence, or -1 if the sequence doesn’t contain the specified value. That is, it is the same as seq_index_of
, just it searches backward starting from the last item of the sequence. It also supports the optional 2nd parameter that specifies the index where the searching is started. For example:
will output this:
size
The number of sub variables in sequence (as a numerical value). The highest possible index in sequence s
is s?size - 1
(since the index of the first subvariable is 0) assuming that the sequence has at least one subvariable.
sort
Returns the sequence sorted in ascending order. (For descending order use this and then the reverse
built-in.) This will work only if all sub variables are strings, or if all sub variables are numbers, or if all sub variables are date values (date, time, or date+time), or if all sub variables are booleans (since 2.3.17). If the sub variables are strings, it uses locale (language) specific lexical sorting (which is usually not case sensitive). For example:
will print (with US locale at least):
sort_by
Returns the sequence of hashes sorted by the given hash subvariable in ascending order. (For descending order use this and then the reverse
built-in.) The rules are the same as with the sort built-in, except that the sub variables of the sequence must be hashes, and you have to give the name of a hash subvariable that will decide the order. For example:
will print (with US locale at least):
If the subvariable that you want to use for the sorting is on a deeper level (that is, if it is a subvariable of a subvariable and so on), then you can use a sequence as parameter, that specifies the names of the sub variables that lead down to the desired subvariable. For example:
will print (with US locale at least):
take_while
Returns a sequence that only contains the elements of the input sequence which are before the first element that doesn’t match the parameter predicate (filter condition). This is very similar to the filter
built-in, so see further details there.
Example and comparison with filter
:
As you can see, take_while
has stopped at the first number that didn’t match the predicate (x > 0
), while filter
has continued finding further matches.
See also: drop_while
built-in