/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¡
â Copyright 2022 Justine Alexandra Roberts Tunney                              â
â                                                                              â
â Permission to use, copy, modify, and/or distribute this software for         â
â any purpose with or without fee is hereby granted, provided that the         â
â above copyright notice and this permission notice appear in all copies.      â
â                                                                              â
â THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL                â
â WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED                â
â WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE             â
â AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL         â
â DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR        â
â PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER               â
â TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR             â
â PERFORMANCE OF THIS SOFTWARE.                                                â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "tool/plinko/lib/cons.h"
#include "tool/plinko/lib/plinko.h"

struct Binding Bind(int x, int y, int a, int u, dword p1, dword p2) {
  int k, v, w;
  dword a1 = 0;
  while (x) {
    if (x < 0) {
      if (y <= 0) {
        k = Car(x), x = Cdr(x);
        v = Car(y), y = Cdr(y);
        if (k) {
          if (k > 0) {
            if (!a1) {
              a1 = MAKE(k, FasterRecurse(v, a, p1, p2));
            } else {
              u = Alist(k, FasterRecurse(v, a, p1, p2), u);
            }
          } else {
            u = pairlis(k, FasterRecurse(v, a, p1, p2), u);
          }
        }
      } else {
        u = pairlis(x, FasterRecurse(y, a, p1, p2), u);
        y = 0;
        break;
      }
    } else {
      u = Alist(x, evlis(y, a, p1, p2), u);
      y = 0;
      break;
    }
  }
  if (y < 0) {
    Error("bind: too many arguments x=%S y=%S", x, y);
  }
  return (struct Binding){u, a1};
}
