1.1

jaq is a jq clone with an emphasis on correctness, speed, and simplicity.

The largest change in jaq 1.1 is the support for filter arguments in recursive filters. This means that you can now write something like:

def repeat(f): f, repeat(f); repeat(1, 2)

However, unlike in jq, this specific example will currently fail with a stack overflow after a certain number of values (about 12,000 on my machine). To address this issue, tail-call optimisation is necessary, which is planned to be supported in jaq 1.2.

Furthermore, several expressions that were evaluated strictly are now evaluated lazily, in particular cartesian products and objects.
That means that some filters that would previously never yield any input, now can yield an infinite number of inputs.

The API of jaq 1.1 is fully backwards compatible with the API of jaq 1.0.

Full Changelog: v1.0.0...v1.1.0