1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*
boolean.c
This software is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This software 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this software; if not, write to the Free
Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Original copyright notice follows:
Copyright, 1993, Brent Benson. All Rights Reserved.
0.4 & 0.5 Revisions Copyright 1994, Joseph N. Wilson. All Rights Reserved.
Permission to use, copy, and modify this software and its
documentation is hereby granted only under the following terms and
conditions. Both the above copyright notice and this permission
notice must appear in all copies of the software, derivative works
or modified version, and both notices must appear in supporting
documentation. Users of this software agree to the terms and
conditions set forth in this notice.
*/
#include "boolean.h"
#include "prim.h"
/* primitives */
static Object not (Object obj);
static struct primitive boolean_prims[] =
{
/* {"%~==", prim_2_rest, not_id_p}, */
{"%identical?", prim_2_rest, id_p},
{"%not", prim_1, not},
};
/* function definitions */
void
init_boolean_prims (void)
{
int num = sizeof (boolean_prims) / sizeof (struct primitive);
init_prims (num, boolean_prims);
}
#ifndef SMALL_OBJECTS
Object
make_true (void)
{
Object obj = allocate_object (sizeof (struct object));
TYPE (obj) = True;
return (obj);
}
#else
Object
make_true (void)
{
return (TRUEVAL);
}
#endif
#ifndef SMALL_OBJECTS
Object
make_false (void)
{
Object obj = allocate_object (sizeof (struct object));
TYPE (obj) = False;
return (obj);
}
#else
Object
make_false (void)
{
return (FALSEVAL);
}
#endif
Object
id_p (Object obj1, Object obj2, Object rest)
{
/* succeed quickly in the simple case */
if ((obj1 == obj2)) {
if (EMPTYLISTP (rest)) {
return (true_object);
} else {
return id_p (obj2, CAR (rest), CDR (rest));
}
} else if (INTEGERP (obj1) && INTEGERP (obj2)) {
if (INTVAL (obj1) == INTVAL (obj2)) {
if (EMPTYLISTP (rest)) {
return (true_object);
} else {
return (id_p (obj2, CAR (rest), CDR (rest)));
}
} else {
return (false_object);
}
} else if (CHARP (obj1) && CHARP (obj2)) {
if (CHARVAL (obj1) == CHARVAL (obj2)) {
if (EMPTYLISTP (rest)) {
return (true_object);
} else {
return (id_p (obj2, CAR (rest), CDR (rest)));
}
} else {
return (false_object);
}
} else if (DFLOATP (obj1) && DFLOATP (obj2)) {
if (DFLOATVAL (obj1) == DFLOATVAL (obj2)) {
if (EMPTYLISTP (rest)) {
return (true_object);
} else {
return (id_p (obj2, CAR (rest), CDR (rest)));
}
} else {
return (false_object);
}
} else {
return (false_object);
}
}
int
id (Object obj1, Object obj2)
{
if (obj1 == obj2) {
return 1;
} else if (INTEGERP (obj1) && INTEGERP (obj2)) {
return (INTVAL (obj1) == INTVAL (obj2));
} else if (CHARP (obj1) && CHARP (obj2)) {
return (CHARVAL (obj1) == CHARVAL (obj2));
} else if (DFLOATP (obj1) && DFLOATP (obj2)) {
return (DFLOATVAL (obj1) == DFLOATVAL (obj2));
} else {
return 0;
}
}
static Object
not (Object obj)
{
if (obj == false_object) {
return (true_object);
} else {
return (false_object);
}
}
|
