static int
arr_exec(strm_stream* strm, strm_value data)
{
struct array_data *arrd = strm->data;
if (arrd->n == strm_ary_len(arrd->arr)) {
strm_stream_close(strm);
return STRM_OK;
}
strm_emit(strm, strm_ary_ptr(arrd->arr)[arrd->n++], arr_exec);
return STRM_OK;
}
static int
iter_take(strm_stream* strm, strm_value data)
{
struct take_data* d = strm->data;
strm_emit(strm, data, NULL);
d->n--;
if (d->n == 0) {
strm_stream_close(strm);
}
return STRM_OK;
}
static int
gen_seq(strm_stream* strm, strm_value data)
{
struct seq_data* d = strm->data;
if (d->end > 0 && d->n > d->end) {
strm_stream_close(strm);
return STRM_OK;
}
strm_emit(strm, strm_int_value(d->n), gen_seq);
d->n += d->inc;
return STRM_OK;
}
static int
gen_repeat(strm_stream* strm, strm_value data)
{
struct repeat_data *d = strm->data;
d->count--;
if (d->count == 0) {
strm_emit(strm, d->v, NULL);
strm_stream_close(strm);
}
else {
strm_emit(strm, d->v, gen_repeat);
}
return STRM_OK;
}
static int
iter_bar(strm_stream* strm, strm_value data)
{
struct bar_data* d = strm->data;
double f, max = 1.0;
if (interrupt) {
interrupt = FALSE;
strm_unsignal(SIGINT, sigupdate);
move_cursor(d->row-1, 1);
show_cursor();
exit(1);
}
if (!strm_number_p(data)) {
strm_raise(strm, "invalid data");
return STRM_NG;
}
if (winch) {
winch = FALSE;
free(d->data);
if (init_bar(d) == STRM_NG) {
strm_stream_close(strm);
return STRM_NG;
}
}
f = strm_value_float(data);
if (f < 0) f = 0;
d->data[d->offset++] = f;
max = 1.0;
for (int i=0; i<d->dlen; i++) {
f = d->data[i];
if (f > max) max = f;
}
d->max = max;
if (d->offset == d->dlen) {
d->offset = 0;
}
show_graph(d);
return STRM_OK;
}
static int
gen_cycle(strm_stream* strm, strm_value data)
{
struct cycle_data *d = strm->data;
strm_value* p;
strm_int i, len;
d->count--;
p = strm_ary_ptr(d->ary);
len = strm_ary_len(d->ary);
if (d->count != 0) {
len--;
}
for (i=0; i<len; i++) {
strm_emit(strm, p[i], NULL);
}
if (d->count == 0) {
strm_stream_close(strm);
}
else {
strm_emit(strm, p[i], gen_cycle);
}
return STRM_OK;
}
