"def sort_by(f): _sort_by_impl(map([f]));",
"def group_by(f): _group_by_impl(map([f]));",
"def unique: group_by(.) | map(.[0]);",
+ "def unique_by(f): group_by(f) | map(.[0]);",
"def max_by(f): _max_by_impl(map([f]));",
"def min_by(f): _min_by_impl(map([f]));",
#include "libm.h"
input: '[1,2,5,3,5,3,1,3]'
output: ['[1,2,3,5]']
+ - title: `unique_by`
+ body: |
+
+ The `unique_by(.foo)` function takes as input an array and produces
+ an array of the same elements, in sorted order, with
+ elqements with a duplicate `.foo` field removed. Think of it as making
+ an array by taking one element out of every group produced by
+ `group_by`.
+
+ examples:
+ - program: 'unique'
+ input: '[1,2,5,3,5,3,1,3]'
+ output: ['[1,2,3,5]']
+
+
- title: `reverse`
body: |