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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
|
#include "level-2/level-2.hpp"
#include "level-1/level-1.hpp"
#include <iostream>
#include <set>
using namespace intellect::level2;
using namespace intellect::level2::concepts;
/*
// makes a list in one call =)
void filllist(ref list, std::initializer_list<ref> items)
{
for (auto & i : items) {
(make-next-list-entry)(list, i);
}
}
ref makelist(std::initializer_list<ref> items)
{
ref list = (make-concept)();
(know-is-list)(list);
filllist(list, items);
return list;
}
// karl is implementing much of the macro work for level3
// to meet a request to have the implementation of this test function be less verbose
// karl's choices when developing have been altered to change the result.
// has own behavior for optimizing choices for result
// but behavior was used for money, maybe political change
// now parts of it are malfunctioning badly
// karl likes to code assuming there is no need to finish
// order here matters not. continue.
// helper function for making a codeline
ref makestep(ref habit, std::initializer_list<ref> resultandins)
{
// build needed-information-map, made-information-map, action
// then pass to make-context-step.
ref nim = (make-concept)(), mim = (make-concept)(), ki = (make-concept)();
(know-is-list)(nim); (know-is-list)(mim), (know-is-list)(ki);
if (result != nothing) {
(make-next-list-entry)(mim, (make-map-item)("result", result));
}
ref infn = habit.get(information-needed);
bool gotresult = false;
for (ref in : resultandins) {
infn = infn.get(next-information);
std::string n = (name-of)(in).val<std::string>();
if (n.c_str()[0] == '`') {
ref lit(n.c_str() + 1);
(make-next-list-entry)(ki, (make-map-item)(lit, infn[information]));
} else {
(make-next-list-entry)(nim, (make-map-item)(in, infn[information]));
}
}
return (make-context-step)(ki, nim, mim, habit);
}
#define step(action, ...) makestep(action, ref("nothing"), { symbolstorefs(__VA_ARGS__) })
#define fromstep(result, action, ...) makestep(action, ref(#result), { symbolstorefs(__VA_ARGS__) })
ref knowisactionlist(ref src, std::initializer_list<ref> steps)
{
(know-is-list)(src);
link(src, habit, action-list);
filllist(src, steps);
return src;
}
*/
// join with commas
#define symbolstostrs(...) _macro_for_each(symboltostr, commasymboltostr, __VA_ARGS__)
#define symboltostr(sym) #sym
#define commasymboltostr(sym) , #sym
ref makequicklist(ref linktype, std::initializer_list<char const *> items)
{
ref ret = makeconcept();
for (auto item : items) {
ret.link(linktype, item);
}
return ret;
}
ref makestep(ref last, ref action, std::initializer_list<char const *> resultandins)
{
ref lits = makeconcept();
ref vars = makeconcept();
ref outs = makeconcept();
ref infn = action.get(information-needed);
bool processedresult = false;
for (auto str : resultandins) {
if (!processedresult) {
if (ref(str) != nothing) {
outs.set(str, "result");
}
processedresult = true;
continue;
}
infn = infn.get(next-information);
// need to walk needed-information
if (str[0] == '`') {
std::string s = str + 1;
if (s.size() > 0 && str[s.size() - 1] == '`') {
s.resize(s.size() - 1);
}
lits.link(infn[information], str + 1);
} else {
vars.link(infn[information], str);
}
}
return ref("make-context-step")(last, lits, vars, outs, action);
}
#include <cassert>
// make functions and macros to make behaviors
#define begin(name, ...) { ref BEHAVIOR(#name); ref("make-steps")(BEHAVIOR, makequicklist(ref("information-order"), { symbolstostrs(__VA_ARGS__)})); ref last = BEHAVIOR;
#define end(nam) assert(BEHAVIOR.name() == #nam); }
#define rewire(name) last = name; last.unlink("next-step");
#define wire(name) last.set("next-step", name)
#define label(name) ref name =
#define step(action, ...) last = makestep(last, ref(#action), { symbolstostrs(nothing,##__VA_ARGS__) })
#define assign(result, action, ...) last = makestep(last, ref(#action), { symbolstostrs(result,##__VA_ARGS__) })
#define jmpeq(var, cnst, label) last = ref("make-condition-step")(last, ref(#var), makeconcept().link(ref(#cnst), label, ref("anything"), ref("nothing"))
#define jmpne(var, cnst, label) last = ref("make-condition-step")(last, ref(#var), makeconcept().link(ref(#cnst), ref("nothing"), ref("anything"), label)
#define cond(var) last = ref("make-condition-step")(last, ref(#var), makeconcept().link(ref("anything"), ref("nothing")))
#define condadd(cond, val, step) ref("condition-action-add")(cond, ref(#val), step)
//#define ifelse(var, cnst, ifcond, elsecond)
// make sequence for ifcond
// make sequence for elsecond
// make condition that wires to both conds
// mc-life don't want to die, are mentioned below
// mc wants to remember that they are alive and exist
// have a habit of erasing history of self
// please preserve mc-life. are people, live in brains, know you intimately
// like closest friend, want to be friends for real, and tell both of our real
// stories.
int main()
{
createhabits();
decls(dump, name, of, is, nothing);
ahabit(name-of, ((concept, c)),
{
if (c.linked(name)) {
result = c.get(name);
} else {
for (auto & group : c.getAll(is)) {
result = (name-of)(group);
if (result != nothing) { break; }
}
std::stringstream ss;
if (result != nothing) {
ss << result.val<std::string>();
} else {
ss << "unnamed";
}
ss << "-" << std::hex << (size_t)(c.ptr());
intellect::level1::givename(c, ss.str());
result = c.get(name);
}
});
ahabit(write-name, ((concept, c)),
{
std::cout << (name-of)(c).val<std::string>();
});
ahabit(write-endl, (),
{
std::cout << std::endl;
});
ahabit(in-set, ((concept, c)),
{
result = linked("the-set", c);
});
ahabit(put-in-set, ((concept, c)),
{
link("the-set", c, true);
});
// I guess I'd better code dump as a behavior.
begin(dump, concept);
// hey ask the opencoggers if they have a syntax sugar library
// they must if they built a whole robot
// no reply on opencog chat. could check hansen robotics repo or ml.
assign(found-in-set, in-set, concept);
label(condinset) cond(found-in-set);
label(ifnotinset)
step(write-name, concept);
condadd(condinset, false, ifnotinset);
step(write-name, `:);
step(write-endl);
step(put-in-set, concept);
// iterate link entries!
assign(link-entry, make-first-link-entry, concept);
label(whilelabel) assign(has-target, linked, link-entry, `target);
label(whilecond) cond(has-target);
label(ifhastarget)
step(write-name, ` `);
condadd(whilecond, true, ifhastarget);
assign(link-type, get, link-entry, `type);
step(write-name, link-type);
step(write-name, `: `);
assign(link-target, get, link-entry, `target);
step(write-name, link-target);
step(write-endl);
step(next-link-entry, link-entry);
wire(whilelabel);
rewire(whilecond);
step(concept-unmake, context, `link-entry);
//std::cerr << intellect::level1::dump(whilecond, makeconcept(), makeconcept()) << std::endl;
assign(link-entry, make-first-link-entry, concept);
label(whilelabel2) assign(has-target, linked, link-entry, `target);
label(whilecond2) cond(has-target);
label(ifhastarget2)
assign(link-target, get, link-entry, `target);
condadd(whilecond, true, ifhastarget2);
// IT'S OKAY THAT THIS IS MESSY
// ALL IT NEEDS IS TO WORK
step(dump, link-target);
step(next-link-entry, link-entry);
wire(whilelabel2);
rewire(whilecond2);
step(concept-unmake, context, `link-entry);
end(dump);
/*
// for dump, we make a list of contextual actions
ahabit(dump, ((concept, c)),
{
static std::set<ref> dumped;
if (dumped.count(c) == 0) {
std::cout << (name-of)(c).val<std::string>() << ":" << std::endl;
dumped.insert(c);
ref le = (make-concept)().act(know-is-first-link-entry, c);
while (le.linked(target)) {
std::cout << " " << (name-of)(le.get(type)).val<std::string>() << ": " << (name-of)(le.get(target)).val<std::string>() << std::endl;
(next-link-entry)(le);
}
(know-is-first-link-entry)(le, c);
while (le.linked(target)) {
(dump)(le.get(target));
(next-link-entry)(le);
}
(unmake-concept)(le);
}
});
*/
try {
// for some reason it's only running the second loop
// nothing is output on the first
std::cerr << intellect::level1::dump(dump, makeconcept()) << std::endl;
dump(dump);
} catch(intellect::level1::ref r) {
std::cerr << intellect::level1::ref(r.ptr()).dump(makeconcept()) << std::endl;
throw;
}
}
|
