-
Notifications
You must be signed in to change notification settings - Fork 0
/
clauses.c
165 lines (146 loc) · 2.75 KB
/
clauses.c
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
162
163
164
165
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "types.h"
#include "clauses.h"
Clause new_clause(){
Clause *c = malloc(sizeof(Clause));
c->next = NULL;
return *c;
}
Clause* clause_copy(Clause* src){
Clause* dest = NULL;
Clause** iter = &dest;
while (src != NULL){
*iter = malloc(sizeof(Clause));
(*iter)->v = src->v;
iter = &(*iter)->next;
src = src->next;
}
return dest;
}
static int rec_length(Clause *c, int acc){
if (c==NULL)
return acc;
else
return rec_length(c->next,acc+1);
}
// tail-rec fun, with nested functions (not allowed with pedantic)
int length(Clause *c){
return rec_length(c,0);
}
int push_var(Clause **c, Variable v){
if (*c==NULL){
*c = malloc(sizeof(Clause));
if (!*c)
return -1;
(*c)->v = v;
(*c)->next = NULL;
return 0;
}
else if (VAR_EQ(v,(*c)->v))
return 1;
else
return push_var(&(*c)->next,v);
}
int pop_var(Clause *c, Variable *v){
if (c==NULL)
return -1;
if (c->next == NULL){
free(c);
c = NULL;
return 1;
}
while (c->next->next != NULL)
c = c->next;
*v = c->next->v;
free(c->next);
c->next=NULL;
return 0;
}
Clause* del_var(Clause** c, const Variable v){
Clause* iter = *c;
Clause* temp = NULL;
if (*c == NULL)
return *c;
if (VAR_EQ((*c)->v,v)){
temp = (*c)->next;
free(*c);
return temp;
}
while(iter->next != NULL){
if (VAR_EQ(iter->next->v,v)){
temp = iter->next->next;
free(iter->next);
iter->next = temp;
return *c;
}
iter = iter->next;
}
return *c;
}
bool is_valid(const Clause *c){
const Clause *p=c->next;
while(c != NULL){
p= c->next;
while(p != NULL){
if (VAR_EQ_NOT(c->v,p->v))
return true;
p = p->next;
}
c = c->next;
}
return false;
}
void free_clause(Clause **c){
if (*c == NULL)
return;
else{
free_clause(&(*c)->next);
(*c)->next = NULL;
free(*c);
*c = NULL;
}
}
bool is_empty_clause(const Clause* c){
return c == NULL;
}
void print_clause(const Clause* c){
if (is_empty_clause(c))
puts("Vide");
else{
for (; c != NULL; c = c->next){
afficher_variable(&c->v);
if(c->next != NULL)
fputs("OU",stdout);
}
puts("");
}
}
//c1 and c2 are not null here
static bool equalcl(Clause *c1, Clause *c2){
Clause *head = c2;
while (c1 != NULL){
if (c2 == NULL)
return false;
else{
if (VAR_EQ(c1->v,c2->v)){
c1 = c1->next;
c2 = head;
}
else
c2 = c2->next;
}
}
return true;
}
bool equal_clause(Clause *c1, Clause *c2){
if (c1==c2 && c2==NULL)
return true;
else if ((!c1 && c2) || (c1 && !c2))
return false;
else if (length(c1) != length(c2))
return false;
else
return equalcl(c1,c2);
}