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
|
#ifndef PL_H
#define PL_H
#include <windows.h>
#include <SWI-Prolog.h>
int PL_get_tchars(term_t, TCHAR **, int);
int Plx(const char *, const char *);
struct Query
{
Query(module_t ctx, predicate_t p, term_t t0);
~Query(void);
int Cut();
int Close();
int NextSolution();
private:
qid_t m_q;
};
/* Polymorphic aliases for PL_put_*, PL_get_*. */
inline int PlPut(term_t t, int x) { return PL_put_integer(t, x); }
inline int PlPut(term_t t, long x) { return PL_put_integer(t, x); }
inline int PlPut(term_t t, long long x) { return PL_put_integer(t, x); }
inline int PlPut(term_t t, atom_t x) { return PL_put_atom(t, x); }
inline int PlPut(term_t t, char *x) { return PL_put_atom(t, PL_new_atom(x)); }
inline int PlPut(term_t t, const char *x) { return PL_put_atom(t, PL_new_atom(x)); }
inline int PlPut(term_t t, int *x) { return -1; }
inline int PlPut(term_t t, long *x) { return -1; }
inline int PlPut(term_t t, long long *x) { return -1; }
inline int PlPut(term_t t, atom_t *x) { return -1; }
inline int PlPut(term_t t, char **x) { return -1; }
inline int PlGet(term_t t, int x) { return -1; }
inline int PlGet(term_t t, long x) { return -1; }
inline int PlGet(term_t t, long long x) { return -1; }
inline int PlGet(term_t t, atom_t x) { return -1; }
inline int PlGet(term_t t, char *x) { return -1; }
inline int PlGet(term_t t, const char *x) { return -1; }
inline int PlGet(term_t t, int *x) { return PL_get_integer(t, x); }
inline int PlGet(term_t t, long *x) { return PL_get_long(t, x); }
inline int PlGet(term_t t, long long *x) { return PL_get_int64(t, x); }
inline int PlGet(term_t t, atom_t *x) { return PL_get_atom(t, x); }
inline int PlGet(term_t t, char **x) { return PL_get_atom_chars(t, x); }
/* Helper templates for Plx, Pl. */
template <typename T>
int PlPutv(term_t t, T arg) { return PlPut(t, arg); }
template <typename T, typename ...R>
int PlPutv(term_t t, T arg, R... rest) { return PlPut(t, arg)? PlPutv(t+1, rest...): 0; }
template <typename T>
int PlGetv(term_t t, T arg) { return PlGet(t, arg); }
template <typename T, typename ...R>
int PlGetv(term_t t, T arg, R... rest) { return PlGet(t, arg)? PlGetv(t+1, rest...): 0; }
template <typename T>
int Countv(int i, T arg) { return i+1; }
template <typename T, typename ...R>
int Countv(int i, T arg, R... rest) { return Countv(i+1, rest...); }
/* Call Prolog predicate, propagating Prolog exceptions. */
template <typename ...T>
int Plx(const char *szMod, const char *szPred, T... args)
{
int iArity = Countv(0, args...);
term_t t = PL_new_term_refs(iArity);
if (!PlPutv(t, args...)) return 0;
Query q(NULL, PL_predicate(szPred, iArity, szMod), t);
if (!q.NextSolution()) return 0;
if (!PlGetv(t, args...)) return 0;
return 1;
}
/* Call Prolog predicate, ignoring Prolog exceptions. */
inline int Pl(const char *szMod, const char *szPred)
{
try {
return Plx(szMod, szPred);
} catch (term_t &t) {
return 0;
}
}
template <typename ...T>
int Pl(const char *szMod, const char *szPred, T... args)
{
try {
return Plx(szMod, szPred, args...);
} catch (term_t &t) {
return 0;
}
}
#endif
|