home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Fresh Fish 8
/
FreshFishVol8-CD2.bin
/
bbs
/
dev
/
umbscheme-2.12.lha
/
UMBScheme
/
src
/
number.c
< prev
next >
Wrap
C/C++ Source or Header
|
1993-11-29
|
63KB
|
2,453 lines
/* number.c - UMB Scheme, numbers package
UMB Scheme Interpreter $Revision: 2.12 $
Copyright (C) 1988, 1991 William R Campbell
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 1, 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 program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
UMB Scheme was written by Bill Campbell with help from Karl Berry,
Barbara Dixey, Ira Gerstein, Mary Glaser, Kathy Hargreaves, Bill McCabe,
Long Nguyen, Susan Quina, Jeyashree Sivasubram, Bela Sohoni and Thang Quoc Tran.
For additional information about UMB Scheme, contact the author:
Bill Campbell
Department of Mathematics and Computer Science
University of Massachusetts at Boston
Harbor Campus
Boston, MA 02125
Telephone: 617-287-6449 Internet: bill@cs.umb.edu
*/
#include "portable.h"
#include "eval.h"
#include "object.h"
#include "architecture.h"
#include "number.h"
#include "fixnum.h"
#include "bignum.h"
#include "rational.h"
#include "real.h"
#include "complex.h"
#include "steering.h"
#include "io.h"
#include <math.h>
/* Conversions used in promotion */
Private void Coerce_Args();
Private void Coerce_Relational_Args();
/* Conversions used in demotion */
Private void Demote_Complex_To_Real();
Private void Demote_Rational_To_Integer();
Private void Demote_Bignum_To_Fixnum();
/* All the number operations. */
typedef void (*Procedure_Pointer)();
typedef Procedure_Pointer Procedure_Array[ TOWER_LEVEL_COUNT ];
typedef Boolean (*Boolean_Function_Pointer)();
typedef Boolean_Function_Pointer Boolean_Function_Array[ TOWER_LEVEL_COUNT ];
Private struct
{
/* Predicates */
Boolean_Function_Array Is_Number_Zero;
Boolean_Function_Array Is_Number_Positive;
Boolean_Function_Array Is_Number_Negative;
Boolean_Function_Array Is_Number_Even;
Boolean_Function_Array Is_Number_Odd;
Boolean_Function_Array Is_Number_Exact;
Boolean_Function_Array Is_Number_Inexact;
/* Comparisons */
Boolean_Function_Array Number_Equal;
Boolean_Function_Array Number_Less_Than;
Boolean_Function_Array Number_Greater_Than;
Boolean_Function_Array Number_Less_Than_Or_Equal;
Boolean_Function_Array Number_Greater_Than_Or_Equal;
/* Arithmetic. */
Procedure_Array Number_Add;
Procedure_Array Number_Subtract;
Procedure_Array Number_Multiply;
Procedure_Array Number_Divide;
Procedure_Array Number_Quotient;
Procedure_Array Number_Remainder;
Procedure_Array Number_Modulo;
Procedure_Array Number_Negate;
Procedure_Array Number_Abs;
Procedure_Array Number_Numerator;
Procedure_Array Number_Denominator;
Procedure_Array Number_Rationalize;
/* Others. */
Procedure_Array Number_Max;
Procedure_Array Number_Min;
Procedure_Array Number_GCD;
Procedure_Array Number_LCM;
Procedure_Array Number_Floor;
Procedure_Array Number_Ceiling;
Procedure_Array Number_Truncate;
Procedure_Array Number_Round;
Procedure_Array Number_Sqrt;
Procedure_Array Number_Exp;
Procedure_Array Number_Log;
Procedure_Array Number_Expt;
Procedure_Array Number_Sin;
Procedure_Array Number_Cos;
Procedure_Array Number_Tan;
Procedure_Array Number_Asin;
Procedure_Array Number_Acos;
Procedure_Array Number_Atan;
Procedure_Array Number_Atan2;
Procedure_Array Number_Exact_To_Inexact;
Procedure_Array Number_Inexact_To_Exact;
Procedure_Array Number_To_String;
Procedure_Array Number_Make_Rectangular;
Procedure_Array Number_Make_Polar;
Procedure_Array Number_Real_Part;
Procedure_Array Number_Imaginary_Part;
Procedure_Array Number_Magnitude;
Procedure_Array Number_Angle;
} Num_Ops;
/* Basic Predicates on Numbers */
/* (number? object) */
Private void Number_Predicate()
{
Value_Register = Is_Number(Top(1)) ? The_True_Object
: The_False_Object;
}
/* (integer? object) */
Private void Integer_Predicate()
{
if ( Is_Number( Top(1) ) )
{
Integer p1 = Get_Number_Tower_Position( Top(1) );
if ( p1 <= BIGNUM_LEVEL )
Value_Register = The_True_Object;
else if ( p1 == REAL_LEVEL )
{
Push( Top(1) );
Number_Round();
Replace( 1 , Value_Register );
Number_Equal(); Pop(1); /* just the rounded one */
}
else Value_Register = The_False_Object;
}
else Value_Register = The_False_Object;
}
/* (rational? object) */
Private void Rational_Predicate()
{
if ( Is_Number( Top(1) ) )
{
Integer p1 = Get_Number_Tower_Position( Top(1) );
if ( p1 <= RATIONAL_LEVEL )
Value_Register = The_True_Object;
else if ( p1 == REAL_LEVEL )
{
Push( Top(1) );
Number_Round();
Replace( 1 , Value_Register );
Number_Equal(); Pop(1); /* just the rounded one */
}
else Value_Register = The_False_Object;
}
else Value_Register = The_False_Object;
}
/* (real? object) */
Private void Real_Predicate()
{
Value_Register = Is_Number(Top(1)) &&
Get_Number_Tower_Position(Top(1)) <= REAL_LEVEL
? The_True_Object
: The_False_Object;
}
/* (complex? object) */
Private void Complex_Predicate()
{
Value_Register = Is_Number(Top(1)) &&
Get_Number_Tower_Position(Top(1)) <= COMPLEX_LEVEL
? The_True_Object
: The_False_Object;
}
/* Generic Number Procedures - invoke more specific procedures via Num_Ops */
Public void Is_Number_Zero()
{
Value_Register =
(*(Num_Ops.Is_Number_Zero[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Positive()
{
Value_Register =
(*(Num_Ops.Is_Number_Positive[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Negative()
{
Value_Register =
(*(Num_Ops.Is_Number_Negative[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Odd()
{
Value_Register =
(*(Num_Ops.Is_Number_Odd[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Even()
{
Value_Register =
(*(Num_Ops.Is_Number_Even[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Exact()
{
Value_Register =
(*(Num_Ops.Is_Number_Exact[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
Public void Is_Number_Inexact()
{
Value_Register =
(*(Num_Ops.Is_Number_Inexact[Get_Number_Tower_Position( Top(1) )]))()
? The_True_Object
: The_False_Object;
}
/* Relations of the form (rel obj obj obj ...) */
Private Object Iterate_Over_Relations( Relation_Tower )
Boolean_Function_Array Relation_Tower;
{
/* In (rel obj obj ...) apply rel to successive obj pairs;
thus eg (> x y z) is the same as (and (> x y) (> y z)). */
Integer arg_count = Get_Apply_Numargs( Expression_Register );
if (arg_count < 2 )
{
Display_Error( "Fewer than 2 arguments to a relation: " ,
Expression_Register );
}
while ( arg_count > 1 )
{
Push( Top( arg_count ) );
Push( Top( arg_count ) );
Coerce_Relational_Args();
if ( (*(Relation_Tower[Get_Number_Tower_Position(Top(1))]))() )
{
Pop( 2 );
arg_count--;
}
else
{
Pop( 2 );
return( The_False_Object );
}
}
return( The_True_Object );
}
Private void Varying_Number_Equal()
{
Value_Register = Iterate_Over_Relations( Num_Ops.Number_Equal );
}
Private void Varying_Number_Greater_Than()
{
Value_Register = Iterate_Over_Relations( Num_Ops.Number_Greater_Than );
}
Private void Varying_Number_Less_Than()
{
Value_Register = I