/usr/include/ladr/flatterm.h is in libladr-dev 0.0.200902a-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* Copyright (C) 2006, 2007 William McCune
This file is part of the LADR Deduction Library.
The LADR Deduction Library is free software; you can redistribute it
and/or modify it under the terms of the GNU General Public License,
version 2.
The LADR Deduction 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with the LADR Deduction Library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#ifndef TP_FLATTERM_H
#define TP_FLATTERM_H
#include "term.h"
/* INTRODUCTION
<P>
The Term macros VARIABLE(f), CONSTANT(f), COMPLEX(f), SYMNUM(f),
VARNUM(f), ARITY(f) are used for Flatterms as well. The Term macro
ARG(t,i) is NOT used for Flatterms.
<P>
Traversing Flatterms. It can be done recursively or iteratively.
When building flatterms, recursive is better, because you have to
make a Flatterm point to its end.
Iterative:
Flatterm fi;
for (f = fi; fi != f->end->next; fi = fi->next)
...
Recursive:
int i;
Flatterm fi = f->next;
for (i = 0; i < ARITY(f); i++) {
...
fi = fi->end->next;
}
*/
/* Public definitions */
typedef struct flatterm * Flatterm;
struct flatterm {
short private_symbol; /* const/func/pred/var symbol ID */
unsigned char arity; /* number of auguments */
Flatterm prev, next, end;
/* The rest of the fields are for index retrieval and demodulation. */
int size; /* symbol count */
struct discrim *alternative; /* subtree to try next */
int varnum_bound_to; /* -1 for not bound */
BOOL reduced_flag; /* fully demodulated */
};
/* End of public definitions */
/* Public function prototypes from flatterm.c */
Flatterm get_flatterm(void);
void fprint_flatterm_mem(FILE *fp, BOOL heading);
void p_flatterm_mem();
BOOL flatterm_ident(Flatterm a, Flatterm b);
void zap_flatterm(Flatterm f);
Flatterm term_to_flatterm(Term t);
Term flatterm_to_term(Flatterm f);
Flatterm copy_flatterm(Flatterm f);
void print_flatterm(Flatterm f);
int flatterm_symbol_count(Flatterm f);
void p_flatterm(Flatterm f);
BOOL flat_occurs_in(Flatterm t1, Flatterm t2);
I2list flat_multiset_vars(Flatterm f);
BOOL flat_variables_multisubset(Flatterm a, Flatterm b);
int flatterm_count_without_vars(Flatterm f);
#endif /* conditional compilation of whole file */
|