Menu

[r12]: / trunk / libtop_engine / kb_term_builder.cpp  Maximize  Restore  History

Download this file

92 lines (72 with data), 3.6 kB

 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
#include "kb_term_builder.h"
#include "kb_term_builder_internal.h"
namespace parser {
/////////////////////////////////////////////////////////////////////////////////////////
// create_binary_term
//
/////////////////////////////////////////////////////////////////////////////////////////
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rdf::index_type const& first, std::string const& oper, rdf::index_type const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rdf::index_type const& first, std::string const& oper, std::string const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rdf::index_type const& first, std::string const& oper, rule::knowledge_rule::xprsn_ptr_t const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, std::string const& first, std::string const& oper, rdf::index_type const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, std::string const& first, std::string const& oper, std::string const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, std::string const& first, std::string const& oper, rule::knowledge_rule::xprsn_ptr_t const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rule::knowledge_rule::xprsn_ptr_t const& first, std::string const& oper, rdf::index_type const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rule::knowledge_rule::xprsn_ptr_t const& first, std::string const& oper, std::string const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
rule::knowledge_rule::xprsn_ptr_t
create_binary_term(rule::knowledge_rule * rule_p, rule::knowledge_rule::xprsn_ptr_t const& first, std::string const& oper, rule::knowledge_rule::xprsn_ptr_t const& second)
{
return internal::create_binary_term_internal(rule_p, first, oper, second);
};
/////////////////////////////////////////////////////////////////////////////////////////
// create_unary_term
//
/////////////////////////////////////////////////////////////////////////////////////////
rule::knowledge_rule::xprsn_ptr_t
create_unary_term(rule::knowledge_rule * rule_p, std::string const& oper, rdf::index_type const& operant)
{
return internal::create_unary_term_internal(rule_p, oper, operant);
};
rule::knowledge_rule::xprsn_ptr_t
create_unary_term(rule::knowledge_rule * rule_p, std::string const& oper, std::string const& operant)
{
return internal::create_unary_term_internal(rule_p, oper, operant);
};
rule::knowledge_rule::xprsn_ptr_t
create_unary_term(rule::knowledge_rule * rule_p, std::string const& oper, rule::knowledge_rule::xprsn_ptr_t const& operant)
{
return internal::create_unary_term_internal(rule_p, oper, operant);
};
}; /* parser namespace */
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.