Questions on window join

I am trying to see where the definitions stand AWAY from the example

Syntax

wj[w;c;t;(q;(f0;c0);(f1;c1))]

where:

  • t and q are the unkeyed tables to be joined. q should be sorted symtime with p#</tt>&nbsp;on sym Why does the defn have sym `time mentioned bycol names. aj said any sortable column… as wj claims to be a generalization of aj
  • w is a pair of lists of times/timestamps, begin and end How many elements can the outer list have ? Each of the inner list can have how many elements ? In the example , it has 3 elements in the inner list ? Very confused by the inner list.
  • c are the names of the two common columns, syms and times Is c is list ? Can it have more than 2 columns . It just 2 columns because there is just f0/f1 ?
  • f0,f1 are aggregation functions applied to values in q columns c0,c1 over the intervals Are f0/f1 monads on lists ? can there be only 2 functions ?