mirror of
https://git.savannah.gnu.org/git/guile.git
synced 2025-04-30 11:50:28 +02:00
881 lines
23 KiB
C
881 lines
23 KiB
C
/* Copyright (C) 1996, 1998, 2000, 2001, 2004, 2005, 2006, 2008, 2009,
|
||
* 2010, 2011, 2012, 2013 Free Software Foundation, Inc.
|
||
*
|
||
* This library is free software; you can redistribute it and/or
|
||
* modify it under the terms of the GNU Lesser General Public License
|
||
* as published by the Free Software Foundation; either version 3 of
|
||
* the License, or (at your option) any later version.
|
||
*
|
||
* This library is distributed in the hope that it will be useful, but
|
||
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||
* Lesser General Public License for more details.
|
||
*
|
||
* You should have received a copy of the GNU Lesser General Public
|
||
* License along with this library; if not, write to the Free Software
|
||
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
||
* 02110-1301 USA
|
||
*/
|
||
|
||
|
||
|
||
|
||
|
||
|
||
#ifdef HAVE_CONFIG_H
|
||
# include <config.h>
|
||
#endif
|
||
|
||
#include "libguile/_scm.h"
|
||
#include "libguile/strings.h"
|
||
#include "libguile/arrays.h"
|
||
#include "libguile/smob.h"
|
||
#include "libguile/chars.h"
|
||
#include "libguile/eq.h"
|
||
#include "libguile/eval.h"
|
||
#include "libguile/feature.h"
|
||
#include "libguile/root.h"
|
||
#include "libguile/vectors.h"
|
||
#include "libguile/bitvectors.h"
|
||
#include "libguile/srfi-4.h"
|
||
#include "libguile/generalized-arrays.h"
|
||
|
||
#include "libguile/validate.h"
|
||
#include "libguile/array-map.h"
|
||
|
||
|
||
/* The WHAT argument for `scm_gc_malloc ()' et al. */
|
||
static const char vi_gc_hint[] = "array-indices";
|
||
|
||
/* This is only every used wit v = SCM_I_ARRAY_V () or with the vra from
|
||
scm_ramapc, where lbnd is always 0. */
|
||
static SCM
|
||
AREF (SCM v, size_t pos)
|
||
{
|
||
scm_t_array_handle h;
|
||
SCM ret;
|
||
scm_array_get_handle (v, &h);
|
||
ret = h.impl->vref (h.root, h.base + pos * h.dims[0].inc);
|
||
scm_array_handle_release (&h);
|
||
return ret;
|
||
}
|
||
|
||
/* This is only ever used with v = SCM_I_ARRAY_V () */
|
||
static void
|
||
ASET (SCM v, size_t pos, SCM val)
|
||
{
|
||
scm_t_array_handle h;
|
||
scm_array_get_handle (v, &h);
|
||
h.impl->vset (h.root, pos, val);
|
||
scm_array_handle_release (&h);
|
||
}
|
||
|
||
static SCM
|
||
make1array (SCM v, ssize_t inc)
|
||
{
|
||
SCM a = scm_i_make_array (1);
|
||
SCM_I_ARRAY_BASE (a) = 0;
|
||
SCM_I_ARRAY_DIMS (a)->lbnd = 0;
|
||
SCM_I_ARRAY_DIMS (a)->ubnd = scm_c_array_length (v) - 1;
|
||
SCM_I_ARRAY_DIMS (a)->inc = inc;
|
||
SCM_I_ARRAY_V (a) = v;
|
||
return a;
|
||
}
|
||
|
||
/* Linear index of not-unrolled index set. */
|
||
static size_t
|
||
cindk (SCM ra, ssize_t *ve, int kend)
|
||
{
|
||
if (SCM_I_ARRAYP (ra))
|
||
{
|
||
int k;
|
||
size_t i = SCM_I_ARRAY_BASE (ra);
|
||
for (k = 0; k < kend; ++k)
|
||
i += (ve[k] - SCM_I_ARRAY_DIMS (ra)[k].lbnd) * SCM_I_ARRAY_DIMS (ra)[k].inc;
|
||
return i;
|
||
}
|
||
else
|
||
return 0; /* this is BASE */
|
||
}
|
||
|
||
/* array mapper: apply cproc to each dimension of the given arrays?.
|
||
int (*cproc) (); procedure to call on unrolled arrays?
|
||
cproc (dest, source list) or
|
||
cproc (dest, data, source list).
|
||
SCM data; data to give to cproc or unbound.
|
||
SCM ra0; destination array.
|
||
SCM lra; list of source arrays.
|
||
const char *what; caller, for error reporting. */
|
||
|
||
#define LBND(ra, k) SCM_I_ARRAY_DIMS (ra)[k].lbnd
|
||
#define UBND(ra, k) SCM_I_ARRAY_DIMS (ra)[k].ubnd
|
||
|
||
int
|
||
scm_ramapc (void *cproc_ptr, SCM data, SCM ra0, SCM lra, const char *what)
|
||
{
|
||
int (*cproc) () = cproc_ptr;
|
||
SCM z, va0, lva, *plva;
|
||
int k, kmax, kroll;
|
||
ssize_t *vi, inc;
|
||
size_t len;
|
||
|
||
/* Prepare reference argument. */
|
||
if (SCM_I_ARRAYP (ra0))
|
||
{
|
||
kmax = SCM_I_ARRAY_NDIM (ra0)-1;
|
||
inc = kmax < 0 ? 0 : SCM_I_ARRAY_DIMS (ra0)[kmax].inc;
|
||
va0 = make1array (SCM_I_ARRAY_V (ra0), inc);
|
||
|
||
/* Find unroll depth */
|
||
for (kroll = max(0, kmax); kroll > 0; --kroll)
|
||
{
|
||
inc *= (UBND (ra0, kroll) - LBND (ra0, kroll) + 1);
|
||
if (inc != SCM_I_ARRAY_DIMS (ra0)[kroll-1].inc)
|
||
break;
|
||
}
|
||
}
|
||
else
|
||
{
|
||
kroll = kmax = 0;
|
||
va0 = ra0 = make1array (ra0, 1);
|
||
}
|
||
|
||
/* Prepare rest arguments. */
|
||
lva = SCM_EOL;
|
||
plva = &lva;
|
||
for (z = lra; !scm_is_null (z); z = SCM_CDR (z))
|
||
{
|
||
SCM va1, ra1 = SCM_CAR (z);
|
||
if (SCM_I_ARRAYP (ra1))
|
||
{
|
||
if (kmax != SCM_I_ARRAY_NDIM (ra1) - 1)
|
||
scm_misc_error (what, "array shape mismatch: ~S", scm_list_1 (ra0));
|
||
inc = kmax < 0 ? 0 : SCM_I_ARRAY_DIMS (ra1)[kmax].inc;
|
||
va1 = make1array (SCM_I_ARRAY_V (ra1), inc);
|
||
|
||
/* Check unroll depth. */
|
||
for (k = kmax; k > kroll; --k)
|
||
{
|
||
ssize_t l0 = LBND (ra0, k), u0 = UBND (ra0, k);
|
||
if (l0 < LBND (ra1, k) || u0 > UBND (ra1, k))
|
||
scm_misc_error (what, "array shape mismatch: ~S", scm_list_1 (ra0));
|
||
inc *= (u0 - l0 + 1);
|
||
if (inc != SCM_I_ARRAY_DIMS (ra1)[k-1].inc)
|
||
{
|
||
kroll = k;
|
||
break;
|
||
}
|
||
}
|
||
|
||
/* Check matching of not-unrolled axes. */
|
||
for (; k>=0; --k)
|
||
if (LBND (ra0, k) < LBND (ra1, k) || UBND (ra0, k) > UBND (ra1, k))
|
||
scm_misc_error (what, "array shape mismatch: ~S", scm_list_1 (ra0));
|
||
}
|
||
else
|
||
{
|
||
if (kmax != 0)
|
||
scm_misc_error (what, "array shape mismatch: ~S", scm_list_1 (ra0));
|
||
va1 = make1array (ra1, 1);
|
||
|
||
if (LBND (ra0, 0) < LBND (va1, 0) || UBND (ra0, 0) > UBND (va1, 0))
|
||
scm_misc_error (what, "array shape mismatch: ~S", scm_list_1 (ra0));
|
||
}
|
||
*plva = scm_cons (va1, SCM_EOL);
|
||
plva = SCM_CDRLOC (*plva);
|
||
}
|
||
|
||
/* Check emptiness of not-unrolled axes. */
|
||
for (k = 0; k < kroll; ++k)
|
||
if (0 == (UBND (ra0, k) - LBND (ra0, k) + 1))
|
||
return 1;
|
||
|
||
/* Set unrolled size. */
|
||
for (len = 1; k <= kmax; ++k)
|
||
len *= (UBND (ra0, k) - LBND (ra0, k) + 1);
|
||
UBND (va0, 0) = len - 1;
|
||
for (z = lva; !scm_is_null (z); z = SCM_CDR (z))
|
||
UBND (SCM_CAR (z), 0) = len - 1;
|
||
|
||
/* Set starting indices and go. */
|
||
vi = scm_gc_malloc_pointerless (sizeof(ssize_t) * kroll, vi_gc_hint);
|
||
for (k = 0; k < kroll; ++k)
|
||
vi[k] = LBND (ra0, k);
|
||
do
|
||
{
|
||
if (k == kroll)
|
||
{
|
||
SCM y = lra;
|
||
SCM_I_ARRAY_BASE (va0) = cindk (ra0, vi, kroll);
|
||
for (z = lva; !scm_is_null (z); z = SCM_CDR (z), y = SCM_CDR (y))
|
||
SCM_I_ARRAY_BASE (SCM_CAR (z)) = cindk (SCM_CAR (y), vi, kroll);
|
||
if (! (SCM_UNBNDP (data) ? cproc (va0, lva) : cproc (va0, data, lva)))
|
||
return 0;
|
||
--k;
|
||
}
|
||
else if (vi[k] < UBND (ra0, k))
|
||
{
|
||
++vi[k];
|
||
++k;
|
||
}
|
||
else
|
||
{
|
||
vi[k] = LBND (ra0, k) - 1;
|
||
--k;
|
||
}
|
||
}
|
||
while (k >= 0);
|
||
return 1;
|
||
}
|
||
|
||
#undef UBND
|
||
#undef LBND
|
||
|
||
static int
|
||
rafill (SCM dst, SCM fill)
|
||
{
|
||
scm_t_array_handle h;
|
||
size_t n, i;
|
||
ssize_t inc;
|
||
scm_array_get_handle (SCM_I_ARRAY_V (dst), &h);
|
||
i = SCM_I_ARRAY_BASE (dst);
|
||
inc = SCM_I_ARRAY_DIMS (dst)->inc;
|
||
n = (SCM_I_ARRAY_DIMS (dst)->ubnd - SCM_I_ARRAY_DIMS (dst)->lbnd + 1);
|
||
dst = SCM_I_ARRAY_V (dst);
|
||
|
||
for (; n-- > 0; i += inc)
|
||
h.impl->vset (dst, i, fill);
|
||
|
||
scm_array_handle_release (&h);
|
||
return 1;
|
||
}
|
||
|
||
SCM_DEFINE (scm_array_fill_x, "array-fill!", 2, 0, 0,
|
||
(SCM ra, SCM fill),
|
||
"Store @var{fill} in every element of array @var{ra}. The value\n"
|
||
"returned is unspecified.")
|
||
#define FUNC_NAME s_scm_array_fill_x
|
||
{
|
||
scm_ramapc (rafill, fill, ra, SCM_EOL, FUNC_NAME);
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
static int
|
||
racp (SCM src, SCM dst)
|
||
{
|
||
scm_t_array_handle h_s, h_d;
|
||
size_t n, i_s, i_d;
|
||
ssize_t inc_s, inc_d;
|
||
|
||
dst = SCM_CAR (dst);
|
||
i_s = SCM_I_ARRAY_BASE (src);
|
||
i_d = SCM_I_ARRAY_BASE (dst);
|
||
inc_s = SCM_I_ARRAY_DIMS (src)->inc;
|
||
inc_d = SCM_I_ARRAY_DIMS (dst)->inc;
|
||
n = (SCM_I_ARRAY_DIMS (src)->ubnd - SCM_I_ARRAY_DIMS (src)->lbnd + 1);
|
||
src = SCM_I_ARRAY_V (src);
|
||
dst = SCM_I_ARRAY_V (dst);
|
||
|
||
scm_array_get_handle (src, &h_s);
|
||
scm_array_get_handle (dst, &h_d);
|
||
|
||
if (scm_is_vector (src) && scm_is_vector (dst))
|
||
{
|
||
SCM const * el_s = h_s.elements;
|
||
SCM * el_d = h_d.writable_elements;
|
||
for (; n-- > 0; i_s += inc_s, i_d += inc_d)
|
||
el_d[i_d] = el_s[i_s];
|
||
}
|
||
else
|
||
for (; n-- > 0; i_s += inc_s, i_d += inc_d)
|
||
h_d.impl->vset (dst, i_d, h_s.impl->vref (src, i_s));
|
||
|
||
scm_array_handle_release (&h_d);
|
||
scm_array_handle_release (&h_s);
|
||
|
||
return 1;
|
||
}
|
||
|
||
SCM_REGISTER_PROC(s_array_copy_in_order_x, "array-copy-in-order!", 2, 0, 0, scm_array_copy_x);
|
||
|
||
|
||
SCM_DEFINE (scm_array_copy_x, "array-copy!", 2, 0, 0,
|
||
(SCM src, SCM dst),
|
||
"@deffnx {Scheme Procedure} array-copy-in-order! src dst\n"
|
||
"Copy every element from vector or array @var{src} to the\n"
|
||
"corresponding element of @var{dst}. @var{dst} must have the\n"
|
||
"same rank as @var{src}, and be at least as large in each\n"
|
||
"dimension. The order is unspecified.")
|
||
#define FUNC_NAME s_scm_array_copy_x
|
||
{
|
||
scm_ramapc (racp, SCM_UNDEFINED, src, scm_cons (dst, SCM_EOL), FUNC_NAME);
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
#if SCM_ENABLE_DEPRECATED == 1
|
||
|
||
/* to be used as cproc in scm_ramapc to fill an array dimension with
|
||
"fill". */
|
||
int
|
||
scm_array_fill_int (SCM ra, SCM fill, SCM ignore SCM_UNUSED)
|
||
{
|
||
unsigned long i;
|
||
unsigned long n = SCM_I_ARRAY_DIMS (ra)->ubnd - SCM_I_ARRAY_DIMS (ra)->lbnd + 1;
|
||
long inc = SCM_I_ARRAY_DIMS (ra)->inc;
|
||
unsigned long base = SCM_I_ARRAY_BASE (ra);
|
||
|
||
ra = SCM_I_ARRAY_V (ra);
|
||
|
||
for (i = base; n--; i += inc)
|
||
ASET (ra, i, fill);
|
||
|
||
return 1;
|
||
}
|
||
|
||
/* Functions callable by ARRAY-MAP! */
|
||
|
||
int
|
||
scm_ra_eqp (SCM ra0, SCM ras)
|
||
{
|
||
SCM ra1 = SCM_CAR (ras), ra2 = SCM_CAR (SCM_CDR (ras));
|
||
scm_t_array_handle ra0_handle;
|
||
scm_t_array_dim *ra0_dims;
|
||
size_t n;
|
||
ssize_t inc0;
|
||
size_t i0 = 0;
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1), i2 = SCM_I_ARRAY_BASE (ra2);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
long inc2 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
ra2 = SCM_I_ARRAY_V (ra2);
|
||
|
||
scm_array_get_handle (ra0, &ra0_handle);
|
||
ra0_dims = scm_array_handle_dims (&ra0_handle);
|
||
n = ra0_dims[0].ubnd - ra0_dims[0].lbnd + 1;
|
||
inc0 = ra0_dims[0].inc;
|
||
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1, i2 += inc2)
|
||
if (scm_is_true (scm_array_handle_ref (&ra0_handle, i0)))
|
||
if (!scm_is_eq (AREF (ra1, i1), AREF (ra2, i2)))
|
||
scm_array_handle_set (&ra0_handle, i0, SCM_BOOL_F);
|
||
}
|
||
|
||
scm_array_handle_release (&ra0_handle);
|
||
return 1;
|
||
}
|
||
|
||
/* opt 0 means <, nonzero means >= */
|
||
|
||
static int
|
||
ra_compare (SCM ra0, SCM ra1, SCM ra2, int opt)
|
||
{
|
||
scm_t_array_handle ra0_handle;
|
||
scm_t_array_dim *ra0_dims;
|
||
size_t n;
|
||
ssize_t inc0;
|
||
size_t i0 = 0;
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1), i2 = SCM_I_ARRAY_BASE (ra2);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
long inc2 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
ra2 = SCM_I_ARRAY_V (ra2);
|
||
|
||
scm_array_get_handle (ra0, &ra0_handle);
|
||
ra0_dims = scm_array_handle_dims (&ra0_handle);
|
||
n = ra0_dims[0].ubnd - ra0_dims[0].lbnd + 1;
|
||
inc0 = ra0_dims[0].inc;
|
||
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1, i2 += inc2)
|
||
if (scm_is_true (scm_array_handle_ref (&ra0_handle, i0)))
|
||
if (opt ?
|
||
scm_is_true (scm_less_p (AREF (ra1, i1), AREF (ra2, i2))) :
|
||
scm_is_false (scm_less_p (AREF (ra1, i1), AREF (ra2, i2))))
|
||
scm_array_handle_set (&ra0_handle, i0, SCM_BOOL_F);
|
||
}
|
||
|
||
scm_array_handle_release (&ra0_handle);
|
||
return 1;
|
||
}
|
||
|
||
|
||
|
||
int
|
||
scm_ra_lessp (SCM ra0, SCM ras)
|
||
{
|
||
return ra_compare (ra0, SCM_CAR (ras), SCM_CAR (SCM_CDR (ras)), 0);
|
||
}
|
||
|
||
|
||
int
|
||
scm_ra_leqp (SCM ra0, SCM ras)
|
||
{
|
||
return ra_compare (ra0, SCM_CAR (SCM_CDR (ras)), SCM_CAR (ras), 1);
|
||
}
|
||
|
||
|
||
int
|
||
scm_ra_grp (SCM ra0, SCM ras)
|
||
{
|
||
return ra_compare (ra0, SCM_CAR (SCM_CDR (ras)), SCM_CAR (ras), 0);
|
||
}
|
||
|
||
|
||
int
|
||
scm_ra_greqp (SCM ra0, SCM ras)
|
||
{
|
||
return ra_compare (ra0, SCM_CAR (ras), SCM_CAR (SCM_CDR (ras)), 1);
|
||
}
|
||
|
||
|
||
int
|
||
scm_ra_sum (SCM ra0, SCM ras)
|
||
{
|
||
long n = SCM_I_ARRAY_DIMS (ra0)->ubnd - SCM_I_ARRAY_DIMS (ra0)->lbnd + 1;
|
||
unsigned long i0 = SCM_I_ARRAY_BASE (ra0);
|
||
long inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
ra0 = SCM_I_ARRAY_V (ra0);
|
||
if (!scm_is_null(ras))
|
||
{
|
||
SCM ra1 = SCM_CAR (ras);
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
switch (SCM_TYP7 (ra0) == SCM_TYP7 (ra1) ? SCM_TYP7 (ra0) : 0)
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1)
|
||
ASET (ra0, i0, scm_sum (AREF(ra0, i0), AREF(ra1, i1)));
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
return 1;
|
||
}
|
||
|
||
|
||
|
||
int
|
||
scm_ra_difference (SCM ra0, SCM ras)
|
||
{
|
||
long n = SCM_I_ARRAY_DIMS (ra0)->ubnd - SCM_I_ARRAY_DIMS (ra0)->lbnd + 1;
|
||
unsigned long i0 = SCM_I_ARRAY_BASE (ra0);
|
||
long inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
ra0 = SCM_I_ARRAY_V (ra0);
|
||
if (scm_is_null (ras))
|
||
{
|
||
switch (SCM_TYP7 (ra0))
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0)
|
||
ASET (ra0, i0, scm_difference (AREF(ra0, i0), SCM_UNDEFINED));
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
else
|
||
{
|
||
SCM ra1 = SCM_CAR (ras);
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
switch (SCM_TYP7 (ra0) == SCM_TYP7 (ra1) ? SCM_TYP7 (ra0) : 0)
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1)
|
||
ASET (ra0, i0, scm_difference (AREF (ra0, i0), AREF (ra1, i1)));
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
return 1;
|
||
}
|
||
|
||
|
||
|
||
int
|
||
scm_ra_product (SCM ra0, SCM ras)
|
||
{
|
||
long n = SCM_I_ARRAY_DIMS (ra0)->ubnd - SCM_I_ARRAY_DIMS (ra0)->lbnd + 1;
|
||
unsigned long i0 = SCM_I_ARRAY_BASE (ra0);
|
||
long inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
ra0 = SCM_I_ARRAY_V (ra0);
|
||
if (!scm_is_null (ras))
|
||
{
|
||
SCM ra1 = SCM_CAR (ras);
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
switch (SCM_TYP7 (ra0) == SCM_TYP7 (ra1) ? SCM_TYP7 (ra0) : 0)
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1)
|
||
ASET (ra0, i0, scm_product (AREF (ra0, i0), AREF (ra1, i1)));
|
||
}
|
||
}
|
||
}
|
||
return 1;
|
||
}
|
||
|
||
|
||
int
|
||
scm_ra_divide (SCM ra0, SCM ras)
|
||
{
|
||
long n = SCM_I_ARRAY_DIMS (ra0)->ubnd - SCM_I_ARRAY_DIMS (ra0)->lbnd + 1;
|
||
unsigned long i0 = SCM_I_ARRAY_BASE (ra0);
|
||
long inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
ra0 = SCM_I_ARRAY_V (ra0);
|
||
if (scm_is_null (ras))
|
||
{
|
||
switch (SCM_TYP7 (ra0))
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0)
|
||
ASET (ra0, i0, scm_divide (AREF (ra0, i0), SCM_UNDEFINED));
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
else
|
||
{
|
||
SCM ra1 = SCM_CAR (ras);
|
||
unsigned long i1 = SCM_I_ARRAY_BASE (ra1);
|
||
long inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
switch (SCM_TYP7 (ra0) == SCM_TYP7 (ra1) ? SCM_TYP7 (ra0) : 0)
|
||
{
|
||
default:
|
||
{
|
||
for (; n-- > 0; i0 += inc0, i1 += inc1)
|
||
{
|
||
SCM res = scm_divide (AREF (ra0, i0), AREF (ra1, i1));
|
||
ASET (ra0, i0, res);
|
||
}
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
return 1;
|
||
}
|
||
|
||
|
||
int
|
||
scm_array_identity (SCM dst, SCM src)
|
||
{
|
||
return racp (SCM_CAR (src), scm_cons (dst, SCM_EOL));
|
||
}
|
||
|
||
#endif /* SCM_ENABLE_DEPRECATED */
|
||
|
||
static int
|
||
ramap (SCM ra0, SCM proc, SCM ras)
|
||
{
|
||
scm_t_array_handle h0;
|
||
size_t n, i0;
|
||
ssize_t i, inc0;
|
||
scm_array_get_handle (SCM_I_ARRAY_V (ra0), &h0);
|
||
i0 = SCM_I_ARRAY_BASE (ra0);
|
||
inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
i = SCM_I_ARRAY_DIMS (ra0)->lbnd;
|
||
n = SCM_I_ARRAY_DIMS (ra0)->ubnd - i + 1;
|
||
ra0 = SCM_I_ARRAY_V (ra0);
|
||
if (scm_is_null (ras))
|
||
for (; n--; i0 += inc0)
|
||
h0.impl->vset (ra0, i0, scm_call_0 (proc));
|
||
else
|
||
{
|
||
SCM ra1 = SCM_CAR (ras);
|
||
scm_t_array_handle h1;
|
||
size_t i1;
|
||
ssize_t inc1;
|
||
scm_array_get_handle (SCM_I_ARRAY_V (ra1), &h1);
|
||
i1 = SCM_I_ARRAY_BASE (ra1);
|
||
inc1 = SCM_I_ARRAY_DIMS (ra1)->inc;
|
||
ras = SCM_CDR (ras);
|
||
ra1 = SCM_I_ARRAY_V (ra1);
|
||
if (scm_is_null (ras))
|
||
for (; n--; i0 += inc0, i1 += inc1)
|
||
h0.impl->vset (ra0, i0, scm_call_1 (proc, h1.impl->vref (ra1, i1)));
|
||
else
|
||
{
|
||
ras = scm_vector (ras);
|
||
for (; n--; i0 += inc0, i1 += inc1, ++i)
|
||
{
|
||
SCM args = SCM_EOL;
|
||
unsigned long k;
|
||
for (k = scm_c_vector_length (ras); k--;)
|
||
args = scm_cons (AREF (scm_c_vector_ref (ras, k), i), args);
|
||
h0.impl->vset (ra0, i0, scm_apply_1 (proc, h1.impl->vref (ra1, i1), args));
|
||
}
|
||
}
|
||
scm_array_handle_release (&h1);
|
||
}
|
||
scm_array_handle_release (&h0);
|
||
return 1;
|
||
}
|
||
|
||
|
||
SCM_REGISTER_PROC(s_array_map_in_order_x, "array-map-in-order!", 2, 0, 1, scm_array_map_x);
|
||
|
||
SCM_SYMBOL (sym_b, "b");
|
||
|
||
SCM_DEFINE (scm_array_map_x, "array-map!", 2, 0, 1,
|
||
(SCM ra0, SCM proc, SCM lra),
|
||
"@deffnx {Scheme Procedure} array-map-in-order! ra0 proc . lra\n"
|
||
"@var{array1}, @dots{} must have the same number of dimensions\n"
|
||
"as @var{ra0} and have a range for each index which includes the\n"
|
||
"range for the corresponding index in @var{ra0}. @var{proc} is\n"
|
||
"applied to each tuple of elements of @var{array1}, @dots{} and\n"
|
||
"the result is stored as the corresponding element in @var{ra0}.\n"
|
||
"The value returned is unspecified. The order of application is\n"
|
||
"unspecified.")
|
||
#define FUNC_NAME s_scm_array_map_x
|
||
{
|
||
SCM_VALIDATE_PROC (2, proc);
|
||
SCM_VALIDATE_REST_ARGUMENT (lra);
|
||
|
||
scm_ramapc (ramap, proc, ra0, lra, FUNC_NAME);
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
static int
|
||
rafe (SCM ra0, SCM proc, SCM ras)
|
||
{
|
||
ssize_t i = SCM_I_ARRAY_DIMS (ra0)->lbnd;
|
||
size_t n = SCM_I_ARRAY_DIMS (ra0)->ubnd - i + 1;
|
||
|
||
scm_t_array_handle h0;
|
||
size_t i0;
|
||
ssize_t inc0;
|
||
scm_array_get_handle (SCM_I_ARRAY_V (ra0), &h0);
|
||
i0 = SCM_I_ARRAY_BASE (ra0);
|
||
inc0 = SCM_I_ARRAY_DIMS (ra0)->inc;
|
||
if (scm_is_null (ras))
|
||
for (; n--; i0 += inc0)
|
||
scm_call_1 (proc, h0.impl->vref (SCM_I_ARRAY_V (ra0), i0));
|
||
else
|
||
{
|
||
ras = scm_vector (ras);
|
||
for (; n--; i0 += inc0, ++i)
|
||
{
|
||
SCM args = SCM_EOL;
|
||
unsigned long k;
|
||
for (k = scm_c_vector_length (ras); k--;)
|
||
args = scm_cons (AREF (scm_c_vector_ref (ras, k), i), args);
|
||
scm_apply_1 (proc, h0.impl->vref (SCM_I_ARRAY_V (ra0), i0), args);
|
||
}
|
||
}
|
||
scm_array_handle_release (&h0);
|
||
return 1;
|
||
}
|
||
|
||
SCM_DEFINE (scm_array_for_each, "array-for-each", 2, 0, 1,
|
||
(SCM proc, SCM ra0, SCM lra),
|
||
"Apply @var{proc} to each tuple of elements of @var{ra0} @dots{}\n"
|
||
"in row-major order. The value returned is unspecified.")
|
||
#define FUNC_NAME s_scm_array_for_each
|
||
{
|
||
SCM_VALIDATE_PROC (1, proc);
|
||
SCM_VALIDATE_REST_ARGUMENT (lra);
|
||
scm_ramapc (rafe, proc, ra0, lra, FUNC_NAME);
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
SCM_DEFINE (scm_array_index_map_x, "array-index-map!", 2, 0, 0,
|
||
(SCM ra, SCM proc),
|
||
"Apply @var{proc} to the indices of each element of @var{ra} in\n"
|
||
"turn, storing the result in the corresponding element. The value\n"
|
||
"returned and the order of application are unspecified.\n\n"
|
||
"One can implement @var{array-indexes} as\n"
|
||
"@lisp\n"
|
||
"(define (array-indexes array)\n"
|
||
" (let ((ra (apply make-array #f (array-shape array))))\n"
|
||
" (array-index-map! ra (lambda x x))\n"
|
||
" ra))\n"
|
||
"@end lisp\n"
|
||
"Another example:\n"
|
||
"@lisp\n"
|
||
"(define (apl:index-generator n)\n"
|
||
" (let ((v (make-uniform-vector n 1)))\n"
|
||
" (array-index-map! v (lambda (i) i))\n"
|
||
" v))\n"
|
||
"@end lisp")
|
||
#define FUNC_NAME s_scm_array_index_map_x
|
||
{
|
||
scm_t_array_handle h;
|
||
SCM_VALIDATE_PROC (2, proc);
|
||
|
||
if (!scm_is_array (ra))
|
||
scm_wrong_type_arg_msg (NULL, 0, ra, "array");
|
||
/* This also covers the not-SCM_I_ARRAYP case */
|
||
else if (1 == scm_c_array_rank(ra))
|
||
{
|
||
ssize_t i, inc;
|
||
size_t p;
|
||
scm_array_get_handle (ra, &h);
|
||
inc = h.dims[0].inc;
|
||
for (i = h.dims[0].lbnd, p = h.base; i <= h.dims[0].ubnd; ++i, p += inc)
|
||
h.impl->vset (h.root, p, scm_call_1 (proc, scm_from_ssize_t (i)));
|
||
scm_array_handle_release (&h);
|
||
}
|
||
else
|
||
{
|
||
size_t i;
|
||
int j, k, kmax = SCM_I_ARRAY_NDIM (ra) - 1;
|
||
ssize_t *vi;
|
||
|
||
if (kmax < 0)
|
||
return scm_array_set_x (ra, scm_call_0 (proc), SCM_EOL);
|
||
|
||
vi = scm_gc_malloc_pointerless (sizeof(ssize_t) * (kmax + 1), vi_gc_hint);
|
||
|
||
for (k = 0; k <= kmax; k++)
|
||
{
|
||
vi[k] = SCM_I_ARRAY_DIMS (ra)[k].lbnd;
|
||
if (vi[k] > SCM_I_ARRAY_DIMS (ra)[k].ubnd)
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
|
||
scm_array_get_handle (ra, &h);
|
||
k = kmax;
|
||
do
|
||
{
|
||
if (k == kmax)
|
||
{
|
||
SCM args = SCM_EOL;
|
||
SCM *p = &args, *q;
|
||
vi[kmax] = SCM_I_ARRAY_DIMS (ra)[kmax].lbnd;
|
||
i = cindk (ra, vi, kmax+1);
|
||
for (j = 0; j<=kmax; ++j)
|
||
{
|
||
*p = scm_cons (scm_from_ssize_t (vi[j]), SCM_EOL);
|
||
q = SCM_CARLOC (*p);
|
||
p = SCM_CDRLOC (*p);
|
||
}
|
||
for (; vi[kmax] <= SCM_I_ARRAY_DIMS (ra)[kmax].ubnd;
|
||
*q = scm_from_ssize_t (++vi[kmax]))
|
||
{
|
||
h.impl->vset (h.root, i, scm_apply_0 (proc, args));
|
||
i += SCM_I_ARRAY_DIMS (ra)[kmax].inc;
|
||
}
|
||
k--;
|
||
}
|
||
else if (vi[k] < SCM_I_ARRAY_DIMS (ra)[k].ubnd)
|
||
{
|
||
vi[k]++;
|
||
k++;
|
||
}
|
||
else
|
||
{
|
||
vi[k] = SCM_I_ARRAY_DIMS (ra)[k].lbnd - 1;
|
||
k--;
|
||
}
|
||
}
|
||
while (k >= 0);
|
||
scm_array_handle_release (&h);
|
||
}
|
||
return SCM_UNSPECIFIED;
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
static int
|
||
array_compare (scm_t_array_handle *hx, scm_t_array_handle *hy,
|
||
size_t dim, unsigned long posx, unsigned long posy)
|
||
{
|
||
if (dim == scm_array_handle_rank (hx))
|
||
return scm_is_true (scm_equal_p (scm_array_handle_ref (hx, posx),
|
||
scm_array_handle_ref (hy, posy)));
|
||
else
|
||
{
|
||
long incx, incy;
|
||
size_t i;
|
||
|
||
if (hx->dims[dim].lbnd != hy->dims[dim].lbnd
|
||
|| hx->dims[dim].ubnd != hy->dims[dim].ubnd)
|
||
return 0;
|
||
|
||
i = hx->dims[dim].ubnd - hx->dims[dim].lbnd + 1;
|
||
|
||
incx = hx->dims[dim].inc;
|
||
incy = hy->dims[dim].inc;
|
||
posx += (i - 1) * incx;
|
||
posy += (i - 1) * incy;
|
||
|
||
for (; i > 0; i--, posx -= incx, posy -= incy)
|
||
if (!array_compare (hx, hy, dim + 1, posx, posy))
|
||
return 0;
|
||
return 1;
|
||
}
|
||
}
|
||
|
||
SCM
|
||
scm_array_equal_p (SCM x, SCM y)
|
||
{
|
||
scm_t_array_handle hx, hy;
|
||
SCM res;
|
||
|
||
scm_array_get_handle (x, &hx);
|
||
scm_array_get_handle (y, &hy);
|
||
|
||
res = scm_from_bool (hx.ndims == hy.ndims
|
||
&& hx.element_type == hy.element_type);
|
||
|
||
if (scm_is_true (res))
|
||
res = scm_from_bool (array_compare (&hx, &hy, 0, 0, 0));
|
||
|
||
scm_array_handle_release (&hy);
|
||
scm_array_handle_release (&hx);
|
||
|
||
return res;
|
||
}
|
||
|
||
static SCM scm_i_array_equal_p (SCM, SCM, SCM);
|
||
SCM_DEFINE (scm_i_array_equal_p, "array-equal?", 0, 2, 1,
|
||
(SCM ra0, SCM ra1, SCM rest),
|
||
"Return @code{#t} iff all arguments are arrays with the same\n"
|
||
"shape, the same type, and have corresponding elements which are\n"
|
||
"either @code{equal?} or @code{array-equal?}. This function\n"
|
||
"differs from @code{equal?} in that all arguments must be arrays.")
|
||
#define FUNC_NAME s_scm_i_array_equal_p
|
||
{
|
||
if (SCM_UNBNDP (ra0) || SCM_UNBNDP (ra1))
|
||
return SCM_BOOL_T;
|
||
|
||
while (!scm_is_null (rest))
|
||
{ if (scm_is_false (scm_array_equal_p (ra0, ra1)))
|
||
return SCM_BOOL_F;
|
||
ra0 = ra1;
|
||
ra1 = scm_car (rest);
|
||
rest = scm_cdr (rest);
|
||
}
|
||
return scm_array_equal_p (ra0, ra1);
|
||
}
|
||
#undef FUNC_NAME
|
||
|
||
|
||
void
|
||
scm_init_array_map (void)
|
||
{
|
||
#include "libguile/array-map.x"
|
||
scm_add_feature (s_scm_array_for_each);
|
||
}
|
||
|
||
/*
|
||
Local Variables:
|
||
c-file-style: "gnu"
|
||
End:
|
||
*/
|