// cppawk: C preprocessor wrapper around awk
// Kaz Kylheku <kaz@kylheku.com>
//
// BSD-2 License
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
//    this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice,
//    this list of conditions and the following disclaimer in the documentation
//    and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.

#ifndef __CPPAWK_ITER_H
#define __CPPAWK_ITER_H

#ifndef __CPPAWK_BASE_H
#include "base.h"
#endif

#ifndef __CPPAWK_NARG_PRIV_H
#include "narg-priv.h"
#endif

#define doarray(key, value, arr)                                             \
  for (key in arr)                                                           \
    if ((value = arr[key]) || 1)

#define dostring(index, chr, str)                                             \
  __g(s) = str;                                                               \
  __g(l) = length(__g(s));                                                    \
  for (index = 1; index <= __g(l); i++)                                       \
     if ((chr = substr(__g(s), index, 1)) || 1)

#define dofields(index, val)                                                  \
  for (index = 1; index <= NF; index++)                                       \
    if ((val = $ index) || 1)

#ifndef __CPPAWK_CONS_H
#include "cons.h"
#endif

#define loop(...) for (__loop_init(__VA_ARGS__);                              \
                       (__loop_test(__VA_ARGS__) ||                           \
                        __loop_fini(__VA_ARGS__)) &&                          \
                       __loop_prep(__VA_ARGS__);                              \
                       __loop_step(__VA_ARGS__))

#define __loop_init(...) prog(__varexpand(__init_first, __init_next,          \
                                          __VA_ARGS__))
#define __loop_test(...) __and(__varexpand(__test_first, __test_next,         \
                                           __VA_ARGS__))
#define __loop_prep(...) prog(__varexpand(__prep_first, __prep_next,          \
                                          __VA_ARGS__))
#define __loop_fini(...) prog(__varexpand(__fini_first, __fini_next,          \
                                          __VA_ARGS__)) && 0
#define __loop_step(...) prog(__varexpand(__step_first, __step_next,          \
                                          __VA_ARGS__))

#define __and(...)      __varexpand(__nd_first, __nd_next, __VA_ARGS__)
#define __nd_first(x)   (x)
#define __nd_next(p, x) p && (x)

#define loop_cross(...) __varexpand2(__cross_first, __cross_next, __VA_ARGS__)

#define __cross_first(args) for (__init_ ## args;                             \
                                 ((__test_ ## args) ||                        \
                                  (__fini_ ## args) && 0) &&                  \
                                  __prep_ ## args;                            \
                                 __step_ ## args)
#define __cross_next(prev, args) prev __cross_first(args)

#define __init_first(args) __init_ ## args
#define __init_next(prev, args) prev, __init_ ## args

#define __test_first(args) __test_ ## args
#define __test_next(prev, args) prev, __test_ ## args

#define __prep_first(args) __prep_ ## args
#define __prep_next(prev, args) prev, __prep_ ## args

#define __fini_first(args) __fini_ ## args
#define __fini_next(prev, args) prev, __fini_ ## args

#define __step_first(args) __step_ ## args
#define __step_next(prev, args) prev, __step_ ## args

#define __init_str(idx, ch, str) idx = 1
#define __test_str(idx, ch, str) idx <= length(str)
#define __prep_str(idx, ch, str) ch = substr(str, idx, 1)
#define __fini_str(idx, ch, str) 1
#define __step_str(idx, ch, str) idx++

#define __init_range(idx, from, to) idx = (from)
#define __test_range(idx, from, to) idx <= (to)
#define __prep_range(idx, from, to) 1
#define __fini_range(idx, from, to) 1
#define __step_range(idx, from, to) idx++

#define __init_range_step(idx, from, to, step) idx = (from)
#define __test_range_step(idx, from, to, step) idx <= (to)
#define __prep_range_step(idx, from, to, step) 1
#define __fini_range_step(idx, from, to, step) 1
#define __step_range_step(idx, from, to, step) idx += (step)

#define __init_from(idx, from) idx = (from)
#define __test_from(idx, from) 1
#define __prep_from(idx, from) 1
#define __fini_from(idx, from) 1
#define __step_from(idx, from) idx++

#define __init_from_step(idx, from, step) idx = (from)
#define __test_from_step(idx, from, step) 1
#define __prep_from_step(idx, from, step) 1
#define __fini_from_step(idx, from, step) 1
#define __step_from_step(idx, from, step) idx += (step)

#define __init_first_then(var, first, then) (var = (first))
#define __test_first_then(var, first, then) 1
#define __prep_first_then(var, first, then) 1
#define __fini_first_then(var, first, then) 1
#define __step_first_then(var, first, then) (var = (then))

#define for_var(var, expr) first_then(var, expr, expr)

#define __init_list(iter, var, list) iter = (list)
#define __test_list(iter, var, list) !endp(iter)
#define __prep_list(iter, var, list) var = car(iter)
#define __fini_list(iter, var, list) 0
#define __step_list(iter, var, list) iter = cdr(iter)

#define __init_fields(var) __g(var) = 1
#define __test_fields(var) __g(var) <= NF
#define __prep_fields(var) var = $ __g(var)
#define __fini_fields(var) 1
#define __step_fields(var) __g(var)++

#define __init_keys(key, array) __g(key) = keys(array)
#define __test_keys(key, array) !endp(__g(key))
#define __prep_keys(key, array) key = car(__g(key))
#define __fini_keys(key, array) 1
#define __step_keys(key, array) __g(key) = cdr(__g(key))

#define __init_collect(var, expr) var = list_begin()
#define __test_collect(var, expr) 1
#define __prep_collect(var, expr) var = list_add(var, expr)
#define __fini_collect(var, expr) var = list_end(var)
#define __step_collect(var, expr) 1

#define __init_collect_plus(var, expr) var = list_begin()
#define __test_collect_plus(var, expr) 1
#define __prep_collect_plus(var, expr) var = list_add(var, expr)
#define __fini_collect_plus(var, expr) var = list_end(list_add(var, expr))
#define __step_collect_plus(var, expr) 1

#define __init_summing(var, expr) var = 0
#define __test_summing(var, expr) 1
#define __prep_summing(var, expr) var += (expr)
#define __fini_summing(var, expr) 1
#define __step_summing(var, expr) 1

function __loop_max(a, b)
{
  return a > b ? a : b
}

#define __init_maximizing(var, expr) var = nil
#define __test_maximizing(var, expr) 1
#define __prep_maximizing(var, expr) var = (null(var)                         \
                                            ?  expr                           \
                                            : __loop_max(var, expr))
#define __fini_maximizing(var, expr) 1
#define __step_maximizing(var, expr) 1

function __loop_min(a, b)
{
  return a > b ? b : a
}

#define __init_minimizing(var, expr) var = nil
#define __test_minimizing(var, expr) 1
#define __prep_minimizing(var, expr) var = (null(var)                         \
                                            ?  expr                           \
                                            : __loop_min(var, expr))
#define __fini_minimizing(var, expr) 1
#define __step_minimizing(var, expr) 1

function __loop_argmax(a, arga, b, argb)
{
  return a > b ? arga : argb;
}

#define __init_argmax(amx, arg, expr) (__g(mx) = 0) || (amx = 0)
#define __test_argmax(amx, arg, expr) 1
#define __prep_argmax(amx, arg, expr) ((__g(om) = __g(mx)) || 1) &&           \
                                      ((__g(mx) =                             \
                                        (null(__g(mx))                        \
                                         ? expr                               \
                                         : __loop_max(__g(mx),                \
                                                      expr))) || 1) &&        \
                                      ((__g(om) != __g(mx)) ? amx = arg : 1)
#define __fini_argmax(amx, arg, expr) 1
#define __step_argmax(amx, arg, expr) 1

function __loop_argmin(a, arga, b, argb)
{
  return a < b ? arga : argb;
}

#define __init_argmin(ami, arg, expr) (__g(mi) = 0) || (ami = 0)
#define __test_argmin(ami, arg, expr) 1
#define __prep_argmin(ami, arg, expr) ((__g(om) = __g(mi)) || 1) &&           \
                                      ((__g(mi) =                             \
                                        (null(__g(mi))                        \
                                         ? expr                               \
                                         : __loop_min(__g(mi),                \
                                                      expr))) || 1) &&        \
                                      ((__g(om) != __g(mi)) ? ami = arg : 1)
#define __fini_argmin(ami, arg, expr) 1
#define __step_argmin(ami, arg, expr) 1

#define __init_while(expr) 1
#define __test_while(expr) expr
#define __prep_while(expr) 1
#define __fini_while(expr) 1
#define __step_while(expr) 1

#define __init_until(expr) 1
#define __test_until(expr) !(expr)
#define __prep_until(expr) 1
#define __fini_until(expr) 1
#define __step_until(expr) 1

#define __init_lockstep(...) prog(__varexpand3(__init_first, __init_next,     \
                                               __VA_ARGS__))
#define __test_lockstep(...) __and(__varexpand3(__test_first, __test_next,    \
                                                __VA_ARGS__))
#define __prep_lockstep(...) (__and(__varexpand3(__prep_first, __prep_next,   \
                                                 __VA_ARGS__)) || 1)
#define __fini_lockstep(...) (__and(__varexpand3(__fini_first, __fini_next,   \
                                                 __VA_ARGS__)) && 0)
#define __step_lockstep(...) prog(__varexpand3(__step_first, __step_next,     \
                                               __VA_ARGS__))

#define __init_if(test, clause) __init_ ## clause
#define __test_if(test, clause) !(test) || __test_ ## clause
#define __prep_if(test, clause) (test) && __prep_ ## clause
#define __fini_if(test, clause) __fini_ ## clause
#define __step_if(test, clause) (test) && __step_ ## clause

#endif