/*	Copyright (C) 1995,1996,1997,1998 Free Software Foundation, Inc.
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2, or (at your option)
 * any later version.
 * 
 * This program 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 General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this software; see the file COPYING.  If not, write to
 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
 * Boston, MA 02111-1307 USA
 *
 * As a special exception, the Free Software Foundation gives permission
 * for additional uses of the text contained in its release of GUILE.
 *
 * The exception is that, if you link the GUILE library with other files
 * to produce an executable, this does not by itself cause the
 * resulting executable to be covered by the GNU General Public License.
 * Your use of that executable is in no way restricted on account of
 * linking the GUILE library code into it.
 *
 * This exception does not however invalidate any other reasons why
 * the executable file might be covered by the GNU General Public License.
 *
 * This exception applies only to the code released by the
 * Free Software Foundation under the name GUILE.  If you copy
 * code from other Free Software Foundation releases into a copy of
 * GUILE, as the General Public License permits, the exception does
 * not apply to the code that you add in this way.  To avoid misleading
 * anyone as to the status of such modified files, you must delete
 * this exception notice from them.
 *
 * If you write modifications of your own for GUILE, it is your choice
 * whether to permit this exception to apply to your modifications.
 * If you do not wish that, delete this exception notice.  */

/* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
   gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */


#include <stdio.h>
#include "_scm.h"
#include "ramap.h"
#include "stackchk.h"
#include "strorder.h"
#include "smob.h"
#include "unif.h"

#include "scm_validate.h"
#include "eq.h"

SCM_DEFINE1 (scm_eq_p, "eq?", scm_tc7_rpsubr,
             (SCM x, SCM y),
             "Return #t iff X references the same object as Y.\n"
             "`eq?' is similar to `eqv?' except that in some cases\n"
             "it is capable of discerning distinctions finer than\n"
             "those detectable by `eqv?'.\n"
             "")
#define FUNC_NAME s_scm_eq_p
{
  return SCM_BOOL(x==y);
}
#undef FUNC_NAME


SCM_DEFINE1 (scm_eqv_p, "eqv?", scm_tc7_rpsubr,
             (SCM x, SCM y),
             "The `eqv?' procedure defines a useful equivalence relation on objects.\n"
             "Briefly, it returns #t if X and Y should normally be\n"
             "regarded as the same object.  This relation is left\n"
             "slightly open to interpretation, but works for comparing\n"
             "immediate integers, characters, and inexact numbers.\n")
#define FUNC_NAME s_scm_eqv_p
{
  if (x==y) return SCM_BOOL_T;
  if (SCM_IMP(x)) return SCM_BOOL_F;
  if (SCM_IMP(y)) return SCM_BOOL_F;
  /* this ensures that types and scm_length are the same. */
  if (SCM_CAR(x) != SCM_CAR(y)) return SCM_BOOL_F;
  if (SCM_NUMP(x)) {
# ifdef SCM_BIGDIG
    if (SCM_BIGP(x)) return SCM_BOOL(0==scm_bigcomp(x, y));
# endif
#ifdef SCM_FLOATS
    if (SCM_REALPART(x) != SCM_REALPART(y)) return SCM_BOOL_F;
    if (SCM_CPLXP(x) && (SCM_IMAG(x) != SCM_IMAG(y))) return SCM_BOOL_F;
#endif
    return SCM_BOOL_T;
  }
  return SCM_BOOL_F;
}
#undef FUNC_NAME


SCM_DEFINE1 (scm_equal_p, "equal?", scm_tc7_rpsubr,
             (SCM x, SCM y),
             "Return #t iff X and Y are recursively `eqv?' equivalent.\n"
             "`equal?' recursively compares the contents of pairs, vectors, and\n"
             "strings, applying `eqv?' on other objects such as numbers and\n"
             "symbols.  A rule of thumb is that objects are generally `equal?'\n"
             "if they print the same.  `Equal?' may fail to terminate if its\n"
             "arguments are circular data structures.\n"
             "")
#define FUNC_NAME s_scm_equal_p
{
  SCM_CHECK_STACK;
 tailrecurse: SCM_TICK;
	if (x==y) return SCM_BOOL_T;
	if (SCM_IMP(x)) return SCM_BOOL_F;
	if (SCM_IMP(y)) return SCM_BOOL_F;
	if (SCM_CONSP(x) && SCM_CONSP(y)) {
		if SCM_FALSEP(scm_equal_p(SCM_CAR(x), SCM_CAR(y))) return SCM_BOOL_F;
		x = SCM_CDR(x);
		y = SCM_CDR(y);
		goto tailrecurse;
	}
	if (SCM_TYP7S (x) == scm_tc7_string
	    && SCM_TYP7S (y) == scm_tc7_string)
	  return scm_string_equal_p (x, y);
	/* This ensures that types and scm_length are the same.  */
	if (SCM_CAR(x) != SCM_CAR(y)) return SCM_BOOL_F;
	switch (SCM_TYP7(x)) {
        default: return SCM_BOOL_F;
	case scm_tc7_vector:
	case scm_tc7_wvect:
	  return scm_vector_equal_p(x, y);
	case scm_tc7_smob: {
	        int i = SCM_SMOBNUM(x);
	        if (!(i < scm_numsmob)) return SCM_BOOL_F;
	        if (scm_smobs[i].equalp)
		  return (scm_smobs[i].equalp)(x, y);
		else
		  return SCM_BOOL_F;
	      }
#ifdef HAVE_ARRAYS
	case scm_tc7_bvect: case scm_tc7_uvect: case scm_tc7_ivect:
	case scm_tc7_fvect:	case scm_tc7_cvect: case scm_tc7_dvect:
	case scm_tc7_svect:
#ifdef HAVE_LONG_LONGS
	case scm_tc7_llvect:
#endif
	case scm_tc7_byvect:
	  if (   scm_tc16_array
	      && scm_smobs[0x0ff & (scm_tc16_array >> 8)].equalp)
	    return scm_array_equal_p(x, y);
#endif
	}
	return SCM_BOOL_F;
}
#undef FUNC_NAME






void
scm_init_eq ()
{
#include "eq.x"
}